diff --git a/_build/html/.buildinfo b/.buildinfo
similarity index 100%
rename from _build/html/.buildinfo
rename to .buildinfo
diff --git a/.nojekyll b/.nojekyll
new file mode 100644
index 0000000..e69de29
diff --git a/docs/_build/html/01. Array Hashing/1. Two Sum.html b/01. Array Hashing/1. Two Sum.html
similarity index 91%
rename from docs/_build/html/01. Array Hashing/1. Two Sum.html
rename to 01. Array Hashing/1. Two Sum.html
index e4849aa..a95ac97 100644
--- a/docs/_build/html/01. Array Hashing/1. Two Sum.html	
+++ b/01. Array Hashing/1. Two Sum.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="128. Longest Consecutive Sequence" href="128.%20Longest%20Consecutive%20Sequence.html" />
-    <link rel="prev" title="Array &amp; Hashing Solutions - Blind 75 LeetCode Problems" href="README.html" />
+    <link rel="prev" title="Chapter 1: Array Hashing" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -630,12 +630,12 @@ <h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-spac
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</p>
+        <p class="prev-next-title">Chapter 1: Array Hashing</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/01. Array Hashing/128. Longest Consecutive Sequence.html b/01. Array Hashing/128. Longest Consecutive Sequence.html
similarity index 91%
rename from _build/html/01. Array Hashing/128. Longest Consecutive Sequence.html
rename to 01. Array Hashing/128. Longest Consecutive Sequence.html
index 85d82fb..f909eb0 100644
--- a/_build/html/01. Array Hashing/128. Longest Consecutive Sequence.html	
+++ b/01. Array Hashing/128. Longest Consecutive Sequence.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/01. Array Hashing/217. Contains Duplicate.html b/01. Array Hashing/217. Contains Duplicate.html
similarity index 91%
rename from docs/_build/html/01. Array Hashing/217. Contains Duplicate.html
rename to 01. Array Hashing/217. Contains Duplicate.html
index eb2c377..70a47e1 100644
--- a/docs/_build/html/01. Array Hashing/217. Contains Duplicate.html	
+++ b/01. Array Hashing/217. Contains Duplicate.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/01. Array Hashing/238. Product of Array Except Self.html b/01. Array Hashing/238. Product of Array Except Self.html
similarity index 92%
rename from docs/_build/html/01. Array Hashing/238. Product of Array Except Self.html
rename to 01. Array Hashing/238. Product of Array Except Self.html
index f0fb48f..86b597e 100644
--- a/docs/_build/html/01. Array Hashing/238. Product of Array Except Self.html	
+++ b/01. Array Hashing/238. Product of Array Except Self.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/01. Array Hashing/242. Valid Anagram.html b/01. Array Hashing/242. Valid Anagram.html
similarity index 92%
rename from _build/html/01. Array Hashing/242. Valid Anagram.html
rename to 01. Array Hashing/242. Valid Anagram.html
index 46ff851..75d1f01 100644
--- a/_build/html/01. Array Hashing/242. Valid Anagram.html	
+++ b/01. Array Hashing/242. Valid Anagram.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/01. Array Hashing/347. Top K Frequent Elements.html b/01. Array Hashing/347. Top K Frequent Elements.html
similarity index 92%
rename from _build/html/01. Array Hashing/347. Top K Frequent Elements.html
rename to 01. Array Hashing/347. Top K Frequent Elements.html
index 7cff15a..bbecb37 100644
--- a/_build/html/01. Array Hashing/347. Top K Frequent Elements.html	
+++ b/01. Array Hashing/347. Top K Frequent Elements.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/01. Array Hashing/49. Group Anagrams.html b/01. Array Hashing/49. Group Anagrams.html
similarity index 92%
rename from _build/html/01. Array Hashing/49. Group Anagrams.html
rename to 01. Array Hashing/49. Group Anagrams.html
index ab82f1c..799f114 100644
--- a/_build/html/01. Array Hashing/49. Group Anagrams.html	
+++ b/01. Array Hashing/49. Group Anagrams.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/01. Array Hashing/659. Encode and Decode Strings.html b/01. Array Hashing/659. Encode and Decode Strings.html
similarity index 91%
rename from docs/_build/html/01. Array Hashing/659. Encode and Decode Strings.html
rename to 01. Array Hashing/659. Encode and Decode Strings.html
index 64076e2..74cb54f 100644
--- a/docs/_build/html/01. Array Hashing/659. Encode and Decode Strings.html	
+++ b/01. Array Hashing/659. Encode and Decode Strings.html	
@@ -65,7 +65,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/659. Encode and Decode Strings';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Two Pointers Problems - Blind 75 LeetCode" href="../02.%20Two%20Pointers/README.html" />
+    <link rel="next" title="Introduction to Two Pointers Technique Challenges" href="../02.%20Two%20Pointers/intro.html" />
     <link rel="prev" title="49. Group Anagrams" href="49.%20Group%20Anagrams.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -644,11 +644,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../02.%20Two%20Pointers/README.html"
+       href="../02.%20Two%20Pointers/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Two Pointers Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Two Pointers Technique Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/01. Array Hashing/README.html b/01. Array Hashing/README.html
similarity index 86%
rename from docs/_build/html/01. Array Hashing/README.html
rename to 01. Array Hashing/README.html
index c394455..57f6ba9 100644
--- a/docs/_build/html/01. Array Hashing/README.html	
+++ b/01. Array Hashing/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="100: Same Tree" href="1.%20Two%20Sum.html" />
-    <link rel="prev" title="Blind 75 LeetCode Solutions" href="../README.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -515,8 +513,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -549,24 +545,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Solutions</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="1.%20Two%20Sum.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">100: Same Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/01. Array Hashing/README.html b/01. Array Hashing/intro.html
similarity index 74%
rename from _build/html/01. Array Hashing/README.html
rename to 01. Array Hashing/intro.html
index c394455..287de1b 100644
--- a/_build/html/01. Array Hashing/README.html	
+++ b/01. Array Hashing/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Array &amp; Hashing Solutions - Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Chapter 1: Array Hashing &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,11 +62,11 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="100: Same Tree" href="1.%20Two%20Sum.html" />
-    <link rel="prev" title="Blind 75 LeetCode Solutions" href="../README.html" />
+    <link rel="prev" title="Introduction: Navigating the Coding Cosmos" href="../intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Chapter 1: Array Hashing</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/01. Array Hashing/README.md" target="_blank"
+      <li><a href="../_sources/01. Array Hashing/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Array & Hashing Solutions - Blind 75 LeetCode Problems</h1>
+    <h1>Chapter 1: Array Hashing</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,10 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#introduction-to-array-hashing-challenges">Introduction to Array Hashing Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-array-hashing-terrain">Navigating the Array Hashing Terrain</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unlocking-pythonic-solutions">Unlocking Pythonic Solutions</a></li>
 </ul>
             </nav>
         </div>
@@ -466,53 +468,33 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="array-hashing-solutions-blind-75-leetcode-problems">
-<h1>Array &amp; Hashing Solutions - Blind 75 LeetCode Problems<a class="headerlink" href="#array-hashing-solutions-blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p><img alt="Array &amp; Hashing Solutions" src="https://img.shields.io/badge/Array_&amp;_Hashing_Solutions-blue" /><img alt="Blind 75 LeetCode" src="https://img.shields.io/badge/Blind_75_LeetCode-Problems-blue?labelColor=red" /></p>
-<p>This repository contains my solutions to Array &amp; Hashing Problems from Blind 75 LeetCode problems. I’ve organized the solutions by categories for easier navigation and reference. Each problem solution is presented in Jupyter Notebook format (<code class="docutils literal notranslate"><span class="pre">.ipynb</span></code>).</p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/217.%20Contains%20Duplicate.ipynb">217. Contains Duplicate</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/242.%20Valid%20Anagram.ipynb">242. Valid Anagram</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/1.%20Two%20Sum.ipynb">1. Two Sum</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/49.%20Group%20Anagrams.ipynb">49. Group Anagrams</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.ipynb">347. Top K Frequent Elements</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.ipynb">238. Product of Array Except Self</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.ipynb">659. Encode and Decode Strings</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.ipynb">128. Longest Consecutive Sequence</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="chapter-1-array-hashing">
+<h1>Chapter 1: Array Hashing<a class="headerlink" href="#chapter-1-array-hashing" title="Permalink to this heading">#</a></h1>
+<section id="introduction-to-array-hashing-challenges">
+<h2>Introduction to Array Hashing Challenges<a class="headerlink" href="#introduction-to-array-hashing-challenges" title="Permalink to this heading">#</a></h2>
+<p>Welcome to the Array Hashing section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we will explore a curated selection of LeetCode problems focused on array hashing, a powerful technique in algorithmic problem-solving.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="navigating-the-array-hashing-terrain">
+<h2>Navigating the Array Hashing Terrain<a class="headerlink" href="#navigating-the-array-hashing-terrain" title="Permalink to this heading">#</a></h2>
+<p>Array Hashing provides an efficient approach to solving a variety of problems by transforming complex operations into simpler ones through the use of hash functions. The challenges presented in this section will not only sharpen your skills in manipulating arrays but also introduce you to the art of hashing for optimized problem-solving.</p>
+</section>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Two Sum (Problem #1):</strong> Dive into the fundamentals of array manipulation by identifying pairs of elements that sum up to a target value.</p></li>
+<li><p><strong>Longest Consecutive Sequence (Problem #128):</strong> Explore the concept of consecutive elements in an array and devise an algorithm to find the longest sequence.</p></li>
+<li><p><strong>Contains Duplicate (Problem #217):</strong> Investigate the presence of duplicate elements in an array, a common scenario in coding interviews and real-world applications.</p></li>
+<li><p><strong>Product of Array Except Self (Problem #238):</strong> Master the technique of efficiently computing the product of every element in an array except itself.</p></li>
+<li><p><strong>Valid Anagram (Problem #242):</strong> Delve into string manipulation and explore efficient methods to determine if two strings are valid anagrams.</p></li>
+<li><p><strong>Top K Frequent Elements (Problem #347):</strong> Solve the challenge of identifying the top K frequent elements in an array using hash maps and priority queues.</p></li>
+<li><p><strong>Group Anagrams (Problem #49):</strong> Apply array hashing to categorize an array of strings into groups of anagrams, demonstrating the versatility of this technique.</p></li>
+<li><p><strong>Encode and Decode Strings (Problem #659):</strong> Uncover the intricacies of encoding and decoding strings, a problem that draws on array hashing for efficient solutions.</p></li>
+</ol>
+</section>
+<section id="unlocking-pythonic-solutions">
+<h2>Unlocking Pythonic Solutions<a class="headerlink" href="#unlocking-pythonic-solutions" title="Permalink to this heading">#</a></h2>
+<p>As we tackle each challenge, not only will we unravel the intricacies of array hashing, but we’ll also harness the power of Python to craft elegant and efficient solutions. Get ready to embark on a journey of problem-solving that will not only deepen your understanding of arrays and hashing but also enhance your coding skills in Python.</p>
+<p>Let the exploration of Array Hashing challenges begin!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -550,12 +532,12 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="../README.html"
+       href="../intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Solutions</p>
+        <p class="prev-next-title">Introduction: Navigating the Coding Cosmos</p>
       </div>
     </a>
     <a class="right-next"
@@ -582,8 +564,10 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#introduction-to-array-hashing-challenges">Introduction to Array Hashing Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-array-hashing-terrain">Navigating the Array Hashing Terrain</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unlocking-pythonic-solutions">Unlocking Pythonic Solutions</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/02. Two Pointers/11. Container With Most Water.html b/02. Two Pointers/11. Container With Most Water.html
similarity index 91%
rename from _build/html/02. Two Pointers/11. Container With Most Water.html
rename to 02. Two Pointers/11. Container With Most Water.html
index d158b88..a6e6302 100644
--- a/_build/html/02. Two Pointers/11. Container With Most Water.html	
+++ b/02. Two Pointers/11. Container With Most Water.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="125. Valid Palindrome" href="125.%20Valid%20Palindrome.html" />
-    <link rel="prev" title="Two Pointers Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Two Pointers Technique Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Two Pointers Technique Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -635,12 +635,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Two Pointers Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Two Pointers Technique Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/02. Two Pointers/125. Valid Palindrome.html b/02. Two Pointers/125. Valid Palindrome.html
similarity index 92%
rename from _build/html/02. Two Pointers/125. Valid Palindrome.html
rename to 02. Two Pointers/125. Valid Palindrome.html
index 419c392..5d36833 100644
--- a/_build/html/02. Two Pointers/125. Valid Palindrome.html	
+++ b/02. Two Pointers/125. Valid Palindrome.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Two Pointers Technique Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/02. Two Pointers/15. 3Sum.html b/02. Two Pointers/15. 3Sum.html
similarity index 92%
rename from docs/_build/html/02. Two Pointers/15. 3Sum.html
rename to 02. Two Pointers/15. 3Sum.html
index 09448fe..00d58c2 100644
--- a/docs/_build/html/02. Two Pointers/15. 3Sum.html	
+++ b/02. Two Pointers/15. 3Sum.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/15. 3Sum';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Sliding Window Problems - Blind 75 LeetCode" href="../03.%20Sliding%20Window/README.html" />
+    <link rel="next" title="Introduction to Sliding Window Challenges" href="../03.%20Sliding%20Window/intro.html" />
     <link rel="prev" title="125. Valid Palindrome" href="125.%20Valid%20Palindrome.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Two Pointers Technique Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -667,11 +667,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../03.%20Sliding%20Window/README.html"
+       href="../03.%20Sliding%20Window/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Sliding Window Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Sliding Window Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/02. Two Pointers/README.html b/02. Two Pointers/README.html
similarity index 85%
rename from docs/_build/html/02. Two Pointers/README.html
rename to 02. Two Pointers/README.html
index 81083c8..09e3359 100644
--- a/docs/_build/html/02. Two Pointers/README.html	
+++ b/02. Two Pointers/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="11. Container With Most Water" href="11.%20Container%20With%20Most%20Water.html" />
-    <link rel="prev" title="659· Encode and Decode Strings" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -498,8 +496,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -532,24 +528,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">659· Encode and Decode Strings</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="11.%20Container%20With%20Most%20Water.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">11. Container With Most Water</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/02. Two Pointers/README.html b/02. Two Pointers/intro.html
similarity index 77%
rename from _build/html/02. Two Pointers/README.html
rename to 02. Two Pointers/intro.html
index 81083c8..faf7b57 100644
--- a/_build/html/02. Two Pointers/README.html	
+++ b/02. Two Pointers/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Two Pointers Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Two Pointers Technique Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="11. Container With Most Water" href="11.%20Container%20With%20Most%20Water.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Two Pointers Technique Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F02. Two Pointers/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F02. Two Pointers/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/02. Two Pointers/README.md" target="_blank"
+      <li><a href="../_sources/02. Two Pointers/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Two Pointers Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Two Pointers Technique Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,9 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unleashing-the-efficiency-of-two-pointers">Unleashing the Efficiency of Two Pointers</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#exploring-the-challenges">Exploring the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#guiding-principles-and-pythonic-wisdom">Guiding Principles and Pythonic Wisdom</a></li>
 </ul>
             </nav>
         </div>
@@ -466,36 +467,26 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="two-pointers-problems-blind-75-leetcode">
-<h1>Two Pointers Problems - Blind 75 LeetCode<a class="headerlink" href="#two-pointers-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/valid-palindrome/">125. Valid Palindrome</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/3sum/">15. 3Sum</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/container-with-most-water/">11. Container With Most Water</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-two-pointers-technique-challenges">
+<h1>Introduction to Two Pointers Technique Challenges<a class="headerlink" href="#introduction-to-two-pointers-technique-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Two Pointers section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” The Two Pointers technique is a powerful strategy that enhances your ability to efficiently solve problems by maintaining two pointers that traverse a data structure, often an array or a linked list.</p>
+<section id="unleashing-the-efficiency-of-two-pointers">
+<h2>Unleashing the Efficiency of Two Pointers<a class="headerlink" href="#unleashing-the-efficiency-of-two-pointers" title="Permalink to this heading">#</a></h2>
+<p>The Two Pointers technique is a versatile approach known for its effectiveness in optimizing time and space complexity. As we delve into the challenges in this section, you’ll discover how to leverage this technique to navigate through arrays and efficiently address a variety of problems.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="exploring-the-challenges">
+<h2>Exploring the Challenges<a class="headerlink" href="#exploring-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Container With Most Water (Problem #11):</strong> Immerse yourself in the concept of maximizing the area between two vertical lines in a histogram, showcasing the elegance and efficiency of the Two Pointers technique.</p></li>
+<li><p><strong>Valid Palindrome (Problem #125):</strong> Explore the realm of string manipulation and learn how Two Pointers can be employed to determine whether a given string is a valid palindrome.</p></li>
+<li><p><strong>3Sum (Problem #15):</strong> Embark on a journey to find all unique triplets in an array that sum up to a target value, unraveling the complexities of Three Sum problems with the Two Pointers technique.</p></li>
+</ol>
+</section>
+<section id="guiding-principles-and-pythonic-wisdom">
+<h2>Guiding Principles and Pythonic Wisdom<a class="headerlink" href="#guiding-principles-and-pythonic-wisdom" title="Permalink to this heading">#</a></h2>
+<p>As we tackle each challenge, we’ll not only unravel the intricacies of the Two Pointers technique but also embrace Pythonic solutions that showcase the elegance and readability of Python code. Through practical examples and detailed explanations, you’ll gain a deep understanding of how to apply Two Pointers to real-world coding scenarios.</p>
+<p>Prepare to sharpen your problem-solving skills, enhance your algorithmic thinking, and master the art of using Two Pointers to tackle a diverse array of challenges.</p>
+<p>Let the exploration of Two Pointers challenges commence!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -565,8 +556,9 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unleashing-the-efficiency-of-two-pointers">Unleashing the Efficiency of Two Pointers</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#exploring-the-challenges">Exploring the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#guiding-principles-and-pythonic-wisdom">Guiding Principles and Pythonic Wisdom</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html b/03. Sliding Window/121. Best Time to Buy and Sell Stock.html
similarity index 90%
rename from _build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html
rename to 03. Sliding Window/121. Best Time to Buy and Sell Stock.html
index 0cdc75b..f241953 100644
--- a/_build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html	
+++ b/03. Sliding Window/121. Best Time to Buy and Sell Stock.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="3. Longest Substring Without Repeating Characters" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html" />
-    <link rel="prev" title="Sliding Window Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Sliding Window Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Sliding Window Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -619,12 +619,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Sliding Window Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Sliding Window Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/docs/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html b/03. Sliding Window/3. Longest Substring Without Repeating Characters.html
similarity index 91%
rename from docs/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html
rename to 03. Sliding Window/3. Longest Substring Without Repeating Characters.html
index 491b7ec..cc04da0 100644
--- a/docs/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html	
+++ b/03. Sliding Window/3. Longest Substring Without Repeating Characters.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Sliding Window Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html b/03. Sliding Window/424. Longest Repeating Character Replacement.html
similarity index 91%
rename from _build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html
rename to 03. Sliding Window/424. Longest Repeating Character Replacement.html
index 0c70660..5e703ae 100644
--- a/_build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html	
+++ b/03. Sliding Window/424. Longest Repeating Character Replacement.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Sliding Window Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/03. Sliding Window/76. Minimum Window Substring.html b/03. Sliding Window/76. Minimum Window Substring.html
similarity index 92%
rename from docs/_build/html/03. Sliding Window/76. Minimum Window Substring.html
rename to 03. Sliding Window/76. Minimum Window Substring.html
index 74efd3a..0080e12 100644
--- a/docs/_build/html/03. Sliding Window/76. Minimum Window Substring.html	
+++ b/03. Sliding Window/76. Minimum Window Substring.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/76. Minimum Window Substring';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Stack Problems - Blind 75 LeetCode" href="../04.%20Stack/README.html" />
+    <link rel="next" title="Introduction to Stack Challenges: Unveiling Valid Parentheses" href="../04.%20Stack/intro.html" />
     <link rel="prev" title="424. Longest Repeating Character Replacement" href="424.%20Longest%20Repeating%20Character%20Replacement.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Sliding Window Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -679,11 +679,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../04.%20Stack/README.html"
+       href="../04.%20Stack/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Stack Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Stack Challenges: Unveiling Valid Parentheses</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/_build/html/03. Sliding Window/README.html b/03. Sliding Window/README.html
similarity index 85%
rename from _build/html/03. Sliding Window/README.html
rename to 03. Sliding Window/README.html
index 7dcd69b..d1e0f1e 100644
--- a/_build/html/03. Sliding Window/README.html	
+++ b/03. Sliding Window/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="121. Best Time to Buy and Sell Stock" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html" />
-    <link rel="prev" title="15. 3Sum" href="../02.%20Two%20Pointers/15.%203Sum.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -501,8 +499,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -535,24 +531,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../02.%20Two%20Pointers/15.%203Sum.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">15. 3Sum</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">121. Best Time to Buy and Sell Stock</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/docs/_build/html/03. Sliding Window/README.html b/03. Sliding Window/intro.html
similarity index 76%
rename from docs/_build/html/03. Sliding Window/README.html
rename to 03. Sliding Window/intro.html
index 7dcd69b..bd1f7e1 100644
--- a/docs/_build/html/03. Sliding Window/README.html	
+++ b/03. Sliding Window/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Sliding Window Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Sliding Window Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="121. Best Time to Buy and Sell Stock" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Sliding Window Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/03. Sliding Window/README.md" target="_blank"
+      <li><a href="../_sources/03. Sliding Window/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Sliding Window Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Sliding Window Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,9 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-sliding-window-approach">Navigating the Sliding Window Approach</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-efficiency-unleashed">Pythonic Efficiency Unleashed</a></li>
 </ul>
             </nav>
         </div>
@@ -466,39 +467,26 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="sliding-window-problems-blind-75-leetcode">
-<h1>Sliding Window Problems - Blind 75 LeetCode<a class="headerlink" href="#sliding-window-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/">121. Best Time to Buy And Sell Stock</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">3. Longest Substring Without Repeating Characters</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-repeating-character-replacement/">424. Longest Repeating Character Replacement</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/minimum-window-substring/">76. Minimum Window Substring</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-sliding-window-challenges">
+<h1>Introduction to Sliding Window Challenges<a class="headerlink" href="#introduction-to-sliding-window-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Sliding Window section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this chapter, we will delve into the powerful technique of Sliding Window, a strategy designed to efficiently solve problems by maintaining a dynamic window over a sequence.</p>
+<section id="navigating-the-sliding-window-approach">
+<h2>Navigating the Sliding Window Approach<a class="headerlink" href="#navigating-the-sliding-window-approach" title="Permalink to this heading">#</a></h2>
+<p>The Sliding Window technique is particularly effective for tackling problems that involve arrays or strings by efficiently processing a continuous subarray or substring. As we navigate through the challenges in this section, you’ll witness how this approach optimizes both time and space complexity, making it an invaluable tool in your problem-solving arsenal.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Best Time to Buy and Sell Stock (Problem #121):</strong> Explore the dynamic world of stock prices and optimize your buying and selling strategy to maximize profit.</p></li>
+<li><p><strong>Longest Substring Without Repeating Characters (Problem #3):</strong> Dive into string manipulation as you discover the longest substring without any repeating characters using the Sliding Window technique.</p></li>
+<li><p><strong>Longest Repeating Character Replacement (Problem #424):</strong> Investigate the art of replacing characters in a string to create the longest substring with the same character, unveiling the versatility of the Sliding Window approach.</p></li>
+<li><p><strong>Minimum Window Substring (Problem #76):</strong> Tackle the challenge of finding the minimum window in a string that contains all characters of another string, showcasing the adaptability of Sliding Window for string-related problems.</p></li>
+</ol>
+</section>
+<section id="pythonic-efficiency-unleashed">
+<h2>Pythonic Efficiency Unleashed<a class="headerlink" href="#pythonic-efficiency-unleashed" title="Permalink to this heading">#</a></h2>
+<p>As we unravel each challenge, we’ll not only grasp the intricacies of the Sliding Window technique but also unleash the power of Python to implement elegant and efficient solutions. Get ready to witness how this dynamic approach can transform complex problems into manageable and optimized solutions.</p>
+<p>Let’s embark on the exploration of Sliding Window challenges, where dynamic problem-solving meets the efficiency of the sliding window!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -568,8 +556,9 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-sliding-window-approach">Navigating the Sliding Window Approach</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-efficiency-unleashed">Pythonic Efficiency Unleashed</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/04. Stack/20. Valid Parentheses.html b/04. Stack/20. Valid Parentheses.html
similarity index 90%
rename from _build/html/04. Stack/20. Valid Parentheses.html
rename to 04. Stack/20. Valid Parentheses.html
index f48f75e..9ddf95d 100644
--- a/_build/html/04. Stack/20. Valid Parentheses.html	
+++ b/04. Stack/20. Valid Parentheses.html	
@@ -67,8 +67,8 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '04. Stack/20. Valid Parentheses';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Binary search Problems - Blind 75 LeetCode" href="../05.%20Binary%20Search/README.html" />
-    <link rel="prev" title="Stack Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="next" title="Introduction to Binary Search Challenges" href="../05.%20Binary%20Search/intro.html" />
+    <link rel="prev" title="Introduction to Stack Challenges: Unveiling Valid Parentheses" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Stack Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -632,20 +632,20 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Stack Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Stack Challenges: Unveiling Valid Parentheses</p>
       </div>
     </a>
     <a class="right-next"
-       href="../05.%20Binary%20Search/README.html"
+       href="../05.%20Binary%20Search/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Binary search Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Binary Search Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/_build/html/04. Stack/README.html b/04. Stack/README.html
similarity index 85%
rename from _build/html/04. Stack/README.html
rename to 04. Stack/README.html
index 9289c25..aaabcc3 100644
--- a/_build/html/04. Stack/README.html	
+++ b/04. Stack/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '04. Stack/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="20. Valid Parentheses" href="20.%20Valid%20Parentheses.html" />
-    <link rel="prev" title="76. Minimum Window Substring" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Stack Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -492,8 +490,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -526,24 +522,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">76. Minimum Window Substring</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="20.%20Valid%20Parentheses.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">20. Valid Parentheses</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/docs/_build/html/04. Stack/README.html b/04. Stack/intro.html
similarity index 75%
rename from docs/_build/html/04. Stack/README.html
rename to 04. Stack/intro.html
index 9289c25..74702dd 100644
--- a/docs/_build/html/04. Stack/README.html	
+++ b/04. Stack/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Stack Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Stack Challenges: Unveiling Valid Parentheses &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '04. Stack/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '04. Stack/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="20. Valid Parentheses" href="20.%20Valid%20Parentheses.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Stack Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F04. Stack/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F04. Stack/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/04. Stack/README.md" target="_blank"
+      <li><a href="../_sources/04. Stack/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Stack Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Stack Challenges: Unveiling Valid Parentheses</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,10 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-stack-landscape">Navigating the Stack Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenge-valid-parentheses-problem-20">Unveiling the Challenge: Valid Parentheses (Problem #20)</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unlocking-the-valid-parentheses-challenge">Unlocking the Valid Parentheses Challenge</a></li>
 </ul>
             </nav>
         </div>
@@ -466,30 +468,29 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="stack-problems-blind-75-leetcode">
-<h1>Stack Problems - Blind 75 LeetCode<a class="headerlink" href="#stack-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/valid-parentheses/">20. Valid Parentheses</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-stack-challenges-unveiling-valid-parentheses">
+<h1>Introduction to Stack Challenges: Unveiling Valid Parentheses<a class="headerlink" href="#introduction-to-stack-challenges-unveiling-valid-parentheses" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Stack section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” This segment is dedicated to exploring the versatility and efficiency of the stack data structure, a fundamental tool in the arsenal of every proficient coder.</p>
+<section id="navigating-the-stack-landscape">
+<h2>Navigating the Stack Landscape<a class="headerlink" href="#navigating-the-stack-landscape" title="Permalink to this heading">#</a></h2>
+<p>In this journey, we will unravel the power of stacks, a data structure that follows the Last-In, First-Out (LIFO) principle. The challenges presented in this section will not only enhance your understanding of stacks but also showcase their applicability in solving a variety of real-world problems.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
+<section id="unveiling-the-challenge-valid-parentheses-problem-20">
+<h2>Unveiling the Challenge: Valid Parentheses (Problem #20)<a class="headerlink" href="#unveiling-the-challenge-valid-parentheses-problem-20" title="Permalink to this heading">#</a></h2>
+<p>Our focus for this section is on the “Valid Parentheses” problem. As you delve into this challenge, you’ll encounter a scenario commonly faced in coding interviews and real-world applications: determining the validity of a string containing various types of parentheses—curly braces, square brackets, and parentheses.</p>
+</section>
+<section id="what-to-expect">
+<h2>What to Expect<a class="headerlink" href="#what-to-expect" title="Permalink to this heading">#</a></h2>
 <ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
+<li><p><strong>Fundamental Stack Operations:</strong> Dive into the core operations of stacks, such as push and pop, to efficiently solve problems that involve nested structures.</p></li>
+<li><p><strong>Balancing Act:</strong> Explore the concept of balancing parentheses and how stacks provide an elegant solution to ensure the correct order of opening and closing brackets.</p></li>
+<li><p><strong>Pythonic Solutions:</strong> Leverage the strengths of Python to implement clean and concise code that showcases the simplicity and power of the stack data structure.</p></li>
 </ul>
+</section>
+<section id="unlocking-the-valid-parentheses-challenge">
+<h2>Unlocking the Valid Parentheses Challenge<a class="headerlink" href="#unlocking-the-valid-parentheses-challenge" title="Permalink to this heading">#</a></h2>
+<p>As we embark on the journey of solving the “Valid Parentheses” problem, you’ll not only gain a deeper understanding of stack operations but also witness how this seemingly simple data structure can be a robust tool for solving complex problems.</p>
+<p>Prepare to strengthen your foundation in stack-based problem-solving and discover the elegance of Pythonic solutions. Let’s unravel the mysteries of stacks together!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -559,8 +560,10 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-stack-landscape">Navigating the Stack Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenge-valid-parentheses-problem-20">Unveiling the Challenge: Valid Parentheses (Problem #20)</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unlocking-the-valid-parentheses-challenge">Unlocking the Valid Parentheses Challenge</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html b/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html
similarity index 91%
rename from _build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html
rename to 05. Binary Search/153. Find Minimum in Rotated Sorted Array.html
index d7545de..55da9bb 100644
--- a/_build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html	
+++ b/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="33. Search in Rotated Sorted Array" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html" />
-    <link rel="prev" title="Binary search Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Binary Search Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Binary Search Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -628,12 +628,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Binary search Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Binary Search Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/05. Binary Search/33. Search in Rotated Sorted Array.html b/05. Binary Search/33. Search in Rotated Sorted Array.html
similarity index 92%
rename from _build/html/05. Binary Search/33. Search in Rotated Sorted Array.html
rename to 05. Binary Search/33. Search in Rotated Sorted Array.html
index b778f6e..4380fcf 100644
--- a/_build/html/05. Binary Search/33. Search in Rotated Sorted Array.html	
+++ b/05. Binary Search/33. Search in Rotated Sorted Array.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/33. Search in Rotated Sorted Array';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Linked List Problems - Blind 75 LeetCode" href="../06.%20Linked%20List/README.html" />
+    <link rel="next" title="Introduction to Linked List Mastery" href="../06.%20Linked%20List/intro.html" />
     <link rel="prev" title="153. Find Minimum in Rotated Sorted Array" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Binary Search Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -657,11 +657,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../06.%20Linked%20List/README.html"
+       href="../06.%20Linked%20List/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Linked List Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Linked List Mastery</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/05. Binary Search/README.html b/05. Binary Search/README.html
similarity index 85%
rename from docs/_build/html/05. Binary Search/README.html
rename to 05. Binary Search/README.html
index 1e6e7ec..cb9a900 100644
--- a/docs/_build/html/05. Binary Search/README.html	
+++ b/05. Binary Search/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="153. Find Minimum in Rotated Sorted Array" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html" />
-    <link rel="prev" title="20. Valid Parentheses" href="../04.%20Stack/20.%20Valid%20Parentheses.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -495,8 +493,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -529,24 +525,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../04.%20Stack/20.%20Valid%20Parentheses.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">20. Valid Parentheses</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">153. Find Minimum in Rotated Sorted Array</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/05. Binary Search/README.html b/05. Binary Search/intro.html
similarity index 75%
rename from _build/html/05. Binary Search/README.html
rename to 05. Binary Search/intro.html
index 1e6e7ec..ac460a0 100644
--- a/_build/html/05. Binary Search/README.html	
+++ b/05. Binary Search/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Binary search Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Binary Search Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="153. Find Minimum in Rotated Sorted Array" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Binary Search Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F05. Binary Search/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F05. Binary Search/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/05. Binary Search/README.md" target="_blank"
+      <li><a href="../_sources/05. Binary Search/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Binary search Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Binary Search Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,12 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-binary-search-landscape">Navigating the Binary Search Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a><ul class="nav section-nav flex-column">
+<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-solutions-await">Pythonic Solutions Await</a></li>
+</ul>
+</li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
 </ul>
             </nav>
         </div>
@@ -466,33 +470,32 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="binary-search-problems-blind-75-leetcode">
-<h1>Binary search Problems - Blind 75 LeetCode<a class="headerlink" href="#binary-search-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/">153. Find Minimum In Rotated Sorted Array</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/search-in-rotated-sorted-array/">33. Search In Rotated Sorted Array</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-binary-search-challenges">
+<h1>Introduction to Binary Search Challenges<a class="headerlink" href="#introduction-to-binary-search-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Binary Search section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we’ll unravel the power of binary search, a fundamental algorithmic technique that is both elegant and efficient. The challenges presented here will sharpen your skills in applying binary search to unique problem scenarios.</p>
+<section id="navigating-the-binary-search-landscape">
+<h2>Navigating the Binary Search Landscape<a class="headerlink" href="#navigating-the-binary-search-landscape" title="Permalink to this heading">#</a></h2>
+<p>Binary search is a divide-and-conquer algorithm that plays a crucial role in solving problems efficiently, especially in scenarios where the input is sorted or can be manipulated to exhibit a sorted structure. As we delve into this section, we’ll explore the nuances of binary search through hands-on problem-solving.</p>
+</section>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Find Minimum in Rotated Sorted Array (Problem #153):</strong> Encounter the intricacies of searching for the minimum element in a rotated and sorted array. This challenge will test your ability to adapt binary search to unconventional data structures.</p></li>
+<li><p><strong>Search in Rotated Sorted Array (Problem #33):</strong> Embark on a journey to efficiently locate a target element in a rotated and sorted array. This problem showcases the versatility of binary search in scenarios beyond the traditional sorted arrays.</p></li>
+</ol>
+<section id="pythonic-solutions-await">
+<h3>Pythonic Solutions Await<a class="headerlink" href="#pythonic-solutions-await" title="Permalink to this heading">#</a></h3>
+<p>As we immerse ourselves in these challenges, the focus goes beyond mere problem-solving. We’ll leverage the Python programming language to craft elegant, readable, and efficient solutions. Each problem serves as a canvas for Pythonic coding techniques, showcasing how the language’s features can be harnessed for optimal algorithmic solutions.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
+</section>
+<section id="what-to-expect">
+<h2>What to Expect<a class="headerlink" href="#what-to-expect" title="Permalink to this heading">#</a></h2>
 <ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
+<li><p><strong>Algorithmic Mastery:</strong> Develop a deep understanding of binary search and its application in diverse problem scenarios.</p></li>
+<li><p><strong>Adaptability:</strong> Learn to adapt binary search to unconventional data structures, broadening your problem-solving toolkit.</p></li>
+<li><p><strong>Pythonic Coding:</strong> Immerse yourself in Pythonic coding practices, gaining insights into writing clean and effective code.</p></li>
 </ul>
+<p>Let the exploration of Binary Search challenges commence! Whether you’re a seasoned coder or just beginning your algorithmic journey, these challenges will provide a solid foundation in the art of binary search.</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -562,8 +565,12 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-binary-search-landscape">Navigating the Binary Search Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a><ul class="nav section-nav flex-column">
+<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-solutions-await">Pythonic Solutions Await</a></li>
+</ul>
+</li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/06. Linked List/141. Linked List Cycle.html b/06. Linked List/141. Linked List Cycle.html
similarity index 92%
rename from _build/html/06. Linked List/141. Linked List Cycle.html
rename to 06. Linked List/141. Linked List Cycle.html
index ddbdbff..fe6c0d9 100644
--- a/_build/html/06. Linked List/141. Linked List Cycle.html	
+++ b/06. Linked List/141. Linked List Cycle.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="143. Reorder List" href="143.%20Reorder%20List.html" />
-    <link rel="prev" title="Linked List Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Linked List Mastery" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -665,12 +665,12 @@ <h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Linked List Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Linked List Mastery</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/06. Linked List/143. Reorder List.html b/06. Linked List/143. Reorder List.html
similarity index 93%
rename from _build/html/06. Linked List/143. Reorder List.html
rename to 06. Linked List/143. Reorder List.html
index 3447be3..a0918a0 100644
--- a/_build/html/06. Linked List/143. Reorder List.html	
+++ b/06. Linked List/143. Reorder List.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/06. Linked List/19. Remove Nth Node From End of List.html b/06. Linked List/19. Remove Nth Node From End of List.html
similarity index 92%
rename from docs/_build/html/06. Linked List/19. Remove Nth Node From End of List.html
rename to 06. Linked List/19. Remove Nth Node From End of List.html
index 8a7a4df..a06c575 100644
--- a/docs/_build/html/06. Linked List/19. Remove Nth Node From End of List.html	
+++ b/06. Linked List/19. Remove Nth Node From End of List.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/06. Linked List/206. Reverse Linked List.html b/06. Linked List/206. Reverse Linked List.html
similarity index 93%
rename from _build/html/06. Linked List/206. Reverse Linked List.html
rename to 06. Linked List/206. Reverse Linked List.html
index a3b1e03..5bb79ae 100644
--- a/_build/html/06. Linked List/206. Reverse Linked List.html	
+++ b/06. Linked List/206. Reverse Linked List.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/06. Linked List/21. Merge Two Sorted Lists.html b/06. Linked List/21. Merge Two Sorted Lists.html
similarity index 92%
rename from _build/html/06. Linked List/21. Merge Two Sorted Lists.html
rename to 06. Linked List/21. Merge Two Sorted Lists.html
index d075160..9e59685 100644
--- a/_build/html/06. Linked List/21. Merge Two Sorted Lists.html	
+++ b/06. Linked List/21. Merge Two Sorted Lists.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/06. Linked List/23. Merge k Sorted Lists.html b/06. Linked List/23. Merge k Sorted Lists.html
similarity index 92%
rename from docs/_build/html/06. Linked List/23. Merge k Sorted Lists.html
rename to 06. Linked List/23. Merge k Sorted Lists.html
index d49d6f0..39fd0a6 100644
--- a/docs/_build/html/06. Linked List/23. Merge k Sorted Lists.html	
+++ b/06. Linked List/23. Merge k Sorted Lists.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/23. Merge k Sorted Lists';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Trees Problems - Blind 75 LeetCode" href="../07.%20Trees/README.html" />
+    <link rel="next" title="Introduction to Tree Challenges" href="../07.%20Trees/intro.html" />
     <link rel="prev" title="21. Merge Two Sorted Lists" href="21.%20Merge%20Two%20Sorted%20Lists.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -702,11 +702,11 @@ <h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this
       </div>
     </a>
     <a class="right-next"
-       href="../07.%20Trees/README.html"
+       href="../07.%20Trees/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Trees Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Tree Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/06. Linked List/README.html b/06. Linked List/README.html
similarity index 85%
rename from docs/_build/html/06. Linked List/README.html
rename to 06. Linked List/README.html
index f615d60..fc9e8cd 100644
--- a/docs/_build/html/06. Linked List/README.html	
+++ b/06. Linked List/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="141. Linked List Cycle" href="141.%20Linked%20List%20Cycle.html" />
-    <link rel="prev" title="33. Search in Rotated Sorted Array" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -507,8 +505,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -541,24 +537,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">33. Search in Rotated Sorted Array</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="141.%20Linked%20List%20Cycle.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">141. Linked List Cycle</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/06. Linked List/README.html b/06. Linked List/intro.html
similarity index 76%
rename from _build/html/06. Linked List/README.html
rename to 06. Linked List/intro.html
index f615d60..376b68b 100644
--- a/_build/html/06. Linked List/README.html	
+++ b/06. Linked List/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Linked List Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Linked List Mastery &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="141. Linked List Cycle" href="141.%20Linked%20List%20Cycle.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Linked List Mastery</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/06. Linked List/README.md" target="_blank"
+      <li><a href="../_sources/06. Linked List/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Linked List Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Linked List Mastery</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,9 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-linked-list-landscape">Navigating the Linked List Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-solutions-unleashed">Pythonic Solutions Unleashed</a></li>
 </ul>
             </nav>
         </div>
@@ -466,45 +467,29 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="linked-list-problems-blind-75-leetcode">
-<h1>Linked List Problems - Blind 75 LeetCode<a class="headerlink" href="#linked-list-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reverse-linked-list/">206. Reverse Linked List</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-two-sorted-lists/">21. Merge Two Sorted Lists</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reorder-list/">143. Reorder List</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/">19. Remove Nth Node From End of List</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/linked-list-cycle/">141. Linked List Cycle</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-k-sorted-lists/">23. Merge K Sorted Lists</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-linked-list-mastery">
+<h1>Introduction to Linked List Mastery<a class="headerlink" href="#introduction-to-linked-list-mastery" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Linked List section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we embark on a journey through the intricacies of linked lists — a fundamental data structure in computer science and a cornerstone of algorithmic problem-solving.</p>
+<section id="navigating-the-linked-list-landscape">
+<h2>Navigating the Linked List Landscape<a class="headerlink" href="#navigating-the-linked-list-landscape" title="Permalink to this heading">#</a></h2>
+<p>Linked lists offer a dynamic and flexible way to organize and manipulate data, making them a critical asset in the programmer’s toolkit. The challenges presented in this section are crafted to sharpen your understanding of linked list operations and empower you with the skills to tackle complex problems efficiently.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Linked List Cycle (Problem #141):</strong> Delve into the exploration of cycles within linked lists, a common challenge in detecting loops and optimizing algorithmic solutions.</p></li>
+<li><p><strong>Reorder List (Problem #143):</strong> Uncover the art of reordering linked list elements, an essential skill that finds applications in various real-world scenarios.</p></li>
+<li><p><strong>Remove Nth Node From End of List (Problem #19):</strong> Tackle the challenge of efficiently removing the nth node from the end of a linked list, mastering traversal and pointer manipulation.</p></li>
+<li><p><strong>Reverse Linked List (Problem #206):</strong> Explore the reversal of linked lists, a fundamental operation with applications in numerous algorithmic problems.</p></li>
+<li><p><strong>Merge Two Sorted Lists (Problem #21):</strong> Combine the power of linked list manipulation and sorting algorithms to merge two sorted lists into a single, ordered list.</p></li>
+<li><p><strong>Merge k Sorted Lists (Problem #23):</strong> Rise to the challenge of merging k sorted linked lists, showcasing your ability to handle complexity in data structures.</p></li>
+</ol>
+</section>
+<section id="pythonic-solutions-unleashed">
+<h2>Pythonic Solutions Unleashed<a class="headerlink" href="#pythonic-solutions-unleashed" title="Permalink to this heading">#</a></h2>
+<p>As we navigate through each challenge, we not only unravel the intricacies of linked list operations but also harness the expressive power of Python to create elegant and efficient solutions. Prepare to witness the marriage of algorithmic thinking and Pythonic coding in a seamless blend.</p>
+<p>Whether you are a coding enthusiast, a job seeker preparing for technical interviews, or a seasoned programmer seeking to deepen your understanding, the Linked List challenges in this section are designed to elevate your problem-solving skills to new heights.</p>
+<p>Let’s dive into the world of linked lists and master the art of problem-solving in Python!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -574,8 +559,9 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-linked-list-landscape">Navigating the Linked List Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-solutions-unleashed">Pythonic Solutions Unleashed</a></li>
 </ul>
   </nav></div>
 
diff --git a/docs/_build/html/07. Trees/100. Same Tree.html b/07. Trees/100. Same Tree.html
similarity index 91%
rename from docs/_build/html/07. Trees/100. Same Tree.html
rename to 07. Trees/100. Same Tree.html
index 66a8f9d..aa86dfe 100644
--- a/docs/_build/html/07. Trees/100. Same Tree.html	
+++ b/07. Trees/100. Same Tree.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="102. Binary Tree Level Order Traversal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html" />
-    <link rel="prev" title="Trees Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Tree Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -635,12 +635,12 @@ <h2>In summary:<a class="headerlink" href="#in-summary" title="Permalink to this
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Trees Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Tree Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/07. Trees/102. Binary Tree Level Order Traversal.html b/07. Trees/102. Binary Tree Level Order Traversal.html
similarity index 92%
rename from _build/html/07. Trees/102. Binary Tree Level Order Traversal.html
rename to 07. Trees/102. Binary Tree Level Order Traversal.html
index cd6a1fe..e6e559e 100644
--- a/_build/html/07. Trees/102. Binary Tree Level Order Traversal.html	
+++ b/07. Trees/102. Binary Tree Level Order Traversal.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html b/07. Trees/104. Maximum Depth of Binary Tree.html
similarity index 91%
rename from docs/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html
rename to 07. Trees/104. Maximum Depth of Binary Tree.html
index 37fcb2e..6377fe1 100644
--- a/docs/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html	
+++ b/07. Trees/104. Maximum Depth of Binary Tree.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html b/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html
similarity index 93%
rename from docs/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html
rename to 07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html
index cc9832c..3dabe21 100644
--- a/docs/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html	
+++ b/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/07. Trees/124. Binary Tree Maximum Path Sum.html b/07. Trees/124. Binary Tree Maximum Path Sum.html
similarity index 92%
rename from _build/html/07. Trees/124. Binary Tree Maximum Path Sum.html
rename to 07. Trees/124. Binary Tree Maximum Path Sum.html
index b77d871..276a21b 100644
--- a/_build/html/07. Trees/124. Binary Tree Maximum Path Sum.html	
+++ b/07. Trees/124. Binary Tree Maximum Path Sum.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/07. Trees/199. Binary Tree Right Side View.html b/07. Trees/199. Binary Tree Right Side View.html
similarity index 92%
rename from _build/html/07. Trees/199. Binary Tree Right Side View.html
rename to 07. Trees/199. Binary Tree Right Side View.html
index 278eeb0..cead65c 100644
--- a/_build/html/07. Trees/199. Binary Tree Right Side View.html	
+++ b/07. Trees/199. Binary Tree Right Side View.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/07. Trees/226. Invert Binary Tree.html b/07. Trees/226. Invert Binary Tree.html
similarity index 91%
rename from _build/html/07. Trees/226. Invert Binary Tree.html
rename to 07. Trees/226. Invert Binary Tree.html
index 8eda822..c818309 100644
--- a/_build/html/07. Trees/226. Invert Binary Tree.html	
+++ b/07. Trees/226. Invert Binary Tree.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -537,7 +537,7 @@ <h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 1): &lt;__main__.TreeNode object at 0x7faa5c445ab0&gt;
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 1): &lt;__main__.TreeNode object at 0x7f30502756c0&gt;
 </pre></div>
 </div>
 </div>
@@ -557,7 +557,7 @@ <h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 2): &lt;__main__.TreeNode object at 0x7faa5c444310&gt;
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 2): &lt;__main__.TreeNode object at 0x7f30502751b0&gt;
 </pre></div>
 </div>
 </div>
diff --git a/docs/_build/html/07. Trees/230. Kth Smallest Element in a BST.html b/07. Trees/230. Kth Smallest Element in a BST.html
similarity index 92%
rename from docs/_build/html/07. Trees/230. Kth Smallest Element in a BST.html
rename to 07. Trees/230. Kth Smallest Element in a BST.html
index fef5b0d..29f1521 100644
--- a/docs/_build/html/07. Trees/230. Kth Smallest Element in a BST.html	
+++ b/07. Trees/230. Kth Smallest Element in a BST.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html b/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html
similarity index 92%
rename from docs/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html
rename to 07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html
index 8098932..243f6d5 100644
--- a/docs/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html	
+++ b/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html b/07. Trees/297. Serialize and Deserialize Binary Tree.html
similarity index 93%
rename from docs/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html
rename to 07. Trees/297. Serialize and Deserialize Binary Tree.html
index 17b2bce..456fb0b 100644
--- a/docs/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html	
+++ b/07. Trees/297. Serialize and Deserialize Binary Tree.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/572. Subtree of Another Tree.html b/07. Trees/572. Subtree of Another Tree.html
similarity index 93%
rename from docs/_build/html/07. Trees/572. Subtree of Another Tree.html
rename to 07. Trees/572. Subtree of Another Tree.html
index eb976fe..79b5d8e 100644
--- a/docs/_build/html/07. Trees/572. Subtree of Another Tree.html	
+++ b/07. Trees/572. Subtree of Another Tree.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/07. Trees/98. Validate Binary Search Tree.html b/07. Trees/98. Validate Binary Search Tree.html
similarity index 91%
rename from docs/_build/html/07. Trees/98. Validate Binary Search Tree.html
rename to 07. Trees/98. Validate Binary Search Tree.html
index 0d90f35..9cdecc7 100644
--- a/docs/_build/html/07. Trees/98. Validate Binary Search Tree.html	
+++ b/07. Trees/98. Validate Binary Search Tree.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/98. Validate Binary Search Tree';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Trie Problems - Blind 75 LeetCode" href="../08.%20Tries/README.html" />
+    <link rel="next" title="Unveiling the Power of Tries: A Journey in Prefix Trees" href="../08.%20Tries/intro.html" />
     <link rel="prev" title="572: Subtree of Another Tree" href="572.%20Subtree%20of%20Another%20Tree.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -656,11 +656,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../08.%20Tries/README.html"
+       href="../08.%20Tries/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Trie Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Unveiling the Power of Tries: A Journey in Prefix Trees</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/07. Trees/README.html b/07. Trees/README.html
similarity index 86%
rename from docs/_build/html/07. Trees/README.html
rename to 07. Trees/README.html
index 1f27432..3fbc370 100644
--- a/docs/_build/html/07. Trees/README.html	
+++ b/07. Trees/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="100: Same Tree" href="100.%20Same%20Tree.html" />
-    <link rel="prev" title="23. Merge k Sorted Lists" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -522,8 +520,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -556,24 +552,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">23. Merge k Sorted Lists</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="100.%20Same%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">100: Same Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/07. Trees/README.html b/07. Trees/intro.html
similarity index 74%
rename from _build/html/07. Trees/README.html
rename to 07. Trees/intro.html
index 1f27432..7eb928d 100644
--- a/_build/html/07. Trees/README.html	
+++ b/07. Trees/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Trees Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Tree Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="100: Same Tree" href="100.%20Same%20Tree.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Tree Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/07. Trees/README.md" target="_blank"
+      <li><a href="../_sources/07. Trees/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Trees Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Tree Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,9 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-lush-canopy-of-challenges">Navigating the Lush Canopy of Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-arboreal-adventures">Unveiling the Arboreal Adventures</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-canopy-exploration">Pythonic Canopy Exploration</a></li>
 </ul>
             </nav>
         </div>
@@ -466,60 +467,34 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="trees-problems-blind-75-leetcode">
-<h1>Trees Problems - Blind 75 LeetCode<a class="headerlink" href="#trees-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/invert-binary-tree/">226. Invert Binary Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-depth-of-binary-tree/">104. Maximum Depth of Binary Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/same-tree/">100. Same Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/subtree-of-another-tree/">572. Subtree of Another Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/">235. Lowest Common Ancestor of a Binary Search Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/binary-tree-level-order-traversal/">102. Binary Tree Level Order Traversal</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/validate-binary-search-tree/">98. Validate Binary Search Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/kth-smallest-element-in-a-bst/">230. Kth Smallest Element In a BST</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/">105. Construct Binary Tree From Preorder And Inorder Traversal</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/binary-tree-maximum-path-sum/">124. Binary Tree Maximum Path Sum</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/serialize-and-deserialize-binary-tree/">297. Serialize And Deserialize Binary Tree</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-tree-challenges">
+<h1>Introduction to Tree Challenges<a class="headerlink" href="#introduction-to-tree-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Trees section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” This segment delves into the fascinating realm of trees, exploring a diverse set of problems that will deepen your understanding of tree structures and sharpen your skills in traversing and manipulating them.</p>
+<section id="navigating-the-lush-canopy-of-challenges">
+<h2>Navigating the Lush Canopy of Challenges<a class="headerlink" href="#navigating-the-lush-canopy-of-challenges" title="Permalink to this heading">#</a></h2>
+<p>Trees are a fundamental data structure in computer science, and their applications extend far and wide. The challenges in this section are designed to guide you through various aspects of tree manipulation, from basic operations to advanced traversal techniques and beyond.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="unveiling-the-arboreal-adventures">
+<h2>Unveiling the Arboreal Adventures<a class="headerlink" href="#unveiling-the-arboreal-adventures" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Same Tree (Problem #100):</strong> Compare two binary trees and determine if they are structurally identical.</p></li>
+<li><p><strong>Binary Tree Level Order Traversal (Problem #102):</strong> Embark on a journey through the levels of a binary tree, unraveling its secrets in an ordered traversal.</p></li>
+<li><p><strong>Maximum Depth of Binary Tree (Problem #104):</strong> Measure the depth of a binary tree, a fundamental metric in understanding its structure.</p></li>
+<li><p><strong>Construct Binary Tree from Preorder and Inorder Traversal (Problem #105):</strong> Unravel the puzzle of reconstructing a binary tree from its preorder and inorder traversals.</p></li>
+<li><p><strong>Binary Tree Maximum Path Sum (Problem #124):</strong> Navigate the complex web of paths in a binary tree and find the maximum sum achievable.</p></li>
+<li><p><strong>Binary Tree Right Side View (Problem #199):</strong> Gain a unique perspective on a binary tree by capturing the view from its right side.</p></li>
+<li><p><strong>Invert Binary Tree (Problem #226):</strong> Explore the transformative power of inverting a binary tree, changing its structure in a profound way.</p></li>
+<li><p><strong>Kth Smallest Element in a BST (Problem #230):</strong> Traverse a binary search tree to find the Kth smallest element, mastering the art of efficient search.</p></li>
+<li><p><strong>Lowest Common Ancestor of a Binary Search Tree (Problem #235):</strong> Discover the common ground in a binary search tree by finding the lowest common ancestor.</p></li>
+<li><p><strong>Serialize and Deserialize Binary Tree (Problem #297):</strong> Encode and decode the intricate structure of a binary tree for efficient storage and retrieval.</p></li>
+<li><p><strong>Subtree of Another Tree (Problem #572):</strong> Investigate whether one tree is a subtree of another, unveiling the subtleties of tree comparison.</p></li>
+<li><p><strong>Validate Binary Search Tree (Problem #98):</strong> Examine the properties of a binary tree to determine if it is a valid binary search tree.</p></li>
+</ol>
+</section>
+<section id="pythonic-canopy-exploration">
+<h2>Pythonic Canopy Exploration<a class="headerlink" href="#pythonic-canopy-exploration" title="Permalink to this heading">#</a></h2>
+<p>As we journey through these arboreal challenges, we’ll not only uncover the intricacies of tree structures and algorithms but also leverage the power of Python to craft elegant and efficient solutions. Get ready to traverse the lush canopy of tree challenges and elevate your problem-solving skills.</p>
+<p>Let the exploration of Tree challenges begin!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -589,8 +564,9 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-lush-canopy-of-challenges">Navigating the Lush Canopy of Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-arboreal-adventures">Unveiling the Arboreal Adventures</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-canopy-exploration">Pythonic Canopy Exploration</a></li>
 </ul>
   </nav></div>
 
diff --git a/docs/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html b/08. Tries/208. Implement Trie (Prefix Tree).html
similarity index 92%
rename from docs/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html
rename to 08. Tries/208. Implement Trie (Prefix Tree).html
index 24b2af0..c04c3c7 100644
--- a/docs/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html	
+++ b/08. Tries/208. Implement Trie (Prefix Tree).html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="211. Design Add and Search Words Data Structure" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html" />
-    <link rel="prev" title="Trie Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Unveiling the Power of Tries: A Journey in Prefix Trees" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -698,12 +698,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Trie Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Unveiling the Power of Tries: A Journey in Prefix Trees</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/docs/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html b/08. Tries/211. Design Add and Search Words Data Structure.html
similarity index 93%
rename from docs/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html
rename to 08. Tries/211. Design Add and Search Words Data Structure.html
index 395ec33..bb1a24f 100644
--- a/docs/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html	
+++ b/08. Tries/211. Design Add and Search Words Data Structure.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/08. Tries/212. Word Search II.html b/08. Tries/212. Word Search II.html
similarity index 92%
rename from _build/html/08. Tries/212. Word Search II.html
rename to 08. Tries/212. Word Search II.html
index c29a4c9..025cf8b 100644
--- a/_build/html/08. Tries/212. Word Search II.html	
+++ b/08. Tries/212. Word Search II.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/212. Word Search II';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Heap / Priority Queue Problems - Blind 75 LeetCode" href="../09.%20Heap%20-%20Priority%20Queue/README.html" />
+    <link rel="next" title="Unveiling the Power of Heaps and Priority Queues" href="../09.%20Heap%20-%20Priority%20Queue/intro.html" />
     <link rel="prev" title="211. Design Add and Search Words Data Structure" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -751,11 +751,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../09.%20Heap%20-%20Priority%20Queue/README.html"
+       href="../09.%20Heap%20-%20Priority%20Queue/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Heap / Priority Queue Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Unveiling the Power of Heaps and Priority Queues</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/_build/html/08. Tries/README.html b/08. Tries/README.html
similarity index 85%
rename from _build/html/08. Tries/README.html
rename to 08. Tries/README.html
index 329360f..b6d0828 100644
--- a/_build/html/08. Tries/README.html	
+++ b/08. Tries/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="208. Implement Trie (Prefix Tree)" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html" />
-    <link rel="prev" title="98. Validate Binary Search Tree" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -498,8 +496,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -532,24 +528,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">98. Validate Binary Search Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">208. Implement Trie (Prefix Tree)</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/docs/_build/html/08. Tries/README.html b/08. Tries/intro.html
similarity index 75%
rename from docs/_build/html/08. Tries/README.html
rename to 08. Tries/intro.html
index 329360f..2e996c1 100644
--- a/docs/_build/html/08. Tries/README.html	
+++ b/08. Tries/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Trie Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Unveiling the Power of Tries: A Journey in Prefix Trees &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="208. Implement Trie (Prefix Tree)" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F08. Tries/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F08. Tries/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/08. Tries/README.md" target="_blank"
+      <li><a href="../_sources/08. Tries/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Trie Problems - Blind 75 LeetCode</h1>
+    <h1>Unveiling the Power of Tries: A Journey in Prefix Trees</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,10 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#understanding-the-essence-of-tries">Understanding the Essence of Tries</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-chapters">Navigating the Chapters</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-wisdom-unleashed">Pythonic Wisdom Unleashed</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#your-journey-begins">Your Journey Begins</a></li>
 </ul>
             </nav>
         </div>
@@ -466,36 +468,29 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="trie-problems-blind-75-leetcode">
-<h1>Trie Problems - Blind 75 LeetCode<a class="headerlink" href="#trie-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/implement-trie-prefix-tree/">208. Implement Trie Prefix Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/design-add-and-search-words-data-structure/">211. Design Add And Search Words Data Structure</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/word-search-ii/">212. Word Search II</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="unveiling-the-power-of-tries-a-journey-in-prefix-trees">
+<h1>Unveiling the Power of Tries: A Journey in Prefix Trees<a class="headerlink" href="#unveiling-the-power-of-tries-a-journey-in-prefix-trees" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Tries section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we embark on a fascinating exploration of Tries, also known as Prefix Trees, a powerful data structure that excels in handling strings and words.</p>
+<section id="understanding-the-essence-of-tries">
+<h2>Understanding the Essence of Tries<a class="headerlink" href="#understanding-the-essence-of-tries" title="Permalink to this heading">#</a></h2>
+<p>Tries stand as a testament to the elegance of data structure design, particularly when it comes to storing and retrieving words efficiently. This section delves into the intricacies of Tries, unraveling their structure and demonstrating their application in various problem-solving scenarios.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="navigating-the-chapters">
+<h2>Navigating the Chapters<a class="headerlink" href="#navigating-the-chapters" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Implement Trie (Prefix Tree) (Problem #208):</strong> Lay the foundation by mastering the implementation of a Trie, a versatile data structure that stores a dynamic set of strings, making it an invaluable tool in a coder’s arsenal.</p></li>
+<li><p><strong>Design Add and Search Words Data Structure (Problem #211):</strong> Explore the versatility of Tries in designing a data structure that supports the addition and search of words with the flexibility to handle wildcard characters.</p></li>
+<li><p><strong>Word Search II (Problem #212):</strong> Elevate your problem-solving skills as we tackle a more advanced challenge involving Tries, where we embark on a word search adventure through a 2D board.</p></li>
+</ol>
+</section>
+<section id="pythonic-wisdom-unleashed">
+<h2>Pythonic Wisdom Unleashed<a class="headerlink" href="#pythonic-wisdom-unleashed" title="Permalink to this heading">#</a></h2>
+<p>Throughout our journey, Python will be our trusty companion. We’ll leverage the expressive nature of the language to craft elegant and efficient solutions to the challenges posed by Tries. Whether you are new to Tries or seeking to deepen your understanding, this section provides a comprehensive guide to mastering this fundamental data structure.</p>
+</section>
+<section id="your-journey-begins">
+<h2>Your Journey Begins<a class="headerlink" href="#your-journey-begins" title="Permalink to this heading">#</a></h2>
+<p>Get ready to traverse the nodes and edges of Tries, exploring their potential in solving a diverse range of problems. As we unravel each challenge, you’ll not only enhance your problem-solving prowess but also gain a deeper appreciation for the beauty of Tries.</p>
+<p>Let the exploration of Tries commence!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -565,8 +560,10 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#understanding-the-essence-of-tries">Understanding the Essence of Tries</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-chapters">Navigating the Chapters</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-wisdom-unleashed">Pythonic Wisdom Unleashed</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#your-journey-begins">Your Journey Begins</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html b/09. Heap - Priority Queue/1046. Last Stone Weight.html
similarity index 92%
rename from _build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html
rename to 09. Heap - Priority Queue/1046. Last Stone Weight.html
index ae83555..1ead893 100644
--- a/_build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html	
+++ b/09. Heap - Priority Queue/1046. Last Stone Weight.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="295. Find Median from Data Stream" href="295.%20Find%20Median%20from%20Data%20Stream.html" />
-    <link rel="prev" title="Heap / Priority Queue Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Unveiling the Power of Heaps and Priority Queues" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Heaps and Priority Queues</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -669,12 +669,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Heap / Priority Queue Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Unveiling the Power of Heaps and Priority Queues</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html b/09. Heap - Priority Queue/295. Find Median from Data Stream.html
similarity index 92%
rename from _build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html
rename to 09. Heap - Priority Queue/295. Find Median from Data Stream.html
index c8fe5a3..65fc938 100644
--- a/_build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html	
+++ b/09. Heap - Priority Queue/295. Find Median from Data Stream.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Heaps and Priority Queues</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html b/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html
similarity index 92%
rename from _build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html
rename to 09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html
index a31cb11..7c1eacf 100644
--- a/_build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html	
+++ b/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/703. Kth Largest Element in a Stream';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Backtracking Problems - Blind 75 LeetCode" href="../10.%20Backtracking/README.html" />
+    <link rel="next" title="Introduction to Backtracking Challenges" href="../10.%20Backtracking/intro.html" />
     <link rel="prev" title="295. Find Median from Data Stream" href="295.%20Find%20Median%20from%20Data%20Stream.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Heaps and Priority Queues</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -685,11 +685,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../10.%20Backtracking/README.html"
+       href="../10.%20Backtracking/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Backtracking Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Backtracking Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/09. Heap - Priority Queue/README.html b/09. Heap - Priority Queue/README.html
similarity index 85%
rename from docs/_build/html/09. Heap - Priority Queue/README.html
rename to 09. Heap - Priority Queue/README.html
index 0f7b22b..0c3022e 100644
--- a/docs/_build/html/09. Heap - Priority Queue/README.html	
+++ b/09. Heap - Priority Queue/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="1046. Last Stone Weight" href="1046.%20Last%20Stone%20Weight.html" />
-    <link rel="prev" title="212. Word Search II" href="../08.%20Tries/212.%20Word%20Search%20II.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -498,8 +496,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -532,24 +528,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../08.%20Tries/212.%20Word%20Search%20II.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">212. Word Search II</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="1046.%20Last%20Stone%20Weight.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">1046. Last Stone Weight</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/09. Heap - Priority Queue/README.html b/09. Heap - Priority Queue/intro.html
similarity index 75%
rename from _build/html/09. Heap - Priority Queue/README.html
rename to 09. Heap - Priority Queue/intro.html
index 0f7b22b..111f8ce 100644
--- a/_build/html/09. Heap - Priority Queue/README.html	
+++ b/09. Heap - Priority Queue/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Heap / Priority Queue Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Unveiling the Power of Heaps and Priority Queues &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="1046. Last Stone Weight" href="1046.%20Last%20Stone%20Weight.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Unveiling the Power of Heaps and Priority Queues</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F09. Heap - Priority Queue/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F09. Heap - Priority Queue/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/09. Heap - Priority Queue/README.md" target="_blank"
+      <li><a href="../_sources/09. Heap - Priority Queue/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Heap / Priority Queue Problems - Blind 75 LeetCode</h1>
+    <h1>Unveiling the Power of Heaps and Priority Queues</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,10 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-heap-landscape">Navigating the Heap Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-mastery">Pythonic Mastery</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
 </ul>
             </nav>
         </div>
@@ -466,36 +468,33 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="heap-priority-queue-problems-blind-75-leetcode">
-<h1>Heap / Priority Queue Problems - Blind 75 LeetCode<a class="headerlink" href="#heap-priority-queue-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/kth-largest-element-in-a-stream/">703. Kth Largest Element in a Stream</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/last-stone-weight/">1046. Last Stone Weight</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/find-median-from-data-stream/">295. Find Median From Data Stream</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="unveiling-the-power-of-heaps-and-priority-queues">
+<h1>Unveiling the Power of Heaps and Priority Queues<a class="headerlink" href="#unveiling-the-power-of-heaps-and-priority-queues" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Heap and Priority Queue section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this chapter, we will delve into the world of heaps and priority queues—a realm where efficient data manipulation and retrieval are key.</p>
+<section id="navigating-the-heap-landscape">
+<h2>Navigating the Heap Landscape<a class="headerlink" href="#navigating-the-heap-landscape" title="Permalink to this heading">#</a></h2>
+<p>Heaps and Priority Queues play a pivotal role in algorithmic problem-solving, providing swift solutions to problems that involve maintaining a dynamic set of elements with varying priorities. This section introduces you to the fundamental concepts and challenges associated with heaps, guiding you through their application in real-world scenarios.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Last Stone Weight (Problem #1046):</strong> Dive into the dynamic world of stone smashing, where a priority queue becomes the tool of choice for determining the last remaining stone’s weight.</p></li>
+<li><p><strong>Find Median from Data Stream (Problem #295):</strong> Explore the intricacies of streaming data and discover how heaps facilitate the efficient calculation of medians in real-time.</p></li>
+<li><p><strong>Kth Largest Element in a Stream (Problem #703):</strong> Uncover the power of heaps in maintaining and updating a dynamic stream of elements, efficiently identifying the Kth largest element.</p></li>
+</ol>
+</section>
+<section id="pythonic-mastery">
+<h2>Pythonic Mastery<a class="headerlink" href="#pythonic-mastery" title="Permalink to this heading">#</a></h2>
+<p>As we journey through each challenge, we will not only unravel the intricacies of heaps and priority queues but also wield the elegance of Python to craft solutions that are both efficient and readable. From understanding heap operations to mastering priority queue nuances, this section is designed to sharpen your problem-solving skills in Python.</p>
+</section>
+<section id="what-to-expect">
+<h2>What to Expect<a class="headerlink" href="#what-to-expect" title="Permalink to this heading">#</a></h2>
 <ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
+<li><p><strong>Foundational Concepts:</strong> Grasp the core principles of heaps and priority queues, laying the groundwork for efficient algorithmic solutions.</p></li>
+<li><p><strong>Real-world Applications:</strong> Explore challenges that mirror scenarios in which heaps excel, from dynamic data streams to problem domains requiring prioritized element retrieval.</p></li>
+<li><p><strong>Pythonic Elegance:</strong> Learn to implement solutions that leverage Python’s strengths, making your code not only functional but also a pleasure to read and maintain.</p></li>
 </ul>
+<p>Join us on this exploration of Heap and Priority Queue challenges, where efficiency meets elegance, and Python becomes your ally in conquering the complexities of algorithmic problem-solving.</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -565,8 +564,10 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-heap-landscape">Navigating the Heap Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-mastery">Pythonic Mastery</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-to-expect">What to Expect</a></li>
 </ul>
   </nav></div>
 
diff --git a/_build/html/10. Backtracking/39. Combination Sum.html b/10. Backtracking/39. Combination Sum.html
similarity index 92%
rename from _build/html/10. Backtracking/39. Combination Sum.html
rename to 10. Backtracking/39. Combination Sum.html
index c20daec..b61c741 100644
--- a/_build/html/10. Backtracking/39. Combination Sum.html	
+++ b/10. Backtracking/39. Combination Sum.html	
@@ -68,7 +68,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="79. Word Search" href="79.%20Word%20Search.html" />
-    <link rel="prev" title="Backtracking Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Backtracking Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Backtracking Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -679,12 +679,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Backtracking Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Backtracking Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/10. Backtracking/79. Word Search.html b/10. Backtracking/79. Word Search.html
similarity index 93%
rename from _build/html/10. Backtracking/79. Word Search.html
rename to 10. Backtracking/79. Word Search.html
index 47447c7..146b1c7 100644
--- a/_build/html/10. Backtracking/79. Word Search.html	
+++ b/10. Backtracking/79. Word Search.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/79. Word Search';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Graphs Problems - Blind 75 LeetCode" href="../11.%20Graphs/README.html" />
+    <link rel="next" title="Introduction to Graph Challenges" href="../11.%20Graphs/intro.html" />
     <link rel="prev" title="39. Combination Sum" href="39.%20Combination%20Sum.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Backtracking Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -715,11 +715,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../11.%20Graphs/README.html"
+       href="../11.%20Graphs/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Graphs Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Graph Challenges</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/docs/_build/html/10. Backtracking/README.html b/10. Backtracking/README.html
similarity index 84%
rename from docs/_build/html/10. Backtracking/README.html
rename to 10. Backtracking/README.html
index ae289fb..f2a32e6 100644
--- a/docs/_build/html/10. Backtracking/README.html	
+++ b/10. Backtracking/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="39. Combination Sum" href="39.%20Combination%20Sum.html" />
-    <link rel="prev" title="703. Kth Largest Element in a Stream" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -495,8 +493,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -529,24 +525,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">703. Kth Largest Element in a Stream</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="39.%20Combination%20Sum.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">39. Combination Sum</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/10. Backtracking/README.html b/10. Backtracking/intro.html
similarity index 74%
rename from _build/html/10. Backtracking/README.html
rename to 10. Backtracking/intro.html
index ae289fb..8873d0e 100644
--- a/_build/html/10. Backtracking/README.html	
+++ b/10. Backtracking/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Backtracking Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Backtracking Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="39. Combination Sum" href="39.%20Combination%20Sum.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Backtracking Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F10. Backtracking/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F10. Backtracking/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/10. Backtracking/README.md" target="_blank"
+      <li><a href="../_sources/10. Backtracking/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Backtracking Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Backtracking Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,13 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unraveling-the-backtracking-paradigm">Unraveling the Backtracking Paradigm</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#discover-the-challenges">Discover the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-readme">Navigating the README</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-problem-solving">Pythonic Problem-Solving</a><ul class="nav section-nav flex-column">
+<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#let-the-backtracking-journey-begin">Let the Backtracking Journey Begin</a></li>
+</ul>
+</li>
 </ul>
             </nav>
         </div>
@@ -466,35 +471,33 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="backtracking-problems-blind-75-leetcode">
-<h1>Backtracking Problems - Blind 75 LeetCode<a class="headerlink" href="#backtracking-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/combination-sum/">39. Combination Sum</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/word-search/">79. Word Search</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-backtracking-challenges">
+<h1>Introduction to Backtracking Challenges<a class="headerlink" href="#introduction-to-backtracking-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Backtracking section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” Backtracking is a powerful technique employed in algorithmic problem-solving, enabling us to explore and find solutions to combinatorial problems efficiently.</p>
+<section id="unraveling-the-backtracking-paradigm">
+<h2>Unraveling the Backtracking Paradigm<a class="headerlink" href="#unraveling-the-backtracking-paradigm" title="Permalink to this heading">#</a></h2>
+<p>Backtracking is a systematic way of searching through all possible solutions to a problem and systematically discarding those that do not satisfy the problem constraints. In this section, we will delve into the intricacies of backtracking and apply it to two fascinating challenges.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="discover-the-challenges">
+<h2>Discover the Challenges<a class="headerlink" href="#discover-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Combination Sum (Problem #39):</strong> Explore the world of combinations as we navigate through the possibilities of summing up to a target value. This challenge will sharpen your ability to generate combinations and filter out the valid ones.</p></li>
+<li><p><strong>Word Search (Problem #79):</strong> Embark on a journey through a grid of letters, uncovering words hidden within. This challenge not only tests your backtracking skills but also introduces you to the realm of searching for words efficiently.</p></li>
+</ol>
+</section>
+<section id="navigating-the-readme">
+<h2>Navigating the README<a class="headerlink" href="#navigating-the-readme" title="Permalink to this heading">#</a></h2>
+<p>Before we dive into the challenges, take a moment to explore the README file. It serves as a guide, offering insights into the core concepts of backtracking, tips for approaching related problems, and Pythonic solutions for a better understanding.</p>
+</section>
+<section id="pythonic-problem-solving">
+<h2>Pythonic Problem-Solving<a class="headerlink" href="#pythonic-problem-solving" title="Permalink to this heading">#</a></h2>
+<p>As we venture through each challenge, we’ll not only unravel the mysteries of backtracking but also leverage the capabilities of Python to create elegant, concise, and efficient solutions. Get ready to enhance your problem-solving toolkit and deepen your appreciation for the versatility of backtracking.</p>
+<section id="let-the-backtracking-journey-begin">
+<h3>Let the Backtracking Journey Begin<a class="headerlink" href="#let-the-backtracking-journey-begin" title="Permalink to this heading">#</a></h3>
+<p>Are you ready to navigate the intricacies of backtracking and unlock solutions to challenging problems? Grab your Python interpreter, open your code editor, and let’s embark on a hands-on journey through the Backtracking challenges.</p>
 <p>Happy coding!</p>
 </section>
+</section>
 <div class="toctree-wrapper compound">
 </div>
 </section>
@@ -562,8 +565,13 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unraveling-the-backtracking-paradigm">Unraveling the Backtracking Paradigm</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#discover-the-challenges">Discover the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-readme">Navigating the README</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-problem-solving">Pythonic Problem-Solving</a><ul class="nav section-nav flex-column">
+<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#let-the-backtracking-journey-begin">Let the Backtracking Journey Begin</a></li>
+</ul>
+</li>
 </ul>
   </nav></div>
 
diff --git a/docs/_build/html/11. Graphs/133. Clone Graph.html b/11. Graphs/133. Clone Graph.html
similarity index 93%
rename from docs/_build/html/11. Graphs/133. Clone Graph.html
rename to 11. Graphs/133. Clone Graph.html
index fa3d704..e83a7d8 100644
--- a/docs/_build/html/11. Graphs/133. Clone Graph.html	
+++ b/11. Graphs/133. Clone Graph.html	
@@ -66,7 +66,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="178. Graph Valid Tree" href="178.%20Graph%20Valid%20Tree.html" />
-    <link rel="prev" title="Graphs Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Graph Challenges" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -717,12 +717,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Graphs Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Graph Challenges</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/11. Graphs/178. Graph Valid Tree.html b/11. Graphs/178. Graph Valid Tree.html
similarity index 92%
rename from _build/html/11. Graphs/178. Graph Valid Tree.html
rename to 11. Graphs/178. Graph Valid Tree.html
index b80a6d9..660e262 100644
--- a/_build/html/11. Graphs/178. Graph Valid Tree.html	
+++ b/11. Graphs/178. Graph Valid Tree.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/11. Graphs/200. Number of Islands.html b/11. Graphs/200. Number of Islands.html
similarity index 92%
rename from _build/html/11. Graphs/200. Number of Islands.html
rename to 11. Graphs/200. Number of Islands.html
index 02fafc9..aa4f40a 100644
--- a/_build/html/11. Graphs/200. Number of Islands.html	
+++ b/11. Graphs/200. Number of Islands.html	
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/11. Graphs/207. Course Schedule.html b/11. Graphs/207. Course Schedule.html
similarity index 92%
rename from _build/html/11. Graphs/207. Course Schedule.html
rename to 11. Graphs/207. Course Schedule.html
index e47cc04..b5ccc99 100644
--- a/_build/html/11. Graphs/207. Course Schedule.html	
+++ b/11. Graphs/207. Course Schedule.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html b/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html
similarity index 92%
rename from _build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html
rename to 11. Graphs/3651. Number of Connected Components in an Undirected Graph.html
index 09c6f64..a0b7ff2 100644
--- a/_build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html	
+++ b/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/11. Graphs/417. Pacific Atlantic Water Flow.html b/11. Graphs/417. Pacific Atlantic Water Flow.html
similarity index 92%
rename from _build/html/11. Graphs/417. Pacific Atlantic Water Flow.html
rename to 11. Graphs/417. Pacific Atlantic Water Flow.html
index ad7b711..8ea937f 100644
--- a/_build/html/11. Graphs/417. Pacific Atlantic Water Flow.html	
+++ b/11. Graphs/417. Pacific Atlantic Water Flow.html	
@@ -67,7 +67,7 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/417. Pacific Atlantic Water Flow';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Advanced Graphs Problems - Blind 75 LeetCode" href="../12.%20Advanced%20Graphs/README.html" />
+    <link rel="next" title="Introduction to Advanced Graphs: Navigating the Alien Dictionary" href="../12.%20Advanced%20Graphs/intro.html" />
     <link rel="prev" title="3651. Number of Connected Components in an Undirected Graph" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
@@ -143,7 +143,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -158,13 +158,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -175,29 +175,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -206,7 +206,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -221,24 +221,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -247,7 +247,7 @@
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -672,11 +672,11 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
       </div>
     </a>
     <a class="right-next"
-       href="../12.%20Advanced%20Graphs/README.html"
+       href="../12.%20Advanced%20Graphs/intro.html"
        title="next page">
       <div class="prev-next-info">
         <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Advanced Graphs Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Advanced Graphs: Navigating the Alien Dictionary</p>
       </div>
       <i class="fa-solid fa-angle-right"></i>
     </a>
diff --git a/_build/html/11. Graphs/README.html b/11. Graphs/README.html
similarity index 85%
rename from _build/html/11. Graphs/README.html
rename to 11. Graphs/README.html
index fa61914..d2c42e8 100644
--- a/_build/html/11. Graphs/README.html	
+++ b/11. Graphs/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="133. Clone Graph" href="133.%20Clone%20Graph.html" />
-    <link rel="prev" title="79. Word Search" href="../10.%20Backtracking/79.%20Word%20Search.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -507,8 +505,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -541,24 +537,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../10.%20Backtracking/79.%20Word%20Search.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">79. Word Search</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="133.%20Clone%20Graph.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">133. Clone Graph</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/docs/_build/html/11. Graphs/README.html b/11. Graphs/intro.html
similarity index 76%
rename from docs/_build/html/11. Graphs/README.html
rename to 11. Graphs/intro.html
index fa61914..f28046f 100644
--- a/docs/_build/html/11. Graphs/README.html	
+++ b/11. Graphs/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Graphs Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Graph Challenges &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="133. Clone Graph" href="133.%20Clone%20Graph.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Graph Challenges</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/11. Graphs/README.md" target="_blank"
+      <li><a href="../_sources/11. Graphs/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Graphs Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Graph Challenges</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,9 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-graph-landscape">Navigating the Graph Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-exploration">Pythonic Exploration</a></li>
 </ul>
             </nav>
         </div>
@@ -466,45 +467,29 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="graphs-problems-blind-75-leetcode">
-<h1>Graphs Problems - Blind 75 LeetCode<a class="headerlink" href="#graphs-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-islands/">200. Number of Islands</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/clone-graph/">133. Clone Graph</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/pacific-atlantic-water-flow/">417. Pacific Atlantic Water Flow</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/course-schedule/">207. Course Schedule</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/">323. Number of Connected Components In An Undirected Graph</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/graph-valid-tree/">261. Graph Valid Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-graph-challenges">
+<h1>Introduction to Graph Challenges<a class="headerlink" href="#introduction-to-graph-challenges" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Graphs section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we dive into the fascinating world of graphs, a fundamental data structure with applications ranging from social networks to network routing algorithms.</p>
+<section id="navigating-the-graph-landscape">
+<h2>Navigating the Graph Landscape<a class="headerlink" href="#navigating-the-graph-landscape" title="Permalink to this heading">#</a></h2>
+<p>Graphs serve as a powerful model for representing relationships and connections between entities. The challenges presented in this section will not only test your understanding of graph theory but also equip you with the skills needed to tackle real-world problems involving interconnected data.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="unveiling-the-challenges">
+<h2>Unveiling the Challenges<a class="headerlink" href="#unveiling-the-challenges" title="Permalink to this heading">#</a></h2>
+<ol class="arabic simple">
+<li><p><strong>Clone Graph (Problem #133):</strong> Embark on the journey of graph cloning, a task that involves creating an identical copy of a connected graph while preserving its structure.</p></li>
+<li><p><strong>Graph Valid Tree (Problem #178):</strong> Explore the concept of a valid tree within a graph, addressing the conditions that define a tree structure and applying them to ensure validity.</p></li>
+<li><p><strong>Number of Islands (Problem #200):</strong> Grapple with the challenge of counting the number of islands in a matrix, navigating through interconnected regions in a sea of elements.</p></li>
+<li><p><strong>Course Schedule (Problem #207):</strong> Delve into the world of course scheduling, solving a problem that explores the dependencies between courses in an academic curriculum.</p></li>
+<li><p><strong>Number of Connected Components in an Undirected Graph (Problem #3651):</strong> Uncover the dynamics of connected components in undirected graphs, a crucial concept in network analysis and data connectivity.</p></li>
+<li><p><strong>Pacific Atlantic Water Flow (Problem #417):</strong> Tackle a geographical challenge involving the flow of water in the Pacific and Atlantic Oceans, demonstrating the practical applications of graph theory.</p></li>
+</ol>
+</section>
+<section id="pythonic-exploration">
+<h2>Pythonic Exploration<a class="headerlink" href="#pythonic-exploration" title="Permalink to this heading">#</a></h2>
+<p>As we navigate through each graph-related challenge, we’ll not only unravel the complexities of graph theory but also harness the power of Python to implement elegant and efficient solutions. Get ready to embark on a journey of problem-solving that will not only deepen your understanding of graphs but also enhance your coding skills in Python.</p>
+<p>Whether you are a coding enthusiast, a student exploring graph theory, or a professional honing your problem-solving skills, this section is designed to provide you with a solid foundation in graph-based algorithms.</p>
+<p>Let the exploration of Graph challenges begin!</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -574,8 +559,9 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-the-graph-landscape">Navigating the Graph Landscape</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-challenges">Unveiling the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-exploration">Pythonic Exploration</a></li>
 </ul>
   </nav></div>
 
diff --git a/docs/_build/html/12. Advanced Graphs/892. Alien Dictionary.html b/12. Advanced Graphs/892. Alien Dictionary.html
similarity index 92%
rename from docs/_build/html/12. Advanced Graphs/892. Alien Dictionary.html
rename to 12. Advanced Graphs/892. Alien Dictionary.html
index 4bcf731..044c9a7 100644
--- a/docs/_build/html/12. Advanced Graphs/892. Alien Dictionary.html	
+++ b/12. Advanced Graphs/892. Alien Dictionary.html	
@@ -66,7 +66,7 @@
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="1-D Dynamic Programming Problems - Blind 75 LeetCode" href="../13.%20One-D%20Dynamic%20Programming/README.html" />
-    <link rel="prev" title="Advanced Graphs Problems - Blind 75 LeetCode" href="README.html" />
+    <link rel="prev" title="Introduction to Advanced Graphs: Navigating the Alien Dictionary" href="intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
+<li class="toctree-l1 current active has-children"><a class="reference internal" href="intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
 <li class="toctree-l2 current active"><a class="current reference internal" href="#">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -662,12 +662,12 @@ <h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" ti
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
     <a class="left-prev"
-       href="README.html"
+       href="intro.html"
        title="previous page">
       <i class="fa-solid fa-angle-left"></i>
       <div class="prev-next-info">
         <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Advanced Graphs Problems - Blind 75 LeetCode</p>
+        <p class="prev-next-title">Introduction to Advanced Graphs: Navigating the Alien Dictionary</p>
       </div>
     </a>
     <a class="right-next"
diff --git a/_build/html/12. Advanced Graphs/README.html b/12. Advanced Graphs/README.html
similarity index 85%
rename from _build/html/12. Advanced Graphs/README.html
rename to 12. Advanced Graphs/README.html
index 5fd3bca..c3d859d 100644
--- a/_build/html/12. Advanced Graphs/README.html	
+++ b/12. Advanced Graphs/README.html	
@@ -65,8 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = '12. Advanced Graphs/README';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="892. Alien Dictionary" href="892.%20Alien%20Dictionary.html" />
-    <link rel="prev" title="417. Pacific Atlantic Water Flow" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -141,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+        <ul class="nav bd-sidenav">
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Advanced Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -492,8 +490,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
 </ul>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -526,24 +522,6 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="left-prev"
-       href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">417. Pacific Atlantic Water Flow</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="892.%20Alien%20Dictionary.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">892. Alien Dictionary</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/docs/_build/html/12. Advanced Graphs/README.html b/12. Advanced Graphs/intro.html
similarity index 75%
rename from docs/_build/html/12. Advanced Graphs/README.html
rename to 12. Advanced Graphs/intro.html
index 5fd3bca..fed9dea 100644
--- a/docs/_build/html/12. Advanced Graphs/README.html	
+++ b/12. Advanced Graphs/intro.html	
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Advanced Graphs Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction to Advanced Graphs: Navigating the Alien Dictionary &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,7 +62,7 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '12. Advanced Graphs/README';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = '12. Advanced Graphs/intro';</script>
     <link rel="index" title="Index" href="../genindex.html" />
     <link rel="search" title="Search" href="../search.html" />
     <link rel="next" title="892. Alien Dictionary" href="892.%20Alien%20Dictionary.html" />
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Advanced Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -331,7 +331,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F12. Advanced Graphs/README.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F12. Advanced Graphs/intro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -361,7 +361,7 @@
       
       
       
-      <li><a href="../_sources/12. Advanced Graphs/README.md" target="_blank"
+      <li><a href="../_sources/12. Advanced Graphs/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -443,7 +443,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Advanced Graphs Problems - Blind 75 LeetCode</h1>
+    <h1>Introduction to Advanced Graphs: Navigating the Alien Dictionary</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -453,8 +453,11 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-complexity">Unveiling the Complexity</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#exploring-the-alien-dictionary">Exploring the Alien Dictionary</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-sections">Navigating Sections</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-exploration">Pythonic Exploration</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-lies-ahead">What Lies Ahead</a></li>
 </ul>
             </nav>
         </div>
@@ -466,30 +469,28 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="advanced-graphs-problems-blind-75-leetcode">
-<h1>Advanced Graphs Problems - Blind 75 LeetCode<a class="headerlink" href="#advanced-graphs-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/alien-dictionary/">269. Alien Dictionary</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-to-advanced-graphs-navigating-the-alien-dictionary">
+<h1>Introduction to Advanced Graphs: Navigating the Alien Dictionary<a class="headerlink" href="#introduction-to-advanced-graphs-navigating-the-alien-dictionary" title="Permalink to this heading">#</a></h1>
+<p>Welcome to the Advanced Graphs section of “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this segment, we delve into the fascinating world of graph theory, tackling intricate problems that demand a deep understanding of graph traversal and manipulation.</p>
+<section id="unveiling-the-complexity">
+<h2>Unveiling the Complexity<a class="headerlink" href="#unveiling-the-complexity" title="Permalink to this heading">#</a></h2>
+<p>Graphs, with their interconnected nodes and edges, provide a rich landscape for problem-solving. As we venture into the Advanced Graphs section, we confront challenges that push the boundaries of conventional graph algorithms. Our focus goes beyond basic graph traversal, exploring advanced scenarios where nuanced strategies are required.</p>
 </section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
+<section id="exploring-the-alien-dictionary">
+<h2>Exploring the Alien Dictionary<a class="headerlink" href="#exploring-the-alien-dictionary" title="Permalink to this heading">#</a></h2>
+<p><strong>892. Alien Dictionary:</strong> Among the celestial challenges in this section, we encounter the enigmatic “Alien Dictionary.” This problem propels us into the realm of lexicographical ordering in an extraterrestrial language. As we decipher the rules governing the alien script, we will harness graph theory to unravel the order of the alphabet and construct a dictionary unique to this cosmic language.</p>
+</section>
+<section id="navigating-sections">
+<h2>Navigating Sections<a class="headerlink" href="#navigating-sections" title="Permalink to this heading">#</a></h2>
+<p>This section is not just about solving problems but also about understanding the underlying principles of advanced graph theory. As we progress, each problem becomes a stepping stone, preparing you for the intricacies of real-world applications and coding interviews.</p>
+</section>
+<section id="pythonic-exploration">
+<h2>Pythonic Exploration<a class="headerlink" href="#pythonic-exploration" title="Permalink to this heading">#</a></h2>
+<p>Just as constellations form patterns in the night sky, Pythonic solutions emerge from the code. Throughout this journey, we’ll leverage the elegance and power of Python to craft solutions that not only solve the challenges at hand but also showcase the beauty of efficient and readable code.</p>
+</section>
+<section id="what-lies-ahead">
+<h2>What Lies Ahead<a class="headerlink" href="#what-lies-ahead" title="Permalink to this heading">#</a></h2>
+<p>From alien languages to intricate graph scenarios, the challenges in this section are designed to stretch your problem-solving muscles. Embrace the complexity, explore the uncharted territories of advanced graphs, and let the mysteries of the “Alien Dictionary” be the guide on this cosmic coding adventure.</p>
 <p>Happy coding!</p>
 </section>
 <div class="toctree-wrapper compound">
@@ -559,8 +560,11 @@ <h2>Resources<a class="headerlink" href="#resources" title="Permalink to this he
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-complexity">Unveiling the Complexity</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#exploring-the-alien-dictionary">Exploring the Alien Dictionary</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-sections">Navigating Sections</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-exploration">Pythonic Exploration</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#what-lies-ahead">What Lies Ahead</a></li>
 </ul>
   </nav></div>
 
diff --git a/docs/_build/html/13. One-D Dynamic Programming/198. House Robber.html b/13. One-D Dynamic Programming/198. House Robber.html
similarity index 92%
rename from docs/_build/html/13. One-D Dynamic Programming/198. House Robber.html
rename to 13. One-D Dynamic Programming/198. House Robber.html
index ae9b6ca..dfc42b4 100644
--- a/docs/_build/html/13. One-D Dynamic Programming/198. House Robber.html	
+++ b/13. One-D Dynamic Programming/198. House Robber.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/13. One-D Dynamic Programming/213. House Robber II.html b/13. One-D Dynamic Programming/213. House Robber II.html
similarity index 92%
rename from _build/html/13. One-D Dynamic Programming/213. House Robber II.html
rename to 13. One-D Dynamic Programming/213. House Robber II.html
index f095313..800b089 100644
--- a/_build/html/13. One-D Dynamic Programming/213. House Robber II.html	
+++ b/13. One-D Dynamic Programming/213. House Robber II.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html b/13. One-D Dynamic Programming/70. Climbing Stairs.html
similarity index 91%
rename from _build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html
rename to 13. One-D Dynamic Programming/70. Climbing Stairs.html
index c12bd86..49e31bc 100644
--- a/_build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html	
+++ b/13. One-D Dynamic Programming/70. Climbing Stairs.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/13. One-D Dynamic Programming/README.html b/13. One-D Dynamic Programming/README.html
similarity index 88%
rename from _build/html/13. One-D Dynamic Programming/README.html
rename to 13. One-D Dynamic Programming/README.html
index 88ff6a7..ac43192 100644
--- a/_build/html/13. One-D Dynamic Programming/README.html	
+++ b/13. One-D Dynamic Programming/README.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/14. Two-D Dynamic Programming/README.html b/14. Two-D Dynamic Programming/README.html
similarity index 89%
rename from docs/_build/html/14. Two-D Dynamic Programming/README.html
rename to 14. Two-D Dynamic Programming/README.html
index 72a7ecf..092b669 100644
--- a/docs/_build/html/14. Two-D Dynamic Programming/README.html	
+++ b/14. Two-D Dynamic Programming/README.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/15. Greedy/README.html b/15. Greedy/README.html
similarity index 89%
rename from docs/_build/html/15. Greedy/README.html
rename to 15. Greedy/README.html
index 1f683de..8af4c04 100644
--- a/docs/_build/html/15. Greedy/README.html	
+++ b/15. Greedy/README.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/16. Intervals/README.html b/16. Intervals/README.html
similarity index 89%
rename from docs/_build/html/16. Intervals/README.html
rename to 16. Intervals/README.html
index b1c7318..af17f27 100644
--- a/docs/_build/html/16. Intervals/README.html	
+++ b/16. Intervals/README.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/17. Math Geometry/README.html b/17. Math Geometry/README.html
similarity index 89%
rename from _build/html/17. Math Geometry/README.html
rename to 17. Math Geometry/README.html
index f840c85..b5db50a 100644
--- a/_build/html/17. Math Geometry/README.html	
+++ b/17. Math Geometry/README.html	
@@ -141,7 +141,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -156,13 +156,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -173,29 +173,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -204,7 +204,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -219,24 +219,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -245,7 +245,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/18. Bit Manipulation/README.html b/18. Bit Manipulation/README.html
similarity index 89%
rename from docs/_build/html/18. Bit Manipulation/README.html
rename to 18. Bit Manipulation/README.html
index 0729db3..1adfd74 100644
--- a/docs/_build/html/18. Bit Manipulation/README.html	
+++ b/18. Bit Manipulation/README.html	
@@ -140,7 +140,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="../README.html">
+<a class="navbar-brand logo" href="../intro.html">
   
   
   
@@ -155,13 +155,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="../intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -172,29 +172,29 @@
 <li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -203,7 +203,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -218,24 +218,24 @@
 <li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -244,7 +244,7 @@
 <li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/html/Book.html b/Book.html
similarity index 76%
rename from _build/html/Book.html
rename to Book.html
index b11e1fe..2fc06b3 100644
--- a/_build/html/Book.html
+++ b/Book.html
@@ -139,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -154,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -171,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -202,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -217,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -243,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -467,6 +467,7 @@ <h2> Contents </h2>
 <div class="cell_input docutils container">
 <div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>python<span class="w"> </span>-m<span class="w"> </span>pip<span class="w"> </span>install<span class="w"> </span>--upgrade<span class="w"> </span>pip
 <span class="o">%</span><span class="k">pip</span> install jupyter-book
+<span class="o">%</span><span class="k">pip</span> install ghp-import
 </pre></div>
 </div>
 </div>
@@ -512,7 +513,9 @@ <h2> Contents </h2>
 Requirement already satisfied: nbformat~=5.0 in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (5.9.2)
 Requirement already satisfied: typing-extensions in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (4.8.0)
 Requirement already satisfied: ipykernel in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (6.25.2)
-Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.7)
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.7)
 Requirement already satisfied: sphinxcontrib-devhelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.5)
 Requirement already satisfied: sphinxcontrib-jsmath in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.1)
 Requirement already satisfied: sphinxcontrib-htmlhelp&gt;=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.0.4)
@@ -548,10 +551,10 @@ <h2> Contents </h2>
 Requirement already satisfied: jupyter-client&gt;=6.1.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (8.4.0)
 Requirement already satisfied: jupyter-core!=5.0.*,&gt;=4.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.4.0)
 Requirement already satisfied: traitlets&gt;=5.3 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.11.2)
-Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.18.1)
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: latexcodec&gt;=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex&gt;=0.24-&gt;sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (2.0.1)
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.18.1)
+Requirement already satisfied: latexcodec&gt;=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex&gt;=0.24-&gt;sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (2.0.1)
 Requirement already satisfied: six in /home/codespace/.local/lib/python3.10/site-packages (from pybtex&gt;=0.24-&gt;sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (1.16.0)
 Requirement already satisfied: beautifulsoup4 in /home/codespace/.local/lib/python3.10/site-packages (from pydata-sphinx-theme&gt;=0.13.3-&gt;sphinx-book-theme~=1.0.0-&gt;jupyter-book) (4.12.2)
 Requirement already satisfied: accessible-pygments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pydata-sphinx-theme&gt;=0.13.3-&gt;sphinx-book-theme~=1.0.0-&gt;jupyter-book) (0.0.4)
@@ -611,6 +614,14 @@ <h2> Contents </h2>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Note: you may need to restart the kernel to use updated packages.
 </pre></div>
 </div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: ghp-import in /usr/local/python/3.10.8/lib/python3.10/site-packages (2.1.0)
+Requirement already satisfied: python-dateutil&gt;=2.8.1 in /home/codespace/.local/lib/python3.10/site-packages (from ghp-import) (2.8.2)
+Requirement already satisfied: six&gt;=1.5 in /home/codespace/.local/lib/python3.10/site-packages (from python-dateutil&gt;=2.8.1-&gt;ghp-import) (1.16.0)
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Note: you may need to restart the kernel to use updated packages.
+</pre></div>
+</div>
 </div>
 </div>
 <div class="cell docutils container">
@@ -672,7 +683,7 @@ <h2> Contents </h2>
 <span class=" -Color -Color-Bold">Running Sphinx v5.0.2</span>
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[etoc] Changing master_doc to &#39;README&#39;
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[etoc] Changing master_doc to &#39;intro&#39;
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">myst v0.18.1:</span> MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=[&#39;colon_fence&#39;, &#39;dollarmath&#39;, &#39;linkify&#39;, &#39;substitution&#39;, &#39;tasklist&#39;], disable_syntax=[], all_links_external=False, url_schemes=[&#39;mailto&#39;, &#39;http&#39;, &#39;https&#39;], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=(&#39;{&#39;, &#39;}&#39;), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes=&#39;tex2jax_process|mathjax_process|math|output_area&#39;)
@@ -681,174 +692,221 @@ <h2> Contents </h2>
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">building [mo]: </span>targets for 0 po files that are out of date
-<span class=" -Color -Color-Bold">building [html]: </span>targets for 77 source files that are out of date
-<span class=" -Color -Color-Bold">updating environment: </span>[new config] 77 added, 0 changed, 0 removed
+<span class=" -Color -Color-Bold">building [html]: </span>targets for 90 source files that are out of date
+<span class=" -Color -Color-Bold">updating environment: </span>[new config] 90 added, 0 changed, 0 removed
 <span class=" -Color -Color-Bold">reading sources... </span>[  1%] <span class=" -Color -Color-Magenta">01. Array Hashing/1. Two Sum</span>                          
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.07 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.18 seconds [mystnb]
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  2%] <span class=" -Color -Color-Magenta">01. Array Hashing/128. Longest Consecutive Sequence</span>   
 /workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.17 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 0.96 seconds [mystnb]
 <span class=" -Color -Color-Bold">reading sources... </span>[  3%] <span class=" -Color -Color-Magenta">01. Array Hashing/217. Contains Duplicate</span>             
 /workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.19 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[  5%] <span class=" -Color -Color-Magenta">01. Array Hashing/238. Product of Array Except Self</span>   
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.10 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[  4%] <span class=" -Color -Color-Magenta">01. Array Hashing/238. Product of Array Except Self</span>   
 /workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 1.26 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.94 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  6%] <span class=" -Color -Color-Magenta">01. Array Hashing/242. Valid Anagram</span>                  
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  5%] <span class=" -Color -Color-Magenta">01. Array Hashing/242. Valid Anagram</span>                  
 /workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 1.18 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  7%] <span class=" -Color -Color-Magenta">01. Array Hashing/347. Top K Frequent Elements</span>        
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.90 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[  6%] <span class=" -Color -Color-Magenta">01. Array Hashing/347. Top K Frequent Elements</span>        
 /workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.13 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 0.87 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[  7%] <span class=" -Color -Color-Magenta">01. Array Hashing/49. Group Anagrams</span>                  
+/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  9%] <span class=" -Color -Color-Magenta">01. Array Hashing/49. Group Anagrams</span>                  
-/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.86 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 4.02 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 10%] <span class=" -Color -Color-Magenta">01. Array Hashing/659. Encode and Decode Strings</span>      
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  8%] <span class=" -Color -Color-Magenta">01. Array Hashing/659. Encode and Decode Strings</span>      
+/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 0.92 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.05 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 10%] <span class=" -Color -Color-Magenta">01. Array Hashing/README</span>                              
+<span class=" -Color -Color-Bold">reading sources... </span>[ 11%] <span class=" -Color -Color-Magenta">01. Array Hashing/intro</span>                               
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 11%] <span class=" -Color -Color-Magenta">01. Array Hashing/README</span>                              
-<span class=" -Color -Color-Bold">reading sources... </span>[ 12%] <span class=" -Color -Color-Magenta">02. Two Pointers/11. Container With Most Water</span>        
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 12%] <span class=" -Color -Color-Magenta">02. Two Pointers/11. Container With Most Water</span>        
 /workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.26 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 14%] <span class=" -Color -Color-Magenta">02. Two Pointers/125. Valid Palindrome</span>                
-/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.17 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 13%] <span class=" -Color -Color-Magenta">02. Two Pointers/125. Valid Palindrome</span>                
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 1.07 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 15%] <span class=" -Color -Color-Magenta">02. Two Pointers/15. 3Sum</span>                             
-/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 4.02 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 14%] <span class=" -Color -Color-Magenta">02. Two Pointers/15. 3Sum</span>                             
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.00 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 16%] <span class=" -Color -Color-Magenta">02. Two Pointers/README</span>                               
-<span class=" -Color -Color-Bold">reading sources... </span>[ 18%] <span class=" -Color -Color-Magenta">03. Sliding Window/121. Best Time to Buy and Sell Stock</span>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.96 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 15%] <span class=" -Color -Color-Magenta">02. Two Pointers/README</span>                               
+<span class=" -Color -Color-Bold">reading sources... </span>[ 16%] <span class=" -Color -Color-Magenta">02. Two Pointers/intro</span>                                
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 17%] <span class=" -Color -Color-Magenta">03. Sliding Window/121. Best Time to Buy and Sell Stock</span>
+/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.89 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 19%] <span class=" -Color -Color-Magenta">03. Sliding Window/3. Longest Substring Without Repeating Characters</span>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 1.07 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 18%] <span class=" -Color -Color-Magenta">03. Sliding Window/3. Longest Substring Without Repeating Characters</span>
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 1.16 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 0.97 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 20%] <span class=" -Color -Color-Magenta">03. Sliding Window/424. Longest Repeating Character Replacement</span>
+/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 20%] <span class=" -Color -Color-Magenta">03. Sliding Window/424. Longest Repeating Character Replacement</span>
-/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 0.95 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 21%] <span class=" -Color -Color-Magenta">03. Sliding Window/76. Minimum Window Substring</span>       
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.05 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 22%] <span class=" -Color -Color-Magenta">03. Sliding Window/76. Minimum Window Substring</span>       
-/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 0.87 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.06 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 23%] <span class=" -Color -Color-Magenta">03. Sliding Window/README</span>                             
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 22%] <span class=" -Color -Color-Magenta">03. Sliding Window/README</span>                             
+<span class=" -Color -Color-Bold">reading sources... </span>[ 23%] <span class=" -Color -Color-Magenta">03. Sliding Window/intro</span>                              
 <span class=" -Color -Color-Bold">reading sources... </span>[ 24%] <span class=" -Color -Color-Magenta">04. Stack/20. Valid Parentheses</span>                       
-/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 4.02 seconds [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 1.17 seconds [mystnb]
 <span class=" -Color -Color-Bold">reading sources... </span>[ 25%] <span class=" -Color -Color-Magenta">04. Stack/README</span>                                      
+<span class=" -Color -Color-Bold">reading sources... </span>[ 26%] <span class=" -Color -Color-Magenta">04. Stack/intro</span>                                       
 <span class=" -Color -Color-Bold">reading sources... </span>[ 27%] <span class=" -Color -Color-Magenta">05. Binary Search/153. Find Minimum in Rotated Sorted Array</span>
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 0.98 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 28%] <span class=" -Color -Color-Magenta">05. Binary Search/33. Search in Rotated Sorted Array</span>  
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 0.99 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 28%] <span class=" -Color -Color-Magenta">05. Binary Search/33. Search in Rotated Sorted Array</span>  
+/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.05 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 29%] <span class=" -Color -Color-Magenta">05. Binary Search/README</span>                              
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 0.94 seconds [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 31%] <span class=" -Color -Color-Magenta">06. Linked List/141. Linked List Cycle</span>                
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 30%] <span class=" -Color -Color-Magenta">05. Binary Search/README</span>                              
+<span class=" -Color -Color-Bold">reading sources... </span>[ 31%] <span class=" -Color -Color-Magenta">05. Binary Search/intro</span>                               
+<span class=" -Color -Color-Bold">reading sources... </span>[ 32%] <span class=" -Color -Color-Magenta">06. Linked List/141. Linked List Cycle</span>                
 /workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 0.96 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 32%] <span class=" -Color -Color-Magenta">06. Linked List/143. Reorder List</span>                     
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.04 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 33%] <span class=" -Color -Color-Magenta">06. Linked List/143. Reorder List</span>                     
 </pre></div>
 </div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]
 </pre></div>
 </div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.07 seconds [mystnb]
+<span class=" -Color -Color-Bold">reading sources... </span>[ 34%] <span class=" -Color -Color-Magenta">06. Linked List/19. Remove Nth Node From End of List</span>  
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 1.16 seconds [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 35%] <span class=" -Color -Color-Magenta">06. Linked List/206. Reverse Linked List</span>              
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 0.88 seconds [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 36%] <span class=" -Color -Color-Magenta">06. Linked List/21. Merge Two Sorted Lists</span>            
+/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 1.06 seconds [mystnb]
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 37%] <span class=" -Color -Color-Magenta">06. Linked List/23. Merge k Sorted Lists</span>              
+</pre></div>
+</div>
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]
+</pre></div>
+</div>
 <div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>^C
-
-Exception occurred:
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 512, in _async_cleanup_kernel
-    await ensure_async(self.km.cleanup_resources())
-AttributeError: &#39;NoneType&#39; object has no attribute &#39;cleanup_resources&#39;
-The full traceback has been saved in /tmp/sphinx-err-tl19fjln.log, if you want to report the issue to the developers.
-Please also report this if it was a user error, so that a better error message can be provided next time.
-A bug report can be filed in the tracker at &lt;https://github.com/sphinx-doc/sphinx/issues&gt;. Thanks!
+/workspaces/LeetCode-Solutions/04. Stack/intro.md:5: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]
 Traceback (most recent call last):
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py&quot;, line 89, in wrapper
-    self._ready.set_result(None)
-asyncio.exceptions.InvalidStateError: invalid state
-
-During handling of the above exception, another exception occurred:
-
-Traceback (most recent call last):
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 505, in _async_cleanup_kernel
-    await ensure_async(self.km.shutdown_kernel(now=now))
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 689, in async_execute
+    async with self.async_setup_kernel(**kwargs):
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/contextlib.py&quot;, line 199, in __aenter__
+    return await anext(self.gen)
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 647, in async_setup_kernel
+    await self.async_start_new_kernel_client()
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 562, in async_start_new_kernel_client
+    await ensure_async(self.kc.wait_for_ready(timeout=self.startup_timeout))
   File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py&quot;, line 189, in ensure_async
     result = await obj
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py&quot;, line 92, in wrapper
-    self._ready.set_exception(e)
-asyncio.exceptions.InvalidStateError: invalid state
+  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/client.py&quot;, line 212, in _async_wait_for_ready
+    msg = await ensure_async(self.iopub_channel.get_msg(timeout=0.2))
+  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py&quot;, line 189, in ensure_async
+    result = await obj
+  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/channels.py&quot;, line 310, in get_msg
+    ready = await self.socket.poll(timeout)
+asyncio.exceptions.CancelledError
 
 During handling of the above exception, another exception occurred:
 
 Traceback (most recent call last):
+  File &quot;/home/codespace/.python/current/bin/jupyter-book&quot;, line 8, in &lt;module&gt;
+    sys.exit(main())
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1157, in __call__
+    return self.main(*args, **kwargs)
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1078, in main
+    rv = self.invoke(ctx)
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1688, in invoke
+    return _process_result(sub_ctx.command.invoke(sub_ctx))
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1434, in invoke
+    return ctx.invoke(self.callback, **ctx.params)
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 783, in invoke
+    return __callback(*args, **kwargs)
+  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py&quot;, line 301, in build
+    result = build_sphinx(
   File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/sphinx.py&quot;, line 171, in build_sphinx
     app.build(force_all, filenames)
   File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/application.py&quot;, line 329, in build
@@ -883,167 +941,27 @@ <h2> Contents </h2>
     return loop.run_until_complete(inner)
   File &quot;/usr/local/python/3.10.8/lib/python3.10/asyncio/base_events.py&quot;, line 649, in run_until_complete
     return future.result()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 689, in async_execute
-    async with self.async_setup_kernel(**kwargs):
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/contextlib.py&quot;, line 206, in __aexit__
-    await anext(self.gen)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 656, in async_setup_kernel
-    await self._async_cleanup_kernel()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 512, in _async_cleanup_kernel
-    await ensure_async(self.km.cleanup_resources())
-AttributeError: &#39;NoneType&#39; object has no attribute &#39;cleanup_resources&#39;
-
-The above exception was the direct cause of the following exception:
-
-Traceback (most recent call last):
-  File &quot;/home/codespace/.python/current/bin/jupyter-book&quot;, line 8, in &lt;module&gt;
-    sys.exit(main())
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1157, in __call__
-    return self.main(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1078, in main
-    rv = self.invoke(ctx)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1688, in invoke
-    return _process_result(sub_ctx.command.invoke(sub_ctx))
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1434, in invoke
-    return ctx.invoke(self.callback, **ctx.params)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 783, in invoke
-    return __callback(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py&quot;, line 317, in build
-    builder_specific_actions(
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py&quot;, line 525, in builder_specific_actions
-    raise RuntimeError(_message_box(msg, color=&quot;red&quot;, doprint=False)) from result
-RuntimeError: 
-===============================================================================
-
-There was an error in building your book. Look above for the cause.
-
-===============================================================================
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>build<span class="w"> </span>/workspaces/LeetCode-Solutions/<span class="w"> </span>--builder<span class="w"> </span>pdfhtml
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">IPython.display</span> <span class="kn">import</span> <span class="n">HTML</span>
-<span class="n">HTML</span><span class="p">(</span><span class="s1">&#39;&lt;a href=&quot;_build/html/index.html&quot; target=&quot;_blank&quot;&gt;Click here to view your Jupyter Book&lt;/a&gt;&#39;</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output text_html"><a href="_build/html/index.html" target="_blank">Click here to view your Jupyter Book</a></div></div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>create<span class="w"> </span>mybook
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>===============================================================================
-
-Your book template can be found at
-
-    mybook/
-
-===============================================================================
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>build<span class="w"> </span>mybook
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold -Color-Bold-Green">Running Jupyter-Book v0.15.1</span>
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Source Folder: </span>/workspaces/LeetCode-Solutions/mybook
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Config Path: </span>/workspaces/LeetCode-Solutions/mybook/_config.yml
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Output Path: </span>/workspaces/LeetCode-Solutions/mybook/_build/html
-[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils&lt;0.18 (or &gt;=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/
-<span class=" -Color -Color-Bold">Running Sphinx v5.0.2</span>
-[etoc] Changing master_doc to &#39;intro&#39;
-checking bibtex cache... out of date
-parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries
-<span class=" -Color -Color-Bold">myst v0.18.1:</span> MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=[&#39;colon_fence&#39;, &#39;dollarmath&#39;, &#39;linkify&#39;, &#39;substitution&#39;, &#39;tasklist&#39;], disable_syntax=[], all_links_external=False, url_schemes=[&#39;mailto&#39;, &#39;http&#39;, &#39;https&#39;], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=(&#39;{&#39;, &#39;}&#39;), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes=&#39;tex2jax_process|mathjax_process|math|output_area&#39;)
-<span class=" -Color -Color-Bold">myst-nb v0.17.2:</span> NbParserConfig(custom_formats={}, metadata_key=&#39;mystnb&#39;, cell_metadata_key=&#39;mystnb&#39;, kernel_rgx_aliases={}, execution_mode=&#39;force&#39;, execution_cache_path=&#39;&#39;, execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin=&#39;default&#39;, remove_code_source=False, remove_code_outputs=False, code_prompt_show=&#39;Show code cell {type}&#39;, code_prompt_hide=&#39;Hide code cell {type}&#39;, number_source_lines=False, output_stderr=&#39;show&#39;, render_text_lexer=&#39;myst-ansi&#39;, render_error_lexer=&#39;ipythontb&#39;, render_image_options={}, render_figure_options={}, render_markdown_format=&#39;commonmark&#39;, output_folder=&#39;build&#39;, append_css=True, metadata_to_fm=False)
-Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache
-<span class=" -Color -Color-Bold">building [mo]: </span>targets for 0 po files that are out of date
-<span class=" -Color -Color-Bold">building [html]: </span>targets for 14 source files that are out of date
-<span class=" -Color -Color-Bold">updating environment: </span>[new config] 14 added, 0 changed, 0 removed
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[100%] <span class=" -Color -Color-Magenta">intro</span>                                                 
-<span class=" -Color -Color-Bold">looking for now-outdated files... </span>none found
-<span class=" -Color -Color-Bold">pickling environment... </span>done
-<span class=" -Color -Color-Bold">checking consistency... </span>/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn&#39;t included in any toctree
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn&#39;t included in any toctree
-done
-<span class=" -Color -Color-Bold">preparing documents... </span>done
-<span class=" -Color -Color-Bold">writing output... </span>[100%] <span class=" -Color -Color-Green">intro</span>                                                  
-<span class=" -Color -Color-Bold">generating indices... </span>genindex done
-<span class=" -Color -Color-Bold">writing additional pages... </span>search done
-<span class=" -Color -Color-Bold">copying static files... </span>done
-<span class=" -Color -Color-Bold">copying extra files... </span>done
-<span class=" -Color -Color-Bold">dumping search index in English (code: en)... </span>done
-<span class=" -Color -Color-Bold">dumping object inventory... </span>done
-[etoc] missing index.html written as redirect to &#39;intro.html&#39;
-<span class=" -Color -Color-Bold">build succeeded, 2 warnings.</span>
-
-The HTML pages are in mybook/_build/html.
-
-===============================================================================
-
-Finished generating HTML for book.
-Your book&#39;s HTML pages are here:
-    mybook/_build/html/
-You can look at your book by opening this file in a browser:
-    mybook/_build/html/index.html
-Or paste this line directly into your browser bar:
-    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            
-
-===============================================================================
+asyncio.exceptions.CancelledError
 </pre></div>
 </div>
 </div>
 </div>
 <div class="cell docutils container">
 <div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>toc<span class="w"> </span>from-project<span class="w"> </span>/workspaces/LeetCode-Solutions/mybook/<span class="w"> </span>-f<span class="w"> </span>jb-book
+<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>ghp-import<span class="w"> </span>-n<span class="w"> </span>-p<span class="w"> </span>-f<span class="w"> </span>_build/html
 </pre></div>
 </div>
 </div>
 <div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>format: jb-book
-root: intro
+<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Enumerating objects: 241, done.
+Counting objects: 100% (241/241), done.
+Delta compression using up to 2 threads
+Compressing objects: 100% (34/34), done.
+Writing objects: 100% (141/141), 301.49 KiB | 75.37 MiB/s, done.
+Total 141 (delta 117), reused 126 (delta 102), pack-reused 0
+remote: Resolving deltas: 100% (117/117), completed with 15 local objects.
+To https://github.com/mohsentabibian/LeetCode-Solutions
+   f40f6c9..bcf1c22  gh-pages -&gt; gh-pages
 </pre></div>
 </div>
 </div>
diff --git a/Book.ipynb b/Book.ipynb
deleted file mode 100644
index e7b4f46..0000000
--- a/Book.ipynb
+++ /dev/null
@@ -1,400 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 34,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "\u001b[01mmaking output directory... \u001b[39;49;00mdone\n",
-      "[etoc] Changing master_doc to 'README'\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]  \n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.26 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.00 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]     \n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.92 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 0.90 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.28 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executing notebook using local CWD [mystnb]      \n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executed notebook in 1.17 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executed notebook in 1.16 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executing notebook using local CWD [mystnb] \n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executed notebook in 1.27 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executed notebook in 1.24 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executed notebook in 4.03 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executing notebook using local CWD [mystnb]   \n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/Book.ipynb: Executing notebook using local CWD [mystnb]                          \n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mSECURITY\u001b[39;49;00m                                              \n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb:30008: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Executing notebook failed: CellTimeoutError [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Notebook exception traceback saved in: /workspaces/LeetCode-Solutions/_build/html/reports/Book.err.log [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CODE_OF_CONDUCT.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/SECURITY.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mSECURITY\u001b[39;49;00m                                               raph\u001b[39;49;00m0m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:8: WARNING: 'myst' reference target not found: #ways-to-contribute\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:9: WARNING: 'myst' reference target not found: #getting-started\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:10: WARNING: 'myst' reference target not found: #contributing-process\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:11: WARNING: 'myst' reference target not found: #code-of-conduct\u001b[39;49;00m\n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'README.html'\n",
-      "\u001b[01mbuild succeeded, 11 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in _build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    _build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    _build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
diff --git a/_build/html/CODE_OF_CONDUCT.html b/CODE_OF_CONDUCT.html
similarity index 90%
rename from _build/html/CODE_OF_CONDUCT.html
rename to CODE_OF_CONDUCT.html
index e1f3fd1..72ad7e9 100644
--- a/_build/html/CODE_OF_CONDUCT.html
+++ b/CODE_OF_CONDUCT.html
@@ -139,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -154,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -171,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -202,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -217,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -243,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/docs/_build/html/CONTRIBUTING.html b/CONTRIBUTING.html
similarity index 89%
rename from docs/_build/html/CONTRIBUTING.html
rename to CONTRIBUTING.html
index 9254de9..2c40a29 100644
--- a/docs/_build/html/CONTRIBUTING.html
+++ b/CONTRIBUTING.html
@@ -139,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -154,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -171,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -202,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -217,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -243,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/LICENSE b/LICENSE
deleted file mode 100644
index 8818d1f..0000000
--- a/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2023 Mohsen Tabibian
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/docs/_build/html/README.html b/README.html
similarity index 93%
rename from docs/_build/html/README.html
rename to README.html
index 49e44aa..0357574 100644
--- a/docs/_build/html/README.html
+++ b/README.html
@@ -65,7 +65,6 @@
     <script>DOCUMENTATION_OPTIONS.pagename = 'README';</script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
-    <link rel="next" title="Array &amp; Hashing Solutions - Blind 75 LeetCode Problems" href="01.%20Array%20Hashing/README.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -140,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="#">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -154,14 +153,14 @@
     <div class="bd-toc-item navbar-nav active">
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1 current active">
-                <a class="reference internal" href="#">
-                    Blind 75 LeetCode Solutions
+            <li class="toctree-l1">
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -172,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -203,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -218,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -244,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -1000,8 +999,6 @@ <h2>Security Policy<a class="headerlink" href="#security-policy" title="Permalin
 <p>We take security seriously. Please review our <a class="reference internal" href="SECURITY.html"><span class="doc std std-doc">Security Policy</span></a> for information on reporting security vulnerabilities.</p>
 <p>Happy coding!</p>
 </section>
-<div class="toctree-wrapper compound">
-</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -1034,15 +1031,6 @@ <h2>Security Policy<a class="headerlink" href="#security-policy" title="Permalin
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
-    <a class="right-next"
-       href="01.%20Array%20Hashing/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
 </div>
                 </footer>
               
diff --git a/_build/html/SECURITY.html b/SECURITY.html
similarity index 89%
rename from _build/html/SECURITY.html
rename to SECURITY.html
index 1816264..5033d82 100644
--- a/_build/html/SECURITY.html
+++ b/SECURITY.html
@@ -139,7 +139,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -154,13 +154,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -171,29 +171,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -202,7 +202,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -217,24 +217,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -243,7 +243,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree b/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree
deleted file mode 100644
index 5390e09..0000000
Binary files a/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree b/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree
deleted file mode 100644
index 28888ec..0000000
Binary files a/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree b/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree
deleted file mode 100644
index b30e57f..0000000
Binary files a/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree b/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree
deleted file mode 100644
index d1df60d..0000000
Binary files a/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree b/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree
deleted file mode 100644
index 8187aae..0000000
Binary files a/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree b/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree
deleted file mode 100644
index 127b43b..0000000
Binary files a/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree b/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree
deleted file mode 100644
index 13c81c2..0000000
Binary files a/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree b/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree
deleted file mode 100644
index 3b9c658..0000000
Binary files a/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree and /dev/null differ
diff --git a/_build/.doctrees/01. Array Hashing/README.doctree b/_build/.doctrees/01. Array Hashing/README.doctree
deleted file mode 100644
index f9bd117..0000000
Binary files a/_build/.doctrees/01. Array Hashing/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree b/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree
deleted file mode 100644
index 6939264..0000000
Binary files a/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree and /dev/null differ
diff --git a/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree b/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree
deleted file mode 100644
index fab66a6..0000000
Binary files a/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree and /dev/null differ
diff --git a/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree b/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree
deleted file mode 100644
index db856f1..0000000
Binary files a/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree and /dev/null differ
diff --git a/_build/.doctrees/02. Two Pointers/README.doctree b/_build/.doctrees/02. Two Pointers/README.doctree
deleted file mode 100644
index 311c6a1..0000000
Binary files a/_build/.doctrees/02. Two Pointers/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree b/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree
deleted file mode 100644
index a6bbeb3..0000000
Binary files a/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree and /dev/null differ
diff --git a/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree b/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree
deleted file mode 100644
index 3d83c09..0000000
Binary files a/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree and /dev/null differ
diff --git a/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree b/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree
deleted file mode 100644
index a107741..0000000
Binary files a/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree and /dev/null differ
diff --git a/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree b/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree
deleted file mode 100644
index 55bd42c..0000000
Binary files a/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree and /dev/null differ
diff --git a/_build/.doctrees/03. Sliding Window/README.doctree b/_build/.doctrees/03. Sliding Window/README.doctree
deleted file mode 100644
index 384aba6..0000000
Binary files a/_build/.doctrees/03. Sliding Window/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree b/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree
deleted file mode 100644
index e3a1f1d..0000000
Binary files a/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree and /dev/null differ
diff --git a/_build/.doctrees/04. Stack/README.doctree b/_build/.doctrees/04. Stack/README.doctree
deleted file mode 100644
index b68b301..0000000
Binary files a/_build/.doctrees/04. Stack/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree b/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree
deleted file mode 100644
index f3ad3ed..0000000
Binary files a/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree and /dev/null differ
diff --git a/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree b/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree
deleted file mode 100644
index cce41ea..0000000
Binary files a/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree and /dev/null differ
diff --git a/_build/.doctrees/05. Binary Search/README.doctree b/_build/.doctrees/05. Binary Search/README.doctree
deleted file mode 100644
index e9ea47d..0000000
Binary files a/_build/.doctrees/05. Binary Search/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree b/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree
deleted file mode 100644
index ebdec70..0000000
Binary files a/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/143. Reorder List.doctree b/_build/.doctrees/06. Linked List/143. Reorder List.doctree
deleted file mode 100644
index 93ebdf1..0000000
Binary files a/_build/.doctrees/06. Linked List/143. Reorder List.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree b/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree
deleted file mode 100644
index 36946e4..0000000
Binary files a/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree b/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree
deleted file mode 100644
index b8ca05c..0000000
Binary files a/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree b/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree
deleted file mode 100644
index c3fd916..0000000
Binary files a/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree b/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree
deleted file mode 100644
index 3941f1c..0000000
Binary files a/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree and /dev/null differ
diff --git a/_build/.doctrees/06. Linked List/README.doctree b/_build/.doctrees/06. Linked List/README.doctree
deleted file mode 100644
index 33630e1..0000000
Binary files a/_build/.doctrees/06. Linked List/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/100. Same Tree.doctree b/_build/.doctrees/07. Trees/100. Same Tree.doctree
deleted file mode 100644
index 4f27ba5..0000000
Binary files a/_build/.doctrees/07. Trees/100. Same Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree b/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree
deleted file mode 100644
index ad0d709..0000000
Binary files a/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree b/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree
deleted file mode 100644
index d337a7f..0000000
Binary files a/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree b/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree
deleted file mode 100644
index 8a0dff1..0000000
Binary files a/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree b/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree
deleted file mode 100644
index b000d0f..0000000
Binary files a/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree b/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree
deleted file mode 100644
index ac9e634..0000000
Binary files a/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree b/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree
deleted file mode 100644
index 29b96ce..0000000
Binary files a/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree b/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree
deleted file mode 100644
index 1b4dde5..0000000
Binary files a/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree b/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree
deleted file mode 100644
index 88f1cab..0000000
Binary files a/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree b/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree
deleted file mode 100644
index edab1dc..0000000
Binary files a/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree b/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree
deleted file mode 100644
index d18096f..0000000
Binary files a/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree b/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree
deleted file mode 100644
index f4e0df7..0000000
Binary files a/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/07. Trees/README.doctree b/_build/.doctrees/07. Trees/README.doctree
deleted file mode 100644
index 0ef6fdf..0000000
Binary files a/_build/.doctrees/07. Trees/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree b/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree
deleted file mode 100644
index 980cee7..0000000
Binary files a/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree and /dev/null differ
diff --git a/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree b/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree
deleted file mode 100644
index 24494e8..0000000
Binary files a/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree and /dev/null differ
diff --git a/_build/.doctrees/08. Tries/212. Word Search II.doctree b/_build/.doctrees/08. Tries/212. Word Search II.doctree
deleted file mode 100644
index d9bcd3d..0000000
Binary files a/_build/.doctrees/08. Tries/212. Word Search II.doctree and /dev/null differ
diff --git a/_build/.doctrees/08. Tries/README.doctree b/_build/.doctrees/08. Tries/README.doctree
deleted file mode 100644
index 71936f3..0000000
Binary files a/_build/.doctrees/08. Tries/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree b/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree
deleted file mode 100644
index 2e53f47..0000000
Binary files a/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree and /dev/null differ
diff --git a/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree b/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree
deleted file mode 100644
index ecc8007..0000000
Binary files a/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree and /dev/null differ
diff --git a/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree b/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree
deleted file mode 100644
index 4c27fbe..0000000
Binary files a/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree and /dev/null differ
diff --git a/_build/.doctrees/09. Heap - Priority Queue/README.doctree b/_build/.doctrees/09. Heap - Priority Queue/README.doctree
deleted file mode 100644
index a1bd1e3..0000000
Binary files a/_build/.doctrees/09. Heap - Priority Queue/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree b/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree
deleted file mode 100644
index 74bd1e4..0000000
Binary files a/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree and /dev/null differ
diff --git a/_build/.doctrees/10. Backtracking/79. Word Search.doctree b/_build/.doctrees/10. Backtracking/79. Word Search.doctree
deleted file mode 100644
index 23d6c0d..0000000
Binary files a/_build/.doctrees/10. Backtracking/79. Word Search.doctree and /dev/null differ
diff --git a/_build/.doctrees/10. Backtracking/README.doctree b/_build/.doctrees/10. Backtracking/README.doctree
deleted file mode 100644
index a587eb8..0000000
Binary files a/_build/.doctrees/10. Backtracking/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/133. Clone Graph.doctree b/_build/.doctrees/11. Graphs/133. Clone Graph.doctree
deleted file mode 100644
index 8b72c4b..0000000
Binary files a/_build/.doctrees/11. Graphs/133. Clone Graph.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree b/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree
deleted file mode 100644
index 2d47dfa..0000000
Binary files a/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/200. Number of Islands.doctree b/_build/.doctrees/11. Graphs/200. Number of Islands.doctree
deleted file mode 100644
index 61d79f5..0000000
Binary files a/_build/.doctrees/11. Graphs/200. Number of Islands.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/207. Course Schedule.doctree b/_build/.doctrees/11. Graphs/207. Course Schedule.doctree
deleted file mode 100644
index affb26f..0000000
Binary files a/_build/.doctrees/11. Graphs/207. Course Schedule.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree b/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree
deleted file mode 100644
index efb302e..0000000
Binary files a/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree b/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree
deleted file mode 100644
index a8c58e1..0000000
Binary files a/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree and /dev/null differ
diff --git a/_build/.doctrees/11. Graphs/README.doctree b/_build/.doctrees/11. Graphs/README.doctree
deleted file mode 100644
index 2283665..0000000
Binary files a/_build/.doctrees/11. Graphs/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree b/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree
deleted file mode 100644
index 0798b9c..0000000
Binary files a/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree and /dev/null differ
diff --git a/_build/.doctrees/12. Advanced Graphs/README.doctree b/_build/.doctrees/12. Advanced Graphs/README.doctree
deleted file mode 100644
index 01b3a0c..0000000
Binary files a/_build/.doctrees/12. Advanced Graphs/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree b/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree
deleted file mode 100644
index d5117c1..0000000
Binary files a/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree and /dev/null differ
diff --git a/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree b/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree
deleted file mode 100644
index fa72fda..0000000
Binary files a/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree and /dev/null differ
diff --git a/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree b/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree
deleted file mode 100644
index 6bc0e6b..0000000
Binary files a/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree and /dev/null differ
diff --git a/_build/.doctrees/13. One-D Dynamic Programming/README.doctree b/_build/.doctrees/13. One-D Dynamic Programming/README.doctree
deleted file mode 100644
index 71dbab0..0000000
Binary files a/_build/.doctrees/13. One-D Dynamic Programming/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree b/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree
deleted file mode 100644
index b1a6326..0000000
Binary files a/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/15. Greedy/README.doctree b/_build/.doctrees/15. Greedy/README.doctree
deleted file mode 100644
index d5cc623..0000000
Binary files a/_build/.doctrees/15. Greedy/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/16. Intervals/README.doctree b/_build/.doctrees/16. Intervals/README.doctree
deleted file mode 100644
index 4c01fad..0000000
Binary files a/_build/.doctrees/16. Intervals/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/17. Math Geometry/README.doctree b/_build/.doctrees/17. Math Geometry/README.doctree
deleted file mode 100644
index a4d593f..0000000
Binary files a/_build/.doctrees/17. Math Geometry/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/18. Bit Manipulation/README.doctree b/_build/.doctrees/18. Bit Manipulation/README.doctree
deleted file mode 100644
index e6afd99..0000000
Binary files a/_build/.doctrees/18. Bit Manipulation/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/Book.doctree b/_build/.doctrees/Book.doctree
deleted file mode 100644
index 3860721..0000000
Binary files a/_build/.doctrees/Book.doctree and /dev/null differ
diff --git a/_build/.doctrees/CODE_OF_CONDUCT.doctree b/_build/.doctrees/CODE_OF_CONDUCT.doctree
deleted file mode 100644
index 0f244a9..0000000
Binary files a/_build/.doctrees/CODE_OF_CONDUCT.doctree and /dev/null differ
diff --git a/_build/.doctrees/CONTRIBUTING.doctree b/_build/.doctrees/CONTRIBUTING.doctree
deleted file mode 100644
index 169d54d..0000000
Binary files a/_build/.doctrees/CONTRIBUTING.doctree and /dev/null differ
diff --git a/_build/.doctrees/README.doctree b/_build/.doctrees/README.doctree
deleted file mode 100644
index ba89dd9..0000000
Binary files a/_build/.doctrees/README.doctree and /dev/null differ
diff --git a/_build/.doctrees/SECURITY.doctree b/_build/.doctrees/SECURITY.doctree
deleted file mode 100644
index 22d9a6d..0000000
Binary files a/_build/.doctrees/SECURITY.doctree and /dev/null differ
diff --git a/_build/.doctrees/environment.pickle b/_build/.doctrees/environment.pickle
deleted file mode 100644
index 3703abd..0000000
Binary files a/_build/.doctrees/environment.pickle and /dev/null differ
diff --git a/_build/html/01. Array Hashing/1. Two Sum.html b/_build/html/01. Array Hashing/1. Two Sum.html
deleted file mode 100644
index e4849aa..0000000
--- a/_build/html/01. Array Hashing/1. Two Sum.html	
+++ /dev/null
@@ -1,720 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>100: Same Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/1. Two Sum';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="128. Longest Consecutive Sequence" href="128.%20Longest%20Consecutive%20Sequence.html" />
-    <link rel="prev" title="Array &amp; Hashing Solutions - Blind 75 LeetCode Problems" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/1. Two Sum.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/1. Two Sum.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>100: Same Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="same-tree">
-<h1>100: Same Tree<a class="headerlink" href="#same-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/same-tree/">To see the Same Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the roots of two binary trees <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>, write a function to check if they are the same or not.</p>
-<p>Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.</p>
-<p><strong>Constraints</strong></p>
-<ol class="arabic simple">
-<li><p>The number of nodes in both trees is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">Node.val</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="c1"># Initialize a TreeNode with a value (val), left child, and right child.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">):</span>
-    <span class="c1"># Base case: If both p and q are None, the trees are the same.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">p</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">q</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">True</span>
-    
-    <span class="c1"># Base case: If either p or q is None (but not both), the trees are different.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">p</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">q</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">False</span>
-    
-    <span class="c1"># Check if the values of the current nodes (p.val and q.val) are equal.</span>
-    <span class="k">if</span> <span class="n">p</span><span class="o">.</span><span class="n">val</span> <span class="o">!=</span> <span class="n">q</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">False</span>
-    
-    <span class="c1"># Recursively check the left and right subtrees of p and q.</span>
-    <span class="c1"># If both subtrees are the same, the entire trees are the same.</span>
-    <span class="k">return</span> <span class="n">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">q</span><span class="o">.</span><span class="n">left</span><span class="p">)</span> <span class="ow">and</span> <span class="n">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">q</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>In this code, we define a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class to represent binary tree nodes and a <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function to check if two binary trees are the same. The function uses recursive traversal to compare the trees’ structures and values.</p>
-<ol class="arabic simple">
-<li><p>We start by defining a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class, which represents a node in a binary tree. Each node has a <code class="docutils literal notranslate"><span class="pre">val</span></code> (the node’s value), a <code class="docutils literal notranslate"><span class="pre">left</span></code> child, and a right child. This class will help us create and work with binary trees.</p></li>
-<li><p>Next, we define the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function, which checks if two binary trees (<code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>) are the same.</p>
-<ul class="simple">
-<li><p>The base case for the recursion is when both <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> are <code class="docutils literal notranslate"><span class="pre">None</span></code>. In this case, they are considered the same, so we return <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If either <code class="docutils literal notranslate"><span class="pre">p</span></code> or <code class="docutils literal notranslate"><span class="pre">q</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> (but not both), they cannot be the same, so we return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If the values of the current nodes <code class="docutils literal notranslate"><span class="pre">p.val</span></code> and <code class="docutils literal notranslate"><span class="pre">q.val</span></code> are not equal, we return <code class="docutils literal notranslate"><span class="pre">False</span></code> because the trees cannot be the same.</p></li>
-<li><p>Finally, we recursively check the left and right subtrees of <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> to see if they are the same.</p></li>
-</ul>
-</li>
-</ol>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-
-<span class="c1">#Input: `p = [1,2,3]`, `q = [1,2,3]`</span>
-
-<span class="n">p1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="n">q1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p1</span><span class="p">,</span> <span class="n">q1</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-
-<span class="c1">#Input: `p = [1,2]`, `q = [1,null,2]`</span>
-
-<span class="n">p2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="kc">None</span><span class="p">)</span>
-<span class="n">q2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p2</span><span class="p">,</span> <span class="n">q2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 3</span>
-
-<span class="c1">#Input: p = [1,2,1], q = [1,1,2]</span>
-
-<span class="n">p3</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">))</span>
-<span class="n">q3</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p3</span><span class="p">,</span> <span class="n">q3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p><strong>Time Complexity</strong></p>
-<p>The time complexity of the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function can be analyzed as follows:</p>
-<p>In the worst case, the function needs to visit every node in both trees once to determine if they are the same.
-Since each node is visited exactly once, the time complexity is <span class="math notranslate nohighlight">\(O(n)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.</p>
-<p><strong>Space Complexity</strong>
-The space complexity of the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function can be analyzed as follows:</p>
-<p>The space used by the function’s call stack during recursion is proportional to the maximum depth of the binary trees.
-In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be <span class="math notranslate nohighlight">\(n\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.
-Therefore, the space complexity is <span class="math notranslate nohighlight">\(O(n)\)</span> due to the recursive call stack.
-In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.</p>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span> where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.</p></li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span> due to the recursive call stack.</p></li>
-</ul>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="128.%20Longest%20Consecutive%20Sequence.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">128. Longest Consecutive Sequence</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/01. Array Hashing/217. Contains Duplicate.html b/_build/html/01. Array Hashing/217. Contains Duplicate.html
deleted file mode 100644
index eb2c377..0000000
--- a/_build/html/01. Array Hashing/217. Contains Duplicate.html	
+++ /dev/null
@@ -1,721 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>217. Contains Duplicate &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/217. Contains Duplicate';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="238. Product of Array Except Self" href="238.%20Product%20of%20Array%20Except%20Self.html" />
-    <link rel="prev" title="128. Longest Consecutive Sequence" href="128.%20Longest%20Consecutive%20Sequence.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/217. Contains Duplicate.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/217. Contains Duplicate.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>217. Contains Duplicate</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="contains-duplicate">
-<h1>217. Contains Duplicate<a class="headerlink" href="#contains-duplicate" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/contains-duplicate/">To see the Contains Duplicate problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code>, return <code class="docutils literal notranslate"><span class="pre">true</span></code> if any value appears <strong>at least twice</strong> in the array, and return <code class="docutils literal notranslate"><span class="pre">false</span></code> if every element is distinct.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">nums.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^9\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^9\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">containsDuplicate</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-    <span class="c1"># Create an empty set to store unique elements</span>
-    <span class="n">unique_elements</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
-    
-    <span class="c1"># Iterate through the array</span>
-    <span class="k">for</span> <span class="n">num</span> <span class="ow">in</span> <span class="n">nums</span><span class="p">:</span>
-        <span class="c1"># If the element is already in the set, return True</span>
-        <span class="k">if</span> <span class="n">num</span> <span class="ow">in</span> <span class="n">unique_elements</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">True</span>
-        <span class="c1"># Otherwise, add it to the set</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">unique_elements</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">num</span><span class="p">)</span>
-    
-    <span class="c1"># If the loop completes without finding duplicates, return False</span>
-    <span class="k">return</span> <span class="kc">False</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">containsDuplicate</span></code> function takes a single argument, <code class="docutils literal notranslate"><span class="pre">nums</span></code>, which is the input integer array.</p></li>
-<li><p>Inside the function, an empty set called <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> is created. This set will be used to keep track of unique elements in the input array.</p></li>
-<li><p>The function then iterates through the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code> using a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop.</p></li>
-<li><p>For each element <code class="docutils literal notranslate"><span class="pre">num</span></code> in the array, it checks whether <code class="docutils literal notranslate"><span class="pre">num</span></code> is already in the <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set using the <code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">num</span> <span class="pre">in</span> <span class="pre">unique_elements:</span></code> condition.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">num</span></code> is already in the set, it means there is a duplicate element in the array, and the function immediately returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">num</span></code> is not in the set, it is added to the <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set using <code class="docutils literal notranslate"><span class="pre">unique_elements.add(num)</span></code>.</p></li>
-<li><p>The loop continues to the next element, and the process repeats.</p></li>
-<li><p>If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ol>
-<p>The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem’s requirements and constraints, as explained earlier.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">containsDuplicate</span><span class="p">(</span><span class="n">nums1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">containsDuplicate</span><span class="p">(</span><span class="n">nums2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-<span class="n">nums3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">containsDuplicate</span><span class="p">(</span><span class="n">nums3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code for the “Contains Duplicate” problem:</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The primary operation that affects the time complexity is the <code class="docutils literal notranslate"><span class="pre">for</span></code> loop that iterates through the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code>. In the worst case, the loop will iterate through all <code class="docutils literal notranslate"><span class="pre">n</span></code> elements of the array, where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the length of the input array.</p>
-<ul class="simple">
-<li><p>Iterating through the array: O(n)</p></li>
-</ul>
-<p>Inside the loop, we perform two operations:</p>
-<ol class="arabic simple">
-<li><p>Checking whether an element exists in the <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set (<code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">num</span> <span class="pre">in</span> <span class="pre">unique_elements</span></code>). This operation has an average time complexity of O(1) for a set.</p></li>
-<li><p>Adding an element to the <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set (<code class="docutils literal notranslate"><span class="pre">unique_elements.add(num)</span></code>), which also has an average time complexity of O(1) for a set.</p></li>
-</ol>
-<p>Since these operations are performed for each element in the array, the overall time complexity remains O(n).</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity is determined by the additional data structures used in the code, which are the <code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set.</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">unique_elements</span></code> set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all <code class="docutils literal notranslate"><span class="pre">n</span></code> elements.</p></li>
-</ul>
-<p>Therefore, the space complexity is O(n) because, in the worst case, the set’s size will grow linearly with the input array’s size.</p>
-<p><strong>In summary</strong>, the time complexity of the code is O(n), where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>K Duplicates:</strong> Modify the problem to return <code class="docutils literal notranslate"><span class="pre">true</span></code> if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns <code class="docutils literal notranslate"><span class="pre">true</span></code> if there are exactly K duplicates.</p></li>
-<li><p><strong>Frequency Count:</strong> Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="128.%20Longest%20Consecutive%20Sequence.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">128. Longest Consecutive Sequence</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="238.%20Product%20of%20Array%20Except%20Self.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">238. Product of Array Except Self</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/01. Array Hashing/238. Product of Array Except Self.html b/_build/html/01. Array Hashing/238. Product of Array Except Self.html
deleted file mode 100644
index f0fb48f..0000000
--- a/_build/html/01. Array Hashing/238. Product of Array Except Self.html	
+++ /dev/null
@@ -1,717 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>238. Product of Array Except Self &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/238. Product of Array Except Self';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="242. Valid Anagram" href="242.%20Valid%20Anagram.html" />
-    <link rel="prev" title="217. Contains Duplicate" href="217.%20Contains%20Duplicate.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/238. Product of Array Except Self.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/238. Product of Array Except Self.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>238. Product of Array Except Self</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="product-of-array-except-self">
-<h1>238. Product of Array Except Self<a class="headerlink" href="#product-of-array-except-self" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/product-of-array-except-self/">To see the Product of Array Except Self problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code>, return <em>an array <code class="docutils literal notranslate"><span class="pre">answer</span></code> such that <code class="docutils literal notranslate"><span class="pre">answer[i]</span></code> is equal to the product of all the elements of <code class="docutils literal notranslate"><span class="pre">nums</span></code> except <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code>.</em></p>
-<p>The product of any prefix or suffix of <code class="docutils literal notranslate"><span class="pre">nums</span></code> is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> integer.</p>
-<p>You must write an algorithm that runs in O(n) time and without using the division operation.</p>
-<p>Constraints:</p>
-<ul class="simple">
-<li><p>2 &lt;= <code class="docutils literal notranslate"><span class="pre">nums.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-30</span> <span class="pre">&lt;=</span> <span class="pre">nums[i]</span> <span class="pre">&lt;=</span> <span class="pre">30</span></code></p></li>
-<li><p>The product of any prefix or suffix of <code class="docutils literal notranslate"><span class="pre">nums</span></code> is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> integer.</p></li>
-</ul>
-<p><strong>Follow-up:</strong> Can you solve the problem in O(1) extra space complexity? (The output array <strong>does not</strong> count as extra space for space complexity analysis.)</p>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">productExceptSelf</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-    <span class="n">n</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-    
-    <span class="c1"># Initialize two arrays to store products to the left and right of each element</span>
-    <span class="n">left_products</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
-    <span class="n">right_products</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
-    
-    <span class="c1"># Calculate products to the left of each element</span>
-    <span class="n">left_product</span> <span class="o">=</span> <span class="mi">1</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-        <span class="n">left_products</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">left_product</span>
-        <span class="n">left_product</span> <span class="o">*=</span> <span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
-    
-    <span class="c1"># Calculate products to the right of each element</span>
-    <span class="n">right_product</span> <span class="o">=</span> <span class="mi">1</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
-        <span class="n">right_products</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">right_product</span>
-        <span class="n">right_product</span> <span class="o">*=</span> <span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
-    
-    <span class="c1"># Calculate the final answer using left and right products</span>
-    <span class="n">answer</span> <span class="o">=</span> <span class="p">[</span><span class="n">left_products</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">*</span> <span class="n">right_products</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">)]</span>
-    
-    <span class="k">return</span> <span class="n">answer</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span></code> is initialized as the length of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-<li><p>Two arrays, <code class="docutils literal notranslate"><span class="pre">left_products</span></code> and <code class="docutils literal notranslate"><span class="pre">right_products</span></code>, are created, each with a length of <code class="docutils literal notranslate"><span class="pre">n</span></code> and filled with ones initially.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">left_product</span></code> is initialized to 1.</p></li>
-<li><p>A loop iterates through the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array, from left to right. For each element at index <code class="docutils literal notranslate"><span class="pre">i</span></code>, it stores the product of all elements to its left (including itself) in the <code class="docutils literal notranslate"><span class="pre">left_products</span></code> array and updates <code class="docutils literal notranslate"><span class="pre">left_product</span></code> accordingly.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">right_product</span></code> is initialized to 1.</p></li>
-<li><p>Another loop iterates through the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array in reverse order, from right to left. For each element at index <code class="docutils literal notranslate"><span class="pre">i</span></code>, it stores the product of all elements to its right (including itself) in the <code class="docutils literal notranslate"><span class="pre">right_products</span></code> array and updates <code class="docutils literal notranslate"><span class="pre">right_product</span></code>.</p></li>
-<li><p>The final <code class="docutils literal notranslate"><span class="pre">answer</span></code> list is constructed by multiplying corresponding elements from the <code class="docutils literal notranslate"><span class="pre">left_products</span></code> and <code class="docutils literal notranslate"><span class="pre">right_products</span></code> arrays for each index <code class="docutils literal notranslate"><span class="pre">i</span></code>.</p></li>
-<li><p>The function returns the <code class="docutils literal notranslate"><span class="pre">answer</span></code> list, which contains the desired results.</p></li>
-</ol>
-<p>Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem’s constraints.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">]</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">productExceptSelf</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[24, 12, 8, 6]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">0</span><span class="p">,</span><span class="o">-</span><span class="mi">3</span><span class="p">,</span><span class="mi">3</span><span class="p">]</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">productExceptSelf</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[0, 0, 9, 0, 0]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The first loop iterates through the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-<li><p>The second loop also iterates through the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.</p></li>
-<li><p>The final loop constructs the <code class="docutils literal notranslate"><span class="pre">answer</span></code> list by multiplying elements from the <code class="docutils literal notranslate"><span class="pre">left_products</span></code> and <code class="docutils literal notranslate"><span class="pre">right_products</span></code> arrays. This loop runs in O(n) time.</p></li>
-</ol>
-<p>Since all the loops are independent and sequential, the overall time complexity is O(n).</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Two additional arrays, <code class="docutils literal notranslate"><span class="pre">left_products</span></code> and <code class="docutils literal notranslate"><span class="pre">right_products</span></code>, are created with a length of <code class="docutils literal notranslate"><span class="pre">n</span></code>, where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the length of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array. Therefore, these arrays consume O(n) extra space.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">left_product</span></code> and <code class="docutils literal notranslate"><span class="pre">right_product</span></code> variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">answer</span></code> list, which contains the final results, also consumes O(n) space, but it’s not counted toward the extra space complexity analysis as per the problem’s constraints.</p></li>
-</ol>
-<p>Overall, the space complexity is O(n) for this solution.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Handle Zeros in the Input</strong>: Modify the solution to handle cases where the input array contains zeros. For example, if <code class="docutils literal notranslate"><span class="pre">nums</span> <span class="pre">=</span> <span class="pre">[0,</span> <span class="pre">1,</span> <span class="pre">2,</span> <span class="pre">3,</span> <span class="pre">0]</span></code>, the output should be <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">0,</span> <span class="pre">0,</span> <span class="pre">0,</span> <span class="pre">0]</span></code> because any element multiplied by zero results in zero.</p></li>
-<li><p><strong>In-Place Modification</strong>: Attempt to solve the problem with in-place modification of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array, where the output is stored directly in the input array without using any additional space.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="217.%20Contains%20Duplicate.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">217. Contains Duplicate</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="242.%20Valid%20Anagram.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">242. Valid Anagram</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/01. Array Hashing/659. Encode and Decode Strings.html b/_build/html/01. Array Hashing/659. Encode and Decode Strings.html
deleted file mode 100644
index 64076e2..0000000
--- a/_build/html/01. Array Hashing/659. Encode and Decode Strings.html	
+++ /dev/null
@@ -1,728 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>659· Encode and Decode Strings &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/659. Encode and Decode Strings';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Two Pointers Problems - Blind 75 LeetCode" href="../02.%20Two%20Pointers/README.html" />
-    <link rel="prev" title="49. Group Anagrams" href="49.%20Group%20Anagrams.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/659. Encode and Decode Strings.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>659· Encode and Decode Strings</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="encode-and-decode-strings">
-<h1>659· Encode and Decode Strings<a class="headerlink" href="#encode-and-decode-strings" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://www.lintcode.com/problem/659/">To see the Encode and Decode Strings problem on LintCode, click here!</a></p>
-<hr class="docutils" />
-<p>Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.</p>
-<p>Please implement <code class="docutils literal notranslate"><span class="pre">encode</span></code> and <code class="docutils literal notranslate"><span class="pre">decode</span></code>.</p>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">Codec</span><span class="p">:</span>
-
-    <span class="k">def</span> <span class="nf">encode</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">strs</span><span class="p">):</span>
-<span class="w">        </span><span class="sd">&quot;&quot;&quot;Encodes a list of strings to a single string.</span>
-<span class="sd">        </span>
-<span class="sd">        :type strs: List[str]</span>
-<span class="sd">        :rtype: str</span>
-<span class="sd">        &quot;&quot;&quot;</span>
-        <span class="n">encoded</span> <span class="o">=</span> <span class="s2">&quot;&quot;</span>
-        <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="n">strs</span><span class="p">:</span>
-            <span class="n">encoded</span> <span class="o">+=</span> <span class="n">s</span><span class="o">.</span><span class="n">replace</span><span class="p">(</span><span class="s1">&#39;:&#39;</span><span class="p">,</span> <span class="s1">&#39;::&#39;</span><span class="p">)</span> <span class="o">+</span> <span class="s1">&#39;:;&#39;</span>
-        <span class="k">return</span> <span class="n">encoded</span>
-
-    <span class="k">def</span> <span class="nf">decode</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">s</span><span class="p">):</span>
-<span class="w">        </span><span class="sd">&quot;&quot;&quot;Decodes a single string to a list of strings.</span>
-<span class="sd">        </span>
-<span class="sd">        :type s: str</span>
-<span class="sd">        :rtype: List[str]</span>
-<span class="sd">        &quot;&quot;&quot;</span>
-        <span class="n">decoded</span> <span class="o">=</span> <span class="p">[]</span>
-        <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
-        <span class="k">while</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">):</span>
-            <span class="n">end</span> <span class="o">=</span> <span class="n">s</span><span class="o">.</span><span class="n">find</span><span class="p">(</span><span class="s1">&#39;:;&#39;</span><span class="p">,</span> <span class="n">i</span><span class="p">)</span>
-            <span class="k">if</span> <span class="n">end</span> <span class="o">==</span> <span class="o">-</span><span class="mi">1</span><span class="p">:</span>
-                <span class="n">end</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)</span>
-            <span class="n">decoded</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">s</span><span class="p">[</span><span class="n">i</span><span class="p">:</span><span class="n">end</span><span class="p">]</span><span class="o">.</span><span class="n">replace</span><span class="p">(</span><span class="s1">&#39;::&#39;</span><span class="p">,</span> <span class="s1">&#39;:&#39;</span><span class="p">))</span>
-            <span class="n">i</span> <span class="o">=</span> <span class="n">end</span> <span class="o">+</span> <span class="mi">2</span>
-        <span class="k">return</span> <span class="n">decoded</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We define a class called <code class="docutils literal notranslate"><span class="pre">Codec</span></code> to encapsulate the encoding and decoding operations for a list of strings.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">encode</span></code> method, we take a list of strings (<code class="docutils literal notranslate"><span class="pre">strs</span></code>) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter <code class="docutils literal notranslate"><span class="pre">:;</span></code>. We iterate through each string in the input list, replace any occurrence of <code class="docutils literal notranslate"><span class="pre">:</span></code> with <code class="docutils literal notranslate"><span class="pre">::</span></code> (to avoid conflicts with the delimiter), and then append <code class="docutils literal notranslate"><span class="pre">:;</span></code> to indicate the end of that string.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">decode</span></code> method, we take an encoded string (<code class="docutils literal notranslate"><span class="pre">s</span></code>) as input and return a list of strings. The decoding process involves splitting the encoded string using the <code class="docutils literal notranslate"><span class="pre">:;</span></code> delimiter. We start from the beginning of the encoded string (<code class="docutils literal notranslate"><span class="pre">i</span> <span class="pre">=</span> <span class="pre">0</span></code>) and repeatedly find the next occurrence of <code class="docutils literal notranslate"><span class="pre">:;</span></code>. We extract the substring between the current position (<code class="docutils literal notranslate"><span class="pre">i</span></code>) and the next delimiter (<code class="docutils literal notranslate"><span class="pre">end</span></code>). Before adding it to the result list, we replace any <code class="docutils literal notranslate"><span class="pre">::</span></code> with <code class="docutils literal notranslate"><span class="pre">:</span></code> to revert the encoding. We then update the current position <code class="docutils literal notranslate"><span class="pre">i</span></code> to be after the delimiter, so we can find the next substring in the next iteration.</p></li>
-<li><p>Finally, we create an instance of the <code class="docutils literal notranslate"><span class="pre">Codec</span></code> class and test it with two examples:</p></li>
-</ol>
-<p>By using the <code class="docutils literal notranslate"><span class="pre">:;</span></code> delimiter and handling the <code class="docutils literal notranslate"><span class="pre">::</span></code> escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-<span class="n">codec</span> <span class="o">=</span> <span class="n">Codec</span><span class="p">()</span>
-
-<span class="n">input1</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;lint&quot;</span><span class="p">,</span> <span class="s2">&quot;code&quot;</span><span class="p">,</span> <span class="s2">&quot;love&quot;</span><span class="p">,</span> <span class="s2">&quot;you&quot;</span><span class="p">]</span>
-<span class="n">encoded1</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">input1</span><span class="p">)</span>
-<span class="n">decoded1</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">encoded1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">decoded1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[&#39;lint&#39;, &#39;code&#39;, &#39;love&#39;, &#39;you&#39;]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">codec</span> <span class="o">=</span> <span class="n">Codec</span><span class="p">()</span> 
-
-<span class="n">input2</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;we&quot;</span><span class="p">,</span> <span class="s2">&quot;say&quot;</span><span class="p">,</span> <span class="s2">&quot;:&quot;</span><span class="p">,</span> <span class="s2">&quot;yes&quot;</span><span class="p">]</span>
-<span class="n">encoded2</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">input2</span><span class="p">)</span>
-<span class="n">decoded2</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">encoded2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">decoded2</span><span class="p">)</span>  
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[&#39;we&#39;, &#39;say&#39;, &#39;:&#39;, &#39;yes&#39;]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">encode</span></code> and <code class="docutils literal notranslate"><span class="pre">decode</span></code> methods in the provided code.</p>
-<p><strong>Encode Method (<code class="docutils literal notranslate"><span class="pre">encode</span></code>):</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: O(n * m)</p>
-<ul>
-<li><p>Here, <code class="docutils literal notranslate"><span class="pre">n</span></code> is the number of strings in the input list <code class="docutils literal notranslate"><span class="pre">strs</span></code>, and <code class="docutils literal notranslate"><span class="pre">m</span></code> is the average length of these strings.</p></li>
-<li><p>In the worst case, for each string in the list, we iterate over its characters once to replace any colons (<code class="docutils literal notranslate"><span class="pre">:</span></code>) with double colons (<code class="docutils literal notranslate"><span class="pre">::</span></code>) and then append <code class="docutils literal notranslate"><span class="pre">:;</span></code>. This is done for each string in the list.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: O(n * m)</p>
-<ul>
-<li><p>The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.</p></li>
-</ul>
-</li>
-</ul>
-<p><strong>Decode Method (<code class="docutils literal notranslate"><span class="pre">decode</span></code>):</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: O(n * m)</p>
-<ul>
-<li><p>Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the <code class="docutils literal notranslate"><span class="pre">:;</span></code> delimiter.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: O(n * m)</p>
-<ul>
-<li><p>The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.</p></li>
-</ul>
-</li>
-</ul>
-<p>Overall, both the <code class="docutils literal notranslate"><span class="pre">encode</span></code> and <code class="docutils literal notranslate"><span class="pre">decode</span></code> methods have time and space complexities of O(n * m), where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the number of strings in the input list, and <code class="docutils literal notranslate"><span class="pre">m</span></code> is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Multiple Delimiters</strong>: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.</p></li>
-<li><p><strong>Optimize Encoding</strong>: Modify the <code class="docutils literal notranslate"><span class="pre">encode</span></code> method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="49.%20Group%20Anagrams.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">49. Group Anagrams</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../02.%20Two%20Pointers/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Two Pointers Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/02. Two Pointers/15. 3Sum.html b/_build/html/02. Two Pointers/15. 3Sum.html
deleted file mode 100644
index 09448fe..0000000
--- a/_build/html/02. Two Pointers/15. 3Sum.html	
+++ /dev/null
@@ -1,751 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>15. 3Sum &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/15. 3Sum';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Sliding Window Problems - Blind 75 LeetCode" href="../03.%20Sliding%20Window/README.html" />
-    <link rel="prev" title="125. Valid Palindrome" href="125.%20Valid%20Palindrome.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F02. Two Pointers/15. 3Sum.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/02. Two Pointers/15. 3Sum.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>15. 3Sum</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="sum">
-<h1>15. 3Sum<a class="headerlink" href="#sum" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/3sum/">To see the 3Sum problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an integer array nums, <em>return all the triplets <code class="docutils literal notranslate"><span class="pre">[nums[i],</span> <span class="pre">nums[j],</span> <span class="pre">nums[k]]</span></code> such that <code class="docutils literal notranslate"><span class="pre">i</span> <span class="pre">!=</span> <span class="pre">j</span></code>, <code class="docutils literal notranslate"><span class="pre">i</span> <span class="pre">!=</span> <span class="pre">k</span></code>, and <code class="docutils literal notranslate"><span class="pre">j</span> <span class="pre">!=</span> <span class="pre">k</span></code>, and <code class="docutils literal notranslate"><span class="pre">nums[i]</span> <span class="pre">+</span> <span class="pre">nums[j]</span> <span class="pre">+</span> <span class="pre">nums[k]</span> <span class="pre">==</span> <span class="pre">0</span></code>.</em></p>
-<p><strong>Notice</strong> that the solution set must not contain duplicate triplets.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">3</span> <span class="pre">&lt;=</span> <span class="pre">nums.length</span> <span class="pre">&lt;=</span> <span class="pre">3000</span></code></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^5\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">threeSum</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-    <span class="c1"># Sort the input array in ascending order</span>
-    <span class="n">nums</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span>
-    <span class="n">triplets</span> <span class="o">=</span> <span class="p">[]</span>
-    
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">-</span> <span class="mi">2</span><span class="p">):</span>
-        <span class="c1"># Skip duplicates to avoid duplicate triplets</span>
-        <span class="k">if</span> <span class="n">i</span> <span class="o">&gt;</span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">nums</span><span class="p">[</span><span class="n">i</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]:</span>
-            <span class="k">continue</span>
-        
-        <span class="n">left</span><span class="p">,</span> <span class="n">right</span> <span class="o">=</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-        
-        <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span><span class="p">:</span>
-            <span class="c1"># Calculate the total sum of the current triplet</span>
-            <span class="n">total</span> <span class="o">=</span> <span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">+</span> <span class="n">nums</span><span class="p">[</span><span class="n">left</span><span class="p">]</span> <span class="o">+</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]</span>
-            
-            <span class="k">if</span> <span class="n">total</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-                <span class="c1"># If the total is zero, we found a valid triplet</span>
-                <span class="n">triplets</span><span class="o">.</span><span class="n">append</span><span class="p">([</span><span class="n">nums</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">nums</span><span class="p">[</span><span class="n">left</span><span class="p">],</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]])</span>
-                
-                <span class="c1"># Skip duplicates of left and right pointers</span>
-                <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span> <span class="ow">and</span> <span class="n">nums</span><span class="p">[</span><span class="n">left</span><span class="p">]</span> <span class="o">==</span> <span class="n">nums</span><span class="p">[</span><span class="n">left</span> <span class="o">+</span> <span class="mi">1</span><span class="p">]:</span>
-                    <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-                <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span> <span class="ow">and</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]</span> <span class="o">==</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]:</span>
-                    <span class="n">right</span> <span class="o">-=</span> <span class="mi">1</span>
-                
-                <span class="c1"># Move the pointers to the next unique elements</span>
-                <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-                <span class="n">right</span> <span class="o">-=</span> <span class="mi">1</span>
-            <span class="k">elif</span> <span class="n">total</span> <span class="o">&lt;</span> <span class="mi">0</span><span class="p">:</span>
-                <span class="c1"># If the total is negative, we need to increase the sum by moving the left pointer to the right</span>
-                <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-            <span class="k">else</span><span class="p">:</span>
-                <span class="c1"># If the total is positive, we need to decrease the sum by moving the right pointer to the left</span>
-                <span class="n">right</span> <span class="o">-=</span> <span class="mi">1</span>
-    
-    <span class="k">return</span> <span class="n">triplets</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>It starts by sorting the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code> in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.</p></li>
-<li><p>It initializes an empty list <code class="docutils literal notranslate"><span class="pre">triplets</span></code> to store the unique triplets that meet the given conditions.</p></li>
-<li><p>The code then iterates through the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array using a loop with index <code class="docutils literal notranslate"><span class="pre">i</span></code>. This loop will consider each element of the array as a potential starting point for a triplet.</p></li>
-<li><p>Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> is the same as the previous element <code class="docutils literal notranslate"><span class="pre">nums[i-1]</span></code>, it continues to the next iteration of the loop.</p></li>
-<li><p>Two pointers, <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>, are initialized. <code class="docutils literal notranslate"><span class="pre">left</span></code> starts just after the current element <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code>, and <code class="docutils literal notranslate"><span class="pre">right</span></code> starts at the end of the array.</p></li>
-<li><p>The code enters another loop with <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers, trying to find a triplet that sums up to zero.</p></li>
-<li><p>It calculates the <code class="docutils literal notranslate"><span class="pre">total</span></code> sum of the current triplet as <code class="docutils literal notranslate"><span class="pre">nums[i]</span> <span class="pre">+</span> <span class="pre">nums[left]</span> <span class="pre">+</span> <span class="pre">nums[right]</span></code>.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">total</span></code> is zero, it means a valid triplet is found, so it appends <code class="docutils literal notranslate"><span class="pre">[nums[i],</span> <span class="pre">nums[left],</span> <span class="pre">nums[right]]</span></code> to the <code class="docutils literal notranslate"><span class="pre">triplets</span></code> list. Then, it moves both the <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers to their next unique elements while skipping duplicates.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">total</span></code> is less than zero, it means the sum is negative, so it increments the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer to move towards a larger sum.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">total</span></code> is greater than zero, it means the sum is positive, so it decrements the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer to move towards a smaller sum.</p></li>
-<li><p>This process continues until all possible triplets have been considered.</p></li>
-<li><p>Finally, the function returns the <code class="docutils literal notranslate"><span class="pre">triplets</span></code> list, which contains all the unique triplets that sum up to zero in the sorted <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">4</span><span class="p">]</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">threeSum</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[-1, -1, 2], [-1, 0, 1]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">threeSum</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">threeSum</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[0, 0, 0]]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">threeSum</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Sorting the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code> takes O(n log n) time, where n is the length of the array.</p></li>
-<li><p>The outer loop runs for each element of the array, so it iterates O(n) times.</p></li>
-<li><p>Inside the outer loop, we have a while loop with two pointers (<code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>). In the worst case, the while loop can iterate O(n) times (when all elements are unique).</p></li>
-<li><p>Inside the while loop, we have constant time operations (additions, comparisons, and list appends).</p></li>
-</ol>
-<p>Overall, the time complexity of the <code class="docutils literal notranslate"><span class="pre">threeSum</span></code> function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The space used by the <code class="docutils literal notranslate"><span class="pre">triplets</span></code> list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.</p></li>
-<li><p>Other than the <code class="docutils literal notranslate"><span class="pre">triplets</span></code> list, the function uses only a constant amount of additional space for variables like <code class="docutils literal notranslate"><span class="pre">i</span></code>, <code class="docutils literal notranslate"><span class="pre">left</span></code>, <code class="docutils literal notranslate"><span class="pre">right</span></code>, and <code class="docutils literal notranslate"><span class="pre">total</span></code>.</p></li>
-</ol>
-<p>Overall, the space complexity of the <code class="docutils literal notranslate"><span class="pre">threeSum</span></code> function is O(k), where k is the number of unique triplets that meet the criteria. It’s important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.</p>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.</p></li>
-<li><p>Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria.</p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>K-Sum Problem:</strong> Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.</p></li>
-<li><p><strong>Count the Number of Unique Triplets:</strong> Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./02. Two Pointers"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="125.%20Valid%20Palindrome.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">125. Valid Palindrome</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../03.%20Sliding%20Window/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Sliding Window Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html b/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html
deleted file mode 100644
index 491b7ec..0000000
--- a/_build/html/03. Sliding Window/3. Longest Substring Without Repeating Characters.html	
+++ /dev/null
@@ -1,731 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>3. Longest Substring Without Repeating Characters &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/3. Longest Substring Without Repeating Characters';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="424. Longest Repeating Character Replacement" href="424.%20Longest%20Repeating%20Character%20Replacement.html" />
-    <link rel="prev" title="121. Best Time to Buy and Sell Stock" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/3. Longest Substring Without Repeating Characters.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>3. Longest Substring Without Repeating Characters</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="longest-substring-without-repeating-characters">
-<h1>3. Longest Substring Without Repeating Characters<a class="headerlink" href="#longest-substring-without-repeating-characters" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given a string <code class="docutils literal notranslate"><span class="pre">s</span></code>, find the length of the <strong>longest substring</strong> without repeating characters.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">s.length</span></code> &lt;= <span class="math notranslate nohighlight">\(5 * 10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> consists of English letters, digits, symbols and spaces.</p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">length_of_longest_substring</span><span class="p">(</span><span class="n">s</span><span class="p">):</span>
-    <span class="c1"># Create a dictionary to store the index of each character&#39;s last occurrence.</span>
-    <span class="n">char_index</span> <span class="o">=</span> <span class="p">{}</span>
-    
-    <span class="c1"># Initialize variables to keep track of the start and end of the current substring.</span>
-    <span class="n">start</span> <span class="o">=</span> <span class="mi">0</span>
-    <span class="n">max_length</span> <span class="o">=</span> <span class="mi">0</span>
-    
-    <span class="k">for</span> <span class="n">end</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)):</span>
-        <span class="c1"># If the character is in the dictionary and its last occurrence is after the start of the current substring,</span>
-        <span class="c1"># update the start of the substring to the next character after its last occurrence.</span>
-        <span class="k">if</span> <span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]</span> <span class="ow">in</span> <span class="n">char_index</span> <span class="ow">and</span> <span class="n">char_index</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]]</span> <span class="o">&gt;=</span> <span class="n">start</span><span class="p">:</span>
-            <span class="n">start</span> <span class="o">=</span> <span class="n">char_index</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]]</span> <span class="o">+</span> <span class="mi">1</span>
-        
-        <span class="c1"># Update the last occurrence index of the current character.</span>
-        <span class="n">char_index</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]]</span> <span class="o">=</span> <span class="n">end</span>
-        
-        <span class="c1"># Calculate the length of the current substring and update the maximum length if necessary.</span>
-        <span class="n">current_length</span> <span class="o">=</span> <span class="n">end</span> <span class="o">-</span> <span class="n">start</span> <span class="o">+</span> <span class="mi">1</span>
-        <span class="n">max_length</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_length</span><span class="p">,</span> <span class="n">current_length</span><span class="p">)</span>
-    
-    <span class="k">return</span> <span class="n">max_length</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining a function called <code class="docutils literal notranslate"><span class="pre">length_of_longest_substring</span></code> that takes a single argument <code class="docutils literal notranslate"><span class="pre">s</span></code>, which is the input string for which we want to find the length of the longest substring without repeating characters.</p></li>
-<li><p>We create a dictionary called <code class="docutils literal notranslate"><span class="pre">char_index</span></code> to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.</p></li>
-<li><p>We initialize two variables, <code class="docutils literal notranslate"><span class="pre">start</span></code> and <code class="docutils literal notranslate"><span class="pre">max_length</span></code>.</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">start</span></code> represents the start index of the current substring without repeating characters. It starts at 0.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">max_length</span></code> is used to keep track of the maximum length found so far and is initially set to 0.</p></li>
-</ul>
-</li>
-<li><p>We then iterate through the input string <code class="docutils literal notranslate"><span class="pre">s</span></code> using a for loop, where the loop variable <code class="docutils literal notranslate"><span class="pre">end</span></code> represents the current end index of the substring we are considering.</p></li>
-<li><p>Inside the loop:</p>
-<ul class="simple">
-<li><p>We check if the character <code class="docutils literal notranslate"><span class="pre">s[end]</span></code> is already in the <code class="docutils literal notranslate"><span class="pre">char_index</span></code> dictionary and if its last occurrence is within or after the current substring. If so, it means that we’ve encountered a repeating character, and we need to update the <code class="docutils literal notranslate"><span class="pre">start</span></code> of the substring to the next character after the last occurrence of <code class="docutils literal notranslate"><span class="pre">s[end]</span></code>. This ensures that we have a new valid substring without repeating characters.</p></li>
-<li><p>We then update the <code class="docutils literal notranslate"><span class="pre">char_index</span></code> dictionary by storing the current index <code class="docutils literal notranslate"><span class="pre">end</span></code> as the last occurrence index of the character <code class="docutils literal notranslate"><span class="pre">s[end]</span></code>.</p></li>
-</ul>
-</li>
-<li><p>Next, we calculate the length of the current substring without repeating characters, which is <code class="docutils literal notranslate"><span class="pre">current_length</span> <span class="pre">=</span> <span class="pre">end</span> <span class="pre">-</span> <span class="pre">start</span> <span class="pre">+</span> <span class="pre">1</span></code>. We add 1 to account for the fact that the indices are zero-based.</p></li>
-<li><p>We update the <code class="docutils literal notranslate"><span class="pre">max_length</span></code> with the maximum of its current value and the <code class="docutils literal notranslate"><span class="pre">current_length</span></code>. This step ensures that we keep track of the longest valid substring we have encountered so far.</p></li>
-<li><p>The loop continues to iterate through the input string, and at the end, we return the <code class="docutils literal notranslate"><span class="pre">max_length</span></code>, which represents the length of the longest substring without repeating characters.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">length_of_longest_substring</span><span class="p">(</span><span class="s2">&quot;abcabcbb&quot;</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">length_of_longest_substring</span><span class="p">(</span><span class="s2">&quot;bbbbb&quot;</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">length_of_longest_substring</span><span class="p">(</span><span class="s2">&quot;pwwkew&quot;</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">length_of_longest_substring</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The function iterates through the input string <code class="docutils literal notranslate"><span class="pre">s</span></code> using a single for loop. The loop runs from the beginning of the string to the end once.</p></li>
-<li><p>Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.</p></li>
-<li><p>Therefore, the time complexity of the function is O(n), where n is the length of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The primary data structure that consumes space in this function is the <code class="docutils literal notranslate"><span class="pre">char_index</span></code> dictionary.</p></li>
-<li><p>In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.</p></li>
-<li><p>Therefore, the space complexity is O(min(n, m)), where n is the length of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).</p></li>
-<li><p>Additionally, there are a few integer variables used for indices and lengths, which consume constant space.</p></li>
-<li><p>Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.</p></li>
-</ul>
-<p><strong>In summary,</strong> the time complexity of the <code class="docutils literal notranslate"><span class="pre">length_of_longest_substring</span></code> function is O(n), and the space complexity is O(n) in the worst case due to the <code class="docutils literal notranslate"><span class="pre">char_index</span></code> dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Longest Substring with K Distinct Characters:</strong> Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string “abcabcbb” and K = 2, the answer would be 4 because the longest substring with two distinct characters is “abca.”</p></li>
-<li><p><strong>Longest Substring with Unique Characters:</strong> Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string “abcabcbb,” the answer would be 4 because “abcd” is the longest substring with unique characters.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./03. Sliding Window"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">121. Best Time to Buy and Sell Stock</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="424.%20Longest%20Repeating%20Character%20Replacement.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">424. Longest Repeating Character Replacement</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/03. Sliding Window/76. Minimum Window Substring.html b/_build/html/03. Sliding Window/76. Minimum Window Substring.html
deleted file mode 100644
index 74efd3a..0000000
--- a/_build/html/03. Sliding Window/76. Minimum Window Substring.html	
+++ /dev/null
@@ -1,761 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>76. Minimum Window Substring &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/76. Minimum Window Substring';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Stack Problems - Blind 75 LeetCode" href="../04.%20Stack/README.html" />
-    <link rel="prev" title="424. Longest Repeating Character Replacement" href="424.%20Longest%20Repeating%20Character%20Replacement.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/76. Minimum Window Substring.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/03. Sliding Window/76. Minimum Window Substring.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>76. Minimum Window Substring</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="minimum-window-substring">
-<h1>76. Minimum Window Substring<a class="headerlink" href="#minimum-window-substring" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/minimum-window-substring/">To see the Minimum Window Substring problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given two strings <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code> of lengths <code class="docutils literal notranslate"><span class="pre">m</span></code> and <code class="docutils literal notranslate"><span class="pre">n</span></code> respectively, return <em>the <strong>minimum window substring</strong> of <code class="docutils literal notranslate"><span class="pre">s</span></code> such that every character in <code class="docutils literal notranslate"><span class="pre">t</span></code> (<strong>including duplicates</strong>) is included in the window. If there is no such substring, return the empty string <code class="docutils literal notranslate"><span class="pre">&quot;&quot;</span></code>.</em></p>
-<p>The testcases will be generated such that the answer is <strong>unique</strong>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">==</span> <span class="pre">s.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">t.length</span></code></p></li>
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">m,</span> <span class="pre">n</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code> consist of uppercase and lowercase English letters.</p></li>
-</ul>
-<p><strong>Follow up</strong>: Could you find an algorithm that runs in <span class="math notranslate nohighlight">\(O(m + n)\)</span> time?</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">min_window_substring</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">t</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">s</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">t</span><span class="p">:</span>
-        <span class="k">return</span> <span class="s2">&quot;&quot;</span>
-
-    <span class="c1"># Initialize dictionaries to keep track of character counts for t and the current window in s.</span>
-    <span class="n">t_dict</span> <span class="o">=</span> <span class="p">{}</span>
-    <span class="n">current_window_dict</span> <span class="o">=</span> <span class="p">{}</span>
-    
-    <span class="c1"># Populate t_dict with character counts for string t.</span>
-    <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">t</span><span class="p">:</span>
-        <span class="n">t_dict</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="n">t_dict</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">char</span><span class="p">,</span> <span class="mi">0</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
-
-    <span class="c1"># Initialize pointers for the sliding window.</span>
-    <span class="n">left</span> <span class="o">=</span> <span class="mi">0</span>
-    <span class="n">min_len</span> <span class="o">=</span> <span class="nb">float</span><span class="p">(</span><span class="s1">&#39;inf&#39;</span><span class="p">)</span>
-    <span class="n">min_window</span> <span class="o">=</span> <span class="s2">&quot;&quot;</span>
-    <span class="n">required_chars</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">t_dict</span><span class="p">)</span>
-
-    <span class="c1"># Initialize a variable to keep track of how many required characters have been found in the current window.</span>
-    <span class="n">found_chars</span> <span class="o">=</span> <span class="mi">0</span>
-
-    <span class="c1"># Iterate over the string s using the right pointer.</span>
-    <span class="k">for</span> <span class="n">right</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)):</span>
-        <span class="n">char</span> <span class="o">=</span> <span class="n">s</span><span class="p">[</span><span class="n">right</span><span class="p">]</span>
-
-        <span class="c1"># Update the current_window_dict.</span>
-        <span class="n">current_window_dict</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="n">current_window_dict</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">char</span><span class="p">,</span> <span class="mi">0</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
-
-        <span class="c1"># Check if the current character is a required character and if its count matches the required count.</span>
-        <span class="k">if</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">t_dict</span> <span class="ow">and</span> <span class="n">current_window_dict</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">==</span> <span class="n">t_dict</span><span class="p">[</span><span class="n">char</span><span class="p">]:</span>
-            <span class="n">found_chars</span> <span class="o">+=</span> <span class="mi">1</span>
-
-        <span class="c1"># Try to minimize the window by moving the left pointer.</span>
-        <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;=</span> <span class="n">right</span> <span class="ow">and</span> <span class="n">found_chars</span> <span class="o">==</span> <span class="n">required_chars</span><span class="p">:</span>
-            <span class="c1"># Calculate the current window size.</span>
-            <span class="n">window_size</span> <span class="o">=</span> <span class="n">right</span> <span class="o">-</span> <span class="n">left</span> <span class="o">+</span> <span class="mi">1</span>
-
-            <span class="c1"># If the current window is smaller than the minimum found so far, update min_len and min_window.</span>
-            <span class="k">if</span> <span class="n">window_size</span> <span class="o">&lt;</span> <span class="n">min_len</span><span class="p">:</span>
-                <span class="n">min_len</span> <span class="o">=</span> <span class="n">window_size</span>
-                <span class="n">min_window</span> <span class="o">=</span> <span class="n">s</span><span class="p">[</span><span class="n">left</span><span class="p">:</span><span class="n">right</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span>
-
-            <span class="c1"># Move the left pointer to the right to shrink the window.</span>
-            <span class="n">left_char</span> <span class="o">=</span> <span class="n">s</span><span class="p">[</span><span class="n">left</span><span class="p">]</span>
-            <span class="n">current_window_dict</span><span class="p">[</span><span class="n">left_char</span><span class="p">]</span> <span class="o">-=</span> <span class="mi">1</span>
-
-            <span class="c1"># Check if the character removed from the window was a required character.</span>
-            <span class="k">if</span> <span class="n">left_char</span> <span class="ow">in</span> <span class="n">t_dict</span> <span class="ow">and</span> <span class="n">current_window_dict</span><span class="p">[</span><span class="n">left_char</span><span class="p">]</span> <span class="o">&lt;</span> <span class="n">t_dict</span><span class="p">[</span><span class="n">left_char</span><span class="p">]:</span>
-                <span class="n">found_chars</span> <span class="o">-=</span> <span class="mi">1</span>
-
-            <span class="c1"># Move the left pointer further to continue shrinking the window.</span>
-            <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-
-    <span class="k">return</span> <span class="n">min_window</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by checking if either of the input strings <code class="docutils literal notranslate"><span class="pre">s</span></code> or <code class="docutils literal notranslate"><span class="pre">t</span></code> is empty. If either of them is empty, we return an empty string since there can’t be any valid substring in this case.</p></li>
-<li><p>We initialize two dictionaries: <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> and <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code>. These dictionaries will be used to keep track of character counts in the string <code class="docutils literal notranslate"><span class="pre">t</span></code> and the current window in string <code class="docutils literal notranslate"><span class="pre">s</span></code>, respectively.</p></li>
-<li><p>We populate the <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> dictionary by iterating through string <code class="docutils literal notranslate"><span class="pre">t</span></code>. For each character, we increment its count in the dictionary using <code class="docutils literal notranslate"><span class="pre">t_dict.get(char,</span> <span class="pre">0)</span> <span class="pre">+</span> <span class="pre">1</span></code>. This allows us to count the occurrences of each character in <code class="docutils literal notranslate"><span class="pre">t</span></code>.</p></li>
-<li><p>We initialize two pointers: <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>. The <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer will represent the start of the current window, and the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer will represent the end of the current window. We also initialize <code class="docutils literal notranslate"><span class="pre">min_len</span></code> to store the length of the minimum window found so far, and <code class="docutils literal notranslate"><span class="pre">min_window</span></code> to store the actual minimum window substring.</p></li>
-<li><p>We determine the number of required characters in <code class="docutils literal notranslate"><span class="pre">t</span></code> (i.e., the number of distinct characters in <code class="docutils literal notranslate"><span class="pre">t</span></code>) and store it in the variable <code class="docutils literal notranslate"><span class="pre">required_chars</span></code>.</p></li>
-<li><p>We initialize a variable <code class="docutils literal notranslate"><span class="pre">found_chars</span></code> to keep track of how many required characters have been found in the current window. Initially, it is set to 0.</p></li>
-<li><p>We iterate over the string <code class="docutils literal notranslate"><span class="pre">s</span></code> using the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer. In each iteration, we do the following:</p>
-<ul class="simple">
-<li><p>Update the <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> by incrementing the count of the current character.</p></li>
-<li><p>Check if the current character is a required character (present in <code class="docutils literal notranslate"><span class="pre">t_dict</span></code>) and if its count in the <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> matches the required count from <code class="docutils literal notranslate"><span class="pre">t_dict</span></code>. If so, we increment <code class="docutils literal notranslate"><span class="pre">found_chars</span></code>.</p></li>
-</ul>
-</li>
-<li><p>After updating the window, we attempt to minimize the window size by moving the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer to the right. In this step, we:</p>
-<ul class="simple">
-<li><p>Calculate the size of the current window.</p></li>
-<li><p>If the current window size is smaller than the minimum found so far (<code class="docutils literal notranslate"><span class="pre">min_len</span></code>), we update <code class="docutils literal notranslate"><span class="pre">min_len</span></code> and <code class="docutils literal notranslate"><span class="pre">min_window</span></code> to store the current window substring.</p></li>
-<li><p>Move the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer to the right to shrink the window.</p></li>
-<li><p>Check if the character being removed from the window was a required character. If it was, we decrement <code class="docutils literal notranslate"><span class="pre">found_chars</span></code>.</p></li>
-<li><p>Continue moving the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer further to continue shrinking the window if the window still contains all required characters.</p></li>
-</ul>
-</li>
-<li><p>Finally, we return <code class="docutils literal notranslate"><span class="pre">min_window</span></code>, which will contain the minimum window substring that contains all characters from <code class="docutils literal notranslate"><span class="pre">t</span></code>.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">min_window_substring</span><span class="p">(</span><span class="s2">&quot;ADOBECODEBANC&quot;</span><span class="p">,</span> <span class="s2">&quot;ABC&quot;</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>BANC
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">min_window_substring</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>a
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">min_window_substring</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;aa&quot;</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">min_window_substring</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The main loop iterates through the string <code class="docutils literal notranslate"><span class="pre">s</span></code> from left to right using the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer. This loop runs in O(m) time, where ‘m’ is the length of string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-<li><p>Inside the loop, we have a while loop that moves the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer all the way to the end of the string.</p></li>
-<li><p>Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.</p></li>
-<li><p>The initialization of the <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> dictionary takes O(n) time, where ‘n’ is the length of string <code class="docutils literal notranslate"><span class="pre">t</span></code>.</p></li>
-</ul>
-<p>Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string <code class="docutils literal notranslate"><span class="pre">s</span></code>, and the length of string <code class="docutils literal notranslate"><span class="pre">t</span></code> has a smaller impact.</p>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity is determined by the space used by the <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> dictionary, the <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> dictionary, and a few variables.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> dictionary stores character counts for string <code class="docutils literal notranslate"><span class="pre">t</span></code>. In the worst case, when all characters in <code class="docutils literal notranslate"><span class="pre">t</span></code> are distinct, this dictionary can have a maximum of ‘n’ key-value pairs. So, the space complexity for <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> is O(n).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> dictionary stores character counts for the current window. In the worst case, it can have a maximum of ‘m’ key-value pairs. So, the space complexity for <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> is also O(m).</p></li>
-<li><p>Other variables used in the function, such as <code class="docutils literal notranslate"><span class="pre">left</span></code>, <code class="docutils literal notranslate"><span class="pre">right</span></code>, <code class="docutils literal notranslate"><span class="pre">min_len</span></code>, <code class="docutils literal notranslate"><span class="pre">min_window</span></code>, <code class="docutils literal notranslate"><span class="pre">required_chars</span></code>, and <code class="docutils literal notranslate"><span class="pre">found_chars</span></code>, are all of constant size and do not depend on the input sizes.</p></li>
-</ul>
-<p><strong>In summary</strong>, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings’ lengths. This is because the space used for <code class="docutils literal notranslate"><span class="pre">t_dict</span></code> and <code class="docutils literal notranslate"><span class="pre">current_window_dict</span></code> dominates the space complexity.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Smallest Distinct Substring:</strong> Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.</p></li>
-<li><p><strong>No Extra Space:</strong> Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./03. Sliding Window"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="424.%20Longest%20Repeating%20Character%20Replacement.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">424. Longest Repeating Character Replacement</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../04.%20Stack/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Stack Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/06. Linked List/19. Remove Nth Node From End of List.html b/_build/html/06. Linked List/19. Remove Nth Node From End of List.html
deleted file mode 100644
index 8a7a4df..0000000
--- a/_build/html/06. Linked List/19. Remove Nth Node From End of List.html	
+++ /dev/null
@@ -1,775 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>19. Remove Nth Node From End of List &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/19. Remove Nth Node From End of List';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="206. Reverse Linked List" href="206.%20Reverse%20Linked%20List.html" />
-    <link rel="prev" title="143. Reorder List" href="143.%20Reorder%20List.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/19. Remove Nth Node From End of List.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>19. Remove Nth Node From End of List</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="remove-nth-node-from-end-of-list">
-<h1>19. Remove Nth Node From End of List<a class="headerlink" href="#remove-nth-node-from-end-of-list" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/">To see the Remove Nth Node From End of List problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the head of a linked list, remove the <span class="math notranslate nohighlight">\(n^{th}\)</span> node from the end of the list and return its head.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the list is <code class="docutils literal notranslate"><span class="pre">sz</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">sz</span> <span class="pre">&lt;=</span> <span class="pre">30</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">sz</span></code></p></li>
-</ul>
-<p><strong>Follow up:</strong> Could you do this in one pass?</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">next</span>
-
-<span class="k">def</span> <span class="nf">removeNthFromEnd</span><span class="p">(</span><span class="n">head</span><span class="p">,</span> <span class="n">n</span><span class="p">):</span>
-    <span class="c1"># Create a dummy node to handle the case of removing the head node.</span>
-    <span class="n">dummy</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-    <span class="n">dummy</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="n">first</span> <span class="o">=</span> <span class="n">dummy</span>
-    <span class="n">second</span> <span class="o">=</span> <span class="n">dummy</span>
-    
-    <span class="c1"># Advance the first pointer by n+1 nodes.</span>
-    <span class="k">for</span> <span class="n">_</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span> <span class="o">+</span> <span class="mi">1</span><span class="p">):</span>
-        <span class="n">first</span> <span class="o">=</span> <span class="n">first</span><span class="o">.</span><span class="n">next</span>
-    
-    <span class="c1"># Move both pointers simultaneously until first reaches the end.</span>
-    <span class="k">while</span> <span class="n">first</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
-        <span class="n">first</span> <span class="o">=</span> <span class="n">first</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">second</span> <span class="o">=</span> <span class="n">second</span><span class="o">.</span><span class="n">next</span>
-    
-    <span class="c1"># Remove the nth node by updating the next pointer of the previous node.</span>
-    <span class="n">second</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">second</span><span class="o">.</span><span class="n">next</span><span class="o">.</span><span class="n">next</span>
-    
-    <span class="k">return</span> <span class="n">dummy</span><span class="o">.</span><span class="n">next</span>  <span class="c1"># Return the modified head of the linked list</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining a <code class="docutils literal notranslate"><span class="pre">ListNode</span></code> class to represent individual nodes in a linked list. Each node has two attributes: <code class="docutils literal notranslate"><span class="pre">val</span></code> (the value of the node) and <code class="docutils literal notranslate"><span class="pre">next</span></code> (a reference to the next node in the list).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function takes the head of a linked list (<code class="docutils literal notranslate"><span class="pre">head</span></code>) and the value <code class="docutils literal notranslate"><span class="pre">n</span></code>, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.</p></li>
-<li><p>We create a dummy node (<code class="docutils literal notranslate"><span class="pre">dummy</span></code>) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.</p></li>
-<li><p>We initialize two pointers, <code class="docutils literal notranslate"><span class="pre">first</span></code> and <code class="docutils literal notranslate"><span class="pre">second</span></code>, both initially pointing to the dummy node.</p></li>
-<li><p>To advance the <code class="docutils literal notranslate"><span class="pre">first</span></code> pointer by <code class="docutils literal notranslate"><span class="pre">n+1</span></code> nodes, we use a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop. This positions the <code class="docutils literal notranslate"><span class="pre">first</span></code> pointer <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes ahead of the <code class="docutils literal notranslate"><span class="pre">second</span></code> pointer.</p></li>
-<li><p>We then move both <code class="docutils literal notranslate"><span class="pre">first</span></code> and <code class="docutils literal notranslate"><span class="pre">second</span></code> pointers simultaneously until <code class="docutils literal notranslate"><span class="pre">first</span></code> reaches the end of the list. This ensures that the <code class="docutils literal notranslate"><span class="pre">second</span></code> pointer ends up pointing to the node that needs to be removed.</p></li>
-<li><p>To remove the nth node from the end, we update the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer of the node pointed to by the <code class="docutils literal notranslate"><span class="pre">second</span></code> pointer to skip over the node to be removed.</p></li>
-<li><p>Finally, we return <code class="docutils literal notranslate"><span class="pre">dummy.next</span></code>, which is the modified head of the linked list without the removed node.</p></li>
-<li><p>Additionally, there are two helper functions:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">createLinkedList(values)</span></code> creates a linked list from a list of values.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">convertToList(head)</span></code> converts a linked list back into a list of values.</p></li>
-</ul>
-</li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Helper function to create a linked list from a list of values.</span>
-<span class="k">def</span> <span class="nf">createLinkedList</span><span class="p">(</span><span class="n">values</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">values</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">None</span>
-    <span class="n">head</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="n">values</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="k">for</span> <span class="n">val</span> <span class="ow">in</span> <span class="n">values</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">head</span>
-
-<span class="c1"># Helper function to convert a linked list to a list of values.</span>
-<span class="k">def</span> <span class="nf">convertToList</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">current</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s explain the two helper functions:</p>
-<ol class="arabic">
-<li><p><code class="docutils literal notranslate"><span class="pre">createLinkedList(values)</span></code>: This function creates a linked list from a list of values.</p>
-<ul class="simple">
-<li><p>Input: <code class="docutils literal notranslate"><span class="pre">values</span></code> is a list containing values that you want to insert into the linked list.</p></li>
-<li><p>Output: The function returns the head of the created linked list.</p></li>
-</ul>
-<p>Explanation:</p>
-<ul class="simple">
-<li><p>The function starts by checking if the <code class="docutils literal notranslate"><span class="pre">values</span></code> list is empty. If it is, it returns <code class="docutils literal notranslate"><span class="pre">None</span></code> to indicate an empty linked list.</p></li>
-<li><p>If the <code class="docutils literal notranslate"><span class="pre">values</span></code> list is not empty, it creates the first node of the linked list with the value from the first element of <code class="docutils literal notranslate"><span class="pre">values</span></code>.</p></li>
-<li><p>It then iterates through the remaining elements of <code class="docutils literal notranslate"><span class="pre">values</span></code> and creates new nodes for each value, connecting them together using the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute to form a linked list.</p></li>
-<li><p>Finally, it returns the head of the linked list, which is the first node created.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">convertToList(head)</span></code>: This function converts a linked list into a list of values.</p>
-<ul class="simple">
-<li><p>Input: <code class="docutils literal notranslate"><span class="pre">head</span></code> is the head node of the linked list that you want to convert.</p></li>
-<li><p>Output: The function returns a list containing the values of the nodes in the linked list in order.</p></li>
-</ul>
-<p>Explanation:</p>
-<ul class="simple">
-<li><p>The function starts by initializing an empty list, <code class="docutils literal notranslate"><span class="pre">result</span></code>, to store the values of the linked list nodes.</p></li>
-<li><p>It then iterates through the linked list starting from the <code class="docutils literal notranslate"><span class="pre">head</span></code> node and appends the <code class="docutils literal notranslate"><span class="pre">val</span></code> attribute of each node to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p></li>
-<li><p>The iteration continues until it reaches the end of the linked list (i.e., the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute of the current node becomes <code class="docutils literal notranslate"><span class="pre">None</span></code>).</p></li>
-<li><p>After the iteration is complete, the function returns the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.</p></li>
-</ul>
-</li>
-</ol>
-<p>These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">head1</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">([</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">])</span>
-<span class="n">n1</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="n">new_head1</span> <span class="o">=</span> <span class="n">removeNthFromEnd</span><span class="p">(</span><span class="n">head1</span><span class="p">,</span> <span class="n">n1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">convertToList</span><span class="p">(</span><span class="n">new_head1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 2, 3, 5]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">head2</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">([</span><span class="mi">1</span><span class="p">])</span>
-<span class="n">n2</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="n">new_head2</span> <span class="o">=</span> <span class="n">removeNthFromEnd</span><span class="p">(</span><span class="n">head2</span><span class="p">,</span> <span class="n">n2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">convertToList</span><span class="p">(</span><span class="n">new_head2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-<span class="n">head3</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">([</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">])</span>
-<span class="n">n3</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="n">new_head3</span> <span class="o">=</span> <span class="n">removeNthFromEnd</span><span class="p">(</span><span class="n">head3</span><span class="p">,</span> <span class="n">n3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">convertToList</span><span class="p">(</span><span class="n">new_head3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1]
-</pre></div>
-</div>
-</div>
-</div>
-<p>Certainly! Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function in isolation:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length <span class="math notranslate nohighlight">\(N\)</span>.</p></li>
-<li><p>The first pass positions the <code class="docutils literal notranslate"><span class="pre">first</span></code> pointer <span class="math notranslate nohighlight">\(n\)</span> nodes ahead of the <code class="docutils literal notranslate"><span class="pre">second</span></code> pointer. This pass takes <span class="math notranslate nohighlight">\(O(N)\)</span> time because it involves iterating through all N nodes.</p></li>
-<li><p>The second pass moves both <code class="docutils literal notranslate"><span class="pre">first</span></code> and <code class="docutils literal notranslate"><span class="pre">second</span></code> pointers simultaneously until <code class="docutils literal notranslate"><span class="pre">first</span></code> reaches the end of the list. This also takes <span class="math notranslate nohighlight">\(O(N)\)</span> time in the worst case.</p></li>
-<li><p>Therefore, the overall time complexity of the <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function is <span class="math notranslate nohighlight">\(O(N)\)</span>.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function uses a constant amount of extra space for its variables (e.g., <code class="docutils literal notranslate"><span class="pre">first</span></code>, <code class="docutils literal notranslate"><span class="pre">second</span></code>, and <code class="docutils literal notranslate"><span class="pre">dummy</span></code>). This space usage does not depend on the size of the linked list.</p></li>
-<li><p>The space complexity is <span class="math notranslate nohighlight">\(O(1)\)</span>, indicating that the space used by the function is constant and independent of the size of the input linked list.</p></li>
-</ul>
-<p><strong>In summary</strong>, the <code class="docutils literal notranslate"><span class="pre">removeNthFromEnd</span></code> function has a time complexity of <span class="math notranslate nohighlight">\(O(N)\)</span> and a space complexity of <span class="math notranslate nohighlight">\(O(1)\)</span>. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="143.%20Reorder%20List.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">143. Reorder List</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="206.%20Reverse%20Linked%20List.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">206. Reverse Linked List</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/06. Linked List/23. Merge k Sorted Lists.html b/_build/html/06. Linked List/23. Merge k Sorted Lists.html
deleted file mode 100644
index d49d6f0..0000000
--- a/_build/html/06. Linked List/23. Merge k Sorted Lists.html	
+++ /dev/null
@@ -1,783 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>23. Merge k Sorted Lists &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/23. Merge k Sorted Lists';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Trees Problems - Blind 75 LeetCode" href="../07.%20Trees/README.html" />
-    <link rel="prev" title="21. Merge Two Sorted Lists" href="21.%20Merge%20Two%20Sorted%20Lists.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/23. Merge k Sorted Lists.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/23. Merge k Sorted Lists.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>23. Merge k Sorted Lists</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="merge-k-sorted-lists">
-<h1>23. Merge k Sorted Lists<a class="headerlink" href="#merge-k-sorted-lists" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/merge-k-sorted-lists/">To see the Merge k Sorted Lists problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given an array of <span class="math notranslate nohighlight">\(k\)</span> linked-lists lists, each linked-list is sorted in ascending order.</p>
-<p>Merge all the linked-lists into one sorted linked-list and return it.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">k</span> <span class="pre">==</span> <span class="pre">lists.length</span></code></p></li>
-<li><p>0 &lt;= k &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">lists[i].length</span> <span class="pre">&lt;=</span> <span class="pre">500</span></code></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= lists[i][j] &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">lists[i]</span></code> is sorted in ascending order.</p></li>
-<li><p>The sum of <code class="docutils literal notranslate"><span class="pre">lists[i].length</span></code> will not exceed <span class="math notranslate nohighlight">\(10^4\)</span>.</p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for singly-linked list.</span>
-<span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-     <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-         <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-         <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">next</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">mergeKLists</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">lists</span><span class="p">:</span> <span class="p">[[</span><span class="n">ListNode</span><span class="p">]])</span> <span class="o">-&gt;</span> <span class="n">ListNode</span><span class="p">:</span>
-        <span class="c1"># Check if the input list of linked lists is empty</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">lists</span> <span class="ow">or</span> <span class="nb">len</span><span class="p">(</span><span class="n">lists</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">None</span>
-
-        <span class="c1"># Loop until there is only one merged list left</span>
-        <span class="k">while</span> <span class="nb">len</span><span class="p">(</span><span class="n">lists</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
-            <span class="n">mergedLists</span> <span class="o">=</span> <span class="p">[]</span>
-
-            <span class="c1"># Merge pairs of lists</span>
-            <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">lists</span><span class="p">),</span> <span class="mi">2</span><span class="p">):</span>
-                <span class="n">l1</span> <span class="o">=</span> <span class="n">lists</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
-                <span class="n">l2</span> <span class="o">=</span> <span class="n">lists</span><span class="p">[</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">]</span> <span class="k">if</span> <span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">lists</span><span class="p">)</span> <span class="k">else</span> <span class="kc">None</span>
-                <span class="n">mergedLists</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">mergeList</span><span class="p">(</span><span class="n">l1</span><span class="p">,</span> <span class="n">l2</span><span class="p">))</span>
-
-            <span class="c1"># Update the list of lists with merged results</span>
-            <span class="n">lists</span> <span class="o">=</span> <span class="n">mergedLists</span>
-        
-        <span class="c1"># Return the final merged list</span>
-        <span class="k">return</span> <span class="n">lists</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-
-    <span class="k">def</span> <span class="nf">mergeList</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">l1</span><span class="p">,</span> <span class="n">l2</span><span class="p">):</span>
-        <span class="c1"># Create a dummy node to simplify merging</span>
-        <span class="n">dummy</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">()</span>
-        <span class="n">tail</span> <span class="o">=</span> <span class="n">dummy</span>
-
-        <span class="c1"># Merge the two sorted lists</span>
-        <span class="k">while</span> <span class="n">l1</span> <span class="ow">and</span> <span class="n">l2</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">l1</span><span class="o">.</span><span class="n">val</span> <span class="o">&lt;</span> <span class="n">l2</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-                <span class="n">tail</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">l1</span>
-                <span class="n">l1</span> <span class="o">=</span> <span class="n">l1</span><span class="o">.</span><span class="n">next</span>
-            <span class="k">else</span><span class="p">:</span>
-                <span class="n">tail</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">l2</span>
-                <span class="n">l2</span> <span class="o">=</span> <span class="n">l2</span><span class="o">.</span><span class="n">next</span>
-            <span class="n">tail</span> <span class="o">=</span> <span class="n">tail</span><span class="o">.</span><span class="n">next</span>
-
-        <span class="c1"># Append any remaining elements from l1 or l2 (if any)</span>
-        <span class="k">if</span> <span class="n">l1</span><span class="p">:</span>
-            <span class="n">tail</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">l1</span>
-        <span class="k">if</span> <span class="n">l2</span><span class="p">:</span>
-            <span class="n">tail</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">l2</span>
-
-        <span class="c1"># Return the merged result starting from the next of the dummy node</span>
-        <span class="k">return</span> <span class="n">dummy</span><span class="o">.</span><span class="n">next</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The provided code defines a Python class <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with two methods for merging k sorted linked lists:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">mergeKLists(self,</span> <span class="pre">lists:</span> <span class="pre">List[ListNode])</span> <span class="pre">-&gt;</span> <span class="pre">ListNode</span></code>: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">mergeList(self,</span> <span class="pre">l1,</span> <span class="pre">l2)</span></code>: This method takes two sorted linked lists, <code class="docutils literal notranslate"><span class="pre">l1</span></code> and <code class="docutils literal notranslate"><span class="pre">l2</span></code>, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.</p></li>
-</ol>
-<p>Here’s a high-level overview of how the code works:</p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">mergeKLists</span></code> method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns <code class="docutils literal notranslate"><span class="pre">None</span></code>.</p></li>
-<li><p>Inside a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the <code class="docutils literal notranslate"><span class="pre">lists</span></code> array. It does this by iterating through the input lists in pairs and calling the <code class="docutils literal notranslate"><span class="pre">mergeList</span></code> method to merge each pair.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">mergeList</span></code> method takes two sorted linked lists, <code class="docutils literal notranslate"><span class="pre">l1</span></code> and <code class="docutils literal notranslate"><span class="pre">l2</span></code>, and merges them into a single sorted linked list. It uses a dummy node (<code class="docutils literal notranslate"><span class="pre">dummy</span></code>) and a <code class="docutils literal notranslate"><span class="pre">tail</span></code> pointer to keep track of the merged list while comparing and merging elements from <code class="docutils literal notranslate"><span class="pre">l1</span></code> and <code class="docutils literal notranslate"><span class="pre">l2</span></code>.</p></li>
-<li><p>After merging all pairs of lists and updating the <code class="docutils literal notranslate"><span class="pre">lists</span></code> array with the merged results, the loop continues until only one merged list remains in the <code class="docutils literal notranslate"><span class="pre">lists</span></code> array.</p></li>
-<li><p>Finally, the <code class="docutils literal notranslate"><span class="pre">mergeKLists</span></code> method returns the merged list.</p></li>
-</ul>
-<p>Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-<span class="c1"># Input: lists = [[1,4,5],[1,3,4],[2,6]]</span>
-
-<span class="n">lists1</span> <span class="o">=</span> <span class="p">[</span>
-    <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">5</span><span class="p">))),</span>
-    <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">))),</span>
-    <span class="n">ListNode</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">6</span><span class="p">))</span>
-<span class="p">]</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">mergeKLists</span><span class="p">(</span><span class="n">lists1</span><span class="p">)</span>
-
-<span class="c1"># Print the result</span>
-<span class="k">if</span> <span class="n">result1</span><span class="p">:</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">result1</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="nb">print</span><span class="p">(</span><span class="n">current</span><span class="o">.</span><span class="n">val</span><span class="p">,</span> <span class="n">end</span><span class="o">=</span><span class="s2">&quot; -&gt; &quot;</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-<span class="k">else</span><span class="p">:</span>
-    <span class="nb">print</span><span class="p">(</span><span class="s2">&quot;None&quot;</span><span class="p">)</span>  <span class="c1"># Print &quot;None&quot; for input with a single None element</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1 -&gt; 1 -&gt; 2 -&gt; 3 -&gt; 4 -&gt; 4 -&gt; 5 -&gt; 6 -&gt; 
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-<span class="c1"># Input: lists = []</span>
-
-<span class="n">lists2</span> <span class="o">=</span> <span class="p">[]</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">mergeKLists</span><span class="p">(</span><span class="n">lists2</span><span class="p">)</span>
-
-<span class="c1"># Print the result</span>
-<span class="k">if</span> <span class="n">result2</span><span class="p">:</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">result2</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="nb">print</span><span class="p">(</span><span class="n">current</span><span class="o">.</span><span class="n">val</span><span class="p">,</span> <span class="n">end</span><span class="o">=</span><span class="s2">&quot; -&gt; &quot;</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-<span class="k">else</span><span class="p">:</span>
-    <span class="nb">print</span><span class="p">(</span><span class="s2">&quot;None&quot;</span><span class="p">)</span>  <span class="c1"># Print &quot;None&quot; for input with a single None element</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>None
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 3</span>
-<span class="c1"># Input: lists = [[]]</span>
-
-<span class="n">lists3</span> <span class="o">=</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result3</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">mergeKLists</span><span class="p">(</span><span class="n">lists3</span><span class="p">)</span>
-
-<span class="c1"># Print the result</span>
-<span class="k">if</span> <span class="n">result3</span><span class="p">:</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">result3</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="nb">print</span><span class="p">(</span><span class="n">current</span><span class="o">.</span><span class="n">val</span><span class="p">,</span> <span class="n">end</span><span class="o">=</span><span class="s2">&quot; -&gt; &quot;</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-<span class="k">else</span><span class="p">:</span>
-    <span class="nb">print</span><span class="p">(</span><span class="s2">&quot;None&quot;</span><span class="p">)</span>  <span class="c1"># Print &quot;None&quot; for input with a single None element</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>None
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic">
-<li><p><strong>Heap Initialization:</strong> The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes <span class="math notranslate nohighlight">\(O(1)\)</span> time.</p></li>
-<li><p><strong>Merging:</strong> The merging operation is performed in a divide-and-conquer fashion. In each iteration of the <code class="docutils literal notranslate"><span class="pre">while</span></code> loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists (<span class="math notranslate nohighlight">\(n\)</span>). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is <span class="math notranslate nohighlight">\(O(log\ k)\)</span>.</p>
-<p>Therefore, the overall time complexity of the code is <span class="math notranslate nohighlight">\(O(n * log\ k)\)</span>, where n is the total number of nodes across all lists, and <span class="math notranslate nohighlight">\(k\)</span> is the number of linked lists.</p>
-</li>
-</ol>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic">
-<li><p><strong>Heap Space:</strong> The code doesn’t use a heap data structure, so there’s no additional space complexity due to a heap.</p></li>
-<li><p><strong>Merged Lists:</strong> In the <code class="docutils literal notranslate"><span class="pre">mergeList</span></code> method, we create a new merged list. However, this list is not stored in memory for all lists; it’s replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is <span class="math notranslate nohighlight">\(O(n)\)</span> in the worst case.</p></li>
-<li><p><strong>Additional Variables:</strong> The code uses a few additional variables, such as <code class="docutils literal notranslate"><span class="pre">dummy</span></code> and <code class="docutils literal notranslate"><span class="pre">tail</span></code>, but these occupy a constant amount of space and don’t depend on the input size.</p>
-<p>Therefore, the overall space complexity of the code is <span class="math notranslate nohighlight">\(O(n)\)</span>, where n is the total number of nodes across all lists.</p>
-</li>
-</ol>
-<p>In summary, the code’s time complexity is <span class="math notranslate nohighlight">\(O(n * log(k))\)</span>, and its space complexity is <span class="math notranslate nohighlight">\(O(n)\)</span>. This code efficiently merges <span class="math notranslate nohighlight">\(k\)</span> sorted linked lists using a divide-and-conquer approach with a relatively low space overhead.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="21.%20Merge%20Two%20Sorted%20Lists.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">21. Merge Two Sorted Lists</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../07.%20Trees/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Trees Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/100. Same Tree.html b/_build/html/07. Trees/100. Same Tree.html
deleted file mode 100644
index 66a8f9d..0000000
--- a/_build/html/07. Trees/100. Same Tree.html	
+++ /dev/null
@@ -1,727 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>100: Same Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/100. Same Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="102. Binary Tree Level Order Traversal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html" />
-    <link rel="prev" title="Trees Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/100. Same Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/100. Same Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>100: Same Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#in-summary">In summary:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="same-tree">
-<h1>100: Same Tree<a class="headerlink" href="#same-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/same-tree/">To see the Same Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the roots of two binary trees <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>, write a function to check if they are the same or not.</p>
-<p>Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.</p>
-<p><strong>Constraints</strong></p>
-<ol class="arabic simple">
-<li><p>The number of nodes in both trees is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= Node.val &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="c1"># Initialize a TreeNode with a value (val), left child, and right child.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">):</span>
-    <span class="c1"># Base case: If both p and q are None, the trees are the same.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">p</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">q</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">True</span>
-    
-    <span class="c1"># Base case: If either p or q is None (but not both), the trees are different.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">p</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">q</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">False</span>
-    
-    <span class="c1"># Check if the values of the current nodes (p.val and q.val) are equal.</span>
-    <span class="k">if</span> <span class="n">p</span><span class="o">.</span><span class="n">val</span> <span class="o">!=</span> <span class="n">q</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">False</span>
-    
-    <span class="c1"># Recursively check the left and right subtrees of p and q.</span>
-    <span class="c1"># If both subtrees are the same, the entire trees are the same.</span>
-    <span class="k">return</span> <span class="n">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">q</span><span class="o">.</span><span class="n">left</span><span class="p">)</span> <span class="ow">and</span> <span class="n">isSameTree</span><span class="p">(</span><span class="n">p</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">q</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>In this code, we define a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class to represent binary tree nodes and a <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function to check if two binary trees are the same. The function uses recursive traversal to compare the trees’ structures and values.</p>
-<ol class="arabic simple">
-<li><p>We start by defining a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class, which represents a node in a binary tree. Each node has a <code class="docutils literal notranslate"><span class="pre">val</span></code> (the node’s value), a <code class="docutils literal notranslate"><span class="pre">left</span></code> child, and a right child. This class will help us create and work with binary trees.</p></li>
-<li><p>Next, we define the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function, which checks if two binary trees (<code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>) are the same.</p>
-<ul class="simple">
-<li><p>The base case for the recursion is when both <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> are <code class="docutils literal notranslate"><span class="pre">None</span></code>. In this case, they are considered the same, so we return <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If either <code class="docutils literal notranslate"><span class="pre">p</span></code> or <code class="docutils literal notranslate"><span class="pre">q</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> (but not both), they cannot be the same, so we return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If the values of the current nodes <code class="docutils literal notranslate"><span class="pre">p.val</span></code> and <code class="docutils literal notranslate"><span class="pre">q.val</span></code> are not equal, we return <code class="docutils literal notranslate"><span class="pre">False</span></code> because the trees cannot be the same.</p></li>
-<li><p>Finally, we recursively check the left and right subtrees of <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> to see if they are the same.</p></li>
-</ul>
-</li>
-</ol>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-
-<span class="c1">#Input: `p = [1,2,3]`, `q = [1,2,3]`</span>
-
-<span class="n">p1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="n">q1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p1</span><span class="p">,</span> <span class="n">q1</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-
-<span class="c1">#Input: `p = [1,2]`, `q = [1,null,2]`</span>
-
-<span class="n">p2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="kc">None</span><span class="p">)</span>
-<span class="n">q2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p2</span><span class="p">,</span> <span class="n">q2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 3</span>
-
-<span class="c1">#Input: p = [1,2,1], q = [1,1,2]</span>
-
-<span class="n">p3</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">))</span>
-<span class="n">q3</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">p3</span><span class="p">,</span> <span class="n">q3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-complexity">
-<h2>Time Complexity<a class="headerlink" href="#time-complexity" title="Permalink to this heading">#</a></h2>
-<p>The time complexity of the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function can be analyzed as follows:</p>
-<p>In the worst case, the function needs to visit every node in both trees once to determine if they are the same.
-Since each node is visited exactly once, the time complexity is <span class="math notranslate nohighlight">\(O(n)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.</p>
-</section>
-<section id="space-complexity">
-<h2>Space Complexity<a class="headerlink" href="#space-complexity" title="Permalink to this heading">#</a></h2>
-<p>The space complexity of the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function can be analyzed as follows:</p>
-<p>The space used by the function’s call stack during recursion is proportional to the maximum depth of the binary trees.
-In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be <span class="math notranslate nohighlight">\(n\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.
-Therefore, the space complexity is <span class="math notranslate nohighlight">\(O(n)\)</span> due to the recursive call stack.
-In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.</p>
-</section>
-<section id="in-summary">
-<h2>In summary:<a class="headerlink" href="#in-summary" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><strong>Time Complexity:</strong> <span class="math notranslate nohighlight">\(O(n)\)</span> where <span class="math notranslate nohighlight">\(n\)</span> is the total number of nodes in the input trees.</p></li>
-<li><p><strong>Space Complexity:</strong> <span class="math notranslate nohighlight">\(O(n)\)</span> due to the recursive call stack.</p></li>
-</ul>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Trees Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">102. Binary Tree Level Order Traversal</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#in-summary">In summary:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html b/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html
deleted file mode 100644
index 37fcb2e..0000000
--- a/_build/html/07. Trees/104. Maximum Depth of Binary Tree.html	
+++ /dev/null
@@ -1,725 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>104. Maximum Depth of Binary Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/104. Maximum Depth of Binary Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="105. Construct Binary Tree from Preorder and Inorder Traversal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html" />
-    <link rel="prev" title="102. Binary Tree Level Order Traversal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/104. Maximum Depth of Binary Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>104. Maximum Depth of Binary Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="maximum-depth-of-binary-tree">
-<h1>104. Maximum Depth of Binary Tree<a class="headerlink" href="#maximum-depth-of-binary-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/invert-binary-tree/">To see the Invert Binary Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary tree, return its maximum depth.</p>
-<p>A binary tree’s <strong>maximum depth</strong> is the number of nodes along the longest path from the root node down to the farthest leaf node.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([0, 10^4]\)</span>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-100</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">maxDepth</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="c1"># Base case: If the root is None, the depth is 0.</span>
-    <span class="k">if</span> <span class="n">root</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
-        <span class="k">return</span> <span class="mi">0</span>
-    
-    <span class="c1"># Recursively calculate the maximum depth of the left and right subtrees.</span>
-    <span class="n">left_depth</span> <span class="o">=</span> <span class="n">maxDepth</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-    <span class="n">right_depth</span> <span class="o">=</span> <span class="n">maxDepth</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-    
-    <span class="c1"># Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.</span>
-    <span class="k">return</span> <span class="nb">max</span><span class="p">(</span><span class="n">left_depth</span><span class="p">,</span> <span class="n">right_depth</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>Let’s go through the code step by step to understand how it works:</p>
-<ol class="arabic simple">
-<li><p>We start by defining a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class to represent the nodes of the binary tree. Each node has three attributes:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">val</span></code>: the value stored in the node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">left</span></code>: a reference to the left child node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">right</span></code>: a reference to the right child node.</p></li>
-</ul>
-</li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, <code class="docutils literal notranslate"><span class="pre">root</span></code>, which is the root node of the binary tree.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> function, we have a base case:</p>
-<ul class="simple">
-<li><p>If the <code class="docutils literal notranslate"><span class="pre">root</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.</p></li>
-</ul>
-</li>
-<li><p>If the <code class="docutils literal notranslate"><span class="pre">root</span></code> is not <code class="docutils literal notranslate"><span class="pre">None</span></code>, we recursively calculate the maximum depth of the left and right subtrees:</p>
-<ul class="simple">
-<li><p>We call <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> on the <code class="docutils literal notranslate"><span class="pre">root.left</span></code> to calculate the maximum depth of the left subtree and store it in the variable <code class="docutils literal notranslate"><span class="pre">left_depth</span></code>.</p></li>
-<li><p>We call <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> on the <code class="docutils literal notranslate"><span class="pre">root.right</span></code> to calculate the maximum depth of the right subtree and store it in the variable <code class="docutils literal notranslate"><span class="pre">right_depth</span></code>.</p></li>
-</ul>
-</li>
-<li><p>Finally, we return the maximum depth of the tree by taking the maximum of <code class="docutils literal notranslate"><span class="pre">left_depth</span></code> and <code class="docutils literal notranslate"><span class="pre">right_depth</span></code> and adding 1 to it. This is because we are counting the current level as well.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-<span class="c1"># Input: root = [3,9,20,null,null,15,7]</span>
-
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">20</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">15</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span>
-
-<span class="nb">print</span><span class="p">(</span><span class="n">maxDepth</span><span class="p">(</span><span class="n">root</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-<p>In this example, we create a binary tree based on the given input <code class="docutils literal notranslate"><span class="pre">[3,9,20,null,null,15,7]</span></code> and calculate its maximum depth, which is <code class="docutils literal notranslate"><span class="pre">3</span></code>. The tree structure is as follows:</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span>    <span class="mi">3</span>
-   <span class="o">/</span> \
-  <span class="mi">9</span>  <span class="mi">20</span>
-    <span class="o">/</span>  \
-   <span class="mi">15</span>   <span class="mi">7</span>
-</pre></div>
-</div>
-<p>So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case.</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-<span class="c1"># Input: root = [1,null,2]</span>
-
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-
-<span class="c1"># Calculate the maximum depth of the tree and print the result</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">maxDepth</span><span class="p">(</span><span class="n">root</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The time complexity of the <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> function is <span class="math notranslate nohighlight">\(O(N)\)</span>, where <span class="math notranslate nohighlight">\(N\)</span> is the number of nodes in the binary tree.</p></li>
-<li><p>This is because in the worst case, the function visits every node exactly once in a depth-first manner.</p></li>
-<li><p>The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity of the <code class="docutils literal notranslate"><span class="pre">maxDepth</span></code> function is <span class="math notranslate nohighlight">\(O(H)\)</span>, where H is the height of the binary tree.</p></li>
-<li><p>In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.</p></li>
-<li><p>In the best case, if the binary tree is perfectly balanced, the height is <span class="math notranslate nohighlight">\(O(log\ N)\)</span>, where <span class="math notranslate nohighlight">\(N\)</span> is the number of nodes.</p></li>
-<li><p>Therefore, the space complexity can vary from <span class="math notranslate nohighlight">\(O(log\ N)\)</span> to <span class="math notranslate nohighlight">\(O(N)\)</span> depending on the shape of the tree.</p></li>
-<li><p>In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.</p></li>
-</ul>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>The time complexity of the code is <span class="math notranslate nohighlight">\(O(N)\)</span> as it visits each node once.</p></li>
-<li><p>The space complexity is <span class="math notranslate nohighlight">\(O(H)\)</span>, where H is the height of the tree, which can vary from <span class="math notranslate nohighlight">\(O(log\ N)\)</span> to <span class="math notranslate nohighlight">\(O(N)\)</span> depending on the tree’s shape.</p></li>
-</ul>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">102. Binary Tree Level Order Traversal</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">105. Construct Binary Tree from Preorder and Inorder Traversal</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html b/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html
deleted file mode 100644
index cc9832c..0000000
--- a/_build/html/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html	
+++ /dev/null
@@ -1,803 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>105. Construct Binary Tree from Preorder and Inorder Traversal &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="124. Binary Tree Maximum Path Sum" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html" />
-    <link rel="prev" title="104. Maximum Depth of Binary Tree" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>105. Construct Binary Tree from Preorder and Inorder Traversal</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#helper-function">Helper Function</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#id1">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="construct-binary-tree-from-preorder-and-inorder-traversal">
-<h1>105. Construct Binary Tree from Preorder and Inorder Traversal<a class="headerlink" href="#construct-binary-tree-from-preorder-and-inorder-traversal" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/">To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given two integer arrays <code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code> where <code class="docutils literal notranslate"><span class="pre">preorder</span></code> is the preorder traversal of a binary tree and <code class="docutils literal notranslate"><span class="pre">inorder</span></code> is the inorder traversal of the same tree, construct and return <em>the binary tree.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">preorder.length</span> <span class="pre">&lt;=</span> <span class="pre">3000</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">inorder.length</span> <span class="pre">==</span> <span class="pre">preorder.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-3000</span> <span class="pre">&lt;=</span> <span class="pre">preorder[i],</span> <span class="pre">inorder[i]</span> <span class="pre">&lt;=</span> <span class="pre">3000</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code> consist of <strong>unique</strong> values.</p></li>
-<li><p>Each value of <code class="docutils literal notranslate"><span class="pre">inorder</span></code> also appears in <code class="docutils literal notranslate"><span class="pre">preorder</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">preorder</span></code> is <strong>guaranteed</strong> to be the preorder traversal of the tree.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">inorder</span></code> is <strong>guaranteed</strong> to be the inorder traversal of the tree.</p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">buildTree</span><span class="p">(</span><span class="n">preorder</span><span class="p">,</span> <span class="n">inorder</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">preorder</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">None</span>
-
-    <span class="c1"># The first element in the preorder traversal is the root of the current subtree</span>
-    <span class="n">root_val</span> <span class="o">=</span> <span class="n">preorder</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-    <span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="n">root_val</span><span class="p">)</span>
-
-    <span class="c1"># Find the index of the root value in the inorder traversal</span>
-    <span class="n">root_idx_inorder</span> <span class="o">=</span> <span class="n">inorder</span><span class="o">.</span><span class="n">index</span><span class="p">(</span><span class="n">root_val</span><span class="p">)</span>
-
-    <span class="c1"># Recursively build left and right subtrees</span>
-    <span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">buildTree</span><span class="p">(</span><span class="n">preorder</span><span class="p">[</span><span class="mi">1</span><span class="p">:</span><span class="mi">1</span> <span class="o">+</span> <span class="n">root_idx_inorder</span><span class="p">],</span> <span class="n">inorder</span><span class="p">[:</span><span class="n">root_idx_inorder</span><span class="p">])</span>
-    <span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">buildTree</span><span class="p">(</span><span class="n">preorder</span><span class="p">[</span><span class="mi">1</span> <span class="o">+</span> <span class="n">root_idx_inorder</span><span class="p">:],</span> <span class="n">inorder</span><span class="p">[</span><span class="n">root_idx_inorder</span> <span class="o">+</span> <span class="mi">1</span><span class="p">:])</span>
-
-    <span class="k">return</span> <span class="n">root</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic">
-<li><p><code class="docutils literal notranslate"><span class="pre">class</span> <span class="pre">TreeNode:</span></code>: This is a class definition for a binary tree node. It has three attributes:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">val</span></code>: The value of the node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">left</span></code>: A reference to the left child node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">right</span></code>: A reference to the right child node.</p></li>
-</ul>
-<p>This class is used to create instances of binary tree nodes, which will be used to build the binary tree.</p>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">buildTree(preorder,</span> <span class="pre">inorder):</span></code>: This is the main function that constructs a binary tree from its preorder and inorder traversals.</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">preorder</span></code>: A list representing the preorder traversal of the binary tree.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">inorder</span></code>: A list representing the inorder traversal of the binary tree.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">not</span> <span class="pre">preorder:</span> <span class="pre">return</span> <span class="pre">None</span></code>: This line checks if the <code class="docutils literal notranslate"><span class="pre">preorder</span></code> list is empty. If it is, it means there are no nodes to construct, so the function returns <code class="docutils literal notranslate"><span class="pre">None</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">root_val</span> <span class="pre">=</span> <span class="pre">preorder[0]</span></code>: The value of the root node is extracted from the first element of the <code class="docutils literal notranslate"><span class="pre">preorder</span></code> list.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">root</span> <span class="pre">=</span> <span class="pre">TreeNode(root_val)</span></code>: A new <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> object is created with the <code class="docutils literal notranslate"><span class="pre">root_val</span></code> as its value. This represents the root of the current subtree.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">root_idx_inorder</span> <span class="pre">=</span> <span class="pre">inorder.index(root_val)</span></code>: The index of the <code class="docutils literal notranslate"><span class="pre">root_val</span></code> in the <code class="docutils literal notranslate"><span class="pre">inorder</span></code> list is found. This index indicates the position of the root node in the inorder traversal.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">root.left</span></code>: The left subtree is constructed recursively by calling the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function with the appropriate sublists of <code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code>. The left subtree’s preorder and inorder traversals are the slices of <code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code> lists up to the <code class="docutils literal notranslate"><span class="pre">root_idx_inorder</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">root.right</span></code>: The right subtree is constructed recursively by calling the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function with the appropriate sublists of <code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code>. The right subtree’s preorder and inorder traversals are the slices of <code class="docutils literal notranslate"><span class="pre">preorder</span></code> and <code class="docutils literal notranslate"><span class="pre">inorder</span></code> lists starting from <code class="docutils literal notranslate"><span class="pre">root_idx_inorder</span> <span class="pre">+</span> <span class="pre">1</span></code>.</p></li>
-<li><p>Finally, the function returns the <code class="docutils literal notranslate"><span class="pre">root</span></code> of the subtree it just constructed.</p></li>
-</ol>
-<p>The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed.</p>
-</section>
-<section id="helper-function">
-<h2>Helper Function<a class="headerlink" href="#helper-function" title="Permalink to this heading">#</a></h2>
-<p>Here is a helper function to represent the binary tree elements.</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">treeToList</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="c1"># Initialize an empty list to store the elements of the binary tree</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    
-    <span class="c1"># Initialize a queue for level-order traversal starting with the root</span>
-    <span class="n">queue</span> <span class="o">=</span> <span class="p">[</span><span class="n">root</span><span class="p">]</span>
-
-    <span class="k">while</span> <span class="n">queue</span><span class="p">:</span>
-        <span class="c1"># Pop the front node from the queue</span>
-        <span class="n">node</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-        
-        <span class="c1"># If the node is not None (i.e., a valid node), add its value to the result list</span>
-        <span class="k">if</span> <span class="n">node</span><span class="p">:</span>
-            <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-            
-            <span class="c1"># Add the left and right children of the node to the queue</span>
-            <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-            <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="c1"># If the node is None, add None to the result to represent an empty node</span>
-            <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="kc">None</span><span class="p">)</span>
-
-    <span class="c1"># Remove any trailing None values from the result list</span>
-    <span class="k">while</span> <span class="n">result</span> <span class="ow">and</span> <span class="n">result</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
-
-    <span class="c1"># Return the resulting list representing the binary tree elements</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="id1">
-<h2>Explanation:<a class="headerlink" href="#id1" title="Permalink to this heading">#</a></h2>
-<p>Let’s break down the <code class="docutils literal notranslate"><span class="pre">treeToList</span></code> helper function step by step:</p>
-<ol class="arabic">
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">treeToList(root):</span></code>: This function takes the root of a binary tree as input and converts it into a list.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">result</span> <span class="pre">=</span> <span class="pre">[]</span></code>: Initialize an empty list called <code class="docutils literal notranslate"><span class="pre">result</span></code> to store the elements of the binary tree in list format.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">queue</span> <span class="pre">=</span> <span class="pre">[root]</span></code>: Initialize a queue data structure for a level-order traversal, starting with the root node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">while</span> <span class="pre">queue:</span></code>: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">node</span> <span class="pre">=</span> <span class="pre">queue.pop(0)</span></code>: Dequeue the first node from the queue, effectively processing it.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">node:</span></code>: Check if the <code class="docutils literal notranslate"><span class="pre">node</span></code> is not None, which means it’s a valid node in the binary tree.</p>
-<p>a. <code class="docutils literal notranslate"><span class="pre">result.append(node.val)</span></code>: If the node is valid, append its value (<code class="docutils literal notranslate"><span class="pre">node.val</span></code>) to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list. This represents the value of the current node in the binary tree.</p>
-<p>b. <code class="docutils literal notranslate"><span class="pre">queue.append(node.left)</span></code>: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.</p>
-<p>c. <code class="docutils literal notranslate"><span class="pre">queue.append(node.right)</span></code>: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.</p>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">else:</span></code>: If the <code class="docutils literal notranslate"><span class="pre">node</span></code> is None, it represents an empty node in the binary tree.</p>
-<p>a. <code class="docutils literal notranslate"><span class="pre">result.append(None)</span></code>: Append <code class="docutils literal notranslate"><span class="pre">None</span></code> to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list to indicate an empty node.</p>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">while</span> <span class="pre">result</span> <span class="pre">and</span> <span class="pre">result[-1]</span> <span class="pre">is</span> <span class="pre">None:</span></code>: After the traversal is complete, there might be trailing <code class="docutils literal notranslate"><span class="pre">None</span></code> values in the <code class="docutils literal notranslate"><span class="pre">result</span></code> list. This loop removes any such trailing <code class="docutils literal notranslate"><span class="pre">None</span></code> values to ensure a clean representation of the tree’s elements.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">return</span> <span class="pre">result</span></code>: Return the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, which now contains the elements of the binary tree in a format where <code class="docutils literal notranslate"><span class="pre">None</span></code> represents empty nodes and the order of elements reflects a level-order traversal of the tree.</p></li>
-</ol>
-<p>In summary, the <code class="docutils literal notranslate"><span class="pre">treeToList</span></code> function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node’s value or represents an empty node with <code class="docutils literal notranslate"><span class="pre">None</span></code>. This list represents the binary tree’s elements in a structured format.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="n">preorder</span> <span class="o">=</span> <span class="p">[</span><span class="mi">3</span><span class="p">,</span> <span class="mi">9</span><span class="p">,</span> <span class="mi">20</span><span class="p">,</span> <span class="mi">15</span><span class="p">,</span> <span class="mi">7</span><span class="p">]</span>
-<span class="n">inorder</span> <span class="o">=</span> <span class="p">[</span><span class="mi">9</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">15</span><span class="p">,</span> <span class="mi">20</span><span class="p">,</span> <span class="mi">7</span><span class="p">]</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">buildTree</span><span class="p">(</span><span class="n">preorder</span><span class="p">,</span> <span class="n">inorder</span><span class="p">)</span>
-
-<span class="nb">print</span><span class="p">(</span><span class="n">treeToList</span><span class="p">(</span><span class="n">result</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[3, 9, 20, None, None, 15, 7]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="n">preorder</span> <span class="o">=</span> <span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">inorder</span> <span class="o">=</span> <span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">buildTree</span><span class="p">(</span><span class="n">preorder</span><span class="p">,</span> <span class="n">inorder</span><span class="p">)</span>
-
-<span class="nb">print</span><span class="p">(</span><span class="n">treeToList</span><span class="p">(</span><span class="n">result</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[-1]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function:</p>
-<p><strong>Time Complexity:</strong>
-The time complexity of the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function can be analyzed in terms of the number of nodes in the binary tree. Let’s assume there are <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes in the binary tree.</p>
-<ol class="arabic simple">
-<li><p>Finding the root value in the <code class="docutils literal notranslate"><span class="pre">preorder</span></code> traversal takes O(1) time as it’s just extracting the first element from the list.</p></li>
-<li><p>Finding the index of the root value in the <code class="docutils literal notranslate"><span class="pre">inorder</span></code> traversal using <code class="docutils literal notranslate"><span class="pre">inorder.index(root_val)</span></code> takes O(n) time in the worst case because in the worst case, it might have to search through all <code class="docutils literal notranslate"><span class="pre">n</span></code> elements in the <code class="docutils literal notranslate"><span class="pre">inorder</span></code> list to find the index.</p></li>
-<li><p>The recursive calls to <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.</p></li>
-</ol>
-<p>The total time complexity of the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function is O(n) due to the recursive calls and finding the root’s index in the <code class="docutils literal notranslate"><span class="pre">inorder</span></code> list.</p>
-<p><strong>Space Complexity:</strong>
-The space complexity is determined by the space used by the function’s call stack during recursion and any additional data structures used.</p>
-<ol class="arabic simple">
-<li><p>The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.</p></li>
-<li><p>Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).</p></li>
-</ol>
-<p>Overall, the space complexity of the <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> function is O(n) due to the space used by the call stack and the TreeNode objects.</p>
-<p>In summary, the time complexity of <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> is O(n), and the space complexity is O(n), where ‘n’ is the number of nodes in the binary tree.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Construct Binary Tree from Postorder and Inorder Traversal:</strong>
-Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to <code class="docutils literal notranslate"><span class="pre">buildTree</span></code> but for postorder and inorder traversals.</p></li>
-<li><p><strong>Reconstruct Binary Tree with Duplicate Values:</strong>
-Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">104. Maximum Depth of Binary Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">124. Binary Tree Maximum Path Sum</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#helper-function">Helper Function</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#id1">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/230. Kth Smallest Element in a BST.html b/_build/html/07. Trees/230. Kth Smallest Element in a BST.html
deleted file mode 100644
index fef5b0d..0000000
--- a/_build/html/07. Trees/230. Kth Smallest Element in a BST.html	
+++ /dev/null
@@ -1,729 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>230. Kth Smallest Element in a BST &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/230. Kth Smallest Element in a BST';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="235. Lowest Common Ancestor of a Binary Search Tree" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html" />
-    <link rel="prev" title="226: Invert Binary Tree" href="226.%20Invert%20Binary%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/230. Kth Smallest Element in a BST.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>230. Kth Smallest Element in a BST</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="kth-smallest-element-in-a-bst">
-<h1>230. Kth Smallest Element in a BST<a class="headerlink" href="#kth-smallest-element-in-a-bst" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/kth-smallest-element-in-a-bst/">To see the Kth Smallest Element in a BST problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary search tree, and an integer <code class="docutils literal notranslate"><span class="pre">k</span></code>, return <em>the <span class="math notranslate nohighlight">\(k^{th}\)</span> smallest value (<strong>1-indexed</strong>) of all the values of the nodes in the tree.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is <code class="docutils literal notranslate"><span class="pre">n</span></code>.</p></li>
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">k</span> <span class="pre">&lt;=</span> <span class="pre">n</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">Node.val</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ul>
-<p><strong>Follow up</strong>: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?</p>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">kthSmallest</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">k</span><span class="p">):</span>
-    <span class="n">stack</span> <span class="o">=</span> <span class="p">[]</span>  <span class="c1"># Initialize an empty stack to simulate the traversal</span>
-    <span class="k">while</span> <span class="n">root</span> <span class="ow">or</span> <span class="n">stack</span><span class="p">:</span>
-        <span class="k">while</span> <span class="n">root</span><span class="p">:</span>
-            <span class="n">stack</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>  <span class="c1"># Push the current node onto the stack</span>
-            <span class="n">root</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span>  <span class="c1"># Move to the left child</span>
-        <span class="n">root</span> <span class="o">=</span> <span class="n">stack</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>  <span class="c1"># Pop a node from the stack</span>
-        <span class="n">k</span> <span class="o">-=</span> <span class="mi">1</span>  <span class="c1"># Decrement k since we&#39;ve visited a node</span>
-        <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">root</span><span class="o">.</span><span class="n">val</span>  <span class="c1"># If k becomes 0, return the current node&#39;s value as the kth smallest</span>
-        <span class="n">root</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">right</span>  <span class="c1"># Move to the right child to continue the traversal</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class, which represents a node in the binary search tree (BST). Each node has a value (<code class="docutils literal notranslate"><span class="pre">val</span></code>), a left child (<code class="docutils literal notranslate"><span class="pre">left</span></code>), and a right child (<code class="docutils literal notranslate"><span class="pre">right</span></code>).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">kthSmallest</span></code> function takes two parameters: <code class="docutils literal notranslate"><span class="pre">root</span></code>, which is the root of the BST, and <code class="docutils literal notranslate"><span class="pre">k</span></code>, which represents the kth smallest element we want to find.</p></li>
-<li><p>We initialize an empty stack (<code class="docutils literal notranslate"><span class="pre">stack</span></code>) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.</p></li>
-<li><p>We enter a while loop that continues until either <code class="docutils literal notranslate"><span class="pre">root</span></code> becomes <code class="docutils literal notranslate"><span class="pre">None</span></code> (indicating we have traversed the entire tree) or the <code class="docutils literal notranslate"><span class="pre">stack</span></code> is empty.</p></li>
-<li><p>Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the <code class="docutils literal notranslate"><span class="pre">stack</span></code> and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.</p></li>
-<li><p>Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the <code class="docutils literal notranslate"><span class="pre">stack</span></code> one by one. As we pop each node, we decrement <code class="docutils literal notranslate"><span class="pre">k</span></code> by 1 to keep track of the number of nodes we have visited.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">k</span></code> becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the <code class="docutils literal notranslate"><span class="pre">val</span></code> of the current node as the result.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">k</span></code> is still greater than 0, it means we haven’t found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.</p></li>
-<li><p>The process continues until we find the kth smallest element or traverse the entire tree.</p></li>
-<li><p>Finally, we return the kth smallest element found.</p></li>
-</ol>
-<p>The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="c1"># Create the tree for the first example: root = [3,1,4,null,2], k = 1</span>
-<span class="n">root1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">k1</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthSmallest</span><span class="p">(</span><span class="n">root1</span><span class="p">,</span> <span class="n">k1</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="c1"># Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3</span>
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">6</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">k2</span> <span class="o">=</span> <span class="mi">3</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthSmallest</span><span class="p">(</span><span class="n">root2</span><span class="p">,</span> <span class="n">k2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the given code:</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of this code is O(h + k), where:</p>
-<ul class="simple">
-<li><p>h is the height of the binary search tree (BST).</p></li>
-<li><p>k is the desired kth smallest element we want to find.</p></li>
-</ul>
-<ol class="arabic simple">
-<li><p>In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).</p></li>
-<li><p>In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).</p></li>
-</ol>
-<p>So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.</p>
-<ol class="arabic simple">
-<li><p>In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.</p></li>
-<li><p>In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.</p></li>
-</ol>
-<p>So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.</p>
-<p>In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Kth Largest Element</strong>: Modify the code to find the kth largest element in the BST instead of the kth smallest element.</p></li>
-<li><p><strong>Kth Smallest Element in Two BSTs</strong>: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="226.%20Invert%20Binary%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">226: Invert Binary Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">235. Lowest Common Ancestor of a Binary Search Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html b/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html
deleted file mode 100644
index 8098932..0000000
--- a/_build/html/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html	
+++ /dev/null
@@ -1,764 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>235. Lowest Common Ancestor of a Binary Search Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/235. Lowest Common Ancestor of a Binary Search Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="297. Serialize and Deserialize Binary Tree" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html" />
-    <link rel="prev" title="230. Kth Smallest Element in a BST" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>235. Lowest Common Ancestor of a Binary Search Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-</li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="lowest-common-ancestor-of-a-binary-search-tree">
-<h1>235. Lowest Common Ancestor of a Binary Search Tree<a class="headerlink" href="#lowest-common-ancestor-of-a-binary-search-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/">To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.</p>
-<p>According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> as the lowest node in <code class="docutils literal notranslate"><span class="pre">T</span></code> that has both <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> as descendants (where we allow <strong>a node to be a descendant of itself</strong>).”</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([2, 10^5]\)</span>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^9\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">Node.val</span></code> &lt;= <span class="math notranslate nohighlight">\(10^9\)</span></p></li>
-<li><p>All <code class="docutils literal notranslate"><span class="pre">Node.val</span></code> are <strong>unique</strong>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">p</span> <span class="pre">!=</span> <span class="pre">q</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> will exist in the BST.</p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">lowestCommonAncestor</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">):</span>
-    <span class="c1"># Ensure p is less than q</span>
-    <span class="k">if</span> <span class="n">p</span><span class="o">.</span><span class="n">val</span> <span class="o">&gt;</span> <span class="n">q</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-        <span class="n">p</span><span class="p">,</span> <span class="n">q</span> <span class="o">=</span> <span class="n">q</span><span class="p">,</span> <span class="n">p</span>
-
-    <span class="k">while</span> <span class="n">root</span><span class="p">:</span>
-        <span class="c1"># If the current node value is greater than both p and q, move left</span>
-        <span class="k">if</span> <span class="n">root</span><span class="o">.</span><span class="n">val</span> <span class="o">&gt;</span> <span class="n">q</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-            <span class="n">root</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span>
-        <span class="c1"># If the current node value is less than both p and q, move right</span>
-        <span class="k">elif</span> <span class="n">root</span><span class="o">.</span><span class="n">val</span> <span class="o">&lt;</span> <span class="n">p</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-            <span class="n">root</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">right</span>
-        <span class="c1"># If the current node value is between p and q (inclusive), or it matches either p or q, it&#39;s the LCA</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">root</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">class</span> <span class="pre">TreeNode:</span></code> defines a simple class for representing nodes in a binary tree. Each <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> has three attributes:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">val</span></code>: The value of the node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">left</span></code>: A reference to the left child node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">right</span></code>: A reference to the right child node.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">lowestCommonAncestor(root,</span> <span class="pre">p,</span> <span class="pre">q):</span></code> is a function that takes three arguments:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">root</span></code>: The root node of the BST.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">p</span></code>: A TreeNode representing one of the nodes for which we want to find the LCA.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">q</span></code>: A TreeNode representing the other node for which we want to find the LCA.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">p.val</span> <span class="pre">&gt;</span> <span class="pre">q.val:</span></code> checks if the value of <code class="docutils literal notranslate"><span class="pre">p</span></code> is greater than the value of <code class="docutils literal notranslate"><span class="pre">q</span></code>. In a BST, it’s essential to ensure that <code class="docutils literal notranslate"><span class="pre">p</span></code> represents the smaller value, and <code class="docutils literal notranslate"><span class="pre">q</span></code> represents the larger value. If <code class="docutils literal notranslate"><span class="pre">p</span></code> is greater than <code class="docutils literal notranslate"><span class="pre">q</span></code>, the code swaps their values.</p></li>
-<li><p>The main logic is inside the <code class="docutils literal notranslate"><span class="pre">while</span></code> loop, which runs until <code class="docutils literal notranslate"><span class="pre">root</span></code> becomes <code class="docutils literal notranslate"><span class="pre">None</span></code>. It performs the following steps to find the LCA:</p>
-<ul class="simple">
-<li><p>If the current <code class="docutils literal notranslate"><span class="pre">root</span></code> node’s value is greater than the value of <code class="docutils literal notranslate"><span class="pre">q</span></code>, it means both <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> are on the left subtree of the current node. So, we move to the left child of the current node by setting <code class="docutils literal notranslate"><span class="pre">root</span> <span class="pre">=</span> <span class="pre">root.left</span></code>.</p></li>
-<li><p>If the current <code class="docutils literal notranslate"><span class="pre">root</span></code> node’s value is less than the value of <code class="docutils literal notranslate"><span class="pre">p</span></code>, it means both <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> are on the right subtree of the current node. So, we move to the right child of the current node by setting <code class="docutils literal notranslate"><span class="pre">root</span> <span class="pre">=</span> <span class="pre">root.right</span></code>.</p></li>
-<li><p>If neither of the above conditions is met, it means the current <code class="docutils literal notranslate"><span class="pre">root</span></code> node’s value is between <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>, or it matches either <code class="docutils literal notranslate"><span class="pre">p</span></code> or <code class="docutils literal notranslate"><span class="pre">q</span></code>. In this case, the current node is the lowest common ancestor (LCA), so we return <code class="docutils literal notranslate"><span class="pre">root</span></code>.</p></li>
-</ul>
-</li>
-</ol>
-<p>The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of <code class="docutils literal notranslate"><span class="pre">p</span></code>, <code class="docutils literal notranslate"><span class="pre">q</span></code>, and the current <code class="docutils literal notranslate"><span class="pre">root</span></code> node. Eventually, it reaches the LCA node, and that node is returned as the result.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Construct the tree</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">6</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">8</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-
-<span class="n">p</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span>  <span class="c1"># Node 2</span>
-<span class="n">q</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">right</span>  <span class="c1"># Node 8</span>
-
-<span class="n">result</span> <span class="o">=</span> <span class="n">lowestCommonAncestor</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>6
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="c1"># Using the same tree as before</span>
-<span class="n">p</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span>  <span class="c1"># Node 2</span>
-<span class="n">q</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span>  <span class="c1"># Node 4</span>
-
-<span class="n">result</span> <span class="o">=</span> <span class="n">lowestCommonAncestor</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="o">.</span><span class="n">val</span><span class="p">)</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="c1"># Creating a new tree for this example</span>
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-
-<span class="n">p</span> <span class="o">=</span> <span class="n">root2</span>  <span class="c1"># Node 2</span>
-<span class="n">q</span> <span class="o">=</span> <span class="n">root2</span><span class="o">.</span><span class="n">left</span>  <span class="c1"># Node 1</span>
-
-<span class="n">result</span> <span class="o">=</span> <span class="n">lowestCommonAncestor</span><span class="p">(</span><span class="n">root2</span><span class="p">,</span> <span class="n">p</span><span class="p">,</span> <span class="n">q</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).</p>
-<p><strong>Time Complexity:</strong>
-The time complexity of this algorithm is O(h), where “h” is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where “n” is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).</p>
-<p>The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code>. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.</p>
-<p><strong>Space Complexity:</strong>
-The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are <code class="docutils literal notranslate"><span class="pre">root</span></code>, <code class="docutils literal notranslate"><span class="pre">p</span></code>, and <code class="docutils literal notranslate"><span class="pre">q</span></code>, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.</p>
-<p><strong>In summary</strong>, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where “h” is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs.</p>
-<section id="challenging-exercises">
-<h3>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h3>
-<ol class="arabic simple">
-<li><p><strong>Multiple LCAs:</strong> Extend the algorithm to find all the lowest common ancestors of two given nodes <code class="docutils literal notranslate"><span class="pre">p</span></code> and <code class="docutils literal notranslate"><span class="pre">q</span></code> in a BST. In some cases, there can be multiple LCAs.</p></li>
-<li><p><strong>LCA with k Nodes:</strong> Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes.</p></li>
-</ol>
-</section>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">230. Kth Smallest Element in a BST</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">297. Serialize and Deserialize Binary Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-</li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html b/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html
deleted file mode 100644
index 17b2bce..0000000
--- a/_build/html/07. Trees/297. Serialize and Deserialize Binary Tree.html	
+++ /dev/null
@@ -1,839 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>297. Serialize and Deserialize Binary Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/297. Serialize and Deserialize Binary Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="572: Subtree of Another Tree" href="572.%20Subtree%20of%20Another%20Tree.html" />
-    <link rel="prev" title="235. Lowest Common Ancestor of a Binary Search Tree" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/297. Serialize and Deserialize Binary Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>297. Serialize and Deserialize Binary Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="serialize-and-deserialize-binary-tree">
-<h1>297. Serialize and Deserialize Binary Tree<a class="headerlink" href="#serialize-and-deserialize-binary-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/serialize-and-deserialize-binary-tree/">To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.</p>
-<p>Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.</p>
-<p><strong>Clarification:</strong> The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([0, 10^4]\)</span>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-1000</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.</p>
-<p>In the context of this problem:</p>
-<ol class="arabic simple">
-<li><p><strong>Serialization</strong>: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.</p></li>
-<li><p><strong>Deserialization</strong>: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.</p></li>
-</ol>
-<p>Here are some key points to consider in solving this problem:</p>
-<ul class="simple">
-<li><p>The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].</p></li>
-<li><p>You don’t necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.</p></li>
-<li><p>The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.</p></li>
-</ul>
-<p>A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">(</span><span class="nb">object</span><span class="p">):</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">x</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">x</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="kc">None</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="kc">None</span>
-
-<span class="k">class</span> <span class="nc">Codec</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">serialize</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">root</span><span class="p">):</span>
-        <span class="n">serialized</span>  <span class="o">=</span> <span class="p">[]</span>
-
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-            <span class="k">if</span> <span class="ow">not</span> <span class="n">node</span><span class="p">:</span>
-                <span class="c1"># If the node is None, represent it as &quot;Null&quot; in the serialized string</span>
-                <span class="n">serialized</span> <span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="s2">&quot;Null&quot;</span><span class="p">)</span>
-                <span class="k">return</span>
-            <span class="c1"># Convert the node&#39;s value to a string and add it to the serialized string</span>
-            <span class="n">serialized</span> <span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="nb">str</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">))</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-
-        <span class="n">dfs</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-        <span class="c1"># Join the serialized values with &quot;,&quot;</span>
-        <span class="k">return</span> <span class="s2">&quot;,&quot;</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">serialized</span> <span class="p">)</span>
-
-    <span class="k">def</span> <span class="nf">deserialize</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">data</span><span class="p">):</span>
-        <span class="n">vals</span> <span class="o">=</span> <span class="n">data</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="s2">&quot;,&quot;</span><span class="p">)</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
-
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">():</span>
-            <span class="k">if</span> <span class="n">vals</span><span class="p">[</span><span class="bp">self</span><span class="o">.</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="s2">&quot;Null&quot;</span><span class="p">:</span>
-                <span class="bp">self</span><span class="o">.</span><span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span>
-                <span class="k">return</span> <span class="kc">None</span>
-            <span class="c1"># Convert the value to an integer to create a new node</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="nb">int</span><span class="p">(</span><span class="n">vals</span><span class="p">[</span><span class="bp">self</span><span class="o">.</span><span class="n">i</span><span class="p">]))</span>
-            <span class="bp">self</span><span class="o">.</span><span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span>
-            <span class="n">node</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">dfs</span><span class="p">()</span>
-            <span class="n">node</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">dfs</span><span class="p">()</span>
-            <span class="k">return</span> <span class="n">node</span>
-
-        <span class="k">return</span> <span class="n">dfs</span><span class="p">()</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>Here’s a step-by-step explanation of the code:</p>
-<ol class="arabic simple">
-<li><p><strong>Definition of TreeNode</strong>:</p>
-<ul class="simple">
-<li><p>The code defines a simple <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class that represents a node in a binary tree. Each <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> has three attributes:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">val</span></code>: The integer value stored in the node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">left</span></code>: A reference to the left child node (or None if there is no left child).</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">right</span></code>: A reference to the right child node (or None if there is no right child).</p></li>
-</ul>
-</li>
-<li><p>This class allows you to create binary tree nodes with integer values and left and right child references.</p></li>
-</ul>
-</li>
-<li><p><strong>Serialization (serialize method)</strong>:</p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">serialize</span></code> method takes a <code class="docutils literal notranslate"><span class="pre">root</span></code> node as input, which is the root of the binary tree that needs to be serialized.</p></li>
-<li><p>It initializes an empty list <code class="docutils literal notranslate"><span class="pre">serialized</span></code> to store the serialized elements.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> (depth-first search) function is defined within the <code class="docutils literal notranslate"><span class="pre">serialize</span></code> method to perform a preorder traversal of the binary tree.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function:</p>
-<ul>
-<li><p>If the current <code class="docutils literal notranslate"><span class="pre">node</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> (i.e., a leaf node or a child of a leaf node), it appends the string “Null” to the <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list to represent the absence of a node.</p></li>
-<li><p>If the current <code class="docutils literal notranslate"><span class="pre">node</span></code> is not <code class="docutils literal notranslate"><span class="pre">None</span></code>, it appends the string representation of the <code class="docutils literal notranslate"><span class="pre">node.val</span></code> to the <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list and then recursively calls <code class="docutils literal notranslate"><span class="pre">dfs</span></code> on the left and right children.</p></li>
-</ul>
-</li>
-<li><p>After the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> traversal, the <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list contains the serialized binary tree elements.</p></li>
-<li><p>The method returns a string obtained by joining the elements in the <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list with commas.</p></li>
-</ul>
-</li>
-<li><p><strong>Deserialization (deserialize method)</strong>:</p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">deserialize</span></code> method takes a serialized string <code class="docutils literal notranslate"><span class="pre">data</span></code> as input, which represents a binary tree in the custom format.</p></li>
-<li><p>It splits the <code class="docutils literal notranslate"><span class="pre">data</span></code> string by commas to obtain a list of elements called <code class="docutils literal notranslate"><span class="pre">vals</span></code>.</p></li>
-<li><p>The method initializes an index <code class="docutils literal notranslate"><span class="pre">self.i</span></code> to 0. This index keeps track of the current position in the <code class="docutils literal notranslate"><span class="pre">vals</span></code> list during deserialization.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function is defined within the <code class="docutils literal notranslate"><span class="pre">deserialize</span></code> method to perform the deserialization process using a recursive approach.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function:</p>
-<ul>
-<li><p>If the current element in <code class="docutils literal notranslate"><span class="pre">vals</span></code> is “Null,” it means there is no node at this position in the binary tree, so it returns <code class="docutils literal notranslate"><span class="pre">None</span></code>.</p></li>
-<li><p>If the current element is not “Null,” it converts the element to an integer to create a new <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> with that value.</p></li>
-<li><p>It then recursively calls <code class="docutils literal notranslate"><span class="pre">dfs</span></code> to set the left and right children of the current node.</p></li>
-</ul>
-</li>
-<li><p>The method returns the root node of the reconstructed binary tree.</p></li>
-</ul>
-</li>
-</ol>
-<p>Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="c1"># Serialize a binary tree</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-
-<span class="n">codec</span> <span class="o">=</span> <span class="n">Codec</span><span class="p">()</span>
-<span class="n">serialized_tree</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">serialize</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">serialized_tree</span><span class="p">)</span>
-
-<span class="c1"># Deserialize the serialized tree</span>
-<span class="n">new_root</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">deserialize</span><span class="p">(</span><span class="n">serialized_tree</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1,2,Null,Null,3,4,Null,Null,5,Null,Null
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="c1"># Example usage:</span>
-<span class="c1"># Serialize a binary tree</span>
-<span class="n">root</span> <span class="o">=</span> <span class="kc">None</span>
-
-<span class="n">codec</span> <span class="o">=</span> <span class="n">Codec</span><span class="p">()</span>
-<span class="n">serialized_tree</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">serialize</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">serialized_tree</span><span class="p">)</span>
-
-<span class="c1"># Deserialize the serialized tree</span>
-<span class="n">new_root</span> <span class="o">=</span> <span class="n">codec</span><span class="o">.</span><span class="n">deserialize</span><span class="p">(</span><span class="n">serialized_tree</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Null
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:</p>
-<ol class="arabic simple">
-<li><p><strong>Serialization (serialize method)</strong>:</p>
-<ul class="simple">
-<li><p>Time Complexity:</p>
-<ul>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">serialize</span></code> method uses a depth-first traversal (preorder) of the binary tree.</p></li>
-<li><p>It visits each node exactly once.</p></li>
-<li><p>At each node, it performs constant-time operations (string conversion and list append).</p></li>
-<li><p>Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity:</p>
-<ul>
-<li><p>The space complexity for serialization includes the space used by the <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list and the recursive call stack.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">serialized</span></code> list stores the serialized elements, and its space is proportional to the number of nodes.</p></li>
-<li><p>The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).</p></li>
-<li><p>Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><strong>Deserialization (deserialize method)</strong>:</p>
-<ul class="simple">
-<li><p>Time Complexity:</p>
-<ul>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">deserialize</span></code> method splits the serialized string into a list of elements, which takes O(N) time.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function is a recursive function that visits each element in the list exactly once.</p></li>
-<li><p>At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).</p></li>
-<li><p>Therefore, the time complexity for deserialization is O(N).</p></li>
-</ul>
-</li>
-<li><p>Space Complexity:</p>
-<ul>
-<li><p>The space complexity for deserialization includes the space used by the <code class="docutils literal notranslate"><span class="pre">vals</span></code> list and the recursive call stack.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">vals</span></code> list stores the elements from the serialized string, and its space is proportional to the number of nodes.</p></li>
-<li><p>The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).</p></li>
-<li><p>Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p>Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Efficient Serialization</strong>:
-Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.</p></li>
-<li><p><strong>Custom Serialization Format</strong>:
-Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">235. Lowest Common Ancestor of a Binary Search Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="572.%20Subtree%20of%20Another%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">572: Subtree of Another Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/572. Subtree of Another Tree.html b/_build/html/07. Trees/572. Subtree of Another Tree.html
deleted file mode 100644
index eb976fe..0000000
--- a/_build/html/07. Trees/572. Subtree of Another Tree.html	
+++ /dev/null
@@ -1,788 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>572: Subtree of Another Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/572. Subtree of Another Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="98. Validate Binary Search Tree" href="98.%20Validate%20Binary%20Search%20Tree.html" />
-    <link rel="prev" title="297. Serialize and Deserialize Binary Tree" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/572. Subtree of Another Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/572. Subtree of Another Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>572: Subtree of Another Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#here-s-a-detailed-explanation-of-the-code">Here’s a detailed explanation of the code:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="subtree-of-another-tree">
-<h1>572: Subtree of Another Tree<a class="headerlink" href="#subtree-of-another-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/subtree-of-another-tree/">To see the Subtree of Another Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p><strong>Problem Description:</strong></p>
-<p>Given the roots of two binary trees <code class="docutils literal notranslate"><span class="pre">root</span></code> and <code class="docutils literal notranslate"><span class="pre">subRoot</span></code>, return <code class="docutils literal notranslate"><span class="pre">True</span></code> if there is a subtree of <code class="docutils literal notranslate"><span class="pre">root</span></code> with the same structure and node values as <code class="docutils literal notranslate"><span class="pre">subRoot</span></code>, and <code class="docutils literal notranslate"><span class="pre">False</span></code> otherwise.</p>
-<p>A subtree of a binary tree <code class="docutils literal notranslate"><span class="pre">tree</span></code> is a tree that consists of a node in <code class="docutils literal notranslate"><span class="pre">tree</span></code> and all of this node’s descendants. The tree <code class="docutils literal notranslate"><span class="pre">tree</span></code> could also be considered as a subtree of itself.</p>
-<p><strong>Constraints:</strong></p>
-<ol class="arabic simple">
-<li><p>The number of nodes in the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree is in the range <span class="math notranslate nohighlight">\([1, 2000]\)</span>.</p></li>
-<li><p>The number of nodes in the <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> tree is in the range <span class="math notranslate nohighlight">\([1, 1000]\)</span>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= root.val &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= subRoot.val &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">isSubtree</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">root</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">):</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">root</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">False</span>
-        
-        <span class="c1"># Check if the current subtree is equal to the subRoot</span>
-        <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">):</span>
-            <span class="k">return</span> <span class="kc">True</span>
-        
-        <span class="c1"># Recursively check the left and right subtrees</span>
-        <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">isSubtree</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">)</span> <span class="ow">or</span> <span class="bp">self</span><span class="o">.</span><span class="n">isSubtree</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">)</span>
-    
-    <span class="k">def</span> <span class="nf">isSameTree</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">tree1</span><span class="p">,</span> <span class="n">tree2</span><span class="p">):</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">tree1</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">tree2</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">True</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">tree1</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">tree2</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">False</span>
-        
-        <span class="k">return</span> <span class="p">(</span>
-            <span class="n">tree1</span><span class="o">.</span><span class="n">val</span> <span class="o">==</span> <span class="n">tree2</span><span class="o">.</span><span class="n">val</span> <span class="ow">and</span>
-            <span class="bp">self</span><span class="o">.</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">tree1</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">tree2</span><span class="o">.</span><span class="n">left</span><span class="p">)</span> <span class="ow">and</span>
-            <span class="bp">self</span><span class="o">.</span><span class="n">isSameTree</span><span class="p">(</span><span class="n">tree1</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">tree2</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-        <span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">isSubtree</span></code>: This method checks if there is a subtree of the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree with the same structure and node values as the <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> tree. It uses a helper function <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> to compare two trees for equality.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">isSameTree</span></code>: This helper method recursively compares two trees to check if they are the same in structure and node values.</p></li>
-</ol>
-<section id="here-s-a-detailed-explanation-of-the-code">
-<h2>Here’s a detailed explanation of the code:<a class="headerlink" href="#here-s-a-detailed-explanation-of-the-code" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>TreeNode Class:</strong></p></li>
-</ol>
-<p>The <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class is defined to represent nodes in a binary tree. Each node has a <code class="docutils literal notranslate"><span class="pre">val</span></code> (the node’s value) and may have a <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> child.</p>
-<ol class="arabic simple" start="2">
-<li><p><strong>Solution Class:</strong></p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class contains the solution for the problem and defines two important methods:</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">isSubtree(self,</span> <span class="pre">root,</span> <span class="pre">subRoot)</span></code>:</p>
-<ul>
-<li><p>This method checks whether <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> is a subtree of <code class="docutils literal notranslate"><span class="pre">root</span></code>. It takes two tree nodes, <code class="docutils literal notranslate"><span class="pre">root</span></code> and <code class="docutils literal notranslate"><span class="pre">subRoot</span></code>, as input arguments.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">root</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code> because there is no subtree to search.</p></li>
-<li><p>It then checks if the current subtree with <code class="docutils literal notranslate"><span class="pre">root</span></code> as its root is equal to <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> using the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> method. If they are the same, it returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If the current subtree is not the same as <code class="docutils literal notranslate"><span class="pre">subRoot</span></code>, it recursively checks the left and right subtrees of <code class="docutils literal notranslate"><span class="pre">root</span></code> to see if <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> is a subtree of any of them.</p></li>
-<li><p>It returns <code class="docutils literal notranslate"><span class="pre">True</span></code> if <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> is found in either the left or right subtree; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">isSameTree(self,</span> <span class="pre">tree1,</span> <span class="pre">tree2)</span></code>:</p>
-<ul>
-<li><p>This method checks whether two trees, <code class="docutils literal notranslate"><span class="pre">tree1</span></code> and <code class="docutils literal notranslate"><span class="pre">tree2</span></code>, are the same.</p></li>
-<li><p>If both <code class="docutils literal notranslate"><span class="pre">tree1</span></code> and <code class="docutils literal notranslate"><span class="pre">tree2</span></code> are <code class="docutils literal notranslate"><span class="pre">None</span></code>, they are considered the same tree, so it returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If only one of them is <code class="docutils literal notranslate"><span class="pre">None</span></code> (but not both), they are different trees, so it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If both <code class="docutils literal notranslate"><span class="pre">tree1</span></code> and <code class="docutils literal notranslate"><span class="pre">tree2</span></code> have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.</p></li>
-<li><p>It returns <code class="docutils literal notranslate"><span class="pre">True</span></code> if the trees are the same; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p>The code effectively uses recursion to traverse the binary trees and check for subtree equality. The <code class="docutils literal notranslate"><span class="pre">isSubtree</span></code> method starts the recursive search, and the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.</p>
-<p>This solution allows you to determine if there exists a subtree within the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree that matches the structure and node values of <code class="docutils literal notranslate"><span class="pre">subRoot</span></code>.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">#root = [3,4,5,1,2]</span>
-<span class="c1">#subRoot = [4,1,2]</span>
-
-<span class="c1"># Example input</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-
-<span class="n">subRoot</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">subRoot</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">subRoot</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-
-<span class="c1"># Create an instance of the Solution class</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="c1"># Test the isSubtree method</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">isSubtree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Is subRoot a subtree of root?&quot;</span><span class="p">,</span> <span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Is subRoot a subtree of root? True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">#root = [3,4,5,1,2,null,null,null,null,0] </span>
-<span class="c1">#subRoot = [4,1,2]</span>
-
-
-<span class="c1"># Example input</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-
-<span class="n">subRoot</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">subRoot</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">subRoot</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-
-<span class="c1"># Create an instance of the Solution class</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="c1"># Test the isSubtree method</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">isSubtree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">subRoot</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Is subRoot a subtree of root?&quot;</span><span class="p">,</span> <span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Is subRoot a subtree of root? False
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code for the “Subtree of Another Tree” problem:</p>
-<p><strong>Time Complexity</strong></p>
-<p>The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the <code class="docutils literal notranslate"><span class="pre">isSubtree</span></code> and <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> functions, we visit each node in the binary trees once. Let’s break down the time complexity:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">isSubtree</span></code> function:</p>
-<ul class="simple">
-<li><p>In the worst case, we need to visit every node in the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree.</p></li>
-<li><p>For each node in the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree, we call the <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function, which has its own traversal.</p></li>
-<li><p>So, the total time complexity is <span class="math notranslate nohighlight">\(O(n * m)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the number of nodes in the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree, and <span class="math notranslate nohighlight">\(m\)</span> is the number of nodes in the <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> tree.</p></li>
-</ul>
-</li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function:</p>
-<ul class="simple">
-<li><p>In the worst case, we visit every node in both <code class="docutils literal notranslate"><span class="pre">tree1</span></code> and <code class="docutils literal notranslate"><span class="pre">tree2</span></code>.</p></li>
-<li><p>The number of recursive calls made is proportional to the number of nodes in the trees.</p></li>
-<li><p>So, the time complexity of this function is <span class="math notranslate nohighlight">\(O(max(n, m))\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> and <span class="math notranslate nohighlight">\(m\)</span> are the numbers of nodes in <code class="docutils literal notranslate"><span class="pre">tree1</span></code> and <code class="docutils literal notranslate"><span class="pre">tree2</span></code>, respectively.</p></li>
-</ul>
-</li>
-</ol>
-<p>Overall, the time complexity of the entire code is <span class="math notranslate nohighlight">\(O(n * m)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the number of nodes in the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree, and <span class="math notranslate nohighlight">\(m\)</span> is the number of nodes in the <code class="docutils literal notranslate"><span class="pre">subRoot</span></code> tree. In practice, it may be less than <span class="math notranslate nohighlight">\(O(n * m)\)</span> if a subtree mismatch is detected early during the traversal.</p>
-<p><strong>Space Complexity</strong></p>
-<p>The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let’s analyze the space complexity:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">isSubtree</span></code> function:</p>
-<ul class="simple">
-<li><p>It uses the call stack for recursion.</p></li>
-<li><p>The maximum depth of the recursion is equal to the height of the <code class="docutils literal notranslate"><span class="pre">root</span></code> tree, which can be <span class="math notranslate nohighlight">\(O(n)\)</span> in the worst case (unbalanced tree).</p></li>
-<li><p>Additionally, the function doesn’t use any significant extra space other than the recursion stack.</p></li>
-</ul>
-</li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">isSameTree</span></code> function:</p>
-<ul class="simple">
-<li><p>It also uses the call stack for recursion.</p></li>
-<li><p>The maximum depth of the recursion is equal to the height of the <code class="docutils literal notranslate"><span class="pre">tree1</span></code> or <code class="docutils literal notranslate"><span class="pre">tree2</span></code>, whichever is greater.</p></li>
-<li><p>So, the maximum space used for the call stack is <span class="math notranslate nohighlight">\(O(max(n, m))\)</span>.</p></li>
-</ul>
-</li>
-</ol>
-<p>In summary, the space complexity of the code is <span class="math notranslate nohighlight">\(O(max(n, m))\)</span> due to the function call stack. It scales with the maximum height of the trees being compared.</p>
-<p>Overall, the code is efficient and works well for trees with moderate sizes. However, it’s important to keep in mind that the worst-case time complexity is <span class="math notranslate nohighlight">\(O(n * m)\)</span>, so for very large trees, the performance may degrade.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">297. Serialize and Deserialize Binary Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="98.%20Validate%20Binary%20Search%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">98. Validate Binary Search Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#here-s-a-detailed-explanation-of-the-code">Here’s a detailed explanation of the code:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/07. Trees/98. Validate Binary Search Tree.html b/_build/html/07. Trees/98. Validate Binary Search Tree.html
deleted file mode 100644
index 0d90f35..0000000
--- a/_build/html/07. Trees/98. Validate Binary Search Tree.html	
+++ /dev/null
@@ -1,740 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>98. Validate Binary Search Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/98. Validate Binary Search Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Trie Problems - Blind 75 LeetCode" href="../08.%20Tries/README.html" />
-    <link rel="prev" title="572: Subtree of Another Tree" href="572.%20Subtree%20of%20Another%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/98. Validate Binary Search Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/98. Validate Binary Search Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>98. Validate Binary Search Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="validate-binary-search-tree">
-<h1>98. Validate Binary Search Tree<a class="headerlink" href="#validate-binary-search-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/validate-binary-search-tree/">To see the Validate Binary Search Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary tree, <em>determine if it is a valid binary search tree (BST)</em>.</p>
-<p>A <strong>valid BST</strong> is defined as follows:</p>
-<ul class="simple">
-<li><p>The left subtree of a node contains only nodes with keys <strong>less than</strong> the node’s key.</p></li>
-<li><p>The right subtree of a node contains only nodes with keys <strong>greater than</strong> the node’s key.</p></li>
-<li><p>Both the left and right subtrees must also be binary search trees.</p></li>
-</ul>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([1, 10^4]\)</span>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-2^{31}\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">Node.val</span></code> &lt;= <span class="math notranslate nohighlight">\(2^{31} - 1\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">is_valid_BST</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="k">def</span> <span class="nf">is_valid</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">min_val</span><span class="p">,</span> <span class="n">max_val</span><span class="p">):</span>
-        <span class="c1"># Base case: If the node is None, it&#39;s a valid BST.</span>
-        <span class="k">if</span> <span class="n">node</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">True</span>
-        
-        <span class="c1"># Check if the current node&#39;s value is within the valid range.</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">min_val</span> <span class="o">&lt;</span> <span class="n">node</span><span class="o">.</span><span class="n">val</span> <span class="o">&lt;</span> <span class="n">max_val</span><span class="p">):</span>
-            <span class="k">return</span> <span class="kc">False</span>
-        
-        <span class="c1"># Recursively check the left and right subtrees with updated ranges.</span>
-        <span class="k">return</span> <span class="p">(</span><span class="n">is_valid</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">min_val</span><span class="p">,</span> <span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span> <span class="ow">and</span>
-                <span class="n">is_valid</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">,</span> <span class="n">max_val</span><span class="p">))</span>
-    
-    <span class="c1"># Call the helper function starting with a wide range for root node.</span>
-    <span class="k">return</span> <span class="n">is_valid</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="nb">float</span><span class="p">(</span><span class="s1">&#39;-inf&#39;</span><span class="p">),</span> <span class="nb">float</span><span class="p">(</span><span class="s1">&#39;inf&#39;</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p>It defines a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class to represent nodes in the binary tree.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">is_valid_BST</span></code> function takes the root node of the binary tree as input and returns <code class="docutils literal notranslate"><span class="pre">True</span></code> if the tree is a valid BST, and <code class="docutils literal notranslate"><span class="pre">False</span></code> otherwise.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">is_valid_BST</span></code> function, there is a helper function called <code class="docutils literal notranslate"><span class="pre">is_valid</span></code> that performs the actual validation using a recursive approach.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">is_valid</span></code> function checks each node in the tree to ensure that it satisfies the properties of a BST:</p>
-<ul>
-<li><p>The value of the current node must be within a valid range defined by <code class="docutils literal notranslate"><span class="pre">min_val</span></code> and <code class="docutils literal notranslate"><span class="pre">max_val</span></code>.</p></li>
-<li><p>The left subtree of the current node should contain values less than the current node’s value.</p></li>
-<li><p>The right subtree of the current node should contain values greater than the current node’s value.</p></li>
-</ul>
-</li>
-<li><p>If any of these conditions are violated, the function returns <code class="docutils literal notranslate"><span class="pre">False</span></code>, indicating that the tree is not a valid BST.</p></li>
-<li><p>If all nodes satisfy these conditions, the function returns <code class="docutils literal notranslate"><span class="pre">True</span></code>, indicating that the tree is a valid BST.</p></li>
-<li><p>The code calls the <code class="docutils literal notranslate"><span class="pre">is_valid</span></code> function with the root node and initial range values of negative infinity to positive infinity to start the validation.</p></li>
-<li><p>The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.</p></li>
-<li><p>The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.</p></li>
-</ul>
-<p>In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node’s value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="c1"># Create the tree for the first example: [2, 1, 3]</span>
-<span class="n">root1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">is_valid_BST</span><span class="p">(</span><span class="n">root1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="c1"># Create the tree for the second example: [5, 1, 4, None, None, 3, 6]</span>
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">6</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">is_valid_BST</span><span class="p">(</span><span class="n">root2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">is_valid_BST</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The time complexity of the function primarily depends on the number of nodes in the binary tree.</p></li>
-<li><p>In the worst case, we may have to visit every node in the tree once to validate whether it’s part of a valid BST.</p></li>
-<li><p>Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity is determined by the space used by the recursive call stack during the DFS traversal.</p></li>
-<li><p>In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.</p></li>
-<li><p>In a balanced BST, the height is approximately log2(N), where N is the number of nodes.</p></li>
-<li><p>Therefore, the space complexity of the call stack is O(log N) for a balanced BST.</p></li>
-<li><p>In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.</p></li>
-</ul>
-<p><strong>Overall:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: O(N)</p></li>
-<li><p>Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.</p></li>
-</ul>
-<p>The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Complex Constraints</strong>: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like “The left subtree of a node contains only nodes with keys less than or equal to the node’s key,” and “The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.” How would you adapt the code to handle these constraints?</p></li>
-<li><p><strong>Handling Duplicates</strong>: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="572.%20Subtree%20of%20Another%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">572: Subtree of Another Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../08.%20Tries/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Trie Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html b/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html
deleted file mode 100644
index 24b2af0..0000000
--- a/_build/html/08. Tries/208. Implement Trie (Prefix Tree).html	
+++ /dev/null
@@ -1,792 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>208. Implement Trie (Prefix Tree) &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/208. Implement Trie (Prefix Tree)';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="211. Design Add and Search Words Data Structure" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html" />
-    <link rel="prev" title="Trie Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F08. Tries/208. Implement Trie (Prefix Tree).html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>208. Implement Trie (Prefix Tree)</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="implement-trie-prefix-tree">
-<h1>208. Implement Trie (Prefix Tree)<a class="headerlink" href="#implement-trie-prefix-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/implement-trie-prefix-tree/">To see the Implement Trie problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>A <strong>trie</strong> (pronounced as “try”) or <strong>prefix tree</strong> 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.</p>
-<p>Implement the Trie class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">Trie()</span></code> Initializes the trie object.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">void</span> <span class="pre">insert(String</span> <span class="pre">word)</span></code> Inserts the string <code class="docutils literal notranslate"><span class="pre">word</span></code> into the trie.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">boolean</span> <span class="pre">search(String</span> <span class="pre">word)</span></code> Returns <code class="docutils literal notranslate"><span class="pre">true</span></code> if the string <code class="docutils literal notranslate"><span class="pre">word</span></code> is in the trie (i.e., was inserted before), and <code class="docutils literal notranslate"><span class="pre">false</span></code> otherwise.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">boolean</span> <span class="pre">startsWith(String</span> <span class="pre">prefix)</span></code> Returns <code class="docutils literal notranslate"><span class="pre">true</span></code> if there is a previously inserted string <code class="docutils literal notranslate"><span class="pre">word</span></code> that has the prefix <code class="docutils literal notranslate"><span class="pre">prefix</span></code>, and <code class="docutils literal notranslate"><span class="pre">false</span></code> otherwise.</p></li>
-</ul>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">word.length,</span> <span class="pre">prefix.length</span> <span class="pre">&lt;=</span> <span class="pre">2000</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">word</span></code> and <code class="docutils literal notranslate"><span class="pre">prefix</span></code> consist only of lowercase English letters.</p></li>
-<li><p>At most <span class="math notranslate nohighlight">\(3 * 10^4\)</span> calls in total will be made to <code class="docutils literal notranslate"><span class="pre">insert</span></code>, <code class="docutils literal notranslate"><span class="pre">search</span></code>, and <code class="docutils literal notranslate"><span class="pre">startsWith</span></code>.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem at hand is to implement a data structure known as a Trie (pronounced “try”) or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It’s particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">Trie()</span></code>: This is the constructor that initializes the Trie object.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">void</span> <span class="pre">insert(String</span> <span class="pre">word)</span></code>: This method inserts the given string <code class="docutils literal notranslate"><span class="pre">word</span></code> into the Trie. It effectively adds the characters of the word to the Trie’s structure, creating nodes for each character if they don’t already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">boolean</span> <span class="pre">search(String</span> <span class="pre">word)</span></code>: This method checks if the given string <code class="docutils literal notranslate"><span class="pre">word</span></code> is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns <code class="docutils literal notranslate"><span class="pre">true</span></code>, indicating that the word exists in the Trie; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">false</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">boolean</span> <span class="pre">startsWith(String</span> <span class="pre">prefix)</span></code>: This method checks if there is any previously inserted word in the Trie that has the given <code class="docutils literal notranslate"><span class="pre">prefix</span></code>. It’s similar to the <code class="docutils literal notranslate"><span class="pre">search</span></code> method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns <code class="docutils literal notranslate"><span class="pre">true</span></code>; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">false</span></code>.</p></li>
-</ol>
-<p>The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.</p>
-<p>In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TrieNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">children</span> <span class="o">=</span> <span class="p">{}</span>           <span class="c1"># A dictionary to store child nodes</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">False</span>  <span class="c1"># Indicates if a word ends at this node</span>
-
-<span class="k">class</span> <span class="nc">Trie</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">root</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>       <span class="c1"># Initialize the Trie with a root node</span>
-
-    <span class="k">def</span> <span class="nf">insert</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">word</span><span class="p">):</span>
-        <span class="n">node</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">root</span>             <span class="c1"># Start from the root</span>
-        <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">word</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-                <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>  <span class="c1"># Create a new node if the character is not present</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span>           <span class="c1"># Move to the child node</span>
-        <span class="n">node</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">True</span>                <span class="c1"># Mark the end of the inserted word</span>
-
-    <span class="k">def</span> <span class="nf">search</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">word</span><span class="p">):</span>
-        <span class="n">node</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">root</span>             <span class="c1"># Start from the root</span>
-        <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">word</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-                <span class="k">return</span> <span class="kc">False</span>         <span class="c1"># If the character is not found, the word is not in the Trie</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span>  <span class="c1"># Move to the child node</span>
-        <span class="k">return</span> <span class="n">node</span><span class="o">.</span><span class="n">is_end_of_word</span>    <span class="c1"># Check if the node represents the end of a valid word</span>
-
-    <span class="k">def</span> <span class="nf">startsWith</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">prefix</span><span class="p">):</span>
-        <span class="n">node</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">root</span>             <span class="c1"># Start from the root</span>
-        <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">prefix</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-                <span class="k">return</span> <span class="kc">False</span>         <span class="c1"># If the character is not found, no word starts with the prefix</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span>  <span class="c1"># Move to the child node</span>
-        <span class="k">return</span> <span class="kc">True</span>                  <span class="c1"># Prefix found in the Trie</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>Let’s explain how the code works step by step:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">TrieNode</span></code> Class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">TrieNode</span></code> is a class that represents nodes in the Trie. Each node has two attributes:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">children</span></code>: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">is_end_of_word</span></code>: This boolean flag indicates whether the node represents the end of a complete word. Initially, it’s set to <code class="docutils literal notranslate"><span class="pre">False</span></code> for all nodes.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">Trie</span></code> Class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">Trie</span></code> is the main class that implements the Trie data structure. It has the following methods:</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">__init__(self)</span></code>: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">insert(self,</span> <span class="pre">word)</span></code>: This method inserts a string <code class="docutils literal notranslate"><span class="pre">word</span></code> into the Trie. It starts from the root node and iterates through each character in the word.</p>
-<ul>
-<li><p>If a character is not present as a child node, it creates a new node for that character.</p></li>
-<li><p>It then moves to the child node and continues the process until the entire word is inserted.</p></li>
-<li><p>Finally, it sets the <code class="docutils literal notranslate"><span class="pre">is_end_of_word</span></code> flag to <code class="docutils literal notranslate"><span class="pre">True</span></code> for the last node to mark the end of the inserted word.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">search(self,</span> <span class="pre">word)</span></code>: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.</p>
-<ul>
-<li><p>If a character is not found as a child node, it immediately returns <code class="docutils literal notranslate"><span class="pre">False</span></code> because the word is not in the Trie.</p></li>
-<li><p>It continues to move to the child node for each character.</p></li>
-<li><p>After reaching the end of the word, it checks if the <code class="docutils literal notranslate"><span class="pre">is_end_of_word</span></code> flag is <code class="docutils literal notranslate"><span class="pre">True</span></code> for the last node to confirm the presence of the word.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">startsWith(self,</span> <span class="pre">prefix)</span></code>: This method checks if there is any previously inserted word in the Trie that starts with a given <code class="docutils literal notranslate"><span class="pre">prefix</span></code>. It follows the same logic as the <code class="docutils literal notranslate"><span class="pre">search</span></code> method but does not require the entire word to be present.</p>
-<ul>
-<li><p>If the prefix is found in the Trie, it returns <code class="docutils literal notranslate"><span class="pre">True</span></code>; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p>Example Usage:</p>
-<ul class="simple">
-<li><p>The code demonstrates how to create a Trie object, insert words (“apple” and “app”), and perform operations on the Trie:</p>
-<ul>
-<li><p>It inserts the word “apple” into the Trie.</p></li>
-<li><p>It checks if “apple” is in the Trie, which returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>It checks if “app” is in the Trie, which returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>It checks if there is any word in the Trie that starts with “app,” which returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>It inserts the word “app” into the Trie.</p></li>
-<li><p>It checks if “app” is in the Trie again, which now returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p>In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-
-<span class="n">trie</span> <span class="o">=</span> <span class="n">Trie</span><span class="p">()</span>
-<span class="n">trie</span><span class="o">.</span><span class="n">insert</span><span class="p">(</span><span class="s2">&quot;apple&quot;</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">trie</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;apple&quot;</span><span class="p">))</span>   <span class="c1"># Output: True</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">trie</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;app&quot;</span><span class="p">))</span>     <span class="c1"># Output: False</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">trie</span><span class="o">.</span><span class="n">startsWith</span><span class="p">(</span><span class="s2">&quot;app&quot;</span><span class="p">))</span> <span class="c1"># Output: True</span>
-<span class="n">trie</span><span class="o">.</span><span class="n">insert</span><span class="p">(</span><span class="s2">&quot;app&quot;</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">trie</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;app&quot;</span><span class="p">))</span>     <span class="c1"># Output: True</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-False
-True
-True
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the Trie implementation:</p>
-<ol class="arabic">
-<li><p>Time Complexity:</p>
-<ul class="simple">
-<li><p>Insertion (<code class="docutils literal notranslate"><span class="pre">insert</span></code> method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.</p></li>
-<li><p>Search (<code class="docutils literal notranslate"><span class="pre">search</span></code> method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.</p></li>
-<li><p>Starts with (<code class="docutils literal notranslate"><span class="pre">startsWith</span></code> method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.</p></li>
-</ul>
-<p>Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.</p>
-</li>
-<li><p>Space Complexity:</p>
-<ul class="simple">
-<li><p>The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.</p></li>
-<li><p>Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.</p></li>
-</ul>
-<p>In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.</p>
-</li>
-</ol>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.</p></li>
-<li><p>Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used.</p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Count Prefixes</strong>:
-Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.</p></li>
-<li><p><strong>Auto-Complete Suggestions</strong>:
-Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./08. Tries"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Trie Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">211. Design Add and Search Words Data Structure</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html b/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html
deleted file mode 100644
index 395ec33..0000000
--- a/_build/html/08. Tries/211. Design Add and Search Words Data Structure.html	
+++ /dev/null
@@ -1,806 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>211. Design Add and Search Words Data Structure &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/211. Design Add and Search Words Data Structure';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="212. Word Search II" href="212.%20Word%20Search%20II.html" />
-    <link rel="prev" title="208. Implement Trie (Prefix Tree)" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F08. Tries/211. Design Add and Search Words Data Structure.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>211. Design Add and Search Words Data Structure</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="design-add-and-search-words-data-structure">
-<h1>211. Design Add and Search Words Data Structure<a class="headerlink" href="#design-add-and-search-words-data-structure" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/design-add-and-search-words-data-structure/">To see the Design Add and Search Words Data Structure problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Design a data structure that supports adding new words and finding if a string matches any previously added string.</p>
-<p>Implement the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">WordDictionary()</span></code> Initializes the object.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">void</span> <span class="pre">addWord(word)</span></code> Adds <code class="docutils literal notranslate"><span class="pre">word</span></code> to the data structure, it can be matched later.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">bool</span> <span class="pre">search(word)</span></code> Returns <code class="docutils literal notranslate"><span class="pre">true</span></code> if there is any string in the data structure that matches <code class="docutils literal notranslate"><span class="pre">word</span></code> or <code class="docutils literal notranslate"><span class="pre">false</span></code> otherwise. <code class="docutils literal notranslate"><span class="pre">word</span></code> may contain dots <code class="docutils literal notranslate"><span class="pre">'.'</span></code> where dots can be matched with any letter.</p></li>
-</ul>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">word.length</span> <span class="pre">&lt;=</span> <span class="pre">25</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">word</span></code> in <code class="docutils literal notranslate"><span class="pre">addWord</span></code> consists of lowercase English letters.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">word</span></code> in <code class="docutils literal notranslate"><span class="pre">search</span></code> consist of <code class="docutils literal notranslate"><span class="pre">'.'</span></code> or lowercase English letters.</p></li>
-<li><p>There will be at most <code class="docutils literal notranslate"><span class="pre">2</span></code> dots in <code class="docutils literal notranslate"><span class="pre">word</span></code> for <code class="docutils literal notranslate"><span class="pre">search</span></code> queries.</p></li>
-<li><p>At most <span class="math notranslate nohighlight">\(10^4\)</span> calls will be made to <code class="docutils literal notranslate"><span class="pre">addWord</span></code> and <code class="docutils literal notranslate"><span class="pre">search</span></code>.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to design a data structure called <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot (‘.’) can match any letter.</p>
-<p>Here are the specific requirements and explanations for the problem:</p>
-<ol class="arabic simple">
-<li><p>Initialize the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> object using the constructor <code class="docutils literal notranslate"><span class="pre">WordDictionary()</span></code>.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">addWord(word)</span></code> method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">search(word)</span></code> method allows you to search for a word in the data structure. This method returns <code class="docutils literal notranslate"><span class="pre">True</span></code> if there is any string in the data structure that matches the given word or <code class="docutils literal notranslate"><span class="pre">False</span></code> otherwise. The word you are searching for may contain dots (‘.’), where each dot can match any letter.</p></li>
-<li><p>The wildcard character (‘.’) in the <code class="docutils literal notranslate"><span class="pre">search</span></code> method allows for partial or fuzzy searching. For example, if the word dictionary contains the words “bad,” “dad,” and “mad,” then:</p>
-<ul class="simple">
-<li><p>Searching for “pad” should return <code class="docutils literal notranslate"><span class="pre">False</span></code> because there is no exact match.</p></li>
-<li><p>Searching for “bad” should return <code class="docutils literal notranslate"><span class="pre">True</span></code> because “bad” is in the dictionary.</p></li>
-<li><p>Searching for “.ad” should return <code class="docutils literal notranslate"><span class="pre">True</span></code> because it can match “bad,” “dad,” or “mad.”</p></li>
-<li><p>Searching for “b..” should return <code class="docutils literal notranslate"><span class="pre">True</span></code> because it can match “bad,” “bed,” “bet,” etc.</p></li>
-</ul>
-</li>
-<li><p>The problem specifies that there will be at most two dots (‘.’) in search queries, and there will be at most 10^4 calls to both <code class="docutils literal notranslate"><span class="pre">addWord</span></code> and <code class="docutils literal notranslate"><span class="pre">search</span></code>.</p></li>
-</ol>
-<p>In summary, you need to implement the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class that efficiently supports adding words and searching for words, where the search can include wildcard characters (‘.’) that match any letter.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TrieNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="c1"># Initialize a TrieNode with children and a flag to indicate the end of a word.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">children</span> <span class="o">=</span> <span class="p">{}</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">False</span>
-
-<span class="k">class</span> <span class="nc">WordDictionary</span><span class="p">:</span>
-
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="c1"># Initialize the WordDictionary with a root node.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">root</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>
-
-    <span class="k">def</span> <span class="nf">addWord</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">word</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">None</span><span class="p">:</span>
-        <span class="n">node</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">root</span>
-        <span class="c1"># Iterate through the characters in the word.</span>
-        <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">word</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-                <span class="c1"># Create a new node for the character if it doesn&#39;t exist.</span>
-                <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>
-            <span class="c1"># Move to the next node.</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span>
-        <span class="c1"># Mark the end of the word by setting the flag to True.</span>
-        <span class="n">node</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">True</span>
-
-    <span class="k">def</span> <span class="nf">search_helper</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">node</span><span class="p">:</span> <span class="n">TrieNode</span><span class="p">,</span> <span class="n">word</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">word</span><span class="p">:</span>
-            <span class="c1"># If there are no characters left in the word, check if we reached the end of a word in the trie.</span>
-            <span class="k">return</span> <span class="n">node</span><span class="o">.</span><span class="n">is_end_of_word</span>
-        
-        <span class="n">char</span> <span class="o">=</span> <span class="n">word</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-        <span class="k">if</span> <span class="n">char</span> <span class="o">==</span> <span class="s1">&#39;.&#39;</span><span class="p">:</span>
-            <span class="c1"># If the character is a dot, explore all possible child nodes.</span>
-            <span class="k">for</span> <span class="n">child</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="o">.</span><span class="n">values</span><span class="p">():</span>
-                <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">search_helper</span><span class="p">(</span><span class="n">child</span><span class="p">,</span> <span class="n">word</span><span class="p">[</span><span class="mi">1</span><span class="p">:]):</span>
-                    <span class="k">return</span> <span class="kc">True</span>
-        <span class="k">elif</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-            <span class="c1"># If the character is in the children of the current node, move to the next node.</span>
-            <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">search_helper</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">],</span> <span class="n">word</span><span class="p">[</span><span class="mi">1</span><span class="p">:])</span>
-        
-        <span class="c1"># If the character is not found and is not a dot, the word is not in the trie.</span>
-        <span class="k">return</span> <span class="kc">False</span>
-
-    <span class="k">def</span> <span class="nf">search</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">word</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-        <span class="c1"># Start the search from the root of the trie.</span>
-        <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">search_helper</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">root</span><span class="p">,</span> <span class="n">word</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>This code defines a <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class that uses a Trie data structure to efficiently store and search for words. Here’s a step-by-step explanation:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">TrieNode</span></code> class: This class represents nodes in the Trie data structure. Each node has two attributes: <code class="docutils literal notranslate"><span class="pre">children</span></code> (a dictionary to store child nodes) and <code class="docutils literal notranslate"><span class="pre">is_end_of_word</span></code> (a flag to indicate whether the node marks the end of a word).</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class: This class initializes with an empty Trie by creating a root node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">addWord</span></code> method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the <code class="docutils literal notranslate"><span class="pre">is_end_of_word</span></code> flag to <code class="docutils literal notranslate"><span class="pre">True</span></code> for the final character of the word to mark the end of the word.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">search_helper</span></code> method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (<code class="docutils literal notranslate"><span class="pre">node</span></code>) and a word to search (<code class="docutils literal notranslate"><span class="pre">word</span></code>) as input. If there are no characters left in the word (<code class="docutils literal notranslate"><span class="pre">not</span> <span class="pre">word</span></code>), it checks if the current node marks the end of a word. If it does, it returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If the first character of the word is a dot (‘.’), the function explores all possible child nodes by iterating through <code class="docutils literal notranslate"><span class="pre">node.children.values()</span></code> and recursively calls <code class="docutils literal notranslate"><span class="pre">search_helper</span></code> for each child with the remaining part of the word (<code class="docutils literal notranslate"><span class="pre">word[1:]</span></code>).</p></li>
-<li><p>If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling <code class="docutils literal notranslate"><span class="pre">search_helper</span></code> on the child node and the remaining part of the word.</p></li>
-<li><p>If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">search</span></code> method: This is the public method for searching words. It initiates the search process by calling <code class="docutils literal notranslate"><span class="pre">search_helper</span></code> starting from the root node of the Trie.</p></li>
-</ol>
-<p>Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots (‘.’).</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-
-<span class="n">wordDictionary</span> <span class="o">=</span> <span class="n">WordDictionary</span><span class="p">()</span>
-<span class="n">wordDictionary</span><span class="o">.</span><span class="n">addWord</span><span class="p">(</span><span class="s2">&quot;bad&quot;</span><span class="p">)</span>
-<span class="n">wordDictionary</span><span class="o">.</span><span class="n">addWord</span><span class="p">(</span><span class="s2">&quot;dad&quot;</span><span class="p">)</span>
-<span class="n">wordDictionary</span><span class="o">.</span><span class="n">addWord</span><span class="p">(</span><span class="s2">&quot;mad&quot;</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">wordDictionary</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;pad&quot;</span><span class="p">))</span>  <span class="c1"># Output: False</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">wordDictionary</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;bad&quot;</span><span class="p">))</span>  <span class="c1"># Output: True</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">wordDictionary</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;.ad&quot;</span><span class="p">))</span>  <span class="c1"># Output: True</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">wordDictionary</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="s2">&quot;b..&quot;</span><span class="p">))</span>  <span class="c1"># Output: True</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-True
-True
-True
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class methods:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">addWord</span></code> Method:</p>
-<ul class="simple">
-<li><p>Time Complexity: O(L)</p>
-<ul>
-<li><p>L is the length of the word being added.</p></li>
-<li><p>In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: O(L)</p>
-<ul>
-<li><p>The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">search_helper</span></code> Method (called by <code class="docutils literal notranslate"><span class="pre">search</span></code>):</p>
-<ul class="simple">
-<li><p>Time Complexity: O(2^M * L)</p>
-<ul>
-<li><p>M is the maximum number of dots (‘.’) in the search word.</p></li>
-<li><p>In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.</p></li>
-<li><p>So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: O(L)</p>
-<ul>
-<li><p>The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">search</span></code> Method:</p>
-<ul class="simple">
-<li><p>Time Complexity: O(2^M * L)</p>
-<ul>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">search</span></code> method calls the <code class="docutils literal notranslate"><span class="pre">search_helper</span></code> method, which has the same time complexity explained above.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: O(L)</p>
-<ul>
-<li><p>The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p>Overall, the time complexity of the <code class="docutils literal notranslate"><span class="pre">search</span></code> method is mainly affected by the number of dots (‘.’) in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.</p>
-<p>The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.</p>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time Complexity for <code class="docutils literal notranslate"><span class="pre">addWord</span></code>: O(L)</p></li>
-<li><p>Time Complexity for <code class="docutils literal notranslate"><span class="pre">search</span></code>: O(2^M * L)</p></li>
-<li><p>Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.</p></li>
-</ul>
-<p>Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Dictionary Auto-Completion</strong>: Extend the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.</p></li>
-<li><p><strong>Support Word Deletion</strong>: Extend the <code class="docutils literal notranslate"><span class="pre">WordDictionary</span></code> class to support word deletion. Add a method <code class="docutils literal notranslate"><span class="pre">deleteWord(word)</span></code> that removes a word from the data structure. Ensure that the search operation still works correctly after deletion.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./08. Tries"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">208. Implement Trie (Prefix Tree)</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="212.%20Word%20Search%20II.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">212. Word Search II</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/11. Graphs/133. Clone Graph.html b/_build/html/11. Graphs/133. Clone Graph.html
deleted file mode 100644
index fa3d704..0000000
--- a/_build/html/11. Graphs/133. Clone Graph.html	
+++ /dev/null
@@ -1,811 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>133. Clone Graph &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/133. Clone Graph';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="178. Graph Valid Tree" href="178.%20Graph%20Valid%20Tree.html" />
-    <link rel="prev" title="Graphs Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/133. Clone Graph.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/133. Clone Graph.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>133. Clone Graph</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="clone-graph">
-<h1>133. Clone Graph<a class="headerlink" href="#clone-graph" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/clone-graph/">To see the Clone Graph problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given a reference of a node in a <strong>connected</strong> undirected graph.</p>
-<p>Return a <strong>deep copy</strong> (clone) of the graph.</p>
-<p>Each node in the graph contains a value (<code class="docutils literal notranslate"><span class="pre">int</span></code>) and a list (<code class="docutils literal notranslate"><span class="pre">List[Node]</span></code>) of its neighbors.</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">Node</span> <span class="p">{</span>
-    <span class="n">public</span> <span class="nb">int</span> <span class="n">val</span><span class="p">;</span>
-    <span class="n">public</span> <span class="n">List</span><span class="o">&lt;</span><span class="n">Node</span><span class="o">&gt;</span> <span class="n">neighbors</span><span class="p">;</span>
-<span class="p">}</span>
-</pre></div>
-</div>
-<p><strong>Test case format:</strong></p>
-<p>For simplicity, each node’s value is the same as the node’s index (1-indexed). For example, the first node with <code class="docutils literal notranslate"><span class="pre">val</span> <span class="pre">==</span> <span class="pre">1</span></code>, the second node with <code class="docutils literal notranslate"><span class="pre">val</span> <span class="pre">==</span> <span class="pre">2</span></code>, and so on. The graph is represented in the test case using an adjacency list.</p>
-<p><strong>An adjacency list</strong> is a collection of unordered <strong>lists</strong> used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.</p>
-<p>The given node will always be the first node with <code class="docutils literal notranslate"><span class="pre">val</span> <span class="pre">=</span> <span class="pre">1</span></code>. You must return the <strong>copy of the given node</strong> as a reference to the cloned graph.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the graph is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">Node.val</span></code> is unique for each node.</p></li>
-<li><p>There are no repeated edges and no self-loops in the graph.</p></li>
-<li><p>The Graph is connected and all nodes can be visited starting from the given node.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.</p>
-<p>Here are the key aspects of the problem:</p>
-<ol class="arabic simple">
-<li><p><strong>Input</strong>: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.</p></li>
-<li><p><strong>Output</strong>: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.</p></li>
-<li><p><strong>Graph Structure</strong>: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.</p></li>
-<li><p><strong>Connected Graph</strong>: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.</p></li>
-</ol>
-<p>To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.</p>
-<p>The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a Node.</span>
-<span class="k">class</span> <span class="nc">Node</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">neighbors</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">neighbors</span> <span class="o">=</span> <span class="n">neighbors</span> <span class="k">if</span> <span class="n">neighbors</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span> <span class="k">else</span> <span class="p">[]</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">cloneGraph</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">node</span><span class="p">:</span> <span class="s1">&#39;Node&#39;</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="s1">&#39;Node&#39;</span><span class="p">:</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">node</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">None</span>
-
-        <span class="n">visited</span> <span class="o">=</span> <span class="p">{}</span>  <span class="c1"># Dictionary to keep track of visited nodes</span>
-
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">original_node</span><span class="p">):</span>
-            <span class="k">if</span> <span class="n">original_node</span> <span class="ow">in</span> <span class="n">visited</span><span class="p">:</span>
-                <span class="k">return</span> <span class="n">visited</span><span class="p">[</span><span class="n">original_node</span><span class="p">]</span>
-
-            <span class="c1"># Create a copy of the original node</span>
-            <span class="n">copy_node</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="n">original_node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-            <span class="n">visited</span><span class="p">[</span><span class="n">original_node</span><span class="p">]</span> <span class="o">=</span> <span class="n">copy_node</span>
-
-            <span class="c1"># Recursively clone the neighbors of the original node</span>
-            <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">original_node</span><span class="o">.</span><span class="n">neighbors</span><span class="p">:</span>
-                <span class="n">copy_node</span><span class="o">.</span><span class="n">neighbors</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">dfs</span><span class="p">(</span><span class="n">neighbor</span><span class="p">))</span>
-
-            <span class="k">return</span> <span class="n">copy_node</span>
-
-        <span class="k">return</span> <span class="n">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The given code defines a Python class, <code class="docutils literal notranslate"><span class="pre">Node</span></code>, and a solution class, <code class="docutils literal notranslate"><span class="pre">Solution</span></code>, to clone a connected undirected graph represented by nodes and their neighbors. Here’s an explanation of the code:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">Node</span></code> class defines a node in the graph. Each node has a value (<code class="docutils literal notranslate"><span class="pre">val</span></code>) which is an integer and a list of neighbors (<code class="docutils literal notranslate"><span class="pre">neighbors</span></code>) that are other nodes in the graph.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class contains the method <code class="docutils literal notranslate"><span class="pre">cloneGraph</span></code>, which takes a reference to the first node of the graph (<code class="docutils literal notranslate"><span class="pre">node</span></code>) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">cloneGraph</span></code> method:</p>
-<ul class="simple">
-<li><p>It first checks if the input <code class="docutils literal notranslate"><span class="pre">node</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>. If it’s <code class="docutils literal notranslate"><span class="pre">None</span></code>, it means there is no graph to clone, and the method returns <code class="docutils literal notranslate"><span class="pre">None</span></code>.</p></li>
-<li><p>It initializes a <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> (depth-first search) function is defined within the <code class="docutils literal notranslate"><span class="pre">cloneGraph</span></code> method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function:</p>
-<ul>
-<li><p>It checks if the original node has been visited before by looking it up in the <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary. If it has been visited, it returns the corresponding clone from the <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary.</p></li>
-<li><p>If the original node is not visited, it creates a new node, <code class="docutils literal notranslate"><span class="pre">copy_node</span></code>, with the same value as the original node. This is the first step in creating the clone of the original node.</p></li>
-<li><p>It then recursively clones the neighbors of the original node by iterating through the <code class="docutils literal notranslate"><span class="pre">neighbors</span></code> list of the original node and appending the corresponding cloned neighbors to the <code class="docutils literal notranslate"><span class="pre">neighbors</span></code> list of the <code class="docutils literal notranslate"><span class="pre">copy_node</span></code>. This step ensures that the relationships between nodes are preserved in the clone.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">copy_node</span></code> is added to the <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary with the original node as the key and the clone as the value.</p></li>
-<li><p>Finally, the <code class="docutils literal notranslate"><span class="pre">copy_node</span></code> is returned as the result of the DFS for the original node.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">cloneGraph</span></code> method returns the result of the DFS on the input <code class="docutils literal notranslate"><span class="pre">node</span></code>, which is the clone of the entire graph with its structure and relationships intact.</p></li>
-</ol>
-<p>In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">get_adjacency_list</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-    <span class="n">visited</span> <span class="o">=</span> <span class="p">{}</span>  <span class="c1"># Dictionary to keep track of visited nodes</span>
-
-    <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">node</span><span class="p">:</span>
-            <span class="k">return</span> <span class="p">[]</span>
-
-        <span class="k">if</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">visited</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">visited</span><span class="p">[</span><span class="n">node</span><span class="p">]</span>
-
-        <span class="n">neighbors</span> <span class="o">=</span> <span class="p">[</span><span class="n">n</span><span class="o">.</span><span class="n">val</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">neighbors</span><span class="p">]</span>
-        <span class="n">visited</span><span class="p">[</span><span class="n">node</span><span class="p">]</span> <span class="o">=</span> <span class="n">neighbors</span>
-
-        <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">neighbors</span><span class="p">:</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span>
-
-    <span class="n">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">)</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-
-    <span class="k">def</span> <span class="nf">get_node_and_neighbors</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">([</span><span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">]</span> <span class="o">+</span> <span class="n">visited</span><span class="p">[</span><span class="n">node</span><span class="p">])</span>
-
-    <span class="n">get_node_and_neighbors</span><span class="p">(</span><span class="n">node</span><span class="p">)</span>
-    <span class="k">return</span> <span class="n">result</span>
-
-
-<span class="c1"># Testing the code with the provided examples</span>
-<span class="n">adjList1</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">4</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">4</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">]]</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="c1"># Create the graph from adjList</span>
-<span class="n">nodes</span> <span class="o">=</span> <span class="p">[</span><span class="n">Node</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">adjList1</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)]</span>
-<span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">adj</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">adjList1</span><span class="p">):</span>
-    <span class="n">nodes</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">.</span><span class="n">neighbors</span> <span class="o">=</span> <span class="p">[</span><span class="n">nodes</span><span class="p">[</span><span class="n">j</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]</span> <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">adj</span><span class="p">]</span>
-
-<span class="c1"># Clone the graph and get its adjacency list</span>
-<span class="n">cloned_node1</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">cloneGraph</span><span class="p">(</span><span class="n">nodes</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
-<span class="n">cloned_adjList1</span> <span class="o">=</span> <span class="n">get_adjacency_list</span><span class="p">(</span><span class="n">cloned_node1</span><span class="p">)</span>
-
-<span class="c1"># Print the cloned graph as an adjacency list</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">cloned_adjList1</span><span class="p">)</span>
-
-<span class="c1"># Output should match adjList1</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[1, 2, 4]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="c1"># Input: adjList = [[]]</span>
-
-<span class="n">adjList2</span> <span class="o">=</span> <span class="p">[[]]</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="c1"># Create the graph from adjList</span>
-<span class="n">node1</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-
-<span class="c1"># Clone the graph and get its adjacency list</span>
-<span class="n">cloned_node1</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">cloneGraph</span><span class="p">(</span><span class="n">node1</span><span class="p">)</span>
-<span class="n">cloned_adjList2</span> <span class="o">=</span> <span class="n">get_adjacency_list</span><span class="p">(</span><span class="n">cloned_node1</span><span class="p">)</span>
-
-<span class="c1"># Print the cloned graph as an adjacency list</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">cloned_adjList2</span><span class="p">)</span>
-
-<span class="c1"># Output should be [[]], which represents an empty graph</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[1]]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).</p>
-<p>Time Complexity:</p>
-<ol class="arabic simple">
-<li><p>Creating the graph: The time complexity to create the original graph from <code class="docutils literal notranslate"><span class="pre">adjList</span></code> is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in <code class="docutils literal notranslate"><span class="pre">adjList</span></code>.</p></li>
-<li><p>Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.</p></li>
-</ol>
-<p>Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.</p>
-<p>Space Complexity:</p>
-<ol class="arabic simple">
-<li><p>Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.</p></li>
-<li><p>Storage for the visited dictionary: The <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.</p></li>
-<li><p>Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.</p></li>
-</ol>
-<p>Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the <code class="docutils literal notranslate"><span class="pre">visited</span></code> dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).</p>
-<p>In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Cyclic Graph</strong>: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn’t fall into an infinite loop during traversal.</p></li>
-<li><p><strong>Partial Graph Cloning</strong>: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Graphs Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="178.%20Graph%20Valid%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">178. Graph Valid Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/12. Advanced Graphs/892. Alien Dictionary.html b/_build/html/12. Advanced Graphs/892. Alien Dictionary.html
deleted file mode 100644
index 4bcf731..0000000
--- a/_build/html/12. Advanced Graphs/892. Alien Dictionary.html	
+++ /dev/null
@@ -1,756 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>892. Alien Dictionary &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '12. Advanced Graphs/892. Alien Dictionary';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="1-D Dynamic Programming Problems - Blind 75 LeetCode" href="../13.%20One-D%20Dynamic%20Programming/README.html" />
-    <link rel="prev" title="Advanced Graphs Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F12. Advanced Graphs/892. Alien Dictionary.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>892. Alien Dictionary</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="alien-dictionary">
-<h1>892. Alien Dictionary<a class="headerlink" href="#alien-dictionary" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://www.lintcode.com/problem/892/">To see the Alien Dictionary problem on LintCode, click here!</a></p>
-<hr class="docutils" />
-<p>There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of <strong>non-empty</strong> words from the dictionary, where words are <strong>sorted lexicographically by the rules of this new language</strong>. Derive the order of letters in this language.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>You may assume all letters are in lowercase.</p></li>
-<li><p>The dictionary is invalid, if string a is prefix of string b and b is appear before a.</p></li>
-<li><p>If the order is invalid, return an empty string.</p></li>
-<li><p>There may be multiple valid order of letters, return the smallest in normal lexicographical order.</p></li>
-<li><p>The letters in <strong>one</strong> string are of the same rank by default and are sorted in Human dictionary order.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.</p>
-<p>Here’s a more detailed explanation of the problem:</p>
-<ol class="arabic simple">
-<li><p>The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.</p></li>
-<li><p>Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.</p></li>
-<li><p>Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string ‘a’ is a prefix of another string ‘b,’ and ‘b’ appears before ‘a’ in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.</p></li>
-<li><p>Multiple valid orders: It’s possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.</p></li>
-</ol>
-<p>To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it’s valid, and an empty string if the order is invalid.</p>
-<p>The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">collections</span> <span class="kn">import</span> <span class="n">defaultdict</span><span class="p">,</span> <span class="n">deque</span>
-
-<span class="k">def</span> <span class="nf">alienOrder</span><span class="p">(</span><span class="n">words</span><span class="p">):</span>
-    <span class="c1"># Create an adjacency list to represent the graph</span>
-    <span class="n">graph</span> <span class="o">=</span> <span class="n">defaultdict</span><span class="p">(</span><span class="nb">list</span><span class="p">)</span>
-    
-    <span class="c1"># Create a dictionary to store the in-degrees of each letter</span>
-    <span class="n">in_degree</span> <span class="o">=</span> <span class="p">{}</span>
-    
-    <span class="c1"># Initialize in-degrees to 0 for all letters</span>
-    <span class="k">for</span> <span class="n">word</span> <span class="ow">in</span> <span class="n">words</span><span class="p">:</span>
-        <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">word</span><span class="p">:</span>
-            <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">in_degree</span><span class="p">:</span>
-                <span class="n">in_degree</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
-    
-    <span class="c1"># Build the graph and update in-degrees</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">)):</span>
-        <span class="n">word1</span><span class="p">,</span> <span class="n">word2</span> <span class="o">=</span> <span class="n">words</span><span class="p">[</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">],</span> <span class="n">words</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
-        <span class="n">min_length</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">word1</span><span class="p">),</span> <span class="nb">len</span><span class="p">(</span><span class="n">word2</span><span class="p">))</span>
-        
-        <span class="c1"># Compare characters in the two words</span>
-        <span class="n">j</span> <span class="o">=</span> <span class="mi">0</span>
-        <span class="k">while</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="n">min_length</span> <span class="ow">and</span> <span class="n">word1</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">==</span> <span class="n">word2</span><span class="p">[</span><span class="n">j</span><span class="p">]:</span>
-            <span class="n">j</span> <span class="o">+=</span> <span class="mi">1</span>
-        
-        <span class="k">if</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="n">min_length</span><span class="p">:</span>
-            <span class="c1"># If word1[j] is lexicographically before word2[j], add an edge</span>
-            <span class="n">graph</span><span class="p">[</span><span class="n">word1</span><span class="p">[</span><span class="n">j</span><span class="p">]]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">word2</span><span class="p">[</span><span class="n">j</span><span class="p">])</span>
-            <span class="n">in_degree</span><span class="p">[</span><span class="n">word2</span><span class="p">[</span><span class="n">j</span><span class="p">]]</span> <span class="o">+=</span> <span class="mi">1</span>
-            
-            <span class="c1"># Break the loop to avoid further comparisons</span>
-            <span class="k">break</span>
-    
-    <span class="c1"># Perform topological sorting using Kahn&#39;s algorithm</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="n">queue</span> <span class="o">=</span> <span class="n">deque</span><span class="p">([</span><span class="n">char</span> <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">in_degree</span> <span class="k">if</span> <span class="n">in_degree</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">])</span>
-    
-    <span class="k">while</span> <span class="n">queue</span><span class="p">:</span>
-        <span class="n">char</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">popleft</span><span class="p">()</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">char</span><span class="p">)</span>
-        
-        <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">graph</span><span class="p">[</span><span class="n">char</span><span class="p">]:</span>
-            <span class="n">in_degree</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="o">-=</span> <span class="mi">1</span>
-            <span class="k">if</span> <span class="n">in_degree</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span>
-    
-    <span class="c1"># Check if there is a valid order</span>
-    <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">result</span><span class="p">)</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">in_degree</span><span class="p">):</span>
-        <span class="k">return</span> <span class="s2">&quot;&quot;</span>
-    
-    <span class="k">return</span> <span class="s2">&quot;&quot;</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.</p>
-<p>The code follows these main steps:</p>
-<ol class="arabic simple">
-<li><p>Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called <code class="docutils literal notranslate"><span class="pre">in_degree</span></code> to keep track of the in-degrees (the number of letters that precede a letter) for each letter.</p></li>
-<li><p>Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the <code class="docutils literal notranslate"><span class="pre">in_degree</span></code> dictionary with an initial in-degree of 0.</p></li>
-<li><p>Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there’s an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.</p></li>
-<li><p>After constructing the graph, the code performs a topological sorting of the letters using Kahn’s algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.</p></li>
-<li><p>Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there’s a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.</p></li>
-</ol>
-<p>The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">words1</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;wrt&quot;</span><span class="p">,</span> <span class="s2">&quot;wrf&quot;</span><span class="p">,</span> <span class="s2">&quot;er&quot;</span><span class="p">,</span> <span class="s2">&quot;ett&quot;</span><span class="p">,</span> <span class="s2">&quot;rftt&quot;</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">alienOrder</span><span class="p">(</span><span class="n">words1</span><span class="p">))</span>  <span class="c1"># Output: &quot;wertf&quot;</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>wrtef
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">words2</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;z&quot;</span><span class="p">,</span> <span class="s2">&quot;x&quot;</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">alienOrder</span><span class="p">(</span><span class="n">words2</span><span class="p">))</span>  <span class="c1"># Output: &quot;zx&quot;</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>zx
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code for determining the order of letters in an alien language.</p>
-<p>Time Complexity:</p>
-<ol class="arabic simple">
-<li><p>Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.</p></li>
-<li><p>Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.</p></li>
-</ol>
-<p>Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.</p>
-<p>Space Complexity:</p>
-<ol class="arabic simple">
-<li><p>Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.</p></li>
-<li><p>Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.</p></li>
-<li><p>Queue: The space used by the queue during topological sorting is also O(V).</p></li>
-</ol>
-<p>Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.</p>
-<p>In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.</p>
-<p>In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Multiple Valid Orders</strong>: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.</p></li>
-<li><p><strong>Detect Invalid Dictionary</strong>: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./12. Advanced Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Advanced Graphs Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../13.%20One-D%20Dynamic%20Programming/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">1-D Dynamic Programming Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/13. One-D Dynamic Programming/198. House Robber.html b/_build/html/13. One-D Dynamic Programming/198. House Robber.html
deleted file mode 100644
index ae9b6ca..0000000
--- a/_build/html/13. One-D Dynamic Programming/198. House Robber.html	
+++ /dev/null
@@ -1,732 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>House Robber &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '13. One-D Dynamic Programming/198. House Robber';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="House Robber II" href="213.%20House%20Robber%20II.html" />
-    <link rel="prev" title="70. Climbing Stairs" href="70.%20Climbing%20Stairs.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F13. One-D Dynamic Programming/198. House Robber.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/13. One-D Dynamic Programming/198. House Robber.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>House Robber</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity:</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity:</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="house-robber">
-<h1>House Robber<a class="headerlink" href="#house-robber" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<hr class="docutils" />
-<p>You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and <strong>it will automatically contact the police if two adjacent houses were broken into on the same night.</strong></p>
-<p>Given an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code> representing the amount of money of each house, return <em>the maximum amount of money you can rob tonight <strong>without alerting the police</strong>.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">nums.length</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">nums[i]</span> <span class="pre">&lt;=</span> <span class="pre">400</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is a classic dynamic programming challenge known as the “House Robber” problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.</p>
-<p>The goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.</p>
-<p>The input to the problem is an array <code class="docutils literal notranslate"><span class="pre">nums</span></code>, where <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> represents the amount of money in the <code class="docutils literal notranslate"><span class="pre">i</span></code>-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.</p>
-<p>For example:</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">Output</span><span class="p">:</span> <span class="mi">4</span>
-<span class="n">Explanation</span><span class="p">:</span> <span class="n">Rob</span> <span class="n">house</span> <span class="mi">1</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">1</span><span class="p">)</span> <span class="ow">and</span> <span class="n">then</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">3</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">3</span><span class="p">)</span><span class="o">.</span>
-<span class="n">Total</span> <span class="n">amount</span> <span class="n">you</span> <span class="n">can</span> <span class="n">rob</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">+</span> <span class="mi">3</span> <span class="o">=</span> <span class="mf">4.</span>
-
-<span class="n">Input</span><span class="p">:</span> <span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">Output</span><span class="p">:</span> <span class="mi">12</span>
-<span class="n">Explanation</span><span class="p">:</span> <span class="n">Rob</span> <span class="n">house</span> <span class="mi">1</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">2</span><span class="p">),</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">3</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">9</span><span class="p">),</span> <span class="ow">and</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">5</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">1</span><span class="p">)</span><span class="o">.</span>
-<span class="n">Total</span> <span class="n">amount</span> <span class="n">you</span> <span class="n">can</span> <span class="n">rob</span> <span class="o">=</span> <span class="mi">2</span> <span class="o">+</span> <span class="mi">9</span> <span class="o">+</span> <span class="mi">1</span> <span class="o">=</span> <span class="mf">12.</span>
-</pre></div>
-</div>
-<p>The challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">rob</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">nums</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">])</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
-        <span class="c1"># Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses</span>
-        <span class="n">prev</span><span class="p">,</span> <span class="n">curr</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span>
-
-        <span class="c1"># Iterate through the houses</span>
-        <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">nums</span><span class="p">:</span>
-            <span class="c1"># Calculate the maximum amount of money that can be robbed at the current house</span>
-            <span class="c1"># It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),</span>
-            <span class="c1"># or skipping the current house and taking the maximum amount from the previous house (curr)</span>
-            <span class="n">temp</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">n</span> <span class="o">+</span> <span class="n">prev</span><span class="p">,</span> <span class="n">curr</span><span class="p">)</span>
-
-            <span class="c1"># Update the variables for the next iteration</span>
-            <span class="n">prev</span><span class="p">,</span> <span class="n">curr</span> <span class="o">=</span> <span class="n">curr</span><span class="p">,</span> <span class="n">temp</span>
-
-        <span class="c1"># The final result is the maximum amount of money that can be robbed at the last house</span>
-        <span class="k">return</span> <span class="n">curr</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The provided code is a Python implementation of the “House Robber” problem using a dynamic programming approach. It’s part of a class <code class="docutils literal notranslate"><span class="pre">Solution</span></code> and includes a method <code class="docutils literal notranslate"><span class="pre">rob</span></code> that takes a list of integers <code class="docutils literal notranslate"><span class="pre">nums</span></code> as input and returns the maximum amount of money that can be robbed without alerting the police.</p>
-<p>The key idea of the algorithm is to maintain two variables, <code class="docutils literal notranslate"><span class="pre">prev</span></code> and <code class="docutils literal notranslate"><span class="pre">curr</span></code>, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.</p>
-<p>The loop calculates a temporary variable <code class="docutils literal notranslate"><span class="pre">temp</span></code> that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (<code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">+</span> <span class="pre">prev</span></code>), or skipping the current house and taking the maximum amount from the previous house (<code class="docutils literal notranslate"><span class="pre">curr</span></code>). The maximum of these two scenarios is assigned to <code class="docutils literal notranslate"><span class="pre">temp</span></code>.</p>
-<p>The <code class="docutils literal notranslate"><span class="pre">prev</span></code> and <code class="docutils literal notranslate"><span class="pre">curr</span></code> variables are then updated for the next iteration. <code class="docutils literal notranslate"><span class="pre">prev</span></code> is set to the previous value of <code class="docutils literal notranslate"><span class="pre">curr</span></code>, and <code class="docutils literal notranslate"><span class="pre">curr</span></code> is set to the calculated <code class="docutils literal notranslate"><span class="pre">temp</span></code>.</p>
-<p>The final result is the value stored in the <code class="docutils literal notranslate"><span class="pre">curr</span></code> variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the <code class="docutils literal notranslate"><span class="pre">rob</span></code> method.</p>
-<p>The provided test cases at the end demonstrate the usage of the <code class="docutils literal notranslate"><span class="pre">rob</span></code> method with different input arrays.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">sol</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">sol</span><span class="o">.</span><span class="n">rob</span><span class="p">(</span><span class="n">nums1</span><span class="p">))</span>  <span class="c1"># Output: 4</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">9</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">sol</span><span class="o">.</span><span class="n">rob</span><span class="p">(</span><span class="n">nums2</span><span class="p">))</span>  <span class="c1"># Output: 12</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>12
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code.</p>
-<section id="time-complexity">
-<h3>Time Complexity:<a class="headerlink" href="#time-complexity" title="Permalink to this heading">#</a></h3>
-<p>The time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).</p>
-</section>
-<section id="space-complexity">
-<h3>Space Complexity:<a class="headerlink" href="#space-complexity" title="Permalink to this heading">#</a></h3>
-<p>The space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables <code class="docutils literal notranslate"><span class="pre">prev</span></code>, <code class="docutils literal notranslate"><span class="pre">curr</span></code>, and <code class="docutils literal notranslate"><span class="pre">temp</span></code> are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).</p>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time Complexity: O(n)</p></li>
-<li><p>Space Complexity: O(1)</p></li>
-</ul>
-</section>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Variation with Maximum Number of Houses to Rob:</strong> Modify the problem to include an additional constraint: you are allowed to rob at most ‘k’ houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.</p></li>
-<li><p><strong>Robbing in a Circular Street:</strong> Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.</p></li>
-</ol>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/house-robber/description/">To see the House Robber problem on LeetCode, click here!</a></p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./13. One-D Dynamic Programming"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="70.%20Climbing%20Stairs.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">70. Climbing Stairs</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="213.%20House%20Robber%20II.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">House Robber II</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity:</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity:</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/14. Two-D Dynamic Programming/README.html b/_build/html/14. Two-D Dynamic Programming/README.html
deleted file mode 100644
index 72a7ecf..0000000
--- a/_build/html/14. Two-D Dynamic Programming/README.html	
+++ /dev/null
@@ -1,661 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '14. Two-D Dynamic Programming/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Blind 75 LeetCode Problems" href="../15.%20Greedy/README.html" />
-    <link rel="prev" title="House Robber II" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active"><a class="current reference internal" href="#">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F14. Two-D Dynamic Programming/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/14. Two-D Dynamic Programming/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Problems</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#d-dynamic-programming">2-D Dynamic Programming</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-problems">
-<h1>Blind 75 LeetCode Problems<a class="headerlink" href="#blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="d-dynamic-programming">
-<h3>2-D Dynamic Programming<a class="headerlink" href="#d-dynamic-programming" title="Permalink to this heading">#</a></h3>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/unique-paths/">62. Unique Paths</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-common-subsequence/">1143. Longest Common Subsequence</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-<p>Happy coding!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./14. Two-D Dynamic Programming"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">House Robber II</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../15.%20Greedy/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#d-dynamic-programming">2-D Dynamic Programming</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/15. Greedy/README.html b/_build/html/15. Greedy/README.html
deleted file mode 100644
index 1f683de..0000000
--- a/_build/html/15. Greedy/README.html	
+++ /dev/null
@@ -1,661 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '15. Greedy/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Blind 75 LeetCode Problems" href="../16.%20Intervals/README.html" />
-    <link rel="prev" title="Blind 75 LeetCode Problems" href="../14.%20Two-D%20Dynamic%20Programming/README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1 current active"><a class="current reference internal" href="#">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F15. Greedy/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/15. Greedy/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Problems</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#greedy">Greedy</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-problems">
-<h1>Blind 75 LeetCode Problems<a class="headerlink" href="#blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="greedy">
-<h3>Greedy<a class="headerlink" href="#greedy" title="Permalink to this heading">#</a></h3>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-subarray/">53. Maximum Subarray</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/jump-game/">55. Jump Game</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-<p>Happy coding!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./15. Greedy"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../14.%20Two-D%20Dynamic%20Programming/README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../16.%20Intervals/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#greedy">Greedy</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/16. Intervals/README.html b/_build/html/16. Intervals/README.html
deleted file mode 100644
index b1c7318..0000000
--- a/_build/html/16. Intervals/README.html	
+++ /dev/null
@@ -1,670 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '16. Intervals/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Blind 75 LeetCode Problems" href="../17.%20Math%20Geometry/README.html" />
-    <link rel="prev" title="Blind 75 LeetCode Problems" href="../15.%20Greedy/README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1 current active"><a class="current reference internal" href="#">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F16. Intervals/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/16. Intervals/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Problems</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#intervals">Intervals</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-problems">
-<h1>Blind 75 LeetCode Problems<a class="headerlink" href="#blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="intervals">
-<h3>Intervals<a class="headerlink" href="#intervals" title="Permalink to this heading">#</a></h3>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/insert-interval/">57. Insert Interval</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-intervals/">56. Merge Intervals</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/non-overlapping-intervals/">435. Non Overlapping Intervals</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/meeting-rooms/">252. Meeting Rooms</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/meeting-rooms-ii/">253. Meeting Rooms II</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-<p>Happy coding!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./16. Intervals"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../15.%20Greedy/README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../17.%20Math%20Geometry/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#intervals">Intervals</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/18. Bit Manipulation/README.html b/_build/html/18. Bit Manipulation/README.html
deleted file mode 100644
index 0729db3..0000000
--- a/_build/html/18. Bit Manipulation/README.html	
+++ /dev/null
@@ -1,660 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '18. Bit Manipulation/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="prev" title="Blind 75 LeetCode Problems" href="../17.%20Math%20Geometry/README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1 current active"><a class="current reference internal" href="#">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F18. Bit Manipulation/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/18. Bit Manipulation/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Problems</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#bit-manupulation">Bit Manupulation</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-problems">
-<h1>Blind 75 LeetCode Problems<a class="headerlink" href="#blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="bit-manupulation">
-<h3>Bit Manupulation<a class="headerlink" href="#bit-manupulation" title="Permalink to this heading">#</a></h3>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-1-bits/">191. Number of 1 Bits</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/counting-bits/">338. Counting Bits</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reverse-bits/">190. Reverse Bits</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/missing-number/">268. Missing Number</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/sum-of-two-integers/">371. Sum of Two Integers</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-<p>Happy coding!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./18. Bit Manipulation"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../17.%20Math%20Geometry/README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#bit-manupulation">Bit Manupulation</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/CONTRIBUTING.html b/_build/html/CONTRIBUTING.html
deleted file mode 100644
index 9254de9..0000000
--- a/_build/html/CONTRIBUTING.html
+++ /dev/null
@@ -1,645 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Contributing Guidelines &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'CONTRIBUTING';</script>
-    <link rel="index" title="Index" href="genindex.html" />
-    <link rel="search" title="Search" href="search.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2FCONTRIBUTING.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="_sources/CONTRIBUTING.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Contributing Guidelines</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#table-of-contents">Table of Contents</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#ways-to-contribute">Ways to Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#getting-started">Getting Started</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contributing-process">Contributing Process</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#code-of-conduct">Code of Conduct</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="contributing-guidelines">
-<h1>Contributing Guidelines<a class="headerlink" href="#contributing-guidelines" title="Permalink to this heading">#</a></h1>
-<p>Thank you for considering contributing to the Blind 75 LeetCode repository! We welcome contributions from the community to help improve this resource and make it even more valuable.</p>
-<p>Please take a moment to review this document to understand how you can contribute.</p>
-<section id="table-of-contents">
-<h2>Table of Contents<a class="headerlink" href="#table-of-contents" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><span class="xref myst">Ways to Contribute</span></p></li>
-<li><p><span class="xref myst">Getting Started</span></p></li>
-<li><p><span class="xref myst">Contributing Process</span></p></li>
-<li><p><span class="xref myst">Code of Conduct</span></p></li>
-</ul>
-</section>
-<section id="ways-to-contribute">
-<h2>Ways to Contribute<a class="headerlink" href="#ways-to-contribute" title="Permalink to this heading">#</a></h2>
-<p>There are several ways you can contribute to this repository:</p>
-<ol class="arabic simple">
-<li><p><strong>Suggest Improvements</strong>: If you have ideas for making the Blind 75 LeetCode repository better, please open an issue to discuss your suggestions.</p></li>
-<li><p><strong>Report Issues</strong>: If you encounter any issues with the existing content or code, please open an issue and provide as much detail as possible.</p></li>
-<li><p><strong>Contribute Solutions</strong>: You can contribute solutions to the problems listed in the repository. Please follow the guidelines mentioned below when submitting your solutions.</p></li>
-<li><p><strong>Enhance Documentation</strong>: Improve documentation, including explanations and time/space complexity analysis, for existing solutions.</p></li>
-<li><p><strong>Fix Bugs</strong>: If you find and fix any bugs in the existing code or documentation, you are welcome to submit a pull request.</p></li>
-</ol>
-</section>
-<section id="getting-started">
-<h2>Getting Started<a class="headerlink" href="#getting-started" title="Permalink to this heading">#</a></h2>
-<p>Before you start contributing, please ensure you have the following prerequisites:</p>
-<ul class="simple">
-<li><p>A GitHub account.</p></li>
-<li><p>Familiarity with Git and GitHub.</p></li>
-<li><p>Code editor or IDE for making changes.</p></li>
-</ul>
-</section>
-<section id="contributing-process">
-<h2>Contributing Process<a class="headerlink" href="#contributing-process" title="Permalink to this heading">#</a></h2>
-<p>Here’s the general process for contributing:</p>
-<ol class="arabic">
-<li><p><strong>Fork the Repository</strong>: Click the “Fork” button at the top of this repository to create your copy.</p></li>
-<li><p><strong>Clone Your Fork</strong>: Clone your fork to your local machine.</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">git</span> <span class="n">clone</span> <span class="n">https</span><span class="p">:</span><span class="o">//</span><span class="n">github</span><span class="o">.</span><span class="n">com</span><span class="o">/</span><span class="n">your</span><span class="o">-</span><span class="n">username</span><span class="o">/</span><span class="n">Blind</span><span class="o">-</span><span class="mi">75</span><span class="o">-</span><span class="n">LeetCode</span><span class="o">.</span><span class="n">git</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Create a Branch</strong>: Create a new branch for your contribution.</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">git</span> <span class="n">checkout</span> <span class="o">-</span><span class="n">b</span> <span class="n">feature</span><span class="o">/</span><span class="n">your</span><span class="o">-</span><span class="n">feature</span><span class="o">-</span><span class="n">name</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Make Changes</strong>: Implement your changes, following the guidelines provided.</p></li>
-<li><p><strong>Test Your Changes</strong>: Ensure that your changes do not introduce new issues and are consistent with the repository’s style and structure.</p></li>
-<li><p><strong>Commit Changes</strong>: Commit your changes with a meaningful commit message.</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">git</span> <span class="n">commit</span> <span class="o">-</span><span class="n">m</span> <span class="s2">&quot;Add solution to problem X&quot;</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Push Changes</strong>: Push your changes to your fork on GitHub.</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">git</span> <span class="n">push</span> <span class="n">origin</span> <span class="n">feature</span><span class="o">/</span><span class="n">your</span><span class="o">-</span><span class="n">feature</span><span class="o">-</span><span class="n">name</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Create a Pull Request</strong>: Go to the original repository and create a pull request. Please provide a detailed description of your changes.</p></li>
-<li><p><strong>Review and Collaboration</strong>: Your pull request will be reviewed, and you may need to make further changes. Be responsive to comments and feedback.</p></li>
-<li><p><strong>Merge</strong>: Once your pull request is approved, it will be merged into the main branch.</p></li>
-</ol>
-</section>
-<section id="code-of-conduct">
-<h2>Code of Conduct<a class="headerlink" href="#code-of-conduct" title="Permalink to this heading">#</a></h2>
-<p>Please note that we have a <a class="reference internal" href="CODE_OF_CONDUCT.html"><span class="doc std std-doc">Code of Conduct</span></a> that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.</p>
-<p>We appreciate your contributions to the Blind 75 LeetCode repository and look forward to working together to make it an even better resource for the community!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./."
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#table-of-contents">Table of Contents</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#ways-to-contribute">Ways to Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#getting-started">Getting Started</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contributing-process">Contributing Process</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#code-of-conduct">Code of Conduct</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/README.html b/_build/html/README.html
deleted file mode 100644
index 49e44aa..0000000
--- a/_build/html/README.html
+++ /dev/null
@@ -1,1141 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Solutions &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'README';</script>
-    <link rel="index" title="Index" href="genindex.html" />
-    <link rel="search" title="Search" href="search.html" />
-    <link rel="next" title="Array &amp; Hashing Solutions - Blind 75 LeetCode Problems" href="01.%20Array%20Hashing/README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="#">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1 current active">
-                <a class="reference internal" href="#">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2FREADME.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="_sources/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Solutions</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#array-hashing">Array &amp; Hashing</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#two-pointers">Two Pointers</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#sliding-window">Sliding Window</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#stack">Stack</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#binary-search">Binary Search</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#linked-list">Linked List</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#trees">Trees</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#tries">Tries</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#heap-priority-queue">Heap / Priority Queue</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#backtracking">Backtracking</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#graphs">Graphs</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#advanced-graphs">Advanced Graphs</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#d-dynamic-programming">1-D Dynamic Programming</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#id1">2-D Dynamic Programming</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#greedy">Greedy</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#intervals">Intervals</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#math-geometry">Math &amp; Geometry</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#bit-manipulation">Bit Manipulation</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#code-of-conduct">Code of Conduct</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#security-policy">Security Policy</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-solutions">
-<h1>Blind 75 LeetCode Solutions<a class="headerlink" href="#blind-75-leetcode-solutions" title="Permalink to this heading">#</a></h1>
-<p><img alt="Blind 75 LeetCode" src="https://img.shields.io/badge/Blind_75_LeetCode-Solutions-blue?labelColor=red" /></p>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="array-hashing">
-<h3>Array &amp; Hashing<a class="headerlink" href="#array-hashing" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Array_&amp;_Hashing-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/contains-duplicate/">217. Contains Duplicate</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/valid-anagram/">242. Valid Anagram</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/two-sum/">1. Two Sum</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/group-anagrams/">49. Group Anagrams</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/top-k-frequent-elements/">347. Top K Frequent Elements</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/product-of-array-except-self/">238. Product of Array Except Self</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/encode-and-decode-strings/">659. Encode and Decode Strings</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-consecutive-sequence/">128. Longest Consecutive Sequence</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="two-pointers">
-<h3>Two Pointers<a class="headerlink" href="#two-pointers" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Two_Pointers-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/valid-palindrome/">125. Valid Palindrome</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/3sum/">15. 3Sum</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/container-with-most-water/">11. Container With Most Water</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="sliding-window">
-<h3>Sliding Window<a class="headerlink" href="#sliding-window" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Sliding_Window-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/">121. Best Time to Buy And Sell Stock</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">3. Longest Substring Without Repeating Characters</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-repeating-character-replacement/">424. Longest Repeating Character Replacement</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/minimum-window-substring/">76. Minimum Window Substring</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="stack">
-<h3>Stack<a class="headerlink" href="#stack" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Stack-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/valid-parentheses/">20. Valid Parentheses</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="binary-search">
-<h3>Binary Search<a class="headerlink" href="#binary-search" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Binary_Search-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/">153. Find Minimum In Rotated Sorted Array</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/search-in-rotated-sorted-array/">33. Search In Rotated Sorted Array</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="linked-list">
-<h3>Linked List<a class="headerlink" href="#linked-list" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Linked_List-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reverse-linked-list/">206. Reverse Linked List</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-two-sorted-lists/">21. Merge Two Sorted Lists</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reorder-list/">143. Reorder List</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/">19. Remove Nth Node From End of List</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/linked-list-cycle/">141. Linked List Cycle</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-k-sorted-lists/">23. Merge K Sorted Lists</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="trees">
-<h3>Trees<a class="headerlink" href="#trees" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Trees-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/invert-binary-tree/">226. Invert Binary Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-depth-of-binary-tree/">104. Maximum Depth of Binary Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/same-tree/">100. Same Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/subtree-of-another-tree/">572. Subtree of Another Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/">235. Lowest Common Ancestor of a Binary Search Tree</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/binary-tree-level-order-traversal/">102. Binary Tree Level Order Traversal</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/validate-binary-search-tree/">98. Validate Binary Search Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/kth-smallest-element-in-a-bst/">230. Kth Smallest Element In a BST</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/">105. Construct Binary Tree From Preorder And Inorder Traversal</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/binary-tree-maximum-path-sum/">124. Binary Tree Maximum Path Sum</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/serialize-and-deserialize-binary-tree/">297. Serialize And Deserialize Binary Tree</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="tries">
-<h3>Tries<a class="headerlink" href="#tries" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Tries-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/implement-trie-prefix-tree/">208. Implement Trie Prefix Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/design-add-and-search-words-data-structure/">211. Design Add And Search Words Data Structure</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/word-search-ii/">212. Word Search II</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="heap-priority-queue">
-<h3>Heap / Priority Queue<a class="headerlink" href="#heap-priority-queue" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Heap_/_Priority_Queue-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/find-median-from-data-stream/">295. Find Median From Data Stream</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="backtracking">
-<h3>Backtracking<a class="headerlink" href="#backtracking" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Backtracking-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/combination-sum/">39. Combination Sum</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/word-search/">79. Word Search</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="graphs">
-<h3>Graphs<a class="headerlink" href="#graphs" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Graphs-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-islands/">200. Number of Islands</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/clone-graph/">133. Clone Graph</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/pacific-atlantic-water-flow/">417. Pacific Atlantic Water Flow</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/course-schedule/">207. Course Schedule</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/">323. Number of Connected Components In An Undirected Graph</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/graph-valid-tree/">261. Graph Valid Tree</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="advanced-graphs">
-<h3>Advanced Graphs<a class="headerlink" href="#advanced-graphs" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Advanced_Graphs-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/alien-dictionary/">269. Alien Dictionary</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="d-dynamic-programming">
-<h3>1-D Dynamic Programming<a class="headerlink" href="#d-dynamic-programming" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/1_D_Dynamic_Programming-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/climbing-stairs/">70. Climbing Stairs</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/house-robber/">198. House Robber</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/house-robber-ii/">213. House Robber II</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-palindromic-substring/">5. Longest Palindromic Substring</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/palindromic-substrings/">647. Palindromic Substrings</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/decode-ways/">91. Decode Ways</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/coin-change/">322. Coin Change</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-product-subarray/">152. Maximum Product Subarray</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/word-break/">139. Word Break</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-increasing-subsequence/">300. Longest Increasing Subsequence</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="id1">
-<h3>2-D Dynamic Programming<a class="headerlink" href="#id1" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/2_D_Dynamic_Programming-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/unique-paths/">62. Unique Paths</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-common-subsequence/">1143. Longest Common Subsequence</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="greedy">
-<h3>Greedy<a class="headerlink" href="#greedy" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Greedy-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-subarray/">53. Maximum Subarray</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/jump-game/">55. Jump Game</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="intervals">
-<h3>Intervals<a class="headerlink" href="#intervals" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Intervals-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/insert-interval/">57. Insert Interval</a></p></td>
-<td><p>Hard</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/merge-intervals/">56. Merge Intervals</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/non-overlapping-intervals/">435. Non Overlapping Intervals</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/meeting-rooms/">252. Meeting Rooms</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/meeting-rooms-ii/">253. Meeting Rooms II</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="math-geometry">
-<h3>Math &amp; Geometry<a class="headerlink" href="#math-geometry" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Math_&amp;_Geometry-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/rotate-image/">48. Rotate Image</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/spiral-matrix/">54. Spiral Matrix</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/set-matrix-zeroes/">73. Set Matrix Zeroes</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-<section id="bit-manipulation">
-<h3>Bit Manipulation<a class="headerlink" href="#bit-manipulation" title="Permalink to this heading">#</a></h3>
-<p><img alt="Array &amp; Hashing" src="https://img.shields.io/badge/Bit_Manipulation-Solutions-blue?labelColor=red" /></p>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/number-of-1-bits/">191. Number of 1 Bits</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/counting-bits/">338. Counting Bits</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/reverse-bits/">190. Reverse Bits</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/missing-number/">268. Missing Number</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/sum-of-two-integers/">371. Sum of Two Integers</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-</section>
-<section id="code-of-conduct">
-<h2>Code of Conduct<a class="headerlink" href="#code-of-conduct" title="Permalink to this heading">#</a></h2>
-<p>We have a <a class="reference internal" href="CODE_OF_CONDUCT.html"><span class="doc std std-doc">Code of Conduct</span></a> that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.</p>
-</section>
-<section id="security-policy">
-<h2>Security Policy<a class="headerlink" href="#security-policy" title="Permalink to this heading">#</a></h2>
-<p>We take security seriously. Please review our <a class="reference internal" href="SECURITY.html"><span class="doc std std-doc">Security Policy</span></a> for information on reporting security vulnerabilities.</p>
-<p>Happy coding!</p>
-</section>
-<div class="toctree-wrapper compound">
-</div>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./."
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="right-next"
-       href="01.%20Array%20Hashing/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#array-hashing">Array &amp; Hashing</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#two-pointers">Two Pointers</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#sliding-window">Sliding Window</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#stack">Stack</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#binary-search">Binary Search</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#linked-list">Linked List</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#trees">Trees</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#tries">Tries</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#heap-priority-queue">Heap / Priority Queue</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#backtracking">Backtracking</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#graphs">Graphs</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#advanced-graphs">Advanced Graphs</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#d-dynamic-programming">1-D Dynamic Programming</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#id1">2-D Dynamic Programming</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#greedy">Greedy</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#intervals">Intervals</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#math-geometry">Math &amp; Geometry</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#bit-manipulation">Bit Manipulation</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#code-of-conduct">Code of Conduct</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#security-policy">Security Policy</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb b/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb
deleted file mode 100644
index b3b517f..0000000
--- a/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= `Node.val` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "+ Time Complexity: $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ Space Complexity: $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
deleted file mode 100644
index a77a03d..0000000
--- a/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 128. Longest Consecutive Sequence\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Consecutive Sequence problem on LeetCode, click here!](https://leetcode.com/problems/longest-consecutive-sequence/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an unsorted array of integers `nums`, return *the length of the longest consecutive elements sequence.*\n",
-        "\n",
-        "You must write an algorithm that runs in `O(n)` time.\n",
-        "\n",
-        "*Constraints:**\n",
-        "- 0 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def longestConsecutive(nums):\n",
-        "    if not nums:\n",
-        "        return 0\n",
-        "\n",
-        "    num_set = set(nums)\n",
-        "    max_length = 0\n",
-        "\n",
-        "    for num in num_set:\n",
-        "        if num - 1 not in num_set:\n",
-        "            current_num = num\n",
-        "            current_length = 1\n",
-        "\n",
-        "            while current_num + 1 in num_set:\n",
-        "                current_num += 1\n",
-        "                current_length += 1\n",
-        "\n",
-        "            max_length = max(max_length, current_length)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `longestConsecutive` function that takes the `nums` array as input.\n",
-        "\n",
-        "2. We check if the `nums` array is empty. If it's empty, there are no consecutive elements, so we return 0.\n",
-        "\n",
-        "3. We create a Python set called `num_set` and insert all elements from the `nums` array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.\n",
-        "\n",
-        "4. We initialize a variable `max_length` to 0. This variable will keep track of the maximum length of consecutive elements sequence found.\n",
-        "\n",
-        "5. We iterate through the elements of the `num_set`. For each element `num`, we check if `num - 1` exists in the `num_set`. If it doesn't exist, it means `num` is the starting element of a potential consecutive sequence.\n",
-        "\n",
-        "6. Inside the loop, we initialize two variables: `current_num` to the current element `num` and `current_length` to 1. We start with a length of 1 because `num` itself is part of the sequence.\n",
-        "\n",
-        "7. We then enter a while loop that continues as long as `current_num + 1` exists in the `num_set`. This means we are incrementing the consecutive sequence.\n",
-        "\n",
-        "8. Inside the while loop, we increment `current_num` by 1 and also increment `current_length` by 1 to account for the next consecutive element.\n",
-        "\n",
-        "9. We compare `current_length` with the `max_length` and update `max_length` if the current sequence is longer.\n",
-        "\n",
-        "10. After the while loop, we move to the next element in the outer loop and repeat the process.\n",
-        "\n",
-        "11. Finally, we return the `max_length` as the result, which represents the length of the longest consecutive elements sequence in the `nums` array.\n",
-        "\n",
-        "The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "nums1 = [100, 4, 200, 1, 3, 2]\n",
-        "print(longestConsecutive(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "9\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "nums2 = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]\n",
-        "print(longestConsecutive(nums2)) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The code is designed to run in O(n) time complexity, where n is the number of elements in the `nums` array. Here's the breakdown:\n",
-        "\n",
-        "1. Constructing the `num_set` by inserting all elements from `nums` into it takes O(n) time because we perform an insertion operation for each element in `nums`.\n",
-        "\n",
-        "2. The main loop iterates through the elements in `num_set`. In the worst case, each element is visited only once, so the loop itself takes O(n) time.\n",
-        "\n",
-        "3. Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).\n",
-        "\n",
-        "Therefore, the overall time complexity of the code is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the code is determined by the space used by the `num_set` and a few additional variables. Here's the breakdown:\n",
-        "\n",
-        "1. `num_set` is a set that stores the unique elements from `nums`. In the worst case, it can store all n elements from `nums`, so the space complexity is O(n).\n",
-        "\n",
-        "2. The additional variables used, such as `max_length`, `current_num`, and `current_length`, have constant space requirements and do not depend on the size of the input array.\n",
-        "\n",
-        "Therefore, the overall space complexity of the code is O(n) due to the space used by the `num_set`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.\n",
-        "\n",
-        "2. Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb b/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb
deleted file mode 100644
index 57bb55d..0000000
--- a/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 217. Contains Duplicate\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Contains Duplicate problem on LeetCode, click here!](https://leetcode.com/problems/contains-duplicate/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def containsDuplicate(nums):\n",
-        "    # Create an empty set to store unique elements\n",
-        "    unique_elements = set()\n",
-        "    \n",
-        "    # Iterate through the array\n",
-        "    for num in nums:\n",
-        "        # If the element is already in the set, return True\n",
-        "        if num in unique_elements:\n",
-        "            return True\n",
-        "        # Otherwise, add it to the set\n",
-        "        else:\n",
-        "            unique_elements.add(num)\n",
-        "    \n",
-        "    # If the loop completes without finding duplicates, return False\n",
-        "    return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `containsDuplicate` function takes a single argument, `nums`, which is the input integer array.\n",
-        "\n",
-        "2. Inside the function, an empty set called `unique_elements` is created. This set will be used to keep track of unique elements in the input array.\n",
-        "\n",
-        "3. The function then iterates through the input array `nums` using a `for` loop.\n",
-        "\n",
-        "4. For each element `num` in the array, it checks whether `num` is already in the `unique_elements` set using the `if num in unique_elements:` condition.\n",
-        "\n",
-        "5. If `num` is already in the set, it means there is a duplicate element in the array, and the function immediately returns `True`.\n",
-        "\n",
-        "6. If `num` is not in the set, it is added to the `unique_elements` set using `unique_elements.add(num)`.\n",
-        "\n",
-        "7. The loop continues to the next element, and the process repeats.\n",
-        "\n",
-        "8. If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns `False`.\n",
-        "\n",
-        "The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem's requirements and constraints, as explained earlier."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums1 = [1, 2, 3, 1]\n",
-        "print(containsDuplicate(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums2 = [1, 2, 3, 4]\n",
-        "print(containsDuplicate(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums3 = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2]\n",
-        "print(containsDuplicate(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for the \"Contains Duplicate\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary operation that affects the time complexity is the `for` loop that iterates through the input array `nums`. In the worst case, the loop will iterate through all `n` elements of the array, where `n` is the length of the input array.\n",
-        "\n",
-        "- Iterating through the array: O(n)\n",
-        "\n",
-        "Inside the loop, we perform two operations:\n",
-        "\n",
-        "1. Checking whether an element exists in the `unique_elements` set (`if num in unique_elements`). This operation has an average time complexity of O(1) for a set.\n",
-        "2. Adding an element to the `unique_elements` set (`unique_elements.add(num)`), which also has an average time complexity of O(1) for a set.\n",
-        "\n",
-        "Since these operations are performed for each element in the array, the overall time complexity remains O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity is determined by the additional data structures used in the code, which are the `unique_elements` set.\n",
-        "\n",
-        "- `unique_elements` set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all `n` elements.\n",
-        "\n",
-        "Therefore, the space complexity is O(n) because, in the worst case, the set's size will grow linearly with the input array's size.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where `n` is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K Duplicates:** Modify the problem to return `true` if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns `true` if there are exactly K duplicates.\n",
-        "2. **Frequency Count:** Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb b/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb
deleted file mode 100644
index 1ff9a9c..0000000
--- a/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb	
+++ /dev/null
@@ -1,197 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 238. Product of Array Except Self\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Product of Array Except Self problem on LeetCode, click here!](https://leetcode.com/problems/product-of-array-except-self/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums`, return *an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.*\n",
-        "\n",
-        "The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "You must write an algorithm that runs in O(n) time and without using the division operation.\n",
-        "\n",
-        "Constraints:\n",
-        "- 2 <= `nums.length` <= $10^5$\n",
-        "- `-30 <= nums[i] <= 30`\n",
-        "- The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "**Follow-up:** Can you solve the problem in O(1) extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def productExceptSelf(nums):\n",
-        "    n = len(nums)\n",
-        "    \n",
-        "    # Initialize two arrays to store products to the left and right of each element\n",
-        "    left_products = [1] * n\n",
-        "    right_products = [1] * n\n",
-        "    \n",
-        "    # Calculate products to the left of each element\n",
-        "    left_product = 1\n",
-        "    for i in range(n):\n",
-        "        left_products[i] = left_product\n",
-        "        left_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate products to the right of each element\n",
-        "    right_product = 1\n",
-        "    for i in range(n - 1, -1, -1):\n",
-        "        right_products[i] = right_product\n",
-        "        right_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate the final answer using left and right products\n",
-        "    answer = [left_products[i] * right_products[i] for i in range(n)]\n",
-        "    \n",
-        "    return answer"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `n` is initialized as the length of the `nums` array.\n",
-        "2. Two arrays, `left_products` and `right_products`, are created, each with a length of `n` and filled with ones initially.\n",
-        "3. `left_product` is initialized to 1.\n",
-        "4. A loop iterates through the `nums` array, from left to right. For each element at index `i`, it stores the product of all elements to its left (including itself) in the `left_products` array and updates `left_product` accordingly.\n",
-        "5. `right_product` is initialized to 1.\n",
-        "6. Another loop iterates through the `nums` array in reverse order, from right to left. For each element at index `i`, it stores the product of all elements to its right (including itself) in the `right_products` array and updates `right_product`.\n",
-        "7. The final `answer` list is constructed by multiplying corresponding elements from the `left_products` and `right_products` arrays for each index `i`.\n",
-        "8. The function returns the `answer` list, which contains the desired results.\n",
-        "\n",
-        "Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[24, 12, 8, 6]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,2,3,4]\n",
-        "result1 = productExceptSelf(nums)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 53,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[0, 0, 9, 0, 0]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [-1,1,0,-3,3]\n",
-        "result2 = productExceptSelf(nums)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop iterates through the `nums` array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the `nums` array.\n",
-        "2. The second loop also iterates through the `nums` array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.\n",
-        "3. The final loop constructs the `answer` list by multiplying elements from the `left_products` and `right_products` arrays. This loop runs in O(n) time.\n",
-        "\n",
-        "Since all the loops are independent and sequential, the overall time complexity is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. Two additional arrays, `left_products` and `right_products`, are created with a length of `n`, where `n` is the length of the `nums` array. Therefore, these arrays consume O(n) extra space.\n",
-        "2. The `left_product` and `right_product` variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.\n",
-        "3. The `answer` list, which contains the final results, also consumes O(n) space, but it's not counted toward the extra space complexity analysis as per the problem's constraints.\n",
-        "\n",
-        "Overall, the space complexity is O(n) for this solution."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Handle Zeros in the Input**: Modify the solution to handle cases where the input array contains zeros. For example, if `nums = [0, 1, 2, 3, 0]`, the output should be `[0, 0, 0, 0, 0]` because any element multiplied by zero results in zero.\n",
-        "\n",
-        "2. **In-Place Modification**: Attempt to solve the problem with in-place modification of the `nums` array, where the output is stored directly in the input array without using any additional space."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb b/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb
deleted file mode 100644
index d165899..0000000
--- a/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb	
+++ /dev/null
@@ -1,198 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 242. Valid Anagram\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Anagram problem on LeetCode, click here!](https://leetcode.com/problems/valid-anagram/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `s.length`, `t.length` <= $5 * 10^4$\n",
-        "- `s` and `t` consist of lowercase English letters.\n",
-        "\n",
-        "**Follow-up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isAnagram(s: str, t: str) -> bool:\n",
-        "    # Check if the lengths of s and t are not equal\n",
-        "    if len(s) != len(t):\n",
-        "        return False\n",
-        "\n",
-        "    # Create dictionaries to store character frequencies for s and t\n",
-        "    countS, countT = {}, {}\n",
-        "\n",
-        "    # Count character frequencies in s\n",
-        "    for i in range(len(s)):\n",
-        "        countS[s[i]] = 1 + countS.get(s[i], 0)\n",
-        "\n",
-        "    # Count character frequencies in t\n",
-        "    for i in range(len(t)):\n",
-        "        countT[t[i]] = 1 + countT.get(t[i], 0)\n",
-        "\n",
-        "    # Check if the character frequencies in s and t are the same\n",
-        "    return countS == countT"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code defines a class called `Solution` with a method `isAnagram` that takes two input strings, `s` and `t`, and returns a boolean (`True` or `False`) based on whether `t` is an anagram of `s`.\n",
-        "\n",
-        "2. The first check performed in the method is whether the lengths of `s` and `t` are equal. If they are not equal, it immediately returns `False` because strings of different lengths cannot be anagrams of each other.\n",
-        "\n",
-        "3. Two dictionaries, `countS` and `countT`, are created to store the frequency of characters in `s` and `t`, respectively. These dictionaries will be used to count the occurrences of each character in the strings.\n",
-        "\n",
-        "4. The code then enters a loop to iterate through each character in string `s` using a `for` loop. Inside the loop, it updates the `countS` dictionary. The line `countS[s[i]] = 1 + countS.get(s[i], 0)` increments the count of character `s[i]` in `countS` by 1. If the character is not already in the dictionary, it initializes the count to 1.\n",
-        "\n",
-        "5. Similarly, the code iterates through each character in string `t` and updates the `countT` dictionary in the same way.\n",
-        "\n",
-        "6. After counting the character frequencies in both strings, the code compares the two dictionaries using `countS == countT`. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, `t` is an anagram of `s`. In this case, the method returns `True`.\n",
-        "\n",
-        "7. If the dictionaries are not equal, the method returns `False`, indicating that `t` is not an anagram of `s`.\n",
-        "\n",
-        "In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns `True`; otherwise, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s = \"anagram\"\n",
-        "t = \"nagaram\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "s = \"rat\"\n",
-        "t = \"car\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. The code first checks whether the lengths of the input strings `s` and `t` are equal, which takes constant time. This check has a time complexity of O(1).\n",
-        "\n",
-        "2. The code then iterates through both strings, `s` and `t`, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (`s` or `t`).\n",
-        "\n",
-        "3. Finally, the code compares the two dictionaries `countS` and `countT` to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.\n",
-        "\n",
-        "Overall, the time complexity of the code is O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The code uses two dictionaries, `countS` and `countT`, to store the character frequencies of the input strings `s` and `t`. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "2. The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.\n",
-        "\n",
-        "**In summary**, the space complexity of the code is O(n), where n is the length of the longer input string."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagram Chains**: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [\"bat\", \"tab\", \"cat\", \"tac\", \"dog\"], the longest anagram chain is [\"bat\", \"tab\", \"cat\", \"tac\"].\n",
-        "\n",
-        "2. **Minimum Deletions to Make Anagrams**: Given two strings `s` and `t`, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if `s = \"hello\"` and `t = \"billion\"`, you can remove the characters \"heo\" from `s` and \"billi\" from `t` to make them anagrams (\"lo\" and \"on\" are left in the two strings)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb b/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb
deleted file mode 100644
index ecfa494..0000000
--- a/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 347. Top K Frequent Elements\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Top K Frequent Elements problem on LeetCode, click here!](https://leetcode.com/problems/top-k-frequent-elements/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.\n",
-        "\n",
-        "Constraints:\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- `k` is in the range `[1, the number of unique elements in the array]`.\n",
-        "- It is **guaranteed** that the answer is **unique**.\n",
-        "\n",
-        "**Follow-up:** Your algorithm's time complexity must be better than $O(n\\ log\\ n)$, where n is the array's size.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def topKFrequent(nums, k):\n",
-        "    # Create a dictionary to store the frequency of each element\n",
-        "    count = {}\n",
-        "    # Create a list of lists to store elements with the same frequency\n",
-        "    frequency = [[] for i in range(len(nums) + 1)]\n",
-        "\n",
-        "    # Count the frequency of each element in nums\n",
-        "    for n in nums:\n",
-        "        count[n] = 1 + count.get(n, 0)\n",
-        "\n",
-        "    # Place elements in the freq list according to their frequency\n",
-        "    for n, c in count.items():\n",
-        "        frequency[c].append(n)\n",
-        "\n",
-        "    res = []\n",
-        "    # Traverse freq list from the end (higher frequencies)\n",
-        "    for i in range(len(frequency) - 1, 0, -1):\n",
-        "        for n in frequency[i]:\n",
-        "            res.append(n)\n",
-        "            if len(res) == k:\n",
-        "                return res"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `def topKFrequent(nums, k):`: This is a function that takes two arguments: `nums`, which is the input array of integers, and `k`, which is the number of most frequent elements to return.\n",
-        "\n",
-        "2. `count = {}`: This dictionary `count` will be used to store the frequency of each unique element in the `nums` array. The keys are elements from the input array, and the values are their corresponding frequencies.\n",
-        "\n",
-        "3. `frequency = [[] for i in range(len(nums) + 1)]`: This creates a list of empty lists called `frequency`. It's used to store elements based on their frequencies, similar to the `freq` list in the previous code. The size of this list is set to be one greater than the length of the input `nums`.\n",
-        "\n",
-        "4. `for n in nums:`: This loop iterates through each element `n` in the input `nums` array.\n",
-        "\n",
-        "5. `count[n] = 1 + count.get(n, 0)`: This line counts the frequency of each element `n` in the `nums` array. It uses the `count.get(n, 0)` method to retrieve the current count of `n` from the `count` dictionary. If `n` is not in the dictionary, it defaults to 0. It then increments the count by 1.\n",
-        "\n",
-        "6. After the above loop, the `count` dictionary will contain counts of each unique element in the `nums` array.\n",
-        "\n",
-        "7. `for n, c in count.items():`: This loop iterates through the items (key-value pairs) of the `count` dictionary. `n` represents the element, and `c` represents its frequency.\n",
-        "\n",
-        "8. `frequency[c].append(n)`: This line places the element `n` into the bucket corresponding to its frequency `c`. Buckets are represented by the `frequency` list. For example, if an element `n` has a frequency of 3, it will be added to `frequency[3]`.\n",
-        "\n",
-        "9. After this loop, the `frequency` list will contain buckets of elements grouped by their frequencies.\n",
-        "\n",
-        "10. `res = []`: This list `res` will be used to store the k most frequent elements.\n",
-        "\n",
-        "11. `for i in range(len(freq) - 1, 0, -1):`: This loop iterates in reverse order through the `frequency` list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be `frequency` instead of `freq`.\n",
-        "\n",
-        "12. `for n in frequency[i]:`: For each element `n` in the current bucket (i.e., elements with frequency `i`), it appends `n` to the result list `res`.\n",
-        "\n",
-        "13. `if len(res) == k:`: Once `res` contains k elements, the code exits and returns the result.\n",
-        "\n",
-        "The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., `frequency` instead of `freq`)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 48,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,1,1,2,2,3]\n",
-        "k = 2\n",
-        "result1 = topKFrequent(nums, k)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [1]\n",
-        "k = 1\n",
-        "result2 = topKFrequent(nums, k)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop that counts the frequency of elements by iterating through `nums` has a time complexity of O(n), where n is the number of elements in the input array `nums`.\n",
-        "\n",
-        "2. The second loop iterates through the keys in the `count` dictionary, which has at most `k` unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).\n",
-        "\n",
-        "3. The third loop iterates through the `frequency` list, which has a length equal to the maximum frequency of elements in `nums`. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in `nums`.\n",
-        "\n",
-        "Overall, the dominant factor in terms of time complexity is the loop that iterates through the `count` dictionary. So, the total time complexity of the code is O(n + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The `count` dictionary stores the frequency of each unique element in `nums`. In the worst case, it can have at most `k` unique elements, so the space complexity for `count` is O(k).\n",
-        "\n",
-        "2. The `frequency` list is used to store elements grouped by their frequencies. It has a length of `len(nums) + 1`, which can be at most 105 based on the constraints. Therefore, the space complexity for `frequency` is O(105).\n",
-        "\n",
-        "3. The `res` list stores the k most frequent elements, which can be at most `k` elements, so the space complexity for `res` is O(k).\n",
-        "\n",
-        "**In summary**, the space complexity is dominated by the `count` dictionary and the `frequency` list, both of which have a space complexity of O(k + 105)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimized k Most Frequent Elements:** Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.\n",
-        "\n",
-        "2. **Handling Duplicate Frequencies:** Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb b/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb
deleted file mode 100644
index afe89ec..0000000
--- a/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb	
+++ /dev/null
@@ -1,229 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 49. Group Anagrams\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Group Anagrams problem on LeetCode, click here!](https://leetcode.com/problems/group-anagrams/)\n",
-        "\n",
-        "---\n",
-        "Given an array of strings `strs`, group **the anagrams** together. You can return the answer in **any order**.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `strs.length <= $10^4$\n",
-        "- `0 <= strs[i].length <= 100`\n",
-        "- `strs[i]` consists of lowercase English letters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict\n",
-        "\n",
-        "\n",
-        "def groupAnagrams(strs):\n",
-        "    ans = defaultdict(list)\n",
-        "\n",
-        "    # Iterate through the list of input strings\n",
-        "    for s in strs:\n",
-        "        # Initialize a list to represent character counts for each character (a-z)\n",
-        "        count = [0] * 26\n",
-        "\n",
-        "        # Count the occurrences of each character in the current word\n",
-        "        for c in s:\n",
-        "            count[ord(c) - ord(\"a\")] += 1\n",
-        "\n",
-        "        # Use a tuple of character counts as the key and append the word to the anagram group\n",
-        "        ans[tuple(count)].append(s)\n",
-        "\n",
-        "    # Convert the values (lists of anagrams) to a list of lists\n",
-        "    return list(ans.values())"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Inside the method, a `defaultdict` called `ans` is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.\n",
-        "\n",
-        "2. The code then iterates through the list of input strings, `strs`, using a `for` loop. For each word `s` in `strs`, it performs the following steps:\n",
-        "\n",
-        "   - It initializes a list `count` of length 26, where each element represents the count of a specific character (a-z) in the word `s`.\n",
-        "\n",
-        "   - The code then iterates through the characters of `s`. For each character `c`, it increments the corresponding count in the `count` list based on its ASCII value.\n",
-        "\n",
-        "   - After counting the characters in `s`, it converts the `count` list into a tuple `tuple(count)` to use as a key for the `ans` dictionary.\n",
-        "\n",
-        "   - It appends the word `s` to the list associated with the key (tuple) in the `ans` dictionary. This groups all anagrams of the same word together under the same key.\n",
-        "\n",
-        "3. After processing all words in `strs`, the code converts the values of the `ans` dictionary (which are lists of anagrams) to a list of lists using the `list()` constructor.\n",
-        "\n",
-        "4. Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.\n",
-        "\n",
-        "In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 37,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['eat', 'tea', 'ate'], ['tan', 'nat'], ['bat']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: Group anagrams from a list of words\n",
-        "strs1 = [\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]\n",
-        "result1 = groupAnagrams(strs1)\n",
-        "print(result1)\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: Group anagrams from a list with an empty string\n",
-        "strs2 = [\"\"]\n",
-        "result2 = groupAnagrams(strs2)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 40,
-      "id": "c8367e2a-e7d5-4e18-8235-2870e341a04b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['a']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3: Group anagrams from a list with a single word\n",
-        "strs3 = [\"a\"]\n",
-        "result3 = groupAnagrams(strs3)\n",
-        "print(result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `groupAnagrams` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. First, we create an instance of the `Solution` class, which is an O(1) operation.\n",
-        "\n",
-        "2. Inside the `groupAnagrams` method, we iterate through the list of input strings `strs` once in a loop:\n",
-        "   - For each word in `strs`, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.\n",
-        "\n",
-        "3. The overall time complexity of the method is O(N * K), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. We use a `defaultdict` called `ans` to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for `ans` is O(N).\n",
-        "\n",
-        "2. Within the loop, we create a `count` list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).\n",
-        "\n",
-        "3. The space used for other variables is also constant and does not depend on the input size.\n",
-        "\n",
-        "4. The final result, `result`, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for `result` is O(N).\n",
-        "\n",
-        "5. The overall space complexity of the method is O(N) due to the space used by `ans` and `result`. The space used by the `count` list and other variables is constant and does not significantly affect the overall space complexity.\n",
-        "\n",
-        "**In summary,** the time complexity of the `groupAnagrams` method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagramic Palindromes**: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [\"bat\", \"tab\", \"act\", \"tac\", \"dog\"], there are two groups: [\"bat\", \"tab\", \"act\", \"tac\"] and [\"dog\"].\n",
-        "\n",
-        "2. **Largest Anagram Group**: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb b/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb
deleted file mode 100644
index 037c476..0000000
--- a/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb	
+++ /dev/null
@@ -1,204 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 659· Encode and Decode Strings\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Encode and Decode Strings problem on LintCode, click here!](https://www.lintcode.com/problem/659/)\n",
-        "\n",
-        "---\n",
-        "Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.\n",
-        "\n",
-        "Please implement `encode` and `decode`.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Codec:\n",
-        "\n",
-        "    def encode(self, strs):\n",
-        "        \"\"\"Encodes a list of strings to a single string.\n",
-        "        \n",
-        "        :type strs: List[str]\n",
-        "        :rtype: str\n",
-        "        \"\"\"\n",
-        "        encoded = \"\"\n",
-        "        for s in strs:\n",
-        "            encoded += s.replace(':', '::') + ':;'\n",
-        "        return encoded\n",
-        "\n",
-        "    def decode(self, s):\n",
-        "        \"\"\"Decodes a single string to a list of strings.\n",
-        "        \n",
-        "        :type s: str\n",
-        "        :rtype: List[str]\n",
-        "        \"\"\"\n",
-        "        decoded = []\n",
-        "        i = 0\n",
-        "        while i < len(s):\n",
-        "            end = s.find(':;', i)\n",
-        "            if end == -1:\n",
-        "                end = len(s)\n",
-        "            decoded.append(s[i:end].replace('::', ':'))\n",
-        "            i = end + 2\n",
-        "        return decoded"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class called `Codec` to encapsulate the encoding and decoding operations for a list of strings.\n",
-        "\n",
-        "2. In the `encode` method, we take a list of strings (`strs`) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter `:;`. We iterate through each string in the input list, replace any occurrence of `:` with `::` (to avoid conflicts with the delimiter), and then append `:;` to indicate the end of that string.\n",
-        "\n",
-        "3. In the `decode` method, we take an encoded string (`s`) as input and return a list of strings. The decoding process involves splitting the encoded string using the `:;` delimiter. We start from the beginning of the encoded string (`i = 0`) and repeatedly find the next occurrence of `:;`. We extract the substring between the current position (`i`) and the next delimiter (`end`). Before adding it to the result list, we replace any `::` with `:` to revert the encoding. We then update the current position `i` to be after the delimiter, so we can find the next substring in the next iteration.\n",
-        "\n",
-        "4. Finally, we create an instance of the `Codec` class and test it with two examples:\n",
-        "\n",
-        "By using the `:;` delimiter and handling the `::` escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['lint', 'code', 'love', 'you']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "codec = Codec()\n",
-        "\n",
-        "input1 = [\"lint\", \"code\", \"love\", \"you\"]\n",
-        "encoded1 = codec.encode(input1)\n",
-        "decoded1 = codec.decode(encoded1)\n",
-        "print(decoded1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['we', 'say', ':', 'yes']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "codec = Codec() \n",
-        "\n",
-        "input2 = [\"we\", \"say\", \":\", \"yes\"]\n",
-        "encoded2 = codec.encode(input2)\n",
-        "decoded2 = codec.decode(encoded2)\n",
-        "print(decoded2)  "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `encode` and `decode` methods in the provided code.\n",
-        "\n",
-        "**Encode Method (`encode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Here, `n` is the number of strings in the input list `strs`, and `m` is the average length of these strings.\n",
-        "  - In the worst case, for each string in the list, we iterate over its characters once to replace any colons (`:`) with double colons (`::`) and then append `:;`. This is done for each string in the list.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.\n",
-        "\n",
-        "**Decode Method (`decode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the `:;` delimiter.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.\n",
-        "\n",
-        "Overall, both the `encode` and `decode` methods have time and space complexities of O(n * m), where `n` is the number of strings in the input list, and `m` is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Delimiters**: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.\n",
-        "\n",
-        "2. **Optimize Encoding**: Modify the `encode` method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/01. Array Hashing/README.md b/_build/html/_sources/01. Array Hashing/README.md
deleted file mode 100644
index a331dab..0000000
--- a/_build/html/_sources/01. Array Hashing/README.md	
+++ /dev/null
@@ -1,27 +0,0 @@
-# Array & Hashing Solutions - Blind 75 LeetCode Problems
-![Array & Hashing Solutions](https://img.shields.io/badge/Array_&_Hashing_Solutions-blue)![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Problems-blue?labelColor=red)
-
-This repository contains my solutions to Array & Hashing Problems from Blind 75 LeetCode problems. I've organized the solutions by categories for easier navigation and reference. Each problem solution is presented in Jupyter Notebook format (`.ipynb`).
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/217.%20Contains%20Duplicate.ipynb)                            | Easy       |
-| [242. Valid Anagram](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/242.%20Valid%20Anagram.ipynb)                                      | Easy       |
-| [1. Two Sum](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/1.%20Two%20Sum.ipynb)                                                      | Easy       |
-| [49. Group Anagrams](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/49.%20Group%20Anagrams.ipynb)                                      | Medium     |
-| [347. Top K Frequent Elements](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.ipynb)              | Medium     |
-| [238. Product of Array Except Self](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.ipynb)  | Medium     |
-| [659. Encode and Decode Strings](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.ipynb)          | Medium     |
-| [128. Longest Consecutive Sequence](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.ipynb)      | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb b/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb
deleted file mode 100644
index 284c832..0000000
--- a/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 11. Container With Most Water\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Container With Most Water problem on LeetCode, click here!](https://leetcode.com/problems/container-with-most-water/)\n",
-        "\n",
-        "---\n",
-        "You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the $i^{th}$ line are `(i, 0)` and `(i, height[i])`.\n",
-        "\n",
-        "Find two lines that together with the x-axis form a container, such that the container contains the most water.\n",
-        "\n",
-        "Return *the maximum amount of water a container can store.*\n",
-        "\n",
-        "**Notice** that you may not slant the container.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `n == height.length`\n",
-        "- 2 <= `n` <= $10^5$\n",
-        "- 0 <= `height[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxArea(height):\n",
-        "    # Initialize the maximum area to 0.\n",
-        "    max_area = 0\n",
-        "    # Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.\n",
-        "    left = 0\n",
-        "    right = len(height) - 1\n",
-        "\n",
-        "    # Iterate until the left pointer is less than the right pointer.\n",
-        "    while left < right:\n",
-        "        # Calculate the height of the container, which is the minimum height of the two lines.\n",
-        "        h = min(height[left], height[right])\n",
-        "        # Calculate the width of the container, which is the distance between the two pointers.\n",
-        "        width = right - left\n",
-        "        # Calculate the area of the container using height and width and update max_area if it's greater.\n",
-        "        max_area = max(max_area, h * width)\n",
-        "\n",
-        "        # Move the pointer with the shorter line inward.\n",
-        "        if height[left] < height[right]:\n",
-        "            left += 1\n",
-        "        else:\n",
-        "            right -= 1\n",
-        "\n",
-        "    # Continue this process until left < right, and then return the maximum area.\n",
-        "    return max_area"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with initializing `max_area` to 0, which will store the maximum area of water that can be contained by the lines.\n",
-        "\n",
-        "2. Two pointers, `left` and `right`, are initialized to the beginning and end of the input `height` array.\n",
-        "\n",
-        "3. The main loop runs while `left` is less than `right`. This ensures that we are checking all possible pairs of lines in a systematic way.\n",
-        "\n",
-        "4. Inside the loop:\n",
-        "   - We calculate the height of the container `h` as the minimum of the heights at the `left` and `right` pointers. This represents the height of the water the container can hold.\n",
-        "   - We calculate the width of the container as the difference between `right` and `left`. This represents the distance between the two lines.\n",
-        "   - We calculate the area of the container using `h * width` and update `max_area` if the calculated area is greater than the current `max_area`.\n",
-        "\n",
-        "5. After calculating the area and updating `max_area`, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won't increase the height and will only decrease the width, which will result in a smaller area.\n",
-        "\n",
-        "6. We continue this process until `left` is no longer less than `right`, indicating that we have checked all possible pairs of lines.\n",
-        "\n",
-        "7. Finally, we return the `max_area` which contains the maximum area of water that can be contained by two lines from the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 49\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "height1 = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n",
-        "result1 = maxArea(height1)\n",
-        "print(\"Output:\", result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "height2 = [1, 1]\n",
-        "result2 = maxArea(height2)\n",
-        "print(\"Output:\", result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 45\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Additional Example\n",
-        "height3 = [3, 9, 3, 4, 7, 2, 12, 6]\n",
-        "result3 = maxArea(height3)\n",
-        "print(\"Output:\", result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `maxArea` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the `height` array.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The function uses a constant amount of extra space for variables like `max_area`, `left`, `right`, `h`, and `width`. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.\n",
-        "\n",
-        "**In summary,** the `maxArea` function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.\n",
-        "2. **Variant Problem:** Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You'll need to return the total water volume needed."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb b/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb
deleted file mode 100644
index 8520b3b..0000000
--- a/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 125. Valid Palindrome\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Palindrome problem on LeetCode, click here!](https://leetcode.com/problems/valid-palindrome/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "A phrase is a **palindrome** if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.\n",
-        "\n",
-        "Given a string `s`, *return `true` if it is a **palindrome**, or `false` otherwise.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $2*10^5$\n",
-        "- `s` consists only of printable ASCII characters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isPalindrome(s):\n",
-        "    # Step 1: Convert the input string to lowercase\n",
-        "    s = s.lower()\n",
-        "    \n",
-        "    # Step 2: Remove all non-alphanumeric characters from the string\n",
-        "    cleaned_s = ''.join(c for c in s if c.isalnum())\n",
-        "    \n",
-        "    # Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string\n",
-        "    left, right = 0, len(cleaned_s) - 1\n",
-        "    \n",
-        "    # Step 4: Compare characters using the two pointers while moving them towards each other\n",
-        "    while left < right:\n",
-        "        if cleaned_s[left] != cleaned_s[right]:\n",
-        "            return False  # If characters don't match, it's not a palindrome\n",
-        "        left += 1\n",
-        "        right -= 1\n",
-        "    \n",
-        "    # Step 5: If the loop completes without returning False, it's a palindrome\n",
-        "    return True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `isPalindrome` function takes an input string `s`.\n",
-        "\n",
-        "2. It starts by converting the input string to lowercase using `s.lower()`. This step ensures that the function is case-insensitive when checking for palindromes.\n",
-        "\n",
-        "3. Next, it removes all non-alphanumeric characters from the string and stores the result in the `cleaned_s` variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.\n",
-        "\n",
-        "4. The function then initializes two pointers, `left` and `right`, which will be used to compare characters from the beginning and end of the cleaned string.\n",
-        "\n",
-        "5. In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the `left` pointer is less than the `right` pointer. This is done to check all characters in the cleaned string.\n",
-        "\n",
-        "6. Inside the loop, it checks if the characters at the `left` and `right` pointers don't match. If they don't match, it means the input is not a palindrome, so the function returns `False`.\n",
-        "\n",
-        "7. If the characters at the `left` and `right` pointers match, the pointers are moved closer to each other by incrementing `left` and decrementing `right`.\n",
-        "\n",
-        "8. The loop continues to compare characters until it either finds a mismatch (returning `False`) or until the `left` pointer is greater than or equal to the `right` pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns `True`.\n",
-        "\n",
-        "In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string's beginning and end. If all characters match during the comparison, the function returns `True`, indicating that the input is a palindrome. If any characters do not match, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "input1 = \"A man, a plan, a canal: Panama\"\n",
-        "output1 = isPalindrome(input1)\n",
-        "print(output1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "input2 = \"race a car\"\n",
-        "output2 = isPalindrome(input2)\n",
-        "print(output2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "input3 = \"\"\n",
-        "output3 = isPalindrome(input3)\n",
-        "print(output3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `isPalindrome` function that uses two pointers:\n",
-        "\n",
-        "1. **Time Complexity:**\n",
-        "   - Converting the input string to lowercase using `s.lower()` takes O(n) time, where 'n' is the length of the input string.\n",
-        "   - Removing non-alphanumeric characters using the list comprehension `''.join(c for c in s if c.isalnum())` also takes O(n) time because it iterates through each character in the string once.\n",
-        "   - The comparison of characters using the two pointers (`left` and `right`) is done in a loop that runs until `left` is less than `right`. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).\n",
-        "\n",
-        "   Therefore, the overall time complexity of the `isPalindrome` function is O(n), where 'n' is the length of the input string.\n",
-        "\n",
-        "2. **Space Complexity:**\n",
-        "   - The space complexity is primarily determined by the additional string `cleaned_s` created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.\n",
-        "   - Additionally, the function uses two pointers, `left` and `right`, which consume constant space and do not depend on the size of the input.\n",
-        "\n",
-        "**In summary,** the overall space complexity of the `isPalindrome` function is O(n) in the worst case, where 'n' is the length of the input string. The space complexity is dominated by the space required for `cleaned_s`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Palindromic Substring:** Given a string `s`, find and return the longest palindromic substring within `s`. For example, if `s = \"babad\"`, the function should return `\"bab\"` or `\"aba\"`.\n",
-        "2. **Palindrome with Limited Characters:** Given a string `s` and a list of characters `allowed_chars`, check if `s` is a palindrome considering only the characters from `allowed_chars`. Ignore all other characters. For example, if `s = \"A man, a plan, a canal: Panama\"` and `allowed_chars = ['a', 'm', 'n', 'p']`, the function should return `True`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb b/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb
deleted file mode 100644
index 06de549..0000000
--- a/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb	
+++ /dev/null
@@ -1,250 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 15. 3Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the 3Sum problem on LeetCode, click here!](https://leetcode.com/problems/3sum/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array nums, *return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.*\n",
-        "\n",
-        "**Notice** that the solution set must not contain duplicate triplets.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `3 <= nums.length <= 3000`\n",
-        "- $-10^5$ <= `nums[i]` <= $10^5$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def threeSum(nums):\n",
-        "    # Sort the input array in ascending order\n",
-        "    nums.sort()\n",
-        "    triplets = []\n",
-        "    \n",
-        "    for i in range(len(nums) - 2):\n",
-        "        # Skip duplicates to avoid duplicate triplets\n",
-        "        if i > 0 and nums[i] == nums[i - 1]:\n",
-        "            continue\n",
-        "        \n",
-        "        left, right = i + 1, len(nums) - 1\n",
-        "        \n",
-        "        while left < right:\n",
-        "            # Calculate the total sum of the current triplet\n",
-        "            total = nums[i] + nums[left] + nums[right]\n",
-        "            \n",
-        "            if total == 0:\n",
-        "                # If the total is zero, we found a valid triplet\n",
-        "                triplets.append([nums[i], nums[left], nums[right]])\n",
-        "                \n",
-        "                # Skip duplicates of left and right pointers\n",
-        "                while left < right and nums[left] == nums[left + 1]:\n",
-        "                    left += 1\n",
-        "                while left < right and nums[right] == nums[right - 1]:\n",
-        "                    right -= 1\n",
-        "                \n",
-        "                # Move the pointers to the next unique elements\n",
-        "                left += 1\n",
-        "                right -= 1\n",
-        "            elif total < 0:\n",
-        "                # If the total is negative, we need to increase the sum by moving the left pointer to the right\n",
-        "                left += 1\n",
-        "            else:\n",
-        "                # If the total is positive, we need to decrease the sum by moving the right pointer to the left\n",
-        "                right -= 1\n",
-        "    \n",
-        "    return triplets"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. It starts by sorting the input array `nums` in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.\n",
-        "\n",
-        "2. It initializes an empty list `triplets` to store the unique triplets that meet the given conditions.\n",
-        "\n",
-        "3. The code then iterates through the `nums` array using a loop with index `i`. This loop will consider each element of the array as a potential starting point for a triplet.\n",
-        "\n",
-        "4. Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If `nums[i]` is the same as the previous element `nums[i-1]`, it continues to the next iteration of the loop.\n",
-        "\n",
-        "5. Two pointers, `left` and `right`, are initialized. `left` starts just after the current element `nums[i]`, and `right` starts at the end of the array.\n",
-        "\n",
-        "6. The code enters another loop with `left` and `right` pointers, trying to find a triplet that sums up to zero.\n",
-        "\n",
-        "7. It calculates the `total` sum of the current triplet as `nums[i] + nums[left] + nums[right]`.\n",
-        "\n",
-        "8. If `total` is zero, it means a valid triplet is found, so it appends `[nums[i], nums[left], nums[right]]` to the `triplets` list. Then, it moves both the `left` and `right` pointers to their next unique elements while skipping duplicates.\n",
-        "\n",
-        "9. If `total` is less than zero, it means the sum is negative, so it increments the `left` pointer to move towards a larger sum.\n",
-        "\n",
-        "10. If `total` is greater than zero, it means the sum is positive, so it decrements the `right` pointer to move towards a smaller sum.\n",
-        "\n",
-        "11. This process continues until all possible triplets have been considered.\n",
-        "\n",
-        "12. Finally, the function returns the `triplets` list, which contains all the unique triplets that sum up to zero in the sorted `nums` array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[-1, -1, 2], [-1, 0, 1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums = [-1, 0, 1, 2, -1, -4]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums = [0, 1, 1]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums = [0, 0, 0]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `threeSum` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Sorting the input array `nums` takes O(n log n) time, where n is the length of the array.\n",
-        "\n",
-        "2. The outer loop runs for each element of the array, so it iterates O(n) times.\n",
-        "\n",
-        "3. Inside the outer loop, we have a while loop with two pointers (`left` and `right`). In the worst case, the while loop can iterate O(n) times (when all elements are unique).\n",
-        "\n",
-        "4. Inside the while loop, we have constant time operations (additions, comparisons, and list appends).\n",
-        "\n",
-        "Overall, the time complexity of the `threeSum` function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space used by the `triplets` list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.\n",
-        "\n",
-        "2. Other than the `triplets` list, the function uses only a constant amount of additional space for variables like `i`, `left`, `right`, and `total`.\n",
-        "\n",
-        "Overall, the space complexity of the `threeSum` function is O(k), where k is the number of unique triplets that meet the criteria. It's important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.\n",
-        "- Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Sum Problem:** Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.\n",
-        "2. **Count the Number of Unique Triplets:** Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/02. Two Pointers/README.md b/_build/html/_sources/02. Two Pointers/README.md
deleted file mode 100644
index 0d4c7cf..0000000
--- a/_build/html/_sources/02. Two Pointers/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Two Pointers Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
deleted file mode 100644
index 554c940..0000000
--- a/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb	
+++ /dev/null
@@ -1,191 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 121. Best Time to Buy and Sell Stock\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array `prices` where `prices[i]` is the price of a given stock on the $i^{th}$ day.\n",
-        "\n",
-        "You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.\n",
-        "\n",
-        "*Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `prices.length` <= $10^5$\n",
-        "- 0 <= `prices[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 65,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxProfit(prices):\n",
-        "    if not prices:\n",
-        "        return 0\n",
-        "    \n",
-        "    min_price = prices[0]\n",
-        "    max_profit = 0\n",
-        "    \n",
-        "    for price in prices:\n",
-        "        # Update the minimum price if a lower price is encountered\n",
-        "        min_price = min(min_price, price)\n",
-        "        # Calculate the profit if selling at the current price\n",
-        "        max_profit = max(max_profit, price - min_price)\n",
-        "    \n",
-        "    return max_profit"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- The `maxProfit` function takes a single argument, `prices`, which is a list of stock prices.\n",
-        "- The first line of the function checks if the `prices` list is empty. If it's empty, there are no prices to analyze, so the function returns 0 (no profit can be made).\n",
-        "\n",
-        "- Then, we initialize two variables:\n",
-        "  - `min_price`: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (`prices[0]`).\n",
-        "  - `max_profit`: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven't made any profit.\n",
-        "\n",
-        "- We start iterating through the `prices` list, where `price` represents the stock price for the current day.\n",
-        "\n",
-        "- In each iteration, we check if the current `price` is lower than the `min_price` we've seen so far. If it is, we update `min_price` to the current `price`. This is because we want to buy the stock at the lowest possible price.\n",
-        "\n",
-        "- Next, we calculate the profit we would make if we sold the stock at the current `price` (assuming we bought it at `min_price`). We do this by subtracting `min_price` from the current `price`. This represents the profit for the current day.\n",
-        "\n",
-        "- We also use the `max` function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the `max_profit` we've seen previously, we update `max_profit` with this higher value.\n",
-        "\n",
-        "- Finally, after iterating through all the days in the `prices` list, we return `max_profit`, which represents the maximum profit that can be achieved by buying and selling a single stock."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 66,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "5\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "prices1 = [7, 1, 5, 3, 6, 4]\n",
-        "print(maxProfit(prices1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 67,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "prices2 = [7, 6, 4, 3, 1]\n",
-        "print(maxProfit(prices2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through the `prices` array once, examining each price exactly once.\n",
-        "- Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.\n",
-        "- Therefore, the time complexity of this code is O(n), where n is the length of the `prices` array. It performs a linear number of operations relative to the size of the input.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the code is constant, O(1).\n",
-        "- Regardless of the size of the input `prices` array, the code only uses a fixed amount of additional memory to store two variables (`min_price` and `max_profit`) and a few loop variables.\n",
-        "- The memory usage does not depend on the size of the input, so it is considered constant space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n) where n is the length of the `prices` array.\n",
-        "- Space Complexity: O(1) (constant space usage)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Transactions Allowed:** Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.\n",
-        "2. **K Transactions Allowed:** Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.\n",
-        "3. **With Transaction Fee:** Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
deleted file mode 100644
index 4a516de..0000000
--- a/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb	
+++ /dev/null
@@ -1,214 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 3. Longest Substring Without Repeating Characters\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n",
-        "\n",
-        "---\n",
-        "Given a string `s`, find the length of the **longest substring** without repeating characters.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 0 <= `s.length` <= $5 * 10^4$\n",
-        "- `s` consists of English letters, digits, symbols and spaces.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 61,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def length_of_longest_substring(s):\n",
-        "    # Create a dictionary to store the index of each character's last occurrence.\n",
-        "    char_index = {}\n",
-        "    \n",
-        "    # Initialize variables to keep track of the start and end of the current substring.\n",
-        "    start = 0\n",
-        "    max_length = 0\n",
-        "    \n",
-        "    for end in range(len(s)):\n",
-        "        # If the character is in the dictionary and its last occurrence is after the start of the current substring,\n",
-        "        # update the start of the substring to the next character after its last occurrence.\n",
-        "        if s[end] in char_index and char_index[s[end]] >= start:\n",
-        "            start = char_index[s[end]] + 1\n",
-        "        \n",
-        "        # Update the last occurrence index of the current character.\n",
-        "        char_index[s[end]] = end\n",
-        "        \n",
-        "        # Calculate the length of the current substring and update the maximum length if necessary.\n",
-        "        current_length = end - start + 1\n",
-        "        max_length = max(max_length, current_length)\n",
-        "    \n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a function called `length_of_longest_substring` that takes a single argument `s`, which is the input string for which we want to find the length of the longest substring without repeating characters.\n",
-        "\n",
-        "2. We create a dictionary called `char_index` to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.\n",
-        "\n",
-        "3. We initialize two variables, `start` and `max_length`. \n",
-        "   - `start` represents the start index of the current substring without repeating characters. It starts at 0.\n",
-        "   - `max_length` is used to keep track of the maximum length found so far and is initially set to 0.\n",
-        "\n",
-        "4. We then iterate through the input string `s` using a for loop, where the loop variable `end` represents the current end index of the substring we are considering.\n",
-        "\n",
-        "5. Inside the loop:\n",
-        "   - We check if the character `s[end]` is already in the `char_index` dictionary and if its last occurrence is within or after the current substring. If so, it means that we've encountered a repeating character, and we need to update the `start` of the substring to the next character after the last occurrence of `s[end]`. This ensures that we have a new valid substring without repeating characters.\n",
-        "   - We then update the `char_index` dictionary by storing the current index `end` as the last occurrence index of the character `s[end]`.\n",
-        "\n",
-        "6. Next, we calculate the length of the current substring without repeating characters, which is `current_length = end - start + 1`. We add 1 to account for the fact that the indices are zero-based.\n",
-        "\n",
-        "7. We update the `max_length` with the maximum of its current value and the `current_length`. This step ensures that we keep track of the longest valid substring we have encountered so far.\n",
-        "\n",
-        "8. The loop continues to iterate through the input string, and at the end, we return the `max_length`, which represents the length of the longest substring without repeating characters."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 62,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(length_of_longest_substring(\"abcabcbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 63,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(length_of_longest_substring(\"bbbbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 64,
-      "id": "cf04eba0-0ead-4e8b-ba33-4316ea64a9d3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(length_of_longest_substring(\"pwwkew\"))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "Let's analyze the time and space complexity of the `length_of_longest_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through the input string `s` using a single for loop. The loop runs from the beginning of the string to the end once.\n",
-        "- Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.\n",
-        "- Therefore, the time complexity of the function is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The primary data structure that consumes space in this function is the `char_index` dictionary.\n",
-        "- In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.\n",
-        "- Therefore, the space complexity is O(min(n, m)), where n is the length of the input string `s`, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).\n",
-        "- Additionally, there are a few integer variables used for indices and lengths, which consume constant space.\n",
-        "- Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.\n",
-        "\n",
-        "**In summary,** the time complexity of the `length_of_longest_substring` function is O(n), and the space complexity is O(n) in the worst case due to the `char_index` dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Substring with K Distinct Characters:** Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string \"abcabcbb\" and K = 2, the answer would be 4 because the longest substring with two distinct characters is \"abca.\"\n",
-        "2. **Longest Substring with Unique Characters:** Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string \"abcabcbb,\" the answer would be 4 because \"abcd\" is the longest substring with unique characters."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
deleted file mode 100644
index 07e96a2..0000000
--- a/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb	
+++ /dev/null
@@ -1,195 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 424. Longest Repeating Character Replacement\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Repeating Character Replacement problem on LeetCode, click here!](https://leetcode.com/problems/longest-repeating-character-replacement/)\n",
-        "\n",
-        "---\n",
-        "You are given a string `s` and an integer `k`. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most `k` times.\n",
-        "\n",
-        "*Return the length of the longest substring containing the same letter you can get after performing the above operations.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^5$\n",
-        "- `s` consists of only uppercase English letters.\n",
-        "- `0 <= k <= s.length`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def characterReplacement(s, k):\n",
-        "    max_length = 0  # Initialize the maximum length\n",
-        "    max_count = 0   # Initialize the maximum count of repeating characters\n",
-        "    start = 0       # Initialize the start of the sliding window\n",
-        "    char_count = {} # Dictionary to store the count of each character\n",
-        "\n",
-        "    for end in range(len(s)):\n",
-        "        # Update the count of the current character in the dictionary\n",
-        "        char_count[s[end]] = char_count.get(s[end], 0) + 1\n",
-        "        \n",
-        "        # Update the maximum count of repeating characters\n",
-        "        max_count = max(max_count, char_count[s[end]])\n",
-        "        \n",
-        "        # Check if the current window size is greater than k\n",
-        "        if (end - start + 1) - max_count > k:\n",
-        "            # Move the start of the window to the right\n",
-        "            char_count[s[start]] -= 1\n",
-        "            start += 1\n",
-        "        \n",
-        "        # Update the maximum length\n",
-        "        max_length = max(max_length, end - start + 1)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We initialize some variables:\n",
-        "   - `max_length` to keep track of the maximum length of the substring containing the same letter.\n",
-        "   - `max_count` to keep track of the maximum count of repeating characters within the current window.\n",
-        "   - `start` to represent the start index of the sliding window.\n",
-        "   - `char_count` is a dictionary that will store the count of each character within the current window.\n",
-        "\n",
-        "2. We use a `for` loop to iterate through the characters of the string `s`.\n",
-        "\n",
-        "3. Inside the loop, we do the following for each character at position `end`:\n",
-        "   - Update the count of the current character in the `char_count` dictionary.\n",
-        "   - Update the `max_count` to be the maximum of the current `max_count` and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.\n",
-        "\n",
-        "4. We check if the current window size (the difference between `end` and `start` plus one) minus the `max_count` is greater than `k`. This condition checks whether we have exceeded the allowed number of replacements (`k`) within the current window.\n",
-        "\n",
-        "   - If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the `start` of the window to the right and decrementing the count of the character at `s[start]` in the `char_count` dictionary. This effectively removes characters from the left side of the window until we have a valid window again.\n",
-        "\n",
-        "   - By doing this, we ensure that the difference between the current window size and the `max_count` is always less than or equal to `k`.\n",
-        "\n",
-        "5. After each character, we update the `max_length` to be the maximum of the current `max_length` and the size of the current window (`end - start + 1`).\n",
-        "\n",
-        "6. Finally, we return `max_length`, which holds the length of the longest substring containing the same letter with at most `k` replacements."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s1 = \"ABAB\"\n",
-        "k1 = 2\n",
-        "print(characterReplacement(s1, k1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "s2 = \"AABABBA\"\n",
-        "k2 = 1\n",
-        "print(characterReplacement(s2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code uses a single `for` loop to iterate through the characters of the input string `s`. The loop runs from the beginning to the end of the string.\n",
-        "- Inside the loop, we perform constant-time operations such as updating the `char_count` dictionary and updating variables like `max_count` and `max_length`.\n",
-        "- The code's time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include `max_length`, `max_count`, `start`, and `char_count`. Therefore, the space complexity is O(1) or constant space.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.\n",
-        "2. **Variation with Lowercase Letters:** Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb b/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb
deleted file mode 100644
index 33c2a44..0000000
--- a/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb	
+++ /dev/null
@@ -1,273 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 76. Minimum Window Substring\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Minimum Window Substring problem on LeetCode, click here!](https://leetcode.com/problems/minimum-window-substring/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t` of lengths `m` and `n` respectively, return *the **minimum window substring** of `s` such that every character in `t` (**including duplicates**) is included in the window. If there is no such substring, return the empty string `\"\"`.*\n",
-        "\n",
-        "The testcases will be generated such that the answer is **unique**.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `m == s.length`\n",
-        "- `n == t.length`\n",
-        "- 1 <= `m, n` <= $10^5$\n",
-        "- `s` and `t` consist of uppercase and lowercase English letters.\n",
-        "\n",
-        "**Follow up**: Could you find an algorithm that runs in $O(m + n)$ time?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def min_window_substring(s, t):\n",
-        "    if not s or not t:\n",
-        "        return \"\"\n",
-        "\n",
-        "    # Initialize dictionaries to keep track of character counts for t and the current window in s.\n",
-        "    t_dict = {}\n",
-        "    current_window_dict = {}\n",
-        "    \n",
-        "    # Populate t_dict with character counts for string t.\n",
-        "    for char in t:\n",
-        "        t_dict[char] = t_dict.get(char, 0) + 1\n",
-        "\n",
-        "    # Initialize pointers for the sliding window.\n",
-        "    left = 0\n",
-        "    min_len = float('inf')\n",
-        "    min_window = \"\"\n",
-        "    required_chars = len(t_dict)\n",
-        "\n",
-        "    # Initialize a variable to keep track of how many required characters have been found in the current window.\n",
-        "    found_chars = 0\n",
-        "\n",
-        "    # Iterate over the string s using the right pointer.\n",
-        "    for right in range(len(s)):\n",
-        "        char = s[right]\n",
-        "\n",
-        "        # Update the current_window_dict.\n",
-        "        current_window_dict[char] = current_window_dict.get(char, 0) + 1\n",
-        "\n",
-        "        # Check if the current character is a required character and if its count matches the required count.\n",
-        "        if char in t_dict and current_window_dict[char] == t_dict[char]:\n",
-        "            found_chars += 1\n",
-        "\n",
-        "        # Try to minimize the window by moving the left pointer.\n",
-        "        while left <= right and found_chars == required_chars:\n",
-        "            # Calculate the current window size.\n",
-        "            window_size = right - left + 1\n",
-        "\n",
-        "            # If the current window is smaller than the minimum found so far, update min_len and min_window.\n",
-        "            if window_size < min_len:\n",
-        "                min_len = window_size\n",
-        "                min_window = s[left:right+1]\n",
-        "\n",
-        "            # Move the left pointer to the right to shrink the window.\n",
-        "            left_char = s[left]\n",
-        "            current_window_dict[left_char] -= 1\n",
-        "\n",
-        "            # Check if the character removed from the window was a required character.\n",
-        "            if left_char in t_dict and current_window_dict[left_char] < t_dict[left_char]:\n",
-        "                found_chars -= 1\n",
-        "\n",
-        "            # Move the left pointer further to continue shrinking the window.\n",
-        "            left += 1\n",
-        "\n",
-        "    return min_window"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by checking if either of the input strings `s` or `t` is empty. If either of them is empty, we return an empty string since there can't be any valid substring in this case.\n",
-        "\n",
-        "2. We initialize two dictionaries: `t_dict` and `current_window_dict`. These dictionaries will be used to keep track of character counts in the string `t` and the current window in string `s`, respectively.\n",
-        "\n",
-        "3. We populate the `t_dict` dictionary by iterating through string `t`. For each character, we increment its count in the dictionary using `t_dict.get(char, 0) + 1`. This allows us to count the occurrences of each character in `t`.\n",
-        "\n",
-        "4. We initialize two pointers: `left` and `right`. The `left` pointer will represent the start of the current window, and the `right` pointer will represent the end of the current window. We also initialize `min_len` to store the length of the minimum window found so far, and `min_window` to store the actual minimum window substring.\n",
-        "\n",
-        "5. We determine the number of required characters in `t` (i.e., the number of distinct characters in `t`) and store it in the variable `required_chars`.\n",
-        "\n",
-        "6. We initialize a variable `found_chars` to keep track of how many required characters have been found in the current window. Initially, it is set to 0.\n",
-        "\n",
-        "7. We iterate over the string `s` using the `right` pointer. In each iteration, we do the following:\n",
-        "\n",
-        "   - Update the `current_window_dict` by incrementing the count of the current character.\n",
-        "   \n",
-        "   - Check if the current character is a required character (present in `t_dict`) and if its count in the `current_window_dict` matches the required count from `t_dict`. If so, we increment `found_chars`.\n",
-        "\n",
-        "8. After updating the window, we attempt to minimize the window size by moving the `left` pointer to the right. In this step, we:\n",
-        "\n",
-        "   - Calculate the size of the current window.\n",
-        "   \n",
-        "   - If the current window size is smaller than the minimum found so far (`min_len`), we update `min_len` and `min_window` to store the current window substring.\n",
-        "   \n",
-        "   - Move the `left` pointer to the right to shrink the window.\n",
-        "   \n",
-        "   - Check if the character being removed from the window was a required character. If it was, we decrement `found_chars`.\n",
-        "   \n",
-        "   - Continue moving the `left` pointer further to continue shrinking the window if the window still contains all required characters.\n",
-        "\n",
-        "9. Finally, we return `min_window`, which will contain the minimum window substring that contains all characters from `t`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "BANC\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(min_window_substring(\"ADOBECODEBANC\", \"ABC\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 56,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "a\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(min_window_substring(\"a\", \"a\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": []
-        },
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(min_window_substring(\"a\", \"aa\")) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `min_window_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The main loop iterates through the string `s` from left to right using the `right` pointer. This loop runs in O(m) time, where 'm' is the length of string `s`.\n",
-        "\n",
-        "- Inside the loop, we have a while loop that moves the `left` pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the `left` pointer all the way to the end of the string.\n",
-        "\n",
-        "- Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.\n",
-        "\n",
-        "- The initialization of the `t_dict` dictionary takes O(n) time, where 'n' is the length of string `t`.\n",
-        "\n",
-        "Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string `s`, and the length of string `t` has a smaller impact.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the `t_dict` dictionary, the `current_window_dict` dictionary, and a few variables.\n",
-        "\n",
-        "- The `t_dict` dictionary stores character counts for string `t`. In the worst case, when all characters in `t` are distinct, this dictionary can have a maximum of 'n' key-value pairs. So, the space complexity for `t_dict` is O(n).\n",
-        "\n",
-        "- The `current_window_dict` dictionary stores character counts for the current window. In the worst case, it can have a maximum of 'm' key-value pairs. So, the space complexity for `current_window_dict` is also O(m).\n",
-        "\n",
-        "- Other variables used in the function, such as `left`, `right`, `min_len`, `min_window`, `required_chars`, and `found_chars`, are all of constant size and do not depend on the input sizes.\n",
-        "\n",
-        "**In summary**, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings' lengths. This is because the space used for `t_dict` and `current_window_dict` dominates the space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Smallest Distinct Substring:** Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.\n",
-        "2. **No Extra Space:** Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/03. Sliding Window/README.md b/_build/html/_sources/03. Sliding Window/README.md
deleted file mode 100644
index e1294ff..0000000
--- a/_build/html/_sources/03. Sliding Window/README.md	
+++ /dev/null
@@ -1,19 +0,0 @@
-# Sliding Window Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb b/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb
deleted file mode 100644
index c47292f..0000000
--- a/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 20. Valid Parentheses\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Parentheses problem on LeetCode, click here!](https://leetcode.com/problems/valid-parentheses/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given a string s containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.\n",
-        "\n",
-        "An input string is valid if:\n",
-        "\n",
-        "1. Open brackets must be closed by the same type of brackets.\n",
-        "2. Open brackets must be closed in the correct order.\n",
-        "3. Every close bracket has a corresponding open bracket of the same type.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^4$\n",
-        "- `s` consists of parentheses only `'()[]{}'`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isValid(s):\n",
-        "    # Create an empty stack to store opening brackets\n",
-        "    stack = []\n",
-        "    \n",
-        "    # Define a mapping for matching brackets\n",
-        "    bracket_mapping = {')': '(', '}': '{', ']': '['}\n",
-        "    \n",
-        "    # Iterate through the characters in the input string\n",
-        "    for char in s:\n",
-        "        # If the character is an opening bracket, push it onto the stack\n",
-        "        if char in bracket_mapping.values():\n",
-        "            stack.append(char)\n",
-        "        # If the character is a closing bracket\n",
-        "        elif char in bracket_mapping.keys():\n",
-        "            # Pop the top element from the stack if it exists, or use a dummy value '#'\n",
-        "            top_element = stack.pop() if stack else '#'\n",
-        "            # If the popped element does not match the corresponding opening bracket, return False\n",
-        "            if bracket_mapping[char] != top_element:\n",
-        "                return False\n",
-        "        # If the character is not a bracket, ignore it\n",
-        "        \n",
-        "    # After processing the entire string, if there are any unmatched opening brackets left in the stack, return False\n",
-        "    return len(stack) == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `isValid` function that takes a single argument `s`, which is the input string containing parentheses and brackets.\n",
-        "\n",
-        "2. Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.\n",
-        "\n",
-        "3. We define a `bracket_mapping` dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.\n",
-        "\n",
-        "4. We iterate through each character `char` in the input string `s` using a `for` loop.\n",
-        "\n",
-        "5. If the character `char` is an opening bracket (i.e., it exists in the `values()` of `bracket_mapping`), we push it onto the stack using the `append()` method.\n",
-        "\n",
-        "6. If the character `char` is a closing bracket (i.e., it exists in the `keys()` of `bracket_mapping`), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in `top_element`. We use a dummy value `'#'` if the stack is empty to avoid errors.\n",
-        "\n",
-        "7. We then compare `top_element` with the corresponding opening bracket using `bracket_mapping[char]`. If they do not match, it means the string is not valid, and we return `False`.\n",
-        "\n",
-        "8. If the character `char` is not a bracket, we simply ignore it and continue the loop.\n",
-        "\n",
-        "9. After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return `True`. Otherwise, we return `False`.\n",
-        "\n",
-        "10. Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(isValid(\"()\"))    "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 51,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(isValid(\"()[]{}\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(isValid(\"(]\"))     "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `isValid` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through each character in the input string `s` once, performing constant-time operations for each character.\n",
-        "- Pushing and popping elements from the stack (list) also takes constant time in most cases.\n",
-        "- Therefore, the overall time complexity of the function is $O(n)$, where $n$ is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the function is determined by the space used by the stack and the `bracket_mapping` dictionary.\n",
-        "- In the worst case, if the input string `s` consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of $O(n)$ in terms of the stack.\n",
-        "- The `bracket_mapping` dictionary has a constant number of key-value pairs (3 pairs in this case).\n",
-        "- Therefore, the overall space complexity of the function is $O(n)$, where $n$ is the length of the input string `s`, mainly due to the stack space.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity is $O(n)$ because we iterate through the string once.\n",
-        "- The space complexity is $O(n)$ due to the stack used to keep track of opening brackets."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Valid Expressions:** Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as \"$2 * (3 + 5) / (4 - 2)$\".\n",
-        "2. **Valid Parentheses Combinations:**\n",
-        "Write a function to generate all valid combinations of n pairs of parentheses, where $n$ is a positive integer. For example, for $n = 3$, the valid combinations are [\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\"]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/04. Stack/README.md b/_build/html/_sources/04. Stack/README.md
deleted file mode 100644
index 2ed115b..0000000
--- a/_build/html/_sources/04. Stack/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Stack Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
deleted file mode 100644
index 98f2331..0000000
--- a/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,228 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 153. Find Minimum in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Suppose an array of length `n` sorted in ascending order is **rotated** between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:\n",
-        "\n",
-        "- `[4,5,6,7,0,1,2]` if it was rotated `4` times.\n",
-        "- `[0,1,2,4,5,6,7]` if it was rotated `7` times.\n",
-        "\n",
-        "Notice that **rotating** an array `[a[0], a[1], a[2], ..., a[n-1]]` 1 time results in the array `[a[n-1], a[0], a[1], a[2], ..., a[n-2]]`.\n",
-        "\n",
-        "Given the sorted rotated array `nums` of **unique** elements, return *the minimum element of this array.*\n",
-        "\n",
-        "You must write an algorithm that runs in $O(log\\ n)$ time.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `n == nums.length`\n",
-        "- `1 <= n <= 5000`\n",
-        "- `-5000 <= nums[i] <= 5000`\n",
-        "- All the integers of `nums` are **unique**.\n",
-        "- `nums` is sorted and rotated between `1` and `n` times."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 39,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def findMin(nums):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "    \n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "        \n",
-        "        # If the mid element is greater than the rightmost element,\n",
-        "        # it means the minimum element is in the right half.\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        # If the mid element is less than or equal to the rightmost element,\n",
-        "        # it means the minimum element is in the left half or at the mid itself.\n",
-        "        else:\n",
-        "            right = mid\n",
-        "    \n",
-        "    # The loop will break when left and right converge to the minimum element.\n",
-        "    # At this point, left (or right) will be pointing to the minimum element.\n",
-        "    return nums[left]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The function `findMin(nums)` takes an input list `nums`, which represents the rotated sorted array.\n",
-        "\n",
-        "2. Initialize two pointers `left` and `right` to track the current search range. Initially, `left` is set to 0 (the beginning of the array), and `right` is set to `len(nums) - 1` (the end of the array).\n",
-        "\n",
-        "3. Enter a `while` loop with the condition `left < right`. This loop continues until `left` and `right` converge to a single element, which will be the minimum element in the rotated array.\n",
-        "\n",
-        "4. Inside the loop, calculate the middle index `mid` using integer division. This helps in finding the middle element of the current search range.\n",
-        "\n",
-        "5. Check if the element at the middle index (`nums[mid]`) is greater than the element at the rightmost index (`nums[right]`). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update `left` to `mid + 1`, effectively eliminating the left half of the search range.\n",
-        "\n",
-        "6. If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the `mid` index itself. In this case, update `right` to `mid`, effectively eliminating the right half of the search range.\n",
-        "\n",
-        "7. Repeat steps 4-6 until `left` and `right` converge to the minimum element.\n",
-        "\n",
-        "8. When the loop exits, it means that `left` (or `right`) points to the minimum element in the array.\n",
-        "\n",
-        "9. Return `nums[left]` (or `nums[right]`) as the result, which is the minimum element in the rotated sorted array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 43,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1:\n",
-        "nums1 = [3, 4, 5, 1, 2]\n",
-        "print(findMin(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 41,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "print(findMin(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 42,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "11\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [11, 13, 15, 17]\n",
-        "print(findMin(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this code is $O(log\\ n)$, where '$n$' is the length of the input array `nums`. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.\n",
-        "\n",
-        "In each iteration of the `while` loop, the search range is halved, and this process continues until the `left` and `right` pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.\n",
-        "\n",
-        "Therefore, the binary search used in this code runs in $O(log\\ n)$ time complexity.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of this code is $O(1)$, which means it uses a constant amount of additional space that does not depend on the size of the input array.\n",
-        "\n",
-        "The algorithm uses a fixed number of variables (`left`, `right`, `mid`) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Solve the problem with a variation where the input array may contain duplicates.\n",
-        "\n",
-        "2. Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in $O(log\\ n)$ time.\n",
-        "\n",
-        "3. Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in $O(log\\ n)$ time?\n",
-        "\n",
-        "4. Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in $O(log\\ n)$ time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
deleted file mode 100644
index d8d4202..0000000
--- a/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 33. Search in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Search in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is an integer array `nums` sorted in ascending order (with **distinct** values).\n",
-        "\n",
-        "Prior to being passed to your function, `nums` is **possibly rotated** at an unknown pivot index `k (1 <= k < nums.length)` such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]` (**0-indexed**). For example, `[0,1,2,4,5,6,7]` might be rotated at pivot index 3 and become `[4,5,6,7,0,1,2]`.\n",
-        "\n",
-        "Given the array `nums` **after** the possible rotation and an integer `target`, return *the index of `target` if it is in `nums`, or `-1` if it is not in `nums`.*\n",
-        "\n",
-        "You must write an algorithm with $O(log\\ n)$ runtime complexity.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `1 <= nums.length <= 5000`\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- All values of `nums` are **unique**.\n",
-        "- `nums` is an ascending array that is possibly rotated.\n",
-        "- $-10^4$ <= `target` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 44,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def search(nums, target):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Find the pivot index using binary search\n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid\n",
-        "\n",
-        "    pivot = left\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Determine which part of the array to search in\n",
-        "    if target >= nums[pivot] and target <= nums[right]:\n",
-        "        left = pivot\n",
-        "    else:\n",
-        "        right = pivot\n",
-        "\n",
-        "    # Perform binary search to find the target\n",
-        "    while left <= right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] == target:\n",
-        "            return mid\n",
-        "        elif nums[mid] < target:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid - 1\n",
-        "\n",
-        "    return -1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `search` function takes two arguments: `nums`, which is the rotated sorted array, and `target`, which is the value we want to find in the array.\n",
-        "\n",
-        "2. We initialize two pointers, `left` and `right`, which represent the range in which we are going to perform binary search. Initially, `left` is set to 0, and `right` is set to the index of the last element in the array (`len(nums) - 1`).\n",
-        "\n",
-        "3. We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a `while` loop to continue the search until `left` is less than `right`.\n",
-        "\n",
-        "4. Inside the loop, we calculate the middle index `mid` using integer division. We then compare the value at `mid` with the value at `right`. If `nums[mid]` is greater than `nums[right]`, it means the pivot point lies to the right of `mid`, so we update `left` to `mid + 1`. Otherwise, the pivot point lies to the left of `mid`, so we update `right` to `mid`. This process continues until we find the pivot index.\n",
-        "\n",
-        "5. After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.\n",
-        "\n",
-        "6. We reset `left` and `right` pointers. If the target value is within the range `[nums[pivot], nums[right]]`, we set `left` to `pivot` (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set `right` to `pivot` (the end of the sorted part), indicating that we should search in the sorted part.\n",
-        "\n",
-        "7. We then perform binary search again within the chosen range (`left` to `right`) to find the target element. The binary search continues until `left` is less than or equal to `right`.\n",
-        "\n",
-        "8. Inside the binary search loop, we calculate the middle index `mid` and compare `nums[mid]` with the target value. If they are equal, we return `mid` as the index of the target element. If `nums[mid]` is less than the target, we update `left` to `mid + 1` to search in the right half. If `nums[mid]` is greater than the target, we update `right` to `mid - 1` to search in the left half.\n",
-        "\n",
-        "9. If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 45,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "nums1 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target1 = 0\n",
-        "result1 = search(nums1, target1)\n",
-        "print(result1) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target2 = 3\n",
-        "result2 = search(nums2, target2)\n",
-        "print(result2) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 47,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [1]\n",
-        "target3 = 0\n",
-        "result3 = search(nums3, target3)\n",
-        "print(result3) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Finding the pivot index using binary search takes $O(log\\ n)$ time, where '$n$' is the number of elements in the array.\n",
-        "2. After finding the pivot index, performing binary search to find the target element also takes $O(log\\ n)$ time in the worst case.\n",
-        "\n",
-        "The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is $O(log\\ n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is very minimal:\n",
-        "\n",
-        "1. We use a constant amount of additional space for variables such as `left`, `right`, `pivot`, and `mid`. These variables do not depend on the input size, so they contribute $O(1)$ space complexity.\n",
-        "2. The function does not use any additional data structures that scale with the input size.\n",
-        "\n",
-        "Therefore, the space complexity of the code is $O(1)$, which means it has a constant space complexity and does not depend on the size of the input array.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find Minimum Element in Rotated Sorted Array**: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don't need to search for a target value but instead find the smallest element.\n",
-        "\n",
-        "2. **Search in a Circularly Sorted Array**: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining $O(log\\ n)$ complexity."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/05. Binary Search/README.md b/_build/html/_sources/05. Binary Search/README.md
deleted file mode 100644
index 6086b9b..0000000
--- a/_build/html/_sources/05. Binary Search/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Binary search Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb b/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb
deleted file mode 100644
index 0336bc8..0000000
--- a/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 141. Linked List Cycle\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Linked List Cycle problem on LeetCode, click here!](https://leetcode.com/problems/linked-list-cycle/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given `head`, the head of a linked list, determine if the linked list has a cycle in it.\n",
-        "\n",
-        "There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is connected to. **Note that `pos` is not passed as a parameter.**\n",
-        "\n",
-        "Return `true` if there is a cycle in the linked list. Otherwise, return `false`.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of the nodes in the list is in the range $[0, 10^4]$.\n",
-        "- $-10^5$ <= Node.val <= $10^5$\n",
-        "- `pos` is `-1` or a **valid index** in the linked-list.\n",
-        "\n",
-        "**Follow up:** Can you solve it using $O(1)$ (i.e. constant) memory?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0):\n",
-        "        self.val = val\n",
-        "        self.next = None\n",
-        "\n",
-        "class Solution:\n",
-        "    def hasCycle(self, head: ListNode) -> bool:\n",
-        "        if not head:\n",
-        "            return False\n",
-        "        \n",
-        "        slow = head\n",
-        "        fast = head\n",
-        "        \n",
-        "        while fast and fast.next:\n",
-        "            slow = slow.next\n",
-        "            fast = fast.next.next\n",
-        "            \n",
-        "            if slow == fast:\n",
-        "                return True\n",
-        "        \n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a class `Solution` with a method `hasCycle` for determining if a linked list has a cycle.\n",
-        "\n",
-        "The `ListNode` class represents nodes in the linked list, where each node has a `val` (a value associated with the node) and a `next` attribute (a reference to the next node in the list).\n",
-        "\n",
-        "The `hasCycle` method takes the `head` of a linked list as input and returns `True` if there is a cycle in the linked list, and `False` otherwise. It uses two pointers, `slow` and `fast`, to traverse the linked list. If there is a cycle, the `fast` pointer will eventually catch up to the `slow` pointer.\n",
-        "\n",
-        "The algorithm works as follows:\n",
-        "1. It checks if the input `head` is `None` (an empty list). If it is, the method returns `False` because an empty list can't have a cycle.\n",
-        "2. Two pointers, `slow` and `fast`, initially point to the `head` of the list.\n",
-        "3. The code enters a `while` loop where `fast` moves two steps at a time, and `slow` moves one step at a time.\n",
-        "4. If there is a cycle, `fast` will eventually catch up to `slow`, and the method returns `True`.\n",
-        "5. If the loop completes without finding a cycle, the method returns `False`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list with a cycle\n",
-        "def create_linked_list_with_cycle(values, pos):\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "    cycle_node = None\n",
-        "    \n",
-        "    for i, val in enumerate(values):\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "        \n",
-        "        if i == pos:\n",
-        "            cycle_node = current\n",
-        "    \n",
-        "    if cycle_node:\n",
-        "        current.next = cycle_node\n",
-        "    \n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:\n",
-        "\n",
-        "1. `values`: A list of values representing the nodes in the linked list.\n",
-        "2. `pos`: An integer representing the index of the node where the cycle begins.\n",
-        "\n",
-        "Here's how the function works:\n",
-        "\n",
-        "- It starts by creating an empty `ListNode` called `dummy`. This `dummy` node is used to simplify the creation of the linked list.\n",
-        "- It initializes a `current` pointer to the `dummy` node. This pointer will be used to traverse the linked list.\n",
-        "- It initializes a `cycle_node` variable to `None`. This variable will hold the reference to the node where the cycle begins, if any.\n",
-        "- It then iterates through the `values` list, creating a new `ListNode` for each value and appending it to the linked list.\n",
-        "- Inside the loop, it checks if the current index `i` is equal to the specified `pos`. If they match, it sets `cycle_node` to the current node. This simulates the creation of a cycle in the linked list.\n",
-        "- After the loop, if `cycle_node` is not `None` (indicating a cycle should be created), it connects the last node in the linked list to `cycle_node`, effectively creating a cycle.\n",
-        "- Finally, it returns the reference to the first node of the linked list (not the `dummy` node).\n",
-        "\n",
-        "This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It's particularly useful for testing the code's ability to detect cycles in linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "head = [3,2,0,-4]\n",
-        "pos = 1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "head = [1,2]\n",
-        "pos = 0\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "head = [1]\n",
-        "pos = -1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the code for detecting a cycle in a linked list:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is $O(n)$, where \"$n$\" is the number of nodes in the linked list.\n",
-        "\n",
-        "The reason for this is that both the `slow` and `fast` pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the `fast` pointer will reach the end of the list after going through approximately $n/2$ nodes. In the case of a cycle, it may take some extra iterations for the `fast` pointer to catch up to the `slow` pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it $O(n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is $O(1)$, which means it uses constant space.\n",
-        "\n",
-        "The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (`slow` and `fast`) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.\n",
-        "\n",
-        "**In summary**, this code efficiently detects cycles in a linked list with a time complexity of $O(n)$ and a space complexity of $O(1)$. It is an example of an algorithm that solves a complex problem with minimal memory usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/143. Reorder List.ipynb b/_build/html/_sources/06. Linked List/143. Reorder List.ipynb
deleted file mode 100644
index a83545b..0000000
--- a/_build/html/_sources/06. Linked List/143. Reorder List.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 143. Reorder List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Reorder List problem on LeetCode, click here!](https://leetcode.com/problems/reorder-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the head of a singly linked-list. The list can be represented as:\n",
-        "\n",
-        "$L_0 → L_1 → … → L_{n - 1} → L_n$\n",
-        "\n",
-        "Reorder the list to be on the following form:\n",
-        "\n",
-        "$L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …$\n",
-        "\n",
-        "You may not modify the values in the list's nodes. Only nodes themselves may be changed.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is in the range $[1, 5 * 10^4]$.\n",
-        "- `1 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 28,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def reorderList(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    # Step 1: Find the middle of the linked list\n",
-        "    slow, fast = head, head\n",
-        "    while fast.next and fast.next.next:\n",
-        "        slow = slow.next\n",
-        "        fast = fast.next.next\n",
-        "\n",
-        "    # Split the list into two halves\n",
-        "    first_half = head\n",
-        "    second_half = slow.next\n",
-        "    slow.next = None\n",
-        "\n",
-        "    # Step 2: Reverse the second half of the linked list\n",
-        "    prev = None\n",
-        "    current = second_half\n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    second_half = prev\n",
-        "\n",
-        "    # Step 3: Merge the first and reversed second halves alternately\n",
-        "    p1, p2 = first_half, second_half\n",
-        "    while p2:\n",
-        "        next_p1 = p1.next\n",
-        "        next_p2 = p2.next\n",
-        "        p1.next = p2\n",
-        "        p2.next = next_p1\n",
-        "        p1 = next_p1\n",
-        "        p2 = next_p2\n",
-        "\n",
-        "    return head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `reorderList` function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here's a detailed explanation of how the function works:\n",
-        "\n",
-        "1. **Base Cases Handling**:\n",
-        "   - The function first checks if the input linked list is empty (`not head`) or contains only one element (`not head.next`). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.\n",
-        "\n",
-        "2. **Finding the Middle of the Linked List**:\n",
-        "   - To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, `slow` and `fast`, initialized to the head of the list.\n",
-        "   - `slow` moves one step at a time while `fast` moves two steps at a time. When `fast` reaches the end of the list or the second-to-last node, `slow` will be at the middle node.\n",
-        "\n",
-        "3. **Splitting the List**:\n",
-        "   - After finding the middle node, we split the list into two halves:\n",
-        "     - The first half, `first_half`, contains nodes from the beginning up to the middle.\n",
-        "     - The second half, `second_half`, contains nodes from the middle to the end.\n",
-        "   - To split the list, we set the `next` pointer of the node before the middle node to `None`.\n",
-        "\n",
-        "4. **Reversing the Second Half**:\n",
-        "   - We reverse the second half of the linked list using the `prev`, `current`, and `next_node` pointers.\n",
-        "   - `prev` is initially `None`, and we iterate through the second half. For each node, we:\n",
-        "     - Set the `next` of the current node to `prev`, effectively reversing the next pointer direction.\n",
-        "     - Update `prev` to the current node.\n",
-        "     - Move to the next node using the `next_node`.\n",
-        "\n",
-        "5. **Merging the Two Halves Alternately**:\n",
-        "   - We now have two linked lists: `first_half` and the reversed `second_half`.\n",
-        "   - We merge these two lists alternately by adjusting the `next` pointers of the nodes.\n",
-        "   - `p1` and `p2` are pointers to the current nodes in `first_half` and `second_half`, respectively.\n",
-        "   - We iterate through both lists while reordering nodes:\n",
-        "     - Set the `next` of `p1` to `p2` to link a node from the first half to a node from the reversed second half.\n",
-        "     - Update `p1` and `p2` to their respective next nodes.\n",
-        "     - Repeat this process until we have processed all nodes in both halves.\n",
-        "\n",
-        "6. **Returning the Reordered List**:\n",
-        "   - After the merging process is complete, the linked list is reordered as specified.\n",
-        "   - The function returns the `head` of the reordered list.\n",
-        "\n",
-        "The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 4, 2, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = ListNode(1, ListNode(2, ListNode(3, ListNode(4))))\n",
-        "reorderList(head1)\n",
-        "print(printLinkedList(head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 5, 2, 4, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))\n",
-        "reorderList(head2)\n",
-        "print(printLinkedList(head2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `reorderList` function:\n",
-        "\n",
-        "**Time Complexity**:\n",
-        "1. **Finding the Middle of the Linked List**: In this step, we use two pointers, one moving one step at a time (`slow`) and the other moving two steps at a time (`fast`). This process takes $O(N/2)$ time, where $N$ is the number of nodes in the linked list.\n",
-        "\n",
-        "2. **Splitting the List**: After finding the middle, we split the list into two halves by setting the `next` pointer of the node before the middle node to `None`. This step takes $O(1)$ time.\n",
-        "\n",
-        "3. **Reversing the Second Half**: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes $O(N/2)$ time.\n",
-        "\n",
-        "4. **Merging the Two Halves Alternately**: In this step, we merge the two halves alternately by adjusting the `next` pointers of the nodes. We iterate through both halves once, so this step takes $O(N/2)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the `reorderList` function is dominated by the steps involving reversing and merging the two halves, both of which take $O(N/2)$ time. Therefore, the total time complexity is $O(N)$.\n",
-        "\n",
-        "**Space Complexity**:\n",
-        "The space complexity of the `reorderList` function is primarily determined by the variables and data structures used within the function. Let's break down the space complexity components:\n",
-        "\n",
-        "1. **Constant Space Variables**: The variables `slow`, `fast`, `prev`, `current`, `next_node`, `p1`, and `p2` are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute $O(1)$ to the space complexity.\n",
-        "\n",
-        "2. **Split Linked Lists**: In the splitting step, we create two new linked list segments (`first_half` and `second_half`) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, $O(N/2)$. \n",
-        "\n",
-        "3. **Reversed Second Half**: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn't contribute to additional space complexity.\n",
-        "\n",
-        "4. **Overall**: Combining the above components, the total space complexity is $O(N/2)$, which simplifies to $O(N)$ in terms of space complexity.\n",
-        "\n",
-        "**In summary**, the `reorderList` function has a time complexity of $O(N)$ and a space complexity of $O(N)$ due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reorder by K Elements:** Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by $K$ elements at a time. For example, for $K=3$, you would reorder it as ($L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...$).\n",
-        "You may need to handle cases where the number of nodes is not a multiple of $K$.\n",
-        "\n",
-        "2. **Reorder by Odd and Even Nodes:** Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, ($L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...$)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb b/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb
deleted file mode 100644
index 263124e..0000000
--- a/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb	
+++ /dev/null
@@ -1,278 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 19. Remove Nth Node From End of List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Remove Nth Node From End of List problem on LeetCode, click here!](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the head of a linked list, remove the $n^{th}$ node from the end of the list and return its head.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is `sz`.\n",
-        "- `1 <= sz <= 30`\n",
-        "- `0 <= Node.val <= 100`\n",
-        "- `1 <= n <= sz`\n",
-        "\n",
-        "**Follow up:** Could you do this in one pass?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 23,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def removeNthFromEnd(head, n):\n",
-        "    # Create a dummy node to handle the case of removing the head node.\n",
-        "    dummy = ListNode(0)\n",
-        "    dummy.next = head\n",
-        "    first = dummy\n",
-        "    second = dummy\n",
-        "    \n",
-        "    # Advance the first pointer by n+1 nodes.\n",
-        "    for _ in range(n + 1):\n",
-        "        first = first.next\n",
-        "    \n",
-        "    # Move both pointers simultaneously until first reaches the end.\n",
-        "    while first is not None:\n",
-        "        first = first.next\n",
-        "        second = second.next\n",
-        "    \n",
-        "    # Remove the nth node by updating the next pointer of the previous node.\n",
-        "    second.next = second.next.next\n",
-        "    \n",
-        "    return dummy.next  # Return the modified head of the linked list"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `ListNode` class to represent individual nodes in a linked list. Each node has two attributes: `val` (the value of the node) and `next` (a reference to the next node in the list).\n",
-        "\n",
-        "2. The `removeNthFromEnd` function takes the head of a linked list (`head`) and the value `n`, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.\n",
-        "\n",
-        "3. We create a dummy node (`dummy`) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.\n",
-        "\n",
-        "4. We initialize two pointers, `first` and `second`, both initially pointing to the dummy node.\n",
-        "\n",
-        "5. To advance the `first` pointer by `n+1` nodes, we use a `for` loop. This positions the `first` pointer `n` nodes ahead of the `second` pointer.\n",
-        "\n",
-        "6. We then move both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This ensures that the `second` pointer ends up pointing to the node that needs to be removed.\n",
-        "\n",
-        "7. To remove the nth node from the end, we update the `next` pointer of the node pointed to by the `second` pointer to skip over the node to be removed.\n",
-        "\n",
-        "8. Finally, we return `dummy.next`, which is the modified head of the linked list without the removed node.\n",
-        "\n",
-        "9. Additionally, there are two helper functions:\n",
-        "   - `createLinkedList(values)` creates a linked list from a list of values.\n",
-        "   - `convertToList(head)` converts a linked list back into a list of values."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values.\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list of values.\n",
-        "def convertToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions:\n",
-        "\n",
-        "1. `createLinkedList(values)`: This function creates a linked list from a list of values.\n",
-        "\n",
-        "   - Input: `values` is a list containing values that you want to insert into the linked list.\n",
-        "   - Output: The function returns the head of the created linked list.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by checking if the `values` list is empty. If it is, it returns `None` to indicate an empty linked list.\n",
-        "   - If the `values` list is not empty, it creates the first node of the linked list with the value from the first element of `values`.\n",
-        "   - It then iterates through the remaining elements of `values` and creates new nodes for each value, connecting them together using the `next` attribute to form a linked list.\n",
-        "   - Finally, it returns the head of the linked list, which is the first node created.\n",
-        "   \n",
-        "\n",
-        "2. `convertToList(head)`: This function converts a linked list into a list of values.\n",
-        "\n",
-        "   - Input: `head` is the head node of the linked list that you want to convert.\n",
-        "   - Output: The function returns a list containing the values of the nodes in the linked list in order.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by initializing an empty list, `result`, to store the values of the linked list nodes.\n",
-        "   - It then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - The iteration continues until it reaches the end of the linked list (i.e., the `next` attribute of the current node becomes `None`).\n",
-        "   - After the iteration is complete, the function returns the `result` list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.\n",
-        "\n",
-        "These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2, 3, 5]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = createLinkedList([1, 2, 3, 4, 5])\n",
-        "n1 = 2\n",
-        "new_head1 = removeNthFromEnd(head1, n1)\n",
-        "print(convertToList(new_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = createLinkedList([1])\n",
-        "n2 = 1\n",
-        "new_head2 = removeNthFromEnd(head2, n2)\n",
-        "print(convertToList(new_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 27,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "head3 = createLinkedList([1, 2])\n",
-        "n3 = 1\n",
-        "new_head3 = removeNthFromEnd(head3, n3)\n",
-        "print(convertToList(new_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Certainly! Let's analyze the time and space complexity of the `removeNthFromEnd` function in isolation:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The `removeNthFromEnd` function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length $N$.\n",
-        "- The first pass positions the `first` pointer $n$ nodes ahead of the `second` pointer. This pass takes $O(N)$ time because it involves iterating through all N nodes.\n",
-        "- The second pass moves both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This also takes $O(N)$ time in the worst case.\n",
-        "- Therefore, the overall time complexity of the `removeNthFromEnd` function is $O(N)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The `removeNthFromEnd` function uses a constant amount of extra space for its variables (e.g., `first`, `second`, and `dummy`). This space usage does not depend on the size of the linked list.\n",
-        "- The space complexity is $O(1)$, indicating that the space used by the function is constant and independent of the size of the input linked list.\n",
-        "\n",
-        "**In summary**, the `removeNthFromEnd` function has a time complexity of $O(N)$ and a space complexity of $O(1)$. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb b/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb
deleted file mode 100644
index c97de2d..0000000
--- a/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 206. Reverse Linked List\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Reverse Linked List problem on LeetCode, click here!](https://leetcode.com/problems/reverse-linked-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `head` of a singly linked list, reverse the list, and return the reversed list.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is the range `[0, 5000]`.\n",
-        "- `-5000 <= Node.val <= 5000`\n",
-        "\n",
-        "**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 33,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "# Function to reverse a linked list iteratively\n",
-        "def reverseListIterative(head):\n",
-        "    prev = None\n",
-        "    current = head\n",
-        "    \n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    \n",
-        "    return prev\n",
-        "\n",
-        "# Function to reverse a linked list recursively\n",
-        "def reverseListRecursive(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    new_head = reverseListRecursive(head.next)\n",
-        "    head.next.next = head\n",
-        "    head.next = None\n",
-        "\n",
-        "    return new_head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `reverseListIterative(head)`: This function reverses a linked list iteratively using a loop. Here's a step-by-step explanation:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - It initializes two pointers, `prev` and `current`, initially set to `None` and the `head` of the list, respectively.\n",
-        "   - It enters a `while` loop that continues until `current` reaches the end of the list (i.e., becomes `None`).\n",
-        "   - Inside the loop:\n",
-        "     - It stores the `next_node` which is the next node after `current`.\n",
-        "     - It updates the `next` pointer of `current` to point to the `prev` node. This effectively reverses the link direction.\n",
-        "     - It moves `prev` to `current` and `current` to `next_node`, advancing the pointers one step further in the list.\n",
-        "   - Once the loop completes, `prev` will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns `prev`.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`: This function reverses a linked list recursively. Here's how it works:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - The base case is checked: if `head` is `None` or `head.next` is `None`, meaning the list is empty or has only one node, it returns `head` as there's no need to reverse a list with zero or one element.\n",
-        "   - In the recursive case:\n",
-        "     - It calls itself with `head.next`, effectively moving down the list until it reaches the end.\n",
-        "     - Once it reaches the end, it starts reversing the links:\n",
-        "       - `head.next.next` is set to `head`, reversing the link between `head` and the next node.\n",
-        "       - `head.next` is set to `None` to avoid cycles.\n",
-        "   - Finally, it returns the new head of the reversed list, which will be the last node of the original list.\n",
-        "\n",
-        "**In summary,** `reverseListIterative` reverses the linked list by iterating through it and changing the next pointers, while `reverseListRecursive` reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list for testing\n",
-        "def linkedListToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions used in the provided code:\n",
-        "\n",
-        "1. `createLinkedList(values)`:\n",
-        "\n",
-        "   - Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It first checks if the input list `values` is empty. If it's empty, it returns `None` to indicate an empty linked list.\n",
-        "     - If `values` is not empty, it initializes a `head` node with the value of the first element in `values`.\n",
-        "     - It then iterates through the remaining values in `values`, creating new nodes for each value and linking them together to form a linked list.\n",
-        "     - Finally, it returns the `head` node of the newly created linked list.\n",
-        "\n",
-        "2. `linkedListToList(head)`:\n",
-        "\n",
-        "   - Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It takes the `head` of the linked list as input.\n",
-        "     - It initializes an empty list called `result`.\n",
-        "     - It then iterates through the linked list, starting from `head`, and appends each node's `val` (value) to the `result` list.\n",
-        "     - This process continues until the end of the linked list is reached.\n",
-        "     - Finally, it returns the `result` list, which contains the values from the linked list in the same order.\n",
-        "\n",
-        "These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 35,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[1, 1, 2, 3, 4, 4]"
-            ]
-          },
-          "execution_count": 35,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 1: Iterative\n",
-        "head1 = [1,2,3,4,5]\n",
-        "head1 = createLinkedList(head1)\n",
-        "reversed_head1 = reverseListIterative(head1)\n",
-        "print(linkedListToList(reversed_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[]"
-            ]
-          },
-          "execution_count": 37,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 2: Recursive\n",
-        "head2 = [1,2]\n",
-        "head2 = createLinkedList(head2)\n",
-        "reversed_head2 = reverseListRecursive(head2)\n",
-        "print(linkedListToList(reversed_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[0]"
-            ]
-          },
-          "execution_count": 38,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 3: Empty list\n",
-        "head3 = []\n",
-        "head3 = createLinkedList(head3)\n",
-        "reversed_head3 = reverseListIterative(head3)\n",
-        "print(linkedListToList(reversed_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the two functions:\n",
-        "\n",
-        "1. `reverseListIterative(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The iterative function visits each node in the linked list exactly once in a single pass, where \"$n$\" is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(1)$\n",
-        "     - This function uses a constant amount of extra space for the `prev`, `current`, and `next_node` pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is $O(n)$, where \"$n$\" is the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(n)$\n",
-        "     - The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has \"$n$\" nodes, it will create \"$n$\" recursive function calls on the stack, resulting in a space complexity of $O(n)$. This is because each function call stores information about its state, including the `head` pointer, until it reaches the base case and starts returning.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- The time complexity of both functions is $O(n)$ because they both visit each node once.\n",
-        "- The space complexity of `reverseListIterative` is $O(1)$ because it uses a constant amount of extra space.\n",
-        "- The space complexity of `reverseListRecursive` is $O(n)$ due to the recursive function calls and the associated call stack space.\n",
-        "\n",
-        "Both functions are efficient in terms of time complexity, but `reverseListIterative` is more memory-efficient because it uses a constant amount of additional space, while `reverseListRecursive` uses space on the call stack proportional to the number of nodes in the list."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Group Reverse:** Modify the reverseListIterative function to reverse the linked list in groups of $K$ elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and $K$ is 3, the output should be [3, 2, 1, 6, 5, 4].\n",
-        "\n",
-        "2. **Rotate Linked List:** Write a function to rotate a linked list to the right by $K$ places. For example, if the input is [1, 2, 3, 4, 5] and $K$ is 2, the output should be [4, 5, 1, 2, 3]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb b/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb
deleted file mode 100644
index 876d633..0000000
--- a/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 21. Merge Two Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge Two Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-two-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the heads of two sorted linked lists `list1` and `list2`.\n",
-        "\n",
-        "Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists.\n",
-        "\n",
-        "*Return the head of the merged linked list.*\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in both lists is in the range `[0, 50]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "- Both `list1` and `list2` are sorted in non-decreasing order."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def mergeTwoLists(list1, list2):\n",
-        "    # Create a dummy node to simplify the code.\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "\n",
-        "    while list1 and list2:\n",
-        "        if list1.val < list2.val:\n",
-        "            current.next = list1\n",
-        "            list1 = list1.next\n",
-        "        else:\n",
-        "            current.next = list2\n",
-        "            list2 = list2.next\n",
-        "        current = current.next\n",
-        "\n",
-        "    # Append the remaining elements from either list.\n",
-        "    if list1:\n",
-        "        current.next = list1\n",
-        "    else:\n",
-        "        current.next = list2\n",
-        "\n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class `ListNode` to represent the nodes of a singly-linked list. Each node has a `val` attribute to store the value of the node and a `next` attribute to point to the next node in the list.\n",
-        "\n",
-        "2. We define the `mergeTwoLists` function that takes two linked list heads, `list1` and `list2`, as input.\n",
-        "\n",
-        "3. We create a `dummy` node at the beginning of the merged list. The `dummy` node simplifies the code by serving as a placeholder, and its `next` attribute will point to the actual merged list.\n",
-        "\n",
-        "4. We initialize a `current` pointer to point to the `dummy` node initially. This `current` pointer helps us traverse and build the merged list.\n",
-        "\n",
-        "5. We enter a `while` loop that continues until either `list1` or `list2` becomes empty. Inside the loop, we compare the values of the nodes at the current positions of `list1` and `list2`.\n",
-        "\n",
-        "6. If the `val` of the node in `list1` is smaller than the `val` of the node in `list2`, we attach the node from `list1` to the merged list by updating the `next` attribute of the `current` node to point to the node in `list1`. We then move the `list1` pointer to the next node.\n",
-        "\n",
-        "7. If the `val` of the node in `list2` is smaller than or equal to the `val` of the node in `list1`, we attach the node from `list2` to the merged list in a similar manner. We move the `list2` pointer to the next node.\n",
-        "\n",
-        "8. After attaching a node to the merged list, we move the `current` pointer to the newly added node. This step is essential for keeping track of the end of the merged list.\n",
-        "\n",
-        "9. The loop continues until either `list1` or `list2` becomes empty.\n",
-        "\n",
-        "10. Once the loop exits, we check if there are any remaining elements in `list1` or `list2`. If `list1` is not empty, we attach the remaining elements of `list1` to the merged list. If `list2` is not empty, we attach the remaining elements of `list2`.\n",
-        "\n",
-        "11. Finally, we return the `next` attribute of the `dummy` node as the head of the merged list, which represents the sorted merged list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 1:\n",
-        "# Input: list1 = [1,2,4], list2 = [1,3,4]\n",
-        "list1 = ListNode(1, ListNode(2, ListNode(4)))\n",
-        "list2 = ListNode(1, ListNode(3, ListNode(4)))\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 2:\n",
-        "# Input: list1 = [], list2 = []\n",
-        "list1 = None\n",
-        "list2 = None\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 3:\n",
-        "# list1 = [], list2 = [0]\n",
-        "list1 = None\n",
-        "list2 = ListNode(0)\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `mergeTwoLists` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is $O(N + M$), where $N$ and $M$ are the lengths of `list1` and `list2`, respectively. Here's why:\n",
-        "\n",
-        "1. In the worst case, we need to traverse both `list1` and `list2` completely. This involves iterating through all the nodes in both lists once.\n",
-        "\n",
-        "2. The while loop runs until either `list1` or `list2` becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.\n",
-        "\n",
-        "3. Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of $O(N + M)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is $O(1)$, which means it uses a constant amount of extra space regardless of the input sizes. Here's why:\n",
-        "\n",
-        "1. We create a few extra pointers (`dummy`, `current`) and temporary variables (`val`) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of `list1` and `list2`.\n",
-        "\n",
-        "2. We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from `list1` and `list2` to form the merged list. This operation does not consume additional memory proportional to the input sizes.\n",
-        "\n",
-        "**In summary**, the `mergeTwoLists` function has a time complexity of $O(N + M)$ and a space complexity of $O(1)$, making it an efficient solution for merging two sorted linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Merge K Sorted Lists:** Extend the problem to merge $K$ sorted linked lists instead of just two. You need to efficiently merge $K$ lists into one sorted list.\n",
-        "\n",
-        "2. **Merge Lists in a Zigzag Pattern:** Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": "sql",
-      "file_extension": "",
-      "mimetype": "",
-      "name": "sql",
-      "version": "3.32.3"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb b/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb
deleted file mode 100644
index a850734..0000000
--- a/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 23. Merge k Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge k Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-k-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array of $k$ linked-lists lists, each linked-list is sorted in ascending order.\n",
-        "\n",
-        "Merge all the linked-lists into one sorted linked-list and return it.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `k == lists.length`\n",
-        "- 0 <= k <= $10^4$\n",
-        "- `0 <= lists[i].length <= 500`\n",
-        "- $-10^4$ <= lists[i][j] <= $10^4$\n",
-        "- `lists[i]` is sorted in ascending order.\n",
-        "- The sum of `lists[i].length` will not exceed $10^4$.\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "     def __init__(self, val=0, next=None):\n",
-        "         self.val = val\n",
-        "         self.next = next\n",
-        "\n",
-        "class Solution:\n",
-        "    def mergeKLists(self, lists: [[ListNode]]) -> ListNode:\n",
-        "        # Check if the input list of linked lists is empty\n",
-        "        if not lists or len(lists) == 0:\n",
-        "            return None\n",
-        "\n",
-        "        # Loop until there is only one merged list left\n",
-        "        while len(lists) > 1:\n",
-        "            mergedLists = []\n",
-        "\n",
-        "            # Merge pairs of lists\n",
-        "            for i in range(0, len(lists), 2):\n",
-        "                l1 = lists[i]\n",
-        "                l2 = lists[i + 1] if (i + 1) < len(lists) else None\n",
-        "                mergedLists.append(self.mergeList(l1, l2))\n",
-        "\n",
-        "            # Update the list of lists with merged results\n",
-        "            lists = mergedLists\n",
-        "        \n",
-        "        # Return the final merged list\n",
-        "        return lists[0]\n",
-        "\n",
-        "    def mergeList(self, l1, l2):\n",
-        "        # Create a dummy node to simplify merging\n",
-        "        dummy = ListNode()\n",
-        "        tail = dummy\n",
-        "\n",
-        "        # Merge the two sorted lists\n",
-        "        while l1 and l2:\n",
-        "            if l1.val < l2.val:\n",
-        "                tail.next = l1\n",
-        "                l1 = l1.next\n",
-        "            else:\n",
-        "                tail.next = l2\n",
-        "                l2 = l2.next\n",
-        "            tail = tail.next\n",
-        "\n",
-        "        # Append any remaining elements from l1 or l2 (if any)\n",
-        "        if l1:\n",
-        "            tail.next = l1\n",
-        "        if l2:\n",
-        "            tail.next = l2\n",
-        "\n",
-        "        # Return the merged result starting from the next of the dummy node\n",
-        "        return dummy.next\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class `Solution` with two methods for merging k sorted linked lists:\n",
-        "\n",
-        "1. `mergeKLists(self, lists: List[ListNode]) -> ListNode`: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.\n",
-        "\n",
-        "2. `mergeList(self, l1, l2)`: This method takes two sorted linked lists, `l1` and `l2`, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.\n",
-        "\n",
-        "Here's a high-level overview of how the code works:\n",
-        "\n",
-        "- The `mergeKLists` method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns `None`.\n",
-        "\n",
-        "- Inside a `while` loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the `lists` array. It does this by iterating through the input lists in pairs and calling the `mergeList` method to merge each pair.\n",
-        "\n",
-        "- The `mergeList` method takes two sorted linked lists, `l1` and `l2`, and merges them into a single sorted linked list. It uses a dummy node (`dummy`) and a `tail` pointer to keep track of the merged list while comparing and merging elements from `l1` and `l2`.\n",
-        "\n",
-        "- After merging all pairs of lists and updating the `lists` array with the merged results, the loop continues until only one merged list remains in the `lists` array.\n",
-        "\n",
-        "- Finally, the `mergeKLists` method returns the merged list.\n",
-        "\n",
-        "Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1 -> 1 -> 2 -> 3 -> 4 -> 4 -> 5 -> 6 -> "
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: lists = [[1,4,5],[1,3,4],[2,6]]\n",
-        "\n",
-        "lists1 = [\n",
-        "    ListNode(1, ListNode(4, ListNode(5))),\n",
-        "    ListNode(1, ListNode(3, ListNode(4))),\n",
-        "    ListNode(2, ListNode(6))\n",
-        "]\n",
-        "solution = Solution()\n",
-        "result1 = solution.mergeKLists(lists1)\n",
-        "\n",
-        "# Print the result\n",
-        "if result1:\n",
-        "    current = result1\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: lists = []\n",
-        "\n",
-        "lists2 = []\n",
-        "solution = Solution()\n",
-        "result2 = solution.mergeKLists(lists2)\n",
-        "\n",
-        "# Print the result\n",
-        "if result2:\n",
-        "    current = result2\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: lists = [[]]\n",
-        "\n",
-        "lists3 = [None]\n",
-        "solution = Solution()\n",
-        "result3 = solution.mergeKLists(lists3)\n",
-        "\n",
-        "# Print the result\n",
-        "if result3:\n",
-        "    current = result3\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Heap Initialization:** The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes $O(1)$ time.\n",
-        "\n",
-        "2. **Merging:** The merging operation is performed in a divide-and-conquer fashion. In each iteration of the `while` loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists ($n$). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is $O(log\\ k)$.\n",
-        "\n",
-        "   Therefore, the overall time complexity of the code is $O(n * log\\ k)$, where n is the total number of nodes across all lists, and $k$ is the number of linked lists.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Heap Space:** The code doesn't use a heap data structure, so there's no additional space complexity due to a heap.\n",
-        "\n",
-        "2. **Merged Lists:** In the `mergeList` method, we create a new merged list. However, this list is not stored in memory for all lists; it's replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is $O(n)$ in the worst case.\n",
-        "\n",
-        "3. **Additional Variables:** The code uses a few additional variables, such as `dummy` and `tail`, but these occupy a constant amount of space and don't depend on the input size.\n",
-        "\n",
-        "   Therefore, the overall space complexity of the code is $O(n)$, where n is the total number of nodes across all lists.\n",
-        "\n",
-        "In summary, the code's time complexity is $O(n * log(k))$, and its space complexity is $O(n)$. This code efficiently merges $k$ sorted linked lists using a divide-and-conquer approach with a relatively low space overhead."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/06. Linked List/README.md b/_build/html/_sources/06. Linked List/README.md
deleted file mode 100644
index fb7b3ee..0000000
--- a/_build/html/_sources/06. Linked List/README.md	
+++ /dev/null
@@ -1,21 +0,0 @@
-# Linked List Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/07. Trees/100. Same Tree.ipynb b/_build/html/_sources/07. Trees/100. Same Tree.ipynb
deleted file mode 100644
index a270fab..0000000
--- a/_build/html/_sources/07. Trees/100. Same Tree.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= Node.val <= $10^4$\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time Complexity\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "## Space Complexity\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "## In summary:\n",
-        "\n",
-        "+ **Time Complexity:** $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ **Space Complexity:** $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb
deleted file mode 100644
index 8cb08b7..0000000
--- a/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 102. Binary Tree Level Order Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Level Order Traversal problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, return *the level order traversal of its nodes' values*. (i.e., from left to right, level by level).\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-1000 <= Node.val <= 1000`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def levelOrder(root):\n",
-        "    # Check if the tree is empty, if so, return an empty list.\n",
-        "    if not root:\n",
-        "        return []\n",
-        "\n",
-        "    # Initialize an empty list to store the result.\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue with the root node to perform BFS.\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Initialize an empty list to store the values of nodes at the current level.\n",
-        "        level_values = []\n",
-        "        \n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Iterate through the nodes at the current level.\n",
-        "        for _ in range(level_size):\n",
-        "            # Dequeue the front node from the queue.\n",
-        "            node = queue.pop(0)\n",
-        "            \n",
-        "            # Append the value of the current node to the level_values list.\n",
-        "            level_values.append(node.val)\n",
-        "\n",
-        "            # Enqueue the left and right children of the current node if they exist.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "        # Append the level_values list (values at the current level) to the result list.\n",
-        "        result.append(level_values)\n",
-        "\n",
-        "    # Return the final result, which is a list of lists representing level order traversal.\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a `TreeNode` class that represents a node in the binary tree. Each `TreeNode` object has a value (`val`) and two child nodes: `left` and `right`.\n",
-        "\n",
-        "2. The `levelOrder` function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.\n",
-        "\n",
-        "3. We start by checking if the input `root` is `None`, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the final result, which will be a list of lists containing node values at each level.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue will be used for breadth-first traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside the loop, we perform the following steps:\n",
-        "\n",
-        "   - We initialize an empty list called `level_values` to store the values of nodes at the current level.\n",
-        "\n",
-        "   - We determine the number of nodes at the current level by getting the length of the `queue`. This is done to process nodes level by level.\n",
-        "\n",
-        "   - We iterate through the nodes at the current level using a for loop. For each node in the current level:\n",
-        "\n",
-        "     - We dequeue (remove) the front node from the `queue`.\n",
-        "\n",
-        "     - We append the value of the dequeued node to the `level_values` list, effectively collecting the values of nodes at the current level.\n",
-        "\n",
-        "     - If the dequeued node has a left child, we enqueue the left child to the `queue`.\n",
-        "\n",
-        "     - If the dequeued node has a right child, we enqueue the right child to the `queue`.\n",
-        "\n",
-        "   - After processing all nodes at the current level, we append the `level_values` list to the `result` list. This represents the values at the current level.\n",
-        "\n",
-        "7. The loop continues until all levels have been traversed, and the `queue` becomes empty.\n",
-        "\n",
-        "8. Finally, we return the `result` list, which contains lists of node values at each level, representing the level order traversal of the binary tree.\n",
-        "\n",
-        "The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[3], [9, 20], [15, 7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "root = TreeNode(1)\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `levelOrder` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.\n",
-        "\n",
-        "In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here's how the space complexity breaks down:\n",
-        "\n",
-        "1. The `result` list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by `result` is O(N).\n",
-        "\n",
-        "2. The `queue` data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by `queue` is O(N).\n",
-        "\n",
-        "Overall, the dominant factor in terms of space complexity is the `queue`, and the space complexity is O(N).\n",
-        "\n",
-        "In summary, the function's time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reverse Level Order Traversal:** Modify the `levelOrder` function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[15, 7], [9, 20], [3]]`.\n",
-        "\n",
-        "2. **Zigzag Level Order Traversal:** Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[3], [20, 9], [15, 7]]`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb
deleted file mode 100644
index 213989d..0000000
--- a/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 104. Maximum Depth of Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `root` of a binary tree, return its maximum depth.\n",
-        "\n",
-        "A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def maxDepth(root):\n",
-        "    # Base case: If the root is None, the depth is 0.\n",
-        "    if root is None:\n",
-        "        return 0\n",
-        "    \n",
-        "    # Recursively calculate the maximum depth of the left and right subtrees.\n",
-        "    left_depth = maxDepth(root.left)\n",
-        "    right_depth = maxDepth(root.right)\n",
-        "    \n",
-        "    # Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.\n",
-        "    return max(left_depth, right_depth) + 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's go through the code step by step to understand how it works:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class to represent the nodes of the binary tree. Each node has three attributes:\n",
-        "   - `val`: the value stored in the node.\n",
-        "   - `left`: a reference to the left child node.\n",
-        "   - `right`: a reference to the right child node.\n",
-        "\n",
-        "2. The `maxDepth` function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, `root`, which is the root node of the binary tree.\n",
-        "\n",
-        "3. In the `maxDepth` function, we have a base case:\n",
-        "   - If the `root` is `None`, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.\n",
-        "\n",
-        "4. If the `root` is not `None`, we recursively calculate the maximum depth of the left and right subtrees:\n",
-        "   - We call `maxDepth` on the `root.left` to calculate the maximum depth of the left subtree and store it in the variable `left_depth`.\n",
-        "   - We call `maxDepth` on the `root.right` to calculate the maximum depth of the right subtree and store it in the variable `right_depth`.\n",
-        "\n",
-        "5. Finally, we return the maximum depth of the tree by taking the maximum of `left_depth` and `right_depth` and adding 1 to it. This is because we are counting the current level as well."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [3,9,20,null,null,15,7]\n",
-        "\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a230be4f-1f47-4919-87e3-62fc3f072d97",
-      "metadata": {},
-      "source": [
-        "In this example, we create a binary tree based on the given input `[3,9,20,null,null,15,7]` and calculate its maximum depth, which is `3`. The tree structure is as follows:\n",
-        "   ```\n",
-        "       3\n",
-        "      / \\\n",
-        "     9  20\n",
-        "       /  \\\n",
-        "      15   7\n",
-        "   ```\n",
-        "\n",
-        "So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [1,null,2]\n",
-        "\n",
-        "root = TreeNode(1)\n",
-        "root.right = TreeNode(2)\n",
-        "\n",
-        "# Calculate the maximum depth of the tree and print the result\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the `maxDepth` function is $O(N)$, where $N$ is the number of nodes in the binary tree.\n",
-        "- This is because in the worst case, the function visits every node exactly once in a depth-first manner.\n",
-        "- The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the `maxDepth` function is $O(H)$, where H is the height of the binary tree.\n",
-        "- In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.\n",
-        "- In the best case, if the binary tree is perfectly balanced, the height is $O(log\\ N)$, where $N$ is the number of nodes.\n",
-        "- Therefore, the space complexity can vary from $O(log\\ N)$ to $O(N)$ depending on the shape of the tree.\n",
-        "- In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity of the code is $O(N)$ as it visits each node once.\n",
-        "- The space complexity is $O(H)$, where H is the height of the tree, which can vary from $O(log\\ N)$ to $O(N)$ depending on the tree's shape."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
deleted file mode 100644
index 31c9e69..0000000
--- a/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb	
+++ /dev/null
@@ -1,313 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 105. Construct Binary Tree from Preorder and Inorder Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return *the binary tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= preorder.length <= 3000`\n",
-        "- `inorder.length == preorder.length`\n",
-        "- `-3000 <= preorder[i], inorder[i] <= 3000`\n",
-        "- `preorder` and `inorder` consist of **unique** values.\n",
-        "- Each value of `inorder` also appears in `preorder`.\n",
-        "- `preorder` is **guaranteed** to be the preorder traversal of the tree.\n",
-        "- `inorder` is **guaranteed** to be the inorder traversal of the tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def buildTree(preorder, inorder):\n",
-        "    if not preorder:\n",
-        "        return None\n",
-        "\n",
-        "    # The first element in the preorder traversal is the root of the current subtree\n",
-        "    root_val = preorder[0]\n",
-        "    root = TreeNode(root_val)\n",
-        "\n",
-        "    # Find the index of the root value in the inorder traversal\n",
-        "    root_idx_inorder = inorder.index(root_val)\n",
-        "\n",
-        "    # Recursively build left and right subtrees\n",
-        "    root.left = buildTree(preorder[1:1 + root_idx_inorder], inorder[:root_idx_inorder])\n",
-        "    root.right = buildTree(preorder[1 + root_idx_inorder:], inorder[root_idx_inorder + 1:])\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:`: This is a class definition for a binary tree node. It has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "   This class is used to create instances of binary tree nodes, which will be used to build the binary tree.\n",
-        "\n",
-        "2. `def buildTree(preorder, inorder):`: This is the main function that constructs a binary tree from its preorder and inorder traversals.\n",
-        "\n",
-        "   - `preorder`: A list representing the preorder traversal of the binary tree.\n",
-        "   - `inorder`: A list representing the inorder traversal of the binary tree.\n",
-        "\n",
-        "3. `if not preorder: return None`: This line checks if the `preorder` list is empty. If it is, it means there are no nodes to construct, so the function returns `None`.\n",
-        "\n",
-        "4. `root_val = preorder[0]`: The value of the root node is extracted from the first element of the `preorder` list.\n",
-        "\n",
-        "5. `root = TreeNode(root_val)`: A new `TreeNode` object is created with the `root_val` as its value. This represents the root of the current subtree.\n",
-        "\n",
-        "6. `root_idx_inorder = inorder.index(root_val)`: The index of the `root_val` in the `inorder` list is found. This index indicates the position of the root node in the inorder traversal.\n",
-        "\n",
-        "7. `root.left`: The left subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The left subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists up to the `root_idx_inorder`.\n",
-        "\n",
-        "8. `root.right`: The right subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The right subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists starting from `root_idx_inorder + 1`.\n",
-        "\n",
-        "9. Finally, the function returns the `root` of the subtree it just constructed.\n",
-        "\n",
-        "The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "2d82857b-4fbe-474f-bf33-17b55c20147b",
-      "metadata": {},
-      "source": [
-        "## Helper Function \n",
-        "\n",
-        "Here is a helper function to represent the binary tree elements."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "13e6f3e1-659d-479d-9521-75629b8c782f",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def treeToList(root):\n",
-        "    # Initialize an empty list to store the elements of the binary tree\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue for level-order traversal starting with the root\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Pop the front node from the queue\n",
-        "        node = queue.pop(0)\n",
-        "        \n",
-        "        # If the node is not None (i.e., a valid node), add its value to the result list\n",
-        "        if node:\n",
-        "            result.append(node.val)\n",
-        "            \n",
-        "            # Add the left and right children of the node to the queue\n",
-        "            queue.append(node.left)\n",
-        "            queue.append(node.right)\n",
-        "        else:\n",
-        "            # If the node is None, add None to the result to represent an empty node\n",
-        "            result.append(None)\n",
-        "\n",
-        "    # Remove any trailing None values from the result list\n",
-        "    while result and result[-1] is None:\n",
-        "        result.pop()\n",
-        "\n",
-        "    # Return the resulting list representing the binary tree elements\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86cd4c9d-a120-4dd1-a1bd-530436012574",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's break down the `treeToList` helper function step by step:\n",
-        "\n",
-        "1. `def treeToList(root):`: This function takes the root of a binary tree as input and converts it into a list.\n",
-        "\n",
-        "2. `result = []`: Initialize an empty list called `result` to store the elements of the binary tree in list format.\n",
-        "\n",
-        "3. `queue = [root]`: Initialize a queue data structure for a level-order traversal, starting with the root node.\n",
-        "\n",
-        "4. `while queue:`: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.\n",
-        "\n",
-        "5. `node = queue.pop(0)`: Dequeue the first node from the queue, effectively processing it.\n",
-        "\n",
-        "6. `if node:`: Check if the `node` is not None, which means it's a valid node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(node.val)`: If the node is valid, append its value (`node.val`) to the `result` list. This represents the value of the current node in the binary tree.\n",
-        "\n",
-        "    b. `queue.append(node.left)`: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.\n",
-        "\n",
-        "    c. `queue.append(node.right)`: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.\n",
-        "\n",
-        "7. `else:`: If the `node` is None, it represents an empty node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(None)`: Append `None` to the `result` list to indicate an empty node.\n",
-        "\n",
-        "8. `while result and result[-1] is None:`: After the traversal is complete, there might be trailing `None` values in the `result` list. This loop removes any such trailing `None` values to ensure a clean representation of the tree's elements.\n",
-        "\n",
-        "9. `return result`: Return the `result` list, which now contains the elements of the binary tree in a format where `None` represents empty nodes and the order of elements reflects a level-order traversal of the tree.\n",
-        "\n",
-        "In summary, the `treeToList` function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node's value or represents an empty node with `None`. This list represents the binary tree's elements in a structured format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[3, 9, 20, None, None, 15, 7]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "preorder = [3, 9, 20, 15, 7]\n",
-        "inorder = [9, 3, 15, 20, 7]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[-1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "preorder = [-1]\n",
-        "inorder = [-1]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `buildTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of the `buildTree` function can be analyzed in terms of the number of nodes in the binary tree. Let's assume there are `n` nodes in the binary tree.\n",
-        "\n",
-        "1. Finding the root value in the `preorder` traversal takes O(1) time as it's just extracting the first element from the list.\n",
-        "2. Finding the index of the root value in the `inorder` traversal using `inorder.index(root_val)` takes O(n) time in the worst case because in the worst case, it might have to search through all `n` elements in the `inorder` list to find the index.\n",
-        "3. The recursive calls to `buildTree` for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.\n",
-        "\n",
-        "The total time complexity of the `buildTree` function is O(n) due to the recursive calls and finding the root's index in the `inorder` list.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the space used by the function's call stack during recursion and any additional data structures used. \n",
-        "\n",
-        "1. The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.\n",
-        "\n",
-        "2. Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).\n",
-        "\n",
-        "Overall, the space complexity of the `buildTree` function is O(n) due to the space used by the call stack and the TreeNode objects.\n",
-        "\n",
-        "In summary, the time complexity of `buildTree` is O(n), and the space complexity is O(n), where 'n' is the number of nodes in the binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Construct Binary Tree from Postorder and Inorder Traversal:**\n",
-        "   Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to `buildTree` but for postorder and inorder traversals.\n",
-        "\n",
-        "2. **Reconstruct Binary Tree with Duplicate Values:**\n",
-        "   Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
deleted file mode 100644
index 59d8e7d..0000000
--- a/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 124. Binary Tree Maximum Path Sum\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n",
-        "\n",
-        "---\n",
-        "A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.\n",
-        "\n",
-        "The **path sum** of a path is the sum of the node's values in the path.\n",
-        "\n",
-        "Given the `root` of a binary tree, return *the maximum **path sum** of any **non-empty** path*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 3*10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.\n",
-        "\n",
-        "In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.\n",
-        "\n",
-        "To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:\n",
-        "\n",
-        "1. Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.\n",
-        "\n",
-        "2. Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.\n",
-        "\n",
-        "To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.\n",
-        "\n",
-        "Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.\n",
-        "\n",
-        "The constraints for this problem include:\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[1, 3 * 10^4]$.\n",
-        "- Node values are in the range [-1000, 1000].\n",
-        "\n",
-        "By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def maxPathSum(self, root):\n",
-        "        def max_path_sum_helper(node):\n",
-        "            if not node:\n",
-        "                return 0\n",
-        "            \n",
-        "            # Recursively calculate the maximum path sum for left and right subtrees\n",
-        "            left_max = max(0, max_path_sum_helper(node.left))\n",
-        "            right_max = max(0, max_path_sum_helper(node.right))\n",
-        "            \n",
-        "            # Update the global maximum path sum\n",
-        "            self.max_sum = max(self.max_sum, left_max + right_max + node.val)\n",
-        "            \n",
-        "            # Return the maximum path sum starting from the current node\n",
-        "            return max(left_max, right_max) + node.val\n",
-        "        \n",
-        "        self.max_sum = float('-inf')  # Initialize the global maximum to negative infinity\n",
-        "        max_path_sum_helper(root)  # Start the recursive traversal from the root\n",
-        "        return self.max_sum"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code starts by defining a `TreeNode` class to represent nodes in the binary tree. Each `TreeNode` has a `val` attribute representing its value, a `left` attribute pointing to the left child, and a `right` attribute pointing to the right child.\n",
-        "\n",
-        "2. Next, a `Solution` class is defined to contain the `maxPathSum` method, which will be used to find the maximum path sum in the binary tree.\n",
-        "\n",
-        "3. Within the `maxPathSum` method, a helper function called `max_path_sum_helper` is defined. This recursive function takes a single argument, `node`, which is the current node being considered during traversal.\n",
-        "\n",
-        "4. Inside the `max_path_sum_helper` function:\n",
-        "   - If `node` is `None` (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.\n",
-        "   - It calculates the maximum path sum starting from the left subtree (`left_max`) and the right subtree (`right_max`). Importantly, it uses `max(0, ...)` to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree's path sum is negative, it's better to not include it in the path.\n",
-        "   - The code then updates the global maximum path sum (`self.max_sum`) by checking if the sum of `left_max`, `right_max`, and the current node's value is greater than the current maximum.\n",
-        "   - Finally, it returns the maximum path sum starting from the current node, which is the maximum of `left_max` and `right_max` plus the current node's value.\n",
-        "\n",
-        "5. Before calling the `max_path_sum_helper` function, the `max_sum` attribute of the `Solution` class is initialized to negative infinity (`float('-inf')`). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of `max_sum`.\n",
-        "\n",
-        "6. The `max_path_sum_helper` function is called with the root of the binary tree, effectively starting the traversal from the root node.\n",
-        "\n",
-        "7. Once the traversal is complete, the method returns the value of `self.max_sum`, which contains the maximum path sum found in the binary tree.\n",
-        "\n",
-        "8. Example usage at the bottom of the code demonstrates how to create binary trees and use the `maxPathSum` method to find the maximum path sum for two different tree structures.\n",
-        "\n",
-        "In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "solution = Solution()\n",
-        "print(solution.maxPathSum(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "42\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(-10)\n",
-        "root2.left = TreeNode(9)\n",
-        "root2.right = TreeNode(20)\n",
-        "root2.right.left = TreeNode(15)\n",
-        "root2.right.right = TreeNode(7)\n",
-        "print(solution.maxPathSum(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.\n",
-        "- During the traversal, for each node, we perform constant time operations, such as updating the `max_sum` variable and calculating the maximum path sum starting from that node.\n",
-        "- Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity of the code is determined by the space used in the call stack during the recursive traversal.\n",
-        "- In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).\n",
-        "- Additionally, the code uses a constant amount of space for variables like `left_max`, `right_max`, and `max_sum`.\n",
-        "- Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it's O(N), and in the best case (a balanced binary tree), it's O(log N).\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree's balance."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Print the Maximum Path:**\n",
-        "   Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.\n",
-        "\n",
-        "2. **Path Sum Count:**\n",
-        "   Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb b/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb
deleted file mode 100644
index 55dc944..0000000
--- a/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb	
+++ /dev/null
@@ -1,257 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 199. Binary Tree Right Side View\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Right Side View problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-right-side-view/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return *the values of the nodes you can see ordered from top to bottom*.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def rightSideView(root):\n",
-        "    if not root:\n",
-        "        return []  # If the tree is empty, return an empty list.\n",
-        "\n",
-        "    result = []  # Initialize a list to store the right side view values.\n",
-        "    queue = [root]  # Initialize a queue for level-order traversal with the root node.\n",
-        "\n",
-        "    while queue:\n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Traverse all nodes at the current level and add the rightmost node to the result.\n",
-        "        for i in range(level_size):\n",
-        "            node = queue.pop(0)  # Dequeue the first node from the queue.\n",
-        "\n",
-        "            # If it's the rightmost node at this level, add its value to the result.\n",
-        "            if i == level_size - 1:\n",
-        "                result.append(node.val)\n",
-        "\n",
-        "            # Add the children of the current node to the queue.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "    return result  # Return the list of right side view values.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with a binary tree represented using a TreeNode class. Each node has a value (`val`) and can have a left child (`left`) and a right child (`right`).\n",
-        "\n",
-        "2. The `rightSideView` function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.\n",
-        "\n",
-        "3. We check if the `root` is `None`, which means the tree is empty. If it's empty, we return an empty list because there are no nodes to see.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the right side view values.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue is used for a level-order traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside this loop, we perform the following steps for each level of the tree:\n",
-        "\n",
-        "   a. We determine the number of nodes at the current level by getting the length of the `queue`. This is important for processing nodes at the same level together.\n",
-        "\n",
-        "   b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the `queue` using `queue.pop(0)`.\n",
-        "\n",
-        "   c. If the node we dequeue is the rightmost node at the current level (determined by `i == level_size - 1`), we add its `val` to the `result` list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.\n",
-        "\n",
-        "   d. We enqueue the left and right children of the current node (if they exist) to the `queue`. This ensures that we process the next level in the subsequent iterations of the while loop.\n",
-        "\n",
-        "7. After processing all levels of the tree, the `result` list contains the values of the rightmost nodes in each level, ordered from top to bottom.\n",
-        "\n",
-        "8. Finally, we return the `result` list as the output of the function, which represents the right side view of the binary tree.\n",
-        "\n",
-        "The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3, 4]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "root1.left.right = TreeNode(5)\n",
-        "root1.right.right = TreeNode(4)\n",
-        "print(rightSideView(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "print(rightSideView(root2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = rightSideView(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here's why:\n",
-        "\n",
-        "1. We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.\n",
-        "\n",
-        "2. For each node, we perform constant-time operations like dequeuing it from the queue, checking if it's the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is also O(N). Here's why:\n",
-        "\n",
-        "1. We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).\n",
-        "\n",
-        "2. The `result` list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the `result` list is also O(N).\n",
-        "\n",
-        "3. Other auxiliary variables like `level_size`, `i`, and `node` require only constant space and do not depend on the size of the tree.\n",
-        "\n",
-        "Combining the space used by the queue and the `result` list, we get a space complexity of O(N).\n",
-        "\n",
-        "In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Variant with Left Side View**: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.\n",
-        "\n",
-        "2. **Zigzag Right Side View**: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb b/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb
deleted file mode 100644
index 8ea4609..0000000
--- a/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb	
+++ /dev/null
@@ -1,223 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 226: Invert Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the root of a binary tree, invert the tree, and return its root.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range `[0, 100]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def invertTree(root):\n",
-        "    # Base case: If the root is None or the tree is empty, return None.\n",
-        "    if not root:\n",
-        "        return None\n",
-        "\n",
-        "    # Swap the left and right subtrees of the current node.\n",
-        "    root.left, root.right = root.right, root.left\n",
-        "\n",
-        "    # Recursively invert the left and right subtrees.\n",
-        "    invertTree(root.left)\n",
-        "    invertTree(root.right)\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `invertTree` function is defined to invert the binary tree. It takes the root node of the tree as an argument.\n",
-        "\n",
-        "3. In the `invertTree` function, we have a base case to handle the scenario when the root is `None` (empty tree). In such cases, we return `None` because there's nothing to invert.\n",
-        "\n",
-        "4. For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.\n",
-        "\n",
-        "5. We then recursively call `invertTree` on the left and right subtrees to invert them.\n",
-        "\n",
-        "6. Finally, we return the root of the inverted tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 1): <__main__.TreeNode object at 0x270c9c0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [4,2,7,1,3,6,9]\n",
-        "\n",
-        "root1 = TreeNode(4)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(7)\n",
-        "root1.left.left = TreeNode(1)\n",
-        "root1.left.right = TreeNode(3)\n",
-        "root1.right.left = TreeNode(6)\n",
-        "root1.right.right = TreeNode(9)\n",
-        "\n",
-        "inverted_root1 = invertTree(root1)\n",
-        "print(\"Inverted Tree (Example 1):\", inverted_root1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inorder Traversal of Inverted Tree (Example 2): <__main__.TreeNode object at 0x2255fc0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [2,1,3]\n",
-        "\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "\n",
-        "inverted_root2 = invertTree(root2)\n",
-        "print(\"Inverted Tree (Example 2):\", inverted_root2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 3): None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: root = []\n",
-        "\n",
-        "root3 = None  # Empty tree\n",
-        "\n",
-        "inverted_root3 = invertTree(root3)\n",
-        "print(\"Inverted Tree (Example 3):\", inverted_root3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the provided Python code to invert a binary tree.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the `invertTree` function is $O(n)$, where $n$ is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.\n",
-        "\n",
-        "The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is $O(h)$, where $h$ is the height of the binary tree. \n",
-        "\n",
-        "In a completely unbalanced binary tree (essentially a linked list), the height $h$ is equal to the number of nodes $n$, resulting in a space complexity of $O(n)$. This occurs when the tree is skewed to one side.\n",
-        "\n",
-        "In a balanced binary tree, such as a full binary tree, the height $h$ is $O(log\\ n)$, and the space complexity is $O(log\\ n)$.\n",
-        "\n",
-        "The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to $O(log\\ n)$.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- Time Complexity: $O(n)$ where $n$ is the number of nodes.\n",
-        "- Space Complexity: $O(h)$, where $h$ is the height of the binary tree. In the worst case, it can be $O(n)$, and in a balanced tree, it is $O(log\\ n)$.\n",
-        "\n",
-        "Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with $O(1)$ space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb b/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb
deleted file mode 100644
index 673ced2..0000000
--- a/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 230. Kth Smallest Element in a BST\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Smallest Element in a BST problem on LeetCode, click here!](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary search tree, and an integer `k`, return *the $k^{th}$ smallest value (**1-indexed**) of all the values of the nodes in the tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is `n`.\n",
-        "- 1 <= `k <= n` <= $10^4$\n",
-        "- 0 <= `Node.val` <= $10^4$\n",
-        "\n",
-        "**Follow up**: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def kthSmallest(root, k):\n",
-        "    stack = []  # Initialize an empty stack to simulate the traversal\n",
-        "    while root or stack:\n",
-        "        while root:\n",
-        "            stack.append(root)  # Push the current node onto the stack\n",
-        "            root = root.left  # Move to the left child\n",
-        "        root = stack.pop()  # Pop a node from the stack\n",
-        "        k -= 1  # Decrement k since we've visited a node\n",
-        "        if k == 0:\n",
-        "            return root.val  # If k becomes 0, return the current node's value as the kth smallest\n",
-        "        root = root.right  # Move to the right child to continue the traversal"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in the binary search tree (BST). Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `kthSmallest` function takes two parameters: `root`, which is the root of the BST, and `k`, which represents the kth smallest element we want to find.\n",
-        "\n",
-        "3. We initialize an empty stack (`stack`) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.\n",
-        "\n",
-        "4. We enter a while loop that continues until either `root` becomes `None` (indicating we have traversed the entire tree) or the `stack` is empty.\n",
-        "\n",
-        "5. Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the `stack` and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.\n",
-        "\n",
-        "6. Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the `stack` one by one. As we pop each node, we decrement `k` by 1 to keep track of the number of nodes we have visited.\n",
-        "\n",
-        "7. If `k` becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the `val` of the current node as the result.\n",
-        "\n",
-        "8. If `k` is still greater than 0, it means we haven't found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.\n",
-        "\n",
-        "9. The process continues until we find the kth smallest element or traverse the entire tree.\n",
-        "\n",
-        "10. Finally, we return the kth smallest element found.\n",
-        "\n",
-        "The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: root = [3,1,4,null,2], k = 1\n",
-        "root1 = TreeNode(3)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(4)\n",
-        "root1.left.right = TreeNode(2)\n",
-        "k1 = 1\n",
-        "print(kthSmallest(root1, k1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(3)\n",
-        "root2.right = TreeNode(6)\n",
-        "root2.left.left = TreeNode(2)\n",
-        "root2.left.right = TreeNode(4)\n",
-        "root2.left.left.left = TreeNode(1)\n",
-        "k2 = 3\n",
-        "print(kthSmallest(root2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is O(h + k), where:\n",
-        "- h is the height of the binary search tree (BST).\n",
-        "- k is the desired kth smallest element we want to find.\n",
-        "\n",
-        "1. In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).\n",
-        "\n",
-        "2. In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).\n",
-        "\n",
-        "So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.\n",
-        "\n",
-        "1. In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.\n",
-        "\n",
-        "2. In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.\n",
-        "\n",
-        "So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.\n",
-        "\n",
-        "In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Largest Element**: Modify the code to find the kth largest element in the BST instead of the kth smallest element.\n",
-        "\n",
-        "2. **Kth Smallest Element in Two BSTs**: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
deleted file mode 100644
index 666bcd9..0000000
--- a/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 235. Lowest Common Ancestor of a Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.\n",
-        "\n",
-        "According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes `p` and `q` as the lowest node in `T` that has both `p` and `q` as descendants (where we allow **a node to be a descendant of itself**).”\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[2, 10^5]$.\n",
-        "- $-10^9$ <= `Node.val` <= $10^9$\n",
-        "- All `Node.val` are **unique**.\n",
-        "- `p != q`\n",
-        "- `p` and `q` will exist in the BST.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def lowestCommonAncestor(root, p, q):\n",
-        "    # Ensure p is less than q\n",
-        "    if p.val > q.val:\n",
-        "        p, q = q, p\n",
-        "\n",
-        "    while root:\n",
-        "        # If the current node value is greater than both p and q, move left\n",
-        "        if root.val > q.val:\n",
-        "            root = root.left\n",
-        "        # If the current node value is less than both p and q, move right\n",
-        "        elif root.val < p.val:\n",
-        "            root = root.right\n",
-        "        # If the current node value is between p and q (inclusive), or it matches either p or q, it's the LCA\n",
-        "        else:\n",
-        "            return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:` defines a simple class for representing nodes in a binary tree. Each `TreeNode` has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "2. `def lowestCommonAncestor(root, p, q):` is a function that takes three arguments:\n",
-        "   - `root`: The root node of the BST.\n",
-        "   - `p`: A TreeNode representing one of the nodes for which we want to find the LCA.\n",
-        "   - `q`: A TreeNode representing the other node for which we want to find the LCA.\n",
-        "\n",
-        "3. `if p.val > q.val:` checks if the value of `p` is greater than the value of `q`. In a BST, it's essential to ensure that `p` represents the smaller value, and `q` represents the larger value. If `p` is greater than `q`, the code swaps their values.\n",
-        "\n",
-        "4. The main logic is inside the `while` loop, which runs until `root` becomes `None`. It performs the following steps to find the LCA:\n",
-        "   - If the current `root` node's value is greater than the value of `q`, it means both `p` and `q` are on the left subtree of the current node. So, we move to the left child of the current node by setting `root = root.left`.\n",
-        "   - If the current `root` node's value is less than the value of `p`, it means both `p` and `q` are on the right subtree of the current node. So, we move to the right child of the current node by setting `root = root.right`.\n",
-        "   - If neither of the above conditions is met, it means the current `root` node's value is between `p` and `q`, or it matches either `p` or `q`. In this case, the current node is the lowest common ancestor (LCA), so we return `root`.\n",
-        "\n",
-        "The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of `p`, `q`, and the current `root` node. Eventually, it reaches the LCA node, and that node is returned as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(6)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(8)\n",
-        "root.left.left = TreeNode(0)\n",
-        "root.left.right = TreeNode(4)\n",
-        "root.right.left = TreeNode(7)\n",
-        "root.right.right = TreeNode(9)\n",
-        "root.left.right.left = TreeNode(3)\n",
-        "root.left.right.right = TreeNode(5)\n",
-        "\n",
-        "p = root.left  # Node 2\n",
-        "q = root.right  # Node 8\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "p = root.left  # Node 2\n",
-        "q = root.left.right  # Node 4\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "\n",
-        "p = root2  # Node 2\n",
-        "q = root2.left  # Node 1\n",
-        "\n",
-        "result = lowestCommonAncestor(root2, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this algorithm is O(h), where \"h\" is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where \"n\" is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).\n",
-        "\n",
-        "The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes `p` and `q`. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are `root`, `p`, and `q`, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.\n",
-        "\n",
-        "**In summary**, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where \"h\" is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "### Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple LCAs:** Extend the algorithm to find all the lowest common ancestors of two given nodes `p` and `q` in a BST. In some cases, there can be multiple LCAs.\n",
-        "\n",
-        "2. **LCA with k Nodes:** Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
deleted file mode 100644
index 75c48ea..0000000
--- a/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb	
+++ /dev/null
@@ -1,297 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 297. Serialize and Deserialize Binary Tree\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.\n",
-        "\n",
-        "Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.\n",
-        "\n",
-        "**Clarification:** The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.\n",
-        "\n",
-        "In the context of this problem:\n",
-        "\n",
-        "1. **Serialization**: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.\n",
-        "\n",
-        "2. **Deserialization**: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.\n",
-        "\n",
-        "Here are some key points to consider in solving this problem:\n",
-        "\n",
-        "- The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].\n",
-        "- You don't necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.\n",
-        "- The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.\n",
-        "\n",
-        "A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode(object):\n",
-        "    def __init__(self, x):\n",
-        "        self.val = x\n",
-        "        self.left = None\n",
-        "        self.right = None\n",
-        "\n",
-        "class Codec:\n",
-        "    def serialize(self, root):\n",
-        "        serialized  = []\n",
-        "\n",
-        "        def dfs(node):\n",
-        "            if not node:\n",
-        "                # If the node is None, represent it as \"Null\" in the serialized string\n",
-        "                serialized .append(\"Null\")\n",
-        "                return\n",
-        "            # Convert the node's value to a string and add it to the serialized string\n",
-        "            serialized .append(str(node.val))\n",
-        "            dfs(node.left)\n",
-        "            dfs(node.right)\n",
-        "\n",
-        "        dfs(root)\n",
-        "        # Join the serialized values with \",\"\n",
-        "        return \",\".join(serialized )\n",
-        "\n",
-        "    def deserialize(self, data):\n",
-        "        vals = data.split(\",\")\n",
-        "        self.i = 0\n",
-        "\n",
-        "        def dfs():\n",
-        "            if vals[self.i] == \"Null\":\n",
-        "                self.i += 1\n",
-        "                return None\n",
-        "            # Convert the value to an integer to create a new node\n",
-        "            node = TreeNode(int(vals[self.i]))\n",
-        "            self.i += 1\n",
-        "            node.left = dfs()\n",
-        "            node.right = dfs()\n",
-        "            return node\n",
-        "\n",
-        "        return dfs()"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. **Definition of TreeNode**:\n",
-        "   - The code defines a simple `TreeNode` class that represents a node in a binary tree. Each `TreeNode` has three attributes:\n",
-        "     - `val`: The integer value stored in the node.\n",
-        "     - `left`: A reference to the left child node (or None if there is no left child).\n",
-        "     - `right`: A reference to the right child node (or None if there is no right child).\n",
-        "   - This class allows you to create binary tree nodes with integer values and left and right child references.\n",
-        "\n",
-        "2. **Serialization (serialize method)**:\n",
-        "   - The `serialize` method takes a `root` node as input, which is the root of the binary tree that needs to be serialized.\n",
-        "   - It initializes an empty list `serialized` to store the serialized elements.\n",
-        "   - The `dfs` (depth-first search) function is defined within the `serialize` method to perform a preorder traversal of the binary tree.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current `node` is `None` (i.e., a leaf node or a child of a leaf node), it appends the string \"Null\" to the `serialized` list to represent the absence of a node.\n",
-        "     - If the current `node` is not `None`, it appends the string representation of the `node.val` to the `serialized` list and then recursively calls `dfs` on the left and right children.\n",
-        "   - After the `dfs` traversal, the `serialized` list contains the serialized binary tree elements.\n",
-        "   - The method returns a string obtained by joining the elements in the `serialized` list with commas.\n",
-        "\n",
-        "3. **Deserialization (deserialize method)**:\n",
-        "   - The `deserialize` method takes a serialized string `data` as input, which represents a binary tree in the custom format.\n",
-        "   - It splits the `data` string by commas to obtain a list of elements called `vals`.\n",
-        "   - The method initializes an index `self.i` to 0. This index keeps track of the current position in the `vals` list during deserialization.\n",
-        "   - The `dfs` function is defined within the `deserialize` method to perform the deserialization process using a recursive approach.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current element in `vals` is \"Null,\" it means there is no node at this position in the binary tree, so it returns `None`.\n",
-        "     - If the current element is not \"Null,\" it converts the element to an integer to create a new `TreeNode` with that value.\n",
-        "     - It then recursively calls `dfs` to set the left and right children of the current node.\n",
-        "   - The method returns the root node of the reconstructed binary tree.\n",
-        "\n",
-        "Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1,2,Null,Null,3,4,Null,Null,5,Null,Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = TreeNode(1)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(3)\n",
-        "root.right.left = TreeNode(4)\n",
-        "root.right.right = TreeNode(5)\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = None\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:\n",
-        "\n",
-        "1. **Serialization (serialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `serialize` method uses a depth-first traversal (preorder) of the binary tree.\n",
-        "     - It visits each node exactly once.\n",
-        "     - At each node, it performs constant-time operations (string conversion and list append).\n",
-        "     - Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for serialization includes the space used by the `serialized` list and the recursive call stack.\n",
-        "     - The `serialized` list stores the serialized elements, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "2. **Deserialization (deserialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `deserialize` method splits the serialized string into a list of elements, which takes O(N) time.\n",
-        "     - The `dfs` function is a recursive function that visits each element in the list exactly once.\n",
-        "     - At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).\n",
-        "     - Therefore, the time complexity for deserialization is O(N).\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for deserialization includes the space used by the `vals` list and the recursive call stack.\n",
-        "     - The `vals` list stores the elements from the serialized string, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Efficient Serialization**:\n",
-        "   Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.\n",
-        "\n",
-        "2. **Custom Serialization Format**:\n",
-        "   Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb b/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb
deleted file mode 100644
index 8a41c3b..0000000
--- a/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb	
+++ /dev/null
@@ -1,265 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 572: Subtree of Another Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Subtree of Another Tree problem on LeetCode, click here!](https://leetcode.com/problems/subtree-of-another-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "**Problem Description:**\n",
-        "\n",
-        "Given the roots of two binary trees `root` and `subRoot`, return `True` if there is a subtree of `root` with the same structure and node values as `subRoot`, and `False` otherwise.\n",
-        "\n",
-        "A subtree of a binary tree `tree` is a tree that consists of a node in `tree` and all of this node's descendants. The tree `tree` could also be considered as a subtree of itself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "1. The number of nodes in the `root` tree is in the range $[1, 2000]$.\n",
-        "2. The number of nodes in the `subRoot` tree is in the range $[1, 1000]$.\n",
-        "3. $-10^4$ <= root.val <= $10^4$\n",
-        "4. $-10^4$ <= subRoot.val <= $10^4$\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def isSubtree(self, root, subRoot):\n",
-        "        if not root:\n",
-        "            return False\n",
-        "        \n",
-        "        # Check if the current subtree is equal to the subRoot\n",
-        "        if self.isSameTree(root, subRoot):\n",
-        "            return True\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees\n",
-        "        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)\n",
-        "    \n",
-        "    def isSameTree(self, tree1, tree2):\n",
-        "        if not tree1 and not tree2:\n",
-        "            return True\n",
-        "        if not tree1 or not tree2:\n",
-        "            return False\n",
-        "        \n",
-        "        return (\n",
-        "            tree1.val == tree2.val and\n",
-        "            self.isSameTree(tree1.left, tree2.left) and\n",
-        "            self.isSameTree(tree1.right, tree2.right)\n",
-        "        )"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:\n",
-        "\n",
-        "1. `isSubtree`: This method checks if there is a subtree of the `root` tree with the same structure and node values as the `subRoot` tree. It uses a helper function `isSameTree` to compare two trees for equality.\n",
-        "\n",
-        "2. `isSameTree`: This helper method recursively compares two trees to check if they are the same in structure and node values.\n",
-        "\n",
-        "### Here's a detailed explanation of the code:\n",
-        "\n",
-        "1. **TreeNode Class:**\n",
-        "\n",
-        "The `TreeNode` class is defined to represent nodes in a binary tree. Each node has a `val` (the node's value) and may have a `left` and `right` child.\n",
-        "\n",
-        "2. **Solution Class:**\n",
-        "\n",
-        "    + The `Solution` class contains the solution for the problem and defines two important methods:\n",
-        "\n",
-        "    + `isSubtree(self, root, subRoot)`:\n",
-        "\n",
-        "        - This method checks whether `subRoot` is a subtree of `root`. It takes two tree nodes, `root` and `subRoot`, as input arguments.\n",
-        "        - If `root` is `None`, it returns `False` because there is no subtree to search.\n",
-        "        - It then checks if the current subtree with `root` as its root is equal to `subRoot` using the `isSameTree` method. If they are the same, it returns `True`.\n",
-        "        - If the current subtree is not the same as `subRoot`, it recursively checks the left and right subtrees of `root` to see if `subRoot` is a subtree of any of them.\n",
-        "        - It returns `True` if `subRoot` is found in either the left or right subtree; otherwise, it returns `False`.\n",
-        "\n",
-        "    + `isSameTree(self, tree1, tree2)`:\n",
-        "\n",
-        "        - This method checks whether two trees, `tree1` and `tree2`, are the same.\n",
-        "        - If both `tree1` and `tree2` are `None`, they are considered the same tree, so it returns `True`.\n",
-        "        - If only one of them is `None` (but not both), they are different trees, so it returns `False`.\n",
-        "        - If both `tree1` and `tree2` have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.\n",
-        "        - It returns `True` if the trees are the same; otherwise, it returns `False`.\n",
-        "\n",
-        "The code effectively uses recursion to traverse the binary trees and check for subtree equality. The `isSubtree` method starts the recursive search, and the `isSameTree` method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.\n",
-        "\n",
-        "This solution allows you to determine if there exists a subtree within the `root` tree that matches the structure and node values of `subRoot`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? True\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2]\n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? False\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2,null,null,null,null,0] \n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "root.left.right.left = TreeNode(0)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86a34f0d-0789-498c-818c-2d30f84754d0",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code for the \"Subtree of Another Tree\" problem:\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the `isSubtree` and `isSameTree` functions, we visit each node in the binary trees once. Let's break down the time complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - In the worst case, we need to visit every node in the `root` tree.\n",
-        "   - For each node in the `root` tree, we call the `isSameTree` function, which has its own traversal.\n",
-        "   - So, the total time complexity is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - In the worst case, we visit every node in both `tree1` and `tree2`.\n",
-        "   - The number of recursive calls made is proportional to the number of nodes in the trees.\n",
-        "   - So, the time complexity of this function is $O(max(n, m))$, where $n$ and $m$ are the numbers of nodes in `tree1` and `tree2`, respectively.\n",
-        "\n",
-        "Overall, the time complexity of the entire code is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree. In practice, it may be less than $O(n * m)$ if a subtree mismatch is detected early during the traversal.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let's analyze the space complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - It uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `root` tree, which can be $O(n)$ in the worst case (unbalanced tree).\n",
-        "   - Additionally, the function doesn't use any significant extra space other than the recursion stack.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - It also uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `tree1` or `tree2`, whichever is greater.\n",
-        "   - So, the maximum space used for the call stack is $O(max(n, m))$.\n",
-        "\n",
-        "In summary, the space complexity of the code is $O(max(n, m))$ due to the function call stack. It scales with the maximum height of the trees being compared.\n",
-        "\n",
-        "Overall, the code is efficient and works well for trees with moderate sizes. However, it's important to keep in mind that the worst-case time complexity is $O(n * m)$, so for very large trees, the performance may degrade."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb b/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb
deleted file mode 100644
index ad86882..0000000
--- a/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 98. Validate Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Validate Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/validate-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, *determine if it is a valid binary search tree (BST)*.\n",
-        "\n",
-        "A **valid BST** is defined as follows:\n",
-        "\n",
-        "- The left subtree of a node contains only nodes with keys **less than** the node's key.\n",
-        "- The right subtree of a node contains only nodes with keys **greater than** the node's key.\n",
-        "- Both the left and right subtrees must also be binary search trees. \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 10^4]$.\n",
-        "- $-2^{31}$ <= `Node.val` <= $2^{31} - 1$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def is_valid_BST(root):\n",
-        "    def is_valid(node, min_val, max_val):\n",
-        "        # Base case: If the node is None, it's a valid BST.\n",
-        "        if node is None:\n",
-        "            return True\n",
-        "        \n",
-        "        # Check if the current node's value is within the valid range.\n",
-        "        if not (min_val < node.val < max_val):\n",
-        "            return False\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees with updated ranges.\n",
-        "        return (is_valid(node.left, min_val, node.val) and\n",
-        "                is_valid(node.right, node.val, max_val))\n",
-        "    \n",
-        "    # Call the helper function starting with a wide range for root node.\n",
-        "    return is_valid(root, float('-inf'), float('inf'))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- It defines a `TreeNode` class to represent nodes in the binary tree.\n",
-        "\n",
-        "- The `is_valid_BST` function takes the root node of the binary tree as input and returns `True` if the tree is a valid BST, and `False` otherwise.\n",
-        "\n",
-        "- Inside the `is_valid_BST` function, there is a helper function called `is_valid` that performs the actual validation using a recursive approach.\n",
-        "\n",
-        "- The `is_valid` function checks each node in the tree to ensure that it satisfies the properties of a BST:\n",
-        "  - The value of the current node must be within a valid range defined by `min_val` and `max_val`.\n",
-        "  - The left subtree of the current node should contain values less than the current node's value.\n",
-        "  - The right subtree of the current node should contain values greater than the current node's value.\n",
-        "\n",
-        "- If any of these conditions are violated, the function returns `False`, indicating that the tree is not a valid BST.\n",
-        "\n",
-        "- If all nodes satisfy these conditions, the function returns `True`, indicating that the tree is a valid BST.\n",
-        "\n",
-        "- The code calls the `is_valid` function with the root node and initial range values of negative infinity to positive infinity to start the validation.\n",
-        "\n",
-        "- The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.\n",
-        "\n",
-        "- The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.\n",
-        "\n",
-        "In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node's value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: [2, 1, 3]\n",
-        "root1 = TreeNode(2)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(3)\n",
-        "print(is_valid_BST(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: [5, 1, 4, None, None, 3, 6]\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(4)\n",
-        "root2.right.left = TreeNode(3)\n",
-        "root2.right.right = TreeNode(6)\n",
-        "print(is_valid_BST(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `is_valid_BST` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the function primarily depends on the number of nodes in the binary tree.\n",
-        "- In the worst case, we may have to visit every node in the tree once to validate whether it's part of a valid BST.\n",
-        "- Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the recursive call stack during the DFS traversal.\n",
-        "- In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.\n",
-        "- In a balanced BST, the height is approximately log2(N), where N is the number of nodes.\n",
-        "- Therefore, the space complexity of the call stack is O(log N) for a balanced BST.\n",
-        "- In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.\n",
-        "\n",
-        "**Overall:**\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.\n",
-        "\n",
-        "The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Complex Constraints**: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like \"The left subtree of a node contains only nodes with keys less than or equal to the node's key,\" and \"The right subtree of a node contains only nodes with keys greater than or equal to the node's key.\" How would you adapt the code to handle these constraints?\n",
-        "\n",
-        "2. **Handling Duplicates**: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/07. Trees/README.md b/_build/html/_sources/07. Trees/README.md
deleted file mode 100644
index 1eba5d4..0000000
--- a/_build/html/_sources/07. Trees/README.md	
+++ /dev/null
@@ -1,26 +0,0 @@
-# Trees Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb
deleted file mode 100644
index 9da2a17..0000000
--- a/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 208. Implement Trie (Prefix Tree)\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Implement Trie problem on LeetCode, click here!](https://leetcode.com/problems/implement-trie-prefix-tree/)\n",
-        "\n",
-        "---\n",
-        "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.\n",
-        "\n",
-        "Implement the Trie class:\n",
-        "\n",
-        "- `Trie()` Initializes the trie object.\n",
-        "- `void insert(String word)` Inserts the string `word` into the trie.\n",
-        "- `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.\n",
-        "- `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length, prefix.length <= 2000`\n",
-        "- `word` and `prefix` consist only of lowercase English letters.\n",
-        "- At most $3 * 10^4$ calls in total will be made to `insert`, `search`, and `startsWith`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to implement a data structure known as a Trie (pronounced \"try\") or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It's particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:\n",
-        "\n",
-        "1. `Trie()`: This is the constructor that initializes the Trie object.\n",
-        "\n",
-        "2. `void insert(String word)`: This method inserts the given string `word` into the Trie. It effectively adds the characters of the word to the Trie's structure, creating nodes for each character if they don't already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.\n",
-        "\n",
-        "3. `boolean search(String word)`: This method checks if the given string `word` is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns `true`, indicating that the word exists in the Trie; otherwise, it returns `false`.\n",
-        "\n",
-        "4. `boolean startsWith(String prefix)`: This method checks if there is any previously inserted word in the Trie that has the given `prefix`. It's similar to the `search` method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns `true`; otherwise, it returns `false`.\n",
-        "\n",
-        "The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.\n",
-        "\n",
-        "In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}           # A dictionary to store child nodes\n",
-        "        self.is_end_of_word = False  # Indicates if a word ends at this node\n",
-        "\n",
-        "class Trie:\n",
-        "    def __init__(self):\n",
-        "        self.root = TrieNode()       # Initialize the Trie with a root node\n",
-        "\n",
-        "    def insert(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                node.children[char] = TrieNode()  # Create a new node if the character is not present\n",
-        "            node = node.children[char]           # Move to the child node\n",
-        "        node.is_end_of_word = True                # Mark the end of the inserted word\n",
-        "\n",
-        "    def search(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, the word is not in the Trie\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return node.is_end_of_word    # Check if the node represents the end of a valid word\n",
-        "\n",
-        "    def startsWith(self, prefix):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in prefix:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, no word starts with the prefix\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return True                  # Prefix found in the Trie"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's explain how the code works step by step:\n",
-        "\n",
-        "1. `TrieNode` Class:\n",
-        "   - `TrieNode` is a class that represents nodes in the Trie. Each node has two attributes:\n",
-        "     - `children`: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.\n",
-        "     - `is_end_of_word`: This boolean flag indicates whether the node represents the end of a complete word. Initially, it's set to `False` for all nodes.\n",
-        "\n",
-        "2. `Trie` Class:\n",
-        "   - `Trie` is the main class that implements the Trie data structure. It has the following methods:\n",
-        "\n",
-        "   - `__init__(self)`: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.\n",
-        "\n",
-        "   - `insert(self, word)`: This method inserts a string `word` into the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not present as a child node, it creates a new node for that character.\n",
-        "     - It then moves to the child node and continues the process until the entire word is inserted.\n",
-        "     - Finally, it sets the `is_end_of_word` flag to `True` for the last node to mark the end of the inserted word.\n",
-        "\n",
-        "   - `search(self, word)`: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not found as a child node, it immediately returns `False` because the word is not in the Trie.\n",
-        "     - It continues to move to the child node for each character.\n",
-        "     - After reaching the end of the word, it checks if the `is_end_of_word` flag is `True` for the last node to confirm the presence of the word.\n",
-        "\n",
-        "   - `startsWith(self, prefix)`: This method checks if there is any previously inserted word in the Trie that starts with a given `prefix`. It follows the same logic as the `search` method but does not require the entire word to be present.\n",
-        "     - If the prefix is found in the Trie, it returns `True`; otherwise, it returns `False`.\n",
-        "\n",
-        "3. Example Usage:\n",
-        "   - The code demonstrates how to create a Trie object, insert words (\"apple\" and \"app\"), and perform operations on the Trie:\n",
-        "     - It inserts the word \"apple\" into the Trie.\n",
-        "     - It checks if \"apple\" is in the Trie, which returns `True`.\n",
-        "     - It checks if \"app\" is in the Trie, which returns `False`.\n",
-        "     - It checks if there is any word in the Trie that starts with \"app,\" which returns `True`.\n",
-        "     - It inserts the word \"app\" into the Trie.\n",
-        "     - It checks if \"app\" is in the Trie again, which now returns `True`.\n",
-        "\n",
-        "In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n",
-            "False\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "trie = Trie()\n",
-        "trie.insert(\"apple\")\n",
-        "print(trie.search(\"apple\"))   # Output: True\n",
-        "print(trie.search(\"app\"))     # Output: False\n",
-        "print(trie.startsWith(\"app\")) # Output: True\n",
-        "trie.insert(\"app\")\n",
-        "print(trie.search(\"app\"))     # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the Trie implementation:\n",
-        "\n",
-        "1. Time Complexity:\n",
-        "   - Insertion (`insert` method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.\n",
-        "   - Search (`search` method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.\n",
-        "   - Starts with (`startsWith` method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.\n",
-        "\n",
-        "   Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.\n",
-        "\n",
-        "2. Space Complexity:\n",
-        "   - The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.\n",
-        "   - Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.\n",
-        "\n",
-        "   In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.\n",
-        "\n",
-        "In summary:\n",
-        "- Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.\n",
-        "- Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Count Prefixes**:\n",
-        "   Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.\n",
-        "\n",
-        "2. **Auto-Complete Suggestions**:\n",
-        "   Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb
deleted file mode 100644
index 2de472c..0000000
--- a/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb	
+++ /dev/null
@@ -1,275 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 211. Design Add and Search Words Data Structure\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Design Add and Search Words Data Structure problem on LeetCode, click here!](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n",
-        "\n",
-        "---\n",
-        "Design a data structure that supports adding new words and finding if a string matches any previously added string.\n",
-        "\n",
-        "Implement the `WordDictionary` class:\n",
-        "\n",
-        "- `WordDictionary()` Initializes the object.\n",
-        "- `void addWord(word)` Adds `word` to the data structure, it can be matched later.\n",
-        "- `bool search(word)` Returns `true` if there is any string in the data structure that matches `word` or `false` otherwise. `word` may contain dots `'.'` where dots can be matched with any letter.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length <= 25`\n",
-        "- `word` in `addWord` consists of lowercase English letters.\n",
-        "- `word` in `search` consist of `'.'` or lowercase English letters.\n",
-        "- There will be at most `2` dots in `word` for `search` queries.\n",
-        "- At most $10^4$ calls will be made to `addWord` and `search`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to design a data structure called `WordDictionary` that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot ('.') can match any letter.\n",
-        "\n",
-        "Here are the specific requirements and explanations for the problem:\n",
-        "\n",
-        "1. Initialize the `WordDictionary` object using the constructor `WordDictionary()`.\n",
-        "\n",
-        "2. The `addWord(word)` method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.\n",
-        "\n",
-        "3. The `search(word)` method allows you to search for a word in the data structure. This method returns `True` if there is any string in the data structure that matches the given word or `False` otherwise. The word you are searching for may contain dots ('.'), where each dot can match any letter.\n",
-        "\n",
-        "4. The wildcard character ('.') in the `search` method allows for partial or fuzzy searching. For example, if the word dictionary contains the words \"bad,\" \"dad,\" and \"mad,\" then:\n",
-        "   - Searching for \"pad\" should return `False` because there is no exact match.\n",
-        "   - Searching for \"bad\" should return `True` because \"bad\" is in the dictionary.\n",
-        "   - Searching for \".ad\" should return `True` because it can match \"bad,\" \"dad,\" or \"mad.\"\n",
-        "   - Searching for \"b..\" should return `True` because it can match \"bad,\" \"bed,\" \"bet,\" etc.\n",
-        "\n",
-        "5. The problem specifies that there will be at most two dots ('.') in search queries, and there will be at most 10^4 calls to both `addWord` and `search`.\n",
-        "\n",
-        "In summary, you need to implement the `WordDictionary` class that efficiently supports adding words and searching for words, where the search can include wildcard characters ('.') that match any letter.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        # Initialize a TrieNode with children and a flag to indicate the end of a word.\n",
-        "        self.children = {}\n",
-        "        self.is_end_of_word = False\n",
-        "\n",
-        "class WordDictionary:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize the WordDictionary with a root node.\n",
-        "        self.root = TrieNode()\n",
-        "\n",
-        "    def addWord(self, word: str) -> None:\n",
-        "        node = self.root\n",
-        "        # Iterate through the characters in the word.\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                # Create a new node for the character if it doesn't exist.\n",
-        "                node.children[char] = TrieNode()\n",
-        "            # Move to the next node.\n",
-        "            node = node.children[char]\n",
-        "        # Mark the end of the word by setting the flag to True.\n",
-        "        node.is_end_of_word = True\n",
-        "\n",
-        "    def search_helper(self, node: TrieNode, word: str) -> bool:\n",
-        "        if not word:\n",
-        "            # If there are no characters left in the word, check if we reached the end of a word in the trie.\n",
-        "            return node.is_end_of_word\n",
-        "        \n",
-        "        char = word[0]\n",
-        "        if char == '.':\n",
-        "            # If the character is a dot, explore all possible child nodes.\n",
-        "            for child in node.children.values():\n",
-        "                if self.search_helper(child, word[1:]):\n",
-        "                    return True\n",
-        "        elif char in node.children:\n",
-        "            # If the character is in the children of the current node, move to the next node.\n",
-        "            return self.search_helper(node.children[char], word[1:])\n",
-        "        \n",
-        "        # If the character is not found and is not a dot, the word is not in the trie.\n",
-        "        return False\n",
-        "\n",
-        "    def search(self, word: str) -> bool:\n",
-        "        # Start the search from the root of the trie.\n",
-        "        return self.search_helper(self.root, word)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This code defines a `WordDictionary` class that uses a Trie data structure to efficiently store and search for words. Here's a step-by-step explanation:\n",
-        "\n",
-        "1. `TrieNode` class: This class represents nodes in the Trie data structure. Each node has two attributes: `children` (a dictionary to store child nodes) and `is_end_of_word` (a flag to indicate whether the node marks the end of a word).\n",
-        "\n",
-        "2. `WordDictionary` class: This class initializes with an empty Trie by creating a root node.\n",
-        "\n",
-        "3. `addWord` method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the `is_end_of_word` flag to `True` for the final character of the word to mark the end of the word.\n",
-        "\n",
-        "4. `search_helper` method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (`node`) and a word to search (`word`) as input. If there are no characters left in the word (`not word`), it checks if the current node marks the end of a word. If it does, it returns `True`.\n",
-        "\n",
-        "5. If the first character of the word is a dot ('.'), the function explores all possible child nodes by iterating through `node.children.values()` and recursively calls `search_helper` for each child with the remaining part of the word (`word[1:]`).\n",
-        "\n",
-        "6. If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling `search_helper` on the child node and the remaining part of the word.\n",
-        "\n",
-        "7. If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns `False`.\n",
-        "\n",
-        "8. `search` method: This is the public method for searching words. It initiates the search process by calling `search_helper` starting from the root node of the Trie.\n",
-        "\n",
-        "Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots ('.')."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n",
-            "True\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "wordDictionary = WordDictionary()\n",
-        "wordDictionary.addWord(\"bad\")\n",
-        "wordDictionary.addWord(\"dad\")\n",
-        "wordDictionary.addWord(\"mad\")\n",
-        "print(wordDictionary.search(\"pad\"))  # Output: False\n",
-        "print(wordDictionary.search(\"bad\"))  # Output: True\n",
-        "print(wordDictionary.search(\".ad\"))  # Output: True\n",
-        "print(wordDictionary.search(\"b..\"))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `WordDictionary` class methods:\n",
-        "\n",
-        "1. `addWord` Method:\n",
-        "\n",
-        "   - Time Complexity: O(L)\n",
-        "     - L is the length of the word being added.\n",
-        "     - In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.\n",
-        "\n",
-        "2. `search_helper` Method (called by `search`):\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - M is the maximum number of dots ('.') in the search word.\n",
-        "     - In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.\n",
-        "     - So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.\n",
-        "\n",
-        "3. `search` Method:\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - The `search` method calls the `search_helper` method, which has the same time complexity explained above.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.\n",
-        "\n",
-        "Overall, the time complexity of the `search` method is mainly affected by the number of dots ('.') in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.\n",
-        "\n",
-        "The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.\n",
-        "\n",
-        "In summary:\n",
-        "\n",
-        "- Time Complexity for `addWord`: O(L)\n",
-        "- Time Complexity for `search`: O(2^M * L)\n",
-        "- Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.\n",
-        "\n",
-        "Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dictionary Auto-Completion**: Extend the `WordDictionary` class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.\n",
-        "\n",
-        "2. **Support Word Deletion**: Extend the `WordDictionary` class to support word deletion. Add a method `deleteWord(word)` that removes a word from the data structure. Ensure that the search operation still works correctly after deletion."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/08. Tries/212. Word Search II.ipynb b/_build/html/_sources/08. Tries/212. Word Search II.ipynb
deleted file mode 100644
index 71597b8..0000000
--- a/_build/html/_sources/08. Tries/212. Word Search II.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 212. Word Search II\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search II problem on LeetCode, click here!](https://leetcode.com/problems/word-search-ii/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` `board` of characters and a list of strings `words`, the task is to return *all words on the board*.\n",
-        "\n",
-        "Each word must be constructed from letters of sequentially **adjacent cells**, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n == board[i].length`\n",
-        "- `1 <= m, n <= 12`\n",
-        "- `board[i][j]` is a lowercase English letter.\n",
-        "- 1 <= `words.length` <= $3 * 10^4$\n",
-        "- `1 <= words[i].length <= 10`\n",
-        "- `words[i]` consists of lowercase English letters.\n",
-        "- All the strings of `words` are unique."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "To solve the \"Word Search II\" problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here's a step-by-step approach to solve the problem:\n",
-        "\n",
-        "1. Build a Trie from the given list of words:\n",
-        "   - Create a Trie data structure to store all the words from the input list.\n",
-        "   - For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.\n",
-        "\n",
-        "2. Perform DFS on the board:\n",
-        "   - Iterate through each cell (i, j) on the board.\n",
-        "   - For each cell, start a DFS traversal from that cell to search for words.\n",
-        "   - During the DFS traversal, maintain a current path string.\n",
-        "   - At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.\n",
-        "   - If the current path string matches a word in the Trie, add it to the result.\n",
-        "\n",
-        "3. Implement DFS with backtracking:\n",
-        "   - During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven't been visited before.\n",
-        "   - To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like '#') before exploring it and restore its original character after the DFS traversal.\n",
-        "\n",
-        "4. Return the result:\n",
-        "   - After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.\n",
-        "   - Convert the result set to a list and return it as the final output.\n",
-        "\n",
-        "This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Define a TrieNode class to represent nodes in the Trie.\n",
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}  # Dictionary to store child nodes.\n",
-        "        self.is_end_of_word = False  # Flag to mark the end of a word.\n",
-        "\n",
-        "# Main function to find words on the board.\n",
-        "def findWords(board, words):\n",
-        "    # DFS function to search for words starting from a given cell.\n",
-        "    def dfs(node, i, j, path):\n",
-        "        char = board[i][j]  # Get the character at the current cell.\n",
-        "        curr_node = node.children.get(char)  # Find the corresponding Trie node.\n",
-        "\n",
-        "        if not curr_node:\n",
-        "            return  # If no matching Trie node, stop the search.\n",
-        "\n",
-        "        path += char  # Add the character to the current path.\n",
-        "\n",
-        "        if curr_node.is_end_of_word:\n",
-        "            result.add(path)  # If the path matches a word, add it to the result.\n",
-        "\n",
-        "        temp, board[i][j] = board[i][j], \"#\"  # Mark the cell as visited.\n",
-        "\n",
-        "        # Explore neighboring cells (up, down, left, right).\n",
-        "        if i > 0:\n",
-        "            dfs(curr_node, i - 1, j, path)\n",
-        "        if i < m - 1:\n",
-        "            dfs(curr_node, i + 1, j, path)\n",
-        "        if j > 0:\n",
-        "            dfs(curr_node, i, j - 1, path)\n",
-        "        if j < n - 1:\n",
-        "            dfs(curr_node, i, j + 1, path)\n",
-        "\n",
-        "        board[i][j] = temp  # Restore the cell's original character.\n",
-        "\n",
-        "    # Function to build a Trie from the list of words.\n",
-        "    def buildTrie():\n",
-        "        root = TrieNode()  # Create a root node.\n",
-        "        for word in words:\n",
-        "            node = root\n",
-        "            for char in word:\n",
-        "                if char not in node.children:\n",
-        "                    node.children[char] = TrieNode()  # Create a new node if needed.\n",
-        "                node = node.children[char]\n",
-        "            node.is_end_of_word = True  # Mark the end of the word.\n",
-        "        return root\n",
-        "\n",
-        "    m, n = len(board), len(board[0])  # Get the dimensions of the board.\n",
-        "    root = buildTrie()  # Build the Trie from the list of words.\n",
-        "    result = set()  # Use a set to store unique words found on the board.\n",
-        "\n",
-        "    # Iterate through each cell on the board and start DFS from there.\n",
-        "    for i in range(m):\n",
-        "        for j in range(n):\n",
-        "            dfs(root, i, j, \"\")  # Start DFS from each cell on the board.\n",
-        "\n",
-        "    return list(result)  # Convert the set to a list and return the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code solves the \"Word Search II\" problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.\n",
-        "\n",
-        "The code does the following:\n",
-        "\n",
-        "1. Defines a `TrieNode` class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.\n",
-        "\n",
-        "2. Defines the `findWords` function, which takes the grid (`board`) and a list of words (`words`) as input.\n",
-        "\n",
-        "3. Inside the `findWords` function, there is a `dfs` (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.\n",
-        "\n",
-        "4. The code also includes a `buildTrie` function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.\n",
-        "\n",
-        "5. The dimensions of the grid are obtained (m x n).\n",
-        "\n",
-        "6. A Trie is built using the `buildTrie` function.\n",
-        "\n",
-        "7. A set called `result` is used to store unique words found in the grid.\n",
-        "\n",
-        "8. The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.\n",
-        "\n",
-        "9. During the DFS, it explores neighboring cells (up, down, left, right) if they haven't been visited before and if the current path matches a prefix in the Trie.\n",
-        "\n",
-        "10. When a word is found during the DFS traversal, it is added to the `result` set.\n",
-        "\n",
-        "11. The grid cell is marked as visited during the DFS by changing its character to \"#\", and it is restored to its original character after the DFS traversal.\n",
-        "\n",
-        "12. Finally, the set of unique words found is converted to a list and returned as the output.\n",
-        "\n",
-        "The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['eat', 'oath']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "board1 = [[\"o\",\"a\",\"a\",\"n\"],[\"e\",\"t\",\"a\",\"e\"],[\"i\",\"h\",\"k\",\"r\"],[\"i\",\"f\",\"l\",\"v\"]]\n",
-        "words1 = [\"oath\",\"pea\",\"eat\",\"rain\"]\n",
-        "print(findWords(board1, words1))  # Output: [\"eat\", \"oath\"]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "c748b879-a2d8-4298-a42c-c7f61f9c7fc6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "board2 = [[\"a\",\"b\"],[\"c\",\"d\"]]\n",
-        "words2 = [\"abcb\"]\n",
-        "print(findWords(board2, words2))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Building the Trie (`buildTrie` function):** \n",
-        "   - Suppose there are `N` words in the input list, and the average length of a word is `L`.\n",
-        "   - Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.\n",
-        "\n",
-        "2. **DFS Traversal (`dfs` function):** \n",
-        "   - In the worst case, the DFS function explores all possible paths in the grid.\n",
-        "   - The maximum number of recursive calls for each cell is 4 (up, down, left, right).\n",
-        "   - The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most `L`.\n",
-        "   - Therefore, the DFS traversal for each cell takes $O(4^L)$ time.\n",
-        "\n",
-        "3. **Iterating Through the Grid (`findWords` function):**\n",
-        "   - In the worst case, we iterate through all `m` rows and `n` columns in the grid.\n",
-        "   - For each cell, we start a DFS traversal.\n",
-        "   - Therefore, iterating through the entire grid takes $O(m * n * 4^L)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the code is $O(N * L + m * n * 4^L)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Trie Data Structure:**\n",
-        "   - The space required to store the Trie depends on the number of unique characters in all the words.\n",
-        "   - In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).\n",
-        "   - In practice, it may be less if there are common prefixes among words.\n",
-        "\n",
-        "2. **DFS Stack (Recursive Calls):**\n",
-        "   - The depth of the recursive call stack during DFS is at most `L`, where `L` is the length of the longest word in the Trie.\n",
-        "   - Therefore, the space complexity for the recursive call stack is O(L).\n",
-        "\n",
-        "3. **Result Set (`result` set):**\n",
-        "   - The space used to store the result set depends on the number of valid words found in the grid.\n",
-        "   - In the worst case, when all words are found, the space complexity of the result set is O(N * L).\n",
-        "\n",
-        "Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Word Search Paths:**\n",
-        "   Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.\n",
-        "\n",
-        "\n",
-        "2. **Reverse Word Search:**\n",
-        "   Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/08. Tries/README.md b/_build/html/_sources/08. Tries/README.md
deleted file mode 100644
index 22c3bcd..0000000
--- a/_build/html/_sources/08. Tries/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Trie Problems - Blind 75 LeetCode
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
deleted file mode 100644
index cb66b6a..0000000
--- a/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb	
+++ /dev/null
@@ -1,254 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 1046. Last Stone Weight\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Last Stone Weight problem on LeetCode, click here!](https://leetcode.com/problems/last-stone-weight/)\n",
-        "\n",
-        "---\n",
-        "You are given an array of integers `stones` where `stones[i]` is the weight of the `i`th stone.\n",
-        "\n",
-        "We are playing a game with the stones. On each turn, you choose the **heaviest two stones** and smash them together. Suppose the heaviest two stones have weights `x` and `y` with `x <= y`. The result of this smash is:\n",
-        "\n",
-        "1. If `x == y`, both stones are destroyed.\n",
-        "2. If `x != y`, the stone of weight `x` is destroyed, and the stone of weight `y` has new weight `y - x`.\n",
-        "\n",
-        "At the end of the game, there is **at most one** stone left.\n",
-        "\n",
-        "Return *the weight of the last remaining stone*. If there are no stones left, return `0`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= stones.length <= 30`\n",
-        "- `1 <= stones[i] <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Last Stone Weight\" problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.\n",
-        "\n",
-        "Here's how the game works:\n",
-        "\n",
-        "1. You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.\n",
-        "\n",
-        "2. In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you've found the answer.\n",
-        "\n",
-        "3. If there are two stones with weights `x` and `y`, where `x` is less than or equal to `y`, the following happens:\n",
-        "   - If `x` is equal to `y`, both stones are completely destroyed, and they are removed from the array of stones.\n",
-        "   - If `x` is not equal to `y`, the stone with weight `x` is destroyed, and the stone with weight `y` now has a new weight of `y - x`. The stone with weight `x` is removed from the array, and the modified stone with weight `y - x` remains in the array.\n",
-        "\n",
-        "4. The game continues with the modified array of stones until there is at most one stone left.\n",
-        "\n",
-        "5. The goal is to find the weight of the last remaining stone, or if there are no stones left, return `0`.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "def lastStoneWeight(stones):\n",
-        "    # Convert the input list to a max heap (negate the values to simulate a max heap)\n",
-        "    max_heap = [-stone for stone in stones]\n",
-        "    heapq.heapify(max_heap)\n",
-        "\n",
-        "    # Continue as long as there are more than 1 stone in the heap\n",
-        "    while len(max_heap) > 1:\n",
-        "        # Get the two heaviest stones\n",
-        "        y = -heapq.heappop(max_heap)  # Get the heaviest stone and negate it back to positive\n",
-        "        x = -heapq.heappop(max_heap)  # Get the second heaviest stone and negate it back to positive\n",
-        "\n",
-        "        # Calculate the new stone's weight after smashing\n",
-        "        if x != y:\n",
-        "            new_stone = y - x\n",
-        "            heapq.heappush(max_heap, -new_stone)  # Negate the value and push it back to the heap\n",
-        "\n",
-        "    # If there is one stone left, return its weight (negate it back to positive)\n",
-        "    if max_heap:\n",
-        "        return -max_heap[0]\n",
-        "    else:\n",
-        "        return 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a Python function called `lastStoneWeight` that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. We import the `heapq` library, which allows us to create and manipulate a heap (priority queue).\n",
-        "\n",
-        "2. Inside the `lastStoneWeight` function:\n",
-        "   - We create a max heap (negating stone weights to simulate a max heap) using the `heapq.heapify` function. This heap will keep track of the heaviest stones.\n",
-        "   \n",
-        "   - We enter a loop that continues as long as there are more than 1 stone in the heap.\n",
-        "   \n",
-        "   - Inside the loop, we:\n",
-        "     - Retrieve and negate the heaviest stone (`y`) from the heap.\n",
-        "     - Retrieve and negate the second heaviest stone (`x`) from the heap.\n",
-        "   \n",
-        "     - Calculate the new stone's weight after smashing (`y - x`), and negate it back to simulate a max heap.\n",
-        "     - Add the new stone back to the heap using `heapq.heappush`.\n",
-        "   \n",
-        "3. After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.\n",
-        "   \n",
-        "4. If there are no stones left (the heap is empty), we return `0`, indicating that no stones remain.\n",
-        "\n",
-        "5. Finally, we provide two test cases to demonstrate the function's usage and correctness.\n",
-        "\n",
-        "In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "stones1 = [2, 7, 4, 1, 8, 1]\n",
-        "print(lastStoneWeight(stones1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "b7e79514-4821-48d0-bb9d-0f2de8150945",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: \n",
-        "\n",
-        "stones2 = [1]\n",
-        "print(lastStoneWeight(stones2))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided Python code for the \"Last Stone Weight\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The `heapq.heapify` operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.\n",
-        "\n",
-        "2. The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:\n",
-        "   - Retrieving and negating the heaviest stone (`y`) from the heap, which takes O(log n) time.\n",
-        "   - Retrieving and negating the second heaviest stone (`x`) from the heap, also taking O(log n) time.\n",
-        "   - Calculating the new stone's weight and pushing it back into the heap using `heapq.heappush`, which takes O(log n) time.\n",
-        "\n",
-        "3. In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.\n",
-        "\n",
-        "Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).\n",
-        "\n",
-        "2. The rest of the variables used in the function (e.g., `x`, `y`, `new_stone`) require only constant space, so they do not significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: $O(n\\ log\\ n)$\n",
-        "- Space Complexity: $O(n)$\n",
-        "\n",
-        "The algorithm is efficient enough to handle the problem's constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Last Stone Weight**: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.\n",
-        "\n",
-        "\n",
-        "2. **Multiple Stones Smash**: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
deleted file mode 100644
index 847dd60..0000000
--- a/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 295. Find Median from Data Stream\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Median from Data Stream problem on LeetCode, click here!](https://leetcode.com/problems/find-median-from-data-stream/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "The **median** is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.\n",
-        "\n",
-        "Implement the MedianFinder class:\n",
-        "\n",
-        "- `MedianFinder()` initializes the `MedianFinder` object.\n",
-        "- `void addNum(int num)` adds the integer `num` from the data stream to the data structure.\n",
-        "- `double findMedian()` returns the median of all elements so far. Answers within $10^{-5}$ of the actual answer will be accepted.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- $-10^{5}$ <= `num` <= $10^{5}$\n",
-        "- There will be at least one element in the data structure before calling `findMedian`.\n",
-        "- At most $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "**Follow-up:**\n",
-        "\n",
-        "1. If all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?\n",
-        "2. If `99%` of all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem, \"Find Median from Data Stream,\" deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.\n",
-        "\n",
-        "Here's a breakdown of the problem:\n",
-        "\n",
-        "1. **Initialization**: You are asked to implement a `MedianFinder` class that supports the following operations:\n",
-        "\n",
-        "    - `MedianFinder()`: Initializes the MedianFinder object.\n",
-        "    - `addNum(int num)`: Adds an integer `num` from the data stream to the data structure.\n",
-        "    - `findMedian()`: Returns the median of all elements added to the data structure.\n",
-        "\n",
-        "2. **Median Calculation**: The `findMedian` operation should efficiently compute the median, and the result should have a precision of at least $10^{-5}$ (i.e., answers within this range will be considered correct).\n",
-        "\n",
-        "3. **Examples**:\n",
-        "   \n",
-        "   - If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.\n",
-        "   - If you add numbers [1, 2, 3], the median should be 2 because it's the middle value.\n",
-        "   \n",
-        "4. **Constraints**:\n",
-        "\n",
-        "   - The integers provided in the data stream are in the range from $-10^5$ to $10^5$.\n",
-        "   - There will be at least one element in the data structure before calling `findMedian`.\n",
-        "   - At most, $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "class MedianFinder:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,\n",
-        "        # and a min-heap (large_half) for the larger half of numbers.\n",
-        "        self.small_half = []  # Max-heap for the smaller half of the numbers\n",
-        "        self.large_half = []  # Min-heap for the larger half of the numbers\n",
-        "\n",
-        "    def addNum(self, num: int) -> None:\n",
-        "        # Add the number to the appropriate heap based on its value\n",
-        "        if not self.small_half or num <= -self.small_half[0]:\n",
-        "            # If the number is less than or equal to the current maximum in the smaller half,\n",
-        "            # add it to the smaller half (max-heap)\n",
-        "            heapq.heappush(self.small_half, -num)\n",
-        "        else:\n",
-        "            # Otherwise, add it to the larger half (min-heap)\n",
-        "            heapq.heappush(self.large_half, num)\n",
-        "\n",
-        "        # Balance the heaps if necessary to ensure the size difference is at most 1\n",
-        "        if len(self.small_half) > len(self.large_half) + 1:\n",
-        "            # If the size of the smaller half is more than one greater than the size of the larger half,\n",
-        "            # move the maximum from the smaller half to the larger half to balance them.\n",
-        "            heapq.heappush(self.large_half, -heapq.heappop(self.small_half))\n",
-        "        elif len(self.large_half) > len(self.small_half):\n",
-        "            # If the size of the larger half is greater than the size of the smaller half,\n",
-        "            # move the minimum from the larger half to the smaller half to balance them.\n",
-        "            heapq.heappush(self.small_half, -heapq.heappop(self.large_half))\n",
-        "\n",
-        "    def findMedian(self) -> float:\n",
-        "        if len(self.small_half) == len(self.large_half):\n",
-        "            # If both halves have the same size, there's an even number of elements,\n",
-        "            # so the median is the average of the top elements in both heaps.\n",
-        "            return (-self.small_half[0] + self.large_half[0]) / 2.0\n",
-        "        else:\n",
-        "            # If the smaller half has more elements, it contains the median (odd number of elements).\n",
-        "            return -self.small_half[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a `MedianFinder` class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (`small_half`) to store the smaller half of the numbers and a min-heap (`large_half`) to store the larger half. Here's how the code works:\n",
-        "\n",
-        "1. The `__init__` method initializes the two heaps.\n",
-        "\n",
-        "2. The `addNum` method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.\n",
-        "\n",
-        "3. The `findMedian` method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.\n",
-        "\n",
-        "In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1.5\n",
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "medianFinder = MedianFinder()\n",
-        "medianFinder.addNum(1)\n",
-        "medianFinder.addNum(2)\n",
-        "print(medianFinder.findMedian())  # Output: 1.5\n",
-        "medianFinder.addNum(3)\n",
-        "print(medianFinder.findMedian())  # Output: 2.0\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `MedianFinder` class:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.\n",
-        "\n",
-        "2. `addNum(int num)`: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.\n",
-        "\n",
-        "3. `findMedian()`: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.\n",
-        "\n",
-        "2. `addNum(int num)`: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.\n",
-        "\n",
-        "3. `findMedian()`: The space complexity for finding the median is O(1). It doesn't require any additional data structures that grow with the input size.\n",
-        "\n",
-        "In summary, the time complexity of the `addNum` operation is O(log N), and the time complexity of the `findMedian` operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized kth Element**: Extend the `MedianFinder` class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.\n",
-        "\n",
-        "2. **Sliding Window Median**: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
deleted file mode 100644
index 2e1522d..0000000
--- a/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb	
+++ /dev/null
@@ -1,239 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 703. Kth Largest Element in a Stream\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Largest Element in a Stream problem on LeetCode, click here!](https://leetcode.com/problems/kth-largest-element-in-a-stream/)\n",
-        "\n",
-        "---\n",
-        "Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.\n",
-        "\n",
-        "Implement the `KthLargest` class with the following methods:\n",
-        "\n",
-        "- `KthLargest(int k, int[] nums)`: Initializes the object with the integer `k` and the stream of integers `nums`.\n",
-        "- `int add(int val)`: Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `k` <= $10^4$\n",
-        "- 0 <= `nums.length` <= $10^4$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- $-10^4$ <= `val` <= $10^4$\n",
-        "- At most $10^4$ calls will be made to `add`.\n",
-        "- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem you're trying to solve is to design a class called `KthLargest` that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:\n",
-        "\n",
-        "To solve this problem efficiently, you can use a min-heap data structure. Here's how the approach works:\n",
-        "\n",
-        "1. Initialize a min-heap to store the k largest elements. Initially, it's empty.\n",
-        "\n",
-        "2. In the `__init__` method, populate the min-heap with the first `k` elements from `nums`. This ensures that you have the k largest elements seen so far.\n",
-        "\n",
-        "3. Whenever you add a new element to the stream using the `add` method, follow these steps:\n",
-        "   - Add the new element to the min-heap.\n",
-        "   - If the size of the min-heap exceeds `k`, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.\n",
-        "   - The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.\n",
-        "\n",
-        "Here's why this approach works efficiently:\n",
-        "\n",
-        "- By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.\n",
-        "\n",
-        "- When you add a new element, the min-heap's size is kept at most `k`, which ensures that you only track the k largest elements and discard the smaller ones.\n",
-        "\n",
-        "- The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).\n",
-        "\n",
-        "- This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.\n",
-        "\n",
-        "In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "from typing import List  # Import the List type from the typing module\n",
-        "\n",
-        "class KthLargest:\n",
-        "\n",
-        "    def __init__(self, k: int, nums: List[int]):\n",
-        "        # Initialize the KthLargest object with k and nums.\n",
-        "        self.k = k\n",
-        "        # Create a min-heap to store the k largest elements.\n",
-        "        self.min_heap = []\n",
-        "        # Populate the min-heap with the first k elements from nums.\n",
-        "        for num in nums:\n",
-        "            self.add(num)\n",
-        "\n",
-        "    def add(self, val: int) -> int:\n",
-        "        # Add val to the min-heap.\n",
-        "        heapq.heappush(self.min_heap, val)\n",
-        "        # If the size of the min-heap exceeds k, remove the smallest element.\n",
-        "        if len(self.min_heap) > self.k:\n",
-        "            heapq.heappop(self.min_heap)\n",
-        "        # The root of the min-heap is the kth largest element.\n",
-        "        return self.min_heap[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- We start by importing the necessary modules:\n",
-        "  - `heapq`: This module provides functions to create and manipulate heaps.\n",
-        "  - `List` from the `typing` module: This is used to specify the type of the `nums` parameter.\n",
-        "\n",
-        "- We define the `KthLargest` class:\n",
-        "  - The `__init__` method initializes the object with the integer `k` and the list of integers `nums`.\n",
-        "  - It also creates an empty min-heap called `self.min_heap` to store the k largest elements.\n",
-        "  - It populates the min-heap with the first `k` elements from `nums` by calling the `add` method.\n",
-        "\n",
-        "- The `add` method:\n",
-        "  - Adds the new integer `val` to the min-heap using `heapq.heappush`. This maintains the min-heap property.\n",
-        "  - Checks if the size of the min-heap exceeds `k`. If it does, it removes the smallest element (the k+1th largest) using `heapq.heappop`.\n",
-        "  - Finally, it returns the smallest element in the min-heap, which is always the kth largest element.\n",
-        "\n",
-        "Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n",
-            "5\n",
-            "5\n",
-            "8\n",
-            "8\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "kthLargest = KthLargest(3, [4, 5, 8, 2])\n",
-        "print(kthLargest.add(3))  # Output: 4\n",
-        "print(kthLargest.add(5))  # Output: 5\n",
-        "print(kthLargest.add(10)) # Output: 5\n",
-        "print(kthLargest.add(9))  # Output: 8\n",
-        "print(kthLargest.add(4))  # Output: 8"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `KthLargest` class using the min-heap approach:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `__init__` method:\n",
-        "   - In the `__init__` method, you iterate over the first `k` elements in `nums` and add them to the min-heap. Each `heapq.heappush` operation takes O(log k) time.\n",
-        "   - Therefore, the time complexity of the `__init__` method is O(k * log k).\n",
-        "\n",
-        "2. `add` method:\n",
-        "   - In the `add` method, you perform the following operations:\n",
-        "     - `heapq.heappush`: O(log k) to add the new element to the min-heap.\n",
-        "     - If the size of the min-heap exceeds `k`, you perform `heapq.heappop`, which is also O(log k).\n",
-        "     - Finally, you return the smallest element from the min-heap, which is O(1) because it's always the root.\n",
-        "   - Overall, the time complexity of the `add` method is O(log k).\n",
-        "\n",
-        "3. Overall, if you make `n` calls to the `add` method, the total time complexity is O(n * log k), where `n` is the total number of elements added to the stream.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The space complexity is determined by the space used to store the min-heap and the instance variables.\n",
-        "2. The min-heap stores at most `k` elements at any given time, so its space complexity is O(k).\n",
-        "3. The instance variables (such as `self.k` and `self.min_heap`) have constant space requirements.\n",
-        "4. Therefore, the overall space complexity of the `KthLargest` class is O(k).\n",
-        "\n",
-        "In summary, the time complexity of the `KthLargest` class is O(n * log k) for `n` add operations, and the space complexity is O(k), where `k` is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dynamic k:** Modify the `KthLargest` class to support dynamic changes in the value of `k`. Implement a method `update_k` that allows changing the value of `k` during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of `k`.\n",
-        "\n",
-        "\n",
-        "2. **Implement kth Smallest:** Create a new class called `KthSmallest` that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/09. Heap - Priority Queue/README.md b/_build/html/_sources/09. Heap - Priority Queue/README.md
deleted file mode 100644
index 2eac70c..0000000
--- a/_build/html/_sources/09. Heap - Priority Queue/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Heap / Priority Queue Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)     | Easy       |
-| [1046. Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)     | Easy       |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb b/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb
deleted file mode 100644
index 228a62e..0000000
--- a/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb	
+++ /dev/null
@@ -1,282 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 39. Combination Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Combination Sum problem on LeetCode, click here!](https://leetcode.com/problems/combination-sum/)\n",
-        "\n",
-        "---\n",
-        "Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of `candidates` where the chosen numbers sum to the `target`*. You may return the combinations in **any order**. \n",
-        "\n",
-        "The **same** number may be chosen from `candidates` an **unlimited number** of times. Two combinations are unique if the **frequency** of at least one of the chosen numbers is different.\n",
-        "\n",
-        "The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= candidates.length <= 30`\n",
-        "- `2 <= candidates[i] <= 40`\n",
-        "- All elements of `candidates` are **distinct**.\n",
-        "- `1 <= target <= 40`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:\n",
-        "\n",
-        "- You are given an array of distinct integers called \"candidates.\"\n",
-        "- You are also given a target integer called \"target.\"\n",
-        "\n",
-        "The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "**Example 1:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 6, 7], target = 7\n",
-        "Output: [[2, 2, 3], [7]]\n",
-        "```\n",
-        "In this example, there are two unique combinations that sum up to the target:\n",
-        "- 2 + 2 + 3 = 7\n",
-        "- 7 = 7\n",
-        "\n",
-        "**Example 2:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 5], target = 8\n",
-        "Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n",
-        "```\n",
-        "Here, there are three unique combinations that sum up to the target.\n",
-        "\n",
-        "**Example 3:**\n",
-        "```python\n",
-        "Input: candidates = [2], target = 1\n",
-        "Output: []\n",
-        "```\n",
-        "In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.\n",
-        "\n",
-        "The problem asks you to find and return these combinations in any order.\n",
-        "\n",
-        "The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def combinationSum(candidates, target):\n",
-        "    # Define a recursive DFS function to find combinations\n",
-        "    def dfs(remaining, start, path):\n",
-        "        # If the remaining target is 0, we found a valid combination\n",
-        "        if remaining == 0:\n",
-        "            result.append(path)\n",
-        "            return\n",
-        "        # If the remaining target is negative, this path is invalid\n",
-        "        if remaining < 0:\n",
-        "            return\n",
-        "        # Iterate through candidates starting from 'start' to avoid duplicates\n",
-        "        for i in range(start, len(candidates)):\n",
-        "            # Explore the current candidate by subtracting it from the remaining target\n",
-        "            # Add the current candidate to the path\n",
-        "            dfs(remaining - candidates[i], i, path + [candidates[i]])\n",
-        "\n",
-        "    result = []  # Initialize an empty list to store the result\n",
-        "    candidates.sort()  # Sort the candidates for deduplication and early stopping\n",
-        "    dfs(target, 0, [])  # Start the DFS from the target value with an empty path\n",
-        "    return result  # Return the list of unique combinations"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `combinationSum` function takes an array of distinct integers `candidates` and a target integer `target`. It returns a list of all unique combinations of `candidates` where the chosen numbers sum to the `target`. Each number in the `candidates` array can be used an unlimited number of times.\n",
-        "\n",
-        "Here's an overview of how the code works:\n",
-        "\n",
-        "1. The `combinationSum` function is defined, and it takes two arguments: `candidates` and `target`.\n",
-        "\n",
-        "2. Inside the function, there is a nested helper function called `backtrack`. This function is responsible for the actual combination generation using a recursive approach.\n",
-        "\n",
-        "3. The `backtrack` function is called with three arguments: `start`, `target`, and `path`. The `start` variable helps keep track of the current index in the `candidates` array, `target` keeps track of the remaining sum to be achieved, and `path` is a list that stores the current combination.\n",
-        "\n",
-        "4. Within the `backtrack` function, there are three main conditional statements:\n",
-        "   - If `target` becomes zero, it means we have found a combination that sums up to the target, so we add `path` to the `result` list.\n",
-        "   - If `target` becomes negative, it means the current combination doesn't work, so we return without doing anything.\n",
-        "   - Otherwise, we enter a loop that iterates over the `candidates` array, starting from the current index `start`.\n",
-        "\n",
-        "5. In the loop, the `backtrack` function is called recursively with the updated `target` and `path` after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.\n",
-        "\n",
-        "6. After the loop completes, the `result` list contains all unique combinations that sum to the target.\n",
-        "\n",
-        "7. The `candidates` array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.\n",
-        "\n",
-        "8. Finally, the `backtrack` function is initially called from the `combinationSum` function with `start` set to 0, `target` set to the original target value, and an empty `path`. The result is returned as a list of unique combinations.\n",
-        "\n",
-        "The code includes a few example cases to demonstrate how the function works with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 3], [7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example 1\n",
-        "candidates1 = [2, 3, 6, 7]\n",
-        "target1 = 7\n",
-        "print(combinationSum(candidates1, target1))  # Output: [[2, 2, 3], [7]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "candidates2 = [2, 3, 5]\n",
-        "target2 = 8\n",
-        "print(combinationSum(candidates2, target2))  # Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "candidates3 = [2]\n",
-        "target3 = 1\n",
-        "print(combinationSum(candidates3, target3))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `combinationSum` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this function is influenced by the number of recursive calls made by the `backtrack` function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.\n",
-        "\n",
-        "The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as $O(2^n)$, where 'n' is the maximum number of recursive calls. In this context, 'n' corresponds to the number of elements in the `candidates` list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.\n",
-        "\n",
-        "1. The space required for the `result` list can be up to $O(2^n)$ in the worst case because each combination is stored.\n",
-        "\n",
-        "2. The stack space for the recursive calls can also be up to O(n) in the worst case, where 'n' is the number of elements in the `candidates` list.\n",
-        "\n",
-        "Therefore, the overall space complexity of the function is $O(2^n + n)$. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.\n",
-        "\n",
-        "In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find the Number of Unique Combinations:** Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.\n",
-        "\n",
-        "2. **Combinations with a Maximum Value:** Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/10. Backtracking/79. Word Search.ipynb b/_build/html/_sources/10. Backtracking/79. Word Search.ipynb
deleted file mode 100644
index cee509b..0000000
--- a/_build/html/_sources/10. Backtracking/79. Word Search.ipynb	
+++ /dev/null
@@ -1,298 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 79. Word Search\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search problem on LeetCode, click here!](https://leetcode.com/problems/word-search/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` grid of characters `board` and a string `word`, return *`true` if `word` exists in the grid.*\n",
-        "\n",
-        "The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n = board[i].length`\n",
-        "- `1 <= m, n <= 6`\n",
-        "- `1 <= word.length <= 15`\n",
-        "- `board` and `word` consists of only lowercase and uppercase English letters.\n",
-        "\n",
-        "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given word can be constructed from characters in an `m x n` grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.\n",
-        "\n",
-        "Here are the specifics of the problem:\n",
-        "\n",
-        "- You are given an `m x n` grid, which is a 2D board of characters.\n",
-        "- You are also given a string `word` consisting of lowercase and uppercase English letters.\n",
-        "- Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.\n",
-        "- You can't use the same cell more than once when forming the word.\n",
-        "- If it's possible to form the word in the grid, return `True`; otherwise, return `False`.\n",
-        "\n",
-        "For example, consider the following grid and word:\n",
-        "\n",
-        "```python\n",
-        "board = [[\"A\", \"B\", \"C\", \"E\"],\n",
-        "         [\"S\", \"F\", \"C\", \"S\"],\n",
-        "         [\"A\", \"D\", \"E\", \"E\"]]         \n",
-        "word = \"ABCCED\"\n",
-        "```\n",
-        "\n",
-        "In this case, the word \"ABCCED\" can be formed by moving through the cells (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,3) in the grid. Therefore, the function should return `True`.\n",
-        "\n",
-        "Conversely, if the word is impossible to construct, such as in the case of the word \"ABCB\" for the same grid, where there's no valid path that forms the word, the function should return `False`.\n",
-        "\n",
-        "The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def exist(self, board: List[List[str]], word: str) -> bool:\n",
-        "        def dfs(i, j, k):\n",
-        "            # Check if the current position is out of bounds or doesn't match the character in the word.\n",
-        "            if not (0 <= i < len(board)) or not (0 <= j < len(board[0])) or board[i][j] != word[k]:\n",
-        "                return False\n",
-        "            \n",
-        "            # If we have matched all characters in the word, return True.\n",
-        "            if k == len(word) - 1:\n",
-        "                return True\n",
-        "\n",
-        "            # Temporarily mark the current cell to prevent revisiting.\n",
-        "            tmp, board[i][j] = board[i][j], \"/\"\n",
-        "\n",
-        "            # Explore adjacent cells by making recursive calls in all four directions.\n",
-        "            found = dfs(i + 1, j, k + 1) or dfs(i - 1, j, k + 1) or dfs(i, j + 1, k + 1) or dfs(i, j - 1, k + 1)\n",
-        "\n",
-        "            # Restore the original character in the cell.\n",
-        "            board[i][j] = tmp\n",
-        "\n",
-        "            return found\n",
-        "\n",
-        "        # Iterate through all cells in the board.\n",
-        "        for i in range(len(board)):\n",
-        "            for j in range(len(board[0])):\n",
-        "                # Check if the 'dfs' function starting from this cell returns True.\n",
-        "                if dfs(i, j, 0):\n",
-        "                    return True\n",
-        "\n",
-        "        # If no match is found after exploring all cells, return False.\n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Import the necessary module:\n",
-        "   - `from typing import List`: This line imports the `List` type from the `typing` module, which is used to specify the type of the `board` parameter in the method signature.\n",
-        "\n",
-        "2. Define the `Solution` class:\n",
-        "   - `class Solution:`: This line defines a class called `Solution` to encapsulate the solution for the word search problem.\n",
-        "\n",
-        "3. Define the `exist` method:\n",
-        "   - `def exist(self, board: List[List[str]], word: str) -> bool:`: This method is a member of the `Solution` class and takes two parameters: `board`, which is a 2D list of characters, and `word`, which is a string. It returns a boolean value, indicating whether the word exists in the board.\n",
-        "\n",
-        "4. Implement the inner `dfs` function:\n",
-        "   - `def dfs(i, j, k):`: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: `i` and `j` representing the current position on the board, and `k` representing the current index in the `word` string.\n",
-        "\n",
-        "   - Inside `dfs`, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the `word`. If either of these conditions is met, it returns `False`.\n",
-        "\n",
-        "   - If `k` is equal to the length of the `word` minus one, it means we have successfully matched all characters in the `word`, so it returns `True`.\n",
-        "\n",
-        "   - The function then temporarily replaces the character at the current position with a marker, \"/\", to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return `True`, it propagates the `True` result up the call stack. After the exploration is complete, it restores the original character in the cell.\n",
-        "\n",
-        "5. Iterate through the board:\n",
-        "   - The outer loop iterates through all cells in the `board` using two nested loops. For each cell, it checks if the `dfs` function starting from that cell (with `k` initially set to 0) returns `True`. If it does, it means the word exists, so the method returns `True`.\n",
-        "\n",
-        "6. Return `False`:\n",
-        "   - If the loop completes without finding the word in the board, the method returns `False`.\n",
-        "\n",
-        "To use this code, you can create an instance of the `Solution` class and call the `exist` method on that instance, passing the `board` and the `word` as arguments to check if the word exists in the board."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test case 1: Word \"ABCCED\" can be found in the grid\n",
-        "board1 = [[\"A\",\"B\",\"C\",\"E\"],\n",
-        "          [\"S\",\"F\",\"C\",\"S\"],\n",
-        "          [\"A\",\"D\",\"E\",\"E\"]]\n",
-        "word1 = \"ABCCED\"\n",
-        "print(solution.exist(board1, word1))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "# Test case 2: Word \"SEE\" can be found in the grid\n",
-        "word2 = \"SEE\"\n",
-        "print(solution.exist(board1, word2))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "\n",
-        "# Test case 3: Word \"ABCB\" cannot be found in the grid\n",
-        "word3 = \"ABCB\"\n",
-        "print(solution.exist(board1, word3))  # Expected output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `exist` method in the given code.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary work in this code is done by the `dfs` function, which performs a depth-first search through the grid. The time complexity of the `dfs` function is $O(4^(n))$, where \"n\" is the length of the `word`. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the `word`.\n",
-        "\n",
-        "The outer loops iterate through all cells in the `board`, which has dimensions `m x n`. So, the total number of iterations of `dfs` is O(m * n). However, since the `dfs` function has a higher time complexity, the overall time complexity is still dominated by the `dfs` function.\n",
-        "\n",
-        "Therefore, the overall time complexity of the `exist` method is $O(m * n * 4^n)$, where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The primary space usage comes from the recursive calls in the `dfs` function. The depth of the recursion can be at most equal to the length of the `word`, which is O(n).\n",
-        "\n",
-        "2. Additionally, the `tmp` variable and the recursive calls on the call stack consume a small amount of additional memory.\n",
-        "\n",
-        "3. The marking of visited cells with the \"/\" character temporarily modifies the `board` in-place but doesn't significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity is O(n) due to the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is $O(m * n * 4^n)$, and the space complexity is O(n), where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find all unique words that can be constructed from the grid. Instead of returning `True` or `False`, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.\n",
-        "\n",
-        "2. **Board Generation:** Create a function to generate random grids of characters and then use the `exist` method to solve them. Test the efficiency and correctness of your code by generating larger boards and words."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/10. Backtracking/README.md b/_build/html/_sources/10. Backtracking/README.md
deleted file mode 100644
index 0d1ea13..0000000
--- a/_build/html/_sources/10. Backtracking/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Backtracking Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)        | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb b/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb
deleted file mode 100644
index 07351b6..0000000
--- a/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb	
+++ /dev/null
@@ -1,317 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 133. Clone Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Clone Graph problem on LeetCode, click here!](https://leetcode.com/problems/clone-graph/)\n",
-        "\n",
-        "---\n",
-        "Given a reference of a node in a **connected** undirected graph.\n",
-        "\n",
-        "Return a **deep copy** (clone) of the graph.\n",
-        "\n",
-        "Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n",
-        "\n",
-        "```\n",
-        "class Node {\n",
-        "    public int val;\n",
-        "    public List<Node> neighbors;\n",
-        "}\n",
-        "```\n",
-        "\n",
-        "**Test case format:**\n",
-        "\n",
-        "For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n",
-        "\n",
-        "**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n",
-        "\n",
-        "The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the graph is in the range `[0, 100]`.\n",
-        "- `1 <= Node.val <= 100`\n",
-        "- `Node.val` is unique for each node.\n",
-        "- There are no repeated edges and no self-loops in the graph.\n",
-        "- The Graph is connected and all nodes can be visited starting from the given node."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.\n",
-        "\n",
-        "Here are the key aspects of the problem:\n",
-        "\n",
-        "1. **Input**: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.\n",
-        "\n",
-        "2. **Output**: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.\n",
-        "\n",
-        "3. **Graph Structure**: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.\n",
-        "\n",
-        "4. **Connected Graph**: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.\n",
-        "\n",
-        "To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.\n",
-        "\n",
-        "The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a Node.\n",
-        "class Node:\n",
-        "    def __init__(self, val=0, neighbors=None):\n",
-        "        self.val = val\n",
-        "        self.neighbors = neighbors if neighbors is not None else []\n",
-        "\n",
-        "class Solution:\n",
-        "    def cloneGraph(self, node: 'Node') -> 'Node':\n",
-        "        if not node:\n",
-        "            return None\n",
-        "\n",
-        "        visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "        def dfs(original_node):\n",
-        "            if original_node in visited:\n",
-        "                return visited[original_node]\n",
-        "\n",
-        "            # Create a copy of the original node\n",
-        "            copy_node = Node(original_node.val)\n",
-        "            visited[original_node] = copy_node\n",
-        "\n",
-        "            # Recursively clone the neighbors of the original node\n",
-        "            for neighbor in original_node.neighbors:\n",
-        "                copy_node.neighbors.append(dfs(neighbor))\n",
-        "\n",
-        "            return copy_node\n",
-        "\n",
-        "        return dfs(node)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a Python class, `Node`, and a solution class, `Solution`, to clone a connected undirected graph represented by nodes and their neighbors. Here's an explanation of the code:\n",
-        "\n",
-        "1. The `Node` class defines a node in the graph. Each node has a value (`val`) which is an integer and a list of neighbors (`neighbors`) that are other nodes in the graph.\n",
-        "\n",
-        "2. The `Solution` class contains the method `cloneGraph`, which takes a reference to the first node of the graph (`node`) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.\n",
-        "\n",
-        "3. Inside the `cloneGraph` method:\n",
-        "   - It first checks if the input `node` is `None`. If it's `None`, it means there is no graph to clone, and the method returns `None`.\n",
-        "\n",
-        "   - It initializes a `visited` dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.\n",
-        "\n",
-        "   - The `dfs` (depth-first search) function is defined within the `cloneGraph` method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.\n",
-        "\n",
-        "   - Inside the `dfs` function:\n",
-        "     - It checks if the original node has been visited before by looking it up in the `visited` dictionary. If it has been visited, it returns the corresponding clone from the `visited` dictionary.\n",
-        "\n",
-        "     - If the original node is not visited, it creates a new node, `copy_node`, with the same value as the original node. This is the first step in creating the clone of the original node.\n",
-        "\n",
-        "     - It then recursively clones the neighbors of the original node by iterating through the `neighbors` list of the original node and appending the corresponding cloned neighbors to the `neighbors` list of the `copy_node`. This step ensures that the relationships between nodes are preserved in the clone.\n",
-        "\n",
-        "     - The `copy_node` is added to the `visited` dictionary with the original node as the key and the clone as the value.\n",
-        "\n",
-        "     - Finally, the `copy_node` is returned as the result of the DFS for the original node.\n",
-        "\n",
-        "4. The `cloneGraph` method returns the result of the DFS on the input `node`, which is the clone of the entire graph with its structure and relationships intact.\n",
-        "\n",
-        "In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1, 2, 4]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "def get_adjacency_list(node):\n",
-        "    visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "    def dfs(node):\n",
-        "        if not node:\n",
-        "            return []\n",
-        "\n",
-        "        if node in visited:\n",
-        "            return visited[node]\n",
-        "\n",
-        "        neighbors = [n.val for n in node.neighbors]\n",
-        "        visited[node] = neighbors\n",
-        "\n",
-        "        for neighbor in node.neighbors:\n",
-        "            dfs(neighbor)\n",
-        "\n",
-        "    dfs(node)\n",
-        "    result = []\n",
-        "\n",
-        "    def get_node_and_neighbors(node):\n",
-        "        result.append([node.val] + visited[node])\n",
-        "\n",
-        "    get_node_and_neighbors(node)\n",
-        "    return result\n",
-        "\n",
-        "\n",
-        "# Testing the code with the provided examples\n",
-        "adjList1 = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "nodes = [Node(i) for i in range(1, len(adjList1) + 1)]\n",
-        "for i, adj in enumerate(adjList1):\n",
-        "    nodes[i].neighbors = [nodes[j - 1] for j in adj]\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(nodes[0])\n",
-        "cloned_adjList1 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList1)\n",
-        "\n",
-        "# Output should match adjList1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "# Input: adjList = [[]]\n",
-        "\n",
-        "adjList2 = [[]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "node1 = Node(1)\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(node1)\n",
-        "cloned_adjList2 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList2)\n",
-        "\n",
-        "# Output should be [[]], which represents an empty graph"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Creating the graph: The time complexity to create the original graph from `adjList` is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in `adjList`.\n",
-        "\n",
-        "2. Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.\n",
-        "\n",
-        "Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.\n",
-        "\n",
-        "2. Storage for the visited dictionary: The `visited` dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.\n",
-        "\n",
-        "3. Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the `visited` dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).\n",
-        "\n",
-        "In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Cyclic Graph**: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn't fall into an infinite loop during traversal.\n",
-        "\n",
-        "\n",
-        "2. **Partial Graph Cloning**: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb b/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb
deleted file mode 100644
index e0235d6..0000000
--- a/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb	
+++ /dev/null
@@ -1,248 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 178. Graph Valid Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Graph Valid Tree problem on LintCode, click here!](https://www.lintcode.com/problem/178/)\n",
-        "\n",
-        "---\n",
-        "Given `n` nodes labeled from `0` to `n - 1` and a list of `undirected` edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You can assume that no duplicate edges will appear in edges. Since all edges are `undirected`, `[0, 1]` is the same as `[1, 0]` and thus will not appear together in edges."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a \"tree\" is a specific type of graph with the following properties:\n",
-        "\n",
-        "1. It is a connected graph, meaning there is a path between any pair of nodes in the graph.\n",
-        "2. It has no cycles, which means there are no closed loops or circuits in the graph.\n",
-        "3. It has exactly `n - 1` edges, where `n` is the number of nodes in the tree.\n",
-        "\n",
-        "The problem is typically given with two pieces of information:\n",
-        "\n",
-        "1. The number of nodes (`n`), which are usually labeled from 0 to `n-1`.\n",
-        "2. A list of undirected edges, where each edge is represented as a pair of nodes.\n",
-        "\n",
-        "The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.\n",
-        "\n",
-        "To solve this problem, you need to check the following conditions:\n",
-        "\n",
-        "1. There should be exactly `n - 1` edges to ensure that the graph is connected and tree-like.\n",
-        "2. There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.\n",
-        "3. The graph should be connected, which means you can reach any node from any other node through a series of edges.\n",
-        "\n",
-        "The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def validTree(n, edges):\n",
-        "    if len(edges) != n - 1:\n",
-        "        return False  # A tree with n nodes must have n-1 edges.\n",
-        "\n",
-        "    # Create an adjacency list to represent the graph.\n",
-        "    adj_list = {i: [] for i in range(n)}\n",
-        "    for u, v in edges:\n",
-        "        adj_list[u].append(v)\n",
-        "        adj_list[v].append(u)\n",
-        "\n",
-        "    visited = set()\n",
-        "\n",
-        "    # Define a recursive DFS function.\n",
-        "    def dfs(node, parent):\n",
-        "        if node in visited:\n",
-        "            return False  # If we encounter a visited node, there's a cycle.\n",
-        "        visited.add(node)\n",
-        "\n",
-        "        for neighbor in adj_list[node]:\n",
-        "            if neighbor != parent:\n",
-        "                if not dfs(neighbor, node):\n",
-        "                    return False\n",
-        "\n",
-        "        return True\n",
-        "\n",
-        "    # Start DFS from any node (e.g., node 0).\n",
-        "    if not dfs(0, -1):\n",
-        "        return False  # If there's a cycle, it's not a valid tree.\n",
-        "\n",
-        "    return len(visited) == n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `validTree` function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:\n",
-        "\n",
-        "1. It has exactly `n - 1` edges, where `n` is the number of nodes.\n",
-        "2. There are no cycles in the graph.\n",
-        "3. The graph is connected, meaning all nodes are reachable from any starting node.\n",
-        "\n",
-        "The code accomplishes this as follows:\n",
-        "\n",
-        "- It first checks if the number of edges is equal to `n - 1`. If not, it immediately returns `False` since a tree with `n` nodes must have `n - 1` edges to be connected.\n",
-        "\n",
-        "- It then constructs an adjacency list (`adj_list`) to represent the graph efficiently. This data structure stores the neighbors of each node.\n",
-        "\n",
-        "- The code uses a `visited` set to keep track of nodes visited during depth-first search (DFS).\n",
-        "\n",
-        "- The `dfs` function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns `False`.\n",
-        "\n",
-        "- The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.\n",
-        "\n",
-        "- After the DFS is complete, the code checks if the number of visited nodes is equal to `n`, ensuring the graph is connected.\n",
-        "\n",
-        "- Finally, if all conditions are met, the code returns `True`, indicating that the given edges form a valid tree. Otherwise, it returns `False`.\n",
-        "\n",
-        "The code provides examples to demonstrate how to use the `validTree` function to check whether a set of edges forms a valid tree or not."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 5\n",
-        "edges1 = [[0, 1], [0, 2], [0, 3], [1, 4]]\n",
-        "print(validTree(n1, edges1))  # Output: true"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 5\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]\n",
-        "print(validTree(n2, edges2))  # Output: false"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexities of the `validTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Constructing the adjacency list (`adj_list`) takes O(E) time, where E is the number of edges in the input graph (|edges|).\n",
-        "\n",
-        "2. The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.\n",
-        "\n",
-        "3. Checking if the number of visited nodes is equal to `n` takes O(1) time.\n",
-        "\n",
-        "Overall, the time complexity of the `validTree` function is O(E + V) in the worst case.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The adjacency list (`adj_list`) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.\n",
-        "\n",
-        "2. The `visited` set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.\n",
-        "\n",
-        "3. The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.\n",
-        "\n",
-        "Overall, the space complexity of the `validTree` function is O(V + E) due to the adjacency list and O(V) due to the `visited` set and DFS call stack.\n",
-        "\n",
-        "In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Minimum Spanning Tree (MST)**: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal's or Prim's algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.\n",
-        "\n",
-        "2. **Detecting Cycles**: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it's not a tree. This exercise enhances your ability to detect and visualize cycles in a graph."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb b/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb
deleted file mode 100644
index a8a7727..0000000
--- a/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 200. Number of Islands\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Islands problem on LeetCode, click here!](https://leetcode.com/problems/number-of-islands/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return *the number of islands*. \n",
-        "\n",
-        "An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == grid.length`\n",
-        "- `n == grid[i].length`\n",
-        "- `1 <= m, n <= 300`\n",
-        "- `grid[i][j]` is `'0'` or `'1'`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is about counting the number of islands in a 2D binary grid. In this grid, '1' represents land, and '0' represents water. An island is defined as a group of '1' cells that are adjacent to each other either horizontally or vertically. It's important to note that diagonal connections do not count. Additionally, it's assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn't \"wrap around.\"\n",
-        "\n",
-        "The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected '1' cells, and these connections can only occur horizontally or vertically. If there are no '1' cells in the grid, the number of islands would be zero.\n",
-        "\n",
-        "The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one '1' cell and explore its adjacent cells to determine the extent of the island. Once you've visited all the '1' cells in an island, you move on to the next unvisited '1' cell and repeat the process until you've counted all the islands in the grid.\n",
-        "\n",
-        "In essence, the problem asks you to analyze the grid to find groups of connected '1' cells and count them as individual islands. The goal is to return the total count of islands in the given grid.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def numIslands(self, grid: List[List[str]]) -> int:\n",
-        "        if not grid:\n",
-        "            return 0\n",
-        "\n",
-        "        m, n = len(grid), len(grid[0])  # Get the dimensions of the grid\n",
-        "        num_islands = 0  # Initialize the count of islands\n",
-        "\n",
-        "        def dfs(row, col):\n",
-        "            if row < 0 or row >= m or col < 0 or col >= n or grid[row][col] == '0':\n",
-        "                return\n",
-        "\n",
-        "            grid[row][col] = '0'  # Mark the current cell as visited by changing it to '0'\n",
-        "            directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]  # Define four possible directions to move\n",
-        "\n",
-        "            for dr, dc in directions:\n",
-        "                # Explore adjacent cells\n",
-        "                dfs(row + dr, col + dc)\n",
-        "\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if grid[i][j] == '1':\n",
-        "                    num_islands += 1  # Increment the island count\n",
-        "                    dfs(i, j)  # Start a DFS from the current '1' cell to explore the entire island\n",
-        "\n",
-        "        return num_islands\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class called `Solution` with a method called `numIslands`. This class is designed to count the number of islands in a 2D binary grid.\n",
-        "\n",
-        "The `numIslands` method takes a 2D grid as input, where '1' represents land, and '0' represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:\n",
-        "\n",
-        "1. Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).\n",
-        "\n",
-        "2. Determining the dimensions of the grid (number of rows and columns).\n",
-        "\n",
-        "3. Initializing a variable `num_islands` to keep track of the count of islands.\n",
-        "\n",
-        "4. Defining a nested function `dfs` to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing '1' to '0'.\n",
-        "\n",
-        "5. In the `dfs` function, it checks for boundary conditions and whether the current cell is '0'. If these conditions are met, it returns without further exploration.\n",
-        "\n",
-        "6. The `dfs` function explores neighboring cells in all four directions (up, down, left, right) using a loop.\n",
-        "\n",
-        "7. The main loop iterates through each cell of the grid. When a '1' cell is encountered, it increments the `num_islands` count and starts a DFS from that cell to explore the entire island.\n",
-        "\n",
-        "8. Finally, the method returns the total count of islands found in the grid.\n",
-        "\n",
-        "This code encapsulates the solution in a class, allowing you to create an instance of the `Solution` class and call the `numIslands` method on it to count the number of islands in a given grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid1 = [\n",
-        "  [\"1\", \"1\", \"1\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"0\", \"0\"]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "result1 = solution.numIslands(grid1)\n",
-        "print(\"Example 1 Output:\", result1)  # Expected output: 1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid2 = [\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"1\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"1\", \"1\"]\n",
-        "]\n",
-        "\n",
-        "result2 = solution.numIslands(grid2)\n",
-        "print(\"Example 2 Output:\", result2)  # Expected output: 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a depth-first search (DFS) to explore the grid and count the number of islands.\n",
-        "- In the worst case, it visits every cell in the grid exactly once.\n",
-        "- The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of $O(4^{max(m, n)})$, where m is the number of rows and n is the number of columns.\n",
-        "- Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity is determined by the recursive calls and the depth of the DFS stack.\n",
-        "- In the worst case, when the entire grid consists of '1's, the depth of the DFS recursion can be as deep as max(m, n).\n",
-        "- Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.\n",
-        "\n",
-        "In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it's important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n))."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Identify Largest Island:** In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.\n",
-        "\n",
-        "2. **Optimize for Space:** Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb b/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb
deleted file mode 100644
index 37624f6..0000000
--- a/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 207. Course Schedule\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Course Schedule problem on LeetCode, click here!](https://leetcode.com/problems/course-schedule/)\n",
-        "\n",
-        "---\n",
-        "There are a total of `numCourses` courses to take, labeled from 0 to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`. \n",
-        "\n",
-        "- For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.\n",
-        "\n",
-        "Return `true` if you can finish all courses. Otherwise, return `false`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `numCourses` <= 2000\n",
-        "- 0 <= `prerequisites.length` <= 5000\n",
-        "- `prerequisites[i].length` == 2\n",
-        "- 0 <= `ai`, `bi` < `numCourses`\n",
-        "- All the pairs `prerequisites[i]` are **unique**."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether it's possible to complete a set of courses given a list of prerequisites. You are given the following:\n",
-        "\n",
-        "- `numCourses`: The total number of courses to be taken, labeled from 0 to `numCourses - 1`.\n",
-        "- `prerequisites`: A list of prerequisite courses, where each element `prerequisites[i]` is a pair `[ai, bi]`, indicating that you must take course `bi` before you can take course `ai`.\n",
-        "\n",
-        "The goal is to check whether it's possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0]]`, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it's possible to complete all courses, so the function should return `True`.\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0], [0, 1]]`, it means you have two courses, but there's a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it's impossible to complete all courses, so the function should return `False`.\n",
-        "\n",
-        "The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it's possible to complete all courses; otherwise, it's not possible.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n",
-        "        # Create a graph using an adjacency list to represent the courses and their prerequisites.\n",
-        "        graph = defaultdict(list)  # Initialize an empty adjacency list.\n",
-        "        in_degree = [0] * numCourses  # Initialize an array to store in-degrees of courses.\n",
-        "\n",
-        "        # Populate the graph and calculate in-degrees.\n",
-        "        for course, prerequisite in prerequisites:\n",
-        "            graph[prerequisite].append(course)  # Add the course as a neighbor to its prerequisite.\n",
-        "            in_degree[course] += 1  # Increment the in-degree of the course.\n",
-        "\n",
-        "        # Initialize a queue with courses that have no prerequisites.\n",
-        "        queue = deque()\n",
-        "        for course in range(numCourses):\n",
-        "            if in_degree[course] == 0:\n",
-        "                queue.append(course)\n",
-        "\n",
-        "        # Perform topological sorting.\n",
-        "        while queue:\n",
-        "            course = queue.popleft()  # Take a course with no prerequisites.\n",
-        "            numCourses -= 1  # Decrement the count of remaining courses.\n",
-        "\n",
-        "            for neighbor in graph[course]:\n",
-        "                in_degree[neighbor] -= 1  # Remove the prerequisite relationship.\n",
-        "                if in_degree[neighbor] == 0:\n",
-        "                    queue.append(neighbor)  # If no more prerequisites, add to the queue.\n",
-        "\n",
-        "        # If all courses were successfully taken (numCourses becomes 0), return True.\n",
-        "        return numCourses == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here's a brief explanation of the code:\n",
-        "\n",
-        "1. The code defines a `Solution` class with a `canFinish` method that takes two parameters: `numCourses` (the total number of courses) and `prerequisites` (a list of pairs indicating which course must be taken before another).\n",
-        "\n",
-        "2. It initializes an empty graph as an adjacency list using a `defaultdict` to represent the courses and their prerequisites. It also initializes a list called `in_degree` to keep track of the in-degrees of courses, which is used in the topological sorting process.\n",
-        "\n",
-        "3. The code then populates the graph by iterating through the `prerequisites` list. For each pair `(ai, bi)`, it adds course `ai` as a neighbor to its prerequisite course `bi` in the graph and increments the in-degree of course `ai`.\n",
-        "\n",
-        "4. Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.\n",
-        "\n",
-        "5. The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).\n",
-        "\n",
-        "6. For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor's in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.\n",
-        "\n",
-        "7. The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.\n",
-        "\n",
-        "8. After the loop, if all courses were successfully taken (i.e., `numCourses` becomes 0), it means that there were no circular dependencies, and it's possible to finish all courses. In this case, the method returns `True`. Otherwise, if there are remaining courses (indicating a circular dependency), it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "numCourses1 = 2\n",
-        "prerequisites1 = [[1, 0]]\n",
-        "sol = Solution()\n",
-        "print(sol.canFinish(numCourses1, prerequisites1))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "numCourses2 = 2\n",
-        "prerequisites2 = [[1, 0], [0, 1]]\n",
-        "print(sol.canFinish(numCourses2, prerequisites2))  # Output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `canFinish` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Constructing the graph: In the first loop where we iterate through the `prerequisites` list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).\n",
-        "\n",
-        "2. Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all `numCourses` courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).\n",
-        "\n",
-        "3. Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).\n",
-        "\n",
-        "The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.\n",
-        "\n",
-        "2. In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.\n",
-        "\n",
-        "3. Queue: The space complexity for the queue is O(V), as it may contain all the courses.\n",
-        "\n",
-        "The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimizing Course Scheduling**: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.\n",
-        "\n",
-        "2. **Detecting Cycles in Course Dependencies**: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
deleted file mode 100644
index fb186f2..0000000
--- a/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb	
+++ /dev/null
@@ -1,236 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 3651. Number of Connected Components in an Undirected Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!](https://www.lintcode.com/problem/3651/)\n",
-        "\n",
-        "---\n",
-        "In this problem, there is an undirected graph with `n` nodes. There is also an `edges` array. Where `edges[i] = [a, b]` means that there is an edge between *node a* and *node b* in the graph.\n",
-        "\n",
-        "You need to return *the number of connected components in that graph*."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to determine the number of connected components in an undirected graph. Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "- You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.\n",
-        "\n",
-        "- A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.\n",
-        "\n",
-        "- Your task is to write a function that takes as input the number of nodes `n` and a list of edges `edges`, where each edge is represented as a pair of nodes `[a, b]` indicating an edge between node `a` and node `b`.\n",
-        "\n",
-        "- The goal is to determine the number of distinct connected components in the graph.\n",
-        "\n",
-        "- You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def countConnectedComponents(n, edges):\n",
-        "    # Define a helper function for depth-first search (DFS).\n",
-        "    def dfs(node):\n",
-        "        if not visited[node]:  # If the node has not been visited yet:\n",
-        "            visited[node] = True  # Mark it as visited.\n",
-        "            for neighbor in graph[node]:  # Explore all neighbors of the current node.\n",
-        "                dfs(neighbor)  # Recursively call DFS on the neighbor.\n",
-        "\n",
-        "    # Create an empty adjacency list to represent the graph.\n",
-        "    graph = [[] for _ in range(n)]\n",
-        "\n",
-        "    # Initialize a boolean list to keep track of visited nodes.\n",
-        "    visited = [False] * n\n",
-        "\n",
-        "    # Populate the adjacency list with edges from the input.\n",
-        "    for a, b in edges:\n",
-        "        graph[a].append(b)\n",
-        "        graph[b].append(a)  # Since the graph is undirected, we add edges in both directions.\n",
-        "\n",
-        "    # Initialize a counter to keep track of the number of connected components.\n",
-        "    count = 0\n",
-        "\n",
-        "    # Iterate through all nodes in the graph.\n",
-        "    for i in range(n):\n",
-        "        if not visited[i]:  # If the node has not been visited:\n",
-        "            count += 1  # Increment the count since we've found a new connected component.\n",
-        "            dfs(i)  # Start a depth-first search from the unvisited node to explore the component.\n",
-        "\n",
-        "    return count"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided Python code calculates the number of connected components in an undirected graph. Here's a high-level explanation of how the code works:\n",
-        "\n",
-        "1. The `countConnectedComponents` function takes two arguments: `n` (the number of nodes in the graph) and `edges` (a list of edge pairs representing connections between nodes).\n",
-        "\n",
-        "2. Inside the function, there is a helper function called `dfs` (depth-first search), which is used to explore and mark nodes as visited.\n",
-        "\n",
-        "3. An empty adjacency list called `graph` is created to represent the graph. The `graph` is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.\n",
-        "\n",
-        "4. Another list called `visited` is created to keep track of visited nodes. Initially, all nodes are marked as not visited (`False`).\n",
-        "\n",
-        "5. The code populates the `graph` by iterating through the `edges` list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.\n",
-        "\n",
-        "6. A counter variable called `count` is initialized to keep track of the number of connected components.\n",
-        "\n",
-        "7. The code iterates through all nodes from `0` to `n-1`. For each node, it checks whether it has been visited yet. If it hasn't been visited, it means a new connected component is found. The counter `count` is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.\n",
-        "\n",
-        "8. The `dfs` function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling `dfs` on unvisited neighbors.\n",
-        "\n",
-        "9. After the loop through all nodes, the `count` variable contains the total number of connected components in the graph.\n",
-        "\n",
-        "10. The function returns the value of `count`, which represents the number of connected components.\n",
-        "\n",
-        "11. Two examples are provided at the end to demonstrate how to use the function with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 3\n",
-        "edges1 = [[0, 1], [0, 2]]\n",
-        "print(countConnectedComponents(n1, edges1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 6\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [4, 5]]\n",
-        "print(countConnectedComponents(n2, edges2))  # Output: 2"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through all nodes in the graph (from 0 to `n-1`).\n",
-        "- For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.\n",
-        "- In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.\n",
-        "- The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.\n",
-        "- In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.\n",
-        "\n",
-        "So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The main data structures used are the `graph` (adjacency list), `visited` (boolean array), and the recursive call stack for DFS.\n",
-        "- The `graph` has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.\n",
-        "- The `visited` boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.\n",
-        "- The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.\n",
-        "\n",
-        "So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).\n",
-        "\n",
-        "In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Disconnected Components with Multiple Queries:** You are given an undirected graph with `n` nodes and `m` edges. Initially, the graph is disconnected, and you need to process `q` queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.\n",
-        "\n",
-        "2. **Maximum Size of Connected Components:** Given an undirected graph with `n` nodes and `m` edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.\n"
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
deleted file mode 100644
index eb34497..0000000
--- a/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb	
+++ /dev/null
@@ -1,261 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 417. Pacific Atlantic Water Flow\n",
-        "\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Pacific Atlantic Water Flow problem on LeetCode, click here!](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n",
-        "\n",
-        "---\n",
-        "There is an `m x n` rectangular island that borders both the **Pacific Ocean** and **Atlantic Ocean**. The **Pacific Ocea**n touches the island's left and top edges, and the **Atlantic Ocean** touches the island's right and bottom edges.\n",
-        "\n",
-        "The island is partitioned into a grid of square cells. You are given an `m x n` integer matrix `heights` where `heights[r][c]` represents the **height above sea level** of the cell at coordinate `(r, c)`.\n",
-        "\n",
-        "The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is **less than or equal to** the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.\n",
-        "\n",
-        "Return *a **2D list** of grid coordinates `result` where $result[i] = [r_i, c_i]$ denotes that rain water can flow from cell $(r_i, c_i)$ to **both** the Pacific and Atlantic oceans*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == heights.length`\n",
-        "- `n == heights[r].length`\n",
-        "- `1 <= m, n <= 200`\n",
-        "- 0 <= `heights[r][c]` <= $10^5$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island's left and top edges, while the Atlantic Ocean is in contact with the island's right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "Here are the key details and constraints of the problem:\n",
-        "\n",
-        "1. The island is divided into a grid of square cells.\n",
-        "\n",
-        "2. Each cell is represented by an integer value in a matrix `heights`. The value at `heights[r][c]` represents the height above sea level of the cell at coordinates `(r, c)` on the island.\n",
-        "\n",
-        "3. Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "4. Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.\n",
-        "\n",
-        "The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.\n",
-        "\n",
-        "The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.\n",
-        "\n",
-        "The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:\n",
-        "        # Check if the input matrix is empty\n",
-        "        if not heights:\n",
-        "            return []\n",
-        "        \n",
-        "        m, n = len(heights), len(heights[0])\n",
-        "        \n",
-        "        # Initialize boolean matrices to keep track of cells reachable from each ocean\n",
-        "        pacific_reachable = [[False] * n for _ in range(m)]\n",
-        "        atlantic_reachable = [[False] * n for _ in range(m)]\n",
-        "        \n",
-        "        # Depth-First Search (DFS) function to mark cells that can be reached from an ocean\n",
-        "        def dfs(x, y, reachable):\n",
-        "            if reachable[x][y]:\n",
-        "                return\n",
-        "            reachable[x][y] = True\n",
-        "            for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n",
-        "                new_x, new_y = x + dx, y + dy\n",
-        "                if 0 <= new_x < m and 0 <= new_y < n and heights[new_x][new_y] >= heights[x][y]:\n",
-        "                    dfs(new_x, new_y, reachable)\n",
-        "        \n",
-        "        # Start DFS from the Pacific Ocean (left and top edges)\n",
-        "        for i in range(m):\n",
-        "            dfs(i, 0, pacific_reachable)\n",
-        "            dfs(i, n - 1, atlantic_reachable)\n",
-        "        \n",
-        "        for j in range(n):\n",
-        "            dfs(0, j, pacific_reachable)\n",
-        "            dfs(m - 1, j, atlantic_reachable)\n",
-        "        \n",
-        "        result = []\n",
-        "        \n",
-        "        # Find cells that can flow to both the Pacific and Atlantic oceans\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if pacific_reachable[i][j] and atlantic_reachable[i][j]:\n",
-        "                    result.append([i, j])\n",
-        "        \n",
-        "        return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class called `Solution` with a method named `pacificAtlantic`. This method takes a 2D matrix `heights`, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, `pacific_reachable` and `atlantic_reachable`, to keep track of cells that can be reached from each ocean.\n",
-        "\n",
-        "The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the `result` list.\n",
-        "\n",
-        "Finally, the code returns the `result` list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "heights1 = [\n",
-        "    [1,2,2,3,5],\n",
-        "    [3,2,3,4,4],\n",
-        "    [2,4,5,3,1],\n",
-        "    [6,7,1,4,5],\n",
-        "    [5,1,1,2,4]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "print(solution.pacificAtlantic(heights1)) # Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "heights2 = [[1]]\n",
-        "print(solution.pacificAtlantic(heights2)) # Expected Output: [[0, 0]]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of this solution is O(m * n), where 'm' is the number of rows in the input matrix and 'n' is the number of columns. Here's a breakdown of the time complexity:\n",
-        "\n",
-        "1. Creating the `pacific_reachable` and `atlantic_reachable` matrices with dimensions m x n takes O(m * n) time.\n",
-        "\n",
-        "2. Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.\n",
-        "\n",
-        "3. The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.\n",
-        "\n",
-        "4. The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.\n",
-        "\n",
-        "Overall, the time complexity is dominated by the DFS and is O(m * n).\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of this solution is also O(m * n). Here's how the space is used:\n",
-        "\n",
-        "1. Two boolean matrices, `pacific_reachable` and `atlantic_reachable`, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.\n",
-        "\n",
-        "2. The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).\n",
-        "\n",
-        "3. The `result` list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.\n",
-        "\n",
-        "The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.\n",
-        "\n",
-        "2. **Efficiency Challenge:** Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/11. Graphs/README.md b/_build/html/_sources/11. Graphs/README.md
deleted file mode 100644
index aad262c..0000000
--- a/_build/html/_sources/11. Graphs/README.md	
+++ /dev/null
@@ -1,23 +0,0 @@
-# Graphs Problems - Blind 75 LeetCode
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb b/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb
deleted file mode 100644
index 81f0e5b..0000000
--- a/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb	
+++ /dev/null
@@ -1,256 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 892. Alien Dictionary\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Alien Dictionary problem on LintCode, click here!](https://www.lintcode.com/problem/892/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of **non-empty** words from the dictionary, where words are **sorted lexicographically by the rules of this new language**. Derive the order of letters in this language.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You may assume all letters are in lowercase.\n",
-        "- The dictionary is invalid, if string a is prefix of string b and b is appear before a.\n",
-        "- If the order is invalid, return an empty string.\n",
-        "- There may be multiple valid order of letters, return the smallest in normal lexicographical order.\n",
-        "- The letters in **one** string are of the same rank by default and are sorted in Human dictionary order."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.\n",
-        "\n",
-        "Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "1. The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.\n",
-        "\n",
-        "2. Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.\n",
-        "\n",
-        "3. Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string 'a' is a prefix of another string 'b,' and 'b' appears before 'a' in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.\n",
-        "\n",
-        "4. Multiple valid orders: It's possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.\n",
-        "\n",
-        "To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it's valid, and an empty string if the order is invalid.\n",
-        "\n",
-        "The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "\n",
-        "def alienOrder(words):\n",
-        "    # Create an adjacency list to represent the graph\n",
-        "    graph = defaultdict(list)\n",
-        "    \n",
-        "    # Create a dictionary to store the in-degrees of each letter\n",
-        "    in_degree = {}\n",
-        "    \n",
-        "    # Initialize in-degrees to 0 for all letters\n",
-        "    for word in words:\n",
-        "        for char in word:\n",
-        "            if char not in in_degree:\n",
-        "                in_degree[char] = 0\n",
-        "    \n",
-        "    # Build the graph and update in-degrees\n",
-        "    for i in range(1, len(words)):\n",
-        "        word1, word2 = words[i-1], words[i]\n",
-        "        min_length = min(len(word1), len(word2))\n",
-        "        \n",
-        "        # Compare characters in the two words\n",
-        "        j = 0\n",
-        "        while j < min_length and word1[j] == word2[j]:\n",
-        "            j += 1\n",
-        "        \n",
-        "        if j < min_length:\n",
-        "            # If word1[j] is lexicographically before word2[j], add an edge\n",
-        "            graph[word1[j]].append(word2[j])\n",
-        "            in_degree[word2[j]] += 1\n",
-        "            \n",
-        "            # Break the loop to avoid further comparisons\n",
-        "            break\n",
-        "    \n",
-        "    # Perform topological sorting using Kahn's algorithm\n",
-        "    result = []\n",
-        "    queue = deque([char for char in in_degree if in_degree[char] == 0])\n",
-        "    \n",
-        "    while queue:\n",
-        "        char = queue.popleft()\n",
-        "        result.append(char)\n",
-        "        \n",
-        "        for neighbor in graph[char]:\n",
-        "            in_degree[neighbor] -= 1\n",
-        "            if in_degree[neighbor] == 0:\n",
-        "                queue.append(neighbor)\n",
-        "    \n",
-        "    # Check if there is a valid order\n",
-        "    if len(result) < len(in_degree):\n",
-        "        return \"\"\n",
-        "    \n",
-        "    return \"\".join(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.\n",
-        "\n",
-        "The code follows these main steps:\n",
-        "\n",
-        "1. Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called `in_degree` to keep track of the in-degrees (the number of letters that precede a letter) for each letter.\n",
-        "\n",
-        "2. Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the `in_degree` dictionary with an initial in-degree of 0.\n",
-        "\n",
-        "3. Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there's an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.\n",
-        "\n",
-        "4. After constructing the graph, the code performs a topological sorting of the letters using Kahn's algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.\n",
-        "\n",
-        "5. Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there's a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.\n",
-        "\n",
-        "The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "wrtef\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "words1 = [\"wrt\", \"wrf\", \"er\", \"ett\", \"rftt\"]\n",
-        "print(alienOrder(words1))  # Output: \"wertf\""
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "zx\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "words2 = [\"z\", \"x\"]\n",
-        "print(alienOrder(words2))  # Output: \"zx\""
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for determining the order of letters in an alien language.\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.\n",
-        "2. Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.\n",
-        "\n",
-        "Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.\n",
-        "2. Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.\n",
-        "3. Queue: The space used by the queue during topological sorting is also O(V).\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.\n",
-        "\n",
-        "In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.\n",
-        "\n",
-        "In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Valid Orders**: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.\n",
-        "\n",
-        "2. **Detect Invalid Dictionary**: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/12. Advanced Graphs/README.md b/_build/html/_sources/12. Advanced Graphs/README.md
deleted file mode 100644
index f362de7..0000000
--- a/_build/html/_sources/12. Advanced Graphs/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Advanced Graphs Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb b/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb
deleted file mode 100644
index 8d32e21..0000000
--- a/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb	
+++ /dev/null
@@ -1,103 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night.**\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight **without alerting the police**.*\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 400`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nThe problem is a classic dynamic programming challenge known as the \"House Robber\" problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.\n\nThe goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.\n\nThe input to the problem is an array `nums`, where `nums[i]` represents the amount of money in the `i`-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.\n\nFor example:\n```\nInput: nums = [1,2,3,1]\nOutput: 4\nExplanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).\nTotal amount you can rob = 1 + 3 = 4.\n\nInput: nums = [2,7,9,3,1]\nOutput: 12\nExplanation: Rob house 1 (money = 2), rob house 3 (money = 9), and rob house 5 (money = 1).\nTotal amount you can rob = 2 + 9 + 1 = 12.\n```\n\nThe challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        # Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses\n        prev, curr = 0, 0\n\n        # Iterate through the houses\n        for n in nums:\n            # Calculate the maximum amount of money that can be robbed at the current house\n            # It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),\n            # or skipping the current house and taking the maximum amount from the previous house (curr)\n            temp = max(n + prev, curr)\n\n            # Update the variables for the next iteration\n            prev, curr = curr, temp\n\n        # The final result is the maximum amount of money that can be robbed at the last house\n        return curr",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 4,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code is a Python implementation of the \"House Robber\" problem using a dynamic programming approach. It's part of a class `Solution` and includes a method `rob` that takes a list of integers `nums` as input and returns the maximum amount of money that can be robbed without alerting the police.\n\nThe key idea of the algorithm is to maintain two variables, `prev` and `curr`, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.\n\nThe loop calculates a temporary variable `temp` that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (`n + prev`), or skipping the current house and taking the maximum amount from the previous house (`curr`). The maximum of these two scenarios is assigned to `temp`.\n\nThe `prev` and `curr` variables are then updated for the next iteration. `prev` is set to the previous value of `curr`, and `curr` is set to the calculated `temp`.\n\nThe final result is the value stored in the `curr` variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the `rob` method.\n\nThe provided test cases at the end demonstrate the usage of the `rob` method with different input arrays.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\nsol = Solution()\n\nnums1 = [1, 2, 3, 1]\nprint(sol.rob(nums1))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 5,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [2, 7, 9, 3, 1]\nprint(sol.rob(nums2))  # Output: 12",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 6,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "12\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code.\n\n### Time Complexity:\n\nThe time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).\n\n### Space Complexity:\n\nThe space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables `prev`, `curr`, and `temp` are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).\n\nIn summary:\n- Time Complexity: O(n)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Variation with Maximum Number of Houses to Rob:** Modify the problem to include an additional constraint: you are allowed to rob at most 'k' houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.\n\n2. **Robbing in a Circular Street:** Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.\n\n\n**Link to Problem:** [To see the House Robber problem on LeetCode, click here!](https://leetcode.com/problems/house-robber/description/)\n",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb b/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb
deleted file mode 100644
index b1080e8..0000000
--- a/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb	
+++ /dev/null
@@ -1,119 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber II\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle**. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatically contact the police if two adjacent houses were broken into on the same night**.\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight without alerting the police*.\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 1000`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nCertainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.\n\nThe twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.\n\nThe goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array `nums` representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.\n\nHere are a few examples to illustrate the problem:\n\n1. **Example 1:**\n   ```python\n   Input: nums = [2, 3, 2]\n   Output: 3\n   Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2) because they are adjacent houses. The optimal strategy is to rob house 2 (money = 3).\n   ```\n\n2. **Example 2:**\n   ```python\n   Input: nums = [1, 2, 3, 1]\n   Output: 4\n   Explanation: Robbing house 1 (money = 1) and then robbing house 3 (money = 3) results in a total amount of 4. Robbing house 2 is skipped to avoid alerting the police.\n   ```\n\n3. **Example 3:**\n   ```python\n   Input: nums = [1, 2, 3]\n   Output: 3\n   Explanation: Since the houses are in a circle, you can choose either house 1, 2, or 3. The optimal strategy is to rob house 3 for a total amount of 3.\n   ```\n\nThe constraints for the problem are that the length of the `nums` array is between 1 and 100, and the amount of money in each house (`nums[i]`) is between 0 and 1000.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        def simple_rob(nums):\n            # Helper function for basic house robbery problem\n            prev, curr = 0, 0\n            for num in nums:\n                # Calculate the maximum amount of money that can be robbed\n                # without alerting the police for each house\n                prev, curr = curr, max(prev + num, curr)\n            return curr\n\n        # Check the base cases where the length of nums is 1 or 2\n        if len(nums) == 1:\n            return nums[0]\n        elif len(nums) == 2:\n            return max(nums[0], nums[1])\n\n        # Case 1: First house is robbed, last house is not\n        case1 = simple_rob(nums[:-1])\n\n        # Case 2: First house is not robbed, last house is\n        case2 = simple_rob(nums[1:])\n\n        # Maximum of the two cases\n        return max(case1, case2)",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 7,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code defines a class `Solution` with a method `rob`, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.\n\nThe code uses dynamic programming to solve the problem efficiently. It contains a helper function `simple_rob` that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method `rob` handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.\n\nThe class is instantiated as `solution`, and the `rob` method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\n\n# Create an instance of the Solution class\nsolution = Solution()\n\nnums1 = [2, 3, 2]\nprint(solution.rob(nums1))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 8,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [1, 2, 3, 1]\nprint(solution.rob(nums2))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 9,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums3 = [1, 2, 3]\nprint(solution.rob(nums3))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 10,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "e6e1554f-ae77-410c-8af2-e59e5428166c"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code:\n\n### Time Complexity:\nThe time complexity is primarily determined by the `simple_rob` helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main `rob` function calls `simple_rob` twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).\n\n### Space Complexity:\nThe space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are `prev` and `curr` in the `simple_rob` function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).\n\nIn summary:\n- Time Complexity: O(N)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Optimization Challenge:** Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?\n\n2. **Circular Robbery Variations:** Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.\n\n**Link to Problem:** [To see the House Robber II problem on LeetCode, click here!](https://leetcode.com/problems/house-robber-ii/)",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
deleted file mode 100644
index b727489..0000000
--- a/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 70. Climbing Stairs\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Climbing Stairs problem on LeetCode, click here!](https://leetcode.com/problems/climbing-stairs/)\n",
-        "\n",
-        "---\n",
-        "You are climbing a staircase. It takes `n` steps to reach the top.\n",
-        "\n",
-        "Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= n <= 45`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Climbing Stairs\" problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here's the problem statement:\n",
-        "\n",
-        "You are given a staircase with 'n' steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.\n",
-        "\n",
-        "For example, if 'n' is 2, there are two ways to climb to the top:\n",
-        "\n",
-        "1. Climbing two steps at once.\n",
-        "2. Climbing one step, and then another step.\n",
-        "\n",
-        "If 'n' is 3, there are three ways:\n",
-        "\n",
-        "1. Climbing one step, then one step, and finally one step.\n",
-        "2. Climbing one step, then two steps.\n",
-        "3. Climbing two steps, then one step.\n",
-        "\n",
-        "The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It's a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Solution:\n",
-        "    def climbStairs(self, n: int) -> int:\n",
-        "        # If there are 1 or 2 steps, there are exactly n ways to reach the top.\n",
-        "        if n <= 2:\n",
-        "            return n\n",
-        "\n",
-        "        # Create an array to store the number of ways to reach each step.\n",
-        "        dp = [0] * (n + 1)\n",
-        "\n",
-        "        # There is one way to reach the first step (base case).\n",
-        "        dp[1] = 1\n",
-        "\n",
-        "        # There are two ways to reach the second step (base case).\n",
-        "        dp[2] = 2\n",
-        "\n",
-        "        # Calculate the number of ways to reach each step from the previous steps.\n",
-        "        for i in range(3, n + 1):\n",
-        "            # The number of ways to reach step 'i' is the sum of the ways to reach\n",
-        "            # the previous two steps, as you can take 1 or 2 steps at a time.\n",
-        "            dp[i] = dp[i - 1] + dp[i - 2]\n",
-        "\n",
-        "        # The result is the number of ways to reach the top, which is stored in dp[n].\n",
-        "        return dp[n]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class `Solution` with a method `climbStairs` that takes an integer `n` as input and returns the number of distinct ways to climb a staircase with `n` steps.\n",
-        "\n",
-        "1. If `n` is 1 or 2, the function returns `n` directly because there are only 1 or 2 distinct ways to reach the top in those cases.\n",
-        "\n",
-        "2. For `n` greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array `dp` of length `n + 1` to store these values.\n",
-        "\n",
-        "3. The `dp[1]` and `dp[2]` are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).\n",
-        "\n",
-        "4. The code then uses a loop to fill in the `dp` array for steps 3 and above. For each step `i` from 3 to `n`, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.\n",
-        "\n",
-        "5. Finally, the function returns the value stored in `dp[n]`, which represents the total number of distinct ways to climb the staircase with `n` steps."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 - Input: n = 2, Output: 2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "n = 2\n",
-        "solution = Solution()\n",
-        "print(f\"Example 1 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 2"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 - Input: n = 3, Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "n = 3\n",
-        "print(f\"Example 2 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the `dp` array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value `n`.\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of the solution is O(n) as well. We use an array `dp` of length `n + 1` to store the number of ways to reach each step. The size of this array is directly proportional to the input value `n`, which makes the space complexity linear in terms of `n`. The rest of the variables used in the function (e.g., `i`) occupy constant space and do not contribute significantly to the overall space complexity.\n",
-        "\n",
-        "In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the \"Climbing Stairs\" problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized Step Sizes**: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes `[1, 2, 3]`. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.\n",
-        "\n",
-        "2. **Minimize Steps**: Given an integer `n`, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/_build/html/_sources/13. One-D Dynamic Programming/README.md b/_build/html/_sources/13. One-D Dynamic Programming/README.md
deleted file mode 100644
index 73f4de3..0000000
--- a/_build/html/_sources/13. One-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,25 +0,0 @@
-# 1-D Dynamic Programming Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Medium     |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/14. Two-D Dynamic Programming/README.md b/_build/html/_sources/14. Two-D Dynamic Programming/README.md
deleted file mode 100644
index 8bab876..0000000
--- a/_build/html/_sources/14. Two-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### 2-D Dynamic Programming
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/15. Greedy/README.md b/_build/html/_sources/15. Greedy/README.md
deleted file mode 100644
index 82b6543..0000000
--- a/_build/html/_sources/15. Greedy/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Greedy
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/16. Intervals/README.md b/_build/html/_sources/16. Intervals/README.md
deleted file mode 100644
index a57713e..0000000
--- a/_build/html/_sources/16. Intervals/README.md	
+++ /dev/null
@@ -1,50 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Intervals
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/17. Math Geometry/README.md b/_build/html/_sources/17. Math Geometry/README.md
deleted file mode 100644
index 8b2f180..0000000
--- a/_build/html/_sources/17. Math Geometry/README.md	
+++ /dev/null
@@ -1,48 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Math & Geometry
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/18. Bit Manipulation/README.md b/_build/html/_sources/18. Bit Manipulation/README.md
deleted file mode 100644
index 05b2fef..0000000
--- a/_build/html/_sources/18. Bit Manipulation/README.md	
+++ /dev/null
@@ -1,51 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Bit Manupulation
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sources/Book.ipynb b/_build/html/_sources/Book.ipynb
deleted file mode 100644
index d400192..0000000
--- a/_build/html/_sources/Book.ipynb
+++ /dev/null
@@ -1,373 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 34,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "\u001b[01mmaking output directory... \u001b[39;49;00mdone\n",
-      "[etoc] Changing master_doc to 'README'\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]  \n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.26 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.00 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]     \n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.92 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 0.90 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.28 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executing notebook using local CWD [mystnb]      \n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executed notebook in 1.17 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executed notebook in 1.16 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executing notebook using local CWD [mystnb] \n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executed notebook in 1.27 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executed notebook in 1.24 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executed notebook in 4.03 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executing notebook using local CWD [mystnb]   \n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/Book.ipynb: Executing notebook using local CWD [mystnb]                          \n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mSECURITY\u001b[39;49;00m                                              \n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb:30008: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Executing notebook failed: CellTimeoutError [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Notebook exception traceback saved in: /workspaces/LeetCode-Solutions/_build/html/reports/Book.err.log [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CODE_OF_CONDUCT.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/SECURITY.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[ 94%] \u001b[32mBook\u001b[39;49;00m                                                   raph\u001b[39;49;00m0m\r"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
diff --git a/_build/html/_sources/CODE_OF_CONDUCT.md b/_build/html/_sources/CODE_OF_CONDUCT.md
deleted file mode 100644
index 5fe5041..0000000
--- a/_build/html/_sources/CODE_OF_CONDUCT.md
+++ /dev/null
@@ -1,128 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, religion, or sexual identity
-and orientation.
-
-We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.
-
-## Our Standards
-
-Examples of behavior that contributes to a positive environment for our
-community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes,
-  and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the
-  overall community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or
-  advances of any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or email
-  address, without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Enforcement Responsibilities
-
-Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.
-
-Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.
-
-## Scope
-
-This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official e-mail address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-Email.
-All complaints will be reviewed and investigated promptly and fairly.
-
-All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.
-
-## Enforcement Guidelines
-
-Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:
-
-### 1. Correction
-
-**Community Impact**: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.
-
-**Consequence**: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.
-
-### 2. Warning
-
-**Community Impact**: A violation through a single incident or series
-of actions.
-
-**Consequence**: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or
-permanent ban.
-
-### 3. Temporary Ban
-
-**Community Impact**: A serious violation of community standards, including
-sustained inappropriate behavior.
-
-**Consequence**: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.
-
-### 4. Permanent Ban
-
-**Community Impact**: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior,  harassment of an
-individual, or aggression toward or disparagement of classes of individuals.
-
-**Consequence**: A permanent ban from any sort of public interaction within
-the community.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage],
-version 2.0, available at
-https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
-
-Community Impact Guidelines were inspired by [Mozilla's code of conduct
-enforcement ladder](https://github.com/mozilla/diversity).
-
-[homepage]: https://www.contributor-covenant.org
-
-For answers to common questions about this code of conduct, see the FAQ at
-https://www.contributor-covenant.org/faq. Translations are available at
-https://www.contributor-covenant.org/translations.
diff --git a/_build/html/_sources/CONTRIBUTING.md b/_build/html/_sources/CONTRIBUTING.md
deleted file mode 100644
index ca794ef..0000000
--- a/_build/html/_sources/CONTRIBUTING.md
+++ /dev/null
@@ -1,79 +0,0 @@
-# Contributing Guidelines
-
-Thank you for considering contributing to the Blind 75 LeetCode repository! We welcome contributions from the community to help improve this resource and make it even more valuable.
-
-Please take a moment to review this document to understand how you can contribute.
-
-## Table of Contents
-- [Ways to Contribute](#ways-to-contribute)
-- [Getting Started](#getting-started)
-- [Contributing Process](#contributing-process)
-- [Code of Conduct](#code-of-conduct)
-
-## Ways to Contribute
-
-There are several ways you can contribute to this repository:
-
-1. **Suggest Improvements**: If you have ideas for making the Blind 75 LeetCode repository better, please open an issue to discuss your suggestions.
-
-2. **Report Issues**: If you encounter any issues with the existing content or code, please open an issue and provide as much detail as possible.
-
-3. **Contribute Solutions**: You can contribute solutions to the problems listed in the repository. Please follow the guidelines mentioned below when submitting your solutions.
-
-4. **Enhance Documentation**: Improve documentation, including explanations and time/space complexity analysis, for existing solutions.
-
-5. **Fix Bugs**: If you find and fix any bugs in the existing code or documentation, you are welcome to submit a pull request.
-
-## Getting Started
-
-Before you start contributing, please ensure you have the following prerequisites:
-
-- A GitHub account.
-- Familiarity with Git and GitHub.
-- Code editor or IDE for making changes.
-
-## Contributing Process
-
-Here's the general process for contributing:
-
-1. **Fork the Repository**: Click the "Fork" button at the top of this repository to create your copy.
-
-2. **Clone Your Fork**: Clone your fork to your local machine.
-
-    ```
-    git clone https://github.com/your-username/Blind-75-LeetCode.git
-    ```
-
-3. **Create a Branch**: Create a new branch for your contribution.
-
-    ```
-    git checkout -b feature/your-feature-name
-    ```
-
-4. **Make Changes**: Implement your changes, following the guidelines provided.
-
-5. **Test Your Changes**: Ensure that your changes do not introduce new issues and are consistent with the repository's style and structure.
-
-6. **Commit Changes**: Commit your changes with a meaningful commit message.
-
-    ```
-    git commit -m "Add solution to problem X"
-    ```
-
-7. **Push Changes**: Push your changes to your fork on GitHub.
-
-    ```
-    git push origin feature/your-feature-name
-    ```
-
-8. **Create a Pull Request**: Go to the original repository and create a pull request. Please provide a detailed description of your changes.
-
-9. **Review and Collaboration**: Your pull request will be reviewed, and you may need to make further changes. Be responsive to comments and feedback.
-
-10. **Merge**: Once your pull request is approved, it will be merged into the main branch.
-
-## Code of Conduct
-
-Please note that we have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-We appreciate your contributions to the Blind 75 LeetCode repository and look forward to working together to make it an even better resource for the community!
diff --git a/_build/html/_sources/README.md b/_build/html/_sources/README.md
deleted file mode 100644
index a9b8b2e..0000000
--- a/_build/html/_sources/README.md
+++ /dev/null
@@ -1,216 +0,0 @@
-# Blind 75 LeetCode Solutions
-
-![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Solutions-blue?labelColor=red)
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Array & Hashing
-![Array & Hashing](https://img.shields.io/badge/Array_&_Hashing-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                        | Easy       |
-| [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)                                  | Easy       |
-| [1. Two Sum](https://leetcode.com/problems/two-sum/)                                              | Easy       |
-| [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/)                                | Medium     |
-| [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)              | Medium     |
-| [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)    | Medium     |
-| [659. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)          | Medium     |
-| [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)    | Hard       |
-
-### Two Pointers
-![Array & Hashing](https://img.shields.io/badge/Two_Pointers-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-### Sliding Window
-![Array & Hashing](https://img.shields.io/badge/Sliding_Window-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-### Stack
-![Array & Hashing](https://img.shields.io/badge/Stack-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-### Binary Search
-![Array & Hashing](https://img.shields.io/badge/Binary_Search-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-### Linked List
-![Array & Hashing](https://img.shields.io/badge/Linked_List-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-### Trees
-![Array & Hashing](https://img.shields.io/badge/Trees-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-### Tries
-![Array & Hashing](https://img.shields.io/badge/Tries-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-### Heap / Priority Queue
-![Array & Hashing](https://img.shields.io/badge/Heap_/_Priority_Queue-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-### Backtracking
-![Array & Hashing](https://img.shields.io/badge/Backtracking-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)                                 | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                                         | Medium     |
-
-### Graphs
-![Array & Hashing](https://img.shields.io/badge/Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-### Advanced Graphs
-![Array & Hashing](https://img.shields.io/badge/Advanced_Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-### 1-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/1_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Easy       |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-### 2-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/2_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-### Greedy
-![Array & Hashing](https://img.shields.io/badge/Greedy-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-### Intervals
-![Array & Hashing](https://img.shields.io/badge/Intervals-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-### Math & Geometry
-![Array & Hashing](https://img.shields.io/badge/Math_&_Geometry-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-### Bit Manipulation
-![Array & Hashing](https://img.shields.io/badge/Bit_Manipulation-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-## Code of Conduct
-
-We have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-## Security Policy
-
-We take security seriously. Please review our [Security Policy](SECURITY.md) for information on reporting security vulnerabilities.
-
-Happy coding!
diff --git a/_build/html/_sources/SECURITY.md b/_build/html/_sources/SECURITY.md
deleted file mode 100644
index 7c19993..0000000
--- a/_build/html/_sources/SECURITY.md
+++ /dev/null
@@ -1,42 +0,0 @@
-# Security Policy
-
-## Reporting a Vulnerability
-
-We take the security of the Blind 75 LeetCode repository seriously. If you believe you have found a security vulnerability, please help us by following these steps:
-
-1. **Do Not Disclose Publicly**: Please do not disclose the issue publicly until it has been addressed by our team.
-
-2. **Report Privately**: Create a GitHub issue with the title "Security Vulnerability Report" and provide a detailed description of the vulnerability. You can use a sample report template as follows:
-
-    ```
-    **Description**
-    A clear and concise description of the security vulnerability.
-
-    **Steps to Reproduce**
-    Provide detailed steps on how to reproduce the vulnerability.
-
-    **Expected Behavior**
-    Describe what you expected to happen.
-
-    **Actual Behavior**
-    Describe what actually happened.
-
-    **Additional Information**
-    Any additional information that can help us understand and reproduce the issue, such as environment details, configuration, or screenshots.
-    ```
-
-3. **Secure Communication**: If the vulnerability involves sensitive data, please encrypt your communication with our PGP key. Contact us for our PGP key information.
-
-4. **Response**: We will acknowledge your report within 5 business days and provide an estimated timeline for the resolution.
-
-5. **Fix and Disclosure**: We will work to fix the issue promptly and privately. Once resolved, we will provide a security advisory and give credit to the reporter if desired.
-
-6. **Responsible Disclosure**: We encourage responsible disclosure. Please do not take advantage of the vulnerability or attempt to exploit it for malicious purposes.
-
-## Security Updates
-
-We are committed to promptly addressing and resolving any security issues. We recommend that you stay up-to-date with the latest releases of this repository, as they may include security updates and fixes.
-
-## Contact
-
-If you have any questions or need further assistance regarding security, you can contact us at mohsentabibian@gmail.com.
diff --git a/_build/html/genindex.html b/_build/html/genindex.html
deleted file mode 100644
index 13d2f0f..0000000
--- a/_build/html/genindex.html
+++ /dev/null
@@ -1,480 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
-    <title>Index &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'genindex';</script>
-    <link rel="index" title="Index" href="#" />
-    <link rel="search" title="Search" href="search.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2Fgenindex.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1></h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-
-<h1 id="index">Index</h1>
-
-<div class="genindex-jumpbox">
- 
-</div>
-
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/_build/html/index.html b/_build/html/index.html
deleted file mode 100644
index 960bb69..0000000
--- a/_build/html/index.html
+++ /dev/null
@@ -1 +0,0 @@
-<meta http-equiv="Refresh" content="0; url=README.html" />
diff --git a/_build/html/objects.inv b/_build/html/objects.inv
deleted file mode 100644
index fc3664e..0000000
Binary files a/_build/html/objects.inv and /dev/null differ
diff --git a/_build/html/searchindex.js b/_build/html/searchindex.js
deleted file mode 100644
index 8321071..0000000
--- a/_build/html/searchindex.js
+++ /dev/null
@@ -1 +0,0 @@
-Search.setIndex({"docnames": ["01. Array Hashing/1. Two Sum", "01. Array Hashing/128. Longest Consecutive Sequence", "01. Array Hashing/217. Contains Duplicate", "01. Array Hashing/238. Product of Array Except Self", "01. Array Hashing/242. Valid Anagram", "01. Array Hashing/347. Top K Frequent Elements", "01. Array Hashing/49. Group Anagrams", "01. Array Hashing/659. Encode and Decode Strings", "01. Array Hashing/README", "02. Two Pointers/11. Container With Most Water", "02. Two Pointers/125. Valid Palindrome", "02. Two Pointers/15. 3Sum", "02. Two Pointers/README", "03. Sliding Window/121. Best Time to Buy and Sell Stock", "03. Sliding Window/3. Longest Substring Without Repeating Characters", "03. Sliding Window/424. Longest Repeating Character Replacement", "03. Sliding Window/76. Minimum Window Substring", "03. Sliding Window/README", "04. Stack/20. Valid Parentheses", "04. Stack/README", "05. Binary Search/153. Find Minimum in Rotated Sorted Array", "05. Binary Search/33. Search in Rotated Sorted Array", "05. Binary Search/README", "06. Linked List/141. Linked List Cycle", "06. Linked List/143. Reorder List", "06. Linked List/19. Remove Nth Node From End of List", "06. Linked List/206. Reverse Linked List", "06. Linked List/21. Merge Two Sorted Lists", "06. Linked List/23. Merge k Sorted Lists", "06. Linked List/README", "07. Trees/100. Same Tree", "07. Trees/102. Binary Tree Level Order Traversal", "07. Trees/104. Maximum Depth of Binary Tree", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal", "07. Trees/124. Binary Tree Maximum Path Sum", "07. Trees/199. Binary Tree Right Side View", "07. Trees/226. Invert Binary Tree", "07. Trees/230. Kth Smallest Element in a BST", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree", "07. Trees/297. Serialize and Deserialize Binary Tree", "07. Trees/572. Subtree of Another Tree", "07. Trees/98. Validate Binary Search Tree", "07. Trees/README", "08. Tries/208. Implement Trie (Prefix Tree)", "08. Tries/211. Design Add and Search Words Data Structure", "08. Tries/212. Word Search II", "08. Tries/README", "09. Heap - Priority Queue/1046. Last Stone Weight", "09. Heap - Priority Queue/295. Find Median from Data Stream", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream", "09. Heap - Priority Queue/README", "10. Backtracking/39. Combination Sum", "10. Backtracking/79. Word Search", "10. Backtracking/README", "11. Graphs/133. Clone Graph", "11. Graphs/178. Graph Valid Tree", "11. Graphs/200. Number of Islands", "11. Graphs/207. Course Schedule", "11. Graphs/3651. Number of Connected Components in an Undirected Graph", "11. Graphs/417. Pacific Atlantic Water Flow", "11. Graphs/README", "12. Advanced Graphs/892. Alien Dictionary", "12. Advanced Graphs/README", "13. One-D Dynamic Programming/198. House Robber", "13. One-D Dynamic Programming/213. House Robber II", "13. One-D Dynamic Programming/70. Climbing Stairs", "13. One-D Dynamic Programming/README", "14. Two-D Dynamic Programming/README", "15. Greedy/README", "16. Intervals/README", "17. Math Geometry/README", "18. Bit Manipulation/README", "Book", "CODE_OF_CONDUCT", "CONTRIBUTING", "README", "SECURITY"], "filenames": ["01. Array Hashing/1. Two Sum.ipynb", "01. Array Hashing/128. Longest Consecutive Sequence.ipynb", "01. Array Hashing/217. Contains Duplicate.ipynb", "01. Array Hashing/238. Product of Array Except Self.ipynb", "01. Array Hashing/242. Valid Anagram.ipynb", "01. Array Hashing/347. Top K Frequent Elements.ipynb", "01. Array Hashing/49. Group Anagrams.ipynb", "01. Array Hashing/659. Encode and Decode Strings.ipynb", "01. Array Hashing/README.md", "02. Two Pointers/11. Container With Most Water.ipynb", "02. Two Pointers/125. Valid Palindrome.ipynb", "02. Two Pointers/15. 3Sum.ipynb", "02. Two Pointers/README.md", "03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb", "03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb", "03. Sliding Window/424. Longest Repeating Character Replacement.ipynb", "03. Sliding Window/76. Minimum Window Substring.ipynb", "03. Sliding Window/README.md", "04. Stack/20. Valid Parentheses.ipynb", "04. Stack/README.md", "05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb", "05. Binary Search/33. Search in Rotated Sorted Array.ipynb", "05. Binary Search/README.md", "06. Linked List/141. Linked List Cycle.ipynb", "06. Linked List/143. Reorder List.ipynb", "06. Linked List/19. Remove Nth Node From End of List.ipynb", "06. Linked List/206. Reverse Linked List.ipynb", "06. Linked List/21. Merge Two Sorted Lists.ipynb", "06. Linked List/23. Merge k Sorted Lists.ipynb", "06. Linked List/README.md", "07. Trees/100. Same Tree.ipynb", "07. Trees/102. Binary Tree Level Order Traversal.ipynb", "07. Trees/104. Maximum Depth of Binary Tree.ipynb", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb", "07. Trees/124. Binary Tree Maximum Path Sum.ipynb", "07. Trees/199. Binary Tree Right Side View.ipynb", "07. Trees/226. Invert Binary Tree.ipynb", "07. Trees/230. Kth Smallest Element in a BST.ipynb", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb", "07. Trees/297. Serialize and Deserialize Binary Tree.ipynb", "07. Trees/572. Subtree of Another Tree.ipynb", "07. Trees/98. Validate Binary Search Tree.ipynb", "07. Trees/README.md", "08. Tries/208. Implement Trie (Prefix Tree).ipynb", "08. Tries/211. Design Add and Search Words Data Structure.ipynb", "08. Tries/212. Word Search II.ipynb", "08. Tries/README.md", "09. Heap - Priority Queue/1046. Last Stone Weight.ipynb", "09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb", "09. Heap - Priority Queue/README.md", "10. Backtracking/39. Combination Sum.ipynb", "10. Backtracking/79. Word Search.ipynb", "10. Backtracking/README.md", "11. Graphs/133. Clone Graph.ipynb", "11. Graphs/178. Graph Valid Tree.ipynb", "11. Graphs/200. Number of Islands.ipynb", "11. Graphs/207. Course Schedule.ipynb", "11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb", "11. Graphs/417. Pacific Atlantic Water Flow.ipynb", "11. Graphs/README.md", "12. Advanced Graphs/892. Alien Dictionary.ipynb", "12. Advanced Graphs/README.md", "13. One-D Dynamic Programming/198. House Robber.ipynb", "13. One-D Dynamic Programming/213. House Robber II.ipynb", "13. One-D Dynamic Programming/70. Climbing Stairs.ipynb", "13. One-D Dynamic Programming/README.md", "14. Two-D Dynamic Programming/README.md", "15. Greedy/README.md", "16. Intervals/README.md", "17. Math Geometry/README.md", "18. Bit Manipulation/README.md", "Book.ipynb", "CODE_OF_CONDUCT.md", "CONTRIBUTING.md", "README.md", "SECURITY.md"], "titles": ["100: Same Tree", "128. Longest Consecutive Sequence", "217. Contains Duplicate", "238. Product of Array Except Self", "242. Valid Anagram", "347. Top K Frequent Elements", "49. Group Anagrams", "659\u00b7 Encode and Decode Strings", "Array &amp; Hashing Solutions - Blind 75 LeetCode Problems", "11. Container With Most Water", "125. Valid Palindrome", "15. 3Sum", "Two Pointers Problems - Blind 75 LeetCode", "121. Best Time to Buy and Sell Stock", "3. Longest Substring Without Repeating Characters", "424. Longest Repeating Character Replacement", "76. Minimum Window Substring", "Sliding Window Problems - Blind 75 LeetCode", "20. Valid Parentheses", "Stack Problems - Blind 75 LeetCode", "153. Find Minimum in Rotated Sorted Array", "33. Search in Rotated Sorted Array", "Binary search Problems - Blind 75 LeetCode", "141. Linked List Cycle", "143. Reorder List", "19. Remove Nth Node From End of List", "206. Reverse Linked List", "21. Merge Two Sorted Lists", "23. Merge k Sorted Lists", "Linked List Problems - Blind 75 LeetCode", "100: Same Tree", "102. Binary Tree Level Order Traversal", "104. Maximum Depth of Binary Tree", "105. Construct Binary Tree from Preorder and Inorder Traversal", "124. Binary Tree Maximum Path Sum", "199. Binary Tree Right Side View", "226: Invert Binary Tree", "230. Kth Smallest Element in a BST", "235. Lowest Common Ancestor of a Binary Search Tree", "297. Serialize and Deserialize Binary Tree", "572: Subtree of Another Tree", "98. Validate Binary Search Tree", "Trees Problems - Blind 75 LeetCode", "208. Implement Trie (Prefix Tree)", "211. Design Add and Search Words Data Structure", "212. Word Search II", "Trie Problems - Blind 75 LeetCode", "1046. Last Stone Weight", "295. Find Median from Data Stream", "703. Kth Largest Element in a Stream", "Heap / Priority Queue Problems - Blind 75 LeetCode", "39. Combination Sum", "79. Word Search", "Backtracking Problems - Blind 75 LeetCode", "133. Clone Graph", "178. Graph Valid Tree", "200. Number of Islands", "207. Course Schedule", "3651. Number of Connected Components in an Undirected Graph", "417. Pacific Atlantic Water Flow", "Graphs Problems - Blind 75 LeetCode", "892. Alien Dictionary", "Advanced Graphs Problems - Blind 75 LeetCode", "House Robber", "House Robber II", "70. Climbing Stairs", "1-D Dynamic Programming Problems - Blind 75 LeetCode", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "&lt;no title&gt;", "Contributor Covenant Code of Conduct", "Contributing Guidelines", "Blind 75 LeetCode Solutions", "Security Policy"], "terms": {"difficulti": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 75], "easi": [0, 2, 4, 8, 10, 12, 13, 17, 18, 19, 23, 26, 27, 29, 30, 32, 36, 40, 42, 47, 49, 50, 65, 66, 68, 69, 71, 75], "link": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "problem": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74], "To": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "see": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73], "leetcod": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 56, 57, 59, 63, 64, 65, 72, 74, 76], "click": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 74], "here": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75], "given": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "root": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 49, 72], "two": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 20, 21, 23, 24, 25, 26, 28, 29, 30, 31, 33, 34, 37, 38, 40, 43, 44, 47, 48, 49, 51, 52, 55, 57, 58, 59, 61, 63, 64, 65, 71, 72], "binari": [0, 20, 21, 30, 37, 40, 42, 56, 72], "p": [0, 10, 30, 38, 43, 72], "q": [0, 30, 38, 58], "write": [0, 1, 2, 3, 14, 15, 18, 20, 21, 26, 30, 31, 55, 58, 61], "function": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "check": [0, 1, 2, 4, 9, 10, 11, 13, 14, 15, 16, 18, 20, 23, 24, 25, 26, 27, 28, 30, 31, 33, 34, 35, 38, 40, 41, 43, 44, 45, 48, 49, 52, 54, 55, 56, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 72, 75], "thei": [0, 1, 4, 10, 15, 18, 21, 23, 24, 25, 26, 27, 30, 31, 33, 35, 40, 43, 45, 47, 48, 51, 55, 63, 64, 73, 76], "ar": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "consid": [0, 1, 4, 10, 11, 13, 14, 21, 30, 34, 37, 39, 40, 41, 48, 51, 52, 55, 57, 59, 61, 63, 64, 65, 73, 74], "structur": [0, 2, 9, 14, 21, 24, 27, 28, 30, 31, 32, 33, 34, 36, 38, 39, 40, 43, 45, 46, 48, 49, 54, 55, 58, 61, 64, 67, 68, 69, 70, 71, 74, 75], "ident": [0, 30, 39, 73], "node": [0, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 54, 55, 57, 58, 75], "have": [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 29, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76], "valu": [0, 2, 5, 6, 11, 13, 14, 16, 18, 21, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 47, 48, 49, 51, 52, 54, 58, 59, 63, 65], "constraint": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 59, 61, 63, 64, 65], "The": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75], "number": [0, 1, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 57, 59, 60, 61, 63, 64, 65, 71, 72, 75], "both": [0, 4, 5, 7, 9, 11, 15, 23, 24, 25, 26, 27, 30, 34, 37, 38, 39, 40, 41, 44, 47, 48, 49, 54, 58, 59, 63, 64, 65], "rang": [0, 3, 4, 5, 11, 14, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 34, 35, 36, 38, 39, 40, 41, 45, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 65, 67, 68, 69, 70, 71, 75], "0": [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73], "10": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 28, 30, 32, 34, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 59, 72], "4": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 58, 59, 63, 64, 72], "val": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 49, 54], "definit": [0, 23, 26, 28, 30, 32, 33, 36, 38, 39, 40, 54], "class": [0, 4, 6, 7, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65, 73], "treenod": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41], "def": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "__init__": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 54, 72], "self": [0, 7, 8, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65, 72, 75], "left": [0, 3, 4, 9, 10, 11, 15, 16, 18, 20, 21, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 52, 56, 59], "none": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 48, 54, 72], "right": [0, 3, 9, 10, 11, 15, 16, 20, 21, 26, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 45, 52, 56, 59, 73], "initi": [0, 1, 3, 4, 6, 9, 10, 11, 13, 14, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 33, 34, 35, 37, 39, 41, 43, 44, 47, 48, 49, 51, 52, 54, 56, 57, 58, 59, 61, 63, 65], "child": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 43, 44, 45], "issametre": [0, 30, 40], "base": [0, 4, 5, 6, 14, 24, 26, 30, 32, 34, 36, 38, 41, 43, 44, 48, 49, 55, 61, 63, 64, 65, 72], "If": [0, 1, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "return": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "true": [0, 2, 4, 10, 18, 20, 23, 30, 40, 41, 43, 44, 45, 52, 55, 57, 58, 59, 72], "either": [0, 10, 16, 24, 26, 27, 30, 34, 37, 38, 40, 52, 55, 56, 59, 63, 64, 65], "differ": [0, 1, 4, 5, 6, 9, 13, 15, 18, 23, 24, 30, 34, 39, 40, 48, 51, 58, 61, 63, 64, 65, 73], "fals": [0, 2, 4, 10, 18, 23, 30, 40, 41, 43, 44, 45, 52, 55, 57, 58, 59, 72], "current": [0, 1, 3, 5, 6, 7, 9, 11, 13, 14, 15, 16, 20, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 48, 51, 52, 56, 58, 59, 63, 64, 72], "equal": [0, 1, 3, 4, 5, 10, 14, 15, 20, 21, 23, 27, 30, 34, 36, 37, 40, 41, 44, 47, 48, 51, 52, 55, 59], "recurs": [0, 26, 30, 32, 33, 34, 36, 38, 39, 40, 41, 44, 45, 51, 52, 54, 55, 56, 58, 59], "subtre": [0, 30, 32, 33, 34, 36, 37, 38, 39, 41, 42, 75], "entir": [0, 9, 18, 25, 30, 33, 37, 38, 40, 43, 45, 49, 54, 56, 59], "In": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 75], "thi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "code": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72], "we": [0, 1, 2, 6, 7, 9, 11, 13, 14, 15, 16, 18, 21, 24, 25, 27, 28, 30, 31, 32, 34, 35, 36, 37, 38, 40, 41, 44, 45, 47, 49, 51, 52, 54, 55, 57, 58, 59, 61, 65, 73, 74, 75, 76], "defin": [0, 1, 4, 7, 14, 18, 23, 25, 27, 28, 30, 31, 32, 34, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 64, 65], "repres": [0, 1, 5, 6, 9, 13, 14, 15, 16, 20, 21, 23, 24, 25, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "us": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73, 76], "travers": [0, 5, 9, 23, 24, 25, 26, 27, 30, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 54, 55, 56, 59, 75], "compar": [0, 1, 4, 10, 16, 18, 21, 27, 28, 30, 38, 40, 48, 49, 51, 55, 59, 61, 67, 68, 69, 70, 71, 75], "start": [0, 1, 5, 7, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 40, 41, 43, 44, 45, 47, 49, 51, 52, 54, 55, 56, 58, 59, 61], "which": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "each": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 75], "ha": [0, 2, 4, 5, 6, 9, 16, 18, 21, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 63, 64, 72, 76], "s": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "help": [0, 8, 11, 12, 14, 17, 18, 19, 20, 22, 27, 29, 30, 42, 46, 50, 51, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75, 76], "creat": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "work": [0, 18, 21, 23, 24, 25, 26, 28, 30, 32, 39, 40, 43, 44, 47, 48, 49, 51, 52, 58, 74, 76], "next": [0, 1, 2, 7, 10, 11, 13, 14, 23, 24, 25, 26, 27, 28, 30, 33, 34, 35, 44, 51, 56, 57, 63, 72], "when": [0, 10, 11, 14, 16, 20, 23, 24, 26, 30, 35, 36, 37, 40, 44, 45, 48, 49, 51, 52, 55, 56, 58, 67, 68, 69, 70, 71, 73, 74, 75], "so": [0, 1, 5, 6, 7, 10, 11, 13, 14, 16, 20, 21, 23, 24, 26, 28, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 44, 47, 48, 49, 51, 52, 54, 56, 57, 58, 59, 64, 72], "cannot": [0, 4, 13, 24, 30, 38, 51, 52, 55, 63, 64], "becaus": [0, 1, 2, 3, 4, 7, 9, 10, 11, 13, 14, 16, 18, 20, 23, 25, 26, 30, 31, 32, 33, 35, 36, 37, 38, 40, 43, 44, 48, 49, 51, 52, 54, 55, 59, 64, 65], "final": [0, 1, 3, 4, 6, 7, 9, 11, 13, 15, 16, 18, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 43, 44, 45, 47, 49, 51, 54, 55, 56, 59, 61, 63, 64, 65], "exampl": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "1": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 71, 72], "input": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 35, 36, 38, 39, 40, 41, 44, 45, 47, 48, 51, 54, 55, 56, 58, 59, 61, 63, 64, 65, 72], "2": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "3": [0, 1, 2, 3, 5, 6, 9, 10, 11, 13, 16, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 45, 48, 49, 51, 52, 54, 55, 56, 58, 59, 63, 64, 65, 72, 75], "p1": [0, 24, 30], "q1": [0, 30], "print": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "null": [0, 30, 31, 32, 34, 37, 39, 40], "p2": [0, 24, 30], "q2": [0, 30], "p3": [0, 30], "q3": [0, 30], "can": [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 26, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "analyz": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 61, 63, 64], "follow": [0, 3, 4, 5, 6, 15, 16, 23, 24, 25, 26, 30, 31, 32, 35, 37, 38, 39, 41, 43, 45, 47, 48, 49, 52, 54, 55, 57, 59, 61, 72, 73, 74, 75, 76], "worst": [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 14, 16, 18, 20, 21, 23, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61], "need": [0, 9, 11, 14, 15, 16, 18, 21, 24, 25, 26, 27, 30, 34, 37, 39, 40, 43, 44, 45, 48, 49, 54, 55, 57, 58, 59, 61, 63, 64, 65, 72, 74, 76], "visit": [0, 1, 26, 30, 31, 32, 35, 36, 37, 39, 40, 41, 45, 52, 54, 55, 56, 58, 59], "everi": [0, 2, 16, 18, 30, 32, 40, 41, 56, 58], "onc": [0, 1, 2, 4, 5, 6, 7, 9, 10, 13, 14, 15, 18, 24, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 44, 45, 52, 54, 55, 56, 57, 59, 63, 64, 65, 72, 74, 76], "determin": [0, 1, 2, 4, 10, 15, 16, 18, 21, 23, 24, 30, 31, 33, 34, 35, 36, 39, 40, 41, 43, 45, 47, 49, 51, 52, 55, 56, 57, 58, 59, 61, 63, 64, 73], "sinc": [0, 2, 3, 4, 16, 21, 30, 31, 35, 37, 41, 52, 55, 58, 64], "exactli": [0, 1, 2, 4, 5, 6, 13, 14, 26, 30, 31, 32, 34, 35, 36, 39, 55, 56, 65], "o": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "n": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 45, 47, 48, 49, 51, 52, 54, 55, 56, 58, 59, 61, 63, 64, 65], "where": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "total": [0, 5, 9, 11, 23, 24, 27, 28, 30, 31, 33, 40, 43, 44, 48, 49, 52, 56, 57, 58, 61, 63, 64, 65], "call": [0, 1, 2, 4, 5, 6, 7, 14, 23, 26, 28, 30, 31, 32, 33, 34, 35, 36, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64, 72], "stack": [0, 18, 26, 30, 32, 33, 34, 36, 37, 38, 39, 40, 41, 44, 45, 51, 52, 54, 55, 56, 58, 59, 72], "dure": [0, 10, 24, 30, 31, 33, 34, 36, 39, 40, 41, 44, 45, 49, 54, 55, 59, 61, 72, 73], "proport": [0, 23, 24, 26, 27, 28, 30, 31, 39, 40, 44, 65], "maximum": [0, 1, 4, 5, 6, 9, 13, 14, 15, 16, 20, 30, 31, 35, 40, 41, 42, 44, 45, 48, 51, 56, 58, 59, 61, 63, 64, 66, 68, 75], "depth": [0, 30, 34, 36, 38, 39, 40, 41, 42, 44, 45, 51, 52, 54, 55, 56, 58, 59, 75], "complet": [0, 2, 10, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 38, 39, 41, 43, 44, 45, 47, 51, 52, 55, 57], "unbalanc": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41], "all": [0, 1, 2, 3, 4, 6, 9, 10, 11, 13, 14, 16, 18, 20, 21, 24, 25, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64, 73, 74, 75], "form": [0, 4, 6, 9, 24, 25, 26, 27, 30, 45, 51, 52, 55, 56, 57, 61], "singl": [0, 2, 6, 7, 13, 14, 15, 18, 20, 25, 26, 28, 30, 32, 34, 37, 45, 58, 65, 73], "branch": [0, 30, 32, 44, 51, 74], "therefor": [0, 1, 2, 3, 4, 5, 9, 10, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 39, 41, 43, 45, 47, 49, 51, 52, 54, 56, 63, 64, 65], "due": [0, 1, 6, 11, 14, 18, 24, 26, 28, 30, 33, 37, 39, 40, 41, 43, 47, 51, 52, 55, 61], "addit": [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 32, 33, 38, 42, 43, 46, 48, 50, 52, 53, 55, 56, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 75, 76], "small": [0, 30, 32, 52, 59], "constant": [0, 1, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 32, 34, 35, 38, 39, 47, 48, 49, 63, 64, 65], "amount": [0, 9, 11, 13, 15, 16, 20, 21, 25, 26, 27, 28, 30, 32, 34, 38, 39, 51, 52, 63, 64], "variabl": [0, 1, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 20, 21, 23, 24, 25, 27, 28, 30, 32, 34, 35, 38, 47, 49, 51, 52, 56, 58, 63, 64, 65], "comparison": [0, 4, 10, 11, 13, 14, 27, 28, 30, 39, 61], "within": [0, 1, 3, 6, 10, 13, 14, 15, 16, 21, 24, 30, 34, 37, 39, 40, 41, 45, 47, 48, 51, 54, 58, 73, 76], "signific": [0, 16, 30, 34, 40], "term": [0, 5, 18, 24, 26, 30, 31, 33, 37, 47, 56, 65, 67, 68, 69, 70, 71, 73, 75], "overal": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 14, 16, 18, 21, 24, 25, 28, 30, 31, 33, 34, 35, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "summari": [0, 2, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 38, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 58, 61, 63, 64, 65], "medium": [1, 3, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 20, 21, 22, 24, 25, 29, 31, 33, 35, 37, 38, 41, 42, 43, 44, 46, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 63, 64, 66, 67, 68, 69, 70, 71, 75], "an": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "unsort": 1, "arrai": [1, 2, 5, 6, 9, 11, 13, 16, 22, 28, 33, 47, 48, 49, 51, 57, 58, 63, 64, 65, 72], "integ": [1, 2, 3, 5, 9, 11, 14, 15, 18, 20, 21, 23, 33, 37, 39, 47, 48, 49, 51, 54, 59, 63, 64, 65, 71, 75], "num": [1, 2, 3, 5, 11, 20, 21, 48, 49, 63, 64], "length": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 25, 27, 28, 31, 32, 33, 35, 39, 43, 44, 45, 47, 49, 51, 52, 56, 57, 59, 61, 63, 64, 65], "element": [1, 2, 3, 6, 8, 9, 11, 18, 20, 21, 24, 25, 26, 27, 28, 33, 39, 42, 48, 50, 51, 57, 58, 59, 72, 75], "you": [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "must": [1, 3, 5, 11, 13, 16, 18, 20, 21, 38, 41, 45, 54, 55, 57], "algorithm": [1, 3, 5, 7, 9, 11, 14, 15, 16, 20, 21, 23, 24, 34, 38, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 75], "run": [1, 3, 9, 10, 11, 14, 15, 16, 20, 27, 38, 47, 63, 72], "5": [1, 2, 3, 4, 5, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 35, 37, 38, 39, 40, 41, 48, 49, 51, 55, 58, 59, 63, 66, 72, 75, 76], "9": [1, 2, 3, 9, 31, 32, 33, 34, 36, 38, 49, 63, 72], "i": [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 16, 18, 20, 21, 23, 25, 26, 28, 31, 33, 34, 35, 37, 39, 43, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "python": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 18, 24, 26, 27, 28, 31, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "solv": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 20, 23, 31, 33, 34, 35, 37, 38, 39, 41, 45, 48, 49, 52, 54, 55, 59, 61, 63, 64, 67, 68, 69, 70, 71, 75], "longestconsecut": 1, "num_set": 1, "set": [1, 2, 5, 11, 14, 16, 20, 21, 23, 24, 26, 38, 39, 43, 44, 45, 47, 51, 52, 54, 55, 57, 63, 70, 72, 73, 75], "max_length": [1, 14, 15], "current_num": 1, "current_length": [1, 14], "while": [1, 2, 5, 7, 9, 10, 11, 13, 16, 20, 21, 23, 24, 25, 26, 27, 28, 31, 33, 34, 35, 37, 38, 39, 41, 47, 49, 52, 54, 57, 59, 61, 63], "max": [1, 9, 13, 14, 15, 16, 32, 34, 40, 47, 48, 56, 63, 64], "take": [1, 2, 4, 5, 7, 10, 11, 13, 14, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73, 74, 75, 76], "empti": [1, 2, 5, 6, 11, 13, 16, 18, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 39, 44, 45, 47, 48, 49, 51, 54, 56, 57, 58, 59, 61], "insert": [1, 25, 37, 43, 45, 69, 75], "from": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 18, 20, 24, 26, 27, 28, 29, 31, 32, 34, 35, 37, 39, 42, 43, 44, 45, 47, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73, 74, 75], "allow": [1, 2, 7, 13, 15, 16, 23, 24, 27, 38, 39, 40, 41, 44, 47, 48, 49, 56, 59, 63, 64, 73], "effici": [1, 2, 3, 4, 5, 6, 7, 9, 11, 14, 15, 20, 23, 25, 26, 27, 28, 31, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 57, 59, 63, 64], "exist": [1, 2, 18, 27, 31, 33, 35, 37, 38, 40, 43, 44, 52, 56, 61, 74], "keep": [1, 2, 3, 10, 13, 14, 15, 16, 18, 20, 27, 28, 34, 35, 36, 37, 39, 40, 43, 47, 51, 54, 55, 56, 57, 58, 59, 61, 63], "track": [1, 2, 3, 13, 14, 15, 16, 18, 20, 27, 28, 34, 35, 37, 39, 43, 47, 49, 51, 54, 55, 56, 57, 58, 59, 61, 63], "found": [1, 11, 14, 16, 33, 34, 37, 40, 43, 44, 45, 47, 51, 52, 56, 58, 72, 76], "iter": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 23, 24, 25, 26, 27, 28, 31, 33, 35, 36, 37, 43, 44, 45, 47, 49, 51, 52, 54, 56, 57, 58, 59, 61, 63, 64, 65], "through": [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15, 16, 18, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 43, 44, 45, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 73], "For": [1, 2, 3, 4, 5, 6, 10, 14, 16, 18, 20, 21, 24, 26, 27, 31, 34, 35, 36, 40, 41, 44, 45, 51, 52, 54, 57, 58, 61, 63, 65, 72, 73], "doesn": [1, 24, 28, 40, 44, 48, 51, 52, 54, 56], "t": [1, 4, 9, 10, 13, 16, 21, 23, 24, 28, 37, 38, 39, 40, 43, 44, 45, 48, 51, 52, 54, 56, 58, 72], "mean": [1, 2, 4, 6, 9, 10, 11, 14, 15, 16, 18, 20, 21, 23, 26, 27, 32, 33, 35, 37, 38, 39, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64], "potenti": [1, 11, 18, 37, 43], "insid": [1, 2, 4, 6, 9, 10, 11, 14, 15, 16, 18, 20, 21, 23, 24, 26, 27, 28, 31, 34, 35, 38, 41, 45, 47, 51, 52, 54, 58, 63], "loop": [1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 38, 45, 47, 51, 52, 54, 55, 56, 57, 58, 61, 63, 65, 72], "itself": [1, 3, 7, 20, 26, 38, 40], "part": [1, 21, 41, 44, 58, 63], "enter": [1, 4, 11, 20, 23, 26, 27, 31, 35, 37, 47, 51], "continu": [1, 2, 9, 10, 11, 14, 16, 18, 20, 21, 23, 25, 26, 27, 28, 31, 33, 34, 35, 37, 43, 45, 47, 57, 61, 73], "long": [1, 47], "increment": [1, 4, 5, 6, 10, 11, 16, 48, 56, 57, 58, 65], "also": [1, 2, 3, 5, 6, 7, 9, 10, 13, 16, 18, 21, 24, 25, 26, 31, 33, 34, 35, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 57, 58, 59, 61, 72, 73], "account": [1, 14, 44, 73, 74], "updat": [1, 3, 4, 7, 9, 13, 14, 15, 16, 20, 21, 24, 25, 26, 27, 28, 34, 41, 47, 49, 51, 57, 58, 61, 63, 64, 72], "longer": [1, 4, 9], "after": [1, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 39, 43, 44, 45, 47, 51, 52, 55, 57, 58, 59, 61], "move": [1, 9, 10, 11, 15, 16, 23, 24, 25, 26, 27, 37, 38, 43, 44, 48, 51, 52, 56], "outer": [1, 11, 52], "repeat": [1, 2, 17, 20, 24, 54, 56, 72, 75], "process": [1, 2, 6, 7, 9, 11, 18, 20, 21, 24, 26, 27, 28, 31, 33, 35, 36, 37, 39, 43, 44, 48, 51, 54, 56, 57, 58, 59, 61], "result": [1, 3, 4, 5, 6, 7, 9, 10, 11, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 40, 44, 45, 47, 48, 51, 52, 54, 59, 61, 63, 64, 65, 72], "kei": [1, 5, 6, 16, 18, 37, 39, 41, 43, 44, 54, 56, 59, 61, 63, 72, 76], "idea": [1, 37, 63, 74], "By": [1, 7, 15, 34, 37, 49, 74, 75], "do": [1, 4, 10, 13, 15, 16, 18, 21, 23, 24, 25, 27, 34, 35, 37, 39, 47, 48, 51, 55, 56, 63, 65, 74, 76], "find": [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 29, 33, 34, 35, 37, 38, 42, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75], "nums1": [1, 2, 20, 21, 63, 64], "100": [1, 6, 25, 27, 32, 35, 36, 42, 48, 54, 63, 64, 72, 75], "200": [1, 59, 60, 72, 75], "nums2": [1, 2, 20, 21, 63, 64], "7": [1, 9, 13, 20, 21, 31, 32, 33, 34, 36, 38, 47, 51, 59, 63, 72], "8": [1, 3, 9, 38, 47, 49, 51, 72], "6": [1, 3, 9, 13, 20, 21, 26, 28, 34, 36, 37, 38, 41, 51, 52, 58, 59, 72], "let": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 61, 63, 64], "provid": [1, 2, 3, 4, 5, 7, 13, 14, 15, 18, 20, 21, 26, 28, 32, 36, 38, 39, 40, 43, 44, 45, 47, 48, 49, 54, 55, 56, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "design": [1, 7, 23, 24, 39, 46, 49, 54, 56, 57, 61, 63, 72, 75], "breakdown": [1, 48, 59], "construct": [1, 3, 31, 35, 38, 42, 45, 52, 55, 57, 61, 73, 75], "perform": [1, 2, 4, 6, 13, 14, 15, 16, 18, 21, 25, 27, 28, 31, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 56, 57, 58, 59, 61, 63, 65], "oper": [1, 2, 3, 6, 7, 11, 13, 14, 15, 16, 18, 27, 28, 34, 35, 37, 39, 43, 44, 47, 48, 49, 63, 65], "main": [1, 9, 16, 32, 33, 38, 43, 45, 49, 51, 56, 58, 61, 64, 72, 74], "onli": [1, 5, 9, 10, 11, 13, 15, 18, 23, 24, 26, 28, 34, 35, 38, 40, 41, 43, 47, 49, 52, 54, 55, 56, 59, 63, 64, 65], "mai": [1, 5, 7, 9, 11, 15, 16, 20, 23, 24, 40, 41, 43, 44, 45, 49, 51, 52, 55, 56, 57, 58, 61, 72, 73, 74, 76], "howev": [1, 23, 28, 38, 40, 43, 44, 51, 52, 56, 61, 64], "nest": [1, 11, 45, 51, 52, 56, 72], "its": [1, 3, 5, 6, 7, 14, 16, 18, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 45, 47, 48, 49, 54, 55, 56, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 75], "remain": [1, 2, 23, 25, 26, 27, 28, 44, 47, 48, 51, 57], "few": [1, 4, 13, 14, 16, 27, 28, 51, 64], "store": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 24, 25, 26, 27, 28, 31, 32, 33, 35, 37, 39, 43, 44, 45, 48, 49, 51, 54, 55, 57, 59, 61, 63, 65], "uniqu": [1, 2, 4, 5, 11, 14, 16, 20, 21, 33, 34, 38, 41, 45, 51, 52, 54, 55, 57, 61, 67, 75], "requir": [1, 2, 3, 4, 9, 10, 11, 16, 28, 35, 43, 44, 45, 47, 48, 49, 51, 54, 57, 65, 72], "depend": [1, 4, 6, 9, 10, 11, 13, 15, 16, 20, 21, 23, 25, 27, 28, 32, 33, 34, 35, 36, 37, 40, 41, 44, 45, 48, 54, 55, 57, 61, 63], "size": [1, 2, 4, 5, 6, 9, 10, 11, 13, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 35, 38, 40, 45, 48, 49, 56, 58, 59, 61, 63, 64, 65, 73], "actual": [1, 16, 27, 41, 43, 47, 48, 51, 54, 55, 61, 76], "extend": [1, 5, 13, 15, 27, 33, 34, 35, 38, 44, 45, 48, 61, 63], "certain": [1, 47, 51, 63, 64], "absolut": 1, "e": [1, 5, 16, 18, 21, 23, 25, 26, 31, 33, 34, 37, 39, 43, 45, 47, 48, 51, 52, 54, 55, 57, 58, 61, 65, 72, 73], "g": [1, 5, 21, 25, 33, 45, 47, 54, 55, 65], "less": [1, 9, 10, 11, 15, 20, 21, 38, 40, 41, 43, 45, 47, 48, 51, 59], "than": [1, 2, 5, 9, 10, 11, 13, 15, 16, 20, 21, 27, 34, 37, 38, 40, 41, 43, 45, 47, 48, 51, 52, 54, 57, 59, 65], "k": [1, 2, 6, 8, 11, 13, 14, 15, 21, 24, 26, 27, 29, 37, 38, 45, 47, 49, 52, 63, 72, 75], "instead": [1, 5, 9, 11, 16, 21, 27, 28, 34, 35, 37, 47, 49, 51, 52, 61, 65, 72], "ani": [2, 3, 5, 6, 7, 9, 10, 13, 15, 16, 18, 21, 23, 24, 27, 28, 31, 33, 34, 39, 40, 41, 43, 44, 45, 48, 49, 51, 52, 55, 57, 58, 59, 72, 73, 74, 76], "appear": [2, 24, 25, 27, 33, 34, 55, 61, 73], "least": [2, 48, 49, 51, 58], "twice": [2, 64], "distinct": [2, 6, 14, 16, 21, 49, 51, 56, 58, 65], "containsdupl": 2, "unique_el": 2, "alreadi": [2, 4, 14, 43, 55, 72], "otherwis": [2, 4, 10, 18, 21, 23, 39, 40, 41, 43, 44, 45, 48, 51, 52, 55, 57, 61, 73], "add": [2, 8, 12, 14, 16, 17, 19, 22, 29, 33, 34, 35, 39, 42, 43, 45, 46, 47, 48, 49, 50, 51, 53, 55, 57, 58, 60, 61, 62, 66, 67, 68, 69, 70, 71, 74, 75], "els": [2, 9, 11, 18, 20, 21, 27, 28, 33, 38, 47, 48, 54], "without": [2, 3, 5, 10, 16, 17, 21, 23, 24, 25, 38, 45, 51, 52, 56, 63, 64, 72, 73, 75], "argument": [2, 5, 13, 14, 18, 21, 23, 32, 34, 36, 38, 40, 51, 52, 58], "whether": [2, 4, 15, 40, 41, 43, 44, 52, 55, 56, 57, 58, 61], "condit": [2, 11, 15, 20, 24, 38, 41, 51, 52, 55, 56, 59, 61], "immedi": [2, 4, 43, 55], "ad": [2, 5, 7, 27, 32, 35, 44, 45, 48, 49, 54, 57, 58, 59, 61, 63, 65, 72], "util": [2, 45, 63, 72], "data": [2, 9, 14, 21, 24, 27, 28, 31, 33, 36, 38, 39, 43, 45, 46, 49, 50, 54, 55, 58, 61, 64, 67, 68, 69, 70, 71, 72, 75, 76], "quickli": [2, 49], "detect": [2, 23, 40, 55, 57, 61], "meet": [2, 11, 49, 69, 75], "explain": [2, 24, 25, 26, 27, 43, 44], "earlier": [2, 44, 65], "nums3": [2, 20, 21, 64], "primari": [2, 14, 52], "affect": [2, 6, 44, 48, 72, 73], "averag": [2, 7, 41, 45, 48], "grow": [2, 20, 48], "linearli": [2, 11, 35], "modifi": [2, 3, 5, 7, 9, 11, 13, 14, 15, 18, 20, 24, 25, 26, 31, 33, 34, 35, 37, 39, 41, 45, 47, 49, 51, 52, 54, 55, 56, 57, 59, 61, 63, 64], "paramet": [2, 23, 26, 37, 49, 52, 57], "frequenc": [2, 4, 5, 51], "count": [2, 3, 4, 5, 6, 11, 15, 16, 32, 34, 43, 51, 56, 57, 58, 65, 71, 75], "list": [2, 3, 4, 5, 6, 7, 10, 11, 13, 18, 20, 31, 33, 35, 36, 37, 38, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 72, 74], "more": [2, 7, 8, 12, 17, 19, 22, 25, 26, 29, 38, 39, 41, 42, 45, 46, 47, 48, 50, 52, 53, 56, 57, 58, 60, 61, 62, 66, 67, 68, 69, 70, 71, 72, 74, 75], "along": [2, 32, 63, 64], "answer": [3, 5, 6, 14, 16, 47, 48, 73], "prefix": [3, 44, 45, 46, 61, 75], "suffix": 3, "guarante": [3, 5, 33, 49], "fit": 3, "32": [3, 72], "bit": [3, 39], "divis": [3, 20, 21], "30": [3, 25, 47, 51, 72], "up": [3, 4, 5, 11, 16, 23, 24, 25, 26, 33, 35, 37, 39, 45, 47, 48, 51, 52, 54, 55, 56, 58, 63, 76], "extra": [3, 9, 16, 23, 25, 26, 27, 38, 40, 63, 72], "output": [3, 5, 9, 11, 25, 26, 28, 31, 35, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "doe": [3, 6, 9, 10, 11, 13, 15, 18, 20, 21, 25, 27, 28, 34, 38, 43, 44, 45, 48, 49, 52, 55, 57, 58, 59], "productexceptself": 3, "len": [3, 4, 5, 7, 9, 10, 11, 14, 15, 16, 18, 20, 21, 28, 31, 35, 45, 47, 48, 49, 51, 52, 54, 55, 56, 59, 61, 64], "left_product": 3, "right_product": 3, "calcul": [3, 9, 11, 13, 14, 16, 20, 21, 32, 34, 47, 48, 57, 58, 63, 64, 65], "fill": [3, 9, 65], "ones": [3, 49], "A": [3, 10, 23, 26, 32, 33, 34, 38, 39, 40, 41, 43, 45, 51, 52, 55, 57, 58, 72, 73, 74, 76], "index": [3, 11, 14, 15, 20, 21, 23, 24, 33, 37, 39, 51, 52, 54, 72], "includ": [3, 10, 15, 16, 26, 34, 39, 44, 45, 49, 51, 54, 56, 61, 63, 72, 73, 74, 76], "accordingli": [3, 57, 61], "anoth": [3, 11, 37, 39, 42, 57, 58, 61, 65, 72, 75], "revers": [3, 5, 24, 29, 31, 39, 45, 71, 75], "order": [3, 5, 6, 11, 18, 20, 21, 24, 25, 26, 27, 28, 33, 34, 35, 37, 39, 42, 45, 48, 49, 51, 61, 75], "multipli": 3, "correspond": [3, 5, 6, 18, 33, 43, 45, 51, 54, 59], "contain": [3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 31, 33, 34, 35, 38, 39, 40, 41, 44, 47, 48, 51, 54, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 72, 75], "desir": [3, 37, 76], "comput": [3, 39, 48, 64], "It": [3, 5, 6, 9, 10, 11, 13, 14, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 36, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "result1": [3, 5, 6, 9, 21, 28, 56], "24": [3, 72], "12": [3, 9, 45, 63, 72], "result2": [3, 5, 6, 9, 21, 28, 56], "first": [3, 4, 5, 6, 13, 23, 24, 25, 26, 27, 31, 32, 33, 34, 35, 36, 37, 39, 41, 44, 45, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "second": [3, 5, 24, 25, 37, 41, 47, 54, 65, 72], "independ": [3, 25, 27, 48, 63], "sequenti": [3, 21, 45, 52], "consum": [3, 10, 14, 15, 27, 38, 52, 55], "respect": [3, 4, 16, 24, 26, 27, 32, 40, 44, 51, 52, 57, 63, 65, 67, 68, 69, 70, 71, 73, 75], "These": [3, 4, 15, 16, 21, 23, 24, 25, 26, 27, 35, 48, 55, 61, 64, 67, 68, 69, 70, 71, 75], "occupi": [3, 24, 28, 65], "toward": [3, 10, 11, 73], "per": [3, 5, 51], "handl": [3, 5, 7, 11, 15, 24, 25, 33, 36, 41, 47, 49, 54, 61, 64, 72], "zero": [3, 11, 14, 26, 51, 56, 70, 75], "should": [3, 5, 7, 10, 20, 21, 23, 26, 27, 31, 39, 41, 43, 44, 47, 48, 52, 54, 55, 56, 57, 61, 65], "place": [3, 5, 24, 26, 52, 64], "modif": [3, 11], "attempt": [3, 16, 76], "directli": [3, 43, 59, 65, 72], "string": [4, 6, 8, 10, 14, 15, 16, 18, 39, 43, 44, 45, 52, 61, 72, 75], "word": [4, 6, 43, 46, 53, 57, 58, 59, 61, 66, 75], "phrase": [4, 6, 10], "rearrang": [4, 6, 27], "letter": [4, 6, 10, 14, 15, 16, 43, 44, 45, 52, 61], "typic": [4, 6, 36, 37, 41, 51, 54, 55], "origin": [4, 6, 7, 10, 20, 24, 26, 39, 45, 51, 52, 54, 55, 57, 74], "consist": [4, 6, 10, 14, 15, 16, 18, 33, 40, 43, 44, 45, 52, 56, 58, 61, 72, 74], "lowercas": [4, 6, 10, 15, 16, 43, 44, 45, 52, 61], "english": [4, 6, 14, 15, 16, 43, 44, 45, 52, 72], "what": [4, 73, 76], "unicod": 4, "charact": [4, 6, 7, 10, 16, 17, 18, 39, 43, 44, 45, 52, 61, 72, 75], "how": [4, 16, 18, 20, 23, 24, 26, 28, 31, 32, 34, 36, 37, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74, 76], "would": [4, 13, 14, 20, 24, 34, 37, 41, 48, 49, 56, 57], "adapt": [4, 20, 21, 41, 73], "your": [4, 5, 13, 21, 33, 39, 47, 48, 52, 55, 58, 63, 67, 68, 69, 70, 71, 72, 74, 75, 76], "isanagram": 4, "str": [4, 6, 7, 39, 44, 52, 56], "bool": [4, 23, 44, 52, 57], "dictionari": [4, 5, 6, 14, 15, 16, 18, 43, 44, 45, 54, 62, 75], "countt": 4, "get": [4, 5, 15, 16, 31, 35, 45, 47, 54, 56], "same": [4, 5, 6, 7, 10, 11, 15, 18, 25, 26, 31, 33, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 48, 51, 52, 54, 55, 58, 61, 63, 64, 75], "method": [4, 5, 6, 7, 18, 23, 28, 34, 39, 40, 43, 44, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65], "boolean": [4, 43, 52, 58, 59], "other": [4, 6, 10, 11, 15, 16, 21, 24, 35, 38, 40, 45, 51, 54, 55, 56, 57, 58, 59, 73], "occurr": [4, 6, 7, 14, 16, 51], "line": [4, 5, 9, 13, 33, 52, 72], "similarli": 4, "wai": [4, 9, 14, 16, 26, 39, 57, 61, 65, 66, 73, 75], "indic": [4, 7, 9, 10, 14, 20, 21, 23, 25, 26, 31, 33, 37, 41, 43, 44, 47, 52, 55, 56, 57, 58, 72], "match": [4, 10, 16, 18, 23, 38, 40, 44, 45, 52, 54], "nagaram": 4, "rat": 4, "car": [4, 10], "scenario": [4, 13, 33, 36, 37, 43, 48, 51, 55, 59, 63, 64, 65], "linear": [4, 13, 14, 15, 26, 27, 32, 39, 44, 56, 63, 64, 65], "simpli": [4, 14, 18, 48], "bookkeep": 4, "significantli": [4, 6, 24, 47, 48, 52, 65], "impact": [4, 16, 24, 73], "chain": 4, "longest": [4, 8, 10, 17, 32, 45, 66, 67, 72, 75], "previou": [4, 5, 11, 25, 63, 64, 65], "bat": [4, 6], "tab": [4, 6], "cat": 4, "tac": [4, 6], "dog": [4, 6], "minimum": [4, 9, 13, 17, 21, 22, 48, 55, 65, 72, 75], "delet": [4, 37, 44], "make": [4, 9, 13, 23, 25, 26, 27, 34, 35, 38, 45, 48, 49, 52, 55, 59, 65, 73, 74], "them": [4, 6, 10, 11, 16, 18, 25, 26, 28, 34, 35, 36, 40, 47, 48, 49, 52, 55, 56, 57, 58, 61, 63], "hello": 4, "billion": 4, "remov": [4, 10, 15, 16, 29, 31, 33, 44, 47, 49, 57, 61, 72, 73, 75], "heo": 4, "billi": 4, "lo": 4, "most": [5, 12, 13, 15, 18, 34, 37, 39, 43, 44, 45, 47, 48, 49, 52, 55, 57, 59, 63, 72, 75], "better": [5, 8, 12, 17, 19, 22, 29, 34, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 74, 75], "log": [5, 11, 20, 21, 28, 31, 32, 34, 36, 37, 38, 41, 47, 48, 49, 72], "topkfrequ": 5, "freq": 5, "accord": [5, 24, 38, 61], "c": [5, 6, 10, 33, 35, 45, 52, 59, 72], "item": 5, "append": [5, 6, 7, 11, 18, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 39, 49, 51, 54, 55, 57, 58, 59, 61], "re": [5, 49], "end": [5, 7, 9, 10, 11, 14, 15, 16, 20, 21, 23, 24, 26, 27, 28, 29, 32, 34, 43, 44, 45, 47, 58, 63, 75], "higher": [5, 13, 52], "similar": [5, 7, 27, 33, 43], "one": [5, 7, 9, 10, 13, 15, 21, 23, 24, 25, 26, 27, 28, 36, 37, 38, 39, 40, 47, 48, 51, 52, 54, 56, 58, 61, 63, 64, 65], "greater": [5, 9, 10, 11, 13, 15, 20, 21, 34, 37, 38, 40, 41, 48, 65], "retriev": [5, 43, 47, 48], "default": [5, 6, 61, 72], "abov": [5, 15, 24, 38, 44, 55, 59, 65, 72], "pair": [5, 9, 16, 18, 28, 34, 55, 57, 58, 61], "bucket": 5, "group": [5, 8, 26, 56, 58, 72, 75], "highest": 5, "go": [5, 21, 23, 32, 33, 58, 59, 74], "down": [5, 24, 26, 31, 32, 33, 38, 40, 45, 52, 56, 65], "note": [5, 11, 23, 34, 44, 49, 56, 72, 74], "typo": 5, "exit": [5, 20, 21, 27, 72], "sort": [5, 11, 22, 29, 37, 49, 51, 57, 61, 72, 73, 75], "being": [5, 16, 21, 34, 40, 43, 44, 65], "name": [5, 8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 59, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "third": 5, "domin": [5, 10, 11, 16, 21, 24, 27, 31, 35, 39, 41, 45, 47, 51, 52, 59, 61], "factor": [5, 11, 16, 21, 27, 31, 35, 39, 44, 51], "105": [5, 42, 75], "optim": [5, 7, 9, 15, 16, 31, 37, 39, 43, 45, 48, 51, 52, 56, 57, 59, 63, 64], "ensur": [5, 7, 9, 10, 11, 14, 15, 25, 33, 34, 35, 38, 39, 41, 44, 45, 48, 49, 52, 54, 55, 59, 61, 74], "klogk": 5, "prioriti": [5, 47, 48], "queue": [5, 31, 33, 35, 36, 38, 47, 48, 57, 61], "heap": [5, 28, 47, 48, 49], "achiev": [5, 7, 13, 15, 26, 36, 51, 54, 63], "duplic": [5, 8, 11, 16, 20, 33, 41, 45, 51, 54, 55, 72, 75], "multipl": [5, 6, 7, 13, 24, 38, 41, 44, 47, 58, 61], "among": [5, 34, 43, 45, 61], "togeth": [6, 7, 9, 25, 26, 27, 35, 47, 55, 61, 74], "collect": [6, 8, 12, 17, 19, 22, 29, 31, 42, 45, 46, 47, 50, 52, 53, 54, 57, 60, 61, 62, 66, 67, 68, 69, 70, 71, 75], "import": [6, 11, 35, 40, 47, 48, 49, 52, 56, 57, 59, 61, 63, 64, 72], "defaultdict": [6, 57, 61], "groupanagram": 6, "z": [6, 61], "26": [6, 44, 72], "ord": 6, "tupl": 6, "convert": [6, 10, 24, 25, 26, 27, 33, 39, 45, 47], "associ": [6, 23, 26, 58], "step": [6, 10, 11, 14, 16, 20, 23, 24, 26, 27, 28, 31, 32, 33, 35, 38, 39, 43, 44, 45, 47, 49, 51, 54, 56, 59, 61, 65, 76], "specif": [6, 24, 39, 43, 44, 45, 47, 52, 55, 57, 61, 65, 67, 68, 69, 70, 71, 72, 75], "ascii": [6, 10], "under": [6, 63], "constructor": [6, 43, 44], "inner": [6, 52, 72], "strs1": 6, "eat": [6, 45], "tea": 6, "tan": 6, "ate": 6, "nat": 6, "strs2": 6, "strs3": 6, "result3": [6, 9, 21, 28], "instanc": [6, 7, 33, 40, 49, 52, 54, 56, 64, 73], "done": [6, 7, 10, 11, 24, 31, 34, 51, 52, 61, 72], "belong": [6, 58], "fix": [6, 13, 20, 27, 74, 76], "effect": [6, 15, 20, 23, 24, 26, 28, 31, 33, 34, 35, 36, 40, 43, 45], "palindrom": [6, 12, 66, 72, 75], "act": [6, 73], "largest": [6, 28, 37, 48, 50, 56, 58], "lintcod": [7, 55, 58, 61], "sent": 7, "over": [7, 16, 25, 39, 48, 49, 51], "network": [7, 39], "back": [7, 25, 26, 39, 47], "pleas": [7, 39, 67, 68, 69, 70, 71, 72, 74, 75, 76], "implement": [7, 11, 20, 26, 33, 34, 36, 39, 44, 45, 46, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74, 75], "codec": [7, 39], "type": [7, 18, 49, 52, 55, 56, 57, 59, 63, 64, 72], "rtype": 7, "replac": [7, 17, 28, 52, 72, 75], "encapsul": [7, 52, 56], "involv": [7, 24, 25, 27, 34, 37, 43, 47, 48, 52, 55, 56, 59, 61, 63, 73, 76], "concaten": [7, 45], "delimit": 7, "avoid": [7, 11, 18, 26, 40, 45, 51, 54, 55, 61, 63, 64, 73], "conflict": 7, "split": [7, 24, 39], "begin": [7, 9, 10, 14, 15, 20, 23, 24, 25, 27], "repeatedli": [7, 28, 37, 61], "extract": [7, 33], "substr": [7, 10, 15, 17, 66, 72, 75], "between": [7, 9, 15, 20, 26, 35, 38, 44, 54, 55, 57, 58, 61, 64], "posit": [7, 11, 15, 18, 23, 25, 27, 33, 39, 41, 47, 52, 73], "befor": [7, 13, 24, 31, 34, 38, 43, 45, 48, 54, 57, 61, 63, 74], "revert": 7, "escap": 7, "preserv": [7, 54], "content": [7, 24, 27], "even": [7, 24, 31, 38, 48, 74], "colon": 7, "input1": [7, 10], "lint": 7, "love": 7, "encoded1": 7, "decoded1": 7, "input2": [7, 10], "sai": 7, "ye": 7, "encoded2": 7, "decoded2": 7, "m": [7, 10, 14, 16, 27, 40, 43, 44, 45, 52, 56, 58, 59, 72, 74], "doubl": [7, 48], "build": [7, 27, 33, 45, 61, 65, 67, 68, 69, 70, 71, 72, 75], "scan": 7, "aris": 7, "just": [7, 11, 18, 27, 33, 39, 57, 61, 73], "could": [7, 16, 20, 25, 26, 34, 40, 52, 73], "own": [7, 40, 58], "abl": [7, 44], "try": [7, 11, 16, 43, 49], "minim": [7, 16, 21, 23, 39, 57, 65], "correctli": [7, 33, 44, 49, 54], "repositori": [8, 67, 68, 69, 70, 71, 74, 75, 76], "my": 8, "ve": [8, 13, 14, 37, 47, 56, 58], "organ": [8, 43], "categori": 8, "easier": [8, 25, 26], "navig": [8, 67, 68, 69, 70, 71, 75], "refer": [8, 23, 24, 25, 32, 33, 38, 39, 54, 67, 68, 69, 70, 71, 72, 75], "present": [8, 16, 21, 43, 55], "jupyt": [8, 72], "notebook": [8, 72], "format": [8, 25, 33, 39, 54, 72], "ipynb": [8, 72], "217": [8, 72, 75], "242": [8, 72, 75], "valid": [8, 11, 12, 14, 15, 16, 19, 23, 33, 34, 39, 42, 43, 45, 51, 52, 60, 61, 72, 75], "anagram": [8, 72, 75], "sum": [8, 11, 28, 42, 53, 59, 65, 71, 72, 75], "49": [8, 9, 72, 75], "347": [8, 72, 75], "top": [8, 18, 31, 35, 45, 48, 59, 65, 72, 74, 75], "frequent": [8, 37, 67, 68, 69, 70, 71, 72, 75], "238": [8, 72, 75], "product": [8, 66, 72, 75], "except": [8, 72, 75], "659": [8, 72, 75], "encod": [8, 39, 72, 75], "decod": [8, 66, 72, 75], "128": [8, 72, 75], "consecut": [8, 64, 72, 75], "sequenc": [8, 34, 39, 45, 48, 65, 72, 75], "hard": [8, 16, 17, 28, 29, 34, 39, 42, 45, 46, 48, 50, 61, 62, 69, 75], "want": [8, 12, 13, 14, 17, 19, 21, 22, 25, 29, 37, 38, 42, 46, 50, 53, 57, 60, 62, 66, 67, 68, 69, 70, 71, 72, 75], "feel": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "free": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 73, 75], "pull": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "request": [8, 12, 17, 19, 22, 29, 42, 46, 48, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "open": [8, 12, 17, 18, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "issu": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "discuss": [8, 12, 17, 19, 22, 23, 29, 36, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "improv": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "offici": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 73, 75], "websit": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "forum": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "hint": [8, 12, 15, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "happi": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "height": [9, 32, 33, 34, 36, 37, 38, 39, 40, 41, 59], "There": [9, 21, 23, 39, 43, 44, 48, 54, 55, 57, 58, 59, 61, 65, 72, 74], "vertic": [9, 45, 52, 54, 56, 57, 61], "drawn": 9, "endpoint": 9, "th": [9, 13, 25, 37, 47, 63], "x": [9, 39, 45, 47, 52, 56, 59, 61, 74], "axi": 9, "notic": [9, 11, 20], "slant": 9, "maxarea": 9, "area": 9, "max_area": 9, "pointer": [9, 10, 11, 16, 20, 21, 23, 24, 25, 26, 27, 28, 72], "until": [9, 10, 11, 15, 20, 21, 24, 25, 26, 27, 28, 31, 33, 35, 37, 38, 43, 47, 56, 57, 61, 76], "h": [9, 32, 34, 36, 37, 38, 39, 45], "min": [9, 13, 14, 48, 49, 59, 61], "width": [9, 35], "distanc": 9, "shorter": 9, "inward": 9, "possibl": [9, 11, 13, 21, 34, 37, 40, 44, 45, 51, 52, 56, 57, 59, 61, 65, 74], "systemat": 9, "hold": [9, 15, 23], "point": [9, 11, 20, 21, 23, 24, 25, 26, 27, 34, 39, 43, 54], "taller": 9, "won": 9, "increas": [9, 11, 38, 66, 75], "decreas": [9, 11, 27], "smaller": [9, 11, 16, 27, 33, 34, 38, 48, 49, 51, 55, 57, 65], "height1": 9, "height2": 9, "height3": 9, "45": [9, 65], "approach": [9, 15, 26, 28, 33, 34, 37, 39, 40, 41, 45, 49, 51, 56, 63], "like": [9, 11, 15, 26, 34, 35, 36, 38, 39, 41, 43, 45, 55, 56, 73], "whose": 9, "consumpt": 9, "As": [9, 24, 27, 37], "variant": [9, 35], "gap": 9, "ll": 9, "volum": 9, "uppercas": [10, 15, 16, 52], "non": [10, 27, 34, 36, 61, 69, 75], "alphanumer": 10, "read": [10, 72], "forward": [10, 74], "backward": 10, "printabl": 10, "ispalindrom": 10, "lower": [10, 13], "cleaned_": 10, "join": [10, 39, 61], "isalnum": 10, "clean": [10, 33], "don": [10, 21, 28, 39, 43], "insensit": 10, "digit": [10, 14], "punctuat": 10, "closer": [10, 36, 37], "decrement": [10, 11, 15, 16, 37, 57], "mismatch": [10, 40], "man": 10, "plan": [10, 63, 64], "canal": 10, "panama": 10, "output1": 10, "race": [10, 73], "output2": 10, "input3": 10, "output3": 10, "comprehens": 10, "half": [10, 20, 21, 24, 48], "still": [10, 15, 16, 20, 23, 31, 37, 41, 44, 49, 52], "primarili": [10, 15, 24, 40, 41, 44, 47, 64], "version": [10, 56, 72, 73], "larg": [10, 38, 40, 47, 49], "addition": [10, 14, 25, 33, 34, 40, 52, 56, 58, 61], "babad": 10, "bab": 10, "aba": 10, "limit": [10, 45, 65], "allowed_char": 10, "ignor": [10, 18], "triplet": 11, "j": [11, 28, 45, 52, 54, 56, 59, 61], "3000": [11, 33], "threesum": 11, "ascend": [11, 20, 21, 28, 37], "skip": [11, 25, 51, 63, 64], "elif": [11, 18, 21, 38, 44, 48, 64], "neg": [11, 34, 41, 51], "Then": [11, 13, 48, 59, 61], "larger": [11, 16, 38, 48, 52], "been": [11, 16, 18, 24, 31, 33, 45, 54, 55, 57, 58, 72, 76], "contribut": [11, 21, 24, 35, 47, 52, 55, 65, 73], "roughli": [11, 35], "mani": [11, 16, 44, 51, 56, 58, 61, 65], "criteria": 11, "rather": [11, 20, 54], "gener": [11, 16, 18, 24, 48, 51, 52, 65, 72, 74], "target": [11, 21, 34, 38, 51, 72], "satisfi": [11, 41, 55, 59, 61, 72], "themselv": [11, 24], "some": [11, 15, 18, 23, 38, 39], "125": [12, 72, 75], "15": [12, 20, 31, 32, 33, 34, 52, 72, 75], "3sum": [12, 72, 75], "11": [12, 20, 72, 75], "With": [12, 13, 72, 75], "water": [12, 56, 60, 72, 75], "solut": [12, 17, 19, 22, 23, 27, 28, 29, 36, 40, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 74], "price": 13, "dai": [13, 76], "maxim": [13, 63], "profit": 13, "choos": [13, 15, 34, 47, 64], "futur": [13, 72], "transact": 13, "maxprofit": 13, "min_pric": 13, "max_profit": 13, "encount": [13, 14, 18, 34, 55, 56, 74], "made": [13, 27, 28, 33, 40, 43, 44, 48, 49, 51], "seen": [13, 14, 49], "far": [13, 14, 16, 37, 48, 49], "haven": [13, 37, 45], "lowest": [13, 42, 75], "sold": 13, "assum": [13, 33, 44, 54, 55, 56, 58, 61], "bought": 13, "subtract": [13, 51], "previous": [13, 43, 44], "prices1": 13, "prices2": 13, "examin": 13, "rel": [13, 28, 38, 59], "regardless": [13, 15, 23, 24, 26, 27, 38, 63, 64, 73], "memori": [13, 23, 26, 27, 28, 38, 39, 44, 52, 54, 56], "usag": [13, 23, 25, 33, 34, 37, 39, 41, 43, 44, 47, 48, 49, 52, 59, 63], "again": [13, 15, 21, 23, 43], "fee": 13, "introduc": [13, 74], "symbol": 14, "length_of_longest_substr": 14, "last": [14, 21, 23, 24, 26, 31, 43, 50, 63, 64, 72], "char_index": 14, "necessari": [14, 44, 48, 49, 52], "wa": [14, 16, 20, 26, 43, 61, 72, 73], "new": [14, 23, 24, 25, 26, 27, 28, 31, 33, 34, 35, 38, 39, 43, 44, 45, 47, 49, 54, 58, 61, 63, 72, 74], "fact": 14, "abcabcbb": 14, "bbbbb": 14, "pwwkew": 14, "lookup": 14, "arithmet": [14, 18], "abca": 14, "abcd": 14, "chang": [15, 24, 26, 45, 49, 56, 66, 72, 74, 75], "time": [15, 16, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 72, 73, 74, 75], "characterreplac": 15, "max_count": 15, "slide": [15, 16, 48, 72], "window": [15, 48, 72], "char_count": 15, "plu": [15, 34], "minu": [15, 52], "exceed": 15, "shrink": [15, 16], "side": [15, 36], "alwai": [15, 49, 54], "s1": 15, "abab": 15, "k1": [15, 37], "s2": 15, "aababba": 15, "k2": [15, 37], "space": [15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 73, 74], "complex": [15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 74], "sever": [15, 39, 74], "inform": [15, 26, 55, 61, 73, 75, 76], "variat": [15, 16, 20, 21, 47, 63, 64], "testcas": 16, "min_window_substr": 16, "t_dict": 16, "current_window_dict": 16, "popul": [16, 49, 57, 58], "char": [16, 18, 43, 44, 45, 61], "min_len": 16, "float": [16, 34, 41, 48], "inf": [16, 34, 41], "min_window": 16, "required_char": 16, "found_char": 16, "window_s": 16, "left_char": 16, "further": [16, 26, 56, 61, 74, 76], "adobecodebanc": 16, "abc": [16, 52], "banc": 16, "aa": 16, "smallest": [16, 20, 21, 42, 48, 49, 61, 75], "No": [16, 73], "121": [17, 72, 75], "best": [17, 32, 34, 37, 72, 73, 75], "bui": [17, 72, 75], "And": [17, 42, 46, 75], "sell": [17, 72, 75], "stock": [17, 72, 75], "424": [17, 72, 75], "76": [17, 72, 75], "bracket": 18, "close": [18, 37, 41, 55], "correct": [18, 34, 35, 47, 48, 52, 59, 61], "isvalid": 18, "map": [18, 54, 56], "bracket_map": 18, "push": [18, 37, 47, 74], "onto": [18, 37], "pop": [18, 31, 33, 35, 37], "dummi": [18, 23, 25, 27, 28], "top_el": 18, "unmatch": 18, "recent": [18, 72], "error": [18, 72], "properli": 18, "bottom": [18, 31, 34, 35, 45, 59], "demonstr": [18, 34, 39, 43, 47, 51, 55, 58, 59, 63, 64, 73], "mainli": [18, 44, 45], "express": [18, 51, 73], "combin": [18, 24, 27, 33, 35, 53, 65, 75], "20": [19, 31, 32, 33, 34, 72, 75], "parenthes": [19, 72, 75], "suppos": [20, 45, 47], "might": [20, 21, 33, 48], "becom": [20, 21, 25, 26, 27, 31, 37, 38, 51, 57], "5000": [20, 21, 26, 57], "findmin": 20, "mid": [20, 21], "rightmost": [20, 35], "break": [20, 24, 31, 33, 40, 61, 65, 66, 75], "converg": 20, "At": [20, 34, 39, 43, 44, 45, 47, 48, 49], "search": [20, 33, 37, 39, 40, 42, 43, 46, 49, 51, 53, 54, 55, 56, 58, 59, 72], "middl": [20, 21, 24, 48], "elimin": [20, 38, 51], "met": [20, 24, 38, 52, 55, 56], "impli": 20, "13": [20, 72], "17": [20, 72], "emploi": 20, "divid": [20, 21, 28, 33, 48, 59], "halv": [20, 24, 48], "logarithm": [20, 38, 48], "reduc": [20, 28, 43, 51, 56, 59], "henc": 20, "kth": [20, 42, 47, 48, 50, 75], "extens": [20, 34, 38, 48, 54, 72], "prior": 21, "pass": [21, 23, 25, 26, 34, 49, 52], "unknown": [21, 61], "pivot": 21, "runtim": 21, "li": 21, "reset": 21, "chosen": [21, 51], "target1": [21, 51], "target2": [21, 51], "target3": [21, 51], "veri": [21, 40, 49], "scale": [21, 35, 40, 64], "circularli": 21, "circular": [21, 57, 63, 64], "manner": [21, 27, 32, 37], "maintain": [21, 41, 43, 45, 47, 48, 49, 54, 59, 63], "153": [22, 72, 75], "rotat": [22, 26, 70, 72, 75], "33": [22, 72, 75], "head": [23, 24, 25, 26, 27], "reach": [23, 24, 25, 26, 32, 37, 38, 43, 44, 51, 55, 58, 59, 65], "intern": 23, "po": [23, 72], "denot": [23, 59], "tail": [23, 26, 28], "connect": [23, 25, 34, 39, 54, 55, 56, 59, 60, 63, 64, 75], "singli": [23, 24, 26, 27, 28], "listnod": [23, 24, 25, 26, 27, 28], "hascycl": 23, "slow": [23, 24], "fast": [23, 24, 49], "attribut": [23, 24, 25, 27, 32, 33, 34, 38, 39, 43, 44, 72], "eventu": [23, 38], "catch": 23, "helper": [23, 24, 25, 26, 27, 34, 40, 41, 44, 51, 52, 58, 64], "create_linked_list_with_cycl": 23, "cycle_nod": 23, "enumer": [23, 54], "purpos": [23, 24, 26, 27, 67, 68, 69, 70, 71, 75, 76], "simplifi": [23, 24, 25, 26, 27, 28, 58, 59], "creation": [23, 24, 47], "specifi": [23, 24, 44, 49, 52, 61, 73], "simul": [23, 37, 47], "easili": [23, 24, 27, 39], "particularli": [23, 43], "abil": [23, 43, 55], "reason": [23, 36, 38, 44, 56, 73], "speed": 23, "approxim": [23, 31, 36, 41, 47], "l_0": 24, "l_1": 24, "l_": 24, "l_n": 24, "l_2": 24, "1000": [24, 31, 34, 39, 40, 47, 64], "reorderlist": 24, "first_half": 24, "second_half": 24, "prev": [24, 26, 63, 64], "next_nod": [24, 26], "merg": [24, 29, 37, 69, 74, 75], "altern": [24, 35], "next_p1": 24, "next_p2": 24, "pattern": [24, 27, 31, 73], "describ": [24, 47, 54, 64, 76], "statement": [24, 43, 47, 51, 61, 64, 65], "detail": [24, 51, 58, 59, 61, 72, 74, 76], "direct": [24, 26, 52, 56, 57, 58, 61, 72], "now": [24, 25, 33, 43, 47, 72], "adjust": 24, "printlinkedlist": [24, 27], "debug": [24, 27], "displai": [24, 27, 72], "regular": [24, 27], "visual": [24, 27, 55], "head1": [24, 25, 26], "head2": [24, 25, 26], "compon": [24, 54, 59, 60, 75], "manipul": [24, 43, 47, 49], "segment": 24, "odd": [24, 31, 48], "come": [24, 39, 52, 61], "sz": 25, "removenthfromend": 25, "advanc": [25, 26, 73], "_": [25, 31, 58, 59], "simultan": [25, 63], "individu": [25, 40, 56, 67, 68, 69, 70, 71, 73, 75], "ahead": 25, "createlinkedlist": [25, 26], "converttolist": 25, "familiar": [25, 74], "n1": [25, 55, 58], "new_head1": 25, "n2": [25, 55, 58], "new_head2": 25, "head3": [25, 26], "n3": 25, "new_head3": 25, "certainli": [25, 64], "isol": [25, 54], "reverselistit": 26, "reverselistrecurs": 26, "new_head": 26, "cycl": [26, 29, 54, 55, 57, 61, 72, 75], "linkedlisttolist": 26, "newli": [26, 27], "reversed_head1": 26, "reversed_head2": 26, "reversed_head3": 26, "about": [26, 55, 56, 57, 73], "state": [26, 72], "list1": 27, "list2": 27, "splice": 27, "50": 27, "mergetwolist": 27, "serv": [27, 43, 54], "placehold": 27, "attach": 27, "essenti": [27, 36, 38, 57, 65], "merged_list": 27, "why": [27, 35, 49, 73], "temporari": [27, 63], "manag": [27, 72], "alloc": [27, 44], "zigzag": [27, 31, 35], "500": 28, "exce": [28, 49, 51], "mergeklist": 28, "mergedlist": 28, "l1": 28, "l2": 28, "mergelist": 28, "conquer": 28, "high": [28, 58], "level": [28, 32, 33, 35, 42, 44, 58, 59, 72, 73, 75], "overview": [28, 51], "strategi": [28, 63, 64], "lists1": 28, "lists2": 28, "lists3": 28, "fashion": 28, "across": [28, 39, 43], "low": [28, 49], "overhead": [28, 32, 44], "206": [29, 72, 75], "21": [29, 72, 75], "143": [29, 72, 75], "reorder": [29, 72, 75], "19": [29, 72, 75], "nth": [29, 75], "141": [29, 72, 75], "23": [29, 72, 75], "2000": [31, 35, 40, 43, 57], "levelord": 31, "bf": [31, 55, 56], "level_valu": 31, "level_s": [31, 35], "dequeu": [31, 33, 35, 57], "front": [31, 33, 57], "enqueu": [31, 33, 35], "children": [31, 33, 35, 37, 39, 43, 44, 45], "object": [31, 33, 36, 39, 43, 44, 48, 49, 56, 72], "breadth": [31, 54, 55, 56], "balanc": [31, 32, 34, 36, 37, 38, 41, 48], "wors": 31, "invert": [32, 42, 75], "path": [32, 42, 45, 51, 52, 55, 58, 67, 72, 75], "farthest": 32, "leaf": [32, 34, 37, 39], "maxdepth": 32, "left_depth": 32, "right_depth": 32, "understand": [32, 74, 76], "three": [32, 33, 38, 39, 51, 52, 64, 65], "well": [32, 38, 40, 44, 48, 56, 65, 73], "explor": [32, 34, 44, 45, 51, 52, 54, 55, 56, 58, 59], "skew": [32, 33, 36, 41], "deep": [32, 33, 54, 56, 59], "perfectli": [32, 37], "vari": [32, 37, 41], "shape": [32, 41], "buildtre": 33, "root_val": 33, "root_idx_inord": 33, "appropri": [33, 48, 73], "sublist": 33, "slice": 33, "subproblem": [33, 65], "treetolist": 33, "trail": 33, "b": [33, 35, 44, 45, 52, 58, 61, 74], "represent": [33, 39, 57, 61], "reflect": [33, 61], "highli": [33, 37], "postord": 33, "reconstruct": [33, 39], "adjac": [34, 45, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64], "edg": [34, 54, 55, 56, 57, 58, 59, 61], "choic": 34, "option": 34, "global": 34, "ultim": 34, "aim": [34, 47, 59, 64], "maxpathsum": 34, "max_path_sum_help": 34, "left_max": 34, "right_max": 34, "max_sum": 34, "infin": [34, 41], "importantli": 34, "root1": [34, 35, 36, 37, 41], "root2": [34, 35, 36, 37, 38, 41], "42": 34, "anywher": 34, "imagin": 35, "yourself": [35, 39], "stand": 35, "rightsideview": 35, "d": [35, 45, 52], "subsequ": [35, 66, 67, 75], "obtain": [35, 39, 45], "visibl": [35, 73], "auxiliari": [35, 36, 51, 54], "leftmost": [35, 37], "inverttre": 36, "swap": [36, 38], "noth": 36, "inverted_root1": 36, "__main__": 36, "0x7faa5c445ab0": 36, "inverted_root2": 36, "0x7faa5c444310": 36, "root3": 36, "inverted_root3": 36, "occur": [36, 43, 51, 56, 72], "full": [36, 72], "practic": [36, 37, 38, 40, 41, 43, 44, 45, 51, 55, 56, 57], "often": [36, 37, 41, 51, 56, 57], "mind": [36, 40, 56, 61], "task": [36, 39, 43, 45, 52, 55, 58, 59, 63], "mimic": 36, "tree": [37, 46, 60], "kthsmallest": [37, 49], "yet": [37, 58], "concis": [37, 76], "resembl": 37, "moder": [37, 40, 73], "usual": [37, 55], "bst": [38, 41, 42, 75], "lca": 38, "wikipedia": 38, "descend": [38, 40], "lowestcommonancestor": 38, "inclus": [38, 73], "simpl": [38, 39], "logic": [38, 43], "neither": 38, "advantag": [38, 76], "properti": [38, 41, 49, 55], "narrow": 38, "lead": [38, 43, 51, 73], "quick": [38, 48], "Its": 38, "suitabl": [38, 48], "file": [39, 72], "buffer": 39, "transmit": 39, "later": [39, 44], "environ": [39, 72, 73, 76], "restrict": [39, 64], "clarif": 39, "necessarili": 39, "creativ": 39, "tthe": 39, "byte": 39, "persist": 39, "context": [39, 51, 55], "recreat": 39, "flexibl": 39, "accur": [39, 54], "unambigu": 39, "goal": [39, 43, 45, 47, 51, 54, 56, 57, 58, 59, 61, 63, 64], "common": [39, 42, 43, 45, 67, 73, 75], "preorder": [39, 42, 75], "pars": [39, 72], "df": [39, 41, 45, 51, 52, 54, 55, 56, 58, 59], "int": [39, 48, 49, 54, 56, 57, 59, 63, 64, 65], "absenc": 39, "comma": 39, "custom": 39, "serialized_tre": 39, "new_root": 39, "convers": [39, 52], "major": 39, "unless": 39, "techniqu": [39, 56], "descript": [40, 67, 68, 69, 70, 71, 74, 75, 76], "subroot": 40, "issubtre": 40, "tree1": 40, "tree2": 40, "unnecessari": [40, 45, 51], "Is": 40, "earli": [40, 51], "whichev": 40, "degrad": 40, "31": [41, 72], "is_valid_bst": 41, "is_valid": 41, "min_val": 41, "max_val": 41, "wide": [41, 67, 68, 69, 70, 71, 75], "violat": [41, 73], "log2": 41, "quit": 41, "standard": 41, "226": [42, 75], "104": [42, 75], "572": [42, 75], "235": [42, 75], "ancestor": [42, 75], "102": [42, 75], "98": [42, 72, 75], "230": [42, 75], "inord": [42, 75], "124": [42, 75], "297": [42, 75], "serial": [42, 75], "deseri": [42, 75], "pronounc": 43, "dataset": 43, "variou": [43, 61], "applic": [43, 72], "autocomplet": 43, "spellcheck": 43, "void": [43, 44, 48], "startswith": 43, "hand": [43, 54, 58, 59, 61], "known": [43, 63, 67, 68, 69, 70, 71, 72, 75], "spell": [43, 45], "special": [43, 45], "flag": [43, 44, 45], "successfulli": [43, 52, 57], "expect": [43, 52, 56, 59, 74, 75, 76], "trienod": [43, 44, 45], "is_end_of_word": [43, 44, 45], "mark": [43, 44, 45, 52, 55, 56, 58, 59], "confirm": 43, "presenc": [43, 57], "appl": 43, "app": [43, 72], "share": 43, "relat": 43, "auto": [43, 44, 72], "suggest": [43, 44, 74], "featur": [43, 44, 74], "program": [43, 63, 64, 65, 68, 69, 70, 71], "support": [44, 48, 49], "worddictionari": 44, "addword": 44, "dot": 44, "25": [44, 72], "queri": [44, 58], "wildcard": 44, "partial": [44, 54], "fuzzi": 44, "bad": 44, "dad": 44, "mad": 44, "pad": 44, "exact": 44, "bed": 44, "bet": 44, "etc": [44, 45], "search_help": 44, "trie": [44, 45, 75], "public": [44, 54, 73], "l": [44, 45], "exponenti": [44, 51, 52], "system": [44, 63, 64], "deleteword": 44, "board": [45, 52], "cell": [45, 52, 56, 59, 72], "horizont": [45, 52, 56], "neighbor": [45, 52, 54, 55, 56, 57, 58, 59, 61, 64], "sure": 45, "backtrack": [45, 51, 52, 59], "bound": [45, 52], "prevent": [45, 52, 55, 57], "revisit": [45, 52, 55], "restor": [45, 52], "prune": [45, 52], "findword": 45, "curr_nod": 45, "stop": [45, 51, 63], "temp": [45, 63], "buildtri": 45, "dimens": [45, 52, 56, 59], "grid": [45, 52, 56, 59], "built": 45, "reus": 45, "board1": [45, 52], "r": [45, 59], "f": [45, 52, 65, 72], "v": [45, 54, 55, 57, 58, 61], "words1": [45, 61], "oath": 45, "pea": 45, "rain": [45, 59], "board2": 45, "words2": [45, 61], "abcb": [45, 52], "row": [45, 56, 59], "column": [45, 56, 59], "influenc": [45, 51], "basic": [45, 64], "out": [45, 52, 55, 65, 72], "2d": [45, 52, 56, 59], "208": [46, 75], "211": [46, 75], "212": [46, 75], "ii": [46, 66, 69, 75], "plai": 47, "game": [47, 68, 75], "On": 47, "turn": 47, "heaviest": 47, "smash": 47, "y": [47, 59], "destroi": 47, "appli": [47, 64, 73], "rule": [47, 59, 61], "select": [47, 51], "happen": [47, 76], "heapq": [47, 48, 49], "laststoneweight": 47, "negat": 47, "max_heap": 47, "heapifi": 47, "heappop": [47, 48, 49], "new_ston": 47, "heappush": [47, 48, 49], "librari": 47, "stones1": 47, "stones2": 47, "rest": [47, 65], "enough": 47, "linearithm": 47, "medianfind": 48, "addnum": 48, "findmedian": 48, "accept": [48, 73], "99": 48, "deal": 48, "ask": [48, 51, 56, 65, 67, 68, 69, 70, 71, 75], "precis": 48, "small_half": 48, "large_half": 48, "rebal": 48, "offer": 48, "access": [48, 72], "kthlargest": 49, "whenev": 49, "kept": 49, "discard": 49, "scalabl": 49, "modul": [49, 52, 72], "min_heap": 49, "1th": 49, "dynam": [49, 63, 64, 65], "update_k": 49, "lifetim": 49, "703": 50, "stream": [50, 75], "1046": 50, "stone": 50, "weight": 50, "295": [50, 75], "median": [50, 75], "candid": 51, "unlimit": 51, "150": [51, 72], "40": [51, 72], "combinationsum": 51, "invalid": [51, 61, 72], "dedupl": 51, "respons": [51, 74, 76], "anyth": 51, "candidates1": 51, "candidates2": 51, "candidates3": 51, "much": [51, 57, 59, 74], "faster": 52, "imposs": [52, 57], "mention": [52, 55, 61, 74], "temporarili": 52, "tmp": [52, 72], "four": [52, 56], "signatur": 52, "member": [52, 73], "marker": 52, "propag": 52, "word1": [52, 61], "word2": [52, 61], "word3": 52, "random": 52, "39": [53, 72, 75], "79": [53, 75], "undirect": [54, 55, 60, 75], "copi": [54, 74], "simplic": 54, "unord": 54, "finit": [54, 56], "relationship": [54, 57, 61], "aspect": 54, "entri": [54, 72], "separ": [54, 58], "compos": 54, "establish": 54, "cyclic": 54, "clonegraph": 54, "original_nod": 54, "copy_nod": 54, "look": [54, 59, 72, 74], "intact": 54, "get_adjacency_list": 54, "get_node_and_neighbor": 54, "adjlist1": 54, "adjlist": 54, "adj": 54, "cloned_node1": 54, "cloned_adjlist1": 54, "adjlist2": 54, "node1": 54, "cloned_adjlist2": 54, "storag": 54, "fall": 54, "infinit": 54, "subset": 54, "label": [55, 57], "thu": [55, 63], "circuit": 55, "piec": 55, "arrang": [55, 64], "seri": [55, 73], "validtre": 55, "adj_list": 55, "u": 55, "parent": 55, "reachabl": [55, 59], "accomplish": [55, 57], "edges1": [55, 58], "edges2": [55, 58], "span": 55, "mst": 55, "kruskal": 55, "prim": 55, "reinforc": 55, "concept": 55, "identifi": [55, 56, 57, 58, 59], "enhanc": [55, 74], "land": 56, "surround": [56, 59], "300": [56, 66, 75], "diagon": [56, 59], "wrap": [56, 72], "around": [56, 73], "clarifi": [56, 73], "graph": [56, 57, 59, 61], "extent": 56, "unvisit": [56, 58], "essenc": 56, "numisland": 56, "num_island": 56, "col": 56, "dr": 56, "dc": 56, "boundari": 56, "grid1": 56, "grid2": 56, "numcours": 57, "prerequisit": [57, 74], "ai": 57, "bi": 57, "finish": [57, 72], "taken": [57, 65], "dequ": [57, 61], "canfinish": 57, "in_degre": [57, 61], "degre": [57, 61], "topolog": [57, 61], "popleft": [57, 61], "were": [57, 63, 64, 73], "brief": 57, "those": [57, 65, 73], "numcourses1": 57, "prerequisites1": 57, "sol": [57, 63], "numcourses2": 57, "prerequisites2": 57, "outgo": 57, "durat": 57, "countconnectedcompon": 58, "counter": 58, "hasn": 58, "disconnect": 58, "rectangular": 59, "island": [59, 60, 75], "border": 59, "ocean": 59, "ocea": 59, "touch": 59, "partit": 59, "squar": 59, "matrix": [59, 70, 75], "sea": 59, "coordin": 59, "receiv": [59, 61], "lot": 59, "north": 59, "south": 59, "east": 59, "west": 59, "r_i": 59, "c_i": 59, "contact": [59, 63, 64], "rainwat": 59, "send": 59, "classic": [59, 63, 65], "pacificatlant": 59, "matric": 59, "pacific_reach": 59, "atlantic_reach": 59, "dx": 59, "dy": 59, "new_x": 59, "new_i": 59, "heights1": 59, "heights2": 59, "big": 59, "notat": 59, "133": [60, 75], "clone": [60, 67, 68, 69, 70, 71, 74, 75], "417": [60, 75], "pacif": [60, 75], "atlant": [60, 75], "flow": [60, 75], "207": [60, 75], "cours": [60, 75], "schedul": [60, 75], "323": [60, 75], "261": [60, 75], "languag": [61, 67, 68, 69, 70, 71, 73, 75], "latin": 61, "alphabet": 61, "lexicograph": 61, "deriv": 61, "normal": [61, 72], "rank": 61, "human": 61, "situat": 61, "inconsist": 61, "instruct": 61, "adher": [61, 63, 74, 75], "alienord": 61, "min_length": 61, "kahn": 61, "preced": 61, "success": 61, "wrt": 61, "wrf": 61, "er": 61, "ett": 61, "rftt": 61, "wertf": 61, "wrtef": 61, "zx": 61, "Be": [61, 74], "269": [62, 75], "alien": [62, 75], "profession": [63, 64, 73], "rob": [63, 64], "street": [63, 64], "monei": [63, 64], "stash": [63, 64], "secur": [63, 64, 73], "automat": [63, 64], "polic": [63, 64], "broken": [63, 64], "night": [63, 64], "tonight": [63, 64], "alert": [63, 64], "400": 63, "earn": 63, "trigger": [63, 64], "stolen": 63, "curr": [63, 64], "assign": [63, 65], "alarm": 63, "circl": 64, "That": 64, "meanwhil": 64, "twist": 64, "implic": 64, "vice": 64, "versa": 64, "illustr": 64, "simple_rob": 64, "robberi": 64, "case1": 64, "case2": 64, "steal": 64, "instanti": 64, "sacrif": 64, "accommod": 64, "staircas": 65, "shown": 65, "climbstair": 65, "dp": 65, "70": [66, 75], "climb": [66, 75], "stair": [66, 75], "198": [66, 75], "hous": [66, 75], "robber": [66, 75], "213": [66, 75], "647": [66, 75], "91": [66, 75], "322": [66, 75], "coin": [66, 75], "152": [66, 75], "subarrai": [66, 68, 75], "139": [66, 72, 75], "curat": [67, 68, 69, 70, 71, 75], "commonli": [67, 68, 69, 70, 71, 75], "cover": [67, 68, 69, 70, 71, 75], "technic": [67, 68, 69, 70, 71, 75], "interview": [67, 68, 69, 70, 71, 75], "strong": [67, 68, 69, 70, 71, 75], "foundat": [67, 68, 69, 70, 71, 75], "62": [67, 75], "1143": [67, 75], "download": [67, 68, 69, 70, 71, 75], "local": [67, 68, 69, 70, 71, 72, 74, 75], "machin": [67, 68, 69, 70, 71, 74, 75], "git": [67, 68, 69, 70, 71, 74, 75], "http": [67, 68, 69, 70, 71, 72, 73, 74, 75], "github": [67, 68, 69, 70, 71, 72, 74, 75, 76], "com": [67, 68, 69, 70, 71, 72, 74, 75, 76], "mohsentabibian": [67, 68, 69, 70, 71, 75, 76], "directori": [67, 68, 69, 70, 71, 75], "cd": [67, 68, 69, 70, 71, 72, 75], "templat": [67, 68, 69, 70, 71, 72, 75, 76], "prefer": [67, 68, 69, 70, 71, 75], "meant": [67, 68, 69, 70, 71, 75], "educ": [67, 68, 69, 70, 71, 73, 75], "prepar": [67, 68, 69, 70, 71, 75], "guidelin": [67, 68, 69, 70, 71, 75], "53": [68, 75], "55": [68, 75], "jump": [68, 75], "57": [69, 75], "56": [69, 75], "435": [69, 75], "overlap": [69, 75], "252": [69, 75], "room": [69, 75], "253": [69, 75], "48": [70, 75], "imag": [70, 75], "54": [70, 75], "spiral": [70, 75], "73": [70, 75], "191": [71, 75], "338": [71, 75], "190": [71, 75], "268": [71, 75], "miss": [71, 72, 75], "371": [71, 75], "pip": 72, "instal": 72, "upgrad": 72, "book": 72, "usr": 72, "lib": 72, "python3": 72, "site": 72, "packag": 72, "docutil": 72, "18": 72, "jinja2": 72, "home": 72, "codespac": 72, "jsonschema": 72, "linkifi": 72, "py": 72, "myst": 72, "nb": 72, "pyyaml": 72, "sphinx": 72, "comment": [72, 73, 74], "copybutton": 72, "extern": [72, 73], "toc": 72, "jupyterbook": 72, "latex": 72, "thebe": 72, "theme": 72, "sphinx_togglebutton": 72, "sphinxcontrib": 72, "bibtex": 72, "multitoc": 72, "attr": 72, "22": 72, "2023": 72, "03": 72, "referenc": 72, "28": 72, "rpd": 72, "uc": 72, "micro": 72, "importlib_metadata": 72, "ipython": 72, "16": 72, "cach": 72, "nbclient": 72, "parser": 72, "nbformat": 72, "ipykernel": 72, "applehelp": 72, "devhelp": 72, "jsmath": 72, "htmlhelp": 72, "serializinghtml": 72, "qthelp": 72, "pygment": 72, "snowballstemm": 72, "babel": 72, "alabast": 72, "images": 72, "markupsaf": 72, "pydata": 72, "14": 72, "pybtex": 72, "setuptool": 72, "68": 72, "wheel": 72, "41": 72, "sqlalchemi": 72, "tabul": 72, "markdown": 72, "mdit": 72, "plugin": 72, "client": 72, "core": 72, "traitlet": 72, "fastjsonschema": 72, "latexcodec": 72, "six": 72, "beautifulsoup4": 72, "charset": 72, "idna": 72, "urllib3": 72, "certifi": 72, "2017": 72, "zipp": 72, "comm": 72, "debugpi": 72, "matplotlib": 72, "inlin": 72, "asyncio": 72, "psutil": 72, "pyzmq": 72, "tornado": 72, "backcal": 72, "decor": 72, "jedi": 72, "pickleshar": 72, "prompt": 72, "toolkit": 72, "37": 72, "exceptiongroup": 72, "pexpect": 72, "parso": 72, "dateutil": 72, "platformdir": 72, "mdurl": 72, "ptyprocess": 72, "wcwidth": 72, "greenlet": 72, "soupsiev": 72, "execut": 72, "asttoken": 72, "pure": 72, "eval": 72, "restart": 72, "kernel": 72, "workspac": 72, "migrat": 72, "_toc": 72, "yml": 72, "traceback": 72, "bin": 72, "sy": 72, "1157": 72, "__call__": 72, "arg": 72, "kwarg": 72, "1078": 72, "rv": 72, "invok": 72, "ctx": 72, "1688": 72, "_process_result": 72, "sub_ctx": 72, "command": 72, "1434": 72, "callback": 72, "param": 72, "783": 72, "__callback": 72, "sphinx_external_toc": 72, "cli": 72, "migrate_toc": 72, "migrate_jupyter_book": 72, "toc_fil": 72, "tool": 72, "327": 72, "rais": 72, "malformederror": 72, "32m": 72, "1mrun": 72, "v0": 72, "0m": 72, "34m": 72, "1msourc": 72, "folder": 72, "1mconfig": 72, "_config": 72, "1moutput": 72, "_build": 72, "html": [72, 73], "01mrun": 72, "v5": 72, "00m": 72, "etoc": 72, "master_doc": 72, "readm": 72, "01mmyst": 72, "mdparserconfig": 72, "commonmark_onli": 72, "gfm_onli": 72, "enable_extens": 72, "colon_f": 72, "dollarmath": 72, "substitut": 72, "tasklist": 72, "disable_syntax": 72, "all_links_extern": 72, "url_schem": 72, "mailto": 72, "ref_domain": 72, "highlight_code_block": 72, "number_code_block": 72, "title_to_head": 72, "heading_anchor": 72, "heading_slug_func": 72, "footnote_transit": 72, "words_per_minut": 72, "sub_delimit": 72, "linkify_fuzzy_link": 72, "dmath_allow_label": 72, "dmath_allow_spac": 72, "dmath_allow_digit": 72, "dmath_double_inlin": 72, "update_mathjax": 72, "mathjax_class": 72, "tex2jax_process": 72, "mathjax_process": 72, "math": 72, "output_area": 72, "nbparserconfig": 72, "custom_format": 72, "metadata_kei": 72, "mystnb": 72, "cell_metadata_kei": 72, "kernel_rgx_alias": 72, "execution_mod": 72, "execution_cache_path": 72, "execution_excludepattern": 72, "execution_timeout": 72, "execution_in_temp": 72, "execution_allow_error": 72, "execution_raise_on_error": 72, "execution_show_tb": 72, "merge_stream": 72, "render_plugin": 72, "remove_code_sourc": 72, "remove_code_output": 72, "code_prompt_show": 72, "show": 72, "code_prompt_hid": 72, "hide": 72, "number_source_lin": 72, "output_stderr": 72, "render_text_lex": 72, "ansi": 72, "render_error_lex": 72, "ipythontb": 72, "render_image_opt": 72, "render_figure_opt": 72, "render_markdown_format": 72, "commonmark": 72, "output_fold": 72, "append_css": 72, "metadata_to_fm": 72, "jupyter_cach": 72, "01mbuild": 72, "mo": 72, "00mtarget": 72, "date": [72, 76], "77": 72, "sourc": 72, "01mupdat": 72, "config": 72, "01mread": 72, "35m01": 72, "hash": 72, "01": 72, "cwd": 72, "07": 72, "02": 72, "05": 72, "35m02": 72, "00": 72, "35m03": 72, "89": 72, "87": 72, "35m04": 72, "04": 72, "27": 72, "35m05": 72, "29": 72, "35m06": 72, "06": 72, "96": 72, "91mexcept": 72, "512": 72, "_async_cleanup_kernel": 72, "await": 72, "ensure_async": 72, "km": 72, "cleanup_resourc": 72, "attributeerror": 72, "nonetyp": 72, "91mthe": 72, "save": 72, "err": 72, "tl19fjln": 72, "report": [72, 73, 74, 75], "develop": 72, "user": 72, "messag": [72, 74], "bug": [72, 74], "tracker": 72, "doc": 72, "thank": [72, 74], "jupyter_cli": 72, "wrapper": 72, "_readi": 72, "set_result": 72, "invalidstateerror": 72, "505": 72, "shutdown_kernel": 72, "jupyter_cor": 72, "189": 72, "obj": 72, "92": 72, "set_except": 72, "jupyter_book": 72, "171": 72, "build_sphinx": 72, "force_al": 72, "filenam": 72, "329": 72, "builder": 72, "build_upd": 72, "288": 72, "to_build": 72, "302": 72, "updated_docnam": 72, "409": 72, "_read_seri": 72, "docnam": 72, "430": 72, "read_doc": 72, "483": 72, "publish": [72, 73], "document": [72, 74], "reader": 72, "io": 72, "103": 72, "78": 72, "myst_nb": 72, "sphinx_": 72, "create_cli": 72, "83": 72, "__enter__": 72, "start_client": 72, "single_nb_execut": 72, "executor": 72, "58": 72, "executenb": 72, "1305": 72, "notebookcli": 72, "resourc": [72, 74], "173": 72, "run_until_complet": 72, "base_ev": 72, "649": 72, "689": 72, "async_execut": 72, "async": 72, "async_setup_kernel": 72, "contextlib": 72, "__aexit__": 72, "anext": 72, "gen": 72, "656": 72, "caus": 72, "317": 72, "builder_specific_act": 72, "525": 72, "runtimeerror": 72, "_message_box": 72, "msg": 72, "color": 72, "red": 72, "doprint": 72, "91m": 72, "pdfhtml": 72, "href": 72, "_blank": 72, "view": 72, "mybook": 72, "92m": 72, "bewar": 72, "citat": 72, "releas": [72, 76], "sourceforg": 72, "net": 72, "patch": 72, "195": 72, "intro": 72, "bib": 72, "forc": 72, "35": 72, "09": 72, "97": 72, "88": 72, "35mintro": 72, "01mlook": 72, "outdat": 72, "00mnone": 72, "01mpickl": 72, "00mdone": 72, "01mcheck": 72, "md": 72, "warn": 72, "isn": 72, "toctre": 72, "01mprepar": 72, "01mwrite": 72, "32mintro": 72, "01mgener": 72, "00mgenindex": 72, "page": 72, "00msearch": 72, "01mcopi": 72, "static": 72, "01mdump": 72, "en": 72, "inventori": 72, "written": [72, 73], "redirect": 72, "succeed": 72, "browser": 72, "Or": 72, "past": 72, "bar": 72, "project": [72, 74, 75], "jb": 72, "leader": 73, "particip": [73, 74, 75], "commun": [73, 74, 76], "harass": 73, "experi": 73, "everyon": 73, "ag": 73, "bodi": 73, "invis": 73, "disabl": 73, "ethnic": 73, "sex": 73, "characterist": 73, "gender": 73, "socio": 73, "econom": 73, "statu": 73, "nation": 73, "person": 73, "religion": 73, "sexual": 73, "orient": 73, "interact": 73, "welcom": [73, 74], "divers": 73, "healthi": 73, "behavior": [73, 76], "empathi": 73, "kind": 73, "peopl": 73, "Being": 73, "opinion": 73, "viewpoint": 73, "give": [73, 76], "gracefulli": 73, "feedback": [73, 74], "apolog": 73, "mistak": 73, "learn": 73, "focus": 73, "unaccept": 73, "imageri": 73, "attent": 73, "troll": 73, "insult": 73, "derogatori": 73, "polit": 73, "attack": 73, "privat": [73, 76], "physic": 73, "email": 73, "address": [73, 76], "explicit": 73, "permiss": 73, "inappropri": 73, "fair": 73, "action": 73, "deem": 73, "threaten": 73, "offens": 73, "harm": 73, "edit": 73, "reject": 73, "commit": [73, 74, 76], "wiki": 73, "align": 73, "decis": 73, "mail": 73, "post": 73, "via": 73, "social": 73, "media": 73, "appoint": 73, "onlin": 73, "offlin": 73, "event": 73, "abus": 73, "complaint": 73, "review": [73, 74, 75], "investig": 73, "promptli": [73, 76], "fairli": 73, "oblig": 73, "privaci": 73, "incid": 73, "consequ": 73, "unprofession": 73, "unwelcom": 73, "clariti": 73, "natur": 73, "explan": [73, 74], "unsolicit": 73, "period": 73, "channel": 73, "seriou": 73, "sustain": 73, "aggress": 73, "disparag": 73, "avail": 73, "www": 73, "org": 73, "code_of_conduct": 73, "inspir": 73, "mozilla": 73, "ladder": 73, "question": [73, 76], "faq": 73, "translat": 73, "blind": [74, 76], "75": [74, 76], "valuabl": 74, "moment": 74, "below": 74, "submit": 74, "analysi": 74, "editor": 74, "id": 74, "fork": 74, "button": 74, "usernam": 74, "checkout": 74, "test": 74, "style": 74, "meaning": 74, "collabor": 74, "approv": 74, "contributor": [74, 75], "agre": [74, 75], "appreci": 74, "serious": [75, 76], "our": [75, 76], "vulner": 75, "believ": 76, "Not": 76, "disclos": 76, "publicli": 76, "team": 76, "titl": 76, "sampl": 76, "clear": 76, "reproduc": 76, "configur": 76, "screenshot": 76, "sensit": 76, "encrypt": 76, "pgp": 76, "acknowledg": 76, "busi": 76, "estim": 76, "timelin": 76, "resolut": 76, "disclosur": 76, "resolv": 76, "advisori": 76, "credit": 76, "encourag": 76, "exploit": 76, "malici": 76, "recommend": 76, "stai": 76, "latest": 76, "assist": 76, "regard": 76, "gmail": 76}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"100": [0, 30], "same": [0, 30], "tree": [0, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 55, 75], "test": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "case": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "time": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "space": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "complex": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "analysi": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "128": 1, "longest": [1, 14, 15], "consecut": 1, "sequenc": 1, "solut": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 75], "explan": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "challeng": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 26, 27, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "exercis": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 26, 27, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "217": 2, "contain": [2, 9], "duplic": 2, "238": 3, "product": 3, "arrai": [3, 8, 20, 21, 75], "except": 3, "self": 3, "242": 4, "valid": [4, 10, 18, 41, 55], "anagram": [4, 6], "347": 5, "top": 5, "k": [5, 28], "frequent": 5, "element": [5, 37, 49], "49": 6, "group": 6, "659": 7, "encod": 7, "decod": 7, "string": 7, "hash": [8, 75], "blind": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "75": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "leetcod": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "problem": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "contribut": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "resourc": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "11": 9, "With": 9, "most": 9, "water": [9, 59], "125": 10, "palindrom": 10, "15": 11, "3sum": 11, "two": [12, 27, 75], "pointer": [12, 75], "121": 13, "best": 13, "bui": 13, "sell": 13, "stock": 13, "3": [14, 73], "substr": [14, 16], "without": 14, "repeat": [14, 15], "charact": [14, 15], "424": 15, "replac": 15, "76": 16, "minimum": [16, 20], "window": [16, 17, 75], "slide": [17, 75], "20": 18, "parenthes": 18, "stack": [19, 75], "153": 20, "find": [20, 48], "rotat": [20, 21], "sort": [20, 21, 27, 28], "33": 21, "search": [21, 22, 38, 41, 44, 45, 52, 75], "binari": [22, 31, 32, 33, 34, 35, 36, 38, 39, 41, 75], "141": 23, "link": [23, 26, 29, 75], "list": [23, 24, 25, 26, 27, 28, 29, 67, 68, 69, 70, 71, 75], "cycl": 23, "143": 24, "reorder": 24, "19": 25, "remov": 25, "nth": 25, "node": 25, "from": [25, 33, 48], "end": 25, "206": 26, "revers": 26, "21": 27, "merg": [27, 28], "23": 28, "In": 30, "summari": 30, "102": 31, "level": 31, "order": 31, "travers": [31, 33], "104": 32, "maximum": [32, 34], "depth": 32, "105": 33, "construct": 33, "preorder": 33, "inord": 33, "helper": 33, "function": 33, "124": 34, "path": 34, "sum": [34, 51], "probelm": [34, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "199": 35, "right": 35, "side": 35, "view": 35, "226": 36, "invert": 36, "230": 37, "kth": [37, 49], "smallest": 37, "bst": 37, "235": 38, "lowest": 38, "common": 38, "ancestor": 38, "297": 39, "serial": 39, "deseri": 39, "572": 40, "subtre": 40, "anoth": 40, "here": 40, "s": 40, "detail": 40, "code": [40, 73, 74, 75], "98": 41, "208": 43, "implement": 43, "trie": [43, 46], "prefix": 43, "211": 44, "design": 44, "add": 44, "word": [44, 45, 52], "data": [44, 48], "structur": 44, "212": 45, "ii": [45, 64], "1046": 47, "last": 47, "stone": 47, "weight": 47, "295": 48, "median": 48, "stream": [48, 49], "703": 49, "largest": 49, "heap": [50, 75], "prioriti": [50, 75], "queue": [50, 75], "39": 51, "combin": 51, "79": 52, "backtrack": [53, 75], "133": 54, "clone": 54, "graph": [54, 55, 58, 60, 62, 75], "178": 55, "200": 56, "number": [56, 58], "island": 56, "207": 57, "cours": 57, "schedul": 57, "3651": 58, "connect": 58, "compon": 58, "an": 58, "undirect": 58, "417": 59, "pacif": 59, "atlant": 59, "flow": 59, "892": 61, "alien": 61, "dictionari": 61, "advanc": [62, 75], "hous": [63, 64], "robber": [63, 64], "70": 65, "climb": 65, "stair": 65, "1": [66, 73, 75], "d": [66, 67, 75], "dynam": [66, 67, 75], "program": [66, 67, 75], "2": [67, 73, 75], "how": [67, 68, 69, 70, 71, 75], "us": [67, 68, 69, 70, 71, 75], "disclaim": [67, 68, 69, 70, 71, 75], "greedi": [68, 75], "interv": [69, 75], "math": [70, 75], "geometri": [70, 75], "bit": [71, 75], "manupul": 71, "contributor": 73, "coven": 73, "conduct": [73, 74, 75], "our": 73, "pledg": 73, "standard": 73, "enforc": 73, "respons": 73, "scope": 73, "guidelin": [73, 74], "correct": 73, "warn": 73, "temporari": 73, "ban": 73, "4": 73, "perman": 73, "attribut": 73, "tabl": 74, "content": 74, "wai": 74, "get": 74, "start": 74, "process": 74, "tri": 75, "manipul": 75, "secur": [75, 76], "polici": [75, 76], "report": 76, "vulner": 76, "updat": 76, "contact": 76}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.intersphinx": 1, "sphinx": 56}})
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb b/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb
deleted file mode 100644
index 5d55ca7..0000000
--- a/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 100: Same Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-    "\n",
-    "---\n",
-    "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-    "\n",
-    "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-    "\n",
-    "**Constraints**\n",
-    "\n",
-    "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-    "2. $-10^4$ <= `Node.val` <= $10^4$"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def isSameTree(p, q):\n",
-    "    # Base case: If both p and q are None, the trees are the same.\n",
-    "    if not p and not q:\n",
-    "        return True\n",
-    "    \n",
-    "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-    "    if not p or not q:\n",
-    "        return False\n",
-    "    \n",
-    "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-    "    if p.val != q.val:\n",
-    "        return False\n",
-    "    \n",
-    "    # Recursively check the left and right subtrees of p and q.\n",
-    "    # If both subtrees are the same, the entire trees are the same.\n",
-    "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-    "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-    "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-    "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-    "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-    "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "\n",
-    "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-    "\n",
-    "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "print(isSameTree(p1, q1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "\n",
-    "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-    "\n",
-    "p2 = TreeNode(1, TreeNode(2), None)\n",
-    "q2 = TreeNode(1, None, TreeNode(2))\n",
-    "print(isSameTree(p2, q2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "\n",
-    "#Input: p = [1,2,1], q = [1,1,2]\n",
-    "\n",
-    "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-    "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-    "print(isSameTree(p3, q3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "**Time Complexity**\n",
-    "\n",
-    "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-    "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-    "\n",
-    "**Space Complexity**\n",
-    "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-    "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-    "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-    "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "+ Time Complexity: $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-    "+ Space Complexity: $O(n)$ due to the recursive call stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
deleted file mode 100644
index 9256d0e..0000000
--- a/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 128. Longest Consecutive Sequence\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Consecutive Sequence problem on LeetCode, click here!](https://leetcode.com/problems/longest-consecutive-sequence/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an unsorted array of integers `nums`, return *the length of the longest consecutive elements sequence.*\n",
-    "\n",
-    "You must write an algorithm that runs in `O(n)` time.\n",
-    "\n",
-    "*Constraints:**\n",
-    "- 0 <= `nums.length` <= $10^5$\n",
-    "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def longestConsecutive(nums):\n",
-    "    if not nums:\n",
-    "        return 0\n",
-    "\n",
-    "    num_set = set(nums)\n",
-    "    max_length = 0\n",
-    "\n",
-    "    for num in num_set:\n",
-    "        if num - 1 not in num_set:\n",
-    "            current_num = num\n",
-    "            current_length = 1\n",
-    "\n",
-    "            while current_num + 1 in num_set:\n",
-    "                current_num += 1\n",
-    "                current_length += 1\n",
-    "\n",
-    "            max_length = max(max_length, current_length)\n",
-    "\n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining the `longestConsecutive` function that takes the `nums` array as input.\n",
-    "\n",
-    "2. We check if the `nums` array is empty. If it's empty, there are no consecutive elements, so we return 0.\n",
-    "\n",
-    "3. We create a Python set called `num_set` and insert all elements from the `nums` array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.\n",
-    "\n",
-    "4. We initialize a variable `max_length` to 0. This variable will keep track of the maximum length of consecutive elements sequence found.\n",
-    "\n",
-    "5. We iterate through the elements of the `num_set`. For each element `num`, we check if `num - 1` exists in the `num_set`. If it doesn't exist, it means `num` is the starting element of a potential consecutive sequence.\n",
-    "\n",
-    "6. Inside the loop, we initialize two variables: `current_num` to the current element `num` and `current_length` to 1. We start with a length of 1 because `num` itself is part of the sequence.\n",
-    "\n",
-    "7. We then enter a while loop that continues as long as `current_num + 1` exists in the `num_set`. This means we are incrementing the consecutive sequence.\n",
-    "\n",
-    "8. Inside the while loop, we increment `current_num` by 1 and also increment `current_length` by 1 to account for the next consecutive element.\n",
-    "\n",
-    "9. We compare `current_length` with the `max_length` and update `max_length` if the current sequence is longer.\n",
-    "\n",
-    "10. After the while loop, we move to the next element in the outer loop and repeat the process.\n",
-    "\n",
-    "11. Finally, we return the `max_length` as the result, which represents the length of the longest consecutive elements sequence in the `nums` array.\n",
-    "\n",
-    "The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "nums1 = [100, 4, 200, 1, 3, 2]\n",
-    "print(longestConsecutive(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "9\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "nums2 = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]\n",
-    "print(longestConsecutive(nums2)) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The code is designed to run in O(n) time complexity, where n is the number of elements in the `nums` array. Here's the breakdown:\n",
-    "\n",
-    "1. Constructing the `num_set` by inserting all elements from `nums` into it takes O(n) time because we perform an insertion operation for each element in `nums`.\n",
-    "\n",
-    "2. The main loop iterates through the elements in `num_set`. In the worst case, each element is visited only once, so the loop itself takes O(n) time.\n",
-    "\n",
-    "3. Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).\n",
-    "\n",
-    "Therefore, the overall time complexity of the code is O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of the code is determined by the space used by the `num_set` and a few additional variables. Here's the breakdown:\n",
-    "\n",
-    "1. `num_set` is a set that stores the unique elements from `nums`. In the worst case, it can store all n elements from `nums`, so the space complexity is O(n).\n",
-    "\n",
-    "2. The additional variables used, such as `max_length`, `current_num`, and `current_length`, have constant space requirements and do not depend on the size of the input array.\n",
-    "\n",
-    "Therefore, the overall space complexity of the code is O(n) due to the space used by the `num_set`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.\n",
-    "\n",
-    "2. Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb b/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb
deleted file mode 100644
index f7dbbe9..0000000
--- a/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 217. Contains Duplicate\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Contains Duplicate problem on LeetCode, click here!](https://leetcode.com/problems/contains-duplicate/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `nums.length` <= $10^5$\n",
-    "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def containsDuplicate(nums):\n",
-    "    # Create an empty set to store unique elements\n",
-    "    unique_elements = set()\n",
-    "    \n",
-    "    # Iterate through the array\n",
-    "    for num in nums:\n",
-    "        # If the element is already in the set, return True\n",
-    "        if num in unique_elements:\n",
-    "            return True\n",
-    "        # Otherwise, add it to the set\n",
-    "        else:\n",
-    "            unique_elements.add(num)\n",
-    "    \n",
-    "    # If the loop completes without finding duplicates, return False\n",
-    "    return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `containsDuplicate` function takes a single argument, `nums`, which is the input integer array.\n",
-    "\n",
-    "2. Inside the function, an empty set called `unique_elements` is created. This set will be used to keep track of unique elements in the input array.\n",
-    "\n",
-    "3. The function then iterates through the input array `nums` using a `for` loop.\n",
-    "\n",
-    "4. For each element `num` in the array, it checks whether `num` is already in the `unique_elements` set using the `if num in unique_elements:` condition.\n",
-    "\n",
-    "5. If `num` is already in the set, it means there is a duplicate element in the array, and the function immediately returns `True`.\n",
-    "\n",
-    "6. If `num` is not in the set, it is added to the `unique_elements` set using `unique_elements.add(num)`.\n",
-    "\n",
-    "7. The loop continues to the next element, and the process repeats.\n",
-    "\n",
-    "8. If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns `False`.\n",
-    "\n",
-    "The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem's requirements and constraints, as explained earlier."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "nums1 = [1, 2, 3, 1]\n",
-    "print(containsDuplicate(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "nums2 = [1, 2, 3, 4]\n",
-    "print(containsDuplicate(nums2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "nums3 = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2]\n",
-    "print(containsDuplicate(nums3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for the \"Contains Duplicate\" problem:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The primary operation that affects the time complexity is the `for` loop that iterates through the input array `nums`. In the worst case, the loop will iterate through all `n` elements of the array, where `n` is the length of the input array.\n",
-    "\n",
-    "- Iterating through the array: O(n)\n",
-    "\n",
-    "Inside the loop, we perform two operations:\n",
-    "\n",
-    "1. Checking whether an element exists in the `unique_elements` set (`if num in unique_elements`). This operation has an average time complexity of O(1) for a set.\n",
-    "2. Adding an element to the `unique_elements` set (`unique_elements.add(num)`), which also has an average time complexity of O(1) for a set.\n",
-    "\n",
-    "Since these operations are performed for each element in the array, the overall time complexity remains O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity is determined by the additional data structures used in the code, which are the `unique_elements` set.\n",
-    "\n",
-    "- `unique_elements` set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all `n` elements.\n",
-    "\n",
-    "Therefore, the space complexity is O(n) because, in the worst case, the set's size will grow linearly with the input array's size.\n",
-    "\n",
-    "**In summary**, the time complexity of the code is O(n), where `n` is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K Duplicates:** Modify the problem to return `true` if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns `true` if there are exactly K duplicates.\n",
-    "2. **Frequency Count:** Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb b/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb
deleted file mode 100644
index c5a69c0..0000000
--- a/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb	
+++ /dev/null
@@ -1,191 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 238. Product of Array Except Self\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Product of Array Except Self problem on LeetCode, click here!](https://leetcode.com/problems/product-of-array-except-self/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array `nums`, return *an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.*\n",
-    "\n",
-    "The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-    "\n",
-    "You must write an algorithm that runs in O(n) time and without using the division operation.\n",
-    "\n",
-    "Constraints:\n",
-    "- 2 <= `nums.length` <= $10^5$\n",
-    "- `-30 <= nums[i] <= 30`\n",
-    "- The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-    "\n",
-    "**Follow-up:** Can you solve the problem in O(1) extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def productExceptSelf(nums):\n",
-    "    n = len(nums)\n",
-    "    \n",
-    "    # Initialize two arrays to store products to the left and right of each element\n",
-    "    left_products = [1] * n\n",
-    "    right_products = [1] * n\n",
-    "    \n",
-    "    # Calculate products to the left of each element\n",
-    "    left_product = 1\n",
-    "    for i in range(n):\n",
-    "        left_products[i] = left_product\n",
-    "        left_product *= nums[i]\n",
-    "    \n",
-    "    # Calculate products to the right of each element\n",
-    "    right_product = 1\n",
-    "    for i in range(n - 1, -1, -1):\n",
-    "        right_products[i] = right_product\n",
-    "        right_product *= nums[i]\n",
-    "    \n",
-    "    # Calculate the final answer using left and right products\n",
-    "    answer = [left_products[i] * right_products[i] for i in range(n)]\n",
-    "    \n",
-    "    return answer"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `n` is initialized as the length of the `nums` array.\n",
-    "2. Two arrays, `left_products` and `right_products`, are created, each with a length of `n` and filled with ones initially.\n",
-    "3. `left_product` is initialized to 1.\n",
-    "4. A loop iterates through the `nums` array, from left to right. For each element at index `i`, it stores the product of all elements to its left (including itself) in the `left_products` array and updates `left_product` accordingly.\n",
-    "5. `right_product` is initialized to 1.\n",
-    "6. Another loop iterates through the `nums` array in reverse order, from right to left. For each element at index `i`, it stores the product of all elements to its right (including itself) in the `right_products` array and updates `right_product`.\n",
-    "7. The final `answer` list is constructed by multiplying corresponding elements from the `left_products` and `right_products` arrays for each index `i`.\n",
-    "8. The function returns the `answer` list, which contains the desired results.\n",
-    "\n",
-    "Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem's constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[24, 12, 8, 6]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "nums = [1,2,3,4]\n",
-    "result1 = productExceptSelf(nums)\n",
-    "print(result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[0, 0, 9, 0, 0]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums = [-1,1,0,-3,3]\n",
-    "result2 = productExceptSelf(nums)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The first loop iterates through the `nums` array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the `nums` array.\n",
-    "2. The second loop also iterates through the `nums` array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.\n",
-    "3. The final loop constructs the `answer` list by multiplying elements from the `left_products` and `right_products` arrays. This loop runs in O(n) time.\n",
-    "\n",
-    "Since all the loops are independent and sequential, the overall time complexity is O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. Two additional arrays, `left_products` and `right_products`, are created with a length of `n`, where `n` is the length of the `nums` array. Therefore, these arrays consume O(n) extra space.\n",
-    "2. The `left_product` and `right_product` variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.\n",
-    "3. The `answer` list, which contains the final results, also consumes O(n) space, but it's not counted toward the extra space complexity analysis as per the problem's constraints.\n",
-    "\n",
-    "Overall, the space complexity is O(n) for this solution."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Handle Zeros in the Input**: Modify the solution to handle cases where the input array contains zeros. For example, if `nums = [0, 1, 2, 3, 0]`, the output should be `[0, 0, 0, 0, 0]` because any element multiplied by zero results in zero.\n",
-    "\n",
-    "2. **In-Place Modification**: Attempt to solve the problem with in-place modification of the `nums` array, where the output is stored directly in the input array without using any additional space."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb b/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb
deleted file mode 100644
index 5649123..0000000
--- a/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb	
+++ /dev/null
@@ -1,192 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 242. Valid Anagram\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Anagram problem on LeetCode, click here!](https://leetcode.com/problems/valid-anagram/)\n",
-    "\n",
-    "---\n",
-    "Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.\n",
-    "\n",
-    "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `s.length`, `t.length` <= $5 * 10^4$\n",
-    "- `s` and `t` consist of lowercase English letters.\n",
-    "\n",
-    "**Follow-up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isAnagram(s: str, t: str) -> bool:\n",
-    "    # Check if the lengths of s and t are not equal\n",
-    "    if len(s) != len(t):\n",
-    "        return False\n",
-    "\n",
-    "    # Create dictionaries to store character frequencies for s and t\n",
-    "    countS, countT = {}, {}\n",
-    "\n",
-    "    # Count character frequencies in s\n",
-    "    for i in range(len(s)):\n",
-    "        countS[s[i]] = 1 + countS.get(s[i], 0)\n",
-    "\n",
-    "    # Count character frequencies in t\n",
-    "    for i in range(len(t)):\n",
-    "        countT[t[i]] = 1 + countT.get(t[i], 0)\n",
-    "\n",
-    "    # Check if the character frequencies in s and t are the same\n",
-    "    return countS == countT"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The code defines a class called `Solution` with a method `isAnagram` that takes two input strings, `s` and `t`, and returns a boolean (`True` or `False`) based on whether `t` is an anagram of `s`.\n",
-    "\n",
-    "2. The first check performed in the method is whether the lengths of `s` and `t` are equal. If they are not equal, it immediately returns `False` because strings of different lengths cannot be anagrams of each other.\n",
-    "\n",
-    "3. Two dictionaries, `countS` and `countT`, are created to store the frequency of characters in `s` and `t`, respectively. These dictionaries will be used to count the occurrences of each character in the strings.\n",
-    "\n",
-    "4. The code then enters a loop to iterate through each character in string `s` using a `for` loop. Inside the loop, it updates the `countS` dictionary. The line `countS[s[i]] = 1 + countS.get(s[i], 0)` increments the count of character `s[i]` in `countS` by 1. If the character is not already in the dictionary, it initializes the count to 1.\n",
-    "\n",
-    "5. Similarly, the code iterates through each character in string `t` and updates the `countT` dictionary in the same way.\n",
-    "\n",
-    "6. After counting the character frequencies in both strings, the code compares the two dictionaries using `countS == countT`. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, `t` is an anagram of `s`. In this case, the method returns `True`.\n",
-    "\n",
-    "7. If the dictionaries are not equal, the method returns `False`, indicating that `t` is not an anagram of `s`.\n",
-    "\n",
-    "In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns `True`; otherwise, it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "s = \"anagram\"\n",
-    "t = \"nagaram\"\n",
-    "print(isAnagram(s, t))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "s = \"rat\"\n",
-    "t = \"car\"\n",
-    "print(isAnagram(s, t))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. The code first checks whether the lengths of the input strings `s` and `t` are equal, which takes constant time. This check has a time complexity of O(1).\n",
-    "\n",
-    "2. The code then iterates through both strings, `s` and `t`, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (`s` or `t`).\n",
-    "\n",
-    "3. Finally, the code compares the two dictionaries `countS` and `countT` to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.\n",
-    "\n",
-    "Overall, the time complexity of the code is O(n), where n is the length of the longer input string.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The code uses two dictionaries, `countS` and `countT`, to store the character frequencies of the input strings `s` and `t`. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.\n",
-    "\n",
-    "2. The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.\n",
-    "\n",
-    "**In summary**, the space complexity of the code is O(n), where n is the length of the longer input string."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Anagram Chains**: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [\"bat\", \"tab\", \"cat\", \"tac\", \"dog\"], the longest anagram chain is [\"bat\", \"tab\", \"cat\", \"tac\"].\n",
-    "\n",
-    "2. **Minimum Deletions to Make Anagrams**: Given two strings `s` and `t`, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if `s = \"hello\"` and `t = \"billion\"`, you can remove the characters \"heo\" from `s` and \"billi\" from `t` to make them anagrams (\"lo\" and \"on\" are left in the two strings)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb b/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb
deleted file mode 100644
index 1b11faf..0000000
--- a/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 347. Top K Frequent Elements\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Top K Frequent Elements problem on LeetCode, click here!](https://leetcode.com/problems/top-k-frequent-elements/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.\n",
-    "\n",
-    "Constraints:\n",
-    "- 1 <= `nums.length` <= $10^5$\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- `k` is in the range `[1, the number of unique elements in the array]`.\n",
-    "- It is **guaranteed** that the answer is **unique**.\n",
-    "\n",
-    "**Follow-up:** Your algorithm's time complexity must be better than $O(n\\ log\\ n)$, where n is the array's size.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def topKFrequent(nums, k):\n",
-    "    # Create a dictionary to store the frequency of each element\n",
-    "    count = {}\n",
-    "    # Create a list of lists to store elements with the same frequency\n",
-    "    frequency = [[] for i in range(len(nums) + 1)]\n",
-    "\n",
-    "    # Count the frequency of each element in nums\n",
-    "    for n in nums:\n",
-    "        count[n] = 1 + count.get(n, 0)\n",
-    "\n",
-    "    # Place elements in the freq list according to their frequency\n",
-    "    for n, c in count.items():\n",
-    "        frequency[c].append(n)\n",
-    "\n",
-    "    res = []\n",
-    "    # Traverse freq list from the end (higher frequencies)\n",
-    "    for i in range(len(frequency) - 1, 0, -1):\n",
-    "        for n in frequency[i]:\n",
-    "            res.append(n)\n",
-    "            if len(res) == k:\n",
-    "                return res"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `def topKFrequent(nums, k):`: This is a function that takes two arguments: `nums`, which is the input array of integers, and `k`, which is the number of most frequent elements to return.\n",
-    "\n",
-    "2. `count = {}`: This dictionary `count` will be used to store the frequency of each unique element in the `nums` array. The keys are elements from the input array, and the values are their corresponding frequencies.\n",
-    "\n",
-    "3. `frequency = [[] for i in range(len(nums) + 1)]`: This creates a list of empty lists called `frequency`. It's used to store elements based on their frequencies, similar to the `freq` list in the previous code. The size of this list is set to be one greater than the length of the input `nums`.\n",
-    "\n",
-    "4. `for n in nums:`: This loop iterates through each element `n` in the input `nums` array.\n",
-    "\n",
-    "5. `count[n] = 1 + count.get(n, 0)`: This line counts the frequency of each element `n` in the `nums` array. It uses the `count.get(n, 0)` method to retrieve the current count of `n` from the `count` dictionary. If `n` is not in the dictionary, it defaults to 0. It then increments the count by 1.\n",
-    "\n",
-    "6. After the above loop, the `count` dictionary will contain counts of each unique element in the `nums` array.\n",
-    "\n",
-    "7. `for n, c in count.items():`: This loop iterates through the items (key-value pairs) of the `count` dictionary. `n` represents the element, and `c` represents its frequency.\n",
-    "\n",
-    "8. `frequency[c].append(n)`: This line places the element `n` into the bucket corresponding to its frequency `c`. Buckets are represented by the `frequency` list. For example, if an element `n` has a frequency of 3, it will be added to `frequency[3]`.\n",
-    "\n",
-    "9. After this loop, the `frequency` list will contain buckets of elements grouped by their frequencies.\n",
-    "\n",
-    "10. `res = []`: This list `res` will be used to store the k most frequent elements.\n",
-    "\n",
-    "11. `for i in range(len(freq) - 1, 0, -1):`: This loop iterates in reverse order through the `frequency` list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be `frequency` instead of `freq`.\n",
-    "\n",
-    "12. `for n in frequency[i]:`: For each element `n` in the current bucket (i.e., elements with frequency `i`), it appends `n` to the result list `res`.\n",
-    "\n",
-    "13. `if len(res) == k:`: Once `res` contains k elements, the code exits and returns the result.\n",
-    "\n",
-    "The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., `frequency` instead of `freq`)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 2]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "nums = [1,1,1,2,2,3]\n",
-    "k = 2\n",
-    "result1 = topKFrequent(nums, k)\n",
-    "print(result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums = [1]\n",
-    "k = 1\n",
-    "result2 = topKFrequent(nums, k)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The first loop that counts the frequency of elements by iterating through `nums` has a time complexity of O(n), where n is the number of elements in the input array `nums`.\n",
-    "\n",
-    "2. The second loop iterates through the keys in the `count` dictionary, which has at most `k` unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).\n",
-    "\n",
-    "3. The third loop iterates through the `frequency` list, which has a length equal to the maximum frequency of elements in `nums`. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in `nums`.\n",
-    "\n",
-    "Overall, the dominant factor in terms of time complexity is the loop that iterates through the `count` dictionary. So, the total time complexity of the code is O(n + k).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The `count` dictionary stores the frequency of each unique element in `nums`. In the worst case, it can have at most `k` unique elements, so the space complexity for `count` is O(k).\n",
-    "\n",
-    "2. The `frequency` list is used to store elements grouped by their frequencies. It has a length of `len(nums) + 1`, which can be at most 105 based on the constraints. Therefore, the space complexity for `frequency` is O(105).\n",
-    "\n",
-    "3. The `res` list stores the k most frequent elements, which can be at most `k` elements, so the space complexity for `res` is O(k).\n",
-    "\n",
-    "**In summary**, the space complexity is dominated by the `count` dictionary and the `frequency` list, both of which have a space complexity of O(k + 105)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimized k Most Frequent Elements:** Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.\n",
-    "\n",
-    "2. **Handling Duplicate Frequencies:** Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb b/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb
deleted file mode 100644
index 256e8f7..0000000
--- a/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 49. Group Anagrams\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Group Anagrams problem on LeetCode, click here!](https://leetcode.com/problems/group-anagrams/)\n",
-    "\n",
-    "---\n",
-    "Given an array of strings `strs`, group **the anagrams** together. You can return the answer in **any order**.\n",
-    "\n",
-    "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `strs.length <= $10^4$\n",
-    "- `0 <= strs[i].length <= 100`\n",
-    "- `strs[i]` consists of lowercase English letters.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict\n",
-    "\n",
-    "\n",
-    "def groupAnagrams(strs):\n",
-    "    ans = defaultdict(list)\n",
-    "\n",
-    "    # Iterate through the list of input strings\n",
-    "    for s in strs:\n",
-    "        # Initialize a list to represent character counts for each character (a-z)\n",
-    "        count = [0] * 26\n",
-    "\n",
-    "        # Count the occurrences of each character in the current word\n",
-    "        for c in s:\n",
-    "            count[ord(c) - ord(\"a\")] += 1\n",
-    "\n",
-    "        # Use a tuple of character counts as the key and append the word to the anagram group\n",
-    "        ans[tuple(count)].append(s)\n",
-    "\n",
-    "    # Convert the values (lists of anagrams) to a list of lists\n",
-    "    return list(ans.values())"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. Inside the method, a `defaultdict` called `ans` is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.\n",
-    "\n",
-    "2. The code then iterates through the list of input strings, `strs`, using a `for` loop. For each word `s` in `strs`, it performs the following steps:\n",
-    "\n",
-    "   - It initializes a list `count` of length 26, where each element represents the count of a specific character (a-z) in the word `s`.\n",
-    "\n",
-    "   - The code then iterates through the characters of `s`. For each character `c`, it increments the corresponding count in the `count` list based on its ASCII value.\n",
-    "\n",
-    "   - After counting the characters in `s`, it converts the `count` list into a tuple `tuple(count)` to use as a key for the `ans` dictionary.\n",
-    "\n",
-    "   - It appends the word `s` to the list associated with the key (tuple) in the `ans` dictionary. This groups all anagrams of the same word together under the same key.\n",
-    "\n",
-    "3. After processing all words in `strs`, the code converts the values of the `ans` dictionary (which are lists of anagrams) to a list of lists using the `list()` constructor.\n",
-    "\n",
-    "4. Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.\n",
-    "\n",
-    "In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['eat', 'tea', 'ate'], ['tan', 'nat'], ['bat']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: Group anagrams from a list of words\n",
-    "strs1 = [\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]\n",
-    "result1 = groupAnagrams(strs1)\n",
-    "print(result1)\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: Group anagrams from a list with an empty string\n",
-    "strs2 = [\"\"]\n",
-    "result2 = groupAnagrams(strs2)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "c8367e2a-e7d5-4e18-8235-2870e341a04b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['a']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3: Group anagrams from a list with a single word\n",
-    "strs3 = [\"a\"]\n",
-    "result3 = groupAnagrams(strs3)\n",
-    "print(result3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `groupAnagrams` method:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. First, we create an instance of the `Solution` class, which is an O(1) operation.\n",
-    "\n",
-    "2. Inside the `groupAnagrams` method, we iterate through the list of input strings `strs` once in a loop:\n",
-    "   - For each word in `strs`, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.\n",
-    "\n",
-    "3. The overall time complexity of the method is O(N * K), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. We use a `defaultdict` called `ans` to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for `ans` is O(N).\n",
-    "\n",
-    "2. Within the loop, we create a `count` list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).\n",
-    "\n",
-    "3. The space used for other variables is also constant and does not depend on the input size.\n",
-    "\n",
-    "4. The final result, `result`, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for `result` is O(N).\n",
-    "\n",
-    "5. The overall space complexity of the method is O(N) due to the space used by `ans` and `result`. The space used by the `count` list and other variables is constant and does not significantly affect the overall space complexity.\n",
-    "\n",
-    "**In summary,** the time complexity of the `groupAnagrams` method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Anagramic Palindromes**: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [\"bat\", \"tab\", \"act\", \"tac\", \"dog\"], there are two groups: [\"bat\", \"tab\", \"act\", \"tac\"] and [\"dog\"].\n",
-    "\n",
-    "2. **Largest Anagram Group**: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb b/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb
deleted file mode 100644
index 2fae2a5..0000000
--- a/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb	
+++ /dev/null
@@ -1,198 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 659· Encode and Decode Strings\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Encode and Decode Strings problem on LintCode, click here!](https://www.lintcode.com/problem/659/)\n",
-    "\n",
-    "---\n",
-    "Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.\n",
-    "\n",
-    "Please implement `encode` and `decode`.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class Codec:\n",
-    "\n",
-    "    def encode(self, strs):\n",
-    "        \"\"\"Encodes a list of strings to a single string.\n",
-    "        \n",
-    "        :type strs: List[str]\n",
-    "        :rtype: str\n",
-    "        \"\"\"\n",
-    "        encoded = \"\"\n",
-    "        for s in strs:\n",
-    "            encoded += s.replace(':', '::') + ':;'\n",
-    "        return encoded\n",
-    "\n",
-    "    def decode(self, s):\n",
-    "        \"\"\"Decodes a single string to a list of strings.\n",
-    "        \n",
-    "        :type s: str\n",
-    "        :rtype: List[str]\n",
-    "        \"\"\"\n",
-    "        decoded = []\n",
-    "        i = 0\n",
-    "        while i < len(s):\n",
-    "            end = s.find(':;', i)\n",
-    "            if end == -1:\n",
-    "                end = len(s)\n",
-    "            decoded.append(s[i:end].replace('::', ':'))\n",
-    "            i = end + 2\n",
-    "        return decoded"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a class called `Codec` to encapsulate the encoding and decoding operations for a list of strings.\n",
-    "\n",
-    "2. In the `encode` method, we take a list of strings (`strs`) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter `:;`. We iterate through each string in the input list, replace any occurrence of `:` with `::` (to avoid conflicts with the delimiter), and then append `:;` to indicate the end of that string.\n",
-    "\n",
-    "3. In the `decode` method, we take an encoded string (`s`) as input and return a list of strings. The decoding process involves splitting the encoded string using the `:;` delimiter. We start from the beginning of the encoded string (`i = 0`) and repeatedly find the next occurrence of `:;`. We extract the substring between the current position (`i`) and the next delimiter (`end`). Before adding it to the result list, we replace any `::` with `:` to revert the encoding. We then update the current position `i` to be after the delimiter, so we can find the next substring in the next iteration.\n",
-    "\n",
-    "4. Finally, we create an instance of the `Codec` class and test it with two examples:\n",
-    "\n",
-    "By using the `:;` delimiter and handling the `::` escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['lint', 'code', 'love', 'you']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "codec = Codec()\n",
-    "\n",
-    "input1 = [\"lint\", \"code\", \"love\", \"you\"]\n",
-    "encoded1 = codec.encode(input1)\n",
-    "decoded1 = codec.decode(encoded1)\n",
-    "print(decoded1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['we', 'say', ':', 'yes']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "codec = Codec() \n",
-    "\n",
-    "input2 = [\"we\", \"say\", \":\", \"yes\"]\n",
-    "encoded2 = codec.encode(input2)\n",
-    "decoded2 = codec.decode(encoded2)\n",
-    "print(decoded2)  "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `encode` and `decode` methods in the provided code.\n",
-    "\n",
-    "**Encode Method (`encode`):**\n",
-    "\n",
-    "- Time Complexity: O(n * m)\n",
-    "  - Here, `n` is the number of strings in the input list `strs`, and `m` is the average length of these strings.\n",
-    "  - In the worst case, for each string in the list, we iterate over its characters once to replace any colons (`:`) with double colons (`::`) and then append `:;`. This is done for each string in the list.\n",
-    "\n",
-    "- Space Complexity: O(n * m)\n",
-    "  - The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.\n",
-    "\n",
-    "**Decode Method (`decode`):**\n",
-    "\n",
-    "- Time Complexity: O(n * m)\n",
-    "  - Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the `:;` delimiter.\n",
-    "\n",
-    "- Space Complexity: O(n * m)\n",
-    "  - The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.\n",
-    "\n",
-    "Overall, both the `encode` and `decode` methods have time and space complexities of O(n * m), where `n` is the number of strings in the input list, and `m` is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Delimiters**: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.\n",
-    "\n",
-    "2. **Optimize Encoding**: Modify the `encode` method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb b/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb
deleted file mode 100644
index e330eb0..0000000
--- a/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 11. Container With Most Water\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Container With Most Water problem on LeetCode, click here!](https://leetcode.com/problems/container-with-most-water/)\n",
-    "\n",
-    "---\n",
-    "You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the $i^{th}$ line are `(i, 0)` and `(i, height[i])`.\n",
-    "\n",
-    "Find two lines that together with the x-axis form a container, such that the container contains the most water.\n",
-    "\n",
-    "Return *the maximum amount of water a container can store.*\n",
-    "\n",
-    "**Notice** that you may not slant the container.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `n == height.length`\n",
-    "- 2 <= `n` <= $10^5$\n",
-    "- 0 <= `height[i]` <= $10^4$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def maxArea(height):\n",
-    "    # Initialize the maximum area to 0.\n",
-    "    max_area = 0\n",
-    "    # Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.\n",
-    "    left = 0\n",
-    "    right = len(height) - 1\n",
-    "\n",
-    "    # Iterate until the left pointer is less than the right pointer.\n",
-    "    while left < right:\n",
-    "        # Calculate the height of the container, which is the minimum height of the two lines.\n",
-    "        h = min(height[left], height[right])\n",
-    "        # Calculate the width of the container, which is the distance between the two pointers.\n",
-    "        width = right - left\n",
-    "        # Calculate the area of the container using height and width and update max_area if it's greater.\n",
-    "        max_area = max(max_area, h * width)\n",
-    "\n",
-    "        # Move the pointer with the shorter line inward.\n",
-    "        if height[left] < height[right]:\n",
-    "            left += 1\n",
-    "        else:\n",
-    "            right -= 1\n",
-    "\n",
-    "    # Continue this process until left < right, and then return the maximum area.\n",
-    "    return max_area"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start with initializing `max_area` to 0, which will store the maximum area of water that can be contained by the lines.\n",
-    "\n",
-    "2. Two pointers, `left` and `right`, are initialized to the beginning and end of the input `height` array.\n",
-    "\n",
-    "3. The main loop runs while `left` is less than `right`. This ensures that we are checking all possible pairs of lines in a systematic way.\n",
-    "\n",
-    "4. Inside the loop:\n",
-    "   - We calculate the height of the container `h` as the minimum of the heights at the `left` and `right` pointers. This represents the height of the water the container can hold.\n",
-    "   - We calculate the width of the container as the difference between `right` and `left`. This represents the distance between the two lines.\n",
-    "   - We calculate the area of the container using `h * width` and update `max_area` if the calculated area is greater than the current `max_area`.\n",
-    "\n",
-    "5. After calculating the area and updating `max_area`, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won't increase the height and will only decrease the width, which will result in a smaller area.\n",
-    "\n",
-    "6. We continue this process until `left` is no longer less than `right`, indicating that we have checked all possible pairs of lines.\n",
-    "\n",
-    "7. Finally, we return the `max_area` which contains the maximum area of water that can be contained by two lines from the input array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 49\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "height1 = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n",
-    "result1 = maxArea(height1)\n",
-    "print(\"Output:\", result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "height2 = [1, 1]\n",
-    "result2 = maxArea(height2)\n",
-    "print(\"Output:\", result2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 45\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Additional Example\n",
-    "height3 = [3, 9, 3, 4, 7, 2, 12, 6]\n",
-    "result3 = maxArea(height3)\n",
-    "print(\"Output:\", result3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `maxArea` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the `height` array.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The function uses a constant amount of extra space for variables like `max_area`, `left`, `right`, `h`, and `width`. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.\n",
-    "\n",
-    "**In summary,** the `maxArea` function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.\n",
-    "2. **Variant Problem:** Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You'll need to return the total water volume needed."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb b/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb
deleted file mode 100644
index 12c7daa..0000000
--- a/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 125. Valid Palindrome\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Palindrome problem on LeetCode, click here!](https://leetcode.com/problems/valid-palindrome/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "A phrase is a **palindrome** if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.\n",
-    "\n",
-    "Given a string `s`, *return `true` if it is a **palindrome**, or `false` otherwise.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $2*10^5$\n",
-    "- `s` consists only of printable ASCII characters.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isPalindrome(s):\n",
-    "    # Step 1: Convert the input string to lowercase\n",
-    "    s = s.lower()\n",
-    "    \n",
-    "    # Step 2: Remove all non-alphanumeric characters from the string\n",
-    "    cleaned_s = ''.join(c for c in s if c.isalnum())\n",
-    "    \n",
-    "    # Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string\n",
-    "    left, right = 0, len(cleaned_s) - 1\n",
-    "    \n",
-    "    # Step 4: Compare characters using the two pointers while moving them towards each other\n",
-    "    while left < right:\n",
-    "        if cleaned_s[left] != cleaned_s[right]:\n",
-    "            return False  # If characters don't match, it's not a palindrome\n",
-    "        left += 1\n",
-    "        right -= 1\n",
-    "    \n",
-    "    # Step 5: If the loop completes without returning False, it's a palindrome\n",
-    "    return True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `isPalindrome` function takes an input string `s`.\n",
-    "\n",
-    "2. It starts by converting the input string to lowercase using `s.lower()`. This step ensures that the function is case-insensitive when checking for palindromes.\n",
-    "\n",
-    "3. Next, it removes all non-alphanumeric characters from the string and stores the result in the `cleaned_s` variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.\n",
-    "\n",
-    "4. The function then initializes two pointers, `left` and `right`, which will be used to compare characters from the beginning and end of the cleaned string.\n",
-    "\n",
-    "5. In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the `left` pointer is less than the `right` pointer. This is done to check all characters in the cleaned string.\n",
-    "\n",
-    "6. Inside the loop, it checks if the characters at the `left` and `right` pointers don't match. If they don't match, it means the input is not a palindrome, so the function returns `False`.\n",
-    "\n",
-    "7. If the characters at the `left` and `right` pointers match, the pointers are moved closer to each other by incrementing `left` and decrementing `right`.\n",
-    "\n",
-    "8. The loop continues to compare characters until it either finds a mismatch (returning `False`) or until the `left` pointer is greater than or equal to the `right` pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns `True`.\n",
-    "\n",
-    "In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string's beginning and end. If all characters match during the comparison, the function returns `True`, indicating that the input is a palindrome. If any characters do not match, it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "input1 = \"A man, a plan, a canal: Panama\"\n",
-    "output1 = isPalindrome(input1)\n",
-    "print(output1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "input2 = \"race a car\"\n",
-    "output2 = isPalindrome(input2)\n",
-    "print(output2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "input3 = \"\"\n",
-    "output3 = isPalindrome(input3)\n",
-    "print(output3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `isPalindrome` function that uses two pointers:\n",
-    "\n",
-    "1. **Time Complexity:**\n",
-    "   - Converting the input string to lowercase using `s.lower()` takes O(n) time, where 'n' is the length of the input string.\n",
-    "   - Removing non-alphanumeric characters using the list comprehension `''.join(c for c in s if c.isalnum())` also takes O(n) time because it iterates through each character in the string once.\n",
-    "   - The comparison of characters using the two pointers (`left` and `right`) is done in a loop that runs until `left` is less than `right`. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).\n",
-    "\n",
-    "   Therefore, the overall time complexity of the `isPalindrome` function is O(n), where 'n' is the length of the input string.\n",
-    "\n",
-    "2. **Space Complexity:**\n",
-    "   - The space complexity is primarily determined by the additional string `cleaned_s` created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.\n",
-    "   - Additionally, the function uses two pointers, `left` and `right`, which consume constant space and do not depend on the size of the input.\n",
-    "\n",
-    "**In summary,** the overall space complexity of the `isPalindrome` function is O(n) in the worst case, where 'n' is the length of the input string. The space complexity is dominated by the space required for `cleaned_s`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Longest Palindromic Substring:** Given a string `s`, find and return the longest palindromic substring within `s`. For example, if `s = \"babad\"`, the function should return `\"bab\"` or `\"aba\"`.\n",
-    "2. **Palindrome with Limited Characters:** Given a string `s` and a list of characters `allowed_chars`, check if `s` is a palindrome considering only the characters from `allowed_chars`. Ignore all other characters. For example, if `s = \"A man, a plan, a canal: Panama\"` and `allowed_chars = ['a', 'm', 'n', 'p']`, the function should return `True`."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb b/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb
deleted file mode 100644
index 15d189a..0000000
--- a/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 15. 3Sum\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the 3Sum problem on LeetCode, click here!](https://leetcode.com/problems/3sum/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array nums, *return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.*\n",
-    "\n",
-    "**Notice** that the solution set must not contain duplicate triplets.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `3 <= nums.length <= 3000`\n",
-    "- $-10^5$ <= `nums[i]` <= $10^5$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def threeSum(nums):\n",
-    "    # Sort the input array in ascending order\n",
-    "    nums.sort()\n",
-    "    triplets = []\n",
-    "    \n",
-    "    for i in range(len(nums) - 2):\n",
-    "        # Skip duplicates to avoid duplicate triplets\n",
-    "        if i > 0 and nums[i] == nums[i - 1]:\n",
-    "            continue\n",
-    "        \n",
-    "        left, right = i + 1, len(nums) - 1\n",
-    "        \n",
-    "        while left < right:\n",
-    "            # Calculate the total sum of the current triplet\n",
-    "            total = nums[i] + nums[left] + nums[right]\n",
-    "            \n",
-    "            if total == 0:\n",
-    "                # If the total is zero, we found a valid triplet\n",
-    "                triplets.append([nums[i], nums[left], nums[right]])\n",
-    "                \n",
-    "                # Skip duplicates of left and right pointers\n",
-    "                while left < right and nums[left] == nums[left + 1]:\n",
-    "                    left += 1\n",
-    "                while left < right and nums[right] == nums[right - 1]:\n",
-    "                    right -= 1\n",
-    "                \n",
-    "                # Move the pointers to the next unique elements\n",
-    "                left += 1\n",
-    "                right -= 1\n",
-    "            elif total < 0:\n",
-    "                # If the total is negative, we need to increase the sum by moving the left pointer to the right\n",
-    "                left += 1\n",
-    "            else:\n",
-    "                # If the total is positive, we need to decrease the sum by moving the right pointer to the left\n",
-    "                right -= 1\n",
-    "    \n",
-    "    return triplets"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. It starts by sorting the input array `nums` in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.\n",
-    "\n",
-    "2. It initializes an empty list `triplets` to store the unique triplets that meet the given conditions.\n",
-    "\n",
-    "3. The code then iterates through the `nums` array using a loop with index `i`. This loop will consider each element of the array as a potential starting point for a triplet.\n",
-    "\n",
-    "4. Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If `nums[i]` is the same as the previous element `nums[i-1]`, it continues to the next iteration of the loop.\n",
-    "\n",
-    "5. Two pointers, `left` and `right`, are initialized. `left` starts just after the current element `nums[i]`, and `right` starts at the end of the array.\n",
-    "\n",
-    "6. The code enters another loop with `left` and `right` pointers, trying to find a triplet that sums up to zero.\n",
-    "\n",
-    "7. It calculates the `total` sum of the current triplet as `nums[i] + nums[left] + nums[right]`.\n",
-    "\n",
-    "8. If `total` is zero, it means a valid triplet is found, so it appends `[nums[i], nums[left], nums[right]]` to the `triplets` list. Then, it moves both the `left` and `right` pointers to their next unique elements while skipping duplicates.\n",
-    "\n",
-    "9. If `total` is less than zero, it means the sum is negative, so it increments the `left` pointer to move towards a larger sum.\n",
-    "\n",
-    "10. If `total` is greater than zero, it means the sum is positive, so it decrements the `right` pointer to move towards a smaller sum.\n",
-    "\n",
-    "11. This process continues until all possible triplets have been considered.\n",
-    "\n",
-    "12. Finally, the function returns the `triplets` list, which contains all the unique triplets that sum up to zero in the sorted `nums` array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[-1, -1, 2], [-1, 0, 1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "nums = [-1, 0, 1, 2, -1, -4]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "nums = [0, 1, 1]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 0, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "nums = [0, 0, 0]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `threeSum` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. Sorting the input array `nums` takes O(n log n) time, where n is the length of the array.\n",
-    "\n",
-    "2. The outer loop runs for each element of the array, so it iterates O(n) times.\n",
-    "\n",
-    "3. Inside the outer loop, we have a while loop with two pointers (`left` and `right`). In the worst case, the while loop can iterate O(n) times (when all elements are unique).\n",
-    "\n",
-    "4. Inside the while loop, we have constant time operations (additions, comparisons, and list appends).\n",
-    "\n",
-    "Overall, the time complexity of the `threeSum` function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The space used by the `triplets` list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.\n",
-    "\n",
-    "2. Other than the `triplets` list, the function uses only a constant amount of additional space for variables like `i`, `left`, `right`, and `total`.\n",
-    "\n",
-    "Overall, the space complexity of the `threeSum` function is O(k), where k is the number of unique triplets that meet the criteria. It's important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.\n",
-    "- Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K-Sum Problem:** Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.\n",
-    "2. **Count the Number of Unique Triplets:** Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
deleted file mode 100644
index 451a21d..0000000
--- a/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb	
+++ /dev/null
@@ -1,185 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 121. Best Time to Buy and Sell Stock\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given an array `prices` where `prices[i]` is the price of a given stock on the $i^{th}$ day.\n",
-    "\n",
-    "You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.\n",
-    "\n",
-    "*Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `prices.length` <= $10^5$\n",
-    "- 0 <= `prices[i]` <= $10^4$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def maxProfit(prices):\n",
-    "    if not prices:\n",
-    "        return 0\n",
-    "    \n",
-    "    min_price = prices[0]\n",
-    "    max_profit = 0\n",
-    "    \n",
-    "    for price in prices:\n",
-    "        # Update the minimum price if a lower price is encountered\n",
-    "        min_price = min(min_price, price)\n",
-    "        # Calculate the profit if selling at the current price\n",
-    "        max_profit = max(max_profit, price - min_price)\n",
-    "    \n",
-    "    return max_profit"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- The `maxProfit` function takes a single argument, `prices`, which is a list of stock prices.\n",
-    "- The first line of the function checks if the `prices` list is empty. If it's empty, there are no prices to analyze, so the function returns 0 (no profit can be made).\n",
-    "\n",
-    "- Then, we initialize two variables:\n",
-    "  - `min_price`: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (`prices[0]`).\n",
-    "  - `max_profit`: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven't made any profit.\n",
-    "\n",
-    "- We start iterating through the `prices` list, where `price` represents the stock price for the current day.\n",
-    "\n",
-    "- In each iteration, we check if the current `price` is lower than the `min_price` we've seen so far. If it is, we update `min_price` to the current `price`. This is because we want to buy the stock at the lowest possible price.\n",
-    "\n",
-    "- Next, we calculate the profit we would make if we sold the stock at the current `price` (assuming we bought it at `min_price`). We do this by subtracting `min_price` from the current `price`. This represents the profit for the current day.\n",
-    "\n",
-    "- We also use the `max` function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the `max_profit` we've seen previously, we update `max_profit` with this higher value.\n",
-    "\n",
-    "- Finally, after iterating through all the days in the `prices` list, we return `max_profit`, which represents the maximum profit that can be achieved by buying and selling a single stock."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "5\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "prices1 = [7, 1, 5, 3, 6, 4]\n",
-    "print(maxProfit(prices1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "0\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "prices2 = [7, 6, 4, 3, 1]\n",
-    "print(maxProfit(prices2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code iterates through the `prices` array once, examining each price exactly once.\n",
-    "- Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.\n",
-    "- Therefore, the time complexity of this code is O(n), where n is the length of the `prices` array. It performs a linear number of operations relative to the size of the input.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the code is constant, O(1).\n",
-    "- Regardless of the size of the input `prices` array, the code only uses a fixed amount of additional memory to store two variables (`min_price` and `max_profit`) and a few loop variables.\n",
-    "- The memory usage does not depend on the size of the input, so it is considered constant space complexity.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: O(n) where n is the length of the `prices` array.\n",
-    "- Space Complexity: O(1) (constant space usage)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Transactions Allowed:** Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.\n",
-    "2. **K Transactions Allowed:** Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.\n",
-    "3. **With Transaction Fee:** Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
deleted file mode 100644
index ded03f3..0000000
--- a/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb	
+++ /dev/null
@@ -1,206 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 3. Longest Substring Without Repeating Characters\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n",
-    "\n",
-    "---\n",
-    "Given a string `s`, find the length of the **longest substring** without repeating characters.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 0 <= `s.length` <= $5 * 10^4$\n",
-    "- `s` consists of English letters, digits, symbols and spaces.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def length_of_longest_substring(s):\n",
-    "    # Create a dictionary to store the index of each character's last occurrence.\n",
-    "    char_index = {}\n",
-    "    \n",
-    "    # Initialize variables to keep track of the start and end of the current substring.\n",
-    "    start = 0\n",
-    "    max_length = 0\n",
-    "    \n",
-    "    for end in range(len(s)):\n",
-    "        # If the character is in the dictionary and its last occurrence is after the start of the current substring,\n",
-    "        # update the start of the substring to the next character after its last occurrence.\n",
-    "        if s[end] in char_index and char_index[s[end]] >= start:\n",
-    "            start = char_index[s[end]] + 1\n",
-    "        \n",
-    "        # Update the last occurrence index of the current character.\n",
-    "        char_index[s[end]] = end\n",
-    "        \n",
-    "        # Calculate the length of the current substring and update the maximum length if necessary.\n",
-    "        current_length = end - start + 1\n",
-    "        max_length = max(max_length, current_length)\n",
-    "    \n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a function called `length_of_longest_substring` that takes a single argument `s`, which is the input string for which we want to find the length of the longest substring without repeating characters.\n",
-    "\n",
-    "2. We create a dictionary called `char_index` to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.\n",
-    "\n",
-    "3. We initialize two variables, `start` and `max_length`. \n",
-    "   - `start` represents the start index of the current substring without repeating characters. It starts at 0.\n",
-    "   - `max_length` is used to keep track of the maximum length found so far and is initially set to 0.\n",
-    "\n",
-    "4. We then iterate through the input string `s` using a for loop, where the loop variable `end` represents the current end index of the substring we are considering.\n",
-    "\n",
-    "5. Inside the loop:\n",
-    "   - We check if the character `s[end]` is already in the `char_index` dictionary and if its last occurrence is within or after the current substring. If so, it means that we've encountered a repeating character, and we need to update the `start` of the substring to the next character after the last occurrence of `s[end]`. This ensures that we have a new valid substring without repeating characters.\n",
-    "   - We then update the `char_index` dictionary by storing the current index `end` as the last occurrence index of the character `s[end]`.\n",
-    "\n",
-    "6. Next, we calculate the length of the current substring without repeating characters, which is `current_length = end - start + 1`. We add 1 to account for the fact that the indices are zero-based.\n",
-    "\n",
-    "7. We update the `max_length` with the maximum of its current value and the `current_length`. This step ensures that we keep track of the longest valid substring we have encountered so far.\n",
-    "\n",
-    "8. The loop continues to iterate through the input string, and at the end, we return the `max_length`, which represents the length of the longest substring without repeating characters."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(length_of_longest_substring(\"abcabcbb\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(length_of_longest_substring(\"bbbbb\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "cf04eba0-0ead-4e8b-ba33-4316ea64a9d3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(length_of_longest_substring(\"pwwkew\"))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "Let's analyze the time and space complexity of the `length_of_longest_substring` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The function iterates through the input string `s` using a single for loop. The loop runs from the beginning of the string to the end once.\n",
-    "- Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.\n",
-    "- Therefore, the time complexity of the function is O(n), where n is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The primary data structure that consumes space in this function is the `char_index` dictionary.\n",
-    "- In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.\n",
-    "- Therefore, the space complexity is O(min(n, m)), where n is the length of the input string `s`, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).\n",
-    "- Additionally, there are a few integer variables used for indices and lengths, which consume constant space.\n",
-    "- Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.\n",
-    "\n",
-    "**In summary,** the time complexity of the `length_of_longest_substring` function is O(n), and the space complexity is O(n) in the worst case due to the `char_index` dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Longest Substring with K Distinct Characters:** Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string \"abcabcbb\" and K = 2, the answer would be 4 because the longest substring with two distinct characters is \"abca.\"\n",
-    "2. **Longest Substring with Unique Characters:** Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string \"abcabcbb,\" the answer would be 4 because \"abcd\" is the longest substring with unique characters."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
deleted file mode 100644
index df4b0d3..0000000
--- a/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb	
+++ /dev/null
@@ -1,189 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 424. Longest Repeating Character Replacement\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Repeating Character Replacement problem on LeetCode, click here!](https://leetcode.com/problems/longest-repeating-character-replacement/)\n",
-    "\n",
-    "---\n",
-    "You are given a string `s` and an integer `k`. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most `k` times.\n",
-    "\n",
-    "*Return the length of the longest substring containing the same letter you can get after performing the above operations.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $10^5$\n",
-    "- `s` consists of only uppercase English letters.\n",
-    "- `0 <= k <= s.length`"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def characterReplacement(s, k):\n",
-    "    max_length = 0  # Initialize the maximum length\n",
-    "    max_count = 0   # Initialize the maximum count of repeating characters\n",
-    "    start = 0       # Initialize the start of the sliding window\n",
-    "    char_count = {} # Dictionary to store the count of each character\n",
-    "\n",
-    "    for end in range(len(s)):\n",
-    "        # Update the count of the current character in the dictionary\n",
-    "        char_count[s[end]] = char_count.get(s[end], 0) + 1\n",
-    "        \n",
-    "        # Update the maximum count of repeating characters\n",
-    "        max_count = max(max_count, char_count[s[end]])\n",
-    "        \n",
-    "        # Check if the current window size is greater than k\n",
-    "        if (end - start + 1) - max_count > k:\n",
-    "            # Move the start of the window to the right\n",
-    "            char_count[s[start]] -= 1\n",
-    "            start += 1\n",
-    "        \n",
-    "        # Update the maximum length\n",
-    "        max_length = max(max_length, end - start + 1)\n",
-    "\n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We initialize some variables:\n",
-    "   - `max_length` to keep track of the maximum length of the substring containing the same letter.\n",
-    "   - `max_count` to keep track of the maximum count of repeating characters within the current window.\n",
-    "   - `start` to represent the start index of the sliding window.\n",
-    "   - `char_count` is a dictionary that will store the count of each character within the current window.\n",
-    "\n",
-    "2. We use a `for` loop to iterate through the characters of the string `s`.\n",
-    "\n",
-    "3. Inside the loop, we do the following for each character at position `end`:\n",
-    "   - Update the count of the current character in the `char_count` dictionary.\n",
-    "   - Update the `max_count` to be the maximum of the current `max_count` and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.\n",
-    "\n",
-    "4. We check if the current window size (the difference between `end` and `start` plus one) minus the `max_count` is greater than `k`. This condition checks whether we have exceeded the allowed number of replacements (`k`) within the current window.\n",
-    "\n",
-    "   - If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the `start` of the window to the right and decrementing the count of the character at `s[start]` in the `char_count` dictionary. This effectively removes characters from the left side of the window until we have a valid window again.\n",
-    "\n",
-    "   - By doing this, we ensure that the difference between the current window size and the `max_count` is always less than or equal to `k`.\n",
-    "\n",
-    "5. After each character, we update the `max_length` to be the maximum of the current `max_length` and the size of the current window (`end - start + 1`).\n",
-    "\n",
-    "6. Finally, we return `max_length`, which holds the length of the longest substring containing the same letter with at most `k` replacements."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "s1 = \"ABAB\"\n",
-    "k1 = 2\n",
-    "print(characterReplacement(s1, k1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "s2 = \"AABABBA\"\n",
-    "k2 = 1\n",
-    "print(characterReplacement(s2, k2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code uses a single `for` loop to iterate through the characters of the input string `s`. The loop runs from the beginning to the end of the string.\n",
-    "- Inside the loop, we perform constant-time operations such as updating the `char_count` dictionary and updating variables like `max_count` and `max_length`.\n",
-    "- The code's time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include `max_length`, `max_count`, `start`, and `char_count`. Therefore, the space complexity is O(1) or constant space.\n",
-    "\n",
-    "**In summary**, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.\n",
-    "2. **Variation with Lowercase Letters:** Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb b/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb
deleted file mode 100644
index cf22c86..0000000
--- a/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb	
+++ /dev/null
@@ -1,260 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 76. Minimum Window Substring\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Minimum Window Substring problem on LeetCode, click here!](https://leetcode.com/problems/minimum-window-substring/)\n",
-    "\n",
-    "---\n",
-    "Given two strings `s` and `t` of lengths `m` and `n` respectively, return *the **minimum window substring** of `s` such that every character in `t` (**including duplicates**) is included in the window. If there is no such substring, return the empty string `\"\"`.*\n",
-    "\n",
-    "The testcases will be generated such that the answer is **unique**.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `m == s.length`\n",
-    "- `n == t.length`\n",
-    "- 1 <= `m, n` <= $10^5$\n",
-    "- `s` and `t` consist of uppercase and lowercase English letters.\n",
-    "\n",
-    "**Follow up**: Could you find an algorithm that runs in $O(m + n)$ time?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def min_window_substring(s, t):\n",
-    "    if not s or not t:\n",
-    "        return \"\"\n",
-    "\n",
-    "    # Initialize dictionaries to keep track of character counts for t and the current window in s.\n",
-    "    t_dict = {}\n",
-    "    current_window_dict = {}\n",
-    "    \n",
-    "    # Populate t_dict with character counts for string t.\n",
-    "    for char in t:\n",
-    "        t_dict[char] = t_dict.get(char, 0) + 1\n",
-    "\n",
-    "    # Initialize pointers for the sliding window.\n",
-    "    left = 0\n",
-    "    min_len = float('inf')\n",
-    "    min_window = \"\"\n",
-    "    required_chars = len(t_dict)\n",
-    "\n",
-    "    # Initialize a variable to keep track of how many required characters have been found in the current window.\n",
-    "    found_chars = 0\n",
-    "\n",
-    "    # Iterate over the string s using the right pointer.\n",
-    "    for right in range(len(s)):\n",
-    "        char = s[right]\n",
-    "\n",
-    "        # Update the current_window_dict.\n",
-    "        current_window_dict[char] = current_window_dict.get(char, 0) + 1\n",
-    "\n",
-    "        # Check if the current character is a required character and if its count matches the required count.\n",
-    "        if char in t_dict and current_window_dict[char] == t_dict[char]:\n",
-    "            found_chars += 1\n",
-    "\n",
-    "        # Try to minimize the window by moving the left pointer.\n",
-    "        while left <= right and found_chars == required_chars:\n",
-    "            # Calculate the current window size.\n",
-    "            window_size = right - left + 1\n",
-    "\n",
-    "            # If the current window is smaller than the minimum found so far, update min_len and min_window.\n",
-    "            if window_size < min_len:\n",
-    "                min_len = window_size\n",
-    "                min_window = s[left:right+1]\n",
-    "\n",
-    "            # Move the left pointer to the right to shrink the window.\n",
-    "            left_char = s[left]\n",
-    "            current_window_dict[left_char] -= 1\n",
-    "\n",
-    "            # Check if the character removed from the window was a required character.\n",
-    "            if left_char in t_dict and current_window_dict[left_char] < t_dict[left_char]:\n",
-    "                found_chars -= 1\n",
-    "\n",
-    "            # Move the left pointer further to continue shrinking the window.\n",
-    "            left += 1\n",
-    "\n",
-    "    return min_window"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by checking if either of the input strings `s` or `t` is empty. If either of them is empty, we return an empty string since there can't be any valid substring in this case.\n",
-    "\n",
-    "2. We initialize two dictionaries: `t_dict` and `current_window_dict`. These dictionaries will be used to keep track of character counts in the string `t` and the current window in string `s`, respectively.\n",
-    "\n",
-    "3. We populate the `t_dict` dictionary by iterating through string `t`. For each character, we increment its count in the dictionary using `t_dict.get(char, 0) + 1`. This allows us to count the occurrences of each character in `t`.\n",
-    "\n",
-    "4. We initialize two pointers: `left` and `right`. The `left` pointer will represent the start of the current window, and the `right` pointer will represent the end of the current window. We also initialize `min_len` to store the length of the minimum window found so far, and `min_window` to store the actual minimum window substring.\n",
-    "\n",
-    "5. We determine the number of required characters in `t` (i.e., the number of distinct characters in `t`) and store it in the variable `required_chars`.\n",
-    "\n",
-    "6. We initialize a variable `found_chars` to keep track of how many required characters have been found in the current window. Initially, it is set to 0.\n",
-    "\n",
-    "7. We iterate over the string `s` using the `right` pointer. In each iteration, we do the following:\n",
-    "\n",
-    "   - Update the `current_window_dict` by incrementing the count of the current character.\n",
-    "   \n",
-    "   - Check if the current character is a required character (present in `t_dict`) and if its count in the `current_window_dict` matches the required count from `t_dict`. If so, we increment `found_chars`.\n",
-    "\n",
-    "8. After updating the window, we attempt to minimize the window size by moving the `left` pointer to the right. In this step, we:\n",
-    "\n",
-    "   - Calculate the size of the current window.\n",
-    "   \n",
-    "   - If the current window size is smaller than the minimum found so far (`min_len`), we update `min_len` and `min_window` to store the current window substring.\n",
-    "   \n",
-    "   - Move the `left` pointer to the right to shrink the window.\n",
-    "   \n",
-    "   - Check if the character being removed from the window was a required character. If it was, we decrement `found_chars`.\n",
-    "   \n",
-    "   - Continue moving the `left` pointer further to continue shrinking the window if the window still contains all required characters.\n",
-    "\n",
-    "9. Finally, we return `min_window`, which will contain the minimum window substring that contains all characters from `t`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "BANC\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(min_window_substring(\"ADOBECODEBANC\", \"ABC\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "a\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(min_window_substring(\"a\", \"a\")) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(min_window_substring(\"a\", \"aa\")) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `min_window_substring` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The main loop iterates through the string `s` from left to right using the `right` pointer. This loop runs in O(m) time, where 'm' is the length of string `s`.\n",
-    "\n",
-    "- Inside the loop, we have a while loop that moves the `left` pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the `left` pointer all the way to the end of the string.\n",
-    "\n",
-    "- Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.\n",
-    "\n",
-    "- The initialization of the `t_dict` dictionary takes O(n) time, where 'n' is the length of string `t`.\n",
-    "\n",
-    "Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string `s`, and the length of string `t` has a smaller impact.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity is determined by the space used by the `t_dict` dictionary, the `current_window_dict` dictionary, and a few variables.\n",
-    "\n",
-    "- The `t_dict` dictionary stores character counts for string `t`. In the worst case, when all characters in `t` are distinct, this dictionary can have a maximum of 'n' key-value pairs. So, the space complexity for `t_dict` is O(n).\n",
-    "\n",
-    "- The `current_window_dict` dictionary stores character counts for the current window. In the worst case, it can have a maximum of 'm' key-value pairs. So, the space complexity for `current_window_dict` is also O(m).\n",
-    "\n",
-    "- Other variables used in the function, such as `left`, `right`, `min_len`, `min_window`, `required_chars`, and `found_chars`, are all of constant size and do not depend on the input sizes.\n",
-    "\n",
-    "**In summary**, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings' lengths. This is because the space used for `t_dict` and `current_window_dict` dominates the space complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Smallest Distinct Substring:** Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.\n",
-    "2. **No Extra Space:** Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb b/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb
deleted file mode 100644
index 04c0280..0000000
--- a/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 20. Valid Parentheses\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Parentheses problem on LeetCode, click here!](https://leetcode.com/problems/valid-parentheses/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given a string s containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.\n",
-    "\n",
-    "An input string is valid if:\n",
-    "\n",
-    "1. Open brackets must be closed by the same type of brackets.\n",
-    "2. Open brackets must be closed in the correct order.\n",
-    "3. Every close bracket has a corresponding open bracket of the same type.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $10^4$\n",
-    "- `s` consists of parentheses only `'()[]{}'`."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isValid(s):\n",
-    "    # Create an empty stack to store opening brackets\n",
-    "    stack = []\n",
-    "    \n",
-    "    # Define a mapping for matching brackets\n",
-    "    bracket_mapping = {')': '(', '}': '{', ']': '['}\n",
-    "    \n",
-    "    # Iterate through the characters in the input string\n",
-    "    for char in s:\n",
-    "        # If the character is an opening bracket, push it onto the stack\n",
-    "        if char in bracket_mapping.values():\n",
-    "            stack.append(char)\n",
-    "        # If the character is a closing bracket\n",
-    "        elif char in bracket_mapping.keys():\n",
-    "            # Pop the top element from the stack if it exists, or use a dummy value '#'\n",
-    "            top_element = stack.pop() if stack else '#'\n",
-    "            # If the popped element does not match the corresponding opening bracket, return False\n",
-    "            if bracket_mapping[char] != top_element:\n",
-    "                return False\n",
-    "        # If the character is not a bracket, ignore it\n",
-    "        \n",
-    "    # After processing the entire string, if there are any unmatched opening brackets left in the stack, return False\n",
-    "    return len(stack) == 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining the `isValid` function that takes a single argument `s`, which is the input string containing parentheses and brackets.\n",
-    "\n",
-    "2. Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.\n",
-    "\n",
-    "3. We define a `bracket_mapping` dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.\n",
-    "\n",
-    "4. We iterate through each character `char` in the input string `s` using a `for` loop.\n",
-    "\n",
-    "5. If the character `char` is an opening bracket (i.e., it exists in the `values()` of `bracket_mapping`), we push it onto the stack using the `append()` method.\n",
-    "\n",
-    "6. If the character `char` is a closing bracket (i.e., it exists in the `keys()` of `bracket_mapping`), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in `top_element`. We use a dummy value `'#'` if the stack is empty to avoid errors.\n",
-    "\n",
-    "7. We then compare `top_element` with the corresponding opening bracket using `bracket_mapping[char]`. If they do not match, it means the string is not valid, and we return `False`.\n",
-    "\n",
-    "8. If the character `char` is not a bracket, we simply ignore it and continue the loop.\n",
-    "\n",
-    "9. After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return `True`. Otherwise, we return `False`.\n",
-    "\n",
-    "10. Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(isValid(\"()\"))    "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(isValid(\"()[]{}\")) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(isValid(\"(]\"))     "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `isValid` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The function iterates through each character in the input string `s` once, performing constant-time operations for each character.\n",
-    "- Pushing and popping elements from the stack (list) also takes constant time in most cases.\n",
-    "- Therefore, the overall time complexity of the function is $O(n)$, where $n$ is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the function is determined by the space used by the stack and the `bracket_mapping` dictionary.\n",
-    "- In the worst case, if the input string `s` consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of $O(n)$ in terms of the stack.\n",
-    "- The `bracket_mapping` dictionary has a constant number of key-value pairs (3 pairs in this case).\n",
-    "- Therefore, the overall space complexity of the function is $O(n)$, where $n$ is the length of the input string `s`, mainly due to the stack space.\n",
-    "\n",
-    "**In summary:**\n",
-    "- The time complexity is $O(n)$ because we iterate through the string once.\n",
-    "- The space complexity is $O(n)$ due to the stack used to keep track of opening brackets."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Valid Expressions:** Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as \"$2 * (3 + 5) / (4 - 2)$\".\n",
-    "2. **Valid Parentheses Combinations:**\n",
-    "Write a function to generate all valid combinations of n pairs of parentheses, where $n$ is a positive integer. For example, for $n = 3$, the valid combinations are [\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\"]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
deleted file mode 100644
index eb4858b..0000000
--- a/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 153. Find Minimum in Rotated Sorted Array\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Suppose an array of length `n` sorted in ascending order is **rotated** between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:\n",
-    "\n",
-    "- `[4,5,6,7,0,1,2]` if it was rotated `4` times.\n",
-    "- `[0,1,2,4,5,6,7]` if it was rotated `7` times.\n",
-    "\n",
-    "Notice that **rotating** an array `[a[0], a[1], a[2], ..., a[n-1]]` 1 time results in the array `[a[n-1], a[0], a[1], a[2], ..., a[n-2]]`.\n",
-    "\n",
-    "Given the sorted rotated array `nums` of **unique** elements, return *the minimum element of this array.*\n",
-    "\n",
-    "You must write an algorithm that runs in $O(log\\ n)$ time.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `n == nums.length`\n",
-    "- `1 <= n <= 5000`\n",
-    "- `-5000 <= nums[i] <= 5000`\n",
-    "- All the integers of `nums` are **unique**.\n",
-    "- `nums` is sorted and rotated between `1` and `n` times."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def findMin(nums):\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "    \n",
-    "    while left < right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "        \n",
-    "        # If the mid element is greater than the rightmost element,\n",
-    "        # it means the minimum element is in the right half.\n",
-    "        if nums[mid] > nums[right]:\n",
-    "            left = mid + 1\n",
-    "        # If the mid element is less than or equal to the rightmost element,\n",
-    "        # it means the minimum element is in the left half or at the mid itself.\n",
-    "        else:\n",
-    "            right = mid\n",
-    "    \n",
-    "    # The loop will break when left and right converge to the minimum element.\n",
-    "    # At this point, left (or right) will be pointing to the minimum element.\n",
-    "    return nums[left]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The function `findMin(nums)` takes an input list `nums`, which represents the rotated sorted array.\n",
-    "\n",
-    "2. Initialize two pointers `left` and `right` to track the current search range. Initially, `left` is set to 0 (the beginning of the array), and `right` is set to `len(nums) - 1` (the end of the array).\n",
-    "\n",
-    "3. Enter a `while` loop with the condition `left < right`. This loop continues until `left` and `right` converge to a single element, which will be the minimum element in the rotated array.\n",
-    "\n",
-    "4. Inside the loop, calculate the middle index `mid` using integer division. This helps in finding the middle element of the current search range.\n",
-    "\n",
-    "5. Check if the element at the middle index (`nums[mid]`) is greater than the element at the rightmost index (`nums[right]`). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update `left` to `mid + 1`, effectively eliminating the left half of the search range.\n",
-    "\n",
-    "6. If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the `mid` index itself. In this case, update `right` to `mid`, effectively eliminating the right half of the search range.\n",
-    "\n",
-    "7. Repeat steps 4-6 until `left` and `right` converge to the minimum element.\n",
-    "\n",
-    "8. When the loop exits, it means that `left` (or `right`) points to the minimum element in the array.\n",
-    "\n",
-    "9. Return `nums[left]` (or `nums[right]`) as the result, which is the minimum element in the rotated sorted array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1:\n",
-    "nums1 = [3, 4, 5, 1, 2]\n",
-    "print(findMin(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "0\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "print(findMin(nums2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "11\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "nums3 = [11, 13, 15, 17]\n",
-    "print(findMin(nums3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this code is $O(log\\ n)$, where '$n$' is the length of the input array `nums`. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.\n",
-    "\n",
-    "In each iteration of the `while` loop, the search range is halved, and this process continues until the `left` and `right` pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.\n",
-    "\n",
-    "Therefore, the binary search used in this code runs in $O(log\\ n)$ time complexity.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of this code is $O(1)$, which means it uses a constant amount of additional space that does not depend on the size of the input array.\n",
-    "\n",
-    "The algorithm uses a fixed number of variables (`left`, `right`, `mid`) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: $O(log\\ n)$\n",
-    "- Space Complexity: $O(1)$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. Solve the problem with a variation where the input array may contain duplicates.\n",
-    "\n",
-    "2. Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in $O(log\\ n)$ time.\n",
-    "\n",
-    "3. Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in $O(log\\ n)$ time?\n",
-    "\n",
-    "4. Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in $O(log\\ n)$ time."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
deleted file mode 100644
index 7b3139d..0000000
--- a/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,237 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 33. Search in Rotated Sorted Array\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Search in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "There is an integer array `nums` sorted in ascending order (with **distinct** values).\n",
-    "\n",
-    "Prior to being passed to your function, `nums` is **possibly rotated** at an unknown pivot index `k (1 <= k < nums.length)` such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]` (**0-indexed**). For example, `[0,1,2,4,5,6,7]` might be rotated at pivot index 3 and become `[4,5,6,7,0,1,2]`.\n",
-    "\n",
-    "Given the array `nums` **after** the possible rotation and an integer `target`, return *the index of `target` if it is in `nums`, or `-1` if it is not in `nums`.*\n",
-    "\n",
-    "You must write an algorithm with $O(log\\ n)$ runtime complexity.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `1 <= nums.length <= 5000`\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- All values of `nums` are **unique**.\n",
-    "- `nums` is an ascending array that is possibly rotated.\n",
-    "- $-10^4$ <= `target` <= $10^4$"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def search(nums, target):\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "\n",
-    "    # Find the pivot index using binary search\n",
-    "    while left < right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "\n",
-    "        if nums[mid] > nums[right]:\n",
-    "            left = mid + 1\n",
-    "        else:\n",
-    "            right = mid\n",
-    "\n",
-    "    pivot = left\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "\n",
-    "    # Determine which part of the array to search in\n",
-    "    if target >= nums[pivot] and target <= nums[right]:\n",
-    "        left = pivot\n",
-    "    else:\n",
-    "        right = pivot\n",
-    "\n",
-    "    # Perform binary search to find the target\n",
-    "    while left <= right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "\n",
-    "        if nums[mid] == target:\n",
-    "            return mid\n",
-    "        elif nums[mid] < target:\n",
-    "            left = mid + 1\n",
-    "        else:\n",
-    "            right = mid - 1\n",
-    "\n",
-    "    return -1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `search` function takes two arguments: `nums`, which is the rotated sorted array, and `target`, which is the value we want to find in the array.\n",
-    "\n",
-    "2. We initialize two pointers, `left` and `right`, which represent the range in which we are going to perform binary search. Initially, `left` is set to 0, and `right` is set to the index of the last element in the array (`len(nums) - 1`).\n",
-    "\n",
-    "3. We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a `while` loop to continue the search until `left` is less than `right`.\n",
-    "\n",
-    "4. Inside the loop, we calculate the middle index `mid` using integer division. We then compare the value at `mid` with the value at `right`. If `nums[mid]` is greater than `nums[right]`, it means the pivot point lies to the right of `mid`, so we update `left` to `mid + 1`. Otherwise, the pivot point lies to the left of `mid`, so we update `right` to `mid`. This process continues until we find the pivot index.\n",
-    "\n",
-    "5. After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.\n",
-    "\n",
-    "6. We reset `left` and `right` pointers. If the target value is within the range `[nums[pivot], nums[right]]`, we set `left` to `pivot` (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set `right` to `pivot` (the end of the sorted part), indicating that we should search in the sorted part.\n",
-    "\n",
-    "7. We then perform binary search again within the chosen range (`left` to `right`) to find the target element. The binary search continues until `left` is less than or equal to `right`.\n",
-    "\n",
-    "8. Inside the binary search loop, we calculate the middle index `mid` and compare `nums[mid]` with the target value. If they are equal, we return `mid` as the index of the target element. If `nums[mid]` is less than the target, we update `left` to `mid + 1` to search in the right half. If `nums[mid]` is greater than the target, we update `right` to `mid - 1` to search in the left half.\n",
-    "\n",
-    "9. If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "nums1 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "target1 = 0\n",
-    "result1 = search(nums1, target1)\n",
-    "print(result1) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "-1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "target2 = 3\n",
-    "result2 = search(nums2, target2)\n",
-    "print(result2) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "-1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "nums3 = [1]\n",
-    "target3 = 0\n",
-    "result3 = search(nums3, target3)\n",
-    "print(result3) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. Finding the pivot index using binary search takes $O(log\\ n)$ time, where '$n$' is the number of elements in the array.\n",
-    "2. After finding the pivot index, performing binary search to find the target element also takes $O(log\\ n)$ time in the worst case.\n",
-    "\n",
-    "The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is $O(log\\ n)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is very minimal:\n",
-    "\n",
-    "1. We use a constant amount of additional space for variables such as `left`, `right`, `pivot`, and `mid`. These variables do not depend on the input size, so they contribute $O(1)$ space complexity.\n",
-    "2. The function does not use any additional data structures that scale with the input size.\n",
-    "\n",
-    "Therefore, the space complexity of the code is $O(1)$, which means it has a constant space complexity and does not depend on the size of the input array.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: $O(log\\ n)$\n",
-    "- Space Complexity: $O(1)$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Find Minimum Element in Rotated Sorted Array**: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don't need to search for a target value but instead find the smallest element.\n",
-    "\n",
-    "2. **Search in a Circularly Sorted Array**: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining $O(log\\ n)$ complexity."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb b/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb
deleted file mode 100644
index c428c9f..0000000
--- a/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb	
+++ /dev/null
@@ -1,261 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 141. Linked List Cycle\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Linked List Cycle problem on LeetCode, click here!](https://leetcode.com/problems/linked-list-cycle/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given `head`, the head of a linked list, determine if the linked list has a cycle in it.\n",
-    "\n",
-    "There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is connected to. **Note that `pos` is not passed as a parameter.**\n",
-    "\n",
-    "Return `true` if there is a cycle in the linked list. Otherwise, return `false`.\n",
-    "\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of the nodes in the list is in the range $[0, 10^4]$.\n",
-    "- $-10^5$ <= Node.val <= $10^5$\n",
-    "- `pos` is `-1` or a **valid index** in the linked-list.\n",
-    "\n",
-    "**Follow up:** Can you solve it using $O(1)$ (i.e. constant) memory?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "    def __init__(self, val=0):\n",
-    "        self.val = val\n",
-    "        self.next = None\n",
-    "\n",
-    "class Solution:\n",
-    "    def hasCycle(self, head: ListNode) -> bool:\n",
-    "        if not head:\n",
-    "            return False\n",
-    "        \n",
-    "        slow = head\n",
-    "        fast = head\n",
-    "        \n",
-    "        while fast and fast.next:\n",
-    "            slow = slow.next\n",
-    "            fast = fast.next.next\n",
-    "            \n",
-    "            if slow == fast:\n",
-    "                return True\n",
-    "        \n",
-    "        return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The given code defines a class `Solution` with a method `hasCycle` for determining if a linked list has a cycle.\n",
-    "\n",
-    "The `ListNode` class represents nodes in the linked list, where each node has a `val` (a value associated with the node) and a `next` attribute (a reference to the next node in the list).\n",
-    "\n",
-    "The `hasCycle` method takes the `head` of a linked list as input and returns `True` if there is a cycle in the linked list, and `False` otherwise. It uses two pointers, `slow` and `fast`, to traverse the linked list. If there is a cycle, the `fast` pointer will eventually catch up to the `slow` pointer.\n",
-    "\n",
-    "The algorithm works as follows:\n",
-    "1. It checks if the input `head` is `None` (an empty list). If it is, the method returns `False` because an empty list can't have a cycle.\n",
-    "2. Two pointers, `slow` and `fast`, initially point to the `head` of the list.\n",
-    "3. The code enters a `while` loop where `fast` moves two steps at a time, and `slow` moves one step at a time.\n",
-    "4. If there is a cycle, `fast` will eventually catch up to `slow`, and the method returns `True`.\n",
-    "5. If the loop completes without finding a cycle, the method returns `False`."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list with a cycle\n",
-    "def create_linked_list_with_cycle(values, pos):\n",
-    "    dummy = ListNode()\n",
-    "    current = dummy\n",
-    "    cycle_node = None\n",
-    "    \n",
-    "    for i, val in enumerate(values):\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "        \n",
-    "        if i == pos:\n",
-    "            cycle_node = current\n",
-    "    \n",
-    "    if cycle_node:\n",
-    "        current.next = cycle_node\n",
-    "    \n",
-    "    return dummy.next"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:\n",
-    "\n",
-    "1. `values`: A list of values representing the nodes in the linked list.\n",
-    "2. `pos`: An integer representing the index of the node where the cycle begins.\n",
-    "\n",
-    "Here's how the function works:\n",
-    "\n",
-    "- It starts by creating an empty `ListNode` called `dummy`. This `dummy` node is used to simplify the creation of the linked list.\n",
-    "- It initializes a `current` pointer to the `dummy` node. This pointer will be used to traverse the linked list.\n",
-    "- It initializes a `cycle_node` variable to `None`. This variable will hold the reference to the node where the cycle begins, if any.\n",
-    "- It then iterates through the `values` list, creating a new `ListNode` for each value and appending it to the linked list.\n",
-    "- Inside the loop, it checks if the current index `i` is equal to the specified `pos`. If they match, it sets `cycle_node` to the current node. This simulates the creation of a cycle in the linked list.\n",
-    "- After the loop, if `cycle_node` is not `None` (indicating a cycle should be created), it connects the last node in the linked list to `cycle_node`, effectively creating a cycle.\n",
-    "- Finally, it returns the reference to the first node of the linked list (not the `dummy` node).\n",
-    "\n",
-    "This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It's particularly useful for testing the code's ability to detect cycles in linked lists."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "head = [3,2,0,-4]\n",
-    "pos = 1\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "head = [1,2]\n",
-    "pos = 0\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "head = [1]\n",
-    "pos = -1\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's discuss the time and space complexity of the code for detecting a cycle in a linked list:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this code is $O(n)$, where \"$n$\" is the number of nodes in the linked list.\n",
-    "\n",
-    "The reason for this is that both the `slow` and `fast` pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the `fast` pointer will reach the end of the list after going through approximately $n/2$ nodes. In the case of a cycle, it may take some extra iterations for the `fast` pointer to catch up to the `slow` pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it $O(n)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this code is $O(1)$, which means it uses constant space.\n",
-    "\n",
-    "The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (`slow` and `fast`) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.\n",
-    "\n",
-    "**In summary**, this code efficiently detects cycles in a linked list with a time complexity of $O(n)$ and a space complexity of $O(1)$. It is an example of an algorithm that solves a complex problem with minimal memory usage."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb b/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb
deleted file mode 100644
index 4ec3f3b..0000000
--- a/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 143. Reorder List\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Reorder List problem on LeetCode, click here!](https://leetcode.com/problems/reorder-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given the head of a singly linked-list. The list can be represented as:\n",
-    "\n",
-    "$L_0 → L_1 → … → L_{n - 1} → L_n$\n",
-    "\n",
-    "Reorder the list to be on the following form:\n",
-    "\n",
-    "$L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …$\n",
-    "\n",
-    "You may not modify the values in the list's nodes. Only nodes themselves may be changed.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is in the range $[1, 5 * 10^4]$.\n",
-    "- `1 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def reorderList(head):\n",
-    "    if not head or not head.next:\n",
-    "        return head\n",
-    "\n",
-    "    # Step 1: Find the middle of the linked list\n",
-    "    slow, fast = head, head\n",
-    "    while fast.next and fast.next.next:\n",
-    "        slow = slow.next\n",
-    "        fast = fast.next.next\n",
-    "\n",
-    "    # Split the list into two halves\n",
-    "    first_half = head\n",
-    "    second_half = slow.next\n",
-    "    slow.next = None\n",
-    "\n",
-    "    # Step 2: Reverse the second half of the linked list\n",
-    "    prev = None\n",
-    "    current = second_half\n",
-    "    while current:\n",
-    "        next_node = current.next\n",
-    "        current.next = prev\n",
-    "        prev = current\n",
-    "        current = next_node\n",
-    "    second_half = prev\n",
-    "\n",
-    "    # Step 3: Merge the first and reversed second halves alternately\n",
-    "    p1, p2 = first_half, second_half\n",
-    "    while p2:\n",
-    "        next_p1 = p1.next\n",
-    "        next_p2 = p2.next\n",
-    "        p1.next = p2\n",
-    "        p2.next = next_p1\n",
-    "        p1 = next_p1\n",
-    "        p2 = next_p2\n",
-    "\n",
-    "    return head"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `reorderList` function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here's a detailed explanation of how the function works:\n",
-    "\n",
-    "1. **Base Cases Handling**:\n",
-    "   - The function first checks if the input linked list is empty (`not head`) or contains only one element (`not head.next`). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.\n",
-    "\n",
-    "2. **Finding the Middle of the Linked List**:\n",
-    "   - To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, `slow` and `fast`, initialized to the head of the list.\n",
-    "   - `slow` moves one step at a time while `fast` moves two steps at a time. When `fast` reaches the end of the list or the second-to-last node, `slow` will be at the middle node.\n",
-    "\n",
-    "3. **Splitting the List**:\n",
-    "   - After finding the middle node, we split the list into two halves:\n",
-    "     - The first half, `first_half`, contains nodes from the beginning up to the middle.\n",
-    "     - The second half, `second_half`, contains nodes from the middle to the end.\n",
-    "   - To split the list, we set the `next` pointer of the node before the middle node to `None`.\n",
-    "\n",
-    "4. **Reversing the Second Half**:\n",
-    "   - We reverse the second half of the linked list using the `prev`, `current`, and `next_node` pointers.\n",
-    "   - `prev` is initially `None`, and we iterate through the second half. For each node, we:\n",
-    "     - Set the `next` of the current node to `prev`, effectively reversing the next pointer direction.\n",
-    "     - Update `prev` to the current node.\n",
-    "     - Move to the next node using the `next_node`.\n",
-    "\n",
-    "5. **Merging the Two Halves Alternately**:\n",
-    "   - We now have two linked lists: `first_half` and the reversed `second_half`.\n",
-    "   - We merge these two lists alternately by adjusting the `next` pointers of the nodes.\n",
-    "   - `p1` and `p2` are pointers to the current nodes in `first_half` and `second_half`, respectively.\n",
-    "   - We iterate through both lists while reordering nodes:\n",
-    "     - Set the `next` of `p1` to `p2` to link a node from the first half to a node from the reversed second half.\n",
-    "     - Update `p1` and `p2` to their respective next nodes.\n",
-    "     - Repeat this process until we have processed all nodes in both halves.\n",
-    "\n",
-    "6. **Returning the Reordered List**:\n",
-    "   - After the merging process is complete, the linked list is reordered as specified.\n",
-    "   - The function returns the `head` of the reordered list.\n",
-    "\n",
-    "The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to print the linked list\n",
-    "def printLinkedList(head):\n",
-    "    result = []\n",
-    "    while head:\n",
-    "        result.append(head.val)\n",
-    "        head = head.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the helper functions:\n",
-    "**printLinkedList Function**:\n",
-    "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-    "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-    "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-    "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-    "\n",
-    "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 4, 2, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "head1 = ListNode(1, ListNode(2, ListNode(3, ListNode(4))))\n",
-    "reorderList(head1)\n",
-    "print(printLinkedList(head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 5, 2, 4, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "head2 = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))\n",
-    "reorderList(head2)\n",
-    "print(printLinkedList(head2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `reorderList` function:\n",
-    "\n",
-    "**Time Complexity**:\n",
-    "1. **Finding the Middle of the Linked List**: In this step, we use two pointers, one moving one step at a time (`slow`) and the other moving two steps at a time (`fast`). This process takes $O(N/2)$ time, where $N$ is the number of nodes in the linked list.\n",
-    "\n",
-    "2. **Splitting the List**: After finding the middle, we split the list into two halves by setting the `next` pointer of the node before the middle node to `None`. This step takes $O(1)$ time.\n",
-    "\n",
-    "3. **Reversing the Second Half**: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes $O(N/2)$ time.\n",
-    "\n",
-    "4. **Merging the Two Halves Alternately**: In this step, we merge the two halves alternately by adjusting the `next` pointers of the nodes. We iterate through both halves once, so this step takes $O(N/2)$ time.\n",
-    "\n",
-    "Overall, the time complexity of the `reorderList` function is dominated by the steps involving reversing and merging the two halves, both of which take $O(N/2)$ time. Therefore, the total time complexity is $O(N)$.\n",
-    "\n",
-    "**Space Complexity**:\n",
-    "The space complexity of the `reorderList` function is primarily determined by the variables and data structures used within the function. Let's break down the space complexity components:\n",
-    "\n",
-    "1. **Constant Space Variables**: The variables `slow`, `fast`, `prev`, `current`, `next_node`, `p1`, and `p2` are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute $O(1)$ to the space complexity.\n",
-    "\n",
-    "2. **Split Linked Lists**: In the splitting step, we create two new linked list segments (`first_half` and `second_half`) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, $O(N/2)$. \n",
-    "\n",
-    "3. **Reversed Second Half**: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn't contribute to additional space complexity.\n",
-    "\n",
-    "4. **Overall**: Combining the above components, the total space complexity is $O(N/2)$, which simplifies to $O(N)$ in terms of space complexity.\n",
-    "\n",
-    "**In summary**, the `reorderList` function has a time complexity of $O(N)$ and a space complexity of $O(N)$ due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Reorder by K Elements:** Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by $K$ elements at a time. For example, for $K=3$, you would reorder it as ($L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...$).\n",
-    "You may need to handle cases where the number of nodes is not a multiple of $K$.\n",
-    "\n",
-    "2. **Reorder by Odd and Even Nodes:** Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, ($L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...$)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb b/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb
deleted file mode 100644
index 73dbf66..0000000
--- a/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb	
+++ /dev/null
@@ -1,268 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 19. Remove Nth Node From End of List\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Remove Nth Node From End of List problem on LeetCode, click here!](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the head of a linked list, remove the $n^{th}$ node from the end of the list and return its head.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is `sz`.\n",
-    "- `1 <= sz <= 30`\n",
-    "- `0 <= Node.val <= 100`\n",
-    "- `1 <= n <= sz`\n",
-    "\n",
-    "**Follow up:** Could you do this in one pass?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def removeNthFromEnd(head, n):\n",
-    "    # Create a dummy node to handle the case of removing the head node.\n",
-    "    dummy = ListNode(0)\n",
-    "    dummy.next = head\n",
-    "    first = dummy\n",
-    "    second = dummy\n",
-    "    \n",
-    "    # Advance the first pointer by n+1 nodes.\n",
-    "    for _ in range(n + 1):\n",
-    "        first = first.next\n",
-    "    \n",
-    "    # Move both pointers simultaneously until first reaches the end.\n",
-    "    while first is not None:\n",
-    "        first = first.next\n",
-    "        second = second.next\n",
-    "    \n",
-    "    # Remove the nth node by updating the next pointer of the previous node.\n",
-    "    second.next = second.next.next\n",
-    "    \n",
-    "    return dummy.next  # Return the modified head of the linked list"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a `ListNode` class to represent individual nodes in a linked list. Each node has two attributes: `val` (the value of the node) and `next` (a reference to the next node in the list).\n",
-    "\n",
-    "2. The `removeNthFromEnd` function takes the head of a linked list (`head`) and the value `n`, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.\n",
-    "\n",
-    "3. We create a dummy node (`dummy`) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.\n",
-    "\n",
-    "4. We initialize two pointers, `first` and `second`, both initially pointing to the dummy node.\n",
-    "\n",
-    "5. To advance the `first` pointer by `n+1` nodes, we use a `for` loop. This positions the `first` pointer `n` nodes ahead of the `second` pointer.\n",
-    "\n",
-    "6. We then move both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This ensures that the `second` pointer ends up pointing to the node that needs to be removed.\n",
-    "\n",
-    "7. To remove the nth node from the end, we update the `next` pointer of the node pointed to by the `second` pointer to skip over the node to be removed.\n",
-    "\n",
-    "8. Finally, we return `dummy.next`, which is the modified head of the linked list without the removed node.\n",
-    "\n",
-    "9. Additionally, there are two helper functions:\n",
-    "   - `createLinkedList(values)` creates a linked list from a list of values.\n",
-    "   - `convertToList(head)` converts a linked list back into a list of values."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list from a list of values.\n",
-    "def createLinkedList(values):\n",
-    "    if not values:\n",
-    "        return None\n",
-    "    head = ListNode(values[0])\n",
-    "    current = head\n",
-    "    for val in values[1:]:\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "    return head\n",
-    "\n",
-    "# Helper function to convert a linked list to a list of values.\n",
-    "def convertToList(head):\n",
-    "    result = []\n",
-    "    current = head\n",
-    "    while current:\n",
-    "        result.append(current.val)\n",
-    "        current = current.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the two helper functions:\n",
-    "\n",
-    "1. `createLinkedList(values)`: This function creates a linked list from a list of values.\n",
-    "\n",
-    "   - Input: `values` is a list containing values that you want to insert into the linked list.\n",
-    "   - Output: The function returns the head of the created linked list.\n",
-    "\n",
-    "   Explanation:\n",
-    "   - The function starts by checking if the `values` list is empty. If it is, it returns `None` to indicate an empty linked list.\n",
-    "   - If the `values` list is not empty, it creates the first node of the linked list with the value from the first element of `values`.\n",
-    "   - It then iterates through the remaining elements of `values` and creates new nodes for each value, connecting them together using the `next` attribute to form a linked list.\n",
-    "   - Finally, it returns the head of the linked list, which is the first node created.\n",
-    "   \n",
-    "\n",
-    "2. `convertToList(head)`: This function converts a linked list into a list of values.\n",
-    "\n",
-    "   - Input: `head` is the head node of the linked list that you want to convert.\n",
-    "   - Output: The function returns a list containing the values of the nodes in the linked list in order.\n",
-    "\n",
-    "   Explanation:\n",
-    "   - The function starts by initializing an empty list, `result`, to store the values of the linked list nodes.\n",
-    "   - It then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - The iteration continues until it reaches the end of the linked list (i.e., the `next` attribute of the current node becomes `None`).\n",
-    "   - After the iteration is complete, the function returns the `result` list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.\n",
-    "\n",
-    "These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 2, 3, 5]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "head1 = createLinkedList([1, 2, 3, 4, 5])\n",
-    "n1 = 2\n",
-    "new_head1 = removeNthFromEnd(head1, n1)\n",
-    "print(convertToList(new_head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "head2 = createLinkedList([1])\n",
-    "n2 = 1\n",
-    "new_head2 = removeNthFromEnd(head2, n2)\n",
-    "print(convertToList(new_head2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "head3 = createLinkedList([1, 2])\n",
-    "n3 = 1\n",
-    "new_head3 = removeNthFromEnd(head3, n3)\n",
-    "print(convertToList(new_head3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Certainly! Let's analyze the time and space complexity of the `removeNthFromEnd` function in isolation:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The `removeNthFromEnd` function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length $N$.\n",
-    "- The first pass positions the `first` pointer $n$ nodes ahead of the `second` pointer. This pass takes $O(N)$ time because it involves iterating through all N nodes.\n",
-    "- The second pass moves both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This also takes $O(N)$ time in the worst case.\n",
-    "- Therefore, the overall time complexity of the `removeNthFromEnd` function is $O(N)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The `removeNthFromEnd` function uses a constant amount of extra space for its variables (e.g., `first`, `second`, and `dummy`). This space usage does not depend on the size of the linked list.\n",
-    "- The space complexity is $O(1)$, indicating that the space used by the function is constant and independent of the size of the input linked list.\n",
-    "\n",
-    "**In summary**, the `removeNthFromEnd` function has a time complexity of $O(N)$ and a space complexity of $O(1)$. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb b/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb
deleted file mode 100644
index 09de0a3..0000000
--- a/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb	
+++ /dev/null
@@ -1,297 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 206. Reverse Linked List\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Reverse Linked List problem on LeetCode, click here!](https://leetcode.com/problems/reverse-linked-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the `head` of a singly linked list, reverse the list, and return the reversed list.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is the range `[0, 5000]`.\n",
-    "- `-5000 <= Node.val <= 5000`\n",
-    "\n",
-    "**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "# Function to reverse a linked list iteratively\n",
-    "def reverseListIterative(head):\n",
-    "    prev = None\n",
-    "    current = head\n",
-    "    \n",
-    "    while current:\n",
-    "        next_node = current.next\n",
-    "        current.next = prev\n",
-    "        prev = current\n",
-    "        current = next_node\n",
-    "    \n",
-    "    return prev\n",
-    "\n",
-    "# Function to reverse a linked list recursively\n",
-    "def reverseListRecursive(head):\n",
-    "    if not head or not head.next:\n",
-    "        return head\n",
-    "\n",
-    "    new_head = reverseListRecursive(head.next)\n",
-    "    head.next.next = head\n",
-    "    head.next = None\n",
-    "\n",
-    "    return new_head"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `reverseListIterative(head)`: This function reverses a linked list iteratively using a loop. Here's a step-by-step explanation:\n",
-    "\n",
-    "   - It takes the `head` of the input linked list as a parameter.\n",
-    "   - It initializes two pointers, `prev` and `current`, initially set to `None` and the `head` of the list, respectively.\n",
-    "   - It enters a `while` loop that continues until `current` reaches the end of the list (i.e., becomes `None`).\n",
-    "   - Inside the loop:\n",
-    "     - It stores the `next_node` which is the next node after `current`.\n",
-    "     - It updates the `next` pointer of `current` to point to the `prev` node. This effectively reverses the link direction.\n",
-    "     - It moves `prev` to `current` and `current` to `next_node`, advancing the pointers one step further in the list.\n",
-    "   - Once the loop completes, `prev` will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns `prev`.\n",
-    "\n",
-    "2. `reverseListRecursive(head)`: This function reverses a linked list recursively. Here's how it works:\n",
-    "\n",
-    "   - It takes the `head` of the input linked list as a parameter.\n",
-    "   - The base case is checked: if `head` is `None` or `head.next` is `None`, meaning the list is empty or has only one node, it returns `head` as there's no need to reverse a list with zero or one element.\n",
-    "   - In the recursive case:\n",
-    "     - It calls itself with `head.next`, effectively moving down the list until it reaches the end.\n",
-    "     - Once it reaches the end, it starts reversing the links:\n",
-    "       - `head.next.next` is set to `head`, reversing the link between `head` and the next node.\n",
-    "       - `head.next` is set to `None` to avoid cycles.\n",
-    "   - Finally, it returns the new head of the reversed list, which will be the last node of the original list.\n",
-    "\n",
-    "**In summary,** `reverseListIterative` reverses the linked list by iterating through it and changing the next pointers, while `reverseListRecursive` reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list from a list of values\n",
-    "def createLinkedList(values):\n",
-    "    if not values:\n",
-    "        return None\n",
-    "    head = ListNode(values[0])\n",
-    "    current = head\n",
-    "    for val in values[1:]:\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "    return head\n",
-    "\n",
-    "# Helper function to convert a linked list to a list for testing\n",
-    "def linkedListToList(head):\n",
-    "    result = []\n",
-    "    current = head\n",
-    "    while current:\n",
-    "        result.append(current.val)\n",
-    "        current = current.next\n",
-    "    return result\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the two helper functions used in the provided code:\n",
-    "\n",
-    "1. `createLinkedList(values)`:\n",
-    "\n",
-    "   - Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.\n",
-    "\n",
-    "   - How it works:\n",
-    "     - It first checks if the input list `values` is empty. If it's empty, it returns `None` to indicate an empty linked list.\n",
-    "     - If `values` is not empty, it initializes a `head` node with the value of the first element in `values`.\n",
-    "     - It then iterates through the remaining values in `values`, creating new nodes for each value and linking them together to form a linked list.\n",
-    "     - Finally, it returns the `head` node of the newly created linked list.\n",
-    "\n",
-    "2. `linkedListToList(head)`:\n",
-    "\n",
-    "   - Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.\n",
-    "\n",
-    "   - How it works:\n",
-    "     - It takes the `head` of the linked list as input.\n",
-    "     - It initializes an empty list called `result`.\n",
-    "     - It then iterates through the linked list, starting from `head`, and appends each node's `val` (value) to the `result` list.\n",
-    "     - This process continues until the end of the linked list is reached.\n",
-    "     - Finally, it returns the `result` list, which contains the values from the linked list in the same order.\n",
-    "\n",
-    "These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[5, 4, 3, 2, 1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: Iterative\n",
-    "head1 = [1,2,3,4,5]\n",
-    "head1 = createLinkedList(head1)\n",
-    "reversed_head1 = reverseListIterative(head1)\n",
-    "print(linkedListToList(reversed_head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[2, 1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: Recursive\n",
-    "head2 = [1,2]\n",
-    "head2 = createLinkedList(head2)\n",
-    "reversed_head2 = reverseListRecursive(head2)\n",
-    "print(linkedListToList(reversed_head2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3: Empty list\n",
-    "head3 = []\n",
-    "head3 = createLinkedList(head3)\n",
-    "reversed_head3 = reverseListIterative(head3)\n",
-    "print(linkedListToList(reversed_head3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the two functions:\n",
-    "\n",
-    "1. `reverseListIterative(head)`:\n",
-    "\n",
-    "   - Time Complexity: $O(n)$\n",
-    "     - The iterative function visits each node in the linked list exactly once in a single pass, where \"$n$\" is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.\n",
-    "\n",
-    "   - Space Complexity: $O(1)$\n",
-    "     - This function uses a constant amount of extra space for the `prev`, `current`, and `next_node` pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.\n",
-    "\n",
-    "2. `reverseListRecursive(head)`:\n",
-    "\n",
-    "   - Time Complexity: $O(n)$\n",
-    "     - The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is $O(n)$, where \"$n$\" is the number of nodes.\n",
-    "\n",
-    "   - Space Complexity: $O(n)$\n",
-    "     - The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has \"$n$\" nodes, it will create \"$n$\" recursive function calls on the stack, resulting in a space complexity of $O(n)$. This is because each function call stores information about its state, including the `head` pointer, until it reaches the base case and starts returning.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "- The time complexity of both functions is $O(n)$ because they both visit each node once.\n",
-    "- The space complexity of `reverseListIterative` is $O(1)$ because it uses a constant amount of extra space.\n",
-    "- The space complexity of `reverseListRecursive` is $O(n)$ due to the recursive function calls and the associated call stack space.\n",
-    "\n",
-    "Both functions are efficient in terms of time complexity, but `reverseListIterative` is more memory-efficient because it uses a constant amount of additional space, while `reverseListRecursive` uses space on the call stack proportional to the number of nodes in the list."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K-Group Reverse:** Modify the reverseListIterative function to reverse the linked list in groups of $K$ elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and $K$ is 3, the output should be [3, 2, 1, 6, 5, 4].\n",
-    "\n",
-    "2. **Rotate Linked List:** Write a function to rotate a linked list to the right by $K$ places. For example, if the input is [1, 2, 3, 4, 5] and $K$ is 2, the output should be [4, 5, 1, 2, 3]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb b/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb
deleted file mode 100644
index b433cf3..0000000
--- a/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 21. Merge Two Sorted Lists\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Merge Two Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-two-sorted-lists/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given the heads of two sorted linked lists `list1` and `list2`.\n",
-    "\n",
-    "Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists.\n",
-    "\n",
-    "*Return the head of the merged linked list.*\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in both lists is in the range `[0, 50]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "- Both `list1` and `list2` are sorted in non-decreasing order."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def mergeTwoLists(list1, list2):\n",
-    "    # Create a dummy node to simplify the code.\n",
-    "    dummy = ListNode()\n",
-    "    current = dummy\n",
-    "\n",
-    "    while list1 and list2:\n",
-    "        if list1.val < list2.val:\n",
-    "            current.next = list1\n",
-    "            list1 = list1.next\n",
-    "        else:\n",
-    "            current.next = list2\n",
-    "            list2 = list2.next\n",
-    "        current = current.next\n",
-    "\n",
-    "    # Append the remaining elements from either list.\n",
-    "    if list1:\n",
-    "        current.next = list1\n",
-    "    else:\n",
-    "        current.next = list2\n",
-    "\n",
-    "    return dummy.next"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a class `ListNode` to represent the nodes of a singly-linked list. Each node has a `val` attribute to store the value of the node and a `next` attribute to point to the next node in the list.\n",
-    "\n",
-    "2. We define the `mergeTwoLists` function that takes two linked list heads, `list1` and `list2`, as input.\n",
-    "\n",
-    "3. We create a `dummy` node at the beginning of the merged list. The `dummy` node simplifies the code by serving as a placeholder, and its `next` attribute will point to the actual merged list.\n",
-    "\n",
-    "4. We initialize a `current` pointer to point to the `dummy` node initially. This `current` pointer helps us traverse and build the merged list.\n",
-    "\n",
-    "5. We enter a `while` loop that continues until either `list1` or `list2` becomes empty. Inside the loop, we compare the values of the nodes at the current positions of `list1` and `list2`.\n",
-    "\n",
-    "6. If the `val` of the node in `list1` is smaller than the `val` of the node in `list2`, we attach the node from `list1` to the merged list by updating the `next` attribute of the `current` node to point to the node in `list1`. We then move the `list1` pointer to the next node.\n",
-    "\n",
-    "7. If the `val` of the node in `list2` is smaller than or equal to the `val` of the node in `list1`, we attach the node from `list2` to the merged list in a similar manner. We move the `list2` pointer to the next node.\n",
-    "\n",
-    "8. After attaching a node to the merged list, we move the `current` pointer to the newly added node. This step is essential for keeping track of the end of the merged list.\n",
-    "\n",
-    "9. The loop continues until either `list1` or `list2` becomes empty.\n",
-    "\n",
-    "10. Once the loop exits, we check if there are any remaining elements in `list1` or `list2`. If `list1` is not empty, we attach the remaining elements of `list1` to the merged list. If `list2` is not empty, we attach the remaining elements of `list2`.\n",
-    "\n",
-    "11. Finally, we return the `next` attribute of the `dummy` node as the head of the merged list, which represents the sorted merged list."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to print the linked list\n",
-    "def printLinkedList(head):\n",
-    "    result = []\n",
-    "    while head:\n",
-    "        result.append(head.val)\n",
-    "        head = head.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the helper functions:\n",
-    "**printLinkedList Function**:\n",
-    "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-    "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-    "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-    "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-    "\n",
-    "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[1, 1, 2, 3, 4, 4]"
-      ]
-     },
-     "execution_count": 3,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "# Input: list1 = [1,2,4], list2 = [1,3,4]\n",
-    "list1 = ListNode(1, ListNode(2, ListNode(4)))\n",
-    "list2 = ListNode(1, ListNode(3, ListNode(4)))\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[]"
-      ]
-     },
-     "execution_count": 4,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "# Input: list1 = [], list2 = []\n",
-    "list1 = None\n",
-    "list2 = None\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[0]"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# list1 = [], list2 = [0]\n",
-    "list1 = None\n",
-    "list2 = ListNode(0)\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `mergeTwoLists` function.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this function is $O(N + M$), where $N$ and $M$ are the lengths of `list1` and `list2`, respectively. Here's why:\n",
-    "\n",
-    "1. In the worst case, we need to traverse both `list1` and `list2` completely. This involves iterating through all the nodes in both lists once.\n",
-    "\n",
-    "2. The while loop runs until either `list1` or `list2` becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.\n",
-    "\n",
-    "3. Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.\n",
-    "\n",
-    "Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of $O(N + M)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this function is $O(1)$, which means it uses a constant amount of extra space regardless of the input sizes. Here's why:\n",
-    "\n",
-    "1. We create a few extra pointers (`dummy`, `current`) and temporary variables (`val`) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of `list1` and `list2`.\n",
-    "\n",
-    "2. We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from `list1` and `list2` to form the merged list. This operation does not consume additional memory proportional to the input sizes.\n",
-    "\n",
-    "**In summary**, the `mergeTwoLists` function has a time complexity of $O(N + M)$ and a space complexity of $O(1)$, making it an efficient solution for merging two sorted linked lists."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Merge K Sorted Lists:** Extend the problem to merge $K$ sorted linked lists instead of just two. You need to efficiently merge $K$ lists into one sorted list.\n",
-    "\n",
-    "2. **Merge Lists in a Zigzag Pattern:** Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb b/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb
deleted file mode 100644
index 0568867..0000000
--- a/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 23. Merge k Sorted Lists\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Merge k Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-k-sorted-lists/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given an array of $k$ linked-lists lists, each linked-list is sorted in ascending order.\n",
-    "\n",
-    "Merge all the linked-lists into one sorted linked-list and return it.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `k == lists.length`\n",
-    "- 0 <= k <= $10^4$\n",
-    "- `0 <= lists[i].length <= 500`\n",
-    "- $-10^4$ <= lists[i][j] <= $10^4$\n",
-    "- `lists[i]` is sorted in ascending order.\n",
-    "- The sum of `lists[i].length` will not exceed $10^4$.\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "     def __init__(self, val=0, next=None):\n",
-    "         self.val = val\n",
-    "         self.next = next\n",
-    "\n",
-    "class Solution:\n",
-    "    def mergeKLists(self, lists: [[ListNode]]) -> ListNode:\n",
-    "        # Check if the input list of linked lists is empty\n",
-    "        if not lists or len(lists) == 0:\n",
-    "            return None\n",
-    "\n",
-    "        # Loop until there is only one merged list left\n",
-    "        while len(lists) > 1:\n",
-    "            mergedLists = []\n",
-    "\n",
-    "            # Merge pairs of lists\n",
-    "            for i in range(0, len(lists), 2):\n",
-    "                l1 = lists[i]\n",
-    "                l2 = lists[i + 1] if (i + 1) < len(lists) else None\n",
-    "                mergedLists.append(self.mergeList(l1, l2))\n",
-    "\n",
-    "            # Update the list of lists with merged results\n",
-    "            lists = mergedLists\n",
-    "        \n",
-    "        # Return the final merged list\n",
-    "        return lists[0]\n",
-    "\n",
-    "    def mergeList(self, l1, l2):\n",
-    "        # Create a dummy node to simplify merging\n",
-    "        dummy = ListNode()\n",
-    "        tail = dummy\n",
-    "\n",
-    "        # Merge the two sorted lists\n",
-    "        while l1 and l2:\n",
-    "            if l1.val < l2.val:\n",
-    "                tail.next = l1\n",
-    "                l1 = l1.next\n",
-    "            else:\n",
-    "                tail.next = l2\n",
-    "                l2 = l2.next\n",
-    "            tail = tail.next\n",
-    "\n",
-    "        # Append any remaining elements from l1 or l2 (if any)\n",
-    "        if l1:\n",
-    "            tail.next = l1\n",
-    "        if l2:\n",
-    "            tail.next = l2\n",
-    "\n",
-    "        # Return the merged result starting from the next of the dummy node\n",
-    "        return dummy.next\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a Python class `Solution` with two methods for merging k sorted linked lists:\n",
-    "\n",
-    "1. `mergeKLists(self, lists: List[ListNode]) -> ListNode`: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.\n",
-    "\n",
-    "2. `mergeList(self, l1, l2)`: This method takes two sorted linked lists, `l1` and `l2`, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.\n",
-    "\n",
-    "Here's a high-level overview of how the code works:\n",
-    "\n",
-    "- The `mergeKLists` method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns `None`.\n",
-    "\n",
-    "- Inside a `while` loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the `lists` array. It does this by iterating through the input lists in pairs and calling the `mergeList` method to merge each pair.\n",
-    "\n",
-    "- The `mergeList` method takes two sorted linked lists, `l1` and `l2`, and merges them into a single sorted linked list. It uses a dummy node (`dummy`) and a `tail` pointer to keep track of the merged list while comparing and merging elements from `l1` and `l2`.\n",
-    "\n",
-    "- After merging all pairs of lists and updating the `lists` array with the merged results, the loop continues until only one merged list remains in the `lists` array.\n",
-    "\n",
-    "- Finally, the `mergeKLists` method returns the merged list.\n",
-    "\n",
-    "Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1 -> 1 -> 2 -> 3 -> 4 -> 4 -> 5 -> 6 -> "
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: lists = [[1,4,5],[1,3,4],[2,6]]\n",
-    "\n",
-    "lists1 = [\n",
-    "    ListNode(1, ListNode(4, ListNode(5))),\n",
-    "    ListNode(1, ListNode(3, ListNode(4))),\n",
-    "    ListNode(2, ListNode(6))\n",
-    "]\n",
-    "solution = Solution()\n",
-    "result1 = solution.mergeKLists(lists1)\n",
-    "\n",
-    "# Print the result\n",
-    "if result1:\n",
-    "    current = result1\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: lists = []\n",
-    "\n",
-    "lists2 = []\n",
-    "solution = Solution()\n",
-    "result2 = solution.mergeKLists(lists2)\n",
-    "\n",
-    "# Print the result\n",
-    "if result2:\n",
-    "    current = result2\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "# Input: lists = [[]]\n",
-    "\n",
-    "lists3 = [None]\n",
-    "solution = Solution()\n",
-    "result3 = solution.mergeKLists(lists3)\n",
-    "\n",
-    "# Print the result\n",
-    "if result3:\n",
-    "    current = result3\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. **Heap Initialization:** The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes $O(1)$ time.\n",
-    "\n",
-    "2. **Merging:** The merging operation is performed in a divide-and-conquer fashion. In each iteration of the `while` loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists ($n$). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is $O(log\\ k)$.\n",
-    "\n",
-    "   Therefore, the overall time complexity of the code is $O(n * log\\ k)$, where n is the total number of nodes across all lists, and $k$ is the number of linked lists.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. **Heap Space:** The code doesn't use a heap data structure, so there's no additional space complexity due to a heap.\n",
-    "\n",
-    "2. **Merged Lists:** In the `mergeList` method, we create a new merged list. However, this list is not stored in memory for all lists; it's replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is $O(n)$ in the worst case.\n",
-    "\n",
-    "3. **Additional Variables:** The code uses a few additional variables, such as `dummy` and `tail`, but these occupy a constant amount of space and don't depend on the input size.\n",
-    "\n",
-    "   Therefore, the overall space complexity of the code is $O(n)$, where n is the total number of nodes across all lists.\n",
-    "\n",
-    "In summary, the code's time complexity is $O(n * log(k))$, and its space complexity is $O(n)$. This code efficiently merges $k$ sorted linked lists using a divide-and-conquer approach with a relatively low space overhead."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb b/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb
deleted file mode 100644
index 2238b48..0000000
--- a/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 100: Same Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-    "\n",
-    "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-    "\n",
-    "**Constraints**\n",
-    "\n",
-    "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-    "2. $-10^4$ <= Node.val <= $10^4$\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def isSameTree(p, q):\n",
-    "    # Base case: If both p and q are None, the trees are the same.\n",
-    "    if not p and not q:\n",
-    "        return True\n",
-    "    \n",
-    "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-    "    if not p or not q:\n",
-    "        return False\n",
-    "    \n",
-    "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-    "    if p.val != q.val:\n",
-    "        return False\n",
-    "    \n",
-    "    # Recursively check the left and right subtrees of p and q.\n",
-    "    # If both subtrees are the same, the entire trees are the same.\n",
-    "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-    "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-    "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-    "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-    "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-    "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "\n",
-    "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-    "\n",
-    "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "print(isSameTree(p1, q1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "\n",
-    "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-    "\n",
-    "p2 = TreeNode(1, TreeNode(2), None)\n",
-    "q2 = TreeNode(1, None, TreeNode(2))\n",
-    "print(isSameTree(p2, q2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "\n",
-    "#Input: p = [1,2,1], q = [1,1,2]\n",
-    "\n",
-    "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-    "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-    "print(isSameTree(p3, q3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time Complexity\n",
-    "\n",
-    "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-    "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-    "\n",
-    "## Space Complexity\n",
-    "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-    "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-    "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-    "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-    "\n",
-    "## In summary:\n",
-    "\n",
-    "+ **Time Complexity:** $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-    "+ **Space Complexity:** $O(n)$ due to the recursive call stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb
deleted file mode 100644
index 9d2cc7f..0000000
--- a/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb	
+++ /dev/null
@@ -1,263 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 102. Binary Tree Level Order Traversal\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Level Order Traversal problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, return *the level order traversal of its nodes' values*. (i.e., from left to right, level by level).\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-    "- `-1000 <= Node.val <= 1000`\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def levelOrder(root):\n",
-    "    # Check if the tree is empty, if so, return an empty list.\n",
-    "    if not root:\n",
-    "        return []\n",
-    "\n",
-    "    # Initialize an empty list to store the result.\n",
-    "    result = []\n",
-    "    \n",
-    "    # Initialize a queue with the root node to perform BFS.\n",
-    "    queue = [root]\n",
-    "\n",
-    "    while queue:\n",
-    "        # Initialize an empty list to store the values of nodes at the current level.\n",
-    "        level_values = []\n",
-    "        \n",
-    "        # Get the number of nodes at the current level.\n",
-    "        level_size = len(queue)\n",
-    "\n",
-    "        # Iterate through the nodes at the current level.\n",
-    "        for _ in range(level_size):\n",
-    "            # Dequeue the front node from the queue.\n",
-    "            node = queue.pop(0)\n",
-    "            \n",
-    "            # Append the value of the current node to the level_values list.\n",
-    "            level_values.append(node.val)\n",
-    "\n",
-    "            # Enqueue the left and right children of the current node if they exist.\n",
-    "            if node.left:\n",
-    "                queue.append(node.left)\n",
-    "            if node.right:\n",
-    "                queue.append(node.right)\n",
-    "\n",
-    "        # Append the level_values list (values at the current level) to the result list.\n",
-    "        result.append(level_values)\n",
-    "\n",
-    "    # Return the final result, which is a list of lists representing level order traversal.\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a `TreeNode` class that represents a node in the binary tree. Each `TreeNode` object has a value (`val`) and two child nodes: `left` and `right`.\n",
-    "\n",
-    "2. The `levelOrder` function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.\n",
-    "\n",
-    "3. We start by checking if the input `root` is `None`, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.\n",
-    "\n",
-    "4. We initialize an empty list called `result` to store the final result, which will be a list of lists containing node values at each level.\n",
-    "\n",
-    "5. We initialize a queue called `queue` with the root node. This queue will be used for breadth-first traversal of the tree.\n",
-    "\n",
-    "6. We enter a while loop that continues until the `queue` is empty. Inside the loop, we perform the following steps:\n",
-    "\n",
-    "   - We initialize an empty list called `level_values` to store the values of nodes at the current level.\n",
-    "\n",
-    "   - We determine the number of nodes at the current level by getting the length of the `queue`. This is done to process nodes level by level.\n",
-    "\n",
-    "   - We iterate through the nodes at the current level using a for loop. For each node in the current level:\n",
-    "\n",
-    "     - We dequeue (remove) the front node from the `queue`.\n",
-    "\n",
-    "     - We append the value of the dequeued node to the `level_values` list, effectively collecting the values of nodes at the current level.\n",
-    "\n",
-    "     - If the dequeued node has a left child, we enqueue the left child to the `queue`.\n",
-    "\n",
-    "     - If the dequeued node has a right child, we enqueue the right child to the `queue`.\n",
-    "\n",
-    "   - After processing all nodes at the current level, we append the `level_values` list to the `result` list. This represents the values at the current level.\n",
-    "\n",
-    "7. The loop continues until all levels have been traversed, and the `queue` becomes empty.\n",
-    "\n",
-    "8. Finally, we return the `result` list, which contains lists of node values at each level, representing the level order traversal of the binary tree.\n",
-    "\n",
-    "The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[3], [9, 20], [15, 7]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(9)\n",
-    "root.right = TreeNode(20)\n",
-    "root.right.left = TreeNode(15)\n",
-    "root.right.right = TreeNode(7)\n",
-    "\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Using the same tree as before\n",
-    "root = TreeNode(1)\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root = None\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `levelOrder` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.\n",
-    "\n",
-    "In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here's how the space complexity breaks down:\n",
-    "\n",
-    "1. The `result` list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by `result` is O(N).\n",
-    "\n",
-    "2. The `queue` data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by `queue` is O(N).\n",
-    "\n",
-    "Overall, the dominant factor in terms of space complexity is the `queue`, and the space complexity is O(N).\n",
-    "\n",
-    "In summary, the function's time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Reverse Level Order Traversal:** Modify the `levelOrder` function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[15, 7], [9, 20], [3]]`.\n",
-    "\n",
-    "2. **Zigzag Level Order Traversal:** Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[3], [20, 9], [15, 7]]`."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb
deleted file mode 100644
index 87c5eaa..0000000
--- a/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 104. Maximum Depth of Binary Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the `root` of a binary tree, return its maximum depth.\n",
-    "\n",
-    "A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def maxDepth(root):\n",
-    "    # Base case: If the root is None, the depth is 0.\n",
-    "    if root is None:\n",
-    "        return 0\n",
-    "    \n",
-    "    # Recursively calculate the maximum depth of the left and right subtrees.\n",
-    "    left_depth = maxDepth(root.left)\n",
-    "    right_depth = maxDepth(root.right)\n",
-    "    \n",
-    "    # Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.\n",
-    "    return max(left_depth, right_depth) + 1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's go through the code step by step to understand how it works:\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class to represent the nodes of the binary tree. Each node has three attributes:\n",
-    "   - `val`: the value stored in the node.\n",
-    "   - `left`: a reference to the left child node.\n",
-    "   - `right`: a reference to the right child node.\n",
-    "\n",
-    "2. The `maxDepth` function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, `root`, which is the root node of the binary tree.\n",
-    "\n",
-    "3. In the `maxDepth` function, we have a base case:\n",
-    "   - If the `root` is `None`, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.\n",
-    "\n",
-    "4. If the `root` is not `None`, we recursively calculate the maximum depth of the left and right subtrees:\n",
-    "   - We call `maxDepth` on the `root.left` to calculate the maximum depth of the left subtree and store it in the variable `left_depth`.\n",
-    "   - We call `maxDepth` on the `root.right` to calculate the maximum depth of the right subtree and store it in the variable `right_depth`.\n",
-    "\n",
-    "5. Finally, we return the maximum depth of the tree by taking the maximum of `left_depth` and `right_depth` and adding 1 to it. This is because we are counting the current level as well."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: root = [3,9,20,null,null,15,7]\n",
-    "\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(9)\n",
-    "root.right = TreeNode(20)\n",
-    "root.right.left = TreeNode(15)\n",
-    "root.right.right = TreeNode(7)\n",
-    "\n",
-    "print(maxDepth(root))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a230be4f-1f47-4919-87e3-62fc3f072d97",
-   "metadata": {},
-   "source": [
-    "In this example, we create a binary tree based on the given input `[3,9,20,null,null,15,7]` and calculate its maximum depth, which is `3`. The tree structure is as follows:\n",
-    "   ```\n",
-    "       3\n",
-    "      / \\\n",
-    "     9  20\n",
-    "       /  \\\n",
-    "      15   7\n",
-    "   ```\n",
-    "\n",
-    "So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: root = [1,null,2]\n",
-    "\n",
-    "root = TreeNode(1)\n",
-    "root.right = TreeNode(2)\n",
-    "\n",
-    "# Calculate the maximum depth of the tree and print the result\n",
-    "print(maxDepth(root))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The time complexity of the `maxDepth` function is $O(N)$, where $N$ is the number of nodes in the binary tree.\n",
-    "- This is because in the worst case, the function visits every node exactly once in a depth-first manner.\n",
-    "- The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the `maxDepth` function is $O(H)$, where H is the height of the binary tree.\n",
-    "- In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.\n",
-    "- In the best case, if the binary tree is perfectly balanced, the height is $O(log\\ N)$, where $N$ is the number of nodes.\n",
-    "- Therefore, the space complexity can vary from $O(log\\ N)$ to $O(N)$ depending on the shape of the tree.\n",
-    "- In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.\n",
-    "\n",
-    "**In summary:**\n",
-    "- The time complexity of the code is $O(N)$ as it visits each node once.\n",
-    "- The space complexity is $O(H)$, where H is the height of the tree, which can vary from $O(log\\ N)$ to $O(N)$ depending on the tree's shape."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
deleted file mode 100644
index 0d5bbd6..0000000
--- a/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb	
+++ /dev/null
@@ -1,305 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 105. Construct Binary Tree from Preorder and Inorder Traversal\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n",
-    "\n",
-    "---\n",
-    "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return *the binary tree.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= preorder.length <= 3000`\n",
-    "- `inorder.length == preorder.length`\n",
-    "- `-3000 <= preorder[i], inorder[i] <= 3000`\n",
-    "- `preorder` and `inorder` consist of **unique** values.\n",
-    "- Each value of `inorder` also appears in `preorder`.\n",
-    "- `preorder` is **guaranteed** to be the preorder traversal of the tree.\n",
-    "- `inorder` is **guaranteed** to be the inorder traversal of the tree.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def buildTree(preorder, inorder):\n",
-    "    if not preorder:\n",
-    "        return None\n",
-    "\n",
-    "    # The first element in the preorder traversal is the root of the current subtree\n",
-    "    root_val = preorder[0]\n",
-    "    root = TreeNode(root_val)\n",
-    "\n",
-    "    # Find the index of the root value in the inorder traversal\n",
-    "    root_idx_inorder = inorder.index(root_val)\n",
-    "\n",
-    "    # Recursively build left and right subtrees\n",
-    "    root.left = buildTree(preorder[1:1 + root_idx_inorder], inorder[:root_idx_inorder])\n",
-    "    root.right = buildTree(preorder[1 + root_idx_inorder:], inorder[root_idx_inorder + 1:])\n",
-    "\n",
-    "    return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `class TreeNode:`: This is a class definition for a binary tree node. It has three attributes:\n",
-    "   - `val`: The value of the node.\n",
-    "   - `left`: A reference to the left child node.\n",
-    "   - `right`: A reference to the right child node.\n",
-    "\n",
-    "   This class is used to create instances of binary tree nodes, which will be used to build the binary tree.\n",
-    "\n",
-    "2. `def buildTree(preorder, inorder):`: This is the main function that constructs a binary tree from its preorder and inorder traversals.\n",
-    "\n",
-    "   - `preorder`: A list representing the preorder traversal of the binary tree.\n",
-    "   - `inorder`: A list representing the inorder traversal of the binary tree.\n",
-    "\n",
-    "3. `if not preorder: return None`: This line checks if the `preorder` list is empty. If it is, it means there are no nodes to construct, so the function returns `None`.\n",
-    "\n",
-    "4. `root_val = preorder[0]`: The value of the root node is extracted from the first element of the `preorder` list.\n",
-    "\n",
-    "5. `root = TreeNode(root_val)`: A new `TreeNode` object is created with the `root_val` as its value. This represents the root of the current subtree.\n",
-    "\n",
-    "6. `root_idx_inorder = inorder.index(root_val)`: The index of the `root_val` in the `inorder` list is found. This index indicates the position of the root node in the inorder traversal.\n",
-    "\n",
-    "7. `root.left`: The left subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The left subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists up to the `root_idx_inorder`.\n",
-    "\n",
-    "8. `root.right`: The right subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The right subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists starting from `root_idx_inorder + 1`.\n",
-    "\n",
-    "9. Finally, the function returns the `root` of the subtree it just constructed.\n",
-    "\n",
-    "The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "2d82857b-4fbe-474f-bf33-17b55c20147b",
-   "metadata": {},
-   "source": [
-    "## Helper Function \n",
-    "\n",
-    "Here is a helper function to represent the binary tree elements."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "13e6f3e1-659d-479d-9521-75629b8c782f",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def treeToList(root):\n",
-    "    # Initialize an empty list to store the elements of the binary tree\n",
-    "    result = []\n",
-    "    \n",
-    "    # Initialize a queue for level-order traversal starting with the root\n",
-    "    queue = [root]\n",
-    "\n",
-    "    while queue:\n",
-    "        # Pop the front node from the queue\n",
-    "        node = queue.pop(0)\n",
-    "        \n",
-    "        # If the node is not None (i.e., a valid node), add its value to the result list\n",
-    "        if node:\n",
-    "            result.append(node.val)\n",
-    "            \n",
-    "            # Add the left and right children of the node to the queue\n",
-    "            queue.append(node.left)\n",
-    "            queue.append(node.right)\n",
-    "        else:\n",
-    "            # If the node is None, add None to the result to represent an empty node\n",
-    "            result.append(None)\n",
-    "\n",
-    "    # Remove any trailing None values from the result list\n",
-    "    while result and result[-1] is None:\n",
-    "        result.pop()\n",
-    "\n",
-    "    # Return the resulting list representing the binary tree elements\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "86cd4c9d-a120-4dd1-a1bd-530436012574",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's break down the `treeToList` helper function step by step:\n",
-    "\n",
-    "1. `def treeToList(root):`: This function takes the root of a binary tree as input and converts it into a list.\n",
-    "\n",
-    "2. `result = []`: Initialize an empty list called `result` to store the elements of the binary tree in list format.\n",
-    "\n",
-    "3. `queue = [root]`: Initialize a queue data structure for a level-order traversal, starting with the root node.\n",
-    "\n",
-    "4. `while queue:`: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.\n",
-    "\n",
-    "5. `node = queue.pop(0)`: Dequeue the first node from the queue, effectively processing it.\n",
-    "\n",
-    "6. `if node:`: Check if the `node` is not None, which means it's a valid node in the binary tree.\n",
-    "\n",
-    "    a. `result.append(node.val)`: If the node is valid, append its value (`node.val`) to the `result` list. This represents the value of the current node in the binary tree.\n",
-    "\n",
-    "    b. `queue.append(node.left)`: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.\n",
-    "\n",
-    "    c. `queue.append(node.right)`: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.\n",
-    "\n",
-    "7. `else:`: If the `node` is None, it represents an empty node in the binary tree.\n",
-    "\n",
-    "    a. `result.append(None)`: Append `None` to the `result` list to indicate an empty node.\n",
-    "\n",
-    "8. `while result and result[-1] is None:`: After the traversal is complete, there might be trailing `None` values in the `result` list. This loop removes any such trailing `None` values to ensure a clean representation of the tree's elements.\n",
-    "\n",
-    "9. `return result`: Return the `result` list, which now contains the elements of the binary tree in a format where `None` represents empty nodes and the order of elements reflects a level-order traversal of the tree.\n",
-    "\n",
-    "In summary, the `treeToList` function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node's value or represents an empty node with `None`. This list represents the binary tree's elements in a structured format."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[3, 9, 20, None, None, 15, 7]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "preorder = [3, 9, 20, 15, 7]\n",
-    "inorder = [9, 3, 15, 20, 7]\n",
-    "result = buildTree(preorder, inorder)\n",
-    "\n",
-    "print(treeToList(result))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[-1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "preorder = [-1]\n",
-    "inorder = [-1]\n",
-    "result = buildTree(preorder, inorder)\n",
-    "\n",
-    "print(treeToList(result))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `buildTree` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of the `buildTree` function can be analyzed in terms of the number of nodes in the binary tree. Let's assume there are `n` nodes in the binary tree.\n",
-    "\n",
-    "1. Finding the root value in the `preorder` traversal takes O(1) time as it's just extracting the first element from the list.\n",
-    "2. Finding the index of the root value in the `inorder` traversal using `inorder.index(root_val)` takes O(n) time in the worst case because in the worst case, it might have to search through all `n` elements in the `inorder` list to find the index.\n",
-    "3. The recursive calls to `buildTree` for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.\n",
-    "\n",
-    "The total time complexity of the `buildTree` function is O(n) due to the recursive calls and finding the root's index in the `inorder` list.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity is determined by the space used by the function's call stack during recursion and any additional data structures used. \n",
-    "\n",
-    "1. The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.\n",
-    "\n",
-    "2. Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).\n",
-    "\n",
-    "Overall, the space complexity of the `buildTree` function is O(n) due to the space used by the call stack and the TreeNode objects.\n",
-    "\n",
-    "In summary, the time complexity of `buildTree` is O(n), and the space complexity is O(n), where 'n' is the number of nodes in the binary tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Construct Binary Tree from Postorder and Inorder Traversal:**\n",
-    "   Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to `buildTree` but for postorder and inorder traversals.\n",
-    "\n",
-    "2. **Reconstruct Binary Tree with Duplicate Values:**\n",
-    "   Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
deleted file mode 100644
index b661fa1..0000000
--- a/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 124. Binary Tree Maximum Path Sum\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n",
-    "\n",
-    "---\n",
-    "A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.\n",
-    "\n",
-    "The **path sum** of a path is the sum of the node's values in the path.\n",
-    "\n",
-    "Given the `root` of a binary tree, return *the maximum **path sum** of any **non-empty** path*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[1, 3*10^4]$.\n",
-    "- `-1000 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.\n",
-    "\n",
-    "In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.\n",
-    "\n",
-    "To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:\n",
-    "\n",
-    "1. Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.\n",
-    "\n",
-    "2. Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.\n",
-    "\n",
-    "To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.\n",
-    "\n",
-    "Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.\n",
-    "\n",
-    "The constraints for this problem include:\n",
-    "\n",
-    "- The number of nodes in the tree is in the range $[1, 3 * 10^4]$.\n",
-    "- Node values are in the range [-1000, 1000].\n",
-    "\n",
-    "By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "class Solution:\n",
-    "    def maxPathSum(self, root):\n",
-    "        def max_path_sum_helper(node):\n",
-    "            if not node:\n",
-    "                return 0\n",
-    "            \n",
-    "            # Recursively calculate the maximum path sum for left and right subtrees\n",
-    "            left_max = max(0, max_path_sum_helper(node.left))\n",
-    "            right_max = max(0, max_path_sum_helper(node.right))\n",
-    "            \n",
-    "            # Update the global maximum path sum\n",
-    "            self.max_sum = max(self.max_sum, left_max + right_max + node.val)\n",
-    "            \n",
-    "            # Return the maximum path sum starting from the current node\n",
-    "            return max(left_max, right_max) + node.val\n",
-    "        \n",
-    "        self.max_sum = float('-inf')  # Initialize the global maximum to negative infinity\n",
-    "        max_path_sum_helper(root)  # Start the recursive traversal from the root\n",
-    "        return self.max_sum"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The code starts by defining a `TreeNode` class to represent nodes in the binary tree. Each `TreeNode` has a `val` attribute representing its value, a `left` attribute pointing to the left child, and a `right` attribute pointing to the right child.\n",
-    "\n",
-    "2. Next, a `Solution` class is defined to contain the `maxPathSum` method, which will be used to find the maximum path sum in the binary tree.\n",
-    "\n",
-    "3. Within the `maxPathSum` method, a helper function called `max_path_sum_helper` is defined. This recursive function takes a single argument, `node`, which is the current node being considered during traversal.\n",
-    "\n",
-    "4. Inside the `max_path_sum_helper` function:\n",
-    "   - If `node` is `None` (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.\n",
-    "   - It calculates the maximum path sum starting from the left subtree (`left_max`) and the right subtree (`right_max`). Importantly, it uses `max(0, ...)` to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree's path sum is negative, it's better to not include it in the path.\n",
-    "   - The code then updates the global maximum path sum (`self.max_sum`) by checking if the sum of `left_max`, `right_max`, and the current node's value is greater than the current maximum.\n",
-    "   - Finally, it returns the maximum path sum starting from the current node, which is the maximum of `left_max` and `right_max` plus the current node's value.\n",
-    "\n",
-    "5. Before calling the `max_path_sum_helper` function, the `max_sum` attribute of the `Solution` class is initialized to negative infinity (`float('-inf')`). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of `max_sum`.\n",
-    "\n",
-    "6. The `max_path_sum_helper` function is called with the root of the binary tree, effectively starting the traversal from the root node.\n",
-    "\n",
-    "7. Once the traversal is complete, the method returns the value of `self.max_sum`, which contains the maximum path sum found in the binary tree.\n",
-    "\n",
-    "8. Example usage at the bottom of the code demonstrates how to create binary trees and use the `maxPathSum` method to find the maximum path sum for two different tree structures.\n",
-    "\n",
-    "In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "6\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "root1 = TreeNode(1)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(3)\n",
-    "solution = Solution()\n",
-    "print(solution.maxPathSum(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "42\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "root2 = TreeNode(-10)\n",
-    "root2.left = TreeNode(9)\n",
-    "root2.right = TreeNode(20)\n",
-    "root2.right.left = TreeNode(15)\n",
-    "root2.right.right = TreeNode(7)\n",
-    "print(solution.maxPathSum(root2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "Time Complexity:\n",
-    "- The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.\n",
-    "- During the traversal, for each node, we perform constant time operations, such as updating the `max_sum` variable and calculating the maximum path sum starting from that node.\n",
-    "- Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.\n",
-    "\n",
-    "Space Complexity:\n",
-    "- The space complexity of the code is determined by the space used in the call stack during the recursive traversal.\n",
-    "- In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).\n",
-    "- Additionally, the code uses a constant amount of space for variables like `left_max`, `right_max`, and `max_sum`.\n",
-    "- Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it's O(N), and in the best case (a balanced binary tree), it's O(log N).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree's balance."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Print the Maximum Path:**\n",
-    "   Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.\n",
-    "\n",
-    "2. **Path Sum Count:**\n",
-    "   Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb b/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb
deleted file mode 100644
index 5bbdf42..0000000
--- a/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 199. Binary Tree Right Side View\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Right Side View problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-right-side-view/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return *the values of the nodes you can see ordered from top to bottom*.\n",
-    "\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def rightSideView(root):\n",
-    "    if not root:\n",
-    "        return []  # If the tree is empty, return an empty list.\n",
-    "\n",
-    "    result = []  # Initialize a list to store the right side view values.\n",
-    "    queue = [root]  # Initialize a queue for level-order traversal with the root node.\n",
-    "\n",
-    "    while queue:\n",
-    "        # Get the number of nodes at the current level.\n",
-    "        level_size = len(queue)\n",
-    "\n",
-    "        # Traverse all nodes at the current level and add the rightmost node to the result.\n",
-    "        for i in range(level_size):\n",
-    "            node = queue.pop(0)  # Dequeue the first node from the queue.\n",
-    "\n",
-    "            # If it's the rightmost node at this level, add its value to the result.\n",
-    "            if i == level_size - 1:\n",
-    "                result.append(node.val)\n",
-    "\n",
-    "            # Add the children of the current node to the queue.\n",
-    "            if node.left:\n",
-    "                queue.append(node.left)\n",
-    "            if node.right:\n",
-    "                queue.append(node.right)\n",
-    "\n",
-    "    return result  # Return the list of right side view values.\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start with a binary tree represented using a TreeNode class. Each node has a value (`val`) and can have a left child (`left`) and a right child (`right`).\n",
-    "\n",
-    "2. The `rightSideView` function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.\n",
-    "\n",
-    "3. We check if the `root` is `None`, which means the tree is empty. If it's empty, we return an empty list because there are no nodes to see.\n",
-    "\n",
-    "4. We initialize an empty list called `result` to store the right side view values.\n",
-    "\n",
-    "5. We initialize a queue called `queue` with the root node. This queue is used for a level-order traversal of the tree.\n",
-    "\n",
-    "6. We enter a while loop that continues until the `queue` is empty. Inside this loop, we perform the following steps for each level of the tree:\n",
-    "\n",
-    "   a. We determine the number of nodes at the current level by getting the length of the `queue`. This is important for processing nodes at the same level together.\n",
-    "\n",
-    "   b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the `queue` using `queue.pop(0)`.\n",
-    "\n",
-    "   c. If the node we dequeue is the rightmost node at the current level (determined by `i == level_size - 1`), we add its `val` to the `result` list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.\n",
-    "\n",
-    "   d. We enqueue the left and right children of the current node (if they exist) to the `queue`. This ensures that we process the next level in the subsequent iterations of the while loop.\n",
-    "\n",
-    "7. After processing all levels of the tree, the `result` list contains the values of the rightmost nodes in each level, ordered from top to bottom.\n",
-    "\n",
-    "8. Finally, we return the `result` list as the output of the function, which represents the right side view of the binary tree.\n",
-    "\n",
-    "The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 3, 4]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root1 = TreeNode(1)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(3)\n",
-    "root1.left.right = TreeNode(5)\n",
-    "root1.right.right = TreeNode(4)\n",
-    "print(rightSideView(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "root2 = TreeNode(1)\n",
-    "root2.right = TreeNode(3)\n",
-    "print(rightSideView(root2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root = None\n",
-    "result = rightSideView(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here's why:\n",
-    "\n",
-    "1. We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.\n",
-    "\n",
-    "2. For each node, we perform constant-time operations like dequeuing it from the queue, checking if it's the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.\n",
-    "\n",
-    "Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is also O(N). Here's why:\n",
-    "\n",
-    "1. We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).\n",
-    "\n",
-    "2. The `result` list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the `result` list is also O(N).\n",
-    "\n",
-    "3. Other auxiliary variables like `level_size`, `i`, and `node` require only constant space and do not depend on the size of the tree.\n",
-    "\n",
-    "Combining the space used by the queue and the `result` list, we get a space complexity of O(N).\n",
-    "\n",
-    "In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Variant with Left Side View**: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.\n",
-    "\n",
-    "2. **Zigzag Right Side View**: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb b/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb
deleted file mode 100644
index 3e542c9..0000000
--- a/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 226: Invert Binary Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the root of a binary tree, invert the tree, and return its root.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the tree is in the range `[0, 100]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def invertTree(root):\n",
-    "    # Base case: If the root is None or the tree is empty, return None.\n",
-    "    if not root:\n",
-    "        return None\n",
-    "\n",
-    "    # Swap the left and right subtrees of the current node.\n",
-    "    root.left, root.right = root.right, root.left\n",
-    "\n",
-    "    # Recursively invert the left and right subtrees.\n",
-    "    invertTree(root.left)\n",
-    "    invertTree(root.right)\n",
-    "\n",
-    "    return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-    "\n",
-    "2. The `invertTree` function is defined to invert the binary tree. It takes the root node of the tree as an argument.\n",
-    "\n",
-    "3. In the `invertTree` function, we have a base case to handle the scenario when the root is `None` (empty tree). In such cases, we return `None` because there's nothing to invert.\n",
-    "\n",
-    "4. For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.\n",
-    "\n",
-    "5. We then recursively call `invertTree` on the left and right subtrees to invert them.\n",
-    "\n",
-    "6. Finally, we return the root of the inverted tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 1): <__main__.TreeNode object at 0x7faa5c445ab0>\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: root = [4,2,7,1,3,6,9]\n",
-    "\n",
-    "root1 = TreeNode(4)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(7)\n",
-    "root1.left.left = TreeNode(1)\n",
-    "root1.left.right = TreeNode(3)\n",
-    "root1.right.left = TreeNode(6)\n",
-    "root1.right.right = TreeNode(9)\n",
-    "\n",
-    "inverted_root1 = invertTree(root1)\n",
-    "print(\"Inverted Tree (Example 1):\", inverted_root1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 2): <__main__.TreeNode object at 0x7faa5c444310>\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: root = [2,1,3]\n",
-    "\n",
-    "root2 = TreeNode(2)\n",
-    "root2.left = TreeNode(1)\n",
-    "root2.right = TreeNode(3)\n",
-    "\n",
-    "inverted_root2 = invertTree(root2)\n",
-    "print(\"Inverted Tree (Example 2):\", inverted_root2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 3): None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "# Input: root = []\n",
-    "\n",
-    "root3 = None  # Empty tree\n",
-    "\n",
-    "inverted_root3 = invertTree(root3)\n",
-    "print(\"Inverted Tree (Example 3):\", inverted_root3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's discuss the time and space complexity of the provided Python code to invert a binary tree.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of the `invertTree` function is $O(n)$, where $n$ is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.\n",
-    "\n",
-    "The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is $O(h)$, where $h$ is the height of the binary tree. \n",
-    "\n",
-    "In a completely unbalanced binary tree (essentially a linked list), the height $h$ is equal to the number of nodes $n$, resulting in a space complexity of $O(n)$. This occurs when the tree is skewed to one side.\n",
-    "\n",
-    "In a balanced binary tree, such as a full binary tree, the height $h$ is $O(log\\ n)$, and the space complexity is $O(log\\ n)$.\n",
-    "\n",
-    "The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to $O(log\\ n)$.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "- Time Complexity: $O(n)$ where $n$ is the number of nodes.\n",
-    "- Space Complexity: $O(h)$, where $h$ is the height of the binary tree. In the worst case, it can be $O(n)$, and in a balanced tree, it is $O(log\\ n)$.\n",
-    "\n",
-    "Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with $O(1)$ space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb b/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb
deleted file mode 100644
index fdad9ba..0000000
--- a/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 230. Kth Smallest Element in a BST\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Kth Smallest Element in a BST problem on LeetCode, click here!](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary search tree, and an integer `k`, return *the $k^{th}$ smallest value (**1-indexed**) of all the values of the nodes in the tree.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is `n`.\n",
-    "- 1 <= `k <= n` <= $10^4$\n",
-    "- 0 <= `Node.val` <= $10^4$\n",
-    "\n",
-    "**Follow up**: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def kthSmallest(root, k):\n",
-    "    stack = []  # Initialize an empty stack to simulate the traversal\n",
-    "    while root or stack:\n",
-    "        while root:\n",
-    "            stack.append(root)  # Push the current node onto the stack\n",
-    "            root = root.left  # Move to the left child\n",
-    "        root = stack.pop()  # Pop a node from the stack\n",
-    "        k -= 1  # Decrement k since we've visited a node\n",
-    "        if k == 0:\n",
-    "            return root.val  # If k becomes 0, return the current node's value as the kth smallest\n",
-    "        root = root.right  # Move to the right child to continue the traversal"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in the binary search tree (BST). Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-    "\n",
-    "2. The `kthSmallest` function takes two parameters: `root`, which is the root of the BST, and `k`, which represents the kth smallest element we want to find.\n",
-    "\n",
-    "3. We initialize an empty stack (`stack`) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.\n",
-    "\n",
-    "4. We enter a while loop that continues until either `root` becomes `None` (indicating we have traversed the entire tree) or the `stack` is empty.\n",
-    "\n",
-    "5. Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the `stack` and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.\n",
-    "\n",
-    "6. Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the `stack` one by one. As we pop each node, we decrement `k` by 1 to keep track of the number of nodes we have visited.\n",
-    "\n",
-    "7. If `k` becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the `val` of the current node as the result.\n",
-    "\n",
-    "8. If `k` is still greater than 0, it means we haven't found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.\n",
-    "\n",
-    "9. The process continues until we find the kth smallest element or traverse the entire tree.\n",
-    "\n",
-    "10. Finally, we return the kth smallest element found.\n",
-    "\n",
-    "The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Create the tree for the first example: root = [3,1,4,null,2], k = 1\n",
-    "root1 = TreeNode(3)\n",
-    "root1.left = TreeNode(1)\n",
-    "root1.right = TreeNode(4)\n",
-    "root1.left.right = TreeNode(2)\n",
-    "k1 = 1\n",
-    "print(kthSmallest(root1, k1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3\n",
-    "root2 = TreeNode(5)\n",
-    "root2.left = TreeNode(3)\n",
-    "root2.right = TreeNode(6)\n",
-    "root2.left.left = TreeNode(2)\n",
-    "root2.left.right = TreeNode(4)\n",
-    "root2.left.left.left = TreeNode(1)\n",
-    "k2 = 3\n",
-    "print(kthSmallest(root2, k2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this code is O(h + k), where:\n",
-    "- h is the height of the binary search tree (BST).\n",
-    "- k is the desired kth smallest element we want to find.\n",
-    "\n",
-    "1. In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).\n",
-    "\n",
-    "2. In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).\n",
-    "\n",
-    "So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.\n",
-    "\n",
-    "1. In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.\n",
-    "\n",
-    "2. In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.\n",
-    "\n",
-    "So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.\n",
-    "\n",
-    "In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Kth Largest Element**: Modify the code to find the kth largest element in the BST instead of the kth smallest element.\n",
-    "\n",
-    "2. **Kth Smallest Element in Two BSTs**: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
deleted file mode 100644
index 0179ca4..0000000
--- a/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,237 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 235. Lowest Common Ancestor of a Binary Search Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n",
-    "\n",
-    "---\n",
-    "Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.\n",
-    "\n",
-    "According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes `p` and `q` as the lowest node in `T` that has both `p` and `q` as descendants (where we allow **a node to be a descendant of itself**).”\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[2, 10^5]$.\n",
-    "- $-10^9$ <= `Node.val` <= $10^9$\n",
-    "- All `Node.val` are **unique**.\n",
-    "- `p != q`\n",
-    "- `p` and `q` will exist in the BST.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def lowestCommonAncestor(root, p, q):\n",
-    "    # Ensure p is less than q\n",
-    "    if p.val > q.val:\n",
-    "        p, q = q, p\n",
-    "\n",
-    "    while root:\n",
-    "        # If the current node value is greater than both p and q, move left\n",
-    "        if root.val > q.val:\n",
-    "            root = root.left\n",
-    "        # If the current node value is less than both p and q, move right\n",
-    "        elif root.val < p.val:\n",
-    "            root = root.right\n",
-    "        # If the current node value is between p and q (inclusive), or it matches either p or q, it's the LCA\n",
-    "        else:\n",
-    "            return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `class TreeNode:` defines a simple class for representing nodes in a binary tree. Each `TreeNode` has three attributes:\n",
-    "   - `val`: The value of the node.\n",
-    "   - `left`: A reference to the left child node.\n",
-    "   - `right`: A reference to the right child node.\n",
-    "\n",
-    "2. `def lowestCommonAncestor(root, p, q):` is a function that takes three arguments:\n",
-    "   - `root`: The root node of the BST.\n",
-    "   - `p`: A TreeNode representing one of the nodes for which we want to find the LCA.\n",
-    "   - `q`: A TreeNode representing the other node for which we want to find the LCA.\n",
-    "\n",
-    "3. `if p.val > q.val:` checks if the value of `p` is greater than the value of `q`. In a BST, it's essential to ensure that `p` represents the smaller value, and `q` represents the larger value. If `p` is greater than `q`, the code swaps their values.\n",
-    "\n",
-    "4. The main logic is inside the `while` loop, which runs until `root` becomes `None`. It performs the following steps to find the LCA:\n",
-    "   - If the current `root` node's value is greater than the value of `q`, it means both `p` and `q` are on the left subtree of the current node. So, we move to the left child of the current node by setting `root = root.left`.\n",
-    "   - If the current `root` node's value is less than the value of `p`, it means both `p` and `q` are on the right subtree of the current node. So, we move to the right child of the current node by setting `root = root.right`.\n",
-    "   - If neither of the above conditions is met, it means the current `root` node's value is between `p` and `q`, or it matches either `p` or `q`. In this case, the current node is the lowest common ancestor (LCA), so we return `root`.\n",
-    "\n",
-    "The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of `p`, `q`, and the current `root` node. Eventually, it reaches the LCA node, and that node is returned as the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "6\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root = TreeNode(6)\n",
-    "root.left = TreeNode(2)\n",
-    "root.right = TreeNode(8)\n",
-    "root.left.left = TreeNode(0)\n",
-    "root.left.right = TreeNode(4)\n",
-    "root.right.left = TreeNode(7)\n",
-    "root.right.right = TreeNode(9)\n",
-    "root.left.right.left = TreeNode(3)\n",
-    "root.left.right.right = TreeNode(5)\n",
-    "\n",
-    "p = root.left  # Node 2\n",
-    "q = root.right  # Node 8\n",
-    "\n",
-    "result = lowestCommonAncestor(root, p, q)\n",
-    "print(result.val)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Using the same tree as before\n",
-    "p = root.left  # Node 2\n",
-    "q = root.left.right  # Node 4\n",
-    "\n",
-    "result = lowestCommonAncestor(root, p, q)\n",
-    "print(result.val) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root2 = TreeNode(2)\n",
-    "root2.left = TreeNode(1)\n",
-    "\n",
-    "p = root2  # Node 2\n",
-    "q = root2.left  # Node 1\n",
-    "\n",
-    "result = lowestCommonAncestor(root2, p, q)\n",
-    "print(result.val)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this algorithm is O(h), where \"h\" is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where \"n\" is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).\n",
-    "\n",
-    "The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes `p` and `q`. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are `root`, `p`, and `q`, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.\n",
-    "\n",
-    "**In summary**, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where \"h\" is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "### Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple LCAs:** Extend the algorithm to find all the lowest common ancestors of two given nodes `p` and `q` in a BST. In some cases, there can be multiple LCAs.\n",
-    "\n",
-    "2. **LCA with k Nodes:** Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
deleted file mode 100644
index 78a78b5..0000000
--- a/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb	
+++ /dev/null
@@ -1,291 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 297. Serialize and Deserialize Binary Tree\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.\n",
-    "\n",
-    "Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.\n",
-    "\n",
-    "**Clarification:** The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-    "- `-1000 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.\n",
-    "\n",
-    "In the context of this problem:\n",
-    "\n",
-    "1. **Serialization**: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.\n",
-    "\n",
-    "2. **Deserialization**: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.\n",
-    "\n",
-    "Here are some key points to consider in solving this problem:\n",
-    "\n",
-    "- The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].\n",
-    "- You don't necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.\n",
-    "- The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.\n",
-    "\n",
-    "A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode(object):\n",
-    "    def __init__(self, x):\n",
-    "        self.val = x\n",
-    "        self.left = None\n",
-    "        self.right = None\n",
-    "\n",
-    "class Codec:\n",
-    "    def serialize(self, root):\n",
-    "        serialized  = []\n",
-    "\n",
-    "        def dfs(node):\n",
-    "            if not node:\n",
-    "                # If the node is None, represent it as \"Null\" in the serialized string\n",
-    "                serialized .append(\"Null\")\n",
-    "                return\n",
-    "            # Convert the node's value to a string and add it to the serialized string\n",
-    "            serialized .append(str(node.val))\n",
-    "            dfs(node.left)\n",
-    "            dfs(node.right)\n",
-    "\n",
-    "        dfs(root)\n",
-    "        # Join the serialized values with \",\"\n",
-    "        return \",\".join(serialized )\n",
-    "\n",
-    "    def deserialize(self, data):\n",
-    "        vals = data.split(\",\")\n",
-    "        self.i = 0\n",
-    "\n",
-    "        def dfs():\n",
-    "            if vals[self.i] == \"Null\":\n",
-    "                self.i += 1\n",
-    "                return None\n",
-    "            # Convert the value to an integer to create a new node\n",
-    "            node = TreeNode(int(vals[self.i]))\n",
-    "            self.i += 1\n",
-    "            node.left = dfs()\n",
-    "            node.right = dfs()\n",
-    "            return node\n",
-    "\n",
-    "        return dfs()"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Here's a step-by-step explanation of the code:\n",
-    "\n",
-    "1. **Definition of TreeNode**:\n",
-    "   - The code defines a simple `TreeNode` class that represents a node in a binary tree. Each `TreeNode` has three attributes:\n",
-    "     - `val`: The integer value stored in the node.\n",
-    "     - `left`: A reference to the left child node (or None if there is no left child).\n",
-    "     - `right`: A reference to the right child node (or None if there is no right child).\n",
-    "   - This class allows you to create binary tree nodes with integer values and left and right child references.\n",
-    "\n",
-    "2. **Serialization (serialize method)**:\n",
-    "   - The `serialize` method takes a `root` node as input, which is the root of the binary tree that needs to be serialized.\n",
-    "   - It initializes an empty list `serialized` to store the serialized elements.\n",
-    "   - The `dfs` (depth-first search) function is defined within the `serialize` method to perform a preorder traversal of the binary tree.\n",
-    "   - In the `dfs` function:\n",
-    "     - If the current `node` is `None` (i.e., a leaf node or a child of a leaf node), it appends the string \"Null\" to the `serialized` list to represent the absence of a node.\n",
-    "     - If the current `node` is not `None`, it appends the string representation of the `node.val` to the `serialized` list and then recursively calls `dfs` on the left and right children.\n",
-    "   - After the `dfs` traversal, the `serialized` list contains the serialized binary tree elements.\n",
-    "   - The method returns a string obtained by joining the elements in the `serialized` list with commas.\n",
-    "\n",
-    "3. **Deserialization (deserialize method)**:\n",
-    "   - The `deserialize` method takes a serialized string `data` as input, which represents a binary tree in the custom format.\n",
-    "   - It splits the `data` string by commas to obtain a list of elements called `vals`.\n",
-    "   - The method initializes an index `self.i` to 0. This index keeps track of the current position in the `vals` list during deserialization.\n",
-    "   - The `dfs` function is defined within the `deserialize` method to perform the deserialization process using a recursive approach.\n",
-    "   - In the `dfs` function:\n",
-    "     - If the current element in `vals` is \"Null,\" it means there is no node at this position in the binary tree, so it returns `None`.\n",
-    "     - If the current element is not \"Null,\" it converts the element to an integer to create a new `TreeNode` with that value.\n",
-    "     - It then recursively calls `dfs` to set the left and right children of the current node.\n",
-    "   - The method returns the root node of the reconstructed binary tree.\n",
-    "\n",
-    "Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1,2,Null,Null,3,4,Null,Null,5,Null,Null\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Serialize a binary tree\n",
-    "root = TreeNode(1)\n",
-    "root.left = TreeNode(2)\n",
-    "root.right = TreeNode(3)\n",
-    "root.right.left = TreeNode(4)\n",
-    "root.right.right = TreeNode(5)\n",
-    "\n",
-    "codec = Codec()\n",
-    "serialized_tree = codec.serialize(root)\n",
-    "print(serialized_tree)\n",
-    "\n",
-    "# Deserialize the serialized tree\n",
-    "new_root = codec.deserialize(serialized_tree)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Null\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Example usage:\n",
-    "# Serialize a binary tree\n",
-    "root = None\n",
-    "\n",
-    "codec = Codec()\n",
-    "serialized_tree = codec.serialize(root)\n",
-    "print(serialized_tree)\n",
-    "\n",
-    "# Deserialize the serialized tree\n",
-    "new_root = codec.deserialize(serialized_tree)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:\n",
-    "\n",
-    "1. **Serialization (serialize method)**:\n",
-    "\n",
-    "   - Time Complexity:\n",
-    "     - The `serialize` method uses a depth-first traversal (preorder) of the binary tree.\n",
-    "     - It visits each node exactly once.\n",
-    "     - At each node, it performs constant-time operations (string conversion and list append).\n",
-    "     - Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.\n",
-    "\n",
-    "   - Space Complexity:\n",
-    "     - The space complexity for serialization includes the space used by the `serialized` list and the recursive call stack.\n",
-    "     - The `serialized` list stores the serialized elements, and its space is proportional to the number of nodes.\n",
-    "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-    "     - Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-    "\n",
-    "2. **Deserialization (deserialize method)**:\n",
-    "\n",
-    "   - Time Complexity:\n",
-    "     - The `deserialize` method splits the serialized string into a list of elements, which takes O(N) time.\n",
-    "     - The `dfs` function is a recursive function that visits each element in the list exactly once.\n",
-    "     - At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).\n",
-    "     - Therefore, the time complexity for deserialization is O(N).\n",
-    "\n",
-    "   - Space Complexity:\n",
-    "     - The space complexity for deserialization includes the space used by the `vals` list and the recursive call stack.\n",
-    "     - The `vals` list stores the elements from the serialized string, and its space is proportional to the number of nodes.\n",
-    "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-    "     - Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-    "\n",
-    "Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Efficient Serialization**:\n",
-    "   Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.\n",
-    "\n",
-    "2. **Custom Serialization Format**:\n",
-    "   Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb b/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb
deleted file mode 100644
index 425f22d..0000000
--- a/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb	
+++ /dev/null
@@ -1,259 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 572: Subtree of Another Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Subtree of Another Tree problem on LeetCode, click here!](https://leetcode.com/problems/subtree-of-another-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "**Problem Description:**\n",
-    "\n",
-    "Given the roots of two binary trees `root` and `subRoot`, return `True` if there is a subtree of `root` with the same structure and node values as `subRoot`, and `False` otherwise.\n",
-    "\n",
-    "A subtree of a binary tree `tree` is a tree that consists of a node in `tree` and all of this node's descendants. The tree `tree` could also be considered as a subtree of itself.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "1. The number of nodes in the `root` tree is in the range $[1, 2000]$.\n",
-    "2. The number of nodes in the `subRoot` tree is in the range $[1, 1000]$.\n",
-    "3. $-10^4$ <= root.val <= $10^4$\n",
-    "4. $-10^4$ <= subRoot.val <= $10^4$\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "class Solution:\n",
-    "    def isSubtree(self, root, subRoot):\n",
-    "        if not root:\n",
-    "            return False\n",
-    "        \n",
-    "        # Check if the current subtree is equal to the subRoot\n",
-    "        if self.isSameTree(root, subRoot):\n",
-    "            return True\n",
-    "        \n",
-    "        # Recursively check the left and right subtrees\n",
-    "        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)\n",
-    "    \n",
-    "    def isSameTree(self, tree1, tree2):\n",
-    "        if not tree1 and not tree2:\n",
-    "            return True\n",
-    "        if not tree1 or not tree2:\n",
-    "            return False\n",
-    "        \n",
-    "        return (\n",
-    "            tree1.val == tree2.val and\n",
-    "            self.isSameTree(tree1.left, tree2.left) and\n",
-    "            self.isSameTree(tree1.right, tree2.right)\n",
-    "        )"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:\n",
-    "\n",
-    "1. `isSubtree`: This method checks if there is a subtree of the `root` tree with the same structure and node values as the `subRoot` tree. It uses a helper function `isSameTree` to compare two trees for equality.\n",
-    "\n",
-    "2. `isSameTree`: This helper method recursively compares two trees to check if they are the same in structure and node values.\n",
-    "\n",
-    "### Here's a detailed explanation of the code:\n",
-    "\n",
-    "1. **TreeNode Class:**\n",
-    "\n",
-    "The `TreeNode` class is defined to represent nodes in a binary tree. Each node has a `val` (the node's value) and may have a `left` and `right` child.\n",
-    "\n",
-    "2. **Solution Class:**\n",
-    "\n",
-    "    + The `Solution` class contains the solution for the problem and defines two important methods:\n",
-    "\n",
-    "    + `isSubtree(self, root, subRoot)`:\n",
-    "\n",
-    "        - This method checks whether `subRoot` is a subtree of `root`. It takes two tree nodes, `root` and `subRoot`, as input arguments.\n",
-    "        - If `root` is `None`, it returns `False` because there is no subtree to search.\n",
-    "        - It then checks if the current subtree with `root` as its root is equal to `subRoot` using the `isSameTree` method. If they are the same, it returns `True`.\n",
-    "        - If the current subtree is not the same as `subRoot`, it recursively checks the left and right subtrees of `root` to see if `subRoot` is a subtree of any of them.\n",
-    "        - It returns `True` if `subRoot` is found in either the left or right subtree; otherwise, it returns `False`.\n",
-    "\n",
-    "    + `isSameTree(self, tree1, tree2)`:\n",
-    "\n",
-    "        - This method checks whether two trees, `tree1` and `tree2`, are the same.\n",
-    "        - If both `tree1` and `tree2` are `None`, they are considered the same tree, so it returns `True`.\n",
-    "        - If only one of them is `None` (but not both), they are different trees, so it returns `False`.\n",
-    "        - If both `tree1` and `tree2` have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.\n",
-    "        - It returns `True` if the trees are the same; otherwise, it returns `False`.\n",
-    "\n",
-    "The code effectively uses recursion to traverse the binary trees and check for subtree equality. The `isSubtree` method starts the recursive search, and the `isSameTree` method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.\n",
-    "\n",
-    "This solution allows you to determine if there exists a subtree within the `root` tree that matches the structure and node values of `subRoot`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Is subRoot a subtree of root? True\n"
-     ]
-    }
-   ],
-   "source": [
-    "#root = [3,4,5,1,2]\n",
-    "#subRoot = [4,1,2]\n",
-    "\n",
-    "# Example input\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(4)\n",
-    "root.right = TreeNode(5)\n",
-    "root.left.left = TreeNode(1)\n",
-    "root.left.right = TreeNode(2)\n",
-    "\n",
-    "subRoot = TreeNode(4)\n",
-    "subRoot.left = TreeNode(1)\n",
-    "subRoot.right = TreeNode(2)\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test the isSubtree method\n",
-    "result = solution.isSubtree(root, subRoot)\n",
-    "print(\"Is subRoot a subtree of root?\", result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Is subRoot a subtree of root? False\n"
-     ]
-    }
-   ],
-   "source": [
-    "#root = [3,4,5,1,2,null,null,null,null,0] \n",
-    "#subRoot = [4,1,2]\n",
-    "\n",
-    "\n",
-    "# Example input\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(4)\n",
-    "root.right = TreeNode(5)\n",
-    "root.left.left = TreeNode(1)\n",
-    "root.left.right = TreeNode(2)\n",
-    "root.left.right.left = TreeNode(0)\n",
-    "\n",
-    "subRoot = TreeNode(4)\n",
-    "subRoot.left = TreeNode(1)\n",
-    "subRoot.right = TreeNode(2)\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test the isSubtree method\n",
-    "result = solution.isSubtree(root, subRoot)\n",
-    "print(\"Is subRoot a subtree of root?\", result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "86a34f0d-0789-498c-818c-2d30f84754d0",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code for the \"Subtree of Another Tree\" problem:\n",
-    "\n",
-    "**Time Complexity**\n",
-    "\n",
-    "The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the `isSubtree` and `isSameTree` functions, we visit each node in the binary trees once. Let's break down the time complexity:\n",
-    "\n",
-    "1. The `isSubtree` function:\n",
-    "   - In the worst case, we need to visit every node in the `root` tree.\n",
-    "   - For each node in the `root` tree, we call the `isSameTree` function, which has its own traversal.\n",
-    "   - So, the total time complexity is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree.\n",
-    "\n",
-    "2. The `isSameTree` function:\n",
-    "   - In the worst case, we visit every node in both `tree1` and `tree2`.\n",
-    "   - The number of recursive calls made is proportional to the number of nodes in the trees.\n",
-    "   - So, the time complexity of this function is $O(max(n, m))$, where $n$ and $m$ are the numbers of nodes in `tree1` and `tree2`, respectively.\n",
-    "\n",
-    "Overall, the time complexity of the entire code is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree. In practice, it may be less than $O(n * m)$ if a subtree mismatch is detected early during the traversal.\n",
-    "\n",
-    "**Space Complexity**\n",
-    "\n",
-    "The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let's analyze the space complexity:\n",
-    "\n",
-    "1. The `isSubtree` function:\n",
-    "   - It uses the call stack for recursion.\n",
-    "   - The maximum depth of the recursion is equal to the height of the `root` tree, which can be $O(n)$ in the worst case (unbalanced tree).\n",
-    "   - Additionally, the function doesn't use any significant extra space other than the recursion stack.\n",
-    "\n",
-    "2. The `isSameTree` function:\n",
-    "   - It also uses the call stack for recursion.\n",
-    "   - The maximum depth of the recursion is equal to the height of the `tree1` or `tree2`, whichever is greater.\n",
-    "   - So, the maximum space used for the call stack is $O(max(n, m))$.\n",
-    "\n",
-    "In summary, the space complexity of the code is $O(max(n, m))$ due to the function call stack. It scales with the maximum height of the trees being compared.\n",
-    "\n",
-    "Overall, the code is efficient and works well for trees with moderate sizes. However, it's important to keep in mind that the worst-case time complexity is $O(n * m)$, so for very large trees, the performance may degrade."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb b/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb
deleted file mode 100644
index 0cbe2fc..0000000
--- a/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 98. Validate Binary Search Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Validate Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/validate-binary-search-tree/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, *determine if it is a valid binary search tree (BST)*.\n",
-    "\n",
-    "A **valid BST** is defined as follows:\n",
-    "\n",
-    "- The left subtree of a node contains only nodes with keys **less than** the node's key.\n",
-    "- The right subtree of a node contains only nodes with keys **greater than** the node's key.\n",
-    "- Both the left and right subtrees must also be binary search trees. \n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[1, 10^4]$.\n",
-    "- $-2^{31}$ <= `Node.val` <= $2^{31} - 1$\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def is_valid_BST(root):\n",
-    "    def is_valid(node, min_val, max_val):\n",
-    "        # Base case: If the node is None, it's a valid BST.\n",
-    "        if node is None:\n",
-    "            return True\n",
-    "        \n",
-    "        # Check if the current node's value is within the valid range.\n",
-    "        if not (min_val < node.val < max_val):\n",
-    "            return False\n",
-    "        \n",
-    "        # Recursively check the left and right subtrees with updated ranges.\n",
-    "        return (is_valid(node.left, min_val, node.val) and\n",
-    "                is_valid(node.right, node.val, max_val))\n",
-    "    \n",
-    "    # Call the helper function starting with a wide range for root node.\n",
-    "    return is_valid(root, float('-inf'), float('inf'))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- It defines a `TreeNode` class to represent nodes in the binary tree.\n",
-    "\n",
-    "- The `is_valid_BST` function takes the root node of the binary tree as input and returns `True` if the tree is a valid BST, and `False` otherwise.\n",
-    "\n",
-    "- Inside the `is_valid_BST` function, there is a helper function called `is_valid` that performs the actual validation using a recursive approach.\n",
-    "\n",
-    "- The `is_valid` function checks each node in the tree to ensure that it satisfies the properties of a BST:\n",
-    "  - The value of the current node must be within a valid range defined by `min_val` and `max_val`.\n",
-    "  - The left subtree of the current node should contain values less than the current node's value.\n",
-    "  - The right subtree of the current node should contain values greater than the current node's value.\n",
-    "\n",
-    "- If any of these conditions are violated, the function returns `False`, indicating that the tree is not a valid BST.\n",
-    "\n",
-    "- If all nodes satisfy these conditions, the function returns `True`, indicating that the tree is a valid BST.\n",
-    "\n",
-    "- The code calls the `is_valid` function with the root node and initial range values of negative infinity to positive infinity to start the validation.\n",
-    "\n",
-    "- The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.\n",
-    "\n",
-    "- The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.\n",
-    "\n",
-    "In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node's value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Create the tree for the first example: [2, 1, 3]\n",
-    "root1 = TreeNode(2)\n",
-    "root1.left = TreeNode(1)\n",
-    "root1.right = TreeNode(3)\n",
-    "print(is_valid_BST(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Create the tree for the second example: [5, 1, 4, None, None, 3, 6]\n",
-    "root2 = TreeNode(5)\n",
-    "root2.left = TreeNode(1)\n",
-    "root2.right = TreeNode(4)\n",
-    "root2.right.left = TreeNode(3)\n",
-    "root2.right.right = TreeNode(6)\n",
-    "print(is_valid_BST(root2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `is_valid_BST` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The time complexity of the function primarily depends on the number of nodes in the binary tree.\n",
-    "- In the worst case, we may have to visit every node in the tree once to validate whether it's part of a valid BST.\n",
-    "- Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity is determined by the space used by the recursive call stack during the DFS traversal.\n",
-    "- In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.\n",
-    "- In a balanced BST, the height is approximately log2(N), where N is the number of nodes.\n",
-    "- Therefore, the space complexity of the call stack is O(log N) for a balanced BST.\n",
-    "- In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.\n",
-    "\n",
-    "**Overall:**\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.\n",
-    "\n",
-    "The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Complex Constraints**: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like \"The left subtree of a node contains only nodes with keys less than or equal to the node's key,\" and \"The right subtree of a node contains only nodes with keys greater than or equal to the node's key.\" How would you adapt the code to handle these constraints?\n",
-    "\n",
-    "2. **Handling Duplicates**: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb
deleted file mode 100644
index 5c54c25..0000000
--- a/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 208. Implement Trie (Prefix Tree)\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Implement Trie problem on LeetCode, click here!](https://leetcode.com/problems/implement-trie-prefix-tree/)\n",
-    "\n",
-    "---\n",
-    "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.\n",
-    "\n",
-    "Implement the Trie class:\n",
-    "\n",
-    "- `Trie()` Initializes the trie object.\n",
-    "- `void insert(String word)` Inserts the string `word` into the trie.\n",
-    "- `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.\n",
-    "- `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= word.length, prefix.length <= 2000`\n",
-    "- `word` and `prefix` consist only of lowercase English letters.\n",
-    "- At most $3 * 10^4$ calls in total will be made to `insert`, `search`, and `startsWith`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to implement a data structure known as a Trie (pronounced \"try\") or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It's particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:\n",
-    "\n",
-    "1. `Trie()`: This is the constructor that initializes the Trie object.\n",
-    "\n",
-    "2. `void insert(String word)`: This method inserts the given string `word` into the Trie. It effectively adds the characters of the word to the Trie's structure, creating nodes for each character if they don't already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.\n",
-    "\n",
-    "3. `boolean search(String word)`: This method checks if the given string `word` is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns `true`, indicating that the word exists in the Trie; otherwise, it returns `false`.\n",
-    "\n",
-    "4. `boolean startsWith(String prefix)`: This method checks if there is any previously inserted word in the Trie that has the given `prefix`. It's similar to the `search` method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns `true`; otherwise, it returns `false`.\n",
-    "\n",
-    "The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.\n",
-    "\n",
-    "In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        self.children = {}           # A dictionary to store child nodes\n",
-    "        self.is_end_of_word = False  # Indicates if a word ends at this node\n",
-    "\n",
-    "class Trie:\n",
-    "    def __init__(self):\n",
-    "        self.root = TrieNode()       # Initialize the Trie with a root node\n",
-    "\n",
-    "    def insert(self, word):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                node.children[char] = TrieNode()  # Create a new node if the character is not present\n",
-    "            node = node.children[char]           # Move to the child node\n",
-    "        node.is_end_of_word = True                # Mark the end of the inserted word\n",
-    "\n",
-    "    def search(self, word):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                return False         # If the character is not found, the word is not in the Trie\n",
-    "            node = node.children[char]  # Move to the child node\n",
-    "        return node.is_end_of_word    # Check if the node represents the end of a valid word\n",
-    "\n",
-    "    def startsWith(self, prefix):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in prefix:\n",
-    "            if char not in node.children:\n",
-    "                return False         # If the character is not found, no word starts with the prefix\n",
-    "            node = node.children[char]  # Move to the child node\n",
-    "        return True                  # Prefix found in the Trie"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's explain how the code works step by step:\n",
-    "\n",
-    "1. `TrieNode` Class:\n",
-    "   - `TrieNode` is a class that represents nodes in the Trie. Each node has two attributes:\n",
-    "     - `children`: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.\n",
-    "     - `is_end_of_word`: This boolean flag indicates whether the node represents the end of a complete word. Initially, it's set to `False` for all nodes.\n",
-    "\n",
-    "2. `Trie` Class:\n",
-    "   - `Trie` is the main class that implements the Trie data structure. It has the following methods:\n",
-    "\n",
-    "   - `__init__(self)`: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.\n",
-    "\n",
-    "   - `insert(self, word)`: This method inserts a string `word` into the Trie. It starts from the root node and iterates through each character in the word.\n",
-    "     - If a character is not present as a child node, it creates a new node for that character.\n",
-    "     - It then moves to the child node and continues the process until the entire word is inserted.\n",
-    "     - Finally, it sets the `is_end_of_word` flag to `True` for the last node to mark the end of the inserted word.\n",
-    "\n",
-    "   - `search(self, word)`: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.\n",
-    "     - If a character is not found as a child node, it immediately returns `False` because the word is not in the Trie.\n",
-    "     - It continues to move to the child node for each character.\n",
-    "     - After reaching the end of the word, it checks if the `is_end_of_word` flag is `True` for the last node to confirm the presence of the word.\n",
-    "\n",
-    "   - `startsWith(self, prefix)`: This method checks if there is any previously inserted word in the Trie that starts with a given `prefix`. It follows the same logic as the `search` method but does not require the entire word to be present.\n",
-    "     - If the prefix is found in the Trie, it returns `True`; otherwise, it returns `False`.\n",
-    "\n",
-    "3. Example Usage:\n",
-    "   - The code demonstrates how to create a Trie object, insert words (\"apple\" and \"app\"), and perform operations on the Trie:\n",
-    "     - It inserts the word \"apple\" into the Trie.\n",
-    "     - It checks if \"apple\" is in the Trie, which returns `True`.\n",
-    "     - It checks if \"app\" is in the Trie, which returns `False`.\n",
-    "     - It checks if there is any word in the Trie that starts with \"app,\" which returns `True`.\n",
-    "     - It inserts the word \"app\" into the Trie.\n",
-    "     - It checks if \"app\" is in the Trie again, which now returns `True`.\n",
-    "\n",
-    "In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n",
-      "False\n",
-      "True\n",
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "\n",
-    "trie = Trie()\n",
-    "trie.insert(\"apple\")\n",
-    "print(trie.search(\"apple\"))   # Output: True\n",
-    "print(trie.search(\"app\"))     # Output: False\n",
-    "print(trie.startsWith(\"app\")) # Output: True\n",
-    "trie.insert(\"app\")\n",
-    "print(trie.search(\"app\"))     # Output: True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the Trie implementation:\n",
-    "\n",
-    "1. Time Complexity:\n",
-    "   - Insertion (`insert` method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.\n",
-    "   - Search (`search` method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.\n",
-    "   - Starts with (`startsWith` method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.\n",
-    "\n",
-    "   Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.\n",
-    "\n",
-    "2. Space Complexity:\n",
-    "   - The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.\n",
-    "   - Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.\n",
-    "\n",
-    "   In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.\n",
-    "\n",
-    "In summary:\n",
-    "- Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.\n",
-    "- Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Count Prefixes**:\n",
-    "   Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.\n",
-    "\n",
-    "2. **Auto-Complete Suggestions**:\n",
-    "   Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb
deleted file mode 100644
index bdd867c..0000000
--- a/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 211. Design Add and Search Words Data Structure\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Design Add and Search Words Data Structure problem on LeetCode, click here!](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n",
-    "\n",
-    "---\n",
-    "Design a data structure that supports adding new words and finding if a string matches any previously added string.\n",
-    "\n",
-    "Implement the `WordDictionary` class:\n",
-    "\n",
-    "- `WordDictionary()` Initializes the object.\n",
-    "- `void addWord(word)` Adds `word` to the data structure, it can be matched later.\n",
-    "- `bool search(word)` Returns `true` if there is any string in the data structure that matches `word` or `false` otherwise. `word` may contain dots `'.'` where dots can be matched with any letter.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= word.length <= 25`\n",
-    "- `word` in `addWord` consists of lowercase English letters.\n",
-    "- `word` in `search` consist of `'.'` or lowercase English letters.\n",
-    "- There will be at most `2` dots in `word` for `search` queries.\n",
-    "- At most $10^4$ calls will be made to `addWord` and `search`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to design a data structure called `WordDictionary` that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot ('.') can match any letter.\n",
-    "\n",
-    "Here are the specific requirements and explanations for the problem:\n",
-    "\n",
-    "1. Initialize the `WordDictionary` object using the constructor `WordDictionary()`.\n",
-    "\n",
-    "2. The `addWord(word)` method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.\n",
-    "\n",
-    "3. The `search(word)` method allows you to search for a word in the data structure. This method returns `True` if there is any string in the data structure that matches the given word or `False` otherwise. The word you are searching for may contain dots ('.'), where each dot can match any letter.\n",
-    "\n",
-    "4. The wildcard character ('.') in the `search` method allows for partial or fuzzy searching. For example, if the word dictionary contains the words \"bad,\" \"dad,\" and \"mad,\" then:\n",
-    "   - Searching for \"pad\" should return `False` because there is no exact match.\n",
-    "   - Searching for \"bad\" should return `True` because \"bad\" is in the dictionary.\n",
-    "   - Searching for \".ad\" should return `True` because it can match \"bad,\" \"dad,\" or \"mad.\"\n",
-    "   - Searching for \"b..\" should return `True` because it can match \"bad,\" \"bed,\" \"bet,\" etc.\n",
-    "\n",
-    "5. The problem specifies that there will be at most two dots ('.') in search queries, and there will be at most 10^4 calls to both `addWord` and `search`.\n",
-    "\n",
-    "In summary, you need to implement the `WordDictionary` class that efficiently supports adding words and searching for words, where the search can include wildcard characters ('.') that match any letter.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        # Initialize a TrieNode with children and a flag to indicate the end of a word.\n",
-    "        self.children = {}\n",
-    "        self.is_end_of_word = False\n",
-    "\n",
-    "class WordDictionary:\n",
-    "\n",
-    "    def __init__(self):\n",
-    "        # Initialize the WordDictionary with a root node.\n",
-    "        self.root = TrieNode()\n",
-    "\n",
-    "    def addWord(self, word: str) -> None:\n",
-    "        node = self.root\n",
-    "        # Iterate through the characters in the word.\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                # Create a new node for the character if it doesn't exist.\n",
-    "                node.children[char] = TrieNode()\n",
-    "            # Move to the next node.\n",
-    "            node = node.children[char]\n",
-    "        # Mark the end of the word by setting the flag to True.\n",
-    "        node.is_end_of_word = True\n",
-    "\n",
-    "    def search_helper(self, node: TrieNode, word: str) -> bool:\n",
-    "        if not word:\n",
-    "            # If there are no characters left in the word, check if we reached the end of a word in the trie.\n",
-    "            return node.is_end_of_word\n",
-    "        \n",
-    "        char = word[0]\n",
-    "        if char == '.':\n",
-    "            # If the character is a dot, explore all possible child nodes.\n",
-    "            for child in node.children.values():\n",
-    "                if self.search_helper(child, word[1:]):\n",
-    "                    return True\n",
-    "        elif char in node.children:\n",
-    "            # If the character is in the children of the current node, move to the next node.\n",
-    "            return self.search_helper(node.children[char], word[1:])\n",
-    "        \n",
-    "        # If the character is not found and is not a dot, the word is not in the trie.\n",
-    "        return False\n",
-    "\n",
-    "    def search(self, word: str) -> bool:\n",
-    "        # Start the search from the root of the trie.\n",
-    "        return self.search_helper(self.root, word)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "This code defines a `WordDictionary` class that uses a Trie data structure to efficiently store and search for words. Here's a step-by-step explanation:\n",
-    "\n",
-    "1. `TrieNode` class: This class represents nodes in the Trie data structure. Each node has two attributes: `children` (a dictionary to store child nodes) and `is_end_of_word` (a flag to indicate whether the node marks the end of a word).\n",
-    "\n",
-    "2. `WordDictionary` class: This class initializes with an empty Trie by creating a root node.\n",
-    "\n",
-    "3. `addWord` method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the `is_end_of_word` flag to `True` for the final character of the word to mark the end of the word.\n",
-    "\n",
-    "4. `search_helper` method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (`node`) and a word to search (`word`) as input. If there are no characters left in the word (`not word`), it checks if the current node marks the end of a word. If it does, it returns `True`.\n",
-    "\n",
-    "5. If the first character of the word is a dot ('.'), the function explores all possible child nodes by iterating through `node.children.values()` and recursively calls `search_helper` for each child with the remaining part of the word (`word[1:]`).\n",
-    "\n",
-    "6. If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling `search_helper` on the child node and the remaining part of the word.\n",
-    "\n",
-    "7. If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns `False`.\n",
-    "\n",
-    "8. `search` method: This is the public method for searching words. It initiates the search process by calling `search_helper` starting from the root node of the Trie.\n",
-    "\n",
-    "Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots ('.')."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n",
-      "True\n",
-      "True\n",
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "\n",
-    "wordDictionary = WordDictionary()\n",
-    "wordDictionary.addWord(\"bad\")\n",
-    "wordDictionary.addWord(\"dad\")\n",
-    "wordDictionary.addWord(\"mad\")\n",
-    "print(wordDictionary.search(\"pad\"))  # Output: False\n",
-    "print(wordDictionary.search(\"bad\"))  # Output: True\n",
-    "print(wordDictionary.search(\".ad\"))  # Output: True\n",
-    "print(wordDictionary.search(\"b..\"))  # Output: True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `WordDictionary` class methods:\n",
-    "\n",
-    "1. `addWord` Method:\n",
-    "\n",
-    "   - Time Complexity: O(L)\n",
-    "     - L is the length of the word being added.\n",
-    "     - In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.\n",
-    "\n",
-    "2. `search_helper` Method (called by `search`):\n",
-    "\n",
-    "   - Time Complexity: O(2^M * L)\n",
-    "     - M is the maximum number of dots ('.') in the search word.\n",
-    "     - In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.\n",
-    "     - So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.\n",
-    "\n",
-    "3. `search` Method:\n",
-    "\n",
-    "   - Time Complexity: O(2^M * L)\n",
-    "     - The `search` method calls the `search_helper` method, which has the same time complexity explained above.\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.\n",
-    "\n",
-    "Overall, the time complexity of the `search` method is mainly affected by the number of dots ('.') in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.\n",
-    "\n",
-    "The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.\n",
-    "\n",
-    "In summary:\n",
-    "\n",
-    "- Time Complexity for `addWord`: O(L)\n",
-    "- Time Complexity for `search`: O(2^M * L)\n",
-    "- Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.\n",
-    "\n",
-    "Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Dictionary Auto-Completion**: Extend the `WordDictionary` class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.\n",
-    "\n",
-    "2. **Support Word Deletion**: Extend the `WordDictionary` class to support word deletion. Add a method `deleteWord(word)` that removes a word from the data structure. Ensure that the search operation still works correctly after deletion."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb b/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb
deleted file mode 100644
index e582b9d..0000000
--- a/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb	
+++ /dev/null
@@ -1,310 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 212. Word Search II\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Word Search II problem on LeetCode, click here!](https://leetcode.com/problems/word-search-ii/)\n",
-    "\n",
-    "---\n",
-    "Given an `m x n` `board` of characters and a list of strings `words`, the task is to return *all words on the board*.\n",
-    "\n",
-    "Each word must be constructed from letters of sequentially **adjacent cells**, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == board.length`\n",
-    "- `n == board[i].length`\n",
-    "- `1 <= m, n <= 12`\n",
-    "- `board[i][j]` is a lowercase English letter.\n",
-    "- 1 <= `words.length` <= $3 * 10^4$\n",
-    "- `1 <= words[i].length <= 10`\n",
-    "- `words[i]` consists of lowercase English letters.\n",
-    "- All the strings of `words` are unique."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "To solve the \"Word Search II\" problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here's a step-by-step approach to solve the problem:\n",
-    "\n",
-    "1. Build a Trie from the given list of words:\n",
-    "   - Create a Trie data structure to store all the words from the input list.\n",
-    "   - For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.\n",
-    "\n",
-    "2. Perform DFS on the board:\n",
-    "   - Iterate through each cell (i, j) on the board.\n",
-    "   - For each cell, start a DFS traversal from that cell to search for words.\n",
-    "   - During the DFS traversal, maintain a current path string.\n",
-    "   - At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.\n",
-    "   - If the current path string matches a word in the Trie, add it to the result.\n",
-    "\n",
-    "3. Implement DFS with backtracking:\n",
-    "   - During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven't been visited before.\n",
-    "   - To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like '#') before exploring it and restore its original character after the DFS traversal.\n",
-    "\n",
-    "4. Return the result:\n",
-    "   - After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.\n",
-    "   - Convert the result set to a list and return it as the final output.\n",
-    "\n",
-    "This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Define a TrieNode class to represent nodes in the Trie.\n",
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        self.children = {}  # Dictionary to store child nodes.\n",
-    "        self.is_end_of_word = False  # Flag to mark the end of a word.\n",
-    "\n",
-    "# Main function to find words on the board.\n",
-    "def findWords(board, words):\n",
-    "    # DFS function to search for words starting from a given cell.\n",
-    "    def dfs(node, i, j, path):\n",
-    "        char = board[i][j]  # Get the character at the current cell.\n",
-    "        curr_node = node.children.get(char)  # Find the corresponding Trie node.\n",
-    "\n",
-    "        if not curr_node:\n",
-    "            return  # If no matching Trie node, stop the search.\n",
-    "\n",
-    "        path += char  # Add the character to the current path.\n",
-    "\n",
-    "        if curr_node.is_end_of_word:\n",
-    "            result.add(path)  # If the path matches a word, add it to the result.\n",
-    "\n",
-    "        temp, board[i][j] = board[i][j], \"#\"  # Mark the cell as visited.\n",
-    "\n",
-    "        # Explore neighboring cells (up, down, left, right).\n",
-    "        if i > 0:\n",
-    "            dfs(curr_node, i - 1, j, path)\n",
-    "        if i < m - 1:\n",
-    "            dfs(curr_node, i + 1, j, path)\n",
-    "        if j > 0:\n",
-    "            dfs(curr_node, i, j - 1, path)\n",
-    "        if j < n - 1:\n",
-    "            dfs(curr_node, i, j + 1, path)\n",
-    "\n",
-    "        board[i][j] = temp  # Restore the cell's original character.\n",
-    "\n",
-    "    # Function to build a Trie from the list of words.\n",
-    "    def buildTrie():\n",
-    "        root = TrieNode()  # Create a root node.\n",
-    "        for word in words:\n",
-    "            node = root\n",
-    "            for char in word:\n",
-    "                if char not in node.children:\n",
-    "                    node.children[char] = TrieNode()  # Create a new node if needed.\n",
-    "                node = node.children[char]\n",
-    "            node.is_end_of_word = True  # Mark the end of the word.\n",
-    "        return root\n",
-    "\n",
-    "    m, n = len(board), len(board[0])  # Get the dimensions of the board.\n",
-    "    root = buildTrie()  # Build the Trie from the list of words.\n",
-    "    result = set()  # Use a set to store unique words found on the board.\n",
-    "\n",
-    "    # Iterate through each cell on the board and start DFS from there.\n",
-    "    for i in range(m):\n",
-    "        for j in range(n):\n",
-    "            dfs(root, i, j, \"\")  # Start DFS from each cell on the board.\n",
-    "\n",
-    "    return list(result)  # Convert the set to a list and return the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code solves the \"Word Search II\" problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.\n",
-    "\n",
-    "The code does the following:\n",
-    "\n",
-    "1. Defines a `TrieNode` class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.\n",
-    "\n",
-    "2. Defines the `findWords` function, which takes the grid (`board`) and a list of words (`words`) as input.\n",
-    "\n",
-    "3. Inside the `findWords` function, there is a `dfs` (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.\n",
-    "\n",
-    "4. The code also includes a `buildTrie` function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.\n",
-    "\n",
-    "5. The dimensions of the grid are obtained (m x n).\n",
-    "\n",
-    "6. A Trie is built using the `buildTrie` function.\n",
-    "\n",
-    "7. A set called `result` is used to store unique words found in the grid.\n",
-    "\n",
-    "8. The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.\n",
-    "\n",
-    "9. During the DFS, it explores neighboring cells (up, down, left, right) if they haven't been visited before and if the current path matches a prefix in the Trie.\n",
-    "\n",
-    "10. When a word is found during the DFS traversal, it is added to the `result` set.\n",
-    "\n",
-    "11. The grid cell is marked as visited during the DFS by changing its character to \"#\", and it is restored to its original character after the DFS traversal.\n",
-    "\n",
-    "12. Finally, the set of unique words found is converted to a list and returned as the output.\n",
-    "\n",
-    "The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['eat', 'oath']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "board1 = [[\"o\",\"a\",\"a\",\"n\"],[\"e\",\"t\",\"a\",\"e\"],[\"i\",\"h\",\"k\",\"r\"],[\"i\",\"f\",\"l\",\"v\"]]\n",
-    "words1 = [\"oath\",\"pea\",\"eat\",\"rain\"]\n",
-    "print(findWords(board1, words1))  # Output: [\"eat\", \"oath\"]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "c748b879-a2d8-4298-a42c-c7f61f9c7fc6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "\n",
-    "board2 = [[\"a\",\"b\"],[\"c\",\"d\"]]\n",
-    "words2 = [\"abcb\"]\n",
-    "print(findWords(board2, words2))  # Output: []"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. **Building the Trie (`buildTrie` function):** \n",
-    "   - Suppose there are `N` words in the input list, and the average length of a word is `L`.\n",
-    "   - Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.\n",
-    "\n",
-    "2. **DFS Traversal (`dfs` function):** \n",
-    "   - In the worst case, the DFS function explores all possible paths in the grid.\n",
-    "   - The maximum number of recursive calls for each cell is 4 (up, down, left, right).\n",
-    "   - The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most `L`.\n",
-    "   - Therefore, the DFS traversal for each cell takes $O(4^L)$ time.\n",
-    "\n",
-    "3. **Iterating Through the Grid (`findWords` function):**\n",
-    "   - In the worst case, we iterate through all `m` rows and `n` columns in the grid.\n",
-    "   - For each cell, we start a DFS traversal.\n",
-    "   - Therefore, iterating through the entire grid takes $O(m * n * 4^L)$ time.\n",
-    "\n",
-    "Overall, the time complexity of the code is $O(N * L + m * n * 4^L)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. **Trie Data Structure:**\n",
-    "   - The space required to store the Trie depends on the number of unique characters in all the words.\n",
-    "   - In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).\n",
-    "   - In practice, it may be less if there are common prefixes among words.\n",
-    "\n",
-    "2. **DFS Stack (Recursive Calls):**\n",
-    "   - The depth of the recursive call stack during DFS is at most `L`, where `L` is the length of the longest word in the Trie.\n",
-    "   - Therefore, the space complexity for the recursive call stack is O(L).\n",
-    "\n",
-    "3. **Result Set (`result` set):**\n",
-    "   - The space used to store the result set depends on the number of valid words found in the grid.\n",
-    "   - In the worst case, when all words are found, the space complexity of the result set is O(N * L).\n",
-    "\n",
-    "Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.\n",
-    "\n",
-    "In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Word Search Paths:**\n",
-    "   Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.\n",
-    "\n",
-    "\n",
-    "2. **Reverse Word Search:**\n",
-    "   Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
deleted file mode 100644
index f82ad98..0000000
--- a/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb	
+++ /dev/null
@@ -1,248 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 1046. Last Stone Weight\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Last Stone Weight problem on LeetCode, click here!](https://leetcode.com/problems/last-stone-weight/)\n",
-    "\n",
-    "---\n",
-    "You are given an array of integers `stones` where `stones[i]` is the weight of the `i`th stone.\n",
-    "\n",
-    "We are playing a game with the stones. On each turn, you choose the **heaviest two stones** and smash them together. Suppose the heaviest two stones have weights `x` and `y` with `x <= y`. The result of this smash is:\n",
-    "\n",
-    "1. If `x == y`, both stones are destroyed.\n",
-    "2. If `x != y`, the stone of weight `x` is destroyed, and the stone of weight `y` has new weight `y - x`.\n",
-    "\n",
-    "At the end of the game, there is **at most one** stone left.\n",
-    "\n",
-    "Return *the weight of the last remaining stone*. If there are no stones left, return `0`.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= stones.length <= 30`\n",
-    "- `1 <= stones[i] <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The \"Last Stone Weight\" problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.\n",
-    "\n",
-    "Here's how the game works:\n",
-    "\n",
-    "1. You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.\n",
-    "\n",
-    "2. In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you've found the answer.\n",
-    "\n",
-    "3. If there are two stones with weights `x` and `y`, where `x` is less than or equal to `y`, the following happens:\n",
-    "   - If `x` is equal to `y`, both stones are completely destroyed, and they are removed from the array of stones.\n",
-    "   - If `x` is not equal to `y`, the stone with weight `x` is destroyed, and the stone with weight `y` now has a new weight of `y - x`. The stone with weight `x` is removed from the array, and the modified stone with weight `y - x` remains in the array.\n",
-    "\n",
-    "4. The game continues with the modified array of stones until there is at most one stone left.\n",
-    "\n",
-    "5. The goal is to find the weight of the last remaining stone, or if there are no stones left, return `0`.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "\n",
-    "def lastStoneWeight(stones):\n",
-    "    # Convert the input list to a max heap (negate the values to simulate a max heap)\n",
-    "    max_heap = [-stone for stone in stones]\n",
-    "    heapq.heapify(max_heap)\n",
-    "\n",
-    "    # Continue as long as there are more than 1 stone in the heap\n",
-    "    while len(max_heap) > 1:\n",
-    "        # Get the two heaviest stones\n",
-    "        y = -heapq.heappop(max_heap)  # Get the heaviest stone and negate it back to positive\n",
-    "        x = -heapq.heappop(max_heap)  # Get the second heaviest stone and negate it back to positive\n",
-    "\n",
-    "        # Calculate the new stone's weight after smashing\n",
-    "        if x != y:\n",
-    "            new_stone = y - x\n",
-    "            heapq.heappush(max_heap, -new_stone)  # Negate the value and push it back to the heap\n",
-    "\n",
-    "    # If there is one stone left, return its weight (negate it back to positive)\n",
-    "    if max_heap:\n",
-    "        return -max_heap[0]\n",
-    "    else:\n",
-    "        return 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a Python function called `lastStoneWeight` that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.\n",
-    "\n",
-    "Here's a step-by-step explanation of the code:\n",
-    "\n",
-    "1. We import the `heapq` library, which allows us to create and manipulate a heap (priority queue).\n",
-    "\n",
-    "2. Inside the `lastStoneWeight` function:\n",
-    "   - We create a max heap (negating stone weights to simulate a max heap) using the `heapq.heapify` function. This heap will keep track of the heaviest stones.\n",
-    "   \n",
-    "   - We enter a loop that continues as long as there are more than 1 stone in the heap.\n",
-    "   \n",
-    "   - Inside the loop, we:\n",
-    "     - Retrieve and negate the heaviest stone (`y`) from the heap.\n",
-    "     - Retrieve and negate the second heaviest stone (`x`) from the heap.\n",
-    "   \n",
-    "     - Calculate the new stone's weight after smashing (`y - x`), and negate it back to simulate a max heap.\n",
-    "     - Add the new stone back to the heap using `heapq.heappush`.\n",
-    "   \n",
-    "3. After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.\n",
-    "   \n",
-    "4. If there are no stones left (the heap is empty), we return `0`, indicating that no stones remain.\n",
-    "\n",
-    "5. Finally, we provide two test cases to demonstrate the function's usage and correctness.\n",
-    "\n",
-    "In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "stones1 = [2, 7, 4, 1, 8, 1]\n",
-    "print(lastStoneWeight(stones1))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "b7e79514-4821-48d0-bb9d-0f2de8150945",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: \n",
-    "\n",
-    "stones2 = [1]\n",
-    "print(lastStoneWeight(stones2))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided Python code for the \"Last Stone Weight\" problem:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The `heapq.heapify` operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.\n",
-    "\n",
-    "2. The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:\n",
-    "   - Retrieving and negating the heaviest stone (`y`) from the heap, which takes O(log n) time.\n",
-    "   - Retrieving and negating the second heaviest stone (`x`) from the heap, also taking O(log n) time.\n",
-    "   - Calculating the new stone's weight and pushing it back into the heap using `heapq.heappush`, which takes O(log n) time.\n",
-    "\n",
-    "3. In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.\n",
-    "\n",
-    "Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).\n",
-    "\n",
-    "2. The rest of the variables used in the function (e.g., `x`, `y`, `new_stone`) require only constant space, so they do not significantly contribute to the space complexity.\n",
-    "\n",
-    "Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: $O(n\\ log\\ n)$\n",
-    "- Space Complexity: $O(n)$\n",
-    "\n",
-    "The algorithm is efficient enough to handle the problem's constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Kth Last Stone Weight**: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.\n",
-    "\n",
-    "\n",
-    "2. **Multiple Stones Smash**: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
deleted file mode 100644
index 6c43a8d..0000000
--- a/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb	
+++ /dev/null
@@ -1,238 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 295. Find Median from Data Stream\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Find Median from Data Stream problem on LeetCode, click here!](https://leetcode.com/problems/find-median-from-data-stream/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "The **median** is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.\n",
-    "\n",
-    "Implement the MedianFinder class:\n",
-    "\n",
-    "- `MedianFinder()` initializes the `MedianFinder` object.\n",
-    "- `void addNum(int num)` adds the integer `num` from the data stream to the data structure.\n",
-    "- `double findMedian()` returns the median of all elements so far. Answers within $10^{-5}$ of the actual answer will be accepted.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- $-10^{5}$ <= `num` <= $10^{5}$\n",
-    "- There will be at least one element in the data structure before calling `findMedian`.\n",
-    "- At most $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-    "\n",
-    "**Follow-up:**\n",
-    "\n",
-    "1. If all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?\n",
-    "2. If `99%` of all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem, \"Find Median from Data Stream,\" deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.\n",
-    "\n",
-    "Here's a breakdown of the problem:\n",
-    "\n",
-    "1. **Initialization**: You are asked to implement a `MedianFinder` class that supports the following operations:\n",
-    "\n",
-    "    - `MedianFinder()`: Initializes the MedianFinder object.\n",
-    "    - `addNum(int num)`: Adds an integer `num` from the data stream to the data structure.\n",
-    "    - `findMedian()`: Returns the median of all elements added to the data structure.\n",
-    "\n",
-    "2. **Median Calculation**: The `findMedian` operation should efficiently compute the median, and the result should have a precision of at least $10^{-5}$ (i.e., answers within this range will be considered correct).\n",
-    "\n",
-    "3. **Examples**:\n",
-    "   \n",
-    "   - If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.\n",
-    "   - If you add numbers [1, 2, 3], the median should be 2 because it's the middle value.\n",
-    "   \n",
-    "4. **Constraints**:\n",
-    "\n",
-    "   - The integers provided in the data stream are in the range from $-10^5$ to $10^5$.\n",
-    "   - There will be at least one element in the data structure before calling `findMedian`.\n",
-    "   - At most, $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-    "\n",
-    "The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "\n",
-    "class MedianFinder:\n",
-    "\n",
-    "    def __init__(self):\n",
-    "        # Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,\n",
-    "        # and a min-heap (large_half) for the larger half of numbers.\n",
-    "        self.small_half = []  # Max-heap for the smaller half of the numbers\n",
-    "        self.large_half = []  # Min-heap for the larger half of the numbers\n",
-    "\n",
-    "    def addNum(self, num: int) -> None:\n",
-    "        # Add the number to the appropriate heap based on its value\n",
-    "        if not self.small_half or num <= -self.small_half[0]:\n",
-    "            # If the number is less than or equal to the current maximum in the smaller half,\n",
-    "            # add it to the smaller half (max-heap)\n",
-    "            heapq.heappush(self.small_half, -num)\n",
-    "        else:\n",
-    "            # Otherwise, add it to the larger half (min-heap)\n",
-    "            heapq.heappush(self.large_half, num)\n",
-    "\n",
-    "        # Balance the heaps if necessary to ensure the size difference is at most 1\n",
-    "        if len(self.small_half) > len(self.large_half) + 1:\n",
-    "            # If the size of the smaller half is more than one greater than the size of the larger half,\n",
-    "            # move the maximum from the smaller half to the larger half to balance them.\n",
-    "            heapq.heappush(self.large_half, -heapq.heappop(self.small_half))\n",
-    "        elif len(self.large_half) > len(self.small_half):\n",
-    "            # If the size of the larger half is greater than the size of the smaller half,\n",
-    "            # move the minimum from the larger half to the smaller half to balance them.\n",
-    "            heapq.heappush(self.small_half, -heapq.heappop(self.large_half))\n",
-    "\n",
-    "    def findMedian(self) -> float:\n",
-    "        if len(self.small_half) == len(self.large_half):\n",
-    "            # If both halves have the same size, there's an even number of elements,\n",
-    "            # so the median is the average of the top elements in both heaps.\n",
-    "            return (-self.small_half[0] + self.large_half[0]) / 2.0\n",
-    "        else:\n",
-    "            # If the smaller half has more elements, it contains the median (odd number of elements).\n",
-    "            return -self.small_half[0]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a `MedianFinder` class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (`small_half`) to store the smaller half of the numbers and a min-heap (`large_half`) to store the larger half. Here's how the code works:\n",
-    "\n",
-    "1. The `__init__` method initializes the two heaps.\n",
-    "\n",
-    "2. The `addNum` method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.\n",
-    "\n",
-    "3. The `findMedian` method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.\n",
-    "\n",
-    "In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1.5\n",
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "medianFinder = MedianFinder()\n",
-    "medianFinder.addNum(1)\n",
-    "medianFinder.addNum(2)\n",
-    "print(medianFinder.findMedian())  # Output: 1.5\n",
-    "medianFinder.addNum(3)\n",
-    "print(medianFinder.findMedian())  # Output: 2.0\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `MedianFinder` class:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. `MedianFinder()` Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.\n",
-    "\n",
-    "2. `addNum(int num)`: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.\n",
-    "\n",
-    "3. `findMedian()`: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. `MedianFinder()` Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.\n",
-    "\n",
-    "2. `addNum(int num)`: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.\n",
-    "\n",
-    "3. `findMedian()`: The space complexity for finding the median is O(1). It doesn't require any additional data structures that grow with the input size.\n",
-    "\n",
-    "In summary, the time complexity of the `addNum` operation is O(log N), and the time complexity of the `findMedian` operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Generalized kth Element**: Extend the `MedianFinder` class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.\n",
-    "\n",
-    "2. **Sliding Window Median**: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
deleted file mode 100644
index e6ab9e3..0000000
--- a/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb	
+++ /dev/null
@@ -1,235 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 703. Kth Largest Element in a Stream\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Kth Largest Element in a Stream problem on LeetCode, click here!](https://leetcode.com/problems/kth-largest-element-in-a-stream/)\n",
-    "\n",
-    "---\n",
-    "Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.\n",
-    "\n",
-    "Implement the `KthLargest` class with the following methods:\n",
-    "\n",
-    "- `KthLargest(int k, int[] nums)`: Initializes the object with the integer `k` and the stream of integers `nums`.\n",
-    "- `int add(int val)`: Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `k` <= $10^4$\n",
-    "- 0 <= `nums.length` <= $10^4$\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- $-10^4$ <= `val` <= $10^4$\n",
-    "- At most $10^4$ calls will be made to `add`.\n",
-    "- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem you're trying to solve is to design a class called `KthLargest` that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:\n",
-    "\n",
-    "To solve this problem efficiently, you can use a min-heap data structure. Here's how the approach works:\n",
-    "\n",
-    "1. Initialize a min-heap to store the k largest elements. Initially, it's empty.\n",
-    "\n",
-    "2. In the `__init__` method, populate the min-heap with the first `k` elements from `nums`. This ensures that you have the k largest elements seen so far.\n",
-    "\n",
-    "3. Whenever you add a new element to the stream using the `add` method, follow these steps:\n",
-    "   - Add the new element to the min-heap.\n",
-    "   - If the size of the min-heap exceeds `k`, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.\n",
-    "   - The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.\n",
-    "\n",
-    "Here's why this approach works efficiently:\n",
-    "\n",
-    "- By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.\n",
-    "\n",
-    "- When you add a new element, the min-heap's size is kept at most `k`, which ensures that you only track the k largest elements and discard the smaller ones.\n",
-    "\n",
-    "- The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).\n",
-    "\n",
-    "- This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.\n",
-    "\n",
-    "In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "from typing import List  # Import the List type from the typing module\n",
-    "\n",
-    "class KthLargest:\n",
-    "\n",
-    "    def __init__(self, k: int, nums: List[int]):\n",
-    "        # Initialize the KthLargest object with k and nums.\n",
-    "        self.k = k\n",
-    "        # Create a min-heap to store the k largest elements.\n",
-    "        self.min_heap = []\n",
-    "        # Populate the min-heap with the first k elements from nums.\n",
-    "        for num in nums:\n",
-    "            self.add(num)\n",
-    "\n",
-    "    def add(self, val: int) -> int:\n",
-    "        # Add val to the min-heap.\n",
-    "        heapq.heappush(self.min_heap, val)\n",
-    "        # If the size of the min-heap exceeds k, remove the smallest element.\n",
-    "        if len(self.min_heap) > self.k:\n",
-    "            heapq.heappop(self.min_heap)\n",
-    "        # The root of the min-heap is the kth largest element.\n",
-    "        return self.min_heap[0]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- We start by importing the necessary modules:\n",
-    "  - `heapq`: This module provides functions to create and manipulate heaps.\n",
-    "  - `List` from the `typing` module: This is used to specify the type of the `nums` parameter.\n",
-    "\n",
-    "- We define the `KthLargest` class:\n",
-    "  - The `__init__` method initializes the object with the integer `k` and the list of integers `nums`.\n",
-    "  - It also creates an empty min-heap called `self.min_heap` to store the k largest elements.\n",
-    "  - It populates the min-heap with the first `k` elements from `nums` by calling the `add` method.\n",
-    "\n",
-    "- The `add` method:\n",
-    "  - Adds the new integer `val` to the min-heap using `heapq.heappush`. This maintains the min-heap property.\n",
-    "  - Checks if the size of the min-heap exceeds `k`. If it does, it removes the smallest element (the k+1th largest) using `heapq.heappop`.\n",
-    "  - Finally, it returns the smallest element in the min-heap, which is always the kth largest element.\n",
-    "\n",
-    "Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n",
-      "5\n",
-      "5\n",
-      "8\n",
-      "8\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "kthLargest = KthLargest(3, [4, 5, 8, 2])\n",
-    "print(kthLargest.add(3))  # Output: 4\n",
-    "print(kthLargest.add(5))  # Output: 5\n",
-    "print(kthLargest.add(10)) # Output: 5\n",
-    "print(kthLargest.add(9))  # Output: 8\n",
-    "print(kthLargest.add(4))  # Output: 8"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `KthLargest` class using the min-heap approach:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. `__init__` method:\n",
-    "   - In the `__init__` method, you iterate over the first `k` elements in `nums` and add them to the min-heap. Each `heapq.heappush` operation takes O(log k) time.\n",
-    "   - Therefore, the time complexity of the `__init__` method is O(k * log k).\n",
-    "\n",
-    "2. `add` method:\n",
-    "   - In the `add` method, you perform the following operations:\n",
-    "     - `heapq.heappush`: O(log k) to add the new element to the min-heap.\n",
-    "     - If the size of the min-heap exceeds `k`, you perform `heapq.heappop`, which is also O(log k).\n",
-    "     - Finally, you return the smallest element from the min-heap, which is O(1) because it's always the root.\n",
-    "   - Overall, the time complexity of the `add` method is O(log k).\n",
-    "\n",
-    "3. Overall, if you make `n` calls to the `add` method, the total time complexity is O(n * log k), where `n` is the total number of elements added to the stream.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The space complexity is determined by the space used to store the min-heap and the instance variables.\n",
-    "2. The min-heap stores at most `k` elements at any given time, so its space complexity is O(k).\n",
-    "3. The instance variables (such as `self.k` and `self.min_heap`) have constant space requirements.\n",
-    "4. Therefore, the overall space complexity of the `KthLargest` class is O(k).\n",
-    "\n",
-    "In summary, the time complexity of the `KthLargest` class is O(n * log k) for `n` add operations, and the space complexity is O(k), where `k` is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem's constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Dynamic k:** Modify the `KthLargest` class to support dynamic changes in the value of `k`. Implement a method `update_k` that allows changing the value of `k` during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of `k`.\n",
-    "\n",
-    "\n",
-    "2. **Implement kth Smallest:** Create a new class called `KthSmallest` that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb b/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb
deleted file mode 100644
index 85d59ac..0000000
--- a/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb	
+++ /dev/null
@@ -1,274 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 39. Combination Sum\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Combination Sum problem on LeetCode, click here!](https://leetcode.com/problems/combination-sum/)\n",
-    "\n",
-    "---\n",
-    "Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of `candidates` where the chosen numbers sum to the `target`*. You may return the combinations in **any order**. \n",
-    "\n",
-    "The **same** number may be chosen from `candidates` an **unlimited number** of times. Two combinations are unique if the **frequency** of at least one of the chosen numbers is different.\n",
-    "\n",
-    "The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= candidates.length <= 30`\n",
-    "- `2 <= candidates[i] <= 40`\n",
-    "- All elements of `candidates` are **distinct**.\n",
-    "- `1 <= target <= 40`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:\n",
-    "\n",
-    "- You are given an array of distinct integers called \"candidates.\"\n",
-    "- You are also given a target integer called \"target.\"\n",
-    "\n",
-    "The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.\n",
-    "\n",
-    "For example:\n",
-    "\n",
-    "**Example 1:**\n",
-    "```python\n",
-    "Input: candidates = [2, 3, 6, 7], target = 7\n",
-    "Output: [[2, 2, 3], [7]]\n",
-    "```\n",
-    "In this example, there are two unique combinations that sum up to the target:\n",
-    "- 2 + 2 + 3 = 7\n",
-    "- 7 = 7\n",
-    "\n",
-    "**Example 2:**\n",
-    "```python\n",
-    "Input: candidates = [2, 3, 5], target = 8\n",
-    "Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n",
-    "```\n",
-    "Here, there are three unique combinations that sum up to the target.\n",
-    "\n",
-    "**Example 3:**\n",
-    "```python\n",
-    "Input: candidates = [2], target = 1\n",
-    "Output: []\n",
-    "```\n",
-    "In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.\n",
-    "\n",
-    "The problem asks you to find and return these combinations in any order.\n",
-    "\n",
-    "The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def combinationSum(candidates, target):\n",
-    "    # Define a recursive DFS function to find combinations\n",
-    "    def dfs(remaining, start, path):\n",
-    "        # If the remaining target is 0, we found a valid combination\n",
-    "        if remaining == 0:\n",
-    "            result.append(path)\n",
-    "            return\n",
-    "        # If the remaining target is negative, this path is invalid\n",
-    "        if remaining < 0:\n",
-    "            return\n",
-    "        # Iterate through candidates starting from 'start' to avoid duplicates\n",
-    "        for i in range(start, len(candidates)):\n",
-    "            # Explore the current candidate by subtracting it from the remaining target\n",
-    "            # Add the current candidate to the path\n",
-    "            dfs(remaining - candidates[i], i, path + [candidates[i]])\n",
-    "\n",
-    "    result = []  # Initialize an empty list to store the result\n",
-    "    candidates.sort()  # Sort the candidates for deduplication and early stopping\n",
-    "    dfs(target, 0, [])  # Start the DFS from the target value with an empty path\n",
-    "    return result  # Return the list of unique combinations"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `combinationSum` function takes an array of distinct integers `candidates` and a target integer `target`. It returns a list of all unique combinations of `candidates` where the chosen numbers sum to the `target`. Each number in the `candidates` array can be used an unlimited number of times.\n",
-    "\n",
-    "Here's an overview of how the code works:\n",
-    "\n",
-    "1. The `combinationSum` function is defined, and it takes two arguments: `candidates` and `target`.\n",
-    "\n",
-    "2. Inside the function, there is a nested helper function called `backtrack`. This function is responsible for the actual combination generation using a recursive approach.\n",
-    "\n",
-    "3. The `backtrack` function is called with three arguments: `start`, `target`, and `path`. The `start` variable helps keep track of the current index in the `candidates` array, `target` keeps track of the remaining sum to be achieved, and `path` is a list that stores the current combination.\n",
-    "\n",
-    "4. Within the `backtrack` function, there are three main conditional statements:\n",
-    "   - If `target` becomes zero, it means we have found a combination that sums up to the target, so we add `path` to the `result` list.\n",
-    "   - If `target` becomes negative, it means the current combination doesn't work, so we return without doing anything.\n",
-    "   - Otherwise, we enter a loop that iterates over the `candidates` array, starting from the current index `start`.\n",
-    "\n",
-    "5. In the loop, the `backtrack` function is called recursively with the updated `target` and `path` after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.\n",
-    "\n",
-    "6. After the loop completes, the `result` list contains all unique combinations that sum to the target.\n",
-    "\n",
-    "7. The `candidates` array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.\n",
-    "\n",
-    "8. Finally, the `backtrack` function is initially called from the `combinationSum` function with `start` set to 0, `target` set to the original target value, and an empty `path`. The result is returned as a list of unique combinations.\n",
-    "\n",
-    "The code includes a few example cases to demonstrate how the function works with different inputs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[2, 2, 3], [7]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example 1\n",
-    "candidates1 = [2, 3, 6, 7]\n",
-    "target1 = 7\n",
-    "print(combinationSum(candidates1, target1))  # Output: [[2, 2, 3], [7]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "candidates2 = [2, 3, 5]\n",
-    "target2 = 8\n",
-    "print(combinationSum(candidates2, target2))  # Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "candidates3 = [2]\n",
-    "target3 = 1\n",
-    "print(combinationSum(candidates3, target3))  # Output: []"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `combinationSum` function.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this function is influenced by the number of recursive calls made by the `backtrack` function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.\n",
-    "\n",
-    "The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as $O(2^n)$, where 'n' is the maximum number of recursive calls. In this context, 'n' corresponds to the number of elements in the `candidates` list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.\n",
-    "\n",
-    "1. The space required for the `result` list can be up to $O(2^n)$ in the worst case because each combination is stored.\n",
-    "\n",
-    "2. The stack space for the recursive calls can also be up to O(n) in the worst case, where 'n' is the number of elements in the `candidates` list.\n",
-    "\n",
-    "Therefore, the overall space complexity of the function is $O(2^n + n)$. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.\n",
-    "\n",
-    "In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Find the Number of Unique Combinations:** Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.\n",
-    "\n",
-    "2. **Combinations with a Maximum Value:** Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb b/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb
deleted file mode 100644
index 8d97d20..0000000
--- a/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb	
+++ /dev/null
@@ -1,290 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 79. Word Search\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Word Search problem on LeetCode, click here!](https://leetcode.com/problems/word-search/)\n",
-    "\n",
-    "---\n",
-    "Given an `m x n` grid of characters `board` and a string `word`, return *`true` if `word` exists in the grid.*\n",
-    "\n",
-    "The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == board.length`\n",
-    "- `n = board[i].length`\n",
-    "- `1 <= m, n <= 6`\n",
-    "- `1 <= word.length <= 15`\n",
-    "- `board` and `word` consists of only lowercase and uppercase English letters.\n",
-    "\n",
-    "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether a given word can be constructed from characters in an `m x n` grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.\n",
-    "\n",
-    "Here are the specifics of the problem:\n",
-    "\n",
-    "- You are given an `m x n` grid, which is a 2D board of characters.\n",
-    "- You are also given a string `word` consisting of lowercase and uppercase English letters.\n",
-    "- Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.\n",
-    "- You can't use the same cell more than once when forming the word.\n",
-    "- If it's possible to form the word in the grid, return `True`; otherwise, return `False`.\n",
-    "\n",
-    "For example, consider the following grid and word:\n",
-    "\n",
-    "```python\n",
-    "board = [[\"A\", \"B\", \"C\", \"E\"],\n",
-    "         [\"S\", \"F\", \"C\", \"S\"],\n",
-    "         [\"A\", \"D\", \"E\", \"E\"]]         \n",
-    "word = \"ABCCED\"\n",
-    "```\n",
-    "\n",
-    "In this case, the word \"ABCCED\" can be formed by moving through the cells (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,3) in the grid. Therefore, the function should return `True`.\n",
-    "\n",
-    "Conversely, if the word is impossible to construct, such as in the case of the word \"ABCB\" for the same grid, where there's no valid path that forms the word, the function should return `False`.\n",
-    "\n",
-    "The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def exist(self, board: List[List[str]], word: str) -> bool:\n",
-    "        def dfs(i, j, k):\n",
-    "            # Check if the current position is out of bounds or doesn't match the character in the word.\n",
-    "            if not (0 <= i < len(board)) or not (0 <= j < len(board[0])) or board[i][j] != word[k]:\n",
-    "                return False\n",
-    "            \n",
-    "            # If we have matched all characters in the word, return True.\n",
-    "            if k == len(word) - 1:\n",
-    "                return True\n",
-    "\n",
-    "            # Temporarily mark the current cell to prevent revisiting.\n",
-    "            tmp, board[i][j] = board[i][j], \"/\"\n",
-    "\n",
-    "            # Explore adjacent cells by making recursive calls in all four directions.\n",
-    "            found = dfs(i + 1, j, k + 1) or dfs(i - 1, j, k + 1) or dfs(i, j + 1, k + 1) or dfs(i, j - 1, k + 1)\n",
-    "\n",
-    "            # Restore the original character in the cell.\n",
-    "            board[i][j] = tmp\n",
-    "\n",
-    "            return found\n",
-    "\n",
-    "        # Iterate through all cells in the board.\n",
-    "        for i in range(len(board)):\n",
-    "            for j in range(len(board[0])):\n",
-    "                # Check if the 'dfs' function starting from this cell returns True.\n",
-    "                if dfs(i, j, 0):\n",
-    "                    return True\n",
-    "\n",
-    "        # If no match is found after exploring all cells, return False.\n",
-    "        return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. Import the necessary module:\n",
-    "   - `from typing import List`: This line imports the `List` type from the `typing` module, which is used to specify the type of the `board` parameter in the method signature.\n",
-    "\n",
-    "2. Define the `Solution` class:\n",
-    "   - `class Solution:`: This line defines a class called `Solution` to encapsulate the solution for the word search problem.\n",
-    "\n",
-    "3. Define the `exist` method:\n",
-    "   - `def exist(self, board: List[List[str]], word: str) -> bool:`: This method is a member of the `Solution` class and takes two parameters: `board`, which is a 2D list of characters, and `word`, which is a string. It returns a boolean value, indicating whether the word exists in the board.\n",
-    "\n",
-    "4. Implement the inner `dfs` function:\n",
-    "   - `def dfs(i, j, k):`: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: `i` and `j` representing the current position on the board, and `k` representing the current index in the `word` string.\n",
-    "\n",
-    "   - Inside `dfs`, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the `word`. If either of these conditions is met, it returns `False`.\n",
-    "\n",
-    "   - If `k` is equal to the length of the `word` minus one, it means we have successfully matched all characters in the `word`, so it returns `True`.\n",
-    "\n",
-    "   - The function then temporarily replaces the character at the current position with a marker, \"/\", to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return `True`, it propagates the `True` result up the call stack. After the exploration is complete, it restores the original character in the cell.\n",
-    "\n",
-    "5. Iterate through the board:\n",
-    "   - The outer loop iterates through all cells in the `board` using two nested loops. For each cell, it checks if the `dfs` function starting from that cell (with `k` initially set to 0) returns `True`. If it does, it means the word exists, so the method returns `True`.\n",
-    "\n",
-    "6. Return `False`:\n",
-    "   - If the loop completes without finding the word in the board, the method returns `False`.\n",
-    "\n",
-    "To use this code, you can create an instance of the `Solution` class and call the `exist` method on that instance, passing the `board` and the `word` as arguments to check if the word exists in the board."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test case 1: Word \"ABCCED\" can be found in the grid\n",
-    "board1 = [[\"A\",\"B\",\"C\",\"E\"],\n",
-    "          [\"S\",\"F\",\"C\",\"S\"],\n",
-    "          [\"A\",\"D\",\"E\",\"E\"]]\n",
-    "word1 = \"ABCCED\"\n",
-    "print(solution.exist(board1, word1))  # Expected output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "\n",
-    "# Test case 2: Word \"SEE\" can be found in the grid\n",
-    "word2 = \"SEE\"\n",
-    "print(solution.exist(board1, word2))  # Expected output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "\n",
-    "# Test case 3: Word \"ABCB\" cannot be found in the grid\n",
-    "word3 = \"ABCB\"\n",
-    "print(solution.exist(board1, word3))  # Expected output: False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `exist` method in the given code.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The primary work in this code is done by the `dfs` function, which performs a depth-first search through the grid. The time complexity of the `dfs` function is $O(4^(n))$, where \"n\" is the length of the `word`. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the `word`.\n",
-    "\n",
-    "The outer loops iterate through all cells in the `board`, which has dimensions `m x n`. So, the total number of iterations of `dfs` is O(m * n). However, since the `dfs` function has a higher time complexity, the overall time complexity is still dominated by the `dfs` function.\n",
-    "\n",
-    "Therefore, the overall time complexity of the `exist` method is $O(m * n * 4^n)$, where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The primary space usage comes from the recursive calls in the `dfs` function. The depth of the recursion can be at most equal to the length of the `word`, which is O(n).\n",
-    "\n",
-    "2. Additionally, the `tmp` variable and the recursive calls on the call stack consume a small amount of additional memory.\n",
-    "\n",
-    "3. The marking of visited cells with the \"/\" character temporarily modifies the `board` in-place but doesn't significantly contribute to the space complexity.\n",
-    "\n",
-    "Therefore, the overall space complexity is O(n) due to the recursive call stack.\n",
-    "\n",
-    "In summary, the time complexity is $O(m * n * 4^n)$, and the space complexity is O(n), where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the code to find all unique words that can be constructed from the grid. Instead of returning `True` or `False`, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.\n",
-    "\n",
-    "2. **Board Generation:** Create a function to generate random grids of characters and then use the `exist` method to solve them. Test the efficiency and correctness of your code by generating larger boards and words."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb b/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb
deleted file mode 100644
index 56b7647..0000000
--- a/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb	
+++ /dev/null
@@ -1,311 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 133. Clone Graph\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Clone Graph problem on LeetCode, click here!](https://leetcode.com/problems/clone-graph/)\n",
-    "\n",
-    "---\n",
-    "Given a reference of a node in a **connected** undirected graph.\n",
-    "\n",
-    "Return a **deep copy** (clone) of the graph.\n",
-    "\n",
-    "Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n",
-    "\n",
-    "```\n",
-    "class Node {\n",
-    "    public int val;\n",
-    "    public List<Node> neighbors;\n",
-    "}\n",
-    "```\n",
-    "\n",
-    "**Test case format:**\n",
-    "\n",
-    "For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n",
-    "\n",
-    "**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n",
-    "\n",
-    "The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the graph is in the range `[0, 100]`.\n",
-    "- `1 <= Node.val <= 100`\n",
-    "- `Node.val` is unique for each node.\n",
-    "- There are no repeated edges and no self-loops in the graph.\n",
-    "- The Graph is connected and all nodes can be visited starting from the given node."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.\n",
-    "\n",
-    "Here are the key aspects of the problem:\n",
-    "\n",
-    "1. **Input**: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.\n",
-    "\n",
-    "2. **Output**: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.\n",
-    "\n",
-    "3. **Graph Structure**: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.\n",
-    "\n",
-    "4. **Connected Graph**: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.\n",
-    "\n",
-    "To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.\n",
-    "\n",
-    "The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a Node.\n",
-    "class Node:\n",
-    "    def __init__(self, val=0, neighbors=None):\n",
-    "        self.val = val\n",
-    "        self.neighbors = neighbors if neighbors is not None else []\n",
-    "\n",
-    "class Solution:\n",
-    "    def cloneGraph(self, node: 'Node') -> 'Node':\n",
-    "        if not node:\n",
-    "            return None\n",
-    "\n",
-    "        visited = {}  # Dictionary to keep track of visited nodes\n",
-    "\n",
-    "        def dfs(original_node):\n",
-    "            if original_node in visited:\n",
-    "                return visited[original_node]\n",
-    "\n",
-    "            # Create a copy of the original node\n",
-    "            copy_node = Node(original_node.val)\n",
-    "            visited[original_node] = copy_node\n",
-    "\n",
-    "            # Recursively clone the neighbors of the original node\n",
-    "            for neighbor in original_node.neighbors:\n",
-    "                copy_node.neighbors.append(dfs(neighbor))\n",
-    "\n",
-    "            return copy_node\n",
-    "\n",
-    "        return dfs(node)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The given code defines a Python class, `Node`, and a solution class, `Solution`, to clone a connected undirected graph represented by nodes and their neighbors. Here's an explanation of the code:\n",
-    "\n",
-    "1. The `Node` class defines a node in the graph. Each node has a value (`val`) which is an integer and a list of neighbors (`neighbors`) that are other nodes in the graph.\n",
-    "\n",
-    "2. The `Solution` class contains the method `cloneGraph`, which takes a reference to the first node of the graph (`node`) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.\n",
-    "\n",
-    "3. Inside the `cloneGraph` method:\n",
-    "   - It first checks if the input `node` is `None`. If it's `None`, it means there is no graph to clone, and the method returns `None`.\n",
-    "\n",
-    "   - It initializes a `visited` dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.\n",
-    "\n",
-    "   - The `dfs` (depth-first search) function is defined within the `cloneGraph` method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.\n",
-    "\n",
-    "   - Inside the `dfs` function:\n",
-    "     - It checks if the original node has been visited before by looking it up in the `visited` dictionary. If it has been visited, it returns the corresponding clone from the `visited` dictionary.\n",
-    "\n",
-    "     - If the original node is not visited, it creates a new node, `copy_node`, with the same value as the original node. This is the first step in creating the clone of the original node.\n",
-    "\n",
-    "     - It then recursively clones the neighbors of the original node by iterating through the `neighbors` list of the original node and appending the corresponding cloned neighbors to the `neighbors` list of the `copy_node`. This step ensures that the relationships between nodes are preserved in the clone.\n",
-    "\n",
-    "     - The `copy_node` is added to the `visited` dictionary with the original node as the key and the clone as the value.\n",
-    "\n",
-    "     - Finally, the `copy_node` is returned as the result of the DFS for the original node.\n",
-    "\n",
-    "4. The `cloneGraph` method returns the result of the DFS on the input `node`, which is the clone of the entire graph with its structure and relationships intact.\n",
-    "\n",
-    "In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1, 2, 4]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "def get_adjacency_list(node):\n",
-    "    visited = {}  # Dictionary to keep track of visited nodes\n",
-    "\n",
-    "    def dfs(node):\n",
-    "        if not node:\n",
-    "            return []\n",
-    "\n",
-    "        if node in visited:\n",
-    "            return visited[node]\n",
-    "\n",
-    "        neighbors = [n.val for n in node.neighbors]\n",
-    "        visited[node] = neighbors\n",
-    "\n",
-    "        for neighbor in node.neighbors:\n",
-    "            dfs(neighbor)\n",
-    "\n",
-    "    dfs(node)\n",
-    "    result = []\n",
-    "\n",
-    "    def get_node_and_neighbors(node):\n",
-    "        result.append([node.val] + visited[node])\n",
-    "\n",
-    "    get_node_and_neighbors(node)\n",
-    "    return result\n",
-    "\n",
-    "\n",
-    "# Testing the code with the provided examples\n",
-    "adjList1 = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Create the graph from adjList\n",
-    "nodes = [Node(i) for i in range(1, len(adjList1) + 1)]\n",
-    "for i, adj in enumerate(adjList1):\n",
-    "    nodes[i].neighbors = [nodes[j - 1] for j in adj]\n",
-    "\n",
-    "# Clone the graph and get its adjacency list\n",
-    "cloned_node1 = solution.cloneGraph(nodes[0])\n",
-    "cloned_adjList1 = get_adjacency_list(cloned_node1)\n",
-    "\n",
-    "# Print the cloned graph as an adjacency list\n",
-    "print(cloned_adjList1)\n",
-    "\n",
-    "# Output should match adjList1\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "# Input: adjList = [[]]\n",
-    "\n",
-    "adjList2 = [[]]\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Create the graph from adjList\n",
-    "node1 = Node(1)\n",
-    "\n",
-    "# Clone the graph and get its adjacency list\n",
-    "cloned_node1 = solution.cloneGraph(node1)\n",
-    "cloned_adjList2 = get_adjacency_list(cloned_node1)\n",
-    "\n",
-    "# Print the cloned graph as an adjacency list\n",
-    "print(cloned_adjList2)\n",
-    "\n",
-    "# Output should be [[]], which represents an empty graph"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).\n",
-    "\n",
-    "Time Complexity:\n",
-    "1. Creating the graph: The time complexity to create the original graph from `adjList` is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in `adjList`.\n",
-    "\n",
-    "2. Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.\n",
-    "\n",
-    "Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.\n",
-    "\n",
-    "Space Complexity:\n",
-    "1. Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.\n",
-    "\n",
-    "2. Storage for the visited dictionary: The `visited` dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.\n",
-    "\n",
-    "3. Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.\n",
-    "\n",
-    "Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the `visited` dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).\n",
-    "\n",
-    "In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Cyclic Graph**: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn't fall into an infinite loop during traversal.\n",
-    "\n",
-    "\n",
-    "2. **Partial Graph Cloning**: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb b/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb
deleted file mode 100644
index 0dd53e9..0000000
--- a/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 178. Graph Valid Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Graph Valid Tree problem on LintCode, click here!](https://www.lintcode.com/problem/178/)\n",
-    "\n",
-    "---\n",
-    "Given `n` nodes labeled from `0` to `n - 1` and a list of `undirected` edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- You can assume that no duplicate edges will appear in edges. Since all edges are `undirected`, `[0, 1]` is the same as `[1, 0]` and thus will not appear together in edges."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a \"tree\" is a specific type of graph with the following properties:\n",
-    "\n",
-    "1. It is a connected graph, meaning there is a path between any pair of nodes in the graph.\n",
-    "2. It has no cycles, which means there are no closed loops or circuits in the graph.\n",
-    "3. It has exactly `n - 1` edges, where `n` is the number of nodes in the tree.\n",
-    "\n",
-    "The problem is typically given with two pieces of information:\n",
-    "\n",
-    "1. The number of nodes (`n`), which are usually labeled from 0 to `n-1`.\n",
-    "2. A list of undirected edges, where each edge is represented as a pair of nodes.\n",
-    "\n",
-    "The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.\n",
-    "\n",
-    "To solve this problem, you need to check the following conditions:\n",
-    "\n",
-    "1. There should be exactly `n - 1` edges to ensure that the graph is connected and tree-like.\n",
-    "2. There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.\n",
-    "3. The graph should be connected, which means you can reach any node from any other node through a series of edges.\n",
-    "\n",
-    "The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def validTree(n, edges):\n",
-    "    if len(edges) != n - 1:\n",
-    "        return False  # A tree with n nodes must have n-1 edges.\n",
-    "\n",
-    "    # Create an adjacency list to represent the graph.\n",
-    "    adj_list = {i: [] for i in range(n)}\n",
-    "    for u, v in edges:\n",
-    "        adj_list[u].append(v)\n",
-    "        adj_list[v].append(u)\n",
-    "\n",
-    "    visited = set()\n",
-    "\n",
-    "    # Define a recursive DFS function.\n",
-    "    def dfs(node, parent):\n",
-    "        if node in visited:\n",
-    "            return False  # If we encounter a visited node, there's a cycle.\n",
-    "        visited.add(node)\n",
-    "\n",
-    "        for neighbor in adj_list[node]:\n",
-    "            if neighbor != parent:\n",
-    "                if not dfs(neighbor, node):\n",
-    "                    return False\n",
-    "\n",
-    "        return True\n",
-    "\n",
-    "    # Start DFS from any node (e.g., node 0).\n",
-    "    if not dfs(0, -1):\n",
-    "        return False  # If there's a cycle, it's not a valid tree.\n",
-    "\n",
-    "    return len(visited) == n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `validTree` function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:\n",
-    "\n",
-    "1. It has exactly `n - 1` edges, where `n` is the number of nodes.\n",
-    "2. There are no cycles in the graph.\n",
-    "3. The graph is connected, meaning all nodes are reachable from any starting node.\n",
-    "\n",
-    "The code accomplishes this as follows:\n",
-    "\n",
-    "- It first checks if the number of edges is equal to `n - 1`. If not, it immediately returns `False` since a tree with `n` nodes must have `n - 1` edges to be connected.\n",
-    "\n",
-    "- It then constructs an adjacency list (`adj_list`) to represent the graph efficiently. This data structure stores the neighbors of each node.\n",
-    "\n",
-    "- The code uses a `visited` set to keep track of nodes visited during depth-first search (DFS).\n",
-    "\n",
-    "- The `dfs` function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns `False`.\n",
-    "\n",
-    "- The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.\n",
-    "\n",
-    "- After the DFS is complete, the code checks if the number of visited nodes is equal to `n`, ensuring the graph is connected.\n",
-    "\n",
-    "- Finally, if all conditions are met, the code returns `True`, indicating that the given edges form a valid tree. Otherwise, it returns `False`.\n",
-    "\n",
-    "The code provides examples to demonstrate how to use the `validTree` function to check whether a set of edges forms a valid tree or not."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "n1 = 5\n",
-    "edges1 = [[0, 1], [0, 2], [0, 3], [1, 4]]\n",
-    "print(validTree(n1, edges1))  # Output: true"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "n2 = 5\n",
-    "edges2 = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]\n",
-    "print(validTree(n2, edges2))  # Output: false"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexities of the `validTree` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. Constructing the adjacency list (`adj_list`) takes O(E) time, where E is the number of edges in the input graph (|edges|).\n",
-    "\n",
-    "2. The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.\n",
-    "\n",
-    "3. Checking if the number of visited nodes is equal to `n` takes O(1) time.\n",
-    "\n",
-    "Overall, the time complexity of the `validTree` function is O(E + V) in the worst case.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The adjacency list (`adj_list`) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.\n",
-    "\n",
-    "2. The `visited` set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.\n",
-    "\n",
-    "3. The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.\n",
-    "\n",
-    "Overall, the space complexity of the `validTree` function is O(V + E) due to the adjacency list and O(V) due to the `visited` set and DFS call stack.\n",
-    "\n",
-    "In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Minimum Spanning Tree (MST)**: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal's or Prim's algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.\n",
-    "\n",
-    "2. **Detecting Cycles**: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it's not a tree. This exercise enhances your ability to detect and visualize cycles in a graph."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb b/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb
deleted file mode 100644
index 5a878a4..0000000
--- a/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb	
+++ /dev/null
@@ -1,236 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 200. Number of Islands\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Number of Islands problem on LeetCode, click here!](https://leetcode.com/problems/number-of-islands/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return *the number of islands*. \n",
-    "\n",
-    "An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == grid.length`\n",
-    "- `n == grid[i].length`\n",
-    "- `1 <= m, n <= 300`\n",
-    "- `grid[i][j]` is `'0'` or `'1'`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is about counting the number of islands in a 2D binary grid. In this grid, '1' represents land, and '0' represents water. An island is defined as a group of '1' cells that are adjacent to each other either horizontally or vertically. It's important to note that diagonal connections do not count. Additionally, it's assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn't \"wrap around.\"\n",
-    "\n",
-    "The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected '1' cells, and these connections can only occur horizontally or vertically. If there are no '1' cells in the grid, the number of islands would be zero.\n",
-    "\n",
-    "The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one '1' cell and explore its adjacent cells to determine the extent of the island. Once you've visited all the '1' cells in an island, you move on to the next unvisited '1' cell and repeat the process until you've counted all the islands in the grid.\n",
-    "\n",
-    "In essence, the problem asks you to analyze the grid to find groups of connected '1' cells and count them as individual islands. The goal is to return the total count of islands in the given grid.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def numIslands(self, grid: List[List[str]]) -> int:\n",
-    "        if not grid:\n",
-    "            return 0\n",
-    "\n",
-    "        m, n = len(grid), len(grid[0])  # Get the dimensions of the grid\n",
-    "        num_islands = 0  # Initialize the count of islands\n",
-    "\n",
-    "        def dfs(row, col):\n",
-    "            if row < 0 or row >= m or col < 0 or col >= n or grid[row][col] == '0':\n",
-    "                return\n",
-    "\n",
-    "            grid[row][col] = '0'  # Mark the current cell as visited by changing it to '0'\n",
-    "            directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]  # Define four possible directions to move\n",
-    "\n",
-    "            for dr, dc in directions:\n",
-    "                # Explore adjacent cells\n",
-    "                dfs(row + dr, col + dc)\n",
-    "\n",
-    "        for i in range(m):\n",
-    "            for j in range(n):\n",
-    "                if grid[i][j] == '1':\n",
-    "                    num_islands += 1  # Increment the island count\n",
-    "                    dfs(i, j)  # Start a DFS from the current '1' cell to explore the entire island\n",
-    "\n",
-    "        return num_islands\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a Python class called `Solution` with a method called `numIslands`. This class is designed to count the number of islands in a 2D binary grid.\n",
-    "\n",
-    "The `numIslands` method takes a 2D grid as input, where '1' represents land, and '0' represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:\n",
-    "\n",
-    "1. Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).\n",
-    "\n",
-    "2. Determining the dimensions of the grid (number of rows and columns).\n",
-    "\n",
-    "3. Initializing a variable `num_islands` to keep track of the count of islands.\n",
-    "\n",
-    "4. Defining a nested function `dfs` to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing '1' to '0'.\n",
-    "\n",
-    "5. In the `dfs` function, it checks for boundary conditions and whether the current cell is '0'. If these conditions are met, it returns without further exploration.\n",
-    "\n",
-    "6. The `dfs` function explores neighboring cells in all four directions (up, down, left, right) using a loop.\n",
-    "\n",
-    "7. The main loop iterates through each cell of the grid. When a '1' cell is encountered, it increments the `num_islands` count and starts a DFS from that cell to explore the entire island.\n",
-    "\n",
-    "8. Finally, the method returns the total count of islands found in the grid.\n",
-    "\n",
-    "This code encapsulates the solution in a class, allowing you to create an instance of the `Solution` class and call the `numIslands` method on it to count the number of islands in a given grid."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 1 Output: 1\n"
-     ]
-    }
-   ],
-   "source": [
-    "grid1 = [\n",
-    "  [\"1\", \"1\", \"1\", \"1\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"1\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"0\", \"0\", \"0\"]\n",
-    "]\n",
-    "\n",
-    "solution = Solution()\n",
-    "result1 = solution.numIslands(grid1)\n",
-    "print(\"Example 1 Output:\", result1)  # Expected output: 1\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 2 Output: 3\n"
-     ]
-    }
-   ],
-   "source": [
-    "grid2 = [\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"1\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"0\", \"1\", \"1\"]\n",
-    "]\n",
-    "\n",
-    "result2 = solution.numIslands(grid2)\n",
-    "print(\"Example 2 Output:\", result2)  # Expected output: 3\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "Time Complexity:\n",
-    "- The code uses a depth-first search (DFS) to explore the grid and count the number of islands.\n",
-    "- In the worst case, it visits every cell in the grid exactly once.\n",
-    "- The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of $O(4^{max(m, n)})$, where m is the number of rows and n is the number of columns.\n",
-    "- Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.\n",
-    "\n",
-    "Space Complexity:\n",
-    "- The space complexity is determined by the recursive calls and the depth of the DFS stack.\n",
-    "- In the worst case, when the entire grid consists of '1's, the depth of the DFS recursion can be as deep as max(m, n).\n",
-    "- Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.\n",
-    "\n",
-    "In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it's important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n))."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Identify Largest Island:** In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.\n",
-    "\n",
-    "2. **Optimize for Space:** Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb b/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb
deleted file mode 100644
index 4176cab..0000000
--- a/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 207. Course Schedule\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Course Schedule problem on LeetCode, click here!](https://leetcode.com/problems/course-schedule/)\n",
-    "\n",
-    "---\n",
-    "There are a total of `numCourses` courses to take, labeled from 0 to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`. \n",
-    "\n",
-    "- For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.\n",
-    "\n",
-    "Return `true` if you can finish all courses. Otherwise, return `false`.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `numCourses` <= 2000\n",
-    "- 0 <= `prerequisites.length` <= 5000\n",
-    "- `prerequisites[i].length` == 2\n",
-    "- 0 <= `ai`, `bi` < `numCourses`\n",
-    "- All the pairs `prerequisites[i]` are **unique**."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether it's possible to complete a set of courses given a list of prerequisites. You are given the following:\n",
-    "\n",
-    "- `numCourses`: The total number of courses to be taken, labeled from 0 to `numCourses - 1`.\n",
-    "- `prerequisites`: A list of prerequisite courses, where each element `prerequisites[i]` is a pair `[ai, bi]`, indicating that you must take course `bi` before you can take course `ai`.\n",
-    "\n",
-    "The goal is to check whether it's possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.\n",
-    "\n",
-    "For example:\n",
-    "\n",
-    "- If `numCourses` is 2, and `prerequisites` is `[[1, 0]]`, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it's possible to complete all courses, so the function should return `True`.\n",
-    "\n",
-    "- If `numCourses` is 2, and `prerequisites` is `[[1, 0], [0, 1]]`, it means you have two courses, but there's a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it's impossible to complete all courses, so the function should return `False`.\n",
-    "\n",
-    "The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it's possible to complete all courses; otherwise, it's not possible.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict, deque\n",
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n",
-    "        # Create a graph using an adjacency list to represent the courses and their prerequisites.\n",
-    "        graph = defaultdict(list)  # Initialize an empty adjacency list.\n",
-    "        in_degree = [0] * numCourses  # Initialize an array to store in-degrees of courses.\n",
-    "\n",
-    "        # Populate the graph and calculate in-degrees.\n",
-    "        for course, prerequisite in prerequisites:\n",
-    "            graph[prerequisite].append(course)  # Add the course as a neighbor to its prerequisite.\n",
-    "            in_degree[course] += 1  # Increment the in-degree of the course.\n",
-    "\n",
-    "        # Initialize a queue with courses that have no prerequisites.\n",
-    "        queue = deque()\n",
-    "        for course in range(numCourses):\n",
-    "            if in_degree[course] == 0:\n",
-    "                queue.append(course)\n",
-    "\n",
-    "        # Perform topological sorting.\n",
-    "        while queue:\n",
-    "            course = queue.popleft()  # Take a course with no prerequisites.\n",
-    "            numCourses -= 1  # Decrement the count of remaining courses.\n",
-    "\n",
-    "            for neighbor in graph[course]:\n",
-    "                in_degree[neighbor] -= 1  # Remove the prerequisite relationship.\n",
-    "                if in_degree[neighbor] == 0:\n",
-    "                    queue.append(neighbor)  # If no more prerequisites, add to the queue.\n",
-    "\n",
-    "        # If all courses were successfully taken (numCourses becomes 0), return True.\n",
-    "        return numCourses == 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here's a brief explanation of the code:\n",
-    "\n",
-    "1. The code defines a `Solution` class with a `canFinish` method that takes two parameters: `numCourses` (the total number of courses) and `prerequisites` (a list of pairs indicating which course must be taken before another).\n",
-    "\n",
-    "2. It initializes an empty graph as an adjacency list using a `defaultdict` to represent the courses and their prerequisites. It also initializes a list called `in_degree` to keep track of the in-degrees of courses, which is used in the topological sorting process.\n",
-    "\n",
-    "3. The code then populates the graph by iterating through the `prerequisites` list. For each pair `(ai, bi)`, it adds course `ai` as a neighbor to its prerequisite course `bi` in the graph and increments the in-degree of course `ai`.\n",
-    "\n",
-    "4. Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.\n",
-    "\n",
-    "5. The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).\n",
-    "\n",
-    "6. For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor's in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.\n",
-    "\n",
-    "7. The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.\n",
-    "\n",
-    "8. After the loop, if all courses were successfully taken (i.e., `numCourses` becomes 0), it means that there were no circular dependencies, and it's possible to finish all courses. In this case, the method returns `True`. Otherwise, if there are remaining courses (indicating a circular dependency), it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "numCourses1 = 2\n",
-    "prerequisites1 = [[1, 0]]\n",
-    "sol = Solution()\n",
-    "print(sol.canFinish(numCourses1, prerequisites1))  # Output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "numCourses2 = 2\n",
-    "prerequisites2 = [[1, 0], [0, 1]]\n",
-    "print(sol.canFinish(numCourses2, prerequisites2))  # Output: False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `canFinish` method:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. Constructing the graph: In the first loop where we iterate through the `prerequisites` list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).\n",
-    "\n",
-    "2. Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all `numCourses` courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).\n",
-    "\n",
-    "3. Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).\n",
-    "\n",
-    "The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.\n",
-    "\n",
-    "2. In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.\n",
-    "\n",
-    "3. Queue: The space complexity for the queue is O(V), as it may contain all the courses.\n",
-    "\n",
-    "The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-    "\n",
-    "In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimizing Course Scheduling**: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.\n",
-    "\n",
-    "2. **Detecting Cycles in Course Dependencies**: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
deleted file mode 100644
index a2789c4..0000000
--- a/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb	
+++ /dev/null
@@ -1,230 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 3651. Number of Connected Components in an Undirected Graph\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!](https://www.lintcode.com/problem/3651/)\n",
-    "\n",
-    "---\n",
-    "In this problem, there is an undirected graph with `n` nodes. There is also an `edges` array. Where `edges[i] = [a, b]` means that there is an edge between *node a* and *node b* in the graph.\n",
-    "\n",
-    "You need to return *the number of connected components in that graph*."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to determine the number of connected components in an undirected graph. Here's a more detailed explanation of the problem:\n",
-    "\n",
-    "- You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.\n",
-    "\n",
-    "- A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.\n",
-    "\n",
-    "- Your task is to write a function that takes as input the number of nodes `n` and a list of edges `edges`, where each edge is represented as a pair of nodes `[a, b]` indicating an edge between node `a` and node `b`.\n",
-    "\n",
-    "- The goal is to determine the number of distinct connected components in the graph.\n",
-    "\n",
-    "- You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def countConnectedComponents(n, edges):\n",
-    "    # Define a helper function for depth-first search (DFS).\n",
-    "    def dfs(node):\n",
-    "        if not visited[node]:  # If the node has not been visited yet:\n",
-    "            visited[node] = True  # Mark it as visited.\n",
-    "            for neighbor in graph[node]:  # Explore all neighbors of the current node.\n",
-    "                dfs(neighbor)  # Recursively call DFS on the neighbor.\n",
-    "\n",
-    "    # Create an empty adjacency list to represent the graph.\n",
-    "    graph = [[] for _ in range(n)]\n",
-    "\n",
-    "    # Initialize a boolean list to keep track of visited nodes.\n",
-    "    visited = [False] * n\n",
-    "\n",
-    "    # Populate the adjacency list with edges from the input.\n",
-    "    for a, b in edges:\n",
-    "        graph[a].append(b)\n",
-    "        graph[b].append(a)  # Since the graph is undirected, we add edges in both directions.\n",
-    "\n",
-    "    # Initialize a counter to keep track of the number of connected components.\n",
-    "    count = 0\n",
-    "\n",
-    "    # Iterate through all nodes in the graph.\n",
-    "    for i in range(n):\n",
-    "        if not visited[i]:  # If the node has not been visited:\n",
-    "            count += 1  # Increment the count since we've found a new connected component.\n",
-    "            dfs(i)  # Start a depth-first search from the unvisited node to explore the component.\n",
-    "\n",
-    "    return count"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided Python code calculates the number of connected components in an undirected graph. Here's a high-level explanation of how the code works:\n",
-    "\n",
-    "1. The `countConnectedComponents` function takes two arguments: `n` (the number of nodes in the graph) and `edges` (a list of edge pairs representing connections between nodes).\n",
-    "\n",
-    "2. Inside the function, there is a helper function called `dfs` (depth-first search), which is used to explore and mark nodes as visited.\n",
-    "\n",
-    "3. An empty adjacency list called `graph` is created to represent the graph. The `graph` is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.\n",
-    "\n",
-    "4. Another list called `visited` is created to keep track of visited nodes. Initially, all nodes are marked as not visited (`False`).\n",
-    "\n",
-    "5. The code populates the `graph` by iterating through the `edges` list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.\n",
-    "\n",
-    "6. A counter variable called `count` is initialized to keep track of the number of connected components.\n",
-    "\n",
-    "7. The code iterates through all nodes from `0` to `n-1`. For each node, it checks whether it has been visited yet. If it hasn't been visited, it means a new connected component is found. The counter `count` is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.\n",
-    "\n",
-    "8. The `dfs` function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling `dfs` on unvisited neighbors.\n",
-    "\n",
-    "9. After the loop through all nodes, the `count` variable contains the total number of connected components in the graph.\n",
-    "\n",
-    "10. The function returns the value of `count`, which represents the number of connected components.\n",
-    "\n",
-    "11. Two examples are provided at the end to demonstrate how to use the function with different inputs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "n1 = 3\n",
-    "edges1 = [[0, 1], [0, 2]]\n",
-    "print(countConnectedComponents(n1, edges1))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "n2 = 6\n",
-    "edges2 = [[0, 1], [1, 2], [2, 3], [4, 5]]\n",
-    "print(countConnectedComponents(n2, edges2))  # Output: 2"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code iterates through all nodes in the graph (from 0 to `n-1`).\n",
-    "- For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.\n",
-    "- In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.\n",
-    "- The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.\n",
-    "- In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.\n",
-    "\n",
-    "So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The main data structures used are the `graph` (adjacency list), `visited` (boolean array), and the recursive call stack for DFS.\n",
-    "- The `graph` has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.\n",
-    "- The `visited` boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.\n",
-    "- The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.\n",
-    "\n",
-    "So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).\n",
-    "\n",
-    "In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Disconnected Components with Multiple Queries:** You are given an undirected graph with `n` nodes and `m` edges. Initially, the graph is disconnected, and you need to process `q` queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.\n",
-    "\n",
-    "2. **Maximum Size of Connected Components:** Given an undirected graph with `n` nodes and `m` edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.\n"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
deleted file mode 100644
index c685b23..0000000
--- a/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb	
+++ /dev/null
@@ -1,255 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 417. Pacific Atlantic Water Flow\n",
-    "\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Pacific Atlantic Water Flow problem on LeetCode, click here!](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n",
-    "\n",
-    "---\n",
-    "There is an `m x n` rectangular island that borders both the **Pacific Ocean** and **Atlantic Ocean**. The **Pacific Ocea**n touches the island's left and top edges, and the **Atlantic Ocean** touches the island's right and bottom edges.\n",
-    "\n",
-    "The island is partitioned into a grid of square cells. You are given an `m x n` integer matrix `heights` where `heights[r][c]` represents the **height above sea level** of the cell at coordinate `(r, c)`.\n",
-    "\n",
-    "The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is **less than or equal to** the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.\n",
-    "\n",
-    "Return *a **2D list** of grid coordinates `result` where $result[i] = [r_i, c_i]$ denotes that rain water can flow from cell $(r_i, c_i)$ to **both** the Pacific and Atlantic oceans*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == heights.length`\n",
-    "- `n == heights[r].length`\n",
-    "- `1 <= m, n <= 200`\n",
-    "- 0 <= `heights[r][c]` <= $10^5$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island's left and top edges, while the Atlantic Ocean is in contact with the island's right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "Here are the key details and constraints of the problem:\n",
-    "\n",
-    "1. The island is divided into a grid of square cells.\n",
-    "\n",
-    "2. Each cell is represented by an integer value in a matrix `heights`. The value at `heights[r][c]` represents the height above sea level of the cell at coordinates `(r, c)` on the island.\n",
-    "\n",
-    "3. Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell's height is less than or equal to the current cell's height.\n",
-    "\n",
-    "4. Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.\n",
-    "\n",
-    "The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.\n",
-    "\n",
-    "The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.\n",
-    "\n",
-    "The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:\n",
-    "        # Check if the input matrix is empty\n",
-    "        if not heights:\n",
-    "            return []\n",
-    "        \n",
-    "        m, n = len(heights), len(heights[0])\n",
-    "        \n",
-    "        # Initialize boolean matrices to keep track of cells reachable from each ocean\n",
-    "        pacific_reachable = [[False] * n for _ in range(m)]\n",
-    "        atlantic_reachable = [[False] * n for _ in range(m)]\n",
-    "        \n",
-    "        # Depth-First Search (DFS) function to mark cells that can be reached from an ocean\n",
-    "        def dfs(x, y, reachable):\n",
-    "            if reachable[x][y]:\n",
-    "                return\n",
-    "            reachable[x][y] = True\n",
-    "            for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n",
-    "                new_x, new_y = x + dx, y + dy\n",
-    "                if 0 <= new_x < m and 0 <= new_y < n and heights[new_x][new_y] >= heights[x][y]:\n",
-    "                    dfs(new_x, new_y, reachable)\n",
-    "        \n",
-    "        # Start DFS from the Pacific Ocean (left and top edges)\n",
-    "        for i in range(m):\n",
-    "            dfs(i, 0, pacific_reachable)\n",
-    "            dfs(i, n - 1, atlantic_reachable)\n",
-    "        \n",
-    "        for j in range(n):\n",
-    "            dfs(0, j, pacific_reachable)\n",
-    "            dfs(m - 1, j, atlantic_reachable)\n",
-    "        \n",
-    "        result = []\n",
-    "        \n",
-    "        # Find cells that can flow to both the Pacific and Atlantic oceans\n",
-    "        for i in range(m):\n",
-    "            for j in range(n):\n",
-    "                if pacific_reachable[i][j] and atlantic_reachable[i][j]:\n",
-    "                    result.append([i, j])\n",
-    "        \n",
-    "        return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a class called `Solution` with a method named `pacificAtlantic`. This method takes a 2D matrix `heights`, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, `pacific_reachable` and `atlantic_reachable`, to keep track of cells that can be reached from each ocean.\n",
-    "\n",
-    "The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell's height is less than or equal to the current cell's height.\n",
-    "\n",
-    "After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the `result` list.\n",
-    "\n",
-    "Finally, the code returns the `result` list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "heights1 = [\n",
-    "    [1,2,2,3,5],\n",
-    "    [3,2,3,4,4],\n",
-    "    [2,4,5,3,1],\n",
-    "    [6,7,1,4,5],\n",
-    "    [5,1,1,2,4]\n",
-    "]\n",
-    "\n",
-    "solution = Solution()\n",
-    "print(solution.pacificAtlantic(heights1)) # Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "heights2 = [[1]]\n",
-    "print(solution.pacificAtlantic(heights2)) # Expected Output: [[0, 0]]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Time Complexity:\n",
-    "The time complexity of this solution is O(m * n), where 'm' is the number of rows in the input matrix and 'n' is the number of columns. Here's a breakdown of the time complexity:\n",
-    "\n",
-    "1. Creating the `pacific_reachable` and `atlantic_reachable` matrices with dimensions m x n takes O(m * n) time.\n",
-    "\n",
-    "2. Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.\n",
-    "\n",
-    "3. The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.\n",
-    "\n",
-    "4. The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.\n",
-    "\n",
-    "Overall, the time complexity is dominated by the DFS and is O(m * n).\n",
-    "\n",
-    "Space Complexity:\n",
-    "The space complexity of this solution is also O(m * n). Here's how the space is used:\n",
-    "\n",
-    "1. Two boolean matrices, `pacific_reachable` and `atlantic_reachable`, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.\n",
-    "\n",
-    "2. The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).\n",
-    "\n",
-    "3. The `result` list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.\n",
-    "\n",
-    "The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.\n",
-    "\n",
-    "2. **Efficiency Challenge:** Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb b/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb
deleted file mode 100644
index 19db846..0000000
--- a/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb	
+++ /dev/null
@@ -1,250 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 892. Alien Dictionary\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Alien Dictionary problem on LintCode, click here!](https://www.lintcode.com/problem/892/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of **non-empty** words from the dictionary, where words are **sorted lexicographically by the rules of this new language**. Derive the order of letters in this language.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- You may assume all letters are in lowercase.\n",
-    "- The dictionary is invalid, if string a is prefix of string b and b is appear before a.\n",
-    "- If the order is invalid, return an empty string.\n",
-    "- There may be multiple valid order of letters, return the smallest in normal lexicographical order.\n",
-    "- The letters in **one** string are of the same rank by default and are sorted in Human dictionary order."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.\n",
-    "\n",
-    "Here's a more detailed explanation of the problem:\n",
-    "\n",
-    "1. The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.\n",
-    "\n",
-    "2. Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.\n",
-    "\n",
-    "3. Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string 'a' is a prefix of another string 'b,' and 'b' appears before 'a' in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.\n",
-    "\n",
-    "4. Multiple valid orders: It's possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.\n",
-    "\n",
-    "To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it's valid, and an empty string if the order is invalid.\n",
-    "\n",
-    "The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict, deque\n",
-    "\n",
-    "def alienOrder(words):\n",
-    "    # Create an adjacency list to represent the graph\n",
-    "    graph = defaultdict(list)\n",
-    "    \n",
-    "    # Create a dictionary to store the in-degrees of each letter\n",
-    "    in_degree = {}\n",
-    "    \n",
-    "    # Initialize in-degrees to 0 for all letters\n",
-    "    for word in words:\n",
-    "        for char in word:\n",
-    "            if char not in in_degree:\n",
-    "                in_degree[char] = 0\n",
-    "    \n",
-    "    # Build the graph and update in-degrees\n",
-    "    for i in range(1, len(words)):\n",
-    "        word1, word2 = words[i-1], words[i]\n",
-    "        min_length = min(len(word1), len(word2))\n",
-    "        \n",
-    "        # Compare characters in the two words\n",
-    "        j = 0\n",
-    "        while j < min_length and word1[j] == word2[j]:\n",
-    "            j += 1\n",
-    "        \n",
-    "        if j < min_length:\n",
-    "            # If word1[j] is lexicographically before word2[j], add an edge\n",
-    "            graph[word1[j]].append(word2[j])\n",
-    "            in_degree[word2[j]] += 1\n",
-    "            \n",
-    "            # Break the loop to avoid further comparisons\n",
-    "            break\n",
-    "    \n",
-    "    # Perform topological sorting using Kahn's algorithm\n",
-    "    result = []\n",
-    "    queue = deque([char for char in in_degree if in_degree[char] == 0])\n",
-    "    \n",
-    "    while queue:\n",
-    "        char = queue.popleft()\n",
-    "        result.append(char)\n",
-    "        \n",
-    "        for neighbor in graph[char]:\n",
-    "            in_degree[neighbor] -= 1\n",
-    "            if in_degree[neighbor] == 0:\n",
-    "                queue.append(neighbor)\n",
-    "    \n",
-    "    # Check if there is a valid order\n",
-    "    if len(result) < len(in_degree):\n",
-    "        return \"\"\n",
-    "    \n",
-    "    return \"\".join(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.\n",
-    "\n",
-    "The code follows these main steps:\n",
-    "\n",
-    "1. Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called `in_degree` to keep track of the in-degrees (the number of letters that precede a letter) for each letter.\n",
-    "\n",
-    "2. Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the `in_degree` dictionary with an initial in-degree of 0.\n",
-    "\n",
-    "3. Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there's an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.\n",
-    "\n",
-    "4. After constructing the graph, the code performs a topological sorting of the letters using Kahn's algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.\n",
-    "\n",
-    "5. Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there's a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.\n",
-    "\n",
-    "The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "wrtef\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "words1 = [\"wrt\", \"wrf\", \"er\", \"ett\", \"rftt\"]\n",
-    "print(alienOrder(words1))  # Output: \"wertf\""
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "zx\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "words2 = [\"z\", \"x\"]\n",
-    "print(alienOrder(words2))  # Output: \"zx\""
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for determining the order of letters in an alien language.\n",
-    "\n",
-    "Time Complexity:\n",
-    "1. Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.\n",
-    "2. Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.\n",
-    "\n",
-    "Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.\n",
-    "\n",
-    "Space Complexity:\n",
-    "1. Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.\n",
-    "2. Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.\n",
-    "3. Queue: The space used by the queue during topological sorting is also O(V).\n",
-    "\n",
-    "Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.\n",
-    "\n",
-    "In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.\n",
-    "\n",
-    "In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Valid Orders**: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.\n",
-    "\n",
-    "2. **Detect Invalid Dictionary**: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb b/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb
deleted file mode 100644
index 9539363..0000000
--- a/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# House Robber\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "---\n",
-    "You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night.**\n",
-    "\n",
-    "Given an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight **without alerting the police**.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= nums.length <= 100`\n",
-    "- `0 <= nums[i] <= 400`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is a classic dynamic programming challenge known as the \"House Robber\" problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.\n",
-    "\n",
-    "The goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.\n",
-    "\n",
-    "The input to the problem is an array `nums`, where `nums[i]` represents the amount of money in the `i`-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.\n",
-    "\n",
-    "For example:\n",
-    "```\n",
-    "Input: nums = [1,2,3,1]\n",
-    "Output: 4\n",
-    "Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).\n",
-    "Total amount you can rob = 1 + 3 = 4.\n",
-    "\n",
-    "Input: nums = [2,7,9,3,1]\n",
-    "Output: 12\n",
-    "Explanation: Rob house 1 (money = 2), rob house 3 (money = 9), and rob house 5 (money = 1).\n",
-    "Total amount you can rob = 2 + 9 + 1 = 12.\n",
-    "```\n",
-    "\n",
-    "The challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def rob(self, nums: List[int]) -> int:\n",
-    "        # Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses\n",
-    "        prev, curr = 0, 0\n",
-    "\n",
-    "        # Iterate through the houses\n",
-    "        for n in nums:\n",
-    "            # Calculate the maximum amount of money that can be robbed at the current house\n",
-    "            # It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),\n",
-    "            # or skipping the current house and taking the maximum amount from the previous house (curr)\n",
-    "            temp = max(n + prev, curr)\n",
-    "\n",
-    "            # Update the variables for the next iteration\n",
-    "            prev, curr = curr, temp\n",
-    "\n",
-    "        # The final result is the maximum amount of money that can be robbed at the last house\n",
-    "        return curr"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code is a Python implementation of the \"House Robber\" problem using a dynamic programming approach. It's part of a class `Solution` and includes a method `rob` that takes a list of integers `nums` as input and returns the maximum amount of money that can be robbed without alerting the police.\n",
-    "\n",
-    "The key idea of the algorithm is to maintain two variables, `prev` and `curr`, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.\n",
-    "\n",
-    "The loop calculates a temporary variable `temp` that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (`n + prev`), or skipping the current house and taking the maximum amount from the previous house (`curr`). The maximum of these two scenarios is assigned to `temp`.\n",
-    "\n",
-    "The `prev` and `curr` variables are then updated for the next iteration. `prev` is set to the previous value of `curr`, and `curr` is set to the calculated `temp`.\n",
-    "\n",
-    "The final result is the value stored in the `curr` variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the `rob` method.\n",
-    "\n",
-    "The provided test cases at the end demonstrate the usage of the `rob` method with different input arrays."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "sol = Solution()\n",
-    "\n",
-    "nums1 = [1, 2, 3, 1]\n",
-    "print(sol.rob(nums1))  # Output: 4"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "12\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [2, 7, 9, 3, 1]\n",
-    "print(sol.rob(nums2))  # Output: 12"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code.\n",
-    "\n",
-    "### Time Complexity:\n",
-    "\n",
-    "The time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).\n",
-    "\n",
-    "### Space Complexity:\n",
-    "\n",
-    "The space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables `prev`, `curr`, and `temp` are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(n)\n",
-    "- Space Complexity: O(1)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Variation with Maximum Number of Houses to Rob:** Modify the problem to include an additional constraint: you are allowed to rob at most 'k' houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.\n",
-    "\n",
-    "2. **Robbing in a Circular Street:** Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.\n",
-    "\n",
-    "\n",
-    "**Link to Problem:** [To see the House Robber problem on LeetCode, click here!](https://leetcode.com/problems/house-robber/description/)\n"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb b/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb
deleted file mode 100644
index d210017..0000000
--- a/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# House Robber II\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "---\n",
-    "You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle**. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatically contact the police if two adjacent houses were broken into on the same night**.\n",
-    "\n",
-    "Given an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight without alerting the police*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= nums.length <= 100`\n",
-    "- `0 <= nums[i] <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "Certainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.\n",
-    "\n",
-    "The twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.\n",
-    "\n",
-    "The goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array `nums` representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.\n",
-    "\n",
-    "Here are a few examples to illustrate the problem:\n",
-    "\n",
-    "1. **Example 1:**\n",
-    "   ```python\n",
-    "   Input: nums = [2, 3, 2]\n",
-    "   Output: 3\n",
-    "   Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2) because they are adjacent houses. The optimal strategy is to rob house 2 (money = 3).\n",
-    "   ```\n",
-    "\n",
-    "2. **Example 2:**\n",
-    "   ```python\n",
-    "   Input: nums = [1, 2, 3, 1]\n",
-    "   Output: 4\n",
-    "   Explanation: Robbing house 1 (money = 1) and then robbing house 3 (money = 3) results in a total amount of 4. Robbing house 2 is skipped to avoid alerting the police.\n",
-    "   ```\n",
-    "\n",
-    "3. **Example 3:**\n",
-    "   ```python\n",
-    "   Input: nums = [1, 2, 3]\n",
-    "   Output: 3\n",
-    "   Explanation: Since the houses are in a circle, you can choose either house 1, 2, or 3. The optimal strategy is to rob house 3 for a total amount of 3.\n",
-    "   ```\n",
-    "\n",
-    "The constraints for the problem are that the length of the `nums` array is between 1 and 100, and the amount of money in each house (`nums[i]`) is between 0 and 1000.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def rob(self, nums: List[int]) -> int:\n",
-    "        def simple_rob(nums):\n",
-    "            # Helper function for basic house robbery problem\n",
-    "            prev, curr = 0, 0\n",
-    "            for num in nums:\n",
-    "                # Calculate the maximum amount of money that can be robbed\n",
-    "                # without alerting the police for each house\n",
-    "                prev, curr = curr, max(prev + num, curr)\n",
-    "            return curr\n",
-    "\n",
-    "        # Check the base cases where the length of nums is 1 or 2\n",
-    "        if len(nums) == 1:\n",
-    "            return nums[0]\n",
-    "        elif len(nums) == 2:\n",
-    "            return max(nums[0], nums[1])\n",
-    "\n",
-    "        # Case 1: First house is robbed, last house is not\n",
-    "        case1 = simple_rob(nums[:-1])\n",
-    "\n",
-    "        # Case 2: First house is not robbed, last house is\n",
-    "        case2 = simple_rob(nums[1:])\n",
-    "\n",
-    "        # Maximum of the two cases\n",
-    "        return max(case1, case2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a class `Solution` with a method `rob`, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.\n",
-    "\n",
-    "The code uses dynamic programming to solve the problem efficiently. It contains a helper function `simple_rob` that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method `rob` handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.\n",
-    "\n",
-    "The class is instantiated as `solution`, and the `rob` method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "nums1 = [2, 3, 2]\n",
-    "print(solution.rob(nums1))  # Output: 3"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [1, 2, 3, 1]\n",
-    "print(solution.rob(nums2))  # Output: 4"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e6e1554f-ae77-410c-8af2-e59e5428166c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums3 = [1, 2, 3]\n",
-    "print(solution.rob(nums3))  # Output: 3"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "### Time Complexity:\n",
-    "The time complexity is primarily determined by the `simple_rob` helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main `rob` function calls `simple_rob` twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).\n",
-    "\n",
-    "### Space Complexity:\n",
-    "The space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are `prev` and `curr` in the `simple_rob` function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(1)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?\n",
-    "\n",
-    "2. **Circular Robbery Variations:** Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.\n",
-    "\n",
-    "**Link to Problem:** [To see the House Robber II problem on LeetCode, click here!](https://leetcode.com/problems/house-robber-ii/)"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
deleted file mode 100644
index 32c5da3..0000000
--- a/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb	
+++ /dev/null
@@ -1,204 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 70. Climbing Stairs\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Climbing Stairs problem on LeetCode, click here!](https://leetcode.com/problems/climbing-stairs/)\n",
-    "\n",
-    "---\n",
-    "You are climbing a staircase. It takes `n` steps to reach the top.\n",
-    "\n",
-    "Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= n <= 45`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The \"Climbing Stairs\" problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here's the problem statement:\n",
-    "\n",
-    "You are given a staircase with 'n' steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.\n",
-    "\n",
-    "For example, if 'n' is 2, there are two ways to climb to the top:\n",
-    "\n",
-    "1. Climbing two steps at once.\n",
-    "2. Climbing one step, and then another step.\n",
-    "\n",
-    "If 'n' is 3, there are three ways:\n",
-    "\n",
-    "1. Climbing one step, then one step, and finally one step.\n",
-    "2. Climbing one step, then two steps.\n",
-    "3. Climbing two steps, then one step.\n",
-    "\n",
-    "The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It's a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class Solution:\n",
-    "    def climbStairs(self, n: int) -> int:\n",
-    "        # If there are 1 or 2 steps, there are exactly n ways to reach the top.\n",
-    "        if n <= 2:\n",
-    "            return n\n",
-    "\n",
-    "        # Create an array to store the number of ways to reach each step.\n",
-    "        dp = [0] * (n + 1)\n",
-    "\n",
-    "        # There is one way to reach the first step (base case).\n",
-    "        dp[1] = 1\n",
-    "\n",
-    "        # There are two ways to reach the second step (base case).\n",
-    "        dp[2] = 2\n",
-    "\n",
-    "        # Calculate the number of ways to reach each step from the previous steps.\n",
-    "        for i in range(3, n + 1):\n",
-    "            # The number of ways to reach step 'i' is the sum of the ways to reach\n",
-    "            # the previous two steps, as you can take 1 or 2 steps at a time.\n",
-    "            dp[i] = dp[i - 1] + dp[i - 2]\n",
-    "\n",
-    "        # The result is the number of ways to reach the top, which is stored in dp[n].\n",
-    "        return dp[n]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a class `Solution` with a method `climbStairs` that takes an integer `n` as input and returns the number of distinct ways to climb a staircase with `n` steps.\n",
-    "\n",
-    "1. If `n` is 1 or 2, the function returns `n` directly because there are only 1 or 2 distinct ways to reach the top in those cases.\n",
-    "\n",
-    "2. For `n` greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array `dp` of length `n + 1` to store these values.\n",
-    "\n",
-    "3. The `dp[1]` and `dp[2]` are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).\n",
-    "\n",
-    "4. The code then uses a loop to fill in the `dp` array for steps 3 and above. For each step `i` from 3 to `n`, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.\n",
-    "\n",
-    "5. Finally, the function returns the value stored in `dp[n]`, which represents the total number of distinct ways to climb the staircase with `n` steps."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 1 - Input: n = 2, Output: 2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "n = 2\n",
-    "solution = Solution()\n",
-    "print(f\"Example 1 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 2"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 2 - Input: n = 3, Output: 3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "n = 3\n",
-    "print(f\"Example 2 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 3\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Time Complexity:\n",
-    "The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the `dp` array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value `n`.\n",
-    "\n",
-    "Space Complexity:\n",
-    "The space complexity of the solution is O(n) as well. We use an array `dp` of length `n + 1` to store the number of ways to reach each step. The size of this array is directly proportional to the input value `n`, which makes the space complexity linear in terms of `n`. The rest of the variables used in the function (e.g., `i`) occupy constant space and do not contribute significantly to the overall space complexity.\n",
-    "\n",
-    "In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the \"Climbing Stairs\" problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Generalized Step Sizes**: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes `[1, 2, 3]`. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.\n",
-    "\n",
-    "2. **Minimize Steps**: Given an integer `n`, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/_build/jupyter_execute/Book.ipynb b/_build/jupyter_execute/Book.ipynb
deleted file mode 100644
index 6c891d7..0000000
--- a/_build/jupyter_execute/Book.ipynb
+++ /dev/null
@@ -1,914 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pip in /usr/local/python/3.10.8/lib/python3.10/site-packages (23.3.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: jupyter-book in /usr/local/python/3.10.8/lib/python3.10/site-packages (0.15.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: click<9,>=7.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (8.1.7)\r\n",
-      "Requirement already satisfied: docutils<0.19,>=0.15 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.18.1)\r\n",
-      "Requirement already satisfied: Jinja2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (3.1.2)\r\n",
-      "Requirement already satisfied: jsonschema<5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (4.19.1)\r\n",
-      "Requirement already satisfied: linkify-it-py~=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.0.2)\r\n",
-      "Requirement already satisfied: myst-nb~=0.17.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.17.2)\r\n",
-      "Requirement already satisfied: pyyaml in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (6.0.1)\r\n",
-      "Requirement already satisfied: sphinx<6,>=4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (5.0.2)\r\n",
-      "Requirement already satisfied: sphinx-comments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.0.3)\r\n",
-      "Requirement already satisfied: sphinx-copybutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\r\n",
-      "Requirement already satisfied: sphinx-external-toc~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.1)\r\n",
-      "Requirement already satisfied: sphinx-jupyterbook-latex~=0.5.2 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\r\n",
-      "Requirement already satisfied: sphinx-design~=0.3.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.0)\r\n",
-      "Requirement already satisfied: sphinx-thebe~=0.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.2.1)\r\n",
-      "Requirement already satisfied: sphinx-book-theme~=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (1.0.1)\r\n",
-      "Requirement already satisfied: sphinx_togglebutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.2)\r\n",
-      "Requirement already satisfied: sphinxcontrib-bibtex<=2.5.0,>=2.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.5.0)\r\n",
-      "Requirement already satisfied: sphinx-multitoc-numbering~=0.1.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.1.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: attrs>=22.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (23.1.0)\r\n",
-      "Requirement already satisfied: jsonschema-specifications>=2023.03.6 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (2023.7.1)\r\n",
-      "Requirement already satisfied: referencing>=0.28.4 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.30.2)\r\n",
-      "Requirement already satisfied: rpds-py>=0.7.1 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.10.6)\r\n",
-      "Requirement already satisfied: uc-micro-py in /usr/local/python/3.10.8/lib/python3.10/site-packages (from linkify-it-py~=2.0.0->jupyter-book) (1.0.2)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: importlib_metadata in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.8.0)\r\n",
-      "Requirement already satisfied: ipython in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (8.16.1)\r\n",
-      "Requirement already satisfied: jupyter-cache<0.7,>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.6.1)\r\n",
-      "Requirement already satisfied: nbclient in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.7.4)\r\n",
-      "Requirement already satisfied: myst-parser~=0.18.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.18.1)\r\n",
-      "Requirement already satisfied: nbformat~=5.0 in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (5.9.2)\r\n",
-      "Requirement already satisfied: typing-extensions in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (4.8.0)\r\n",
-      "Requirement already satisfied: ipykernel in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.25.2)\r\n",
-      "Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.7)\r\n",
-      "Requirement already satisfied: sphinxcontrib-devhelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.5)\r\n",
-      "Requirement already satisfied: sphinxcontrib-jsmath in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.1)\r\n",
-      "Requirement already satisfied: sphinxcontrib-htmlhelp>=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.0.4)\r\n",
-      "Requirement already satisfied: sphinxcontrib-serializinghtml>=1.1.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.1.9)\r\n",
-      "Requirement already satisfied: sphinxcontrib-qthelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.6)\r\n",
-      "Requirement already satisfied: Pygments>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.16.1)\r\n",
-      "Requirement already satisfied: snowballstemmer>=1.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.2.0)\r\n",
-      "Requirement already satisfied: babel>=1.3 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.13.0)\r\n",
-      "Requirement already satisfied: alabaster<0.8,>=0.7 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (0.7.13)\r\n",
-      "Requirement already satisfied: imagesize in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.4.1)\r\n",
-      "Requirement already satisfied: requests>=2.5.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.31.0)\r\n",
-      "Requirement already satisfied: packaging in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (23.2)\r\n",
-      "Requirement already satisfied: MarkupSafe>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from Jinja2->jupyter-book) (2.1.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pydata-sphinx-theme>=0.13.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx-book-theme~=1.0.0->jupyter-book) (0.14.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pybtex>=0.24 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (0.24.0)\r\n",
-      "Requirement already satisfied: pybtex-docutils>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.0.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: setuptools in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (68.0.0)\r\n",
-      "Requirement already satisfied: wheel in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (0.41.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: sqlalchemy<3,>=1.3.12 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (2.0.23)\r\n",
-      "Requirement already satisfied: tabulate in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (0.9.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: markdown-it-py<3.0.0,>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (2.2.0)\r\n",
-      "Requirement already satisfied: mdit-py-plugins~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.3.5)\r\n",
-      "Requirement already satisfied: jupyter-client>=6.1.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (8.4.0)\r\n",
-      "Requirement already satisfied: jupyter-core!=5.0.*,>=4.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.4.0)\r\n",
-      "Requirement already satisfied: traitlets>=5.3 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.11.2)\r\n",
-      "Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0->myst-nb~=0.17.1->jupyter-book) (2.18.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: latexcodec>=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (2.0.1)\r\n",
-      "Requirement already satisfied: six in /home/codespace/.local/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.16.0)\r\n",
-      "Requirement already satisfied: beautifulsoup4 in /home/codespace/.local/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (4.12.2)\r\n",
-      "Requirement already satisfied: accessible-pygments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (0.0.4)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: charset-normalizer<4,>=2 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.3.0)\r\n",
-      "Requirement already satisfied: idna<4,>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.4)\r\n",
-      "Requirement already satisfied: urllib3<3,>=1.21.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (1.26.18)\r\n",
-      "Requirement already satisfied: certifi>=2017.4.17 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (2023.7.22)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: zipp>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from importlib_metadata->myst-nb~=0.17.1->jupyter-book) (3.17.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: comm>=0.1.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.4)\r\n",
-      "Requirement already satisfied: debugpy>=1.6.5 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.8.0)\r\n",
-      "Requirement already satisfied: matplotlib-inline>=0.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.6)\r\n",
-      "Requirement already satisfied: nest-asyncio in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.5.8)\r\n",
-      "Requirement already satisfied: psutil in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (5.9.6)\r\n",
-      "Requirement already satisfied: pyzmq>=20 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (25.1.1)\r\n",
-      "Requirement already satisfied: tornado>=6.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (6.3.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: backcall in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.2.0)\r\n",
-      "Requirement already satisfied: decorator in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (5.1.1)\r\n",
-      "Requirement already satisfied: jedi>=0.16 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.19.1)\r\n",
-      "Requirement already satisfied: pickleshare in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.7.5)\r\n",
-      "Requirement already satisfied: prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (3.0.39)\r\n",
-      "Requirement already satisfied: stack-data in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.6.3)\r\n",
-      "Requirement already satisfied: exceptiongroup in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (1.1.3)\r\n",
-      "Requirement already satisfied: pexpect>4.3 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (4.8.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: parso<0.9.0,>=0.8.3 in /home/codespace/.local/lib/python3.10/site-packages (from jedi>=0.16->ipython->myst-nb~=0.17.1->jupyter-book) (0.8.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: python-dateutil>=2.8.2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-client>=6.1.12->nbclient->myst-nb~=0.17.1->jupyter-book) (2.8.2)\r\n",
-      "Requirement already satisfied: platformdirs>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-core!=5.0.*,>=4.12->nbclient->myst-nb~=0.17.1->jupyter-book) (3.11.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: mdurl~=0.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from markdown-it-py<3.0.0,>=1.0.0->myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.1.2)\r\n",
-      "Requirement already satisfied: ptyprocess>=0.5 in /home/codespace/.local/lib/python3.10/site-packages (from pexpect>4.3->ipython->myst-nb~=0.17.1->jupyter-book) (0.7.0)\r\n",
-      "Requirement already satisfied: wcwidth in /home/codespace/.local/lib/python3.10/site-packages (from prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.8)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: greenlet!=0.4.17 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sqlalchemy<3,>=1.3.12->jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (3.0.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: soupsieve>1.2 in /home/codespace/.local/lib/python3.10/site-packages (from beautifulsoup4->pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (2.5)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: executing>=1.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.0.0)\r\n",
-      "Requirement already satisfied: asttokens>=2.1.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.4.0)\r\n",
-      "Requirement already satisfied: pure-eval in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.2)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Note: you may need to restart the kernel to use updated packages.\n"
-     ]
-    }
-   ],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.python/current/bin/jupyter-book\", line 8, in <module>\r\n",
-      "    sys.exit(main())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1157, in __call__\r\n",
-      "    return self.main(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1078, in main\r\n",
-      "    rv = self.invoke(ctx)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1434, in invoke\r\n",
-      "    return ctx.invoke(self.callback, **ctx.params)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 783, in invoke\r\n",
-      "    return __callback(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/cli.py\", line 139, in migrate_toc\r\n",
-      "    toc = migrate_jupyter_book(Path(toc_file))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/tools.py\", line 327, in migrate_jupyter_book\r\n",
-      "    raise MalformedError(\"no top-level 'file' key found\")\r\n",
-      "sphinx_external_toc.parsing.MalformedError: no top-level 'file' key found\r\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\r\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\r\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\r\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[etoc] Changing master_doc to 'README'\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\r\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\r\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\r\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\r\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  1%] \u001b[35m01. Array Hashing/1. Two Sum\u001b[39;49;00m                          \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.07 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  2%] \u001b[35m01. Array Hashing/128. Longest Consecutive Sequence\u001b[39;49;00m   \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.17 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  3%] \u001b[35m01. Array Hashing/217. Contains Duplicate\u001b[39;49;00m             \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.19 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  5%] \u001b[35m01. Array Hashing/238. Product of Array Except Self\u001b[39;49;00m   \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 1.26 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  6%] \u001b[35m01. Array Hashing/242. Valid Anagram\u001b[39;49;00m                  \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 1.18 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  7%] \u001b[35m01. Array Hashing/347. Top K Frequent Elements\u001b[39;49;00m        \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.13 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  9%] \u001b[35m01. Array Hashing/49. Group Anagrams\u001b[39;49;00m                  \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 4.02 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 10%] \u001b[35m01. Array Hashing/659. Encode and Decode Strings\u001b[39;49;00m      \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 11%] \u001b[35m01. Array Hashing/README\u001b[39;49;00m                              \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 12%] \u001b[35m02. Two Pointers/11. Container With Most Water\u001b[39;49;00m        \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.26 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 14%] \u001b[35m02. Two Pointers/125. Valid Palindrome\u001b[39;49;00m                \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 1.07 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 15%] \u001b[35m02. Two Pointers/15. 3Sum\u001b[39;49;00m                             \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.00 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 16%] \u001b[35m02. Two Pointers/README\u001b[39;49;00m                               \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 18%] \u001b[35m03. Sliding Window/121. Best Time to Buy and Sell Stock\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.89 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 19%] \u001b[35m03. Sliding Window/3. Longest Substring Without Repeating Characters\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 1.16 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 20%] \u001b[35m03. Sliding Window/424. Longest Repeating Character Replacement\u001b[39;49;00m\r",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 22%] \u001b[35m03. Sliding Window/76. Minimum Window Substring\u001b[39;49;00m       \r",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 0.87 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 23%] \u001b[35m03. Sliding Window/README\u001b[39;49;00m                             \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 24%] \u001b[35m04. Stack/20. Valid Parentheses\u001b[39;49;00m                       \r",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 4.02 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 25%] \u001b[35m04. Stack/README\u001b[39;49;00m                                      \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 27%] \u001b[35m05. Binary Search/153. Find Minimum in Rotated Sorted Array\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 0.98 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 28%] \u001b[35m05. Binary Search/33. Search in Rotated Sorted Array\u001b[39;49;00m  \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 29%] \u001b[35m05. Binary Search/README\u001b[39;49;00m                              \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 31%] \u001b[35m06. Linked List/141. Linked List Cycle\u001b[39;49;00m                \r",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 0.96 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 32%] \u001b[35m06. Linked List/143. Reorder List\u001b[39;49;00m                     \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "^C\r\n",
-      "\r\n",
-      "\u001b[91mException occurred:\u001b[39;49;00m\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 512, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.cleanup_resources())\r\n",
-      "AttributeError: 'NoneType' object has no attribute 'cleanup_resources'\r\n",
-      "\u001b[91mThe full traceback has been saved in /tmp/sphinx-err-tl19fjln.log, if you want to report the issue to the developers.\u001b[39;49;00m\r\n",
-      "Please also report this if it was a user error, so that a better error message can be provided next time.\r\n",
-      "A bug report can be filed in the tracker at <https://github.com/sphinx-doc/sphinx/issues>. Thanks!\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py\", line 89, in wrapper\r\n",
-      "    self._ready.set_result(None)\r\n",
-      "asyncio.exceptions.InvalidStateError: invalid state\r\n",
-      "\r\n",
-      "During handling of the above exception, another exception occurred:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 505, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.shutdown_kernel(now=now))\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py\", line 189, in ensure_async\r\n",
-      "    result = await obj\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py\", line 92, in wrapper\r\n",
-      "    self._ready.set_exception(e)\r\n",
-      "asyncio.exceptions.InvalidStateError: invalid state\r\n",
-      "\r\n",
-      "During handling of the above exception, another exception occurred:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/sphinx.py\", line 171, in build_sphinx\r\n",
-      "    app.build(force_all, filenames)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/application.py\", line 329, in build\r\n",
-      "    self.builder.build_update()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 288, in build_update\r\n",
-      "    self.build(to_build,\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 302, in build\r\n",
-      "    updated_docnames = set(self.read())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 409, in read\r\n",
-      "    self._read_serial(docnames)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 430, in _read_serial\r\n",
-      "    self.read_doc(docname)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 483, in read_doc\r\n",
-      "    publisher.publish()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/core.py\", line 217, in publish\r\n",
-      "    self.document = self.reader.read(self.source, self.parser,\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/io.py\", line 103, in read\r\n",
-      "    self.parse()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/readers/__init__.py\", line 78, in parse\r\n",
-      "    self.parser.parse(self.input, document)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/sphinx_.py\", line 150, in parse\r\n",
-      "    with create_client(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/base.py\", line 83, in __enter__\r\n",
-      "    self.start_client()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/direct.py\", line 40, in start_client\r\n",
-      "    result = single_nb_execution(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_cache/executors/utils.py\", line 58, in single_nb_execution\r\n",
-      "    executenb(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 1305, in execute\r\n",
-      "    return NotebookClient(nb=nb, resources=resources, km=km, **kwargs).execute()\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py\", line 173, in wrapped\r\n",
-      "    return loop.run_until_complete(inner)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/asyncio/base_events.py\", line 649, in run_until_complete\r\n",
-      "    return future.result()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 689, in async_execute\r\n",
-      "    async with self.async_setup_kernel(**kwargs):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/contextlib.py\", line 206, in __aexit__\r\n",
-      "    await anext(self.gen)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 656, in async_setup_kernel\r\n",
-      "    await self._async_cleanup_kernel()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 512, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.cleanup_resources())\r\n",
-      "AttributeError: 'NoneType' object has no attribute 'cleanup_resources'\r\n",
-      "\r\n",
-      "The above exception was the direct cause of the following exception:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.python/current/bin/jupyter-book\", line 8, in <module>\r\n",
-      "    sys.exit(main())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1157, in __call__\r\n",
-      "    return self.main(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1078, in main\r\n",
-      "    rv = self.invoke(ctx)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1434, in invoke\r\n",
-      "    return ctx.invoke(self.callback, **ctx.params)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 783, in invoke\r\n",
-      "    return __callback(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py\", line 317, in build\r\n",
-      "    builder_specific_actions(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py\", line 525, in builder_specific_actions\r\n",
-      "    raise RuntimeError(_message_box(msg, color=\"red\", doprint=False)) from result\r\n",
-      "RuntimeError: \r\n",
-      "\u001b[91m===============================================================================\u001b[0m\r\n",
-      "\r\n",
-      "There was an error in building your book. Look above for the cause.\r\n",
-      "\r\n",
-      "\u001b[91m===============================================================================\u001b[0m\r\n",
-      "\r\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
\ No newline at end of file
diff --git a/_config.yml b/_config.yml
deleted file mode 100644
index 3def3c7..0000000
--- a/_config.yml
+++ /dev/null
@@ -1,31 +0,0 @@
-# Jupyter Book configuration
-
-# Project information
-title: "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges" # Python Problem-Solving Pro: Conquering the Blind 75 LeetCode Challenges
-author: Mohsen Tabibian and Saeed Samadidana
-email: mohsentabibian@gmail.com
-description: Explore 75 essential problems frequently asked in tech interviews. Each solution includes detailed explanations and time/space complexity analysis. Boost your coding skills and interview preparedness!
-
-repository: 
-   url: https://github.com/mohsentabibian/LeetCode-Solutions
-   path: docs #LeetCode-Solutions/
-   branch: main
-
-# Execute notebooks when building (set to false if you don't want to run the code)
-execute:
-  execute_notebooks: auto
-
-# HTML settings
-html:
-  theme: jekyll-theme-Architect #jupyter
-  logo: logo.png
-  toc:
-    display: true
-  use_issues_button: true
-  use_repository_button: true
-
-#Build settings
-#repository_url: https://github.com/mohsentabibian/LeetCode-Solutions  # URL to the GitHub repository
-
-# Add GitHub buttons to the book
-# See https://jupyterbook.org/customize/config.html #add-a-link-to-your-repository
\ No newline at end of file
diff --git a/01. Array Hashing/1. Two Sum.ipynb b/_sources/01. Array Hashing/1. Two Sum.ipynb
similarity index 100%
rename from 01. Array Hashing/1. Two Sum.ipynb
rename to _sources/01. Array Hashing/1. Two Sum.ipynb
diff --git a/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
similarity index 100%
rename from 01. Array Hashing/128. Longest Consecutive Sequence.ipynb
rename to _sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
diff --git a/01. Array Hashing/217. Contains Duplicate.ipynb b/_sources/01. Array Hashing/217. Contains Duplicate.ipynb
similarity index 100%
rename from 01. Array Hashing/217. Contains Duplicate.ipynb
rename to _sources/01. Array Hashing/217. Contains Duplicate.ipynb
diff --git a/01. Array Hashing/238. Product of Array Except Self.ipynb b/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb
similarity index 100%
rename from 01. Array Hashing/238. Product of Array Except Self.ipynb
rename to _sources/01. Array Hashing/238. Product of Array Except Self.ipynb
diff --git a/01. Array Hashing/242. Valid Anagram.ipynb b/_sources/01. Array Hashing/242. Valid Anagram.ipynb
similarity index 100%
rename from 01. Array Hashing/242. Valid Anagram.ipynb
rename to _sources/01. Array Hashing/242. Valid Anagram.ipynb
diff --git a/01. Array Hashing/347. Top K Frequent Elements.ipynb b/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb
similarity index 100%
rename from 01. Array Hashing/347. Top K Frequent Elements.ipynb
rename to _sources/01. Array Hashing/347. Top K Frequent Elements.ipynb
diff --git a/01. Array Hashing/49. Group Anagrams.ipynb b/_sources/01. Array Hashing/49. Group Anagrams.ipynb
similarity index 100%
rename from 01. Array Hashing/49. Group Anagrams.ipynb
rename to _sources/01. Array Hashing/49. Group Anagrams.ipynb
diff --git a/01. Array Hashing/659. Encode and Decode Strings.ipynb b/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb
similarity index 100%
rename from 01. Array Hashing/659. Encode and Decode Strings.ipynb
rename to _sources/01. Array Hashing/659. Encode and Decode Strings.ipynb
diff --git a/01. Array Hashing/README.md b/_sources/01. Array Hashing/README.md
similarity index 100%
rename from 01. Array Hashing/README.md
rename to _sources/01. Array Hashing/README.md
diff --git a/_sources/01. Array Hashing/intro.md b/_sources/01. Array Hashing/intro.md
new file mode 100644
index 0000000..210856e
--- /dev/null
+++ b/_sources/01. Array Hashing/intro.md	
@@ -0,0 +1,35 @@
+# Chapter 1: Array Hashing
+
+## Introduction to Array Hashing Challenges
+
+Welcome to the Array Hashing section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we will explore a curated selection of LeetCode problems focused on array hashing, a powerful technique in algorithmic problem-solving.
+
+## Navigating the Array Hashing Terrain
+
+Array Hashing provides an efficient approach to solving a variety of problems by transforming complex operations into simpler ones through the use of hash functions. The challenges presented in this section will not only sharpen your skills in manipulating arrays but also introduce you to the art of hashing for optimized problem-solving.
+
+## Unveiling the Challenges
+
+1. **Two Sum (Problem #1):** Dive into the fundamentals of array manipulation by identifying pairs of elements that sum up to a target value.
+
+2. **Longest Consecutive Sequence (Problem #128):** Explore the concept of consecutive elements in an array and devise an algorithm to find the longest sequence.
+
+3. **Contains Duplicate (Problem #217):** Investigate the presence of duplicate elements in an array, a common scenario in coding interviews and real-world applications.
+
+4. **Product of Array Except Self (Problem #238):** Master the technique of efficiently computing the product of every element in an array except itself.
+
+5. **Valid Anagram (Problem #242):** Delve into string manipulation and explore efficient methods to determine if two strings are valid anagrams.
+
+6. **Top K Frequent Elements (Problem #347):** Solve the challenge of identifying the top K frequent elements in an array using hash maps and priority queues.
+
+7. **Group Anagrams (Problem #49):** Apply array hashing to categorize an array of strings into groups of anagrams, demonstrating the versatility of this technique.
+
+8. **Encode and Decode Strings (Problem #659):** Uncover the intricacies of encoding and decoding strings, a problem that draws on array hashing for efficient solutions.
+
+## Unlocking Pythonic Solutions
+
+As we tackle each challenge, not only will we unravel the intricacies of array hashing, but we'll also harness the power of Python to craft elegant and efficient solutions. Get ready to embark on a journey of problem-solving that will not only deepen your understanding of arrays and hashing but also enhance your coding skills in Python.
+
+Let the exploration of Array Hashing challenges begin!
+
+Happy coding!
\ No newline at end of file
diff --git a/02. Two Pointers/11. Container With Most Water.ipynb b/_sources/02. Two Pointers/11. Container With Most Water.ipynb
similarity index 100%
rename from 02. Two Pointers/11. Container With Most Water.ipynb
rename to _sources/02. Two Pointers/11. Container With Most Water.ipynb
diff --git a/02. Two Pointers/125. Valid Palindrome.ipynb b/_sources/02. Two Pointers/125. Valid Palindrome.ipynb
similarity index 100%
rename from 02. Two Pointers/125. Valid Palindrome.ipynb
rename to _sources/02. Two Pointers/125. Valid Palindrome.ipynb
diff --git a/02. Two Pointers/15. 3Sum.ipynb b/_sources/02. Two Pointers/15. 3Sum.ipynb
similarity index 100%
rename from 02. Two Pointers/15. 3Sum.ipynb
rename to _sources/02. Two Pointers/15. 3Sum.ipynb
diff --git a/02. Two Pointers/README.md b/_sources/02. Two Pointers/README.md
similarity index 100%
rename from 02. Two Pointers/README.md
rename to _sources/02. Two Pointers/README.md
diff --git a/_sources/02. Two Pointers/intro.md b/_sources/02. Two Pointers/intro.md
new file mode 100644
index 0000000..5a8cddd
--- /dev/null
+++ b/_sources/02. Two Pointers/intro.md	
@@ -0,0 +1,25 @@
+# Introduction to Two Pointers Technique Challenges
+
+Welcome to the Two Pointers section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." The Two Pointers technique is a powerful strategy that enhances your ability to efficiently solve problems by maintaining two pointers that traverse a data structure, often an array or a linked list.
+
+## Unleashing the Efficiency of Two Pointers
+
+The Two Pointers technique is a versatile approach known for its effectiveness in optimizing time and space complexity. As we delve into the challenges in this section, you'll discover how to leverage this technique to navigate through arrays and efficiently address a variety of problems.
+
+## Exploring the Challenges
+
+1. **Container With Most Water (Problem #11):** Immerse yourself in the concept of maximizing the area between two vertical lines in a histogram, showcasing the elegance and efficiency of the Two Pointers technique.
+
+2. **Valid Palindrome (Problem #125):** Explore the realm of string manipulation and learn how Two Pointers can be employed to determine whether a given string is a valid palindrome.
+
+3. **3Sum (Problem #15):** Embark on a journey to find all unique triplets in an array that sum up to a target value, unraveling the complexities of Three Sum problems with the Two Pointers technique.
+
+## Guiding Principles and Pythonic Wisdom
+
+As we tackle each challenge, we'll not only unravel the intricacies of the Two Pointers technique but also embrace Pythonic solutions that showcase the elegance and readability of Python code. Through practical examples and detailed explanations, you'll gain a deep understanding of how to apply Two Pointers to real-world coding scenarios.
+
+Prepare to sharpen your problem-solving skills, enhance your algorithmic thinking, and master the art of using Two Pointers to tackle a diverse array of challenges.
+
+Let the exploration of Two Pointers challenges commence!
+
+Happy coding!
\ No newline at end of file
diff --git a/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
similarity index 100%
rename from 03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
rename to _sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
diff --git a/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
similarity index 100%
rename from 03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
rename to _sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
diff --git a/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
similarity index 100%
rename from 03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
rename to _sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
diff --git a/03. Sliding Window/76. Minimum Window Substring.ipynb b/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb
similarity index 100%
rename from 03. Sliding Window/76. Minimum Window Substring.ipynb
rename to _sources/03. Sliding Window/76. Minimum Window Substring.ipynb
diff --git a/03. Sliding Window/README.md b/_sources/03. Sliding Window/README.md
similarity index 100%
rename from 03. Sliding Window/README.md
rename to _sources/03. Sliding Window/README.md
diff --git a/_sources/03. Sliding Window/intro.md b/_sources/03. Sliding Window/intro.md
new file mode 100644
index 0000000..bbc1a08
--- /dev/null
+++ b/_sources/03. Sliding Window/intro.md	
@@ -0,0 +1,25 @@
+# Introduction to Sliding Window Challenges
+
+Welcome to the Sliding Window section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this chapter, we will delve into the powerful technique of Sliding Window, a strategy designed to efficiently solve problems by maintaining a dynamic window over a sequence.
+
+## Navigating the Sliding Window Approach
+
+The Sliding Window technique is particularly effective for tackling problems that involve arrays or strings by efficiently processing a continuous subarray or substring. As we navigate through the challenges in this section, you'll witness how this approach optimizes both time and space complexity, making it an invaluable tool in your problem-solving arsenal.
+
+## Unveiling the Challenges
+
+1. **Best Time to Buy and Sell Stock (Problem #121):** Explore the dynamic world of stock prices and optimize your buying and selling strategy to maximize profit.
+
+2. **Longest Substring Without Repeating Characters (Problem #3):** Dive into string manipulation as you discover the longest substring without any repeating characters using the Sliding Window technique.
+
+3. **Longest Repeating Character Replacement (Problem #424):** Investigate the art of replacing characters in a string to create the longest substring with the same character, unveiling the versatility of the Sliding Window approach.
+
+4. **Minimum Window Substring (Problem #76):** Tackle the challenge of finding the minimum window in a string that contains all characters of another string, showcasing the adaptability of Sliding Window for string-related problems.
+
+## Pythonic Efficiency Unleashed
+
+As we unravel each challenge, we'll not only grasp the intricacies of the Sliding Window technique but also unleash the power of Python to implement elegant and efficient solutions. Get ready to witness how this dynamic approach can transform complex problems into manageable and optimized solutions.
+
+Let's embark on the exploration of Sliding Window challenges, where dynamic problem-solving meets the efficiency of the sliding window!
+
+Happy coding!
\ No newline at end of file
diff --git a/04. Stack/20. Valid Parentheses.ipynb b/_sources/04. Stack/20. Valid Parentheses.ipynb
similarity index 100%
rename from 04. Stack/20. Valid Parentheses.ipynb
rename to _sources/04. Stack/20. Valid Parentheses.ipynb
diff --git a/04. Stack/README.md b/_sources/04. Stack/README.md
similarity index 100%
rename from 04. Stack/README.md
rename to _sources/04. Stack/README.md
diff --git a/_sources/04. Stack/intro.md b/_sources/04. Stack/intro.md
new file mode 100644
index 0000000..5ff02ef
--- /dev/null
+++ b/_sources/04. Stack/intro.md	
@@ -0,0 +1,27 @@
+# Introduction to Stack Challenges: Unveiling Valid Parentheses
+
+Welcome to the Stack section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." This segment is dedicated to exploring the versatility and efficiency of the stack data structure, a fundamental tool in the arsenal of every proficient coder.
+
+### Navigating the Stack Landscape
+
+In this journey, we will unravel the power of stacks, a data structure that follows the Last-In, First-Out (LIFO) principle. The challenges presented in this section will not only enhance your understanding of stacks but also showcase their applicability in solving a variety of real-world problems.
+
+## Unveiling the Challenge: Valid Parentheses (Problem #20)
+
+Our focus for this section is on the "Valid Parentheses" problem. As you delve into this challenge, you'll encounter a scenario commonly faced in coding interviews and real-world applications: determining the validity of a string containing various types of parentheses—curly braces, square brackets, and parentheses.
+
+## What to Expect
+
+- **Fundamental Stack Operations:** Dive into the core operations of stacks, such as push and pop, to efficiently solve problems that involve nested structures.
+
+- **Balancing Act:** Explore the concept of balancing parentheses and how stacks provide an elegant solution to ensure the correct order of opening and closing brackets.
+
+- **Pythonic Solutions:** Leverage the strengths of Python to implement clean and concise code that showcases the simplicity and power of the stack data structure.
+
+## Unlocking the Valid Parentheses Challenge
+
+As we embark on the journey of solving the "Valid Parentheses" problem, you'll not only gain a deeper understanding of stack operations but also witness how this seemingly simple data structure can be a robust tool for solving complex problems.
+
+Prepare to strengthen your foundation in stack-based problem-solving and discover the elegance of Pythonic solutions. Let's unravel the mysteries of stacks together!
+
+Happy coding!
\ No newline at end of file
diff --git a/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
similarity index 100%
rename from 05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
rename to _sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
diff --git a/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
similarity index 100%
rename from 05. Binary Search/33. Search in Rotated Sorted Array.ipynb
rename to _sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
diff --git a/05. Binary Search/README.md b/_sources/05. Binary Search/README.md
similarity index 100%
rename from 05. Binary Search/README.md
rename to _sources/05. Binary Search/README.md
diff --git a/_sources/05. Binary Search/intro.md b/_sources/05. Binary Search/intro.md
new file mode 100644
index 0000000..ed57a0e
--- /dev/null
+++ b/_sources/05. Binary Search/intro.md	
@@ -0,0 +1,29 @@
+# Introduction to Binary Search Challenges
+
+Welcome to the Binary Search section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we'll unravel the power of binary search, a fundamental algorithmic technique that is both elegant and efficient. The challenges presented here will sharpen your skills in applying binary search to unique problem scenarios.
+
+## Navigating the Binary Search Landscape
+
+Binary search is a divide-and-conquer algorithm that plays a crucial role in solving problems efficiently, especially in scenarios where the input is sorted or can be manipulated to exhibit a sorted structure. As we delve into this section, we'll explore the nuances of binary search through hands-on problem-solving.
+
+## Unveiling the Challenges
+
+1. **Find Minimum in Rotated Sorted Array (Problem #153):** Encounter the intricacies of searching for the minimum element in a rotated and sorted array. This challenge will test your ability to adapt binary search to unconventional data structures.
+
+2. **Search in Rotated Sorted Array (Problem #33):** Embark on a journey to efficiently locate a target element in a rotated and sorted array. This problem showcases the versatility of binary search in scenarios beyond the traditional sorted arrays.
+
+### Pythonic Solutions Await
+
+As we immerse ourselves in these challenges, the focus goes beyond mere problem-solving. We'll leverage the Python programming language to craft elegant, readable, and efficient solutions. Each problem serves as a canvas for Pythonic coding techniques, showcasing how the language's features can be harnessed for optimal algorithmic solutions.
+
+## What to Expect
+
+- **Algorithmic Mastery:** Develop a deep understanding of binary search and its application in diverse problem scenarios.
+
+- **Adaptability:** Learn to adapt binary search to unconventional data structures, broadening your problem-solving toolkit.
+
+- **Pythonic Coding:** Immerse yourself in Pythonic coding practices, gaining insights into writing clean and effective code.
+
+Let the exploration of Binary Search challenges commence! Whether you're a seasoned coder or just beginning your algorithmic journey, these challenges will provide a solid foundation in the art of binary search.
+
+Happy coding!
\ No newline at end of file
diff --git a/06. Linked List/141. Linked List Cycle.ipynb b/_sources/06. Linked List/141. Linked List Cycle.ipynb
similarity index 100%
rename from 06. Linked List/141. Linked List Cycle.ipynb
rename to _sources/06. Linked List/141. Linked List Cycle.ipynb
diff --git a/06. Linked List/143. Reorder List.ipynb b/_sources/06. Linked List/143. Reorder List.ipynb
similarity index 100%
rename from 06. Linked List/143. Reorder List.ipynb
rename to _sources/06. Linked List/143. Reorder List.ipynb
diff --git a/06. Linked List/19. Remove Nth Node From End of List.ipynb b/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb
similarity index 100%
rename from 06. Linked List/19. Remove Nth Node From End of List.ipynb
rename to _sources/06. Linked List/19. Remove Nth Node From End of List.ipynb
diff --git a/06. Linked List/206. Reverse Linked List.ipynb b/_sources/06. Linked List/206. Reverse Linked List.ipynb
similarity index 100%
rename from 06. Linked List/206. Reverse Linked List.ipynb
rename to _sources/06. Linked List/206. Reverse Linked List.ipynb
diff --git a/06. Linked List/21. Merge Two Sorted Lists.ipynb b/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb
similarity index 100%
rename from 06. Linked List/21. Merge Two Sorted Lists.ipynb
rename to _sources/06. Linked List/21. Merge Two Sorted Lists.ipynb
diff --git a/06. Linked List/23. Merge k Sorted Lists.ipynb b/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb
similarity index 100%
rename from 06. Linked List/23. Merge k Sorted Lists.ipynb
rename to _sources/06. Linked List/23. Merge k Sorted Lists.ipynb
diff --git a/06. Linked List/README.md b/_sources/06. Linked List/README.md
similarity index 100%
rename from 06. Linked List/README.md
rename to _sources/06. Linked List/README.md
diff --git a/_sources/06. Linked List/intro.md b/_sources/06. Linked List/intro.md
new file mode 100644
index 0000000..cfa1bbe
--- /dev/null
+++ b/_sources/06. Linked List/intro.md	
@@ -0,0 +1,31 @@
+# Introduction to Linked List Mastery
+
+Welcome to the Linked List section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we embark on a journey through the intricacies of linked lists — a fundamental data structure in computer science and a cornerstone of algorithmic problem-solving.
+
+## Navigating the Linked List Landscape
+
+Linked lists offer a dynamic and flexible way to organize and manipulate data, making them a critical asset in the programmer's toolkit. The challenges presented in this section are crafted to sharpen your understanding of linked list operations and empower you with the skills to tackle complex problems efficiently.
+
+## Unveiling the Challenges
+
+1. **Linked List Cycle (Problem #141):** Delve into the exploration of cycles within linked lists, a common challenge in detecting loops and optimizing algorithmic solutions.
+
+2. **Reorder List (Problem #143):** Uncover the art of reordering linked list elements, an essential skill that finds applications in various real-world scenarios.
+
+3. **Remove Nth Node From End of List (Problem #19):** Tackle the challenge of efficiently removing the nth node from the end of a linked list, mastering traversal and pointer manipulation.
+
+4. **Reverse Linked List (Problem #206):** Explore the reversal of linked lists, a fundamental operation with applications in numerous algorithmic problems.
+
+5. **Merge Two Sorted Lists (Problem #21):** Combine the power of linked list manipulation and sorting algorithms to merge two sorted lists into a single, ordered list.
+
+6. **Merge k Sorted Lists (Problem #23):** Rise to the challenge of merging k sorted linked lists, showcasing your ability to handle complexity in data structures.
+
+## Pythonic Solutions Unleashed
+
+As we navigate through each challenge, we not only unravel the intricacies of linked list operations but also harness the expressive power of Python to create elegant and efficient solutions. Prepare to witness the marriage of algorithmic thinking and Pythonic coding in a seamless blend.
+
+Whether you are a coding enthusiast, a job seeker preparing for technical interviews, or a seasoned programmer seeking to deepen your understanding, the Linked List challenges in this section are designed to elevate your problem-solving skills to new heights.
+
+Let's dive into the world of linked lists and master the art of problem-solving in Python!
+
+Happy coding!
\ No newline at end of file
diff --git a/07. Trees/100. Same Tree.ipynb b/_sources/07. Trees/100. Same Tree.ipynb
similarity index 100%
rename from 07. Trees/100. Same Tree.ipynb
rename to _sources/07. Trees/100. Same Tree.ipynb
diff --git a/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb
similarity index 100%
rename from 07. Trees/102. Binary Tree Level Order Traversal.ipynb
rename to _sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb
diff --git a/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb
similarity index 100%
rename from 07. Trees/104. Maximum Depth of Binary Tree.ipynb
rename to _sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb
diff --git a/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
similarity index 100%
rename from 07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
rename to _sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
diff --git a/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
similarity index 100%
rename from 07. Trees/124. Binary Tree Maximum Path Sum.ipynb
rename to _sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
diff --git a/07. Trees/199. Binary Tree Right Side View.ipynb b/_sources/07. Trees/199. Binary Tree Right Side View.ipynb
similarity index 100%
rename from 07. Trees/199. Binary Tree Right Side View.ipynb
rename to _sources/07. Trees/199. Binary Tree Right Side View.ipynb
diff --git a/07. Trees/226. Invert Binary Tree.ipynb b/_sources/07. Trees/226. Invert Binary Tree.ipynb
similarity index 100%
rename from 07. Trees/226. Invert Binary Tree.ipynb
rename to _sources/07. Trees/226. Invert Binary Tree.ipynb
diff --git a/07. Trees/230. Kth Smallest Element in a BST.ipynb b/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb
similarity index 100%
rename from 07. Trees/230. Kth Smallest Element in a BST.ipynb
rename to _sources/07. Trees/230. Kth Smallest Element in a BST.ipynb
diff --git a/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
similarity index 100%
rename from 07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
rename to _sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
diff --git a/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
similarity index 100%
rename from 07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
rename to _sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
diff --git a/07. Trees/572. Subtree of Another Tree.ipynb b/_sources/07. Trees/572. Subtree of Another Tree.ipynb
similarity index 100%
rename from 07. Trees/572. Subtree of Another Tree.ipynb
rename to _sources/07. Trees/572. Subtree of Another Tree.ipynb
diff --git a/07. Trees/98. Validate Binary Search Tree.ipynb b/_sources/07. Trees/98. Validate Binary Search Tree.ipynb
similarity index 100%
rename from 07. Trees/98. Validate Binary Search Tree.ipynb
rename to _sources/07. Trees/98. Validate Binary Search Tree.ipynb
diff --git a/07. Trees/README.md b/_sources/07. Trees/README.md
similarity index 100%
rename from 07. Trees/README.md
rename to _sources/07. Trees/README.md
diff --git a/_sources/07. Trees/intro.md b/_sources/07. Trees/intro.md
new file mode 100644
index 0000000..a7fd88f
--- /dev/null
+++ b/_sources/07. Trees/intro.md	
@@ -0,0 +1,41 @@
+# Introduction to Tree Challenges
+
+Welcome to the Trees section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." This segment delves into the fascinating realm of trees, exploring a diverse set of problems that will deepen your understanding of tree structures and sharpen your skills in traversing and manipulating them.
+
+## Navigating the Lush Canopy of Challenges
+
+Trees are a fundamental data structure in computer science, and their applications extend far and wide. The challenges in this section are designed to guide you through various aspects of tree manipulation, from basic operations to advanced traversal techniques and beyond.
+
+## Unveiling the Arboreal Adventures
+
+1. **Same Tree (Problem #100):** Compare two binary trees and determine if they are structurally identical.
+
+2. **Binary Tree Level Order Traversal (Problem #102):** Embark on a journey through the levels of a binary tree, unraveling its secrets in an ordered traversal.
+
+3. **Maximum Depth of Binary Tree (Problem #104):** Measure the depth of a binary tree, a fundamental metric in understanding its structure.
+
+4. **Construct Binary Tree from Preorder and Inorder Traversal (Problem #105):** Unravel the puzzle of reconstructing a binary tree from its preorder and inorder traversals.
+
+5. **Binary Tree Maximum Path Sum (Problem #124):** Navigate the complex web of paths in a binary tree and find the maximum sum achievable.
+
+6. **Binary Tree Right Side View (Problem #199):** Gain a unique perspective on a binary tree by capturing the view from its right side.
+
+7. **Invert Binary Tree (Problem #226):** Explore the transformative power of inverting a binary tree, changing its structure in a profound way.
+
+8. **Kth Smallest Element in a BST (Problem #230):** Traverse a binary search tree to find the Kth smallest element, mastering the art of efficient search.
+
+9. **Lowest Common Ancestor of a Binary Search Tree (Problem #235):** Discover the common ground in a binary search tree by finding the lowest common ancestor.
+
+10. **Serialize and Deserialize Binary Tree (Problem #297):** Encode and decode the intricate structure of a binary tree for efficient storage and retrieval.
+
+11. **Subtree of Another Tree (Problem #572):** Investigate whether one tree is a subtree of another, unveiling the subtleties of tree comparison.
+
+12. **Validate Binary Search Tree (Problem #98):** Examine the properties of a binary tree to determine if it is a valid binary search tree.
+
+## Pythonic Canopy Exploration
+
+As we journey through these arboreal challenges, we'll not only uncover the intricacies of tree structures and algorithms but also leverage the power of Python to craft elegant and efficient solutions. Get ready to traverse the lush canopy of tree challenges and elevate your problem-solving skills.
+
+Let the exploration of Tree challenges begin!
+
+Happy coding!
\ No newline at end of file
diff --git a/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb
similarity index 100%
rename from 08. Tries/208. Implement Trie (Prefix Tree).ipynb
rename to _sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb
diff --git a/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb
similarity index 100%
rename from 08. Tries/211. Design Add and Search Words Data Structure.ipynb
rename to _sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb
diff --git a/08. Tries/212. Word Search II.ipynb b/_sources/08. Tries/212. Word Search II.ipynb
similarity index 100%
rename from 08. Tries/212. Word Search II.ipynb
rename to _sources/08. Tries/212. Word Search II.ipynb
diff --git a/08. Tries/README.md b/_sources/08. Tries/README.md
similarity index 100%
rename from 08. Tries/README.md
rename to _sources/08. Tries/README.md
diff --git a/_sources/08. Tries/intro.md b/_sources/08. Tries/intro.md
new file mode 100644
index 0000000..3aea3e5
--- /dev/null
+++ b/_sources/08. Tries/intro.md	
@@ -0,0 +1,27 @@
+# Unveiling the Power of Tries: A Journey in Prefix Trees
+
+Welcome to the Tries section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we embark on a fascinating exploration of Tries, also known as Prefix Trees, a powerful data structure that excels in handling strings and words.
+
+## Understanding the Essence of Tries
+
+Tries stand as a testament to the elegance of data structure design, particularly when it comes to storing and retrieving words efficiently. This section delves into the intricacies of Tries, unraveling their structure and demonstrating their application in various problem-solving scenarios.
+
+## Navigating the Chapters
+
+1. **Implement Trie (Prefix Tree) (Problem #208):** Lay the foundation by mastering the implementation of a Trie, a versatile data structure that stores a dynamic set of strings, making it an invaluable tool in a coder's arsenal.
+
+2. **Design Add and Search Words Data Structure (Problem #211):** Explore the versatility of Tries in designing a data structure that supports the addition and search of words with the flexibility to handle wildcard characters.
+
+3. **Word Search II (Problem #212):** Elevate your problem-solving skills as we tackle a more advanced challenge involving Tries, where we embark on a word search adventure through a 2D board.
+
+## Pythonic Wisdom Unleashed
+
+Throughout our journey, Python will be our trusty companion. We'll leverage the expressive nature of the language to craft elegant and efficient solutions to the challenges posed by Tries. Whether you are new to Tries or seeking to deepen your understanding, this section provides a comprehensive guide to mastering this fundamental data structure.
+
+## Your Journey Begins
+
+Get ready to traverse the nodes and edges of Tries, exploring their potential in solving a diverse range of problems. As we unravel each challenge, you'll not only enhance your problem-solving prowess but also gain a deeper appreciation for the beauty of Tries.
+
+Let the exploration of Tries commence!
+
+Happy coding!
\ No newline at end of file
diff --git a/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
similarity index 100%
rename from 09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
rename to _sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
diff --git a/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
similarity index 100%
rename from 09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
rename to _sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
diff --git a/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
similarity index 100%
rename from 09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
rename to _sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
diff --git a/09. Heap - Priority Queue/README.md b/_sources/09. Heap - Priority Queue/README.md
similarity index 100%
rename from 09. Heap - Priority Queue/README.md
rename to _sources/09. Heap - Priority Queue/README.md
diff --git a/_sources/09. Heap - Priority Queue/intro.md b/_sources/09. Heap - Priority Queue/intro.md
new file mode 100644
index 0000000..b2c02f7
--- /dev/null
+++ b/_sources/09. Heap - Priority Queue/intro.md	
@@ -0,0 +1,31 @@
+# Unveiling the Power of Heaps and Priority Queues
+
+Welcome to the Heap and Priority Queue section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this chapter, we will delve into the world of heaps and priority queues—a realm where efficient data manipulation and retrieval are key.
+
+## Navigating the Heap Landscape
+
+Heaps and Priority Queues play a pivotal role in algorithmic problem-solving, providing swift solutions to problems that involve maintaining a dynamic set of elements with varying priorities. This section introduces you to the fundamental concepts and challenges associated with heaps, guiding you through their application in real-world scenarios.
+
+## Unveiling the Challenges
+
+1. **Last Stone Weight (Problem #1046):** Dive into the dynamic world of stone smashing, where a priority queue becomes the tool of choice for determining the last remaining stone's weight.
+
+2. **Find Median from Data Stream (Problem #295):** Explore the intricacies of streaming data and discover how heaps facilitate the efficient calculation of medians in real-time.
+
+3. **Kth Largest Element in a Stream (Problem #703):** Uncover the power of heaps in maintaining and updating a dynamic stream of elements, efficiently identifying the Kth largest element.
+
+## Pythonic Mastery
+
+As we journey through each challenge, we will not only unravel the intricacies of heaps and priority queues but also wield the elegance of Python to craft solutions that are both efficient and readable. From understanding heap operations to mastering priority queue nuances, this section is designed to sharpen your problem-solving skills in Python.
+
+## What to Expect
+
+- **Foundational Concepts:** Grasp the core principles of heaps and priority queues, laying the groundwork for efficient algorithmic solutions.
+
+- **Real-world Applications:** Explore challenges that mirror scenarios in which heaps excel, from dynamic data streams to problem domains requiring prioritized element retrieval.
+
+- **Pythonic Elegance:** Learn to implement solutions that leverage Python's strengths, making your code not only functional but also a pleasure to read and maintain.
+
+Join us on this exploration of Heap and Priority Queue challenges, where efficiency meets elegance, and Python becomes your ally in conquering the complexities of algorithmic problem-solving.
+
+Happy coding!
\ No newline at end of file
diff --git a/10. Backtracking/39. Combination Sum.ipynb b/_sources/10. Backtracking/39. Combination Sum.ipynb
similarity index 100%
rename from 10. Backtracking/39. Combination Sum.ipynb
rename to _sources/10. Backtracking/39. Combination Sum.ipynb
diff --git a/10. Backtracking/79. Word Search.ipynb b/_sources/10. Backtracking/79. Word Search.ipynb
similarity index 100%
rename from 10. Backtracking/79. Word Search.ipynb
rename to _sources/10. Backtracking/79. Word Search.ipynb
diff --git a/10. Backtracking/README.md b/_sources/10. Backtracking/README.md
similarity index 100%
rename from 10. Backtracking/README.md
rename to _sources/10. Backtracking/README.md
diff --git a/_sources/10. Backtracking/intro.md b/_sources/10. Backtracking/intro.md
new file mode 100644
index 0000000..0421341
--- /dev/null
+++ b/_sources/10. Backtracking/intro.md	
@@ -0,0 +1,27 @@
+# Introduction to Backtracking Challenges
+
+Welcome to the Backtracking section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." Backtracking is a powerful technique employed in algorithmic problem-solving, enabling us to explore and find solutions to combinatorial problems efficiently.
+
+## Unraveling the Backtracking Paradigm
+
+Backtracking is a systematic way of searching through all possible solutions to a problem and systematically discarding those that do not satisfy the problem constraints. In this section, we will delve into the intricacies of backtracking and apply it to two fascinating challenges.
+
+## Discover the Challenges
+
+1. **Combination Sum (Problem #39):** Explore the world of combinations as we navigate through the possibilities of summing up to a target value. This challenge will sharpen your ability to generate combinations and filter out the valid ones.
+
+2. **Word Search (Problem #79):** Embark on a journey through a grid of letters, uncovering words hidden within. This challenge not only tests your backtracking skills but also introduces you to the realm of searching for words efficiently.
+
+## Navigating the README
+
+Before we dive into the challenges, take a moment to explore the README file. It serves as a guide, offering insights into the core concepts of backtracking, tips for approaching related problems, and Pythonic solutions for a better understanding.
+
+## Pythonic Problem-Solving
+
+As we venture through each challenge, we'll not only unravel the mysteries of backtracking but also leverage the capabilities of Python to create elegant, concise, and efficient solutions. Get ready to enhance your problem-solving toolkit and deepen your appreciation for the versatility of backtracking.
+
+### Let the Backtracking Journey Begin
+
+Are you ready to navigate the intricacies of backtracking and unlock solutions to challenging problems? Grab your Python interpreter, open your code editor, and let's embark on a hands-on journey through the Backtracking challenges.
+
+Happy coding!
\ No newline at end of file
diff --git a/11. Graphs/133. Clone Graph.ipynb b/_sources/11. Graphs/133. Clone Graph.ipynb
similarity index 100%
rename from 11. Graphs/133. Clone Graph.ipynb
rename to _sources/11. Graphs/133. Clone Graph.ipynb
diff --git a/11. Graphs/178. Graph Valid Tree.ipynb b/_sources/11. Graphs/178. Graph Valid Tree.ipynb
similarity index 100%
rename from 11. Graphs/178. Graph Valid Tree.ipynb
rename to _sources/11. Graphs/178. Graph Valid Tree.ipynb
diff --git a/11. Graphs/200. Number of Islands.ipynb b/_sources/11. Graphs/200. Number of Islands.ipynb
similarity index 100%
rename from 11. Graphs/200. Number of Islands.ipynb
rename to _sources/11. Graphs/200. Number of Islands.ipynb
diff --git a/11. Graphs/207. Course Schedule.ipynb b/_sources/11. Graphs/207. Course Schedule.ipynb
similarity index 100%
rename from 11. Graphs/207. Course Schedule.ipynb
rename to _sources/11. Graphs/207. Course Schedule.ipynb
diff --git a/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
similarity index 100%
rename from 11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
rename to _sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
diff --git a/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
similarity index 100%
rename from 11. Graphs/417. Pacific Atlantic Water Flow.ipynb
rename to _sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
diff --git a/11. Graphs/README.md b/_sources/11. Graphs/README.md
similarity index 100%
rename from 11. Graphs/README.md
rename to _sources/11. Graphs/README.md
diff --git a/_sources/11. Graphs/intro.md b/_sources/11. Graphs/intro.md
new file mode 100644
index 0000000..813fd6a
--- /dev/null
+++ b/_sources/11. Graphs/intro.md	
@@ -0,0 +1,31 @@
+# Introduction to Graph Challenges
+
+Welcome to the Graphs section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we dive into the fascinating world of graphs, a fundamental data structure with applications ranging from social networks to network routing algorithms.
+
+## Navigating the Graph Landscape
+
+Graphs serve as a powerful model for representing relationships and connections between entities. The challenges presented in this section will not only test your understanding of graph theory but also equip you with the skills needed to tackle real-world problems involving interconnected data.
+
+## Unveiling the Challenges
+
+1. **Clone Graph (Problem #133):** Embark on the journey of graph cloning, a task that involves creating an identical copy of a connected graph while preserving its structure.
+
+2. **Graph Valid Tree (Problem #178):** Explore the concept of a valid tree within a graph, addressing the conditions that define a tree structure and applying them to ensure validity.
+
+3. **Number of Islands (Problem #200):** Grapple with the challenge of counting the number of islands in a matrix, navigating through interconnected regions in a sea of elements.
+
+4. **Course Schedule (Problem #207):** Delve into the world of course scheduling, solving a problem that explores the dependencies between courses in an academic curriculum.
+
+5. **Number of Connected Components in an Undirected Graph (Problem #3651):** Uncover the dynamics of connected components in undirected graphs, a crucial concept in network analysis and data connectivity.
+
+6. **Pacific Atlantic Water Flow (Problem #417):** Tackle a geographical challenge involving the flow of water in the Pacific and Atlantic Oceans, demonstrating the practical applications of graph theory.
+
+## Pythonic Exploration
+
+As we navigate through each graph-related challenge, we'll not only unravel the complexities of graph theory but also harness the power of Python to implement elegant and efficient solutions. Get ready to embark on a journey of problem-solving that will not only deepen your understanding of graphs but also enhance your coding skills in Python.
+
+Whether you are a coding enthusiast, a student exploring graph theory, or a professional honing your problem-solving skills, this section is designed to provide you with a solid foundation in graph-based algorithms.
+
+Let the exploration of Graph challenges begin!
+
+Happy coding!
\ No newline at end of file
diff --git a/12. Advanced Graphs/892. Alien Dictionary.ipynb b/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb
similarity index 100%
rename from 12. Advanced Graphs/892. Alien Dictionary.ipynb
rename to _sources/12. Advanced Graphs/892. Alien Dictionary.ipynb
diff --git a/12. Advanced Graphs/README.md b/_sources/12. Advanced Graphs/README.md
similarity index 100%
rename from 12. Advanced Graphs/README.md
rename to _sources/12. Advanced Graphs/README.md
diff --git a/_sources/12. Advanced Graphs/intro.md b/_sources/12. Advanced Graphs/intro.md
new file mode 100644
index 0000000..f7fabf8
--- /dev/null
+++ b/_sources/12. Advanced Graphs/intro.md	
@@ -0,0 +1,25 @@
+# Introduction to Advanced Graphs: Navigating the Alien Dictionary
+
+Welcome to the Advanced Graphs section of "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this segment, we delve into the fascinating world of graph theory, tackling intricate problems that demand a deep understanding of graph traversal and manipulation.
+
+## Unveiling the Complexity
+
+Graphs, with their interconnected nodes and edges, provide a rich landscape for problem-solving. As we venture into the Advanced Graphs section, we confront challenges that push the boundaries of conventional graph algorithms. Our focus goes beyond basic graph traversal, exploring advanced scenarios where nuanced strategies are required.
+
+## Exploring the Alien Dictionary
+
+**892. Alien Dictionary:** Among the celestial challenges in this section, we encounter the enigmatic "Alien Dictionary." This problem propels us into the realm of lexicographical ordering in an extraterrestrial language. As we decipher the rules governing the alien script, we will harness graph theory to unravel the order of the alphabet and construct a dictionary unique to this cosmic language.
+
+## Navigating Sections
+
+This section is not just about solving problems but also about understanding the underlying principles of advanced graph theory. As we progress, each problem becomes a stepping stone, preparing you for the intricacies of real-world applications and coding interviews.
+
+## Pythonic Exploration
+
+Just as constellations form patterns in the night sky, Pythonic solutions emerge from the code. Throughout this journey, we'll leverage the elegance and power of Python to craft solutions that not only solve the challenges at hand but also showcase the beauty of efficient and readable code.
+
+## What Lies Ahead
+
+From alien languages to intricate graph scenarios, the challenges in this section are designed to stretch your problem-solving muscles. Embrace the complexity, explore the uncharted territories of advanced graphs, and let the mysteries of the "Alien Dictionary" be the guide on this cosmic coding adventure.
+
+Happy coding!
\ No newline at end of file
diff --git a/13. One-D Dynamic Programming/198. House Robber.ipynb b/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb
similarity index 100%
rename from 13. One-D Dynamic Programming/198. House Robber.ipynb
rename to _sources/13. One-D Dynamic Programming/198. House Robber.ipynb
diff --git a/13. One-D Dynamic Programming/213. House Robber II.ipynb b/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb
similarity index 100%
rename from 13. One-D Dynamic Programming/213. House Robber II.ipynb
rename to _sources/13. One-D Dynamic Programming/213. House Robber II.ipynb
diff --git a/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
similarity index 100%
rename from 13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
rename to _sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
diff --git a/13. One-D Dynamic Programming/README.md b/_sources/13. One-D Dynamic Programming/README.md
similarity index 100%
rename from 13. One-D Dynamic Programming/README.md
rename to _sources/13. One-D Dynamic Programming/README.md
diff --git a/14. Two-D Dynamic Programming/README.md b/_sources/14. Two-D Dynamic Programming/README.md
similarity index 100%
rename from 14. Two-D Dynamic Programming/README.md
rename to _sources/14. Two-D Dynamic Programming/README.md
diff --git a/15. Greedy/README.md b/_sources/15. Greedy/README.md
similarity index 100%
rename from 15. Greedy/README.md
rename to _sources/15. Greedy/README.md
diff --git a/16. Intervals/README.md b/_sources/16. Intervals/README.md
similarity index 100%
rename from 16. Intervals/README.md
rename to _sources/16. Intervals/README.md
diff --git a/17. Math Geometry/README.md b/_sources/17. Math Geometry/README.md
similarity index 100%
rename from 17. Math Geometry/README.md
rename to _sources/17. Math Geometry/README.md
diff --git a/18. Bit Manipulation/README.md b/_sources/18. Bit Manipulation/README.md
similarity index 100%
rename from 18. Bit Manipulation/README.md
rename to _sources/18. Bit Manipulation/README.md
diff --git a/_sources/Book.ipynb b/_sources/Book.ipynb
new file mode 100644
index 0000000..fcb22ba
--- /dev/null
+++ b/_sources/Book.ipynb
@@ -0,0 +1,359 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Requirement already satisfied: pip in /usr/local/python/3.10.8/lib/python3.10/site-packages (23.3.1)\n",
+      "Requirement already satisfied: jupyter-book in /usr/local/python/3.10.8/lib/python3.10/site-packages (0.15.1)\n",
+      "Requirement already satisfied: click<9,>=7.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (8.1.7)\n",
+      "Requirement already satisfied: docutils<0.19,>=0.15 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.18.1)\n",
+      "Requirement already satisfied: Jinja2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (3.1.2)\n",
+      "Requirement already satisfied: jsonschema<5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (4.19.1)\n",
+      "Requirement already satisfied: linkify-it-py~=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.0.2)\n",
+      "Requirement already satisfied: myst-nb~=0.17.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.17.2)\n",
+      "Requirement already satisfied: pyyaml in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (6.0.1)\n",
+      "Requirement already satisfied: sphinx<6,>=4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (5.0.2)\n",
+      "Requirement already satisfied: sphinx-comments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.0.3)\n",
+      "Requirement already satisfied: sphinx-copybutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\n",
+      "Requirement already satisfied: sphinx-external-toc~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.1)\n",
+      "Requirement already satisfied: sphinx-jupyterbook-latex~=0.5.2 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\n",
+      "Requirement already satisfied: sphinx-design~=0.3.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.0)\n",
+      "Requirement already satisfied: sphinx-thebe~=0.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.2.1)\n",
+      "Requirement already satisfied: sphinx-book-theme~=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (1.0.1)\n",
+      "Requirement already satisfied: sphinx_togglebutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.2)\n",
+      "Requirement already satisfied: sphinxcontrib-bibtex<=2.5.0,>=2.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.5.0)\n",
+      "Requirement already satisfied: sphinx-multitoc-numbering~=0.1.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.1.3)\n",
+      "Requirement already satisfied: attrs>=22.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (23.1.0)\n",
+      "Requirement already satisfied: jsonschema-specifications>=2023.03.6 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (2023.7.1)\n",
+      "Requirement already satisfied: referencing>=0.28.4 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.30.2)\n",
+      "Requirement already satisfied: rpds-py>=0.7.1 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.10.6)\n",
+      "Requirement already satisfied: uc-micro-py in /usr/local/python/3.10.8/lib/python3.10/site-packages (from linkify-it-py~=2.0.0->jupyter-book) (1.0.2)\n",
+      "Requirement already satisfied: importlib_metadata in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.8.0)\n",
+      "Requirement already satisfied: ipython in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (8.16.1)\n",
+      "Requirement already satisfied: jupyter-cache<0.7,>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.6.1)\n",
+      "Requirement already satisfied: nbclient in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.7.4)\n",
+      "Requirement already satisfied: myst-parser~=0.18.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.18.1)\n",
+      "Requirement already satisfied: nbformat~=5.0 in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (5.9.2)\n",
+      "Requirement already satisfied: typing-extensions in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (4.8.0)\n",
+      "Requirement already satisfied: ipykernel in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.25.2)\n",
+      "Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.7)\n",
+      "Requirement already satisfied: sphinxcontrib-devhelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.5)\n",
+      "Requirement already satisfied: sphinxcontrib-jsmath in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.1)\n",
+      "Requirement already satisfied: sphinxcontrib-htmlhelp>=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.0.4)\n",
+      "Requirement already satisfied: sphinxcontrib-serializinghtml>=1.1.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.1.9)\n",
+      "Requirement already satisfied: sphinxcontrib-qthelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.6)\n",
+      "Requirement already satisfied: Pygments>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.16.1)\n",
+      "Requirement already satisfied: snowballstemmer>=1.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.2.0)\n",
+      "Requirement already satisfied: babel>=1.3 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.13.0)\n",
+      "Requirement already satisfied: alabaster<0.8,>=0.7 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (0.7.13)\n",
+      "Requirement already satisfied: imagesize in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.4.1)\n",
+      "Requirement already satisfied: requests>=2.5.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.31.0)\n",
+      "Requirement already satisfied: packaging in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (23.2)\n",
+      "Requirement already satisfied: MarkupSafe>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from Jinja2->jupyter-book) (2.1.3)\n",
+      "Requirement already satisfied: pydata-sphinx-theme>=0.13.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx-book-theme~=1.0.0->jupyter-book) (0.14.3)\n",
+      "Requirement already satisfied: pybtex>=0.24 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (0.24.0)\n",
+      "Requirement already satisfied: pybtex-docutils>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.0.3)\n",
+      "Requirement already satisfied: setuptools in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (68.0.0)\n",
+      "Requirement already satisfied: wheel in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (0.41.3)\n",
+      "Requirement already satisfied: sqlalchemy<3,>=1.3.12 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (2.0.23)\n",
+      "Requirement already satisfied: tabulate in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (0.9.0)\n",
+      "Requirement already satisfied: markdown-it-py<3.0.0,>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (2.2.0)\n",
+      "Requirement already satisfied: mdit-py-plugins~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.3.5)\n",
+      "Requirement already satisfied: jupyter-client>=6.1.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (8.4.0)\n",
+      "Requirement already satisfied: jupyter-core!=5.0.*,>=4.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.4.0)\n",
+      "Requirement already satisfied: traitlets>=5.3 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.11.2)\n",
+      "Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0->myst-nb~=0.17.1->jupyter-book) (2.18.1)\n",
+      "Requirement already satisfied: latexcodec>=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (2.0.1)\n",
+      "Requirement already satisfied: six in /home/codespace/.local/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.16.0)\n",
+      "Requirement already satisfied: beautifulsoup4 in /home/codespace/.local/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (4.12.2)\n",
+      "Requirement already satisfied: accessible-pygments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (0.0.4)\n",
+      "Requirement already satisfied: charset-normalizer<4,>=2 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.3.0)\n",
+      "Requirement already satisfied: idna<4,>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.4)\n",
+      "Requirement already satisfied: urllib3<3,>=1.21.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (1.26.18)\n",
+      "Requirement already satisfied: certifi>=2017.4.17 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (2023.7.22)\n",
+      "Requirement already satisfied: zipp>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from importlib_metadata->myst-nb~=0.17.1->jupyter-book) (3.17.0)\n",
+      "Requirement already satisfied: comm>=0.1.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.4)\n",
+      "Requirement already satisfied: debugpy>=1.6.5 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.8.0)\n",
+      "Requirement already satisfied: matplotlib-inline>=0.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.6)\n",
+      "Requirement already satisfied: nest-asyncio in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.5.8)\n",
+      "Requirement already satisfied: psutil in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (5.9.6)\n",
+      "Requirement already satisfied: pyzmq>=20 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (25.1.1)\n",
+      "Requirement already satisfied: tornado>=6.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (6.3.3)\n",
+      "Requirement already satisfied: backcall in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.2.0)\n",
+      "Requirement already satisfied: decorator in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (5.1.1)\n",
+      "Requirement already satisfied: jedi>=0.16 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.19.1)\n",
+      "Requirement already satisfied: pickleshare in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.7.5)\n",
+      "Requirement already satisfied: prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (3.0.39)\n",
+      "Requirement already satisfied: stack-data in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.6.3)\n",
+      "Requirement already satisfied: exceptiongroup in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (1.1.3)\n",
+      "Requirement already satisfied: pexpect>4.3 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (4.8.0)\n",
+      "Requirement already satisfied: parso<0.9.0,>=0.8.3 in /home/codespace/.local/lib/python3.10/site-packages (from jedi>=0.16->ipython->myst-nb~=0.17.1->jupyter-book) (0.8.3)\n",
+      "Requirement already satisfied: python-dateutil>=2.8.2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-client>=6.1.12->nbclient->myst-nb~=0.17.1->jupyter-book) (2.8.2)\n",
+      "Requirement already satisfied: platformdirs>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-core!=5.0.*,>=4.12->nbclient->myst-nb~=0.17.1->jupyter-book) (3.11.0)\n",
+      "Requirement already satisfied: mdurl~=0.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from markdown-it-py<3.0.0,>=1.0.0->myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.1.2)\n",
+      "Requirement already satisfied: ptyprocess>=0.5 in /home/codespace/.local/lib/python3.10/site-packages (from pexpect>4.3->ipython->myst-nb~=0.17.1->jupyter-book) (0.7.0)\n",
+      "Requirement already satisfied: wcwidth in /home/codespace/.local/lib/python3.10/site-packages (from prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.8)\n",
+      "Requirement already satisfied: greenlet!=0.4.17 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sqlalchemy<3,>=1.3.12->jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (3.0.1)\n",
+      "Requirement already satisfied: soupsieve>1.2 in /home/codespace/.local/lib/python3.10/site-packages (from beautifulsoup4->pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (2.5)\n",
+      "Requirement already satisfied: executing>=1.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.0.0)\n",
+      "Requirement already satisfied: asttokens>=2.1.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.4.0)\n",
+      "Requirement already satisfied: pure-eval in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.2)\n",
+      "Note: you may need to restart the kernel to use updated packages.\n",
+      "Requirement already satisfied: ghp-import in /usr/local/python/3.10.8/lib/python3.10/site-packages (2.1.0)\n",
+      "Requirement already satisfied: python-dateutil>=2.8.1 in /home/codespace/.local/lib/python3.10/site-packages (from ghp-import) (2.8.2)\n",
+      "Requirement already satisfied: six>=1.5 in /home/codespace/.local/lib/python3.10/site-packages (from python-dateutil>=2.8.1->ghp-import) (1.16.0)\n",
+      "Note: you may need to restart the kernel to use updated packages.\n"
+     ]
+    }
+   ],
+   "source": [
+    "!python -m pip install --upgrade pip\n",
+    "%pip install jupyter-book\n",
+    "%pip install ghp-import"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 34,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "/workspaces/LeetCode-Solutions\n"
+     ]
+    }
+   ],
+   "source": [
+    "%cd /workspaces/LeetCode-Solutions"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 4,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
+      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\n",
+      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\n",
+      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\n",
+      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
+      "\u001b[01mmaking output directory... \u001b[39;49;00mdone\n",
+      "[etoc] Changing master_doc to 'intro'\n",
+      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
+      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
+      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\n",
+      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
+      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 90 source files that are out of date\n",
+      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 90 added, 0 changed, 0 removed\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]  \n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.24 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.31 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.89 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.31 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.17 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]     \n",
+      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.00 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.02 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executed notebook in 0.92 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executing notebook using local CWD [mystnb]      \n",
+      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executed notebook in 1.27 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executed notebook in 1.03 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executed notebook in 1.33 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executed notebook in 0.86 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executing notebook using local CWD [mystnb] \n",
+      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executed notebook in 0.94 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executed notebook in 1.03 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executing notebook using local CWD [mystnb]   \n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executed notebook in 1.20 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executed notebook in 0.89 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executing notebook using local CWD [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
+      "/workspaces/LeetCode-Solutions/Book.ipynb: Executing notebook using local CWD [mystnb]                          \n",
+      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/04. Stack/intro.md:5: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb:30008: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Executing notebook failed: CellTimeoutError [mystnb.exec]\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Notebook exception traceback saved in: /workspaces/LeetCode-Solutions/_build/html/reports/Book.err.log [mystnb.exec]\u001b[39;49;00m\n",
+      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
+      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
+      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/03. Sliding Window/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/04. Stack/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/05. Binary Search/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/06. Linked List/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/08. Tries/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/10. Backtracking/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/11. Graphs/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/12. Advanced Graphs/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/CODE_OF_CONDUCT.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "\u001b[91m/workspaces/LeetCode-Solutions/SECURITY.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
+      "done\n",
+      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
+      "\u001b[01mwriting output... \u001b[39;49;00m[ 94%] \u001b[32mBook\u001b[39;49;00m                                                   raph\u001b[39;49;00m0m\r"
+     ]
+    }
+   ],
+   "source": [
+    "!jupyter-book build ."
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Enumerating objects: 241, done.\n",
+      "Counting objects: 100% (241/241), done.\n",
+      "Delta compression using up to 2 threads\n",
+      "Compressing objects: 100% (34/34), done.\n",
+      "Writing objects: 100% (141/141), 301.49 KiB | 75.37 MiB/s, done.\n",
+      "Total 141 (delta 117), reused 126 (delta 102), pack-reused 0\n",
+      "remote: Resolving deltas: 100% (117/117), completed with 15 local objects.\u001b[K\n",
+      "To https://github.com/mohsentabibian/LeetCode-Solutions\n",
+      "   f40f6c9..bcf1c22  gh-pages -> gh-pages\n"
+     ]
+    }
+   ],
+   "source": [
+    "!ghp-import -n -p -f _build/html"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.10.8"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/CODE_OF_CONDUCT.md b/_sources/CODE_OF_CONDUCT.md
similarity index 100%
rename from CODE_OF_CONDUCT.md
rename to _sources/CODE_OF_CONDUCT.md
diff --git a/CONTRIBUTING.md b/_sources/CONTRIBUTING.md
similarity index 100%
rename from CONTRIBUTING.md
rename to _sources/CONTRIBUTING.md
diff --git a/README.md b/_sources/README.md
similarity index 100%
rename from README.md
rename to _sources/README.md
diff --git a/SECURITY.md b/_sources/SECURITY.md
similarity index 100%
rename from SECURITY.md
rename to _sources/SECURITY.md
diff --git a/_sources/intro.md b/_sources/intro.md
new file mode 100644
index 0000000..eebac5d
--- /dev/null
+++ b/_sources/intro.md
@@ -0,0 +1,47 @@
+# Introduction: Navigating the Coding Cosmos
+
+Greetings, coding adventurer! Welcome to the expansive odyssey that is "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges." In this vast tome, we embark on a transformative journey that transcends traditional problem-solving, delving into the intricate dance of algorithms, the elegance of Pythonic solutions, and the practical application of coding wisdom.
+
+## Unveiling the Coding Cosmos: Foundations of Array Mastery
+
+Our cosmic journey commences with the fundamental realm of "Array Manipulation." In this foundational section, we delve into the very essence of arrays—the building blocks of many algorithms. Understanding arrays isn't merely about memorizing syntax; it's about cultivating an intuition for array manipulation that transcends specific challenges. We explore not only the "how" but the "why" behind array manipulation, unraveling the logic that makes Pythonic solutions both powerful and elegant. Each problem is a microcosm, illustrating the nuanced strategies required for efficient array traversal, manipulation, and transformation.
+
+As we navigate through the cosmos of arrays, it's essential to recognize that arrays are not static entities; they are dynamic landscapes that, when navigated skillfully, reveal hidden patterns and efficient solutions. Consider the "Product of Array Except Self" challenge as an example—beyond providing an answer, we explore the underlying mathematical principles, unlocking a broader understanding of the problem's intricacies.
+
+## Navigating Graphical Constellations: Advanced Graph Theory
+
+Journeying deeper into the coding cosmos, we set our sights on the celestial realm of "Advanced Graphs." In this section, the challenges are like constellations, forming intricate patterns that guide us through the complexities of graph theory. The "Alien Dictionary" challenge, for instance, isn't just a problem to be solved; it's a portal to understanding the topological order, a gateway to deciphering language hierarchies in the cosmic lexicon.
+
+Graphs, like constellations in the night sky, may seem daunting at first, but as we explore their interconnected nodes and edges, we begin to discern the hidden order. We discuss not only the algorithmic solutions to graph challenges but also the real-world applications of graph theory. Understanding how to represent and manipulate relationships between entities is a skill that extends beyond coding interviews, proving invaluable in scenarios ranging from social network analysis to optimizing network infrastructures.
+
+## The Apex: Mastering the Blind 75 Challenges
+
+Our cosmic vessel propels us to the highest peaks of algorithmic prowess—the summit known as the Blind 75. Curated to mirror the challenges encountered in the revered halls of technical interviews, these problems serve as beacons illuminating the path to coding excellence. This section isn't merely a collection of challenges; it's a training ground for honing problem-solving skills to a razor-sharp edge.
+
+As we ascend, each challenge becomes a chapter in a narrative of skill development. Take "Longest Consecutive Sequence," for instance; it isn't just about finding the longest sequence but understanding how to traverse and manipulate sequences efficiently. Likewise, "Encode and Decode Strings" is more than encoding and decoding; it's an exploration of efficient data representation and transmission—a skill crucial in real-world scenarios, from data compression to network communication.
+
+## Pythonic Symphony: Art and Language Unite
+
+In the vast coding cosmos, Python is not just a language; it's a symphony. Our solutions aren't mere code; they are compositions that resonate with the clarity and elegance that Python provides. As we traverse the cosmic landscape, we explore the nuances of Pythonic coding—leveraging list comprehensions, exploiting the power of generators, and embracing the dynamic nature of the language.
+
+Pythonic solutions are not a luxury but a necessity. The art of crafting Pythonic code is about more than adhering to a set of conventions; it's about understanding the language's philosophy and utilizing its features to create code that is not only functional but a joy to read. A well-crafted Pythonic solution is a testament to the coder's understanding of the language's idioms and the ability to leverage them to their advantage.
+
+## Bridging Theory to Real-World Challenges
+
+This guide isn't a mere compendium of challenges; it's a bridge connecting theoretical knowledge to real-world challenges. Each chapter prepares you not only for the academic rigors of coding interviews but also for the dynamic challenges you'll encounter in the field. The Blind 75, in particular, serves as a beacon, illuminating the path to coding excellence. We delve into not just how to solve a problem but why a specific approach is chosen—bridging the gap between theoretical understanding and practical application.
+
+In the real-world coding cosmos, challenges are not neatly packaged LeetCode problems; they are dynamic, evolving scenarios that require adaptability and a deep understanding of underlying principles. The Blind 75 serves as a microcosm, preparing you for the unpredictability and complexity of real-world coding challenges.
+
+## A Holistic Coding Odyssey: Beyond the Challenges
+
+As we progress through the cosmic expanse of this book, it's crucial to recognize that the journey extends beyond the challenges laid before you. It's a holistic odyssey—an exploration of languages, algorithms, and the art of problem-solving. Each challenge is not just a problem to be solved; it's an opportunity to develop a mindset—a mindset of a skilled problem-solver ready to tackle any coding puzzle that comes your way.
+
+In each chapter, we provide insights into the broader context of the challenges, discussing their relevance in real-world scenarios and how the skills you acquire are transferable to a variety of coding endeavors. We emphasize not just the technical aspects of coding but the problem-solving mindset—a mindset that transcends specific challenges and prepares you for the unpredictable nature of the coding cosmos.
+
+As you immerse yourself in the challenges, you're not just learning to solve problems; you're honing the mindset of a skilled problem-solver, ready to tackle any coding puzzle that comes your way. This holistic approach ensures that you're not just a proficient coder but a versatile problem-solver—a coder equipped to navigate the dynamic and ever-evolving landscape of the coding cosmos.
+
+## Beyond the Pages: A Cosmic Coding Adventure
+
+So, fellow coder, embark on this cosmic journey with pen, paper, and Python at your side. Let the coding cosmos be your guide, and may your endeavors be met with the joy of discovery. Beyond the pages of this book, a cosmic coding adventure awaits—one that extends into the realms of real-world challenges, continuous learning, and the ever-expanding frontiers of coding excellence.
+
+Happy coding!
\ No newline at end of file
diff --git a/_build/html/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css b/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
similarity index 100%
rename from _build/html/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
rename to _sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
diff --git a/_build/html/_sphinx_design_static/design-tabs.js b/_sphinx_design_static/design-tabs.js
similarity index 100%
rename from _build/html/_sphinx_design_static/design-tabs.js
rename to _sphinx_design_static/design-tabs.js
diff --git a/_build/html/_static/_sphinx_javascript_frameworks_compat.js b/_static/_sphinx_javascript_frameworks_compat.js
similarity index 100%
rename from _build/html/_static/_sphinx_javascript_frameworks_compat.js
rename to _static/_sphinx_javascript_frameworks_compat.js
diff --git a/_build/html/_static/basic.css b/_static/basic.css
similarity index 100%
rename from _build/html/_static/basic.css
rename to _static/basic.css
diff --git a/_build/html/_static/check-solid.svg b/_static/check-solid.svg
similarity index 100%
rename from _build/html/_static/check-solid.svg
rename to _static/check-solid.svg
diff --git a/_build/html/_static/clipboard.min.js b/_static/clipboard.min.js
similarity index 100%
rename from _build/html/_static/clipboard.min.js
rename to _static/clipboard.min.js
diff --git a/_build/html/_static/copy-button.svg b/_static/copy-button.svg
similarity index 100%
rename from _build/html/_static/copy-button.svg
rename to _static/copy-button.svg
diff --git a/_build/html/_static/copybutton.css b/_static/copybutton.css
similarity index 100%
rename from _build/html/_static/copybutton.css
rename to _static/copybutton.css
diff --git a/_build/html/_static/copybutton.js b/_static/copybutton.js
similarity index 100%
rename from _build/html/_static/copybutton.js
rename to _static/copybutton.js
diff --git a/_build/html/_static/copybutton_funcs.js b/_static/copybutton_funcs.js
similarity index 100%
rename from _build/html/_static/copybutton_funcs.js
rename to _static/copybutton_funcs.js
diff --git a/_build/html/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css b/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
similarity index 100%
rename from _build/html/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
rename to _static/design-style.4045f2051d55cab465a707391d5b2007.min.css
diff --git a/_build/html/_static/design-tabs.js b/_static/design-tabs.js
similarity index 100%
rename from _build/html/_static/design-tabs.js
rename to _static/design-tabs.js
diff --git a/_build/html/_static/doctools.js b/_static/doctools.js
similarity index 100%
rename from _build/html/_static/doctools.js
rename to _static/doctools.js
diff --git a/_build/html/_static/documentation_options.js b/_static/documentation_options.js
similarity index 100%
rename from _build/html/_static/documentation_options.js
rename to _static/documentation_options.js
diff --git a/_build/html/_static/file.png b/_static/file.png
similarity index 100%
rename from _build/html/_static/file.png
rename to _static/file.png
diff --git a/_build/html/_static/images/logo_binder.svg b/_static/images/logo_binder.svg
similarity index 100%
rename from _build/html/_static/images/logo_binder.svg
rename to _static/images/logo_binder.svg
diff --git a/_build/html/_static/images/logo_colab.png b/_static/images/logo_colab.png
similarity index 100%
rename from _build/html/_static/images/logo_colab.png
rename to _static/images/logo_colab.png
diff --git a/_build/html/_static/images/logo_deepnote.svg b/_static/images/logo_deepnote.svg
similarity index 100%
rename from _build/html/_static/images/logo_deepnote.svg
rename to _static/images/logo_deepnote.svg
diff --git a/_build/html/_static/images/logo_jupyterhub.svg b/_static/images/logo_jupyterhub.svg
similarity index 100%
rename from _build/html/_static/images/logo_jupyterhub.svg
rename to _static/images/logo_jupyterhub.svg
diff --git a/_build/html/_static/jquery-3.6.0.js b/_static/jquery-3.6.0.js
similarity index 100%
rename from _build/html/_static/jquery-3.6.0.js
rename to _static/jquery-3.6.0.js
diff --git a/_build/html/_static/jquery.js b/_static/jquery.js
similarity index 100%
rename from _build/html/_static/jquery.js
rename to _static/jquery.js
diff --git a/_build/html/_static/language_data.js b/_static/language_data.js
similarity index 100%
rename from _build/html/_static/language_data.js
rename to _static/language_data.js
diff --git a/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.mo b/_static/locales/ar/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ar/LC_MESSAGES/booktheme.mo
rename to _static/locales/ar/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.po b/_static/locales/ar/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ar/LC_MESSAGES/booktheme.po
rename to _static/locales/ar/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.mo b/_static/locales/bg/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/bg/LC_MESSAGES/booktheme.mo
rename to _static/locales/bg/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.po b/_static/locales/bg/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/bg/LC_MESSAGES/booktheme.po
rename to _static/locales/bg/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.mo b/_static/locales/bn/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/bn/LC_MESSAGES/booktheme.mo
rename to _static/locales/bn/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.po b/_static/locales/bn/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/bn/LC_MESSAGES/booktheme.po
rename to _static/locales/bn/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.mo b/_static/locales/ca/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ca/LC_MESSAGES/booktheme.mo
rename to _static/locales/ca/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.po b/_static/locales/ca/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ca/LC_MESSAGES/booktheme.po
rename to _static/locales/ca/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.mo b/_static/locales/cs/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/cs/LC_MESSAGES/booktheme.mo
rename to _static/locales/cs/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.po b/_static/locales/cs/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/cs/LC_MESSAGES/booktheme.po
rename to _static/locales/cs/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/da/LC_MESSAGES/booktheme.mo b/_static/locales/da/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/da/LC_MESSAGES/booktheme.mo
rename to _static/locales/da/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/da/LC_MESSAGES/booktheme.po b/_static/locales/da/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/da/LC_MESSAGES/booktheme.po
rename to _static/locales/da/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/de/LC_MESSAGES/booktheme.mo b/_static/locales/de/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/de/LC_MESSAGES/booktheme.mo
rename to _static/locales/de/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/de/LC_MESSAGES/booktheme.po b/_static/locales/de/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/de/LC_MESSAGES/booktheme.po
rename to _static/locales/de/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/el/LC_MESSAGES/booktheme.mo b/_static/locales/el/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/el/LC_MESSAGES/booktheme.mo
rename to _static/locales/el/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/el/LC_MESSAGES/booktheme.po b/_static/locales/el/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/el/LC_MESSAGES/booktheme.po
rename to _static/locales/el/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.mo b/_static/locales/eo/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/eo/LC_MESSAGES/booktheme.mo
rename to _static/locales/eo/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.po b/_static/locales/eo/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/eo/LC_MESSAGES/booktheme.po
rename to _static/locales/eo/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/es/LC_MESSAGES/booktheme.mo b/_static/locales/es/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/es/LC_MESSAGES/booktheme.mo
rename to _static/locales/es/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/es/LC_MESSAGES/booktheme.po b/_static/locales/es/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/es/LC_MESSAGES/booktheme.po
rename to _static/locales/es/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/et/LC_MESSAGES/booktheme.mo b/_static/locales/et/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/et/LC_MESSAGES/booktheme.mo
rename to _static/locales/et/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/et/LC_MESSAGES/booktheme.po b/_static/locales/et/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/et/LC_MESSAGES/booktheme.po
rename to _static/locales/et/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.mo b/_static/locales/fi/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/fi/LC_MESSAGES/booktheme.mo
rename to _static/locales/fi/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.po b/_static/locales/fi/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/fi/LC_MESSAGES/booktheme.po
rename to _static/locales/fi/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.mo b/_static/locales/fr/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/fr/LC_MESSAGES/booktheme.mo
rename to _static/locales/fr/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.po b/_static/locales/fr/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/fr/LC_MESSAGES/booktheme.po
rename to _static/locales/fr/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.mo b/_static/locales/hr/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/hr/LC_MESSAGES/booktheme.mo
rename to _static/locales/hr/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.po b/_static/locales/hr/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/hr/LC_MESSAGES/booktheme.po
rename to _static/locales/hr/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/id/LC_MESSAGES/booktheme.mo b/_static/locales/id/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/id/LC_MESSAGES/booktheme.mo
rename to _static/locales/id/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/id/LC_MESSAGES/booktheme.po b/_static/locales/id/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/id/LC_MESSAGES/booktheme.po
rename to _static/locales/id/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/it/LC_MESSAGES/booktheme.mo b/_static/locales/it/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/it/LC_MESSAGES/booktheme.mo
rename to _static/locales/it/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/it/LC_MESSAGES/booktheme.po b/_static/locales/it/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/it/LC_MESSAGES/booktheme.po
rename to _static/locales/it/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.mo b/_static/locales/iw/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/iw/LC_MESSAGES/booktheme.mo
rename to _static/locales/iw/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.po b/_static/locales/iw/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/iw/LC_MESSAGES/booktheme.po
rename to _static/locales/iw/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.mo b/_static/locales/ja/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ja/LC_MESSAGES/booktheme.mo
rename to _static/locales/ja/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.po b/_static/locales/ja/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ja/LC_MESSAGES/booktheme.po
rename to _static/locales/ja/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.mo b/_static/locales/ko/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ko/LC_MESSAGES/booktheme.mo
rename to _static/locales/ko/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.po b/_static/locales/ko/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ko/LC_MESSAGES/booktheme.po
rename to _static/locales/ko/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.mo b/_static/locales/lt/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/lt/LC_MESSAGES/booktheme.mo
rename to _static/locales/lt/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.po b/_static/locales/lt/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/lt/LC_MESSAGES/booktheme.po
rename to _static/locales/lt/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.mo b/_static/locales/lv/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/lv/LC_MESSAGES/booktheme.mo
rename to _static/locales/lv/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.po b/_static/locales/lv/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/lv/LC_MESSAGES/booktheme.po
rename to _static/locales/lv/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.mo b/_static/locales/ml/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ml/LC_MESSAGES/booktheme.mo
rename to _static/locales/ml/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.po b/_static/locales/ml/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ml/LC_MESSAGES/booktheme.po
rename to _static/locales/ml/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.mo b/_static/locales/mr/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/mr/LC_MESSAGES/booktheme.mo
rename to _static/locales/mr/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.po b/_static/locales/mr/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/mr/LC_MESSAGES/booktheme.po
rename to _static/locales/mr/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.mo b/_static/locales/ms/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ms/LC_MESSAGES/booktheme.mo
rename to _static/locales/ms/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.po b/_static/locales/ms/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ms/LC_MESSAGES/booktheme.po
rename to _static/locales/ms/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.mo b/_static/locales/nl/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/nl/LC_MESSAGES/booktheme.mo
rename to _static/locales/nl/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.po b/_static/locales/nl/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/nl/LC_MESSAGES/booktheme.po
rename to _static/locales/nl/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/no/LC_MESSAGES/booktheme.mo b/_static/locales/no/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/no/LC_MESSAGES/booktheme.mo
rename to _static/locales/no/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/no/LC_MESSAGES/booktheme.po b/_static/locales/no/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/no/LC_MESSAGES/booktheme.po
rename to _static/locales/no/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.mo b/_static/locales/pl/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/pl/LC_MESSAGES/booktheme.mo
rename to _static/locales/pl/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.po b/_static/locales/pl/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/pl/LC_MESSAGES/booktheme.po
rename to _static/locales/pl/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.mo b/_static/locales/pt/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/pt/LC_MESSAGES/booktheme.mo
rename to _static/locales/pt/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.po b/_static/locales/pt/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/pt/LC_MESSAGES/booktheme.po
rename to _static/locales/pt/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.mo b/_static/locales/ro/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ro/LC_MESSAGES/booktheme.mo
rename to _static/locales/ro/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.po b/_static/locales/ro/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ro/LC_MESSAGES/booktheme.po
rename to _static/locales/ro/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.mo b/_static/locales/ru/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ru/LC_MESSAGES/booktheme.mo
rename to _static/locales/ru/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.po b/_static/locales/ru/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ru/LC_MESSAGES/booktheme.po
rename to _static/locales/ru/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.mo b/_static/locales/sk/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/sk/LC_MESSAGES/booktheme.mo
rename to _static/locales/sk/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.po b/_static/locales/sk/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/sk/LC_MESSAGES/booktheme.po
rename to _static/locales/sk/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.mo b/_static/locales/sl/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/sl/LC_MESSAGES/booktheme.mo
rename to _static/locales/sl/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.po b/_static/locales/sl/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/sl/LC_MESSAGES/booktheme.po
rename to _static/locales/sl/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.mo b/_static/locales/sr/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/sr/LC_MESSAGES/booktheme.mo
rename to _static/locales/sr/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.po b/_static/locales/sr/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/sr/LC_MESSAGES/booktheme.po
rename to _static/locales/sr/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.mo b/_static/locales/sv/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/sv/LC_MESSAGES/booktheme.mo
rename to _static/locales/sv/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.po b/_static/locales/sv/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/sv/LC_MESSAGES/booktheme.po
rename to _static/locales/sv/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.mo b/_static/locales/ta/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ta/LC_MESSAGES/booktheme.mo
rename to _static/locales/ta/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.po b/_static/locales/ta/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ta/LC_MESSAGES/booktheme.po
rename to _static/locales/ta/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/te/LC_MESSAGES/booktheme.mo b/_static/locales/te/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/te/LC_MESSAGES/booktheme.mo
rename to _static/locales/te/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/te/LC_MESSAGES/booktheme.po b/_static/locales/te/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/te/LC_MESSAGES/booktheme.po
rename to _static/locales/te/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.mo b/_static/locales/tg/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/tg/LC_MESSAGES/booktheme.mo
rename to _static/locales/tg/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.po b/_static/locales/tg/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/tg/LC_MESSAGES/booktheme.po
rename to _static/locales/tg/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/th/LC_MESSAGES/booktheme.mo b/_static/locales/th/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/th/LC_MESSAGES/booktheme.mo
rename to _static/locales/th/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/th/LC_MESSAGES/booktheme.po b/_static/locales/th/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/th/LC_MESSAGES/booktheme.po
rename to _static/locales/th/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.mo b/_static/locales/tl/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/tl/LC_MESSAGES/booktheme.mo
rename to _static/locales/tl/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.po b/_static/locales/tl/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/tl/LC_MESSAGES/booktheme.po
rename to _static/locales/tl/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.mo b/_static/locales/tr/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/tr/LC_MESSAGES/booktheme.mo
rename to _static/locales/tr/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.po b/_static/locales/tr/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/tr/LC_MESSAGES/booktheme.po
rename to _static/locales/tr/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.mo b/_static/locales/uk/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/uk/LC_MESSAGES/booktheme.mo
rename to _static/locales/uk/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.po b/_static/locales/uk/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/uk/LC_MESSAGES/booktheme.po
rename to _static/locales/uk/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.mo b/_static/locales/ur/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/ur/LC_MESSAGES/booktheme.mo
rename to _static/locales/ur/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.po b/_static/locales/ur/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/ur/LC_MESSAGES/booktheme.po
rename to _static/locales/ur/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.mo b/_static/locales/vi/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/vi/LC_MESSAGES/booktheme.mo
rename to _static/locales/vi/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.po b/_static/locales/vi/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/vi/LC_MESSAGES/booktheme.po
rename to _static/locales/vi/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo b/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo
rename to _static/locales/zh_CN/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.po b/_static/locales/zh_CN/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.po
rename to _static/locales/zh_CN/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo b/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo
similarity index 100%
rename from _build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo
rename to _static/locales/zh_TW/LC_MESSAGES/booktheme.mo
diff --git a/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.po b/_static/locales/zh_TW/LC_MESSAGES/booktheme.po
similarity index 100%
rename from _build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.po
rename to _static/locales/zh_TW/LC_MESSAGES/booktheme.po
diff --git a/_build/html/_static/minus.png b/_static/minus.png
similarity index 100%
rename from _build/html/_static/minus.png
rename to _static/minus.png
diff --git a/_build/html/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css b/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css
similarity index 100%
rename from _build/html/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css
rename to _static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css
diff --git a/_build/html/_static/plus.png b/_static/plus.png
similarity index 100%
rename from _build/html/_static/plus.png
rename to _static/plus.png
diff --git a/_build/html/_static/pygments.css b/_static/pygments.css
similarity index 100%
rename from _build/html/_static/pygments.css
rename to _static/pygments.css
diff --git a/_build/html/_static/sbt-webpack-macros.html b/_static/sbt-webpack-macros.html
similarity index 100%
rename from _build/html/_static/sbt-webpack-macros.html
rename to _static/sbt-webpack-macros.html
diff --git a/_build/html/_static/scripts/bootstrap.js b/_static/scripts/bootstrap.js
similarity index 100%
rename from _build/html/_static/scripts/bootstrap.js
rename to _static/scripts/bootstrap.js
diff --git a/_build/html/_static/scripts/bootstrap.js.LICENSE.txt b/_static/scripts/bootstrap.js.LICENSE.txt
similarity index 100%
rename from _build/html/_static/scripts/bootstrap.js.LICENSE.txt
rename to _static/scripts/bootstrap.js.LICENSE.txt
diff --git a/_build/html/_static/scripts/bootstrap.js.map b/_static/scripts/bootstrap.js.map
similarity index 100%
rename from _build/html/_static/scripts/bootstrap.js.map
rename to _static/scripts/bootstrap.js.map
diff --git a/_build/html/_static/scripts/pydata-sphinx-theme.js b/_static/scripts/pydata-sphinx-theme.js
similarity index 100%
rename from _build/html/_static/scripts/pydata-sphinx-theme.js
rename to _static/scripts/pydata-sphinx-theme.js
diff --git a/_build/html/_static/scripts/pydata-sphinx-theme.js.map b/_static/scripts/pydata-sphinx-theme.js.map
similarity index 100%
rename from _build/html/_static/scripts/pydata-sphinx-theme.js.map
rename to _static/scripts/pydata-sphinx-theme.js.map
diff --git a/_build/html/_static/scripts/sphinx-book-theme.js b/_static/scripts/sphinx-book-theme.js
similarity index 100%
rename from _build/html/_static/scripts/sphinx-book-theme.js
rename to _static/scripts/sphinx-book-theme.js
diff --git a/_build/html/_static/scripts/sphinx-book-theme.js.map b/_static/scripts/sphinx-book-theme.js.map
similarity index 100%
rename from _build/html/_static/scripts/sphinx-book-theme.js.map
rename to _static/scripts/sphinx-book-theme.js.map
diff --git a/_build/html/_static/searchtools.js b/_static/searchtools.js
similarity index 100%
rename from _build/html/_static/searchtools.js
rename to _static/searchtools.js
diff --git a/_build/html/_static/sphinx-thebe.css b/_static/sphinx-thebe.css
similarity index 100%
rename from _build/html/_static/sphinx-thebe.css
rename to _static/sphinx-thebe.css
diff --git a/_build/html/_static/sphinx-thebe.js b/_static/sphinx-thebe.js
similarity index 100%
rename from _build/html/_static/sphinx-thebe.js
rename to _static/sphinx-thebe.js
diff --git a/_build/html/_static/styles/bootstrap.css b/_static/styles/bootstrap.css
similarity index 100%
rename from _build/html/_static/styles/bootstrap.css
rename to _static/styles/bootstrap.css
diff --git a/_build/html/_static/styles/bootstrap.css.map b/_static/styles/bootstrap.css.map
similarity index 100%
rename from _build/html/_static/styles/bootstrap.css.map
rename to _static/styles/bootstrap.css.map
diff --git a/_build/html/_static/styles/pydata-sphinx-theme.css b/_static/styles/pydata-sphinx-theme.css
similarity index 100%
rename from _build/html/_static/styles/pydata-sphinx-theme.css
rename to _static/styles/pydata-sphinx-theme.css
diff --git a/_build/html/_static/styles/pydata-sphinx-theme.css.map b/_static/styles/pydata-sphinx-theme.css.map
similarity index 100%
rename from _build/html/_static/styles/pydata-sphinx-theme.css.map
rename to _static/styles/pydata-sphinx-theme.css.map
diff --git a/_build/html/_static/styles/sphinx-book-theme.css b/_static/styles/sphinx-book-theme.css
similarity index 100%
rename from _build/html/_static/styles/sphinx-book-theme.css
rename to _static/styles/sphinx-book-theme.css
diff --git a/_build/html/_static/styles/theme.css b/_static/styles/theme.css
similarity index 100%
rename from _build/html/_static/styles/theme.css
rename to _static/styles/theme.css
diff --git a/_build/html/_static/togglebutton.css b/_static/togglebutton.css
similarity index 100%
rename from _build/html/_static/togglebutton.css
rename to _static/togglebutton.css
diff --git a/_build/html/_static/togglebutton.js b/_static/togglebutton.js
similarity index 100%
rename from _build/html/_static/togglebutton.js
rename to _static/togglebutton.js
diff --git a/_build/html/_static/underscore-1.13.1.js b/_static/underscore-1.13.1.js
similarity index 100%
rename from _build/html/_static/underscore-1.13.1.js
rename to _static/underscore-1.13.1.js
diff --git a/_build/html/_static/underscore.js b/_static/underscore.js
similarity index 100%
rename from _build/html/_static/underscore.js
rename to _static/underscore.js
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/LICENSE.txt b/_static/vendor/fontawesome/6.1.2/LICENSE.txt
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/LICENSE.txt
rename to _static/vendor/fontawesome/6.1.2/LICENSE.txt
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/css/all.min.css b/_static/vendor/fontawesome/6.1.2/css/all.min.css
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/css/all.min.css
rename to _static/vendor/fontawesome/6.1.2/css/all.min.css
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js b/_static/vendor/fontawesome/6.1.2/js/all.min.js
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js
rename to _static/vendor/fontawesome/6.1.2/js/all.min.js
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt b/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt
rename to _static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf b/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2 b/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf b/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2 b/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf b/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2 b/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf b/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf
diff --git a/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2 b/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2
similarity index 100%
rename from _build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2
rename to _static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2
diff --git a/_build/html/_static/webpack-macros.html b/_static/webpack-macros.html
similarity index 100%
rename from _build/html/_static/webpack-macros.html
rename to _static/webpack-macros.html
diff --git a/_toc.yml b/_toc.yml
deleted file mode 100644
index 0e4e1db..0000000
--- a/_toc.yml
+++ /dev/null
@@ -1,88 +0,0 @@
-format: jb-book
-root: README
-chapters:
-  - file: 01. Array Hashing/README
-    sections:
-      - file: 01. Array Hashing/1. Two Sum
-      - file: 01. Array Hashing/128. Longest Consecutive Sequence
-      - file: 01. Array Hashing/217. Contains Duplicate
-      - file: 01. Array Hashing/238. Product of Array Except Self
-      - file: 01. Array Hashing/242. Valid Anagram
-      - file: 01. Array Hashing/347. Top K Frequent Elements
-      - file: 01. Array Hashing/49. Group Anagrams
-      - file: 01. Array Hashing/659. Encode and Decode Strings
-  - file: 02. Two Pointers/README
-    sections:
-      - file: 02. Two Pointers/11. Container With Most Water
-      - file: 02. Two Pointers/125. Valid Palindrome
-      - file: 02. Two Pointers/15. 3Sum
-  - file: 03. Sliding Window/README
-    sections:
-      - file: 03. Sliding Window/121. Best Time to Buy and Sell Stock
-      - file: 03. Sliding Window/3. Longest Substring Without Repeating Characters
-      - file: 03. Sliding Window/424. Longest Repeating Character Replacement
-      - file: 03. Sliding Window/76. Minimum Window Substring
-  - file: 04. Stack/README
-    sections:
-      - file: 04. Stack/20. Valid Parentheses
-  - file: 05. Binary Search/README
-    sections:
-      - file: 05. Binary Search/153. Find Minimum in Rotated Sorted Array
-      - file: 05. Binary Search/33. Search in Rotated Sorted Array
-  - file: 06. Linked List/README
-    sections:
-      - file: 06. Linked List/141. Linked List Cycle
-      - file: 06. Linked List/143. Reorder List
-      - file: 06. Linked List/19. Remove Nth Node From End of List
-      - file: 06. Linked List/206. Reverse Linked List
-      - file: 06. Linked List/21. Merge Two Sorted Lists
-      - file: 06. Linked List/23. Merge k Sorted Lists
-  - file: 07. Trees/README
-    sections:
-      - file: 07. Trees/100. Same Tree
-      - file: 07. Trees/102. Binary Tree Level Order Traversal
-      - file: 07. Trees/104. Maximum Depth of Binary Tree
-      - file: 07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal
-      - file: 07. Trees/124. Binary Tree Maximum Path Sum
-      - file: 07. Trees/199. Binary Tree Right Side View
-      - file: 07. Trees/226. Invert Binary Tree
-      - file: 07. Trees/230. Kth Smallest Element in a BST
-      - file: 07. Trees/235. Lowest Common Ancestor of a Binary Search Tree
-      - file: 07. Trees/297. Serialize and Deserialize Binary Tree
-      - file: 07. Trees/572. Subtree of Another Tree
-      - file: 07. Trees/98. Validate Binary Search Tree
-  - file: 08. Tries/README
-    sections:
-      - file: 08. Tries/208. Implement Trie (Prefix Tree)
-      - file: 08. Tries/211. Design Add and Search Words Data Structure
-      - file: 08. Tries/212. Word Search II
-  - file: 09. Heap - Priority Queue/README
-    sections:
-      - file: 09. Heap - Priority Queue/1046. Last Stone Weight
-      - file: 09. Heap - Priority Queue/295. Find Median from Data Stream
-      - file: 09. Heap - Priority Queue/703. Kth Largest Element in a Stream
-  - file: 10. Backtracking/README
-    sections:
-      - file: 10. Backtracking/39. Combination Sum
-      - file: 10. Backtracking/79. Word Search
-  - file: 11. Graphs/README
-    sections:
-      - file: 11. Graphs/133. Clone Graph
-      - file: 11. Graphs/178. Graph Valid Tree
-      - file: 11. Graphs/200. Number of Islands
-      - file: 11. Graphs/207. Course Schedule
-      - file: 11. Graphs/3651. Number of Connected Components in an Undirected Graph
-      - file: 11. Graphs/417. Pacific Atlantic Water Flow
-  - file: 12. Advanced Graphs/README
-    sections:
-      - file: 12. Advanced Graphs/892. Alien Dictionary
-  - file: 13. One-D Dynamic Programming/README
-    sections:
-      - file: 13. One-D Dynamic Programming/70. Climbing Stairs
-      - file: 13. One-D Dynamic Programming/198. House Robber
-      - file: 13. One-D Dynamic Programming/213. House Robber II
-  - file: 14. Two-D Dynamic Programming/README
-  - file: 15. Greedy/README
-  - file: 16. Intervals/README
-  - file: 17. Math Geometry/README
-  - file: 18. Bit Manipulation/README
\ No newline at end of file
diff --git a/docs/01. Array Hashing/1. Two Sum.ipynb b/docs/01. Array Hashing/1. Two Sum.ipynb
deleted file mode 100644
index b3b517f..0000000
--- a/docs/01. Array Hashing/1. Two Sum.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= `Node.val` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "+ Time Complexity: $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ Space Complexity: $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/docs/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
deleted file mode 100644
index a77a03d..0000000
--- a/docs/01. Array Hashing/128. Longest Consecutive Sequence.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 128. Longest Consecutive Sequence\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Consecutive Sequence problem on LeetCode, click here!](https://leetcode.com/problems/longest-consecutive-sequence/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an unsorted array of integers `nums`, return *the length of the longest consecutive elements sequence.*\n",
-        "\n",
-        "You must write an algorithm that runs in `O(n)` time.\n",
-        "\n",
-        "*Constraints:**\n",
-        "- 0 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def longestConsecutive(nums):\n",
-        "    if not nums:\n",
-        "        return 0\n",
-        "\n",
-        "    num_set = set(nums)\n",
-        "    max_length = 0\n",
-        "\n",
-        "    for num in num_set:\n",
-        "        if num - 1 not in num_set:\n",
-        "            current_num = num\n",
-        "            current_length = 1\n",
-        "\n",
-        "            while current_num + 1 in num_set:\n",
-        "                current_num += 1\n",
-        "                current_length += 1\n",
-        "\n",
-        "            max_length = max(max_length, current_length)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `longestConsecutive` function that takes the `nums` array as input.\n",
-        "\n",
-        "2. We check if the `nums` array is empty. If it's empty, there are no consecutive elements, so we return 0.\n",
-        "\n",
-        "3. We create a Python set called `num_set` and insert all elements from the `nums` array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.\n",
-        "\n",
-        "4. We initialize a variable `max_length` to 0. This variable will keep track of the maximum length of consecutive elements sequence found.\n",
-        "\n",
-        "5. We iterate through the elements of the `num_set`. For each element `num`, we check if `num - 1` exists in the `num_set`. If it doesn't exist, it means `num` is the starting element of a potential consecutive sequence.\n",
-        "\n",
-        "6. Inside the loop, we initialize two variables: `current_num` to the current element `num` and `current_length` to 1. We start with a length of 1 because `num` itself is part of the sequence.\n",
-        "\n",
-        "7. We then enter a while loop that continues as long as `current_num + 1` exists in the `num_set`. This means we are incrementing the consecutive sequence.\n",
-        "\n",
-        "8. Inside the while loop, we increment `current_num` by 1 and also increment `current_length` by 1 to account for the next consecutive element.\n",
-        "\n",
-        "9. We compare `current_length` with the `max_length` and update `max_length` if the current sequence is longer.\n",
-        "\n",
-        "10. After the while loop, we move to the next element in the outer loop and repeat the process.\n",
-        "\n",
-        "11. Finally, we return the `max_length` as the result, which represents the length of the longest consecutive elements sequence in the `nums` array.\n",
-        "\n",
-        "The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "nums1 = [100, 4, 200, 1, 3, 2]\n",
-        "print(longestConsecutive(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "9\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "nums2 = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]\n",
-        "print(longestConsecutive(nums2)) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The code is designed to run in O(n) time complexity, where n is the number of elements in the `nums` array. Here's the breakdown:\n",
-        "\n",
-        "1. Constructing the `num_set` by inserting all elements from `nums` into it takes O(n) time because we perform an insertion operation for each element in `nums`.\n",
-        "\n",
-        "2. The main loop iterates through the elements in `num_set`. In the worst case, each element is visited only once, so the loop itself takes O(n) time.\n",
-        "\n",
-        "3. Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).\n",
-        "\n",
-        "Therefore, the overall time complexity of the code is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the code is determined by the space used by the `num_set` and a few additional variables. Here's the breakdown:\n",
-        "\n",
-        "1. `num_set` is a set that stores the unique elements from `nums`. In the worst case, it can store all n elements from `nums`, so the space complexity is O(n).\n",
-        "\n",
-        "2. The additional variables used, such as `max_length`, `current_num`, and `current_length`, have constant space requirements and do not depend on the size of the input array.\n",
-        "\n",
-        "Therefore, the overall space complexity of the code is O(n) due to the space used by the `num_set`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.\n",
-        "\n",
-        "2. Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/217. Contains Duplicate.ipynb b/docs/01. Array Hashing/217. Contains Duplicate.ipynb
deleted file mode 100644
index 57bb55d..0000000
--- a/docs/01. Array Hashing/217. Contains Duplicate.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 217. Contains Duplicate\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Contains Duplicate problem on LeetCode, click here!](https://leetcode.com/problems/contains-duplicate/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def containsDuplicate(nums):\n",
-        "    # Create an empty set to store unique elements\n",
-        "    unique_elements = set()\n",
-        "    \n",
-        "    # Iterate through the array\n",
-        "    for num in nums:\n",
-        "        # If the element is already in the set, return True\n",
-        "        if num in unique_elements:\n",
-        "            return True\n",
-        "        # Otherwise, add it to the set\n",
-        "        else:\n",
-        "            unique_elements.add(num)\n",
-        "    \n",
-        "    # If the loop completes without finding duplicates, return False\n",
-        "    return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `containsDuplicate` function takes a single argument, `nums`, which is the input integer array.\n",
-        "\n",
-        "2. Inside the function, an empty set called `unique_elements` is created. This set will be used to keep track of unique elements in the input array.\n",
-        "\n",
-        "3. The function then iterates through the input array `nums` using a `for` loop.\n",
-        "\n",
-        "4. For each element `num` in the array, it checks whether `num` is already in the `unique_elements` set using the `if num in unique_elements:` condition.\n",
-        "\n",
-        "5. If `num` is already in the set, it means there is a duplicate element in the array, and the function immediately returns `True`.\n",
-        "\n",
-        "6. If `num` is not in the set, it is added to the `unique_elements` set using `unique_elements.add(num)`.\n",
-        "\n",
-        "7. The loop continues to the next element, and the process repeats.\n",
-        "\n",
-        "8. If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns `False`.\n",
-        "\n",
-        "The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem's requirements and constraints, as explained earlier."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums1 = [1, 2, 3, 1]\n",
-        "print(containsDuplicate(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums2 = [1, 2, 3, 4]\n",
-        "print(containsDuplicate(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums3 = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2]\n",
-        "print(containsDuplicate(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for the \"Contains Duplicate\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary operation that affects the time complexity is the `for` loop that iterates through the input array `nums`. In the worst case, the loop will iterate through all `n` elements of the array, where `n` is the length of the input array.\n",
-        "\n",
-        "- Iterating through the array: O(n)\n",
-        "\n",
-        "Inside the loop, we perform two operations:\n",
-        "\n",
-        "1. Checking whether an element exists in the `unique_elements` set (`if num in unique_elements`). This operation has an average time complexity of O(1) for a set.\n",
-        "2. Adding an element to the `unique_elements` set (`unique_elements.add(num)`), which also has an average time complexity of O(1) for a set.\n",
-        "\n",
-        "Since these operations are performed for each element in the array, the overall time complexity remains O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity is determined by the additional data structures used in the code, which are the `unique_elements` set.\n",
-        "\n",
-        "- `unique_elements` set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all `n` elements.\n",
-        "\n",
-        "Therefore, the space complexity is O(n) because, in the worst case, the set's size will grow linearly with the input array's size.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where `n` is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K Duplicates:** Modify the problem to return `true` if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns `true` if there are exactly K duplicates.\n",
-        "2. **Frequency Count:** Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/238. Product of Array Except Self.ipynb b/docs/01. Array Hashing/238. Product of Array Except Self.ipynb
deleted file mode 100644
index 1ff9a9c..0000000
--- a/docs/01. Array Hashing/238. Product of Array Except Self.ipynb	
+++ /dev/null
@@ -1,197 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 238. Product of Array Except Self\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Product of Array Except Self problem on LeetCode, click here!](https://leetcode.com/problems/product-of-array-except-self/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums`, return *an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.*\n",
-        "\n",
-        "The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "You must write an algorithm that runs in O(n) time and without using the division operation.\n",
-        "\n",
-        "Constraints:\n",
-        "- 2 <= `nums.length` <= $10^5$\n",
-        "- `-30 <= nums[i] <= 30`\n",
-        "- The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "**Follow-up:** Can you solve the problem in O(1) extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def productExceptSelf(nums):\n",
-        "    n = len(nums)\n",
-        "    \n",
-        "    # Initialize two arrays to store products to the left and right of each element\n",
-        "    left_products = [1] * n\n",
-        "    right_products = [1] * n\n",
-        "    \n",
-        "    # Calculate products to the left of each element\n",
-        "    left_product = 1\n",
-        "    for i in range(n):\n",
-        "        left_products[i] = left_product\n",
-        "        left_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate products to the right of each element\n",
-        "    right_product = 1\n",
-        "    for i in range(n - 1, -1, -1):\n",
-        "        right_products[i] = right_product\n",
-        "        right_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate the final answer using left and right products\n",
-        "    answer = [left_products[i] * right_products[i] for i in range(n)]\n",
-        "    \n",
-        "    return answer"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `n` is initialized as the length of the `nums` array.\n",
-        "2. Two arrays, `left_products` and `right_products`, are created, each with a length of `n` and filled with ones initially.\n",
-        "3. `left_product` is initialized to 1.\n",
-        "4. A loop iterates through the `nums` array, from left to right. For each element at index `i`, it stores the product of all elements to its left (including itself) in the `left_products` array and updates `left_product` accordingly.\n",
-        "5. `right_product` is initialized to 1.\n",
-        "6. Another loop iterates through the `nums` array in reverse order, from right to left. For each element at index `i`, it stores the product of all elements to its right (including itself) in the `right_products` array and updates `right_product`.\n",
-        "7. The final `answer` list is constructed by multiplying corresponding elements from the `left_products` and `right_products` arrays for each index `i`.\n",
-        "8. The function returns the `answer` list, which contains the desired results.\n",
-        "\n",
-        "Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[24, 12, 8, 6]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,2,3,4]\n",
-        "result1 = productExceptSelf(nums)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 53,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[0, 0, 9, 0, 0]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [-1,1,0,-3,3]\n",
-        "result2 = productExceptSelf(nums)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop iterates through the `nums` array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the `nums` array.\n",
-        "2. The second loop also iterates through the `nums` array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.\n",
-        "3. The final loop constructs the `answer` list by multiplying elements from the `left_products` and `right_products` arrays. This loop runs in O(n) time.\n",
-        "\n",
-        "Since all the loops are independent and sequential, the overall time complexity is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. Two additional arrays, `left_products` and `right_products`, are created with a length of `n`, where `n` is the length of the `nums` array. Therefore, these arrays consume O(n) extra space.\n",
-        "2. The `left_product` and `right_product` variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.\n",
-        "3. The `answer` list, which contains the final results, also consumes O(n) space, but it's not counted toward the extra space complexity analysis as per the problem's constraints.\n",
-        "\n",
-        "Overall, the space complexity is O(n) for this solution."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Handle Zeros in the Input**: Modify the solution to handle cases where the input array contains zeros. For example, if `nums = [0, 1, 2, 3, 0]`, the output should be `[0, 0, 0, 0, 0]` because any element multiplied by zero results in zero.\n",
-        "\n",
-        "2. **In-Place Modification**: Attempt to solve the problem with in-place modification of the `nums` array, where the output is stored directly in the input array without using any additional space."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/242. Valid Anagram.ipynb b/docs/01. Array Hashing/242. Valid Anagram.ipynb
deleted file mode 100644
index d165899..0000000
--- a/docs/01. Array Hashing/242. Valid Anagram.ipynb	
+++ /dev/null
@@ -1,198 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 242. Valid Anagram\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Anagram problem on LeetCode, click here!](https://leetcode.com/problems/valid-anagram/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `s.length`, `t.length` <= $5 * 10^4$\n",
-        "- `s` and `t` consist of lowercase English letters.\n",
-        "\n",
-        "**Follow-up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isAnagram(s: str, t: str) -> bool:\n",
-        "    # Check if the lengths of s and t are not equal\n",
-        "    if len(s) != len(t):\n",
-        "        return False\n",
-        "\n",
-        "    # Create dictionaries to store character frequencies for s and t\n",
-        "    countS, countT = {}, {}\n",
-        "\n",
-        "    # Count character frequencies in s\n",
-        "    for i in range(len(s)):\n",
-        "        countS[s[i]] = 1 + countS.get(s[i], 0)\n",
-        "\n",
-        "    # Count character frequencies in t\n",
-        "    for i in range(len(t)):\n",
-        "        countT[t[i]] = 1 + countT.get(t[i], 0)\n",
-        "\n",
-        "    # Check if the character frequencies in s and t are the same\n",
-        "    return countS == countT"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code defines a class called `Solution` with a method `isAnagram` that takes two input strings, `s` and `t`, and returns a boolean (`True` or `False`) based on whether `t` is an anagram of `s`.\n",
-        "\n",
-        "2. The first check performed in the method is whether the lengths of `s` and `t` are equal. If they are not equal, it immediately returns `False` because strings of different lengths cannot be anagrams of each other.\n",
-        "\n",
-        "3. Two dictionaries, `countS` and `countT`, are created to store the frequency of characters in `s` and `t`, respectively. These dictionaries will be used to count the occurrences of each character in the strings.\n",
-        "\n",
-        "4. The code then enters a loop to iterate through each character in string `s` using a `for` loop. Inside the loop, it updates the `countS` dictionary. The line `countS[s[i]] = 1 + countS.get(s[i], 0)` increments the count of character `s[i]` in `countS` by 1. If the character is not already in the dictionary, it initializes the count to 1.\n",
-        "\n",
-        "5. Similarly, the code iterates through each character in string `t` and updates the `countT` dictionary in the same way.\n",
-        "\n",
-        "6. After counting the character frequencies in both strings, the code compares the two dictionaries using `countS == countT`. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, `t` is an anagram of `s`. In this case, the method returns `True`.\n",
-        "\n",
-        "7. If the dictionaries are not equal, the method returns `False`, indicating that `t` is not an anagram of `s`.\n",
-        "\n",
-        "In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns `True`; otherwise, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s = \"anagram\"\n",
-        "t = \"nagaram\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "s = \"rat\"\n",
-        "t = \"car\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. The code first checks whether the lengths of the input strings `s` and `t` are equal, which takes constant time. This check has a time complexity of O(1).\n",
-        "\n",
-        "2. The code then iterates through both strings, `s` and `t`, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (`s` or `t`).\n",
-        "\n",
-        "3. Finally, the code compares the two dictionaries `countS` and `countT` to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.\n",
-        "\n",
-        "Overall, the time complexity of the code is O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The code uses two dictionaries, `countS` and `countT`, to store the character frequencies of the input strings `s` and `t`. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "2. The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.\n",
-        "\n",
-        "**In summary**, the space complexity of the code is O(n), where n is the length of the longer input string."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagram Chains**: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [\"bat\", \"tab\", \"cat\", \"tac\", \"dog\"], the longest anagram chain is [\"bat\", \"tab\", \"cat\", \"tac\"].\n",
-        "\n",
-        "2. **Minimum Deletions to Make Anagrams**: Given two strings `s` and `t`, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if `s = \"hello\"` and `t = \"billion\"`, you can remove the characters \"heo\" from `s` and \"billi\" from `t` to make them anagrams (\"lo\" and \"on\" are left in the two strings)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/347. Top K Frequent Elements.ipynb b/docs/01. Array Hashing/347. Top K Frequent Elements.ipynb
deleted file mode 100644
index ecfa494..0000000
--- a/docs/01. Array Hashing/347. Top K Frequent Elements.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 347. Top K Frequent Elements\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Top K Frequent Elements problem on LeetCode, click here!](https://leetcode.com/problems/top-k-frequent-elements/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.\n",
-        "\n",
-        "Constraints:\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- `k` is in the range `[1, the number of unique elements in the array]`.\n",
-        "- It is **guaranteed** that the answer is **unique**.\n",
-        "\n",
-        "**Follow-up:** Your algorithm's time complexity must be better than $O(n\\ log\\ n)$, where n is the array's size.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def topKFrequent(nums, k):\n",
-        "    # Create a dictionary to store the frequency of each element\n",
-        "    count = {}\n",
-        "    # Create a list of lists to store elements with the same frequency\n",
-        "    frequency = [[] for i in range(len(nums) + 1)]\n",
-        "\n",
-        "    # Count the frequency of each element in nums\n",
-        "    for n in nums:\n",
-        "        count[n] = 1 + count.get(n, 0)\n",
-        "\n",
-        "    # Place elements in the freq list according to their frequency\n",
-        "    for n, c in count.items():\n",
-        "        frequency[c].append(n)\n",
-        "\n",
-        "    res = []\n",
-        "    # Traverse freq list from the end (higher frequencies)\n",
-        "    for i in range(len(frequency) - 1, 0, -1):\n",
-        "        for n in frequency[i]:\n",
-        "            res.append(n)\n",
-        "            if len(res) == k:\n",
-        "                return res"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `def topKFrequent(nums, k):`: This is a function that takes two arguments: `nums`, which is the input array of integers, and `k`, which is the number of most frequent elements to return.\n",
-        "\n",
-        "2. `count = {}`: This dictionary `count` will be used to store the frequency of each unique element in the `nums` array. The keys are elements from the input array, and the values are their corresponding frequencies.\n",
-        "\n",
-        "3. `frequency = [[] for i in range(len(nums) + 1)]`: This creates a list of empty lists called `frequency`. It's used to store elements based on their frequencies, similar to the `freq` list in the previous code. The size of this list is set to be one greater than the length of the input `nums`.\n",
-        "\n",
-        "4. `for n in nums:`: This loop iterates through each element `n` in the input `nums` array.\n",
-        "\n",
-        "5. `count[n] = 1 + count.get(n, 0)`: This line counts the frequency of each element `n` in the `nums` array. It uses the `count.get(n, 0)` method to retrieve the current count of `n` from the `count` dictionary. If `n` is not in the dictionary, it defaults to 0. It then increments the count by 1.\n",
-        "\n",
-        "6. After the above loop, the `count` dictionary will contain counts of each unique element in the `nums` array.\n",
-        "\n",
-        "7. `for n, c in count.items():`: This loop iterates through the items (key-value pairs) of the `count` dictionary. `n` represents the element, and `c` represents its frequency.\n",
-        "\n",
-        "8. `frequency[c].append(n)`: This line places the element `n` into the bucket corresponding to its frequency `c`. Buckets are represented by the `frequency` list. For example, if an element `n` has a frequency of 3, it will be added to `frequency[3]`.\n",
-        "\n",
-        "9. After this loop, the `frequency` list will contain buckets of elements grouped by their frequencies.\n",
-        "\n",
-        "10. `res = []`: This list `res` will be used to store the k most frequent elements.\n",
-        "\n",
-        "11. `for i in range(len(freq) - 1, 0, -1):`: This loop iterates in reverse order through the `frequency` list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be `frequency` instead of `freq`.\n",
-        "\n",
-        "12. `for n in frequency[i]:`: For each element `n` in the current bucket (i.e., elements with frequency `i`), it appends `n` to the result list `res`.\n",
-        "\n",
-        "13. `if len(res) == k:`: Once `res` contains k elements, the code exits and returns the result.\n",
-        "\n",
-        "The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., `frequency` instead of `freq`)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 48,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,1,1,2,2,3]\n",
-        "k = 2\n",
-        "result1 = topKFrequent(nums, k)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [1]\n",
-        "k = 1\n",
-        "result2 = topKFrequent(nums, k)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop that counts the frequency of elements by iterating through `nums` has a time complexity of O(n), where n is the number of elements in the input array `nums`.\n",
-        "\n",
-        "2. The second loop iterates through the keys in the `count` dictionary, which has at most `k` unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).\n",
-        "\n",
-        "3. The third loop iterates through the `frequency` list, which has a length equal to the maximum frequency of elements in `nums`. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in `nums`.\n",
-        "\n",
-        "Overall, the dominant factor in terms of time complexity is the loop that iterates through the `count` dictionary. So, the total time complexity of the code is O(n + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The `count` dictionary stores the frequency of each unique element in `nums`. In the worst case, it can have at most `k` unique elements, so the space complexity for `count` is O(k).\n",
-        "\n",
-        "2. The `frequency` list is used to store elements grouped by their frequencies. It has a length of `len(nums) + 1`, which can be at most 105 based on the constraints. Therefore, the space complexity for `frequency` is O(105).\n",
-        "\n",
-        "3. The `res` list stores the k most frequent elements, which can be at most `k` elements, so the space complexity for `res` is O(k).\n",
-        "\n",
-        "**In summary**, the space complexity is dominated by the `count` dictionary and the `frequency` list, both of which have a space complexity of O(k + 105)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimized k Most Frequent Elements:** Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.\n",
-        "\n",
-        "2. **Handling Duplicate Frequencies:** Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/49. Group Anagrams.ipynb b/docs/01. Array Hashing/49. Group Anagrams.ipynb
deleted file mode 100644
index afe89ec..0000000
--- a/docs/01. Array Hashing/49. Group Anagrams.ipynb	
+++ /dev/null
@@ -1,229 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 49. Group Anagrams\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Group Anagrams problem on LeetCode, click here!](https://leetcode.com/problems/group-anagrams/)\n",
-        "\n",
-        "---\n",
-        "Given an array of strings `strs`, group **the anagrams** together. You can return the answer in **any order**.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `strs.length <= $10^4$\n",
-        "- `0 <= strs[i].length <= 100`\n",
-        "- `strs[i]` consists of lowercase English letters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict\n",
-        "\n",
-        "\n",
-        "def groupAnagrams(strs):\n",
-        "    ans = defaultdict(list)\n",
-        "\n",
-        "    # Iterate through the list of input strings\n",
-        "    for s in strs:\n",
-        "        # Initialize a list to represent character counts for each character (a-z)\n",
-        "        count = [0] * 26\n",
-        "\n",
-        "        # Count the occurrences of each character in the current word\n",
-        "        for c in s:\n",
-        "            count[ord(c) - ord(\"a\")] += 1\n",
-        "\n",
-        "        # Use a tuple of character counts as the key and append the word to the anagram group\n",
-        "        ans[tuple(count)].append(s)\n",
-        "\n",
-        "    # Convert the values (lists of anagrams) to a list of lists\n",
-        "    return list(ans.values())"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Inside the method, a `defaultdict` called `ans` is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.\n",
-        "\n",
-        "2. The code then iterates through the list of input strings, `strs`, using a `for` loop. For each word `s` in `strs`, it performs the following steps:\n",
-        "\n",
-        "   - It initializes a list `count` of length 26, where each element represents the count of a specific character (a-z) in the word `s`.\n",
-        "\n",
-        "   - The code then iterates through the characters of `s`. For each character `c`, it increments the corresponding count in the `count` list based on its ASCII value.\n",
-        "\n",
-        "   - After counting the characters in `s`, it converts the `count` list into a tuple `tuple(count)` to use as a key for the `ans` dictionary.\n",
-        "\n",
-        "   - It appends the word `s` to the list associated with the key (tuple) in the `ans` dictionary. This groups all anagrams of the same word together under the same key.\n",
-        "\n",
-        "3. After processing all words in `strs`, the code converts the values of the `ans` dictionary (which are lists of anagrams) to a list of lists using the `list()` constructor.\n",
-        "\n",
-        "4. Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.\n",
-        "\n",
-        "In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 37,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['eat', 'tea', 'ate'], ['tan', 'nat'], ['bat']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: Group anagrams from a list of words\n",
-        "strs1 = [\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]\n",
-        "result1 = groupAnagrams(strs1)\n",
-        "print(result1)\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: Group anagrams from a list with an empty string\n",
-        "strs2 = [\"\"]\n",
-        "result2 = groupAnagrams(strs2)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 40,
-      "id": "c8367e2a-e7d5-4e18-8235-2870e341a04b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['a']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3: Group anagrams from a list with a single word\n",
-        "strs3 = [\"a\"]\n",
-        "result3 = groupAnagrams(strs3)\n",
-        "print(result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `groupAnagrams` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. First, we create an instance of the `Solution` class, which is an O(1) operation.\n",
-        "\n",
-        "2. Inside the `groupAnagrams` method, we iterate through the list of input strings `strs` once in a loop:\n",
-        "   - For each word in `strs`, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.\n",
-        "\n",
-        "3. The overall time complexity of the method is O(N * K), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. We use a `defaultdict` called `ans` to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for `ans` is O(N).\n",
-        "\n",
-        "2. Within the loop, we create a `count` list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).\n",
-        "\n",
-        "3. The space used for other variables is also constant and does not depend on the input size.\n",
-        "\n",
-        "4. The final result, `result`, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for `result` is O(N).\n",
-        "\n",
-        "5. The overall space complexity of the method is O(N) due to the space used by `ans` and `result`. The space used by the `count` list and other variables is constant and does not significantly affect the overall space complexity.\n",
-        "\n",
-        "**In summary,** the time complexity of the `groupAnagrams` method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagramic Palindromes**: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [\"bat\", \"tab\", \"act\", \"tac\", \"dog\"], there are two groups: [\"bat\", \"tab\", \"act\", \"tac\"] and [\"dog\"].\n",
-        "\n",
-        "2. **Largest Anagram Group**: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/659. Encode and Decode Strings.ipynb b/docs/01. Array Hashing/659. Encode and Decode Strings.ipynb
deleted file mode 100644
index 037c476..0000000
--- a/docs/01. Array Hashing/659. Encode and Decode Strings.ipynb	
+++ /dev/null
@@ -1,204 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 659· Encode and Decode Strings\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Encode and Decode Strings problem on LintCode, click here!](https://www.lintcode.com/problem/659/)\n",
-        "\n",
-        "---\n",
-        "Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.\n",
-        "\n",
-        "Please implement `encode` and `decode`.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Codec:\n",
-        "\n",
-        "    def encode(self, strs):\n",
-        "        \"\"\"Encodes a list of strings to a single string.\n",
-        "        \n",
-        "        :type strs: List[str]\n",
-        "        :rtype: str\n",
-        "        \"\"\"\n",
-        "        encoded = \"\"\n",
-        "        for s in strs:\n",
-        "            encoded += s.replace(':', '::') + ':;'\n",
-        "        return encoded\n",
-        "\n",
-        "    def decode(self, s):\n",
-        "        \"\"\"Decodes a single string to a list of strings.\n",
-        "        \n",
-        "        :type s: str\n",
-        "        :rtype: List[str]\n",
-        "        \"\"\"\n",
-        "        decoded = []\n",
-        "        i = 0\n",
-        "        while i < len(s):\n",
-        "            end = s.find(':;', i)\n",
-        "            if end == -1:\n",
-        "                end = len(s)\n",
-        "            decoded.append(s[i:end].replace('::', ':'))\n",
-        "            i = end + 2\n",
-        "        return decoded"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class called `Codec` to encapsulate the encoding and decoding operations for a list of strings.\n",
-        "\n",
-        "2. In the `encode` method, we take a list of strings (`strs`) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter `:;`. We iterate through each string in the input list, replace any occurrence of `:` with `::` (to avoid conflicts with the delimiter), and then append `:;` to indicate the end of that string.\n",
-        "\n",
-        "3. In the `decode` method, we take an encoded string (`s`) as input and return a list of strings. The decoding process involves splitting the encoded string using the `:;` delimiter. We start from the beginning of the encoded string (`i = 0`) and repeatedly find the next occurrence of `:;`. We extract the substring between the current position (`i`) and the next delimiter (`end`). Before adding it to the result list, we replace any `::` with `:` to revert the encoding. We then update the current position `i` to be after the delimiter, so we can find the next substring in the next iteration.\n",
-        "\n",
-        "4. Finally, we create an instance of the `Codec` class and test it with two examples:\n",
-        "\n",
-        "By using the `:;` delimiter and handling the `::` escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['lint', 'code', 'love', 'you']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "codec = Codec()\n",
-        "\n",
-        "input1 = [\"lint\", \"code\", \"love\", \"you\"]\n",
-        "encoded1 = codec.encode(input1)\n",
-        "decoded1 = codec.decode(encoded1)\n",
-        "print(decoded1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['we', 'say', ':', 'yes']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "codec = Codec() \n",
-        "\n",
-        "input2 = [\"we\", \"say\", \":\", \"yes\"]\n",
-        "encoded2 = codec.encode(input2)\n",
-        "decoded2 = codec.decode(encoded2)\n",
-        "print(decoded2)  "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `encode` and `decode` methods in the provided code.\n",
-        "\n",
-        "**Encode Method (`encode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Here, `n` is the number of strings in the input list `strs`, and `m` is the average length of these strings.\n",
-        "  - In the worst case, for each string in the list, we iterate over its characters once to replace any colons (`:`) with double colons (`::`) and then append `:;`. This is done for each string in the list.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.\n",
-        "\n",
-        "**Decode Method (`decode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the `:;` delimiter.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.\n",
-        "\n",
-        "Overall, both the `encode` and `decode` methods have time and space complexities of O(n * m), where `n` is the number of strings in the input list, and `m` is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Delimiters**: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.\n",
-        "\n",
-        "2. **Optimize Encoding**: Modify the `encode` method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/01. Array Hashing/README.md b/docs/01. Array Hashing/README.md
deleted file mode 100644
index a331dab..0000000
--- a/docs/01. Array Hashing/README.md	
+++ /dev/null
@@ -1,27 +0,0 @@
-# Array & Hashing Solutions - Blind 75 LeetCode Problems
-![Array & Hashing Solutions](https://img.shields.io/badge/Array_&_Hashing_Solutions-blue)![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Problems-blue?labelColor=red)
-
-This repository contains my solutions to Array & Hashing Problems from Blind 75 LeetCode problems. I've organized the solutions by categories for easier navigation and reference. Each problem solution is presented in Jupyter Notebook format (`.ipynb`).
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/217.%20Contains%20Duplicate.ipynb)                            | Easy       |
-| [242. Valid Anagram](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/242.%20Valid%20Anagram.ipynb)                                      | Easy       |
-| [1. Two Sum](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/1.%20Two%20Sum.ipynb)                                                      | Easy       |
-| [49. Group Anagrams](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/49.%20Group%20Anagrams.ipynb)                                      | Medium     |
-| [347. Top K Frequent Elements](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.ipynb)              | Medium     |
-| [238. Product of Array Except Self](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.ipynb)  | Medium     |
-| [659. Encode and Decode Strings](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.ipynb)          | Medium     |
-| [128. Longest Consecutive Sequence](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.ipynb)      | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/02. Two Pointers/11. Container With Most Water.ipynb b/docs/02. Two Pointers/11. Container With Most Water.ipynb
deleted file mode 100644
index 284c832..0000000
--- a/docs/02. Two Pointers/11. Container With Most Water.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 11. Container With Most Water\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Container With Most Water problem on LeetCode, click here!](https://leetcode.com/problems/container-with-most-water/)\n",
-        "\n",
-        "---\n",
-        "You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the $i^{th}$ line are `(i, 0)` and `(i, height[i])`.\n",
-        "\n",
-        "Find two lines that together with the x-axis form a container, such that the container contains the most water.\n",
-        "\n",
-        "Return *the maximum amount of water a container can store.*\n",
-        "\n",
-        "**Notice** that you may not slant the container.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `n == height.length`\n",
-        "- 2 <= `n` <= $10^5$\n",
-        "- 0 <= `height[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxArea(height):\n",
-        "    # Initialize the maximum area to 0.\n",
-        "    max_area = 0\n",
-        "    # Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.\n",
-        "    left = 0\n",
-        "    right = len(height) - 1\n",
-        "\n",
-        "    # Iterate until the left pointer is less than the right pointer.\n",
-        "    while left < right:\n",
-        "        # Calculate the height of the container, which is the minimum height of the two lines.\n",
-        "        h = min(height[left], height[right])\n",
-        "        # Calculate the width of the container, which is the distance between the two pointers.\n",
-        "        width = right - left\n",
-        "        # Calculate the area of the container using height and width and update max_area if it's greater.\n",
-        "        max_area = max(max_area, h * width)\n",
-        "\n",
-        "        # Move the pointer with the shorter line inward.\n",
-        "        if height[left] < height[right]:\n",
-        "            left += 1\n",
-        "        else:\n",
-        "            right -= 1\n",
-        "\n",
-        "    # Continue this process until left < right, and then return the maximum area.\n",
-        "    return max_area"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with initializing `max_area` to 0, which will store the maximum area of water that can be contained by the lines.\n",
-        "\n",
-        "2. Two pointers, `left` and `right`, are initialized to the beginning and end of the input `height` array.\n",
-        "\n",
-        "3. The main loop runs while `left` is less than `right`. This ensures that we are checking all possible pairs of lines in a systematic way.\n",
-        "\n",
-        "4. Inside the loop:\n",
-        "   - We calculate the height of the container `h` as the minimum of the heights at the `left` and `right` pointers. This represents the height of the water the container can hold.\n",
-        "   - We calculate the width of the container as the difference between `right` and `left`. This represents the distance between the two lines.\n",
-        "   - We calculate the area of the container using `h * width` and update `max_area` if the calculated area is greater than the current `max_area`.\n",
-        "\n",
-        "5. After calculating the area and updating `max_area`, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won't increase the height and will only decrease the width, which will result in a smaller area.\n",
-        "\n",
-        "6. We continue this process until `left` is no longer less than `right`, indicating that we have checked all possible pairs of lines.\n",
-        "\n",
-        "7. Finally, we return the `max_area` which contains the maximum area of water that can be contained by two lines from the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 49\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "height1 = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n",
-        "result1 = maxArea(height1)\n",
-        "print(\"Output:\", result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "height2 = [1, 1]\n",
-        "result2 = maxArea(height2)\n",
-        "print(\"Output:\", result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 45\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Additional Example\n",
-        "height3 = [3, 9, 3, 4, 7, 2, 12, 6]\n",
-        "result3 = maxArea(height3)\n",
-        "print(\"Output:\", result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `maxArea` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the `height` array.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The function uses a constant amount of extra space for variables like `max_area`, `left`, `right`, `h`, and `width`. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.\n",
-        "\n",
-        "**In summary,** the `maxArea` function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.\n",
-        "2. **Variant Problem:** Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You'll need to return the total water volume needed."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/02. Two Pointers/125. Valid Palindrome.ipynb b/docs/02. Two Pointers/125. Valid Palindrome.ipynb
deleted file mode 100644
index 8520b3b..0000000
--- a/docs/02. Two Pointers/125. Valid Palindrome.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 125. Valid Palindrome\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Palindrome problem on LeetCode, click here!](https://leetcode.com/problems/valid-palindrome/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "A phrase is a **palindrome** if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.\n",
-        "\n",
-        "Given a string `s`, *return `true` if it is a **palindrome**, or `false` otherwise.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $2*10^5$\n",
-        "- `s` consists only of printable ASCII characters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isPalindrome(s):\n",
-        "    # Step 1: Convert the input string to lowercase\n",
-        "    s = s.lower()\n",
-        "    \n",
-        "    # Step 2: Remove all non-alphanumeric characters from the string\n",
-        "    cleaned_s = ''.join(c for c in s if c.isalnum())\n",
-        "    \n",
-        "    # Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string\n",
-        "    left, right = 0, len(cleaned_s) - 1\n",
-        "    \n",
-        "    # Step 4: Compare characters using the two pointers while moving them towards each other\n",
-        "    while left < right:\n",
-        "        if cleaned_s[left] != cleaned_s[right]:\n",
-        "            return False  # If characters don't match, it's not a palindrome\n",
-        "        left += 1\n",
-        "        right -= 1\n",
-        "    \n",
-        "    # Step 5: If the loop completes without returning False, it's a palindrome\n",
-        "    return True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `isPalindrome` function takes an input string `s`.\n",
-        "\n",
-        "2. It starts by converting the input string to lowercase using `s.lower()`. This step ensures that the function is case-insensitive when checking for palindromes.\n",
-        "\n",
-        "3. Next, it removes all non-alphanumeric characters from the string and stores the result in the `cleaned_s` variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.\n",
-        "\n",
-        "4. The function then initializes two pointers, `left` and `right`, which will be used to compare characters from the beginning and end of the cleaned string.\n",
-        "\n",
-        "5. In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the `left` pointer is less than the `right` pointer. This is done to check all characters in the cleaned string.\n",
-        "\n",
-        "6. Inside the loop, it checks if the characters at the `left` and `right` pointers don't match. If they don't match, it means the input is not a palindrome, so the function returns `False`.\n",
-        "\n",
-        "7. If the characters at the `left` and `right` pointers match, the pointers are moved closer to each other by incrementing `left` and decrementing `right`.\n",
-        "\n",
-        "8. The loop continues to compare characters until it either finds a mismatch (returning `False`) or until the `left` pointer is greater than or equal to the `right` pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns `True`.\n",
-        "\n",
-        "In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string's beginning and end. If all characters match during the comparison, the function returns `True`, indicating that the input is a palindrome. If any characters do not match, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "input1 = \"A man, a plan, a canal: Panama\"\n",
-        "output1 = isPalindrome(input1)\n",
-        "print(output1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "input2 = \"race a car\"\n",
-        "output2 = isPalindrome(input2)\n",
-        "print(output2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "input3 = \"\"\n",
-        "output3 = isPalindrome(input3)\n",
-        "print(output3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `isPalindrome` function that uses two pointers:\n",
-        "\n",
-        "1. **Time Complexity:**\n",
-        "   - Converting the input string to lowercase using `s.lower()` takes O(n) time, where 'n' is the length of the input string.\n",
-        "   - Removing non-alphanumeric characters using the list comprehension `''.join(c for c in s if c.isalnum())` also takes O(n) time because it iterates through each character in the string once.\n",
-        "   - The comparison of characters using the two pointers (`left` and `right`) is done in a loop that runs until `left` is less than `right`. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).\n",
-        "\n",
-        "   Therefore, the overall time complexity of the `isPalindrome` function is O(n), where 'n' is the length of the input string.\n",
-        "\n",
-        "2. **Space Complexity:**\n",
-        "   - The space complexity is primarily determined by the additional string `cleaned_s` created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.\n",
-        "   - Additionally, the function uses two pointers, `left` and `right`, which consume constant space and do not depend on the size of the input.\n",
-        "\n",
-        "**In summary,** the overall space complexity of the `isPalindrome` function is O(n) in the worst case, where 'n' is the length of the input string. The space complexity is dominated by the space required for `cleaned_s`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Palindromic Substring:** Given a string `s`, find and return the longest palindromic substring within `s`. For example, if `s = \"babad\"`, the function should return `\"bab\"` or `\"aba\"`.\n",
-        "2. **Palindrome with Limited Characters:** Given a string `s` and a list of characters `allowed_chars`, check if `s` is a palindrome considering only the characters from `allowed_chars`. Ignore all other characters. For example, if `s = \"A man, a plan, a canal: Panama\"` and `allowed_chars = ['a', 'm', 'n', 'p']`, the function should return `True`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/02. Two Pointers/15. 3Sum.ipynb b/docs/02. Two Pointers/15. 3Sum.ipynb
deleted file mode 100644
index 06de549..0000000
--- a/docs/02. Two Pointers/15. 3Sum.ipynb	
+++ /dev/null
@@ -1,250 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 15. 3Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the 3Sum problem on LeetCode, click here!](https://leetcode.com/problems/3sum/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array nums, *return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.*\n",
-        "\n",
-        "**Notice** that the solution set must not contain duplicate triplets.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `3 <= nums.length <= 3000`\n",
-        "- $-10^5$ <= `nums[i]` <= $10^5$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def threeSum(nums):\n",
-        "    # Sort the input array in ascending order\n",
-        "    nums.sort()\n",
-        "    triplets = []\n",
-        "    \n",
-        "    for i in range(len(nums) - 2):\n",
-        "        # Skip duplicates to avoid duplicate triplets\n",
-        "        if i > 0 and nums[i] == nums[i - 1]:\n",
-        "            continue\n",
-        "        \n",
-        "        left, right = i + 1, len(nums) - 1\n",
-        "        \n",
-        "        while left < right:\n",
-        "            # Calculate the total sum of the current triplet\n",
-        "            total = nums[i] + nums[left] + nums[right]\n",
-        "            \n",
-        "            if total == 0:\n",
-        "                # If the total is zero, we found a valid triplet\n",
-        "                triplets.append([nums[i], nums[left], nums[right]])\n",
-        "                \n",
-        "                # Skip duplicates of left and right pointers\n",
-        "                while left < right and nums[left] == nums[left + 1]:\n",
-        "                    left += 1\n",
-        "                while left < right and nums[right] == nums[right - 1]:\n",
-        "                    right -= 1\n",
-        "                \n",
-        "                # Move the pointers to the next unique elements\n",
-        "                left += 1\n",
-        "                right -= 1\n",
-        "            elif total < 0:\n",
-        "                # If the total is negative, we need to increase the sum by moving the left pointer to the right\n",
-        "                left += 1\n",
-        "            else:\n",
-        "                # If the total is positive, we need to decrease the sum by moving the right pointer to the left\n",
-        "                right -= 1\n",
-        "    \n",
-        "    return triplets"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. It starts by sorting the input array `nums` in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.\n",
-        "\n",
-        "2. It initializes an empty list `triplets` to store the unique triplets that meet the given conditions.\n",
-        "\n",
-        "3. The code then iterates through the `nums` array using a loop with index `i`. This loop will consider each element of the array as a potential starting point for a triplet.\n",
-        "\n",
-        "4. Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If `nums[i]` is the same as the previous element `nums[i-1]`, it continues to the next iteration of the loop.\n",
-        "\n",
-        "5. Two pointers, `left` and `right`, are initialized. `left` starts just after the current element `nums[i]`, and `right` starts at the end of the array.\n",
-        "\n",
-        "6. The code enters another loop with `left` and `right` pointers, trying to find a triplet that sums up to zero.\n",
-        "\n",
-        "7. It calculates the `total` sum of the current triplet as `nums[i] + nums[left] + nums[right]`.\n",
-        "\n",
-        "8. If `total` is zero, it means a valid triplet is found, so it appends `[nums[i], nums[left], nums[right]]` to the `triplets` list. Then, it moves both the `left` and `right` pointers to their next unique elements while skipping duplicates.\n",
-        "\n",
-        "9. If `total` is less than zero, it means the sum is negative, so it increments the `left` pointer to move towards a larger sum.\n",
-        "\n",
-        "10. If `total` is greater than zero, it means the sum is positive, so it decrements the `right` pointer to move towards a smaller sum.\n",
-        "\n",
-        "11. This process continues until all possible triplets have been considered.\n",
-        "\n",
-        "12. Finally, the function returns the `triplets` list, which contains all the unique triplets that sum up to zero in the sorted `nums` array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[-1, -1, 2], [-1, 0, 1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums = [-1, 0, 1, 2, -1, -4]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums = [0, 1, 1]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums = [0, 0, 0]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `threeSum` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Sorting the input array `nums` takes O(n log n) time, where n is the length of the array.\n",
-        "\n",
-        "2. The outer loop runs for each element of the array, so it iterates O(n) times.\n",
-        "\n",
-        "3. Inside the outer loop, we have a while loop with two pointers (`left` and `right`). In the worst case, the while loop can iterate O(n) times (when all elements are unique).\n",
-        "\n",
-        "4. Inside the while loop, we have constant time operations (additions, comparisons, and list appends).\n",
-        "\n",
-        "Overall, the time complexity of the `threeSum` function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space used by the `triplets` list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.\n",
-        "\n",
-        "2. Other than the `triplets` list, the function uses only a constant amount of additional space for variables like `i`, `left`, `right`, and `total`.\n",
-        "\n",
-        "Overall, the space complexity of the `threeSum` function is O(k), where k is the number of unique triplets that meet the criteria. It's important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.\n",
-        "- Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Sum Problem:** Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.\n",
-        "2. **Count the Number of Unique Triplets:** Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/02. Two Pointers/README.md b/docs/02. Two Pointers/README.md
deleted file mode 100644
index 0d4c7cf..0000000
--- a/docs/02. Two Pointers/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Two Pointers Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/docs/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
deleted file mode 100644
index 554c940..0000000
--- a/docs/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb	
+++ /dev/null
@@ -1,191 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 121. Best Time to Buy and Sell Stock\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array `prices` where `prices[i]` is the price of a given stock on the $i^{th}$ day.\n",
-        "\n",
-        "You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.\n",
-        "\n",
-        "*Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `prices.length` <= $10^5$\n",
-        "- 0 <= `prices[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 65,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxProfit(prices):\n",
-        "    if not prices:\n",
-        "        return 0\n",
-        "    \n",
-        "    min_price = prices[0]\n",
-        "    max_profit = 0\n",
-        "    \n",
-        "    for price in prices:\n",
-        "        # Update the minimum price if a lower price is encountered\n",
-        "        min_price = min(min_price, price)\n",
-        "        # Calculate the profit if selling at the current price\n",
-        "        max_profit = max(max_profit, price - min_price)\n",
-        "    \n",
-        "    return max_profit"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- The `maxProfit` function takes a single argument, `prices`, which is a list of stock prices.\n",
-        "- The first line of the function checks if the `prices` list is empty. If it's empty, there are no prices to analyze, so the function returns 0 (no profit can be made).\n",
-        "\n",
-        "- Then, we initialize two variables:\n",
-        "  - `min_price`: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (`prices[0]`).\n",
-        "  - `max_profit`: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven't made any profit.\n",
-        "\n",
-        "- We start iterating through the `prices` list, where `price` represents the stock price for the current day.\n",
-        "\n",
-        "- In each iteration, we check if the current `price` is lower than the `min_price` we've seen so far. If it is, we update `min_price` to the current `price`. This is because we want to buy the stock at the lowest possible price.\n",
-        "\n",
-        "- Next, we calculate the profit we would make if we sold the stock at the current `price` (assuming we bought it at `min_price`). We do this by subtracting `min_price` from the current `price`. This represents the profit for the current day.\n",
-        "\n",
-        "- We also use the `max` function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the `max_profit` we've seen previously, we update `max_profit` with this higher value.\n",
-        "\n",
-        "- Finally, after iterating through all the days in the `prices` list, we return `max_profit`, which represents the maximum profit that can be achieved by buying and selling a single stock."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 66,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "5\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "prices1 = [7, 1, 5, 3, 6, 4]\n",
-        "print(maxProfit(prices1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 67,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "prices2 = [7, 6, 4, 3, 1]\n",
-        "print(maxProfit(prices2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through the `prices` array once, examining each price exactly once.\n",
-        "- Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.\n",
-        "- Therefore, the time complexity of this code is O(n), where n is the length of the `prices` array. It performs a linear number of operations relative to the size of the input.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the code is constant, O(1).\n",
-        "- Regardless of the size of the input `prices` array, the code only uses a fixed amount of additional memory to store two variables (`min_price` and `max_profit`) and a few loop variables.\n",
-        "- The memory usage does not depend on the size of the input, so it is considered constant space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n) where n is the length of the `prices` array.\n",
-        "- Space Complexity: O(1) (constant space usage)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Transactions Allowed:** Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.\n",
-        "2. **K Transactions Allowed:** Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.\n",
-        "3. **With Transaction Fee:** Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/docs/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
deleted file mode 100644
index 4a516de..0000000
--- a/docs/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb	
+++ /dev/null
@@ -1,214 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 3. Longest Substring Without Repeating Characters\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n",
-        "\n",
-        "---\n",
-        "Given a string `s`, find the length of the **longest substring** without repeating characters.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 0 <= `s.length` <= $5 * 10^4$\n",
-        "- `s` consists of English letters, digits, symbols and spaces.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 61,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def length_of_longest_substring(s):\n",
-        "    # Create a dictionary to store the index of each character's last occurrence.\n",
-        "    char_index = {}\n",
-        "    \n",
-        "    # Initialize variables to keep track of the start and end of the current substring.\n",
-        "    start = 0\n",
-        "    max_length = 0\n",
-        "    \n",
-        "    for end in range(len(s)):\n",
-        "        # If the character is in the dictionary and its last occurrence is after the start of the current substring,\n",
-        "        # update the start of the substring to the next character after its last occurrence.\n",
-        "        if s[end] in char_index and char_index[s[end]] >= start:\n",
-        "            start = char_index[s[end]] + 1\n",
-        "        \n",
-        "        # Update the last occurrence index of the current character.\n",
-        "        char_index[s[end]] = end\n",
-        "        \n",
-        "        # Calculate the length of the current substring and update the maximum length if necessary.\n",
-        "        current_length = end - start + 1\n",
-        "        max_length = max(max_length, current_length)\n",
-        "    \n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a function called `length_of_longest_substring` that takes a single argument `s`, which is the input string for which we want to find the length of the longest substring without repeating characters.\n",
-        "\n",
-        "2. We create a dictionary called `char_index` to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.\n",
-        "\n",
-        "3. We initialize two variables, `start` and `max_length`. \n",
-        "   - `start` represents the start index of the current substring without repeating characters. It starts at 0.\n",
-        "   - `max_length` is used to keep track of the maximum length found so far and is initially set to 0.\n",
-        "\n",
-        "4. We then iterate through the input string `s` using a for loop, where the loop variable `end` represents the current end index of the substring we are considering.\n",
-        "\n",
-        "5. Inside the loop:\n",
-        "   - We check if the character `s[end]` is already in the `char_index` dictionary and if its last occurrence is within or after the current substring. If so, it means that we've encountered a repeating character, and we need to update the `start` of the substring to the next character after the last occurrence of `s[end]`. This ensures that we have a new valid substring without repeating characters.\n",
-        "   - We then update the `char_index` dictionary by storing the current index `end` as the last occurrence index of the character `s[end]`.\n",
-        "\n",
-        "6. Next, we calculate the length of the current substring without repeating characters, which is `current_length = end - start + 1`. We add 1 to account for the fact that the indices are zero-based.\n",
-        "\n",
-        "7. We update the `max_length` with the maximum of its current value and the `current_length`. This step ensures that we keep track of the longest valid substring we have encountered so far.\n",
-        "\n",
-        "8. The loop continues to iterate through the input string, and at the end, we return the `max_length`, which represents the length of the longest substring without repeating characters."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 62,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(length_of_longest_substring(\"abcabcbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 63,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(length_of_longest_substring(\"bbbbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 64,
-      "id": "cf04eba0-0ead-4e8b-ba33-4316ea64a9d3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(length_of_longest_substring(\"pwwkew\"))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "Let's analyze the time and space complexity of the `length_of_longest_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through the input string `s` using a single for loop. The loop runs from the beginning of the string to the end once.\n",
-        "- Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.\n",
-        "- Therefore, the time complexity of the function is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The primary data structure that consumes space in this function is the `char_index` dictionary.\n",
-        "- In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.\n",
-        "- Therefore, the space complexity is O(min(n, m)), where n is the length of the input string `s`, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).\n",
-        "- Additionally, there are a few integer variables used for indices and lengths, which consume constant space.\n",
-        "- Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.\n",
-        "\n",
-        "**In summary,** the time complexity of the `length_of_longest_substring` function is O(n), and the space complexity is O(n) in the worst case due to the `char_index` dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Substring with K Distinct Characters:** Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string \"abcabcbb\" and K = 2, the answer would be 4 because the longest substring with two distinct characters is \"abca.\"\n",
-        "2. **Longest Substring with Unique Characters:** Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string \"abcabcbb,\" the answer would be 4 because \"abcd\" is the longest substring with unique characters."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/docs/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
deleted file mode 100644
index 07e96a2..0000000
--- a/docs/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb	
+++ /dev/null
@@ -1,195 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 424. Longest Repeating Character Replacement\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Repeating Character Replacement problem on LeetCode, click here!](https://leetcode.com/problems/longest-repeating-character-replacement/)\n",
-        "\n",
-        "---\n",
-        "You are given a string `s` and an integer `k`. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most `k` times.\n",
-        "\n",
-        "*Return the length of the longest substring containing the same letter you can get after performing the above operations.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^5$\n",
-        "- `s` consists of only uppercase English letters.\n",
-        "- `0 <= k <= s.length`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def characterReplacement(s, k):\n",
-        "    max_length = 0  # Initialize the maximum length\n",
-        "    max_count = 0   # Initialize the maximum count of repeating characters\n",
-        "    start = 0       # Initialize the start of the sliding window\n",
-        "    char_count = {} # Dictionary to store the count of each character\n",
-        "\n",
-        "    for end in range(len(s)):\n",
-        "        # Update the count of the current character in the dictionary\n",
-        "        char_count[s[end]] = char_count.get(s[end], 0) + 1\n",
-        "        \n",
-        "        # Update the maximum count of repeating characters\n",
-        "        max_count = max(max_count, char_count[s[end]])\n",
-        "        \n",
-        "        # Check if the current window size is greater than k\n",
-        "        if (end - start + 1) - max_count > k:\n",
-        "            # Move the start of the window to the right\n",
-        "            char_count[s[start]] -= 1\n",
-        "            start += 1\n",
-        "        \n",
-        "        # Update the maximum length\n",
-        "        max_length = max(max_length, end - start + 1)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We initialize some variables:\n",
-        "   - `max_length` to keep track of the maximum length of the substring containing the same letter.\n",
-        "   - `max_count` to keep track of the maximum count of repeating characters within the current window.\n",
-        "   - `start` to represent the start index of the sliding window.\n",
-        "   - `char_count` is a dictionary that will store the count of each character within the current window.\n",
-        "\n",
-        "2. We use a `for` loop to iterate through the characters of the string `s`.\n",
-        "\n",
-        "3. Inside the loop, we do the following for each character at position `end`:\n",
-        "   - Update the count of the current character in the `char_count` dictionary.\n",
-        "   - Update the `max_count` to be the maximum of the current `max_count` and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.\n",
-        "\n",
-        "4. We check if the current window size (the difference between `end` and `start` plus one) minus the `max_count` is greater than `k`. This condition checks whether we have exceeded the allowed number of replacements (`k`) within the current window.\n",
-        "\n",
-        "   - If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the `start` of the window to the right and decrementing the count of the character at `s[start]` in the `char_count` dictionary. This effectively removes characters from the left side of the window until we have a valid window again.\n",
-        "\n",
-        "   - By doing this, we ensure that the difference between the current window size and the `max_count` is always less than or equal to `k`.\n",
-        "\n",
-        "5. After each character, we update the `max_length` to be the maximum of the current `max_length` and the size of the current window (`end - start + 1`).\n",
-        "\n",
-        "6. Finally, we return `max_length`, which holds the length of the longest substring containing the same letter with at most `k` replacements."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s1 = \"ABAB\"\n",
-        "k1 = 2\n",
-        "print(characterReplacement(s1, k1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "s2 = \"AABABBA\"\n",
-        "k2 = 1\n",
-        "print(characterReplacement(s2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code uses a single `for` loop to iterate through the characters of the input string `s`. The loop runs from the beginning to the end of the string.\n",
-        "- Inside the loop, we perform constant-time operations such as updating the `char_count` dictionary and updating variables like `max_count` and `max_length`.\n",
-        "- The code's time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include `max_length`, `max_count`, `start`, and `char_count`. Therefore, the space complexity is O(1) or constant space.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.\n",
-        "2. **Variation with Lowercase Letters:** Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/03. Sliding Window/76. Minimum Window Substring.ipynb b/docs/03. Sliding Window/76. Minimum Window Substring.ipynb
deleted file mode 100644
index 33c2a44..0000000
--- a/docs/03. Sliding Window/76. Minimum Window Substring.ipynb	
+++ /dev/null
@@ -1,273 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 76. Minimum Window Substring\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Minimum Window Substring problem on LeetCode, click here!](https://leetcode.com/problems/minimum-window-substring/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t` of lengths `m` and `n` respectively, return *the **minimum window substring** of `s` such that every character in `t` (**including duplicates**) is included in the window. If there is no such substring, return the empty string `\"\"`.*\n",
-        "\n",
-        "The testcases will be generated such that the answer is **unique**.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `m == s.length`\n",
-        "- `n == t.length`\n",
-        "- 1 <= `m, n` <= $10^5$\n",
-        "- `s` and `t` consist of uppercase and lowercase English letters.\n",
-        "\n",
-        "**Follow up**: Could you find an algorithm that runs in $O(m + n)$ time?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def min_window_substring(s, t):\n",
-        "    if not s or not t:\n",
-        "        return \"\"\n",
-        "\n",
-        "    # Initialize dictionaries to keep track of character counts for t and the current window in s.\n",
-        "    t_dict = {}\n",
-        "    current_window_dict = {}\n",
-        "    \n",
-        "    # Populate t_dict with character counts for string t.\n",
-        "    for char in t:\n",
-        "        t_dict[char] = t_dict.get(char, 0) + 1\n",
-        "\n",
-        "    # Initialize pointers for the sliding window.\n",
-        "    left = 0\n",
-        "    min_len = float('inf')\n",
-        "    min_window = \"\"\n",
-        "    required_chars = len(t_dict)\n",
-        "\n",
-        "    # Initialize a variable to keep track of how many required characters have been found in the current window.\n",
-        "    found_chars = 0\n",
-        "\n",
-        "    # Iterate over the string s using the right pointer.\n",
-        "    for right in range(len(s)):\n",
-        "        char = s[right]\n",
-        "\n",
-        "        # Update the current_window_dict.\n",
-        "        current_window_dict[char] = current_window_dict.get(char, 0) + 1\n",
-        "\n",
-        "        # Check if the current character is a required character and if its count matches the required count.\n",
-        "        if char in t_dict and current_window_dict[char] == t_dict[char]:\n",
-        "            found_chars += 1\n",
-        "\n",
-        "        # Try to minimize the window by moving the left pointer.\n",
-        "        while left <= right and found_chars == required_chars:\n",
-        "            # Calculate the current window size.\n",
-        "            window_size = right - left + 1\n",
-        "\n",
-        "            # If the current window is smaller than the minimum found so far, update min_len and min_window.\n",
-        "            if window_size < min_len:\n",
-        "                min_len = window_size\n",
-        "                min_window = s[left:right+1]\n",
-        "\n",
-        "            # Move the left pointer to the right to shrink the window.\n",
-        "            left_char = s[left]\n",
-        "            current_window_dict[left_char] -= 1\n",
-        "\n",
-        "            # Check if the character removed from the window was a required character.\n",
-        "            if left_char in t_dict and current_window_dict[left_char] < t_dict[left_char]:\n",
-        "                found_chars -= 1\n",
-        "\n",
-        "            # Move the left pointer further to continue shrinking the window.\n",
-        "            left += 1\n",
-        "\n",
-        "    return min_window"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by checking if either of the input strings `s` or `t` is empty. If either of them is empty, we return an empty string since there can't be any valid substring in this case.\n",
-        "\n",
-        "2. We initialize two dictionaries: `t_dict` and `current_window_dict`. These dictionaries will be used to keep track of character counts in the string `t` and the current window in string `s`, respectively.\n",
-        "\n",
-        "3. We populate the `t_dict` dictionary by iterating through string `t`. For each character, we increment its count in the dictionary using `t_dict.get(char, 0) + 1`. This allows us to count the occurrences of each character in `t`.\n",
-        "\n",
-        "4. We initialize two pointers: `left` and `right`. The `left` pointer will represent the start of the current window, and the `right` pointer will represent the end of the current window. We also initialize `min_len` to store the length of the minimum window found so far, and `min_window` to store the actual minimum window substring.\n",
-        "\n",
-        "5. We determine the number of required characters in `t` (i.e., the number of distinct characters in `t`) and store it in the variable `required_chars`.\n",
-        "\n",
-        "6. We initialize a variable `found_chars` to keep track of how many required characters have been found in the current window. Initially, it is set to 0.\n",
-        "\n",
-        "7. We iterate over the string `s` using the `right` pointer. In each iteration, we do the following:\n",
-        "\n",
-        "   - Update the `current_window_dict` by incrementing the count of the current character.\n",
-        "   \n",
-        "   - Check if the current character is a required character (present in `t_dict`) and if its count in the `current_window_dict` matches the required count from `t_dict`. If so, we increment `found_chars`.\n",
-        "\n",
-        "8. After updating the window, we attempt to minimize the window size by moving the `left` pointer to the right. In this step, we:\n",
-        "\n",
-        "   - Calculate the size of the current window.\n",
-        "   \n",
-        "   - If the current window size is smaller than the minimum found so far (`min_len`), we update `min_len` and `min_window` to store the current window substring.\n",
-        "   \n",
-        "   - Move the `left` pointer to the right to shrink the window.\n",
-        "   \n",
-        "   - Check if the character being removed from the window was a required character. If it was, we decrement `found_chars`.\n",
-        "   \n",
-        "   - Continue moving the `left` pointer further to continue shrinking the window if the window still contains all required characters.\n",
-        "\n",
-        "9. Finally, we return `min_window`, which will contain the minimum window substring that contains all characters from `t`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "BANC\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(min_window_substring(\"ADOBECODEBANC\", \"ABC\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 56,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "a\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(min_window_substring(\"a\", \"a\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": []
-        },
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(min_window_substring(\"a\", \"aa\")) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `min_window_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The main loop iterates through the string `s` from left to right using the `right` pointer. This loop runs in O(m) time, where 'm' is the length of string `s`.\n",
-        "\n",
-        "- Inside the loop, we have a while loop that moves the `left` pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the `left` pointer all the way to the end of the string.\n",
-        "\n",
-        "- Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.\n",
-        "\n",
-        "- The initialization of the `t_dict` dictionary takes O(n) time, where 'n' is the length of string `t`.\n",
-        "\n",
-        "Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string `s`, and the length of string `t` has a smaller impact.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the `t_dict` dictionary, the `current_window_dict` dictionary, and a few variables.\n",
-        "\n",
-        "- The `t_dict` dictionary stores character counts for string `t`. In the worst case, when all characters in `t` are distinct, this dictionary can have a maximum of 'n' key-value pairs. So, the space complexity for `t_dict` is O(n).\n",
-        "\n",
-        "- The `current_window_dict` dictionary stores character counts for the current window. In the worst case, it can have a maximum of 'm' key-value pairs. So, the space complexity for `current_window_dict` is also O(m).\n",
-        "\n",
-        "- Other variables used in the function, such as `left`, `right`, `min_len`, `min_window`, `required_chars`, and `found_chars`, are all of constant size and do not depend on the input sizes.\n",
-        "\n",
-        "**In summary**, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings' lengths. This is because the space used for `t_dict` and `current_window_dict` dominates the space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Smallest Distinct Substring:** Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.\n",
-        "2. **No Extra Space:** Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/03. Sliding Window/README.md b/docs/03. Sliding Window/README.md
deleted file mode 100644
index e1294ff..0000000
--- a/docs/03. Sliding Window/README.md	
+++ /dev/null
@@ -1,19 +0,0 @@
-# Sliding Window Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/04. Stack/20. Valid Parentheses.ipynb b/docs/04. Stack/20. Valid Parentheses.ipynb
deleted file mode 100644
index c47292f..0000000
--- a/docs/04. Stack/20. Valid Parentheses.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 20. Valid Parentheses\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Parentheses problem on LeetCode, click here!](https://leetcode.com/problems/valid-parentheses/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given a string s containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.\n",
-        "\n",
-        "An input string is valid if:\n",
-        "\n",
-        "1. Open brackets must be closed by the same type of brackets.\n",
-        "2. Open brackets must be closed in the correct order.\n",
-        "3. Every close bracket has a corresponding open bracket of the same type.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^4$\n",
-        "- `s` consists of parentheses only `'()[]{}'`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isValid(s):\n",
-        "    # Create an empty stack to store opening brackets\n",
-        "    stack = []\n",
-        "    \n",
-        "    # Define a mapping for matching brackets\n",
-        "    bracket_mapping = {')': '(', '}': '{', ']': '['}\n",
-        "    \n",
-        "    # Iterate through the characters in the input string\n",
-        "    for char in s:\n",
-        "        # If the character is an opening bracket, push it onto the stack\n",
-        "        if char in bracket_mapping.values():\n",
-        "            stack.append(char)\n",
-        "        # If the character is a closing bracket\n",
-        "        elif char in bracket_mapping.keys():\n",
-        "            # Pop the top element from the stack if it exists, or use a dummy value '#'\n",
-        "            top_element = stack.pop() if stack else '#'\n",
-        "            # If the popped element does not match the corresponding opening bracket, return False\n",
-        "            if bracket_mapping[char] != top_element:\n",
-        "                return False\n",
-        "        # If the character is not a bracket, ignore it\n",
-        "        \n",
-        "    # After processing the entire string, if there are any unmatched opening brackets left in the stack, return False\n",
-        "    return len(stack) == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `isValid` function that takes a single argument `s`, which is the input string containing parentheses and brackets.\n",
-        "\n",
-        "2. Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.\n",
-        "\n",
-        "3. We define a `bracket_mapping` dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.\n",
-        "\n",
-        "4. We iterate through each character `char` in the input string `s` using a `for` loop.\n",
-        "\n",
-        "5. If the character `char` is an opening bracket (i.e., it exists in the `values()` of `bracket_mapping`), we push it onto the stack using the `append()` method.\n",
-        "\n",
-        "6. If the character `char` is a closing bracket (i.e., it exists in the `keys()` of `bracket_mapping`), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in `top_element`. We use a dummy value `'#'` if the stack is empty to avoid errors.\n",
-        "\n",
-        "7. We then compare `top_element` with the corresponding opening bracket using `bracket_mapping[char]`. If they do not match, it means the string is not valid, and we return `False`.\n",
-        "\n",
-        "8. If the character `char` is not a bracket, we simply ignore it and continue the loop.\n",
-        "\n",
-        "9. After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return `True`. Otherwise, we return `False`.\n",
-        "\n",
-        "10. Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(isValid(\"()\"))    "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 51,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(isValid(\"()[]{}\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(isValid(\"(]\"))     "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `isValid` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through each character in the input string `s` once, performing constant-time operations for each character.\n",
-        "- Pushing and popping elements from the stack (list) also takes constant time in most cases.\n",
-        "- Therefore, the overall time complexity of the function is $O(n)$, where $n$ is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the function is determined by the space used by the stack and the `bracket_mapping` dictionary.\n",
-        "- In the worst case, if the input string `s` consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of $O(n)$ in terms of the stack.\n",
-        "- The `bracket_mapping` dictionary has a constant number of key-value pairs (3 pairs in this case).\n",
-        "- Therefore, the overall space complexity of the function is $O(n)$, where $n$ is the length of the input string `s`, mainly due to the stack space.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity is $O(n)$ because we iterate through the string once.\n",
-        "- The space complexity is $O(n)$ due to the stack used to keep track of opening brackets."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Valid Expressions:** Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as \"$2 * (3 + 5) / (4 - 2)$\".\n",
-        "2. **Valid Parentheses Combinations:**\n",
-        "Write a function to generate all valid combinations of n pairs of parentheses, where $n$ is a positive integer. For example, for $n = 3$, the valid combinations are [\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\"]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/04. Stack/README.md b/docs/04. Stack/README.md
deleted file mode 100644
index 2ed115b..0000000
--- a/docs/04. Stack/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Stack Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/docs/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
deleted file mode 100644
index 98f2331..0000000
--- a/docs/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,228 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 153. Find Minimum in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Suppose an array of length `n` sorted in ascending order is **rotated** between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:\n",
-        "\n",
-        "- `[4,5,6,7,0,1,2]` if it was rotated `4` times.\n",
-        "- `[0,1,2,4,5,6,7]` if it was rotated `7` times.\n",
-        "\n",
-        "Notice that **rotating** an array `[a[0], a[1], a[2], ..., a[n-1]]` 1 time results in the array `[a[n-1], a[0], a[1], a[2], ..., a[n-2]]`.\n",
-        "\n",
-        "Given the sorted rotated array `nums` of **unique** elements, return *the minimum element of this array.*\n",
-        "\n",
-        "You must write an algorithm that runs in $O(log\\ n)$ time.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `n == nums.length`\n",
-        "- `1 <= n <= 5000`\n",
-        "- `-5000 <= nums[i] <= 5000`\n",
-        "- All the integers of `nums` are **unique**.\n",
-        "- `nums` is sorted and rotated between `1` and `n` times."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 39,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def findMin(nums):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "    \n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "        \n",
-        "        # If the mid element is greater than the rightmost element,\n",
-        "        # it means the minimum element is in the right half.\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        # If the mid element is less than or equal to the rightmost element,\n",
-        "        # it means the minimum element is in the left half or at the mid itself.\n",
-        "        else:\n",
-        "            right = mid\n",
-        "    \n",
-        "    # The loop will break when left and right converge to the minimum element.\n",
-        "    # At this point, left (or right) will be pointing to the minimum element.\n",
-        "    return nums[left]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The function `findMin(nums)` takes an input list `nums`, which represents the rotated sorted array.\n",
-        "\n",
-        "2. Initialize two pointers `left` and `right` to track the current search range. Initially, `left` is set to 0 (the beginning of the array), and `right` is set to `len(nums) - 1` (the end of the array).\n",
-        "\n",
-        "3. Enter a `while` loop with the condition `left < right`. This loop continues until `left` and `right` converge to a single element, which will be the minimum element in the rotated array.\n",
-        "\n",
-        "4. Inside the loop, calculate the middle index `mid` using integer division. This helps in finding the middle element of the current search range.\n",
-        "\n",
-        "5. Check if the element at the middle index (`nums[mid]`) is greater than the element at the rightmost index (`nums[right]`). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update `left` to `mid + 1`, effectively eliminating the left half of the search range.\n",
-        "\n",
-        "6. If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the `mid` index itself. In this case, update `right` to `mid`, effectively eliminating the right half of the search range.\n",
-        "\n",
-        "7. Repeat steps 4-6 until `left` and `right` converge to the minimum element.\n",
-        "\n",
-        "8. When the loop exits, it means that `left` (or `right`) points to the minimum element in the array.\n",
-        "\n",
-        "9. Return `nums[left]` (or `nums[right]`) as the result, which is the minimum element in the rotated sorted array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 43,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1:\n",
-        "nums1 = [3, 4, 5, 1, 2]\n",
-        "print(findMin(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 41,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "print(findMin(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 42,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "11\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [11, 13, 15, 17]\n",
-        "print(findMin(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this code is $O(log\\ n)$, where '$n$' is the length of the input array `nums`. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.\n",
-        "\n",
-        "In each iteration of the `while` loop, the search range is halved, and this process continues until the `left` and `right` pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.\n",
-        "\n",
-        "Therefore, the binary search used in this code runs in $O(log\\ n)$ time complexity.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of this code is $O(1)$, which means it uses a constant amount of additional space that does not depend on the size of the input array.\n",
-        "\n",
-        "The algorithm uses a fixed number of variables (`left`, `right`, `mid`) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Solve the problem with a variation where the input array may contain duplicates.\n",
-        "\n",
-        "2. Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in $O(log\\ n)$ time.\n",
-        "\n",
-        "3. Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in $O(log\\ n)$ time?\n",
-        "\n",
-        "4. Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in $O(log\\ n)$ time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/docs/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
deleted file mode 100644
index d8d4202..0000000
--- a/docs/05. Binary Search/33. Search in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 33. Search in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Search in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is an integer array `nums` sorted in ascending order (with **distinct** values).\n",
-        "\n",
-        "Prior to being passed to your function, `nums` is **possibly rotated** at an unknown pivot index `k (1 <= k < nums.length)` such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]` (**0-indexed**). For example, `[0,1,2,4,5,6,7]` might be rotated at pivot index 3 and become `[4,5,6,7,0,1,2]`.\n",
-        "\n",
-        "Given the array `nums` **after** the possible rotation and an integer `target`, return *the index of `target` if it is in `nums`, or `-1` if it is not in `nums`.*\n",
-        "\n",
-        "You must write an algorithm with $O(log\\ n)$ runtime complexity.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `1 <= nums.length <= 5000`\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- All values of `nums` are **unique**.\n",
-        "- `nums` is an ascending array that is possibly rotated.\n",
-        "- $-10^4$ <= `target` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 44,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def search(nums, target):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Find the pivot index using binary search\n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid\n",
-        "\n",
-        "    pivot = left\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Determine which part of the array to search in\n",
-        "    if target >= nums[pivot] and target <= nums[right]:\n",
-        "        left = pivot\n",
-        "    else:\n",
-        "        right = pivot\n",
-        "\n",
-        "    # Perform binary search to find the target\n",
-        "    while left <= right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] == target:\n",
-        "            return mid\n",
-        "        elif nums[mid] < target:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid - 1\n",
-        "\n",
-        "    return -1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `search` function takes two arguments: `nums`, which is the rotated sorted array, and `target`, which is the value we want to find in the array.\n",
-        "\n",
-        "2. We initialize two pointers, `left` and `right`, which represent the range in which we are going to perform binary search. Initially, `left` is set to 0, and `right` is set to the index of the last element in the array (`len(nums) - 1`).\n",
-        "\n",
-        "3. We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a `while` loop to continue the search until `left` is less than `right`.\n",
-        "\n",
-        "4. Inside the loop, we calculate the middle index `mid` using integer division. We then compare the value at `mid` with the value at `right`. If `nums[mid]` is greater than `nums[right]`, it means the pivot point lies to the right of `mid`, so we update `left` to `mid + 1`. Otherwise, the pivot point lies to the left of `mid`, so we update `right` to `mid`. This process continues until we find the pivot index.\n",
-        "\n",
-        "5. After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.\n",
-        "\n",
-        "6. We reset `left` and `right` pointers. If the target value is within the range `[nums[pivot], nums[right]]`, we set `left` to `pivot` (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set `right` to `pivot` (the end of the sorted part), indicating that we should search in the sorted part.\n",
-        "\n",
-        "7. We then perform binary search again within the chosen range (`left` to `right`) to find the target element. The binary search continues until `left` is less than or equal to `right`.\n",
-        "\n",
-        "8. Inside the binary search loop, we calculate the middle index `mid` and compare `nums[mid]` with the target value. If they are equal, we return `mid` as the index of the target element. If `nums[mid]` is less than the target, we update `left` to `mid + 1` to search in the right half. If `nums[mid]` is greater than the target, we update `right` to `mid - 1` to search in the left half.\n",
-        "\n",
-        "9. If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 45,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "nums1 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target1 = 0\n",
-        "result1 = search(nums1, target1)\n",
-        "print(result1) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target2 = 3\n",
-        "result2 = search(nums2, target2)\n",
-        "print(result2) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 47,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [1]\n",
-        "target3 = 0\n",
-        "result3 = search(nums3, target3)\n",
-        "print(result3) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Finding the pivot index using binary search takes $O(log\\ n)$ time, where '$n$' is the number of elements in the array.\n",
-        "2. After finding the pivot index, performing binary search to find the target element also takes $O(log\\ n)$ time in the worst case.\n",
-        "\n",
-        "The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is $O(log\\ n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is very minimal:\n",
-        "\n",
-        "1. We use a constant amount of additional space for variables such as `left`, `right`, `pivot`, and `mid`. These variables do not depend on the input size, so they contribute $O(1)$ space complexity.\n",
-        "2. The function does not use any additional data structures that scale with the input size.\n",
-        "\n",
-        "Therefore, the space complexity of the code is $O(1)$, which means it has a constant space complexity and does not depend on the size of the input array.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find Minimum Element in Rotated Sorted Array**: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don't need to search for a target value but instead find the smallest element.\n",
-        "\n",
-        "2. **Search in a Circularly Sorted Array**: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining $O(log\\ n)$ complexity."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/05. Binary Search/README.md b/docs/05. Binary Search/README.md
deleted file mode 100644
index 6086b9b..0000000
--- a/docs/05. Binary Search/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Binary search Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/06. Linked List/141. Linked List Cycle.ipynb b/docs/06. Linked List/141. Linked List Cycle.ipynb
deleted file mode 100644
index 0336bc8..0000000
--- a/docs/06. Linked List/141. Linked List Cycle.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 141. Linked List Cycle\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Linked List Cycle problem on LeetCode, click here!](https://leetcode.com/problems/linked-list-cycle/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given `head`, the head of a linked list, determine if the linked list has a cycle in it.\n",
-        "\n",
-        "There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is connected to. **Note that `pos` is not passed as a parameter.**\n",
-        "\n",
-        "Return `true` if there is a cycle in the linked list. Otherwise, return `false`.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of the nodes in the list is in the range $[0, 10^4]$.\n",
-        "- $-10^5$ <= Node.val <= $10^5$\n",
-        "- `pos` is `-1` or a **valid index** in the linked-list.\n",
-        "\n",
-        "**Follow up:** Can you solve it using $O(1)$ (i.e. constant) memory?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0):\n",
-        "        self.val = val\n",
-        "        self.next = None\n",
-        "\n",
-        "class Solution:\n",
-        "    def hasCycle(self, head: ListNode) -> bool:\n",
-        "        if not head:\n",
-        "            return False\n",
-        "        \n",
-        "        slow = head\n",
-        "        fast = head\n",
-        "        \n",
-        "        while fast and fast.next:\n",
-        "            slow = slow.next\n",
-        "            fast = fast.next.next\n",
-        "            \n",
-        "            if slow == fast:\n",
-        "                return True\n",
-        "        \n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a class `Solution` with a method `hasCycle` for determining if a linked list has a cycle.\n",
-        "\n",
-        "The `ListNode` class represents nodes in the linked list, where each node has a `val` (a value associated with the node) and a `next` attribute (a reference to the next node in the list).\n",
-        "\n",
-        "The `hasCycle` method takes the `head` of a linked list as input and returns `True` if there is a cycle in the linked list, and `False` otherwise. It uses two pointers, `slow` and `fast`, to traverse the linked list. If there is a cycle, the `fast` pointer will eventually catch up to the `slow` pointer.\n",
-        "\n",
-        "The algorithm works as follows:\n",
-        "1. It checks if the input `head` is `None` (an empty list). If it is, the method returns `False` because an empty list can't have a cycle.\n",
-        "2. Two pointers, `slow` and `fast`, initially point to the `head` of the list.\n",
-        "3. The code enters a `while` loop where `fast` moves two steps at a time, and `slow` moves one step at a time.\n",
-        "4. If there is a cycle, `fast` will eventually catch up to `slow`, and the method returns `True`.\n",
-        "5. If the loop completes without finding a cycle, the method returns `False`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list with a cycle\n",
-        "def create_linked_list_with_cycle(values, pos):\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "    cycle_node = None\n",
-        "    \n",
-        "    for i, val in enumerate(values):\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "        \n",
-        "        if i == pos:\n",
-        "            cycle_node = current\n",
-        "    \n",
-        "    if cycle_node:\n",
-        "        current.next = cycle_node\n",
-        "    \n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:\n",
-        "\n",
-        "1. `values`: A list of values representing the nodes in the linked list.\n",
-        "2. `pos`: An integer representing the index of the node where the cycle begins.\n",
-        "\n",
-        "Here's how the function works:\n",
-        "\n",
-        "- It starts by creating an empty `ListNode` called `dummy`. This `dummy` node is used to simplify the creation of the linked list.\n",
-        "- It initializes a `current` pointer to the `dummy` node. This pointer will be used to traverse the linked list.\n",
-        "- It initializes a `cycle_node` variable to `None`. This variable will hold the reference to the node where the cycle begins, if any.\n",
-        "- It then iterates through the `values` list, creating a new `ListNode` for each value and appending it to the linked list.\n",
-        "- Inside the loop, it checks if the current index `i` is equal to the specified `pos`. If they match, it sets `cycle_node` to the current node. This simulates the creation of a cycle in the linked list.\n",
-        "- After the loop, if `cycle_node` is not `None` (indicating a cycle should be created), it connects the last node in the linked list to `cycle_node`, effectively creating a cycle.\n",
-        "- Finally, it returns the reference to the first node of the linked list (not the `dummy` node).\n",
-        "\n",
-        "This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It's particularly useful for testing the code's ability to detect cycles in linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "head = [3,2,0,-4]\n",
-        "pos = 1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "head = [1,2]\n",
-        "pos = 0\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "head = [1]\n",
-        "pos = -1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the code for detecting a cycle in a linked list:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is $O(n)$, where \"$n$\" is the number of nodes in the linked list.\n",
-        "\n",
-        "The reason for this is that both the `slow` and `fast` pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the `fast` pointer will reach the end of the list after going through approximately $n/2$ nodes. In the case of a cycle, it may take some extra iterations for the `fast` pointer to catch up to the `slow` pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it $O(n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is $O(1)$, which means it uses constant space.\n",
-        "\n",
-        "The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (`slow` and `fast`) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.\n",
-        "\n",
-        "**In summary**, this code efficiently detects cycles in a linked list with a time complexity of $O(n)$ and a space complexity of $O(1)$. It is an example of an algorithm that solves a complex problem with minimal memory usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/143. Reorder List.ipynb b/docs/06. Linked List/143. Reorder List.ipynb
deleted file mode 100644
index a83545b..0000000
--- a/docs/06. Linked List/143. Reorder List.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 143. Reorder List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Reorder List problem on LeetCode, click here!](https://leetcode.com/problems/reorder-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the head of a singly linked-list. The list can be represented as:\n",
-        "\n",
-        "$L_0 → L_1 → … → L_{n - 1} → L_n$\n",
-        "\n",
-        "Reorder the list to be on the following form:\n",
-        "\n",
-        "$L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …$\n",
-        "\n",
-        "You may not modify the values in the list's nodes. Only nodes themselves may be changed.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is in the range $[1, 5 * 10^4]$.\n",
-        "- `1 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 28,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def reorderList(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    # Step 1: Find the middle of the linked list\n",
-        "    slow, fast = head, head\n",
-        "    while fast.next and fast.next.next:\n",
-        "        slow = slow.next\n",
-        "        fast = fast.next.next\n",
-        "\n",
-        "    # Split the list into two halves\n",
-        "    first_half = head\n",
-        "    second_half = slow.next\n",
-        "    slow.next = None\n",
-        "\n",
-        "    # Step 2: Reverse the second half of the linked list\n",
-        "    prev = None\n",
-        "    current = second_half\n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    second_half = prev\n",
-        "\n",
-        "    # Step 3: Merge the first and reversed second halves alternately\n",
-        "    p1, p2 = first_half, second_half\n",
-        "    while p2:\n",
-        "        next_p1 = p1.next\n",
-        "        next_p2 = p2.next\n",
-        "        p1.next = p2\n",
-        "        p2.next = next_p1\n",
-        "        p1 = next_p1\n",
-        "        p2 = next_p2\n",
-        "\n",
-        "    return head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `reorderList` function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here's a detailed explanation of how the function works:\n",
-        "\n",
-        "1. **Base Cases Handling**:\n",
-        "   - The function first checks if the input linked list is empty (`not head`) or contains only one element (`not head.next`). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.\n",
-        "\n",
-        "2. **Finding the Middle of the Linked List**:\n",
-        "   - To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, `slow` and `fast`, initialized to the head of the list.\n",
-        "   - `slow` moves one step at a time while `fast` moves two steps at a time. When `fast` reaches the end of the list or the second-to-last node, `slow` will be at the middle node.\n",
-        "\n",
-        "3. **Splitting the List**:\n",
-        "   - After finding the middle node, we split the list into two halves:\n",
-        "     - The first half, `first_half`, contains nodes from the beginning up to the middle.\n",
-        "     - The second half, `second_half`, contains nodes from the middle to the end.\n",
-        "   - To split the list, we set the `next` pointer of the node before the middle node to `None`.\n",
-        "\n",
-        "4. **Reversing the Second Half**:\n",
-        "   - We reverse the second half of the linked list using the `prev`, `current`, and `next_node` pointers.\n",
-        "   - `prev` is initially `None`, and we iterate through the second half. For each node, we:\n",
-        "     - Set the `next` of the current node to `prev`, effectively reversing the next pointer direction.\n",
-        "     - Update `prev` to the current node.\n",
-        "     - Move to the next node using the `next_node`.\n",
-        "\n",
-        "5. **Merging the Two Halves Alternately**:\n",
-        "   - We now have two linked lists: `first_half` and the reversed `second_half`.\n",
-        "   - We merge these two lists alternately by adjusting the `next` pointers of the nodes.\n",
-        "   - `p1` and `p2` are pointers to the current nodes in `first_half` and `second_half`, respectively.\n",
-        "   - We iterate through both lists while reordering nodes:\n",
-        "     - Set the `next` of `p1` to `p2` to link a node from the first half to a node from the reversed second half.\n",
-        "     - Update `p1` and `p2` to their respective next nodes.\n",
-        "     - Repeat this process until we have processed all nodes in both halves.\n",
-        "\n",
-        "6. **Returning the Reordered List**:\n",
-        "   - After the merging process is complete, the linked list is reordered as specified.\n",
-        "   - The function returns the `head` of the reordered list.\n",
-        "\n",
-        "The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 4, 2, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = ListNode(1, ListNode(2, ListNode(3, ListNode(4))))\n",
-        "reorderList(head1)\n",
-        "print(printLinkedList(head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 5, 2, 4, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))\n",
-        "reorderList(head2)\n",
-        "print(printLinkedList(head2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `reorderList` function:\n",
-        "\n",
-        "**Time Complexity**:\n",
-        "1. **Finding the Middle of the Linked List**: In this step, we use two pointers, one moving one step at a time (`slow`) and the other moving two steps at a time (`fast`). This process takes $O(N/2)$ time, where $N$ is the number of nodes in the linked list.\n",
-        "\n",
-        "2. **Splitting the List**: After finding the middle, we split the list into two halves by setting the `next` pointer of the node before the middle node to `None`. This step takes $O(1)$ time.\n",
-        "\n",
-        "3. **Reversing the Second Half**: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes $O(N/2)$ time.\n",
-        "\n",
-        "4. **Merging the Two Halves Alternately**: In this step, we merge the two halves alternately by adjusting the `next` pointers of the nodes. We iterate through both halves once, so this step takes $O(N/2)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the `reorderList` function is dominated by the steps involving reversing and merging the two halves, both of which take $O(N/2)$ time. Therefore, the total time complexity is $O(N)$.\n",
-        "\n",
-        "**Space Complexity**:\n",
-        "The space complexity of the `reorderList` function is primarily determined by the variables and data structures used within the function. Let's break down the space complexity components:\n",
-        "\n",
-        "1. **Constant Space Variables**: The variables `slow`, `fast`, `prev`, `current`, `next_node`, `p1`, and `p2` are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute $O(1)$ to the space complexity.\n",
-        "\n",
-        "2. **Split Linked Lists**: In the splitting step, we create two new linked list segments (`first_half` and `second_half`) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, $O(N/2)$. \n",
-        "\n",
-        "3. **Reversed Second Half**: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn't contribute to additional space complexity.\n",
-        "\n",
-        "4. **Overall**: Combining the above components, the total space complexity is $O(N/2)$, which simplifies to $O(N)$ in terms of space complexity.\n",
-        "\n",
-        "**In summary**, the `reorderList` function has a time complexity of $O(N)$ and a space complexity of $O(N)$ due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reorder by K Elements:** Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by $K$ elements at a time. For example, for $K=3$, you would reorder it as ($L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...$).\n",
-        "You may need to handle cases where the number of nodes is not a multiple of $K$.\n",
-        "\n",
-        "2. **Reorder by Odd and Even Nodes:** Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, ($L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...$)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/19. Remove Nth Node From End of List.ipynb b/docs/06. Linked List/19. Remove Nth Node From End of List.ipynb
deleted file mode 100644
index 263124e..0000000
--- a/docs/06. Linked List/19. Remove Nth Node From End of List.ipynb	
+++ /dev/null
@@ -1,278 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 19. Remove Nth Node From End of List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Remove Nth Node From End of List problem on LeetCode, click here!](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the head of a linked list, remove the $n^{th}$ node from the end of the list and return its head.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is `sz`.\n",
-        "- `1 <= sz <= 30`\n",
-        "- `0 <= Node.val <= 100`\n",
-        "- `1 <= n <= sz`\n",
-        "\n",
-        "**Follow up:** Could you do this in one pass?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 23,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def removeNthFromEnd(head, n):\n",
-        "    # Create a dummy node to handle the case of removing the head node.\n",
-        "    dummy = ListNode(0)\n",
-        "    dummy.next = head\n",
-        "    first = dummy\n",
-        "    second = dummy\n",
-        "    \n",
-        "    # Advance the first pointer by n+1 nodes.\n",
-        "    for _ in range(n + 1):\n",
-        "        first = first.next\n",
-        "    \n",
-        "    # Move both pointers simultaneously until first reaches the end.\n",
-        "    while first is not None:\n",
-        "        first = first.next\n",
-        "        second = second.next\n",
-        "    \n",
-        "    # Remove the nth node by updating the next pointer of the previous node.\n",
-        "    second.next = second.next.next\n",
-        "    \n",
-        "    return dummy.next  # Return the modified head of the linked list"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `ListNode` class to represent individual nodes in a linked list. Each node has two attributes: `val` (the value of the node) and `next` (a reference to the next node in the list).\n",
-        "\n",
-        "2. The `removeNthFromEnd` function takes the head of a linked list (`head`) and the value `n`, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.\n",
-        "\n",
-        "3. We create a dummy node (`dummy`) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.\n",
-        "\n",
-        "4. We initialize two pointers, `first` and `second`, both initially pointing to the dummy node.\n",
-        "\n",
-        "5. To advance the `first` pointer by `n+1` nodes, we use a `for` loop. This positions the `first` pointer `n` nodes ahead of the `second` pointer.\n",
-        "\n",
-        "6. We then move both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This ensures that the `second` pointer ends up pointing to the node that needs to be removed.\n",
-        "\n",
-        "7. To remove the nth node from the end, we update the `next` pointer of the node pointed to by the `second` pointer to skip over the node to be removed.\n",
-        "\n",
-        "8. Finally, we return `dummy.next`, which is the modified head of the linked list without the removed node.\n",
-        "\n",
-        "9. Additionally, there are two helper functions:\n",
-        "   - `createLinkedList(values)` creates a linked list from a list of values.\n",
-        "   - `convertToList(head)` converts a linked list back into a list of values."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values.\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list of values.\n",
-        "def convertToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions:\n",
-        "\n",
-        "1. `createLinkedList(values)`: This function creates a linked list from a list of values.\n",
-        "\n",
-        "   - Input: `values` is a list containing values that you want to insert into the linked list.\n",
-        "   - Output: The function returns the head of the created linked list.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by checking if the `values` list is empty. If it is, it returns `None` to indicate an empty linked list.\n",
-        "   - If the `values` list is not empty, it creates the first node of the linked list with the value from the first element of `values`.\n",
-        "   - It then iterates through the remaining elements of `values` and creates new nodes for each value, connecting them together using the `next` attribute to form a linked list.\n",
-        "   - Finally, it returns the head of the linked list, which is the first node created.\n",
-        "   \n",
-        "\n",
-        "2. `convertToList(head)`: This function converts a linked list into a list of values.\n",
-        "\n",
-        "   - Input: `head` is the head node of the linked list that you want to convert.\n",
-        "   - Output: The function returns a list containing the values of the nodes in the linked list in order.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by initializing an empty list, `result`, to store the values of the linked list nodes.\n",
-        "   - It then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - The iteration continues until it reaches the end of the linked list (i.e., the `next` attribute of the current node becomes `None`).\n",
-        "   - After the iteration is complete, the function returns the `result` list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.\n",
-        "\n",
-        "These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2, 3, 5]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = createLinkedList([1, 2, 3, 4, 5])\n",
-        "n1 = 2\n",
-        "new_head1 = removeNthFromEnd(head1, n1)\n",
-        "print(convertToList(new_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = createLinkedList([1])\n",
-        "n2 = 1\n",
-        "new_head2 = removeNthFromEnd(head2, n2)\n",
-        "print(convertToList(new_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 27,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "head3 = createLinkedList([1, 2])\n",
-        "n3 = 1\n",
-        "new_head3 = removeNthFromEnd(head3, n3)\n",
-        "print(convertToList(new_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Certainly! Let's analyze the time and space complexity of the `removeNthFromEnd` function in isolation:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The `removeNthFromEnd` function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length $N$.\n",
-        "- The first pass positions the `first` pointer $n$ nodes ahead of the `second` pointer. This pass takes $O(N)$ time because it involves iterating through all N nodes.\n",
-        "- The second pass moves both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This also takes $O(N)$ time in the worst case.\n",
-        "- Therefore, the overall time complexity of the `removeNthFromEnd` function is $O(N)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The `removeNthFromEnd` function uses a constant amount of extra space for its variables (e.g., `first`, `second`, and `dummy`). This space usage does not depend on the size of the linked list.\n",
-        "- The space complexity is $O(1)$, indicating that the space used by the function is constant and independent of the size of the input linked list.\n",
-        "\n",
-        "**In summary**, the `removeNthFromEnd` function has a time complexity of $O(N)$ and a space complexity of $O(1)$. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/206. Reverse Linked List.ipynb b/docs/06. Linked List/206. Reverse Linked List.ipynb
deleted file mode 100644
index c97de2d..0000000
--- a/docs/06. Linked List/206. Reverse Linked List.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 206. Reverse Linked List\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Reverse Linked List problem on LeetCode, click here!](https://leetcode.com/problems/reverse-linked-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `head` of a singly linked list, reverse the list, and return the reversed list.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is the range `[0, 5000]`.\n",
-        "- `-5000 <= Node.val <= 5000`\n",
-        "\n",
-        "**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 33,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "# Function to reverse a linked list iteratively\n",
-        "def reverseListIterative(head):\n",
-        "    prev = None\n",
-        "    current = head\n",
-        "    \n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    \n",
-        "    return prev\n",
-        "\n",
-        "# Function to reverse a linked list recursively\n",
-        "def reverseListRecursive(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    new_head = reverseListRecursive(head.next)\n",
-        "    head.next.next = head\n",
-        "    head.next = None\n",
-        "\n",
-        "    return new_head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `reverseListIterative(head)`: This function reverses a linked list iteratively using a loop. Here's a step-by-step explanation:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - It initializes two pointers, `prev` and `current`, initially set to `None` and the `head` of the list, respectively.\n",
-        "   - It enters a `while` loop that continues until `current` reaches the end of the list (i.e., becomes `None`).\n",
-        "   - Inside the loop:\n",
-        "     - It stores the `next_node` which is the next node after `current`.\n",
-        "     - It updates the `next` pointer of `current` to point to the `prev` node. This effectively reverses the link direction.\n",
-        "     - It moves `prev` to `current` and `current` to `next_node`, advancing the pointers one step further in the list.\n",
-        "   - Once the loop completes, `prev` will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns `prev`.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`: This function reverses a linked list recursively. Here's how it works:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - The base case is checked: if `head` is `None` or `head.next` is `None`, meaning the list is empty or has only one node, it returns `head` as there's no need to reverse a list with zero or one element.\n",
-        "   - In the recursive case:\n",
-        "     - It calls itself with `head.next`, effectively moving down the list until it reaches the end.\n",
-        "     - Once it reaches the end, it starts reversing the links:\n",
-        "       - `head.next.next` is set to `head`, reversing the link between `head` and the next node.\n",
-        "       - `head.next` is set to `None` to avoid cycles.\n",
-        "   - Finally, it returns the new head of the reversed list, which will be the last node of the original list.\n",
-        "\n",
-        "**In summary,** `reverseListIterative` reverses the linked list by iterating through it and changing the next pointers, while `reverseListRecursive` reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list for testing\n",
-        "def linkedListToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions used in the provided code:\n",
-        "\n",
-        "1. `createLinkedList(values)`:\n",
-        "\n",
-        "   - Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It first checks if the input list `values` is empty. If it's empty, it returns `None` to indicate an empty linked list.\n",
-        "     - If `values` is not empty, it initializes a `head` node with the value of the first element in `values`.\n",
-        "     - It then iterates through the remaining values in `values`, creating new nodes for each value and linking them together to form a linked list.\n",
-        "     - Finally, it returns the `head` node of the newly created linked list.\n",
-        "\n",
-        "2. `linkedListToList(head)`:\n",
-        "\n",
-        "   - Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It takes the `head` of the linked list as input.\n",
-        "     - It initializes an empty list called `result`.\n",
-        "     - It then iterates through the linked list, starting from `head`, and appends each node's `val` (value) to the `result` list.\n",
-        "     - This process continues until the end of the linked list is reached.\n",
-        "     - Finally, it returns the `result` list, which contains the values from the linked list in the same order.\n",
-        "\n",
-        "These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 35,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[1, 1, 2, 3, 4, 4]"
-            ]
-          },
-          "execution_count": 35,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 1: Iterative\n",
-        "head1 = [1,2,3,4,5]\n",
-        "head1 = createLinkedList(head1)\n",
-        "reversed_head1 = reverseListIterative(head1)\n",
-        "print(linkedListToList(reversed_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[]"
-            ]
-          },
-          "execution_count": 37,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 2: Recursive\n",
-        "head2 = [1,2]\n",
-        "head2 = createLinkedList(head2)\n",
-        "reversed_head2 = reverseListRecursive(head2)\n",
-        "print(linkedListToList(reversed_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[0]"
-            ]
-          },
-          "execution_count": 38,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 3: Empty list\n",
-        "head3 = []\n",
-        "head3 = createLinkedList(head3)\n",
-        "reversed_head3 = reverseListIterative(head3)\n",
-        "print(linkedListToList(reversed_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the two functions:\n",
-        "\n",
-        "1. `reverseListIterative(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The iterative function visits each node in the linked list exactly once in a single pass, where \"$n$\" is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(1)$\n",
-        "     - This function uses a constant amount of extra space for the `prev`, `current`, and `next_node` pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is $O(n)$, where \"$n$\" is the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(n)$\n",
-        "     - The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has \"$n$\" nodes, it will create \"$n$\" recursive function calls on the stack, resulting in a space complexity of $O(n)$. This is because each function call stores information about its state, including the `head` pointer, until it reaches the base case and starts returning.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- The time complexity of both functions is $O(n)$ because they both visit each node once.\n",
-        "- The space complexity of `reverseListIterative` is $O(1)$ because it uses a constant amount of extra space.\n",
-        "- The space complexity of `reverseListRecursive` is $O(n)$ due to the recursive function calls and the associated call stack space.\n",
-        "\n",
-        "Both functions are efficient in terms of time complexity, but `reverseListIterative` is more memory-efficient because it uses a constant amount of additional space, while `reverseListRecursive` uses space on the call stack proportional to the number of nodes in the list."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Group Reverse:** Modify the reverseListIterative function to reverse the linked list in groups of $K$ elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and $K$ is 3, the output should be [3, 2, 1, 6, 5, 4].\n",
-        "\n",
-        "2. **Rotate Linked List:** Write a function to rotate a linked list to the right by $K$ places. For example, if the input is [1, 2, 3, 4, 5] and $K$ is 2, the output should be [4, 5, 1, 2, 3]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/21. Merge Two Sorted Lists.ipynb b/docs/06. Linked List/21. Merge Two Sorted Lists.ipynb
deleted file mode 100644
index 876d633..0000000
--- a/docs/06. Linked List/21. Merge Two Sorted Lists.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 21. Merge Two Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge Two Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-two-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the heads of two sorted linked lists `list1` and `list2`.\n",
-        "\n",
-        "Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists.\n",
-        "\n",
-        "*Return the head of the merged linked list.*\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in both lists is in the range `[0, 50]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "- Both `list1` and `list2` are sorted in non-decreasing order."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def mergeTwoLists(list1, list2):\n",
-        "    # Create a dummy node to simplify the code.\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "\n",
-        "    while list1 and list2:\n",
-        "        if list1.val < list2.val:\n",
-        "            current.next = list1\n",
-        "            list1 = list1.next\n",
-        "        else:\n",
-        "            current.next = list2\n",
-        "            list2 = list2.next\n",
-        "        current = current.next\n",
-        "\n",
-        "    # Append the remaining elements from either list.\n",
-        "    if list1:\n",
-        "        current.next = list1\n",
-        "    else:\n",
-        "        current.next = list2\n",
-        "\n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class `ListNode` to represent the nodes of a singly-linked list. Each node has a `val` attribute to store the value of the node and a `next` attribute to point to the next node in the list.\n",
-        "\n",
-        "2. We define the `mergeTwoLists` function that takes two linked list heads, `list1` and `list2`, as input.\n",
-        "\n",
-        "3. We create a `dummy` node at the beginning of the merged list. The `dummy` node simplifies the code by serving as a placeholder, and its `next` attribute will point to the actual merged list.\n",
-        "\n",
-        "4. We initialize a `current` pointer to point to the `dummy` node initially. This `current` pointer helps us traverse and build the merged list.\n",
-        "\n",
-        "5. We enter a `while` loop that continues until either `list1` or `list2` becomes empty. Inside the loop, we compare the values of the nodes at the current positions of `list1` and `list2`.\n",
-        "\n",
-        "6. If the `val` of the node in `list1` is smaller than the `val` of the node in `list2`, we attach the node from `list1` to the merged list by updating the `next` attribute of the `current` node to point to the node in `list1`. We then move the `list1` pointer to the next node.\n",
-        "\n",
-        "7. If the `val` of the node in `list2` is smaller than or equal to the `val` of the node in `list1`, we attach the node from `list2` to the merged list in a similar manner. We move the `list2` pointer to the next node.\n",
-        "\n",
-        "8. After attaching a node to the merged list, we move the `current` pointer to the newly added node. This step is essential for keeping track of the end of the merged list.\n",
-        "\n",
-        "9. The loop continues until either `list1` or `list2` becomes empty.\n",
-        "\n",
-        "10. Once the loop exits, we check if there are any remaining elements in `list1` or `list2`. If `list1` is not empty, we attach the remaining elements of `list1` to the merged list. If `list2` is not empty, we attach the remaining elements of `list2`.\n",
-        "\n",
-        "11. Finally, we return the `next` attribute of the `dummy` node as the head of the merged list, which represents the sorted merged list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 1:\n",
-        "# Input: list1 = [1,2,4], list2 = [1,3,4]\n",
-        "list1 = ListNode(1, ListNode(2, ListNode(4)))\n",
-        "list2 = ListNode(1, ListNode(3, ListNode(4)))\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 2:\n",
-        "# Input: list1 = [], list2 = []\n",
-        "list1 = None\n",
-        "list2 = None\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 3:\n",
-        "# list1 = [], list2 = [0]\n",
-        "list1 = None\n",
-        "list2 = ListNode(0)\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `mergeTwoLists` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is $O(N + M$), where $N$ and $M$ are the lengths of `list1` and `list2`, respectively. Here's why:\n",
-        "\n",
-        "1. In the worst case, we need to traverse both `list1` and `list2` completely. This involves iterating through all the nodes in both lists once.\n",
-        "\n",
-        "2. The while loop runs until either `list1` or `list2` becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.\n",
-        "\n",
-        "3. Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of $O(N + M)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is $O(1)$, which means it uses a constant amount of extra space regardless of the input sizes. Here's why:\n",
-        "\n",
-        "1. We create a few extra pointers (`dummy`, `current`) and temporary variables (`val`) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of `list1` and `list2`.\n",
-        "\n",
-        "2. We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from `list1` and `list2` to form the merged list. This operation does not consume additional memory proportional to the input sizes.\n",
-        "\n",
-        "**In summary**, the `mergeTwoLists` function has a time complexity of $O(N + M)$ and a space complexity of $O(1)$, making it an efficient solution for merging two sorted linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Merge K Sorted Lists:** Extend the problem to merge $K$ sorted linked lists instead of just two. You need to efficiently merge $K$ lists into one sorted list.\n",
-        "\n",
-        "2. **Merge Lists in a Zigzag Pattern:** Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": "sql",
-      "file_extension": "",
-      "mimetype": "",
-      "name": "sql",
-      "version": "3.32.3"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/23. Merge k Sorted Lists.ipynb b/docs/06. Linked List/23. Merge k Sorted Lists.ipynb
deleted file mode 100644
index a850734..0000000
--- a/docs/06. Linked List/23. Merge k Sorted Lists.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 23. Merge k Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge k Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-k-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array of $k$ linked-lists lists, each linked-list is sorted in ascending order.\n",
-        "\n",
-        "Merge all the linked-lists into one sorted linked-list and return it.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `k == lists.length`\n",
-        "- 0 <= k <= $10^4$\n",
-        "- `0 <= lists[i].length <= 500`\n",
-        "- $-10^4$ <= lists[i][j] <= $10^4$\n",
-        "- `lists[i]` is sorted in ascending order.\n",
-        "- The sum of `lists[i].length` will not exceed $10^4$.\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "     def __init__(self, val=0, next=None):\n",
-        "         self.val = val\n",
-        "         self.next = next\n",
-        "\n",
-        "class Solution:\n",
-        "    def mergeKLists(self, lists: [[ListNode]]) -> ListNode:\n",
-        "        # Check if the input list of linked lists is empty\n",
-        "        if not lists or len(lists) == 0:\n",
-        "            return None\n",
-        "\n",
-        "        # Loop until there is only one merged list left\n",
-        "        while len(lists) > 1:\n",
-        "            mergedLists = []\n",
-        "\n",
-        "            # Merge pairs of lists\n",
-        "            for i in range(0, len(lists), 2):\n",
-        "                l1 = lists[i]\n",
-        "                l2 = lists[i + 1] if (i + 1) < len(lists) else None\n",
-        "                mergedLists.append(self.mergeList(l1, l2))\n",
-        "\n",
-        "            # Update the list of lists with merged results\n",
-        "            lists = mergedLists\n",
-        "        \n",
-        "        # Return the final merged list\n",
-        "        return lists[0]\n",
-        "\n",
-        "    def mergeList(self, l1, l2):\n",
-        "        # Create a dummy node to simplify merging\n",
-        "        dummy = ListNode()\n",
-        "        tail = dummy\n",
-        "\n",
-        "        # Merge the two sorted lists\n",
-        "        while l1 and l2:\n",
-        "            if l1.val < l2.val:\n",
-        "                tail.next = l1\n",
-        "                l1 = l1.next\n",
-        "            else:\n",
-        "                tail.next = l2\n",
-        "                l2 = l2.next\n",
-        "            tail = tail.next\n",
-        "\n",
-        "        # Append any remaining elements from l1 or l2 (if any)\n",
-        "        if l1:\n",
-        "            tail.next = l1\n",
-        "        if l2:\n",
-        "            tail.next = l2\n",
-        "\n",
-        "        # Return the merged result starting from the next of the dummy node\n",
-        "        return dummy.next\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class `Solution` with two methods for merging k sorted linked lists:\n",
-        "\n",
-        "1. `mergeKLists(self, lists: List[ListNode]) -> ListNode`: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.\n",
-        "\n",
-        "2. `mergeList(self, l1, l2)`: This method takes two sorted linked lists, `l1` and `l2`, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.\n",
-        "\n",
-        "Here's a high-level overview of how the code works:\n",
-        "\n",
-        "- The `mergeKLists` method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns `None`.\n",
-        "\n",
-        "- Inside a `while` loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the `lists` array. It does this by iterating through the input lists in pairs and calling the `mergeList` method to merge each pair.\n",
-        "\n",
-        "- The `mergeList` method takes two sorted linked lists, `l1` and `l2`, and merges them into a single sorted linked list. It uses a dummy node (`dummy`) and a `tail` pointer to keep track of the merged list while comparing and merging elements from `l1` and `l2`.\n",
-        "\n",
-        "- After merging all pairs of lists and updating the `lists` array with the merged results, the loop continues until only one merged list remains in the `lists` array.\n",
-        "\n",
-        "- Finally, the `mergeKLists` method returns the merged list.\n",
-        "\n",
-        "Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1 -> 1 -> 2 -> 3 -> 4 -> 4 -> 5 -> 6 -> "
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: lists = [[1,4,5],[1,3,4],[2,6]]\n",
-        "\n",
-        "lists1 = [\n",
-        "    ListNode(1, ListNode(4, ListNode(5))),\n",
-        "    ListNode(1, ListNode(3, ListNode(4))),\n",
-        "    ListNode(2, ListNode(6))\n",
-        "]\n",
-        "solution = Solution()\n",
-        "result1 = solution.mergeKLists(lists1)\n",
-        "\n",
-        "# Print the result\n",
-        "if result1:\n",
-        "    current = result1\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: lists = []\n",
-        "\n",
-        "lists2 = []\n",
-        "solution = Solution()\n",
-        "result2 = solution.mergeKLists(lists2)\n",
-        "\n",
-        "# Print the result\n",
-        "if result2:\n",
-        "    current = result2\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: lists = [[]]\n",
-        "\n",
-        "lists3 = [None]\n",
-        "solution = Solution()\n",
-        "result3 = solution.mergeKLists(lists3)\n",
-        "\n",
-        "# Print the result\n",
-        "if result3:\n",
-        "    current = result3\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Heap Initialization:** The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes $O(1)$ time.\n",
-        "\n",
-        "2. **Merging:** The merging operation is performed in a divide-and-conquer fashion. In each iteration of the `while` loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists ($n$). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is $O(log\\ k)$.\n",
-        "\n",
-        "   Therefore, the overall time complexity of the code is $O(n * log\\ k)$, where n is the total number of nodes across all lists, and $k$ is the number of linked lists.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Heap Space:** The code doesn't use a heap data structure, so there's no additional space complexity due to a heap.\n",
-        "\n",
-        "2. **Merged Lists:** In the `mergeList` method, we create a new merged list. However, this list is not stored in memory for all lists; it's replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is $O(n)$ in the worst case.\n",
-        "\n",
-        "3. **Additional Variables:** The code uses a few additional variables, such as `dummy` and `tail`, but these occupy a constant amount of space and don't depend on the input size.\n",
-        "\n",
-        "   Therefore, the overall space complexity of the code is $O(n)$, where n is the total number of nodes across all lists.\n",
-        "\n",
-        "In summary, the code's time complexity is $O(n * log(k))$, and its space complexity is $O(n)$. This code efficiently merges $k$ sorted linked lists using a divide-and-conquer approach with a relatively low space overhead."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/06. Linked List/README.md b/docs/06. Linked List/README.md
deleted file mode 100644
index fb7b3ee..0000000
--- a/docs/06. Linked List/README.md	
+++ /dev/null
@@ -1,21 +0,0 @@
-# Linked List Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/07. Trees/100. Same Tree.ipynb b/docs/07. Trees/100. Same Tree.ipynb
deleted file mode 100644
index a270fab..0000000
--- a/docs/07. Trees/100. Same Tree.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= Node.val <= $10^4$\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time Complexity\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "## Space Complexity\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "## In summary:\n",
-        "\n",
-        "+ **Time Complexity:** $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ **Space Complexity:** $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/docs/07. Trees/102. Binary Tree Level Order Traversal.ipynb
deleted file mode 100644
index 8cb08b7..0000000
--- a/docs/07. Trees/102. Binary Tree Level Order Traversal.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 102. Binary Tree Level Order Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Level Order Traversal problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, return *the level order traversal of its nodes' values*. (i.e., from left to right, level by level).\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-1000 <= Node.val <= 1000`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def levelOrder(root):\n",
-        "    # Check if the tree is empty, if so, return an empty list.\n",
-        "    if not root:\n",
-        "        return []\n",
-        "\n",
-        "    # Initialize an empty list to store the result.\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue with the root node to perform BFS.\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Initialize an empty list to store the values of nodes at the current level.\n",
-        "        level_values = []\n",
-        "        \n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Iterate through the nodes at the current level.\n",
-        "        for _ in range(level_size):\n",
-        "            # Dequeue the front node from the queue.\n",
-        "            node = queue.pop(0)\n",
-        "            \n",
-        "            # Append the value of the current node to the level_values list.\n",
-        "            level_values.append(node.val)\n",
-        "\n",
-        "            # Enqueue the left and right children of the current node if they exist.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "        # Append the level_values list (values at the current level) to the result list.\n",
-        "        result.append(level_values)\n",
-        "\n",
-        "    # Return the final result, which is a list of lists representing level order traversal.\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a `TreeNode` class that represents a node in the binary tree. Each `TreeNode` object has a value (`val`) and two child nodes: `left` and `right`.\n",
-        "\n",
-        "2. The `levelOrder` function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.\n",
-        "\n",
-        "3. We start by checking if the input `root` is `None`, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the final result, which will be a list of lists containing node values at each level.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue will be used for breadth-first traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside the loop, we perform the following steps:\n",
-        "\n",
-        "   - We initialize an empty list called `level_values` to store the values of nodes at the current level.\n",
-        "\n",
-        "   - We determine the number of nodes at the current level by getting the length of the `queue`. This is done to process nodes level by level.\n",
-        "\n",
-        "   - We iterate through the nodes at the current level using a for loop. For each node in the current level:\n",
-        "\n",
-        "     - We dequeue (remove) the front node from the `queue`.\n",
-        "\n",
-        "     - We append the value of the dequeued node to the `level_values` list, effectively collecting the values of nodes at the current level.\n",
-        "\n",
-        "     - If the dequeued node has a left child, we enqueue the left child to the `queue`.\n",
-        "\n",
-        "     - If the dequeued node has a right child, we enqueue the right child to the `queue`.\n",
-        "\n",
-        "   - After processing all nodes at the current level, we append the `level_values` list to the `result` list. This represents the values at the current level.\n",
-        "\n",
-        "7. The loop continues until all levels have been traversed, and the `queue` becomes empty.\n",
-        "\n",
-        "8. Finally, we return the `result` list, which contains lists of node values at each level, representing the level order traversal of the binary tree.\n",
-        "\n",
-        "The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[3], [9, 20], [15, 7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "root = TreeNode(1)\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `levelOrder` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.\n",
-        "\n",
-        "In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here's how the space complexity breaks down:\n",
-        "\n",
-        "1. The `result` list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by `result` is O(N).\n",
-        "\n",
-        "2. The `queue` data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by `queue` is O(N).\n",
-        "\n",
-        "Overall, the dominant factor in terms of space complexity is the `queue`, and the space complexity is O(N).\n",
-        "\n",
-        "In summary, the function's time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reverse Level Order Traversal:** Modify the `levelOrder` function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[15, 7], [9, 20], [3]]`.\n",
-        "\n",
-        "2. **Zigzag Level Order Traversal:** Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[3], [20, 9], [15, 7]]`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/docs/07. Trees/104. Maximum Depth of Binary Tree.ipynb
deleted file mode 100644
index 213989d..0000000
--- a/docs/07. Trees/104. Maximum Depth of Binary Tree.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 104. Maximum Depth of Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `root` of a binary tree, return its maximum depth.\n",
-        "\n",
-        "A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def maxDepth(root):\n",
-        "    # Base case: If the root is None, the depth is 0.\n",
-        "    if root is None:\n",
-        "        return 0\n",
-        "    \n",
-        "    # Recursively calculate the maximum depth of the left and right subtrees.\n",
-        "    left_depth = maxDepth(root.left)\n",
-        "    right_depth = maxDepth(root.right)\n",
-        "    \n",
-        "    # Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.\n",
-        "    return max(left_depth, right_depth) + 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's go through the code step by step to understand how it works:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class to represent the nodes of the binary tree. Each node has three attributes:\n",
-        "   - `val`: the value stored in the node.\n",
-        "   - `left`: a reference to the left child node.\n",
-        "   - `right`: a reference to the right child node.\n",
-        "\n",
-        "2. The `maxDepth` function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, `root`, which is the root node of the binary tree.\n",
-        "\n",
-        "3. In the `maxDepth` function, we have a base case:\n",
-        "   - If the `root` is `None`, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.\n",
-        "\n",
-        "4. If the `root` is not `None`, we recursively calculate the maximum depth of the left and right subtrees:\n",
-        "   - We call `maxDepth` on the `root.left` to calculate the maximum depth of the left subtree and store it in the variable `left_depth`.\n",
-        "   - We call `maxDepth` on the `root.right` to calculate the maximum depth of the right subtree and store it in the variable `right_depth`.\n",
-        "\n",
-        "5. Finally, we return the maximum depth of the tree by taking the maximum of `left_depth` and `right_depth` and adding 1 to it. This is because we are counting the current level as well."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [3,9,20,null,null,15,7]\n",
-        "\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a230be4f-1f47-4919-87e3-62fc3f072d97",
-      "metadata": {},
-      "source": [
-        "In this example, we create a binary tree based on the given input `[3,9,20,null,null,15,7]` and calculate its maximum depth, which is `3`. The tree structure is as follows:\n",
-        "   ```\n",
-        "       3\n",
-        "      / \\\n",
-        "     9  20\n",
-        "       /  \\\n",
-        "      15   7\n",
-        "   ```\n",
-        "\n",
-        "So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [1,null,2]\n",
-        "\n",
-        "root = TreeNode(1)\n",
-        "root.right = TreeNode(2)\n",
-        "\n",
-        "# Calculate the maximum depth of the tree and print the result\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the `maxDepth` function is $O(N)$, where $N$ is the number of nodes in the binary tree.\n",
-        "- This is because in the worst case, the function visits every node exactly once in a depth-first manner.\n",
-        "- The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the `maxDepth` function is $O(H)$, where H is the height of the binary tree.\n",
-        "- In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.\n",
-        "- In the best case, if the binary tree is perfectly balanced, the height is $O(log\\ N)$, where $N$ is the number of nodes.\n",
-        "- Therefore, the space complexity can vary from $O(log\\ N)$ to $O(N)$ depending on the shape of the tree.\n",
-        "- In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity of the code is $O(N)$ as it visits each node once.\n",
-        "- The space complexity is $O(H)$, where H is the height of the tree, which can vary from $O(log\\ N)$ to $O(N)$ depending on the tree's shape."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/docs/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
deleted file mode 100644
index 31c9e69..0000000
--- a/docs/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb	
+++ /dev/null
@@ -1,313 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 105. Construct Binary Tree from Preorder and Inorder Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return *the binary tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= preorder.length <= 3000`\n",
-        "- `inorder.length == preorder.length`\n",
-        "- `-3000 <= preorder[i], inorder[i] <= 3000`\n",
-        "- `preorder` and `inorder` consist of **unique** values.\n",
-        "- Each value of `inorder` also appears in `preorder`.\n",
-        "- `preorder` is **guaranteed** to be the preorder traversal of the tree.\n",
-        "- `inorder` is **guaranteed** to be the inorder traversal of the tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def buildTree(preorder, inorder):\n",
-        "    if not preorder:\n",
-        "        return None\n",
-        "\n",
-        "    # The first element in the preorder traversal is the root of the current subtree\n",
-        "    root_val = preorder[0]\n",
-        "    root = TreeNode(root_val)\n",
-        "\n",
-        "    # Find the index of the root value in the inorder traversal\n",
-        "    root_idx_inorder = inorder.index(root_val)\n",
-        "\n",
-        "    # Recursively build left and right subtrees\n",
-        "    root.left = buildTree(preorder[1:1 + root_idx_inorder], inorder[:root_idx_inorder])\n",
-        "    root.right = buildTree(preorder[1 + root_idx_inorder:], inorder[root_idx_inorder + 1:])\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:`: This is a class definition for a binary tree node. It has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "   This class is used to create instances of binary tree nodes, which will be used to build the binary tree.\n",
-        "\n",
-        "2. `def buildTree(preorder, inorder):`: This is the main function that constructs a binary tree from its preorder and inorder traversals.\n",
-        "\n",
-        "   - `preorder`: A list representing the preorder traversal of the binary tree.\n",
-        "   - `inorder`: A list representing the inorder traversal of the binary tree.\n",
-        "\n",
-        "3. `if not preorder: return None`: This line checks if the `preorder` list is empty. If it is, it means there are no nodes to construct, so the function returns `None`.\n",
-        "\n",
-        "4. `root_val = preorder[0]`: The value of the root node is extracted from the first element of the `preorder` list.\n",
-        "\n",
-        "5. `root = TreeNode(root_val)`: A new `TreeNode` object is created with the `root_val` as its value. This represents the root of the current subtree.\n",
-        "\n",
-        "6. `root_idx_inorder = inorder.index(root_val)`: The index of the `root_val` in the `inorder` list is found. This index indicates the position of the root node in the inorder traversal.\n",
-        "\n",
-        "7. `root.left`: The left subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The left subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists up to the `root_idx_inorder`.\n",
-        "\n",
-        "8. `root.right`: The right subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The right subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists starting from `root_idx_inorder + 1`.\n",
-        "\n",
-        "9. Finally, the function returns the `root` of the subtree it just constructed.\n",
-        "\n",
-        "The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "2d82857b-4fbe-474f-bf33-17b55c20147b",
-      "metadata": {},
-      "source": [
-        "## Helper Function \n",
-        "\n",
-        "Here is a helper function to represent the binary tree elements."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "13e6f3e1-659d-479d-9521-75629b8c782f",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def treeToList(root):\n",
-        "    # Initialize an empty list to store the elements of the binary tree\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue for level-order traversal starting with the root\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Pop the front node from the queue\n",
-        "        node = queue.pop(0)\n",
-        "        \n",
-        "        # If the node is not None (i.e., a valid node), add its value to the result list\n",
-        "        if node:\n",
-        "            result.append(node.val)\n",
-        "            \n",
-        "            # Add the left and right children of the node to the queue\n",
-        "            queue.append(node.left)\n",
-        "            queue.append(node.right)\n",
-        "        else:\n",
-        "            # If the node is None, add None to the result to represent an empty node\n",
-        "            result.append(None)\n",
-        "\n",
-        "    # Remove any trailing None values from the result list\n",
-        "    while result and result[-1] is None:\n",
-        "        result.pop()\n",
-        "\n",
-        "    # Return the resulting list representing the binary tree elements\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86cd4c9d-a120-4dd1-a1bd-530436012574",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's break down the `treeToList` helper function step by step:\n",
-        "\n",
-        "1. `def treeToList(root):`: This function takes the root of a binary tree as input and converts it into a list.\n",
-        "\n",
-        "2. `result = []`: Initialize an empty list called `result` to store the elements of the binary tree in list format.\n",
-        "\n",
-        "3. `queue = [root]`: Initialize a queue data structure for a level-order traversal, starting with the root node.\n",
-        "\n",
-        "4. `while queue:`: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.\n",
-        "\n",
-        "5. `node = queue.pop(0)`: Dequeue the first node from the queue, effectively processing it.\n",
-        "\n",
-        "6. `if node:`: Check if the `node` is not None, which means it's a valid node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(node.val)`: If the node is valid, append its value (`node.val`) to the `result` list. This represents the value of the current node in the binary tree.\n",
-        "\n",
-        "    b. `queue.append(node.left)`: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.\n",
-        "\n",
-        "    c. `queue.append(node.right)`: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.\n",
-        "\n",
-        "7. `else:`: If the `node` is None, it represents an empty node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(None)`: Append `None` to the `result` list to indicate an empty node.\n",
-        "\n",
-        "8. `while result and result[-1] is None:`: After the traversal is complete, there might be trailing `None` values in the `result` list. This loop removes any such trailing `None` values to ensure a clean representation of the tree's elements.\n",
-        "\n",
-        "9. `return result`: Return the `result` list, which now contains the elements of the binary tree in a format where `None` represents empty nodes and the order of elements reflects a level-order traversal of the tree.\n",
-        "\n",
-        "In summary, the `treeToList` function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node's value or represents an empty node with `None`. This list represents the binary tree's elements in a structured format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[3, 9, 20, None, None, 15, 7]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "preorder = [3, 9, 20, 15, 7]\n",
-        "inorder = [9, 3, 15, 20, 7]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[-1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "preorder = [-1]\n",
-        "inorder = [-1]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `buildTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of the `buildTree` function can be analyzed in terms of the number of nodes in the binary tree. Let's assume there are `n` nodes in the binary tree.\n",
-        "\n",
-        "1. Finding the root value in the `preorder` traversal takes O(1) time as it's just extracting the first element from the list.\n",
-        "2. Finding the index of the root value in the `inorder` traversal using `inorder.index(root_val)` takes O(n) time in the worst case because in the worst case, it might have to search through all `n` elements in the `inorder` list to find the index.\n",
-        "3. The recursive calls to `buildTree` for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.\n",
-        "\n",
-        "The total time complexity of the `buildTree` function is O(n) due to the recursive calls and finding the root's index in the `inorder` list.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the space used by the function's call stack during recursion and any additional data structures used. \n",
-        "\n",
-        "1. The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.\n",
-        "\n",
-        "2. Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).\n",
-        "\n",
-        "Overall, the space complexity of the `buildTree` function is O(n) due to the space used by the call stack and the TreeNode objects.\n",
-        "\n",
-        "In summary, the time complexity of `buildTree` is O(n), and the space complexity is O(n), where 'n' is the number of nodes in the binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Construct Binary Tree from Postorder and Inorder Traversal:**\n",
-        "   Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to `buildTree` but for postorder and inorder traversals.\n",
-        "\n",
-        "2. **Reconstruct Binary Tree with Duplicate Values:**\n",
-        "   Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/docs/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
deleted file mode 100644
index 59d8e7d..0000000
--- a/docs/07. Trees/124. Binary Tree Maximum Path Sum.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 124. Binary Tree Maximum Path Sum\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n",
-        "\n",
-        "---\n",
-        "A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.\n",
-        "\n",
-        "The **path sum** of a path is the sum of the node's values in the path.\n",
-        "\n",
-        "Given the `root` of a binary tree, return *the maximum **path sum** of any **non-empty** path*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 3*10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.\n",
-        "\n",
-        "In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.\n",
-        "\n",
-        "To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:\n",
-        "\n",
-        "1. Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.\n",
-        "\n",
-        "2. Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.\n",
-        "\n",
-        "To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.\n",
-        "\n",
-        "Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.\n",
-        "\n",
-        "The constraints for this problem include:\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[1, 3 * 10^4]$.\n",
-        "- Node values are in the range [-1000, 1000].\n",
-        "\n",
-        "By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def maxPathSum(self, root):\n",
-        "        def max_path_sum_helper(node):\n",
-        "            if not node:\n",
-        "                return 0\n",
-        "            \n",
-        "            # Recursively calculate the maximum path sum for left and right subtrees\n",
-        "            left_max = max(0, max_path_sum_helper(node.left))\n",
-        "            right_max = max(0, max_path_sum_helper(node.right))\n",
-        "            \n",
-        "            # Update the global maximum path sum\n",
-        "            self.max_sum = max(self.max_sum, left_max + right_max + node.val)\n",
-        "            \n",
-        "            # Return the maximum path sum starting from the current node\n",
-        "            return max(left_max, right_max) + node.val\n",
-        "        \n",
-        "        self.max_sum = float('-inf')  # Initialize the global maximum to negative infinity\n",
-        "        max_path_sum_helper(root)  # Start the recursive traversal from the root\n",
-        "        return self.max_sum"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code starts by defining a `TreeNode` class to represent nodes in the binary tree. Each `TreeNode` has a `val` attribute representing its value, a `left` attribute pointing to the left child, and a `right` attribute pointing to the right child.\n",
-        "\n",
-        "2. Next, a `Solution` class is defined to contain the `maxPathSum` method, which will be used to find the maximum path sum in the binary tree.\n",
-        "\n",
-        "3. Within the `maxPathSum` method, a helper function called `max_path_sum_helper` is defined. This recursive function takes a single argument, `node`, which is the current node being considered during traversal.\n",
-        "\n",
-        "4. Inside the `max_path_sum_helper` function:\n",
-        "   - If `node` is `None` (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.\n",
-        "   - It calculates the maximum path sum starting from the left subtree (`left_max`) and the right subtree (`right_max`). Importantly, it uses `max(0, ...)` to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree's path sum is negative, it's better to not include it in the path.\n",
-        "   - The code then updates the global maximum path sum (`self.max_sum`) by checking if the sum of `left_max`, `right_max`, and the current node's value is greater than the current maximum.\n",
-        "   - Finally, it returns the maximum path sum starting from the current node, which is the maximum of `left_max` and `right_max` plus the current node's value.\n",
-        "\n",
-        "5. Before calling the `max_path_sum_helper` function, the `max_sum` attribute of the `Solution` class is initialized to negative infinity (`float('-inf')`). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of `max_sum`.\n",
-        "\n",
-        "6. The `max_path_sum_helper` function is called with the root of the binary tree, effectively starting the traversal from the root node.\n",
-        "\n",
-        "7. Once the traversal is complete, the method returns the value of `self.max_sum`, which contains the maximum path sum found in the binary tree.\n",
-        "\n",
-        "8. Example usage at the bottom of the code demonstrates how to create binary trees and use the `maxPathSum` method to find the maximum path sum for two different tree structures.\n",
-        "\n",
-        "In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "solution = Solution()\n",
-        "print(solution.maxPathSum(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "42\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(-10)\n",
-        "root2.left = TreeNode(9)\n",
-        "root2.right = TreeNode(20)\n",
-        "root2.right.left = TreeNode(15)\n",
-        "root2.right.right = TreeNode(7)\n",
-        "print(solution.maxPathSum(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.\n",
-        "- During the traversal, for each node, we perform constant time operations, such as updating the `max_sum` variable and calculating the maximum path sum starting from that node.\n",
-        "- Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity of the code is determined by the space used in the call stack during the recursive traversal.\n",
-        "- In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).\n",
-        "- Additionally, the code uses a constant amount of space for variables like `left_max`, `right_max`, and `max_sum`.\n",
-        "- Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it's O(N), and in the best case (a balanced binary tree), it's O(log N).\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree's balance."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Print the Maximum Path:**\n",
-        "   Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.\n",
-        "\n",
-        "2. **Path Sum Count:**\n",
-        "   Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/199. Binary Tree Right Side View.ipynb b/docs/07. Trees/199. Binary Tree Right Side View.ipynb
deleted file mode 100644
index 55dc944..0000000
--- a/docs/07. Trees/199. Binary Tree Right Side View.ipynb	
+++ /dev/null
@@ -1,257 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 199. Binary Tree Right Side View\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Right Side View problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-right-side-view/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return *the values of the nodes you can see ordered from top to bottom*.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def rightSideView(root):\n",
-        "    if not root:\n",
-        "        return []  # If the tree is empty, return an empty list.\n",
-        "\n",
-        "    result = []  # Initialize a list to store the right side view values.\n",
-        "    queue = [root]  # Initialize a queue for level-order traversal with the root node.\n",
-        "\n",
-        "    while queue:\n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Traverse all nodes at the current level and add the rightmost node to the result.\n",
-        "        for i in range(level_size):\n",
-        "            node = queue.pop(0)  # Dequeue the first node from the queue.\n",
-        "\n",
-        "            # If it's the rightmost node at this level, add its value to the result.\n",
-        "            if i == level_size - 1:\n",
-        "                result.append(node.val)\n",
-        "\n",
-        "            # Add the children of the current node to the queue.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "    return result  # Return the list of right side view values.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with a binary tree represented using a TreeNode class. Each node has a value (`val`) and can have a left child (`left`) and a right child (`right`).\n",
-        "\n",
-        "2. The `rightSideView` function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.\n",
-        "\n",
-        "3. We check if the `root` is `None`, which means the tree is empty. If it's empty, we return an empty list because there are no nodes to see.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the right side view values.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue is used for a level-order traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside this loop, we perform the following steps for each level of the tree:\n",
-        "\n",
-        "   a. We determine the number of nodes at the current level by getting the length of the `queue`. This is important for processing nodes at the same level together.\n",
-        "\n",
-        "   b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the `queue` using `queue.pop(0)`.\n",
-        "\n",
-        "   c. If the node we dequeue is the rightmost node at the current level (determined by `i == level_size - 1`), we add its `val` to the `result` list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.\n",
-        "\n",
-        "   d. We enqueue the left and right children of the current node (if they exist) to the `queue`. This ensures that we process the next level in the subsequent iterations of the while loop.\n",
-        "\n",
-        "7. After processing all levels of the tree, the `result` list contains the values of the rightmost nodes in each level, ordered from top to bottom.\n",
-        "\n",
-        "8. Finally, we return the `result` list as the output of the function, which represents the right side view of the binary tree.\n",
-        "\n",
-        "The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3, 4]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "root1.left.right = TreeNode(5)\n",
-        "root1.right.right = TreeNode(4)\n",
-        "print(rightSideView(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "print(rightSideView(root2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = rightSideView(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here's why:\n",
-        "\n",
-        "1. We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.\n",
-        "\n",
-        "2. For each node, we perform constant-time operations like dequeuing it from the queue, checking if it's the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is also O(N). Here's why:\n",
-        "\n",
-        "1. We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).\n",
-        "\n",
-        "2. The `result` list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the `result` list is also O(N).\n",
-        "\n",
-        "3. Other auxiliary variables like `level_size`, `i`, and `node` require only constant space and do not depend on the size of the tree.\n",
-        "\n",
-        "Combining the space used by the queue and the `result` list, we get a space complexity of O(N).\n",
-        "\n",
-        "In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Variant with Left Side View**: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.\n",
-        "\n",
-        "2. **Zigzag Right Side View**: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/226. Invert Binary Tree.ipynb b/docs/07. Trees/226. Invert Binary Tree.ipynb
deleted file mode 100644
index 8ea4609..0000000
--- a/docs/07. Trees/226. Invert Binary Tree.ipynb	
+++ /dev/null
@@ -1,223 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 226: Invert Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the root of a binary tree, invert the tree, and return its root.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range `[0, 100]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def invertTree(root):\n",
-        "    # Base case: If the root is None or the tree is empty, return None.\n",
-        "    if not root:\n",
-        "        return None\n",
-        "\n",
-        "    # Swap the left and right subtrees of the current node.\n",
-        "    root.left, root.right = root.right, root.left\n",
-        "\n",
-        "    # Recursively invert the left and right subtrees.\n",
-        "    invertTree(root.left)\n",
-        "    invertTree(root.right)\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `invertTree` function is defined to invert the binary tree. It takes the root node of the tree as an argument.\n",
-        "\n",
-        "3. In the `invertTree` function, we have a base case to handle the scenario when the root is `None` (empty tree). In such cases, we return `None` because there's nothing to invert.\n",
-        "\n",
-        "4. For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.\n",
-        "\n",
-        "5. We then recursively call `invertTree` on the left and right subtrees to invert them.\n",
-        "\n",
-        "6. Finally, we return the root of the inverted tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 1): <__main__.TreeNode object at 0x270c9c0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [4,2,7,1,3,6,9]\n",
-        "\n",
-        "root1 = TreeNode(4)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(7)\n",
-        "root1.left.left = TreeNode(1)\n",
-        "root1.left.right = TreeNode(3)\n",
-        "root1.right.left = TreeNode(6)\n",
-        "root1.right.right = TreeNode(9)\n",
-        "\n",
-        "inverted_root1 = invertTree(root1)\n",
-        "print(\"Inverted Tree (Example 1):\", inverted_root1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inorder Traversal of Inverted Tree (Example 2): <__main__.TreeNode object at 0x2255fc0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [2,1,3]\n",
-        "\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "\n",
-        "inverted_root2 = invertTree(root2)\n",
-        "print(\"Inverted Tree (Example 2):\", inverted_root2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 3): None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: root = []\n",
-        "\n",
-        "root3 = None  # Empty tree\n",
-        "\n",
-        "inverted_root3 = invertTree(root3)\n",
-        "print(\"Inverted Tree (Example 3):\", inverted_root3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the provided Python code to invert a binary tree.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the `invertTree` function is $O(n)$, where $n$ is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.\n",
-        "\n",
-        "The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is $O(h)$, where $h$ is the height of the binary tree. \n",
-        "\n",
-        "In a completely unbalanced binary tree (essentially a linked list), the height $h$ is equal to the number of nodes $n$, resulting in a space complexity of $O(n)$. This occurs when the tree is skewed to one side.\n",
-        "\n",
-        "In a balanced binary tree, such as a full binary tree, the height $h$ is $O(log\\ n)$, and the space complexity is $O(log\\ n)$.\n",
-        "\n",
-        "The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to $O(log\\ n)$.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- Time Complexity: $O(n)$ where $n$ is the number of nodes.\n",
-        "- Space Complexity: $O(h)$, where $h$ is the height of the binary tree. In the worst case, it can be $O(n)$, and in a balanced tree, it is $O(log\\ n)$.\n",
-        "\n",
-        "Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with $O(1)$ space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/230. Kth Smallest Element in a BST.ipynb b/docs/07. Trees/230. Kth Smallest Element in a BST.ipynb
deleted file mode 100644
index 673ced2..0000000
--- a/docs/07. Trees/230. Kth Smallest Element in a BST.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 230. Kth Smallest Element in a BST\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Smallest Element in a BST problem on LeetCode, click here!](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary search tree, and an integer `k`, return *the $k^{th}$ smallest value (**1-indexed**) of all the values of the nodes in the tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is `n`.\n",
-        "- 1 <= `k <= n` <= $10^4$\n",
-        "- 0 <= `Node.val` <= $10^4$\n",
-        "\n",
-        "**Follow up**: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def kthSmallest(root, k):\n",
-        "    stack = []  # Initialize an empty stack to simulate the traversal\n",
-        "    while root or stack:\n",
-        "        while root:\n",
-        "            stack.append(root)  # Push the current node onto the stack\n",
-        "            root = root.left  # Move to the left child\n",
-        "        root = stack.pop()  # Pop a node from the stack\n",
-        "        k -= 1  # Decrement k since we've visited a node\n",
-        "        if k == 0:\n",
-        "            return root.val  # If k becomes 0, return the current node's value as the kth smallest\n",
-        "        root = root.right  # Move to the right child to continue the traversal"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in the binary search tree (BST). Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `kthSmallest` function takes two parameters: `root`, which is the root of the BST, and `k`, which represents the kth smallest element we want to find.\n",
-        "\n",
-        "3. We initialize an empty stack (`stack`) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.\n",
-        "\n",
-        "4. We enter a while loop that continues until either `root` becomes `None` (indicating we have traversed the entire tree) or the `stack` is empty.\n",
-        "\n",
-        "5. Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the `stack` and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.\n",
-        "\n",
-        "6. Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the `stack` one by one. As we pop each node, we decrement `k` by 1 to keep track of the number of nodes we have visited.\n",
-        "\n",
-        "7. If `k` becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the `val` of the current node as the result.\n",
-        "\n",
-        "8. If `k` is still greater than 0, it means we haven't found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.\n",
-        "\n",
-        "9. The process continues until we find the kth smallest element or traverse the entire tree.\n",
-        "\n",
-        "10. Finally, we return the kth smallest element found.\n",
-        "\n",
-        "The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: root = [3,1,4,null,2], k = 1\n",
-        "root1 = TreeNode(3)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(4)\n",
-        "root1.left.right = TreeNode(2)\n",
-        "k1 = 1\n",
-        "print(kthSmallest(root1, k1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(3)\n",
-        "root2.right = TreeNode(6)\n",
-        "root2.left.left = TreeNode(2)\n",
-        "root2.left.right = TreeNode(4)\n",
-        "root2.left.left.left = TreeNode(1)\n",
-        "k2 = 3\n",
-        "print(kthSmallest(root2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is O(h + k), where:\n",
-        "- h is the height of the binary search tree (BST).\n",
-        "- k is the desired kth smallest element we want to find.\n",
-        "\n",
-        "1. In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).\n",
-        "\n",
-        "2. In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).\n",
-        "\n",
-        "So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.\n",
-        "\n",
-        "1. In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.\n",
-        "\n",
-        "2. In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.\n",
-        "\n",
-        "So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.\n",
-        "\n",
-        "In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Largest Element**: Modify the code to find the kth largest element in the BST instead of the kth smallest element.\n",
-        "\n",
-        "2. **Kth Smallest Element in Two BSTs**: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/docs/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
deleted file mode 100644
index 666bcd9..0000000
--- a/docs/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 235. Lowest Common Ancestor of a Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.\n",
-        "\n",
-        "According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes `p` and `q` as the lowest node in `T` that has both `p` and `q` as descendants (where we allow **a node to be a descendant of itself**).”\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[2, 10^5]$.\n",
-        "- $-10^9$ <= `Node.val` <= $10^9$\n",
-        "- All `Node.val` are **unique**.\n",
-        "- `p != q`\n",
-        "- `p` and `q` will exist in the BST.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def lowestCommonAncestor(root, p, q):\n",
-        "    # Ensure p is less than q\n",
-        "    if p.val > q.val:\n",
-        "        p, q = q, p\n",
-        "\n",
-        "    while root:\n",
-        "        # If the current node value is greater than both p and q, move left\n",
-        "        if root.val > q.val:\n",
-        "            root = root.left\n",
-        "        # If the current node value is less than both p and q, move right\n",
-        "        elif root.val < p.val:\n",
-        "            root = root.right\n",
-        "        # If the current node value is between p and q (inclusive), or it matches either p or q, it's the LCA\n",
-        "        else:\n",
-        "            return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:` defines a simple class for representing nodes in a binary tree. Each `TreeNode` has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "2. `def lowestCommonAncestor(root, p, q):` is a function that takes three arguments:\n",
-        "   - `root`: The root node of the BST.\n",
-        "   - `p`: A TreeNode representing one of the nodes for which we want to find the LCA.\n",
-        "   - `q`: A TreeNode representing the other node for which we want to find the LCA.\n",
-        "\n",
-        "3. `if p.val > q.val:` checks if the value of `p` is greater than the value of `q`. In a BST, it's essential to ensure that `p` represents the smaller value, and `q` represents the larger value. If `p` is greater than `q`, the code swaps their values.\n",
-        "\n",
-        "4. The main logic is inside the `while` loop, which runs until `root` becomes `None`. It performs the following steps to find the LCA:\n",
-        "   - If the current `root` node's value is greater than the value of `q`, it means both `p` and `q` are on the left subtree of the current node. So, we move to the left child of the current node by setting `root = root.left`.\n",
-        "   - If the current `root` node's value is less than the value of `p`, it means both `p` and `q` are on the right subtree of the current node. So, we move to the right child of the current node by setting `root = root.right`.\n",
-        "   - If neither of the above conditions is met, it means the current `root` node's value is between `p` and `q`, or it matches either `p` or `q`. In this case, the current node is the lowest common ancestor (LCA), so we return `root`.\n",
-        "\n",
-        "The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of `p`, `q`, and the current `root` node. Eventually, it reaches the LCA node, and that node is returned as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(6)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(8)\n",
-        "root.left.left = TreeNode(0)\n",
-        "root.left.right = TreeNode(4)\n",
-        "root.right.left = TreeNode(7)\n",
-        "root.right.right = TreeNode(9)\n",
-        "root.left.right.left = TreeNode(3)\n",
-        "root.left.right.right = TreeNode(5)\n",
-        "\n",
-        "p = root.left  # Node 2\n",
-        "q = root.right  # Node 8\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "p = root.left  # Node 2\n",
-        "q = root.left.right  # Node 4\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "\n",
-        "p = root2  # Node 2\n",
-        "q = root2.left  # Node 1\n",
-        "\n",
-        "result = lowestCommonAncestor(root2, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this algorithm is O(h), where \"h\" is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where \"n\" is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).\n",
-        "\n",
-        "The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes `p` and `q`. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are `root`, `p`, and `q`, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.\n",
-        "\n",
-        "**In summary**, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where \"h\" is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "### Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple LCAs:** Extend the algorithm to find all the lowest common ancestors of two given nodes `p` and `q` in a BST. In some cases, there can be multiple LCAs.\n",
-        "\n",
-        "2. **LCA with k Nodes:** Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/docs/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
deleted file mode 100644
index 75c48ea..0000000
--- a/docs/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb	
+++ /dev/null
@@ -1,297 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 297. Serialize and Deserialize Binary Tree\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.\n",
-        "\n",
-        "Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.\n",
-        "\n",
-        "**Clarification:** The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.\n",
-        "\n",
-        "In the context of this problem:\n",
-        "\n",
-        "1. **Serialization**: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.\n",
-        "\n",
-        "2. **Deserialization**: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.\n",
-        "\n",
-        "Here are some key points to consider in solving this problem:\n",
-        "\n",
-        "- The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].\n",
-        "- You don't necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.\n",
-        "- The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.\n",
-        "\n",
-        "A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode(object):\n",
-        "    def __init__(self, x):\n",
-        "        self.val = x\n",
-        "        self.left = None\n",
-        "        self.right = None\n",
-        "\n",
-        "class Codec:\n",
-        "    def serialize(self, root):\n",
-        "        serialized  = []\n",
-        "\n",
-        "        def dfs(node):\n",
-        "            if not node:\n",
-        "                # If the node is None, represent it as \"Null\" in the serialized string\n",
-        "                serialized .append(\"Null\")\n",
-        "                return\n",
-        "            # Convert the node's value to a string and add it to the serialized string\n",
-        "            serialized .append(str(node.val))\n",
-        "            dfs(node.left)\n",
-        "            dfs(node.right)\n",
-        "\n",
-        "        dfs(root)\n",
-        "        # Join the serialized values with \",\"\n",
-        "        return \",\".join(serialized )\n",
-        "\n",
-        "    def deserialize(self, data):\n",
-        "        vals = data.split(\",\")\n",
-        "        self.i = 0\n",
-        "\n",
-        "        def dfs():\n",
-        "            if vals[self.i] == \"Null\":\n",
-        "                self.i += 1\n",
-        "                return None\n",
-        "            # Convert the value to an integer to create a new node\n",
-        "            node = TreeNode(int(vals[self.i]))\n",
-        "            self.i += 1\n",
-        "            node.left = dfs()\n",
-        "            node.right = dfs()\n",
-        "            return node\n",
-        "\n",
-        "        return dfs()"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. **Definition of TreeNode**:\n",
-        "   - The code defines a simple `TreeNode` class that represents a node in a binary tree. Each `TreeNode` has three attributes:\n",
-        "     - `val`: The integer value stored in the node.\n",
-        "     - `left`: A reference to the left child node (or None if there is no left child).\n",
-        "     - `right`: A reference to the right child node (or None if there is no right child).\n",
-        "   - This class allows you to create binary tree nodes with integer values and left and right child references.\n",
-        "\n",
-        "2. **Serialization (serialize method)**:\n",
-        "   - The `serialize` method takes a `root` node as input, which is the root of the binary tree that needs to be serialized.\n",
-        "   - It initializes an empty list `serialized` to store the serialized elements.\n",
-        "   - The `dfs` (depth-first search) function is defined within the `serialize` method to perform a preorder traversal of the binary tree.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current `node` is `None` (i.e., a leaf node or a child of a leaf node), it appends the string \"Null\" to the `serialized` list to represent the absence of a node.\n",
-        "     - If the current `node` is not `None`, it appends the string representation of the `node.val` to the `serialized` list and then recursively calls `dfs` on the left and right children.\n",
-        "   - After the `dfs` traversal, the `serialized` list contains the serialized binary tree elements.\n",
-        "   - The method returns a string obtained by joining the elements in the `serialized` list with commas.\n",
-        "\n",
-        "3. **Deserialization (deserialize method)**:\n",
-        "   - The `deserialize` method takes a serialized string `data` as input, which represents a binary tree in the custom format.\n",
-        "   - It splits the `data` string by commas to obtain a list of elements called `vals`.\n",
-        "   - The method initializes an index `self.i` to 0. This index keeps track of the current position in the `vals` list during deserialization.\n",
-        "   - The `dfs` function is defined within the `deserialize` method to perform the deserialization process using a recursive approach.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current element in `vals` is \"Null,\" it means there is no node at this position in the binary tree, so it returns `None`.\n",
-        "     - If the current element is not \"Null,\" it converts the element to an integer to create a new `TreeNode` with that value.\n",
-        "     - It then recursively calls `dfs` to set the left and right children of the current node.\n",
-        "   - The method returns the root node of the reconstructed binary tree.\n",
-        "\n",
-        "Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1,2,Null,Null,3,4,Null,Null,5,Null,Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = TreeNode(1)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(3)\n",
-        "root.right.left = TreeNode(4)\n",
-        "root.right.right = TreeNode(5)\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = None\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:\n",
-        "\n",
-        "1. **Serialization (serialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `serialize` method uses a depth-first traversal (preorder) of the binary tree.\n",
-        "     - It visits each node exactly once.\n",
-        "     - At each node, it performs constant-time operations (string conversion and list append).\n",
-        "     - Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for serialization includes the space used by the `serialized` list and the recursive call stack.\n",
-        "     - The `serialized` list stores the serialized elements, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "2. **Deserialization (deserialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `deserialize` method splits the serialized string into a list of elements, which takes O(N) time.\n",
-        "     - The `dfs` function is a recursive function that visits each element in the list exactly once.\n",
-        "     - At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).\n",
-        "     - Therefore, the time complexity for deserialization is O(N).\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for deserialization includes the space used by the `vals` list and the recursive call stack.\n",
-        "     - The `vals` list stores the elements from the serialized string, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Efficient Serialization**:\n",
-        "   Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.\n",
-        "\n",
-        "2. **Custom Serialization Format**:\n",
-        "   Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/572. Subtree of Another Tree.ipynb b/docs/07. Trees/572. Subtree of Another Tree.ipynb
deleted file mode 100644
index 8a41c3b..0000000
--- a/docs/07. Trees/572. Subtree of Another Tree.ipynb	
+++ /dev/null
@@ -1,265 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 572: Subtree of Another Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Subtree of Another Tree problem on LeetCode, click here!](https://leetcode.com/problems/subtree-of-another-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "**Problem Description:**\n",
-        "\n",
-        "Given the roots of two binary trees `root` and `subRoot`, return `True` if there is a subtree of `root` with the same structure and node values as `subRoot`, and `False` otherwise.\n",
-        "\n",
-        "A subtree of a binary tree `tree` is a tree that consists of a node in `tree` and all of this node's descendants. The tree `tree` could also be considered as a subtree of itself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "1. The number of nodes in the `root` tree is in the range $[1, 2000]$.\n",
-        "2. The number of nodes in the `subRoot` tree is in the range $[1, 1000]$.\n",
-        "3. $-10^4$ <= root.val <= $10^4$\n",
-        "4. $-10^4$ <= subRoot.val <= $10^4$\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def isSubtree(self, root, subRoot):\n",
-        "        if not root:\n",
-        "            return False\n",
-        "        \n",
-        "        # Check if the current subtree is equal to the subRoot\n",
-        "        if self.isSameTree(root, subRoot):\n",
-        "            return True\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees\n",
-        "        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)\n",
-        "    \n",
-        "    def isSameTree(self, tree1, tree2):\n",
-        "        if not tree1 and not tree2:\n",
-        "            return True\n",
-        "        if not tree1 or not tree2:\n",
-        "            return False\n",
-        "        \n",
-        "        return (\n",
-        "            tree1.val == tree2.val and\n",
-        "            self.isSameTree(tree1.left, tree2.left) and\n",
-        "            self.isSameTree(tree1.right, tree2.right)\n",
-        "        )"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:\n",
-        "\n",
-        "1. `isSubtree`: This method checks if there is a subtree of the `root` tree with the same structure and node values as the `subRoot` tree. It uses a helper function `isSameTree` to compare two trees for equality.\n",
-        "\n",
-        "2. `isSameTree`: This helper method recursively compares two trees to check if they are the same in structure and node values.\n",
-        "\n",
-        "### Here's a detailed explanation of the code:\n",
-        "\n",
-        "1. **TreeNode Class:**\n",
-        "\n",
-        "The `TreeNode` class is defined to represent nodes in a binary tree. Each node has a `val` (the node's value) and may have a `left` and `right` child.\n",
-        "\n",
-        "2. **Solution Class:**\n",
-        "\n",
-        "    + The `Solution` class contains the solution for the problem and defines two important methods:\n",
-        "\n",
-        "    + `isSubtree(self, root, subRoot)`:\n",
-        "\n",
-        "        - This method checks whether `subRoot` is a subtree of `root`. It takes two tree nodes, `root` and `subRoot`, as input arguments.\n",
-        "        - If `root` is `None`, it returns `False` because there is no subtree to search.\n",
-        "        - It then checks if the current subtree with `root` as its root is equal to `subRoot` using the `isSameTree` method. If they are the same, it returns `True`.\n",
-        "        - If the current subtree is not the same as `subRoot`, it recursively checks the left and right subtrees of `root` to see if `subRoot` is a subtree of any of them.\n",
-        "        - It returns `True` if `subRoot` is found in either the left or right subtree; otherwise, it returns `False`.\n",
-        "\n",
-        "    + `isSameTree(self, tree1, tree2)`:\n",
-        "\n",
-        "        - This method checks whether two trees, `tree1` and `tree2`, are the same.\n",
-        "        - If both `tree1` and `tree2` are `None`, they are considered the same tree, so it returns `True`.\n",
-        "        - If only one of them is `None` (but not both), they are different trees, so it returns `False`.\n",
-        "        - If both `tree1` and `tree2` have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.\n",
-        "        - It returns `True` if the trees are the same; otherwise, it returns `False`.\n",
-        "\n",
-        "The code effectively uses recursion to traverse the binary trees and check for subtree equality. The `isSubtree` method starts the recursive search, and the `isSameTree` method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.\n",
-        "\n",
-        "This solution allows you to determine if there exists a subtree within the `root` tree that matches the structure and node values of `subRoot`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? True\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2]\n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? False\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2,null,null,null,null,0] \n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "root.left.right.left = TreeNode(0)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86a34f0d-0789-498c-818c-2d30f84754d0",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code for the \"Subtree of Another Tree\" problem:\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the `isSubtree` and `isSameTree` functions, we visit each node in the binary trees once. Let's break down the time complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - In the worst case, we need to visit every node in the `root` tree.\n",
-        "   - For each node in the `root` tree, we call the `isSameTree` function, which has its own traversal.\n",
-        "   - So, the total time complexity is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - In the worst case, we visit every node in both `tree1` and `tree2`.\n",
-        "   - The number of recursive calls made is proportional to the number of nodes in the trees.\n",
-        "   - So, the time complexity of this function is $O(max(n, m))$, where $n$ and $m$ are the numbers of nodes in `tree1` and `tree2`, respectively.\n",
-        "\n",
-        "Overall, the time complexity of the entire code is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree. In practice, it may be less than $O(n * m)$ if a subtree mismatch is detected early during the traversal.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let's analyze the space complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - It uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `root` tree, which can be $O(n)$ in the worst case (unbalanced tree).\n",
-        "   - Additionally, the function doesn't use any significant extra space other than the recursion stack.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - It also uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `tree1` or `tree2`, whichever is greater.\n",
-        "   - So, the maximum space used for the call stack is $O(max(n, m))$.\n",
-        "\n",
-        "In summary, the space complexity of the code is $O(max(n, m))$ due to the function call stack. It scales with the maximum height of the trees being compared.\n",
-        "\n",
-        "Overall, the code is efficient and works well for trees with moderate sizes. However, it's important to keep in mind that the worst-case time complexity is $O(n * m)$, so for very large trees, the performance may degrade."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/98. Validate Binary Search Tree.ipynb b/docs/07. Trees/98. Validate Binary Search Tree.ipynb
deleted file mode 100644
index ad86882..0000000
--- a/docs/07. Trees/98. Validate Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 98. Validate Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Validate Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/validate-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, *determine if it is a valid binary search tree (BST)*.\n",
-        "\n",
-        "A **valid BST** is defined as follows:\n",
-        "\n",
-        "- The left subtree of a node contains only nodes with keys **less than** the node's key.\n",
-        "- The right subtree of a node contains only nodes with keys **greater than** the node's key.\n",
-        "- Both the left and right subtrees must also be binary search trees. \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 10^4]$.\n",
-        "- $-2^{31}$ <= `Node.val` <= $2^{31} - 1$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def is_valid_BST(root):\n",
-        "    def is_valid(node, min_val, max_val):\n",
-        "        # Base case: If the node is None, it's a valid BST.\n",
-        "        if node is None:\n",
-        "            return True\n",
-        "        \n",
-        "        # Check if the current node's value is within the valid range.\n",
-        "        if not (min_val < node.val < max_val):\n",
-        "            return False\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees with updated ranges.\n",
-        "        return (is_valid(node.left, min_val, node.val) and\n",
-        "                is_valid(node.right, node.val, max_val))\n",
-        "    \n",
-        "    # Call the helper function starting with a wide range for root node.\n",
-        "    return is_valid(root, float('-inf'), float('inf'))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- It defines a `TreeNode` class to represent nodes in the binary tree.\n",
-        "\n",
-        "- The `is_valid_BST` function takes the root node of the binary tree as input and returns `True` if the tree is a valid BST, and `False` otherwise.\n",
-        "\n",
-        "- Inside the `is_valid_BST` function, there is a helper function called `is_valid` that performs the actual validation using a recursive approach.\n",
-        "\n",
-        "- The `is_valid` function checks each node in the tree to ensure that it satisfies the properties of a BST:\n",
-        "  - The value of the current node must be within a valid range defined by `min_val` and `max_val`.\n",
-        "  - The left subtree of the current node should contain values less than the current node's value.\n",
-        "  - The right subtree of the current node should contain values greater than the current node's value.\n",
-        "\n",
-        "- If any of these conditions are violated, the function returns `False`, indicating that the tree is not a valid BST.\n",
-        "\n",
-        "- If all nodes satisfy these conditions, the function returns `True`, indicating that the tree is a valid BST.\n",
-        "\n",
-        "- The code calls the `is_valid` function with the root node and initial range values of negative infinity to positive infinity to start the validation.\n",
-        "\n",
-        "- The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.\n",
-        "\n",
-        "- The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.\n",
-        "\n",
-        "In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node's value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: [2, 1, 3]\n",
-        "root1 = TreeNode(2)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(3)\n",
-        "print(is_valid_BST(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: [5, 1, 4, None, None, 3, 6]\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(4)\n",
-        "root2.right.left = TreeNode(3)\n",
-        "root2.right.right = TreeNode(6)\n",
-        "print(is_valid_BST(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `is_valid_BST` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the function primarily depends on the number of nodes in the binary tree.\n",
-        "- In the worst case, we may have to visit every node in the tree once to validate whether it's part of a valid BST.\n",
-        "- Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the recursive call stack during the DFS traversal.\n",
-        "- In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.\n",
-        "- In a balanced BST, the height is approximately log2(N), where N is the number of nodes.\n",
-        "- Therefore, the space complexity of the call stack is O(log N) for a balanced BST.\n",
-        "- In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.\n",
-        "\n",
-        "**Overall:**\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.\n",
-        "\n",
-        "The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Complex Constraints**: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like \"The left subtree of a node contains only nodes with keys less than or equal to the node's key,\" and \"The right subtree of a node contains only nodes with keys greater than or equal to the node's key.\" How would you adapt the code to handle these constraints?\n",
-        "\n",
-        "2. **Handling Duplicates**: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/07. Trees/README.md b/docs/07. Trees/README.md
deleted file mode 100644
index 1eba5d4..0000000
--- a/docs/07. Trees/README.md	
+++ /dev/null
@@ -1,26 +0,0 @@
-# Trees Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/docs/08. Tries/208. Implement Trie (Prefix Tree).ipynb
deleted file mode 100644
index 9da2a17..0000000
--- a/docs/08. Tries/208. Implement Trie (Prefix Tree).ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 208. Implement Trie (Prefix Tree)\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Implement Trie problem on LeetCode, click here!](https://leetcode.com/problems/implement-trie-prefix-tree/)\n",
-        "\n",
-        "---\n",
-        "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.\n",
-        "\n",
-        "Implement the Trie class:\n",
-        "\n",
-        "- `Trie()` Initializes the trie object.\n",
-        "- `void insert(String word)` Inserts the string `word` into the trie.\n",
-        "- `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.\n",
-        "- `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length, prefix.length <= 2000`\n",
-        "- `word` and `prefix` consist only of lowercase English letters.\n",
-        "- At most $3 * 10^4$ calls in total will be made to `insert`, `search`, and `startsWith`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to implement a data structure known as a Trie (pronounced \"try\") or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It's particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:\n",
-        "\n",
-        "1. `Trie()`: This is the constructor that initializes the Trie object.\n",
-        "\n",
-        "2. `void insert(String word)`: This method inserts the given string `word` into the Trie. It effectively adds the characters of the word to the Trie's structure, creating nodes for each character if they don't already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.\n",
-        "\n",
-        "3. `boolean search(String word)`: This method checks if the given string `word` is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns `true`, indicating that the word exists in the Trie; otherwise, it returns `false`.\n",
-        "\n",
-        "4. `boolean startsWith(String prefix)`: This method checks if there is any previously inserted word in the Trie that has the given `prefix`. It's similar to the `search` method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns `true`; otherwise, it returns `false`.\n",
-        "\n",
-        "The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.\n",
-        "\n",
-        "In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}           # A dictionary to store child nodes\n",
-        "        self.is_end_of_word = False  # Indicates if a word ends at this node\n",
-        "\n",
-        "class Trie:\n",
-        "    def __init__(self):\n",
-        "        self.root = TrieNode()       # Initialize the Trie with a root node\n",
-        "\n",
-        "    def insert(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                node.children[char] = TrieNode()  # Create a new node if the character is not present\n",
-        "            node = node.children[char]           # Move to the child node\n",
-        "        node.is_end_of_word = True                # Mark the end of the inserted word\n",
-        "\n",
-        "    def search(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, the word is not in the Trie\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return node.is_end_of_word    # Check if the node represents the end of a valid word\n",
-        "\n",
-        "    def startsWith(self, prefix):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in prefix:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, no word starts with the prefix\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return True                  # Prefix found in the Trie"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's explain how the code works step by step:\n",
-        "\n",
-        "1. `TrieNode` Class:\n",
-        "   - `TrieNode` is a class that represents nodes in the Trie. Each node has two attributes:\n",
-        "     - `children`: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.\n",
-        "     - `is_end_of_word`: This boolean flag indicates whether the node represents the end of a complete word. Initially, it's set to `False` for all nodes.\n",
-        "\n",
-        "2. `Trie` Class:\n",
-        "   - `Trie` is the main class that implements the Trie data structure. It has the following methods:\n",
-        "\n",
-        "   - `__init__(self)`: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.\n",
-        "\n",
-        "   - `insert(self, word)`: This method inserts a string `word` into the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not present as a child node, it creates a new node for that character.\n",
-        "     - It then moves to the child node and continues the process until the entire word is inserted.\n",
-        "     - Finally, it sets the `is_end_of_word` flag to `True` for the last node to mark the end of the inserted word.\n",
-        "\n",
-        "   - `search(self, word)`: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not found as a child node, it immediately returns `False` because the word is not in the Trie.\n",
-        "     - It continues to move to the child node for each character.\n",
-        "     - After reaching the end of the word, it checks if the `is_end_of_word` flag is `True` for the last node to confirm the presence of the word.\n",
-        "\n",
-        "   - `startsWith(self, prefix)`: This method checks if there is any previously inserted word in the Trie that starts with a given `prefix`. It follows the same logic as the `search` method but does not require the entire word to be present.\n",
-        "     - If the prefix is found in the Trie, it returns `True`; otherwise, it returns `False`.\n",
-        "\n",
-        "3. Example Usage:\n",
-        "   - The code demonstrates how to create a Trie object, insert words (\"apple\" and \"app\"), and perform operations on the Trie:\n",
-        "     - It inserts the word \"apple\" into the Trie.\n",
-        "     - It checks if \"apple\" is in the Trie, which returns `True`.\n",
-        "     - It checks if \"app\" is in the Trie, which returns `False`.\n",
-        "     - It checks if there is any word in the Trie that starts with \"app,\" which returns `True`.\n",
-        "     - It inserts the word \"app\" into the Trie.\n",
-        "     - It checks if \"app\" is in the Trie again, which now returns `True`.\n",
-        "\n",
-        "In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n",
-            "False\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "trie = Trie()\n",
-        "trie.insert(\"apple\")\n",
-        "print(trie.search(\"apple\"))   # Output: True\n",
-        "print(trie.search(\"app\"))     # Output: False\n",
-        "print(trie.startsWith(\"app\")) # Output: True\n",
-        "trie.insert(\"app\")\n",
-        "print(trie.search(\"app\"))     # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the Trie implementation:\n",
-        "\n",
-        "1. Time Complexity:\n",
-        "   - Insertion (`insert` method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.\n",
-        "   - Search (`search` method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.\n",
-        "   - Starts with (`startsWith` method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.\n",
-        "\n",
-        "   Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.\n",
-        "\n",
-        "2. Space Complexity:\n",
-        "   - The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.\n",
-        "   - Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.\n",
-        "\n",
-        "   In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.\n",
-        "\n",
-        "In summary:\n",
-        "- Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.\n",
-        "- Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Count Prefixes**:\n",
-        "   Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.\n",
-        "\n",
-        "2. **Auto-Complete Suggestions**:\n",
-        "   Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/docs/08. Tries/211. Design Add and Search Words Data Structure.ipynb
deleted file mode 100644
index 2de472c..0000000
--- a/docs/08. Tries/211. Design Add and Search Words Data Structure.ipynb	
+++ /dev/null
@@ -1,275 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 211. Design Add and Search Words Data Structure\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Design Add and Search Words Data Structure problem on LeetCode, click here!](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n",
-        "\n",
-        "---\n",
-        "Design a data structure that supports adding new words and finding if a string matches any previously added string.\n",
-        "\n",
-        "Implement the `WordDictionary` class:\n",
-        "\n",
-        "- `WordDictionary()` Initializes the object.\n",
-        "- `void addWord(word)` Adds `word` to the data structure, it can be matched later.\n",
-        "- `bool search(word)` Returns `true` if there is any string in the data structure that matches `word` or `false` otherwise. `word` may contain dots `'.'` where dots can be matched with any letter.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length <= 25`\n",
-        "- `word` in `addWord` consists of lowercase English letters.\n",
-        "- `word` in `search` consist of `'.'` or lowercase English letters.\n",
-        "- There will be at most `2` dots in `word` for `search` queries.\n",
-        "- At most $10^4$ calls will be made to `addWord` and `search`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to design a data structure called `WordDictionary` that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot ('.') can match any letter.\n",
-        "\n",
-        "Here are the specific requirements and explanations for the problem:\n",
-        "\n",
-        "1. Initialize the `WordDictionary` object using the constructor `WordDictionary()`.\n",
-        "\n",
-        "2. The `addWord(word)` method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.\n",
-        "\n",
-        "3. The `search(word)` method allows you to search for a word in the data structure. This method returns `True` if there is any string in the data structure that matches the given word or `False` otherwise. The word you are searching for may contain dots ('.'), where each dot can match any letter.\n",
-        "\n",
-        "4. The wildcard character ('.') in the `search` method allows for partial or fuzzy searching. For example, if the word dictionary contains the words \"bad,\" \"dad,\" and \"mad,\" then:\n",
-        "   - Searching for \"pad\" should return `False` because there is no exact match.\n",
-        "   - Searching for \"bad\" should return `True` because \"bad\" is in the dictionary.\n",
-        "   - Searching for \".ad\" should return `True` because it can match \"bad,\" \"dad,\" or \"mad.\"\n",
-        "   - Searching for \"b..\" should return `True` because it can match \"bad,\" \"bed,\" \"bet,\" etc.\n",
-        "\n",
-        "5. The problem specifies that there will be at most two dots ('.') in search queries, and there will be at most 10^4 calls to both `addWord` and `search`.\n",
-        "\n",
-        "In summary, you need to implement the `WordDictionary` class that efficiently supports adding words and searching for words, where the search can include wildcard characters ('.') that match any letter.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        # Initialize a TrieNode with children and a flag to indicate the end of a word.\n",
-        "        self.children = {}\n",
-        "        self.is_end_of_word = False\n",
-        "\n",
-        "class WordDictionary:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize the WordDictionary with a root node.\n",
-        "        self.root = TrieNode()\n",
-        "\n",
-        "    def addWord(self, word: str) -> None:\n",
-        "        node = self.root\n",
-        "        # Iterate through the characters in the word.\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                # Create a new node for the character if it doesn't exist.\n",
-        "                node.children[char] = TrieNode()\n",
-        "            # Move to the next node.\n",
-        "            node = node.children[char]\n",
-        "        # Mark the end of the word by setting the flag to True.\n",
-        "        node.is_end_of_word = True\n",
-        "\n",
-        "    def search_helper(self, node: TrieNode, word: str) -> bool:\n",
-        "        if not word:\n",
-        "            # If there are no characters left in the word, check if we reached the end of a word in the trie.\n",
-        "            return node.is_end_of_word\n",
-        "        \n",
-        "        char = word[0]\n",
-        "        if char == '.':\n",
-        "            # If the character is a dot, explore all possible child nodes.\n",
-        "            for child in node.children.values():\n",
-        "                if self.search_helper(child, word[1:]):\n",
-        "                    return True\n",
-        "        elif char in node.children:\n",
-        "            # If the character is in the children of the current node, move to the next node.\n",
-        "            return self.search_helper(node.children[char], word[1:])\n",
-        "        \n",
-        "        # If the character is not found and is not a dot, the word is not in the trie.\n",
-        "        return False\n",
-        "\n",
-        "    def search(self, word: str) -> bool:\n",
-        "        # Start the search from the root of the trie.\n",
-        "        return self.search_helper(self.root, word)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This code defines a `WordDictionary` class that uses a Trie data structure to efficiently store and search for words. Here's a step-by-step explanation:\n",
-        "\n",
-        "1. `TrieNode` class: This class represents nodes in the Trie data structure. Each node has two attributes: `children` (a dictionary to store child nodes) and `is_end_of_word` (a flag to indicate whether the node marks the end of a word).\n",
-        "\n",
-        "2. `WordDictionary` class: This class initializes with an empty Trie by creating a root node.\n",
-        "\n",
-        "3. `addWord` method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the `is_end_of_word` flag to `True` for the final character of the word to mark the end of the word.\n",
-        "\n",
-        "4. `search_helper` method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (`node`) and a word to search (`word`) as input. If there are no characters left in the word (`not word`), it checks if the current node marks the end of a word. If it does, it returns `True`.\n",
-        "\n",
-        "5. If the first character of the word is a dot ('.'), the function explores all possible child nodes by iterating through `node.children.values()` and recursively calls `search_helper` for each child with the remaining part of the word (`word[1:]`).\n",
-        "\n",
-        "6. If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling `search_helper` on the child node and the remaining part of the word.\n",
-        "\n",
-        "7. If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns `False`.\n",
-        "\n",
-        "8. `search` method: This is the public method for searching words. It initiates the search process by calling `search_helper` starting from the root node of the Trie.\n",
-        "\n",
-        "Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots ('.')."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n",
-            "True\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "wordDictionary = WordDictionary()\n",
-        "wordDictionary.addWord(\"bad\")\n",
-        "wordDictionary.addWord(\"dad\")\n",
-        "wordDictionary.addWord(\"mad\")\n",
-        "print(wordDictionary.search(\"pad\"))  # Output: False\n",
-        "print(wordDictionary.search(\"bad\"))  # Output: True\n",
-        "print(wordDictionary.search(\".ad\"))  # Output: True\n",
-        "print(wordDictionary.search(\"b..\"))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `WordDictionary` class methods:\n",
-        "\n",
-        "1. `addWord` Method:\n",
-        "\n",
-        "   - Time Complexity: O(L)\n",
-        "     - L is the length of the word being added.\n",
-        "     - In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.\n",
-        "\n",
-        "2. `search_helper` Method (called by `search`):\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - M is the maximum number of dots ('.') in the search word.\n",
-        "     - In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.\n",
-        "     - So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.\n",
-        "\n",
-        "3. `search` Method:\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - The `search` method calls the `search_helper` method, which has the same time complexity explained above.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.\n",
-        "\n",
-        "Overall, the time complexity of the `search` method is mainly affected by the number of dots ('.') in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.\n",
-        "\n",
-        "The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.\n",
-        "\n",
-        "In summary:\n",
-        "\n",
-        "- Time Complexity for `addWord`: O(L)\n",
-        "- Time Complexity for `search`: O(2^M * L)\n",
-        "- Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.\n",
-        "\n",
-        "Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dictionary Auto-Completion**: Extend the `WordDictionary` class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.\n",
-        "\n",
-        "2. **Support Word Deletion**: Extend the `WordDictionary` class to support word deletion. Add a method `deleteWord(word)` that removes a word from the data structure. Ensure that the search operation still works correctly after deletion."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/08. Tries/212. Word Search II.ipynb b/docs/08. Tries/212. Word Search II.ipynb
deleted file mode 100644
index 71597b8..0000000
--- a/docs/08. Tries/212. Word Search II.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 212. Word Search II\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search II problem on LeetCode, click here!](https://leetcode.com/problems/word-search-ii/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` `board` of characters and a list of strings `words`, the task is to return *all words on the board*.\n",
-        "\n",
-        "Each word must be constructed from letters of sequentially **adjacent cells**, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n == board[i].length`\n",
-        "- `1 <= m, n <= 12`\n",
-        "- `board[i][j]` is a lowercase English letter.\n",
-        "- 1 <= `words.length` <= $3 * 10^4$\n",
-        "- `1 <= words[i].length <= 10`\n",
-        "- `words[i]` consists of lowercase English letters.\n",
-        "- All the strings of `words` are unique."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "To solve the \"Word Search II\" problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here's a step-by-step approach to solve the problem:\n",
-        "\n",
-        "1. Build a Trie from the given list of words:\n",
-        "   - Create a Trie data structure to store all the words from the input list.\n",
-        "   - For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.\n",
-        "\n",
-        "2. Perform DFS on the board:\n",
-        "   - Iterate through each cell (i, j) on the board.\n",
-        "   - For each cell, start a DFS traversal from that cell to search for words.\n",
-        "   - During the DFS traversal, maintain a current path string.\n",
-        "   - At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.\n",
-        "   - If the current path string matches a word in the Trie, add it to the result.\n",
-        "\n",
-        "3. Implement DFS with backtracking:\n",
-        "   - During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven't been visited before.\n",
-        "   - To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like '#') before exploring it and restore its original character after the DFS traversal.\n",
-        "\n",
-        "4. Return the result:\n",
-        "   - After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.\n",
-        "   - Convert the result set to a list and return it as the final output.\n",
-        "\n",
-        "This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Define a TrieNode class to represent nodes in the Trie.\n",
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}  # Dictionary to store child nodes.\n",
-        "        self.is_end_of_word = False  # Flag to mark the end of a word.\n",
-        "\n",
-        "# Main function to find words on the board.\n",
-        "def findWords(board, words):\n",
-        "    # DFS function to search for words starting from a given cell.\n",
-        "    def dfs(node, i, j, path):\n",
-        "        char = board[i][j]  # Get the character at the current cell.\n",
-        "        curr_node = node.children.get(char)  # Find the corresponding Trie node.\n",
-        "\n",
-        "        if not curr_node:\n",
-        "            return  # If no matching Trie node, stop the search.\n",
-        "\n",
-        "        path += char  # Add the character to the current path.\n",
-        "\n",
-        "        if curr_node.is_end_of_word:\n",
-        "            result.add(path)  # If the path matches a word, add it to the result.\n",
-        "\n",
-        "        temp, board[i][j] = board[i][j], \"#\"  # Mark the cell as visited.\n",
-        "\n",
-        "        # Explore neighboring cells (up, down, left, right).\n",
-        "        if i > 0:\n",
-        "            dfs(curr_node, i - 1, j, path)\n",
-        "        if i < m - 1:\n",
-        "            dfs(curr_node, i + 1, j, path)\n",
-        "        if j > 0:\n",
-        "            dfs(curr_node, i, j - 1, path)\n",
-        "        if j < n - 1:\n",
-        "            dfs(curr_node, i, j + 1, path)\n",
-        "\n",
-        "        board[i][j] = temp  # Restore the cell's original character.\n",
-        "\n",
-        "    # Function to build a Trie from the list of words.\n",
-        "    def buildTrie():\n",
-        "        root = TrieNode()  # Create a root node.\n",
-        "        for word in words:\n",
-        "            node = root\n",
-        "            for char in word:\n",
-        "                if char not in node.children:\n",
-        "                    node.children[char] = TrieNode()  # Create a new node if needed.\n",
-        "                node = node.children[char]\n",
-        "            node.is_end_of_word = True  # Mark the end of the word.\n",
-        "        return root\n",
-        "\n",
-        "    m, n = len(board), len(board[0])  # Get the dimensions of the board.\n",
-        "    root = buildTrie()  # Build the Trie from the list of words.\n",
-        "    result = set()  # Use a set to store unique words found on the board.\n",
-        "\n",
-        "    # Iterate through each cell on the board and start DFS from there.\n",
-        "    for i in range(m):\n",
-        "        for j in range(n):\n",
-        "            dfs(root, i, j, \"\")  # Start DFS from each cell on the board.\n",
-        "\n",
-        "    return list(result)  # Convert the set to a list and return the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code solves the \"Word Search II\" problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.\n",
-        "\n",
-        "The code does the following:\n",
-        "\n",
-        "1. Defines a `TrieNode` class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.\n",
-        "\n",
-        "2. Defines the `findWords` function, which takes the grid (`board`) and a list of words (`words`) as input.\n",
-        "\n",
-        "3. Inside the `findWords` function, there is a `dfs` (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.\n",
-        "\n",
-        "4. The code also includes a `buildTrie` function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.\n",
-        "\n",
-        "5. The dimensions of the grid are obtained (m x n).\n",
-        "\n",
-        "6. A Trie is built using the `buildTrie` function.\n",
-        "\n",
-        "7. A set called `result` is used to store unique words found in the grid.\n",
-        "\n",
-        "8. The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.\n",
-        "\n",
-        "9. During the DFS, it explores neighboring cells (up, down, left, right) if they haven't been visited before and if the current path matches a prefix in the Trie.\n",
-        "\n",
-        "10. When a word is found during the DFS traversal, it is added to the `result` set.\n",
-        "\n",
-        "11. The grid cell is marked as visited during the DFS by changing its character to \"#\", and it is restored to its original character after the DFS traversal.\n",
-        "\n",
-        "12. Finally, the set of unique words found is converted to a list and returned as the output.\n",
-        "\n",
-        "The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['eat', 'oath']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "board1 = [[\"o\",\"a\",\"a\",\"n\"],[\"e\",\"t\",\"a\",\"e\"],[\"i\",\"h\",\"k\",\"r\"],[\"i\",\"f\",\"l\",\"v\"]]\n",
-        "words1 = [\"oath\",\"pea\",\"eat\",\"rain\"]\n",
-        "print(findWords(board1, words1))  # Output: [\"eat\", \"oath\"]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "c748b879-a2d8-4298-a42c-c7f61f9c7fc6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "board2 = [[\"a\",\"b\"],[\"c\",\"d\"]]\n",
-        "words2 = [\"abcb\"]\n",
-        "print(findWords(board2, words2))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Building the Trie (`buildTrie` function):** \n",
-        "   - Suppose there are `N` words in the input list, and the average length of a word is `L`.\n",
-        "   - Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.\n",
-        "\n",
-        "2. **DFS Traversal (`dfs` function):** \n",
-        "   - In the worst case, the DFS function explores all possible paths in the grid.\n",
-        "   - The maximum number of recursive calls for each cell is 4 (up, down, left, right).\n",
-        "   - The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most `L`.\n",
-        "   - Therefore, the DFS traversal for each cell takes $O(4^L)$ time.\n",
-        "\n",
-        "3. **Iterating Through the Grid (`findWords` function):**\n",
-        "   - In the worst case, we iterate through all `m` rows and `n` columns in the grid.\n",
-        "   - For each cell, we start a DFS traversal.\n",
-        "   - Therefore, iterating through the entire grid takes $O(m * n * 4^L)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the code is $O(N * L + m * n * 4^L)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Trie Data Structure:**\n",
-        "   - The space required to store the Trie depends on the number of unique characters in all the words.\n",
-        "   - In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).\n",
-        "   - In practice, it may be less if there are common prefixes among words.\n",
-        "\n",
-        "2. **DFS Stack (Recursive Calls):**\n",
-        "   - The depth of the recursive call stack during DFS is at most `L`, where `L` is the length of the longest word in the Trie.\n",
-        "   - Therefore, the space complexity for the recursive call stack is O(L).\n",
-        "\n",
-        "3. **Result Set (`result` set):**\n",
-        "   - The space used to store the result set depends on the number of valid words found in the grid.\n",
-        "   - In the worst case, when all words are found, the space complexity of the result set is O(N * L).\n",
-        "\n",
-        "Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Word Search Paths:**\n",
-        "   Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.\n",
-        "\n",
-        "\n",
-        "2. **Reverse Word Search:**\n",
-        "   Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/08. Tries/README.md b/docs/08. Tries/README.md
deleted file mode 100644
index 22c3bcd..0000000
--- a/docs/08. Tries/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Trie Problems - Blind 75 LeetCode
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/docs/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
deleted file mode 100644
index cb66b6a..0000000
--- a/docs/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb	
+++ /dev/null
@@ -1,254 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 1046. Last Stone Weight\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Last Stone Weight problem on LeetCode, click here!](https://leetcode.com/problems/last-stone-weight/)\n",
-        "\n",
-        "---\n",
-        "You are given an array of integers `stones` where `stones[i]` is the weight of the `i`th stone.\n",
-        "\n",
-        "We are playing a game with the stones. On each turn, you choose the **heaviest two stones** and smash them together. Suppose the heaviest two stones have weights `x` and `y` with `x <= y`. The result of this smash is:\n",
-        "\n",
-        "1. If `x == y`, both stones are destroyed.\n",
-        "2. If `x != y`, the stone of weight `x` is destroyed, and the stone of weight `y` has new weight `y - x`.\n",
-        "\n",
-        "At the end of the game, there is **at most one** stone left.\n",
-        "\n",
-        "Return *the weight of the last remaining stone*. If there are no stones left, return `0`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= stones.length <= 30`\n",
-        "- `1 <= stones[i] <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Last Stone Weight\" problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.\n",
-        "\n",
-        "Here's how the game works:\n",
-        "\n",
-        "1. You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.\n",
-        "\n",
-        "2. In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you've found the answer.\n",
-        "\n",
-        "3. If there are two stones with weights `x` and `y`, where `x` is less than or equal to `y`, the following happens:\n",
-        "   - If `x` is equal to `y`, both stones are completely destroyed, and they are removed from the array of stones.\n",
-        "   - If `x` is not equal to `y`, the stone with weight `x` is destroyed, and the stone with weight `y` now has a new weight of `y - x`. The stone with weight `x` is removed from the array, and the modified stone with weight `y - x` remains in the array.\n",
-        "\n",
-        "4. The game continues with the modified array of stones until there is at most one stone left.\n",
-        "\n",
-        "5. The goal is to find the weight of the last remaining stone, or if there are no stones left, return `0`.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "def lastStoneWeight(stones):\n",
-        "    # Convert the input list to a max heap (negate the values to simulate a max heap)\n",
-        "    max_heap = [-stone for stone in stones]\n",
-        "    heapq.heapify(max_heap)\n",
-        "\n",
-        "    # Continue as long as there are more than 1 stone in the heap\n",
-        "    while len(max_heap) > 1:\n",
-        "        # Get the two heaviest stones\n",
-        "        y = -heapq.heappop(max_heap)  # Get the heaviest stone and negate it back to positive\n",
-        "        x = -heapq.heappop(max_heap)  # Get the second heaviest stone and negate it back to positive\n",
-        "\n",
-        "        # Calculate the new stone's weight after smashing\n",
-        "        if x != y:\n",
-        "            new_stone = y - x\n",
-        "            heapq.heappush(max_heap, -new_stone)  # Negate the value and push it back to the heap\n",
-        "\n",
-        "    # If there is one stone left, return its weight (negate it back to positive)\n",
-        "    if max_heap:\n",
-        "        return -max_heap[0]\n",
-        "    else:\n",
-        "        return 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a Python function called `lastStoneWeight` that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. We import the `heapq` library, which allows us to create and manipulate a heap (priority queue).\n",
-        "\n",
-        "2. Inside the `lastStoneWeight` function:\n",
-        "   - We create a max heap (negating stone weights to simulate a max heap) using the `heapq.heapify` function. This heap will keep track of the heaviest stones.\n",
-        "   \n",
-        "   - We enter a loop that continues as long as there are more than 1 stone in the heap.\n",
-        "   \n",
-        "   - Inside the loop, we:\n",
-        "     - Retrieve and negate the heaviest stone (`y`) from the heap.\n",
-        "     - Retrieve and negate the second heaviest stone (`x`) from the heap.\n",
-        "   \n",
-        "     - Calculate the new stone's weight after smashing (`y - x`), and negate it back to simulate a max heap.\n",
-        "     - Add the new stone back to the heap using `heapq.heappush`.\n",
-        "   \n",
-        "3. After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.\n",
-        "   \n",
-        "4. If there are no stones left (the heap is empty), we return `0`, indicating that no stones remain.\n",
-        "\n",
-        "5. Finally, we provide two test cases to demonstrate the function's usage and correctness.\n",
-        "\n",
-        "In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "stones1 = [2, 7, 4, 1, 8, 1]\n",
-        "print(lastStoneWeight(stones1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "b7e79514-4821-48d0-bb9d-0f2de8150945",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: \n",
-        "\n",
-        "stones2 = [1]\n",
-        "print(lastStoneWeight(stones2))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided Python code for the \"Last Stone Weight\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The `heapq.heapify` operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.\n",
-        "\n",
-        "2. The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:\n",
-        "   - Retrieving and negating the heaviest stone (`y`) from the heap, which takes O(log n) time.\n",
-        "   - Retrieving and negating the second heaviest stone (`x`) from the heap, also taking O(log n) time.\n",
-        "   - Calculating the new stone's weight and pushing it back into the heap using `heapq.heappush`, which takes O(log n) time.\n",
-        "\n",
-        "3. In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.\n",
-        "\n",
-        "Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).\n",
-        "\n",
-        "2. The rest of the variables used in the function (e.g., `x`, `y`, `new_stone`) require only constant space, so they do not significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: $O(n\\ log\\ n)$\n",
-        "- Space Complexity: $O(n)$\n",
-        "\n",
-        "The algorithm is efficient enough to handle the problem's constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Last Stone Weight**: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.\n",
-        "\n",
-        "\n",
-        "2. **Multiple Stones Smash**: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/docs/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
deleted file mode 100644
index 847dd60..0000000
--- a/docs/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 295. Find Median from Data Stream\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Median from Data Stream problem on LeetCode, click here!](https://leetcode.com/problems/find-median-from-data-stream/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "The **median** is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.\n",
-        "\n",
-        "Implement the MedianFinder class:\n",
-        "\n",
-        "- `MedianFinder()` initializes the `MedianFinder` object.\n",
-        "- `void addNum(int num)` adds the integer `num` from the data stream to the data structure.\n",
-        "- `double findMedian()` returns the median of all elements so far. Answers within $10^{-5}$ of the actual answer will be accepted.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- $-10^{5}$ <= `num` <= $10^{5}$\n",
-        "- There will be at least one element in the data structure before calling `findMedian`.\n",
-        "- At most $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "**Follow-up:**\n",
-        "\n",
-        "1. If all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?\n",
-        "2. If `99%` of all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem, \"Find Median from Data Stream,\" deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.\n",
-        "\n",
-        "Here's a breakdown of the problem:\n",
-        "\n",
-        "1. **Initialization**: You are asked to implement a `MedianFinder` class that supports the following operations:\n",
-        "\n",
-        "    - `MedianFinder()`: Initializes the MedianFinder object.\n",
-        "    - `addNum(int num)`: Adds an integer `num` from the data stream to the data structure.\n",
-        "    - `findMedian()`: Returns the median of all elements added to the data structure.\n",
-        "\n",
-        "2. **Median Calculation**: The `findMedian` operation should efficiently compute the median, and the result should have a precision of at least $10^{-5}$ (i.e., answers within this range will be considered correct).\n",
-        "\n",
-        "3. **Examples**:\n",
-        "   \n",
-        "   - If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.\n",
-        "   - If you add numbers [1, 2, 3], the median should be 2 because it's the middle value.\n",
-        "   \n",
-        "4. **Constraints**:\n",
-        "\n",
-        "   - The integers provided in the data stream are in the range from $-10^5$ to $10^5$.\n",
-        "   - There will be at least one element in the data structure before calling `findMedian`.\n",
-        "   - At most, $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "class MedianFinder:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,\n",
-        "        # and a min-heap (large_half) for the larger half of numbers.\n",
-        "        self.small_half = []  # Max-heap for the smaller half of the numbers\n",
-        "        self.large_half = []  # Min-heap for the larger half of the numbers\n",
-        "\n",
-        "    def addNum(self, num: int) -> None:\n",
-        "        # Add the number to the appropriate heap based on its value\n",
-        "        if not self.small_half or num <= -self.small_half[0]:\n",
-        "            # If the number is less than or equal to the current maximum in the smaller half,\n",
-        "            # add it to the smaller half (max-heap)\n",
-        "            heapq.heappush(self.small_half, -num)\n",
-        "        else:\n",
-        "            # Otherwise, add it to the larger half (min-heap)\n",
-        "            heapq.heappush(self.large_half, num)\n",
-        "\n",
-        "        # Balance the heaps if necessary to ensure the size difference is at most 1\n",
-        "        if len(self.small_half) > len(self.large_half) + 1:\n",
-        "            # If the size of the smaller half is more than one greater than the size of the larger half,\n",
-        "            # move the maximum from the smaller half to the larger half to balance them.\n",
-        "            heapq.heappush(self.large_half, -heapq.heappop(self.small_half))\n",
-        "        elif len(self.large_half) > len(self.small_half):\n",
-        "            # If the size of the larger half is greater than the size of the smaller half,\n",
-        "            # move the minimum from the larger half to the smaller half to balance them.\n",
-        "            heapq.heappush(self.small_half, -heapq.heappop(self.large_half))\n",
-        "\n",
-        "    def findMedian(self) -> float:\n",
-        "        if len(self.small_half) == len(self.large_half):\n",
-        "            # If both halves have the same size, there's an even number of elements,\n",
-        "            # so the median is the average of the top elements in both heaps.\n",
-        "            return (-self.small_half[0] + self.large_half[0]) / 2.0\n",
-        "        else:\n",
-        "            # If the smaller half has more elements, it contains the median (odd number of elements).\n",
-        "            return -self.small_half[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a `MedianFinder` class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (`small_half`) to store the smaller half of the numbers and a min-heap (`large_half`) to store the larger half. Here's how the code works:\n",
-        "\n",
-        "1. The `__init__` method initializes the two heaps.\n",
-        "\n",
-        "2. The `addNum` method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.\n",
-        "\n",
-        "3. The `findMedian` method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.\n",
-        "\n",
-        "In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1.5\n",
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "medianFinder = MedianFinder()\n",
-        "medianFinder.addNum(1)\n",
-        "medianFinder.addNum(2)\n",
-        "print(medianFinder.findMedian())  # Output: 1.5\n",
-        "medianFinder.addNum(3)\n",
-        "print(medianFinder.findMedian())  # Output: 2.0\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `MedianFinder` class:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.\n",
-        "\n",
-        "2. `addNum(int num)`: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.\n",
-        "\n",
-        "3. `findMedian()`: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.\n",
-        "\n",
-        "2. `addNum(int num)`: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.\n",
-        "\n",
-        "3. `findMedian()`: The space complexity for finding the median is O(1). It doesn't require any additional data structures that grow with the input size.\n",
-        "\n",
-        "In summary, the time complexity of the `addNum` operation is O(log N), and the time complexity of the `findMedian` operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized kth Element**: Extend the `MedianFinder` class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.\n",
-        "\n",
-        "2. **Sliding Window Median**: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/docs/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
deleted file mode 100644
index 2e1522d..0000000
--- a/docs/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb	
+++ /dev/null
@@ -1,239 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 703. Kth Largest Element in a Stream\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Largest Element in a Stream problem on LeetCode, click here!](https://leetcode.com/problems/kth-largest-element-in-a-stream/)\n",
-        "\n",
-        "---\n",
-        "Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.\n",
-        "\n",
-        "Implement the `KthLargest` class with the following methods:\n",
-        "\n",
-        "- `KthLargest(int k, int[] nums)`: Initializes the object with the integer `k` and the stream of integers `nums`.\n",
-        "- `int add(int val)`: Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `k` <= $10^4$\n",
-        "- 0 <= `nums.length` <= $10^4$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- $-10^4$ <= `val` <= $10^4$\n",
-        "- At most $10^4$ calls will be made to `add`.\n",
-        "- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem you're trying to solve is to design a class called `KthLargest` that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:\n",
-        "\n",
-        "To solve this problem efficiently, you can use a min-heap data structure. Here's how the approach works:\n",
-        "\n",
-        "1. Initialize a min-heap to store the k largest elements. Initially, it's empty.\n",
-        "\n",
-        "2. In the `__init__` method, populate the min-heap with the first `k` elements from `nums`. This ensures that you have the k largest elements seen so far.\n",
-        "\n",
-        "3. Whenever you add a new element to the stream using the `add` method, follow these steps:\n",
-        "   - Add the new element to the min-heap.\n",
-        "   - If the size of the min-heap exceeds `k`, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.\n",
-        "   - The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.\n",
-        "\n",
-        "Here's why this approach works efficiently:\n",
-        "\n",
-        "- By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.\n",
-        "\n",
-        "- When you add a new element, the min-heap's size is kept at most `k`, which ensures that you only track the k largest elements and discard the smaller ones.\n",
-        "\n",
-        "- The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).\n",
-        "\n",
-        "- This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.\n",
-        "\n",
-        "In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "from typing import List  # Import the List type from the typing module\n",
-        "\n",
-        "class KthLargest:\n",
-        "\n",
-        "    def __init__(self, k: int, nums: List[int]):\n",
-        "        # Initialize the KthLargest object with k and nums.\n",
-        "        self.k = k\n",
-        "        # Create a min-heap to store the k largest elements.\n",
-        "        self.min_heap = []\n",
-        "        # Populate the min-heap with the first k elements from nums.\n",
-        "        for num in nums:\n",
-        "            self.add(num)\n",
-        "\n",
-        "    def add(self, val: int) -> int:\n",
-        "        # Add val to the min-heap.\n",
-        "        heapq.heappush(self.min_heap, val)\n",
-        "        # If the size of the min-heap exceeds k, remove the smallest element.\n",
-        "        if len(self.min_heap) > self.k:\n",
-        "            heapq.heappop(self.min_heap)\n",
-        "        # The root of the min-heap is the kth largest element.\n",
-        "        return self.min_heap[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- We start by importing the necessary modules:\n",
-        "  - `heapq`: This module provides functions to create and manipulate heaps.\n",
-        "  - `List` from the `typing` module: This is used to specify the type of the `nums` parameter.\n",
-        "\n",
-        "- We define the `KthLargest` class:\n",
-        "  - The `__init__` method initializes the object with the integer `k` and the list of integers `nums`.\n",
-        "  - It also creates an empty min-heap called `self.min_heap` to store the k largest elements.\n",
-        "  - It populates the min-heap with the first `k` elements from `nums` by calling the `add` method.\n",
-        "\n",
-        "- The `add` method:\n",
-        "  - Adds the new integer `val` to the min-heap using `heapq.heappush`. This maintains the min-heap property.\n",
-        "  - Checks if the size of the min-heap exceeds `k`. If it does, it removes the smallest element (the k+1th largest) using `heapq.heappop`.\n",
-        "  - Finally, it returns the smallest element in the min-heap, which is always the kth largest element.\n",
-        "\n",
-        "Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n",
-            "5\n",
-            "5\n",
-            "8\n",
-            "8\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "kthLargest = KthLargest(3, [4, 5, 8, 2])\n",
-        "print(kthLargest.add(3))  # Output: 4\n",
-        "print(kthLargest.add(5))  # Output: 5\n",
-        "print(kthLargest.add(10)) # Output: 5\n",
-        "print(kthLargest.add(9))  # Output: 8\n",
-        "print(kthLargest.add(4))  # Output: 8"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `KthLargest` class using the min-heap approach:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `__init__` method:\n",
-        "   - In the `__init__` method, you iterate over the first `k` elements in `nums` and add them to the min-heap. Each `heapq.heappush` operation takes O(log k) time.\n",
-        "   - Therefore, the time complexity of the `__init__` method is O(k * log k).\n",
-        "\n",
-        "2. `add` method:\n",
-        "   - In the `add` method, you perform the following operations:\n",
-        "     - `heapq.heappush`: O(log k) to add the new element to the min-heap.\n",
-        "     - If the size of the min-heap exceeds `k`, you perform `heapq.heappop`, which is also O(log k).\n",
-        "     - Finally, you return the smallest element from the min-heap, which is O(1) because it's always the root.\n",
-        "   - Overall, the time complexity of the `add` method is O(log k).\n",
-        "\n",
-        "3. Overall, if you make `n` calls to the `add` method, the total time complexity is O(n * log k), where `n` is the total number of elements added to the stream.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The space complexity is determined by the space used to store the min-heap and the instance variables.\n",
-        "2. The min-heap stores at most `k` elements at any given time, so its space complexity is O(k).\n",
-        "3. The instance variables (such as `self.k` and `self.min_heap`) have constant space requirements.\n",
-        "4. Therefore, the overall space complexity of the `KthLargest` class is O(k).\n",
-        "\n",
-        "In summary, the time complexity of the `KthLargest` class is O(n * log k) for `n` add operations, and the space complexity is O(k), where `k` is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dynamic k:** Modify the `KthLargest` class to support dynamic changes in the value of `k`. Implement a method `update_k` that allows changing the value of `k` during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of `k`.\n",
-        "\n",
-        "\n",
-        "2. **Implement kth Smallest:** Create a new class called `KthSmallest` that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/09. Heap - Priority Queue/README.md b/docs/09. Heap - Priority Queue/README.md
deleted file mode 100644
index 2eac70c..0000000
--- a/docs/09. Heap - Priority Queue/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Heap / Priority Queue Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)     | Easy       |
-| [1046. Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)     | Easy       |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/10. Backtracking/39. Combination Sum.ipynb b/docs/10. Backtracking/39. Combination Sum.ipynb
deleted file mode 100644
index 228a62e..0000000
--- a/docs/10. Backtracking/39. Combination Sum.ipynb	
+++ /dev/null
@@ -1,282 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 39. Combination Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Combination Sum problem on LeetCode, click here!](https://leetcode.com/problems/combination-sum/)\n",
-        "\n",
-        "---\n",
-        "Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of `candidates` where the chosen numbers sum to the `target`*. You may return the combinations in **any order**. \n",
-        "\n",
-        "The **same** number may be chosen from `candidates` an **unlimited number** of times. Two combinations are unique if the **frequency** of at least one of the chosen numbers is different.\n",
-        "\n",
-        "The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= candidates.length <= 30`\n",
-        "- `2 <= candidates[i] <= 40`\n",
-        "- All elements of `candidates` are **distinct**.\n",
-        "- `1 <= target <= 40`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:\n",
-        "\n",
-        "- You are given an array of distinct integers called \"candidates.\"\n",
-        "- You are also given a target integer called \"target.\"\n",
-        "\n",
-        "The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "**Example 1:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 6, 7], target = 7\n",
-        "Output: [[2, 2, 3], [7]]\n",
-        "```\n",
-        "In this example, there are two unique combinations that sum up to the target:\n",
-        "- 2 + 2 + 3 = 7\n",
-        "- 7 = 7\n",
-        "\n",
-        "**Example 2:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 5], target = 8\n",
-        "Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n",
-        "```\n",
-        "Here, there are three unique combinations that sum up to the target.\n",
-        "\n",
-        "**Example 3:**\n",
-        "```python\n",
-        "Input: candidates = [2], target = 1\n",
-        "Output: []\n",
-        "```\n",
-        "In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.\n",
-        "\n",
-        "The problem asks you to find and return these combinations in any order.\n",
-        "\n",
-        "The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def combinationSum(candidates, target):\n",
-        "    # Define a recursive DFS function to find combinations\n",
-        "    def dfs(remaining, start, path):\n",
-        "        # If the remaining target is 0, we found a valid combination\n",
-        "        if remaining == 0:\n",
-        "            result.append(path)\n",
-        "            return\n",
-        "        # If the remaining target is negative, this path is invalid\n",
-        "        if remaining < 0:\n",
-        "            return\n",
-        "        # Iterate through candidates starting from 'start' to avoid duplicates\n",
-        "        for i in range(start, len(candidates)):\n",
-        "            # Explore the current candidate by subtracting it from the remaining target\n",
-        "            # Add the current candidate to the path\n",
-        "            dfs(remaining - candidates[i], i, path + [candidates[i]])\n",
-        "\n",
-        "    result = []  # Initialize an empty list to store the result\n",
-        "    candidates.sort()  # Sort the candidates for deduplication and early stopping\n",
-        "    dfs(target, 0, [])  # Start the DFS from the target value with an empty path\n",
-        "    return result  # Return the list of unique combinations"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `combinationSum` function takes an array of distinct integers `candidates` and a target integer `target`. It returns a list of all unique combinations of `candidates` where the chosen numbers sum to the `target`. Each number in the `candidates` array can be used an unlimited number of times.\n",
-        "\n",
-        "Here's an overview of how the code works:\n",
-        "\n",
-        "1. The `combinationSum` function is defined, and it takes two arguments: `candidates` and `target`.\n",
-        "\n",
-        "2. Inside the function, there is a nested helper function called `backtrack`. This function is responsible for the actual combination generation using a recursive approach.\n",
-        "\n",
-        "3. The `backtrack` function is called with three arguments: `start`, `target`, and `path`. The `start` variable helps keep track of the current index in the `candidates` array, `target` keeps track of the remaining sum to be achieved, and `path` is a list that stores the current combination.\n",
-        "\n",
-        "4. Within the `backtrack` function, there are three main conditional statements:\n",
-        "   - If `target` becomes zero, it means we have found a combination that sums up to the target, so we add `path` to the `result` list.\n",
-        "   - If `target` becomes negative, it means the current combination doesn't work, so we return without doing anything.\n",
-        "   - Otherwise, we enter a loop that iterates over the `candidates` array, starting from the current index `start`.\n",
-        "\n",
-        "5. In the loop, the `backtrack` function is called recursively with the updated `target` and `path` after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.\n",
-        "\n",
-        "6. After the loop completes, the `result` list contains all unique combinations that sum to the target.\n",
-        "\n",
-        "7. The `candidates` array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.\n",
-        "\n",
-        "8. Finally, the `backtrack` function is initially called from the `combinationSum` function with `start` set to 0, `target` set to the original target value, and an empty `path`. The result is returned as a list of unique combinations.\n",
-        "\n",
-        "The code includes a few example cases to demonstrate how the function works with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 3], [7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example 1\n",
-        "candidates1 = [2, 3, 6, 7]\n",
-        "target1 = 7\n",
-        "print(combinationSum(candidates1, target1))  # Output: [[2, 2, 3], [7]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "candidates2 = [2, 3, 5]\n",
-        "target2 = 8\n",
-        "print(combinationSum(candidates2, target2))  # Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "candidates3 = [2]\n",
-        "target3 = 1\n",
-        "print(combinationSum(candidates3, target3))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `combinationSum` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this function is influenced by the number of recursive calls made by the `backtrack` function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.\n",
-        "\n",
-        "The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as $O(2^n)$, where 'n' is the maximum number of recursive calls. In this context, 'n' corresponds to the number of elements in the `candidates` list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.\n",
-        "\n",
-        "1. The space required for the `result` list can be up to $O(2^n)$ in the worst case because each combination is stored.\n",
-        "\n",
-        "2. The stack space for the recursive calls can also be up to O(n) in the worst case, where 'n' is the number of elements in the `candidates` list.\n",
-        "\n",
-        "Therefore, the overall space complexity of the function is $O(2^n + n)$. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.\n",
-        "\n",
-        "In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find the Number of Unique Combinations:** Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.\n",
-        "\n",
-        "2. **Combinations with a Maximum Value:** Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/10. Backtracking/79. Word Search.ipynb b/docs/10. Backtracking/79. Word Search.ipynb
deleted file mode 100644
index cee509b..0000000
--- a/docs/10. Backtracking/79. Word Search.ipynb	
+++ /dev/null
@@ -1,298 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 79. Word Search\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search problem on LeetCode, click here!](https://leetcode.com/problems/word-search/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` grid of characters `board` and a string `word`, return *`true` if `word` exists in the grid.*\n",
-        "\n",
-        "The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n = board[i].length`\n",
-        "- `1 <= m, n <= 6`\n",
-        "- `1 <= word.length <= 15`\n",
-        "- `board` and `word` consists of only lowercase and uppercase English letters.\n",
-        "\n",
-        "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given word can be constructed from characters in an `m x n` grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.\n",
-        "\n",
-        "Here are the specifics of the problem:\n",
-        "\n",
-        "- You are given an `m x n` grid, which is a 2D board of characters.\n",
-        "- You are also given a string `word` consisting of lowercase and uppercase English letters.\n",
-        "- Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.\n",
-        "- You can't use the same cell more than once when forming the word.\n",
-        "- If it's possible to form the word in the grid, return `True`; otherwise, return `False`.\n",
-        "\n",
-        "For example, consider the following grid and word:\n",
-        "\n",
-        "```python\n",
-        "board = [[\"A\", \"B\", \"C\", \"E\"],\n",
-        "         [\"S\", \"F\", \"C\", \"S\"],\n",
-        "         [\"A\", \"D\", \"E\", \"E\"]]         \n",
-        "word = \"ABCCED\"\n",
-        "```\n",
-        "\n",
-        "In this case, the word \"ABCCED\" can be formed by moving through the cells (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,3) in the grid. Therefore, the function should return `True`.\n",
-        "\n",
-        "Conversely, if the word is impossible to construct, such as in the case of the word \"ABCB\" for the same grid, where there's no valid path that forms the word, the function should return `False`.\n",
-        "\n",
-        "The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def exist(self, board: List[List[str]], word: str) -> bool:\n",
-        "        def dfs(i, j, k):\n",
-        "            # Check if the current position is out of bounds or doesn't match the character in the word.\n",
-        "            if not (0 <= i < len(board)) or not (0 <= j < len(board[0])) or board[i][j] != word[k]:\n",
-        "                return False\n",
-        "            \n",
-        "            # If we have matched all characters in the word, return True.\n",
-        "            if k == len(word) - 1:\n",
-        "                return True\n",
-        "\n",
-        "            # Temporarily mark the current cell to prevent revisiting.\n",
-        "            tmp, board[i][j] = board[i][j], \"/\"\n",
-        "\n",
-        "            # Explore adjacent cells by making recursive calls in all four directions.\n",
-        "            found = dfs(i + 1, j, k + 1) or dfs(i - 1, j, k + 1) or dfs(i, j + 1, k + 1) or dfs(i, j - 1, k + 1)\n",
-        "\n",
-        "            # Restore the original character in the cell.\n",
-        "            board[i][j] = tmp\n",
-        "\n",
-        "            return found\n",
-        "\n",
-        "        # Iterate through all cells in the board.\n",
-        "        for i in range(len(board)):\n",
-        "            for j in range(len(board[0])):\n",
-        "                # Check if the 'dfs' function starting from this cell returns True.\n",
-        "                if dfs(i, j, 0):\n",
-        "                    return True\n",
-        "\n",
-        "        # If no match is found after exploring all cells, return False.\n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Import the necessary module:\n",
-        "   - `from typing import List`: This line imports the `List` type from the `typing` module, which is used to specify the type of the `board` parameter in the method signature.\n",
-        "\n",
-        "2. Define the `Solution` class:\n",
-        "   - `class Solution:`: This line defines a class called `Solution` to encapsulate the solution for the word search problem.\n",
-        "\n",
-        "3. Define the `exist` method:\n",
-        "   - `def exist(self, board: List[List[str]], word: str) -> bool:`: This method is a member of the `Solution` class and takes two parameters: `board`, which is a 2D list of characters, and `word`, which is a string. It returns a boolean value, indicating whether the word exists in the board.\n",
-        "\n",
-        "4. Implement the inner `dfs` function:\n",
-        "   - `def dfs(i, j, k):`: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: `i` and `j` representing the current position on the board, and `k` representing the current index in the `word` string.\n",
-        "\n",
-        "   - Inside `dfs`, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the `word`. If either of these conditions is met, it returns `False`.\n",
-        "\n",
-        "   - If `k` is equal to the length of the `word` minus one, it means we have successfully matched all characters in the `word`, so it returns `True`.\n",
-        "\n",
-        "   - The function then temporarily replaces the character at the current position with a marker, \"/\", to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return `True`, it propagates the `True` result up the call stack. After the exploration is complete, it restores the original character in the cell.\n",
-        "\n",
-        "5. Iterate through the board:\n",
-        "   - The outer loop iterates through all cells in the `board` using two nested loops. For each cell, it checks if the `dfs` function starting from that cell (with `k` initially set to 0) returns `True`. If it does, it means the word exists, so the method returns `True`.\n",
-        "\n",
-        "6. Return `False`:\n",
-        "   - If the loop completes without finding the word in the board, the method returns `False`.\n",
-        "\n",
-        "To use this code, you can create an instance of the `Solution` class and call the `exist` method on that instance, passing the `board` and the `word` as arguments to check if the word exists in the board."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test case 1: Word \"ABCCED\" can be found in the grid\n",
-        "board1 = [[\"A\",\"B\",\"C\",\"E\"],\n",
-        "          [\"S\",\"F\",\"C\",\"S\"],\n",
-        "          [\"A\",\"D\",\"E\",\"E\"]]\n",
-        "word1 = \"ABCCED\"\n",
-        "print(solution.exist(board1, word1))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "# Test case 2: Word \"SEE\" can be found in the grid\n",
-        "word2 = \"SEE\"\n",
-        "print(solution.exist(board1, word2))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "\n",
-        "# Test case 3: Word \"ABCB\" cannot be found in the grid\n",
-        "word3 = \"ABCB\"\n",
-        "print(solution.exist(board1, word3))  # Expected output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `exist` method in the given code.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary work in this code is done by the `dfs` function, which performs a depth-first search through the grid. The time complexity of the `dfs` function is $O(4^(n))$, where \"n\" is the length of the `word`. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the `word`.\n",
-        "\n",
-        "The outer loops iterate through all cells in the `board`, which has dimensions `m x n`. So, the total number of iterations of `dfs` is O(m * n). However, since the `dfs` function has a higher time complexity, the overall time complexity is still dominated by the `dfs` function.\n",
-        "\n",
-        "Therefore, the overall time complexity of the `exist` method is $O(m * n * 4^n)$, where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The primary space usage comes from the recursive calls in the `dfs` function. The depth of the recursion can be at most equal to the length of the `word`, which is O(n).\n",
-        "\n",
-        "2. Additionally, the `tmp` variable and the recursive calls on the call stack consume a small amount of additional memory.\n",
-        "\n",
-        "3. The marking of visited cells with the \"/\" character temporarily modifies the `board` in-place but doesn't significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity is O(n) due to the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is $O(m * n * 4^n)$, and the space complexity is O(n), where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find all unique words that can be constructed from the grid. Instead of returning `True` or `False`, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.\n",
-        "\n",
-        "2. **Board Generation:** Create a function to generate random grids of characters and then use the `exist` method to solve them. Test the efficiency and correctness of your code by generating larger boards and words."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/10. Backtracking/README.md b/docs/10. Backtracking/README.md
deleted file mode 100644
index 0d1ea13..0000000
--- a/docs/10. Backtracking/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Backtracking Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)        | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/11. Graphs/133. Clone Graph.ipynb b/docs/11. Graphs/133. Clone Graph.ipynb
deleted file mode 100644
index 07351b6..0000000
--- a/docs/11. Graphs/133. Clone Graph.ipynb	
+++ /dev/null
@@ -1,317 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 133. Clone Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Clone Graph problem on LeetCode, click here!](https://leetcode.com/problems/clone-graph/)\n",
-        "\n",
-        "---\n",
-        "Given a reference of a node in a **connected** undirected graph.\n",
-        "\n",
-        "Return a **deep copy** (clone) of the graph.\n",
-        "\n",
-        "Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n",
-        "\n",
-        "```\n",
-        "class Node {\n",
-        "    public int val;\n",
-        "    public List<Node> neighbors;\n",
-        "}\n",
-        "```\n",
-        "\n",
-        "**Test case format:**\n",
-        "\n",
-        "For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n",
-        "\n",
-        "**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n",
-        "\n",
-        "The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the graph is in the range `[0, 100]`.\n",
-        "- `1 <= Node.val <= 100`\n",
-        "- `Node.val` is unique for each node.\n",
-        "- There are no repeated edges and no self-loops in the graph.\n",
-        "- The Graph is connected and all nodes can be visited starting from the given node."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.\n",
-        "\n",
-        "Here are the key aspects of the problem:\n",
-        "\n",
-        "1. **Input**: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.\n",
-        "\n",
-        "2. **Output**: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.\n",
-        "\n",
-        "3. **Graph Structure**: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.\n",
-        "\n",
-        "4. **Connected Graph**: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.\n",
-        "\n",
-        "To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.\n",
-        "\n",
-        "The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a Node.\n",
-        "class Node:\n",
-        "    def __init__(self, val=0, neighbors=None):\n",
-        "        self.val = val\n",
-        "        self.neighbors = neighbors if neighbors is not None else []\n",
-        "\n",
-        "class Solution:\n",
-        "    def cloneGraph(self, node: 'Node') -> 'Node':\n",
-        "        if not node:\n",
-        "            return None\n",
-        "\n",
-        "        visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "        def dfs(original_node):\n",
-        "            if original_node in visited:\n",
-        "                return visited[original_node]\n",
-        "\n",
-        "            # Create a copy of the original node\n",
-        "            copy_node = Node(original_node.val)\n",
-        "            visited[original_node] = copy_node\n",
-        "\n",
-        "            # Recursively clone the neighbors of the original node\n",
-        "            for neighbor in original_node.neighbors:\n",
-        "                copy_node.neighbors.append(dfs(neighbor))\n",
-        "\n",
-        "            return copy_node\n",
-        "\n",
-        "        return dfs(node)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a Python class, `Node`, and a solution class, `Solution`, to clone a connected undirected graph represented by nodes and their neighbors. Here's an explanation of the code:\n",
-        "\n",
-        "1. The `Node` class defines a node in the graph. Each node has a value (`val`) which is an integer and a list of neighbors (`neighbors`) that are other nodes in the graph.\n",
-        "\n",
-        "2. The `Solution` class contains the method `cloneGraph`, which takes a reference to the first node of the graph (`node`) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.\n",
-        "\n",
-        "3. Inside the `cloneGraph` method:\n",
-        "   - It first checks if the input `node` is `None`. If it's `None`, it means there is no graph to clone, and the method returns `None`.\n",
-        "\n",
-        "   - It initializes a `visited` dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.\n",
-        "\n",
-        "   - The `dfs` (depth-first search) function is defined within the `cloneGraph` method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.\n",
-        "\n",
-        "   - Inside the `dfs` function:\n",
-        "     - It checks if the original node has been visited before by looking it up in the `visited` dictionary. If it has been visited, it returns the corresponding clone from the `visited` dictionary.\n",
-        "\n",
-        "     - If the original node is not visited, it creates a new node, `copy_node`, with the same value as the original node. This is the first step in creating the clone of the original node.\n",
-        "\n",
-        "     - It then recursively clones the neighbors of the original node by iterating through the `neighbors` list of the original node and appending the corresponding cloned neighbors to the `neighbors` list of the `copy_node`. This step ensures that the relationships between nodes are preserved in the clone.\n",
-        "\n",
-        "     - The `copy_node` is added to the `visited` dictionary with the original node as the key and the clone as the value.\n",
-        "\n",
-        "     - Finally, the `copy_node` is returned as the result of the DFS for the original node.\n",
-        "\n",
-        "4. The `cloneGraph` method returns the result of the DFS on the input `node`, which is the clone of the entire graph with its structure and relationships intact.\n",
-        "\n",
-        "In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1, 2, 4]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "def get_adjacency_list(node):\n",
-        "    visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "    def dfs(node):\n",
-        "        if not node:\n",
-        "            return []\n",
-        "\n",
-        "        if node in visited:\n",
-        "            return visited[node]\n",
-        "\n",
-        "        neighbors = [n.val for n in node.neighbors]\n",
-        "        visited[node] = neighbors\n",
-        "\n",
-        "        for neighbor in node.neighbors:\n",
-        "            dfs(neighbor)\n",
-        "\n",
-        "    dfs(node)\n",
-        "    result = []\n",
-        "\n",
-        "    def get_node_and_neighbors(node):\n",
-        "        result.append([node.val] + visited[node])\n",
-        "\n",
-        "    get_node_and_neighbors(node)\n",
-        "    return result\n",
-        "\n",
-        "\n",
-        "# Testing the code with the provided examples\n",
-        "adjList1 = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "nodes = [Node(i) for i in range(1, len(adjList1) + 1)]\n",
-        "for i, adj in enumerate(adjList1):\n",
-        "    nodes[i].neighbors = [nodes[j - 1] for j in adj]\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(nodes[0])\n",
-        "cloned_adjList1 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList1)\n",
-        "\n",
-        "# Output should match adjList1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "# Input: adjList = [[]]\n",
-        "\n",
-        "adjList2 = [[]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "node1 = Node(1)\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(node1)\n",
-        "cloned_adjList2 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList2)\n",
-        "\n",
-        "# Output should be [[]], which represents an empty graph"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Creating the graph: The time complexity to create the original graph from `adjList` is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in `adjList`.\n",
-        "\n",
-        "2. Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.\n",
-        "\n",
-        "Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.\n",
-        "\n",
-        "2. Storage for the visited dictionary: The `visited` dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.\n",
-        "\n",
-        "3. Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the `visited` dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).\n",
-        "\n",
-        "In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Cyclic Graph**: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn't fall into an infinite loop during traversal.\n",
-        "\n",
-        "\n",
-        "2. **Partial Graph Cloning**: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/178. Graph Valid Tree.ipynb b/docs/11. Graphs/178. Graph Valid Tree.ipynb
deleted file mode 100644
index e0235d6..0000000
--- a/docs/11. Graphs/178. Graph Valid Tree.ipynb	
+++ /dev/null
@@ -1,248 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 178. Graph Valid Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Graph Valid Tree problem on LintCode, click here!](https://www.lintcode.com/problem/178/)\n",
-        "\n",
-        "---\n",
-        "Given `n` nodes labeled from `0` to `n - 1` and a list of `undirected` edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You can assume that no duplicate edges will appear in edges. Since all edges are `undirected`, `[0, 1]` is the same as `[1, 0]` and thus will not appear together in edges."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a \"tree\" is a specific type of graph with the following properties:\n",
-        "\n",
-        "1. It is a connected graph, meaning there is a path between any pair of nodes in the graph.\n",
-        "2. It has no cycles, which means there are no closed loops or circuits in the graph.\n",
-        "3. It has exactly `n - 1` edges, where `n` is the number of nodes in the tree.\n",
-        "\n",
-        "The problem is typically given with two pieces of information:\n",
-        "\n",
-        "1. The number of nodes (`n`), which are usually labeled from 0 to `n-1`.\n",
-        "2. A list of undirected edges, where each edge is represented as a pair of nodes.\n",
-        "\n",
-        "The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.\n",
-        "\n",
-        "To solve this problem, you need to check the following conditions:\n",
-        "\n",
-        "1. There should be exactly `n - 1` edges to ensure that the graph is connected and tree-like.\n",
-        "2. There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.\n",
-        "3. The graph should be connected, which means you can reach any node from any other node through a series of edges.\n",
-        "\n",
-        "The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def validTree(n, edges):\n",
-        "    if len(edges) != n - 1:\n",
-        "        return False  # A tree with n nodes must have n-1 edges.\n",
-        "\n",
-        "    # Create an adjacency list to represent the graph.\n",
-        "    adj_list = {i: [] for i in range(n)}\n",
-        "    for u, v in edges:\n",
-        "        adj_list[u].append(v)\n",
-        "        adj_list[v].append(u)\n",
-        "\n",
-        "    visited = set()\n",
-        "\n",
-        "    # Define a recursive DFS function.\n",
-        "    def dfs(node, parent):\n",
-        "        if node in visited:\n",
-        "            return False  # If we encounter a visited node, there's a cycle.\n",
-        "        visited.add(node)\n",
-        "\n",
-        "        for neighbor in adj_list[node]:\n",
-        "            if neighbor != parent:\n",
-        "                if not dfs(neighbor, node):\n",
-        "                    return False\n",
-        "\n",
-        "        return True\n",
-        "\n",
-        "    # Start DFS from any node (e.g., node 0).\n",
-        "    if not dfs(0, -1):\n",
-        "        return False  # If there's a cycle, it's not a valid tree.\n",
-        "\n",
-        "    return len(visited) == n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `validTree` function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:\n",
-        "\n",
-        "1. It has exactly `n - 1` edges, where `n` is the number of nodes.\n",
-        "2. There are no cycles in the graph.\n",
-        "3. The graph is connected, meaning all nodes are reachable from any starting node.\n",
-        "\n",
-        "The code accomplishes this as follows:\n",
-        "\n",
-        "- It first checks if the number of edges is equal to `n - 1`. If not, it immediately returns `False` since a tree with `n` nodes must have `n - 1` edges to be connected.\n",
-        "\n",
-        "- It then constructs an adjacency list (`adj_list`) to represent the graph efficiently. This data structure stores the neighbors of each node.\n",
-        "\n",
-        "- The code uses a `visited` set to keep track of nodes visited during depth-first search (DFS).\n",
-        "\n",
-        "- The `dfs` function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns `False`.\n",
-        "\n",
-        "- The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.\n",
-        "\n",
-        "- After the DFS is complete, the code checks if the number of visited nodes is equal to `n`, ensuring the graph is connected.\n",
-        "\n",
-        "- Finally, if all conditions are met, the code returns `True`, indicating that the given edges form a valid tree. Otherwise, it returns `False`.\n",
-        "\n",
-        "The code provides examples to demonstrate how to use the `validTree` function to check whether a set of edges forms a valid tree or not."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 5\n",
-        "edges1 = [[0, 1], [0, 2], [0, 3], [1, 4]]\n",
-        "print(validTree(n1, edges1))  # Output: true"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 5\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]\n",
-        "print(validTree(n2, edges2))  # Output: false"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexities of the `validTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Constructing the adjacency list (`adj_list`) takes O(E) time, where E is the number of edges in the input graph (|edges|).\n",
-        "\n",
-        "2. The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.\n",
-        "\n",
-        "3. Checking if the number of visited nodes is equal to `n` takes O(1) time.\n",
-        "\n",
-        "Overall, the time complexity of the `validTree` function is O(E + V) in the worst case.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The adjacency list (`adj_list`) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.\n",
-        "\n",
-        "2. The `visited` set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.\n",
-        "\n",
-        "3. The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.\n",
-        "\n",
-        "Overall, the space complexity of the `validTree` function is O(V + E) due to the adjacency list and O(V) due to the `visited` set and DFS call stack.\n",
-        "\n",
-        "In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Minimum Spanning Tree (MST)**: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal's or Prim's algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.\n",
-        "\n",
-        "2. **Detecting Cycles**: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it's not a tree. This exercise enhances your ability to detect and visualize cycles in a graph."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/200. Number of Islands.ipynb b/docs/11. Graphs/200. Number of Islands.ipynb
deleted file mode 100644
index a8a7727..0000000
--- a/docs/11. Graphs/200. Number of Islands.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 200. Number of Islands\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Islands problem on LeetCode, click here!](https://leetcode.com/problems/number-of-islands/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return *the number of islands*. \n",
-        "\n",
-        "An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == grid.length`\n",
-        "- `n == grid[i].length`\n",
-        "- `1 <= m, n <= 300`\n",
-        "- `grid[i][j]` is `'0'` or `'1'`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is about counting the number of islands in a 2D binary grid. In this grid, '1' represents land, and '0' represents water. An island is defined as a group of '1' cells that are adjacent to each other either horizontally or vertically. It's important to note that diagonal connections do not count. Additionally, it's assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn't \"wrap around.\"\n",
-        "\n",
-        "The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected '1' cells, and these connections can only occur horizontally or vertically. If there are no '1' cells in the grid, the number of islands would be zero.\n",
-        "\n",
-        "The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one '1' cell and explore its adjacent cells to determine the extent of the island. Once you've visited all the '1' cells in an island, you move on to the next unvisited '1' cell and repeat the process until you've counted all the islands in the grid.\n",
-        "\n",
-        "In essence, the problem asks you to analyze the grid to find groups of connected '1' cells and count them as individual islands. The goal is to return the total count of islands in the given grid.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def numIslands(self, grid: List[List[str]]) -> int:\n",
-        "        if not grid:\n",
-        "            return 0\n",
-        "\n",
-        "        m, n = len(grid), len(grid[0])  # Get the dimensions of the grid\n",
-        "        num_islands = 0  # Initialize the count of islands\n",
-        "\n",
-        "        def dfs(row, col):\n",
-        "            if row < 0 or row >= m or col < 0 or col >= n or grid[row][col] == '0':\n",
-        "                return\n",
-        "\n",
-        "            grid[row][col] = '0'  # Mark the current cell as visited by changing it to '0'\n",
-        "            directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]  # Define four possible directions to move\n",
-        "\n",
-        "            for dr, dc in directions:\n",
-        "                # Explore adjacent cells\n",
-        "                dfs(row + dr, col + dc)\n",
-        "\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if grid[i][j] == '1':\n",
-        "                    num_islands += 1  # Increment the island count\n",
-        "                    dfs(i, j)  # Start a DFS from the current '1' cell to explore the entire island\n",
-        "\n",
-        "        return num_islands\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class called `Solution` with a method called `numIslands`. This class is designed to count the number of islands in a 2D binary grid.\n",
-        "\n",
-        "The `numIslands` method takes a 2D grid as input, where '1' represents land, and '0' represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:\n",
-        "\n",
-        "1. Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).\n",
-        "\n",
-        "2. Determining the dimensions of the grid (number of rows and columns).\n",
-        "\n",
-        "3. Initializing a variable `num_islands` to keep track of the count of islands.\n",
-        "\n",
-        "4. Defining a nested function `dfs` to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing '1' to '0'.\n",
-        "\n",
-        "5. In the `dfs` function, it checks for boundary conditions and whether the current cell is '0'. If these conditions are met, it returns without further exploration.\n",
-        "\n",
-        "6. The `dfs` function explores neighboring cells in all four directions (up, down, left, right) using a loop.\n",
-        "\n",
-        "7. The main loop iterates through each cell of the grid. When a '1' cell is encountered, it increments the `num_islands` count and starts a DFS from that cell to explore the entire island.\n",
-        "\n",
-        "8. Finally, the method returns the total count of islands found in the grid.\n",
-        "\n",
-        "This code encapsulates the solution in a class, allowing you to create an instance of the `Solution` class and call the `numIslands` method on it to count the number of islands in a given grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid1 = [\n",
-        "  [\"1\", \"1\", \"1\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"0\", \"0\"]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "result1 = solution.numIslands(grid1)\n",
-        "print(\"Example 1 Output:\", result1)  # Expected output: 1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid2 = [\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"1\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"1\", \"1\"]\n",
-        "]\n",
-        "\n",
-        "result2 = solution.numIslands(grid2)\n",
-        "print(\"Example 2 Output:\", result2)  # Expected output: 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a depth-first search (DFS) to explore the grid and count the number of islands.\n",
-        "- In the worst case, it visits every cell in the grid exactly once.\n",
-        "- The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of $O(4^{max(m, n)})$, where m is the number of rows and n is the number of columns.\n",
-        "- Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity is determined by the recursive calls and the depth of the DFS stack.\n",
-        "- In the worst case, when the entire grid consists of '1's, the depth of the DFS recursion can be as deep as max(m, n).\n",
-        "- Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.\n",
-        "\n",
-        "In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it's important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n))."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Identify Largest Island:** In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.\n",
-        "\n",
-        "2. **Optimize for Space:** Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/207. Course Schedule.ipynb b/docs/11. Graphs/207. Course Schedule.ipynb
deleted file mode 100644
index 37624f6..0000000
--- a/docs/11. Graphs/207. Course Schedule.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 207. Course Schedule\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Course Schedule problem on LeetCode, click here!](https://leetcode.com/problems/course-schedule/)\n",
-        "\n",
-        "---\n",
-        "There are a total of `numCourses` courses to take, labeled from 0 to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`. \n",
-        "\n",
-        "- For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.\n",
-        "\n",
-        "Return `true` if you can finish all courses. Otherwise, return `false`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `numCourses` <= 2000\n",
-        "- 0 <= `prerequisites.length` <= 5000\n",
-        "- `prerequisites[i].length` == 2\n",
-        "- 0 <= `ai`, `bi` < `numCourses`\n",
-        "- All the pairs `prerequisites[i]` are **unique**."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether it's possible to complete a set of courses given a list of prerequisites. You are given the following:\n",
-        "\n",
-        "- `numCourses`: The total number of courses to be taken, labeled from 0 to `numCourses - 1`.\n",
-        "- `prerequisites`: A list of prerequisite courses, where each element `prerequisites[i]` is a pair `[ai, bi]`, indicating that you must take course `bi` before you can take course `ai`.\n",
-        "\n",
-        "The goal is to check whether it's possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0]]`, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it's possible to complete all courses, so the function should return `True`.\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0], [0, 1]]`, it means you have two courses, but there's a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it's impossible to complete all courses, so the function should return `False`.\n",
-        "\n",
-        "The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it's possible to complete all courses; otherwise, it's not possible.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n",
-        "        # Create a graph using an adjacency list to represent the courses and their prerequisites.\n",
-        "        graph = defaultdict(list)  # Initialize an empty adjacency list.\n",
-        "        in_degree = [0] * numCourses  # Initialize an array to store in-degrees of courses.\n",
-        "\n",
-        "        # Populate the graph and calculate in-degrees.\n",
-        "        for course, prerequisite in prerequisites:\n",
-        "            graph[prerequisite].append(course)  # Add the course as a neighbor to its prerequisite.\n",
-        "            in_degree[course] += 1  # Increment the in-degree of the course.\n",
-        "\n",
-        "        # Initialize a queue with courses that have no prerequisites.\n",
-        "        queue = deque()\n",
-        "        for course in range(numCourses):\n",
-        "            if in_degree[course] == 0:\n",
-        "                queue.append(course)\n",
-        "\n",
-        "        # Perform topological sorting.\n",
-        "        while queue:\n",
-        "            course = queue.popleft()  # Take a course with no prerequisites.\n",
-        "            numCourses -= 1  # Decrement the count of remaining courses.\n",
-        "\n",
-        "            for neighbor in graph[course]:\n",
-        "                in_degree[neighbor] -= 1  # Remove the prerequisite relationship.\n",
-        "                if in_degree[neighbor] == 0:\n",
-        "                    queue.append(neighbor)  # If no more prerequisites, add to the queue.\n",
-        "\n",
-        "        # If all courses were successfully taken (numCourses becomes 0), return True.\n",
-        "        return numCourses == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here's a brief explanation of the code:\n",
-        "\n",
-        "1. The code defines a `Solution` class with a `canFinish` method that takes two parameters: `numCourses` (the total number of courses) and `prerequisites` (a list of pairs indicating which course must be taken before another).\n",
-        "\n",
-        "2. It initializes an empty graph as an adjacency list using a `defaultdict` to represent the courses and their prerequisites. It also initializes a list called `in_degree` to keep track of the in-degrees of courses, which is used in the topological sorting process.\n",
-        "\n",
-        "3. The code then populates the graph by iterating through the `prerequisites` list. For each pair `(ai, bi)`, it adds course `ai` as a neighbor to its prerequisite course `bi` in the graph and increments the in-degree of course `ai`.\n",
-        "\n",
-        "4. Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.\n",
-        "\n",
-        "5. The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).\n",
-        "\n",
-        "6. For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor's in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.\n",
-        "\n",
-        "7. The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.\n",
-        "\n",
-        "8. After the loop, if all courses were successfully taken (i.e., `numCourses` becomes 0), it means that there were no circular dependencies, and it's possible to finish all courses. In this case, the method returns `True`. Otherwise, if there are remaining courses (indicating a circular dependency), it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "numCourses1 = 2\n",
-        "prerequisites1 = [[1, 0]]\n",
-        "sol = Solution()\n",
-        "print(sol.canFinish(numCourses1, prerequisites1))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "numCourses2 = 2\n",
-        "prerequisites2 = [[1, 0], [0, 1]]\n",
-        "print(sol.canFinish(numCourses2, prerequisites2))  # Output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `canFinish` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Constructing the graph: In the first loop where we iterate through the `prerequisites` list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).\n",
-        "\n",
-        "2. Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all `numCourses` courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).\n",
-        "\n",
-        "3. Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).\n",
-        "\n",
-        "The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.\n",
-        "\n",
-        "2. In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.\n",
-        "\n",
-        "3. Queue: The space complexity for the queue is O(V), as it may contain all the courses.\n",
-        "\n",
-        "The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimizing Course Scheduling**: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.\n",
-        "\n",
-        "2. **Detecting Cycles in Course Dependencies**: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/docs/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
deleted file mode 100644
index fb186f2..0000000
--- a/docs/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb	
+++ /dev/null
@@ -1,236 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 3651. Number of Connected Components in an Undirected Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!](https://www.lintcode.com/problem/3651/)\n",
-        "\n",
-        "---\n",
-        "In this problem, there is an undirected graph with `n` nodes. There is also an `edges` array. Where `edges[i] = [a, b]` means that there is an edge between *node a* and *node b* in the graph.\n",
-        "\n",
-        "You need to return *the number of connected components in that graph*."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to determine the number of connected components in an undirected graph. Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "- You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.\n",
-        "\n",
-        "- A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.\n",
-        "\n",
-        "- Your task is to write a function that takes as input the number of nodes `n` and a list of edges `edges`, where each edge is represented as a pair of nodes `[a, b]` indicating an edge between node `a` and node `b`.\n",
-        "\n",
-        "- The goal is to determine the number of distinct connected components in the graph.\n",
-        "\n",
-        "- You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def countConnectedComponents(n, edges):\n",
-        "    # Define a helper function for depth-first search (DFS).\n",
-        "    def dfs(node):\n",
-        "        if not visited[node]:  # If the node has not been visited yet:\n",
-        "            visited[node] = True  # Mark it as visited.\n",
-        "            for neighbor in graph[node]:  # Explore all neighbors of the current node.\n",
-        "                dfs(neighbor)  # Recursively call DFS on the neighbor.\n",
-        "\n",
-        "    # Create an empty adjacency list to represent the graph.\n",
-        "    graph = [[] for _ in range(n)]\n",
-        "\n",
-        "    # Initialize a boolean list to keep track of visited nodes.\n",
-        "    visited = [False] * n\n",
-        "\n",
-        "    # Populate the adjacency list with edges from the input.\n",
-        "    for a, b in edges:\n",
-        "        graph[a].append(b)\n",
-        "        graph[b].append(a)  # Since the graph is undirected, we add edges in both directions.\n",
-        "\n",
-        "    # Initialize a counter to keep track of the number of connected components.\n",
-        "    count = 0\n",
-        "\n",
-        "    # Iterate through all nodes in the graph.\n",
-        "    for i in range(n):\n",
-        "        if not visited[i]:  # If the node has not been visited:\n",
-        "            count += 1  # Increment the count since we've found a new connected component.\n",
-        "            dfs(i)  # Start a depth-first search from the unvisited node to explore the component.\n",
-        "\n",
-        "    return count"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided Python code calculates the number of connected components in an undirected graph. Here's a high-level explanation of how the code works:\n",
-        "\n",
-        "1. The `countConnectedComponents` function takes two arguments: `n` (the number of nodes in the graph) and `edges` (a list of edge pairs representing connections between nodes).\n",
-        "\n",
-        "2. Inside the function, there is a helper function called `dfs` (depth-first search), which is used to explore and mark nodes as visited.\n",
-        "\n",
-        "3. An empty adjacency list called `graph` is created to represent the graph. The `graph` is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.\n",
-        "\n",
-        "4. Another list called `visited` is created to keep track of visited nodes. Initially, all nodes are marked as not visited (`False`).\n",
-        "\n",
-        "5. The code populates the `graph` by iterating through the `edges` list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.\n",
-        "\n",
-        "6. A counter variable called `count` is initialized to keep track of the number of connected components.\n",
-        "\n",
-        "7. The code iterates through all nodes from `0` to `n-1`. For each node, it checks whether it has been visited yet. If it hasn't been visited, it means a new connected component is found. The counter `count` is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.\n",
-        "\n",
-        "8. The `dfs` function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling `dfs` on unvisited neighbors.\n",
-        "\n",
-        "9. After the loop through all nodes, the `count` variable contains the total number of connected components in the graph.\n",
-        "\n",
-        "10. The function returns the value of `count`, which represents the number of connected components.\n",
-        "\n",
-        "11. Two examples are provided at the end to demonstrate how to use the function with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 3\n",
-        "edges1 = [[0, 1], [0, 2]]\n",
-        "print(countConnectedComponents(n1, edges1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 6\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [4, 5]]\n",
-        "print(countConnectedComponents(n2, edges2))  # Output: 2"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through all nodes in the graph (from 0 to `n-1`).\n",
-        "- For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.\n",
-        "- In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.\n",
-        "- The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.\n",
-        "- In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.\n",
-        "\n",
-        "So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The main data structures used are the `graph` (adjacency list), `visited` (boolean array), and the recursive call stack for DFS.\n",
-        "- The `graph` has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.\n",
-        "- The `visited` boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.\n",
-        "- The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.\n",
-        "\n",
-        "So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).\n",
-        "\n",
-        "In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Disconnected Components with Multiple Queries:** You are given an undirected graph with `n` nodes and `m` edges. Initially, the graph is disconnected, and you need to process `q` queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.\n",
-        "\n",
-        "2. **Maximum Size of Connected Components:** Given an undirected graph with `n` nodes and `m` edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.\n"
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/docs/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
deleted file mode 100644
index eb34497..0000000
--- a/docs/11. Graphs/417. Pacific Atlantic Water Flow.ipynb	
+++ /dev/null
@@ -1,261 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 417. Pacific Atlantic Water Flow\n",
-        "\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Pacific Atlantic Water Flow problem on LeetCode, click here!](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n",
-        "\n",
-        "---\n",
-        "There is an `m x n` rectangular island that borders both the **Pacific Ocean** and **Atlantic Ocean**. The **Pacific Ocea**n touches the island's left and top edges, and the **Atlantic Ocean** touches the island's right and bottom edges.\n",
-        "\n",
-        "The island is partitioned into a grid of square cells. You are given an `m x n` integer matrix `heights` where `heights[r][c]` represents the **height above sea level** of the cell at coordinate `(r, c)`.\n",
-        "\n",
-        "The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is **less than or equal to** the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.\n",
-        "\n",
-        "Return *a **2D list** of grid coordinates `result` where $result[i] = [r_i, c_i]$ denotes that rain water can flow from cell $(r_i, c_i)$ to **both** the Pacific and Atlantic oceans*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == heights.length`\n",
-        "- `n == heights[r].length`\n",
-        "- `1 <= m, n <= 200`\n",
-        "- 0 <= `heights[r][c]` <= $10^5$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island's left and top edges, while the Atlantic Ocean is in contact with the island's right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "Here are the key details and constraints of the problem:\n",
-        "\n",
-        "1. The island is divided into a grid of square cells.\n",
-        "\n",
-        "2. Each cell is represented by an integer value in a matrix `heights`. The value at `heights[r][c]` represents the height above sea level of the cell at coordinates `(r, c)` on the island.\n",
-        "\n",
-        "3. Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "4. Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.\n",
-        "\n",
-        "The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.\n",
-        "\n",
-        "The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.\n",
-        "\n",
-        "The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:\n",
-        "        # Check if the input matrix is empty\n",
-        "        if not heights:\n",
-        "            return []\n",
-        "        \n",
-        "        m, n = len(heights), len(heights[0])\n",
-        "        \n",
-        "        # Initialize boolean matrices to keep track of cells reachable from each ocean\n",
-        "        pacific_reachable = [[False] * n for _ in range(m)]\n",
-        "        atlantic_reachable = [[False] * n for _ in range(m)]\n",
-        "        \n",
-        "        # Depth-First Search (DFS) function to mark cells that can be reached from an ocean\n",
-        "        def dfs(x, y, reachable):\n",
-        "            if reachable[x][y]:\n",
-        "                return\n",
-        "            reachable[x][y] = True\n",
-        "            for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n",
-        "                new_x, new_y = x + dx, y + dy\n",
-        "                if 0 <= new_x < m and 0 <= new_y < n and heights[new_x][new_y] >= heights[x][y]:\n",
-        "                    dfs(new_x, new_y, reachable)\n",
-        "        \n",
-        "        # Start DFS from the Pacific Ocean (left and top edges)\n",
-        "        for i in range(m):\n",
-        "            dfs(i, 0, pacific_reachable)\n",
-        "            dfs(i, n - 1, atlantic_reachable)\n",
-        "        \n",
-        "        for j in range(n):\n",
-        "            dfs(0, j, pacific_reachable)\n",
-        "            dfs(m - 1, j, atlantic_reachable)\n",
-        "        \n",
-        "        result = []\n",
-        "        \n",
-        "        # Find cells that can flow to both the Pacific and Atlantic oceans\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if pacific_reachable[i][j] and atlantic_reachable[i][j]:\n",
-        "                    result.append([i, j])\n",
-        "        \n",
-        "        return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class called `Solution` with a method named `pacificAtlantic`. This method takes a 2D matrix `heights`, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, `pacific_reachable` and `atlantic_reachable`, to keep track of cells that can be reached from each ocean.\n",
-        "\n",
-        "The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the `result` list.\n",
-        "\n",
-        "Finally, the code returns the `result` list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "heights1 = [\n",
-        "    [1,2,2,3,5],\n",
-        "    [3,2,3,4,4],\n",
-        "    [2,4,5,3,1],\n",
-        "    [6,7,1,4,5],\n",
-        "    [5,1,1,2,4]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "print(solution.pacificAtlantic(heights1)) # Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "heights2 = [[1]]\n",
-        "print(solution.pacificAtlantic(heights2)) # Expected Output: [[0, 0]]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of this solution is O(m * n), where 'm' is the number of rows in the input matrix and 'n' is the number of columns. Here's a breakdown of the time complexity:\n",
-        "\n",
-        "1. Creating the `pacific_reachable` and `atlantic_reachable` matrices with dimensions m x n takes O(m * n) time.\n",
-        "\n",
-        "2. Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.\n",
-        "\n",
-        "3. The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.\n",
-        "\n",
-        "4. The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.\n",
-        "\n",
-        "Overall, the time complexity is dominated by the DFS and is O(m * n).\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of this solution is also O(m * n). Here's how the space is used:\n",
-        "\n",
-        "1. Two boolean matrices, `pacific_reachable` and `atlantic_reachable`, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.\n",
-        "\n",
-        "2. The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).\n",
-        "\n",
-        "3. The `result` list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.\n",
-        "\n",
-        "The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.\n",
-        "\n",
-        "2. **Efficiency Challenge:** Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/11. Graphs/README.md b/docs/11. Graphs/README.md
deleted file mode 100644
index aad262c..0000000
--- a/docs/11. Graphs/README.md	
+++ /dev/null
@@ -1,23 +0,0 @@
-# Graphs Problems - Blind 75 LeetCode
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/12. Advanced Graphs/892. Alien Dictionary.ipynb b/docs/12. Advanced Graphs/892. Alien Dictionary.ipynb
deleted file mode 100644
index 81f0e5b..0000000
--- a/docs/12. Advanced Graphs/892. Alien Dictionary.ipynb	
+++ /dev/null
@@ -1,256 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 892. Alien Dictionary\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Alien Dictionary problem on LintCode, click here!](https://www.lintcode.com/problem/892/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of **non-empty** words from the dictionary, where words are **sorted lexicographically by the rules of this new language**. Derive the order of letters in this language.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You may assume all letters are in lowercase.\n",
-        "- The dictionary is invalid, if string a is prefix of string b and b is appear before a.\n",
-        "- If the order is invalid, return an empty string.\n",
-        "- There may be multiple valid order of letters, return the smallest in normal lexicographical order.\n",
-        "- The letters in **one** string are of the same rank by default and are sorted in Human dictionary order."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.\n",
-        "\n",
-        "Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "1. The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.\n",
-        "\n",
-        "2. Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.\n",
-        "\n",
-        "3. Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string 'a' is a prefix of another string 'b,' and 'b' appears before 'a' in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.\n",
-        "\n",
-        "4. Multiple valid orders: It's possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.\n",
-        "\n",
-        "To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it's valid, and an empty string if the order is invalid.\n",
-        "\n",
-        "The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "\n",
-        "def alienOrder(words):\n",
-        "    # Create an adjacency list to represent the graph\n",
-        "    graph = defaultdict(list)\n",
-        "    \n",
-        "    # Create a dictionary to store the in-degrees of each letter\n",
-        "    in_degree = {}\n",
-        "    \n",
-        "    # Initialize in-degrees to 0 for all letters\n",
-        "    for word in words:\n",
-        "        for char in word:\n",
-        "            if char not in in_degree:\n",
-        "                in_degree[char] = 0\n",
-        "    \n",
-        "    # Build the graph and update in-degrees\n",
-        "    for i in range(1, len(words)):\n",
-        "        word1, word2 = words[i-1], words[i]\n",
-        "        min_length = min(len(word1), len(word2))\n",
-        "        \n",
-        "        # Compare characters in the two words\n",
-        "        j = 0\n",
-        "        while j < min_length and word1[j] == word2[j]:\n",
-        "            j += 1\n",
-        "        \n",
-        "        if j < min_length:\n",
-        "            # If word1[j] is lexicographically before word2[j], add an edge\n",
-        "            graph[word1[j]].append(word2[j])\n",
-        "            in_degree[word2[j]] += 1\n",
-        "            \n",
-        "            # Break the loop to avoid further comparisons\n",
-        "            break\n",
-        "    \n",
-        "    # Perform topological sorting using Kahn's algorithm\n",
-        "    result = []\n",
-        "    queue = deque([char for char in in_degree if in_degree[char] == 0])\n",
-        "    \n",
-        "    while queue:\n",
-        "        char = queue.popleft()\n",
-        "        result.append(char)\n",
-        "        \n",
-        "        for neighbor in graph[char]:\n",
-        "            in_degree[neighbor] -= 1\n",
-        "            if in_degree[neighbor] == 0:\n",
-        "                queue.append(neighbor)\n",
-        "    \n",
-        "    # Check if there is a valid order\n",
-        "    if len(result) < len(in_degree):\n",
-        "        return \"\"\n",
-        "    \n",
-        "    return \"\".join(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.\n",
-        "\n",
-        "The code follows these main steps:\n",
-        "\n",
-        "1. Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called `in_degree` to keep track of the in-degrees (the number of letters that precede a letter) for each letter.\n",
-        "\n",
-        "2. Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the `in_degree` dictionary with an initial in-degree of 0.\n",
-        "\n",
-        "3. Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there's an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.\n",
-        "\n",
-        "4. After constructing the graph, the code performs a topological sorting of the letters using Kahn's algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.\n",
-        "\n",
-        "5. Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there's a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.\n",
-        "\n",
-        "The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "wrtef\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "words1 = [\"wrt\", \"wrf\", \"er\", \"ett\", \"rftt\"]\n",
-        "print(alienOrder(words1))  # Output: \"wertf\""
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "zx\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "words2 = [\"z\", \"x\"]\n",
-        "print(alienOrder(words2))  # Output: \"zx\""
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for determining the order of letters in an alien language.\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.\n",
-        "2. Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.\n",
-        "\n",
-        "Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.\n",
-        "2. Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.\n",
-        "3. Queue: The space used by the queue during topological sorting is also O(V).\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.\n",
-        "\n",
-        "In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.\n",
-        "\n",
-        "In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Valid Orders**: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.\n",
-        "\n",
-        "2. **Detect Invalid Dictionary**: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/12. Advanced Graphs/README.md b/docs/12. Advanced Graphs/README.md
deleted file mode 100644
index f362de7..0000000
--- a/docs/12. Advanced Graphs/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Advanced Graphs Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/13. One-D Dynamic Programming/198. House Robber.ipynb b/docs/13. One-D Dynamic Programming/198. House Robber.ipynb
deleted file mode 100644
index 8d32e21..0000000
--- a/docs/13. One-D Dynamic Programming/198. House Robber.ipynb	
+++ /dev/null
@@ -1,103 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night.**\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight **without alerting the police**.*\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 400`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nThe problem is a classic dynamic programming challenge known as the \"House Robber\" problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.\n\nThe goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.\n\nThe input to the problem is an array `nums`, where `nums[i]` represents the amount of money in the `i`-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.\n\nFor example:\n```\nInput: nums = [1,2,3,1]\nOutput: 4\nExplanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).\nTotal amount you can rob = 1 + 3 = 4.\n\nInput: nums = [2,7,9,3,1]\nOutput: 12\nExplanation: Rob house 1 (money = 2), rob house 3 (money = 9), and rob house 5 (money = 1).\nTotal amount you can rob = 2 + 9 + 1 = 12.\n```\n\nThe challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        # Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses\n        prev, curr = 0, 0\n\n        # Iterate through the houses\n        for n in nums:\n            # Calculate the maximum amount of money that can be robbed at the current house\n            # It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),\n            # or skipping the current house and taking the maximum amount from the previous house (curr)\n            temp = max(n + prev, curr)\n\n            # Update the variables for the next iteration\n            prev, curr = curr, temp\n\n        # The final result is the maximum amount of money that can be robbed at the last house\n        return curr",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 4,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code is a Python implementation of the \"House Robber\" problem using a dynamic programming approach. It's part of a class `Solution` and includes a method `rob` that takes a list of integers `nums` as input and returns the maximum amount of money that can be robbed without alerting the police.\n\nThe key idea of the algorithm is to maintain two variables, `prev` and `curr`, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.\n\nThe loop calculates a temporary variable `temp` that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (`n + prev`), or skipping the current house and taking the maximum amount from the previous house (`curr`). The maximum of these two scenarios is assigned to `temp`.\n\nThe `prev` and `curr` variables are then updated for the next iteration. `prev` is set to the previous value of `curr`, and `curr` is set to the calculated `temp`.\n\nThe final result is the value stored in the `curr` variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the `rob` method.\n\nThe provided test cases at the end demonstrate the usage of the `rob` method with different input arrays.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\nsol = Solution()\n\nnums1 = [1, 2, 3, 1]\nprint(sol.rob(nums1))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 5,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [2, 7, 9, 3, 1]\nprint(sol.rob(nums2))  # Output: 12",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 6,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "12\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code.\n\n### Time Complexity:\n\nThe time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).\n\n### Space Complexity:\n\nThe space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables `prev`, `curr`, and `temp` are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).\n\nIn summary:\n- Time Complexity: O(n)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Variation with Maximum Number of Houses to Rob:** Modify the problem to include an additional constraint: you are allowed to rob at most 'k' houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.\n\n2. **Robbing in a Circular Street:** Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.\n\n\n**Link to Problem:** [To see the House Robber problem on LeetCode, click here!](https://leetcode.com/problems/house-robber/description/)\n",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/docs/13. One-D Dynamic Programming/213. House Robber II.ipynb b/docs/13. One-D Dynamic Programming/213. House Robber II.ipynb
deleted file mode 100644
index b1080e8..0000000
--- a/docs/13. One-D Dynamic Programming/213. House Robber II.ipynb	
+++ /dev/null
@@ -1,119 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber II\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle**. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatically contact the police if two adjacent houses were broken into on the same night**.\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight without alerting the police*.\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 1000`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nCertainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.\n\nThe twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.\n\nThe goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array `nums` representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.\n\nHere are a few examples to illustrate the problem:\n\n1. **Example 1:**\n   ```python\n   Input: nums = [2, 3, 2]\n   Output: 3\n   Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2) because they are adjacent houses. The optimal strategy is to rob house 2 (money = 3).\n   ```\n\n2. **Example 2:**\n   ```python\n   Input: nums = [1, 2, 3, 1]\n   Output: 4\n   Explanation: Robbing house 1 (money = 1) and then robbing house 3 (money = 3) results in a total amount of 4. Robbing house 2 is skipped to avoid alerting the police.\n   ```\n\n3. **Example 3:**\n   ```python\n   Input: nums = [1, 2, 3]\n   Output: 3\n   Explanation: Since the houses are in a circle, you can choose either house 1, 2, or 3. The optimal strategy is to rob house 3 for a total amount of 3.\n   ```\n\nThe constraints for the problem are that the length of the `nums` array is between 1 and 100, and the amount of money in each house (`nums[i]`) is between 0 and 1000.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        def simple_rob(nums):\n            # Helper function for basic house robbery problem\n            prev, curr = 0, 0\n            for num in nums:\n                # Calculate the maximum amount of money that can be robbed\n                # without alerting the police for each house\n                prev, curr = curr, max(prev + num, curr)\n            return curr\n\n        # Check the base cases where the length of nums is 1 or 2\n        if len(nums) == 1:\n            return nums[0]\n        elif len(nums) == 2:\n            return max(nums[0], nums[1])\n\n        # Case 1: First house is robbed, last house is not\n        case1 = simple_rob(nums[:-1])\n\n        # Case 2: First house is not robbed, last house is\n        case2 = simple_rob(nums[1:])\n\n        # Maximum of the two cases\n        return max(case1, case2)",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 7,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code defines a class `Solution` with a method `rob`, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.\n\nThe code uses dynamic programming to solve the problem efficiently. It contains a helper function `simple_rob` that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method `rob` handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.\n\nThe class is instantiated as `solution`, and the `rob` method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\n\n# Create an instance of the Solution class\nsolution = Solution()\n\nnums1 = [2, 3, 2]\nprint(solution.rob(nums1))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 8,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [1, 2, 3, 1]\nprint(solution.rob(nums2))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 9,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums3 = [1, 2, 3]\nprint(solution.rob(nums3))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 10,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "e6e1554f-ae77-410c-8af2-e59e5428166c"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code:\n\n### Time Complexity:\nThe time complexity is primarily determined by the `simple_rob` helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main `rob` function calls `simple_rob` twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).\n\n### Space Complexity:\nThe space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are `prev` and `curr` in the `simple_rob` function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).\n\nIn summary:\n- Time Complexity: O(N)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Optimization Challenge:** Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?\n\n2. **Circular Robbery Variations:** Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.\n\n**Link to Problem:** [To see the House Robber II problem on LeetCode, click here!](https://leetcode.com/problems/house-robber-ii/)",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/docs/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/docs/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
deleted file mode 100644
index b727489..0000000
--- a/docs/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 70. Climbing Stairs\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Climbing Stairs problem on LeetCode, click here!](https://leetcode.com/problems/climbing-stairs/)\n",
-        "\n",
-        "---\n",
-        "You are climbing a staircase. It takes `n` steps to reach the top.\n",
-        "\n",
-        "Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= n <= 45`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Climbing Stairs\" problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here's the problem statement:\n",
-        "\n",
-        "You are given a staircase with 'n' steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.\n",
-        "\n",
-        "For example, if 'n' is 2, there are two ways to climb to the top:\n",
-        "\n",
-        "1. Climbing two steps at once.\n",
-        "2. Climbing one step, and then another step.\n",
-        "\n",
-        "If 'n' is 3, there are three ways:\n",
-        "\n",
-        "1. Climbing one step, then one step, and finally one step.\n",
-        "2. Climbing one step, then two steps.\n",
-        "3. Climbing two steps, then one step.\n",
-        "\n",
-        "The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It's a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Solution:\n",
-        "    def climbStairs(self, n: int) -> int:\n",
-        "        # If there are 1 or 2 steps, there are exactly n ways to reach the top.\n",
-        "        if n <= 2:\n",
-        "            return n\n",
-        "\n",
-        "        # Create an array to store the number of ways to reach each step.\n",
-        "        dp = [0] * (n + 1)\n",
-        "\n",
-        "        # There is one way to reach the first step (base case).\n",
-        "        dp[1] = 1\n",
-        "\n",
-        "        # There are two ways to reach the second step (base case).\n",
-        "        dp[2] = 2\n",
-        "\n",
-        "        # Calculate the number of ways to reach each step from the previous steps.\n",
-        "        for i in range(3, n + 1):\n",
-        "            # The number of ways to reach step 'i' is the sum of the ways to reach\n",
-        "            # the previous two steps, as you can take 1 or 2 steps at a time.\n",
-        "            dp[i] = dp[i - 1] + dp[i - 2]\n",
-        "\n",
-        "        # The result is the number of ways to reach the top, which is stored in dp[n].\n",
-        "        return dp[n]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class `Solution` with a method `climbStairs` that takes an integer `n` as input and returns the number of distinct ways to climb a staircase with `n` steps.\n",
-        "\n",
-        "1. If `n` is 1 or 2, the function returns `n` directly because there are only 1 or 2 distinct ways to reach the top in those cases.\n",
-        "\n",
-        "2. For `n` greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array `dp` of length `n + 1` to store these values.\n",
-        "\n",
-        "3. The `dp[1]` and `dp[2]` are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).\n",
-        "\n",
-        "4. The code then uses a loop to fill in the `dp` array for steps 3 and above. For each step `i` from 3 to `n`, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.\n",
-        "\n",
-        "5. Finally, the function returns the value stored in `dp[n]`, which represents the total number of distinct ways to climb the staircase with `n` steps."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 - Input: n = 2, Output: 2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "n = 2\n",
-        "solution = Solution()\n",
-        "print(f\"Example 1 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 2"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 - Input: n = 3, Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "n = 3\n",
-        "print(f\"Example 2 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the `dp` array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value `n`.\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of the solution is O(n) as well. We use an array `dp` of length `n + 1` to store the number of ways to reach each step. The size of this array is directly proportional to the input value `n`, which makes the space complexity linear in terms of `n`. The rest of the variables used in the function (e.g., `i`) occupy constant space and do not contribute significantly to the overall space complexity.\n",
-        "\n",
-        "In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the \"Climbing Stairs\" problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized Step Sizes**: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes `[1, 2, 3]`. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.\n",
-        "\n",
-        "2. **Minimize Steps**: Given an integer `n`, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/13. One-D Dynamic Programming/README.md b/docs/13. One-D Dynamic Programming/README.md
deleted file mode 100644
index 73f4de3..0000000
--- a/docs/13. One-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,25 +0,0 @@
-# 1-D Dynamic Programming Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Medium     |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/14. Two-D Dynamic Programming/README.md b/docs/14. Two-D Dynamic Programming/README.md
deleted file mode 100644
index 8bab876..0000000
--- a/docs/14. Two-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### 2-D Dynamic Programming
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/15. Greedy/README.md b/docs/15. Greedy/README.md
deleted file mode 100644
index 82b6543..0000000
--- a/docs/15. Greedy/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Greedy
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/16. Intervals/README.md b/docs/16. Intervals/README.md
deleted file mode 100644
index a57713e..0000000
--- a/docs/16. Intervals/README.md	
+++ /dev/null
@@ -1,50 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Intervals
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/17. Math Geometry/README.md b/docs/17. Math Geometry/README.md
deleted file mode 100644
index 8b2f180..0000000
--- a/docs/17. Math Geometry/README.md	
+++ /dev/null
@@ -1,48 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Math & Geometry
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/18. Bit Manipulation/README.md b/docs/18. Bit Manipulation/README.md
deleted file mode 100644
index 05b2fef..0000000
--- a/docs/18. Bit Manipulation/README.md	
+++ /dev/null
@@ -1,51 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Bit Manupulation
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/Book.ipynb b/docs/Book.ipynb
deleted file mode 100644
index e7b4f46..0000000
--- a/docs/Book.ipynb
+++ /dev/null
@@ -1,400 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 34,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "\u001b[01mmaking output directory... \u001b[39;49;00mdone\n",
-      "[etoc] Changing master_doc to 'README'\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]  \n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.26 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.00 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]     \n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.92 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 0.90 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.28 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executing notebook using local CWD [mystnb]      \n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executed notebook in 1.17 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executed notebook in 1.16 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executing notebook using local CWD [mystnb] \n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executed notebook in 1.27 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executed notebook in 1.24 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executed notebook in 4.03 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executing notebook using local CWD [mystnb]   \n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/Book.ipynb: Executing notebook using local CWD [mystnb]                          \n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mSECURITY\u001b[39;49;00m                                              \n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb:30008: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Executing notebook failed: CellTimeoutError [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Notebook exception traceback saved in: /workspaces/LeetCode-Solutions/_build/html/reports/Book.err.log [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CODE_OF_CONDUCT.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/SECURITY.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mSECURITY\u001b[39;49;00m                                               raph\u001b[39;49;00m0m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:8: WARNING: 'myst' reference target not found: #ways-to-contribute\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:9: WARNING: 'myst' reference target not found: #getting-started\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:10: WARNING: 'myst' reference target not found: #contributing-process\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md:11: WARNING: 'myst' reference target not found: #code-of-conduct\u001b[39;49;00m\n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'README.html'\n",
-      "\u001b[01mbuild succeeded, 11 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in _build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    _build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    _build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
diff --git a/docs/CODE_OF_CONDUCT.md b/docs/CODE_OF_CONDUCT.md
deleted file mode 100644
index 5fe5041..0000000
--- a/docs/CODE_OF_CONDUCT.md
+++ /dev/null
@@ -1,128 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, religion, or sexual identity
-and orientation.
-
-We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.
-
-## Our Standards
-
-Examples of behavior that contributes to a positive environment for our
-community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes,
-  and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the
-  overall community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or
-  advances of any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or email
-  address, without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Enforcement Responsibilities
-
-Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.
-
-Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.
-
-## Scope
-
-This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official e-mail address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-Email.
-All complaints will be reviewed and investigated promptly and fairly.
-
-All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.
-
-## Enforcement Guidelines
-
-Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:
-
-### 1. Correction
-
-**Community Impact**: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.
-
-**Consequence**: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.
-
-### 2. Warning
-
-**Community Impact**: A violation through a single incident or series
-of actions.
-
-**Consequence**: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or
-permanent ban.
-
-### 3. Temporary Ban
-
-**Community Impact**: A serious violation of community standards, including
-sustained inappropriate behavior.
-
-**Consequence**: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.
-
-### 4. Permanent Ban
-
-**Community Impact**: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior,  harassment of an
-individual, or aggression toward or disparagement of classes of individuals.
-
-**Consequence**: A permanent ban from any sort of public interaction within
-the community.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage],
-version 2.0, available at
-https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
-
-Community Impact Guidelines were inspired by [Mozilla's code of conduct
-enforcement ladder](https://github.com/mozilla/diversity).
-
-[homepage]: https://www.contributor-covenant.org
-
-For answers to common questions about this code of conduct, see the FAQ at
-https://www.contributor-covenant.org/faq. Translations are available at
-https://www.contributor-covenant.org/translations.
diff --git a/docs/CONTRIBUTING.md b/docs/CONTRIBUTING.md
deleted file mode 100644
index ca794ef..0000000
--- a/docs/CONTRIBUTING.md
+++ /dev/null
@@ -1,79 +0,0 @@
-# Contributing Guidelines
-
-Thank you for considering contributing to the Blind 75 LeetCode repository! We welcome contributions from the community to help improve this resource and make it even more valuable.
-
-Please take a moment to review this document to understand how you can contribute.
-
-## Table of Contents
-- [Ways to Contribute](#ways-to-contribute)
-- [Getting Started](#getting-started)
-- [Contributing Process](#contributing-process)
-- [Code of Conduct](#code-of-conduct)
-
-## Ways to Contribute
-
-There are several ways you can contribute to this repository:
-
-1. **Suggest Improvements**: If you have ideas for making the Blind 75 LeetCode repository better, please open an issue to discuss your suggestions.
-
-2. **Report Issues**: If you encounter any issues with the existing content or code, please open an issue and provide as much detail as possible.
-
-3. **Contribute Solutions**: You can contribute solutions to the problems listed in the repository. Please follow the guidelines mentioned below when submitting your solutions.
-
-4. **Enhance Documentation**: Improve documentation, including explanations and time/space complexity analysis, for existing solutions.
-
-5. **Fix Bugs**: If you find and fix any bugs in the existing code or documentation, you are welcome to submit a pull request.
-
-## Getting Started
-
-Before you start contributing, please ensure you have the following prerequisites:
-
-- A GitHub account.
-- Familiarity with Git and GitHub.
-- Code editor or IDE for making changes.
-
-## Contributing Process
-
-Here's the general process for contributing:
-
-1. **Fork the Repository**: Click the "Fork" button at the top of this repository to create your copy.
-
-2. **Clone Your Fork**: Clone your fork to your local machine.
-
-    ```
-    git clone https://github.com/your-username/Blind-75-LeetCode.git
-    ```
-
-3. **Create a Branch**: Create a new branch for your contribution.
-
-    ```
-    git checkout -b feature/your-feature-name
-    ```
-
-4. **Make Changes**: Implement your changes, following the guidelines provided.
-
-5. **Test Your Changes**: Ensure that your changes do not introduce new issues and are consistent with the repository's style and structure.
-
-6. **Commit Changes**: Commit your changes with a meaningful commit message.
-
-    ```
-    git commit -m "Add solution to problem X"
-    ```
-
-7. **Push Changes**: Push your changes to your fork on GitHub.
-
-    ```
-    git push origin feature/your-feature-name
-    ```
-
-8. **Create a Pull Request**: Go to the original repository and create a pull request. Please provide a detailed description of your changes.
-
-9. **Review and Collaboration**: Your pull request will be reviewed, and you may need to make further changes. Be responsive to comments and feedback.
-
-10. **Merge**: Once your pull request is approved, it will be merged into the main branch.
-
-## Code of Conduct
-
-Please note that we have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-We appreciate your contributions to the Blind 75 LeetCode repository and look forward to working together to make it an even better resource for the community!
diff --git a/docs/LICENSE b/docs/LICENSE
deleted file mode 100644
index 8818d1f..0000000
--- a/docs/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2023 Mohsen Tabibian
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/docs/README.md b/docs/README.md
deleted file mode 100644
index a9b8b2e..0000000
--- a/docs/README.md
+++ /dev/null
@@ -1,216 +0,0 @@
-# Blind 75 LeetCode Solutions
-
-![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Solutions-blue?labelColor=red)
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Array & Hashing
-![Array & Hashing](https://img.shields.io/badge/Array_&_Hashing-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                        | Easy       |
-| [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)                                  | Easy       |
-| [1. Two Sum](https://leetcode.com/problems/two-sum/)                                              | Easy       |
-| [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/)                                | Medium     |
-| [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)              | Medium     |
-| [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)    | Medium     |
-| [659. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)          | Medium     |
-| [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)    | Hard       |
-
-### Two Pointers
-![Array & Hashing](https://img.shields.io/badge/Two_Pointers-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-### Sliding Window
-![Array & Hashing](https://img.shields.io/badge/Sliding_Window-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-### Stack
-![Array & Hashing](https://img.shields.io/badge/Stack-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-### Binary Search
-![Array & Hashing](https://img.shields.io/badge/Binary_Search-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-### Linked List
-![Array & Hashing](https://img.shields.io/badge/Linked_List-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-### Trees
-![Array & Hashing](https://img.shields.io/badge/Trees-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-### Tries
-![Array & Hashing](https://img.shields.io/badge/Tries-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-### Heap / Priority Queue
-![Array & Hashing](https://img.shields.io/badge/Heap_/_Priority_Queue-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-### Backtracking
-![Array & Hashing](https://img.shields.io/badge/Backtracking-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)                                 | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                                         | Medium     |
-
-### Graphs
-![Array & Hashing](https://img.shields.io/badge/Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-### Advanced Graphs
-![Array & Hashing](https://img.shields.io/badge/Advanced_Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-### 1-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/1_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Easy       |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-### 2-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/2_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-### Greedy
-![Array & Hashing](https://img.shields.io/badge/Greedy-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-### Intervals
-![Array & Hashing](https://img.shields.io/badge/Intervals-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-### Math & Geometry
-![Array & Hashing](https://img.shields.io/badge/Math_&_Geometry-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-### Bit Manipulation
-![Array & Hashing](https://img.shields.io/badge/Bit_Manipulation-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-## Code of Conduct
-
-We have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-## Security Policy
-
-We take security seriously. Please review our [Security Policy](SECURITY.md) for information on reporting security vulnerabilities.
-
-Happy coding!
diff --git a/docs/SECURITY.md b/docs/SECURITY.md
deleted file mode 100644
index 7c19993..0000000
--- a/docs/SECURITY.md
+++ /dev/null
@@ -1,42 +0,0 @@
-# Security Policy
-
-## Reporting a Vulnerability
-
-We take the security of the Blind 75 LeetCode repository seriously. If you believe you have found a security vulnerability, please help us by following these steps:
-
-1. **Do Not Disclose Publicly**: Please do not disclose the issue publicly until it has been addressed by our team.
-
-2. **Report Privately**: Create a GitHub issue with the title "Security Vulnerability Report" and provide a detailed description of the vulnerability. You can use a sample report template as follows:
-
-    ```
-    **Description**
-    A clear and concise description of the security vulnerability.
-
-    **Steps to Reproduce**
-    Provide detailed steps on how to reproduce the vulnerability.
-
-    **Expected Behavior**
-    Describe what you expected to happen.
-
-    **Actual Behavior**
-    Describe what actually happened.
-
-    **Additional Information**
-    Any additional information that can help us understand and reproduce the issue, such as environment details, configuration, or screenshots.
-    ```
-
-3. **Secure Communication**: If the vulnerability involves sensitive data, please encrypt your communication with our PGP key. Contact us for our PGP key information.
-
-4. **Response**: We will acknowledge your report within 5 business days and provide an estimated timeline for the resolution.
-
-5. **Fix and Disclosure**: We will work to fix the issue promptly and privately. Once resolved, we will provide a security advisory and give credit to the reporter if desired.
-
-6. **Responsible Disclosure**: We encourage responsible disclosure. Please do not take advantage of the vulnerability or attempt to exploit it for malicious purposes.
-
-## Security Updates
-
-We are committed to promptly addressing and resolving any security issues. We recommend that you stay up-to-date with the latest releases of this repository, as they may include security updates and fixes.
-
-## Contact
-
-If you have any questions or need further assistance regarding security, you can contact us at mohsentabibian@gmail.com.
diff --git a/docs/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree b/docs/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree
deleted file mode 100644
index 5390e09..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/1. Two Sum.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree b/docs/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree
deleted file mode 100644
index 28888ec..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/128. Longest Consecutive Sequence.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree b/docs/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree
deleted file mode 100644
index b30e57f..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/217. Contains Duplicate.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree b/docs/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree
deleted file mode 100644
index d1df60d..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/238. Product of Array Except Self.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree b/docs/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree
deleted file mode 100644
index 8187aae..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/242. Valid Anagram.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree b/docs/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree
deleted file mode 100644
index 127b43b..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/347. Top K Frequent Elements.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree b/docs/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree
deleted file mode 100644
index 13c81c2..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/49. Group Anagrams.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree b/docs/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree
deleted file mode 100644
index 3b9c658..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/659. Encode and Decode Strings.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/01. Array Hashing/README.doctree b/docs/_build/.doctrees/01. Array Hashing/README.doctree
deleted file mode 100644
index f9bd117..0000000
Binary files a/docs/_build/.doctrees/01. Array Hashing/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree b/docs/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree
deleted file mode 100644
index 6939264..0000000
Binary files a/docs/_build/.doctrees/02. Two Pointers/11. Container With Most Water.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree b/docs/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree
deleted file mode 100644
index fab66a6..0000000
Binary files a/docs/_build/.doctrees/02. Two Pointers/125. Valid Palindrome.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree b/docs/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree
deleted file mode 100644
index db856f1..0000000
Binary files a/docs/_build/.doctrees/02. Two Pointers/15. 3Sum.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/02. Two Pointers/README.doctree b/docs/_build/.doctrees/02. Two Pointers/README.doctree
deleted file mode 100644
index 311c6a1..0000000
Binary files a/docs/_build/.doctrees/02. Two Pointers/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree b/docs/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree
deleted file mode 100644
index a6bbeb3..0000000
Binary files a/docs/_build/.doctrees/03. Sliding Window/121. Best Time to Buy and Sell Stock.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree b/docs/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree
deleted file mode 100644
index 3d83c09..0000000
Binary files a/docs/_build/.doctrees/03. Sliding Window/3. Longest Substring Without Repeating Characters.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree b/docs/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree
deleted file mode 100644
index a107741..0000000
Binary files a/docs/_build/.doctrees/03. Sliding Window/424. Longest Repeating Character Replacement.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree b/docs/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree
deleted file mode 100644
index 55bd42c..0000000
Binary files a/docs/_build/.doctrees/03. Sliding Window/76. Minimum Window Substring.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/03. Sliding Window/README.doctree b/docs/_build/.doctrees/03. Sliding Window/README.doctree
deleted file mode 100644
index 384aba6..0000000
Binary files a/docs/_build/.doctrees/03. Sliding Window/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree b/docs/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree
deleted file mode 100644
index e3a1f1d..0000000
Binary files a/docs/_build/.doctrees/04. Stack/20. Valid Parentheses.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/04. Stack/README.doctree b/docs/_build/.doctrees/04. Stack/README.doctree
deleted file mode 100644
index b68b301..0000000
Binary files a/docs/_build/.doctrees/04. Stack/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree b/docs/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree
deleted file mode 100644
index f3ad3ed..0000000
Binary files a/docs/_build/.doctrees/05. Binary Search/153. Find Minimum in Rotated Sorted Array.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree b/docs/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree
deleted file mode 100644
index cce41ea..0000000
Binary files a/docs/_build/.doctrees/05. Binary Search/33. Search in Rotated Sorted Array.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/05. Binary Search/README.doctree b/docs/_build/.doctrees/05. Binary Search/README.doctree
deleted file mode 100644
index e9ea47d..0000000
Binary files a/docs/_build/.doctrees/05. Binary Search/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree b/docs/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree
deleted file mode 100644
index ebdec70..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/141. Linked List Cycle.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/143. Reorder List.doctree b/docs/_build/.doctrees/06. Linked List/143. Reorder List.doctree
deleted file mode 100644
index 93ebdf1..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/143. Reorder List.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree b/docs/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree
deleted file mode 100644
index 36946e4..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/19. Remove Nth Node From End of List.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree b/docs/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree
deleted file mode 100644
index b8ca05c..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/206. Reverse Linked List.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree b/docs/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree
deleted file mode 100644
index c3fd916..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/21. Merge Two Sorted Lists.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree b/docs/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree
deleted file mode 100644
index 3941f1c..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/23. Merge k Sorted Lists.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/06. Linked List/README.doctree b/docs/_build/.doctrees/06. Linked List/README.doctree
deleted file mode 100644
index 33630e1..0000000
Binary files a/docs/_build/.doctrees/06. Linked List/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/100. Same Tree.doctree b/docs/_build/.doctrees/07. Trees/100. Same Tree.doctree
deleted file mode 100644
index 4f27ba5..0000000
Binary files a/docs/_build/.doctrees/07. Trees/100. Same Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree b/docs/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree
deleted file mode 100644
index ad0d709..0000000
Binary files a/docs/_build/.doctrees/07. Trees/102. Binary Tree Level Order Traversal.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree b/docs/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree
deleted file mode 100644
index d337a7f..0000000
Binary files a/docs/_build/.doctrees/07. Trees/104. Maximum Depth of Binary Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree b/docs/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree
deleted file mode 100644
index 8a0dff1..0000000
Binary files a/docs/_build/.doctrees/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree b/docs/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree
deleted file mode 100644
index b000d0f..0000000
Binary files a/docs/_build/.doctrees/07. Trees/124. Binary Tree Maximum Path Sum.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree b/docs/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree
deleted file mode 100644
index ac9e634..0000000
Binary files a/docs/_build/.doctrees/07. Trees/199. Binary Tree Right Side View.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree b/docs/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree
deleted file mode 100644
index 29b96ce..0000000
Binary files a/docs/_build/.doctrees/07. Trees/226. Invert Binary Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree b/docs/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree
deleted file mode 100644
index 1b4dde5..0000000
Binary files a/docs/_build/.doctrees/07. Trees/230. Kth Smallest Element in a BST.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree b/docs/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree
deleted file mode 100644
index 88f1cab..0000000
Binary files a/docs/_build/.doctrees/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree b/docs/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree
deleted file mode 100644
index edab1dc..0000000
Binary files a/docs/_build/.doctrees/07. Trees/297. Serialize and Deserialize Binary Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree b/docs/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree
deleted file mode 100644
index d18096f..0000000
Binary files a/docs/_build/.doctrees/07. Trees/572. Subtree of Another Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree b/docs/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree
deleted file mode 100644
index f4e0df7..0000000
Binary files a/docs/_build/.doctrees/07. Trees/98. Validate Binary Search Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/07. Trees/README.doctree b/docs/_build/.doctrees/07. Trees/README.doctree
deleted file mode 100644
index 0ef6fdf..0000000
Binary files a/docs/_build/.doctrees/07. Trees/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree b/docs/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree
deleted file mode 100644
index 980cee7..0000000
Binary files a/docs/_build/.doctrees/08. Tries/208. Implement Trie (Prefix Tree).doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree b/docs/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree
deleted file mode 100644
index 24494e8..0000000
Binary files a/docs/_build/.doctrees/08. Tries/211. Design Add and Search Words Data Structure.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/08. Tries/212. Word Search II.doctree b/docs/_build/.doctrees/08. Tries/212. Word Search II.doctree
deleted file mode 100644
index d9bcd3d..0000000
Binary files a/docs/_build/.doctrees/08. Tries/212. Word Search II.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/08. Tries/README.doctree b/docs/_build/.doctrees/08. Tries/README.doctree
deleted file mode 100644
index 71936f3..0000000
Binary files a/docs/_build/.doctrees/08. Tries/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree b/docs/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree
deleted file mode 100644
index 2e53f47..0000000
Binary files a/docs/_build/.doctrees/09. Heap - Priority Queue/1046. Last Stone Weight.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree b/docs/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree
deleted file mode 100644
index ecc8007..0000000
Binary files a/docs/_build/.doctrees/09. Heap - Priority Queue/295. Find Median from Data Stream.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree b/docs/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree
deleted file mode 100644
index 4c27fbe..0000000
Binary files a/docs/_build/.doctrees/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/09. Heap - Priority Queue/README.doctree b/docs/_build/.doctrees/09. Heap - Priority Queue/README.doctree
deleted file mode 100644
index a1bd1e3..0000000
Binary files a/docs/_build/.doctrees/09. Heap - Priority Queue/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree b/docs/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree
deleted file mode 100644
index 74bd1e4..0000000
Binary files a/docs/_build/.doctrees/10. Backtracking/39. Combination Sum.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/10. Backtracking/79. Word Search.doctree b/docs/_build/.doctrees/10. Backtracking/79. Word Search.doctree
deleted file mode 100644
index 23d6c0d..0000000
Binary files a/docs/_build/.doctrees/10. Backtracking/79. Word Search.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/10. Backtracking/README.doctree b/docs/_build/.doctrees/10. Backtracking/README.doctree
deleted file mode 100644
index a587eb8..0000000
Binary files a/docs/_build/.doctrees/10. Backtracking/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/133. Clone Graph.doctree b/docs/_build/.doctrees/11. Graphs/133. Clone Graph.doctree
deleted file mode 100644
index 8b72c4b..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/133. Clone Graph.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree b/docs/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree
deleted file mode 100644
index 2d47dfa..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/178. Graph Valid Tree.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/200. Number of Islands.doctree b/docs/_build/.doctrees/11. Graphs/200. Number of Islands.doctree
deleted file mode 100644
index 61d79f5..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/200. Number of Islands.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/207. Course Schedule.doctree b/docs/_build/.doctrees/11. Graphs/207. Course Schedule.doctree
deleted file mode 100644
index affb26f..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/207. Course Schedule.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree b/docs/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree
deleted file mode 100644
index efb302e..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/3651. Number of Connected Components in an Undirected Graph.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree b/docs/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree
deleted file mode 100644
index a8c58e1..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/417. Pacific Atlantic Water Flow.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/11. Graphs/README.doctree b/docs/_build/.doctrees/11. Graphs/README.doctree
deleted file mode 100644
index 2283665..0000000
Binary files a/docs/_build/.doctrees/11. Graphs/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree b/docs/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree
deleted file mode 100644
index 0798b9c..0000000
Binary files a/docs/_build/.doctrees/12. Advanced Graphs/892. Alien Dictionary.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/12. Advanced Graphs/README.doctree b/docs/_build/.doctrees/12. Advanced Graphs/README.doctree
deleted file mode 100644
index 01b3a0c..0000000
Binary files a/docs/_build/.doctrees/12. Advanced Graphs/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree b/docs/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree
deleted file mode 100644
index d5117c1..0000000
Binary files a/docs/_build/.doctrees/13. One-D Dynamic Programming/198. House Robber.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree b/docs/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree
deleted file mode 100644
index fa72fda..0000000
Binary files a/docs/_build/.doctrees/13. One-D Dynamic Programming/213. House Robber II.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree b/docs/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree
deleted file mode 100644
index 6bc0e6b..0000000
Binary files a/docs/_build/.doctrees/13. One-D Dynamic Programming/70. Climbing Stairs.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/13. One-D Dynamic Programming/README.doctree b/docs/_build/.doctrees/13. One-D Dynamic Programming/README.doctree
deleted file mode 100644
index 71dbab0..0000000
Binary files a/docs/_build/.doctrees/13. One-D Dynamic Programming/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree b/docs/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree
deleted file mode 100644
index b1a6326..0000000
Binary files a/docs/_build/.doctrees/14. Two-D Dynamic Programming/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/15. Greedy/README.doctree b/docs/_build/.doctrees/15. Greedy/README.doctree
deleted file mode 100644
index d5cc623..0000000
Binary files a/docs/_build/.doctrees/15. Greedy/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/16. Intervals/README.doctree b/docs/_build/.doctrees/16. Intervals/README.doctree
deleted file mode 100644
index 4c01fad..0000000
Binary files a/docs/_build/.doctrees/16. Intervals/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/17. Math Geometry/README.doctree b/docs/_build/.doctrees/17. Math Geometry/README.doctree
deleted file mode 100644
index a4d593f..0000000
Binary files a/docs/_build/.doctrees/17. Math Geometry/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/18. Bit Manipulation/README.doctree b/docs/_build/.doctrees/18. Bit Manipulation/README.doctree
deleted file mode 100644
index e6afd99..0000000
Binary files a/docs/_build/.doctrees/18. Bit Manipulation/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/Book.doctree b/docs/_build/.doctrees/Book.doctree
deleted file mode 100644
index 3860721..0000000
Binary files a/docs/_build/.doctrees/Book.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/CODE_OF_CONDUCT.doctree b/docs/_build/.doctrees/CODE_OF_CONDUCT.doctree
deleted file mode 100644
index 0f244a9..0000000
Binary files a/docs/_build/.doctrees/CODE_OF_CONDUCT.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/CONTRIBUTING.doctree b/docs/_build/.doctrees/CONTRIBUTING.doctree
deleted file mode 100644
index 169d54d..0000000
Binary files a/docs/_build/.doctrees/CONTRIBUTING.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/README.doctree b/docs/_build/.doctrees/README.doctree
deleted file mode 100644
index ba89dd9..0000000
Binary files a/docs/_build/.doctrees/README.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/SECURITY.doctree b/docs/_build/.doctrees/SECURITY.doctree
deleted file mode 100644
index 22d9a6d..0000000
Binary files a/docs/_build/.doctrees/SECURITY.doctree and /dev/null differ
diff --git a/docs/_build/.doctrees/environment.pickle b/docs/_build/.doctrees/environment.pickle
deleted file mode 100644
index 3703abd..0000000
Binary files a/docs/_build/.doctrees/environment.pickle and /dev/null differ
diff --git a/docs/_build/html/.buildinfo b/docs/_build/html/.buildinfo
deleted file mode 100644
index 04dfd2b..0000000
--- a/docs/_build/html/.buildinfo
+++ /dev/null
@@ -1,4 +0,0 @@
-# Sphinx build info version 1
-# This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done.
-config: 8b102b6ce68f3bc9f65a9c18adf2ae17
-tags: 645f666f9bcd5a90fca523b33c5a78b7
diff --git a/docs/_build/html/01. Array Hashing/128. Longest Consecutive Sequence.html b/docs/_build/html/01. Array Hashing/128. Longest Consecutive Sequence.html
deleted file mode 100644
index 85d82fb..0000000
--- a/docs/_build/html/01. Array Hashing/128. Longest Consecutive Sequence.html	
+++ /dev/null
@@ -1,714 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>128. Longest Consecutive Sequence &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/128. Longest Consecutive Sequence';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="217. Contains Duplicate" href="217.%20Contains%20Duplicate.html" />
-    <link rel="prev" title="100: Same Tree" href="1.%20Two%20Sum.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/128. Longest Consecutive Sequence.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>128. Longest Consecutive Sequence</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="longest-consecutive-sequence">
-<h1>128. Longest Consecutive Sequence<a class="headerlink" href="#longest-consecutive-sequence" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/longest-consecutive-sequence/">To see the Longest Consecutive Sequence problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an unsorted array of integers <code class="docutils literal notranslate"><span class="pre">nums</span></code>, return <em>the length of the longest consecutive elements sequence.</em></p>
-<p>You must write an algorithm that runs in <code class="docutils literal notranslate"><span class="pre">O(n)</span></code> time.</p>
-<p><em>Constraints:</em>*</p>
-<ul class="simple">
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">nums.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^9\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^9\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">longestConsecutive</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">nums</span><span class="p">:</span>
-        <span class="k">return</span> <span class="mi">0</span>
-
-    <span class="n">num_set</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span>
-    <span class="n">max_length</span> <span class="o">=</span> <span class="mi">0</span>
-
-    <span class="k">for</span> <span class="n">num</span> <span class="ow">in</span> <span class="n">num_set</span><span class="p">:</span>
-        <span class="k">if</span> <span class="n">num</span> <span class="o">-</span> <span class="mi">1</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">num_set</span><span class="p">:</span>
-            <span class="n">current_num</span> <span class="o">=</span> <span class="n">num</span>
-            <span class="n">current_length</span> <span class="o">=</span> <span class="mi">1</span>
-
-            <span class="k">while</span> <span class="n">current_num</span> <span class="o">+</span> <span class="mi">1</span> <span class="ow">in</span> <span class="n">num_set</span><span class="p">:</span>
-                <span class="n">current_num</span> <span class="o">+=</span> <span class="mi">1</span>
-                <span class="n">current_length</span> <span class="o">+=</span> <span class="mi">1</span>
-
-            <span class="n">max_length</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_length</span><span class="p">,</span> <span class="n">current_length</span><span class="p">)</span>
-
-    <span class="k">return</span> <span class="n">max_length</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining the <code class="docutils literal notranslate"><span class="pre">longestConsecutive</span></code> function that takes the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array as input.</p></li>
-<li><p>We check if the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array is empty. If it’s empty, there are no consecutive elements, so we return 0.</p></li>
-<li><p>We create a Python set called <code class="docutils literal notranslate"><span class="pre">num_set</span></code> and insert all elements from the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.</p></li>
-<li><p>We initialize a variable <code class="docutils literal notranslate"><span class="pre">max_length</span></code> to 0. This variable will keep track of the maximum length of consecutive elements sequence found.</p></li>
-<li><p>We iterate through the elements of the <code class="docutils literal notranslate"><span class="pre">num_set</span></code>. For each element <code class="docutils literal notranslate"><span class="pre">num</span></code>, we check if <code class="docutils literal notranslate"><span class="pre">num</span> <span class="pre">-</span> <span class="pre">1</span></code> exists in the <code class="docutils literal notranslate"><span class="pre">num_set</span></code>. If it doesn’t exist, it means <code class="docutils literal notranslate"><span class="pre">num</span></code> is the starting element of a potential consecutive sequence.</p></li>
-<li><p>Inside the loop, we initialize two variables: <code class="docutils literal notranslate"><span class="pre">current_num</span></code> to the current element <code class="docutils literal notranslate"><span class="pre">num</span></code> and <code class="docutils literal notranslate"><span class="pre">current_length</span></code> to 1. We start with a length of 1 because <code class="docutils literal notranslate"><span class="pre">num</span></code> itself is part of the sequence.</p></li>
-<li><p>We then enter a while loop that continues as long as <code class="docutils literal notranslate"><span class="pre">current_num</span> <span class="pre">+</span> <span class="pre">1</span></code> exists in the <code class="docutils literal notranslate"><span class="pre">num_set</span></code>. This means we are incrementing the consecutive sequence.</p></li>
-<li><p>Inside the while loop, we increment <code class="docutils literal notranslate"><span class="pre">current_num</span></code> by 1 and also increment <code class="docutils literal notranslate"><span class="pre">current_length</span></code> by 1 to account for the next consecutive element.</p></li>
-<li><p>We compare <code class="docutils literal notranslate"><span class="pre">current_length</span></code> with the <code class="docutils literal notranslate"><span class="pre">max_length</span></code> and update <code class="docutils literal notranslate"><span class="pre">max_length</span></code> if the current sequence is longer.</p></li>
-<li><p>After the while loop, we move to the next element in the outer loop and repeat the process.</p></li>
-<li><p>Finally, we return the <code class="docutils literal notranslate"><span class="pre">max_length</span></code> as the result, which represents the length of the longest consecutive elements sequence in the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-</ol>
-<p>The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">100</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">200</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">longestConsecutive</span><span class="p">(</span><span class="n">nums1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">longestConsecutive</span><span class="p">(</span><span class="n">nums2</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>9
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong>
-The code is designed to run in O(n) time complexity, where n is the number of elements in the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array. Here’s the breakdown:</p>
-<ol class="arabic simple">
-<li><p>Constructing the <code class="docutils literal notranslate"><span class="pre">num_set</span></code> by inserting all elements from <code class="docutils literal notranslate"><span class="pre">nums</span></code> into it takes O(n) time because we perform an insertion operation for each element in <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-<li><p>The main loop iterates through the elements in <code class="docutils literal notranslate"><span class="pre">num_set</span></code>. In the worst case, each element is visited only once, so the loop itself takes O(n) time.</p></li>
-<li><p>Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).</p></li>
-</ol>
-<p>Therefore, the overall time complexity of the code is O(n).</p>
-<p><strong>Space Complexity:</strong>
-The space complexity of the code is determined by the space used by the <code class="docutils literal notranslate"><span class="pre">num_set</span></code> and a few additional variables. Here’s the breakdown:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">num_set</span></code> is a set that stores the unique elements from <code class="docutils literal notranslate"><span class="pre">nums</span></code>. In the worst case, it can store all n elements from <code class="docutils literal notranslate"><span class="pre">nums</span></code>, so the space complexity is O(n).</p></li>
-<li><p>The additional variables used, such as <code class="docutils literal notranslate"><span class="pre">max_length</span></code>, <code class="docutils literal notranslate"><span class="pre">current_num</span></code>, and <code class="docutils literal notranslate"><span class="pre">current_length</span></code>, have constant space requirements and do not depend on the size of the input array.</p></li>
-</ol>
-<p>Therefore, the overall space complexity of the code is O(n) due to the space used by the <code class="docutils literal notranslate"><span class="pre">num_set</span></code>.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.</p></li>
-<li><p>Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="1.%20Two%20Sum.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">100: Same Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="217.%20Contains%20Duplicate.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">217. Contains Duplicate</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/01. Array Hashing/242. Valid Anagram.html b/docs/_build/html/01. Array Hashing/242. Valid Anagram.html
deleted file mode 100644
index 46ff851..0000000
--- a/docs/_build/html/01. Array Hashing/242. Valid Anagram.html	
+++ /dev/null
@@ -1,708 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>242. Valid Anagram &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/242. Valid Anagram';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="347. Top K Frequent Elements" href="347.%20Top%20K%20Frequent%20Elements.html" />
-    <link rel="prev" title="238. Product of Array Except Self" href="238.%20Product%20of%20Array%20Except%20Self.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/242. Valid Anagram.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/242. Valid Anagram.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>242. Valid Anagram</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="valid-anagram">
-<h1>242. Valid Anagram<a class="headerlink" href="#valid-anagram" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/valid-anagram/">To see the Valid Anagram problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given two strings <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>, return <code class="docutils literal notranslate"><span class="pre">true</span></code> if <code class="docutils literal notranslate"><span class="pre">t</span></code> is an anagram of <code class="docutils literal notranslate"><span class="pre">s</span></code>, and <code class="docutils literal notranslate"><span class="pre">false</span></code> otherwise.</p>
-<p>An <strong>Anagram</strong> is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">s.length</span></code>, <code class="docutils literal notranslate"><span class="pre">t.length</span></code> &lt;= <span class="math notranslate nohighlight">\(5 * 10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code> consist of lowercase English letters.</p></li>
-</ul>
-<p><strong>Follow-up:</strong> What if the inputs contain Unicode characters? How would you adapt your solution to such a case?</p>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isAnagram</span><span class="p">(</span><span class="n">s</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">t</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-    <span class="c1"># Check if the lengths of s and t are not equal</span>
-    <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">t</span><span class="p">):</span>
-        <span class="k">return</span> <span class="kc">False</span>
-
-    <span class="c1"># Create dictionaries to store character frequencies for s and t</span>
-    <span class="n">countS</span><span class="p">,</span> <span class="n">countT</span> <span class="o">=</span> <span class="p">{},</span> <span class="p">{}</span>
-
-    <span class="c1"># Count character frequencies in s</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)):</span>
-        <span class="n">countS</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">countS</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">s</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="mi">0</span><span class="p">)</span>
-
-    <span class="c1"># Count character frequencies in t</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">t</span><span class="p">)):</span>
-        <span class="n">countT</span><span class="p">[</span><span class="n">t</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">countT</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">t</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="mi">0</span><span class="p">)</span>
-
-    <span class="c1"># Check if the character frequencies in s and t are the same</span>
-    <span class="k">return</span> <span class="n">countS</span> <span class="o">==</span> <span class="n">countT</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The code defines a class called <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method <code class="docutils literal notranslate"><span class="pre">isAnagram</span></code> that takes two input strings, <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>, and returns a boolean (<code class="docutils literal notranslate"><span class="pre">True</span></code> or <code class="docutils literal notranslate"><span class="pre">False</span></code>) based on whether <code class="docutils literal notranslate"><span class="pre">t</span></code> is an anagram of <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-<li><p>The first check performed in the method is whether the lengths of <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code> are equal. If they are not equal, it immediately returns <code class="docutils literal notranslate"><span class="pre">False</span></code> because strings of different lengths cannot be anagrams of each other.</p></li>
-<li><p>Two dictionaries, <code class="docutils literal notranslate"><span class="pre">countS</span></code> and <code class="docutils literal notranslate"><span class="pre">countT</span></code>, are created to store the frequency of characters in <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>, respectively. These dictionaries will be used to count the occurrences of each character in the strings.</p></li>
-<li><p>The code then enters a loop to iterate through each character in string <code class="docutils literal notranslate"><span class="pre">s</span></code> using a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop. Inside the loop, it updates the <code class="docutils literal notranslate"><span class="pre">countS</span></code> dictionary. The line <code class="docutils literal notranslate"><span class="pre">countS[s[i]]</span> <span class="pre">=</span> <span class="pre">1</span> <span class="pre">+</span> <span class="pre">countS.get(s[i],</span> <span class="pre">0)</span></code> increments the count of character <code class="docutils literal notranslate"><span class="pre">s[i]</span></code> in <code class="docutils literal notranslate"><span class="pre">countS</span></code> by 1. If the character is not already in the dictionary, it initializes the count to 1.</p></li>
-<li><p>Similarly, the code iterates through each character in string <code class="docutils literal notranslate"><span class="pre">t</span></code> and updates the <code class="docutils literal notranslate"><span class="pre">countT</span></code> dictionary in the same way.</p></li>
-<li><p>After counting the character frequencies in both strings, the code compares the two dictionaries using <code class="docutils literal notranslate"><span class="pre">countS</span> <span class="pre">==</span> <span class="pre">countT</span></code>. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, <code class="docutils literal notranslate"><span class="pre">t</span></code> is an anagram of <code class="docutils literal notranslate"><span class="pre">s</span></code>. In this case, the method returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If the dictionaries are not equal, the method returns <code class="docutils literal notranslate"><span class="pre">False</span></code>, indicating that <code class="docutils literal notranslate"><span class="pre">t</span></code> is not an anagram of <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-</ol>
-<p>In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns <code class="docutils literal notranslate"><span class="pre">True</span></code>; otherwise, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">s</span> <span class="o">=</span> <span class="s2">&quot;anagram&quot;</span>
-<span class="n">t</span> <span class="o">=</span> <span class="s2">&quot;nagaram&quot;</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isAnagram</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">t</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">s</span> <span class="o">=</span> <span class="s2">&quot;rat&quot;</span>
-<span class="n">t</span> <span class="o">=</span> <span class="s2">&quot;car&quot;</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isAnagram</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">t</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The code first checks whether the lengths of the input strings <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code> are equal, which takes constant time. This check has a time complexity of O(1).</p></li>
-<li><p>The code then iterates through both strings, <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (<code class="docutils literal notranslate"><span class="pre">s</span></code> or <code class="docutils literal notranslate"><span class="pre">t</span></code>).</p></li>
-<li><p>Finally, the code compares the two dictionaries <code class="docutils literal notranslate"><span class="pre">countS</span></code> and <code class="docutils literal notranslate"><span class="pre">countT</span></code> to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.</p></li>
-</ol>
-<p>Overall, the time complexity of the code is O(n), where n is the length of the longer input string.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The code uses two dictionaries, <code class="docutils literal notranslate"><span class="pre">countS</span></code> and <code class="docutils literal notranslate"><span class="pre">countT</span></code>, to store the character frequencies of the input strings <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.</p></li>
-<li><p>The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.</p></li>
-</ol>
-<p><strong>In summary</strong>, the space complexity of the code is O(n), where n is the length of the longer input string.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Anagram Chains</strong>: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [“bat”, “tab”, “cat”, “tac”, “dog”], the longest anagram chain is [“bat”, “tab”, “cat”, “tac”].</p></li>
-<li><p><strong>Minimum Deletions to Make Anagrams</strong>: Given two strings <code class="docutils literal notranslate"><span class="pre">s</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span></code>, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if <code class="docutils literal notranslate"><span class="pre">s</span> <span class="pre">=</span> <span class="pre">&quot;hello&quot;</span></code> and <code class="docutils literal notranslate"><span class="pre">t</span> <span class="pre">=</span> <span class="pre">&quot;billion&quot;</span></code>, you can remove the characters “heo” from <code class="docutils literal notranslate"><span class="pre">s</span></code> and “billi” from <code class="docutils literal notranslate"><span class="pre">t</span></code> to make them anagrams (“lo” and “on” are left in the two strings).</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="238.%20Product%20of%20Array%20Except%20Self.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">238. Product of Array Except Self</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="347.%20Top%20K%20Frequent%20Elements.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">347. Top K Frequent Elements</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/01. Array Hashing/347. Top K Frequent Elements.html b/docs/_build/html/01. Array Hashing/347. Top K Frequent Elements.html
deleted file mode 100644
index 7cff15a..0000000
--- a/docs/_build/html/01. Array Hashing/347. Top K Frequent Elements.html	
+++ /dev/null
@@ -1,721 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>347. Top K Frequent Elements &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/347. Top K Frequent Elements';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="49. Group Anagrams" href="49.%20Group%20Anagrams.html" />
-    <link rel="prev" title="242. Valid Anagram" href="242.%20Valid%20Anagram.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/347. Top K Frequent Elements.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>347. Top K Frequent Elements</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="top-k-frequent-elements">
-<h1>347. Top K Frequent Elements<a class="headerlink" href="#top-k-frequent-elements" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/top-k-frequent-elements/">To see the Top K Frequent Elements problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code> and an integer <code class="docutils literal notranslate"><span class="pre">k</span></code>, return the <code class="docutils literal notranslate"><span class="pre">k</span></code> most frequent elements. You may return the answer in <strong>any order</strong>.</p>
-<p>Constraints:</p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">nums.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">k</span></code> is in the range <code class="docutils literal notranslate"><span class="pre">[1,</span> <span class="pre">the</span> <span class="pre">number</span> <span class="pre">of</span> <span class="pre">unique</span> <span class="pre">elements</span> <span class="pre">in</span> <span class="pre">the</span> <span class="pre">array]</span></code>.</p></li>
-<li><p>It is <strong>guaranteed</strong> that the answer is <strong>unique</strong>.</p></li>
-</ul>
-<p><strong>Follow-up:</strong> Your algorithm’s time complexity must be better than <span class="math notranslate nohighlight">\(O(n\ log\ n)\)</span>, where n is the array’s size.</p>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">topKFrequent</span><span class="p">(</span><span class="n">nums</span><span class="p">,</span> <span class="n">k</span><span class="p">):</span>
-    <span class="c1"># Create a dictionary to store the frequency of each element</span>
-    <span class="n">count</span> <span class="o">=</span> <span class="p">{}</span>
-    <span class="c1"># Create a list of lists to store elements with the same frequency</span>
-    <span class="n">frequency</span> <span class="o">=</span> <span class="p">[[]</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)]</span>
-
-    <span class="c1"># Count the frequency of each element in nums</span>
-    <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">nums</span><span class="p">:</span>
-        <span class="n">count</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">count</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="mi">0</span><span class="p">)</span>
-
-    <span class="c1"># Place elements in the freq list according to their frequency</span>
-    <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">count</span><span class="o">.</span><span class="n">items</span><span class="p">():</span>
-        <span class="n">frequency</span><span class="p">[</span><span class="n">c</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">n</span><span class="p">)</span>
-
-    <span class="n">res</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="c1"># Traverse freq list from the end (higher frequencies)</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">frequency</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
-        <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">frequency</span><span class="p">[</span><span class="n">i</span><span class="p">]:</span>
-            <span class="n">res</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">n</span><span class="p">)</span>
-            <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">==</span> <span class="n">k</span><span class="p">:</span>
-                <span class="k">return</span> <span class="n">res</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">topKFrequent(nums,</span> <span class="pre">k):</span></code>: This is a function that takes two arguments: <code class="docutils literal notranslate"><span class="pre">nums</span></code>, which is the input array of integers, and <code class="docutils literal notranslate"><span class="pre">k</span></code>, which is the number of most frequent elements to return.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">count</span> <span class="pre">=</span> <span class="pre">{}</span></code>: This dictionary <code class="docutils literal notranslate"><span class="pre">count</span></code> will be used to store the frequency of each unique element in the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array. The keys are elements from the input array, and the values are their corresponding frequencies.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">frequency</span> <span class="pre">=</span> <span class="pre">[[]</span> <span class="pre">for</span> <span class="pre">i</span> <span class="pre">in</span> <span class="pre">range(len(nums)</span> <span class="pre">+</span> <span class="pre">1)]</span></code>: This creates a list of empty lists called <code class="docutils literal notranslate"><span class="pre">frequency</span></code>. It’s used to store elements based on their frequencies, similar to the <code class="docutils literal notranslate"><span class="pre">freq</span></code> list in the previous code. The size of this list is set to be one greater than the length of the input <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">for</span> <span class="pre">n</span> <span class="pre">in</span> <span class="pre">nums:</span></code>: This loop iterates through each element <code class="docutils literal notranslate"><span class="pre">n</span></code> in the input <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">count[n]</span> <span class="pre">=</span> <span class="pre">1</span> <span class="pre">+</span> <span class="pre">count.get(n,</span> <span class="pre">0)</span></code>: This line counts the frequency of each element <code class="docutils literal notranslate"><span class="pre">n</span></code> in the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array. It uses the <code class="docutils literal notranslate"><span class="pre">count.get(n,</span> <span class="pre">0)</span></code> method to retrieve the current count of <code class="docutils literal notranslate"><span class="pre">n</span></code> from the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary. If <code class="docutils literal notranslate"><span class="pre">n</span></code> is not in the dictionary, it defaults to 0. It then increments the count by 1.</p></li>
-<li><p>After the above loop, the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary will contain counts of each unique element in the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">for</span> <span class="pre">n,</span> <span class="pre">c</span> <span class="pre">in</span> <span class="pre">count.items():</span></code>: This loop iterates through the items (key-value pairs) of the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary. <code class="docutils literal notranslate"><span class="pre">n</span></code> represents the element, and <code class="docutils literal notranslate"><span class="pre">c</span></code> represents its frequency.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">frequency[c].append(n)</span></code>: This line places the element <code class="docutils literal notranslate"><span class="pre">n</span></code> into the bucket corresponding to its frequency <code class="docutils literal notranslate"><span class="pre">c</span></code>. Buckets are represented by the <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list. For example, if an element <code class="docutils literal notranslate"><span class="pre">n</span></code> has a frequency of 3, it will be added to <code class="docutils literal notranslate"><span class="pre">frequency[3]</span></code>.</p></li>
-<li><p>After this loop, the <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list will contain buckets of elements grouped by their frequencies.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">res</span> <span class="pre">=</span> <span class="pre">[]</span></code>: This list <code class="docutils literal notranslate"><span class="pre">res</span></code> will be used to store the k most frequent elements.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">for</span> <span class="pre">i</span> <span class="pre">in</span> <span class="pre">range(len(freq)</span> <span class="pre">-</span> <span class="pre">1,</span> <span class="pre">0,</span> <span class="pre">-1):</span></code>: This loop iterates in reverse order through the <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be <code class="docutils literal notranslate"><span class="pre">frequency</span></code> instead of <code class="docutils literal notranslate"><span class="pre">freq</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">for</span> <span class="pre">n</span> <span class="pre">in</span> <span class="pre">frequency[i]:</span></code>: For each element <code class="docutils literal notranslate"><span class="pre">n</span></code> in the current bucket (i.e., elements with frequency <code class="docutils literal notranslate"><span class="pre">i</span></code>), it appends <code class="docutils literal notranslate"><span class="pre">n</span></code> to the result list <code class="docutils literal notranslate"><span class="pre">res</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">len(res)</span> <span class="pre">==</span> <span class="pre">k:</span></code>: Once <code class="docutils literal notranslate"><span class="pre">res</span></code> contains k elements, the code exits and returns the result.</p></li>
-</ol>
-<p>The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., <code class="docutils literal notranslate"><span class="pre">frequency</span></code> instead of <code class="docutils literal notranslate"><span class="pre">freq</span></code>).</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">]</span>
-<span class="n">k</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">topKFrequent</span><span class="p">(</span><span class="n">nums</span><span class="p">,</span> <span class="n">k</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 2]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">k</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">topKFrequent</span><span class="p">(</span><span class="n">nums</span><span class="p">,</span> <span class="n">k</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The first loop that counts the frequency of elements by iterating through <code class="docutils literal notranslate"><span class="pre">nums</span></code> has a time complexity of O(n), where n is the number of elements in the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-<li><p>The second loop iterates through the keys in the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary, which has at most <code class="docutils literal notranslate"><span class="pre">k</span></code> unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).</p></li>
-<li><p>The third loop iterates through the <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list, which has a length equal to the maximum frequency of elements in <code class="docutils literal notranslate"><span class="pre">nums</span></code>. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-</ol>
-<p>Overall, the dominant factor in terms of time complexity is the loop that iterates through the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary. So, the total time complexity of the code is O(n + k).</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary stores the frequency of each unique element in <code class="docutils literal notranslate"><span class="pre">nums</span></code>. In the worst case, it can have at most <code class="docutils literal notranslate"><span class="pre">k</span></code> unique elements, so the space complexity for <code class="docutils literal notranslate"><span class="pre">count</span></code> is O(k).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list is used to store elements grouped by their frequencies. It has a length of <code class="docutils literal notranslate"><span class="pre">len(nums)</span> <span class="pre">+</span> <span class="pre">1</span></code>, which can be at most 105 based on the constraints. Therefore, the space complexity for <code class="docutils literal notranslate"><span class="pre">frequency</span></code> is O(105).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">res</span></code> list stores the k most frequent elements, which can be at most <code class="docutils literal notranslate"><span class="pre">k</span></code> elements, so the space complexity for <code class="docutils literal notranslate"><span class="pre">res</span></code> is O(k).</p></li>
-</ol>
-<p><strong>In summary</strong>, the space complexity is dominated by the <code class="docutils literal notranslate"><span class="pre">count</span></code> dictionary and the <code class="docutils literal notranslate"><span class="pre">frequency</span></code> list, both of which have a space complexity of O(k + 105).</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimized k Most Frequent Elements:</strong> Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.</p></li>
-<li><p><strong>Handling Duplicate Frequencies:</strong> Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="242.%20Valid%20Anagram.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">242. Valid Anagram</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="49.%20Group%20Anagrams.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">49. Group Anagrams</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/01. Array Hashing/49. Group Anagrams.html b/docs/_build/html/01. Array Hashing/49. Group Anagrams.html
deleted file mode 100644
index ab82f1c..0000000
--- a/docs/_build/html/01. Array Hashing/49. Group Anagrams.html	
+++ /dev/null
@@ -1,735 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>49. Group Anagrams &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '01. Array Hashing/49. Group Anagrams';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="659· Encode and Decode Strings" href="659.%20Encode%20and%20Decode%20Strings.html" />
-    <link rel="prev" title="347. Top K Frequent Elements" href="347.%20Top%20K%20Frequent%20Elements.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F01. Array Hashing/49. Group Anagrams.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/01. Array Hashing/49. Group Anagrams.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>49. Group Anagrams</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="group-anagrams">
-<h1>49. Group Anagrams<a class="headerlink" href="#group-anagrams" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/group-anagrams/">To see the Group Anagrams problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an array of strings <code class="docutils literal notranslate"><span class="pre">strs</span></code>, group <strong>the anagrams</strong> together. You can return the answer in <strong>any order</strong>.</p>
-<p>An <strong>Anagram</strong> is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= `strs.length &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">strs[i].length</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">strs[i]</span></code> consists of lowercase English letters.</p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">collections</span> <span class="kn">import</span> <span class="n">defaultdict</span>
-
-
-<span class="k">def</span> <span class="nf">groupAnagrams</span><span class="p">(</span><span class="n">strs</span><span class="p">):</span>
-    <span class="n">ans</span> <span class="o">=</span> <span class="n">defaultdict</span><span class="p">(</span><span class="nb">list</span><span class="p">)</span>
-
-    <span class="c1"># Iterate through the list of input strings</span>
-    <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="n">strs</span><span class="p">:</span>
-        <span class="c1"># Initialize a list to represent character counts for each character (a-z)</span>
-        <span class="n">count</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="mi">26</span>
-
-        <span class="c1"># Count the occurrences of each character in the current word</span>
-        <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">s</span><span class="p">:</span>
-            <span class="n">count</span><span class="p">[</span><span class="nb">ord</span><span class="p">(</span><span class="n">c</span><span class="p">)</span> <span class="o">-</span> <span class="nb">ord</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">)]</span> <span class="o">+=</span> <span class="mi">1</span>
-
-        <span class="c1"># Use a tuple of character counts as the key and append the word to the anagram group</span>
-        <span class="n">ans</span><span class="p">[</span><span class="nb">tuple</span><span class="p">(</span><span class="n">count</span><span class="p">)]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">s</span><span class="p">)</span>
-
-    <span class="c1"># Convert the values (lists of anagrams) to a list of lists</span>
-    <span class="k">return</span> <span class="nb">list</span><span class="p">(</span><span class="n">ans</span><span class="o">.</span><span class="n">values</span><span class="p">())</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Inside the method, a <code class="docutils literal notranslate"><span class="pre">defaultdict</span></code> called <code class="docutils literal notranslate"><span class="pre">ans</span></code> is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.</p></li>
-<li><p>The code then iterates through the list of input strings, <code class="docutils literal notranslate"><span class="pre">strs</span></code>, using a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop. For each word <code class="docutils literal notranslate"><span class="pre">s</span></code> in <code class="docutils literal notranslate"><span class="pre">strs</span></code>, it performs the following steps:</p>
-<ul class="simple">
-<li><p>It initializes a list <code class="docutils literal notranslate"><span class="pre">count</span></code> of length 26, where each element represents the count of a specific character (a-z) in the word <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-<li><p>The code then iterates through the characters of <code class="docutils literal notranslate"><span class="pre">s</span></code>. For each character <code class="docutils literal notranslate"><span class="pre">c</span></code>, it increments the corresponding count in the <code class="docutils literal notranslate"><span class="pre">count</span></code> list based on its ASCII value.</p></li>
-<li><p>After counting the characters in <code class="docutils literal notranslate"><span class="pre">s</span></code>, it converts the <code class="docutils literal notranslate"><span class="pre">count</span></code> list into a tuple <code class="docutils literal notranslate"><span class="pre">tuple(count)</span></code> to use as a key for the <code class="docutils literal notranslate"><span class="pre">ans</span></code> dictionary.</p></li>
-<li><p>It appends the word <code class="docutils literal notranslate"><span class="pre">s</span></code> to the list associated with the key (tuple) in the <code class="docutils literal notranslate"><span class="pre">ans</span></code> dictionary. This groups all anagrams of the same word together under the same key.</p></li>
-</ul>
-</li>
-<li><p>After processing all words in <code class="docutils literal notranslate"><span class="pre">strs</span></code>, the code converts the values of the <code class="docutils literal notranslate"><span class="pre">ans</span></code> dictionary (which are lists of anagrams) to a list of lists using the <code class="docutils literal notranslate"><span class="pre">list()</span></code> constructor.</p></li>
-<li><p>Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.</p></li>
-</ol>
-<p>In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: Group anagrams from a list of words</span>
-<span class="n">strs1</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;eat&quot;</span><span class="p">,</span> <span class="s2">&quot;tea&quot;</span><span class="p">,</span> <span class="s2">&quot;tan&quot;</span><span class="p">,</span> <span class="s2">&quot;ate&quot;</span><span class="p">,</span> <span class="s2">&quot;nat&quot;</span><span class="p">,</span> <span class="s2">&quot;bat&quot;</span><span class="p">]</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">groupAnagrams</span><span class="p">(</span><span class="n">strs1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[&#39;eat&#39;, &#39;tea&#39;, &#39;ate&#39;], [&#39;tan&#39;, &#39;nat&#39;], [&#39;bat&#39;]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2: Group anagrams from a list with an empty string</span>
-<span class="n">strs2</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;&quot;</span><span class="p">]</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">groupAnagrams</span><span class="p">(</span><span class="n">strs2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[&#39;&#39;]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3: Group anagrams from a list with a single word</span>
-<span class="n">strs3</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">]</span>
-<span class="n">result3</span> <span class="o">=</span> <span class="n">groupAnagrams</span><span class="p">(</span><span class="n">strs3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result3</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[&#39;a&#39;]]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">groupAnagrams</span></code> method:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>First, we create an instance of the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class, which is an O(1) operation.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">groupAnagrams</span></code> method, we iterate through the list of input strings <code class="docutils literal notranslate"><span class="pre">strs</span></code> once in a loop:</p>
-<ul class="simple">
-<li><p>For each word in <code class="docutils literal notranslate"><span class="pre">strs</span></code>, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.</p></li>
-</ul>
-</li>
-<li><p>The overall time complexity of the method is O(N * K), where N is the number of words in the input list <code class="docutils literal notranslate"><span class="pre">strs</span></code>, and K is the maximum length of a word in <code class="docutils literal notranslate"><span class="pre">strs</span></code>.</p></li>
-</ol>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>We use a <code class="docutils literal notranslate"><span class="pre">defaultdict</span></code> called <code class="docutils literal notranslate"><span class="pre">ans</span></code> to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for <code class="docutils literal notranslate"><span class="pre">ans</span></code> is O(N).</p></li>
-<li><p>Within the loop, we create a <code class="docutils literal notranslate"><span class="pre">count</span></code> list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).</p></li>
-<li><p>The space used for other variables is also constant and does not depend on the input size.</p></li>
-<li><p>The final result, <code class="docutils literal notranslate"><span class="pre">result</span></code>, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for <code class="docutils literal notranslate"><span class="pre">result</span></code> is O(N).</p></li>
-<li><p>The overall space complexity of the method is O(N) due to the space used by <code class="docutils literal notranslate"><span class="pre">ans</span></code> and <code class="docutils literal notranslate"><span class="pre">result</span></code>. The space used by the <code class="docutils literal notranslate"><span class="pre">count</span></code> list and other variables is constant and does not significantly affect the overall space complexity.</p></li>
-</ol>
-<p><strong>In summary,</strong> the time complexity of the <code class="docutils literal notranslate"><span class="pre">groupAnagrams</span></code> method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list <code class="docutils literal notranslate"><span class="pre">strs</span></code>, and K is the maximum length of a word in <code class="docutils literal notranslate"><span class="pre">strs</span></code>.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Anagramic Palindromes</strong>: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [“bat”, “tab”, “act”, “tac”, “dog”], there are two groups: [“bat”, “tab”, “act”, “tac”] and [“dog”].</p></li>
-<li><p><strong>Largest Anagram Group</strong>: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./01. Array Hashing"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="347.%20Top%20K%20Frequent%20Elements.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">347. Top K Frequent Elements</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="659.%20Encode%20and%20Decode%20Strings.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">659· Encode and Decode Strings</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/02. Two Pointers/11. Container With Most Water.html b/docs/_build/html/02. Two Pointers/11. Container With Most Water.html
deleted file mode 100644
index d158b88..0000000
--- a/docs/_build/html/02. Two Pointers/11. Container With Most Water.html	
+++ /dev/null
@@ -1,728 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>11. Container With Most Water &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/11. Container With Most Water';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="125. Valid Palindrome" href="125.%20Valid%20Palindrome.html" />
-    <link rel="prev" title="Two Pointers Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F02. Two Pointers/11. Container With Most Water.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/02. Two Pointers/11. Container With Most Water.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>11. Container With Most Water</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="container-with-most-water">
-<h1>11. Container With Most Water<a class="headerlink" href="#container-with-most-water" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/container-with-most-water/">To see the Container With Most Water problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given an integer array <code class="docutils literal notranslate"><span class="pre">height</span></code> of length <code class="docutils literal notranslate"><span class="pre">n</span></code>. There are <code class="docutils literal notranslate"><span class="pre">n</span></code> vertical lines drawn such that the two endpoints of the <span class="math notranslate nohighlight">\(i^{th}\)</span> line are <code class="docutils literal notranslate"><span class="pre">(i,</span> <span class="pre">0)</span></code> and <code class="docutils literal notranslate"><span class="pre">(i,</span> <span class="pre">height[i])</span></code>.</p>
-<p>Find two lines that together with the x-axis form a container, such that the container contains the most water.</p>
-<p>Return <em>the maximum amount of water a container can store.</em></p>
-<p><strong>Notice</strong> that you may not slant the container.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">height.length</span></code></p></li>
-<li><p>2 &lt;= <code class="docutils literal notranslate"><span class="pre">n</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">height[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">maxArea</span><span class="p">(</span><span class="n">height</span><span class="p">):</span>
-    <span class="c1"># Initialize the maximum area to 0.</span>
-    <span class="n">max_area</span> <span class="o">=</span> <span class="mi">0</span>
-    <span class="c1"># Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.</span>
-    <span class="n">left</span> <span class="o">=</span> <span class="mi">0</span>
-    <span class="n">right</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">height</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-
-    <span class="c1"># Iterate until the left pointer is less than the right pointer.</span>
-    <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span><span class="p">:</span>
-        <span class="c1"># Calculate the height of the container, which is the minimum height of the two lines.</span>
-        <span class="n">h</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="n">height</span><span class="p">[</span><span class="n">left</span><span class="p">],</span> <span class="n">height</span><span class="p">[</span><span class="n">right</span><span class="p">])</span>
-        <span class="c1"># Calculate the width of the container, which is the distance between the two pointers.</span>
-        <span class="n">width</span> <span class="o">=</span> <span class="n">right</span> <span class="o">-</span> <span class="n">left</span>
-        <span class="c1"># Calculate the area of the container using height and width and update max_area if it&#39;s greater.</span>
-        <span class="n">max_area</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_area</span><span class="p">,</span> <span class="n">h</span> <span class="o">*</span> <span class="n">width</span><span class="p">)</span>
-
-        <span class="c1"># Move the pointer with the shorter line inward.</span>
-        <span class="k">if</span> <span class="n">height</span><span class="p">[</span><span class="n">left</span><span class="p">]</span> <span class="o">&lt;</span> <span class="n">height</span><span class="p">[</span><span class="n">right</span><span class="p">]:</span>
-            <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">right</span> <span class="o">-=</span> <span class="mi">1</span>
-
-    <span class="c1"># Continue this process until left &lt; right, and then return the maximum area.</span>
-    <span class="k">return</span> <span class="n">max_area</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start with initializing <code class="docutils literal notranslate"><span class="pre">max_area</span></code> to 0, which will store the maximum area of water that can be contained by the lines.</p></li>
-<li><p>Two pointers, <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>, are initialized to the beginning and end of the input <code class="docutils literal notranslate"><span class="pre">height</span></code> array.</p></li>
-<li><p>The main loop runs while <code class="docutils literal notranslate"><span class="pre">left</span></code> is less than <code class="docutils literal notranslate"><span class="pre">right</span></code>. This ensures that we are checking all possible pairs of lines in a systematic way.</p></li>
-<li><p>Inside the loop:</p>
-<ul class="simple">
-<li><p>We calculate the height of the container <code class="docutils literal notranslate"><span class="pre">h</span></code> as the minimum of the heights at the <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers. This represents the height of the water the container can hold.</p></li>
-<li><p>We calculate the width of the container as the difference between <code class="docutils literal notranslate"><span class="pre">right</span></code> and <code class="docutils literal notranslate"><span class="pre">left</span></code>. This represents the distance between the two lines.</p></li>
-<li><p>We calculate the area of the container using <code class="docutils literal notranslate"><span class="pre">h</span> <span class="pre">*</span> <span class="pre">width</span></code> and update <code class="docutils literal notranslate"><span class="pre">max_area</span></code> if the calculated area is greater than the current <code class="docutils literal notranslate"><span class="pre">max_area</span></code>.</p></li>
-</ul>
-</li>
-<li><p>After calculating the area and updating <code class="docutils literal notranslate"><span class="pre">max_area</span></code>, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won’t increase the height and will only decrease the width, which will result in a smaller area.</p></li>
-<li><p>We continue this process until <code class="docutils literal notranslate"><span class="pre">left</span></code> is no longer less than <code class="docutils literal notranslate"><span class="pre">right</span></code>, indicating that we have checked all possible pairs of lines.</p></li>
-<li><p>Finally, we return the <code class="docutils literal notranslate"><span class="pre">max_area</span></code> which contains the maximum area of water that can be contained by two lines from the input array.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">height1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">7</span><span class="p">]</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">maxArea</span><span class="p">(</span><span class="n">height1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Output:&quot;</span><span class="p">,</span> <span class="n">result1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Output: 49
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">height2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">maxArea</span><span class="p">(</span><span class="n">height2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Output:&quot;</span><span class="p">,</span> <span class="n">result2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Output: 1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Additional Example</span>
-<span class="n">height3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">3</span><span class="p">,</span> <span class="mi">9</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">12</span><span class="p">,</span> <span class="mi">6</span><span class="p">]</span>
-<span class="n">result3</span> <span class="o">=</span> <span class="n">maxArea</span><span class="p">(</span><span class="n">height3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Output:&quot;</span><span class="p">,</span> <span class="n">result3</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Output: 45
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">maxArea</span></code> function:</p>
-<p><strong>Time Complexity:</strong>
-The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the <code class="docutils literal notranslate"><span class="pre">height</span></code> array.</p>
-<p><strong>Space Complexity:</strong>
-The function uses a constant amount of extra space for variables like <code class="docutils literal notranslate"><span class="pre">max_area</span></code>, <code class="docutils literal notranslate"><span class="pre">left</span></code>, <code class="docutils literal notranslate"><span class="pre">right</span></code>, <code class="docutils literal notranslate"><span class="pre">h</span></code>, and <code class="docutils literal notranslate"><span class="pre">width</span></code>. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.</p>
-<p><strong>In summary,</strong> the <code class="docutils literal notranslate"><span class="pre">maxArea</span></code> function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimization Challenge:</strong> Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.</p></li>
-<li><p><strong>Variant Problem:</strong> Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You’ll need to return the total water volume needed.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./02. Two Pointers"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Two Pointers Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="125.%20Valid%20Palindrome.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">125. Valid Palindrome</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/02. Two Pointers/125. Valid Palindrome.html b/docs/_build/html/02. Two Pointers/125. Valid Palindrome.html
deleted file mode 100644
index 419c392..0000000
--- a/docs/_build/html/02. Two Pointers/125. Valid Palindrome.html	
+++ /dev/null
@@ -1,728 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>125. Valid Palindrome &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '02. Two Pointers/125. Valid Palindrome';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="15. 3Sum" href="15.%203Sum.html" />
-    <link rel="prev" title="11. Container With Most Water" href="11.%20Container%20With%20Most%20Water.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Two Pointers Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F02. Two Pointers/125. Valid Palindrome.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/02. Two Pointers/125. Valid Palindrome.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>125. Valid Palindrome</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="valid-palindrome">
-<h1>125. Valid Palindrome<a class="headerlink" href="#valid-palindrome" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/valid-palindrome/">To see the Valid Palindrome problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>A phrase is a <strong>palindrome</strong> if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.</p>
-<p>Given a string <code class="docutils literal notranslate"><span class="pre">s</span></code>, <em>return <code class="docutils literal notranslate"><span class="pre">true</span></code> if it is a <strong>palindrome</strong>, or <code class="docutils literal notranslate"><span class="pre">false</span></code> otherwise.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">s.length</span></code> &lt;= <span class="math notranslate nohighlight">\(2*10^5\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> consists only of printable ASCII characters.</p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isPalindrome</span><span class="p">(</span><span class="n">s</span><span class="p">):</span>
-    <span class="c1"># Step 1: Convert the input string to lowercase</span>
-    <span class="n">s</span> <span class="o">=</span> <span class="n">s</span><span class="o">.</span><span class="n">lower</span><span class="p">()</span>
-    
-    <span class="c1"># Step 2: Remove all non-alphanumeric characters from the string</span>
-    <span class="n">cleaned_s</span> <span class="o">=</span> <span class="s1">&#39;&#39;</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="n">c</span> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">s</span> <span class="k">if</span> <span class="n">c</span><span class="o">.</span><span class="n">isalnum</span><span class="p">())</span>
-    
-    <span class="c1"># Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string</span>
-    <span class="n">left</span><span class="p">,</span> <span class="n">right</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">cleaned_s</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-    
-    <span class="c1"># Step 4: Compare characters using the two pointers while moving them towards each other</span>
-    <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span><span class="p">:</span>
-        <span class="k">if</span> <span class="n">cleaned_s</span><span class="p">[</span><span class="n">left</span><span class="p">]</span> <span class="o">!=</span> <span class="n">cleaned_s</span><span class="p">[</span><span class="n">right</span><span class="p">]:</span>
-            <span class="k">return</span> <span class="kc">False</span>  <span class="c1"># If characters don&#39;t match, it&#39;s not a palindrome</span>
-        <span class="n">left</span> <span class="o">+=</span> <span class="mi">1</span>
-        <span class="n">right</span> <span class="o">-=</span> <span class="mi">1</span>
-    
-    <span class="c1"># Step 5: If the loop completes without returning False, it&#39;s a palindrome</span>
-    <span class="k">return</span> <span class="kc">True</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">isPalindrome</span></code> function takes an input string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-<li><p>It starts by converting the input string to lowercase using <code class="docutils literal notranslate"><span class="pre">s.lower()</span></code>. This step ensures that the function is case-insensitive when checking for palindromes.</p></li>
-<li><p>Next, it removes all non-alphanumeric characters from the string and stores the result in the <code class="docutils literal notranslate"><span class="pre">cleaned_s</span></code> variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.</p></li>
-<li><p>The function then initializes two pointers, <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>, which will be used to compare characters from the beginning and end of the cleaned string.</p></li>
-<li><p>In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer is less than the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer. This is done to check all characters in the cleaned string.</p></li>
-<li><p>Inside the loop, it checks if the characters at the <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers don’t match. If they don’t match, it means the input is not a palindrome, so the function returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If the characters at the <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers match, the pointers are moved closer to each other by incrementing <code class="docutils literal notranslate"><span class="pre">left</span></code> and decrementing <code class="docutils literal notranslate"><span class="pre">right</span></code>.</p></li>
-<li><p>The loop continues to compare characters until it either finds a mismatch (returning <code class="docutils literal notranslate"><span class="pre">False</span></code>) or until the <code class="docutils literal notranslate"><span class="pre">left</span></code> pointer is greater than or equal to the <code class="docutils literal notranslate"><span class="pre">right</span></code> pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-</ol>
-<p>In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string’s beginning and end. If all characters match during the comparison, the function returns <code class="docutils literal notranslate"><span class="pre">True</span></code>, indicating that the input is a palindrome. If any characters do not match, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">input1</span> <span class="o">=</span> <span class="s2">&quot;A man, a plan, a canal: Panama&quot;</span>
-<span class="n">output1</span> <span class="o">=</span> <span class="n">isPalindrome</span><span class="p">(</span><span class="n">input1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">output1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">input2</span> <span class="o">=</span> <span class="s2">&quot;race a car&quot;</span>
-<span class="n">output2</span> <span class="o">=</span> <span class="n">isPalindrome</span><span class="p">(</span><span class="n">input2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">output2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-<span class="n">input3</span> <span class="o">=</span> <span class="s2">&quot;&quot;</span>
-<span class="n">output3</span> <span class="o">=</span> <span class="n">isPalindrome</span><span class="p">(</span><span class="n">input3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">output3</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">isPalindrome</span></code> function that uses two pointers:</p>
-<ol class="arabic">
-<li><p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>Converting the input string to lowercase using <code class="docutils literal notranslate"><span class="pre">s.lower()</span></code> takes O(n) time, where ‘n’ is the length of the input string.</p></li>
-<li><p>Removing non-alphanumeric characters using the list comprehension <code class="docutils literal notranslate"><span class="pre">''.join(c</span> <span class="pre">for</span> <span class="pre">c</span> <span class="pre">in</span> <span class="pre">s</span> <span class="pre">if</span> <span class="pre">c.isalnum())</span></code> also takes O(n) time because it iterates through each character in the string once.</p></li>
-<li><p>The comparison of characters using the two pointers (<code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>) is done in a loop that runs until <code class="docutils literal notranslate"><span class="pre">left</span></code> is less than <code class="docutils literal notranslate"><span class="pre">right</span></code>. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).</p></li>
-</ul>
-<p>Therefore, the overall time complexity of the <code class="docutils literal notranslate"><span class="pre">isPalindrome</span></code> function is O(n), where ‘n’ is the length of the input string.</p>
-</li>
-<li><p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity is primarily determined by the additional string <code class="docutils literal notranslate"><span class="pre">cleaned_s</span></code> created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.</p></li>
-<li><p>Additionally, the function uses two pointers, <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>, which consume constant space and do not depend on the size of the input.</p></li>
-</ul>
-</li>
-</ol>
-<p><strong>In summary,</strong> the overall space complexity of the <code class="docutils literal notranslate"><span class="pre">isPalindrome</span></code> function is O(n) in the worst case, where ‘n’ is the length of the input string. The space complexity is dominated by the space required for <code class="docutils literal notranslate"><span class="pre">cleaned_s</span></code>.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Longest Palindromic Substring:</strong> Given a string <code class="docutils literal notranslate"><span class="pre">s</span></code>, find and return the longest palindromic substring within <code class="docutils literal notranslate"><span class="pre">s</span></code>. For example, if <code class="docutils literal notranslate"><span class="pre">s</span> <span class="pre">=</span> <span class="pre">&quot;babad&quot;</span></code>, the function should return <code class="docutils literal notranslate"><span class="pre">&quot;bab&quot;</span></code> or <code class="docutils literal notranslate"><span class="pre">&quot;aba&quot;</span></code>.</p></li>
-<li><p><strong>Palindrome with Limited Characters:</strong> Given a string <code class="docutils literal notranslate"><span class="pre">s</span></code> and a list of characters <code class="docutils literal notranslate"><span class="pre">allowed_chars</span></code>, check if <code class="docutils literal notranslate"><span class="pre">s</span></code> is a palindrome considering only the characters from <code class="docutils literal notranslate"><span class="pre">allowed_chars</span></code>. Ignore all other characters. For example, if <code class="docutils literal notranslate"><span class="pre">s</span> <span class="pre">=</span> <span class="pre">&quot;A</span> <span class="pre">man,</span> <span class="pre">a</span> <span class="pre">plan,</span> <span class="pre">a</span> <span class="pre">canal:</span> <span class="pre">Panama&quot;</span></code> and <code class="docutils literal notranslate"><span class="pre">allowed_chars</span> <span class="pre">=</span> <span class="pre">['a',</span> <span class="pre">'m',</span> <span class="pre">'n',</span> <span class="pre">'p']</span></code>, the function should return <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./02. Two Pointers"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="11.%20Container%20With%20Most%20Water.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">11. Container With Most Water</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="15.%203Sum.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">15. 3Sum</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html b/docs/_build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html
deleted file mode 100644
index 0cdc75b..0000000
--- a/docs/_build/html/03. Sliding Window/121. Best Time to Buy and Sell Stock.html	
+++ /dev/null
@@ -1,712 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>121. Best Time to Buy and Sell Stock &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/121. Best Time to Buy and Sell Stock';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="3. Longest Substring Without Repeating Characters" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html" />
-    <link rel="prev" title="Sliding Window Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/121. Best Time to Buy and Sell Stock.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>121. Best Time to Buy and Sell Stock</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="best-time-to-buy-and-sell-stock">
-<h1>121. Best Time to Buy and Sell Stock<a class="headerlink" href="#best-time-to-buy-and-sell-stock" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/">To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given an array <code class="docutils literal notranslate"><span class="pre">prices</span></code> where <code class="docutils literal notranslate"><span class="pre">prices[i]</span></code> is the price of a given stock on the <span class="math notranslate nohighlight">\(i^{th}\)</span> day.</p>
-<p>You want to maximize your profit by choosing a <strong>single day</strong> to buy one stock and choosing a <strong>different day in the future</strong> to sell that stock.</p>
-<p><em>Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return <code class="docutils literal notranslate"><span class="pre">0</span></code>.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">prices.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">prices[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">maxProfit</span><span class="p">(</span><span class="n">prices</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">prices</span><span class="p">:</span>
-        <span class="k">return</span> <span class="mi">0</span>
-    
-    <span class="n">min_price</span> <span class="o">=</span> <span class="n">prices</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-    <span class="n">max_profit</span> <span class="o">=</span> <span class="mi">0</span>
-    
-    <span class="k">for</span> <span class="n">price</span> <span class="ow">in</span> <span class="n">prices</span><span class="p">:</span>
-        <span class="c1"># Update the minimum price if a lower price is encountered</span>
-        <span class="n">min_price</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="n">min_price</span><span class="p">,</span> <span class="n">price</span><span class="p">)</span>
-        <span class="c1"># Calculate the profit if selling at the current price</span>
-        <span class="n">max_profit</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_profit</span><span class="p">,</span> <span class="n">price</span> <span class="o">-</span> <span class="n">min_price</span><span class="p">)</span>
-    
-    <span class="k">return</span> <span class="n">max_profit</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">maxProfit</span></code> function takes a single argument, <code class="docutils literal notranslate"><span class="pre">prices</span></code>, which is a list of stock prices.</p></li>
-<li><p>The first line of the function checks if the <code class="docutils literal notranslate"><span class="pre">prices</span></code> list is empty. If it’s empty, there are no prices to analyze, so the function returns 0 (no profit can be made).</p></li>
-<li><p>Then, we initialize two variables:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">min_price</span></code>: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (<code class="docutils literal notranslate"><span class="pre">prices[0]</span></code>).</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">max_profit</span></code>: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven’t made any profit.</p></li>
-</ul>
-</li>
-<li><p>We start iterating through the <code class="docutils literal notranslate"><span class="pre">prices</span></code> list, where <code class="docutils literal notranslate"><span class="pre">price</span></code> represents the stock price for the current day.</p></li>
-<li><p>In each iteration, we check if the current <code class="docutils literal notranslate"><span class="pre">price</span></code> is lower than the <code class="docutils literal notranslate"><span class="pre">min_price</span></code> we’ve seen so far. If it is, we update <code class="docutils literal notranslate"><span class="pre">min_price</span></code> to the current <code class="docutils literal notranslate"><span class="pre">price</span></code>. This is because we want to buy the stock at the lowest possible price.</p></li>
-<li><p>Next, we calculate the profit we would make if we sold the stock at the current <code class="docutils literal notranslate"><span class="pre">price</span></code> (assuming we bought it at <code class="docutils literal notranslate"><span class="pre">min_price</span></code>). We do this by subtracting <code class="docutils literal notranslate"><span class="pre">min_price</span></code> from the current <code class="docutils literal notranslate"><span class="pre">price</span></code>. This represents the profit for the current day.</p></li>
-<li><p>We also use the <code class="docutils literal notranslate"><span class="pre">max</span></code> function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the <code class="docutils literal notranslate"><span class="pre">max_profit</span></code> we’ve seen previously, we update <code class="docutils literal notranslate"><span class="pre">max_profit</span></code> with this higher value.</p></li>
-<li><p>Finally, after iterating through all the days in the <code class="docutils literal notranslate"><span class="pre">prices</span></code> list, we return <code class="docutils literal notranslate"><span class="pre">max_profit</span></code>, which represents the maximum profit that can be achieved by buying and selling a single stock.</p></li>
-</ul>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">prices1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">7</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">4</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">maxProfit</span><span class="p">(</span><span class="n">prices1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>5
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">prices2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">7</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">maxProfit</span><span class="p">(</span><span class="n">prices2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>0
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The code iterates through the <code class="docutils literal notranslate"><span class="pre">prices</span></code> array once, examining each price exactly once.</p></li>
-<li><p>Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.</p></li>
-<li><p>Therefore, the time complexity of this code is O(n), where n is the length of the <code class="docutils literal notranslate"><span class="pre">prices</span></code> array. It performs a linear number of operations relative to the size of the input.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity of the code is constant, O(1).</p></li>
-<li><p>Regardless of the size of the input <code class="docutils literal notranslate"><span class="pre">prices</span></code> array, the code only uses a fixed amount of additional memory to store two variables (<code class="docutils literal notranslate"><span class="pre">min_price</span></code> and <code class="docutils literal notranslate"><span class="pre">max_profit</span></code>) and a few loop variables.</p></li>
-<li><p>The memory usage does not depend on the size of the input, so it is considered constant space complexity.</p></li>
-</ul>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: O(n) where n is the length of the <code class="docutils literal notranslate"><span class="pre">prices</span></code> array.</p></li>
-<li><p>Space Complexity: O(1) (constant space usage).</p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Multiple Transactions Allowed:</strong> Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.</p></li>
-<li><p><strong>K Transactions Allowed:</strong> Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.</p></li>
-<li><p><strong>With Transaction Fee:</strong> Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./03. Sliding Window"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Sliding Window Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">3. Longest Substring Without Repeating Characters</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html b/docs/_build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html
deleted file mode 100644
index 0c70660..0000000
--- a/docs/_build/html/03. Sliding Window/424. Longest Repeating Character Replacement.html	
+++ /dev/null
@@ -1,715 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>424. Longest Repeating Character Replacement &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '03. Sliding Window/424. Longest Repeating Character Replacement';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="76. Minimum Window Substring" href="76.%20Minimum%20Window%20Substring.html" />
-    <link rel="prev" title="3. Longest Substring Without Repeating Characters" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Sliding Window Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F03. Sliding Window/424. Longest Repeating Character Replacement.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>424. Longest Repeating Character Replacement</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="longest-repeating-character-replacement">
-<h1>424. Longest Repeating Character Replacement<a class="headerlink" href="#longest-repeating-character-replacement" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/longest-repeating-character-replacement/">To see the Longest Repeating Character Replacement problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given a string <code class="docutils literal notranslate"><span class="pre">s</span></code> and an integer <code class="docutils literal notranslate"><span class="pre">k</span></code>. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most <code class="docutils literal notranslate"><span class="pre">k</span></code> times.</p>
-<p><em>Return the length of the longest substring containing the same letter you can get after performing the above operations.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">s.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> consists of only uppercase English letters.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">k</span> <span class="pre">&lt;=</span> <span class="pre">s.length</span></code></p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">characterReplacement</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">k</span><span class="p">):</span>
-    <span class="n">max_length</span> <span class="o">=</span> <span class="mi">0</span>  <span class="c1"># Initialize the maximum length</span>
-    <span class="n">max_count</span> <span class="o">=</span> <span class="mi">0</span>   <span class="c1"># Initialize the maximum count of repeating characters</span>
-    <span class="n">start</span> <span class="o">=</span> <span class="mi">0</span>       <span class="c1"># Initialize the start of the sliding window</span>
-    <span class="n">char_count</span> <span class="o">=</span> <span class="p">{}</span> <span class="c1"># Dictionary to store the count of each character</span>
-
-    <span class="k">for</span> <span class="n">end</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">s</span><span class="p">)):</span>
-        <span class="c1"># Update the count of the current character in the dictionary</span>
-        <span class="n">char_count</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]]</span> <span class="o">=</span> <span class="n">char_count</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">],</span> <span class="mi">0</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
-        
-        <span class="c1"># Update the maximum count of repeating characters</span>
-        <span class="n">max_count</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_count</span><span class="p">,</span> <span class="n">char_count</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">end</span><span class="p">]])</span>
-        
-        <span class="c1"># Check if the current window size is greater than k</span>
-        <span class="k">if</span> <span class="p">(</span><span class="n">end</span> <span class="o">-</span> <span class="n">start</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">-</span> <span class="n">max_count</span> <span class="o">&gt;</span> <span class="n">k</span><span class="p">:</span>
-            <span class="c1"># Move the start of the window to the right</span>
-            <span class="n">char_count</span><span class="p">[</span><span class="n">s</span><span class="p">[</span><span class="n">start</span><span class="p">]]</span> <span class="o">-=</span> <span class="mi">1</span>
-            <span class="n">start</span> <span class="o">+=</span> <span class="mi">1</span>
-        
-        <span class="c1"># Update the maximum length</span>
-        <span class="n">max_length</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">max_length</span><span class="p">,</span> <span class="n">end</span> <span class="o">-</span> <span class="n">start</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-
-    <span class="k">return</span> <span class="n">max_length</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We initialize some variables:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">max_length</span></code> to keep track of the maximum length of the substring containing the same letter.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">max_count</span></code> to keep track of the maximum count of repeating characters within the current window.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">start</span></code> to represent the start index of the sliding window.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">char_count</span></code> is a dictionary that will store the count of each character within the current window.</p></li>
-</ul>
-</li>
-<li><p>We use a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop to iterate through the characters of the string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-<li><p>Inside the loop, we do the following for each character at position <code class="docutils literal notranslate"><span class="pre">end</span></code>:</p>
-<ul class="simple">
-<li><p>Update the count of the current character in the <code class="docutils literal notranslate"><span class="pre">char_count</span></code> dictionary.</p></li>
-<li><p>Update the <code class="docutils literal notranslate"><span class="pre">max_count</span></code> to be the maximum of the current <code class="docutils literal notranslate"><span class="pre">max_count</span></code> and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.</p></li>
-</ul>
-</li>
-<li><p>We check if the current window size (the difference between <code class="docutils literal notranslate"><span class="pre">end</span></code> and <code class="docutils literal notranslate"><span class="pre">start</span></code> plus one) minus the <code class="docutils literal notranslate"><span class="pre">max_count</span></code> is greater than <code class="docutils literal notranslate"><span class="pre">k</span></code>. This condition checks whether we have exceeded the allowed number of replacements (<code class="docutils literal notranslate"><span class="pre">k</span></code>) within the current window.</p>
-<ul class="simple">
-<li><p>If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the <code class="docutils literal notranslate"><span class="pre">start</span></code> of the window to the right and decrementing the count of the character at <code class="docutils literal notranslate"><span class="pre">s[start]</span></code> in the <code class="docutils literal notranslate"><span class="pre">char_count</span></code> dictionary. This effectively removes characters from the left side of the window until we have a valid window again.</p></li>
-<li><p>By doing this, we ensure that the difference between the current window size and the <code class="docutils literal notranslate"><span class="pre">max_count</span></code> is always less than or equal to <code class="docutils literal notranslate"><span class="pre">k</span></code>.</p></li>
-</ul>
-</li>
-<li><p>After each character, we update the <code class="docutils literal notranslate"><span class="pre">max_length</span></code> to be the maximum of the current <code class="docutils literal notranslate"><span class="pre">max_length</span></code> and the size of the current window (<code class="docutils literal notranslate"><span class="pre">end</span> <span class="pre">-</span> <span class="pre">start</span> <span class="pre">+</span> <span class="pre">1</span></code>).</p></li>
-<li><p>Finally, we return <code class="docutils literal notranslate"><span class="pre">max_length</span></code>, which holds the length of the longest substring containing the same letter with at most <code class="docutils literal notranslate"><span class="pre">k</span></code> replacements.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">s1</span> <span class="o">=</span> <span class="s2">&quot;ABAB&quot;</span>
-<span class="n">k1</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">characterReplacement</span><span class="p">(</span><span class="n">s1</span><span class="p">,</span> <span class="n">k1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">s2</span> <span class="o">=</span> <span class="s2">&quot;AABABBA&quot;</span>
-<span class="n">k2</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">characterReplacement</span><span class="p">(</span><span class="n">s2</span><span class="p">,</span> <span class="n">k2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The code uses a single <code class="docutils literal notranslate"><span class="pre">for</span></code> loop to iterate through the characters of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>. The loop runs from the beginning to the end of the string.</p></li>
-<li><p>Inside the loop, we perform constant-time operations such as updating the <code class="docutils literal notranslate"><span class="pre">char_count</span></code> dictionary and updating variables like <code class="docutils literal notranslate"><span class="pre">max_count</span></code> and <code class="docutils literal notranslate"><span class="pre">max_length</span></code>.</p></li>
-<li><p>The code’s time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include <code class="docutils literal notranslate"><span class="pre">max_length</span></code>, <code class="docutils literal notranslate"><span class="pre">max_count</span></code>, <code class="docutils literal notranslate"><span class="pre">start</span></code>, and <code class="docutils literal notranslate"><span class="pre">char_count</span></code>. Therefore, the space complexity is O(1) or constant space.</p></li>
-</ul>
-<p><strong>In summary</strong>, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimization Challenge:</strong> Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.</p></li>
-<li><p><strong>Variation with Lowercase Letters:</strong> Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./03. Sliding Window"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="3.%20Longest%20Substring%20Without%20Repeating%20Characters.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">3. Longest Substring Without Repeating Characters</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="76.%20Minimum%20Window%20Substring.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">76. Minimum Window Substring</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/04. Stack/20. Valid Parentheses.html b/docs/_build/html/04. Stack/20. Valid Parentheses.html
deleted file mode 100644
index f48f75e..0000000
--- a/docs/_build/html/04. Stack/20. Valid Parentheses.html	
+++ /dev/null
@@ -1,723 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>20. Valid Parentheses &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '04. Stack/20. Valid Parentheses';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Binary search Problems - Blind 75 LeetCode" href="../05.%20Binary%20Search/README.html" />
-    <link rel="prev" title="Stack Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Stack Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F04. Stack/20. Valid Parentheses.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/04. Stack/20. Valid Parentheses.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>20. Valid Parentheses</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="valid-parentheses">
-<h1>20. Valid Parentheses<a class="headerlink" href="#valid-parentheses" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/valid-parentheses/">To see the Valid Parentheses problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given a string s containing just the characters <code class="docutils literal notranslate"><span class="pre">'('</span></code>, <code class="docutils literal notranslate"><span class="pre">')'</span></code>, <code class="docutils literal notranslate"><span class="pre">'{'</span></code>, <code class="docutils literal notranslate"><span class="pre">'}'</span></code>, <code class="docutils literal notranslate"><span class="pre">'['</span></code> and <code class="docutils literal notranslate"><span class="pre">']'</span></code>, determine if the input string is valid.</p>
-<p>An input string is valid if:</p>
-<ol class="arabic simple">
-<li><p>Open brackets must be closed by the same type of brackets.</p></li>
-<li><p>Open brackets must be closed in the correct order.</p></li>
-<li><p>Every close bracket has a corresponding open bracket of the same type.</p></li>
-</ol>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">s.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">s</span></code> consists of parentheses only <code class="docutils literal notranslate"><span class="pre">'()[]{}'</span></code>.</p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isValid</span><span class="p">(</span><span class="n">s</span><span class="p">):</span>
-    <span class="c1"># Create an empty stack to store opening brackets</span>
-    <span class="n">stack</span> <span class="o">=</span> <span class="p">[]</span>
-    
-    <span class="c1"># Define a mapping for matching brackets</span>
-    <span class="n">bracket_mapping</span> <span class="o">=</span> <span class="p">{</span><span class="s1">&#39;)&#39;</span><span class="p">:</span> <span class="s1">&#39;(&#39;</span><span class="p">,</span> <span class="s1">&#39;}&#39;</span><span class="p">:</span> <span class="s1">&#39;{&#39;</span><span class="p">,</span> <span class="s1">&#39;]&#39;</span><span class="p">:</span> <span class="s1">&#39;[&#39;</span><span class="p">}</span>
-    
-    <span class="c1"># Iterate through the characters in the input string</span>
-    <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">s</span><span class="p">:</span>
-        <span class="c1"># If the character is an opening bracket, push it onto the stack</span>
-        <span class="k">if</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">bracket_mapping</span><span class="o">.</span><span class="n">values</span><span class="p">():</span>
-            <span class="n">stack</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">char</span><span class="p">)</span>
-        <span class="c1"># If the character is a closing bracket</span>
-        <span class="k">elif</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">bracket_mapping</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span>
-            <span class="c1"># Pop the top element from the stack if it exists, or use a dummy value &#39;#&#39;</span>
-            <span class="n">top_element</span> <span class="o">=</span> <span class="n">stack</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span> <span class="k">if</span> <span class="n">stack</span> <span class="k">else</span> <span class="s1">&#39;#&#39;</span>
-            <span class="c1"># If the popped element does not match the corresponding opening bracket, return False</span>
-            <span class="k">if</span> <span class="n">bracket_mapping</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">!=</span> <span class="n">top_element</span><span class="p">:</span>
-                <span class="k">return</span> <span class="kc">False</span>
-        <span class="c1"># If the character is not a bracket, ignore it</span>
-        
-    <span class="c1"># After processing the entire string, if there are any unmatched opening brackets left in the stack, return False</span>
-    <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">stack</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining the <code class="docutils literal notranslate"><span class="pre">isValid</span></code> function that takes a single argument <code class="docutils literal notranslate"><span class="pre">s</span></code>, which is the input string containing parentheses and brackets.</p></li>
-<li><p>Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.</p></li>
-<li><p>We define a <code class="docutils literal notranslate"><span class="pre">bracket_mapping</span></code> dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.</p></li>
-<li><p>We iterate through each character <code class="docutils literal notranslate"><span class="pre">char</span></code> in the input string <code class="docutils literal notranslate"><span class="pre">s</span></code> using a <code class="docutils literal notranslate"><span class="pre">for</span></code> loop.</p></li>
-<li><p>If the character <code class="docutils literal notranslate"><span class="pre">char</span></code> is an opening bracket (i.e., it exists in the <code class="docutils literal notranslate"><span class="pre">values()</span></code> of <code class="docutils literal notranslate"><span class="pre">bracket_mapping</span></code>), we push it onto the stack using the <code class="docutils literal notranslate"><span class="pre">append()</span></code> method.</p></li>
-<li><p>If the character <code class="docutils literal notranslate"><span class="pre">char</span></code> is a closing bracket (i.e., it exists in the <code class="docutils literal notranslate"><span class="pre">keys()</span></code> of <code class="docutils literal notranslate"><span class="pre">bracket_mapping</span></code>), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in <code class="docutils literal notranslate"><span class="pre">top_element</span></code>. We use a dummy value <code class="docutils literal notranslate"><span class="pre">'#'</span></code> if the stack is empty to avoid errors.</p></li>
-<li><p>We then compare <code class="docutils literal notranslate"><span class="pre">top_element</span></code> with the corresponding opening bracket using <code class="docutils literal notranslate"><span class="pre">bracket_mapping[char]</span></code>. If they do not match, it means the string is not valid, and we return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If the character <code class="docutils literal notranslate"><span class="pre">char</span></code> is not a bracket, we simply ignore it and continue the loop.</p></li>
-<li><p>After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return <code class="docutils literal notranslate"><span class="pre">True</span></code>. Otherwise, we return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isValid</span><span class="p">(</span><span class="s2">&quot;()&quot;</span><span class="p">))</span>    
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isValid</span><span class="p">(</span><span class="s2">&quot;()[]</span><span class="si">{}</span><span class="s2">&quot;</span><span class="p">))</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">isValid</span><span class="p">(</span><span class="s2">&quot;(]&quot;</span><span class="p">))</span>     
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">isValid</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The function iterates through each character in the input string <code class="docutils literal notranslate"><span class="pre">s</span></code> once, performing constant-time operations for each character.</p></li>
-<li><p>Pushing and popping elements from the stack (list) also takes constant time in most cases.</p></li>
-<li><p>Therefore, the overall time complexity of the function is <span class="math notranslate nohighlight">\(O(n)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the length of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>.</p></li>
-</ul>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The space complexity of the function is determined by the space used by the stack and the <code class="docutils literal notranslate"><span class="pre">bracket_mapping</span></code> dictionary.</p></li>
-<li><p>In the worst case, if the input string <code class="docutils literal notranslate"><span class="pre">s</span></code> consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of <span class="math notranslate nohighlight">\(O(n)\)</span> in terms of the stack.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">bracket_mapping</span></code> dictionary has a constant number of key-value pairs (3 pairs in this case).</p></li>
-<li><p>Therefore, the overall space complexity of the function is <span class="math notranslate nohighlight">\(O(n)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the length of the input string <code class="docutils literal notranslate"><span class="pre">s</span></code>, mainly due to the stack space.</p></li>
-</ul>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>The time complexity is <span class="math notranslate nohighlight">\(O(n)\)</span> because we iterate through the string once.</p></li>
-<li><p>The space complexity is <span class="math notranslate nohighlight">\(O(n)\)</span> due to the stack used to keep track of opening brackets.</p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Valid Expressions:</strong> Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as “<span class="math notranslate nohighlight">\(2 * (3 + 5) / (4 - 2)\)</span>”.</p></li>
-<li><p><strong>Valid Parentheses Combinations:</strong>
-Write a function to generate all valid combinations of n pairs of parentheses, where <span class="math notranslate nohighlight">\(n\)</span> is a positive integer. For example, for <span class="math notranslate nohighlight">\(n = 3\)</span>, the valid combinations are [“((()))”, “(()())”, “(())()”, “()(())”, “()()()”].</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./04. Stack"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Stack Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../05.%20Binary%20Search/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Binary search Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html b/docs/_build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html
deleted file mode 100644
index d7545de..0000000
--- a/docs/_build/html/05. Binary Search/153. Find Minimum in Rotated Sorted Array.html	
+++ /dev/null
@@ -1,719 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>153. Find Minimum in Rotated Sorted Array &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/153. Find Minimum in Rotated Sorted Array';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="33. Search in Rotated Sorted Array" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html" />
-    <link rel="prev" title="Binary search Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F05. Binary Search/153. Find Minimum in Rotated Sorted Array.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>153. Find Minimum in Rotated Sorted Array</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="find-minimum-in-rotated-sorted-array">
-<h1>153. Find Minimum in Rotated Sorted Array<a class="headerlink" href="#find-minimum-in-rotated-sorted-array" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/">To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Suppose an array of length <code class="docutils literal notranslate"><span class="pre">n</span></code> sorted in ascending order is <strong>rotated</strong> between <code class="docutils literal notranslate"><span class="pre">1</span></code> and <code class="docutils literal notranslate"><span class="pre">n</span></code> times. For example, the array <code class="docutils literal notranslate"><span class="pre">nums</span> <span class="pre">=</span> <span class="pre">[0,1,2,4,5,6,7]</span></code> might become:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">[4,5,6,7,0,1,2]</span></code> if it was rotated <code class="docutils literal notranslate"><span class="pre">4</span></code> times.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">[0,1,2,4,5,6,7]</span></code> if it was rotated <code class="docutils literal notranslate"><span class="pre">7</span></code> times.</p></li>
-</ul>
-<p>Notice that <strong>rotating</strong> an array <code class="docutils literal notranslate"><span class="pre">[a[0],</span> <span class="pre">a[1],</span> <span class="pre">a[2],</span> <span class="pre">...,</span> <span class="pre">a[n-1]]</span></code> 1 time results in the array <code class="docutils literal notranslate"><span class="pre">[a[n-1],</span> <span class="pre">a[0],</span> <span class="pre">a[1],</span> <span class="pre">a[2],</span> <span class="pre">...,</span> <span class="pre">a[n-2]]</span></code>.</p>
-<p>Given the sorted rotated array <code class="docutils literal notranslate"><span class="pre">nums</span></code> of <strong>unique</strong> elements, return <em>the minimum element of this array.</em></p>
-<p>You must write an algorithm that runs in <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">nums.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">5000</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-5000</span> <span class="pre">&lt;=</span> <span class="pre">nums[i]</span> <span class="pre">&lt;=</span> <span class="pre">5000</span></code></p></li>
-<li><p>All the integers of <code class="docutils literal notranslate"><span class="pre">nums</span></code> are <strong>unique</strong>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">nums</span></code> is sorted and rotated between <code class="docutils literal notranslate"><span class="pre">1</span></code> and <code class="docutils literal notranslate"><span class="pre">n</span></code> times.</p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">findMin</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-    <span class="n">left</span><span class="p">,</span> <span class="n">right</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-    
-    <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span><span class="p">:</span>
-        <span class="n">mid</span> <span class="o">=</span> <span class="n">left</span> <span class="o">+</span> <span class="p">(</span><span class="n">right</span> <span class="o">-</span> <span class="n">left</span><span class="p">)</span> <span class="o">//</span> <span class="mi">2</span>
-        
-        <span class="c1"># If the mid element is greater than the rightmost element,</span>
-        <span class="c1"># it means the minimum element is in the right half.</span>
-        <span class="k">if</span> <span class="n">nums</span><span class="p">[</span><span class="n">mid</span><span class="p">]</span> <span class="o">&gt;</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]:</span>
-            <span class="n">left</span> <span class="o">=</span> <span class="n">mid</span> <span class="o">+</span> <span class="mi">1</span>
-        <span class="c1"># If the mid element is less than or equal to the rightmost element,</span>
-        <span class="c1"># it means the minimum element is in the left half or at the mid itself.</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">right</span> <span class="o">=</span> <span class="n">mid</span>
-    
-    <span class="c1"># The loop will break when left and right converge to the minimum element.</span>
-    <span class="c1"># At this point, left (or right) will be pointing to the minimum element.</span>
-    <span class="k">return</span> <span class="n">nums</span><span class="p">[</span><span class="n">left</span><span class="p">]</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The function <code class="docutils literal notranslate"><span class="pre">findMin(nums)</span></code> takes an input list <code class="docutils literal notranslate"><span class="pre">nums</span></code>, which represents the rotated sorted array.</p></li>
-<li><p>Initialize two pointers <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> to track the current search range. Initially, <code class="docutils literal notranslate"><span class="pre">left</span></code> is set to 0 (the beginning of the array), and <code class="docutils literal notranslate"><span class="pre">right</span></code> is set to <code class="docutils literal notranslate"><span class="pre">len(nums)</span> <span class="pre">-</span> <span class="pre">1</span></code> (the end of the array).</p></li>
-<li><p>Enter a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop with the condition <code class="docutils literal notranslate"><span class="pre">left</span> <span class="pre">&lt;</span> <span class="pre">right</span></code>. This loop continues until <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> converge to a single element, which will be the minimum element in the rotated array.</p></li>
-<li><p>Inside the loop, calculate the middle index <code class="docutils literal notranslate"><span class="pre">mid</span></code> using integer division. This helps in finding the middle element of the current search range.</p></li>
-<li><p>Check if the element at the middle index (<code class="docutils literal notranslate"><span class="pre">nums[mid]</span></code>) is greater than the element at the rightmost index (<code class="docutils literal notranslate"><span class="pre">nums[right]</span></code>). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update <code class="docutils literal notranslate"><span class="pre">left</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span> <span class="pre">+</span> <span class="pre">1</span></code>, effectively eliminating the left half of the search range.</p></li>
-<li><p>If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the <code class="docutils literal notranslate"><span class="pre">mid</span></code> index itself. In this case, update <code class="docutils literal notranslate"><span class="pre">right</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span></code>, effectively eliminating the right half of the search range.</p></li>
-<li><p>Repeat steps 4-6 until <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> converge to the minimum element.</p></li>
-<li><p>When the loop exits, it means that <code class="docutils literal notranslate"><span class="pre">left</span></code> (or <code class="docutils literal notranslate"><span class="pre">right</span></code>) points to the minimum element in the array.</p></li>
-<li><p>Return <code class="docutils literal notranslate"><span class="pre">nums[left]</span></code> (or <code class="docutils literal notranslate"><span class="pre">nums[right]</span></code>) as the result, which is the minimum element in the rotated sorted array.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1:</span>
-<span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">findMin</span><span class="p">(</span><span class="n">nums1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">findMin</span><span class="p">(</span><span class="n">nums2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>0
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="n">nums3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">11</span><span class="p">,</span> <span class="mi">13</span><span class="p">,</span> <span class="mi">15</span><span class="p">,</span> <span class="mi">17</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">findMin</span><span class="p">(</span><span class="n">nums3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>11
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong>
-The time complexity of this code is <span class="math notranslate nohighlight">\(O(log\ n)\)</span>, where ‘<span class="math notranslate nohighlight">\(n\)</span>’ is the length of the input array <code class="docutils literal notranslate"><span class="pre">nums</span></code>. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.</p>
-<p>In each iteration of the <code class="docutils literal notranslate"><span class="pre">while</span></code> loop, the search range is halved, and this process continues until the <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.</p>
-<p>Therefore, the binary search used in this code runs in <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time complexity.</p>
-<p><strong>Space Complexity:</strong>
-The space complexity of this code is <span class="math notranslate nohighlight">\(O(1)\)</span>, which means it uses a constant amount of additional space that does not depend on the size of the input array.</p>
-<p>The algorithm uses a fixed number of variables (<code class="docutils literal notranslate"><span class="pre">left</span></code>, <code class="docutils literal notranslate"><span class="pre">right</span></code>, <code class="docutils literal notranslate"><span class="pre">mid</span></code>) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.</p>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(log\ n)\)</span></p></li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(1)\)</span></p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Solve the problem with a variation where the input array may contain duplicates.</p></li>
-<li><p>Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time.</p></li>
-<li><p>Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time?</p></li>
-<li><p>Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./05. Binary Search"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Binary search Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="33.%20Search%20in%20Rotated%20Sorted%20Array.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">33. Search in Rotated Sorted Array</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/05. Binary Search/33. Search in Rotated Sorted Array.html b/docs/_build/html/05. Binary Search/33. Search in Rotated Sorted Array.html
deleted file mode 100644
index b778f6e..0000000
--- a/docs/_build/html/05. Binary Search/33. Search in Rotated Sorted Array.html	
+++ /dev/null
@@ -1,739 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>33. Search in Rotated Sorted Array &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '05. Binary Search/33. Search in Rotated Sorted Array';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Linked List Problems - Blind 75 LeetCode" href="../06.%20Linked%20List/README.html" />
-    <link rel="prev" title="153. Find Minimum in Rotated Sorted Array" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Binary search Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F05. Binary Search/33. Search in Rotated Sorted Array.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>33. Search in Rotated Sorted Array</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="search-in-rotated-sorted-array">
-<h1>33. Search in Rotated Sorted Array<a class="headerlink" href="#search-in-rotated-sorted-array" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/search-in-rotated-sorted-array/">To see the Search in Rotated Sorted Array problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>There is an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code> sorted in ascending order (with <strong>distinct</strong> values).</p>
-<p>Prior to being passed to your function, <code class="docutils literal notranslate"><span class="pre">nums</span></code> is <strong>possibly rotated</strong> at an unknown pivot index <code class="docutils literal notranslate"><span class="pre">k</span> <span class="pre">(1</span> <span class="pre">&lt;=</span> <span class="pre">k</span> <span class="pre">&lt;</span> <span class="pre">nums.length)</span></code> such that the resulting array is <code class="docutils literal notranslate"><span class="pre">[nums[k],</span> <span class="pre">nums[k+1],</span> <span class="pre">...,</span> <span class="pre">nums[n-1],</span> <span class="pre">nums[0],</span> <span class="pre">nums[1],</span> <span class="pre">...,</span> <span class="pre">nums[k-1]]</span></code> (<strong>0-indexed</strong>). For example, <code class="docutils literal notranslate"><span class="pre">[0,1,2,4,5,6,7]</span></code> might be rotated at pivot index 3 and become <code class="docutils literal notranslate"><span class="pre">[4,5,6,7,0,1,2]</span></code>.</p>
-<p>Given the array <code class="docutils literal notranslate"><span class="pre">nums</span></code> <strong>after</strong> the possible rotation and an integer <code class="docutils literal notranslate"><span class="pre">target</span></code>, return <em>the index of <code class="docutils literal notranslate"><span class="pre">target</span></code> if it is in <code class="docutils literal notranslate"><span class="pre">nums</span></code>, or <code class="docutils literal notranslate"><span class="pre">-1</span></code> if it is not in <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</em></p>
-<p>You must write an algorithm with <span class="math notranslate nohighlight">\(O(log\ n)\)</span> runtime complexity.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">nums.length</span> <span class="pre">&lt;=</span> <span class="pre">5000</span></code></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p>All values of <code class="docutils literal notranslate"><span class="pre">nums</span></code> are <strong>unique</strong>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">nums</span></code> is an ascending array that is possibly rotated.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">target</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">search</span><span class="p">(</span><span class="n">nums</span><span class="p">,</span> <span class="n">target</span><span class="p">):</span>
-    <span class="n">left</span><span class="p">,</span> <span class="n">right</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-
-    <span class="c1"># Find the pivot index using binary search</span>
-    <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;</span> <span class="n">right</span><span class="p">:</span>
-        <span class="n">mid</span> <span class="o">=</span> <span class="n">left</span> <span class="o">+</span> <span class="p">(</span><span class="n">right</span> <span class="o">-</span> <span class="n">left</span><span class="p">)</span> <span class="o">//</span> <span class="mi">2</span>
-
-        <span class="k">if</span> <span class="n">nums</span><span class="p">[</span><span class="n">mid</span><span class="p">]</span> <span class="o">&gt;</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]:</span>
-            <span class="n">left</span> <span class="o">=</span> <span class="n">mid</span> <span class="o">+</span> <span class="mi">1</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">right</span> <span class="o">=</span> <span class="n">mid</span>
-
-    <span class="n">pivot</span> <span class="o">=</span> <span class="n">left</span>
-    <span class="n">left</span><span class="p">,</span> <span class="n">right</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span>
-
-    <span class="c1"># Determine which part of the array to search in</span>
-    <span class="k">if</span> <span class="n">target</span> <span class="o">&gt;=</span> <span class="n">nums</span><span class="p">[</span><span class="n">pivot</span><span class="p">]</span> <span class="ow">and</span> <span class="n">target</span> <span class="o">&lt;=</span> <span class="n">nums</span><span class="p">[</span><span class="n">right</span><span class="p">]:</span>
-        <span class="n">left</span> <span class="o">=</span> <span class="n">pivot</span>
-    <span class="k">else</span><span class="p">:</span>
-        <span class="n">right</span> <span class="o">=</span> <span class="n">pivot</span>
-
-    <span class="c1"># Perform binary search to find the target</span>
-    <span class="k">while</span> <span class="n">left</span> <span class="o">&lt;=</span> <span class="n">right</span><span class="p">:</span>
-        <span class="n">mid</span> <span class="o">=</span> <span class="n">left</span> <span class="o">+</span> <span class="p">(</span><span class="n">right</span> <span class="o">-</span> <span class="n">left</span><span class="p">)</span> <span class="o">//</span> <span class="mi">2</span>
-
-        <span class="k">if</span> <span class="n">nums</span><span class="p">[</span><span class="n">mid</span><span class="p">]</span> <span class="o">==</span> <span class="n">target</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">mid</span>
-        <span class="k">elif</span> <span class="n">nums</span><span class="p">[</span><span class="n">mid</span><span class="p">]</span> <span class="o">&lt;</span> <span class="n">target</span><span class="p">:</span>
-            <span class="n">left</span> <span class="o">=</span> <span class="n">mid</span> <span class="o">+</span> <span class="mi">1</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">right</span> <span class="o">=</span> <span class="n">mid</span> <span class="o">-</span> <span class="mi">1</span>
-
-    <span class="k">return</span> <span class="o">-</span><span class="mi">1</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">search</span></code> function takes two arguments: <code class="docutils literal notranslate"><span class="pre">nums</span></code>, which is the rotated sorted array, and <code class="docutils literal notranslate"><span class="pre">target</span></code>, which is the value we want to find in the array.</p></li>
-<li><p>We initialize two pointers, <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>, which represent the range in which we are going to perform binary search. Initially, <code class="docutils literal notranslate"><span class="pre">left</span></code> is set to 0, and <code class="docutils literal notranslate"><span class="pre">right</span></code> is set to the index of the last element in the array (<code class="docutils literal notranslate"><span class="pre">len(nums)</span> <span class="pre">-</span> <span class="pre">1</span></code>).</p></li>
-<li><p>We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop to continue the search until <code class="docutils literal notranslate"><span class="pre">left</span></code> is less than <code class="docutils literal notranslate"><span class="pre">right</span></code>.</p></li>
-<li><p>Inside the loop, we calculate the middle index <code class="docutils literal notranslate"><span class="pre">mid</span></code> using integer division. We then compare the value at <code class="docutils literal notranslate"><span class="pre">mid</span></code> with the value at <code class="docutils literal notranslate"><span class="pre">right</span></code>. If <code class="docutils literal notranslate"><span class="pre">nums[mid]</span></code> is greater than <code class="docutils literal notranslate"><span class="pre">nums[right]</span></code>, it means the pivot point lies to the right of <code class="docutils literal notranslate"><span class="pre">mid</span></code>, so we update <code class="docutils literal notranslate"><span class="pre">left</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span> <span class="pre">+</span> <span class="pre">1</span></code>. Otherwise, the pivot point lies to the left of <code class="docutils literal notranslate"><span class="pre">mid</span></code>, so we update <code class="docutils literal notranslate"><span class="pre">right</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span></code>. This process continues until we find the pivot index.</p></li>
-<li><p>After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.</p></li>
-<li><p>We reset <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code> pointers. If the target value is within the range <code class="docutils literal notranslate"><span class="pre">[nums[pivot],</span> <span class="pre">nums[right]]</span></code>, we set <code class="docutils literal notranslate"><span class="pre">left</span></code> to <code class="docutils literal notranslate"><span class="pre">pivot</span></code> (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set <code class="docutils literal notranslate"><span class="pre">right</span></code> to <code class="docutils literal notranslate"><span class="pre">pivot</span></code> (the end of the sorted part), indicating that we should search in the sorted part.</p></li>
-<li><p>We then perform binary search again within the chosen range (<code class="docutils literal notranslate"><span class="pre">left</span></code> to <code class="docutils literal notranslate"><span class="pre">right</span></code>) to find the target element. The binary search continues until <code class="docutils literal notranslate"><span class="pre">left</span></code> is less than or equal to <code class="docutils literal notranslate"><span class="pre">right</span></code>.</p></li>
-<li><p>Inside the binary search loop, we calculate the middle index <code class="docutils literal notranslate"><span class="pre">mid</span></code> and compare <code class="docutils literal notranslate"><span class="pre">nums[mid]</span></code> with the target value. If they are equal, we return <code class="docutils literal notranslate"><span class="pre">mid</span></code> as the index of the target element. If <code class="docutils literal notranslate"><span class="pre">nums[mid]</span></code> is less than the target, we update <code class="docutils literal notranslate"><span class="pre">left</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span> <span class="pre">+</span> <span class="pre">1</span></code> to search in the right half. If <code class="docutils literal notranslate"><span class="pre">nums[mid]</span></code> is greater than the target, we update <code class="docutils literal notranslate"><span class="pre">right</span></code> to <code class="docutils literal notranslate"><span class="pre">mid</span> <span class="pre">-</span> <span class="pre">1</span></code> to search in the left half.</p></li>
-<li><p>If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="n">target1</span> <span class="o">=</span> <span class="mi">0</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">search</span><span class="p">(</span><span class="n">nums1</span><span class="p">,</span> <span class="n">target1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result1</span><span class="p">)</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="n">target2</span> <span class="o">=</span> <span class="mi">3</span>
-<span class="n">result2</span> <span class="o">=</span> <span class="n">search</span><span class="p">(</span><span class="n">nums2</span><span class="p">,</span> <span class="n">target2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result2</span><span class="p">)</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>-1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="n">nums3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">target3</span> <span class="o">=</span> <span class="mi">0</span>
-<span class="n">result3</span> <span class="o">=</span> <span class="n">search</span><span class="p">(</span><span class="n">nums3</span><span class="p">,</span> <span class="n">target3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result3</span><span class="p">)</span> 
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>-1
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Finding the pivot index using binary search takes <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time, where ‘<span class="math notranslate nohighlight">\(n\)</span>’ is the number of elements in the array.</p></li>
-<li><p>After finding the pivot index, performing binary search to find the target element also takes <span class="math notranslate nohighlight">\(O(log\ n)\)</span> time in the worst case.</p></li>
-</ol>
-<p>The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is <span class="math notranslate nohighlight">\(O(log\ n)\)</span>.</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of the code is very minimal:</p>
-<ol class="arabic simple">
-<li><p>We use a constant amount of additional space for variables such as <code class="docutils literal notranslate"><span class="pre">left</span></code>, <code class="docutils literal notranslate"><span class="pre">right</span></code>, <code class="docutils literal notranslate"><span class="pre">pivot</span></code>, and <code class="docutils literal notranslate"><span class="pre">mid</span></code>. These variables do not depend on the input size, so they contribute <span class="math notranslate nohighlight">\(O(1)\)</span> space complexity.</p></li>
-<li><p>The function does not use any additional data structures that scale with the input size.</p></li>
-</ol>
-<p>Therefore, the space complexity of the code is <span class="math notranslate nohighlight">\(O(1)\)</span>, which means it has a constant space complexity and does not depend on the size of the input array.</p>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(log\ n)\)</span></p></li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(1)\)</span></p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Find Minimum Element in Rotated Sorted Array</strong>: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don’t need to search for a target value but instead find the smallest element.</p></li>
-<li><p><strong>Search in a Circularly Sorted Array</strong>: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining <span class="math notranslate nohighlight">\(O(log\ n)\)</span> complexity.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./05. Binary Search"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">153. Find Minimum in Rotated Sorted Array</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../06.%20Linked%20List/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Linked List Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/06. Linked List/141. Linked List Cycle.html b/docs/_build/html/06. Linked List/141. Linked List Cycle.html
deleted file mode 100644
index ddbdbff..0000000
--- a/docs/_build/html/06. Linked List/141. Linked List Cycle.html	
+++ /dev/null
@@ -1,755 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>141. Linked List Cycle &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/141. Linked List Cycle';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="143. Reorder List" href="143.%20Reorder%20List.html" />
-    <link rel="prev" title="Linked List Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/141. Linked List Cycle.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/141. Linked List Cycle.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>141. Linked List Cycle</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="linked-list-cycle">
-<h1>141. Linked List Cycle<a class="headerlink" href="#linked-list-cycle" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/linked-list-cycle/">To see the Linked List Cycle problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given <code class="docutils literal notranslate"><span class="pre">head</span></code>, the head of a linked list, determine if the linked list has a cycle in it.</p>
-<p>There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer. Internally, <code class="docutils literal notranslate"><span class="pre">pos</span></code> is used to denote the index of the node that tail’s <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer is connected to. <strong>Note that <code class="docutils literal notranslate"><span class="pre">pos</span></code> is not passed as a parameter.</strong></p>
-<p>Return <code class="docutils literal notranslate"><span class="pre">true</span></code> if there is a cycle in the linked list. Otherwise, return <code class="docutils literal notranslate"><span class="pre">false</span></code>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of the nodes in the list is in the range <span class="math notranslate nohighlight">\([0, 10^4]\)</span>.</p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^5\)</span> &lt;= Node.val &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">pos</span></code> is <code class="docutils literal notranslate"><span class="pre">-1</span></code> or a <strong>valid index</strong> in the linked-list.</p></li>
-</ul>
-<p><strong>Follow up:</strong> Can you solve it using <span class="math notranslate nohighlight">\(O(1)\)</span> (i.e. constant) memory?</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for singly-linked list.</span>
-<span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="kc">None</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">hasCycle</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">head</span><span class="p">:</span> <span class="n">ListNode</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">head</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">False</span>
-        
-        <span class="n">slow</span> <span class="o">=</span> <span class="n">head</span>
-        <span class="n">fast</span> <span class="o">=</span> <span class="n">head</span>
-        
-        <span class="k">while</span> <span class="n">fast</span> <span class="ow">and</span> <span class="n">fast</span><span class="o">.</span><span class="n">next</span><span class="p">:</span>
-            <span class="n">slow</span> <span class="o">=</span> <span class="n">slow</span><span class="o">.</span><span class="n">next</span>
-            <span class="n">fast</span> <span class="o">=</span> <span class="n">fast</span><span class="o">.</span><span class="n">next</span><span class="o">.</span><span class="n">next</span>
-            
-            <span class="k">if</span> <span class="n">slow</span> <span class="o">==</span> <span class="n">fast</span><span class="p">:</span>
-                <span class="k">return</span> <span class="kc">True</span>
-        
-        <span class="k">return</span> <span class="kc">False</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The given code defines a class <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method <code class="docutils literal notranslate"><span class="pre">hasCycle</span></code> for determining if a linked list has a cycle.</p>
-<p>The <code class="docutils literal notranslate"><span class="pre">ListNode</span></code> class represents nodes in the linked list, where each node has a <code class="docutils literal notranslate"><span class="pre">val</span></code> (a value associated with the node) and a <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute (a reference to the next node in the list).</p>
-<p>The <code class="docutils literal notranslate"><span class="pre">hasCycle</span></code> method takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of a linked list as input and returns <code class="docutils literal notranslate"><span class="pre">True</span></code> if there is a cycle in the linked list, and <code class="docutils literal notranslate"><span class="pre">False</span></code> otherwise. It uses two pointers, <code class="docutils literal notranslate"><span class="pre">slow</span></code> and <code class="docutils literal notranslate"><span class="pre">fast</span></code>, to traverse the linked list. If there is a cycle, the <code class="docutils literal notranslate"><span class="pre">fast</span></code> pointer will eventually catch up to the <code class="docutils literal notranslate"><span class="pre">slow</span></code> pointer.</p>
-<p>The algorithm works as follows:</p>
-<ol class="arabic simple">
-<li><p>It checks if the input <code class="docutils literal notranslate"><span class="pre">head</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> (an empty list). If it is, the method returns <code class="docutils literal notranslate"><span class="pre">False</span></code> because an empty list can’t have a cycle.</p></li>
-<li><p>Two pointers, <code class="docutils literal notranslate"><span class="pre">slow</span></code> and <code class="docutils literal notranslate"><span class="pre">fast</span></code>, initially point to the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the list.</p></li>
-<li><p>The code enters a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop where <code class="docutils literal notranslate"><span class="pre">fast</span></code> moves two steps at a time, and <code class="docutils literal notranslate"><span class="pre">slow</span></code> moves one step at a time.</p></li>
-<li><p>If there is a cycle, <code class="docutils literal notranslate"><span class="pre">fast</span></code> will eventually catch up to <code class="docutils literal notranslate"><span class="pre">slow</span></code>, and the method returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If the loop completes without finding a cycle, the method returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Helper function to create a linked list with a cycle</span>
-<span class="k">def</span> <span class="nf">create_linked_list_with_cycle</span><span class="p">(</span><span class="n">values</span><span class="p">,</span> <span class="n">pos</span><span class="p">):</span>
-    <span class="n">dummy</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">()</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">dummy</span>
-    <span class="n">cycle_node</span> <span class="o">=</span> <span class="kc">None</span>
-    
-    <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">val</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">values</span><span class="p">):</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-        
-        <span class="k">if</span> <span class="n">i</span> <span class="o">==</span> <span class="n">pos</span><span class="p">:</span>
-            <span class="n">cycle_node</span> <span class="o">=</span> <span class="n">current</span>
-    
-    <span class="k">if</span> <span class="n">cycle_node</span><span class="p">:</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">cycle_node</span>
-    
-    <span class="k">return</span> <span class="n">dummy</span><span class="o">.</span><span class="n">next</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">values</span></code>: A list of values representing the nodes in the linked list.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">pos</span></code>: An integer representing the index of the node where the cycle begins.</p></li>
-</ol>
-<p>Here’s how the function works:</p>
-<ul class="simple">
-<li><p>It starts by creating an empty <code class="docutils literal notranslate"><span class="pre">ListNode</span></code> called <code class="docutils literal notranslate"><span class="pre">dummy</span></code>. This <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node is used to simplify the creation of the linked list.</p></li>
-<li><p>It initializes a <code class="docutils literal notranslate"><span class="pre">current</span></code> pointer to the <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node. This pointer will be used to traverse the linked list.</p></li>
-<li><p>It initializes a <code class="docutils literal notranslate"><span class="pre">cycle_node</span></code> variable to <code class="docutils literal notranslate"><span class="pre">None</span></code>. This variable will hold the reference to the node where the cycle begins, if any.</p></li>
-<li><p>It then iterates through the <code class="docutils literal notranslate"><span class="pre">values</span></code> list, creating a new <code class="docutils literal notranslate"><span class="pre">ListNode</span></code> for each value and appending it to the linked list.</p></li>
-<li><p>Inside the loop, it checks if the current index <code class="docutils literal notranslate"><span class="pre">i</span></code> is equal to the specified <code class="docutils literal notranslate"><span class="pre">pos</span></code>. If they match, it sets <code class="docutils literal notranslate"><span class="pre">cycle_node</span></code> to the current node. This simulates the creation of a cycle in the linked list.</p></li>
-<li><p>After the loop, if <code class="docutils literal notranslate"><span class="pre">cycle_node</span></code> is not <code class="docutils literal notranslate"><span class="pre">None</span></code> (indicating a cycle should be created), it connects the last node in the linked list to <code class="docutils literal notranslate"><span class="pre">cycle_node</span></code>, effectively creating a cycle.</p></li>
-<li><p>Finally, it returns the reference to the first node of the linked list (not the <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node).</p></li>
-</ul>
-<p>This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It’s particularly useful for testing the code’s ability to detect cycles in linked lists.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-<span class="n">head</span> <span class="o">=</span> <span class="p">[</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">0</span><span class="p">,</span><span class="o">-</span><span class="mi">4</span><span class="p">]</span>
-<span class="n">pos</span> <span class="o">=</span> <span class="mi">1</span>
-
-<span class="n">head</span> <span class="o">=</span> <span class="n">create_linked_list_with_cycle</span><span class="p">(</span><span class="n">head</span><span class="p">,</span> <span class="n">pos</span><span class="p">)</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">hasCycle</span><span class="p">(</span><span class="n">head</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-<span class="n">head</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">]</span>
-<span class="n">pos</span> <span class="o">=</span> <span class="mi">0</span>
-
-<span class="n">head</span> <span class="o">=</span> <span class="n">create_linked_list_with_cycle</span><span class="p">(</span><span class="n">head</span><span class="p">,</span> <span class="n">pos</span><span class="p">)</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">hasCycle</span><span class="p">(</span><span class="n">head</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 3</span>
-<span class="n">head</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span>
-<span class="n">pos</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
-
-<span class="n">head</span> <span class="o">=</span> <span class="n">create_linked_list_with_cycle</span><span class="p">(</span><span class="n">head</span><span class="p">,</span> <span class="n">pos</span><span class="p">)</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">hasCycle</span><span class="p">(</span><span class="n">head</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s discuss the time and space complexity of the code for detecting a cycle in a linked list:</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of this code is <span class="math notranslate nohighlight">\(O(n)\)</span>, where “<span class="math notranslate nohighlight">\(n\)</span>” is the number of nodes in the linked list.</p>
-<p>The reason for this is that both the <code class="docutils literal notranslate"><span class="pre">slow</span></code> and <code class="docutils literal notranslate"><span class="pre">fast</span></code> pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the <code class="docutils literal notranslate"><span class="pre">fast</span></code> pointer will reach the end of the list after going through approximately <span class="math notranslate nohighlight">\(n/2\)</span> nodes. In the case of a cycle, it may take some extra iterations for the <code class="docutils literal notranslate"><span class="pre">fast</span></code> pointer to catch up to the <code class="docutils literal notranslate"><span class="pre">slow</span></code> pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it <span class="math notranslate nohighlight">\(O(n)\)</span>.</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of this code is <span class="math notranslate nohighlight">\(O(1)\)</span>, which means it uses constant space.</p>
-<p>The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (<code class="docutils literal notranslate"><span class="pre">slow</span></code> and <code class="docutils literal notranslate"><span class="pre">fast</span></code>) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.</p>
-<p><strong>In summary</strong>, this code efficiently detects cycles in a linked list with a time complexity of <span class="math notranslate nohighlight">\(O(n)\)</span> and a space complexity of <span class="math notranslate nohighlight">\(O(1)\)</span>. It is an example of an algorithm that solves a complex problem with minimal memory usage.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Linked List Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="143.%20Reorder%20List.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">143. Reorder List</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/06. Linked List/143. Reorder List.html b/docs/_build/html/06. Linked List/143. Reorder List.html
deleted file mode 100644
index 3447be3..0000000
--- a/docs/_build/html/06. Linked List/143. Reorder List.html	
+++ /dev/null
@@ -1,798 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>143. Reorder List &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/143. Reorder List';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="19. Remove Nth Node From End of List" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html" />
-    <link rel="prev" title="141. Linked List Cycle" href="141.%20Linked%20List%20Cycle.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/143. Reorder List.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/143. Reorder List.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>143. Reorder List</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="reorder-list">
-<h1>143. Reorder List<a class="headerlink" href="#reorder-list" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/reorder-list/">To see the Reorder List problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given the head of a singly linked-list. The list can be represented as:</p>
-<p><span class="math notranslate nohighlight">\(L_0 → L_1 → … → L_{n - 1} → L_n\)</span></p>
-<p>Reorder the list to be on the following form:</p>
-<p><span class="math notranslate nohighlight">\(L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …\)</span></p>
-<p>You may not modify the values in the list’s nodes. Only nodes themselves may be changed.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the list is in the range <span class="math notranslate nohighlight">\([1, 5 * 10^4]\)</span>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">next</span>
-
-<span class="k">def</span> <span class="nf">reorderList</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">head</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">head</span><span class="o">.</span><span class="n">next</span><span class="p">:</span>
-        <span class="k">return</span> <span class="n">head</span>
-
-    <span class="c1"># Step 1: Find the middle of the linked list</span>
-    <span class="n">slow</span><span class="p">,</span> <span class="n">fast</span> <span class="o">=</span> <span class="n">head</span><span class="p">,</span> <span class="n">head</span>
-    <span class="k">while</span> <span class="n">fast</span><span class="o">.</span><span class="n">next</span> <span class="ow">and</span> <span class="n">fast</span><span class="o">.</span><span class="n">next</span><span class="o">.</span><span class="n">next</span><span class="p">:</span>
-        <span class="n">slow</span> <span class="o">=</span> <span class="n">slow</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">fast</span> <span class="o">=</span> <span class="n">fast</span><span class="o">.</span><span class="n">next</span><span class="o">.</span><span class="n">next</span>
-
-    <span class="c1"># Split the list into two halves</span>
-    <span class="n">first_half</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="n">second_half</span> <span class="o">=</span> <span class="n">slow</span><span class="o">.</span><span class="n">next</span>
-    <span class="n">slow</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="kc">None</span>
-
-    <span class="c1"># Step 2: Reverse the second half of the linked list</span>
-    <span class="n">prev</span> <span class="o">=</span> <span class="kc">None</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">second_half</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="n">next_node</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">prev</span>
-        <span class="n">prev</span> <span class="o">=</span> <span class="n">current</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">next_node</span>
-    <span class="n">second_half</span> <span class="o">=</span> <span class="n">prev</span>
-
-    <span class="c1"># Step 3: Merge the first and reversed second halves alternately</span>
-    <span class="n">p1</span><span class="p">,</span> <span class="n">p2</span> <span class="o">=</span> <span class="n">first_half</span><span class="p">,</span> <span class="n">second_half</span>
-    <span class="k">while</span> <span class="n">p2</span><span class="p">:</span>
-        <span class="n">next_p1</span> <span class="o">=</span> <span class="n">p1</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">next_p2</span> <span class="o">=</span> <span class="n">p2</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">p1</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">p2</span>
-        <span class="n">p2</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">next_p1</span>
-        <span class="n">p1</span> <span class="o">=</span> <span class="n">next_p1</span>
-        <span class="n">p2</span> <span class="o">=</span> <span class="n">next_p2</span>
-
-    <span class="k">return</span> <span class="n">head</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The <code class="docutils literal notranslate"><span class="pre">reorderList</span></code> function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here’s a detailed explanation of how the function works:</p>
-<ol class="arabic simple">
-<li><p><strong>Base Cases Handling</strong>:</p>
-<ul class="simple">
-<li><p>The function first checks if the input linked list is empty (<code class="docutils literal notranslate"><span class="pre">not</span> <span class="pre">head</span></code>) or contains only one element (<code class="docutils literal notranslate"><span class="pre">not</span> <span class="pre">head.next</span></code>). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.</p></li>
-</ul>
-</li>
-<li><p><strong>Finding the Middle of the Linked List</strong>:</p>
-<ul class="simple">
-<li><p>To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, <code class="docutils literal notranslate"><span class="pre">slow</span></code> and <code class="docutils literal notranslate"><span class="pre">fast</span></code>, initialized to the head of the list.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">slow</span></code> moves one step at a time while <code class="docutils literal notranslate"><span class="pre">fast</span></code> moves two steps at a time. When <code class="docutils literal notranslate"><span class="pre">fast</span></code> reaches the end of the list or the second-to-last node, <code class="docutils literal notranslate"><span class="pre">slow</span></code> will be at the middle node.</p></li>
-</ul>
-</li>
-<li><p><strong>Splitting the List</strong>:</p>
-<ul class="simple">
-<li><p>After finding the middle node, we split the list into two halves:</p>
-<ul>
-<li><p>The first half, <code class="docutils literal notranslate"><span class="pre">first_half</span></code>, contains nodes from the beginning up to the middle.</p></li>
-<li><p>The second half, <code class="docutils literal notranslate"><span class="pre">second_half</span></code>, contains nodes from the middle to the end.</p></li>
-</ul>
-</li>
-<li><p>To split the list, we set the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer of the node before the middle node to <code class="docutils literal notranslate"><span class="pre">None</span></code>.</p></li>
-</ul>
-</li>
-<li><p><strong>Reversing the Second Half</strong>:</p>
-<ul class="simple">
-<li><p>We reverse the second half of the linked list using the <code class="docutils literal notranslate"><span class="pre">prev</span></code>, <code class="docutils literal notranslate"><span class="pre">current</span></code>, and <code class="docutils literal notranslate"><span class="pre">next_node</span></code> pointers.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">prev</span></code> is initially <code class="docutils literal notranslate"><span class="pre">None</span></code>, and we iterate through the second half. For each node, we:</p>
-<ul>
-<li><p>Set the <code class="docutils literal notranslate"><span class="pre">next</span></code> of the current node to <code class="docutils literal notranslate"><span class="pre">prev</span></code>, effectively reversing the next pointer direction.</p></li>
-<li><p>Update <code class="docutils literal notranslate"><span class="pre">prev</span></code> to the current node.</p></li>
-<li><p>Move to the next node using the <code class="docutils literal notranslate"><span class="pre">next_node</span></code>.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><strong>Merging the Two Halves Alternately</strong>:</p>
-<ul class="simple">
-<li><p>We now have two linked lists: <code class="docutils literal notranslate"><span class="pre">first_half</span></code> and the reversed <code class="docutils literal notranslate"><span class="pre">second_half</span></code>.</p></li>
-<li><p>We merge these two lists alternately by adjusting the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointers of the nodes.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">p1</span></code> and <code class="docutils literal notranslate"><span class="pre">p2</span></code> are pointers to the current nodes in <code class="docutils literal notranslate"><span class="pre">first_half</span></code> and <code class="docutils literal notranslate"><span class="pre">second_half</span></code>, respectively.</p></li>
-<li><p>We iterate through both lists while reordering nodes:</p>
-<ul>
-<li><p>Set the <code class="docutils literal notranslate"><span class="pre">next</span></code> of <code class="docutils literal notranslate"><span class="pre">p1</span></code> to <code class="docutils literal notranslate"><span class="pre">p2</span></code> to link a node from the first half to a node from the reversed second half.</p></li>
-<li><p>Update <code class="docutils literal notranslate"><span class="pre">p1</span></code> and <code class="docutils literal notranslate"><span class="pre">p2</span></code> to their respective next nodes.</p></li>
-<li><p>Repeat this process until we have processed all nodes in both halves.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><strong>Returning the Reordered List</strong>:</p>
-<ul class="simple">
-<li><p>After the merging process is complete, the linked list is reordered as specified.</p></li>
-<li><p>The function returns the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the reordered list.</p></li>
-</ul>
-</li>
-</ol>
-<p>The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves.</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Helper function to print the linked list</span>
-<span class="k">def</span> <span class="nf">printLinkedList</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="k">while</span> <span class="n">head</span><span class="p">:</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">head</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">head</span> <span class="o">=</span> <span class="n">head</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s explain the helper functions:
-<strong>printLinkedList Function</strong>:</p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">printLinkedList</span></code> function takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of a linked list as input and returns a list of values representing the nodes in the linked list.</p></li>
-<li><p>Inside the function, a <code class="docutils literal notranslate"><span class="pre">result</span></code> list is initialized to store the values of the linked list nodes.</p></li>
-<li><p>The function then iterates through the linked list starting from the <code class="docutils literal notranslate"><span class="pre">head</span></code> node and appends the <code class="docutils literal notranslate"><span class="pre">val</span></code> attribute of each node to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p></li>
-<li><p>As it iterates through the list, it moves to the next node using the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute of each node.</p></li>
-<li><p>Finally, the function returns the <code class="docutils literal notranslate"><span class="pre">result</span></code> list containing the values of the linked list nodes in the order they appear in the linked list.</p></li>
-</ul>
-<p>This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">head1</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">))))</span>
-<span class="n">reorderList</span><span class="p">(</span><span class="n">head1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">printLinkedList</span><span class="p">(</span><span class="n">head1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 4, 2, 3]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">head2</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)))))</span>
-<span class="n">reorderList</span><span class="p">(</span><span class="n">head2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">printLinkedList</span><span class="p">(</span><span class="n">head2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 5, 2, 4, 3]
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">reorderList</span></code> function:</p>
-<p><strong>Time Complexity</strong>:</p>
-<ol class="arabic simple">
-<li><p><strong>Finding the Middle of the Linked List</strong>: In this step, we use two pointers, one moving one step at a time (<code class="docutils literal notranslate"><span class="pre">slow</span></code>) and the other moving two steps at a time (<code class="docutils literal notranslate"><span class="pre">fast</span></code>). This process takes <span class="math notranslate nohighlight">\(O(N/2)\)</span> time, where <span class="math notranslate nohighlight">\(N\)</span> is the number of nodes in the linked list.</p></li>
-<li><p><strong>Splitting the List</strong>: After finding the middle, we split the list into two halves by setting the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer of the node before the middle node to <code class="docutils literal notranslate"><span class="pre">None</span></code>. This step takes <span class="math notranslate nohighlight">\(O(1)\)</span> time.</p></li>
-<li><p><strong>Reversing the Second Half</strong>: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes <span class="math notranslate nohighlight">\(O(N/2)\)</span> time.</p></li>
-<li><p><strong>Merging the Two Halves Alternately</strong>: In this step, we merge the two halves alternately by adjusting the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointers of the nodes. We iterate through both halves once, so this step takes <span class="math notranslate nohighlight">\(O(N/2)\)</span> time.</p></li>
-</ol>
-<p>Overall, the time complexity of the <code class="docutils literal notranslate"><span class="pre">reorderList</span></code> function is dominated by the steps involving reversing and merging the two halves, both of which take <span class="math notranslate nohighlight">\(O(N/2)\)</span> time. Therefore, the total time complexity is <span class="math notranslate nohighlight">\(O(N)\)</span>.</p>
-<p><strong>Space Complexity</strong>:
-The space complexity of the <code class="docutils literal notranslate"><span class="pre">reorderList</span></code> function is primarily determined by the variables and data structures used within the function. Let’s break down the space complexity components:</p>
-<ol class="arabic simple">
-<li><p><strong>Constant Space Variables</strong>: The variables <code class="docutils literal notranslate"><span class="pre">slow</span></code>, <code class="docutils literal notranslate"><span class="pre">fast</span></code>, <code class="docutils literal notranslate"><span class="pre">prev</span></code>, <code class="docutils literal notranslate"><span class="pre">current</span></code>, <code class="docutils literal notranslate"><span class="pre">next_node</span></code>, <code class="docutils literal notranslate"><span class="pre">p1</span></code>, and <code class="docutils literal notranslate"><span class="pre">p2</span></code> are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute <span class="math notranslate nohighlight">\(O(1)\)</span> to the space complexity.</p></li>
-<li><p><strong>Split Linked Lists</strong>: In the splitting step, we create two new linked list segments (<code class="docutils literal notranslate"><span class="pre">first_half</span></code> and <code class="docutils literal notranslate"><span class="pre">second_half</span></code>) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, <span class="math notranslate nohighlight">\(O(N/2)\)</span>.</p></li>
-<li><p><strong>Reversed Second Half</strong>: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn’t contribute to additional space complexity.</p></li>
-<li><p><strong>Overall</strong>: Combining the above components, the total space complexity is <span class="math notranslate nohighlight">\(O(N/2)\)</span>, which simplifies to <span class="math notranslate nohighlight">\(O(N)\)</span> in terms of space complexity.</p></li>
-</ol>
-<p><strong>In summary</strong>, the <code class="docutils literal notranslate"><span class="pre">reorderList</span></code> function has a time complexity of <span class="math notranslate nohighlight">\(O(N)\)</span> and a space complexity of <span class="math notranslate nohighlight">\(O(N)\)</span> due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Reorder by K Elements:</strong> Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by <span class="math notranslate nohighlight">\(K\)</span> elements at a time. For example, for <span class="math notranslate nohighlight">\(K=3\)</span>, you would reorder it as (<span class="math notranslate nohighlight">\(L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...\)</span>).
-You may need to handle cases where the number of nodes is not a multiple of <span class="math notranslate nohighlight">\(K\)</span>.</p></li>
-<li><p><strong>Reorder by Odd and Even Nodes:</strong> Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, (<span class="math notranslate nohighlight">\(L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...\)</span>).</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="141.%20Linked%20List%20Cycle.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">141. Linked List Cycle</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">19. Remove Nth Node From End of List</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/06. Linked List/206. Reverse Linked List.html b/docs/_build/html/06. Linked List/206. Reverse Linked List.html
deleted file mode 100644
index a3b1e03..0000000
--- a/docs/_build/html/06. Linked List/206. Reverse Linked List.html	
+++ /dev/null
@@ -1,831 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>206. Reverse Linked List &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/206. Reverse Linked List';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="21. Merge Two Sorted Lists" href="21.%20Merge%20Two%20Sorted%20Lists.html" />
-    <link rel="prev" title="19. Remove Nth Node From End of List" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/206. Reverse Linked List.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/206. Reverse Linked List.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>206. Reverse Linked List</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="reverse-linked-list">
-<h1>206. Reverse Linked List<a class="headerlink" href="#reverse-linked-list" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/reverse-linked-list/">To see the Reverse Linked List problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">head</span></code> of a singly linked list, reverse the list, and return the reversed list.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the list is the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">5000]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-5000</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">5000</span></code></p></li>
-</ul>
-<p><strong>Follow up:</strong> A linked list can be reversed either iteratively or recursively. Could you implement both?</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for singly-linked list.</span>
-<span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">next</span>
-
-<span class="c1"># Function to reverse a linked list iteratively</span>
-<span class="k">def</span> <span class="nf">reverseListIterative</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="n">prev</span> <span class="o">=</span> <span class="kc">None</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">head</span>
-    
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="n">next_node</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">prev</span>
-        <span class="n">prev</span> <span class="o">=</span> <span class="n">current</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">next_node</span>
-    
-    <span class="k">return</span> <span class="n">prev</span>
-
-<span class="c1"># Function to reverse a linked list recursively</span>
-<span class="k">def</span> <span class="nf">reverseListRecursive</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">head</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">head</span><span class="o">.</span><span class="n">next</span><span class="p">:</span>
-        <span class="k">return</span> <span class="n">head</span>
-
-    <span class="n">new_head</span> <span class="o">=</span> <span class="n">reverseListRecursive</span><span class="p">(</span><span class="n">head</span><span class="o">.</span><span class="n">next</span><span class="p">)</span>
-    <span class="n">head</span><span class="o">.</span><span class="n">next</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="n">head</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="kc">None</span>
-
-    <span class="k">return</span> <span class="n">new_head</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">reverseListIterative(head)</span></code>: This function reverses a linked list iteratively using a loop. Here’s a step-by-step explanation:</p>
-<ul class="simple">
-<li><p>It takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the input linked list as a parameter.</p></li>
-<li><p>It initializes two pointers, <code class="docutils literal notranslate"><span class="pre">prev</span></code> and <code class="docutils literal notranslate"><span class="pre">current</span></code>, initially set to <code class="docutils literal notranslate"><span class="pre">None</span></code> and the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the list, respectively.</p></li>
-<li><p>It enters a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop that continues until <code class="docutils literal notranslate"><span class="pre">current</span></code> reaches the end of the list (i.e., becomes <code class="docutils literal notranslate"><span class="pre">None</span></code>).</p></li>
-<li><p>Inside the loop:</p>
-<ul>
-<li><p>It stores the <code class="docutils literal notranslate"><span class="pre">next_node</span></code> which is the next node after <code class="docutils literal notranslate"><span class="pre">current</span></code>.</p></li>
-<li><p>It updates the <code class="docutils literal notranslate"><span class="pre">next</span></code> pointer of <code class="docutils literal notranslate"><span class="pre">current</span></code> to point to the <code class="docutils literal notranslate"><span class="pre">prev</span></code> node. This effectively reverses the link direction.</p></li>
-<li><p>It moves <code class="docutils literal notranslate"><span class="pre">prev</span></code> to <code class="docutils literal notranslate"><span class="pre">current</span></code> and <code class="docutils literal notranslate"><span class="pre">current</span></code> to <code class="docutils literal notranslate"><span class="pre">next_node</span></code>, advancing the pointers one step further in the list.</p></li>
-</ul>
-</li>
-<li><p>Once the loop completes, <code class="docutils literal notranslate"><span class="pre">prev</span></code> will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns <code class="docutils literal notranslate"><span class="pre">prev</span></code>.</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">reverseListRecursive(head)</span></code>: This function reverses a linked list recursively. Here’s how it works:</p>
-<ul class="simple">
-<li><p>It takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the input linked list as a parameter.</p></li>
-<li><p>The base case is checked: if <code class="docutils literal notranslate"><span class="pre">head</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> or <code class="docutils literal notranslate"><span class="pre">head.next</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>, meaning the list is empty or has only one node, it returns <code class="docutils literal notranslate"><span class="pre">head</span></code> as there’s no need to reverse a list with zero or one element.</p></li>
-<li><p>In the recursive case:</p>
-<ul>
-<li><p>It calls itself with <code class="docutils literal notranslate"><span class="pre">head.next</span></code>, effectively moving down the list until it reaches the end.</p></li>
-<li><p>Once it reaches the end, it starts reversing the links:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">head.next.next</span></code> is set to <code class="docutils literal notranslate"><span class="pre">head</span></code>, reversing the link between <code class="docutils literal notranslate"><span class="pre">head</span></code> and the next node.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">head.next</span></code> is set to <code class="docutils literal notranslate"><span class="pre">None</span></code> to avoid cycles.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p>Finally, it returns the new head of the reversed list, which will be the last node of the original list.</p></li>
-</ul>
-</li>
-</ol>
-<p><strong>In summary,</strong> <code class="docutils literal notranslate"><span class="pre">reverseListIterative</span></code> reverses the linked list by iterating through it and changing the next pointers, while <code class="docutils literal notranslate"><span class="pre">reverseListRecursive</span></code> reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list.</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Helper function to create a linked list from a list of values</span>
-<span class="k">def</span> <span class="nf">createLinkedList</span><span class="p">(</span><span class="n">values</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">values</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">None</span>
-    <span class="n">head</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="n">values</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="k">for</span> <span class="n">val</span> <span class="ow">in</span> <span class="n">values</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">head</span>
-
-<span class="c1"># Helper function to convert a linked list to a list for testing</span>
-<span class="k">def</span> <span class="nf">linkedListToList</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">head</span>
-    <span class="k">while</span> <span class="n">current</span><span class="p">:</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">current</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s explain the two helper functions used in the provided code:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">createLinkedList(values)</span></code>:</p>
-<ul class="simple">
-<li><p>Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.</p></li>
-<li><p>How it works:</p>
-<ul>
-<li><p>It first checks if the input list <code class="docutils literal notranslate"><span class="pre">values</span></code> is empty. If it’s empty, it returns <code class="docutils literal notranslate"><span class="pre">None</span></code> to indicate an empty linked list.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">values</span></code> is not empty, it initializes a <code class="docutils literal notranslate"><span class="pre">head</span></code> node with the value of the first element in <code class="docutils literal notranslate"><span class="pre">values</span></code>.</p></li>
-<li><p>It then iterates through the remaining values in <code class="docutils literal notranslate"><span class="pre">values</span></code>, creating new nodes for each value and linking them together to form a linked list.</p></li>
-<li><p>Finally, it returns the <code class="docutils literal notranslate"><span class="pre">head</span></code> node of the newly created linked list.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">linkedListToList(head)</span></code>:</p>
-<ul class="simple">
-<li><p>Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.</p></li>
-<li><p>How it works:</p>
-<ul>
-<li><p>It takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of the linked list as input.</p></li>
-<li><p>It initializes an empty list called <code class="docutils literal notranslate"><span class="pre">result</span></code>.</p></li>
-<li><p>It then iterates through the linked list, starting from <code class="docutils literal notranslate"><span class="pre">head</span></code>, and appends each node’s <code class="docutils literal notranslate"><span class="pre">val</span></code> (value) to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p></li>
-<li><p>This process continues until the end of the linked list is reached.</p></li>
-<li><p>Finally, it returns the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, which contains the values from the linked list in the same order.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p>These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: Iterative</span>
-<span class="n">head1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">]</span>
-<span class="n">head1</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">(</span><span class="n">head1</span><span class="p">)</span>
-<span class="n">reversed_head1</span> <span class="o">=</span> <span class="n">reverseListIterative</span><span class="p">(</span><span class="n">head1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">linkedListToList</span><span class="p">(</span><span class="n">reversed_head1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[5, 4, 3, 2, 1]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2: Recursive</span>
-<span class="n">head2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">]</span>
-<span class="n">head2</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">(</span><span class="n">head2</span><span class="p">)</span>
-<span class="n">reversed_head2</span> <span class="o">=</span> <span class="n">reverseListRecursive</span><span class="p">(</span><span class="n">head2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">linkedListToList</span><span class="p">(</span><span class="n">reversed_head2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[2, 1]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3: Empty list</span>
-<span class="n">head3</span> <span class="o">=</span> <span class="p">[]</span>
-<span class="n">head3</span> <span class="o">=</span> <span class="n">createLinkedList</span><span class="p">(</span><span class="n">head3</span><span class="p">)</span>
-<span class="n">reversed_head3</span> <span class="o">=</span> <span class="n">reverseListIterative</span><span class="p">(</span><span class="n">head3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">linkedListToList</span><span class="p">(</span><span class="n">reversed_head3</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the two functions:</p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">reverseListIterative(head)</span></code>:</p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span></p>
-<ul>
-<li><p>The iterative function visits each node in the linked list exactly once in a single pass, where “<span class="math notranslate nohighlight">\(n\)</span>” is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(1)\)</span></p>
-<ul>
-<li><p>This function uses a constant amount of extra space for the <code class="docutils literal notranslate"><span class="pre">prev</span></code>, <code class="docutils literal notranslate"><span class="pre">current</span></code>, and <code class="docutils literal notranslate"><span class="pre">next_node</span></code> pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">reverseListRecursive(head)</span></code>:</p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span></p>
-<ul>
-<li><p>The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is <span class="math notranslate nohighlight">\(O(n)\)</span>, where “<span class="math notranslate nohighlight">\(n\)</span>” is the number of nodes.</p></li>
-</ul>
-</li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span></p>
-<ul>
-<li><p>The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has “<span class="math notranslate nohighlight">\(n\)</span>” nodes, it will create “<span class="math notranslate nohighlight">\(n\)</span>” recursive function calls on the stack, resulting in a space complexity of <span class="math notranslate nohighlight">\(O(n)\)</span>. This is because each function call stores information about its state, including the <code class="docutils literal notranslate"><span class="pre">head</span></code> pointer, until it reaches the base case and starts returning.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-</ol>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>The time complexity of both functions is <span class="math notranslate nohighlight">\(O(n)\)</span> because they both visit each node once.</p></li>
-<li><p>The space complexity of <code class="docutils literal notranslate"><span class="pre">reverseListIterative</span></code> is <span class="math notranslate nohighlight">\(O(1)\)</span> because it uses a constant amount of extra space.</p></li>
-<li><p>The space complexity of <code class="docutils literal notranslate"><span class="pre">reverseListRecursive</span></code> is <span class="math notranslate nohighlight">\(O(n)\)</span> due to the recursive function calls and the associated call stack space.</p></li>
-</ul>
-<p>Both functions are efficient in terms of time complexity, but <code class="docutils literal notranslate"><span class="pre">reverseListIterative</span></code> is more memory-efficient because it uses a constant amount of additional space, while <code class="docutils literal notranslate"><span class="pre">reverseListRecursive</span></code> uses space on the call stack proportional to the number of nodes in the list.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>K-Group Reverse:</strong> Modify the reverseListIterative function to reverse the linked list in groups of <span class="math notranslate nohighlight">\(K\)</span> elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and <span class="math notranslate nohighlight">\(K\)</span> is 3, the output should be [3, 2, 1, 6, 5, 4].</p></li>
-<li><p><strong>Rotate Linked List:</strong> Write a function to rotate a linked list to the right by <span class="math notranslate nohighlight">\(K\)</span> places. For example, if the input is [1, 2, 3, 4, 5] and <span class="math notranslate nohighlight">\(K\)</span> is 2, the output should be [4, 5, 1, 2, 3].</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">19. Remove Nth Node From End of List</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="21.%20Merge%20Two%20Sorted%20Lists.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">21. Merge Two Sorted Lists</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/06. Linked List/21. Merge Two Sorted Lists.html b/docs/_build/html/06. Linked List/21. Merge Two Sorted Lists.html
deleted file mode 100644
index d075160..0000000
--- a/docs/_build/html/06. Linked List/21. Merge Two Sorted Lists.html	
+++ /dev/null
@@ -1,755 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>21. Merge Two Sorted Lists &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '06. Linked List/21. Merge Two Sorted Lists';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="23. Merge k Sorted Lists" href="23.%20Merge%20k%20Sorted%20Lists.html" />
-    <link rel="prev" title="206. Reverse Linked List" href="206.%20Reverse%20Linked%20List.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Linked List Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F06. Linked List/21. Merge Two Sorted Lists.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>21. Merge Two Sorted Lists</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="merge-two-sorted-lists">
-<h1>21. Merge Two Sorted Lists<a class="headerlink" href="#merge-two-sorted-lists" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/merge-two-sorted-lists/">To see the Merge Two Sorted Lists problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given the heads of two sorted linked lists <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code>.</p>
-<p>Merge the two lists into one <strong>sorted</strong> list. The list should be made by splicing together the nodes of the first two lists.</p>
-<p><em>Return the head of the merged linked list.</em></p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in both lists is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">50]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-100</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p>Both <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code> are sorted in non-decreasing order.</p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">ListNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="nb">next</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="nb">next</span>
-
-<span class="k">def</span> <span class="nf">mergeTwoLists</span><span class="p">(</span><span class="n">list1</span><span class="p">,</span> <span class="n">list2</span><span class="p">):</span>
-    <span class="c1"># Create a dummy node to simplify the code.</span>
-    <span class="n">dummy</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">()</span>
-    <span class="n">current</span> <span class="o">=</span> <span class="n">dummy</span>
-
-    <span class="k">while</span> <span class="n">list1</span> <span class="ow">and</span> <span class="n">list2</span><span class="p">:</span>
-        <span class="k">if</span> <span class="n">list1</span><span class="o">.</span><span class="n">val</span> <span class="o">&lt;</span> <span class="n">list2</span><span class="o">.</span><span class="n">val</span><span class="p">:</span>
-            <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">list1</span>
-            <span class="n">list1</span> <span class="o">=</span> <span class="n">list1</span><span class="o">.</span><span class="n">next</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">list2</span>
-            <span class="n">list2</span> <span class="o">=</span> <span class="n">list2</span><span class="o">.</span><span class="n">next</span>
-        <span class="n">current</span> <span class="o">=</span> <span class="n">current</span><span class="o">.</span><span class="n">next</span>
-
-    <span class="c1"># Append the remaining elements from either list.</span>
-    <span class="k">if</span> <span class="n">list1</span><span class="p">:</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">list1</span>
-    <span class="k">else</span><span class="p">:</span>
-        <span class="n">current</span><span class="o">.</span><span class="n">next</span> <span class="o">=</span> <span class="n">list2</span>
-
-    <span class="k">return</span> <span class="n">dummy</span><span class="o">.</span><span class="n">next</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We define a class <code class="docutils literal notranslate"><span class="pre">ListNode</span></code> to represent the nodes of a singly-linked list. Each node has a <code class="docutils literal notranslate"><span class="pre">val</span></code> attribute to store the value of the node and a <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute to point to the next node in the list.</p></li>
-<li><p>We define the <code class="docutils literal notranslate"><span class="pre">mergeTwoLists</span></code> function that takes two linked list heads, <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code>, as input.</p></li>
-<li><p>We create a <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node at the beginning of the merged list. The <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node simplifies the code by serving as a placeholder, and its <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute will point to the actual merged list.</p></li>
-<li><p>We initialize a <code class="docutils literal notranslate"><span class="pre">current</span></code> pointer to point to the <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node initially. This <code class="docutils literal notranslate"><span class="pre">current</span></code> pointer helps us traverse and build the merged list.</p></li>
-<li><p>We enter a <code class="docutils literal notranslate"><span class="pre">while</span></code> loop that continues until either <code class="docutils literal notranslate"><span class="pre">list1</span></code> or <code class="docutils literal notranslate"><span class="pre">list2</span></code> becomes empty. Inside the loop, we compare the values of the nodes at the current positions of <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code>.</p></li>
-<li><p>If the <code class="docutils literal notranslate"><span class="pre">val</span></code> of the node in <code class="docutils literal notranslate"><span class="pre">list1</span></code> is smaller than the <code class="docutils literal notranslate"><span class="pre">val</span></code> of the node in <code class="docutils literal notranslate"><span class="pre">list2</span></code>, we attach the node from <code class="docutils literal notranslate"><span class="pre">list1</span></code> to the merged list by updating the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute of the <code class="docutils literal notranslate"><span class="pre">current</span></code> node to point to the node in <code class="docutils literal notranslate"><span class="pre">list1</span></code>. We then move the <code class="docutils literal notranslate"><span class="pre">list1</span></code> pointer to the next node.</p></li>
-<li><p>If the <code class="docutils literal notranslate"><span class="pre">val</span></code> of the node in <code class="docutils literal notranslate"><span class="pre">list2</span></code> is smaller than or equal to the <code class="docutils literal notranslate"><span class="pre">val</span></code> of the node in <code class="docutils literal notranslate"><span class="pre">list1</span></code>, we attach the node from <code class="docutils literal notranslate"><span class="pre">list2</span></code> to the merged list in a similar manner. We move the <code class="docutils literal notranslate"><span class="pre">list2</span></code> pointer to the next node.</p></li>
-<li><p>After attaching a node to the merged list, we move the <code class="docutils literal notranslate"><span class="pre">current</span></code> pointer to the newly added node. This step is essential for keeping track of the end of the merged list.</p></li>
-<li><p>The loop continues until either <code class="docutils literal notranslate"><span class="pre">list1</span></code> or <code class="docutils literal notranslate"><span class="pre">list2</span></code> becomes empty.</p></li>
-<li><p>Once the loop exits, we check if there are any remaining elements in <code class="docutils literal notranslate"><span class="pre">list1</span></code> or <code class="docutils literal notranslate"><span class="pre">list2</span></code>. If <code class="docutils literal notranslate"><span class="pre">list1</span></code> is not empty, we attach the remaining elements of <code class="docutils literal notranslate"><span class="pre">list1</span></code> to the merged list. If <code class="docutils literal notranslate"><span class="pre">list2</span></code> is not empty, we attach the remaining elements of <code class="docutils literal notranslate"><span class="pre">list2</span></code>.</p></li>
-<li><p>Finally, we return the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute of the <code class="docutils literal notranslate"><span class="pre">dummy</span></code> node as the head of the merged list, which represents the sorted merged list.</p></li>
-</ol>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Helper function to print the linked list</span>
-<span class="k">def</span> <span class="nf">printLinkedList</span><span class="p">(</span><span class="n">head</span><span class="p">):</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    <span class="k">while</span> <span class="n">head</span><span class="p">:</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">head</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-        <span class="n">head</span> <span class="o">=</span> <span class="n">head</span><span class="o">.</span><span class="n">next</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s explain the helper functions:
-<strong>printLinkedList Function</strong>:</p>
-<ul class="simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">printLinkedList</span></code> function takes the <code class="docutils literal notranslate"><span class="pre">head</span></code> of a linked list as input and returns a list of values representing the nodes in the linked list.</p></li>
-<li><p>Inside the function, a <code class="docutils literal notranslate"><span class="pre">result</span></code> list is initialized to store the values of the linked list nodes.</p></li>
-<li><p>The function then iterates through the linked list starting from the <code class="docutils literal notranslate"><span class="pre">head</span></code> node and appends the <code class="docutils literal notranslate"><span class="pre">val</span></code> attribute of each node to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p></li>
-<li><p>As it iterates through the list, it moves to the next node using the <code class="docutils literal notranslate"><span class="pre">next</span></code> attribute of each node.</p></li>
-<li><p>Finally, the function returns the <code class="docutils literal notranslate"><span class="pre">result</span></code> list containing the values of the linked list nodes in the order they appear in the linked list.</p></li>
-</ul>
-<p>This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="c1"># Input: list1 = [1,2,4], list2 = [1,3,4]</span>
-<span class="n">list1</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)))</span>
-<span class="n">list2</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)))</span>
-<span class="n">merged_list</span> <span class="o">=</span> <span class="n">mergeTwoLists</span><span class="p">(</span><span class="n">list1</span><span class="p">,</span> <span class="n">list2</span><span class="p">)</span>
-<span class="n">printLinkedList</span><span class="p">(</span><span class="n">merged_list</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 1, 2, 3, 4, 4]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="c1"># Input: list1 = [], list2 = []</span>
-<span class="n">list1</span> <span class="o">=</span> <span class="kc">None</span>
-<span class="n">list2</span> <span class="o">=</span> <span class="kc">None</span>
-<span class="n">merged_list</span> <span class="o">=</span> <span class="n">mergeTwoLists</span><span class="p">(</span><span class="n">list1</span><span class="p">,</span> <span class="n">list2</span><span class="p">)</span>
-<span class="n">printLinkedList</span><span class="p">(</span><span class="n">merged_list</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="c1"># list1 = [], list2 = [0]</span>
-<span class="n">list1</span> <span class="o">=</span> <span class="kc">None</span>
-<span class="n">list2</span> <span class="o">=</span> <span class="n">ListNode</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-<span class="n">merged_list</span> <span class="o">=</span> <span class="n">mergeTwoLists</span><span class="p">(</span><span class="n">list1</span><span class="p">,</span> <span class="n">list2</span><span class="p">)</span>
-<span class="n">printLinkedList</span><span class="p">(</span><span class="n">merged_list</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output text_plain highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[0]
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">mergeTwoLists</span></code> function.</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of this function is <span class="math notranslate nohighlight">\(O(N + M\)</span>), where <span class="math notranslate nohighlight">\(N\)</span> and <span class="math notranslate nohighlight">\(M\)</span> are the lengths of <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code>, respectively. Here’s why:</p>
-<ol class="arabic simple">
-<li><p>In the worst case, we need to traverse both <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code> completely. This involves iterating through all the nodes in both lists once.</p></li>
-<li><p>The while loop runs until either <code class="docutils literal notranslate"><span class="pre">list1</span></code> or <code class="docutils literal notranslate"><span class="pre">list2</span></code> becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.</p></li>
-<li><p>Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.</p></li>
-</ol>
-<p>Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of <span class="math notranslate nohighlight">\(O(N + M)\)</span>.</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of this function is <span class="math notranslate nohighlight">\(O(1)\)</span>, which means it uses a constant amount of extra space regardless of the input sizes. Here’s why:</p>
-<ol class="arabic simple">
-<li><p>We create a few extra pointers (<code class="docutils literal notranslate"><span class="pre">dummy</span></code>, <code class="docutils literal notranslate"><span class="pre">current</span></code>) and temporary variables (<code class="docutils literal notranslate"><span class="pre">val</span></code>) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code>.</p></li>
-<li><p>We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from <code class="docutils literal notranslate"><span class="pre">list1</span></code> and <code class="docutils literal notranslate"><span class="pre">list2</span></code> to form the merged list. This operation does not consume additional memory proportional to the input sizes.</p></li>
-</ol>
-<p><strong>In summary</strong>, the <code class="docutils literal notranslate"><span class="pre">mergeTwoLists</span></code> function has a time complexity of <span class="math notranslate nohighlight">\(O(N + M)\)</span> and a space complexity of <span class="math notranslate nohighlight">\(O(1)\)</span>, making it an efficient solution for merging two sorted linked lists.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Merge K Sorted Lists:</strong> Extend the problem to merge <span class="math notranslate nohighlight">\(K\)</span> sorted linked lists instead of just two. You need to efficiently merge <span class="math notranslate nohighlight">\(K\)</span> lists into one sorted list.</p></li>
-<li><p><strong>Merge Lists in a Zigzag Pattern:</strong> Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5].</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./06. Linked List"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="206.%20Reverse%20Linked%20List.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">206. Reverse Linked List</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="23.%20Merge%20k%20Sorted%20Lists.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">23. Merge k Sorted Lists</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/07. Trees/102. Binary Tree Level Order Traversal.html b/docs/_build/html/07. Trees/102. Binary Tree Level Order Traversal.html
deleted file mode 100644
index cd6a1fe..0000000
--- a/docs/_build/html/07. Trees/102. Binary Tree Level Order Traversal.html	
+++ /dev/null
@@ -1,767 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>102. Binary Tree Level Order Traversal &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/102. Binary Tree Level Order Traversal';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="104. Maximum Depth of Binary Tree" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html" />
-    <link rel="prev" title="100: Same Tree" href="100.%20Same%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/102. Binary Tree Level Order Traversal.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>102. Binary Tree Level Order Traversal</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="binary-tree-level-order-traversal">
-<h1>102. Binary Tree Level Order Traversal<a class="headerlink" href="#binary-tree-level-order-traversal" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/binary-tree-level-order-traversal/">To see the Binary Tree Level Order Traversal problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary tree, return <em>the level order traversal of its nodes’ values</em>. (i.e., from left to right, level by level).</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">2000]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-1000</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">levelOrder</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="c1"># Check if the tree is empty, if so, return an empty list.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">root</span><span class="p">:</span>
-        <span class="k">return</span> <span class="p">[]</span>
-
-    <span class="c1"># Initialize an empty list to store the result.</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-    
-    <span class="c1"># Initialize a queue with the root node to perform BFS.</span>
-    <span class="n">queue</span> <span class="o">=</span> <span class="p">[</span><span class="n">root</span><span class="p">]</span>
-
-    <span class="k">while</span> <span class="n">queue</span><span class="p">:</span>
-        <span class="c1"># Initialize an empty list to store the values of nodes at the current level.</span>
-        <span class="n">level_values</span> <span class="o">=</span> <span class="p">[]</span>
-        
-        <span class="c1"># Get the number of nodes at the current level.</span>
-        <span class="n">level_size</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">queue</span><span class="p">)</span>
-
-        <span class="c1"># Iterate through the nodes at the current level.</span>
-        <span class="k">for</span> <span class="n">_</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">level_size</span><span class="p">):</span>
-            <span class="c1"># Dequeue the front node from the queue.</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-            
-            <span class="c1"># Append the value of the current node to the level_values list.</span>
-            <span class="n">level_values</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-
-            <span class="c1"># Enqueue the left and right children of the current node if they exist.</span>
-            <span class="k">if</span> <span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-            <span class="k">if</span> <span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-
-        <span class="c1"># Append the level_values list (values at the current level) to the result list.</span>
-        <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">level_values</span><span class="p">)</span>
-
-    <span class="c1"># Return the final result, which is a list of lists representing level order traversal.</span>
-    <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We define a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class that represents a node in the binary tree. Each <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> object has a value (<code class="docutils literal notranslate"><span class="pre">val</span></code>) and two child nodes: <code class="docutils literal notranslate"><span class="pre">left</span></code> and <code class="docutils literal notranslate"><span class="pre">right</span></code>.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">levelOrder</span></code> function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.</p></li>
-<li><p>We start by checking if the input <code class="docutils literal notranslate"><span class="pre">root</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.</p></li>
-<li><p>We initialize an empty list called <code class="docutils literal notranslate"><span class="pre">result</span></code> to store the final result, which will be a list of lists containing node values at each level.</p></li>
-<li><p>We initialize a queue called <code class="docutils literal notranslate"><span class="pre">queue</span></code> with the root node. This queue will be used for breadth-first traversal of the tree.</p></li>
-<li><p>We enter a while loop that continues until the <code class="docutils literal notranslate"><span class="pre">queue</span></code> is empty. Inside the loop, we perform the following steps:</p>
-<ul class="simple">
-<li><p>We initialize an empty list called <code class="docutils literal notranslate"><span class="pre">level_values</span></code> to store the values of nodes at the current level.</p></li>
-<li><p>We determine the number of nodes at the current level by getting the length of the <code class="docutils literal notranslate"><span class="pre">queue</span></code>. This is done to process nodes level by level.</p></li>
-<li><p>We iterate through the nodes at the current level using a for loop. For each node in the current level:</p>
-<ul>
-<li><p>We dequeue (remove) the front node from the <code class="docutils literal notranslate"><span class="pre">queue</span></code>.</p></li>
-<li><p>We append the value of the dequeued node to the <code class="docutils literal notranslate"><span class="pre">level_values</span></code> list, effectively collecting the values of nodes at the current level.</p></li>
-<li><p>If the dequeued node has a left child, we enqueue the left child to the <code class="docutils literal notranslate"><span class="pre">queue</span></code>.</p></li>
-<li><p>If the dequeued node has a right child, we enqueue the right child to the <code class="docutils literal notranslate"><span class="pre">queue</span></code>.</p></li>
-</ul>
-</li>
-<li><p>After processing all nodes at the current level, we append the <code class="docutils literal notranslate"><span class="pre">level_values</span></code> list to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list. This represents the values at the current level.</p></li>
-</ul>
-</li>
-<li><p>The loop continues until all levels have been traversed, and the <code class="docutils literal notranslate"><span class="pre">queue</span></code> becomes empty.</p></li>
-<li><p>Finally, we return the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, which contains lists of node values at each level, representing the level order traversal of the binary tree.</p></li>
-</ol>
-<p>The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Construct the tree</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">20</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">15</span><span class="p">)</span>
-<span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span>
-
-<span class="n">result</span> <span class="o">=</span> <span class="n">levelOrder</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[3], [9, 20], [15, 7]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="c1"># Using the same tree as before</span>
-<span class="n">root</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">levelOrder</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[1]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="c1"># Creating a new tree for this example</span>
-<span class="n">root</span> <span class="o">=</span> <span class="kc">None</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">levelOrder</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">levelOrder</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.</p>
-<p>In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here’s how the space complexity breaks down:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">result</span></code> list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by <code class="docutils literal notranslate"><span class="pre">result</span></code> is O(N).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">queue</span></code> data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by <code class="docutils literal notranslate"><span class="pre">queue</span></code> is O(N).</p></li>
-</ol>
-<p>Overall, the dominant factor in terms of space complexity is the <code class="docutils literal notranslate"><span class="pre">queue</span></code>, and the space complexity is O(N).</p>
-<p>In summary, the function’s time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Reverse Level Order Traversal:</strong> Modify the <code class="docutils literal notranslate"><span class="pre">levelOrder</span></code> function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is <code class="docutils literal notranslate"><span class="pre">[3,</span> <span class="pre">9,</span> <span class="pre">20,</span> <span class="pre">null,</span> <span class="pre">null,</span> <span class="pre">15,</span> <span class="pre">7]</span></code>, the output should be <code class="docutils literal notranslate"><span class="pre">[[15,</span> <span class="pre">7],</span> <span class="pre">[9,</span> <span class="pre">20],</span> <span class="pre">[3]]</span></code>.</p></li>
-<li><p><strong>Zigzag Level Order Traversal:</strong> Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is <code class="docutils literal notranslate"><span class="pre">[3,</span> <span class="pre">9,</span> <span class="pre">20,</span> <span class="pre">null,</span> <span class="pre">null,</span> <span class="pre">15,</span> <span class="pre">7]</span></code>, the output should be <code class="docutils literal notranslate"><span class="pre">[[3],</span> <span class="pre">[20,</span> <span class="pre">9],</span> <span class="pre">[15,</span> <span class="pre">7]]</span></code>.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="100.%20Same%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">100: Same Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">104. Maximum Depth of Binary Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/07. Trees/124. Binary Tree Maximum Path Sum.html b/docs/_build/html/07. Trees/124. Binary Tree Maximum Path Sum.html
deleted file mode 100644
index b77d871..0000000
--- a/docs/_build/html/07. Trees/124. Binary Tree Maximum Path Sum.html	
+++ /dev/null
@@ -1,759 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>124. Binary Tree Maximum Path Sum &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/124. Binary Tree Maximum Path Sum';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="199. Binary Tree Right Side View" href="199.%20Binary%20Tree%20Right%20Side%20View.html" />
-    <link rel="prev" title="105. Construct Binary Tree from Preorder and Inorder Traversal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/124. Binary Tree Maximum Path Sum.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>124. Binary Tree Maximum Path Sum</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="binary-tree-maximum-path-sum">
-<h1>124. Binary Tree Maximum Path Sum<a class="headerlink" href="#binary-tree-maximum-path-sum" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/binary-tree-maximum-path-sum/">To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>A <strong>path</strong> in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence <strong>at most once</strong>. Note that the path does not need to pass through the root.</p>
-<p>The <strong>path sum</strong> of a path is the sum of the node’s values in the path.</p>
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary tree, return <em>the maximum <strong>path sum</strong> of any <strong>non-empty</strong> path</em>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([1, 3*10^4]\)</span>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-1000</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.</p>
-<p>In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.</p>
-<p>To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:</p>
-<ol class="arabic simple">
-<li><p>Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.</p></li>
-<li><p>Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.</p></li>
-</ol>
-<p>To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.</p>
-<p>Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.</p>
-<p>The constraints for this problem include:</p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <span class="math notranslate nohighlight">\([1, 3 * 10^4]\)</span>.</p></li>
-<li><p>Node values are in the range [-1000, 1000].</p></li>
-</ul>
-<p>By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">maxPathSum</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">root</span><span class="p">):</span>
-        <span class="k">def</span> <span class="nf">max_path_sum_helper</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-            <span class="k">if</span> <span class="ow">not</span> <span class="n">node</span><span class="p">:</span>
-                <span class="k">return</span> <span class="mi">0</span>
-            
-            <span class="c1"># Recursively calculate the maximum path sum for left and right subtrees</span>
-            <span class="n">left_max</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">max_path_sum_helper</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">))</span>
-            <span class="n">right_max</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">max_path_sum_helper</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">))</span>
-            
-            <span class="c1"># Update the global maximum path sum</span>
-            <span class="bp">self</span><span class="o">.</span><span class="n">max_sum</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">max_sum</span><span class="p">,</span> <span class="n">left_max</span> <span class="o">+</span> <span class="n">right_max</span> <span class="o">+</span> <span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-            
-            <span class="c1"># Return the maximum path sum starting from the current node</span>
-            <span class="k">return</span> <span class="nb">max</span><span class="p">(</span><span class="n">left_max</span><span class="p">,</span> <span class="n">right_max</span><span class="p">)</span> <span class="o">+</span> <span class="n">node</span><span class="o">.</span><span class="n">val</span>
-        
-        <span class="bp">self</span><span class="o">.</span><span class="n">max_sum</span> <span class="o">=</span> <span class="nb">float</span><span class="p">(</span><span class="s1">&#39;-inf&#39;</span><span class="p">)</span>  <span class="c1"># Initialize the global maximum to negative infinity</span>
-        <span class="n">max_path_sum_helper</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>  <span class="c1"># Start the recursive traversal from the root</span>
-        <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">max_sum</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>The code starts by defining a <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> class to represent nodes in the binary tree. Each <code class="docutils literal notranslate"><span class="pre">TreeNode</span></code> has a <code class="docutils literal notranslate"><span class="pre">val</span></code> attribute representing its value, a <code class="docutils literal notranslate"><span class="pre">left</span></code> attribute pointing to the left child, and a <code class="docutils literal notranslate"><span class="pre">right</span></code> attribute pointing to the right child.</p></li>
-<li><p>Next, a <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class is defined to contain the <code class="docutils literal notranslate"><span class="pre">maxPathSum</span></code> method, which will be used to find the maximum path sum in the binary tree.</p></li>
-<li><p>Within the <code class="docutils literal notranslate"><span class="pre">maxPathSum</span></code> method, a helper function called <code class="docutils literal notranslate"><span class="pre">max_path_sum_helper</span></code> is defined. This recursive function takes a single argument, <code class="docutils literal notranslate"><span class="pre">node</span></code>, which is the current node being considered during traversal.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">max_path_sum_helper</span></code> function:</p>
-<ul class="simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">node</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code> (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.</p></li>
-<li><p>It calculates the maximum path sum starting from the left subtree (<code class="docutils literal notranslate"><span class="pre">left_max</span></code>) and the right subtree (<code class="docutils literal notranslate"><span class="pre">right_max</span></code>). Importantly, it uses <code class="docutils literal notranslate"><span class="pre">max(0,</span> <span class="pre">...)</span></code> to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree’s path sum is negative, it’s better to not include it in the path.</p></li>
-<li><p>The code then updates the global maximum path sum (<code class="docutils literal notranslate"><span class="pre">self.max_sum</span></code>) by checking if the sum of <code class="docutils literal notranslate"><span class="pre">left_max</span></code>, <code class="docutils literal notranslate"><span class="pre">right_max</span></code>, and the current node’s value is greater than the current maximum.</p></li>
-<li><p>Finally, it returns the maximum path sum starting from the current node, which is the maximum of <code class="docutils literal notranslate"><span class="pre">left_max</span></code> and <code class="docutils literal notranslate"><span class="pre">right_max</span></code> plus the current node’s value.</p></li>
-</ul>
-</li>
-<li><p>Before calling the <code class="docutils literal notranslate"><span class="pre">max_path_sum_helper</span></code> function, the <code class="docutils literal notranslate"><span class="pre">max_sum</span></code> attribute of the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class is initialized to negative infinity (<code class="docutils literal notranslate"><span class="pre">float('-inf')</span></code>). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of <code class="docutils literal notranslate"><span class="pre">max_sum</span></code>.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">max_path_sum_helper</span></code> function is called with the root of the binary tree, effectively starting the traversal from the root node.</p></li>
-<li><p>Once the traversal is complete, the method returns the value of <code class="docutils literal notranslate"><span class="pre">self.max_sum</span></code>, which contains the maximum path sum found in the binary tree.</p></li>
-<li><p>Example usage at the bottom of the code demonstrates how to create binary trees and use the <code class="docutils literal notranslate"><span class="pre">maxPathSum</span></code> method to find the maximum path sum for two different tree structures.</p></li>
-</ol>
-<p>In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="n">root1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">maxPathSum</span><span class="p">(</span><span class="n">root1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>6
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="o">-</span><span class="mi">10</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">20</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">15</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">maxPathSum</span><span class="p">(</span><span class="n">root2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>42
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the given code:</p>
-<p>Time Complexity:</p>
-<ul class="simple">
-<li><p>The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.</p></li>
-<li><p>During the traversal, for each node, we perform constant time operations, such as updating the <code class="docutils literal notranslate"><span class="pre">max_sum</span></code> variable and calculating the maximum path sum starting from that node.</p></li>
-<li><p>Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.</p></li>
-</ul>
-<p>Space Complexity:</p>
-<ul class="simple">
-<li><p>The space complexity of the code is determined by the space used in the call stack during the recursive traversal.</p></li>
-<li><p>In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).</p></li>
-<li><p>Additionally, the code uses a constant amount of space for variables like <code class="docutils literal notranslate"><span class="pre">left_max</span></code>, <code class="docutils literal notranslate"><span class="pre">right_max</span></code>, and <code class="docutils literal notranslate"><span class="pre">max_sum</span></code>.</p></li>
-<li><p>Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it’s O(N), and in the best case (a balanced binary tree), it’s O(log N).</p></li>
-</ul>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time Complexity: O(N)</p></li>
-<li><p>Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree’s balance.</p></li>
-</ul>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Print the Maximum Path:</strong>
-Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.</p></li>
-<li><p><strong>Path Sum Count:</strong>
-Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">105. Construct Binary Tree from Preorder and Inorder Traversal</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="199.%20Binary%20Tree%20Right%20Side%20View.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">199. Binary Tree Right Side View</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/07. Trees/199. Binary Tree Right Side View.html b/docs/_build/html/07. Trees/199. Binary Tree Right Side View.html
deleted file mode 100644
index 278eeb0..0000000
--- a/docs/_build/html/07. Trees/199. Binary Tree Right Side View.html	
+++ /dev/null
@@ -1,749 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>199. Binary Tree Right Side View &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/199. Binary Tree Right Side View';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="226: Invert Binary Tree" href="226.%20Invert%20Binary%20Tree.html" />
-    <link rel="prev" title="124. Binary Tree Maximum Path Sum" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/199. Binary Tree Right Side View.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/199. Binary Tree Right Side View.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>199. Binary Tree Right Side View</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="binary-tree-right-side-view">
-<h1>199. Binary Tree Right Side View<a class="headerlink" href="#binary-tree-right-side-view" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/binary-tree-right-side-view/">To see the Binary Tree Right Side View problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the <code class="docutils literal notranslate"><span class="pre">root</span></code> of a binary tree, imagine yourself standing on the <strong>right side</strong> of it, return <em>the values of the nodes you can see ordered from top to bottom</em>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">2000]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-100</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-</ul>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to solve this problem:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">rightSideView</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">root</span><span class="p">:</span>
-        <span class="k">return</span> <span class="p">[]</span>  <span class="c1"># If the tree is empty, return an empty list.</span>
-
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>  <span class="c1"># Initialize a list to store the right side view values.</span>
-    <span class="n">queue</span> <span class="o">=</span> <span class="p">[</span><span class="n">root</span><span class="p">]</span>  <span class="c1"># Initialize a queue for level-order traversal with the root node.</span>
-
-    <span class="k">while</span> <span class="n">queue</span><span class="p">:</span>
-        <span class="c1"># Get the number of nodes at the current level.</span>
-        <span class="n">level_size</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">queue</span><span class="p">)</span>
-
-        <span class="c1"># Traverse all nodes at the current level and add the rightmost node to the result.</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">level_size</span><span class="p">):</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>  <span class="c1"># Dequeue the first node from the queue.</span>
-
-            <span class="c1"># If it&#39;s the rightmost node at this level, add its value to the result.</span>
-            <span class="k">if</span> <span class="n">i</span> <span class="o">==</span> <span class="n">level_size</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
-                <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">val</span><span class="p">)</span>
-
-            <span class="c1"># Add the children of the current node to the queue.</span>
-            <span class="k">if</span> <span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-            <span class="k">if</span> <span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-
-    <span class="k">return</span> <span class="n">result</span>  <span class="c1"># Return the list of right side view values.</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic">
-<li><p>We start with a binary tree represented using a TreeNode class. Each node has a value (<code class="docutils literal notranslate"><span class="pre">val</span></code>) and can have a left child (<code class="docutils literal notranslate"><span class="pre">left</span></code>) and a right child (<code class="docutils literal notranslate"><span class="pre">right</span></code>).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">rightSideView</span></code> function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.</p></li>
-<li><p>We check if the <code class="docutils literal notranslate"><span class="pre">root</span></code> is <code class="docutils literal notranslate"><span class="pre">None</span></code>, which means the tree is empty. If it’s empty, we return an empty list because there are no nodes to see.</p></li>
-<li><p>We initialize an empty list called <code class="docutils literal notranslate"><span class="pre">result</span></code> to store the right side view values.</p></li>
-<li><p>We initialize a queue called <code class="docutils literal notranslate"><span class="pre">queue</span></code> with the root node. This queue is used for a level-order traversal of the tree.</p></li>
-<li><p>We enter a while loop that continues until the <code class="docutils literal notranslate"><span class="pre">queue</span></code> is empty. Inside this loop, we perform the following steps for each level of the tree:</p>
-<p>a. We determine the number of nodes at the current level by getting the length of the <code class="docutils literal notranslate"><span class="pre">queue</span></code>. This is important for processing nodes at the same level together.</p>
-<p>b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the <code class="docutils literal notranslate"><span class="pre">queue</span></code> using <code class="docutils literal notranslate"><span class="pre">queue.pop(0)</span></code>.</p>
-<p>c. If the node we dequeue is the rightmost node at the current level (determined by <code class="docutils literal notranslate"><span class="pre">i</span> <span class="pre">==</span> <span class="pre">level_size</span> <span class="pre">-</span> <span class="pre">1</span></code>), we add its <code class="docutils literal notranslate"><span class="pre">val</span></code> to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.</p>
-<p>d. We enqueue the left and right children of the current node (if they exist) to the <code class="docutils literal notranslate"><span class="pre">queue</span></code>. This ensures that we process the next level in the subsequent iterations of the while loop.</p>
-</li>
-<li><p>After processing all levels of the tree, the <code class="docutils literal notranslate"><span class="pre">result</span></code> list contains the values of the rightmost nodes in each level, ordered from top to bottom.</p></li>
-<li><p>Finally, we return the <code class="docutils literal notranslate"><span class="pre">result</span></code> list as the output of the function, which represents the right side view of the binary tree.</p></li>
-</ol>
-<p>The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Construct the tree</span>
-<span class="n">root1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">5</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">rightSideView</span><span class="p">(</span><span class="n">root1</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 3, 4]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">rightSideView</span><span class="p">(</span><span class="n">root2</span><span class="p">))</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[1, 3]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3:</span>
-<span class="c1"># Creating a new tree for this example</span>
-<span class="n">root</span> <span class="o">=</span> <span class="kc">None</span>
-<span class="n">result</span> <span class="o">=</span> <span class="n">rightSideView</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the given code:</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here’s why:</p>
-<ol class="arabic simple">
-<li><p>We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.</p></li>
-<li><p>For each node, we perform constant-time operations like dequeuing it from the queue, checking if it’s the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.</p></li>
-</ol>
-<p>Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of the code is also O(N). Here’s why:</p>
-<ol class="arabic simple">
-<li><p>We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">result</span></code> list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the <code class="docutils literal notranslate"><span class="pre">result</span></code> list is also O(N).</p></li>
-<li><p>Other auxiliary variables like <code class="docutils literal notranslate"><span class="pre">level_size</span></code>, <code class="docutils literal notranslate"><span class="pre">i</span></code>, and <code class="docutils literal notranslate"><span class="pre">node</span></code> require only constant space and do not depend on the size of the tree.</p></li>
-</ol>
-<p>Combining the space used by the queue and the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, we get a space complexity of O(N).</p>
-<p>In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Variant with Left Side View</strong>: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.</p></li>
-<li><p><strong>Zigzag Right Side View</strong>: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">124. Binary Tree Maximum Path Sum</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="226.%20Invert%20Binary%20Tree.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">226: Invert Binary Tree</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/07. Trees/226. Invert Binary Tree.html b/docs/_build/html/07. Trees/226. Invert Binary Tree.html
deleted file mode 100644
index 8eda822..0000000
--- a/docs/_build/html/07. Trees/226. Invert Binary Tree.html	
+++ /dev/null
@@ -1,719 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>226: Invert Binary Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '07. Trees/226. Invert Binary Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="230. Kth Smallest Element in a BST" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html" />
-    <link rel="prev" title="199. Binary Tree Right Side View" href="199.%20Binary%20Tree%20Right%20Side%20View.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trees Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F07. Trees/226. Invert Binary Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/07. Trees/226. Invert Binary Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>226: Invert Binary Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="invert-binary-tree">
-<h1>226: Invert Binary Tree<a class="headerlink" href="#invert-binary-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/invert-binary-tree/">To see the Invert Binary Tree problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given the root of a binary tree, invert the tree, and return its root.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>The number of nodes in the tree is in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">-100</span> <span class="pre">&lt;=</span> <span class="pre">Node.val</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-</ul>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Definition for a binary tree node.</span>
-<span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">left</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">right</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">val</span> <span class="o">=</span> <span class="n">val</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">left</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">right</span>
-
-<span class="k">def</span> <span class="nf">invertTree</span><span class="p">(</span><span class="n">root</span><span class="p">):</span>
-    <span class="c1"># Base case: If the root is None or the tree is empty, return None.</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">root</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">None</span>
-
-    <span class="c1"># Swap the left and right subtrees of the current node.</span>
-    <span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="p">,</span> <span class="n">root</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="p">,</span> <span class="n">root</span><span class="o">.</span><span class="n">left</span>
-
-    <span class="c1"># Recursively invert the left and right subtrees.</span>
-    <span class="n">invertTree</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">left</span><span class="p">)</span>
-    <span class="n">invertTree</span><span class="p">(</span><span class="n">root</span><span class="o">.</span><span class="n">right</span><span class="p">)</span>
-
-    <span class="k">return</span> <span class="n">root</span>
-</pre></div>
-</div>
-</div>
-</div>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (<code class="docutils literal notranslate"><span class="pre">val</span></code>), a left child (<code class="docutils literal notranslate"><span class="pre">left</span></code>), and a right child (<code class="docutils literal notranslate"><span class="pre">right</span></code>).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">invertTree</span></code> function is defined to invert the binary tree. It takes the root node of the tree as an argument.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">invertTree</span></code> function, we have a base case to handle the scenario when the root is <code class="docutils literal notranslate"><span class="pre">None</span></code> (empty tree). In such cases, we return <code class="docutils literal notranslate"><span class="pre">None</span></code> because there’s nothing to invert.</p></li>
-<li><p>For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.</p></li>
-<li><p>We then recursively call <code class="docutils literal notranslate"><span class="pre">invertTree</span></code> on the left and right subtrees to invert them.</p></li>
-<li><p>Finally, we return the root of the inverted tree.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 1</span>
-<span class="c1"># Input: root = [4,2,7,1,3,6,9]</span>
-
-<span class="n">root1</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">7</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">left</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">6</span><span class="p">)</span>
-<span class="n">root1</span><span class="o">.</span><span class="n">right</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">9</span><span class="p">)</span>
-
-<span class="n">inverted_root1</span> <span class="o">=</span> <span class="n">invertTree</span><span class="p">(</span><span class="n">root1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Inverted Tree (Example 1):&quot;</span><span class="p">,</span> <span class="n">inverted_root1</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 1): &lt;__main__.TreeNode object at 0x7faa5c445ab0&gt;
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 2</span>
-<span class="c1"># Input: root = [2,1,3]</span>
-
-<span class="n">root2</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">left</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">root2</span><span class="o">.</span><span class="n">right</span> <span class="o">=</span> <span class="n">TreeNode</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-
-<span class="n">inverted_root2</span> <span class="o">=</span> <span class="n">invertTree</span><span class="p">(</span><span class="n">root2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Inverted Tree (Example 2):&quot;</span><span class="p">,</span> <span class="n">inverted_root2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 2): &lt;__main__.TreeNode object at 0x7faa5c444310&gt;
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1">### Example 3</span>
-<span class="c1"># Input: root = []</span>
-
-<span class="n">root3</span> <span class="o">=</span> <span class="kc">None</span>  <span class="c1"># Empty tree</span>
-
-<span class="n">inverted_root3</span> <span class="o">=</span> <span class="n">invertTree</span><span class="p">(</span><span class="n">root3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Inverted Tree (Example 3):&quot;</span><span class="p">,</span> <span class="n">inverted_root3</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Inverted Tree (Example 3): None
-</pre></div>
-</div>
-</div>
-</div>
-<p>Let’s discuss the time and space complexity of the provided Python code to invert a binary tree.</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The time complexity of the <code class="docutils literal notranslate"><span class="pre">invertTree</span></code> function is <span class="math notranslate nohighlight">\(O(n)\)</span>, where <span class="math notranslate nohighlight">\(n\)</span> is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.</p>
-<p>The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.</p>
-<p><strong>Space Complexity:</strong></p>
-<p>The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is <span class="math notranslate nohighlight">\(O(h)\)</span>, where <span class="math notranslate nohighlight">\(h\)</span> is the height of the binary tree.</p>
-<p>In a completely unbalanced binary tree (essentially a linked list), the height <span class="math notranslate nohighlight">\(h\)</span> is equal to the number of nodes <span class="math notranslate nohighlight">\(n\)</span>, resulting in a space complexity of <span class="math notranslate nohighlight">\(O(n)\)</span>. This occurs when the tree is skewed to one side.</p>
-<p>In a balanced binary tree, such as a full binary tree, the height <span class="math notranslate nohighlight">\(h\)</span> is <span class="math notranslate nohighlight">\(O(log\ n)\)</span>, and the space complexity is <span class="math notranslate nohighlight">\(O(log\ n)\)</span>.</p>
-<p>The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to <span class="math notranslate nohighlight">\(O(log\ n)\)</span>.</p>
-<p><strong>In summary:</strong></p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span> where <span class="math notranslate nohighlight">\(n\)</span> is the number of nodes.</p></li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(h)\)</span>, where <span class="math notranslate nohighlight">\(h\)</span> is the height of the binary tree. In the worst case, it can be <span class="math notranslate nohighlight">\(O(n)\)</span>, and in a balanced tree, it is <span class="math notranslate nohighlight">\(O(log\ n)\)</span>.</p></li>
-</ul>
-<p>Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with <span class="math notranslate nohighlight">\(O(1)\)</span> space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./07. Trees"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="199.%20Binary%20Tree%20Right%20Side%20View.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">199. Binary Tree Right Side View</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="230.%20Kth%20Smallest%20Element%20in%20a%20BST.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">230. Kth Smallest Element in a BST</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/08. Tries/212. Word Search II.html b/docs/_build/html/08. Tries/212. Word Search II.html
deleted file mode 100644
index c29a4c9..0000000
--- a/docs/_build/html/08. Tries/212. Word Search II.html	
+++ /dev/null
@@ -1,836 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>212. Word Search II &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '08. Tries/212. Word Search II';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Heap / Priority Queue Problems - Blind 75 LeetCode" href="../09.%20Heap%20-%20Priority%20Queue/README.html" />
-    <link rel="prev" title="211. Design Add and Search Words Data Structure" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Trie Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F08. Tries/212. Word Search II.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/08. Tries/212. Word Search II.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>212. Word Search II</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="word-search-ii">
-<h1>212. Word Search II<a class="headerlink" href="#word-search-ii" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/word-search-ii/">To see the Word Search II problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> <code class="docutils literal notranslate"><span class="pre">board</span></code> of characters and a list of strings <code class="docutils literal notranslate"><span class="pre">words</span></code>, the task is to return <em>all words on the board</em>.</p>
-<p>Each word must be constructed from letters of sequentially <strong>adjacent cells</strong>, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">==</span> <span class="pre">board.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">board[i].length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">m,</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">12</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">board[i][j]</span></code> is a lowercase English letter.</p></li>
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">words.length</span></code> &lt;= <span class="math notranslate nohighlight">\(3 * 10^4\)</span></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">words[i].length</span> <span class="pre">&lt;=</span> <span class="pre">10</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">words[i]</span></code> consists of lowercase English letters.</p></li>
-<li><p>All the strings of <code class="docutils literal notranslate"><span class="pre">words</span></code> are unique.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>To solve the “Word Search II” problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here’s a step-by-step approach to solve the problem:</p>
-<ol class="arabic simple">
-<li><p>Build a Trie from the given list of words:</p>
-<ul class="simple">
-<li><p>Create a Trie data structure to store all the words from the input list.</p></li>
-<li><p>For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.</p></li>
-</ul>
-</li>
-<li><p>Perform DFS on the board:</p>
-<ul class="simple">
-<li><p>Iterate through each cell (i, j) on the board.</p></li>
-<li><p>For each cell, start a DFS traversal from that cell to search for words.</p></li>
-<li><p>During the DFS traversal, maintain a current path string.</p></li>
-<li><p>At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.</p></li>
-<li><p>If the current path string matches a word in the Trie, add it to the result.</p></li>
-</ul>
-</li>
-<li><p>Implement DFS with backtracking:</p>
-<ul class="simple">
-<li><p>During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven’t been visited before.</p></li>
-<li><p>To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like ‘#’) before exploring it and restore its original character after the DFS traversal.</p></li>
-</ul>
-</li>
-<li><p>Return the result:</p>
-<ul class="simple">
-<li><p>After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.</p></li>
-<li><p>Convert the result set to a list and return it as the final output.</p></li>
-</ul>
-</li>
-</ol>
-<p>This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Define a TrieNode class to represent nodes in the Trie.</span>
-<span class="k">class</span> <span class="nc">TrieNode</span><span class="p">:</span>
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">children</span> <span class="o">=</span> <span class="p">{}</span>  <span class="c1"># Dictionary to store child nodes.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">False</span>  <span class="c1"># Flag to mark the end of a word.</span>
-
-<span class="c1"># Main function to find words on the board.</span>
-<span class="k">def</span> <span class="nf">findWords</span><span class="p">(</span><span class="n">board</span><span class="p">,</span> <span class="n">words</span><span class="p">):</span>
-    <span class="c1"># DFS function to search for words starting from a given cell.</span>
-    <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">path</span><span class="p">):</span>
-        <span class="n">char</span> <span class="o">=</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span>  <span class="c1"># Get the character at the current cell.</span>
-        <span class="n">curr_node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">char</span><span class="p">)</span>  <span class="c1"># Find the corresponding Trie node.</span>
-
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">curr_node</span><span class="p">:</span>
-            <span class="k">return</span>  <span class="c1"># If no matching Trie node, stop the search.</span>
-
-        <span class="n">path</span> <span class="o">+=</span> <span class="n">char</span>  <span class="c1"># Add the character to the current path.</span>
-
-        <span class="k">if</span> <span class="n">curr_node</span><span class="o">.</span><span class="n">is_end_of_word</span><span class="p">:</span>
-            <span class="n">result</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">path</span><span class="p">)</span>  <span class="c1"># If the path matches a word, add it to the result.</span>
-
-        <span class="n">temp</span><span class="p">,</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">=</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">],</span> <span class="s2">&quot;#&quot;</span>  <span class="c1"># Mark the cell as visited.</span>
-
-        <span class="c1"># Explore neighboring cells (up, down, left, right).</span>
-        <span class="k">if</span> <span class="n">i</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">curr_node</span><span class="p">,</span> <span class="n">i</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">path</span><span class="p">)</span>
-        <span class="k">if</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">m</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">curr_node</span><span class="p">,</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">path</span><span class="p">)</span>
-        <span class="k">if</span> <span class="n">j</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">curr_node</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">path</span><span class="p">)</span>
-        <span class="k">if</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">curr_node</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="n">path</span><span class="p">)</span>
-
-        <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">=</span> <span class="n">temp</span>  <span class="c1"># Restore the cell&#39;s original character.</span>
-
-    <span class="c1"># Function to build a Trie from the list of words.</span>
-    <span class="k">def</span> <span class="nf">buildTrie</span><span class="p">():</span>
-        <span class="n">root</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>  <span class="c1"># Create a root node.</span>
-        <span class="k">for</span> <span class="n">word</span> <span class="ow">in</span> <span class="n">words</span><span class="p">:</span>
-            <span class="n">node</span> <span class="o">=</span> <span class="n">root</span>
-            <span class="k">for</span> <span class="n">char</span> <span class="ow">in</span> <span class="n">word</span><span class="p">:</span>
-                <span class="k">if</span> <span class="n">char</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">:</span>
-                    <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span> <span class="o">=</span> <span class="n">TrieNode</span><span class="p">()</span>  <span class="c1"># Create a new node if needed.</span>
-                <span class="n">node</span> <span class="o">=</span> <span class="n">node</span><span class="o">.</span><span class="n">children</span><span class="p">[</span><span class="n">char</span><span class="p">]</span>
-            <span class="n">node</span><span class="o">.</span><span class="n">is_end_of_word</span> <span class="o">=</span> <span class="kc">True</span>  <span class="c1"># Mark the end of the word.</span>
-        <span class="k">return</span> <span class="n">root</span>
-
-    <span class="n">m</span><span class="p">,</span> <span class="n">n</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">),</span> <span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>  <span class="c1"># Get the dimensions of the board.</span>
-    <span class="n">root</span> <span class="o">=</span> <span class="n">buildTrie</span><span class="p">()</span>  <span class="c1"># Build the Trie from the list of words.</span>
-    <span class="n">result</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>  <span class="c1"># Use a set to store unique words found on the board.</span>
-
-    <span class="c1"># Iterate through each cell on the board and start DFS from there.</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">):</span>
-        <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="s2">&quot;&quot;</span><span class="p">)</span>  <span class="c1"># Start DFS from each cell on the board.</span>
-
-    <span class="k">return</span> <span class="nb">list</span><span class="p">(</span><span class="n">result</span><span class="p">)</span>  <span class="c1"># Convert the set to a list and return the result.</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code solves the “Word Search II” problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.</p>
-<p>The code does the following:</p>
-<ol class="arabic simple">
-<li><p>Defines a <code class="docutils literal notranslate"><span class="pre">TrieNode</span></code> class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.</p></li>
-<li><p>Defines the <code class="docutils literal notranslate"><span class="pre">findWords</span></code> function, which takes the grid (<code class="docutils literal notranslate"><span class="pre">board</span></code>) and a list of words (<code class="docutils literal notranslate"><span class="pre">words</span></code>) as input.</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">findWords</span></code> function, there is a <code class="docutils literal notranslate"><span class="pre">dfs</span></code> (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.</p></li>
-<li><p>The code also includes a <code class="docutils literal notranslate"><span class="pre">buildTrie</span></code> function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.</p></li>
-<li><p>The dimensions of the grid are obtained (m x n).</p></li>
-<li><p>A Trie is built using the <code class="docutils literal notranslate"><span class="pre">buildTrie</span></code> function.</p></li>
-<li><p>A set called <code class="docutils literal notranslate"><span class="pre">result</span></code> is used to store unique words found in the grid.</p></li>
-<li><p>The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.</p></li>
-<li><p>During the DFS, it explores neighboring cells (up, down, left, right) if they haven’t been visited before and if the current path matches a prefix in the Trie.</p></li>
-<li><p>When a word is found during the DFS traversal, it is added to the <code class="docutils literal notranslate"><span class="pre">result</span></code> set.</p></li>
-<li><p>The grid cell is marked as visited during the DFS by changing its character to “#”, and it is restored to its original character after the DFS traversal.</p></li>
-<li><p>Finally, the set of unique words found is converted to a list and returned as the output.</p></li>
-</ol>
-<p>The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="n">board1</span> <span class="o">=</span> <span class="p">[[</span><span class="s2">&quot;o&quot;</span><span class="p">,</span><span class="s2">&quot;a&quot;</span><span class="p">,</span><span class="s2">&quot;a&quot;</span><span class="p">,</span><span class="s2">&quot;n&quot;</span><span class="p">],[</span><span class="s2">&quot;e&quot;</span><span class="p">,</span><span class="s2">&quot;t&quot;</span><span class="p">,</span><span class="s2">&quot;a&quot;</span><span class="p">,</span><span class="s2">&quot;e&quot;</span><span class="p">],[</span><span class="s2">&quot;i&quot;</span><span class="p">,</span><span class="s2">&quot;h&quot;</span><span class="p">,</span><span class="s2">&quot;k&quot;</span><span class="p">,</span><span class="s2">&quot;r&quot;</span><span class="p">],[</span><span class="s2">&quot;i&quot;</span><span class="p">,</span><span class="s2">&quot;f&quot;</span><span class="p">,</span><span class="s2">&quot;l&quot;</span><span class="p">,</span><span class="s2">&quot;v&quot;</span><span class="p">]]</span>
-<span class="n">words1</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;oath&quot;</span><span class="p">,</span><span class="s2">&quot;pea&quot;</span><span class="p">,</span><span class="s2">&quot;eat&quot;</span><span class="p">,</span><span class="s2">&quot;rain&quot;</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">findWords</span><span class="p">(</span><span class="n">board1</span><span class="p">,</span> <span class="n">words1</span><span class="p">))</span>  <span class="c1"># Output: [&quot;eat&quot;, &quot;oath&quot;]</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[&#39;eat&#39;, &#39;oath&#39;]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-
-<span class="n">board2</span> <span class="o">=</span> <span class="p">[[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span><span class="s2">&quot;b&quot;</span><span class="p">],[</span><span class="s2">&quot;c&quot;</span><span class="p">,</span><span class="s2">&quot;d&quot;</span><span class="p">]]</span>
-<span class="n">words2</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;abcb&quot;</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">findWords</span><span class="p">(</span><span class="n">board2</span><span class="p">,</span> <span class="n">words2</span><span class="p">))</span>  <span class="c1"># Output: []</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p><strong>Building the Trie (<code class="docutils literal notranslate"><span class="pre">buildTrie</span></code> function):</strong></p>
-<ul class="simple">
-<li><p>Suppose there are <code class="docutils literal notranslate"><span class="pre">N</span></code> words in the input list, and the average length of a word is <code class="docutils literal notranslate"><span class="pre">L</span></code>.</p></li>
-<li><p>Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.</p></li>
-</ul>
-</li>
-<li><p><strong>DFS Traversal (<code class="docutils literal notranslate"><span class="pre">dfs</span></code> function):</strong></p>
-<ul class="simple">
-<li><p>In the worst case, the DFS function explores all possible paths in the grid.</p></li>
-<li><p>The maximum number of recursive calls for each cell is 4 (up, down, left, right).</p></li>
-<li><p>The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most <code class="docutils literal notranslate"><span class="pre">L</span></code>.</p></li>
-<li><p>Therefore, the DFS traversal for each cell takes <span class="math notranslate nohighlight">\(O(4^L)\)</span> time.</p></li>
-</ul>
-</li>
-<li><p><strong>Iterating Through the Grid (<code class="docutils literal notranslate"><span class="pre">findWords</span></code> function):</strong></p>
-<ul class="simple">
-<li><p>In the worst case, we iterate through all <code class="docutils literal notranslate"><span class="pre">m</span></code> rows and <code class="docutils literal notranslate"><span class="pre">n</span></code> columns in the grid.</p></li>
-<li><p>For each cell, we start a DFS traversal.</p></li>
-<li><p>Therefore, iterating through the entire grid takes <span class="math notranslate nohighlight">\(O(m * n * 4^L)\)</span> time.</p></li>
-</ul>
-</li>
-</ol>
-<p>Overall, the time complexity of the code is <span class="math notranslate nohighlight">\(O(N * L + m * n * 4^L)\)</span>.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p><strong>Trie Data Structure:</strong></p>
-<ul class="simple">
-<li><p>The space required to store the Trie depends on the number of unique characters in all the words.</p></li>
-<li><p>In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).</p></li>
-<li><p>In practice, it may be less if there are common prefixes among words.</p></li>
-</ul>
-</li>
-<li><p><strong>DFS Stack (Recursive Calls):</strong></p>
-<ul class="simple">
-<li><p>The depth of the recursive call stack during DFS is at most <code class="docutils literal notranslate"><span class="pre">L</span></code>, where <code class="docutils literal notranslate"><span class="pre">L</span></code> is the length of the longest word in the Trie.</p></li>
-<li><p>Therefore, the space complexity for the recursive call stack is O(L).</p></li>
-</ul>
-</li>
-<li><p><strong>Result Set (<code class="docutils literal notranslate"><span class="pre">result</span></code> set):</strong></p>
-<ul class="simple">
-<li><p>The space used to store the result set depends on the number of valid words found in the grid.</p></li>
-<li><p>In the worst case, when all words are found, the space complexity of the result set is O(N * L).</p></li>
-</ul>
-</li>
-</ol>
-<p>Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.</p>
-<p>In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Word Search Paths:</strong>
-Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.</p></li>
-<li><p><strong>Reverse Word Search:</strong>
-Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.).</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./08. Tries"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">211. Design Add and Search Words Data Structure</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../09.%20Heap%20-%20Priority%20Queue/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Heap / Priority Queue Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html b/docs/_build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html
deleted file mode 100644
index ae83555..0000000
--- a/docs/_build/html/09. Heap - Priority Queue/1046. Last Stone Weight.html	
+++ /dev/null
@@ -1,763 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>1046. Last Stone Weight &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/1046. Last Stone Weight';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="295. Find Median from Data Stream" href="295.%20Find%20Median%20from%20Data%20Stream.html" />
-    <link rel="prev" title="Heap / Priority Queue Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F09. Heap - Priority Queue/1046. Last Stone Weight.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>1046. Last Stone Weight</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="last-stone-weight">
-<h1>1046. Last Stone Weight<a class="headerlink" href="#last-stone-weight" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/last-stone-weight/">To see the Last Stone Weight problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are given an array of integers <code class="docutils literal notranslate"><span class="pre">stones</span></code> where <code class="docutils literal notranslate"><span class="pre">stones[i]</span></code> is the weight of the <code class="docutils literal notranslate"><span class="pre">i</span></code>th stone.</p>
-<p>We are playing a game with the stones. On each turn, you choose the <strong>heaviest two stones</strong> and smash them together. Suppose the heaviest two stones have weights <code class="docutils literal notranslate"><span class="pre">x</span></code> and <code class="docutils literal notranslate"><span class="pre">y</span></code> with <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">&lt;=</span> <span class="pre">y</span></code>. The result of this smash is:</p>
-<ol class="arabic simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">==</span> <span class="pre">y</span></code>, both stones are destroyed.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">!=</span> <span class="pre">y</span></code>, the stone of weight <code class="docutils literal notranslate"><span class="pre">x</span></code> is destroyed, and the stone of weight <code class="docutils literal notranslate"><span class="pre">y</span></code> has new weight <code class="docutils literal notranslate"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span></code>.</p></li>
-</ol>
-<p>At the end of the game, there is <strong>at most one</strong> stone left.</p>
-<p>Return <em>the weight of the last remaining stone</em>. If there are no stones left, return <code class="docutils literal notranslate"><span class="pre">0</span></code>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">stones.length</span> <span class="pre">&lt;=</span> <span class="pre">30</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">stones[i]</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The “Last Stone Weight” problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.</p>
-<p>Here’s how the game works:</p>
-<ol class="arabic simple">
-<li><p>You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.</p></li>
-<li><p>In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you’ve found the answer.</p></li>
-<li><p>If there are two stones with weights <code class="docutils literal notranslate"><span class="pre">x</span></code> and <code class="docutils literal notranslate"><span class="pre">y</span></code>, where <code class="docutils literal notranslate"><span class="pre">x</span></code> is less than or equal to <code class="docutils literal notranslate"><span class="pre">y</span></code>, the following happens:</p>
-<ul class="simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">x</span></code> is equal to <code class="docutils literal notranslate"><span class="pre">y</span></code>, both stones are completely destroyed, and they are removed from the array of stones.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">x</span></code> is not equal to <code class="docutils literal notranslate"><span class="pre">y</span></code>, the stone with weight <code class="docutils literal notranslate"><span class="pre">x</span></code> is destroyed, and the stone with weight <code class="docutils literal notranslate"><span class="pre">y</span></code> now has a new weight of <code class="docutils literal notranslate"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span></code>. The stone with weight <code class="docutils literal notranslate"><span class="pre">x</span></code> is removed from the array, and the modified stone with weight <code class="docutils literal notranslate"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span></code> remains in the array.</p></li>
-</ul>
-</li>
-<li><p>The game continues with the modified array of stones until there is at most one stone left.</p></li>
-<li><p>The goal is to find the weight of the last remaining stone, or if there are no stones left, return <code class="docutils literal notranslate"><span class="pre">0</span></code>.</p></li>
-</ol>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">import</span> <span class="nn">heapq</span>
-
-<span class="k">def</span> <span class="nf">lastStoneWeight</span><span class="p">(</span><span class="n">stones</span><span class="p">):</span>
-    <span class="c1"># Convert the input list to a max heap (negate the values to simulate a max heap)</span>
-    <span class="n">max_heap</span> <span class="o">=</span> <span class="p">[</span><span class="o">-</span><span class="n">stone</span> <span class="k">for</span> <span class="n">stone</span> <span class="ow">in</span> <span class="n">stones</span><span class="p">]</span>
-    <span class="n">heapq</span><span class="o">.</span><span class="n">heapify</span><span class="p">(</span><span class="n">max_heap</span><span class="p">)</span>
-
-    <span class="c1"># Continue as long as there are more than 1 stone in the heap</span>
-    <span class="k">while</span> <span class="nb">len</span><span class="p">(</span><span class="n">max_heap</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
-        <span class="c1"># Get the two heaviest stones</span>
-        <span class="n">y</span> <span class="o">=</span> <span class="o">-</span><span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="n">max_heap</span><span class="p">)</span>  <span class="c1"># Get the heaviest stone and negate it back to positive</span>
-        <span class="n">x</span> <span class="o">=</span> <span class="o">-</span><span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="n">max_heap</span><span class="p">)</span>  <span class="c1"># Get the second heaviest stone and negate it back to positive</span>
-
-        <span class="c1"># Calculate the new stone&#39;s weight after smashing</span>
-        <span class="k">if</span> <span class="n">x</span> <span class="o">!=</span> <span class="n">y</span><span class="p">:</span>
-            <span class="n">new_stone</span> <span class="o">=</span> <span class="n">y</span> <span class="o">-</span> <span class="n">x</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="n">max_heap</span><span class="p">,</span> <span class="o">-</span><span class="n">new_stone</span><span class="p">)</span>  <span class="c1"># Negate the value and push it back to the heap</span>
-
-    <span class="c1"># If there is one stone left, return its weight (negate it back to positive)</span>
-    <span class="k">if</span> <span class="n">max_heap</span><span class="p">:</span>
-        <span class="k">return</span> <span class="o">-</span><span class="n">max_heap</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-    <span class="k">else</span><span class="p">:</span>
-        <span class="k">return</span> <span class="mi">0</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code defines a Python function called <code class="docutils literal notranslate"><span class="pre">lastStoneWeight</span></code> that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.</p>
-<p>Here’s a step-by-step explanation of the code:</p>
-<ol class="arabic simple">
-<li><p>We import the <code class="docutils literal notranslate"><span class="pre">heapq</span></code> library, which allows us to create and manipulate a heap (priority queue).</p></li>
-<li><p>Inside the <code class="docutils literal notranslate"><span class="pre">lastStoneWeight</span></code> function:</p>
-<ul class="simple">
-<li><p>We create a max heap (negating stone weights to simulate a max heap) using the <code class="docutils literal notranslate"><span class="pre">heapq.heapify</span></code> function. This heap will keep track of the heaviest stones.</p></li>
-<li><p>We enter a loop that continues as long as there are more than 1 stone in the heap.</p></li>
-<li><p>Inside the loop, we:</p>
-<ul>
-<li><p>Retrieve and negate the heaviest stone (<code class="docutils literal notranslate"><span class="pre">y</span></code>) from the heap.</p></li>
-<li><p>Retrieve and negate the second heaviest stone (<code class="docutils literal notranslate"><span class="pre">x</span></code>) from the heap.</p></li>
-<li><p>Calculate the new stone’s weight after smashing (<code class="docutils literal notranslate"><span class="pre">y</span> <span class="pre">-</span> <span class="pre">x</span></code>), and negate it back to simulate a max heap.</p></li>
-<li><p>Add the new stone back to the heap using <code class="docutils literal notranslate"><span class="pre">heapq.heappush</span></code>.</p></li>
-</ul>
-</li>
-</ul>
-</li>
-<li><p>After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.</p></li>
-<li><p>If there are no stones left (the heap is empty), we return <code class="docutils literal notranslate"><span class="pre">0</span></code>, indicating that no stones remain.</p></li>
-<li><p>Finally, we provide two test cases to demonstrate the function’s usage and correctness.</p></li>
-</ol>
-<p>In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="n">stones1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">lastStoneWeight</span><span class="p">(</span><span class="n">stones1</span><span class="p">))</span>  <span class="c1"># Output: 1</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2: </span>
-
-<span class="n">stones2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">lastStoneWeight</span><span class="p">(</span><span class="n">stones2</span><span class="p">))</span>  <span class="c1"># Output: 1</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided Python code for the “Last Stone Weight” problem:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">heapq.heapify</span></code> operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.</p></li>
-<li><p>The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:</p>
-<ul class="simple">
-<li><p>Retrieving and negating the heaviest stone (<code class="docutils literal notranslate"><span class="pre">y</span></code>) from the heap, which takes O(log n) time.</p></li>
-<li><p>Retrieving and negating the second heaviest stone (<code class="docutils literal notranslate"><span class="pre">x</span></code>) from the heap, also taking O(log n) time.</p></li>
-<li><p>Calculating the new stone’s weight and pushing it back into the heap using <code class="docutils literal notranslate"><span class="pre">heapq.heappush</span></code>, which takes O(log n) time.</p></li>
-</ul>
-</li>
-<li><p>In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.</p></li>
-</ol>
-<p>Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).</p></li>
-<li><p>The rest of the variables used in the function (e.g., <code class="docutils literal notranslate"><span class="pre">x</span></code>, <code class="docutils literal notranslate"><span class="pre">y</span></code>, <code class="docutils literal notranslate"><span class="pre">new_stone</span></code>) require only constant space, so they do not significantly contribute to the space complexity.</p></li>
-</ol>
-<p>Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.</p>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time Complexity: <span class="math notranslate nohighlight">\(O(n\ log\ n)\)</span></p></li>
-<li><p>Space Complexity: <span class="math notranslate nohighlight">\(O(n)\)</span></p></li>
-</ul>
-<p>The algorithm is efficient enough to handle the problem’s constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Kth Last Stone Weight</strong>: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.</p></li>
-<li><p><strong>Multiple Stones Smash</strong>: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./09. Heap - Priority Queue"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Heap / Priority Queue Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="295.%20Find%20Median%20from%20Data%20Stream.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">295. Find Median from Data Stream</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html b/docs/_build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html
deleted file mode 100644
index c8fe5a3..0000000
--- a/docs/_build/html/09. Heap - Priority Queue/295. Find Median from Data Stream.html	
+++ /dev/null
@@ -1,758 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>295. Find Median from Data Stream &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/295. Find Median from Data Stream';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="703. Kth Largest Element in a Stream" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html" />
-    <link rel="prev" title="1046. Last Stone Weight" href="1046.%20Last%20Stone%20Weight.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F09. Heap - Priority Queue/295. Find Median from Data Stream.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>295. Find Median from Data Stream</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="find-median-from-data-stream">
-<h1>295. Find Median from Data Stream<a class="headerlink" href="#find-median-from-data-stream" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Hard</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/find-median-from-data-stream/">To see the Find Median from Data Stream problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>The <strong>median</strong> is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.</p>
-<p>Implement the MedianFinder class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">MedianFinder()</span></code> initializes the <code class="docutils literal notranslate"><span class="pre">MedianFinder</span></code> object.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">void</span> <span class="pre">addNum(int</span> <span class="pre">num)</span></code> adds the integer <code class="docutils literal notranslate"><span class="pre">num</span></code> from the data stream to the data structure.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">double</span> <span class="pre">findMedian()</span></code> returns the median of all elements so far. Answers within <span class="math notranslate nohighlight">\(10^{-5}\)</span> of the actual answer will be accepted.</p></li>
-</ul>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><span class="math notranslate nohighlight">\(-10^{5}\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">num</span></code> &lt;= <span class="math notranslate nohighlight">\(10^{5}\)</span></p></li>
-<li><p>There will be at least one element in the data structure before calling <code class="docutils literal notranslate"><span class="pre">findMedian</span></code>.</p></li>
-<li><p>At most <span class="math notranslate nohighlight">\(5 * 10^4\)</span> calls will be made to <code class="docutils literal notranslate"><span class="pre">addNum</span></code> and <code class="docutils literal notranslate"><span class="pre">findMedian</span></code>.</p></li>
-</ul>
-<p><strong>Follow-up:</strong></p>
-<ol class="arabic simple">
-<li><p>If all integer numbers from the stream are in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>, how would you optimize your solution?</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">99%</span></code> of all integer numbers from the stream are in the range <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">100]</span></code>, how would you optimize your solution?</p></li>
-</ol>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem, “Find Median from Data Stream,” deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.</p>
-<p>Here’s a breakdown of the problem:</p>
-<ol class="arabic simple">
-<li><p><strong>Initialization</strong>: You are asked to implement a <code class="docutils literal notranslate"><span class="pre">MedianFinder</span></code> class that supports the following operations:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">MedianFinder()</span></code>: Initializes the MedianFinder object.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">addNum(int</span> <span class="pre">num)</span></code>: Adds an integer <code class="docutils literal notranslate"><span class="pre">num</span></code> from the data stream to the data structure.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">findMedian()</span></code>: Returns the median of all elements added to the data structure.</p></li>
-</ul>
-</li>
-<li><p><strong>Median Calculation</strong>: The <code class="docutils literal notranslate"><span class="pre">findMedian</span></code> operation should efficiently compute the median, and the result should have a precision of at least <span class="math notranslate nohighlight">\(10^{-5}\)</span> (i.e., answers within this range will be considered correct).</p></li>
-<li><p><strong>Examples</strong>:</p>
-<ul class="simple">
-<li><p>If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.</p></li>
-<li><p>If you add numbers [1, 2, 3], the median should be 2 because it’s the middle value.</p></li>
-</ul>
-</li>
-<li><p><strong>Constraints</strong>:</p>
-<ul class="simple">
-<li><p>The integers provided in the data stream are in the range from <span class="math notranslate nohighlight">\(-10^5\)</span> to <span class="math notranslate nohighlight">\(10^5\)</span>.</p></li>
-<li><p>There will be at least one element in the data structure before calling <code class="docutils literal notranslate"><span class="pre">findMedian</span></code>.</p></li>
-<li><p>At most, <span class="math notranslate nohighlight">\(5 * 10^4\)</span> calls will be made to <code class="docutils literal notranslate"><span class="pre">addNum</span></code> and <code class="docutils literal notranslate"><span class="pre">findMedian</span></code>.</p></li>
-</ul>
-</li>
-</ol>
-<p>The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">import</span> <span class="nn">heapq</span>
-
-<span class="k">class</span> <span class="nc">MedianFinder</span><span class="p">:</span>
-
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
-        <span class="c1"># Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,</span>
-        <span class="c1"># and a min-heap (large_half) for the larger half of numbers.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">small_half</span> <span class="o">=</span> <span class="p">[]</span>  <span class="c1"># Max-heap for the smaller half of the numbers</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">large_half</span> <span class="o">=</span> <span class="p">[]</span>  <span class="c1"># Min-heap for the larger half of the numbers</span>
-
-    <span class="k">def</span> <span class="nf">addNum</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">num</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">None</span><span class="p">:</span>
-        <span class="c1"># Add the number to the appropriate heap based on its value</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="bp">self</span><span class="o">.</span><span class="n">small_half</span> <span class="ow">or</span> <span class="n">num</span> <span class="o">&lt;=</span> <span class="o">-</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">[</span><span class="mi">0</span><span class="p">]:</span>
-            <span class="c1"># If the number is less than or equal to the current maximum in the smaller half,</span>
-            <span class="c1"># add it to the smaller half (max-heap)</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">,</span> <span class="o">-</span><span class="n">num</span><span class="p">)</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="c1"># Otherwise, add it to the larger half (min-heap)</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">,</span> <span class="n">num</span><span class="p">)</span>
-
-        <span class="c1"># Balance the heaps if necessary to ensure the size difference is at most 1</span>
-        <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">)</span> <span class="o">&gt;</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span><span class="p">:</span>
-            <span class="c1"># If the size of the smaller half is more than one greater than the size of the larger half,</span>
-            <span class="c1"># move the maximum from the smaller half to the larger half to balance them.</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">,</span> <span class="o">-</span><span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">))</span>
-        <span class="k">elif</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">)</span> <span class="o">&gt;</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">):</span>
-            <span class="c1"># If the size of the larger half is greater than the size of the smaller half,</span>
-            <span class="c1"># move the minimum from the larger half to the smaller half to balance them.</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">,</span> <span class="o">-</span><span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">))</span>
-
-    <span class="k">def</span> <span class="nf">findMedian</span><span class="p">(</span><span class="bp">self</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">float</span><span class="p">:</span>
-        <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">)</span> <span class="o">==</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">):</span>
-            <span class="c1"># If both halves have the same size, there&#39;s an even number of elements,</span>
-            <span class="c1"># so the median is the average of the top elements in both heaps.</span>
-            <span class="k">return</span> <span class="p">(</span><span class="o">-</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">+</span> <span class="bp">self</span><span class="o">.</span><span class="n">large_half</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span> <span class="o">/</span> <span class="mf">2.0</span>
-        <span class="k">else</span><span class="p">:</span>
-            <span class="c1"># If the smaller half has more elements, it contains the median (odd number of elements).</span>
-            <span class="k">return</span> <span class="o">-</span><span class="bp">self</span><span class="o">.</span><span class="n">small_half</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code defines a <code class="docutils literal notranslate"><span class="pre">MedianFinder</span></code> class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (<code class="docutils literal notranslate"><span class="pre">small_half</span></code>) to store the smaller half of the numbers and a min-heap (<code class="docutils literal notranslate"><span class="pre">large_half</span></code>) to store the larger half. Here’s how the code works:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">__init__</span></code> method initializes the two heaps.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">addNum</span></code> method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">findMedian</span></code> method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.</p></li>
-</ol>
-<p>In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="n">medianFinder</span> <span class="o">=</span> <span class="n">MedianFinder</span><span class="p">()</span>
-<span class="n">medianFinder</span><span class="o">.</span><span class="n">addNum</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<span class="n">medianFinder</span><span class="o">.</span><span class="n">addNum</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">medianFinder</span><span class="o">.</span><span class="n">findMedian</span><span class="p">())</span>  <span class="c1"># Output: 1.5</span>
-<span class="n">medianFinder</span><span class="o">.</span><span class="n">addNum</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">medianFinder</span><span class="o">.</span><span class="n">findMedian</span><span class="p">())</span>  <span class="c1"># Output: 2.0</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1.5
-2
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">MedianFinder</span></code> class:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">MedianFinder()</span></code> Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">addNum(int</span> <span class="pre">num)</span></code>: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">findMedian()</span></code>: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.</p></li>
-</ol>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">MedianFinder()</span></code> Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">addNum(int</span> <span class="pre">num)</span></code>: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">findMedian()</span></code>: The space complexity for finding the median is O(1). It doesn’t require any additional data structures that grow with the input size.</p></li>
-</ol>
-<p>In summary, the time complexity of the <code class="docutils literal notranslate"><span class="pre">addNum</span></code> operation is O(log N), and the time complexity of the <code class="docutils literal notranslate"><span class="pre">findMedian</span></code> operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Generalized kth Element</strong>: Extend the <code class="docutils literal notranslate"><span class="pre">MedianFinder</span></code> class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.</p></li>
-<li><p><strong>Sliding Window Median</strong>: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./09. Heap - Priority Queue"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="1046.%20Last%20Stone%20Weight.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">1046. Last Stone Weight</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="703.%20Kth%20Largest%20Element%20in%20a%20Stream.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">703. Kth Largest Element in a Stream</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html b/docs/_build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html
deleted file mode 100644
index a31cb11..0000000
--- a/docs/_build/html/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html	
+++ /dev/null
@@ -1,770 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>703. Kth Largest Element in a Stream &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '09. Heap - Priority Queue/703. Kth Largest Element in a Stream';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Backtracking Problems - Blind 75 LeetCode" href="../10.%20Backtracking/README.html" />
-    <link rel="prev" title="295. Find Median from Data Stream" href="295.%20Find%20Median%20from%20Data%20Stream.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F09. Heap - Priority Queue/703. Kth Largest Element in a Stream.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>703. Kth Largest Element in a Stream</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="kth-largest-element-in-a-stream">
-<h1>703. Kth Largest Element in a Stream<a class="headerlink" href="#kth-largest-element-in-a-stream" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/kth-largest-element-in-a-stream/">To see the Kth Largest Element in a Stream problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Design a class to find the <code class="docutils literal notranslate"><span class="pre">kth</span></code> largest element in a stream. Note that it is the <code class="docutils literal notranslate"><span class="pre">kth</span></code> largest element in the sorted order, not the <code class="docutils literal notranslate"><span class="pre">kth</span></code> distinct element.</p>
-<p>Implement the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class with the following methods:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">KthLargest(int</span> <span class="pre">k,</span> <span class="pre">int[]</span> <span class="pre">nums)</span></code>: Initializes the object with the integer <code class="docutils literal notranslate"><span class="pre">k</span></code> and the stream of integers <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">int</span> <span class="pre">add(int</span> <span class="pre">val)</span></code>: Appends the integer <code class="docutils literal notranslate"><span class="pre">val</span></code> to the stream and returns the element representing the <code class="docutils literal notranslate"><span class="pre">kth</span></code> largest element in the stream.</p></li>
-</ul>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">k</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">nums.length</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">nums[i]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p><span class="math notranslate nohighlight">\(-10^4\)</span> &lt;= <code class="docutils literal notranslate"><span class="pre">val</span></code> &lt;= <span class="math notranslate nohighlight">\(10^4\)</span></p></li>
-<li><p>At most <span class="math notranslate nohighlight">\(10^4\)</span> calls will be made to <code class="docutils literal notranslate"><span class="pre">add</span></code>.</p></li>
-<li><p>It is guaranteed that there will be at least <code class="docutils literal notranslate"><span class="pre">k</span></code> elements in the array when you search for the <code class="docutils literal notranslate"><span class="pre">kth</span></code> element.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem you’re trying to solve is to design a class called <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:</p>
-<p>To solve this problem efficiently, you can use a min-heap data structure. Here’s how the approach works:</p>
-<ol class="arabic simple">
-<li><p>Initialize a min-heap to store the k largest elements. Initially, it’s empty.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">__init__</span></code> method, populate the min-heap with the first <code class="docutils literal notranslate"><span class="pre">k</span></code> elements from <code class="docutils literal notranslate"><span class="pre">nums</span></code>. This ensures that you have the k largest elements seen so far.</p></li>
-<li><p>Whenever you add a new element to the stream using the <code class="docutils literal notranslate"><span class="pre">add</span></code> method, follow these steps:</p>
-<ul class="simple">
-<li><p>Add the new element to the min-heap.</p></li>
-<li><p>If the size of the min-heap exceeds <code class="docutils literal notranslate"><span class="pre">k</span></code>, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.</p></li>
-<li><p>The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.</p></li>
-</ul>
-</li>
-</ol>
-<p>Here’s why this approach works efficiently:</p>
-<ul class="simple">
-<li><p>By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.</p></li>
-<li><p>When you add a new element, the min-heap’s size is kept at most <code class="docutils literal notranslate"><span class="pre">k</span></code>, which ensures that you only track the k largest elements and discard the smaller ones.</p></li>
-<li><p>The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).</p></li>
-<li><p>This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.</p></li>
-</ul>
-<p>In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">import</span> <span class="nn">heapq</span>
-<span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>  <span class="c1"># Import the List type from the typing module</span>
-
-<span class="k">class</span> <span class="nc">KthLargest</span><span class="p">:</span>
-
-    <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">k</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">nums</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">]):</span>
-        <span class="c1"># Initialize the KthLargest object with k and nums.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">k</span> <span class="o">=</span> <span class="n">k</span>
-        <span class="c1"># Create a min-heap to store the k largest elements.</span>
-        <span class="bp">self</span><span class="o">.</span><span class="n">min_heap</span> <span class="o">=</span> <span class="p">[]</span>
-        <span class="c1"># Populate the min-heap with the first k elements from nums.</span>
-        <span class="k">for</span> <span class="n">num</span> <span class="ow">in</span> <span class="n">nums</span><span class="p">:</span>
-            <span class="bp">self</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">num</span><span class="p">)</span>
-
-    <span class="k">def</span> <span class="nf">add</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">val</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
-        <span class="c1"># Add val to the min-heap.</span>
-        <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">min_heap</span><span class="p">,</span> <span class="n">val</span><span class="p">)</span>
-        <span class="c1"># If the size of the min-heap exceeds k, remove the smallest element.</span>
-        <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">min_heap</span><span class="p">)</span> <span class="o">&gt;</span> <span class="bp">self</span><span class="o">.</span><span class="n">k</span><span class="p">:</span>
-            <span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">min_heap</span><span class="p">)</span>
-        <span class="c1"># The root of the min-heap is the kth largest element.</span>
-        <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">min_heap</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p>We start by importing the necessary modules:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">heapq</span></code>: This module provides functions to create and manipulate heaps.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">List</span></code> from the <code class="docutils literal notranslate"><span class="pre">typing</span></code> module: This is used to specify the type of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> parameter.</p></li>
-</ul>
-</li>
-<li><p>We define the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class:</p>
-<ul>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">__init__</span></code> method initializes the object with the integer <code class="docutils literal notranslate"><span class="pre">k</span></code> and the list of integers <code class="docutils literal notranslate"><span class="pre">nums</span></code>.</p></li>
-<li><p>It also creates an empty min-heap called <code class="docutils literal notranslate"><span class="pre">self.min_heap</span></code> to store the k largest elements.</p></li>
-<li><p>It populates the min-heap with the first <code class="docutils literal notranslate"><span class="pre">k</span></code> elements from <code class="docutils literal notranslate"><span class="pre">nums</span></code> by calling the <code class="docutils literal notranslate"><span class="pre">add</span></code> method.</p></li>
-</ul>
-</li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">add</span></code> method:</p>
-<ul>
-<li><p>Adds the new integer <code class="docutils literal notranslate"><span class="pre">val</span></code> to the min-heap using <code class="docutils literal notranslate"><span class="pre">heapq.heappush</span></code>. This maintains the min-heap property.</p></li>
-<li><p>Checks if the size of the min-heap exceeds <code class="docutils literal notranslate"><span class="pre">k</span></code>. If it does, it removes the smallest element (the k+1th largest) using <code class="docutils literal notranslate"><span class="pre">heapq.heappop</span></code>.</p></li>
-<li><p>Finally, it returns the smallest element in the min-heap, which is always the kth largest element.</p></li>
-</ul>
-</li>
-</ul>
-<p>Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example usage:</span>
-<span class="n">kthLargest</span> <span class="o">=</span> <span class="n">KthLargest</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="p">[</span><span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">2</span><span class="p">])</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthLargest</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>  <span class="c1"># Output: 4</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthLargest</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">5</span><span class="p">))</span>  <span class="c1"># Output: 5</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthLargest</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">10</span><span class="p">))</span> <span class="c1"># Output: 5</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthLargest</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">9</span><span class="p">))</span>  <span class="c1"># Output: 8</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">kthLargest</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">4</span><span class="p">))</span>  <span class="c1"># Output: 8</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-5
-5
-8
-8
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class using the min-heap approach:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">__init__</span></code> method:</p>
-<ul class="simple">
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">__init__</span></code> method, you iterate over the first <code class="docutils literal notranslate"><span class="pre">k</span></code> elements in <code class="docutils literal notranslate"><span class="pre">nums</span></code> and add them to the min-heap. Each <code class="docutils literal notranslate"><span class="pre">heapq.heappush</span></code> operation takes O(log k) time.</p></li>
-<li><p>Therefore, the time complexity of the <code class="docutils literal notranslate"><span class="pre">__init__</span></code> method is O(k * log k).</p></li>
-</ul>
-</li>
-<li><p><code class="docutils literal notranslate"><span class="pre">add</span></code> method:</p>
-<ul class="simple">
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">add</span></code> method, you perform the following operations:</p>
-<ul>
-<li><p><code class="docutils literal notranslate"><span class="pre">heapq.heappush</span></code>: O(log k) to add the new element to the min-heap.</p></li>
-<li><p>If the size of the min-heap exceeds <code class="docutils literal notranslate"><span class="pre">k</span></code>, you perform <code class="docutils literal notranslate"><span class="pre">heapq.heappop</span></code>, which is also O(log k).</p></li>
-<li><p>Finally, you return the smallest element from the min-heap, which is O(1) because it’s always the root.</p></li>
-</ul>
-</li>
-<li><p>Overall, the time complexity of the <code class="docutils literal notranslate"><span class="pre">add</span></code> method is O(log k).</p></li>
-</ul>
-</li>
-<li><p>Overall, if you make <code class="docutils literal notranslate"><span class="pre">n</span></code> calls to the <code class="docutils literal notranslate"><span class="pre">add</span></code> method, the total time complexity is O(n * log k), where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the total number of elements added to the stream.</p></li>
-</ol>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The space complexity is determined by the space used to store the min-heap and the instance variables.</p></li>
-<li><p>The min-heap stores at most <code class="docutils literal notranslate"><span class="pre">k</span></code> elements at any given time, so its space complexity is O(k).</p></li>
-<li><p>The instance variables (such as <code class="docutils literal notranslate"><span class="pre">self.k</span></code> and <code class="docutils literal notranslate"><span class="pre">self.min_heap</span></code>) have constant space requirements.</p></li>
-<li><p>Therefore, the overall space complexity of the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class is O(k).</p></li>
-</ol>
-<p>In summary, the time complexity of the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class is O(n * log k) for <code class="docutils literal notranslate"><span class="pre">n</span></code> add operations, and the space complexity is O(k), where <code class="docutils literal notranslate"><span class="pre">k</span></code> is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem’s constraints.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Dynamic k:</strong> Modify the <code class="docutils literal notranslate"><span class="pre">KthLargest</span></code> class to support dynamic changes in the value of <code class="docutils literal notranslate"><span class="pre">k</span></code>. Implement a method <code class="docutils literal notranslate"><span class="pre">update_k</span></code> that allows changing the value of <code class="docutils literal notranslate"><span class="pre">k</span></code> during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of <code class="docutils literal notranslate"><span class="pre">k</span></code>.</p></li>
-<li><p><strong>Implement kth Smallest:</strong> Create a new class called <code class="docutils literal notranslate"><span class="pre">KthSmallest</span></code> that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./09. Heap - Priority Queue"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="295.%20Find%20Median%20from%20Data%20Stream.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">295. Find Median from Data Stream</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../10.%20Backtracking/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Backtracking Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/10. Backtracking/39. Combination Sum.html b/docs/_build/html/10. Backtracking/39. Combination Sum.html
deleted file mode 100644
index c20daec..0000000
--- a/docs/_build/html/10. Backtracking/39. Combination Sum.html	
+++ /dev/null
@@ -1,773 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>39. Combination Sum &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/39. Combination Sum';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="79. Word Search" href="79.%20Word%20Search.html" />
-    <link rel="prev" title="Backtracking Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F10. Backtracking/39. Combination Sum.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/10. Backtracking/39. Combination Sum.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>39. Combination Sum</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="combination-sum">
-<h1>39. Combination Sum<a class="headerlink" href="#combination-sum" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/combination-sum/">To see the Combination Sum problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an array of <strong>distinct</strong> integers <code class="docutils literal notranslate"><span class="pre">candidates</span></code> and a target integer <code class="docutils literal notranslate"><span class="pre">target</span></code>, return <em>a list of all <strong>unique combinations</strong> of <code class="docutils literal notranslate"><span class="pre">candidates</span></code> where the chosen numbers sum to the <code class="docutils literal notranslate"><span class="pre">target</span></code></em>. You may return the combinations in <strong>any order</strong>.</p>
-<p>The <strong>same</strong> number may be chosen from <code class="docutils literal notranslate"><span class="pre">candidates</span></code> an <strong>unlimited number</strong> of times. Two combinations are unique if the <strong>frequency</strong> of at least one of the chosen numbers is different.</p>
-<p>The test cases are generated such that the number of unique combinations that sum up to <code class="docutils literal notranslate"><span class="pre">target</span></code> is less than <code class="docutils literal notranslate"><span class="pre">150</span></code> combinations for the given input.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">candidates.length</span> <span class="pre">&lt;=</span> <span class="pre">30</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">2</span> <span class="pre">&lt;=</span> <span class="pre">candidates[i]</span> <span class="pre">&lt;=</span> <span class="pre">40</span></code></p></li>
-<li><p>All elements of <code class="docutils literal notranslate"><span class="pre">candidates</span></code> are <strong>distinct</strong>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">target</span> <span class="pre">&lt;=</span> <span class="pre">40</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:</p>
-<ul class="simple">
-<li><p>You are given an array of distinct integers called “candidates.”</p></li>
-<li><p>You are also given a target integer called “target.”</p></li>
-</ul>
-<p>The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.</p>
-<p>For example:</p>
-<p><strong>Example 1:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">candidates</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">],</span> <span class="n">target</span> <span class="o">=</span> <span class="mi">7</span>
-<span class="n">Output</span><span class="p">:</span> <span class="p">[[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">7</span><span class="p">]]</span>
-</pre></div>
-</div>
-<p>In this example, there are two unique combinations that sum up to the target:</p>
-<ul class="simple">
-<li><p>2 + 2 + 3 = 7</p></li>
-<li><p>7 = 7</p></li>
-</ul>
-<p><strong>Example 2:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">candidates</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">5</span><span class="p">],</span> <span class="n">target</span> <span class="o">=</span> <span class="mi">8</span>
-<span class="n">Output</span><span class="p">:</span> <span class="p">[[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">2</span><span class="p">],</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">3</span><span class="p">,</span> <span class="mi">5</span><span class="p">]]</span>
-</pre></div>
-</div>
-<p>Here, there are three unique combinations that sum up to the target.</p>
-<p><strong>Example 3:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">candidates</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">],</span> <span class="n">target</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="n">Output</span><span class="p">:</span> <span class="p">[]</span>
-</pre></div>
-</div>
-<p>In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.</p>
-<p>The problem asks you to find and return these combinations in any order.</p>
-<p>The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">combinationSum</span><span class="p">(</span><span class="n">candidates</span><span class="p">,</span> <span class="n">target</span><span class="p">):</span>
-    <span class="c1"># Define a recursive DFS function to find combinations</span>
-    <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">remaining</span><span class="p">,</span> <span class="n">start</span><span class="p">,</span> <span class="n">path</span><span class="p">):</span>
-        <span class="c1"># If the remaining target is 0, we found a valid combination</span>
-        <span class="k">if</span> <span class="n">remaining</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">path</span><span class="p">)</span>
-            <span class="k">return</span>
-        <span class="c1"># If the remaining target is negative, this path is invalid</span>
-        <span class="k">if</span> <span class="n">remaining</span> <span class="o">&lt;</span> <span class="mi">0</span><span class="p">:</span>
-            <span class="k">return</span>
-        <span class="c1"># Iterate through candidates starting from &#39;start&#39; to avoid duplicates</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">start</span><span class="p">,</span> <span class="nb">len</span><span class="p">(</span><span class="n">candidates</span><span class="p">)):</span>
-            <span class="c1"># Explore the current candidate by subtracting it from the remaining target</span>
-            <span class="c1"># Add the current candidate to the path</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">remaining</span> <span class="o">-</span> <span class="n">candidates</span><span class="p">[</span><span class="n">i</span><span class="p">],</span> <span class="n">i</span><span class="p">,</span> <span class="n">path</span> <span class="o">+</span> <span class="p">[</span><span class="n">candidates</span><span class="p">[</span><span class="n">i</span><span class="p">]])</span>
-
-    <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>  <span class="c1"># Initialize an empty list to store the result</span>
-    <span class="n">candidates</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span>  <span class="c1"># Sort the candidates for deduplication and early stopping</span>
-    <span class="n">dfs</span><span class="p">(</span><span class="n">target</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="p">[])</span>  <span class="c1"># Start the DFS from the target value with an empty path</span>
-    <span class="k">return</span> <span class="n">result</span>  <span class="c1"># Return the list of unique combinations</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The <code class="docutils literal notranslate"><span class="pre">combinationSum</span></code> function takes an array of distinct integers <code class="docutils literal notranslate"><span class="pre">candidates</span></code> and a target integer <code class="docutils literal notranslate"><span class="pre">target</span></code>. It returns a list of all unique combinations of <code class="docutils literal notranslate"><span class="pre">candidates</span></code> where the chosen numbers sum to the <code class="docutils literal notranslate"><span class="pre">target</span></code>. Each number in the <code class="docutils literal notranslate"><span class="pre">candidates</span></code> array can be used an unlimited number of times.</p>
-<p>Here’s an overview of how the code works:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">combinationSum</span></code> function is defined, and it takes two arguments: <code class="docutils literal notranslate"><span class="pre">candidates</span></code> and <code class="docutils literal notranslate"><span class="pre">target</span></code>.</p></li>
-<li><p>Inside the function, there is a nested helper function called <code class="docutils literal notranslate"><span class="pre">backtrack</span></code>. This function is responsible for the actual combination generation using a recursive approach.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">backtrack</span></code> function is called with three arguments: <code class="docutils literal notranslate"><span class="pre">start</span></code>, <code class="docutils literal notranslate"><span class="pre">target</span></code>, and <code class="docutils literal notranslate"><span class="pre">path</span></code>. The <code class="docutils literal notranslate"><span class="pre">start</span></code> variable helps keep track of the current index in the <code class="docutils literal notranslate"><span class="pre">candidates</span></code> array, <code class="docutils literal notranslate"><span class="pre">target</span></code> keeps track of the remaining sum to be achieved, and <code class="docutils literal notranslate"><span class="pre">path</span></code> is a list that stores the current combination.</p></li>
-<li><p>Within the <code class="docutils literal notranslate"><span class="pre">backtrack</span></code> function, there are three main conditional statements:</p>
-<ul class="simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">target</span></code> becomes zero, it means we have found a combination that sums up to the target, so we add <code class="docutils literal notranslate"><span class="pre">path</span></code> to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">target</span></code> becomes negative, it means the current combination doesn’t work, so we return without doing anything.</p></li>
-<li><p>Otherwise, we enter a loop that iterates over the <code class="docutils literal notranslate"><span class="pre">candidates</span></code> array, starting from the current index <code class="docutils literal notranslate"><span class="pre">start</span></code>.</p></li>
-</ul>
-</li>
-<li><p>In the loop, the <code class="docutils literal notranslate"><span class="pre">backtrack</span></code> function is called recursively with the updated <code class="docutils literal notranslate"><span class="pre">target</span></code> and <code class="docutils literal notranslate"><span class="pre">path</span></code> after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.</p></li>
-<li><p>After the loop completes, the <code class="docutils literal notranslate"><span class="pre">result</span></code> list contains all unique combinations that sum to the target.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">candidates</span></code> array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.</p></li>
-<li><p>Finally, the <code class="docutils literal notranslate"><span class="pre">backtrack</span></code> function is initially called from the <code class="docutils literal notranslate"><span class="pre">combinationSum</span></code> function with <code class="docutils literal notranslate"><span class="pre">start</span></code> set to 0, <code class="docutils literal notranslate"><span class="pre">target</span></code> set to the original target value, and an empty <code class="docutils literal notranslate"><span class="pre">path</span></code>. The result is returned as a list of unique combinations.</p></li>
-</ol>
-<p>The code includes a few example cases to demonstrate how the function works with different inputs.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Example 1</span>
-<span class="n">candidates1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">]</span>
-<span class="n">target1</span> <span class="o">=</span> <span class="mi">7</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">combinationSum</span><span class="p">(</span><span class="n">candidates1</span><span class="p">,</span> <span class="n">target1</span><span class="p">))</span>  <span class="c1"># Output: [[2, 2, 3], [7]]</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[2, 2, 3], [7]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">candidates2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">5</span><span class="p">]</span>
-<span class="n">target2</span> <span class="o">=</span> <span class="mi">8</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">combinationSum</span><span class="p">(</span><span class="n">candidates2</span><span class="p">,</span> <span class="n">target2</span><span class="p">))</span>  <span class="c1"># Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[2, 2, 2, 2], [2, 3, 3], [3, 5]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-<span class="n">candidates3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">]</span>
-<span class="n">target3</span> <span class="o">=</span> <span class="mi">1</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">combinationSum</span><span class="p">(</span><span class="n">candidates3</span><span class="p">,</span> <span class="n">target3</span><span class="p">))</span>  <span class="c1"># Output: []</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">combinationSum</span></code> function.</p>
-<p><strong>Time Complexity:</strong>
-The time complexity of this function is influenced by the number of recursive calls made by the <code class="docutils literal notranslate"><span class="pre">backtrack</span></code> function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.</p>
-<p>The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as <span class="math notranslate nohighlight">\(O(2^n)\)</span>, where ‘n’ is the maximum number of recursive calls. In this context, ‘n’ corresponds to the number of elements in the <code class="docutils literal notranslate"><span class="pre">candidates</span></code> list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.</p>
-<p><strong>Space Complexity:</strong>
-The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.</p>
-<ol class="arabic simple">
-<li><p>The space required for the <code class="docutils literal notranslate"><span class="pre">result</span></code> list can be up to <span class="math notranslate nohighlight">\(O(2^n)\)</span> in the worst case because each combination is stored.</p></li>
-<li><p>The stack space for the recursive calls can also be up to O(n) in the worst case, where ‘n’ is the number of elements in the <code class="docutils literal notranslate"><span class="pre">candidates</span></code> list.</p></li>
-</ol>
-<p>Therefore, the overall space complexity of the function is <span class="math notranslate nohighlight">\(O(2^n + n)\)</span>. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.</p>
-<p>In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Find the Number of Unique Combinations:</strong> Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.</p></li>
-<li><p><strong>Combinations with a Maximum Value:</strong> Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./10. Backtracking"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Backtracking Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="79.%20Word%20Search.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">79. Word Search</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/10. Backtracking/79. Word Search.html b/docs/_build/html/10. Backtracking/79. Word Search.html
deleted file mode 100644
index 47447c7..0000000
--- a/docs/_build/html/10. Backtracking/79. Word Search.html	
+++ /dev/null
@@ -1,800 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>79. Word Search &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '10. Backtracking/79. Word Search';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Graphs Problems - Blind 75 LeetCode" href="../11.%20Graphs/README.html" />
-    <link rel="prev" title="39. Combination Sum" href="39.%20Combination%20Sum.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Backtracking Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F10. Backtracking/79. Word Search.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/10. Backtracking/79. Word Search.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>79. Word Search</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="word-search">
-<h1>79. Word Search<a class="headerlink" href="#word-search" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/word-search/">To see the Word Search problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> grid of characters <code class="docutils literal notranslate"><span class="pre">board</span></code> and a string <code class="docutils literal notranslate"><span class="pre">word</span></code>, return <em><code class="docutils literal notranslate"><span class="pre">true</span></code> if <code class="docutils literal notranslate"><span class="pre">word</span></code> exists in the grid.</em></p>
-<p>The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">==</span> <span class="pre">board.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">=</span> <span class="pre">board[i].length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">m,</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">6</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">word.length</span> <span class="pre">&lt;=</span> <span class="pre">15</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">board</span></code> and <code class="docutils literal notranslate"><span class="pre">word</span></code> consists of only lowercase and uppercase English letters.</p></li>
-</ul>
-<p><strong>Follow up:</strong> Could you use search pruning to make your solution faster with a larger <code class="docutils literal notranslate"><span class="pre">board</span></code>?</p>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to determine whether a given word can be constructed from characters in an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.</p>
-<p>Here are the specifics of the problem:</p>
-<ul class="simple">
-<li><p>You are given an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> grid, which is a 2D board of characters.</p></li>
-<li><p>You are also given a string <code class="docutils literal notranslate"><span class="pre">word</span></code> consisting of lowercase and uppercase English letters.</p></li>
-<li><p>Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.</p></li>
-<li><p>You can’t use the same cell more than once when forming the word.</p></li>
-<li><p>If it’s possible to form the word in the grid, return <code class="docutils literal notranslate"><span class="pre">True</span></code>; otherwise, return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-<p>For example, consider the following grid and word:</p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">board</span> <span class="o">=</span> <span class="p">[[</span><span class="s2">&quot;A&quot;</span><span class="p">,</span> <span class="s2">&quot;B&quot;</span><span class="p">,</span> <span class="s2">&quot;C&quot;</span><span class="p">,</span> <span class="s2">&quot;E&quot;</span><span class="p">],</span>
-         <span class="p">[</span><span class="s2">&quot;S&quot;</span><span class="p">,</span> <span class="s2">&quot;F&quot;</span><span class="p">,</span> <span class="s2">&quot;C&quot;</span><span class="p">,</span> <span class="s2">&quot;S&quot;</span><span class="p">],</span>
-         <span class="p">[</span><span class="s2">&quot;A&quot;</span><span class="p">,</span> <span class="s2">&quot;D&quot;</span><span class="p">,</span> <span class="s2">&quot;E&quot;</span><span class="p">,</span> <span class="s2">&quot;E&quot;</span><span class="p">]]</span>         
-<span class="n">word</span> <span class="o">=</span> <span class="s2">&quot;ABCCED&quot;</span>
-</pre></div>
-</div>
-<p>In this case, the word “ABCCED” can be formed by moving through the cells (0,0) -&gt; (0,1) -&gt; (0,2) -&gt; (1,2) -&gt; (2,2) -&gt; (2,3) in the grid. Therefore, the function should return <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p>
-<p>Conversely, if the word is impossible to construct, such as in the case of the word “ABCB” for the same grid, where there’s no valid path that forms the word, the function should return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p>
-<p>The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">exist</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">board</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="n">List</span><span class="p">[</span><span class="nb">str</span><span class="p">]],</span> <span class="n">word</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">k</span><span class="p">):</span>
-            <span class="c1"># Check if the current position is out of bounds or doesn&#39;t match the character in the word.</span>
-            <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">))</span> <span class="ow">or</span> <span class="ow">not</span> <span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">j</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">[</span><span class="mi">0</span><span class="p">]))</span> <span class="ow">or</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">!=</span> <span class="n">word</span><span class="p">[</span><span class="n">k</span><span class="p">]:</span>
-                <span class="k">return</span> <span class="kc">False</span>
-            
-            <span class="c1"># If we have matched all characters in the word, return True.</span>
-            <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="nb">len</span><span class="p">(</span><span class="n">word</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
-                <span class="k">return</span> <span class="kc">True</span>
-
-            <span class="c1"># Temporarily mark the current cell to prevent revisiting.</span>
-            <span class="n">tmp</span><span class="p">,</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">=</span> <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">],</span> <span class="s2">&quot;/&quot;</span>
-
-            <span class="c1"># Explore adjacent cells by making recursive calls in all four directions.</span>
-            <span class="n">found</span> <span class="o">=</span> <span class="n">dfs</span><span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">k</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="ow">or</span> <span class="n">dfs</span><span class="p">(</span><span class="n">i</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">k</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="ow">or</span> <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="n">k</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="ow">or</span> <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">k</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-
-            <span class="c1"># Restore the original character in the cell.</span>
-            <span class="n">board</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">=</span> <span class="n">tmp</span>
-
-            <span class="k">return</span> <span class="n">found</span>
-
-        <span class="c1"># Iterate through all cells in the board.</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">)):</span>
-            <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">board</span><span class="p">[</span><span class="mi">0</span><span class="p">])):</span>
-                <span class="c1"># Check if the &#39;dfs&#39; function starting from this cell returns True.</span>
-                <span class="k">if</span> <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="mi">0</span><span class="p">):</span>
-                    <span class="k">return</span> <span class="kc">True</span>
-
-        <span class="c1"># If no match is found after exploring all cells, return False.</span>
-        <span class="k">return</span> <span class="kc">False</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Import the necessary module:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">from</span> <span class="pre">typing</span> <span class="pre">import</span> <span class="pre">List</span></code>: This line imports the <code class="docutils literal notranslate"><span class="pre">List</span></code> type from the <code class="docutils literal notranslate"><span class="pre">typing</span></code> module, which is used to specify the type of the <code class="docutils literal notranslate"><span class="pre">board</span></code> parameter in the method signature.</p></li>
-</ul>
-</li>
-<li><p>Define the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">class</span> <span class="pre">Solution:</span></code>: This line defines a class called <code class="docutils literal notranslate"><span class="pre">Solution</span></code> to encapsulate the solution for the word search problem.</p></li>
-</ul>
-</li>
-<li><p>Define the <code class="docutils literal notranslate"><span class="pre">exist</span></code> method:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">exist(self,</span> <span class="pre">board:</span> <span class="pre">List[List[str]],</span> <span class="pre">word:</span> <span class="pre">str)</span> <span class="pre">-&gt;</span> <span class="pre">bool:</span></code>: This method is a member of the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class and takes two parameters: <code class="docutils literal notranslate"><span class="pre">board</span></code>, which is a 2D list of characters, and <code class="docutils literal notranslate"><span class="pre">word</span></code>, which is a string. It returns a boolean value, indicating whether the word exists in the board.</p></li>
-</ul>
-</li>
-<li><p>Implement the inner <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">def</span> <span class="pre">dfs(i,</span> <span class="pre">j,</span> <span class="pre">k):</span></code>: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: <code class="docutils literal notranslate"><span class="pre">i</span></code> and <code class="docutils literal notranslate"><span class="pre">j</span></code> representing the current position on the board, and <code class="docutils literal notranslate"><span class="pre">k</span></code> representing the current index in the <code class="docutils literal notranslate"><span class="pre">word</span></code> string.</p></li>
-<li><p>Inside <code class="docutils literal notranslate"><span class="pre">dfs</span></code>, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the <code class="docutils literal notranslate"><span class="pre">word</span></code>. If either of these conditions is met, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">k</span></code> is equal to the length of the <code class="docutils literal notranslate"><span class="pre">word</span></code> minus one, it means we have successfully matched all characters in the <code class="docutils literal notranslate"><span class="pre">word</span></code>, so it returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>The function then temporarily replaces the character at the current position with a marker, “/”, to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return <code class="docutils literal notranslate"><span class="pre">True</span></code>, it propagates the <code class="docutils literal notranslate"><span class="pre">True</span></code> result up the call stack. After the exploration is complete, it restores the original character in the cell.</p></li>
-</ul>
-</li>
-<li><p>Iterate through the board:</p>
-<ul class="simple">
-<li><p>The outer loop iterates through all cells in the <code class="docutils literal notranslate"><span class="pre">board</span></code> using two nested loops. For each cell, it checks if the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function starting from that cell (with <code class="docutils literal notranslate"><span class="pre">k</span></code> initially set to 0) returns <code class="docutils literal notranslate"><span class="pre">True</span></code>. If it does, it means the word exists, so the method returns <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-</ul>
-</li>
-<li><p>Return <code class="docutils literal notranslate"><span class="pre">False</span></code>:</p>
-<ul class="simple">
-<li><p>If the loop completes without finding the word in the board, the method returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-</li>
-</ol>
-<p>To use this code, you can create an instance of the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class and call the <code class="docutils literal notranslate"><span class="pre">exist</span></code> method on that instance, passing the <code class="docutils literal notranslate"><span class="pre">board</span></code> and the <code class="docutils literal notranslate"><span class="pre">word</span></code> as arguments to check if the word exists in the board.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1: </span>
-
-<span class="c1"># Create an instance of the Solution class</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="c1"># Test case 1: Word &quot;ABCCED&quot; can be found in the grid</span>
-<span class="n">board1</span> <span class="o">=</span> <span class="p">[[</span><span class="s2">&quot;A&quot;</span><span class="p">,</span><span class="s2">&quot;B&quot;</span><span class="p">,</span><span class="s2">&quot;C&quot;</span><span class="p">,</span><span class="s2">&quot;E&quot;</span><span class="p">],</span>
-          <span class="p">[</span><span class="s2">&quot;S&quot;</span><span class="p">,</span><span class="s2">&quot;F&quot;</span><span class="p">,</span><span class="s2">&quot;C&quot;</span><span class="p">,</span><span class="s2">&quot;S&quot;</span><span class="p">],</span>
-          <span class="p">[</span><span class="s2">&quot;A&quot;</span><span class="p">,</span><span class="s2">&quot;D&quot;</span><span class="p">,</span><span class="s2">&quot;E&quot;</span><span class="p">,</span><span class="s2">&quot;E&quot;</span><span class="p">]]</span>
-<span class="n">word1</span> <span class="o">=</span> <span class="s2">&quot;ABCCED&quot;</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">exist</span><span class="p">(</span><span class="n">board1</span><span class="p">,</span> <span class="n">word1</span><span class="p">))</span>  <span class="c1"># Expected output: True</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-
-<span class="c1"># Test case 2: Word &quot;SEE&quot; can be found in the grid</span>
-<span class="n">word2</span> <span class="o">=</span> <span class="s2">&quot;SEE&quot;</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">exist</span><span class="p">(</span><span class="n">board1</span><span class="p">,</span> <span class="n">word2</span><span class="p">))</span>  <span class="c1"># Expected output: True</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 3</span>
-
-<span class="c1"># Test case 3: Word &quot;ABCB&quot; cannot be found in the grid</span>
-<span class="n">word3</span> <span class="o">=</span> <span class="s2">&quot;ABCB&quot;</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">exist</span><span class="p">(</span><span class="n">board1</span><span class="p">,</span> <span class="n">word3</span><span class="p">))</span>  <span class="c1"># Expected output: False</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">exist</span></code> method in the given code.</p>
-<p><strong>Time Complexity:</strong></p>
-<p>The primary work in this code is done by the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function, which performs a depth-first search through the grid. The time complexity of the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function is <span class="math notranslate nohighlight">\(O(4^(n))\)</span>, where “n” is the length of the <code class="docutils literal notranslate"><span class="pre">word</span></code>. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the <code class="docutils literal notranslate"><span class="pre">word</span></code>.</p>
-<p>The outer loops iterate through all cells in the <code class="docutils literal notranslate"><span class="pre">board</span></code>, which has dimensions <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code>. So, the total number of iterations of <code class="docutils literal notranslate"><span class="pre">dfs</span></code> is O(m * n). However, since the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function has a higher time complexity, the overall time complexity is still dominated by the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function.</p>
-<p>Therefore, the overall time complexity of the <code class="docutils literal notranslate"><span class="pre">exist</span></code> method is <span class="math notranslate nohighlight">\(O(m * n * 4^n)\)</span>, where “m” and “n” are the dimensions of the board, and “n” is the length of the word.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The primary space usage comes from the recursive calls in the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function. The depth of the recursion can be at most equal to the length of the <code class="docutils literal notranslate"><span class="pre">word</span></code>, which is O(n).</p></li>
-<li><p>Additionally, the <code class="docutils literal notranslate"><span class="pre">tmp</span></code> variable and the recursive calls on the call stack consume a small amount of additional memory.</p></li>
-<li><p>The marking of visited cells with the “/” character temporarily modifies the <code class="docutils literal notranslate"><span class="pre">board</span></code> in-place but doesn’t significantly contribute to the space complexity.</p></li>
-</ol>
-<p>Therefore, the overall space complexity is O(n) due to the recursive call stack.</p>
-<p>In summary, the time complexity is <span class="math notranslate nohighlight">\(O(m * n * 4^n)\)</span>, and the space complexity is O(n), where “m” and “n” are the dimensions of the board, and “n” is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimization Challenge:</strong> Modify the code to find all unique words that can be constructed from the grid. Instead of returning <code class="docutils literal notranslate"><span class="pre">True</span></code> or <code class="docutils literal notranslate"><span class="pre">False</span></code>, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.</p></li>
-<li><p><strong>Board Generation:</strong> Create a function to generate random grids of characters and then use the <code class="docutils literal notranslate"><span class="pre">exist</span></code> method to solve them. Test the efficiency and correctness of your code by generating larger boards and words.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./10. Backtracking"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="39.%20Combination%20Sum.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">39. Combination Sum</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../11.%20Graphs/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Graphs Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/11. Graphs/178. Graph Valid Tree.html b/docs/_build/html/11. Graphs/178. Graph Valid Tree.html
deleted file mode 100644
index b80a6d9..0000000
--- a/docs/_build/html/11. Graphs/178. Graph Valid Tree.html	
+++ /dev/null
@@ -1,749 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>178. Graph Valid Tree &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/178. Graph Valid Tree';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="200. Number of Islands" href="200.%20Number%20of%20Islands.html" />
-    <link rel="prev" title="133. Clone Graph" href="133.%20Clone%20Graph.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/178. Graph Valid Tree.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/178. Graph Valid Tree.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>178. Graph Valid Tree</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="graph-valid-tree">
-<h1>178. Graph Valid Tree<a class="headerlink" href="#graph-valid-tree" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://www.lintcode.com/problem/178/">To see the Graph Valid Tree problem on LintCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes labeled from <code class="docutils literal notranslate"><span class="pre">0</span></code> to <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code> and a list of <code class="docutils literal notranslate"><span class="pre">undirected</span></code> edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>You can assume that no duplicate edges will appear in edges. Since all edges are <code class="docutils literal notranslate"><span class="pre">undirected</span></code>, <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">1]</span></code> is the same as <code class="docutils literal notranslate"><span class="pre">[1,</span> <span class="pre">0]</span></code> and thus will not appear together in edges.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a “tree” is a specific type of graph with the following properties:</p>
-<ol class="arabic simple">
-<li><p>It is a connected graph, meaning there is a path between any pair of nodes in the graph.</p></li>
-<li><p>It has no cycles, which means there are no closed loops or circuits in the graph.</p></li>
-<li><p>It has exactly <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code> edges, where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the number of nodes in the tree.</p></li>
-</ol>
-<p>The problem is typically given with two pieces of information:</p>
-<ol class="arabic simple">
-<li><p>The number of nodes (<code class="docutils literal notranslate"><span class="pre">n</span></code>), which are usually labeled from 0 to <code class="docutils literal notranslate"><span class="pre">n-1</span></code>.</p></li>
-<li><p>A list of undirected edges, where each edge is represented as a pair of nodes.</p></li>
-</ol>
-<p>The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.</p>
-<p>To solve this problem, you need to check the following conditions:</p>
-<ol class="arabic simple">
-<li><p>There should be exactly <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code> edges to ensure that the graph is connected and tree-like.</p></li>
-<li><p>There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.</p></li>
-<li><p>The graph should be connected, which means you can reach any node from any other node through a series of edges.</p></li>
-</ol>
-<p>The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">validTree</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">edges</span><span class="p">):</span>
-    <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">edges</span><span class="p">)</span> <span class="o">!=</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
-        <span class="k">return</span> <span class="kc">False</span>  <span class="c1"># A tree with n nodes must have n-1 edges.</span>
-
-    <span class="c1"># Create an adjacency list to represent the graph.</span>
-    <span class="n">adj_list</span> <span class="o">=</span> <span class="p">{</span><span class="n">i</span><span class="p">:</span> <span class="p">[]</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">)}</span>
-    <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">edges</span><span class="p">:</span>
-        <span class="n">adj_list</span><span class="p">[</span><span class="n">u</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">v</span><span class="p">)</span>
-        <span class="n">adj_list</span><span class="p">[</span><span class="n">v</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">u</span><span class="p">)</span>
-
-    <span class="n">visited</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
-
-    <span class="c1"># Define a recursive DFS function.</span>
-    <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">parent</span><span class="p">):</span>
-        <span class="k">if</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">visited</span><span class="p">:</span>
-            <span class="k">return</span> <span class="kc">False</span>  <span class="c1"># If we encounter a visited node, there&#39;s a cycle.</span>
-        <span class="n">visited</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">node</span><span class="p">)</span>
-
-        <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">adj_list</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span>
-            <span class="k">if</span> <span class="n">neighbor</span> <span class="o">!=</span> <span class="n">parent</span><span class="p">:</span>
-                <span class="k">if</span> <span class="ow">not</span> <span class="n">dfs</span><span class="p">(</span><span class="n">neighbor</span><span class="p">,</span> <span class="n">node</span><span class="p">):</span>
-                    <span class="k">return</span> <span class="kc">False</span>
-
-        <span class="k">return</span> <span class="kc">True</span>
-
-    <span class="c1"># Start DFS from any node (e.g., node 0).</span>
-    <span class="k">if</span> <span class="ow">not</span> <span class="n">dfs</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
-        <span class="k">return</span> <span class="kc">False</span>  <span class="c1"># If there&#39;s a cycle, it&#39;s not a valid tree.</span>
-
-    <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">visited</span><span class="p">)</span> <span class="o">==</span> <span class="n">n</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The <code class="docutils literal notranslate"><span class="pre">validTree</span></code> function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:</p>
-<ol class="arabic simple">
-<li><p>It has exactly <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code> edges, where <code class="docutils literal notranslate"><span class="pre">n</span></code> is the number of nodes.</p></li>
-<li><p>There are no cycles in the graph.</p></li>
-<li><p>The graph is connected, meaning all nodes are reachable from any starting node.</p></li>
-</ol>
-<p>The code accomplishes this as follows:</p>
-<ul class="simple">
-<li><p>It first checks if the number of edges is equal to <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code>. If not, it immediately returns <code class="docutils literal notranslate"><span class="pre">False</span></code> since a tree with <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes must have <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">-</span> <span class="pre">1</span></code> edges to be connected.</p></li>
-<li><p>It then constructs an adjacency list (<code class="docutils literal notranslate"><span class="pre">adj_list</span></code>) to represent the graph efficiently. This data structure stores the neighbors of each node.</p></li>
-<li><p>The code uses a <code class="docutils literal notranslate"><span class="pre">visited</span></code> set to keep track of nodes visited during depth-first search (DFS).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-<li><p>The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.</p></li>
-<li><p>After the DFS is complete, the code checks if the number of visited nodes is equal to <code class="docutils literal notranslate"><span class="pre">n</span></code>, ensuring the graph is connected.</p></li>
-<li><p>Finally, if all conditions are met, the code returns <code class="docutils literal notranslate"><span class="pre">True</span></code>, indicating that the given edges form a valid tree. Otherwise, it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-<p>The code provides examples to demonstrate how to use the <code class="docutils literal notranslate"><span class="pre">validTree</span></code> function to check whether a set of edges forms a valid tree or not.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">n1</span> <span class="o">=</span> <span class="mi">5</span>
-<span class="n">edges1</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">2</span><span class="p">],</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">4</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">validTree</span><span class="p">(</span><span class="n">n1</span><span class="p">,</span> <span class="n">edges1</span><span class="p">))</span>  <span class="c1"># Output: true</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">n2</span> <span class="o">=</span> <span class="mi">5</span>
-<span class="n">edges2</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">],</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">4</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">validTree</span><span class="p">(</span><span class="n">n2</span><span class="p">,</span> <span class="n">edges2</span><span class="p">))</span>  <span class="c1"># Output: false</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexities of the <code class="docutils literal notranslate"><span class="pre">validTree</span></code> function:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Constructing the adjacency list (<code class="docutils literal notranslate"><span class="pre">adj_list</span></code>) takes O(E) time, where E is the number of edges in the input graph (|edges|).</p></li>
-<li><p>The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.</p></li>
-<li><p>Checking if the number of visited nodes is equal to <code class="docutils literal notranslate"><span class="pre">n</span></code> takes O(1) time.</p></li>
-</ol>
-<p>Overall, the time complexity of the <code class="docutils literal notranslate"><span class="pre">validTree</span></code> function is O(E + V) in the worst case.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>The adjacency list (<code class="docutils literal notranslate"><span class="pre">adj_list</span></code>) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">visited</span></code> set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.</p></li>
-<li><p>The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.</p></li>
-</ol>
-<p>Overall, the space complexity of the <code class="docutils literal notranslate"><span class="pre">validTree</span></code> function is O(V + E) due to the adjacency list and O(V) due to the <code class="docutils literal notranslate"><span class="pre">visited</span></code> set and DFS call stack.</p>
-<p>In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Minimum Spanning Tree (MST)</strong>: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal’s or Prim’s algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.</p></li>
-<li><p><strong>Detecting Cycles</strong>: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it’s not a tree. This exercise enhances your ability to detect and visualize cycles in a graph.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="133.%20Clone%20Graph.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">133. Clone Graph</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="200.%20Number%20of%20Islands.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">200. Number of Islands</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/11. Graphs/200. Number of Islands.html b/docs/_build/html/11. Graphs/200. Number of Islands.html
deleted file mode 100644
index 02fafc9..0000000
--- a/docs/_build/html/11. Graphs/200. Number of Islands.html	
+++ /dev/null
@@ -1,744 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>200. Number of Islands &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/200. Number of Islands';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="207. Course Schedule" href="207.%20Course%20Schedule.html" />
-    <link rel="prev" title="178. Graph Valid Tree" href="178.%20Graph%20Valid%20Tree.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/200. Number of Islands.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/200. Number of Islands.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>200. Number of Islands</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="number-of-islands">
-<h1>200. Number of Islands<a class="headerlink" href="#number-of-islands" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/number-of-islands/">To see the Number of Islands problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>Given an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> 2D binary grid <code class="docutils literal notranslate"><span class="pre">grid</span></code> which represents a map of <code class="docutils literal notranslate"><span class="pre">'1'</span></code>s (land) and <code class="docutils literal notranslate"><span class="pre">'0'</span></code>s (water), return <em>the number of islands</em>.</p>
-<p>An <strong>island</strong> is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">==</span> <span class="pre">grid.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">grid[i].length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">m,</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">300</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">grid[i][j]</span></code> is <code class="docutils literal notranslate"><span class="pre">'0'</span></code> or <code class="docutils literal notranslate"><span class="pre">'1'</span></code>.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is about counting the number of islands in a 2D binary grid. In this grid, ‘1’ represents land, and ‘0’ represents water. An island is defined as a group of ‘1’ cells that are adjacent to each other either horizontally or vertically. It’s important to note that diagonal connections do not count. Additionally, it’s assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn’t “wrap around.”</p>
-<p>The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected ‘1’ cells, and these connections can only occur horizontally or vertically. If there are no ‘1’ cells in the grid, the number of islands would be zero.</p>
-<p>The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one ‘1’ cell and explore its adjacent cells to determine the extent of the island. Once you’ve visited all the ‘1’ cells in an island, you move on to the next unvisited ‘1’ cell and repeat the process until you’ve counted all the islands in the grid.</p>
-<p>In essence, the problem asks you to analyze the grid to find groups of connected ‘1’ cells and count them as individual islands. The goal is to return the total count of islands in the given grid.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">numIslands</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">grid</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="n">List</span><span class="p">[</span><span class="nb">str</span><span class="p">]])</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">grid</span><span class="p">:</span>
-            <span class="k">return</span> <span class="mi">0</span>
-
-        <span class="n">m</span><span class="p">,</span> <span class="n">n</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">grid</span><span class="p">),</span> <span class="nb">len</span><span class="p">(</span><span class="n">grid</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>  <span class="c1"># Get the dimensions of the grid</span>
-        <span class="n">num_islands</span> <span class="o">=</span> <span class="mi">0</span>  <span class="c1"># Initialize the count of islands</span>
-
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">row</span><span class="p">,</span> <span class="n">col</span><span class="p">):</span>
-            <span class="k">if</span> <span class="n">row</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="ow">or</span> <span class="n">row</span> <span class="o">&gt;=</span> <span class="n">m</span> <span class="ow">or</span> <span class="n">col</span> <span class="o">&lt;</span> <span class="mi">0</span> <span class="ow">or</span> <span class="n">col</span> <span class="o">&gt;=</span> <span class="n">n</span> <span class="ow">or</span> <span class="n">grid</span><span class="p">[</span><span class="n">row</span><span class="p">][</span><span class="n">col</span><span class="p">]</span> <span class="o">==</span> <span class="s1">&#39;0&#39;</span><span class="p">:</span>
-                <span class="k">return</span>
-
-            <span class="n">grid</span><span class="p">[</span><span class="n">row</span><span class="p">][</span><span class="n">col</span><span class="p">]</span> <span class="o">=</span> <span class="s1">&#39;0&#39;</span>  <span class="c1"># Mark the current cell as visited by changing it to &#39;0&#39;</span>
-            <span class="n">directions</span> <span class="o">=</span> <span class="p">[(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">),</span> <span class="p">(</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">),</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">)]</span>  <span class="c1"># Define four possible directions to move</span>
-
-            <span class="k">for</span> <span class="n">dr</span><span class="p">,</span> <span class="n">dc</span> <span class="ow">in</span> <span class="n">directions</span><span class="p">:</span>
-                <span class="c1"># Explore adjacent cells</span>
-                <span class="n">dfs</span><span class="p">(</span><span class="n">row</span> <span class="o">+</span> <span class="n">dr</span><span class="p">,</span> <span class="n">col</span> <span class="o">+</span> <span class="n">dc</span><span class="p">)</span>
-
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">):</span>
-            <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-                <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="o">==</span> <span class="s1">&#39;1&#39;</span><span class="p">:</span>
-                    <span class="n">num_islands</span> <span class="o">+=</span> <span class="mi">1</span>  <span class="c1"># Increment the island count</span>
-                    <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">)</span>  <span class="c1"># Start a DFS from the current &#39;1&#39; cell to explore the entire island</span>
-
-        <span class="k">return</span> <span class="n">num_islands</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The provided code defines a Python class called <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method called <code class="docutils literal notranslate"><span class="pre">numIslands</span></code>. This class is designed to count the number of islands in a 2D binary grid.</p>
-<p>The <code class="docutils literal notranslate"><span class="pre">numIslands</span></code> method takes a 2D grid as input, where ‘1’ represents land, and ‘0’ represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:</p>
-<ol class="arabic simple">
-<li><p>Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).</p></li>
-<li><p>Determining the dimensions of the grid (number of rows and columns).</p></li>
-<li><p>Initializing a variable <code class="docutils literal notranslate"><span class="pre">num_islands</span></code> to keep track of the count of islands.</p></li>
-<li><p>Defining a nested function <code class="docutils literal notranslate"><span class="pre">dfs</span></code> to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing ‘1’ to ‘0’.</p></li>
-<li><p>In the <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function, it checks for boundary conditions and whether the current cell is ‘0’. If these conditions are met, it returns without further exploration.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function explores neighboring cells in all four directions (up, down, left, right) using a loop.</p></li>
-<li><p>The main loop iterates through each cell of the grid. When a ‘1’ cell is encountered, it increments the <code class="docutils literal notranslate"><span class="pre">num_islands</span></code> count and starts a DFS from that cell to explore the entire island.</p></li>
-<li><p>Finally, the method returns the total count of islands found in the grid.</p></li>
-</ol>
-<p>This code encapsulates the solution in a class, allowing you to create an instance of the <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class and call the <code class="docutils literal notranslate"><span class="pre">numIslands</span></code> method on it to count the number of islands in a given grid.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="n">grid1</span> <span class="o">=</span> <span class="p">[</span>
-  <span class="p">[</span><span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">]</span>
-<span class="p">]</span>
-
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="n">result1</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">numIslands</span><span class="p">(</span><span class="n">grid1</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Example 1 Output:&quot;</span><span class="p">,</span> <span class="n">result1</span><span class="p">)</span>  <span class="c1"># Expected output: 1</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Example 1 Output: 1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="n">grid2</span> <span class="o">=</span> <span class="p">[</span>
-  <span class="p">[</span><span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">],</span>
-  <span class="p">[</span><span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;0&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">,</span> <span class="s2">&quot;1&quot;</span><span class="p">]</span>
-<span class="p">]</span>
-
-<span class="n">result2</span> <span class="o">=</span> <span class="n">solution</span><span class="o">.</span><span class="n">numIslands</span><span class="p">(</span><span class="n">grid2</span><span class="p">)</span>
-<span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Example 2 Output:&quot;</span><span class="p">,</span> <span class="n">result2</span><span class="p">)</span>  <span class="c1"># Expected output: 3</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Example 2 Output: 3
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<p>Time Complexity:</p>
-<ul class="simple">
-<li><p>The code uses a depth-first search (DFS) to explore the grid and count the number of islands.</p></li>
-<li><p>In the worst case, it visits every cell in the grid exactly once.</p></li>
-<li><p>The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of <span class="math notranslate nohighlight">\(O(4^{max(m, n)})\)</span>, where m is the number of rows and n is the number of columns.</p></li>
-<li><p>Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.</p></li>
-</ul>
-<p>Space Complexity:</p>
-<ul class="simple">
-<li><p>The space complexity is determined by the recursive calls and the depth of the DFS stack.</p></li>
-<li><p>In the worst case, when the entire grid consists of ‘1’s, the depth of the DFS recursion can be as deep as max(m, n).</p></li>
-<li><p>Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.</p></li>
-</ul>
-<p>In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it’s important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n)).</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Identify Largest Island:</strong> In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.</p></li>
-<li><p><strong>Optimize for Space:</strong> Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="178.%20Graph%20Valid%20Tree.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">178. Graph Valid Tree</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="207.%20Course%20Schedule.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">207. Course Schedule</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/11. Graphs/207. Course Schedule.html b/docs/_build/html/11. Graphs/207. Course Schedule.html
deleted file mode 100644
index e47cc04..0000000
--- a/docs/_build/html/11. Graphs/207. Course Schedule.html	
+++ /dev/null
@@ -1,747 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>207. Course Schedule &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/207. Course Schedule';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="3651. Number of Connected Components in an Undirected Graph" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html" />
-    <link rel="prev" title="200. Number of Islands" href="200.%20Number%20of%20Islands.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/207. Course Schedule.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/207. Course Schedule.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>207. Course Schedule</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="course-schedule">
-<h1>207. Course Schedule<a class="headerlink" href="#course-schedule" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/course-schedule/">To see the Course Schedule problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>There are a total of <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> courses to take, labeled from 0 to <code class="docutils literal notranslate"><span class="pre">numCourses</span> <span class="pre">-</span> <span class="pre">1</span></code>. You are given an array <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> where <code class="docutils literal notranslate"><span class="pre">prerequisites[i]</span> <span class="pre">=</span> <span class="pre">[ai,</span> <span class="pre">bi]</span></code> indicates that you <strong>must</strong> take course <code class="docutils literal notranslate"><span class="pre">bi</span></code> first if you want to take course <code class="docutils literal notranslate"><span class="pre">ai</span></code>.</p>
-<ul class="simple">
-<li><p>For example, the pair <code class="docutils literal notranslate"><span class="pre">[0,</span> <span class="pre">1]</span></code>, indicates that to take course <code class="docutils literal notranslate"><span class="pre">0</span></code> you have to first take course <code class="docutils literal notranslate"><span class="pre">1</span></code>.</p></li>
-</ul>
-<p>Return <code class="docutils literal notranslate"><span class="pre">true</span></code> if you can finish all courses. Otherwise, return <code class="docutils literal notranslate"><span class="pre">false</span></code>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p>1 &lt;= <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> &lt;= 2000</p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">prerequisites.length</span></code> &lt;= 5000</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">prerequisites[i].length</span></code> == 2</p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">ai</span></code>, <code class="docutils literal notranslate"><span class="pre">bi</span></code> &lt; <code class="docutils literal notranslate"><span class="pre">numCourses</span></code></p></li>
-<li><p>All the pairs <code class="docutils literal notranslate"><span class="pre">prerequisites[i]</span></code> are <strong>unique</strong>.</p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem is to determine whether it’s possible to complete a set of courses given a list of prerequisites. You are given the following:</p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">numCourses</span></code>: The total number of courses to be taken, labeled from 0 to <code class="docutils literal notranslate"><span class="pre">numCourses</span> <span class="pre">-</span> <span class="pre">1</span></code>.</p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">prerequisites</span></code>: A list of prerequisite courses, where each element <code class="docutils literal notranslate"><span class="pre">prerequisites[i]</span></code> is a pair <code class="docutils literal notranslate"><span class="pre">[ai,</span> <span class="pre">bi]</span></code>, indicating that you must take course <code class="docutils literal notranslate"><span class="pre">bi</span></code> before you can take course <code class="docutils literal notranslate"><span class="pre">ai</span></code>.</p></li>
-</ul>
-<p>The goal is to check whether it’s possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.</p>
-<p>For example:</p>
-<ul class="simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> is 2, and <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> is <code class="docutils literal notranslate"><span class="pre">[[1,</span> <span class="pre">0]]</span></code>, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it’s possible to complete all courses, so the function should return <code class="docutils literal notranslate"><span class="pre">True</span></code>.</p></li>
-<li><p>If <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> is 2, and <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> is <code class="docutils literal notranslate"><span class="pre">[[1,</span> <span class="pre">0],</span> <span class="pre">[0,</span> <span class="pre">1]]</span></code>, it means you have two courses, but there’s a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it’s impossible to complete all courses, so the function should return <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ul>
-<p>The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it’s possible to complete all courses; otherwise, it’s not possible.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">collections</span> <span class="kn">import</span> <span class="n">defaultdict</span><span class="p">,</span> <span class="n">deque</span>
-<span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">canFinish</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">numCourses</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">prerequisites</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">]])</span> <span class="o">-&gt;</span> <span class="nb">bool</span><span class="p">:</span>
-        <span class="c1"># Create a graph using an adjacency list to represent the courses and their prerequisites.</span>
-        <span class="n">graph</span> <span class="o">=</span> <span class="n">defaultdict</span><span class="p">(</span><span class="nb">list</span><span class="p">)</span>  <span class="c1"># Initialize an empty adjacency list.</span>
-        <span class="n">in_degree</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="n">numCourses</span>  <span class="c1"># Initialize an array to store in-degrees of courses.</span>
-
-        <span class="c1"># Populate the graph and calculate in-degrees.</span>
-        <span class="k">for</span> <span class="n">course</span><span class="p">,</span> <span class="n">prerequisite</span> <span class="ow">in</span> <span class="n">prerequisites</span><span class="p">:</span>
-            <span class="n">graph</span><span class="p">[</span><span class="n">prerequisite</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">course</span><span class="p">)</span>  <span class="c1"># Add the course as a neighbor to its prerequisite.</span>
-            <span class="n">in_degree</span><span class="p">[</span><span class="n">course</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">1</span>  <span class="c1"># Increment the in-degree of the course.</span>
-
-        <span class="c1"># Initialize a queue with courses that have no prerequisites.</span>
-        <span class="n">queue</span> <span class="o">=</span> <span class="n">deque</span><span class="p">()</span>
-        <span class="k">for</span> <span class="n">course</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">numCourses</span><span class="p">):</span>
-            <span class="k">if</span> <span class="n">in_degree</span><span class="p">[</span><span class="n">course</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-                <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">course</span><span class="p">)</span>
-
-        <span class="c1"># Perform topological sorting.</span>
-        <span class="k">while</span> <span class="n">queue</span><span class="p">:</span>
-            <span class="n">course</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">popleft</span><span class="p">()</span>  <span class="c1"># Take a course with no prerequisites.</span>
-            <span class="n">numCourses</span> <span class="o">-=</span> <span class="mi">1</span>  <span class="c1"># Decrement the count of remaining courses.</span>
-
-            <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">graph</span><span class="p">[</span><span class="n">course</span><span class="p">]:</span>
-                <span class="n">in_degree</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="o">-=</span> <span class="mi">1</span>  <span class="c1"># Remove the prerequisite relationship.</span>
-                <span class="k">if</span> <span class="n">in_degree</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
-                    <span class="n">queue</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span>  <span class="c1"># If no more prerequisites, add to the queue.</span>
-
-        <span class="c1"># If all courses were successfully taken (numCourses becomes 0), return True.</span>
-        <span class="k">return</span> <span class="n">numCourses</span> <span class="o">==</span> <span class="mi">0</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here’s a brief explanation of the code:</p>
-<ol class="arabic simple">
-<li><p>The code defines a <code class="docutils literal notranslate"><span class="pre">Solution</span></code> class with a <code class="docutils literal notranslate"><span class="pre">canFinish</span></code> method that takes two parameters: <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> (the total number of courses) and <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> (a list of pairs indicating which course must be taken before another).</p></li>
-<li><p>It initializes an empty graph as an adjacency list using a <code class="docutils literal notranslate"><span class="pre">defaultdict</span></code> to represent the courses and their prerequisites. It also initializes a list called <code class="docutils literal notranslate"><span class="pre">in_degree</span></code> to keep track of the in-degrees of courses, which is used in the topological sorting process.</p></li>
-<li><p>The code then populates the graph by iterating through the <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> list. For each pair <code class="docutils literal notranslate"><span class="pre">(ai,</span> <span class="pre">bi)</span></code>, it adds course <code class="docutils literal notranslate"><span class="pre">ai</span></code> as a neighbor to its prerequisite course <code class="docutils literal notranslate"><span class="pre">bi</span></code> in the graph and increments the in-degree of course <code class="docutils literal notranslate"><span class="pre">ai</span></code>.</p></li>
-<li><p>Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.</p></li>
-<li><p>The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).</p></li>
-<li><p>For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor’s in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.</p></li>
-<li><p>The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.</p></li>
-<li><p>After the loop, if all courses were successfully taken (i.e., <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> becomes 0), it means that there were no circular dependencies, and it’s possible to finish all courses. In this case, the method returns <code class="docutils literal notranslate"><span class="pre">True</span></code>. Otherwise, if there are remaining courses (indicating a circular dependency), it returns <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">numCourses1</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="n">prerequisites1</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">]]</span>
-<span class="n">sol</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">sol</span><span class="o">.</span><span class="n">canFinish</span><span class="p">(</span><span class="n">numCourses1</span><span class="p">,</span> <span class="n">prerequisites1</span><span class="p">))</span>  <span class="c1"># Output: True</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>True
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">numCourses2</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="n">prerequisites2</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">sol</span><span class="o">.</span><span class="n">canFinish</span><span class="p">(</span><span class="n">numCourses2</span><span class="p">,</span> <span class="n">prerequisites2</span><span class="p">))</span>  <span class="c1"># Output: False</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>False
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the <code class="docutils literal notranslate"><span class="pre">canFinish</span></code> method:</p>
-<p><strong>Time Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Constructing the graph: In the first loop where we iterate through the <code class="docutils literal notranslate"><span class="pre">prerequisites</span></code> list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).</p></li>
-<li><p>Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all <code class="docutils literal notranslate"><span class="pre">numCourses</span></code> courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).</p></li>
-<li><p>Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).</p></li>
-</ol>
-<p>The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.</p>
-<p><strong>Space Complexity:</strong></p>
-<ol class="arabic simple">
-<li><p>Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.</p></li>
-<li><p>In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.</p></li>
-<li><p>Queue: The space complexity for the queue is O(V), as it may contain all the courses.</p></li>
-</ol>
-<p>The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.</p>
-<p>In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V).</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimizing Course Scheduling</strong>: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.</p></li>
-<li><p><strong>Detecting Cycles in Course Dependencies</strong>: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="200.%20Number%20of%20Islands.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">200. Number of Islands</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">3651. Number of Connected Components in an Undirected Graph</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html b/docs/_build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html
deleted file mode 100644
index 09c6f64..0000000
--- a/docs/_build/html/11. Graphs/3651. Number of Connected Components in an Undirected Graph.html	
+++ /dev/null
@@ -1,734 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>3651. Number of Connected Components in an Undirected Graph &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/3651. Number of Connected Components in an Undirected Graph';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="417. Pacific Atlantic Water Flow" href="417.%20Pacific%20Atlantic%20Water%20Flow.html" />
-    <link rel="prev" title="207. Course Schedule" href="207.%20Course%20Schedule.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/3651. Number of Connected Components in an Undirected Graph.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>3651. Number of Connected Components in an Undirected Graph</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="number-of-connected-components-in-an-undirected-graph">
-<h1>3651. Number of Connected Components in an Undirected Graph<a class="headerlink" href="#number-of-connected-components-in-an-undirected-graph" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://www.lintcode.com/problem/3651/">To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!</a></p>
-<hr class="docutils" />
-<p>In this problem, there is an undirected graph with <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes. There is also an <code class="docutils literal notranslate"><span class="pre">edges</span></code> array. Where <code class="docutils literal notranslate"><span class="pre">edges[i]</span> <span class="pre">=</span> <span class="pre">[a,</span> <span class="pre">b]</span></code> means that there is an edge between <em>node a</em> and <em>node b</em> in the graph.</p>
-<p>You need to return <em>the number of connected components in that graph</em>.</p>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem at hand is to determine the number of connected components in an undirected graph. Here’s a more detailed explanation of the problem:</p>
-<ul class="simple">
-<li><p>You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.</p></li>
-<li><p>A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.</p></li>
-<li><p>Your task is to write a function that takes as input the number of nodes <code class="docutils literal notranslate"><span class="pre">n</span></code> and a list of edges <code class="docutils literal notranslate"><span class="pre">edges</span></code>, where each edge is represented as a pair of nodes <code class="docutils literal notranslate"><span class="pre">[a,</span> <span class="pre">b]</span></code> indicating an edge between node <code class="docutils literal notranslate"><span class="pre">a</span></code> and node <code class="docutils literal notranslate"><span class="pre">b</span></code>.</p></li>
-<li><p>The goal is to determine the number of distinct connected components in the graph.</p></li>
-<li><p>You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.</p></li>
-</ul>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">countConnectedComponents</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">edges</span><span class="p">):</span>
-    <span class="c1"># Define a helper function for depth-first search (DFS).</span>
-    <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">node</span><span class="p">):</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">visited</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span>  <span class="c1"># If the node has not been visited yet:</span>
-            <span class="n">visited</span><span class="p">[</span><span class="n">node</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>  <span class="c1"># Mark it as visited.</span>
-            <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">graph</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span>  <span class="c1"># Explore all neighbors of the current node.</span>
-                <span class="n">dfs</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span>  <span class="c1"># Recursively call DFS on the neighbor.</span>
-
-    <span class="c1"># Create an empty adjacency list to represent the graph.</span>
-    <span class="n">graph</span> <span class="o">=</span> <span class="p">[[]</span> <span class="k">for</span> <span class="n">_</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">)]</span>
-
-    <span class="c1"># Initialize a boolean list to keep track of visited nodes.</span>
-    <span class="n">visited</span> <span class="o">=</span> <span class="p">[</span><span class="kc">False</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span>
-
-    <span class="c1"># Populate the adjacency list with edges from the input.</span>
-    <span class="k">for</span> <span class="n">a</span><span class="p">,</span> <span class="n">b</span> <span class="ow">in</span> <span class="n">edges</span><span class="p">:</span>
-        <span class="n">graph</span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">b</span><span class="p">)</span>
-        <span class="n">graph</span><span class="p">[</span><span class="n">b</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>  <span class="c1"># Since the graph is undirected, we add edges in both directions.</span>
-
-    <span class="c1"># Initialize a counter to keep track of the number of connected components.</span>
-    <span class="n">count</span> <span class="o">=</span> <span class="mi">0</span>
-
-    <span class="c1"># Iterate through all nodes in the graph.</span>
-    <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">visited</span><span class="p">[</span><span class="n">i</span><span class="p">]:</span>  <span class="c1"># If the node has not been visited:</span>
-            <span class="n">count</span> <span class="o">+=</span> <span class="mi">1</span>  <span class="c1"># Increment the count since we&#39;ve found a new connected component.</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>  <span class="c1"># Start a depth-first search from the unvisited node to explore the component.</span>
-
-    <span class="k">return</span> <span class="n">count</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The provided Python code calculates the number of connected components in an undirected graph. Here’s a high-level explanation of how the code works:</p>
-<ol class="arabic simple">
-<li><p>The <code class="docutils literal notranslate"><span class="pre">countConnectedComponents</span></code> function takes two arguments: <code class="docutils literal notranslate"><span class="pre">n</span></code> (the number of nodes in the graph) and <code class="docutils literal notranslate"><span class="pre">edges</span></code> (a list of edge pairs representing connections between nodes).</p></li>
-<li><p>Inside the function, there is a helper function called <code class="docutils literal notranslate"><span class="pre">dfs</span></code> (depth-first search), which is used to explore and mark nodes as visited.</p></li>
-<li><p>An empty adjacency list called <code class="docutils literal notranslate"><span class="pre">graph</span></code> is created to represent the graph. The <code class="docutils literal notranslate"><span class="pre">graph</span></code> is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.</p></li>
-<li><p>Another list called <code class="docutils literal notranslate"><span class="pre">visited</span></code> is created to keep track of visited nodes. Initially, all nodes are marked as not visited (<code class="docutils literal notranslate"><span class="pre">False</span></code>).</p></li>
-<li><p>The code populates the <code class="docutils literal notranslate"><span class="pre">graph</span></code> by iterating through the <code class="docutils literal notranslate"><span class="pre">edges</span></code> list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.</p></li>
-<li><p>A counter variable called <code class="docutils literal notranslate"><span class="pre">count</span></code> is initialized to keep track of the number of connected components.</p></li>
-<li><p>The code iterates through all nodes from <code class="docutils literal notranslate"><span class="pre">0</span></code> to <code class="docutils literal notranslate"><span class="pre">n-1</span></code>. For each node, it checks whether it has been visited yet. If it hasn’t been visited, it means a new connected component is found. The counter <code class="docutils literal notranslate"><span class="pre">count</span></code> is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dfs</span></code> function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling <code class="docutils literal notranslate"><span class="pre">dfs</span></code> on unvisited neighbors.</p></li>
-<li><p>After the loop through all nodes, the <code class="docutils literal notranslate"><span class="pre">count</span></code> variable contains the total number of connected components in the graph.</p></li>
-<li><p>The function returns the value of <code class="docutils literal notranslate"><span class="pre">count</span></code>, which represents the number of connected components.</p></li>
-<li><p>Two examples are provided at the end to demonstrate how to use the function with different inputs.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">n1</span> <span class="o">=</span> <span class="mi">3</span>
-<span class="n">edges1</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="p">[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">2</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">countConnectedComponents</span><span class="p">(</span><span class="n">n1</span><span class="p">,</span> <span class="n">edges1</span><span class="p">))</span>  <span class="c1"># Output: 1</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>1
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">n2</span> <span class="o">=</span> <span class="mi">6</span>
-<span class="n">edges2</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">],</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">],</span> <span class="p">[</span><span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">countConnectedComponents</span><span class="p">(</span><span class="n">n2</span><span class="p">,</span> <span class="n">edges2</span><span class="p">))</span>  <span class="c1"># Output: 2</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>2
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).</p>
-<p><strong>Time Complexity:</strong></p>
-<ul class="simple">
-<li><p>The code iterates through all nodes in the graph (from 0 to <code class="docutils literal notranslate"><span class="pre">n-1</span></code>).</p></li>
-<li><p>For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.</p></li>
-<li><p>In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.</p></li>
-<li><p>The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.</p></li>
-<li><p>In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.</p></li>
-</ul>
-<p>So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.</p>
-<p><strong>Space Complexity:</strong></p>
-<ul class="simple">
-<li><p>The main data structures used are the <code class="docutils literal notranslate"><span class="pre">graph</span></code> (adjacency list), <code class="docutils literal notranslate"><span class="pre">visited</span></code> (boolean array), and the recursive call stack for DFS.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">graph</span></code> has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">visited</span></code> boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.</p></li>
-<li><p>The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.</p></li>
-</ul>
-<p>So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).</p>
-<p>In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m).</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Disconnected Components with Multiple Queries:</strong> You are given an undirected graph with <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes and <code class="docutils literal notranslate"><span class="pre">m</span></code> edges. Initially, the graph is disconnected, and you need to process <code class="docutils literal notranslate"><span class="pre">q</span></code> queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.</p></li>
-<li><p><strong>Maximum Size of Connected Components:</strong> Given an undirected graph with <code class="docutils literal notranslate"><span class="pre">n</span></code> nodes and <code class="docutils literal notranslate"><span class="pre">m</span></code> edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="207.%20Course%20Schedule.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">207. Course Schedule</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="417.%20Pacific%20Atlantic%20Water%20Flow.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">417. Pacific Atlantic Water Flow</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/11. Graphs/417. Pacific Atlantic Water Flow.html b/docs/_build/html/11. Graphs/417. Pacific Atlantic Water Flow.html
deleted file mode 100644
index ad7b711..0000000
--- a/docs/_build/html/11. Graphs/417. Pacific Atlantic Water Flow.html	
+++ /dev/null
@@ -1,757 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>417. Pacific Atlantic Water Flow &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
-    <script defer="defer" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '11. Graphs/417. Pacific Atlantic Water Flow';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Advanced Graphs Problems - Blind 75 LeetCode" href="../12.%20Advanced%20Graphs/README.html" />
-    <link rel="prev" title="3651. Number of Connected Components in an Undirected Graph" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">Graphs Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F11. Graphs/417. Pacific Atlantic Water Flow.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>417. Pacific Atlantic Water Flow</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="pacific-atlantic-water-flow">
-<h1>417. Pacific Atlantic Water Flow<a class="headerlink" href="#pacific-atlantic-water-flow" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/pacific-atlantic-water-flow/">To see the Pacific Atlantic Water Flow problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>There is an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> rectangular island that borders both the <strong>Pacific Ocean</strong> and <strong>Atlantic Ocean</strong>. The <strong>Pacific Ocea</strong>n touches the island’s left and top edges, and the <strong>Atlantic Ocean</strong> touches the island’s right and bottom edges.</p>
-<p>The island is partitioned into a grid of square cells. You are given an <code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">x</span> <span class="pre">n</span></code> integer matrix <code class="docutils literal notranslate"><span class="pre">heights</span></code> where <code class="docutils literal notranslate"><span class="pre">heights[r][c]</span></code> represents the <strong>height above sea level</strong> of the cell at coordinate <code class="docutils literal notranslate"><span class="pre">(r,</span> <span class="pre">c)</span></code>.</p>
-<p>The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell’s height is <strong>less than or equal to</strong> the current cell’s height. Water can flow from any cell adjacent to an ocean into the ocean.</p>
-<p>Return <em>a <strong>2D list</strong> of grid coordinates <code class="docutils literal notranslate"><span class="pre">result</span></code> where <span class="math notranslate nohighlight">\(result[i] = [r_i, c_i]\)</span> denotes that rain water can flow from cell <span class="math notranslate nohighlight">\((r_i, c_i)\)</span> to <strong>both</strong> the Pacific and Atlantic oceans</em>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">m</span> <span class="pre">==</span> <span class="pre">heights.length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">==</span> <span class="pre">heights[r].length</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">m,</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">200</span></code></p></li>
-<li><p>0 &lt;= <code class="docutils literal notranslate"><span class="pre">heights[r][c]</span></code> &lt;= <span class="math notranslate nohighlight">\(10^5\)</span></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island’s left and top edges, while the Atlantic Ocean is in contact with the island’s right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.</p>
-<p>Here are the key details and constraints of the problem:</p>
-<ol class="arabic simple">
-<li><p>The island is divided into a grid of square cells.</p></li>
-<li><p>Each cell is represented by an integer value in a matrix <code class="docutils literal notranslate"><span class="pre">heights</span></code>. The value at <code class="docutils literal notranslate"><span class="pre">heights[r][c]</span></code> represents the height above sea level of the cell at coordinates <code class="docutils literal notranslate"><span class="pre">(r,</span> <span class="pre">c)</span></code> on the island.</p></li>
-<li><p>Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell’s height is less than or equal to the current cell’s height.</p></li>
-<li><p>Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.</p></li>
-</ol>
-<p>The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.</p>
-<p>The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.</p>
-<p>The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">pacificAtlantic</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">heights</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">]])</span> <span class="o">-&gt;</span> <span class="n">List</span><span class="p">[</span><span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">]]:</span>
-        <span class="c1"># Check if the input matrix is empty</span>
-        <span class="k">if</span> <span class="ow">not</span> <span class="n">heights</span><span class="p">:</span>
-            <span class="k">return</span> <span class="p">[]</span>
-        
-        <span class="n">m</span><span class="p">,</span> <span class="n">n</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">heights</span><span class="p">),</span> <span class="nb">len</span><span class="p">(</span><span class="n">heights</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
-        
-        <span class="c1"># Initialize boolean matrices to keep track of cells reachable from each ocean</span>
-        <span class="n">pacific_reachable</span> <span class="o">=</span> <span class="p">[[</span><span class="kc">False</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span> <span class="k">for</span> <span class="n">_</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">)]</span>
-        <span class="n">atlantic_reachable</span> <span class="o">=</span> <span class="p">[[</span><span class="kc">False</span><span class="p">]</span> <span class="o">*</span> <span class="n">n</span> <span class="k">for</span> <span class="n">_</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">)]</span>
-        
-        <span class="c1"># Depth-First Search (DFS) function to mark cells that can be reached from an ocean</span>
-        <span class="k">def</span> <span class="nf">dfs</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">reachable</span><span class="p">):</span>
-            <span class="k">if</span> <span class="n">reachable</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]:</span>
-                <span class="k">return</span>
-            <span class="n">reachable</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
-            <span class="k">for</span> <span class="n">dx</span><span class="p">,</span> <span class="n">dy</span> <span class="ow">in</span> <span class="p">[(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">),</span> <span class="p">(</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">)]:</span>
-                <span class="n">new_x</span><span class="p">,</span> <span class="n">new_y</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">dx</span><span class="p">,</span> <span class="n">y</span> <span class="o">+</span> <span class="n">dy</span>
-                <span class="k">if</span> <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">new_x</span> <span class="o">&lt;</span> <span class="n">m</span> <span class="ow">and</span> <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">new_y</span> <span class="o">&lt;</span> <span class="n">n</span> <span class="ow">and</span> <span class="n">heights</span><span class="p">[</span><span class="n">new_x</span><span class="p">][</span><span class="n">new_y</span><span class="p">]</span> <span class="o">&gt;=</span> <span class="n">heights</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]:</span>
-                    <span class="n">dfs</span><span class="p">(</span><span class="n">new_x</span><span class="p">,</span> <span class="n">new_y</span><span class="p">,</span> <span class="n">reachable</span><span class="p">)</span>
-        
-        <span class="c1"># Start DFS from the Pacific Ocean (left and top edges)</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">):</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="n">pacific_reachable</span><span class="p">)</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">atlantic_reachable</span><span class="p">)</span>
-        
-        <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">pacific_reachable</span><span class="p">)</span>
-            <span class="n">dfs</span><span class="p">(</span><span class="n">m</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="n">j</span><span class="p">,</span> <span class="n">atlantic_reachable</span><span class="p">)</span>
-        
-        <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span>
-        
-        <span class="c1"># Find cells that can flow to both the Pacific and Atlantic oceans</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">m</span><span class="p">):</span>
-            <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n</span><span class="p">):</span>
-                <span class="k">if</span> <span class="n">pacific_reachable</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]</span> <span class="ow">and</span> <span class="n">atlantic_reachable</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">j</span><span class="p">]:</span>
-                    <span class="n">result</span><span class="o">.</span><span class="n">append</span><span class="p">([</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">])</span>
-        
-        <span class="k">return</span> <span class="n">result</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code defines a class called <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method named <code class="docutils literal notranslate"><span class="pre">pacificAtlantic</span></code>. This method takes a 2D matrix <code class="docutils literal notranslate"><span class="pre">heights</span></code>, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.</p>
-<p>The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, <code class="docutils literal notranslate"><span class="pre">pacific_reachable</span></code> and <code class="docutils literal notranslate"><span class="pre">atlantic_reachable</span></code>, to keep track of cells that can be reached from each ocean.</p>
-<p>The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell’s height is less than or equal to the current cell’s height.</p>
-<p>After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the <code class="docutils literal notranslate"><span class="pre">result</span></code> list.</p>
-<p>Finally, the code returns the <code class="docutils literal notranslate"><span class="pre">result</span></code> list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.</p>
-<p>The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1</span>
-<span class="n">heights1</span> <span class="o">=</span> <span class="p">[</span>
-    <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">],</span>
-    <span class="p">[</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">4</span><span class="p">],</span>
-    <span class="p">[</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">],</span>
-    <span class="p">[</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">],</span>
-    <span class="p">[</span><span class="mi">5</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">]</span>
-<span class="p">]</span>
-
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">pacificAtlantic</span><span class="p">(</span><span class="n">heights1</span><span class="p">))</span> <span class="c1"># Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2</span>
-<span class="n">heights2</span> <span class="o">=</span> <span class="p">[[</span><span class="mi">1</span><span class="p">]]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">pacificAtlantic</span><span class="p">(</span><span class="n">heights2</span><span class="p">))</span> <span class="c1"># Expected Output: [[0, 0]]</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[[0, 0]]
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Time Complexity:
-The time complexity of this solution is O(m * n), where ‘m’ is the number of rows in the input matrix and ‘n’ is the number of columns. Here’s a breakdown of the time complexity:</p>
-<ol class="arabic simple">
-<li><p>Creating the <code class="docutils literal notranslate"><span class="pre">pacific_reachable</span></code> and <code class="docutils literal notranslate"><span class="pre">atlantic_reachable</span></code> matrices with dimensions m x n takes O(m * n) time.</p></li>
-<li><p>Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.</p></li>
-<li><p>The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.</p></li>
-<li><p>The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.</p></li>
-</ol>
-<p>Overall, the time complexity is dominated by the DFS and is O(m * n).</p>
-<p>Space Complexity:
-The space complexity of this solution is also O(m * n). Here’s how the space is used:</p>
-<ol class="arabic simple">
-<li><p>Two boolean matrices, <code class="docutils literal notranslate"><span class="pre">pacific_reachable</span></code> and <code class="docutils literal notranslate"><span class="pre">atlantic_reachable</span></code>, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.</p></li>
-<li><p>The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">result</span></code> list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.</p></li>
-</ol>
-<p>The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n).</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimization Challenge:</strong> Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.</p></li>
-<li><p><strong>Efficiency Challenge:</strong> Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./11. Graphs"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">3651. Number of Connected Components in an Undirected Graph</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../12.%20Advanced%20Graphs/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Advanced Graphs Problems - Blind 75 LeetCode</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/13. One-D Dynamic Programming/213. House Robber II.html b/docs/_build/html/13. One-D Dynamic Programming/213. House Robber II.html
deleted file mode 100644
index f095313..0000000
--- a/docs/_build/html/13. One-D Dynamic Programming/213. House Robber II.html	
+++ /dev/null
@@ -1,765 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>House Robber II &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '13. One-D Dynamic Programming/213. House Robber II';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Blind 75 LeetCode Problems" href="../14.%20Two-D%20Dynamic%20Programming/README.html" />
-    <link rel="prev" title="House Robber" href="198.%20House%20Robber.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2"><a class="reference internal" href="70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F13. One-D Dynamic Programming/213. House Robber II.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>House Robber II</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity:</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity:</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="house-robber-ii">
-<h1>House Robber II<a class="headerlink" href="#house-robber-ii" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Medium</p>
-<hr class="docutils" />
-<p>You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are <strong>arranged in a circle</strong>. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and <strong>it will automatically contact the police if two adjacent houses were broken into on the same night</strong>.</p>
-<p>Given an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code> representing the amount of money of each house, return <em>the maximum amount of money you can rob tonight without alerting the police</em>.</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">nums.length</span> <span class="pre">&lt;=</span> <span class="pre">100</span></code></p></li>
-<li><p><code class="docutils literal notranslate"><span class="pre">0</span> <span class="pre">&lt;=</span> <span class="pre">nums[i]</span> <span class="pre">&lt;=</span> <span class="pre">1000</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>Certainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.</p>
-<p>The twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.</p>
-<p>The goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array <code class="docutils literal notranslate"><span class="pre">nums</span></code> representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.</p>
-<p>Here are a few examples to illustrate the problem:</p>
-<ol class="arabic">
-<li><p><strong>Example 1:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="n">Output</span><span class="p">:</span> <span class="mi">3</span>
-<span class="n">Explanation</span><span class="p">:</span> <span class="n">You</span> <span class="n">cannot</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">1</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">2</span><span class="p">)</span> <span class="ow">and</span> <span class="n">then</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">3</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">2</span><span class="p">)</span> <span class="n">because</span> <span class="n">they</span> <span class="n">are</span> <span class="n">adjacent</span> <span class="n">houses</span><span class="o">.</span> <span class="n">The</span> <span class="n">optimal</span> <span class="n">strategy</span> <span class="ow">is</span> <span class="n">to</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">2</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">3</span><span class="p">)</span><span class="o">.</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Example 2:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="n">Output</span><span class="p">:</span> <span class="mi">4</span>
-<span class="n">Explanation</span><span class="p">:</span> <span class="n">Robbing</span> <span class="n">house</span> <span class="mi">1</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">1</span><span class="p">)</span> <span class="ow">and</span> <span class="n">then</span> <span class="n">robbing</span> <span class="n">house</span> <span class="mi">3</span> <span class="p">(</span><span class="n">money</span> <span class="o">=</span> <span class="mi">3</span><span class="p">)</span> <span class="n">results</span> <span class="ow">in</span> <span class="n">a</span> <span class="n">total</span> <span class="n">amount</span> <span class="n">of</span> <span class="mf">4.</span> <span class="n">Robbing</span> <span class="n">house</span> <span class="mi">2</span> <span class="ow">is</span> <span class="n">skipped</span> <span class="n">to</span> <span class="n">avoid</span> <span class="n">alerting</span> <span class="n">the</span> <span class="n">police</span><span class="o">.</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Example 3:</strong></p>
-<div class="highlight-python notranslate"><div class="highlight"><pre><span></span><span class="n">Input</span><span class="p">:</span> <span class="n">nums</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">]</span>
-<span class="n">Output</span><span class="p">:</span> <span class="mi">3</span>
-<span class="n">Explanation</span><span class="p">:</span> <span class="n">Since</span> <span class="n">the</span> <span class="n">houses</span> <span class="n">are</span> <span class="ow">in</span> <span class="n">a</span> <span class="n">circle</span><span class="p">,</span> <span class="n">you</span> <span class="n">can</span> <span class="n">choose</span> <span class="n">either</span> <span class="n">house</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="ow">or</span> <span class="mf">3.</span> <span class="n">The</span> <span class="n">optimal</span> <span class="n">strategy</span> <span class="ow">is</span> <span class="n">to</span> <span class="n">rob</span> <span class="n">house</span> <span class="mi">3</span> <span class="k">for</span> <span class="n">a</span> <span class="n">total</span> <span class="n">amount</span> <span class="n">of</span> <span class="mf">3.</span>
-</pre></div>
-</div>
-</li>
-</ol>
-<p>The constraints for the problem are that the length of the <code class="docutils literal notranslate"><span class="pre">nums</span></code> array is between 1 and 100, and the amount of money in each house (<code class="docutils literal notranslate"><span class="pre">nums[i]</span></code>) is between 0 and 1000.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">typing</span> <span class="kn">import</span> <span class="n">List</span>
-
-<span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">rob</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">nums</span><span class="p">:</span> <span class="n">List</span><span class="p">[</span><span class="nb">int</span><span class="p">])</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
-        <span class="k">def</span> <span class="nf">simple_rob</span><span class="p">(</span><span class="n">nums</span><span class="p">):</span>
-            <span class="c1"># Helper function for basic house robbery problem</span>
-            <span class="n">prev</span><span class="p">,</span> <span class="n">curr</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span>
-            <span class="k">for</span> <span class="n">num</span> <span class="ow">in</span> <span class="n">nums</span><span class="p">:</span>
-                <span class="c1"># Calculate the maximum amount of money that can be robbed</span>
-                <span class="c1"># without alerting the police for each house</span>
-                <span class="n">prev</span><span class="p">,</span> <span class="n">curr</span> <span class="o">=</span> <span class="n">curr</span><span class="p">,</span> <span class="nb">max</span><span class="p">(</span><span class="n">prev</span> <span class="o">+</span> <span class="n">num</span><span class="p">,</span> <span class="n">curr</span><span class="p">)</span>
-            <span class="k">return</span> <span class="n">curr</span>
-
-        <span class="c1"># Check the base cases where the length of nums is 1 or 2</span>
-        <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">nums</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
-        <span class="k">elif</span> <span class="nb">len</span><span class="p">(</span><span class="n">nums</span><span class="p">)</span> <span class="o">==</span> <span class="mi">2</span><span class="p">:</span>
-            <span class="k">return</span> <span class="nb">max</span><span class="p">(</span><span class="n">nums</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">nums</span><span class="p">[</span><span class="mi">1</span><span class="p">])</span>
-
-        <span class="c1"># Case 1: First house is robbed, last house is not</span>
-        <span class="n">case1</span> <span class="o">=</span> <span class="n">simple_rob</span><span class="p">(</span><span class="n">nums</span><span class="p">[:</span><span class="o">-</span><span class="mi">1</span><span class="p">])</span>
-
-        <span class="c1"># Case 2: First house is not robbed, last house is</span>
-        <span class="n">case2</span> <span class="o">=</span> <span class="n">simple_rob</span><span class="p">(</span><span class="n">nums</span><span class="p">[</span><span class="mi">1</span><span class="p">:])</span>
-
-        <span class="c1"># Maximum of the two cases</span>
-        <span class="k">return</span> <span class="nb">max</span><span class="p">(</span><span class="n">case1</span><span class="p">,</span> <span class="n">case2</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The provided code defines a class <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method <code class="docutils literal notranslate"><span class="pre">rob</span></code>, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.</p>
-<p>The code uses dynamic programming to solve the problem efficiently. It contains a helper function <code class="docutils literal notranslate"><span class="pre">simple_rob</span></code> that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method <code class="docutils literal notranslate"><span class="pre">rob</span></code> handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.</p>
-<p>The class is instantiated as <code class="docutils literal notranslate"><span class="pre">solution</span></code>, and the <code class="docutils literal notranslate"><span class="pre">rob</span></code> method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system.</p>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-
-<span class="c1"># Create an instance of the Solution class</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-
-<span class="n">nums1</span> <span class="o">=</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">rob</span><span class="p">(</span><span class="n">nums1</span><span class="p">))</span>  <span class="c1"># Output: 3</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums2</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">rob</span><span class="p">(</span><span class="n">nums2</span><span class="p">))</span>  <span class="c1"># Output: 4</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>4
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">nums3</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">]</span>
-<span class="nb">print</span><span class="p">(</span><span class="n">solution</span><span class="o">.</span><span class="n">rob</span><span class="p">(</span><span class="n">nums3</span><span class="p">))</span>  <span class="c1"># Output: 3</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>3
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Let’s analyze the time and space complexity of the provided code:</p>
-<section id="time-complexity">
-<h3>Time Complexity:<a class="headerlink" href="#time-complexity" title="Permalink to this heading">#</a></h3>
-<p>The time complexity is primarily determined by the <code class="docutils literal notranslate"><span class="pre">simple_rob</span></code> helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main <code class="docutils literal notranslate"><span class="pre">rob</span></code> function calls <code class="docutils literal notranslate"><span class="pre">simple_rob</span></code> twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).</p>
-</section>
-<section id="space-complexity">
-<h3>Space Complexity:<a class="headerlink" href="#space-complexity" title="Permalink to this heading">#</a></h3>
-<p>The space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are <code class="docutils literal notranslate"><span class="pre">prev</span></code> and <code class="docutils literal notranslate"><span class="pre">curr</span></code> in the <code class="docutils literal notranslate"><span class="pre">simple_rob</span></code> function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).</p>
-<p>In summary:</p>
-<ul class="simple">
-<li><p>Time Complexity: O(N)</p></li>
-<li><p>Space Complexity: O(1)</p></li>
-</ul>
-</section>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Optimization Challenge:</strong> Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?</p></li>
-<li><p><strong>Circular Robbery Variations:</strong> Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.</p></li>
-</ol>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/house-robber-ii/">To see the House Robber II problem on LeetCode, click here!</a></p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./13. One-D Dynamic Programming"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="198.%20House%20Robber.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">House Robber</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../14.%20Two-D%20Dynamic%20Programming/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#time-complexity">Time Complexity:</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#space-complexity">Space Complexity:</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html b/docs/_build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html
deleted file mode 100644
index c12bd86..0000000
--- a/docs/_build/html/13. One-D Dynamic Programming/70. Climbing Stairs.html	
+++ /dev/null
@@ -1,717 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>70. Climbing Stairs &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '13. One-D Dynamic Programming/70. Climbing Stairs';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="House Robber" href="198.%20House%20Robber.html" />
-    <link rel="prev" title="1-D Dynamic Programming Problems - Blind 75 LeetCode" href="README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="reference internal" href="README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul class="current">
-<li class="toctree-l2 current active"><a class="current reference internal" href="#">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F13. One-D Dynamic Programming/70. Climbing Stairs.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>70. Climbing Stairs</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="climbing-stairs">
-<h1>70. Climbing Stairs<a class="headerlink" href="#climbing-stairs" title="Permalink to this heading">#</a></h1>
-<p><strong>Difficulty:</strong> Easy</p>
-<p><strong>Link to Problem:</strong> <a class="reference external" href="https://leetcode.com/problems/climbing-stairs/">To see the Climbing Stairs problem on LeetCode, click here!</a></p>
-<hr class="docutils" />
-<p>You are climbing a staircase. It takes <code class="docutils literal notranslate"><span class="pre">n</span></code> steps to reach the top.</p>
-<p>Each time you can either climb <code class="docutils literal notranslate"><span class="pre">1</span></code> or <code class="docutils literal notranslate"><span class="pre">2</span></code> steps. In how many distinct ways can you climb to the top?</p>
-<p><strong>Constraints:</strong></p>
-<ul class="simple">
-<li><p><code class="docutils literal notranslate"><span class="pre">1</span> <span class="pre">&lt;=</span> <span class="pre">n</span> <span class="pre">&lt;=</span> <span class="pre">45</span></code></p></li>
-</ul>
-<section id="probelm-explanation">
-<h2>Probelm Explanation:<a class="headerlink" href="#probelm-explanation" title="Permalink to this heading">#</a></h2>
-<p>The “Climbing Stairs” problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here’s the problem statement:</p>
-<p>You are given a staircase with ‘n’ steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.</p>
-<p>For example, if ‘n’ is 2, there are two ways to climb to the top:</p>
-<ol class="arabic simple">
-<li><p>Climbing two steps at once.</p></li>
-<li><p>Climbing one step, and then another step.</p></li>
-</ol>
-<p>If ‘n’ is 3, there are three ways:</p>
-<ol class="arabic simple">
-<li><p>Climbing one step, then one step, and finally one step.</p></li>
-<li><p>Climbing one step, then two steps.</p></li>
-<li><p>Climbing two steps, then one step.</p></li>
-</ol>
-<p>The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It’s a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.</p>
-</section>
-<section id="solution">
-<h2>Solution:<a class="headerlink" href="#solution" title="Permalink to this heading">#</a></h2>
-<p>Here’s a Python function to implement this algorithm:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="k">class</span> <span class="nc">Solution</span><span class="p">:</span>
-    <span class="k">def</span> <span class="nf">climbStairs</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">n</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="nb">int</span><span class="p">:</span>
-        <span class="c1"># If there are 1 or 2 steps, there are exactly n ways to reach the top.</span>
-        <span class="k">if</span> <span class="n">n</span> <span class="o">&lt;=</span> <span class="mi">2</span><span class="p">:</span>
-            <span class="k">return</span> <span class="n">n</span>
-
-        <span class="c1"># Create an array to store the number of ways to reach each step.</span>
-        <span class="n">dp</span> <span class="o">=</span> <span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">n</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-
-        <span class="c1"># There is one way to reach the first step (base case).</span>
-        <span class="n">dp</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span>
-
-        <span class="c1"># There are two ways to reach the second step (base case).</span>
-        <span class="n">dp</span><span class="p">[</span><span class="mi">2</span><span class="p">]</span> <span class="o">=</span> <span class="mi">2</span>
-
-        <span class="c1"># Calculate the number of ways to reach each step from the previous steps.</span>
-        <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">n</span> <span class="o">+</span> <span class="mi">1</span><span class="p">):</span>
-            <span class="c1"># The number of ways to reach step &#39;i&#39; is the sum of the ways to reach</span>
-            <span class="c1"># the previous two steps, as you can take 1 or 2 steps at a time.</span>
-            <span class="n">dp</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">dp</span><span class="p">[</span><span class="n">i</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]</span> <span class="o">+</span> <span class="n">dp</span><span class="p">[</span><span class="n">i</span> <span class="o">-</span> <span class="mi">2</span><span class="p">]</span>
-
-        <span class="c1"># The result is the number of ways to reach the top, which is stored in dp[n].</span>
-        <span class="k">return</span> <span class="n">dp</span><span class="p">[</span><span class="n">n</span><span class="p">]</span>
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="explanation">
-<h2>Explanation:<a class="headerlink" href="#explanation" title="Permalink to this heading">#</a></h2>
-<p>The code defines a class <code class="docutils literal notranslate"><span class="pre">Solution</span></code> with a method <code class="docutils literal notranslate"><span class="pre">climbStairs</span></code> that takes an integer <code class="docutils literal notranslate"><span class="pre">n</span></code> as input and returns the number of distinct ways to climb a staircase with <code class="docutils literal notranslate"><span class="pre">n</span></code> steps.</p>
-<ol class="arabic simple">
-<li><p>If <code class="docutils literal notranslate"><span class="pre">n</span></code> is 1 or 2, the function returns <code class="docutils literal notranslate"><span class="pre">n</span></code> directly because there are only 1 or 2 distinct ways to reach the top in those cases.</p></li>
-<li><p>For <code class="docutils literal notranslate"><span class="pre">n</span></code> greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array <code class="docutils literal notranslate"><span class="pre">dp</span></code> of length <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">+</span> <span class="pre">1</span></code> to store these values.</p></li>
-<li><p>The <code class="docutils literal notranslate"><span class="pre">dp[1]</span></code> and <code class="docutils literal notranslate"><span class="pre">dp[2]</span></code> are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).</p></li>
-<li><p>The code then uses a loop to fill in the <code class="docutils literal notranslate"><span class="pre">dp</span></code> array for steps 3 and above. For each step <code class="docutils literal notranslate"><span class="pre">i</span></code> from 3 to <code class="docutils literal notranslate"><span class="pre">n</span></code>, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.</p></li>
-<li><p>Finally, the function returns the value stored in <code class="docutils literal notranslate"><span class="pre">dp[n]</span></code>, which represents the total number of distinct ways to climb the staircase with <code class="docutils literal notranslate"><span class="pre">n</span></code> steps.</p></li>
-</ol>
-</section>
-<section id="test-cases">
-<h2>Test cases:<a class="headerlink" href="#test-cases" title="Permalink to this heading">#</a></h2>
-<p>Here’s how you can use this solution:</p>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 1:</span>
-<span class="n">n</span> <span class="o">=</span> <span class="mi">2</span>
-<span class="n">solution</span> <span class="o">=</span> <span class="n">Solution</span><span class="p">()</span>
-<span class="nb">print</span><span class="p">(</span><span class="sa">f</span><span class="s2">&quot;Example 1 - Input: n = </span><span class="si">{</span><span class="n">n</span><span class="si">}</span><span class="s2">, Output: </span><span class="si">{</span><span class="n">solution</span><span class="o">.</span><span class="n">climbStairs</span><span class="p">(</span><span class="n">n</span><span class="p">)</span><span class="si">}</span><span class="s2">&quot;</span><span class="p">)</span>  <span class="c1"># Output should be 2</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Example 1 - Input: n = 2, Output: 2
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="c1"># Example 2:</span>
-<span class="n">n</span> <span class="o">=</span> <span class="mi">3</span>
-<span class="nb">print</span><span class="p">(</span><span class="sa">f</span><span class="s2">&quot;Example 2 - Input: n = </span><span class="si">{</span><span class="n">n</span><span class="si">}</span><span class="s2">, Output: </span><span class="si">{</span><span class="n">solution</span><span class="o">.</span><span class="n">climbStairs</span><span class="p">(</span><span class="n">n</span><span class="p">)</span><span class="si">}</span><span class="s2">&quot;</span><span class="p">)</span>  <span class="c1"># Output should be 3</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Example 2 - Input: n = 3, Output: 3
-</pre></div>
-</div>
-</div>
-</div>
-</section>
-<section id="time-and-space-complexity-analysis">
-<h2>Time and Space Complexity Analysis<a class="headerlink" href="#time-and-space-complexity-analysis" title="Permalink to this heading">#</a></h2>
-<p>Time Complexity:
-The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the <code class="docutils literal notranslate"><span class="pre">dp</span></code> array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value <code class="docutils literal notranslate"><span class="pre">n</span></code>.</p>
-<p>Space Complexity:
-The space complexity of the solution is O(n) as well. We use an array <code class="docutils literal notranslate"><span class="pre">dp</span></code> of length <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">+</span> <span class="pre">1</span></code> to store the number of ways to reach each step. The size of this array is directly proportional to the input value <code class="docutils literal notranslate"><span class="pre">n</span></code>, which makes the space complexity linear in terms of <code class="docutils literal notranslate"><span class="pre">n</span></code>. The rest of the variables used in the function (e.g., <code class="docutils literal notranslate"><span class="pre">i</span></code>) occupy constant space and do not contribute significantly to the overall space complexity.</p>
-<p>In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the “Climbing Stairs” problem.</p>
-</section>
-<section id="challenging-exercises">
-<h2>Challenging Exercises:<a class="headerlink" href="#challenging-exercises" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p><strong>Generalized Step Sizes</strong>: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes <code class="docutils literal notranslate"><span class="pre">[1,</span> <span class="pre">2,</span> <span class="pre">3]</span></code>. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.</p></li>
-<li><p><strong>Minimize Steps</strong>: Given an integer <code class="docutils literal notranslate"><span class="pre">n</span></code>, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken.</p></li>
-</ol>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python",
-            path: "./13. One-D Dynamic Programming"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">1-D Dynamic Programming Problems - Blind 75 LeetCode</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="198.%20House%20Robber.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">House Robber</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#probelm-explanation">Probelm Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#solution">Solution:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#explanation">Explanation:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#test-cases">Test cases:</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#time-and-space-complexity-analysis">Time and Space Complexity Analysis</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#challenging-exercises">Challenging Exercises:</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/13. One-D Dynamic Programming/README.html b/docs/_build/html/13. One-D Dynamic Programming/README.html
deleted file mode 100644
index 88ff6a7..0000000
--- a/docs/_build/html/13. One-D Dynamic Programming/README.html	
+++ /dev/null
@@ -1,644 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>1-D Dynamic Programming Problems - Blind 75 LeetCode &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '13. One-D Dynamic Programming/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="70. Climbing Stairs" href="70.%20Climbing%20Stairs.html" />
-    <link rel="prev" title="892. Alien Dictionary" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F13. One-D Dynamic Programming/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/13. One-D Dynamic Programming/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>1-D Dynamic Programming Problems - Blind 75 LeetCode</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="d-dynamic-programming-problems-blind-75-leetcode">
-<h1>1-D Dynamic Programming Problems - Blind 75 LeetCode<a class="headerlink" href="#d-dynamic-programming-problems-blind-75-leetcode" title="Permalink to this heading">#</a></h1>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/climbing-stairs/">70. Climbing Stairs</a></p></td>
-<td><p>Easy</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/house-robber/">198. House Robber</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/house-robber-ii/">213. House Robber II</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-palindromic-substring/">5. Longest Palindromic Substring</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/palindromic-substrings/">647. Palindromic Substrings</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/decode-ways/">91. Decode Ways</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/coin-change/">322. Coin Change</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/maximum-product-subarray/">152. Maximum Product Subarray</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/word-break/">139. Word Break</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/longest-increasing-subsequence/">300. Longest Increasing Subsequence</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-<p>Happy coding!</p>
-</section>
-<div class="toctree-wrapper compound">
-</div>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./13. One-D Dynamic Programming"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">892. Alien Dictionary</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="70.%20Climbing%20Stairs.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">70. Climbing Stairs</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/17. Math Geometry/README.html b/docs/_build/html/17. Math Geometry/README.html
deleted file mode 100644
index f840c85..0000000
--- a/docs/_build/html/17. Math Geometry/README.html	
+++ /dev/null
@@ -1,664 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Blind 75 LeetCode Problems &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="../_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="../_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
-    <link rel="stylesheet" href="../_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="../_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="../_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="../_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
-    <script src="../_static/jquery.js"></script>
-    <script src="../_static/underscore.js"></script>
-    <script src="../_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="../_static/doctools.js"></script>
-    <script src="../_static/clipboard.min.js"></script>
-    <script src="../_static/copybutton.js"></script>
-    <script src="../_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="../_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="../_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="../_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = '17. Math Geometry/README';</script>
-    <link rel="index" title="Index" href="../genindex.html" />
-    <link rel="search" title="Search" href="../search.html" />
-    <link rel="next" title="Blind 75 LeetCode Problems" href="../18.%20Bit%20Manipulation/README.html" />
-    <link rel="prev" title="Blind 75 LeetCode Problems" href="../16.%20Intervals/README.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="../search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="../README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="../README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="current nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="../13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="../14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1 current active"><a class="current reference internal" href="#">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="../18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2F17. Math Geometry/README.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="../_sources/17. Math Geometry/README.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Blind 75 LeetCode Problems</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#math-geometry">Math &amp; Geometry</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="blind-75-leetcode-problems">
-<h1>Blind 75 LeetCode Problems<a class="headerlink" href="#blind-75-leetcode-problems" title="Permalink to this heading">#</a></h1>
-<p>This repository contains a curated list of 75 LeetCode problems that are commonly known as the “Blind 75.” These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.</p>
-<section id="problem-list">
-<h2>Problem List<a class="headerlink" href="#problem-list" title="Permalink to this heading">#</a></h2>
-<section id="math-geometry">
-<h3>Math &amp; Geometry<a class="headerlink" href="#math-geometry" title="Permalink to this heading">#</a></h3>
-<table class="table">
-<thead>
-<tr class="row-odd"><th class="head"><p>Problem Name</p></th>
-<th class="head"><p>Difficulty</p></th>
-</tr>
-</thead>
-<tbody>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/rotate-image/">48. Rotate Image</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-odd"><td><p><a class="reference external" href="https://leetcode.com/problems/spiral-matrix/">54. Spiral Matrix</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-<tr class="row-even"><td><p><a class="reference external" href="https://leetcode.com/problems/set-matrix-zeroes/">73. Set Matrix Zeroes</a></p></td>
-<td><p>Medium</p></td>
-</tr>
-</tbody>
-</table>
-</section>
-</section>
-<section id="how-to-use">
-<h2>How to Use<a class="headerlink" href="#how-to-use" title="Permalink to this heading">#</a></h2>
-<ol class="arabic simple">
-<li><p>Clone or download this repository to your local machine.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>git<span class="w"> </span>clone<span class="w"> </span>https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-</pre></div>
-</div>
-<ol class="arabic simple" start="2">
-<li><p>Navigate to the directory of the specific problem you want to solve.</p></li>
-</ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span><span class="nb">cd</span><span class="w"> </span>Blind-75-LeetCode/Problem-Directory
-</pre></div>
-</div>
-<ol class="arabic simple" start="3">
-<li><p>Open the problem’s directory to find its description, code template, and solution(s).</p></li>
-<li><p>Solve the problem using your preferred programming language.</p></li>
-<li><p>Check the solution(s) provided in the directory for reference and to compare your solution.</p></li>
-</ol>
-</section>
-<section id="contribute">
-<h2>Contribute<a class="headerlink" href="#contribute" title="Permalink to this heading">#</a></h2>
-<p>If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.</p>
-</section>
-<section id="resources">
-<h2>Resources<a class="headerlink" href="#resources" title="Permalink to this heading">#</a></h2>
-<ul class="simple">
-<li><p><a class="reference external" href="https://leetcode.com/">LeetCode</a>: The official LeetCode website.</p></li>
-<li><p><a class="reference external" href="https://leetcode.com/discuss/">LeetCode Discuss</a>: LeetCode’s discussion forum for each problem. You can find helpful hints and discussions here.</p></li>
-</ul>
-</section>
-<section id="disclaimer">
-<h2>Disclaimer<a class="headerlink" href="#disclaimer" title="Permalink to this heading">#</a></h2>
-<p>This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode’s terms of use and guidelines when using this repository.</p>
-<p>Happy coding!</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./17. Math Geometry"
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-    <a class="left-prev"
-       href="../16.%20Intervals/README.html"
-       title="previous page">
-      <i class="fa-solid fa-angle-left"></i>
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">previous</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-    </a>
-    <a class="right-next"
-       href="../18.%20Bit%20Manipulation/README.html"
-       title="next page">
-      <div class="prev-next-info">
-        <p class="prev-next-subtitle">next</p>
-        <p class="prev-next-title">Blind 75 LeetCode Problems</p>
-      </div>
-      <i class="fa-solid fa-angle-right"></i>
-    </a>
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#problem-list">Problem List</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#math-geometry">Math &amp; Geometry</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#how-to-use">How to Use</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contribute">Contribute</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#resources">Resources</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#disclaimer">Disclaimer</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="../_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="../_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/Book.html b/docs/_build/html/Book.html
deleted file mode 100644
index b11e1fe..0000000
--- a/docs/_build/html/Book.html
+++ /dev/null
@@ -1,1151 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>&lt;no title&gt; &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'Book';</script>
-    <link rel="index" title="Index" href="genindex.html" />
-    <link rel="search" title="Search" href="search.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2FBook.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="_sources/Book.ipynb" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.ipynb</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1><no title></h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="simple visible nav section-nav flex-column">
-</ul>
-
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>python<span class="w"> </span>-m<span class="w"> </span>pip<span class="w"> </span>install<span class="w"> </span>--upgrade<span class="w"> </span>pip
-<span class="o">%</span><span class="k">pip</span> install jupyter-book
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: pip in /usr/local/python/3.10.8/lib/python3.10/site-packages (23.3.1)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: jupyter-book in /usr/local/python/3.10.8/lib/python3.10/site-packages (0.15.1)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: click&lt;9,&gt;=7.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (8.1.7)
-Requirement already satisfied: docutils&lt;0.19,&gt;=0.15 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.18.1)
-Requirement already satisfied: Jinja2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (3.1.2)
-Requirement already satisfied: jsonschema&lt;5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (4.19.1)
-Requirement already satisfied: linkify-it-py~=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.0.2)
-Requirement already satisfied: myst-nb~=0.17.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.17.2)
-Requirement already satisfied: pyyaml in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (6.0.1)
-Requirement already satisfied: sphinx&lt;6,&gt;=4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (5.0.2)
-Requirement already satisfied: sphinx-comments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.0.3)
-Requirement already satisfied: sphinx-copybutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)
-Requirement already satisfied: sphinx-external-toc~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.1)
-Requirement already satisfied: sphinx-jupyterbook-latex~=0.5.2 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)
-Requirement already satisfied: sphinx-design~=0.3.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.0)
-Requirement already satisfied: sphinx-thebe~=0.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.2.1)
-Requirement already satisfied: sphinx-book-theme~=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (1.0.1)
-Requirement already satisfied: sphinx_togglebutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.2)
-Requirement already satisfied: sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.5.0)
-Requirement already satisfied: sphinx-multitoc-numbering~=0.1.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.1.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: attrs&gt;=22.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema&lt;5-&gt;jupyter-book) (23.1.0)
-Requirement already satisfied: jsonschema-specifications&gt;=2023.03.6 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema&lt;5-&gt;jupyter-book) (2023.7.1)
-Requirement already satisfied: referencing&gt;=0.28.4 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema&lt;5-&gt;jupyter-book) (0.30.2)
-Requirement already satisfied: rpds-py&gt;=0.7.1 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema&lt;5-&gt;jupyter-book) (0.10.6)
-Requirement already satisfied: uc-micro-py in /usr/local/python/3.10.8/lib/python3.10/site-packages (from linkify-it-py~=2.0.0-&gt;jupyter-book) (1.0.2)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: importlib_metadata in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (6.8.0)
-Requirement already satisfied: ipython in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (8.16.1)
-Requirement already satisfied: jupyter-cache&lt;0.7,&gt;=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (0.6.1)
-Requirement already satisfied: nbclient in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (0.7.4)
-Requirement already satisfied: myst-parser~=0.18.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (0.18.1)
-Requirement already satisfied: nbformat~=5.0 in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (5.9.2)
-Requirement already satisfied: typing-extensions in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (4.8.0)
-Requirement already satisfied: ipykernel in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1-&gt;jupyter-book) (6.25.2)
-Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.7)
-Requirement already satisfied: sphinxcontrib-devhelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.5)
-Requirement already satisfied: sphinxcontrib-jsmath in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.1)
-Requirement already satisfied: sphinxcontrib-htmlhelp&gt;=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.0.4)
-Requirement already satisfied: sphinxcontrib-serializinghtml&gt;=1.1.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.1.9)
-Requirement already satisfied: sphinxcontrib-qthelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.0.6)
-Requirement already satisfied: Pygments&gt;=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.16.1)
-Requirement already satisfied: snowballstemmer&gt;=1.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.2.0)
-Requirement already satisfied: babel&gt;=1.3 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.13.0)
-Requirement already satisfied: alabaster&lt;0.8,&gt;=0.7 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (0.7.13)
-Requirement already satisfied: imagesize in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.4.1)
-Requirement already satisfied: requests&gt;=2.5.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2.31.0)
-Requirement already satisfied: packaging in /home/codespace/.local/lib/python3.10/site-packages (from sphinx&lt;6,&gt;=4-&gt;jupyter-book) (23.2)
-Requirement already satisfied: MarkupSafe&gt;=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from Jinja2-&gt;jupyter-book) (2.1.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: pydata-sphinx-theme&gt;=0.13.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx-book-theme~=1.0.0-&gt;jupyter-book) (0.14.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: pybtex&gt;=0.24 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (0.24.0)
-Requirement already satisfied: pybtex-docutils&gt;=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (1.0.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: setuptools in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton-&gt;jupyter-book) (68.0.0)
-Requirement already satisfied: wheel in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton-&gt;jupyter-book) (0.41.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: sqlalchemy&lt;3,&gt;=1.3.12 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache&lt;0.7,&gt;=0.5-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.0.23)
-Requirement already satisfied: tabulate in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache&lt;0.7,&gt;=0.5-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.9.0)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: markdown-it-py&lt;3.0.0,&gt;=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.2.0)
-Requirement already satisfied: mdit-py-plugins~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.3.5)
-Requirement already satisfied: jupyter-client&gt;=6.1.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (8.4.0)
-Requirement already satisfied: jupyter-core!=5.0.*,&gt;=4.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.4.0)
-Requirement already satisfied: traitlets&gt;=5.3 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.11.2)
-Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.18.1)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: latexcodec&gt;=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex&gt;=0.24-&gt;sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (2.0.1)
-Requirement already satisfied: six in /home/codespace/.local/lib/python3.10/site-packages (from pybtex&gt;=0.24-&gt;sphinxcontrib-bibtex&lt;=2.5.0,&gt;=2.2.0-&gt;jupyter-book) (1.16.0)
-Requirement already satisfied: beautifulsoup4 in /home/codespace/.local/lib/python3.10/site-packages (from pydata-sphinx-theme&gt;=0.13.3-&gt;sphinx-book-theme~=1.0.0-&gt;jupyter-book) (4.12.2)
-Requirement already satisfied: accessible-pygments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pydata-sphinx-theme&gt;=0.13.3-&gt;sphinx-book-theme~=1.0.0-&gt;jupyter-book) (0.0.4)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: charset-normalizer&lt;4,&gt;=2 in /home/codespace/.local/lib/python3.10/site-packages (from requests&gt;=2.5.0-&gt;sphinx&lt;6,&gt;=4-&gt;jupyter-book) (3.3.0)
-Requirement already satisfied: idna&lt;4,&gt;=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from requests&gt;=2.5.0-&gt;sphinx&lt;6,&gt;=4-&gt;jupyter-book) (3.4)
-Requirement already satisfied: urllib3&lt;3,&gt;=1.21.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from requests&gt;=2.5.0-&gt;sphinx&lt;6,&gt;=4-&gt;jupyter-book) (1.26.18)
-Requirement already satisfied: certifi&gt;=2017.4.17 in /home/codespace/.local/lib/python3.10/site-packages (from requests&gt;=2.5.0-&gt;sphinx&lt;6,&gt;=4-&gt;jupyter-book) (2023.7.22)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: zipp&gt;=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from importlib_metadata-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (3.17.0)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: comm&gt;=0.1.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.1.4)
-Requirement already satisfied: debugpy&gt;=1.6.5 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (1.8.0)
-Requirement already satisfied: matplotlib-inline&gt;=0.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.1.6)
-Requirement already satisfied: nest-asyncio in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (1.5.8)
-Requirement already satisfied: psutil in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.9.6)
-Requirement already satisfied: pyzmq&gt;=20 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (25.1.1)
-Requirement already satisfied: tornado&gt;=6.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (6.3.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: backcall in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.2.0)
-Requirement already satisfied: decorator in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (5.1.1)
-Requirement already satisfied: jedi&gt;=0.16 in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.19.1)
-Requirement already satisfied: pickleshare in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.7.5)
-Requirement already satisfied: prompt-toolkit!=3.0.37,&lt;3.1.0,&gt;=3.0.30 in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (3.0.39)
-Requirement already satisfied: stack-data in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.6.3)
-Requirement already satisfied: exceptiongroup in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (1.1.3)
-Requirement already satisfied: pexpect&gt;4.3 in /home/codespace/.local/lib/python3.10/site-packages (from ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (4.8.0)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: parso&lt;0.9.0,&gt;=0.8.3 in /home/codespace/.local/lib/python3.10/site-packages (from jedi&gt;=0.16-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.8.3)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: python-dateutil&gt;=2.8.2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-client&gt;=6.1.12-&gt;nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.8.2)
-Requirement already satisfied: platformdirs&gt;=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-core!=5.0.*,&gt;=4.12-&gt;nbclient-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (3.11.0)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: mdurl~=0.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from markdown-it-py&lt;3.0.0,&gt;=1.0.0-&gt;myst-parser~=0.18.0-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.1.2)
-Requirement already satisfied: ptyprocess&gt;=0.5 in /home/codespace/.local/lib/python3.10/site-packages (from pexpect&gt;4.3-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.7.0)
-Requirement already satisfied: wcwidth in /home/codespace/.local/lib/python3.10/site-packages (from prompt-toolkit!=3.0.37,&lt;3.1.0,&gt;=3.0.30-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.2.8)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: greenlet!=0.4.17 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sqlalchemy&lt;3,&gt;=1.3.12-&gt;jupyter-cache&lt;0.7,&gt;=0.5-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (3.0.1)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: soupsieve&gt;1.2 in /home/codespace/.local/lib/python3.10/site-packages (from beautifulsoup4-&gt;pydata-sphinx-theme&gt;=0.13.3-&gt;sphinx-book-theme~=1.0.0-&gt;jupyter-book) (2.5)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Requirement already satisfied: executing&gt;=1.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.0.0)
-Requirement already satisfied: asttokens&gt;=2.1.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (2.4.0)
-Requirement already satisfied: pure-eval in /home/codespace/.local/lib/python3.10/site-packages (from stack-data-&gt;ipython-&gt;myst-nb~=0.17.1-&gt;jupyter-book) (0.2.2)
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Note: you may need to restart the kernel to use updated packages.
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">%</span><span class="k">cd</span> /workspaces/LeetCode-Solutions
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>toc<span class="w"> </span>migrate<span class="w"> </span>/workspaces/LeetCode-Solutions/_toc.yml<span class="w"> </span>-o<span class="w"> </span>/workspaces/LeetCode-Solutions/_toc.yml
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>Traceback (most recent call last):
-  File &quot;/home/codespace/.python/current/bin/jupyter-book&quot;, line 8, in &lt;module&gt;
-    sys.exit(main())
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1157, in __call__
-    return self.main(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1078, in main
-    rv = self.invoke(ctx)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1688, in invoke
-    return _process_result(sub_ctx.command.invoke(sub_ctx))
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1688, in invoke
-    return _process_result(sub_ctx.command.invoke(sub_ctx))
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1434, in invoke
-    return ctx.invoke(self.callback, **ctx.params)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 783, in invoke
-    return __callback(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/cli.py&quot;, line 139, in migrate_toc
-    toc = migrate_jupyter_book(Path(toc_file))
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/tools.py&quot;, line 327, in migrate_jupyter_book
-    raise MalformedError(&quot;no top-level &#39;file&#39; key found&quot;)
-sphinx_external_toc.parsing.MalformedError: no top-level &#39;file&#39; key found
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>build<span class="w"> </span>.
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold -Color-Bold-Green">Running Jupyter-Book v0.15.1</span>
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold -Color-Bold-Blue">Source Folder: </span>/workspaces/LeetCode-Solutions
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Config Path: </span>/workspaces/LeetCode-Solutions/_config.yml
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Output Path: </span>/workspaces/LeetCode-Solutions/_build/html
-<span class=" -Color -Color-Bold">Running Sphinx v5.0.2</span>
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>[etoc] Changing master_doc to &#39;README&#39;
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">myst v0.18.1:</span> MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=[&#39;colon_fence&#39;, &#39;dollarmath&#39;, &#39;linkify&#39;, &#39;substitution&#39;, &#39;tasklist&#39;], disable_syntax=[], all_links_external=False, url_schemes=[&#39;mailto&#39;, &#39;http&#39;, &#39;https&#39;], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=(&#39;{&#39;, &#39;}&#39;), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes=&#39;tex2jax_process|mathjax_process|math|output_area&#39;)
-<span class=" -Color -Color-Bold">myst-nb v0.17.2:</span> NbParserConfig(custom_formats={}, metadata_key=&#39;mystnb&#39;, cell_metadata_key=&#39;mystnb&#39;, kernel_rgx_aliases={}, execution_mode=&#39;auto&#39;, execution_cache_path=&#39;&#39;, execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin=&#39;default&#39;, remove_code_source=False, remove_code_outputs=False, code_prompt_show=&#39;Show code cell {type}&#39;, code_prompt_hide=&#39;Hide code cell {type}&#39;, number_source_lines=False, output_stderr=&#39;show&#39;, render_text_lexer=&#39;myst-ansi&#39;, render_error_lexer=&#39;ipythontb&#39;, render_image_options={}, render_figure_options={}, render_markdown_format=&#39;commonmark&#39;, output_folder=&#39;build&#39;, append_css=True, metadata_to_fm=False)
-Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">building [mo]: </span>targets for 0 po files that are out of date
-<span class=" -Color -Color-Bold">building [html]: </span>targets for 77 source files that are out of date
-<span class=" -Color -Color-Bold">updating environment: </span>[new config] 77 added, 0 changed, 0 removed
-<span class=" -Color -Color-Bold">reading sources... </span>[  1%] <span class=" -Color -Color-Magenta">01. Array Hashing/1. Two Sum</span>                          
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.07 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  2%] <span class=" -Color -Color-Magenta">01. Array Hashing/128. Longest Consecutive Sequence</span>   
-/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.17 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[  3%] <span class=" -Color -Color-Magenta">01. Array Hashing/217. Contains Duplicate</span>             
-/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.19 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[  5%] <span class=" -Color -Color-Magenta">01. Array Hashing/238. Product of Array Except Self</span>   
-/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 1.26 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  6%] <span class=" -Color -Color-Magenta">01. Array Hashing/242. Valid Anagram</span>                  
-/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 1.18 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  7%] <span class=" -Color -Color-Magenta">01. Array Hashing/347. Top K Frequent Elements</span>        
-/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.13 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[  9%] <span class=" -Color -Color-Magenta">01. Array Hashing/49. Group Anagrams</span>                  
-/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 4.02 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 10%] <span class=" -Color -Color-Magenta">01. Array Hashing/659. Encode and Decode Strings</span>      
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.05 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 11%] <span class=" -Color -Color-Magenta">01. Array Hashing/README</span>                              
-<span class=" -Color -Color-Bold">reading sources... </span>[ 12%] <span class=" -Color -Color-Magenta">02. Two Pointers/11. Container With Most Water</span>        
-/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.26 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 14%] <span class=" -Color -Color-Magenta">02. Two Pointers/125. Valid Palindrome</span>                
-/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 1.07 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 15%] <span class=" -Color -Color-Magenta">02. Two Pointers/15. 3Sum</span>                             
-/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.00 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 16%] <span class=" -Color -Color-Magenta">02. Two Pointers/README</span>                               
-<span class=" -Color -Color-Bold">reading sources... </span>[ 18%] <span class=" -Color -Color-Magenta">03. Sliding Window/121. Best Time to Buy and Sell Stock</span>
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.89 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 19%] <span class=" -Color -Color-Magenta">03. Sliding Window/3. Longest Substring Without Repeating Characters</span>
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 1.16 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 20%] <span class=" -Color -Color-Magenta">03. Sliding Window/424. Longest Repeating Character Replacement</span>
-/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.05 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 22%] <span class=" -Color -Color-Magenta">03. Sliding Window/76. Minimum Window Substring</span>       
-/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 0.87 seconds [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 23%] <span class=" -Color -Color-Magenta">03. Sliding Window/README</span>                             
-<span class=" -Color -Color-Bold">reading sources... </span>[ 24%] <span class=" -Color -Color-Magenta">04. Stack/20. Valid Parentheses</span>                       
-/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 4.02 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 25%] <span class=" -Color -Color-Magenta">04. Stack/README</span>                                      
-<span class=" -Color -Color-Bold">reading sources... </span>[ 27%] <span class=" -Color -Color-Magenta">05. Binary Search/153. Find Minimum in Rotated Sorted Array</span>
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 0.98 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 28%] <span class=" -Color -Color-Magenta">05. Binary Search/33. Search in Rotated Sorted Array</span>  
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.05 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 29%] <span class=" -Color -Color-Magenta">05. Binary Search/README</span>                              
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold">reading sources... </span>[ 31%] <span class=" -Color -Color-Magenta">06. Linked List/141. Linked List Cycle</span>                
-/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 0.96 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[ 32%] <span class=" -Color -Color-Magenta">06. Linked List/143. Reorder List</span>                     
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]
-</pre></div>
-</div>
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>^C
-
-Exception occurred:
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 512, in _async_cleanup_kernel
-    await ensure_async(self.km.cleanup_resources())
-AttributeError: &#39;NoneType&#39; object has no attribute &#39;cleanup_resources&#39;
-The full traceback has been saved in /tmp/sphinx-err-tl19fjln.log, if you want to report the issue to the developers.
-Please also report this if it was a user error, so that a better error message can be provided next time.
-A bug report can be filed in the tracker at &lt;https://github.com/sphinx-doc/sphinx/issues&gt;. Thanks!
-Traceback (most recent call last):
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py&quot;, line 89, in wrapper
-    self._ready.set_result(None)
-asyncio.exceptions.InvalidStateError: invalid state
-
-During handling of the above exception, another exception occurred:
-
-Traceback (most recent call last):
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 505, in _async_cleanup_kernel
-    await ensure_async(self.km.shutdown_kernel(now=now))
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py&quot;, line 189, in ensure_async
-    result = await obj
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py&quot;, line 92, in wrapper
-    self._ready.set_exception(e)
-asyncio.exceptions.InvalidStateError: invalid state
-
-During handling of the above exception, another exception occurred:
-
-Traceback (most recent call last):
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/sphinx.py&quot;, line 171, in build_sphinx
-    app.build(force_all, filenames)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/application.py&quot;, line 329, in build
-    self.builder.build_update()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py&quot;, line 288, in build_update
-    self.build(to_build,
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py&quot;, line 302, in build
-    updated_docnames = set(self.read())
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py&quot;, line 409, in read
-    self._read_serial(docnames)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py&quot;, line 430, in _read_serial
-    self.read_doc(docname)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py&quot;, line 483, in read_doc
-    publisher.publish()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/core.py&quot;, line 217, in publish
-    self.document = self.reader.read(self.source, self.parser,
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/io.py&quot;, line 103, in read
-    self.parse()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/readers/__init__.py&quot;, line 78, in parse
-    self.parser.parse(self.input, document)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/sphinx_.py&quot;, line 150, in parse
-    with create_client(
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/base.py&quot;, line 83, in __enter__
-    self.start_client()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/direct.py&quot;, line 40, in start_client
-    result = single_nb_execution(
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_cache/executors/utils.py&quot;, line 58, in single_nb_execution
-    executenb(
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 1305, in execute
-    return NotebookClient(nb=nb, resources=resources, km=km, **kwargs).execute()
-  File &quot;/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py&quot;, line 173, in wrapped
-    return loop.run_until_complete(inner)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/asyncio/base_events.py&quot;, line 649, in run_until_complete
-    return future.result()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 689, in async_execute
-    async with self.async_setup_kernel(**kwargs):
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/contextlib.py&quot;, line 206, in __aexit__
-    await anext(self.gen)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 656, in async_setup_kernel
-    await self._async_cleanup_kernel()
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py&quot;, line 512, in _async_cleanup_kernel
-    await ensure_async(self.km.cleanup_resources())
-AttributeError: &#39;NoneType&#39; object has no attribute &#39;cleanup_resources&#39;
-
-The above exception was the direct cause of the following exception:
-
-Traceback (most recent call last):
-  File &quot;/home/codespace/.python/current/bin/jupyter-book&quot;, line 8, in &lt;module&gt;
-    sys.exit(main())
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1157, in __call__
-    return self.main(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1078, in main
-    rv = self.invoke(ctx)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1688, in invoke
-    return _process_result(sub_ctx.command.invoke(sub_ctx))
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 1434, in invoke
-    return ctx.invoke(self.callback, **ctx.params)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py&quot;, line 783, in invoke
-    return __callback(*args, **kwargs)
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py&quot;, line 317, in build
-    builder_specific_actions(
-  File &quot;/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py&quot;, line 525, in builder_specific_actions
-    raise RuntimeError(_message_box(msg, color=&quot;red&quot;, doprint=False)) from result
-RuntimeError: 
-===============================================================================
-
-There was an error in building your book. Look above for the cause.
-
-===============================================================================
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>build<span class="w"> </span>/workspaces/LeetCode-Solutions/<span class="w"> </span>--builder<span class="w"> </span>pdfhtml
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">IPython.display</span> <span class="kn">import</span> <span class="n">HTML</span>
-<span class="n">HTML</span><span class="p">(</span><span class="s1">&#39;&lt;a href=&quot;_build/html/index.html&quot; target=&quot;_blank&quot;&gt;Click here to view your Jupyter Book&lt;/a&gt;&#39;</span><span class="p">)</span>
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output text_html"><a href="_build/html/index.html" target="_blank">Click here to view your Jupyter Book</a></div></div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>create<span class="w"> </span>mybook
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>===============================================================================
-
-Your book template can be found at
-
-    mybook/
-
-===============================================================================
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>build<span class="w"> </span>mybook
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span><span class=" -Color -Color-Bold -Color-Bold-Green">Running Jupyter-Book v0.15.1</span>
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Source Folder: </span>/workspaces/LeetCode-Solutions/mybook
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Config Path: </span>/workspaces/LeetCode-Solutions/mybook/_config.yml
-<span class=" -Color -Color-Bold -Color-Bold-Blue">Output Path: </span>/workspaces/LeetCode-Solutions/mybook/_build/html
-[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils&lt;0.18 (or &gt;=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/
-<span class=" -Color -Color-Bold">Running Sphinx v5.0.2</span>
-[etoc] Changing master_doc to &#39;intro&#39;
-checking bibtex cache... out of date
-parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries
-<span class=" -Color -Color-Bold">myst v0.18.1:</span> MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=[&#39;colon_fence&#39;, &#39;dollarmath&#39;, &#39;linkify&#39;, &#39;substitution&#39;, &#39;tasklist&#39;], disable_syntax=[], all_links_external=False, url_schemes=[&#39;mailto&#39;, &#39;http&#39;, &#39;https&#39;], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=(&#39;{&#39;, &#39;}&#39;), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes=&#39;tex2jax_process|mathjax_process|math|output_area&#39;)
-<span class=" -Color -Color-Bold">myst-nb v0.17.2:</span> NbParserConfig(custom_formats={}, metadata_key=&#39;mystnb&#39;, cell_metadata_key=&#39;mystnb&#39;, kernel_rgx_aliases={}, execution_mode=&#39;force&#39;, execution_cache_path=&#39;&#39;, execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin=&#39;default&#39;, remove_code_source=False, remove_code_outputs=False, code_prompt_show=&#39;Show code cell {type}&#39;, code_prompt_hide=&#39;Hide code cell {type}&#39;, number_source_lines=False, output_stderr=&#39;show&#39;, render_text_lexer=&#39;myst-ansi&#39;, render_error_lexer=&#39;ipythontb&#39;, render_image_options={}, render_figure_options={}, render_markdown_format=&#39;commonmark&#39;, output_folder=&#39;build&#39;, append_css=True, metadata_to_fm=False)
-Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache
-<span class=" -Color -Color-Bold">building [mo]: </span>targets for 0 po files that are out of date
-<span class=" -Color -Color-Bold">building [html]: </span>targets for 14 source files that are out of date
-<span class=" -Color -Color-Bold">updating environment: </span>[new config] 14 added, 0 changed, 0 removed
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]
-<span class=" -Color -Color-Bold">reading sources... </span>[100%] <span class=" -Color -Color-Magenta">intro</span>                                                 
-<span class=" -Color -Color-Bold">looking for now-outdated files... </span>none found
-<span class=" -Color -Color-Bold">pickling environment... </span>done
-<span class=" -Color -Color-Bold">checking consistency... </span>/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn&#39;t included in any toctree
-/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn&#39;t included in any toctree
-done
-<span class=" -Color -Color-Bold">preparing documents... </span>done
-<span class=" -Color -Color-Bold">writing output... </span>[100%] <span class=" -Color -Color-Green">intro</span>                                                  
-<span class=" -Color -Color-Bold">generating indices... </span>genindex done
-<span class=" -Color -Color-Bold">writing additional pages... </span>search done
-<span class=" -Color -Color-Bold">copying static files... </span>done
-<span class=" -Color -Color-Bold">copying extra files... </span>done
-<span class=" -Color -Color-Bold">dumping search index in English (code: en)... </span>done
-<span class=" -Color -Color-Bold">dumping object inventory... </span>done
-[etoc] missing index.html written as redirect to &#39;intro.html&#39;
-<span class=" -Color -Color-Bold">build succeeded, 2 warnings.</span>
-
-The HTML pages are in mybook/_build/html.
-
-===============================================================================
-
-Finished generating HTML for book.
-Your book&#39;s HTML pages are here:
-    mybook/_build/html/
-You can look at your book by opening this file in a browser:
-    mybook/_build/html/index.html
-Or paste this line directly into your browser bar:
-    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            
-
-===============================================================================
-</pre></div>
-</div>
-</div>
-</div>
-<div class="cell docutils container">
-<div class="cell_input docutils container">
-<div class="highlight-ipython3 notranslate"><div class="highlight"><pre><span></span><span class="o">!</span>jupyter-book<span class="w"> </span>toc<span class="w"> </span>from-project<span class="w"> </span>/workspaces/LeetCode-Solutions/mybook/<span class="w"> </span>-f<span class="w"> </span>jb-book
-</pre></div>
-</div>
-</div>
-<div class="cell_output docutils container">
-<div class="output stream highlight-myst-ansi notranslate"><div class="highlight"><pre><span></span>format: jb-book
-root: intro
-</pre></div>
-</div>
-</div>
-</div>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./."
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="simple visible nav section-nav flex-column">
-</ul>
-
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/SECURITY.html b/docs/_build/html/SECURITY.html
deleted file mode 100644
index 1816264..0000000
--- a/docs/_build/html/SECURITY.html
+++ /dev/null
@@ -1,610 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
-
-    <title>Security Policy &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'SECURITY';</script>
-    <link rel="index" title="Index" href="genindex.html" />
-    <link rel="search" title="Search" href="search.html" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="search.html"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2FSECURITY.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-
-
-<div class="dropdown dropdown-download-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Download this page">
-    <i class="fas fa-download"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="_sources/SECURITY.md" target="_blank"
-   class="btn btn-sm btn-download-source-button dropdown-item"
-   title="Download source file"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file"></i>
-  </span>
-<span class="btn__text-container">.md</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li>
-<button onclick="window.print()"
-  class="btn btn-sm btn-download-pdf-button dropdown-item"
-  title="Print to PDF"
-  data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-file-pdf"></i>
-  </span>
-<span class="btn__text-container">.pdf</span>
-</button>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-<label class="sidebar-toggle secondary-toggle btn btn-sm" for="__secondary"title="Toggle secondary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="fa-solid fa-list"></span>
-</label>
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-
-<div id="jb-print-docs-body" class="onlyprint">
-    <h1>Security Policy</h1>
-    <!-- Table of contents -->
-    <div id="print-main-content">
-        <div id="jb-print-toc">
-            
-            <div>
-                <h2> Contents </h2>
-            </div>
-            <nav aria-label="Page">
-                <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#reporting-a-vulnerability">Reporting a Vulnerability</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#security-updates">Security Updates</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contact">Contact</a></li>
-</ul>
-            </nav>
-        </div>
-    </div>
-</div>
-
-              
-                
-<div id="searchbox"></div>
-                <article class="bd-article" role="main">
-                  
-  <section class="tex2jax_ignore mathjax_ignore" id="security-policy">
-<h1>Security Policy<a class="headerlink" href="#security-policy" title="Permalink to this heading">#</a></h1>
-<section id="reporting-a-vulnerability">
-<h2>Reporting a Vulnerability<a class="headerlink" href="#reporting-a-vulnerability" title="Permalink to this heading">#</a></h2>
-<p>We take the security of the Blind 75 LeetCode repository seriously. If you believe you have found a security vulnerability, please help us by following these steps:</p>
-<ol class="arabic">
-<li><p><strong>Do Not Disclose Publicly</strong>: Please do not disclose the issue publicly until it has been addressed by our team.</p></li>
-<li><p><strong>Report Privately</strong>: Create a GitHub issue with the title “Security Vulnerability Report” and provide a detailed description of the vulnerability. You can use a sample report template as follows:</p>
-<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="o">**</span><span class="n">Description</span><span class="o">**</span>
-<span class="n">A</span> <span class="n">clear</span> <span class="ow">and</span> <span class="n">concise</span> <span class="n">description</span> <span class="n">of</span> <span class="n">the</span> <span class="n">security</span> <span class="n">vulnerability</span><span class="o">.</span>
-
-<span class="o">**</span><span class="n">Steps</span> <span class="n">to</span> <span class="n">Reproduce</span><span class="o">**</span>
-<span class="n">Provide</span> <span class="n">detailed</span> <span class="n">steps</span> <span class="n">on</span> <span class="n">how</span> <span class="n">to</span> <span class="n">reproduce</span> <span class="n">the</span> <span class="n">vulnerability</span><span class="o">.</span>
-
-<span class="o">**</span><span class="n">Expected</span> <span class="n">Behavior</span><span class="o">**</span>
-<span class="n">Describe</span> <span class="n">what</span> <span class="n">you</span> <span class="n">expected</span> <span class="n">to</span> <span class="n">happen</span><span class="o">.</span>
-
-<span class="o">**</span><span class="n">Actual</span> <span class="n">Behavior</span><span class="o">**</span>
-<span class="n">Describe</span> <span class="n">what</span> <span class="n">actually</span> <span class="n">happened</span><span class="o">.</span>
-
-<span class="o">**</span><span class="n">Additional</span> <span class="n">Information</span><span class="o">**</span>
-<span class="n">Any</span> <span class="n">additional</span> <span class="n">information</span> <span class="n">that</span> <span class="n">can</span> <span class="n">help</span> <span class="n">us</span> <span class="n">understand</span> <span class="ow">and</span> <span class="n">reproduce</span> <span class="n">the</span> <span class="n">issue</span><span class="p">,</span> <span class="n">such</span> <span class="k">as</span> <span class="n">environment</span> <span class="n">details</span><span class="p">,</span> <span class="n">configuration</span><span class="p">,</span> <span class="ow">or</span> <span class="n">screenshots</span><span class="o">.</span>
-</pre></div>
-</div>
-</li>
-<li><p><strong>Secure Communication</strong>: If the vulnerability involves sensitive data, please encrypt your communication with our PGP key. Contact us for our PGP key information.</p></li>
-<li><p><strong>Response</strong>: We will acknowledge your report within 5 business days and provide an estimated timeline for the resolution.</p></li>
-<li><p><strong>Fix and Disclosure</strong>: We will work to fix the issue promptly and privately. Once resolved, we will provide a security advisory and give credit to the reporter if desired.</p></li>
-<li><p><strong>Responsible Disclosure</strong>: We encourage responsible disclosure. Please do not take advantage of the vulnerability or attempt to exploit it for malicious purposes.</p></li>
-</ol>
-</section>
-<section id="security-updates">
-<h2>Security Updates<a class="headerlink" href="#security-updates" title="Permalink to this heading">#</a></h2>
-<p>We are committed to promptly addressing and resolving any security issues. We recommend that you stay up-to-date with the latest releases of this repository, as they may include security updates and fixes.</p>
-</section>
-<section id="contact">
-<h2>Contact<a class="headerlink" href="#contact" title="Permalink to this heading">#</a></h2>
-<p>If you have any questions or need further assistance regarding security, you can contact us at <a class="reference external" href="mailto:mohsentabibian&#37;&#52;&#48;gmail&#46;com">mohsentabibian<span>&#64;</span>gmail<span>&#46;</span>com</a>.</p>
-</section>
-</section>
-
-    <script type="text/x-thebe-config">
-    {
-        requestKernel: true,
-        binderOptions: {
-            repo: "binder-examples/jupyter-stacks-datascience",
-            ref: "master",
-        },
-        codeMirrorConfig: {
-            theme: "abcdef",
-            mode: "python"
-        },
-        kernelOptions: {
-            name: "python3",
-            path: "./."
-        },
-        predefinedOutput: true
-    }
-    </script>
-    <script>kernelName = 'python3'</script>
-
-                </article>
-              
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-                <div class="bd-sidebar-secondary bd-toc"><div class="sidebar-secondary-items sidebar-secondary__inner">
-
-  <div class="sidebar-secondary-item">
-  <div class="page-toc tocsection onthispage">
-    <i class="fa-solid fa-list"></i> Contents
-  </div>
-  <nav class="bd-toc-nav page-toc">
-    <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#reporting-a-vulnerability">Reporting a Vulnerability</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#security-updates">Security Updates</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#contact">Contact</a></li>
-</ul>
-  </nav></div>
-
-</div></div>
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb b/docs/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb
deleted file mode 100644
index b3b517f..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/1. Two Sum.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= `Node.val` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "+ Time Complexity: $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ Space Complexity: $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/docs/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
deleted file mode 100644
index a77a03d..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/128. Longest Consecutive Sequence.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 128. Longest Consecutive Sequence\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Consecutive Sequence problem on LeetCode, click here!](https://leetcode.com/problems/longest-consecutive-sequence/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an unsorted array of integers `nums`, return *the length of the longest consecutive elements sequence.*\n",
-        "\n",
-        "You must write an algorithm that runs in `O(n)` time.\n",
-        "\n",
-        "*Constraints:**\n",
-        "- 0 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def longestConsecutive(nums):\n",
-        "    if not nums:\n",
-        "        return 0\n",
-        "\n",
-        "    num_set = set(nums)\n",
-        "    max_length = 0\n",
-        "\n",
-        "    for num in num_set:\n",
-        "        if num - 1 not in num_set:\n",
-        "            current_num = num\n",
-        "            current_length = 1\n",
-        "\n",
-        "            while current_num + 1 in num_set:\n",
-        "                current_num += 1\n",
-        "                current_length += 1\n",
-        "\n",
-        "            max_length = max(max_length, current_length)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `longestConsecutive` function that takes the `nums` array as input.\n",
-        "\n",
-        "2. We check if the `nums` array is empty. If it's empty, there are no consecutive elements, so we return 0.\n",
-        "\n",
-        "3. We create a Python set called `num_set` and insert all elements from the `nums` array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.\n",
-        "\n",
-        "4. We initialize a variable `max_length` to 0. This variable will keep track of the maximum length of consecutive elements sequence found.\n",
-        "\n",
-        "5. We iterate through the elements of the `num_set`. For each element `num`, we check if `num - 1` exists in the `num_set`. If it doesn't exist, it means `num` is the starting element of a potential consecutive sequence.\n",
-        "\n",
-        "6. Inside the loop, we initialize two variables: `current_num` to the current element `num` and `current_length` to 1. We start with a length of 1 because `num` itself is part of the sequence.\n",
-        "\n",
-        "7. We then enter a while loop that continues as long as `current_num + 1` exists in the `num_set`. This means we are incrementing the consecutive sequence.\n",
-        "\n",
-        "8. Inside the while loop, we increment `current_num` by 1 and also increment `current_length` by 1 to account for the next consecutive element.\n",
-        "\n",
-        "9. We compare `current_length` with the `max_length` and update `max_length` if the current sequence is longer.\n",
-        "\n",
-        "10. After the while loop, we move to the next element in the outer loop and repeat the process.\n",
-        "\n",
-        "11. Finally, we return the `max_length` as the result, which represents the length of the longest consecutive elements sequence in the `nums` array.\n",
-        "\n",
-        "The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "nums1 = [100, 4, 200, 1, 3, 2]\n",
-        "print(longestConsecutive(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "9\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "nums2 = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]\n",
-        "print(longestConsecutive(nums2)) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The code is designed to run in O(n) time complexity, where n is the number of elements in the `nums` array. Here's the breakdown:\n",
-        "\n",
-        "1. Constructing the `num_set` by inserting all elements from `nums` into it takes O(n) time because we perform an insertion operation for each element in `nums`.\n",
-        "\n",
-        "2. The main loop iterates through the elements in `num_set`. In the worst case, each element is visited only once, so the loop itself takes O(n) time.\n",
-        "\n",
-        "3. Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).\n",
-        "\n",
-        "Therefore, the overall time complexity of the code is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the code is determined by the space used by the `num_set` and a few additional variables. Here's the breakdown:\n",
-        "\n",
-        "1. `num_set` is a set that stores the unique elements from `nums`. In the worst case, it can store all n elements from `nums`, so the space complexity is O(n).\n",
-        "\n",
-        "2. The additional variables used, such as `max_length`, `current_num`, and `current_length`, have constant space requirements and do not depend on the size of the input array.\n",
-        "\n",
-        "Therefore, the overall space complexity of the code is O(n) due to the space used by the `num_set`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.\n",
-        "\n",
-        "2. Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb b/docs/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb
deleted file mode 100644
index 57bb55d..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/217. Contains Duplicate.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 217. Contains Duplicate\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Contains Duplicate problem on LeetCode, click here!](https://leetcode.com/problems/contains-duplicate/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def containsDuplicate(nums):\n",
-        "    # Create an empty set to store unique elements\n",
-        "    unique_elements = set()\n",
-        "    \n",
-        "    # Iterate through the array\n",
-        "    for num in nums:\n",
-        "        # If the element is already in the set, return True\n",
-        "        if num in unique_elements:\n",
-        "            return True\n",
-        "        # Otherwise, add it to the set\n",
-        "        else:\n",
-        "            unique_elements.add(num)\n",
-        "    \n",
-        "    # If the loop completes without finding duplicates, return False\n",
-        "    return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `containsDuplicate` function takes a single argument, `nums`, which is the input integer array.\n",
-        "\n",
-        "2. Inside the function, an empty set called `unique_elements` is created. This set will be used to keep track of unique elements in the input array.\n",
-        "\n",
-        "3. The function then iterates through the input array `nums` using a `for` loop.\n",
-        "\n",
-        "4. For each element `num` in the array, it checks whether `num` is already in the `unique_elements` set using the `if num in unique_elements:` condition.\n",
-        "\n",
-        "5. If `num` is already in the set, it means there is a duplicate element in the array, and the function immediately returns `True`.\n",
-        "\n",
-        "6. If `num` is not in the set, it is added to the `unique_elements` set using `unique_elements.add(num)`.\n",
-        "\n",
-        "7. The loop continues to the next element, and the process repeats.\n",
-        "\n",
-        "8. If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns `False`.\n",
-        "\n",
-        "The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem's requirements and constraints, as explained earlier."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums1 = [1, 2, 3, 1]\n",
-        "print(containsDuplicate(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums2 = [1, 2, 3, 4]\n",
-        "print(containsDuplicate(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums3 = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2]\n",
-        "print(containsDuplicate(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for the \"Contains Duplicate\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary operation that affects the time complexity is the `for` loop that iterates through the input array `nums`. In the worst case, the loop will iterate through all `n` elements of the array, where `n` is the length of the input array.\n",
-        "\n",
-        "- Iterating through the array: O(n)\n",
-        "\n",
-        "Inside the loop, we perform two operations:\n",
-        "\n",
-        "1. Checking whether an element exists in the `unique_elements` set (`if num in unique_elements`). This operation has an average time complexity of O(1) for a set.\n",
-        "2. Adding an element to the `unique_elements` set (`unique_elements.add(num)`), which also has an average time complexity of O(1) for a set.\n",
-        "\n",
-        "Since these operations are performed for each element in the array, the overall time complexity remains O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity is determined by the additional data structures used in the code, which are the `unique_elements` set.\n",
-        "\n",
-        "- `unique_elements` set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all `n` elements.\n",
-        "\n",
-        "Therefore, the space complexity is O(n) because, in the worst case, the set's size will grow linearly with the input array's size.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where `n` is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K Duplicates:** Modify the problem to return `true` if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns `true` if there are exactly K duplicates.\n",
-        "2. **Frequency Count:** Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb b/docs/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb
deleted file mode 100644
index 1ff9a9c..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/238. Product of Array Except Self.ipynb	
+++ /dev/null
@@ -1,197 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 238. Product of Array Except Self\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Product of Array Except Self problem on LeetCode, click here!](https://leetcode.com/problems/product-of-array-except-self/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums`, return *an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.*\n",
-        "\n",
-        "The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "You must write an algorithm that runs in O(n) time and without using the division operation.\n",
-        "\n",
-        "Constraints:\n",
-        "- 2 <= `nums.length` <= $10^5$\n",
-        "- `-30 <= nums[i] <= 30`\n",
-        "- The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-        "\n",
-        "**Follow-up:** Can you solve the problem in O(1) extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def productExceptSelf(nums):\n",
-        "    n = len(nums)\n",
-        "    \n",
-        "    # Initialize two arrays to store products to the left and right of each element\n",
-        "    left_products = [1] * n\n",
-        "    right_products = [1] * n\n",
-        "    \n",
-        "    # Calculate products to the left of each element\n",
-        "    left_product = 1\n",
-        "    for i in range(n):\n",
-        "        left_products[i] = left_product\n",
-        "        left_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate products to the right of each element\n",
-        "    right_product = 1\n",
-        "    for i in range(n - 1, -1, -1):\n",
-        "        right_products[i] = right_product\n",
-        "        right_product *= nums[i]\n",
-        "    \n",
-        "    # Calculate the final answer using left and right products\n",
-        "    answer = [left_products[i] * right_products[i] for i in range(n)]\n",
-        "    \n",
-        "    return answer"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `n` is initialized as the length of the `nums` array.\n",
-        "2. Two arrays, `left_products` and `right_products`, are created, each with a length of `n` and filled with ones initially.\n",
-        "3. `left_product` is initialized to 1.\n",
-        "4. A loop iterates through the `nums` array, from left to right. For each element at index `i`, it stores the product of all elements to its left (including itself) in the `left_products` array and updates `left_product` accordingly.\n",
-        "5. `right_product` is initialized to 1.\n",
-        "6. Another loop iterates through the `nums` array in reverse order, from right to left. For each element at index `i`, it stores the product of all elements to its right (including itself) in the `right_products` array and updates `right_product`.\n",
-        "7. The final `answer` list is constructed by multiplying corresponding elements from the `left_products` and `right_products` arrays for each index `i`.\n",
-        "8. The function returns the `answer` list, which contains the desired results.\n",
-        "\n",
-        "Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[24, 12, 8, 6]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,2,3,4]\n",
-        "result1 = productExceptSelf(nums)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 53,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[0, 0, 9, 0, 0]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [-1,1,0,-3,3]\n",
-        "result2 = productExceptSelf(nums)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop iterates through the `nums` array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the `nums` array.\n",
-        "2. The second loop also iterates through the `nums` array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.\n",
-        "3. The final loop constructs the `answer` list by multiplying elements from the `left_products` and `right_products` arrays. This loop runs in O(n) time.\n",
-        "\n",
-        "Since all the loops are independent and sequential, the overall time complexity is O(n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. Two additional arrays, `left_products` and `right_products`, are created with a length of `n`, where `n` is the length of the `nums` array. Therefore, these arrays consume O(n) extra space.\n",
-        "2. The `left_product` and `right_product` variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.\n",
-        "3. The `answer` list, which contains the final results, also consumes O(n) space, but it's not counted toward the extra space complexity analysis as per the problem's constraints.\n",
-        "\n",
-        "Overall, the space complexity is O(n) for this solution."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Handle Zeros in the Input**: Modify the solution to handle cases where the input array contains zeros. For example, if `nums = [0, 1, 2, 3, 0]`, the output should be `[0, 0, 0, 0, 0]` because any element multiplied by zero results in zero.\n",
-        "\n",
-        "2. **In-Place Modification**: Attempt to solve the problem with in-place modification of the `nums` array, where the output is stored directly in the input array without using any additional space."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb b/docs/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb
deleted file mode 100644
index d165899..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/242. Valid Anagram.ipynb	
+++ /dev/null
@@ -1,198 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 242. Valid Anagram\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Anagram problem on LeetCode, click here!](https://leetcode.com/problems/valid-anagram/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `s.length`, `t.length` <= $5 * 10^4$\n",
-        "- `s` and `t` consist of lowercase English letters.\n",
-        "\n",
-        "**Follow-up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isAnagram(s: str, t: str) -> bool:\n",
-        "    # Check if the lengths of s and t are not equal\n",
-        "    if len(s) != len(t):\n",
-        "        return False\n",
-        "\n",
-        "    # Create dictionaries to store character frequencies for s and t\n",
-        "    countS, countT = {}, {}\n",
-        "\n",
-        "    # Count character frequencies in s\n",
-        "    for i in range(len(s)):\n",
-        "        countS[s[i]] = 1 + countS.get(s[i], 0)\n",
-        "\n",
-        "    # Count character frequencies in t\n",
-        "    for i in range(len(t)):\n",
-        "        countT[t[i]] = 1 + countT.get(t[i], 0)\n",
-        "\n",
-        "    # Check if the character frequencies in s and t are the same\n",
-        "    return countS == countT"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code defines a class called `Solution` with a method `isAnagram` that takes two input strings, `s` and `t`, and returns a boolean (`True` or `False`) based on whether `t` is an anagram of `s`.\n",
-        "\n",
-        "2. The first check performed in the method is whether the lengths of `s` and `t` are equal. If they are not equal, it immediately returns `False` because strings of different lengths cannot be anagrams of each other.\n",
-        "\n",
-        "3. Two dictionaries, `countS` and `countT`, are created to store the frequency of characters in `s` and `t`, respectively. These dictionaries will be used to count the occurrences of each character in the strings.\n",
-        "\n",
-        "4. The code then enters a loop to iterate through each character in string `s` using a `for` loop. Inside the loop, it updates the `countS` dictionary. The line `countS[s[i]] = 1 + countS.get(s[i], 0)` increments the count of character `s[i]` in `countS` by 1. If the character is not already in the dictionary, it initializes the count to 1.\n",
-        "\n",
-        "5. Similarly, the code iterates through each character in string `t` and updates the `countT` dictionary in the same way.\n",
-        "\n",
-        "6. After counting the character frequencies in both strings, the code compares the two dictionaries using `countS == countT`. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, `t` is an anagram of `s`. In this case, the method returns `True`.\n",
-        "\n",
-        "7. If the dictionaries are not equal, the method returns `False`, indicating that `t` is not an anagram of `s`.\n",
-        "\n",
-        "In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns `True`; otherwise, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s = \"anagram\"\n",
-        "t = \"nagaram\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "s = \"rat\"\n",
-        "t = \"car\"\n",
-        "print(isAnagram(s, t))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. The code first checks whether the lengths of the input strings `s` and `t` are equal, which takes constant time. This check has a time complexity of O(1).\n",
-        "\n",
-        "2. The code then iterates through both strings, `s` and `t`, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (`s` or `t`).\n",
-        "\n",
-        "3. Finally, the code compares the two dictionaries `countS` and `countT` to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.\n",
-        "\n",
-        "Overall, the time complexity of the code is O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The code uses two dictionaries, `countS` and `countT`, to store the character frequencies of the input strings `s` and `t`. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.\n",
-        "\n",
-        "2. The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.\n",
-        "\n",
-        "**In summary**, the space complexity of the code is O(n), where n is the length of the longer input string."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagram Chains**: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [\"bat\", \"tab\", \"cat\", \"tac\", \"dog\"], the longest anagram chain is [\"bat\", \"tab\", \"cat\", \"tac\"].\n",
-        "\n",
-        "2. **Minimum Deletions to Make Anagrams**: Given two strings `s` and `t`, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if `s = \"hello\"` and `t = \"billion\"`, you can remove the characters \"heo\" from `s` and \"billi\" from `t` to make them anagrams (\"lo\" and \"on\" are left in the two strings)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb b/docs/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb
deleted file mode 100644
index ecfa494..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/347. Top K Frequent Elements.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 347. Top K Frequent Elements\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Top K Frequent Elements problem on LeetCode, click here!](https://leetcode.com/problems/top-k-frequent-elements/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.\n",
-        "\n",
-        "Constraints:\n",
-        "- 1 <= `nums.length` <= $10^5$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- `k` is in the range `[1, the number of unique elements in the array]`.\n",
-        "- It is **guaranteed** that the answer is **unique**.\n",
-        "\n",
-        "**Follow-up:** Your algorithm's time complexity must be better than $O(n\\ log\\ n)$, where n is the array's size.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def topKFrequent(nums, k):\n",
-        "    # Create a dictionary to store the frequency of each element\n",
-        "    count = {}\n",
-        "    # Create a list of lists to store elements with the same frequency\n",
-        "    frequency = [[] for i in range(len(nums) + 1)]\n",
-        "\n",
-        "    # Count the frequency of each element in nums\n",
-        "    for n in nums:\n",
-        "        count[n] = 1 + count.get(n, 0)\n",
-        "\n",
-        "    # Place elements in the freq list according to their frequency\n",
-        "    for n, c in count.items():\n",
-        "        frequency[c].append(n)\n",
-        "\n",
-        "    res = []\n",
-        "    # Traverse freq list from the end (higher frequencies)\n",
-        "    for i in range(len(frequency) - 1, 0, -1):\n",
-        "        for n in frequency[i]:\n",
-        "            res.append(n)\n",
-        "            if len(res) == k:\n",
-        "                return res"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `def topKFrequent(nums, k):`: This is a function that takes two arguments: `nums`, which is the input array of integers, and `k`, which is the number of most frequent elements to return.\n",
-        "\n",
-        "2. `count = {}`: This dictionary `count` will be used to store the frequency of each unique element in the `nums` array. The keys are elements from the input array, and the values are their corresponding frequencies.\n",
-        "\n",
-        "3. `frequency = [[] for i in range(len(nums) + 1)]`: This creates a list of empty lists called `frequency`. It's used to store elements based on their frequencies, similar to the `freq` list in the previous code. The size of this list is set to be one greater than the length of the input `nums`.\n",
-        "\n",
-        "4. `for n in nums:`: This loop iterates through each element `n` in the input `nums` array.\n",
-        "\n",
-        "5. `count[n] = 1 + count.get(n, 0)`: This line counts the frequency of each element `n` in the `nums` array. It uses the `count.get(n, 0)` method to retrieve the current count of `n` from the `count` dictionary. If `n` is not in the dictionary, it defaults to 0. It then increments the count by 1.\n",
-        "\n",
-        "6. After the above loop, the `count` dictionary will contain counts of each unique element in the `nums` array.\n",
-        "\n",
-        "7. `for n, c in count.items():`: This loop iterates through the items (key-value pairs) of the `count` dictionary. `n` represents the element, and `c` represents its frequency.\n",
-        "\n",
-        "8. `frequency[c].append(n)`: This line places the element `n` into the bucket corresponding to its frequency `c`. Buckets are represented by the `frequency` list. For example, if an element `n` has a frequency of 3, it will be added to `frequency[3]`.\n",
-        "\n",
-        "9. After this loop, the `frequency` list will contain buckets of elements grouped by their frequencies.\n",
-        "\n",
-        "10. `res = []`: This list `res` will be used to store the k most frequent elements.\n",
-        "\n",
-        "11. `for i in range(len(freq) - 1, 0, -1):`: This loop iterates in reverse order through the `frequency` list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be `frequency` instead of `freq`.\n",
-        "\n",
-        "12. `for n in frequency[i]:`: For each element `n` in the current bucket (i.e., elements with frequency `i`), it appends `n` to the result list `res`.\n",
-        "\n",
-        "13. `if len(res) == k:`: Once `res` contains k elements, the code exits and returns the result.\n",
-        "\n",
-        "The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., `frequency` instead of `freq`)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 48,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "nums = [1,1,1,2,2,3]\n",
-        "k = 2\n",
-        "result1 = topKFrequent(nums, k)\n",
-        "print(result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums = [1]\n",
-        "k = 1\n",
-        "result2 = topKFrequent(nums, k)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The first loop that counts the frequency of elements by iterating through `nums` has a time complexity of O(n), where n is the number of elements in the input array `nums`.\n",
-        "\n",
-        "2. The second loop iterates through the keys in the `count` dictionary, which has at most `k` unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).\n",
-        "\n",
-        "3. The third loop iterates through the `frequency` list, which has a length equal to the maximum frequency of elements in `nums`. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in `nums`.\n",
-        "\n",
-        "Overall, the dominant factor in terms of time complexity is the loop that iterates through the `count` dictionary. So, the total time complexity of the code is O(n + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The `count` dictionary stores the frequency of each unique element in `nums`. In the worst case, it can have at most `k` unique elements, so the space complexity for `count` is O(k).\n",
-        "\n",
-        "2. The `frequency` list is used to store elements grouped by their frequencies. It has a length of `len(nums) + 1`, which can be at most 105 based on the constraints. Therefore, the space complexity for `frequency` is O(105).\n",
-        "\n",
-        "3. The `res` list stores the k most frequent elements, which can be at most `k` elements, so the space complexity for `res` is O(k).\n",
-        "\n",
-        "**In summary**, the space complexity is dominated by the `count` dictionary and the `frequency` list, both of which have a space complexity of O(k + 105)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimized k Most Frequent Elements:** Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.\n",
-        "\n",
-        "2. **Handling Duplicate Frequencies:** Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb b/docs/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb
deleted file mode 100644
index afe89ec..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/49. Group Anagrams.ipynb	
+++ /dev/null
@@ -1,229 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 49. Group Anagrams\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Group Anagrams problem on LeetCode, click here!](https://leetcode.com/problems/group-anagrams/)\n",
-        "\n",
-        "---\n",
-        "Given an array of strings `strs`, group **the anagrams** together. You can return the answer in **any order**.\n",
-        "\n",
-        "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `strs.length <= $10^4$\n",
-        "- `0 <= strs[i].length <= 100`\n",
-        "- `strs[i]` consists of lowercase English letters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict\n",
-        "\n",
-        "\n",
-        "def groupAnagrams(strs):\n",
-        "    ans = defaultdict(list)\n",
-        "\n",
-        "    # Iterate through the list of input strings\n",
-        "    for s in strs:\n",
-        "        # Initialize a list to represent character counts for each character (a-z)\n",
-        "        count = [0] * 26\n",
-        "\n",
-        "        # Count the occurrences of each character in the current word\n",
-        "        for c in s:\n",
-        "            count[ord(c) - ord(\"a\")] += 1\n",
-        "\n",
-        "        # Use a tuple of character counts as the key and append the word to the anagram group\n",
-        "        ans[tuple(count)].append(s)\n",
-        "\n",
-        "    # Convert the values (lists of anagrams) to a list of lists\n",
-        "    return list(ans.values())"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Inside the method, a `defaultdict` called `ans` is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.\n",
-        "\n",
-        "2. The code then iterates through the list of input strings, `strs`, using a `for` loop. For each word `s` in `strs`, it performs the following steps:\n",
-        "\n",
-        "   - It initializes a list `count` of length 26, where each element represents the count of a specific character (a-z) in the word `s`.\n",
-        "\n",
-        "   - The code then iterates through the characters of `s`. For each character `c`, it increments the corresponding count in the `count` list based on its ASCII value.\n",
-        "\n",
-        "   - After counting the characters in `s`, it converts the `count` list into a tuple `tuple(count)` to use as a key for the `ans` dictionary.\n",
-        "\n",
-        "   - It appends the word `s` to the list associated with the key (tuple) in the `ans` dictionary. This groups all anagrams of the same word together under the same key.\n",
-        "\n",
-        "3. After processing all words in `strs`, the code converts the values of the `ans` dictionary (which are lists of anagrams) to a list of lists using the `list()` constructor.\n",
-        "\n",
-        "4. Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.\n",
-        "\n",
-        "In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 37,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['eat', 'tea', 'ate'], ['tan', 'nat'], ['bat']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: Group anagrams from a list of words\n",
-        "strs1 = [\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]\n",
-        "result1 = groupAnagrams(strs1)\n",
-        "print(result1)\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: Group anagrams from a list with an empty string\n",
-        "strs2 = [\"\"]\n",
-        "result2 = groupAnagrams(strs2)\n",
-        "print(result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 40,
-      "id": "c8367e2a-e7d5-4e18-8235-2870e341a04b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[['a']]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3: Group anagrams from a list with a single word\n",
-        "strs3 = [\"a\"]\n",
-        "result3 = groupAnagrams(strs3)\n",
-        "print(result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `groupAnagrams` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. First, we create an instance of the `Solution` class, which is an O(1) operation.\n",
-        "\n",
-        "2. Inside the `groupAnagrams` method, we iterate through the list of input strings `strs` once in a loop:\n",
-        "   - For each word in `strs`, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.\n",
-        "\n",
-        "3. The overall time complexity of the method is O(N * K), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. We use a `defaultdict` called `ans` to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for `ans` is O(N).\n",
-        "\n",
-        "2. Within the loop, we create a `count` list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).\n",
-        "\n",
-        "3. The space used for other variables is also constant and does not depend on the input size.\n",
-        "\n",
-        "4. The final result, `result`, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for `result` is O(N).\n",
-        "\n",
-        "5. The overall space complexity of the method is O(N) due to the space used by `ans` and `result`. The space used by the `count` list and other variables is constant and does not significantly affect the overall space complexity.\n",
-        "\n",
-        "**In summary,** the time complexity of the `groupAnagrams` method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Anagramic Palindromes**: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [\"bat\", \"tab\", \"act\", \"tac\", \"dog\"], there are two groups: [\"bat\", \"tab\", \"act\", \"tac\"] and [\"dog\"].\n",
-        "\n",
-        "2. **Largest Anagram Group**: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb b/docs/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb
deleted file mode 100644
index 037c476..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/659. Encode and Decode Strings.ipynb	
+++ /dev/null
@@ -1,204 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 659· Encode and Decode Strings\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Encode and Decode Strings problem on LintCode, click here!](https://www.lintcode.com/problem/659/)\n",
-        "\n",
-        "---\n",
-        "Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.\n",
-        "\n",
-        "Please implement `encode` and `decode`.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Codec:\n",
-        "\n",
-        "    def encode(self, strs):\n",
-        "        \"\"\"Encodes a list of strings to a single string.\n",
-        "        \n",
-        "        :type strs: List[str]\n",
-        "        :rtype: str\n",
-        "        \"\"\"\n",
-        "        encoded = \"\"\n",
-        "        for s in strs:\n",
-        "            encoded += s.replace(':', '::') + ':;'\n",
-        "        return encoded\n",
-        "\n",
-        "    def decode(self, s):\n",
-        "        \"\"\"Decodes a single string to a list of strings.\n",
-        "        \n",
-        "        :type s: str\n",
-        "        :rtype: List[str]\n",
-        "        \"\"\"\n",
-        "        decoded = []\n",
-        "        i = 0\n",
-        "        while i < len(s):\n",
-        "            end = s.find(':;', i)\n",
-        "            if end == -1:\n",
-        "                end = len(s)\n",
-        "            decoded.append(s[i:end].replace('::', ':'))\n",
-        "            i = end + 2\n",
-        "        return decoded"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class called `Codec` to encapsulate the encoding and decoding operations for a list of strings.\n",
-        "\n",
-        "2. In the `encode` method, we take a list of strings (`strs`) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter `:;`. We iterate through each string in the input list, replace any occurrence of `:` with `::` (to avoid conflicts with the delimiter), and then append `:;` to indicate the end of that string.\n",
-        "\n",
-        "3. In the `decode` method, we take an encoded string (`s`) as input and return a list of strings. The decoding process involves splitting the encoded string using the `:;` delimiter. We start from the beginning of the encoded string (`i = 0`) and repeatedly find the next occurrence of `:;`. We extract the substring between the current position (`i`) and the next delimiter (`end`). Before adding it to the result list, we replace any `::` with `:` to revert the encoding. We then update the current position `i` to be after the delimiter, so we can find the next substring in the next iteration.\n",
-        "\n",
-        "4. Finally, we create an instance of the `Codec` class and test it with two examples:\n",
-        "\n",
-        "By using the `:;` delimiter and handling the `::` escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['lint', 'code', 'love', 'you']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "codec = Codec()\n",
-        "\n",
-        "input1 = [\"lint\", \"code\", \"love\", \"you\"]\n",
-        "encoded1 = codec.encode(input1)\n",
-        "decoded1 = codec.decode(encoded1)\n",
-        "print(decoded1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['we', 'say', ':', 'yes']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "codec = Codec() \n",
-        "\n",
-        "input2 = [\"we\", \"say\", \":\", \"yes\"]\n",
-        "encoded2 = codec.encode(input2)\n",
-        "decoded2 = codec.decode(encoded2)\n",
-        "print(decoded2)  "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `encode` and `decode` methods in the provided code.\n",
-        "\n",
-        "**Encode Method (`encode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Here, `n` is the number of strings in the input list `strs`, and `m` is the average length of these strings.\n",
-        "  - In the worst case, for each string in the list, we iterate over its characters once to replace any colons (`:`) with double colons (`::`) and then append `:;`. This is done for each string in the list.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.\n",
-        "\n",
-        "**Decode Method (`decode`):**\n",
-        "\n",
-        "- Time Complexity: O(n * m)\n",
-        "  - Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the `:;` delimiter.\n",
-        "\n",
-        "- Space Complexity: O(n * m)\n",
-        "  - The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.\n",
-        "\n",
-        "Overall, both the `encode` and `decode` methods have time and space complexities of O(n * m), where `n` is the number of strings in the input list, and `m` is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Delimiters**: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.\n",
-        "\n",
-        "2. **Optimize Encoding**: Modify the `encode` method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/01. Array Hashing/README.md b/docs/_build/html/_sources/01. Array Hashing/README.md
deleted file mode 100644
index a331dab..0000000
--- a/docs/_build/html/_sources/01. Array Hashing/README.md	
+++ /dev/null
@@ -1,27 +0,0 @@
-# Array & Hashing Solutions - Blind 75 LeetCode Problems
-![Array & Hashing Solutions](https://img.shields.io/badge/Array_&_Hashing_Solutions-blue)![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Problems-blue?labelColor=red)
-
-This repository contains my solutions to Array & Hashing Problems from Blind 75 LeetCode problems. I've organized the solutions by categories for easier navigation and reference. Each problem solution is presented in Jupyter Notebook format (`.ipynb`).
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/217.%20Contains%20Duplicate.ipynb)                            | Easy       |
-| [242. Valid Anagram](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/242.%20Valid%20Anagram.ipynb)                                      | Easy       |
-| [1. Two Sum](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/1.%20Two%20Sum.ipynb)                                                      | Easy       |
-| [49. Group Anagrams](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/49.%20Group%20Anagrams.ipynb)                                      | Medium     |
-| [347. Top K Frequent Elements](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.ipynb)              | Medium     |
-| [238. Product of Array Except Self](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.ipynb)  | Medium     |
-| [659. Encode and Decode Strings](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.ipynb)          | Medium     |
-| [128. Longest Consecutive Sequence](https://github.com/mohsentabibian/LeetCode-Solutions/blob/main/01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.ipynb)      | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb b/docs/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb
deleted file mode 100644
index 284c832..0000000
--- a/docs/_build/html/_sources/02. Two Pointers/11. Container With Most Water.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 11. Container With Most Water\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Container With Most Water problem on LeetCode, click here!](https://leetcode.com/problems/container-with-most-water/)\n",
-        "\n",
-        "---\n",
-        "You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the $i^{th}$ line are `(i, 0)` and `(i, height[i])`.\n",
-        "\n",
-        "Find two lines that together with the x-axis form a container, such that the container contains the most water.\n",
-        "\n",
-        "Return *the maximum amount of water a container can store.*\n",
-        "\n",
-        "**Notice** that you may not slant the container.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `n == height.length`\n",
-        "- 2 <= `n` <= $10^5$\n",
-        "- 0 <= `height[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxArea(height):\n",
-        "    # Initialize the maximum area to 0.\n",
-        "    max_area = 0\n",
-        "    # Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.\n",
-        "    left = 0\n",
-        "    right = len(height) - 1\n",
-        "\n",
-        "    # Iterate until the left pointer is less than the right pointer.\n",
-        "    while left < right:\n",
-        "        # Calculate the height of the container, which is the minimum height of the two lines.\n",
-        "        h = min(height[left], height[right])\n",
-        "        # Calculate the width of the container, which is the distance between the two pointers.\n",
-        "        width = right - left\n",
-        "        # Calculate the area of the container using height and width and update max_area if it's greater.\n",
-        "        max_area = max(max_area, h * width)\n",
-        "\n",
-        "        # Move the pointer with the shorter line inward.\n",
-        "        if height[left] < height[right]:\n",
-        "            left += 1\n",
-        "        else:\n",
-        "            right -= 1\n",
-        "\n",
-        "    # Continue this process until left < right, and then return the maximum area.\n",
-        "    return max_area"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with initializing `max_area` to 0, which will store the maximum area of water that can be contained by the lines.\n",
-        "\n",
-        "2. Two pointers, `left` and `right`, are initialized to the beginning and end of the input `height` array.\n",
-        "\n",
-        "3. The main loop runs while `left` is less than `right`. This ensures that we are checking all possible pairs of lines in a systematic way.\n",
-        "\n",
-        "4. Inside the loop:\n",
-        "   - We calculate the height of the container `h` as the minimum of the heights at the `left` and `right` pointers. This represents the height of the water the container can hold.\n",
-        "   - We calculate the width of the container as the difference between `right` and `left`. This represents the distance between the two lines.\n",
-        "   - We calculate the area of the container using `h * width` and update `max_area` if the calculated area is greater than the current `max_area`.\n",
-        "\n",
-        "5. After calculating the area and updating `max_area`, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won't increase the height and will only decrease the width, which will result in a smaller area.\n",
-        "\n",
-        "6. We continue this process until `left` is no longer less than `right`, indicating that we have checked all possible pairs of lines.\n",
-        "\n",
-        "7. Finally, we return the `max_area` which contains the maximum area of water that can be contained by two lines from the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 49\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "height1 = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n",
-        "result1 = maxArea(height1)\n",
-        "print(\"Output:\", result1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "height2 = [1, 1]\n",
-        "result2 = maxArea(height2)\n",
-        "print(\"Output:\", result2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Output: 45\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Additional Example\n",
-        "height3 = [3, 9, 3, 4, 7, 2, 12, 6]\n",
-        "result3 = maxArea(height3)\n",
-        "print(\"Output:\", result3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `maxArea` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the `height` array.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The function uses a constant amount of extra space for variables like `max_area`, `left`, `right`, `h`, and `width`. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.\n",
-        "\n",
-        "**In summary,** the `maxArea` function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.\n",
-        "2. **Variant Problem:** Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You'll need to return the total water volume needed."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb b/docs/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb
deleted file mode 100644
index 8520b3b..0000000
--- a/docs/_build/html/_sources/02. Two Pointers/125. Valid Palindrome.ipynb	
+++ /dev/null
@@ -1,218 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 125. Valid Palindrome\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Palindrome problem on LeetCode, click here!](https://leetcode.com/problems/valid-palindrome/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "A phrase is a **palindrome** if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.\n",
-        "\n",
-        "Given a string `s`, *return `true` if it is a **palindrome**, or `false` otherwise.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $2*10^5$\n",
-        "- `s` consists only of printable ASCII characters.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isPalindrome(s):\n",
-        "    # Step 1: Convert the input string to lowercase\n",
-        "    s = s.lower()\n",
-        "    \n",
-        "    # Step 2: Remove all non-alphanumeric characters from the string\n",
-        "    cleaned_s = ''.join(c for c in s if c.isalnum())\n",
-        "    \n",
-        "    # Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string\n",
-        "    left, right = 0, len(cleaned_s) - 1\n",
-        "    \n",
-        "    # Step 4: Compare characters using the two pointers while moving them towards each other\n",
-        "    while left < right:\n",
-        "        if cleaned_s[left] != cleaned_s[right]:\n",
-        "            return False  # If characters don't match, it's not a palindrome\n",
-        "        left += 1\n",
-        "        right -= 1\n",
-        "    \n",
-        "    # Step 5: If the loop completes without returning False, it's a palindrome\n",
-        "    return True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `isPalindrome` function takes an input string `s`.\n",
-        "\n",
-        "2. It starts by converting the input string to lowercase using `s.lower()`. This step ensures that the function is case-insensitive when checking for palindromes.\n",
-        "\n",
-        "3. Next, it removes all non-alphanumeric characters from the string and stores the result in the `cleaned_s` variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.\n",
-        "\n",
-        "4. The function then initializes two pointers, `left` and `right`, which will be used to compare characters from the beginning and end of the cleaned string.\n",
-        "\n",
-        "5. In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the `left` pointer is less than the `right` pointer. This is done to check all characters in the cleaned string.\n",
-        "\n",
-        "6. Inside the loop, it checks if the characters at the `left` and `right` pointers don't match. If they don't match, it means the input is not a palindrome, so the function returns `False`.\n",
-        "\n",
-        "7. If the characters at the `left` and `right` pointers match, the pointers are moved closer to each other by incrementing `left` and decrementing `right`.\n",
-        "\n",
-        "8. The loop continues to compare characters until it either finds a mismatch (returning `False`) or until the `left` pointer is greater than or equal to the `right` pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns `True`.\n",
-        "\n",
-        "In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string's beginning and end. If all characters match during the comparison, the function returns `True`, indicating that the input is a palindrome. If any characters do not match, it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "input1 = \"A man, a plan, a canal: Panama\"\n",
-        "output1 = isPalindrome(input1)\n",
-        "print(output1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "input2 = \"race a car\"\n",
-        "output2 = isPalindrome(input2)\n",
-        "print(output2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "input3 = \"\"\n",
-        "output3 = isPalindrome(input3)\n",
-        "print(output3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `isPalindrome` function that uses two pointers:\n",
-        "\n",
-        "1. **Time Complexity:**\n",
-        "   - Converting the input string to lowercase using `s.lower()` takes O(n) time, where 'n' is the length of the input string.\n",
-        "   - Removing non-alphanumeric characters using the list comprehension `''.join(c for c in s if c.isalnum())` also takes O(n) time because it iterates through each character in the string once.\n",
-        "   - The comparison of characters using the two pointers (`left` and `right`) is done in a loop that runs until `left` is less than `right`. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).\n",
-        "\n",
-        "   Therefore, the overall time complexity of the `isPalindrome` function is O(n), where 'n' is the length of the input string.\n",
-        "\n",
-        "2. **Space Complexity:**\n",
-        "   - The space complexity is primarily determined by the additional string `cleaned_s` created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.\n",
-        "   - Additionally, the function uses two pointers, `left` and `right`, which consume constant space and do not depend on the size of the input.\n",
-        "\n",
-        "**In summary,** the overall space complexity of the `isPalindrome` function is O(n) in the worst case, where 'n' is the length of the input string. The space complexity is dominated by the space required for `cleaned_s`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Palindromic Substring:** Given a string `s`, find and return the longest palindromic substring within `s`. For example, if `s = \"babad\"`, the function should return `\"bab\"` or `\"aba\"`.\n",
-        "2. **Palindrome with Limited Characters:** Given a string `s` and a list of characters `allowed_chars`, check if `s` is a palindrome considering only the characters from `allowed_chars`. Ignore all other characters. For example, if `s = \"A man, a plan, a canal: Panama\"` and `allowed_chars = ['a', 'm', 'n', 'p']`, the function should return `True`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb b/docs/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb
deleted file mode 100644
index 06de549..0000000
--- a/docs/_build/html/_sources/02. Two Pointers/15. 3Sum.ipynb	
+++ /dev/null
@@ -1,250 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 15. 3Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the 3Sum problem on LeetCode, click here!](https://leetcode.com/problems/3sum/)\n",
-        "\n",
-        "---\n",
-        "Given an integer array nums, *return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.*\n",
-        "\n",
-        "**Notice** that the solution set must not contain duplicate triplets.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `3 <= nums.length <= 3000`\n",
-        "- $-10^5$ <= `nums[i]` <= $10^5$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def threeSum(nums):\n",
-        "    # Sort the input array in ascending order\n",
-        "    nums.sort()\n",
-        "    triplets = []\n",
-        "    \n",
-        "    for i in range(len(nums) - 2):\n",
-        "        # Skip duplicates to avoid duplicate triplets\n",
-        "        if i > 0 and nums[i] == nums[i - 1]:\n",
-        "            continue\n",
-        "        \n",
-        "        left, right = i + 1, len(nums) - 1\n",
-        "        \n",
-        "        while left < right:\n",
-        "            # Calculate the total sum of the current triplet\n",
-        "            total = nums[i] + nums[left] + nums[right]\n",
-        "            \n",
-        "            if total == 0:\n",
-        "                # If the total is zero, we found a valid triplet\n",
-        "                triplets.append([nums[i], nums[left], nums[right]])\n",
-        "                \n",
-        "                # Skip duplicates of left and right pointers\n",
-        "                while left < right and nums[left] == nums[left + 1]:\n",
-        "                    left += 1\n",
-        "                while left < right and nums[right] == nums[right - 1]:\n",
-        "                    right -= 1\n",
-        "                \n",
-        "                # Move the pointers to the next unique elements\n",
-        "                left += 1\n",
-        "                right -= 1\n",
-        "            elif total < 0:\n",
-        "                # If the total is negative, we need to increase the sum by moving the left pointer to the right\n",
-        "                left += 1\n",
-        "            else:\n",
-        "                # If the total is positive, we need to decrease the sum by moving the right pointer to the left\n",
-        "                right -= 1\n",
-        "    \n",
-        "    return triplets"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. It starts by sorting the input array `nums` in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.\n",
-        "\n",
-        "2. It initializes an empty list `triplets` to store the unique triplets that meet the given conditions.\n",
-        "\n",
-        "3. The code then iterates through the `nums` array using a loop with index `i`. This loop will consider each element of the array as a potential starting point for a triplet.\n",
-        "\n",
-        "4. Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If `nums[i]` is the same as the previous element `nums[i-1]`, it continues to the next iteration of the loop.\n",
-        "\n",
-        "5. Two pointers, `left` and `right`, are initialized. `left` starts just after the current element `nums[i]`, and `right` starts at the end of the array.\n",
-        "\n",
-        "6. The code enters another loop with `left` and `right` pointers, trying to find a triplet that sums up to zero.\n",
-        "\n",
-        "7. It calculates the `total` sum of the current triplet as `nums[i] + nums[left] + nums[right]`.\n",
-        "\n",
-        "8. If `total` is zero, it means a valid triplet is found, so it appends `[nums[i], nums[left], nums[right]]` to the `triplets` list. Then, it moves both the `left` and `right` pointers to their next unique elements while skipping duplicates.\n",
-        "\n",
-        "9. If `total` is less than zero, it means the sum is negative, so it increments the `left` pointer to move towards a larger sum.\n",
-        "\n",
-        "10. If `total` is greater than zero, it means the sum is positive, so it decrements the `right` pointer to move towards a smaller sum.\n",
-        "\n",
-        "11. This process continues until all possible triplets have been considered.\n",
-        "\n",
-        "12. Finally, the function returns the `triplets` list, which contains all the unique triplets that sum up to zero in the sorted `nums` array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[-1, -1, 2], [-1, 0, 1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "nums = [-1, 0, 1, 2, -1, -4]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "nums = [0, 1, 1]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "nums = [0, 0, 0]\n",
-        "result = threeSum(nums)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `threeSum` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Sorting the input array `nums` takes O(n log n) time, where n is the length of the array.\n",
-        "\n",
-        "2. The outer loop runs for each element of the array, so it iterates O(n) times.\n",
-        "\n",
-        "3. Inside the outer loop, we have a while loop with two pointers (`left` and `right`). In the worst case, the while loop can iterate O(n) times (when all elements are unique).\n",
-        "\n",
-        "4. Inside the while loop, we have constant time operations (additions, comparisons, and list appends).\n",
-        "\n",
-        "Overall, the time complexity of the `threeSum` function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space used by the `triplets` list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.\n",
-        "\n",
-        "2. Other than the `triplets` list, the function uses only a constant amount of additional space for variables like `i`, `left`, `right`, and `total`.\n",
-        "\n",
-        "Overall, the space complexity of the `threeSum` function is O(k), where k is the number of unique triplets that meet the criteria. It's important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.\n",
-        "- Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Sum Problem:** Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.\n",
-        "2. **Count the Number of Unique Triplets:** Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/02. Two Pointers/README.md b/docs/_build/html/_sources/02. Two Pointers/README.md
deleted file mode 100644
index 0d4c7cf..0000000
--- a/docs/_build/html/_sources/02. Two Pointers/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Two Pointers Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/docs/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
deleted file mode 100644
index 554c940..0000000
--- a/docs/_build/html/_sources/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb	
+++ /dev/null
@@ -1,191 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 121. Best Time to Buy and Sell Stock\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array `prices` where `prices[i]` is the price of a given stock on the $i^{th}$ day.\n",
-        "\n",
-        "You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.\n",
-        "\n",
-        "*Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `prices.length` <= $10^5$\n",
-        "- 0 <= `prices[i]` <= $10^4$\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 65,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def maxProfit(prices):\n",
-        "    if not prices:\n",
-        "        return 0\n",
-        "    \n",
-        "    min_price = prices[0]\n",
-        "    max_profit = 0\n",
-        "    \n",
-        "    for price in prices:\n",
-        "        # Update the minimum price if a lower price is encountered\n",
-        "        min_price = min(min_price, price)\n",
-        "        # Calculate the profit if selling at the current price\n",
-        "        max_profit = max(max_profit, price - min_price)\n",
-        "    \n",
-        "    return max_profit"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- The `maxProfit` function takes a single argument, `prices`, which is a list of stock prices.\n",
-        "- The first line of the function checks if the `prices` list is empty. If it's empty, there are no prices to analyze, so the function returns 0 (no profit can be made).\n",
-        "\n",
-        "- Then, we initialize two variables:\n",
-        "  - `min_price`: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (`prices[0]`).\n",
-        "  - `max_profit`: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven't made any profit.\n",
-        "\n",
-        "- We start iterating through the `prices` list, where `price` represents the stock price for the current day.\n",
-        "\n",
-        "- In each iteration, we check if the current `price` is lower than the `min_price` we've seen so far. If it is, we update `min_price` to the current `price`. This is because we want to buy the stock at the lowest possible price.\n",
-        "\n",
-        "- Next, we calculate the profit we would make if we sold the stock at the current `price` (assuming we bought it at `min_price`). We do this by subtracting `min_price` from the current `price`. This represents the profit for the current day.\n",
-        "\n",
-        "- We also use the `max` function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the `max_profit` we've seen previously, we update `max_profit` with this higher value.\n",
-        "\n",
-        "- Finally, after iterating through all the days in the `prices` list, we return `max_profit`, which represents the maximum profit that can be achieved by buying and selling a single stock."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 66,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "5\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "prices1 = [7, 1, 5, 3, 6, 4]\n",
-        "print(maxProfit(prices1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 67,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "prices2 = [7, 6, 4, 3, 1]\n",
-        "print(maxProfit(prices2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through the `prices` array once, examining each price exactly once.\n",
-        "- Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.\n",
-        "- Therefore, the time complexity of this code is O(n), where n is the length of the `prices` array. It performs a linear number of operations relative to the size of the input.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the code is constant, O(1).\n",
-        "- Regardless of the size of the input `prices` array, the code only uses a fixed amount of additional memory to store two variables (`min_price` and `max_profit`) and a few loop variables.\n",
-        "- The memory usage does not depend on the size of the input, so it is considered constant space complexity.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: O(n) where n is the length of the `prices` array.\n",
-        "- Space Complexity: O(1) (constant space usage)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Transactions Allowed:** Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.\n",
-        "2. **K Transactions Allowed:** Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.\n",
-        "3. **With Transaction Fee:** Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/docs/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
deleted file mode 100644
index 4a516de..0000000
--- a/docs/_build/html/_sources/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb	
+++ /dev/null
@@ -1,214 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 3. Longest Substring Without Repeating Characters\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n",
-        "\n",
-        "---\n",
-        "Given a string `s`, find the length of the **longest substring** without repeating characters.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 0 <= `s.length` <= $5 * 10^4$\n",
-        "- `s` consists of English letters, digits, symbols and spaces.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 61,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def length_of_longest_substring(s):\n",
-        "    # Create a dictionary to store the index of each character's last occurrence.\n",
-        "    char_index = {}\n",
-        "    \n",
-        "    # Initialize variables to keep track of the start and end of the current substring.\n",
-        "    start = 0\n",
-        "    max_length = 0\n",
-        "    \n",
-        "    for end in range(len(s)):\n",
-        "        # If the character is in the dictionary and its last occurrence is after the start of the current substring,\n",
-        "        # update the start of the substring to the next character after its last occurrence.\n",
-        "        if s[end] in char_index and char_index[s[end]] >= start:\n",
-        "            start = char_index[s[end]] + 1\n",
-        "        \n",
-        "        # Update the last occurrence index of the current character.\n",
-        "        char_index[s[end]] = end\n",
-        "        \n",
-        "        # Calculate the length of the current substring and update the maximum length if necessary.\n",
-        "        current_length = end - start + 1\n",
-        "        max_length = max(max_length, current_length)\n",
-        "    \n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a function called `length_of_longest_substring` that takes a single argument `s`, which is the input string for which we want to find the length of the longest substring without repeating characters.\n",
-        "\n",
-        "2. We create a dictionary called `char_index` to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.\n",
-        "\n",
-        "3. We initialize two variables, `start` and `max_length`. \n",
-        "   - `start` represents the start index of the current substring without repeating characters. It starts at 0.\n",
-        "   - `max_length` is used to keep track of the maximum length found so far and is initially set to 0.\n",
-        "\n",
-        "4. We then iterate through the input string `s` using a for loop, where the loop variable `end` represents the current end index of the substring we are considering.\n",
-        "\n",
-        "5. Inside the loop:\n",
-        "   - We check if the character `s[end]` is already in the `char_index` dictionary and if its last occurrence is within or after the current substring. If so, it means that we've encountered a repeating character, and we need to update the `start` of the substring to the next character after the last occurrence of `s[end]`. This ensures that we have a new valid substring without repeating characters.\n",
-        "   - We then update the `char_index` dictionary by storing the current index `end` as the last occurrence index of the character `s[end]`.\n",
-        "\n",
-        "6. Next, we calculate the length of the current substring without repeating characters, which is `current_length = end - start + 1`. We add 1 to account for the fact that the indices are zero-based.\n",
-        "\n",
-        "7. We update the `max_length` with the maximum of its current value and the `current_length`. This step ensures that we keep track of the longest valid substring we have encountered so far.\n",
-        "\n",
-        "8. The loop continues to iterate through the input string, and at the end, we return the `max_length`, which represents the length of the longest substring without repeating characters."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 62,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(length_of_longest_substring(\"abcabcbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 63,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(length_of_longest_substring(\"bbbbb\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 64,
-      "id": "cf04eba0-0ead-4e8b-ba33-4316ea64a9d3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(length_of_longest_substring(\"pwwkew\"))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "Let's analyze the time and space complexity of the `length_of_longest_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through the input string `s` using a single for loop. The loop runs from the beginning of the string to the end once.\n",
-        "- Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.\n",
-        "- Therefore, the time complexity of the function is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The primary data structure that consumes space in this function is the `char_index` dictionary.\n",
-        "- In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.\n",
-        "- Therefore, the space complexity is O(min(n, m)), where n is the length of the input string `s`, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).\n",
-        "- Additionally, there are a few integer variables used for indices and lengths, which consume constant space.\n",
-        "- Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.\n",
-        "\n",
-        "**In summary,** the time complexity of the `length_of_longest_substring` function is O(n), and the space complexity is O(n) in the worst case due to the `char_index` dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Longest Substring with K Distinct Characters:** Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string \"abcabcbb\" and K = 2, the answer would be 4 because the longest substring with two distinct characters is \"abca.\"\n",
-        "2. **Longest Substring with Unique Characters:** Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string \"abcabcbb,\" the answer would be 4 because \"abcd\" is the longest substring with unique characters."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/docs/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
deleted file mode 100644
index 07e96a2..0000000
--- a/docs/_build/html/_sources/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb	
+++ /dev/null
@@ -1,195 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 424. Longest Repeating Character Replacement\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Longest Repeating Character Replacement problem on LeetCode, click here!](https://leetcode.com/problems/longest-repeating-character-replacement/)\n",
-        "\n",
-        "---\n",
-        "You are given a string `s` and an integer `k`. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most `k` times.\n",
-        "\n",
-        "*Return the length of the longest substring containing the same letter you can get after performing the above operations.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^5$\n",
-        "- `s` consists of only uppercase English letters.\n",
-        "- `0 <= k <= s.length`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 58,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def characterReplacement(s, k):\n",
-        "    max_length = 0  # Initialize the maximum length\n",
-        "    max_count = 0   # Initialize the maximum count of repeating characters\n",
-        "    start = 0       # Initialize the start of the sliding window\n",
-        "    char_count = {} # Dictionary to store the count of each character\n",
-        "\n",
-        "    for end in range(len(s)):\n",
-        "        # Update the count of the current character in the dictionary\n",
-        "        char_count[s[end]] = char_count.get(s[end], 0) + 1\n",
-        "        \n",
-        "        # Update the maximum count of repeating characters\n",
-        "        max_count = max(max_count, char_count[s[end]])\n",
-        "        \n",
-        "        # Check if the current window size is greater than k\n",
-        "        if (end - start + 1) - max_count > k:\n",
-        "            # Move the start of the window to the right\n",
-        "            char_count[s[start]] -= 1\n",
-        "            start += 1\n",
-        "        \n",
-        "        # Update the maximum length\n",
-        "        max_length = max(max_length, end - start + 1)\n",
-        "\n",
-        "    return max_length"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We initialize some variables:\n",
-        "   - `max_length` to keep track of the maximum length of the substring containing the same letter.\n",
-        "   - `max_count` to keep track of the maximum count of repeating characters within the current window.\n",
-        "   - `start` to represent the start index of the sliding window.\n",
-        "   - `char_count` is a dictionary that will store the count of each character within the current window.\n",
-        "\n",
-        "2. We use a `for` loop to iterate through the characters of the string `s`.\n",
-        "\n",
-        "3. Inside the loop, we do the following for each character at position `end`:\n",
-        "   - Update the count of the current character in the `char_count` dictionary.\n",
-        "   - Update the `max_count` to be the maximum of the current `max_count` and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.\n",
-        "\n",
-        "4. We check if the current window size (the difference between `end` and `start` plus one) minus the `max_count` is greater than `k`. This condition checks whether we have exceeded the allowed number of replacements (`k`) within the current window.\n",
-        "\n",
-        "   - If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the `start` of the window to the right and decrementing the count of the character at `s[start]` in the `char_count` dictionary. This effectively removes characters from the left side of the window until we have a valid window again.\n",
-        "\n",
-        "   - By doing this, we ensure that the difference between the current window size and the `max_count` is always less than or equal to `k`.\n",
-        "\n",
-        "5. After each character, we update the `max_length` to be the maximum of the current `max_length` and the size of the current window (`end - start + 1`).\n",
-        "\n",
-        "6. Finally, we return `max_length`, which holds the length of the longest substring containing the same letter with at most `k` replacements."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 59,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "s1 = \"ABAB\"\n",
-        "k1 = 2\n",
-        "print(characterReplacement(s1, k1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 60,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "s2 = \"AABABBA\"\n",
-        "k2 = 1\n",
-        "print(characterReplacement(s2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code uses a single `for` loop to iterate through the characters of the input string `s`. The loop runs from the beginning to the end of the string.\n",
-        "- Inside the loop, we perform constant-time operations such as updating the `char_count` dictionary and updating variables like `max_count` and `max_length`.\n",
-        "- The code's time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include `max_length`, `max_count`, `start`, and `char_count`. Therefore, the space complexity is O(1) or constant space.\n",
-        "\n",
-        "**In summary**, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.\n",
-        "2. **Variation with Lowercase Letters:** Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb b/docs/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb
deleted file mode 100644
index 33c2a44..0000000
--- a/docs/_build/html/_sources/03. Sliding Window/76. Minimum Window Substring.ipynb	
+++ /dev/null
@@ -1,273 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 76. Minimum Window Substring\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Minimum Window Substring problem on LeetCode, click here!](https://leetcode.com/problems/minimum-window-substring/)\n",
-        "\n",
-        "---\n",
-        "Given two strings `s` and `t` of lengths `m` and `n` respectively, return *the **minimum window substring** of `s` such that every character in `t` (**including duplicates**) is included in the window. If there is no such substring, return the empty string `\"\"`.*\n",
-        "\n",
-        "The testcases will be generated such that the answer is **unique**.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `m == s.length`\n",
-        "- `n == t.length`\n",
-        "- 1 <= `m, n` <= $10^5$\n",
-        "- `s` and `t` consist of uppercase and lowercase English letters.\n",
-        "\n",
-        "**Follow up**: Could you find an algorithm that runs in $O(m + n)$ time?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 54,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def min_window_substring(s, t):\n",
-        "    if not s or not t:\n",
-        "        return \"\"\n",
-        "\n",
-        "    # Initialize dictionaries to keep track of character counts for t and the current window in s.\n",
-        "    t_dict = {}\n",
-        "    current_window_dict = {}\n",
-        "    \n",
-        "    # Populate t_dict with character counts for string t.\n",
-        "    for char in t:\n",
-        "        t_dict[char] = t_dict.get(char, 0) + 1\n",
-        "\n",
-        "    # Initialize pointers for the sliding window.\n",
-        "    left = 0\n",
-        "    min_len = float('inf')\n",
-        "    min_window = \"\"\n",
-        "    required_chars = len(t_dict)\n",
-        "\n",
-        "    # Initialize a variable to keep track of how many required characters have been found in the current window.\n",
-        "    found_chars = 0\n",
-        "\n",
-        "    # Iterate over the string s using the right pointer.\n",
-        "    for right in range(len(s)):\n",
-        "        char = s[right]\n",
-        "\n",
-        "        # Update the current_window_dict.\n",
-        "        current_window_dict[char] = current_window_dict.get(char, 0) + 1\n",
-        "\n",
-        "        # Check if the current character is a required character and if its count matches the required count.\n",
-        "        if char in t_dict and current_window_dict[char] == t_dict[char]:\n",
-        "            found_chars += 1\n",
-        "\n",
-        "        # Try to minimize the window by moving the left pointer.\n",
-        "        while left <= right and found_chars == required_chars:\n",
-        "            # Calculate the current window size.\n",
-        "            window_size = right - left + 1\n",
-        "\n",
-        "            # If the current window is smaller than the minimum found so far, update min_len and min_window.\n",
-        "            if window_size < min_len:\n",
-        "                min_len = window_size\n",
-        "                min_window = s[left:right+1]\n",
-        "\n",
-        "            # Move the left pointer to the right to shrink the window.\n",
-        "            left_char = s[left]\n",
-        "            current_window_dict[left_char] -= 1\n",
-        "\n",
-        "            # Check if the character removed from the window was a required character.\n",
-        "            if left_char in t_dict and current_window_dict[left_char] < t_dict[left_char]:\n",
-        "                found_chars -= 1\n",
-        "\n",
-        "            # Move the left pointer further to continue shrinking the window.\n",
-        "            left += 1\n",
-        "\n",
-        "    return min_window"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by checking if either of the input strings `s` or `t` is empty. If either of them is empty, we return an empty string since there can't be any valid substring in this case.\n",
-        "\n",
-        "2. We initialize two dictionaries: `t_dict` and `current_window_dict`. These dictionaries will be used to keep track of character counts in the string `t` and the current window in string `s`, respectively.\n",
-        "\n",
-        "3. We populate the `t_dict` dictionary by iterating through string `t`. For each character, we increment its count in the dictionary using `t_dict.get(char, 0) + 1`. This allows us to count the occurrences of each character in `t`.\n",
-        "\n",
-        "4. We initialize two pointers: `left` and `right`. The `left` pointer will represent the start of the current window, and the `right` pointer will represent the end of the current window. We also initialize `min_len` to store the length of the minimum window found so far, and `min_window` to store the actual minimum window substring.\n",
-        "\n",
-        "5. We determine the number of required characters in `t` (i.e., the number of distinct characters in `t`) and store it in the variable `required_chars`.\n",
-        "\n",
-        "6. We initialize a variable `found_chars` to keep track of how many required characters have been found in the current window. Initially, it is set to 0.\n",
-        "\n",
-        "7. We iterate over the string `s` using the `right` pointer. In each iteration, we do the following:\n",
-        "\n",
-        "   - Update the `current_window_dict` by incrementing the count of the current character.\n",
-        "   \n",
-        "   - Check if the current character is a required character (present in `t_dict`) and if its count in the `current_window_dict` matches the required count from `t_dict`. If so, we increment `found_chars`.\n",
-        "\n",
-        "8. After updating the window, we attempt to minimize the window size by moving the `left` pointer to the right. In this step, we:\n",
-        "\n",
-        "   - Calculate the size of the current window.\n",
-        "   \n",
-        "   - If the current window size is smaller than the minimum found so far (`min_len`), we update `min_len` and `min_window` to store the current window substring.\n",
-        "   \n",
-        "   - Move the `left` pointer to the right to shrink the window.\n",
-        "   \n",
-        "   - Check if the character being removed from the window was a required character. If it was, we decrement `found_chars`.\n",
-        "   \n",
-        "   - Continue moving the `left` pointer further to continue shrinking the window if the window still contains all required characters.\n",
-        "\n",
-        "9. Finally, we return `min_window`, which will contain the minimum window substring that contains all characters from `t`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 55,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "BANC\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(min_window_substring(\"ADOBECODEBANC\", \"ABC\"))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 56,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "a\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(min_window_substring(\"a\", \"a\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 57,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": []
-        },
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(min_window_substring(\"a\", \"aa\")) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `min_window_substring` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The main loop iterates through the string `s` from left to right using the `right` pointer. This loop runs in O(m) time, where 'm' is the length of string `s`.\n",
-        "\n",
-        "- Inside the loop, we have a while loop that moves the `left` pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the `left` pointer all the way to the end of the string.\n",
-        "\n",
-        "- Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.\n",
-        "\n",
-        "- The initialization of the `t_dict` dictionary takes O(n) time, where 'n' is the length of string `t`.\n",
-        "\n",
-        "Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string `s`, and the length of string `t` has a smaller impact.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the `t_dict` dictionary, the `current_window_dict` dictionary, and a few variables.\n",
-        "\n",
-        "- The `t_dict` dictionary stores character counts for string `t`. In the worst case, when all characters in `t` are distinct, this dictionary can have a maximum of 'n' key-value pairs. So, the space complexity for `t_dict` is O(n).\n",
-        "\n",
-        "- The `current_window_dict` dictionary stores character counts for the current window. In the worst case, it can have a maximum of 'm' key-value pairs. So, the space complexity for `current_window_dict` is also O(m).\n",
-        "\n",
-        "- Other variables used in the function, such as `left`, `right`, `min_len`, `min_window`, `required_chars`, and `found_chars`, are all of constant size and do not depend on the input sizes.\n",
-        "\n",
-        "**In summary**, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings' lengths. This is because the space used for `t_dict` and `current_window_dict` dominates the space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Smallest Distinct Substring:** Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.\n",
-        "2. **No Extra Space:** Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/03. Sliding Window/README.md b/docs/_build/html/_sources/03. Sliding Window/README.md
deleted file mode 100644
index e1294ff..0000000
--- a/docs/_build/html/_sources/03. Sliding Window/README.md	
+++ /dev/null
@@ -1,19 +0,0 @@
-# Sliding Window Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb b/docs/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb
deleted file mode 100644
index c47292f..0000000
--- a/docs/_build/html/_sources/04. Stack/20. Valid Parentheses.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 20. Valid Parentheses\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Valid Parentheses problem on LeetCode, click here!](https://leetcode.com/problems/valid-parentheses/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given a string s containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.\n",
-        "\n",
-        "An input string is valid if:\n",
-        "\n",
-        "1. Open brackets must be closed by the same type of brackets.\n",
-        "2. Open brackets must be closed in the correct order.\n",
-        "3. Every close bracket has a corresponding open bracket of the same type.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `s.length` <= $10^4$\n",
-        "- `s` consists of parentheses only `'()[]{}'`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 49,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def isValid(s):\n",
-        "    # Create an empty stack to store opening brackets\n",
-        "    stack = []\n",
-        "    \n",
-        "    # Define a mapping for matching brackets\n",
-        "    bracket_mapping = {')': '(', '}': '{', ']': '['}\n",
-        "    \n",
-        "    # Iterate through the characters in the input string\n",
-        "    for char in s:\n",
-        "        # If the character is an opening bracket, push it onto the stack\n",
-        "        if char in bracket_mapping.values():\n",
-        "            stack.append(char)\n",
-        "        # If the character is a closing bracket\n",
-        "        elif char in bracket_mapping.keys():\n",
-        "            # Pop the top element from the stack if it exists, or use a dummy value '#'\n",
-        "            top_element = stack.pop() if stack else '#'\n",
-        "            # If the popped element does not match the corresponding opening bracket, return False\n",
-        "            if bracket_mapping[char] != top_element:\n",
-        "                return False\n",
-        "        # If the character is not a bracket, ignore it\n",
-        "        \n",
-        "    # After processing the entire string, if there are any unmatched opening brackets left in the stack, return False\n",
-        "    return len(stack) == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining the `isValid` function that takes a single argument `s`, which is the input string containing parentheses and brackets.\n",
-        "\n",
-        "2. Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.\n",
-        "\n",
-        "3. We define a `bracket_mapping` dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.\n",
-        "\n",
-        "4. We iterate through each character `char` in the input string `s` using a `for` loop.\n",
-        "\n",
-        "5. If the character `char` is an opening bracket (i.e., it exists in the `values()` of `bracket_mapping`), we push it onto the stack using the `append()` method.\n",
-        "\n",
-        "6. If the character `char` is a closing bracket (i.e., it exists in the `keys()` of `bracket_mapping`), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in `top_element`. We use a dummy value `'#'` if the stack is empty to avoid errors.\n",
-        "\n",
-        "7. We then compare `top_element` with the corresponding opening bracket using `bracket_mapping[char]`. If they do not match, it means the string is not valid, and we return `False`.\n",
-        "\n",
-        "8. If the character `char` is not a bracket, we simply ignore it and continue the loop.\n",
-        "\n",
-        "9. After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return `True`. Otherwise, we return `False`.\n",
-        "\n",
-        "10. Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 50,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "print(isValid(\"()\"))    "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 51,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "print(isValid(\"()[]{}\")) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 52,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "print(isValid(\"(]\"))     "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `isValid` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The function iterates through each character in the input string `s` once, performing constant-time operations for each character.\n",
-        "- Pushing and popping elements from the stack (list) also takes constant time in most cases.\n",
-        "- Therefore, the overall time complexity of the function is $O(n)$, where $n$ is the length of the input string `s`.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the function is determined by the space used by the stack and the `bracket_mapping` dictionary.\n",
-        "- In the worst case, if the input string `s` consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of $O(n)$ in terms of the stack.\n",
-        "- The `bracket_mapping` dictionary has a constant number of key-value pairs (3 pairs in this case).\n",
-        "- Therefore, the overall space complexity of the function is $O(n)$, where $n$ is the length of the input string `s`, mainly due to the stack space.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity is $O(n)$ because we iterate through the string once.\n",
-        "- The space complexity is $O(n)$ due to the stack used to keep track of opening brackets."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Valid Expressions:** Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as \"$2 * (3 + 5) / (4 - 2)$\".\n",
-        "2. **Valid Parentheses Combinations:**\n",
-        "Write a function to generate all valid combinations of n pairs of parentheses, where $n$ is a positive integer. For example, for $n = 3$, the valid combinations are [\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\"]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/04. Stack/README.md b/docs/_build/html/_sources/04. Stack/README.md
deleted file mode 100644
index 2ed115b..0000000
--- a/docs/_build/html/_sources/04. Stack/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Stack Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/docs/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
deleted file mode 100644
index 98f2331..0000000
--- a/docs/_build/html/_sources/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,228 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 153. Find Minimum in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Suppose an array of length `n` sorted in ascending order is **rotated** between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:\n",
-        "\n",
-        "- `[4,5,6,7,0,1,2]` if it was rotated `4` times.\n",
-        "- `[0,1,2,4,5,6,7]` if it was rotated `7` times.\n",
-        "\n",
-        "Notice that **rotating** an array `[a[0], a[1], a[2], ..., a[n-1]]` 1 time results in the array `[a[n-1], a[0], a[1], a[2], ..., a[n-2]]`.\n",
-        "\n",
-        "Given the sorted rotated array `nums` of **unique** elements, return *the minimum element of this array.*\n",
-        "\n",
-        "You must write an algorithm that runs in $O(log\\ n)$ time.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `n == nums.length`\n",
-        "- `1 <= n <= 5000`\n",
-        "- `-5000 <= nums[i] <= 5000`\n",
-        "- All the integers of `nums` are **unique**.\n",
-        "- `nums` is sorted and rotated between `1` and `n` times."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 39,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def findMin(nums):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "    \n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "        \n",
-        "        # If the mid element is greater than the rightmost element,\n",
-        "        # it means the minimum element is in the right half.\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        # If the mid element is less than or equal to the rightmost element,\n",
-        "        # it means the minimum element is in the left half or at the mid itself.\n",
-        "        else:\n",
-        "            right = mid\n",
-        "    \n",
-        "    # The loop will break when left and right converge to the minimum element.\n",
-        "    # At this point, left (or right) will be pointing to the minimum element.\n",
-        "    return nums[left]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The function `findMin(nums)` takes an input list `nums`, which represents the rotated sorted array.\n",
-        "\n",
-        "2. Initialize two pointers `left` and `right` to track the current search range. Initially, `left` is set to 0 (the beginning of the array), and `right` is set to `len(nums) - 1` (the end of the array).\n",
-        "\n",
-        "3. Enter a `while` loop with the condition `left < right`. This loop continues until `left` and `right` converge to a single element, which will be the minimum element in the rotated array.\n",
-        "\n",
-        "4. Inside the loop, calculate the middle index `mid` using integer division. This helps in finding the middle element of the current search range.\n",
-        "\n",
-        "5. Check if the element at the middle index (`nums[mid]`) is greater than the element at the rightmost index (`nums[right]`). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update `left` to `mid + 1`, effectively eliminating the left half of the search range.\n",
-        "\n",
-        "6. If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the `mid` index itself. In this case, update `right` to `mid`, effectively eliminating the right half of the search range.\n",
-        "\n",
-        "7. Repeat steps 4-6 until `left` and `right` converge to the minimum element.\n",
-        "\n",
-        "8. When the loop exits, it means that `left` (or `right`) points to the minimum element in the array.\n",
-        "\n",
-        "9. Return `nums[left]` (or `nums[right]`) as the result, which is the minimum element in the rotated sorted array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 43,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1:\n",
-        "nums1 = [3, 4, 5, 1, 2]\n",
-        "print(findMin(nums1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 41,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "0\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "print(findMin(nums2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 42,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "11\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [11, 13, 15, 17]\n",
-        "print(findMin(nums3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this code is $O(log\\ n)$, where '$n$' is the length of the input array `nums`. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.\n",
-        "\n",
-        "In each iteration of the `while` loop, the search range is halved, and this process continues until the `left` and `right` pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.\n",
-        "\n",
-        "Therefore, the binary search used in this code runs in $O(log\\ n)$ time complexity.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of this code is $O(1)$, which means it uses a constant amount of additional space that does not depend on the size of the input array.\n",
-        "\n",
-        "The algorithm uses a fixed number of variables (`left`, `right`, `mid`) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. Solve the problem with a variation where the input array may contain duplicates.\n",
-        "\n",
-        "2. Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in $O(log\\ n)$ time.\n",
-        "\n",
-        "3. Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in $O(log\\ n)$ time?\n",
-        "\n",
-        "4. Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in $O(log\\ n)$ time."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/docs/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
deleted file mode 100644
index d8d4202..0000000
--- a/docs/_build/html/_sources/05. Binary Search/33. Search in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 33. Search in Rotated Sorted Array\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Search in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is an integer array `nums` sorted in ascending order (with **distinct** values).\n",
-        "\n",
-        "Prior to being passed to your function, `nums` is **possibly rotated** at an unknown pivot index `k (1 <= k < nums.length)` such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]` (**0-indexed**). For example, `[0,1,2,4,5,6,7]` might be rotated at pivot index 3 and become `[4,5,6,7,0,1,2]`.\n",
-        "\n",
-        "Given the array `nums` **after** the possible rotation and an integer `target`, return *the index of `target` if it is in `nums`, or `-1` if it is not in `nums`.*\n",
-        "\n",
-        "You must write an algorithm with $O(log\\ n)$ runtime complexity.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `1 <= nums.length <= 5000`\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- All values of `nums` are **unique**.\n",
-        "- `nums` is an ascending array that is possibly rotated.\n",
-        "- $-10^4$ <= `target` <= $10^4$"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 44,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def search(nums, target):\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Find the pivot index using binary search\n",
-        "    while left < right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] > nums[right]:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid\n",
-        "\n",
-        "    pivot = left\n",
-        "    left, right = 0, len(nums) - 1\n",
-        "\n",
-        "    # Determine which part of the array to search in\n",
-        "    if target >= nums[pivot] and target <= nums[right]:\n",
-        "        left = pivot\n",
-        "    else:\n",
-        "        right = pivot\n",
-        "\n",
-        "    # Perform binary search to find the target\n",
-        "    while left <= right:\n",
-        "        mid = left + (right - left) // 2\n",
-        "\n",
-        "        if nums[mid] == target:\n",
-        "            return mid\n",
-        "        elif nums[mid] < target:\n",
-        "            left = mid + 1\n",
-        "        else:\n",
-        "            right = mid - 1\n",
-        "\n",
-        "    return -1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The `search` function takes two arguments: `nums`, which is the rotated sorted array, and `target`, which is the value we want to find in the array.\n",
-        "\n",
-        "2. We initialize two pointers, `left` and `right`, which represent the range in which we are going to perform binary search. Initially, `left` is set to 0, and `right` is set to the index of the last element in the array (`len(nums) - 1`).\n",
-        "\n",
-        "3. We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a `while` loop to continue the search until `left` is less than `right`.\n",
-        "\n",
-        "4. Inside the loop, we calculate the middle index `mid` using integer division. We then compare the value at `mid` with the value at `right`. If `nums[mid]` is greater than `nums[right]`, it means the pivot point lies to the right of `mid`, so we update `left` to `mid + 1`. Otherwise, the pivot point lies to the left of `mid`, so we update `right` to `mid`. This process continues until we find the pivot index.\n",
-        "\n",
-        "5. After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.\n",
-        "\n",
-        "6. We reset `left` and `right` pointers. If the target value is within the range `[nums[pivot], nums[right]]`, we set `left` to `pivot` (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set `right` to `pivot` (the end of the sorted part), indicating that we should search in the sorted part.\n",
-        "\n",
-        "7. We then perform binary search again within the chosen range (`left` to `right`) to find the target element. The binary search continues until `left` is less than or equal to `right`.\n",
-        "\n",
-        "8. Inside the binary search loop, we calculate the middle index `mid` and compare `nums[mid]` with the target value. If they are equal, we return `mid` as the index of the target element. If `nums[mid]` is less than the target, we update `left` to `mid + 1` to search in the right half. If `nums[mid]` is greater than the target, we update `right` to `mid - 1` to search in the left half.\n",
-        "\n",
-        "9. If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 45,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n"
-          ]
-        }
-      ],
-      "source": [
-        "nums1 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target1 = 0\n",
-        "result1 = search(nums1, target1)\n",
-        "print(result1) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 46,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-        "target2 = 3\n",
-        "result2 = search(nums2, target2)\n",
-        "print(result2) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 47,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "-1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "nums3 = [1]\n",
-        "target3 = 0\n",
-        "result3 = search(nums3, target3)\n",
-        "print(result3) "
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Finding the pivot index using binary search takes $O(log\\ n)$ time, where '$n$' is the number of elements in the array.\n",
-        "2. After finding the pivot index, performing binary search to find the target element also takes $O(log\\ n)$ time in the worst case.\n",
-        "\n",
-        "The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is $O(log\\ n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is very minimal:\n",
-        "\n",
-        "1. We use a constant amount of additional space for variables such as `left`, `right`, `pivot`, and `mid`. These variables do not depend on the input size, so they contribute $O(1)$ space complexity.\n",
-        "2. The function does not use any additional data structures that scale with the input size.\n",
-        "\n",
-        "Therefore, the space complexity of the code is $O(1)$, which means it has a constant space complexity and does not depend on the size of the input array.\n",
-        "\n",
-        "**In summary:**\n",
-        "- Time Complexity: $O(log\\ n)$\n",
-        "- Space Complexity: $O(1)$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find Minimum Element in Rotated Sorted Array**: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don't need to search for a target value but instead find the smallest element.\n",
-        "\n",
-        "2. **Search in a Circularly Sorted Array**: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining $O(log\\ n)$ complexity."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/05. Binary Search/README.md b/docs/_build/html/_sources/05. Binary Search/README.md
deleted file mode 100644
index 6086b9b..0000000
--- a/docs/_build/html/_sources/05. Binary Search/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Binary search Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb b/docs/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb
deleted file mode 100644
index 0336bc8..0000000
--- a/docs/_build/html/_sources/06. Linked List/141. Linked List Cycle.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 141. Linked List Cycle\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Linked List Cycle problem on LeetCode, click here!](https://leetcode.com/problems/linked-list-cycle/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given `head`, the head of a linked list, determine if the linked list has a cycle in it.\n",
-        "\n",
-        "There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is connected to. **Note that `pos` is not passed as a parameter.**\n",
-        "\n",
-        "Return `true` if there is a cycle in the linked list. Otherwise, return `false`.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of the nodes in the list is in the range $[0, 10^4]$.\n",
-        "- $-10^5$ <= Node.val <= $10^5$\n",
-        "- `pos` is `-1` or a **valid index** in the linked-list.\n",
-        "\n",
-        "**Follow up:** Can you solve it using $O(1)$ (i.e. constant) memory?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0):\n",
-        "        self.val = val\n",
-        "        self.next = None\n",
-        "\n",
-        "class Solution:\n",
-        "    def hasCycle(self, head: ListNode) -> bool:\n",
-        "        if not head:\n",
-        "            return False\n",
-        "        \n",
-        "        slow = head\n",
-        "        fast = head\n",
-        "        \n",
-        "        while fast and fast.next:\n",
-        "            slow = slow.next\n",
-        "            fast = fast.next.next\n",
-        "            \n",
-        "            if slow == fast:\n",
-        "                return True\n",
-        "        \n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a class `Solution` with a method `hasCycle` for determining if a linked list has a cycle.\n",
-        "\n",
-        "The `ListNode` class represents nodes in the linked list, where each node has a `val` (a value associated with the node) and a `next` attribute (a reference to the next node in the list).\n",
-        "\n",
-        "The `hasCycle` method takes the `head` of a linked list as input and returns `True` if there is a cycle in the linked list, and `False` otherwise. It uses two pointers, `slow` and `fast`, to traverse the linked list. If there is a cycle, the `fast` pointer will eventually catch up to the `slow` pointer.\n",
-        "\n",
-        "The algorithm works as follows:\n",
-        "1. It checks if the input `head` is `None` (an empty list). If it is, the method returns `False` because an empty list can't have a cycle.\n",
-        "2. Two pointers, `slow` and `fast`, initially point to the `head` of the list.\n",
-        "3. The code enters a `while` loop where `fast` moves two steps at a time, and `slow` moves one step at a time.\n",
-        "4. If there is a cycle, `fast` will eventually catch up to `slow`, and the method returns `True`.\n",
-        "5. If the loop completes without finding a cycle, the method returns `False`."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list with a cycle\n",
-        "def create_linked_list_with_cycle(values, pos):\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "    cycle_node = None\n",
-        "    \n",
-        "    for i, val in enumerate(values):\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "        \n",
-        "        if i == pos:\n",
-        "            cycle_node = current\n",
-        "    \n",
-        "    if cycle_node:\n",
-        "        current.next = cycle_node\n",
-        "    \n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:\n",
-        "\n",
-        "1. `values`: A list of values representing the nodes in the linked list.\n",
-        "2. `pos`: An integer representing the index of the node where the cycle begins.\n",
-        "\n",
-        "Here's how the function works:\n",
-        "\n",
-        "- It starts by creating an empty `ListNode` called `dummy`. This `dummy` node is used to simplify the creation of the linked list.\n",
-        "- It initializes a `current` pointer to the `dummy` node. This pointer will be used to traverse the linked list.\n",
-        "- It initializes a `cycle_node` variable to `None`. This variable will hold the reference to the node where the cycle begins, if any.\n",
-        "- It then iterates through the `values` list, creating a new `ListNode` for each value and appending it to the linked list.\n",
-        "- Inside the loop, it checks if the current index `i` is equal to the specified `pos`. If they match, it sets `cycle_node` to the current node. This simulates the creation of a cycle in the linked list.\n",
-        "- After the loop, if `cycle_node` is not `None` (indicating a cycle should be created), it connects the last node in the linked list to `cycle_node`, effectively creating a cycle.\n",
-        "- Finally, it returns the reference to the first node of the linked list (not the `dummy` node).\n",
-        "\n",
-        "This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It's particularly useful for testing the code's ability to detect cycles in linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "head = [3,2,0,-4]\n",
-        "pos = 1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "head = [1,2]\n",
-        "pos = 0\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 22,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "head = [1]\n",
-        "pos = -1\n",
-        "\n",
-        "head = create_linked_list_with_cycle(head, pos)\n",
-        "solution = Solution()\n",
-        "result = solution.hasCycle(head)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the code for detecting a cycle in a linked list:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is $O(n)$, where \"$n$\" is the number of nodes in the linked list.\n",
-        "\n",
-        "The reason for this is that both the `slow` and `fast` pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the `fast` pointer will reach the end of the list after going through approximately $n/2$ nodes. In the case of a cycle, it may take some extra iterations for the `fast` pointer to catch up to the `slow` pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it $O(n)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is $O(1)$, which means it uses constant space.\n",
-        "\n",
-        "The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (`slow` and `fast`) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.\n",
-        "\n",
-        "**In summary**, this code efficiently detects cycles in a linked list with a time complexity of $O(n)$ and a space complexity of $O(1)$. It is an example of an algorithm that solves a complex problem with minimal memory usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/143. Reorder List.ipynb b/docs/_build/html/_sources/06. Linked List/143. Reorder List.ipynb
deleted file mode 100644
index a83545b..0000000
--- a/docs/_build/html/_sources/06. Linked List/143. Reorder List.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 143. Reorder List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Reorder List problem on LeetCode, click here!](https://leetcode.com/problems/reorder-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the head of a singly linked-list. The list can be represented as:\n",
-        "\n",
-        "$L_0 → L_1 → … → L_{n - 1} → L_n$\n",
-        "\n",
-        "Reorder the list to be on the following form:\n",
-        "\n",
-        "$L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …$\n",
-        "\n",
-        "You may not modify the values in the list's nodes. Only nodes themselves may be changed.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is in the range $[1, 5 * 10^4]$.\n",
-        "- `1 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 28,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def reorderList(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    # Step 1: Find the middle of the linked list\n",
-        "    slow, fast = head, head\n",
-        "    while fast.next and fast.next.next:\n",
-        "        slow = slow.next\n",
-        "        fast = fast.next.next\n",
-        "\n",
-        "    # Split the list into two halves\n",
-        "    first_half = head\n",
-        "    second_half = slow.next\n",
-        "    slow.next = None\n",
-        "\n",
-        "    # Step 2: Reverse the second half of the linked list\n",
-        "    prev = None\n",
-        "    current = second_half\n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    second_half = prev\n",
-        "\n",
-        "    # Step 3: Merge the first and reversed second halves alternately\n",
-        "    p1, p2 = first_half, second_half\n",
-        "    while p2:\n",
-        "        next_p1 = p1.next\n",
-        "        next_p2 = p2.next\n",
-        "        p1.next = p2\n",
-        "        p2.next = next_p1\n",
-        "        p1 = next_p1\n",
-        "        p2 = next_p2\n",
-        "\n",
-        "    return head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `reorderList` function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here's a detailed explanation of how the function works:\n",
-        "\n",
-        "1. **Base Cases Handling**:\n",
-        "   - The function first checks if the input linked list is empty (`not head`) or contains only one element (`not head.next`). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.\n",
-        "\n",
-        "2. **Finding the Middle of the Linked List**:\n",
-        "   - To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, `slow` and `fast`, initialized to the head of the list.\n",
-        "   - `slow` moves one step at a time while `fast` moves two steps at a time. When `fast` reaches the end of the list or the second-to-last node, `slow` will be at the middle node.\n",
-        "\n",
-        "3. **Splitting the List**:\n",
-        "   - After finding the middle node, we split the list into two halves:\n",
-        "     - The first half, `first_half`, contains nodes from the beginning up to the middle.\n",
-        "     - The second half, `second_half`, contains nodes from the middle to the end.\n",
-        "   - To split the list, we set the `next` pointer of the node before the middle node to `None`.\n",
-        "\n",
-        "4. **Reversing the Second Half**:\n",
-        "   - We reverse the second half of the linked list using the `prev`, `current`, and `next_node` pointers.\n",
-        "   - `prev` is initially `None`, and we iterate through the second half. For each node, we:\n",
-        "     - Set the `next` of the current node to `prev`, effectively reversing the next pointer direction.\n",
-        "     - Update `prev` to the current node.\n",
-        "     - Move to the next node using the `next_node`.\n",
-        "\n",
-        "5. **Merging the Two Halves Alternately**:\n",
-        "   - We now have two linked lists: `first_half` and the reversed `second_half`.\n",
-        "   - We merge these two lists alternately by adjusting the `next` pointers of the nodes.\n",
-        "   - `p1` and `p2` are pointers to the current nodes in `first_half` and `second_half`, respectively.\n",
-        "   - We iterate through both lists while reordering nodes:\n",
-        "     - Set the `next` of `p1` to `p2` to link a node from the first half to a node from the reversed second half.\n",
-        "     - Update `p1` and `p2` to their respective next nodes.\n",
-        "     - Repeat this process until we have processed all nodes in both halves.\n",
-        "\n",
-        "6. **Returning the Reordered List**:\n",
-        "   - After the merging process is complete, the linked list is reordered as specified.\n",
-        "   - The function returns the `head` of the reordered list.\n",
-        "\n",
-        "The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 29,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 30,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 4, 2, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = ListNode(1, ListNode(2, ListNode(3, ListNode(4))))\n",
-        "reorderList(head1)\n",
-        "print(printLinkedList(head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 5, 2, 4, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))\n",
-        "reorderList(head2)\n",
-        "print(printLinkedList(head2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `reorderList` function:\n",
-        "\n",
-        "**Time Complexity**:\n",
-        "1. **Finding the Middle of the Linked List**: In this step, we use two pointers, one moving one step at a time (`slow`) and the other moving two steps at a time (`fast`). This process takes $O(N/2)$ time, where $N$ is the number of nodes in the linked list.\n",
-        "\n",
-        "2. **Splitting the List**: After finding the middle, we split the list into two halves by setting the `next` pointer of the node before the middle node to `None`. This step takes $O(1)$ time.\n",
-        "\n",
-        "3. **Reversing the Second Half**: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes $O(N/2)$ time.\n",
-        "\n",
-        "4. **Merging the Two Halves Alternately**: In this step, we merge the two halves alternately by adjusting the `next` pointers of the nodes. We iterate through both halves once, so this step takes $O(N/2)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the `reorderList` function is dominated by the steps involving reversing and merging the two halves, both of which take $O(N/2)$ time. Therefore, the total time complexity is $O(N)$.\n",
-        "\n",
-        "**Space Complexity**:\n",
-        "The space complexity of the `reorderList` function is primarily determined by the variables and data structures used within the function. Let's break down the space complexity components:\n",
-        "\n",
-        "1. **Constant Space Variables**: The variables `slow`, `fast`, `prev`, `current`, `next_node`, `p1`, and `p2` are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute $O(1)$ to the space complexity.\n",
-        "\n",
-        "2. **Split Linked Lists**: In the splitting step, we create two new linked list segments (`first_half` and `second_half`) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, $O(N/2)$. \n",
-        "\n",
-        "3. **Reversed Second Half**: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn't contribute to additional space complexity.\n",
-        "\n",
-        "4. **Overall**: Combining the above components, the total space complexity is $O(N/2)$, which simplifies to $O(N)$ in terms of space complexity.\n",
-        "\n",
-        "**In summary**, the `reorderList` function has a time complexity of $O(N)$ and a space complexity of $O(N)$ due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reorder by K Elements:** Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by $K$ elements at a time. For example, for $K=3$, you would reorder it as ($L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...$).\n",
-        "You may need to handle cases where the number of nodes is not a multiple of $K$.\n",
-        "\n",
-        "2. **Reorder by Odd and Even Nodes:** Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, ($L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...$)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb b/docs/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb
deleted file mode 100644
index 263124e..0000000
--- a/docs/_build/html/_sources/06. Linked List/19. Remove Nth Node From End of List.ipynb	
+++ /dev/null
@@ -1,278 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 19. Remove Nth Node From End of List\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Remove Nth Node From End of List problem on LeetCode, click here!](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the head of a linked list, remove the $n^{th}$ node from the end of the list and return its head.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is `sz`.\n",
-        "- `1 <= sz <= 30`\n",
-        "- `0 <= Node.val <= 100`\n",
-        "- `1 <= n <= sz`\n",
-        "\n",
-        "**Follow up:** Could you do this in one pass?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 23,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def removeNthFromEnd(head, n):\n",
-        "    # Create a dummy node to handle the case of removing the head node.\n",
-        "    dummy = ListNode(0)\n",
-        "    dummy.next = head\n",
-        "    first = dummy\n",
-        "    second = dummy\n",
-        "    \n",
-        "    # Advance the first pointer by n+1 nodes.\n",
-        "    for _ in range(n + 1):\n",
-        "        first = first.next\n",
-        "    \n",
-        "    # Move both pointers simultaneously until first reaches the end.\n",
-        "    while first is not None:\n",
-        "        first = first.next\n",
-        "        second = second.next\n",
-        "    \n",
-        "    # Remove the nth node by updating the next pointer of the previous node.\n",
-        "    second.next = second.next.next\n",
-        "    \n",
-        "    return dummy.next  # Return the modified head of the linked list"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `ListNode` class to represent individual nodes in a linked list. Each node has two attributes: `val` (the value of the node) and `next` (a reference to the next node in the list).\n",
-        "\n",
-        "2. The `removeNthFromEnd` function takes the head of a linked list (`head`) and the value `n`, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.\n",
-        "\n",
-        "3. We create a dummy node (`dummy`) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.\n",
-        "\n",
-        "4. We initialize two pointers, `first` and `second`, both initially pointing to the dummy node.\n",
-        "\n",
-        "5. To advance the `first` pointer by `n+1` nodes, we use a `for` loop. This positions the `first` pointer `n` nodes ahead of the `second` pointer.\n",
-        "\n",
-        "6. We then move both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This ensures that the `second` pointer ends up pointing to the node that needs to be removed.\n",
-        "\n",
-        "7. To remove the nth node from the end, we update the `next` pointer of the node pointed to by the `second` pointer to skip over the node to be removed.\n",
-        "\n",
-        "8. Finally, we return `dummy.next`, which is the modified head of the linked list without the removed node.\n",
-        "\n",
-        "9. Additionally, there are two helper functions:\n",
-        "   - `createLinkedList(values)` creates a linked list from a list of values.\n",
-        "   - `convertToList(head)` converts a linked list back into a list of values."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values.\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list of values.\n",
-        "def convertToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions:\n",
-        "\n",
-        "1. `createLinkedList(values)`: This function creates a linked list from a list of values.\n",
-        "\n",
-        "   - Input: `values` is a list containing values that you want to insert into the linked list.\n",
-        "   - Output: The function returns the head of the created linked list.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by checking if the `values` list is empty. If it is, it returns `None` to indicate an empty linked list.\n",
-        "   - If the `values` list is not empty, it creates the first node of the linked list with the value from the first element of `values`.\n",
-        "   - It then iterates through the remaining elements of `values` and creates new nodes for each value, connecting them together using the `next` attribute to form a linked list.\n",
-        "   - Finally, it returns the head of the linked list, which is the first node created.\n",
-        "   \n",
-        "\n",
-        "2. `convertToList(head)`: This function converts a linked list into a list of values.\n",
-        "\n",
-        "   - Input: `head` is the head node of the linked list that you want to convert.\n",
-        "   - Output: The function returns a list containing the values of the nodes in the linked list in order.\n",
-        "\n",
-        "   Explanation:\n",
-        "   - The function starts by initializing an empty list, `result`, to store the values of the linked list nodes.\n",
-        "   - It then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - The iteration continues until it reaches the end of the linked list (i.e., the `next` attribute of the current node becomes `None`).\n",
-        "   - After the iteration is complete, the function returns the `result` list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.\n",
-        "\n",
-        "These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 2, 3, 5]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "head1 = createLinkedList([1, 2, 3, 4, 5])\n",
-        "n1 = 2\n",
-        "new_head1 = removeNthFromEnd(head1, n1)\n",
-        "print(convertToList(new_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "head2 = createLinkedList([1])\n",
-        "n2 = 1\n",
-        "new_head2 = removeNthFromEnd(head2, n2)\n",
-        "print(convertToList(new_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 27,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "head3 = createLinkedList([1, 2])\n",
-        "n3 = 1\n",
-        "new_head3 = removeNthFromEnd(head3, n3)\n",
-        "print(convertToList(new_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Certainly! Let's analyze the time and space complexity of the `removeNthFromEnd` function in isolation:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The `removeNthFromEnd` function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length $N$.\n",
-        "- The first pass positions the `first` pointer $n$ nodes ahead of the `second` pointer. This pass takes $O(N)$ time because it involves iterating through all N nodes.\n",
-        "- The second pass moves both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This also takes $O(N)$ time in the worst case.\n",
-        "- Therefore, the overall time complexity of the `removeNthFromEnd` function is $O(N)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The `removeNthFromEnd` function uses a constant amount of extra space for its variables (e.g., `first`, `second`, and `dummy`). This space usage does not depend on the size of the linked list.\n",
-        "- The space complexity is $O(1)$, indicating that the space used by the function is constant and independent of the size of the input linked list.\n",
-        "\n",
-        "**In summary**, the `removeNthFromEnd` function has a time complexity of $O(N)$ and a space complexity of $O(1)$. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb b/docs/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb
deleted file mode 100644
index c97de2d..0000000
--- a/docs/_build/html/_sources/06. Linked List/206. Reverse Linked List.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 206. Reverse Linked List\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Reverse Linked List problem on LeetCode, click here!](https://leetcode.com/problems/reverse-linked-list/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `head` of a singly linked list, reverse the list, and return the reversed list.\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the list is the range `[0, 5000]`.\n",
-        "- `-5000 <= Node.val <= 5000`\n",
-        "\n",
-        "**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both?"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 33,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "# Function to reverse a linked list iteratively\n",
-        "def reverseListIterative(head):\n",
-        "    prev = None\n",
-        "    current = head\n",
-        "    \n",
-        "    while current:\n",
-        "        next_node = current.next\n",
-        "        current.next = prev\n",
-        "        prev = current\n",
-        "        current = next_node\n",
-        "    \n",
-        "    return prev\n",
-        "\n",
-        "# Function to reverse a linked list recursively\n",
-        "def reverseListRecursive(head):\n",
-        "    if not head or not head.next:\n",
-        "        return head\n",
-        "\n",
-        "    new_head = reverseListRecursive(head.next)\n",
-        "    head.next.next = head\n",
-        "    head.next = None\n",
-        "\n",
-        "    return new_head"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `reverseListIterative(head)`: This function reverses a linked list iteratively using a loop. Here's a step-by-step explanation:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - It initializes two pointers, `prev` and `current`, initially set to `None` and the `head` of the list, respectively.\n",
-        "   - It enters a `while` loop that continues until `current` reaches the end of the list (i.e., becomes `None`).\n",
-        "   - Inside the loop:\n",
-        "     - It stores the `next_node` which is the next node after `current`.\n",
-        "     - It updates the `next` pointer of `current` to point to the `prev` node. This effectively reverses the link direction.\n",
-        "     - It moves `prev` to `current` and `current` to `next_node`, advancing the pointers one step further in the list.\n",
-        "   - Once the loop completes, `prev` will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns `prev`.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`: This function reverses a linked list recursively. Here's how it works:\n",
-        "\n",
-        "   - It takes the `head` of the input linked list as a parameter.\n",
-        "   - The base case is checked: if `head` is `None` or `head.next` is `None`, meaning the list is empty or has only one node, it returns `head` as there's no need to reverse a list with zero or one element.\n",
-        "   - In the recursive case:\n",
-        "     - It calls itself with `head.next`, effectively moving down the list until it reaches the end.\n",
-        "     - Once it reaches the end, it starts reversing the links:\n",
-        "       - `head.next.next` is set to `head`, reversing the link between `head` and the next node.\n",
-        "       - `head.next` is set to `None` to avoid cycles.\n",
-        "   - Finally, it returns the new head of the reversed list, which will be the last node of the original list.\n",
-        "\n",
-        "**In summary,** `reverseListIterative` reverses the linked list by iterating through it and changing the next pointers, while `reverseListRecursive` reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 36,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to create a linked list from a list of values\n",
-        "def createLinkedList(values):\n",
-        "    if not values:\n",
-        "        return None\n",
-        "    head = ListNode(values[0])\n",
-        "    current = head\n",
-        "    for val in values[1:]:\n",
-        "        current.next = ListNode(val)\n",
-        "        current = current.next\n",
-        "    return head\n",
-        "\n",
-        "# Helper function to convert a linked list to a list for testing\n",
-        "def linkedListToList(head):\n",
-        "    result = []\n",
-        "    current = head\n",
-        "    while current:\n",
-        "        result.append(current.val)\n",
-        "        current = current.next\n",
-        "    return result\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the two helper functions used in the provided code:\n",
-        "\n",
-        "1. `createLinkedList(values)`:\n",
-        "\n",
-        "   - Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It first checks if the input list `values` is empty. If it's empty, it returns `None` to indicate an empty linked list.\n",
-        "     - If `values` is not empty, it initializes a `head` node with the value of the first element in `values`.\n",
-        "     - It then iterates through the remaining values in `values`, creating new nodes for each value and linking them together to form a linked list.\n",
-        "     - Finally, it returns the `head` node of the newly created linked list.\n",
-        "\n",
-        "2. `linkedListToList(head)`:\n",
-        "\n",
-        "   - Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.\n",
-        "\n",
-        "   - How it works:\n",
-        "     - It takes the `head` of the linked list as input.\n",
-        "     - It initializes an empty list called `result`.\n",
-        "     - It then iterates through the linked list, starting from `head`, and appends each node's `val` (value) to the `result` list.\n",
-        "     - This process continues until the end of the linked list is reached.\n",
-        "     - Finally, it returns the `result` list, which contains the values from the linked list in the same order.\n",
-        "\n",
-        "These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 35,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[1, 1, 2, 3, 4, 4]"
-            ]
-          },
-          "execution_count": 35,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 1: Iterative\n",
-        "head1 = [1,2,3,4,5]\n",
-        "head1 = createLinkedList(head1)\n",
-        "reversed_head1 = reverseListIterative(head1)\n",
-        "print(linkedListToList(reversed_head1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 31,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[]"
-            ]
-          },
-          "execution_count": 37,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 2: Recursive\n",
-        "head2 = [1,2]\n",
-        "head2 = createLinkedList(head2)\n",
-        "reversed_head2 = reverseListRecursive(head2)\n",
-        "print(linkedListToList(reversed_head2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 38,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "data": {
-            "text/plain": [
-              "[0]"
-            ]
-          },
-          "execution_count": 38,
-          "metadata": {},
-          "output_type": "execute_result"
-        }
-      ],
-      "source": [
-        "# Example 3: Empty list\n",
-        "head3 = []\n",
-        "head3 = createLinkedList(head3)\n",
-        "reversed_head3 = reverseListIterative(head3)\n",
-        "print(linkedListToList(reversed_head3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the two functions:\n",
-        "\n",
-        "1. `reverseListIterative(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The iterative function visits each node in the linked list exactly once in a single pass, where \"$n$\" is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(1)$\n",
-        "     - This function uses a constant amount of extra space for the `prev`, `current`, and `next_node` pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.\n",
-        "\n",
-        "2. `reverseListRecursive(head)`:\n",
-        "\n",
-        "   - Time Complexity: $O(n)$\n",
-        "     - The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is $O(n)$, where \"$n$\" is the number of nodes.\n",
-        "\n",
-        "   - Space Complexity: $O(n)$\n",
-        "     - The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has \"$n$\" nodes, it will create \"$n$\" recursive function calls on the stack, resulting in a space complexity of $O(n)$. This is because each function call stores information about its state, including the `head` pointer, until it reaches the base case and starts returning.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- The time complexity of both functions is $O(n)$ because they both visit each node once.\n",
-        "- The space complexity of `reverseListIterative` is $O(1)$ because it uses a constant amount of extra space.\n",
-        "- The space complexity of `reverseListRecursive` is $O(n)$ due to the recursive function calls and the associated call stack space.\n",
-        "\n",
-        "Both functions are efficient in terms of time complexity, but `reverseListIterative` is more memory-efficient because it uses a constant amount of additional space, while `reverseListRecursive` uses space on the call stack proportional to the number of nodes in the list."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **K-Group Reverse:** Modify the reverseListIterative function to reverse the linked list in groups of $K$ elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and $K$ is 3, the output should be [3, 2, 1, 6, 5, 4].\n",
-        "\n",
-        "2. **Rotate Linked List:** Write a function to rotate a linked list to the right by $K$ places. For example, if the input is [1, 2, 3, 4, 5] and $K$ is 2, the output should be [4, 5, 1, 2, 3]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb b/docs/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb
deleted file mode 100644
index 876d633..0000000
--- a/docs/_build/html/_sources/06. Linked List/21. Merge Two Sorted Lists.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 21. Merge Two Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge Two Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-two-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given the heads of two sorted linked lists `list1` and `list2`.\n",
-        "\n",
-        "Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists.\n",
-        "\n",
-        "*Return the head of the merged linked list.*\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in both lists is in the range `[0, 50]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "- Both `list1` and `list2` are sorted in non-decreasing order."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class ListNode:\n",
-        "    def __init__(self, val=0, next=None):\n",
-        "        self.val = val\n",
-        "        self.next = next\n",
-        "\n",
-        "def mergeTwoLists(list1, list2):\n",
-        "    # Create a dummy node to simplify the code.\n",
-        "    dummy = ListNode()\n",
-        "    current = dummy\n",
-        "\n",
-        "    while list1 and list2:\n",
-        "        if list1.val < list2.val:\n",
-        "            current.next = list1\n",
-        "            list1 = list1.next\n",
-        "        else:\n",
-        "            current.next = list2\n",
-        "            list2 = list2.next\n",
-        "        current = current.next\n",
-        "\n",
-        "    # Append the remaining elements from either list.\n",
-        "    if list1:\n",
-        "        current.next = list1\n",
-        "    else:\n",
-        "        current.next = list2\n",
-        "\n",
-        "    return dummy.next"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a class `ListNode` to represent the nodes of a singly-linked list. Each node has a `val` attribute to store the value of the node and a `next` attribute to point to the next node in the list.\n",
-        "\n",
-        "2. We define the `mergeTwoLists` function that takes two linked list heads, `list1` and `list2`, as input.\n",
-        "\n",
-        "3. We create a `dummy` node at the beginning of the merged list. The `dummy` node simplifies the code by serving as a placeholder, and its `next` attribute will point to the actual merged list.\n",
-        "\n",
-        "4. We initialize a `current` pointer to point to the `dummy` node initially. This `current` pointer helps us traverse and build the merged list.\n",
-        "\n",
-        "5. We enter a `while` loop that continues until either `list1` or `list2` becomes empty. Inside the loop, we compare the values of the nodes at the current positions of `list1` and `list2`.\n",
-        "\n",
-        "6. If the `val` of the node in `list1` is smaller than the `val` of the node in `list2`, we attach the node from `list1` to the merged list by updating the `next` attribute of the `current` node to point to the node in `list1`. We then move the `list1` pointer to the next node.\n",
-        "\n",
-        "7. If the `val` of the node in `list2` is smaller than or equal to the `val` of the node in `list1`, we attach the node from `list2` to the merged list in a similar manner. We move the `list2` pointer to the next node.\n",
-        "\n",
-        "8. After attaching a node to the merged list, we move the `current` pointer to the newly added node. This step is essential for keeping track of the end of the merged list.\n",
-        "\n",
-        "9. The loop continues until either `list1` or `list2` becomes empty.\n",
-        "\n",
-        "10. Once the loop exits, we check if there are any remaining elements in `list1` or `list2`. If `list1` is not empty, we attach the remaining elements of `list1` to the merged list. If `list2` is not empty, we attach the remaining elements of `list2`.\n",
-        "\n",
-        "11. Finally, we return the `next` attribute of the `dummy` node as the head of the merged list, which represents the sorted merged list."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Helper function to print the linked list\n",
-        "def printLinkedList(head):\n",
-        "    result = []\n",
-        "    while head:\n",
-        "        result.append(head.val)\n",
-        "        head = head.next\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-      "metadata": {},
-      "source": [
-        "Let's explain the helper functions:\n",
-        "**printLinkedList Function**:\n",
-        "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-        "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-        "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-        "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-        "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-        "\n",
-        "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 1:\n",
-        "# Input: list1 = [1,2,4], list2 = [1,3,4]\n",
-        "list1 = ListNode(1, ListNode(2, ListNode(4)))\n",
-        "list2 = ListNode(1, ListNode(3, ListNode(4)))\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 2:\n",
-        "# Input: list1 = [], list2 = []\n",
-        "list1 = None\n",
-        "list2 = None\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": null,
-      "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Example 3:\n",
-        "# list1 = [], list2 = [0]\n",
-        "list1 = None\n",
-        "list2 = ListNode(0)\n",
-        "merged_list = mergeTwoLists(list1, list2)\n",
-        "printLinkedList(merged_list)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the `mergeTwoLists` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is $O(N + M$), where $N$ and $M$ are the lengths of `list1` and `list2`, respectively. Here's why:\n",
-        "\n",
-        "1. In the worst case, we need to traverse both `list1` and `list2` completely. This involves iterating through all the nodes in both lists once.\n",
-        "\n",
-        "2. The while loop runs until either `list1` or `list2` becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.\n",
-        "\n",
-        "3. Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of $O(N + M)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is $O(1)$, which means it uses a constant amount of extra space regardless of the input sizes. Here's why:\n",
-        "\n",
-        "1. We create a few extra pointers (`dummy`, `current`) and temporary variables (`val`) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of `list1` and `list2`.\n",
-        "\n",
-        "2. We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from `list1` and `list2` to form the merged list. This operation does not consume additional memory proportional to the input sizes.\n",
-        "\n",
-        "**In summary**, the `mergeTwoLists` function has a time complexity of $O(N + M)$ and a space complexity of $O(1)$, making it an efficient solution for merging two sorted linked lists."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Merge K Sorted Lists:** Extend the problem to merge $K$ sorted linked lists instead of just two. You need to efficiently merge $K$ lists into one sorted list.\n",
-        "\n",
-        "2. **Merge Lists in a Zigzag Pattern:** Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5]."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": "sql",
-      "file_extension": "",
-      "mimetype": "",
-      "name": "sql",
-      "version": "3.32.3"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb b/docs/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb
deleted file mode 100644
index a850734..0000000
--- a/docs/_build/html/_sources/06. Linked List/23. Merge k Sorted Lists.ipynb	
+++ /dev/null
@@ -1,285 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 23. Merge k Sorted Lists\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Merge k Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-k-sorted-lists/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "You are given an array of $k$ linked-lists lists, each linked-list is sorted in ascending order.\n",
-        "\n",
-        "Merge all the linked-lists into one sorted linked-list and return it.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- `k == lists.length`\n",
-        "- 0 <= k <= $10^4$\n",
-        "- `0 <= lists[i].length <= 500`\n",
-        "- $-10^4$ <= lists[i][j] <= $10^4$\n",
-        "- `lists[i]` is sorted in ascending order.\n",
-        "- The sum of `lists[i].length` will not exceed $10^4$.\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for singly-linked list.\n",
-        "class ListNode:\n",
-        "     def __init__(self, val=0, next=None):\n",
-        "         self.val = val\n",
-        "         self.next = next\n",
-        "\n",
-        "class Solution:\n",
-        "    def mergeKLists(self, lists: [[ListNode]]) -> ListNode:\n",
-        "        # Check if the input list of linked lists is empty\n",
-        "        if not lists or len(lists) == 0:\n",
-        "            return None\n",
-        "\n",
-        "        # Loop until there is only one merged list left\n",
-        "        while len(lists) > 1:\n",
-        "            mergedLists = []\n",
-        "\n",
-        "            # Merge pairs of lists\n",
-        "            for i in range(0, len(lists), 2):\n",
-        "                l1 = lists[i]\n",
-        "                l2 = lists[i + 1] if (i + 1) < len(lists) else None\n",
-        "                mergedLists.append(self.mergeList(l1, l2))\n",
-        "\n",
-        "            # Update the list of lists with merged results\n",
-        "            lists = mergedLists\n",
-        "        \n",
-        "        # Return the final merged list\n",
-        "        return lists[0]\n",
-        "\n",
-        "    def mergeList(self, l1, l2):\n",
-        "        # Create a dummy node to simplify merging\n",
-        "        dummy = ListNode()\n",
-        "        tail = dummy\n",
-        "\n",
-        "        # Merge the two sorted lists\n",
-        "        while l1 and l2:\n",
-        "            if l1.val < l2.val:\n",
-        "                tail.next = l1\n",
-        "                l1 = l1.next\n",
-        "            else:\n",
-        "                tail.next = l2\n",
-        "                l2 = l2.next\n",
-        "            tail = tail.next\n",
-        "\n",
-        "        # Append any remaining elements from l1 or l2 (if any)\n",
-        "        if l1:\n",
-        "            tail.next = l1\n",
-        "        if l2:\n",
-        "            tail.next = l2\n",
-        "\n",
-        "        # Return the merged result starting from the next of the dummy node\n",
-        "        return dummy.next\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class `Solution` with two methods for merging k sorted linked lists:\n",
-        "\n",
-        "1. `mergeKLists(self, lists: List[ListNode]) -> ListNode`: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.\n",
-        "\n",
-        "2. `mergeList(self, l1, l2)`: This method takes two sorted linked lists, `l1` and `l2`, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.\n",
-        "\n",
-        "Here's a high-level overview of how the code works:\n",
-        "\n",
-        "- The `mergeKLists` method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns `None`.\n",
-        "\n",
-        "- Inside a `while` loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the `lists` array. It does this by iterating through the input lists in pairs and calling the `mergeList` method to merge each pair.\n",
-        "\n",
-        "- The `mergeList` method takes two sorted linked lists, `l1` and `l2`, and merges them into a single sorted linked list. It uses a dummy node (`dummy`) and a `tail` pointer to keep track of the merged list while comparing and merging elements from `l1` and `l2`.\n",
-        "\n",
-        "- After merging all pairs of lists and updating the `lists` array with the merged results, the loop continues until only one merged list remains in the `lists` array.\n",
-        "\n",
-        "- Finally, the `mergeKLists` method returns the merged list.\n",
-        "\n",
-        "Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1 -> 1 -> 2 -> 3 -> 4 -> 4 -> 5 -> 6 -> "
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: lists = [[1,4,5],[1,3,4],[2,6]]\n",
-        "\n",
-        "lists1 = [\n",
-        "    ListNode(1, ListNode(4, ListNode(5))),\n",
-        "    ListNode(1, ListNode(3, ListNode(4))),\n",
-        "    ListNode(2, ListNode(6))\n",
-        "]\n",
-        "solution = Solution()\n",
-        "result1 = solution.mergeKLists(lists1)\n",
-        "\n",
-        "# Print the result\n",
-        "if result1:\n",
-        "    current = result1\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: lists = []\n",
-        "\n",
-        "lists2 = []\n",
-        "solution = Solution()\n",
-        "result2 = solution.mergeKLists(lists2)\n",
-        "\n",
-        "# Print the result\n",
-        "if result2:\n",
-        "    current = result2\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: lists = [[]]\n",
-        "\n",
-        "lists3 = [None]\n",
-        "solution = Solution()\n",
-        "result3 = solution.mergeKLists(lists3)\n",
-        "\n",
-        "# Print the result\n",
-        "if result3:\n",
-        "    current = result3\n",
-        "    while current:\n",
-        "        print(current.val, end=\" -> \")\n",
-        "        current = current.next\n",
-        "else:\n",
-        "    print(\"None\")  # Print \"None\" for input with a single None element"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Heap Initialization:** The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes $O(1)$ time.\n",
-        "\n",
-        "2. **Merging:** The merging operation is performed in a divide-and-conquer fashion. In each iteration of the `while` loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists ($n$). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is $O(log\\ k)$.\n",
-        "\n",
-        "   Therefore, the overall time complexity of the code is $O(n * log\\ k)$, where n is the total number of nodes across all lists, and $k$ is the number of linked lists.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Heap Space:** The code doesn't use a heap data structure, so there's no additional space complexity due to a heap.\n",
-        "\n",
-        "2. **Merged Lists:** In the `mergeList` method, we create a new merged list. However, this list is not stored in memory for all lists; it's replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is $O(n)$ in the worst case.\n",
-        "\n",
-        "3. **Additional Variables:** The code uses a few additional variables, such as `dummy` and `tail`, but these occupy a constant amount of space and don't depend on the input size.\n",
-        "\n",
-        "   Therefore, the overall space complexity of the code is $O(n)$, where n is the total number of nodes across all lists.\n",
-        "\n",
-        "In summary, the code's time complexity is $O(n * log(k))$, and its space complexity is $O(n)$. This code efficiently merges $k$ sorted linked lists using a divide-and-conquer approach with a relatively low space overhead."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/06. Linked List/README.md b/docs/_build/html/_sources/06. Linked List/README.md
deleted file mode 100644
index fb7b3ee..0000000
--- a/docs/_build/html/_sources/06. Linked List/README.md	
+++ /dev/null
@@ -1,21 +0,0 @@
-# Linked List Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/07. Trees/100. Same Tree.ipynb b/docs/_build/html/_sources/07. Trees/100. Same Tree.ipynb
deleted file mode 100644
index a270fab..0000000
--- a/docs/_build/html/_sources/07. Trees/100. Same Tree.ipynb	
+++ /dev/null
@@ -1,211 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 100: Same Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-        "\n",
-        "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-        "\n",
-        "**Constraints**\n",
-        "\n",
-        "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-        "2. $-10^4$ <= Node.val <= $10^4$\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def isSameTree(p, q):\n",
-        "    # Base case: If both p and q are None, the trees are the same.\n",
-        "    if not p and not q:\n",
-        "        return True\n",
-        "    \n",
-        "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-        "    if not p or not q:\n",
-        "        return False\n",
-        "    \n",
-        "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-        "    if p.val != q.val:\n",
-        "        return False\n",
-        "    \n",
-        "    # Recursively check the left and right subtrees of p and q.\n",
-        "    # If both subtrees are the same, the entire trees are the same.\n",
-        "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-        "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-        "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-        "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-        "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-        "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "\n",
-        "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-        "\n",
-        "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-        "print(isSameTree(p1, q1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "\n",
-        "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-        "\n",
-        "p2 = TreeNode(1, TreeNode(2), None)\n",
-        "q2 = TreeNode(1, None, TreeNode(2))\n",
-        "print(isSameTree(p2, q2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "\n",
-        "#Input: p = [1,2,1], q = [1,1,2]\n",
-        "\n",
-        "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-        "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-        "print(isSameTree(p3, q3))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time Complexity\n",
-        "\n",
-        "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-        "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-        "\n",
-        "## Space Complexity\n",
-        "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-        "\n",
-        "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-        "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-        "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-        "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-        "\n",
-        "## In summary:\n",
-        "\n",
-        "+ **Time Complexity:** $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-        "+ **Space Complexity:** $O(n)$ due to the recursive call stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/docs/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb
deleted file mode 100644
index 8cb08b7..0000000
--- a/docs/_build/html/_sources/07. Trees/102. Binary Tree Level Order Traversal.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 102. Binary Tree Level Order Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Level Order Traversal problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, return *the level order traversal of its nodes' values*. (i.e., from left to right, level by level).\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-1000 <= Node.val <= 1000`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def levelOrder(root):\n",
-        "    # Check if the tree is empty, if so, return an empty list.\n",
-        "    if not root:\n",
-        "        return []\n",
-        "\n",
-        "    # Initialize an empty list to store the result.\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue with the root node to perform BFS.\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Initialize an empty list to store the values of nodes at the current level.\n",
-        "        level_values = []\n",
-        "        \n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Iterate through the nodes at the current level.\n",
-        "        for _ in range(level_size):\n",
-        "            # Dequeue the front node from the queue.\n",
-        "            node = queue.pop(0)\n",
-        "            \n",
-        "            # Append the value of the current node to the level_values list.\n",
-        "            level_values.append(node.val)\n",
-        "\n",
-        "            # Enqueue the left and right children of the current node if they exist.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "        # Append the level_values list (values at the current level) to the result list.\n",
-        "        result.append(level_values)\n",
-        "\n",
-        "    # Return the final result, which is a list of lists representing level order traversal.\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We define a `TreeNode` class that represents a node in the binary tree. Each `TreeNode` object has a value (`val`) and two child nodes: `left` and `right`.\n",
-        "\n",
-        "2. The `levelOrder` function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.\n",
-        "\n",
-        "3. We start by checking if the input `root` is `None`, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the final result, which will be a list of lists containing node values at each level.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue will be used for breadth-first traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside the loop, we perform the following steps:\n",
-        "\n",
-        "   - We initialize an empty list called `level_values` to store the values of nodes at the current level.\n",
-        "\n",
-        "   - We determine the number of nodes at the current level by getting the length of the `queue`. This is done to process nodes level by level.\n",
-        "\n",
-        "   - We iterate through the nodes at the current level using a for loop. For each node in the current level:\n",
-        "\n",
-        "     - We dequeue (remove) the front node from the `queue`.\n",
-        "\n",
-        "     - We append the value of the dequeued node to the `level_values` list, effectively collecting the values of nodes at the current level.\n",
-        "\n",
-        "     - If the dequeued node has a left child, we enqueue the left child to the `queue`.\n",
-        "\n",
-        "     - If the dequeued node has a right child, we enqueue the right child to the `queue`.\n",
-        "\n",
-        "   - After processing all nodes at the current level, we append the `level_values` list to the `result` list. This represents the values at the current level.\n",
-        "\n",
-        "7. The loop continues until all levels have been traversed, and the `queue` becomes empty.\n",
-        "\n",
-        "8. Finally, we return the `result` list, which contains lists of node values at each level, representing the level order traversal of the binary tree.\n",
-        "\n",
-        "The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[3], [9, 20], [15, 7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "root = TreeNode(1)\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = levelOrder(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `levelOrder` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.\n",
-        "\n",
-        "In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here's how the space complexity breaks down:\n",
-        "\n",
-        "1. The `result` list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by `result` is O(N).\n",
-        "\n",
-        "2. The `queue` data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by `queue` is O(N).\n",
-        "\n",
-        "Overall, the dominant factor in terms of space complexity is the `queue`, and the space complexity is O(N).\n",
-        "\n",
-        "In summary, the function's time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Reverse Level Order Traversal:** Modify the `levelOrder` function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[15, 7], [9, 20], [3]]`.\n",
-        "\n",
-        "2. **Zigzag Level Order Traversal:** Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[3], [20, 9], [15, 7]]`."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/docs/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb
deleted file mode 100644
index 213989d..0000000
--- a/docs/_build/html/_sources/07. Trees/104. Maximum Depth of Binary Tree.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 104. Maximum Depth of Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the `root` of a binary tree, return its maximum depth.\n",
-        "\n",
-        "A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 19,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def maxDepth(root):\n",
-        "    # Base case: If the root is None, the depth is 0.\n",
-        "    if root is None:\n",
-        "        return 0\n",
-        "    \n",
-        "    # Recursively calculate the maximum depth of the left and right subtrees.\n",
-        "    left_depth = maxDepth(root.left)\n",
-        "    right_depth = maxDepth(root.right)\n",
-        "    \n",
-        "    # Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.\n",
-        "    return max(left_depth, right_depth) + 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's go through the code step by step to understand how it works:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class to represent the nodes of the binary tree. Each node has three attributes:\n",
-        "   - `val`: the value stored in the node.\n",
-        "   - `left`: a reference to the left child node.\n",
-        "   - `right`: a reference to the right child node.\n",
-        "\n",
-        "2. The `maxDepth` function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, `root`, which is the root node of the binary tree.\n",
-        "\n",
-        "3. In the `maxDepth` function, we have a base case:\n",
-        "   - If the `root` is `None`, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.\n",
-        "\n",
-        "4. If the `root` is not `None`, we recursively calculate the maximum depth of the left and right subtrees:\n",
-        "   - We call `maxDepth` on the `root.left` to calculate the maximum depth of the left subtree and store it in the variable `left_depth`.\n",
-        "   - We call `maxDepth` on the `root.right` to calculate the maximum depth of the right subtree and store it in the variable `right_depth`.\n",
-        "\n",
-        "5. Finally, we return the maximum depth of the tree by taking the maximum of `left_depth` and `right_depth` and adding 1 to it. This is because we are counting the current level as well."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [3,9,20,null,null,15,7]\n",
-        "\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(9)\n",
-        "root.right = TreeNode(20)\n",
-        "root.right.left = TreeNode(15)\n",
-        "root.right.right = TreeNode(7)\n",
-        "\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a230be4f-1f47-4919-87e3-62fc3f072d97",
-      "metadata": {},
-      "source": [
-        "In this example, we create a binary tree based on the given input `[3,9,20,null,null,15,7]` and calculate its maximum depth, which is `3`. The tree structure is as follows:\n",
-        "   ```\n",
-        "       3\n",
-        "      / \\\n",
-        "     9  20\n",
-        "       /  \\\n",
-        "      15   7\n",
-        "   ```\n",
-        "\n",
-        "So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [1,null,2]\n",
-        "\n",
-        "root = TreeNode(1)\n",
-        "root.right = TreeNode(2)\n",
-        "\n",
-        "# Calculate the maximum depth of the tree and print the result\n",
-        "print(maxDepth(root))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the `maxDepth` function is $O(N)$, where $N$ is the number of nodes in the binary tree.\n",
-        "- This is because in the worst case, the function visits every node exactly once in a depth-first manner.\n",
-        "- The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity of the `maxDepth` function is $O(H)$, where H is the height of the binary tree.\n",
-        "- In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.\n",
-        "- In the best case, if the binary tree is perfectly balanced, the height is $O(log\\ N)$, where $N$ is the number of nodes.\n",
-        "- Therefore, the space complexity can vary from $O(log\\ N)$ to $O(N)$ depending on the shape of the tree.\n",
-        "- In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.\n",
-        "\n",
-        "**In summary:**\n",
-        "- The time complexity of the code is $O(N)$ as it visits each node once.\n",
-        "- The space complexity is $O(H)$, where H is the height of the tree, which can vary from $O(log\\ N)$ to $O(N)$ depending on the tree's shape."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/docs/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
deleted file mode 100644
index 31c9e69..0000000
--- a/docs/_build/html/_sources/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb	
+++ /dev/null
@@ -1,313 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 105. Construct Binary Tree from Preorder and Inorder Traversal\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n",
-        "\n",
-        "---\n",
-        "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return *the binary tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= preorder.length <= 3000`\n",
-        "- `inorder.length == preorder.length`\n",
-        "- `-3000 <= preorder[i], inorder[i] <= 3000`\n",
-        "- `preorder` and `inorder` consist of **unique** values.\n",
-        "- Each value of `inorder` also appears in `preorder`.\n",
-        "- `preorder` is **guaranteed** to be the preorder traversal of the tree.\n",
-        "- `inorder` is **guaranteed** to be the inorder traversal of the tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def buildTree(preorder, inorder):\n",
-        "    if not preorder:\n",
-        "        return None\n",
-        "\n",
-        "    # The first element in the preorder traversal is the root of the current subtree\n",
-        "    root_val = preorder[0]\n",
-        "    root = TreeNode(root_val)\n",
-        "\n",
-        "    # Find the index of the root value in the inorder traversal\n",
-        "    root_idx_inorder = inorder.index(root_val)\n",
-        "\n",
-        "    # Recursively build left and right subtrees\n",
-        "    root.left = buildTree(preorder[1:1 + root_idx_inorder], inorder[:root_idx_inorder])\n",
-        "    root.right = buildTree(preorder[1 + root_idx_inorder:], inorder[root_idx_inorder + 1:])\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:`: This is a class definition for a binary tree node. It has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "   This class is used to create instances of binary tree nodes, which will be used to build the binary tree.\n",
-        "\n",
-        "2. `def buildTree(preorder, inorder):`: This is the main function that constructs a binary tree from its preorder and inorder traversals.\n",
-        "\n",
-        "   - `preorder`: A list representing the preorder traversal of the binary tree.\n",
-        "   - `inorder`: A list representing the inorder traversal of the binary tree.\n",
-        "\n",
-        "3. `if not preorder: return None`: This line checks if the `preorder` list is empty. If it is, it means there are no nodes to construct, so the function returns `None`.\n",
-        "\n",
-        "4. `root_val = preorder[0]`: The value of the root node is extracted from the first element of the `preorder` list.\n",
-        "\n",
-        "5. `root = TreeNode(root_val)`: A new `TreeNode` object is created with the `root_val` as its value. This represents the root of the current subtree.\n",
-        "\n",
-        "6. `root_idx_inorder = inorder.index(root_val)`: The index of the `root_val` in the `inorder` list is found. This index indicates the position of the root node in the inorder traversal.\n",
-        "\n",
-        "7. `root.left`: The left subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The left subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists up to the `root_idx_inorder`.\n",
-        "\n",
-        "8. `root.right`: The right subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The right subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists starting from `root_idx_inorder + 1`.\n",
-        "\n",
-        "9. Finally, the function returns the `root` of the subtree it just constructed.\n",
-        "\n",
-        "The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "2d82857b-4fbe-474f-bf33-17b55c20147b",
-      "metadata": {},
-      "source": [
-        "## Helper Function \n",
-        "\n",
-        "Here is a helper function to represent the binary tree elements."
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "13e6f3e1-659d-479d-9521-75629b8c782f",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def treeToList(root):\n",
-        "    # Initialize an empty list to store the elements of the binary tree\n",
-        "    result = []\n",
-        "    \n",
-        "    # Initialize a queue for level-order traversal starting with the root\n",
-        "    queue = [root]\n",
-        "\n",
-        "    while queue:\n",
-        "        # Pop the front node from the queue\n",
-        "        node = queue.pop(0)\n",
-        "        \n",
-        "        # If the node is not None (i.e., a valid node), add its value to the result list\n",
-        "        if node:\n",
-        "            result.append(node.val)\n",
-        "            \n",
-        "            # Add the left and right children of the node to the queue\n",
-        "            queue.append(node.left)\n",
-        "            queue.append(node.right)\n",
-        "        else:\n",
-        "            # If the node is None, add None to the result to represent an empty node\n",
-        "            result.append(None)\n",
-        "\n",
-        "    # Remove any trailing None values from the result list\n",
-        "    while result and result[-1] is None:\n",
-        "        result.pop()\n",
-        "\n",
-        "    # Return the resulting list representing the binary tree elements\n",
-        "    return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86cd4c9d-a120-4dd1-a1bd-530436012574",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's break down the `treeToList` helper function step by step:\n",
-        "\n",
-        "1. `def treeToList(root):`: This function takes the root of a binary tree as input and converts it into a list.\n",
-        "\n",
-        "2. `result = []`: Initialize an empty list called `result` to store the elements of the binary tree in list format.\n",
-        "\n",
-        "3. `queue = [root]`: Initialize a queue data structure for a level-order traversal, starting with the root node.\n",
-        "\n",
-        "4. `while queue:`: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.\n",
-        "\n",
-        "5. `node = queue.pop(0)`: Dequeue the first node from the queue, effectively processing it.\n",
-        "\n",
-        "6. `if node:`: Check if the `node` is not None, which means it's a valid node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(node.val)`: If the node is valid, append its value (`node.val`) to the `result` list. This represents the value of the current node in the binary tree.\n",
-        "\n",
-        "    b. `queue.append(node.left)`: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.\n",
-        "\n",
-        "    c. `queue.append(node.right)`: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.\n",
-        "\n",
-        "7. `else:`: If the `node` is None, it represents an empty node in the binary tree.\n",
-        "\n",
-        "    a. `result.append(None)`: Append `None` to the `result` list to indicate an empty node.\n",
-        "\n",
-        "8. `while result and result[-1] is None:`: After the traversal is complete, there might be trailing `None` values in the `result` list. This loop removes any such trailing `None` values to ensure a clean representation of the tree's elements.\n",
-        "\n",
-        "9. `return result`: Return the `result` list, which now contains the elements of the binary tree in a format where `None` represents empty nodes and the order of elements reflects a level-order traversal of the tree.\n",
-        "\n",
-        "In summary, the `treeToList` function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node's value or represents an empty node with `None`. This list represents the binary tree's elements in a structured format."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[3, 9, 20, None, None, 15, 7]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "preorder = [3, 9, 20, 15, 7]\n",
-        "inorder = [9, 3, 15, 20, 7]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[-1]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "preorder = [-1]\n",
-        "inorder = [-1]\n",
-        "result = buildTree(preorder, inorder)\n",
-        "\n",
-        "print(treeToList(result))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `buildTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of the `buildTree` function can be analyzed in terms of the number of nodes in the binary tree. Let's assume there are `n` nodes in the binary tree.\n",
-        "\n",
-        "1. Finding the root value in the `preorder` traversal takes O(1) time as it's just extracting the first element from the list.\n",
-        "2. Finding the index of the root value in the `inorder` traversal using `inorder.index(root_val)` takes O(n) time in the worst case because in the worst case, it might have to search through all `n` elements in the `inorder` list to find the index.\n",
-        "3. The recursive calls to `buildTree` for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.\n",
-        "\n",
-        "The total time complexity of the `buildTree` function is O(n) due to the recursive calls and finding the root's index in the `inorder` list.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the space used by the function's call stack during recursion and any additional data structures used. \n",
-        "\n",
-        "1. The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.\n",
-        "\n",
-        "2. Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).\n",
-        "\n",
-        "Overall, the space complexity of the `buildTree` function is O(n) due to the space used by the call stack and the TreeNode objects.\n",
-        "\n",
-        "In summary, the time complexity of `buildTree` is O(n), and the space complexity is O(n), where 'n' is the number of nodes in the binary tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Construct Binary Tree from Postorder and Inorder Traversal:**\n",
-        "   Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to `buildTree` but for postorder and inorder traversals.\n",
-        "\n",
-        "2. **Reconstruct Binary Tree with Duplicate Values:**\n",
-        "   Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/docs/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
deleted file mode 100644
index 59d8e7d..0000000
--- a/docs/_build/html/_sources/07. Trees/124. Binary Tree Maximum Path Sum.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 124. Binary Tree Maximum Path Sum\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n",
-        "\n",
-        "---\n",
-        "A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.\n",
-        "\n",
-        "The **path sum** of a path is the sum of the node's values in the path.\n",
-        "\n",
-        "Given the `root` of a binary tree, return *the maximum **path sum** of any **non-empty** path*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 3*10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.\n",
-        "\n",
-        "In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.\n",
-        "\n",
-        "To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:\n",
-        "\n",
-        "1. Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.\n",
-        "\n",
-        "2. Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.\n",
-        "\n",
-        "To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.\n",
-        "\n",
-        "Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.\n",
-        "\n",
-        "The constraints for this problem include:\n",
-        "\n",
-        "- The number of nodes in the tree is in the range $[1, 3 * 10^4]$.\n",
-        "- Node values are in the range [-1000, 1000].\n",
-        "\n",
-        "By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def maxPathSum(self, root):\n",
-        "        def max_path_sum_helper(node):\n",
-        "            if not node:\n",
-        "                return 0\n",
-        "            \n",
-        "            # Recursively calculate the maximum path sum for left and right subtrees\n",
-        "            left_max = max(0, max_path_sum_helper(node.left))\n",
-        "            right_max = max(0, max_path_sum_helper(node.right))\n",
-        "            \n",
-        "            # Update the global maximum path sum\n",
-        "            self.max_sum = max(self.max_sum, left_max + right_max + node.val)\n",
-        "            \n",
-        "            # Return the maximum path sum starting from the current node\n",
-        "            return max(left_max, right_max) + node.val\n",
-        "        \n",
-        "        self.max_sum = float('-inf')  # Initialize the global maximum to negative infinity\n",
-        "        max_path_sum_helper(root)  # Start the recursive traversal from the root\n",
-        "        return self.max_sum"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. The code starts by defining a `TreeNode` class to represent nodes in the binary tree. Each `TreeNode` has a `val` attribute representing its value, a `left` attribute pointing to the left child, and a `right` attribute pointing to the right child.\n",
-        "\n",
-        "2. Next, a `Solution` class is defined to contain the `maxPathSum` method, which will be used to find the maximum path sum in the binary tree.\n",
-        "\n",
-        "3. Within the `maxPathSum` method, a helper function called `max_path_sum_helper` is defined. This recursive function takes a single argument, `node`, which is the current node being considered during traversal.\n",
-        "\n",
-        "4. Inside the `max_path_sum_helper` function:\n",
-        "   - If `node` is `None` (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.\n",
-        "   - It calculates the maximum path sum starting from the left subtree (`left_max`) and the right subtree (`right_max`). Importantly, it uses `max(0, ...)` to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree's path sum is negative, it's better to not include it in the path.\n",
-        "   - The code then updates the global maximum path sum (`self.max_sum`) by checking if the sum of `left_max`, `right_max`, and the current node's value is greater than the current maximum.\n",
-        "   - Finally, it returns the maximum path sum starting from the current node, which is the maximum of `left_max` and `right_max` plus the current node's value.\n",
-        "\n",
-        "5. Before calling the `max_path_sum_helper` function, the `max_sum` attribute of the `Solution` class is initialized to negative infinity (`float('-inf')`). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of `max_sum`.\n",
-        "\n",
-        "6. The `max_path_sum_helper` function is called with the root of the binary tree, effectively starting the traversal from the root node.\n",
-        "\n",
-        "7. Once the traversal is complete, the method returns the value of `self.max_sum`, which contains the maximum path sum found in the binary tree.\n",
-        "\n",
-        "8. Example usage at the bottom of the code demonstrates how to create binary trees and use the `maxPathSum` method to find the maximum path sum for two different tree structures.\n",
-        "\n",
-        "In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "solution = Solution()\n",
-        "print(solution.maxPathSum(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "42\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(-10)\n",
-        "root2.left = TreeNode(9)\n",
-        "root2.right = TreeNode(20)\n",
-        "root2.right.left = TreeNode(15)\n",
-        "root2.right.right = TreeNode(7)\n",
-        "print(solution.maxPathSum(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.\n",
-        "- During the traversal, for each node, we perform constant time operations, such as updating the `max_sum` variable and calculating the maximum path sum starting from that node.\n",
-        "- Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity of the code is determined by the space used in the call stack during the recursive traversal.\n",
-        "- In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).\n",
-        "- Additionally, the code uses a constant amount of space for variables like `left_max`, `right_max`, and `max_sum`.\n",
-        "- Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it's O(N), and in the best case (a balanced binary tree), it's O(log N).\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree's balance."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Print the Maximum Path:**\n",
-        "   Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.\n",
-        "\n",
-        "2. **Path Sum Count:**\n",
-        "   Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb b/docs/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb
deleted file mode 100644
index 55dc944..0000000
--- a/docs/_build/html/_sources/07. Trees/199. Binary Tree Right Side View.ipynb	
+++ /dev/null
@@ -1,257 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 199. Binary Tree Right Side View\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Binary Tree Right Side View problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-right-side-view/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return *the values of the nodes you can see ordered from top to bottom*.\n",
-        "\n",
-        " \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def rightSideView(root):\n",
-        "    if not root:\n",
-        "        return []  # If the tree is empty, return an empty list.\n",
-        "\n",
-        "    result = []  # Initialize a list to store the right side view values.\n",
-        "    queue = [root]  # Initialize a queue for level-order traversal with the root node.\n",
-        "\n",
-        "    while queue:\n",
-        "        # Get the number of nodes at the current level.\n",
-        "        level_size = len(queue)\n",
-        "\n",
-        "        # Traverse all nodes at the current level and add the rightmost node to the result.\n",
-        "        for i in range(level_size):\n",
-        "            node = queue.pop(0)  # Dequeue the first node from the queue.\n",
-        "\n",
-        "            # If it's the rightmost node at this level, add its value to the result.\n",
-        "            if i == level_size - 1:\n",
-        "                result.append(node.val)\n",
-        "\n",
-        "            # Add the children of the current node to the queue.\n",
-        "            if node.left:\n",
-        "                queue.append(node.left)\n",
-        "            if node.right:\n",
-        "                queue.append(node.right)\n",
-        "\n",
-        "    return result  # Return the list of right side view values.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start with a binary tree represented using a TreeNode class. Each node has a value (`val`) and can have a left child (`left`) and a right child (`right`).\n",
-        "\n",
-        "2. The `rightSideView` function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.\n",
-        "\n",
-        "3. We check if the `root` is `None`, which means the tree is empty. If it's empty, we return an empty list because there are no nodes to see.\n",
-        "\n",
-        "4. We initialize an empty list called `result` to store the right side view values.\n",
-        "\n",
-        "5. We initialize a queue called `queue` with the root node. This queue is used for a level-order traversal of the tree.\n",
-        "\n",
-        "6. We enter a while loop that continues until the `queue` is empty. Inside this loop, we perform the following steps for each level of the tree:\n",
-        "\n",
-        "   a. We determine the number of nodes at the current level by getting the length of the `queue`. This is important for processing nodes at the same level together.\n",
-        "\n",
-        "   b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the `queue` using `queue.pop(0)`.\n",
-        "\n",
-        "   c. If the node we dequeue is the rightmost node at the current level (determined by `i == level_size - 1`), we add its `val` to the `result` list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.\n",
-        "\n",
-        "   d. We enqueue the left and right children of the current node (if they exist) to the `queue`. This ensures that we process the next level in the subsequent iterations of the while loop.\n",
-        "\n",
-        "7. After processing all levels of the tree, the `result` list contains the values of the rightmost nodes in each level, ordered from top to bottom.\n",
-        "\n",
-        "8. Finally, we return the `result` list as the output of the function, which represents the right side view of the binary tree.\n",
-        "\n",
-        "The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3, 4]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root1 = TreeNode(1)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(3)\n",
-        "root1.left.right = TreeNode(5)\n",
-        "root1.right.right = TreeNode(4)\n",
-        "print(rightSideView(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[1, 3]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "root2 = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "print(rightSideView(root2))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root = None\n",
-        "result = rightSideView(root)\n",
-        "print(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here's why:\n",
-        "\n",
-        "1. We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.\n",
-        "\n",
-        "2. For each node, we perform constant-time operations like dequeuing it from the queue, checking if it's the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.\n",
-        "\n",
-        "Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is also O(N). Here's why:\n",
-        "\n",
-        "1. We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).\n",
-        "\n",
-        "2. The `result` list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the `result` list is also O(N).\n",
-        "\n",
-        "3. Other auxiliary variables like `level_size`, `i`, and `node` require only constant space and do not depend on the size of the tree.\n",
-        "\n",
-        "Combining the space used by the queue and the `result` list, we get a space complexity of O(N).\n",
-        "\n",
-        "In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Variant with Left Side View**: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.\n",
-        "\n",
-        "2. **Zigzag Right Side View**: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb b/docs/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb
deleted file mode 100644
index 8ea4609..0000000
--- a/docs/_build/html/_sources/07. Trees/226. Invert Binary Tree.ipynb	
+++ /dev/null
@@ -1,223 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 226: Invert Binary Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given the root of a binary tree, invert the tree, and return its root.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- The number of nodes in the tree is in the range `[0, 100]`.\n",
-        "- `-100 <= Node.val <= 100`\n",
-        "\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def invertTree(root):\n",
-        "    # Base case: If the root is None or the tree is empty, return None.\n",
-        "    if not root:\n",
-        "        return None\n",
-        "\n",
-        "    # Swap the left and right subtrees of the current node.\n",
-        "    root.left, root.right = root.right, root.left\n",
-        "\n",
-        "    # Recursively invert the left and right subtrees.\n",
-        "    invertTree(root.left)\n",
-        "    invertTree(root.right)\n",
-        "\n",
-        "    return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `invertTree` function is defined to invert the binary tree. It takes the root node of the tree as an argument.\n",
-        "\n",
-        "3. In the `invertTree` function, we have a base case to handle the scenario when the root is `None` (empty tree). In such cases, we return `None` because there's nothing to invert.\n",
-        "\n",
-        "4. For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.\n",
-        "\n",
-        "5. We then recursively call `invertTree` on the left and right subtrees to invert them.\n",
-        "\n",
-        "6. Finally, we return the root of the inverted tree."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 1): <__main__.TreeNode object at 0x270c9c0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 1\n",
-        "# Input: root = [4,2,7,1,3,6,9]\n",
-        "\n",
-        "root1 = TreeNode(4)\n",
-        "root1.left = TreeNode(2)\n",
-        "root1.right = TreeNode(7)\n",
-        "root1.left.left = TreeNode(1)\n",
-        "root1.left.right = TreeNode(3)\n",
-        "root1.right.left = TreeNode(6)\n",
-        "root1.right.right = TreeNode(9)\n",
-        "\n",
-        "inverted_root1 = invertTree(root1)\n",
-        "print(\"Inverted Tree (Example 1):\", inverted_root1)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inorder Traversal of Inverted Tree (Example 2): <__main__.TreeNode object at 0x2255fc0>\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 2\n",
-        "# Input: root = [2,1,3]\n",
-        "\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(3)\n",
-        "\n",
-        "inverted_root2 = invertTree(root2)\n",
-        "print(\"Inverted Tree (Example 2):\", inverted_root2)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Inverted Tree (Example 3): None\n"
-          ]
-        }
-      ],
-      "source": [
-        "### Example 3\n",
-        "# Input: root = []\n",
-        "\n",
-        "root3 = None  # Empty tree\n",
-        "\n",
-        "inverted_root3 = invertTree(root3)\n",
-        "print(\"Inverted Tree (Example 3):\", inverted_root3)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "Let's discuss the time and space complexity of the provided Python code to invert a binary tree.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of the `invertTree` function is $O(n)$, where $n$ is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.\n",
-        "\n",
-        "The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is $O(h)$, where $h$ is the height of the binary tree. \n",
-        "\n",
-        "In a completely unbalanced binary tree (essentially a linked list), the height $h$ is equal to the number of nodes $n$, resulting in a space complexity of $O(n)$. This occurs when the tree is skewed to one side.\n",
-        "\n",
-        "In a balanced binary tree, such as a full binary tree, the height $h$ is $O(log\\ n)$, and the space complexity is $O(log\\ n)$.\n",
-        "\n",
-        "The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to $O(log\\ n)$.\n",
-        "\n",
-        "**In summary:**\n",
-        "\n",
-        "- Time Complexity: $O(n)$ where $n$ is the number of nodes.\n",
-        "- Space Complexity: $O(h)$, where $h$ is the height of the binary tree. In the worst case, it can be $O(n)$, and in a balanced tree, it is $O(log\\ n)$.\n",
-        "\n",
-        "Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with $O(1)$ space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb b/docs/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb
deleted file mode 100644
index 673ced2..0000000
--- a/docs/_build/html/_sources/07. Trees/230. Kth Smallest Element in a BST.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 230. Kth Smallest Element in a BST\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Smallest Element in a BST problem on LeetCode, click here!](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary search tree, and an integer `k`, return *the $k^{th}$ smallest value (**1-indexed**) of all the values of the nodes in the tree.*\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is `n`.\n",
-        "- 1 <= `k <= n` <= $10^4$\n",
-        "- 0 <= `Node.val` <= $10^4$\n",
-        "\n",
-        "**Follow up**: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def kthSmallest(root, k):\n",
-        "    stack = []  # Initialize an empty stack to simulate the traversal\n",
-        "    while root or stack:\n",
-        "        while root:\n",
-        "            stack.append(root)  # Push the current node onto the stack\n",
-        "            root = root.left  # Move to the left child\n",
-        "        root = stack.pop()  # Pop a node from the stack\n",
-        "        k -= 1  # Decrement k since we've visited a node\n",
-        "        if k == 0:\n",
-        "            return root.val  # If k becomes 0, return the current node's value as the kth smallest\n",
-        "        root = root.right  # Move to the right child to continue the traversal"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. We start by defining a `TreeNode` class, which represents a node in the binary search tree (BST). Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-        "\n",
-        "2. The `kthSmallest` function takes two parameters: `root`, which is the root of the BST, and `k`, which represents the kth smallest element we want to find.\n",
-        "\n",
-        "3. We initialize an empty stack (`stack`) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.\n",
-        "\n",
-        "4. We enter a while loop that continues until either `root` becomes `None` (indicating we have traversed the entire tree) or the `stack` is empty.\n",
-        "\n",
-        "5. Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the `stack` and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.\n",
-        "\n",
-        "6. Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the `stack` one by one. As we pop each node, we decrement `k` by 1 to keep track of the number of nodes we have visited.\n",
-        "\n",
-        "7. If `k` becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the `val` of the current node as the result.\n",
-        "\n",
-        "8. If `k` is still greater than 0, it means we haven't found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.\n",
-        "\n",
-        "9. The process continues until we find the kth smallest element or traverse the entire tree.\n",
-        "\n",
-        "10. Finally, we return the kth smallest element found.\n",
-        "\n",
-        "The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: root = [3,1,4,null,2], k = 1\n",
-        "root1 = TreeNode(3)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(4)\n",
-        "root1.left.right = TreeNode(2)\n",
-        "k1 = 1\n",
-        "print(kthSmallest(root1, k1)) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(3)\n",
-        "root2.right = TreeNode(6)\n",
-        "root2.left.left = TreeNode(2)\n",
-        "root2.left.right = TreeNode(4)\n",
-        "root2.left.left.left = TreeNode(1)\n",
-        "k2 = 3\n",
-        "print(kthSmallest(root2, k2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the given code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The time complexity of this code is O(h + k), where:\n",
-        "- h is the height of the binary search tree (BST).\n",
-        "- k is the desired kth smallest element we want to find.\n",
-        "\n",
-        "1. In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).\n",
-        "\n",
-        "2. In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).\n",
-        "\n",
-        "So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.\n",
-        "\n",
-        "1. In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.\n",
-        "\n",
-        "2. In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.\n",
-        "\n",
-        "So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.\n",
-        "\n",
-        "In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Largest Element**: Modify the code to find the kth largest element in the BST instead of the kth smallest element.\n",
-        "\n",
-        "2. **Kth Smallest Element in Two BSTs**: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/docs/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
deleted file mode 100644
index 666bcd9..0000000
--- a/docs/_build/html/_sources/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 235. Lowest Common Ancestor of a Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.\n",
-        "\n",
-        "According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes `p` and `q` as the lowest node in `T` that has both `p` and `q` as descendants (where we allow **a node to be a descendant of itself**).”\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[2, 10^5]$.\n",
-        "- $-10^9$ <= `Node.val` <= $10^9$\n",
-        "- All `Node.val` are **unique**.\n",
-        "- `p != q`\n",
-        "- `p` and `q` will exist in the BST.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def lowestCommonAncestor(root, p, q):\n",
-        "    # Ensure p is less than q\n",
-        "    if p.val > q.val:\n",
-        "        p, q = q, p\n",
-        "\n",
-        "    while root:\n",
-        "        # If the current node value is greater than both p and q, move left\n",
-        "        if root.val > q.val:\n",
-        "            root = root.left\n",
-        "        # If the current node value is less than both p and q, move right\n",
-        "        elif root.val < p.val:\n",
-        "            root = root.right\n",
-        "        # If the current node value is between p and q (inclusive), or it matches either p or q, it's the LCA\n",
-        "        else:\n",
-        "            return root"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. `class TreeNode:` defines a simple class for representing nodes in a binary tree. Each `TreeNode` has three attributes:\n",
-        "   - `val`: The value of the node.\n",
-        "   - `left`: A reference to the left child node.\n",
-        "   - `right`: A reference to the right child node.\n",
-        "\n",
-        "2. `def lowestCommonAncestor(root, p, q):` is a function that takes three arguments:\n",
-        "   - `root`: The root node of the BST.\n",
-        "   - `p`: A TreeNode representing one of the nodes for which we want to find the LCA.\n",
-        "   - `q`: A TreeNode representing the other node for which we want to find the LCA.\n",
-        "\n",
-        "3. `if p.val > q.val:` checks if the value of `p` is greater than the value of `q`. In a BST, it's essential to ensure that `p` represents the smaller value, and `q` represents the larger value. If `p` is greater than `q`, the code swaps their values.\n",
-        "\n",
-        "4. The main logic is inside the `while` loop, which runs until `root` becomes `None`. It performs the following steps to find the LCA:\n",
-        "   - If the current `root` node's value is greater than the value of `q`, it means both `p` and `q` are on the left subtree of the current node. So, we move to the left child of the current node by setting `root = root.left`.\n",
-        "   - If the current `root` node's value is less than the value of `p`, it means both `p` and `q` are on the right subtree of the current node. So, we move to the right child of the current node by setting `root = root.right`.\n",
-        "   - If neither of the above conditions is met, it means the current `root` node's value is between `p` and `q`, or it matches either `p` or `q`. In this case, the current node is the lowest common ancestor (LCA), so we return `root`.\n",
-        "\n",
-        "The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of `p`, `q`, and the current `root` node. Eventually, it reaches the LCA node, and that node is returned as the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "6\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Construct the tree\n",
-        "root = TreeNode(6)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(8)\n",
-        "root.left.left = TreeNode(0)\n",
-        "root.left.right = TreeNode(4)\n",
-        "root.right.left = TreeNode(7)\n",
-        "root.right.right = TreeNode(9)\n",
-        "root.left.right.left = TreeNode(3)\n",
-        "root.left.right.right = TreeNode(5)\n",
-        "\n",
-        "p = root.left  # Node 2\n",
-        "q = root.right  # Node 8\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Using the same tree as before\n",
-        "p = root.left  # Node 2\n",
-        "q = root.left.right  # Node 4\n",
-        "\n",
-        "result = lowestCommonAncestor(root, p, q)\n",
-        "print(result.val) "
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3:\n",
-        "# Creating a new tree for this example\n",
-        "root2 = TreeNode(2)\n",
-        "root2.left = TreeNode(1)\n",
-        "\n",
-        "p = root2  # Node 2\n",
-        "q = root2.left  # Node 1\n",
-        "\n",
-        "result = lowestCommonAncestor(root2, p, q)\n",
-        "print(result.val)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this algorithm is O(h), where \"h\" is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where \"n\" is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).\n",
-        "\n",
-        "The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes `p` and `q`. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are `root`, `p`, and `q`, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.\n",
-        "\n",
-        "**In summary**, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where \"h\" is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "### Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple LCAs:** Extend the algorithm to find all the lowest common ancestors of two given nodes `p` and `q` in a BST. In some cases, there can be multiple LCAs.\n",
-        "\n",
-        "2. **LCA with k Nodes:** Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/docs/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
deleted file mode 100644
index 75c48ea..0000000
--- a/docs/_build/html/_sources/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb	
+++ /dev/null
@@ -1,297 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 297. Serialize and Deserialize Binary Tree\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n",
-        "\n",
-        "---\n",
-        "Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.\n",
-        "\n",
-        "Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.\n",
-        "\n",
-        "**Clarification:** The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-        "- `-1000 <= Node.val <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.\n",
-        "\n",
-        "In the context of this problem:\n",
-        "\n",
-        "1. **Serialization**: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.\n",
-        "\n",
-        "2. **Deserialization**: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.\n",
-        "\n",
-        "Here are some key points to consider in solving this problem:\n",
-        "\n",
-        "- The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].\n",
-        "- You don't necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.\n",
-        "- The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.\n",
-        "\n",
-        "A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode(object):\n",
-        "    def __init__(self, x):\n",
-        "        self.val = x\n",
-        "        self.left = None\n",
-        "        self.right = None\n",
-        "\n",
-        "class Codec:\n",
-        "    def serialize(self, root):\n",
-        "        serialized  = []\n",
-        "\n",
-        "        def dfs(node):\n",
-        "            if not node:\n",
-        "                # If the node is None, represent it as \"Null\" in the serialized string\n",
-        "                serialized .append(\"Null\")\n",
-        "                return\n",
-        "            # Convert the node's value to a string and add it to the serialized string\n",
-        "            serialized .append(str(node.val))\n",
-        "            dfs(node.left)\n",
-        "            dfs(node.right)\n",
-        "\n",
-        "        dfs(root)\n",
-        "        # Join the serialized values with \",\"\n",
-        "        return \",\".join(serialized )\n",
-        "\n",
-        "    def deserialize(self, data):\n",
-        "        vals = data.split(\",\")\n",
-        "        self.i = 0\n",
-        "\n",
-        "        def dfs():\n",
-        "            if vals[self.i] == \"Null\":\n",
-        "                self.i += 1\n",
-        "                return None\n",
-        "            # Convert the value to an integer to create a new node\n",
-        "            node = TreeNode(int(vals[self.i]))\n",
-        "            self.i += 1\n",
-        "            node.left = dfs()\n",
-        "            node.right = dfs()\n",
-        "            return node\n",
-        "\n",
-        "        return dfs()"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. **Definition of TreeNode**:\n",
-        "   - The code defines a simple `TreeNode` class that represents a node in a binary tree. Each `TreeNode` has three attributes:\n",
-        "     - `val`: The integer value stored in the node.\n",
-        "     - `left`: A reference to the left child node (or None if there is no left child).\n",
-        "     - `right`: A reference to the right child node (or None if there is no right child).\n",
-        "   - This class allows you to create binary tree nodes with integer values and left and right child references.\n",
-        "\n",
-        "2. **Serialization (serialize method)**:\n",
-        "   - The `serialize` method takes a `root` node as input, which is the root of the binary tree that needs to be serialized.\n",
-        "   - It initializes an empty list `serialized` to store the serialized elements.\n",
-        "   - The `dfs` (depth-first search) function is defined within the `serialize` method to perform a preorder traversal of the binary tree.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current `node` is `None` (i.e., a leaf node or a child of a leaf node), it appends the string \"Null\" to the `serialized` list to represent the absence of a node.\n",
-        "     - If the current `node` is not `None`, it appends the string representation of the `node.val` to the `serialized` list and then recursively calls `dfs` on the left and right children.\n",
-        "   - After the `dfs` traversal, the `serialized` list contains the serialized binary tree elements.\n",
-        "   - The method returns a string obtained by joining the elements in the `serialized` list with commas.\n",
-        "\n",
-        "3. **Deserialization (deserialize method)**:\n",
-        "   - The `deserialize` method takes a serialized string `data` as input, which represents a binary tree in the custom format.\n",
-        "   - It splits the `data` string by commas to obtain a list of elements called `vals`.\n",
-        "   - The method initializes an index `self.i` to 0. This index keeps track of the current position in the `vals` list during deserialization.\n",
-        "   - The `dfs` function is defined within the `deserialize` method to perform the deserialization process using a recursive approach.\n",
-        "   - In the `dfs` function:\n",
-        "     - If the current element in `vals` is \"Null,\" it means there is no node at this position in the binary tree, so it returns `None`.\n",
-        "     - If the current element is not \"Null,\" it converts the element to an integer to create a new `TreeNode` with that value.\n",
-        "     - It then recursively calls `dfs` to set the left and right children of the current node.\n",
-        "   - The method returns the root node of the reconstructed binary tree.\n",
-        "\n",
-        "Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1,2,Null,Null,3,4,Null,Null,5,Null,Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = TreeNode(1)\n",
-        "root.left = TreeNode(2)\n",
-        "root.right = TreeNode(3)\n",
-        "root.right.left = TreeNode(4)\n",
-        "root.right.right = TreeNode(5)\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Null\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Example usage:\n",
-        "# Serialize a binary tree\n",
-        "root = None\n",
-        "\n",
-        "codec = Codec()\n",
-        "serialized_tree = codec.serialize(root)\n",
-        "print(serialized_tree)\n",
-        "\n",
-        "# Deserialize the serialized tree\n",
-        "new_root = codec.deserialize(serialized_tree)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:\n",
-        "\n",
-        "1. **Serialization (serialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `serialize` method uses a depth-first traversal (preorder) of the binary tree.\n",
-        "     - It visits each node exactly once.\n",
-        "     - At each node, it performs constant-time operations (string conversion and list append).\n",
-        "     - Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for serialization includes the space used by the `serialized` list and the recursive call stack.\n",
-        "     - The `serialized` list stores the serialized elements, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "2. **Deserialization (deserialize method)**:\n",
-        "\n",
-        "   - Time Complexity:\n",
-        "     - The `deserialize` method splits the serialized string into a list of elements, which takes O(N) time.\n",
-        "     - The `dfs` function is a recursive function that visits each element in the list exactly once.\n",
-        "     - At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).\n",
-        "     - Therefore, the time complexity for deserialization is O(N).\n",
-        "\n",
-        "   - Space Complexity:\n",
-        "     - The space complexity for deserialization includes the space used by the `vals` list and the recursive call stack.\n",
-        "     - The `vals` list stores the elements from the serialized string, and its space is proportional to the number of nodes.\n",
-        "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-        "     - Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-        "\n",
-        "Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Efficient Serialization**:\n",
-        "   Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.\n",
-        "\n",
-        "2. **Custom Serialization Format**:\n",
-        "   Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb b/docs/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb
deleted file mode 100644
index 8a41c3b..0000000
--- a/docs/_build/html/_sources/07. Trees/572. Subtree of Another Tree.ipynb	
+++ /dev/null
@@ -1,265 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 572: Subtree of Another Tree\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Subtree of Another Tree problem on LeetCode, click here!](https://leetcode.com/problems/subtree-of-another-tree/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "**Problem Description:**\n",
-        "\n",
-        "Given the roots of two binary trees `root` and `subRoot`, return `True` if there is a subtree of `root` with the same structure and node values as `subRoot`, and `False` otherwise.\n",
-        "\n",
-        "A subtree of a binary tree `tree` is a tree that consists of a node in `tree` and all of this node's descendants. The tree `tree` could also be considered as a subtree of itself.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "1. The number of nodes in the `root` tree is in the range $[1, 2000]$.\n",
-        "2. The number of nodes in the `subRoot` tree is in the range $[1, 1000]$.\n",
-        "3. $-10^4$ <= root.val <= $10^4$\n",
-        "4. $-10^4$ <= subRoot.val <= $10^4$\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 17,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a binary tree node.\n",
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "class Solution:\n",
-        "    def isSubtree(self, root, subRoot):\n",
-        "        if not root:\n",
-        "            return False\n",
-        "        \n",
-        "        # Check if the current subtree is equal to the subRoot\n",
-        "        if self.isSameTree(root, subRoot):\n",
-        "            return True\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees\n",
-        "        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)\n",
-        "    \n",
-        "    def isSameTree(self, tree1, tree2):\n",
-        "        if not tree1 and not tree2:\n",
-        "            return True\n",
-        "        if not tree1 or not tree2:\n",
-        "            return False\n",
-        "        \n",
-        "        return (\n",
-        "            tree1.val == tree2.val and\n",
-        "            self.isSameTree(tree1.left, tree2.left) and\n",
-        "            self.isSameTree(tree1.right, tree2.right)\n",
-        "        )"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:\n",
-        "\n",
-        "1. `isSubtree`: This method checks if there is a subtree of the `root` tree with the same structure and node values as the `subRoot` tree. It uses a helper function `isSameTree` to compare two trees for equality.\n",
-        "\n",
-        "2. `isSameTree`: This helper method recursively compares two trees to check if they are the same in structure and node values.\n",
-        "\n",
-        "### Here's a detailed explanation of the code:\n",
-        "\n",
-        "1. **TreeNode Class:**\n",
-        "\n",
-        "The `TreeNode` class is defined to represent nodes in a binary tree. Each node has a `val` (the node's value) and may have a `left` and `right` child.\n",
-        "\n",
-        "2. **Solution Class:**\n",
-        "\n",
-        "    + The `Solution` class contains the solution for the problem and defines two important methods:\n",
-        "\n",
-        "    + `isSubtree(self, root, subRoot)`:\n",
-        "\n",
-        "        - This method checks whether `subRoot` is a subtree of `root`. It takes two tree nodes, `root` and `subRoot`, as input arguments.\n",
-        "        - If `root` is `None`, it returns `False` because there is no subtree to search.\n",
-        "        - It then checks if the current subtree with `root` as its root is equal to `subRoot` using the `isSameTree` method. If they are the same, it returns `True`.\n",
-        "        - If the current subtree is not the same as `subRoot`, it recursively checks the left and right subtrees of `root` to see if `subRoot` is a subtree of any of them.\n",
-        "        - It returns `True` if `subRoot` is found in either the left or right subtree; otherwise, it returns `False`.\n",
-        "\n",
-        "    + `isSameTree(self, tree1, tree2)`:\n",
-        "\n",
-        "        - This method checks whether two trees, `tree1` and `tree2`, are the same.\n",
-        "        - If both `tree1` and `tree2` are `None`, they are considered the same tree, so it returns `True`.\n",
-        "        - If only one of them is `None` (but not both), they are different trees, so it returns `False`.\n",
-        "        - If both `tree1` and `tree2` have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.\n",
-        "        - It returns `True` if the trees are the same; otherwise, it returns `False`.\n",
-        "\n",
-        "The code effectively uses recursion to traverse the binary trees and check for subtree equality. The `isSubtree` method starts the recursive search, and the `isSameTree` method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.\n",
-        "\n",
-        "This solution allows you to determine if there exists a subtree within the `root` tree that matches the structure and node values of `subRoot`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? True\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2]\n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Is subRoot a subtree of root? False\n"
-          ]
-        }
-      ],
-      "source": [
-        "#root = [3,4,5,1,2,null,null,null,null,0] \n",
-        "#subRoot = [4,1,2]\n",
-        "\n",
-        "\n",
-        "# Example input\n",
-        "root = TreeNode(3)\n",
-        "root.left = TreeNode(4)\n",
-        "root.right = TreeNode(5)\n",
-        "root.left.left = TreeNode(1)\n",
-        "root.left.right = TreeNode(2)\n",
-        "root.left.right.left = TreeNode(0)\n",
-        "\n",
-        "subRoot = TreeNode(4)\n",
-        "subRoot.left = TreeNode(1)\n",
-        "subRoot.right = TreeNode(2)\n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test the isSubtree method\n",
-        "result = solution.isSubtree(root, subRoot)\n",
-        "print(\"Is subRoot a subtree of root?\", result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "86a34f0d-0789-498c-818c-2d30f84754d0",
-      "metadata": {},
-      "source": [
-        "Let's analyze the time and space complexity of the provided code for the \"Subtree of Another Tree\" problem:\n",
-        "\n",
-        "**Time Complexity**\n",
-        "\n",
-        "The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the `isSubtree` and `isSameTree` functions, we visit each node in the binary trees once. Let's break down the time complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - In the worst case, we need to visit every node in the `root` tree.\n",
-        "   - For each node in the `root` tree, we call the `isSameTree` function, which has its own traversal.\n",
-        "   - So, the total time complexity is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - In the worst case, we visit every node in both `tree1` and `tree2`.\n",
-        "   - The number of recursive calls made is proportional to the number of nodes in the trees.\n",
-        "   - So, the time complexity of this function is $O(max(n, m))$, where $n$ and $m$ are the numbers of nodes in `tree1` and `tree2`, respectively.\n",
-        "\n",
-        "Overall, the time complexity of the entire code is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree. In practice, it may be less than $O(n * m)$ if a subtree mismatch is detected early during the traversal.\n",
-        "\n",
-        "**Space Complexity**\n",
-        "\n",
-        "The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let's analyze the space complexity:\n",
-        "\n",
-        "1. The `isSubtree` function:\n",
-        "   - It uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `root` tree, which can be $O(n)$ in the worst case (unbalanced tree).\n",
-        "   - Additionally, the function doesn't use any significant extra space other than the recursion stack.\n",
-        "\n",
-        "2. The `isSameTree` function:\n",
-        "   - It also uses the call stack for recursion.\n",
-        "   - The maximum depth of the recursion is equal to the height of the `tree1` or `tree2`, whichever is greater.\n",
-        "   - So, the maximum space used for the call stack is $O(max(n, m))$.\n",
-        "\n",
-        "In summary, the space complexity of the code is $O(max(n, m))$ due to the function call stack. It scales with the maximum height of the trees being compared.\n",
-        "\n",
-        "Overall, the code is efficient and works well for trees with moderate sizes. However, it's important to keep in mind that the worst-case time complexity is $O(n * m)$, so for very large trees, the performance may degrade."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb b/docs/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb
deleted file mode 100644
index ad86882..0000000
--- a/docs/_build/html/_sources/07. Trees/98. Validate Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 98. Validate Binary Search Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Validate Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/validate-binary-search-tree/)\n",
-        "\n",
-        "---\n",
-        "Given the `root` of a binary tree, *determine if it is a valid binary search tree (BST)*.\n",
-        "\n",
-        "A **valid BST** is defined as follows:\n",
-        "\n",
-        "- The left subtree of a node contains only nodes with keys **less than** the node's key.\n",
-        "- The right subtree of a node contains only nodes with keys **greater than** the node's key.\n",
-        "- Both the left and right subtrees must also be binary search trees. \n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the tree is in the range $[1, 10^4]$.\n",
-        "- $-2^{31}$ <= `Node.val` <= $2^{31} - 1$\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to solve this problem:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TreeNode:\n",
-        "    def __init__(self, val=0, left=None, right=None):\n",
-        "        self.val = val\n",
-        "        self.left = left\n",
-        "        self.right = right\n",
-        "\n",
-        "def is_valid_BST(root):\n",
-        "    def is_valid(node, min_val, max_val):\n",
-        "        # Base case: If the node is None, it's a valid BST.\n",
-        "        if node is None:\n",
-        "            return True\n",
-        "        \n",
-        "        # Check if the current node's value is within the valid range.\n",
-        "        if not (min_val < node.val < max_val):\n",
-        "            return False\n",
-        "        \n",
-        "        # Recursively check the left and right subtrees with updated ranges.\n",
-        "        return (is_valid(node.left, min_val, node.val) and\n",
-        "                is_valid(node.right, node.val, max_val))\n",
-        "    \n",
-        "    # Call the helper function starting with a wide range for root node.\n",
-        "    return is_valid(root, float('-inf'), float('inf'))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- It defines a `TreeNode` class to represent nodes in the binary tree.\n",
-        "\n",
-        "- The `is_valid_BST` function takes the root node of the binary tree as input and returns `True` if the tree is a valid BST, and `False` otherwise.\n",
-        "\n",
-        "- Inside the `is_valid_BST` function, there is a helper function called `is_valid` that performs the actual validation using a recursive approach.\n",
-        "\n",
-        "- The `is_valid` function checks each node in the tree to ensure that it satisfies the properties of a BST:\n",
-        "  - The value of the current node must be within a valid range defined by `min_val` and `max_val`.\n",
-        "  - The left subtree of the current node should contain values less than the current node's value.\n",
-        "  - The right subtree of the current node should contain values greater than the current node's value.\n",
-        "\n",
-        "- If any of these conditions are violated, the function returns `False`, indicating that the tree is not a valid BST.\n",
-        "\n",
-        "- If all nodes satisfy these conditions, the function returns `True`, indicating that the tree is a valid BST.\n",
-        "\n",
-        "- The code calls the `is_valid` function with the root node and initial range values of negative infinity to positive infinity to start the validation.\n",
-        "\n",
-        "- The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.\n",
-        "\n",
-        "- The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.\n",
-        "\n",
-        "In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node's value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "# Create the tree for the first example: [2, 1, 3]\n",
-        "root1 = TreeNode(2)\n",
-        "root1.left = TreeNode(1)\n",
-        "root1.right = TreeNode(3)\n",
-        "print(is_valid_BST(root1))"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "\n",
-        "# Create the tree for the second example: [5, 1, 4, None, None, 3, 6]\n",
-        "root2 = TreeNode(5)\n",
-        "root2.left = TreeNode(1)\n",
-        "root2.right = TreeNode(4)\n",
-        "root2.right.left = TreeNode(3)\n",
-        "root2.right.right = TreeNode(6)\n",
-        "print(is_valid_BST(root2))"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `is_valid_BST` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The time complexity of the function primarily depends on the number of nodes in the binary tree.\n",
-        "- In the worst case, we may have to visit every node in the tree once to validate whether it's part of a valid BST.\n",
-        "- Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The space complexity is determined by the space used by the recursive call stack during the DFS traversal.\n",
-        "- In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.\n",
-        "- In a balanced BST, the height is approximately log2(N), where N is the number of nodes.\n",
-        "- Therefore, the space complexity of the call stack is O(log N) for a balanced BST.\n",
-        "- In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.\n",
-        "\n",
-        "**Overall:**\n",
-        "- Time Complexity: O(N)\n",
-        "- Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.\n",
-        "\n",
-        "The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Complex Constraints**: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like \"The left subtree of a node contains only nodes with keys less than or equal to the node's key,\" and \"The right subtree of a node contains only nodes with keys greater than or equal to the node's key.\" How would you adapt the code to handle these constraints?\n",
-        "\n",
-        "2. **Handling Duplicates**: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/07. Trees/README.md b/docs/_build/html/_sources/07. Trees/README.md
deleted file mode 100644
index 1eba5d4..0000000
--- a/docs/_build/html/_sources/07. Trees/README.md	
+++ /dev/null
@@ -1,26 +0,0 @@
-# Trees Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/docs/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb
deleted file mode 100644
index 9da2a17..0000000
--- a/docs/_build/html/_sources/08. Tries/208. Implement Trie (Prefix Tree).ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 208. Implement Trie (Prefix Tree)\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Implement Trie problem on LeetCode, click here!](https://leetcode.com/problems/implement-trie-prefix-tree/)\n",
-        "\n",
-        "---\n",
-        "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.\n",
-        "\n",
-        "Implement the Trie class:\n",
-        "\n",
-        "- `Trie()` Initializes the trie object.\n",
-        "- `void insert(String word)` Inserts the string `word` into the trie.\n",
-        "- `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.\n",
-        "- `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length, prefix.length <= 2000`\n",
-        "- `word` and `prefix` consist only of lowercase English letters.\n",
-        "- At most $3 * 10^4$ calls in total will be made to `insert`, `search`, and `startsWith`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to implement a data structure known as a Trie (pronounced \"try\") or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It's particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:\n",
-        "\n",
-        "1. `Trie()`: This is the constructor that initializes the Trie object.\n",
-        "\n",
-        "2. `void insert(String word)`: This method inserts the given string `word` into the Trie. It effectively adds the characters of the word to the Trie's structure, creating nodes for each character if they don't already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.\n",
-        "\n",
-        "3. `boolean search(String word)`: This method checks if the given string `word` is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns `true`, indicating that the word exists in the Trie; otherwise, it returns `false`.\n",
-        "\n",
-        "4. `boolean startsWith(String prefix)`: This method checks if there is any previously inserted word in the Trie that has the given `prefix`. It's similar to the `search` method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns `true`; otherwise, it returns `false`.\n",
-        "\n",
-        "The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.\n",
-        "\n",
-        "In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}           # A dictionary to store child nodes\n",
-        "        self.is_end_of_word = False  # Indicates if a word ends at this node\n",
-        "\n",
-        "class Trie:\n",
-        "    def __init__(self):\n",
-        "        self.root = TrieNode()       # Initialize the Trie with a root node\n",
-        "\n",
-        "    def insert(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                node.children[char] = TrieNode()  # Create a new node if the character is not present\n",
-        "            node = node.children[char]           # Move to the child node\n",
-        "        node.is_end_of_word = True                # Mark the end of the inserted word\n",
-        "\n",
-        "    def search(self, word):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, the word is not in the Trie\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return node.is_end_of_word    # Check if the node represents the end of a valid word\n",
-        "\n",
-        "    def startsWith(self, prefix):\n",
-        "        node = self.root             # Start from the root\n",
-        "        for char in prefix:\n",
-        "            if char not in node.children:\n",
-        "                return False         # If the character is not found, no word starts with the prefix\n",
-        "            node = node.children[char]  # Move to the child node\n",
-        "        return True                  # Prefix found in the Trie"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "Let's explain how the code works step by step:\n",
-        "\n",
-        "1. `TrieNode` Class:\n",
-        "   - `TrieNode` is a class that represents nodes in the Trie. Each node has two attributes:\n",
-        "     - `children`: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.\n",
-        "     - `is_end_of_word`: This boolean flag indicates whether the node represents the end of a complete word. Initially, it's set to `False` for all nodes.\n",
-        "\n",
-        "2. `Trie` Class:\n",
-        "   - `Trie` is the main class that implements the Trie data structure. It has the following methods:\n",
-        "\n",
-        "   - `__init__(self)`: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.\n",
-        "\n",
-        "   - `insert(self, word)`: This method inserts a string `word` into the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not present as a child node, it creates a new node for that character.\n",
-        "     - It then moves to the child node and continues the process until the entire word is inserted.\n",
-        "     - Finally, it sets the `is_end_of_word` flag to `True` for the last node to mark the end of the inserted word.\n",
-        "\n",
-        "   - `search(self, word)`: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.\n",
-        "     - If a character is not found as a child node, it immediately returns `False` because the word is not in the Trie.\n",
-        "     - It continues to move to the child node for each character.\n",
-        "     - After reaching the end of the word, it checks if the `is_end_of_word` flag is `True` for the last node to confirm the presence of the word.\n",
-        "\n",
-        "   - `startsWith(self, prefix)`: This method checks if there is any previously inserted word in the Trie that starts with a given `prefix`. It follows the same logic as the `search` method but does not require the entire word to be present.\n",
-        "     - If the prefix is found in the Trie, it returns `True`; otherwise, it returns `False`.\n",
-        "\n",
-        "3. Example Usage:\n",
-        "   - The code demonstrates how to create a Trie object, insert words (\"apple\" and \"app\"), and perform operations on the Trie:\n",
-        "     - It inserts the word \"apple\" into the Trie.\n",
-        "     - It checks if \"apple\" is in the Trie, which returns `True`.\n",
-        "     - It checks if \"app\" is in the Trie, which returns `False`.\n",
-        "     - It checks if there is any word in the Trie that starts with \"app,\" which returns `True`.\n",
-        "     - It inserts the word \"app\" into the Trie.\n",
-        "     - It checks if \"app\" is in the Trie again, which now returns `True`.\n",
-        "\n",
-        "In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n",
-            "False\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "trie = Trie()\n",
-        "trie.insert(\"apple\")\n",
-        "print(trie.search(\"apple\"))   # Output: True\n",
-        "print(trie.search(\"app\"))     # Output: False\n",
-        "print(trie.startsWith(\"app\")) # Output: True\n",
-        "trie.insert(\"app\")\n",
-        "print(trie.search(\"app\"))     # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the Trie implementation:\n",
-        "\n",
-        "1. Time Complexity:\n",
-        "   - Insertion (`insert` method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.\n",
-        "   - Search (`search` method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.\n",
-        "   - Starts with (`startsWith` method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.\n",
-        "\n",
-        "   Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.\n",
-        "\n",
-        "2. Space Complexity:\n",
-        "   - The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.\n",
-        "   - Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.\n",
-        "\n",
-        "   In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.\n",
-        "\n",
-        "In summary:\n",
-        "- Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.\n",
-        "- Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Count Prefixes**:\n",
-        "   Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.\n",
-        "\n",
-        "2. **Auto-Complete Suggestions**:\n",
-        "   Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/docs/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb
deleted file mode 100644
index 2de472c..0000000
--- a/docs/_build/html/_sources/08. Tries/211. Design Add and Search Words Data Structure.ipynb	
+++ /dev/null
@@ -1,275 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 211. Design Add and Search Words Data Structure\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Design Add and Search Words Data Structure problem on LeetCode, click here!](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n",
-        "\n",
-        "---\n",
-        "Design a data structure that supports adding new words and finding if a string matches any previously added string.\n",
-        "\n",
-        "Implement the `WordDictionary` class:\n",
-        "\n",
-        "- `WordDictionary()` Initializes the object.\n",
-        "- `void addWord(word)` Adds `word` to the data structure, it can be matched later.\n",
-        "- `bool search(word)` Returns `true` if there is any string in the data structure that matches `word` or `false` otherwise. `word` may contain dots `'.'` where dots can be matched with any letter.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= word.length <= 25`\n",
-        "- `word` in `addWord` consists of lowercase English letters.\n",
-        "- `word` in `search` consist of `'.'` or lowercase English letters.\n",
-        "- There will be at most `2` dots in `word` for `search` queries.\n",
-        "- At most $10^4$ calls will be made to `addWord` and `search`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to design a data structure called `WordDictionary` that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot ('.') can match any letter.\n",
-        "\n",
-        "Here are the specific requirements and explanations for the problem:\n",
-        "\n",
-        "1. Initialize the `WordDictionary` object using the constructor `WordDictionary()`.\n",
-        "\n",
-        "2. The `addWord(word)` method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.\n",
-        "\n",
-        "3. The `search(word)` method allows you to search for a word in the data structure. This method returns `True` if there is any string in the data structure that matches the given word or `False` otherwise. The word you are searching for may contain dots ('.'), where each dot can match any letter.\n",
-        "\n",
-        "4. The wildcard character ('.') in the `search` method allows for partial or fuzzy searching. For example, if the word dictionary contains the words \"bad,\" \"dad,\" and \"mad,\" then:\n",
-        "   - Searching for \"pad\" should return `False` because there is no exact match.\n",
-        "   - Searching for \"bad\" should return `True` because \"bad\" is in the dictionary.\n",
-        "   - Searching for \".ad\" should return `True` because it can match \"bad,\" \"dad,\" or \"mad.\"\n",
-        "   - Searching for \"b..\" should return `True` because it can match \"bad,\" \"bed,\" \"bet,\" etc.\n",
-        "\n",
-        "5. The problem specifies that there will be at most two dots ('.') in search queries, and there will be at most 10^4 calls to both `addWord` and `search`.\n",
-        "\n",
-        "In summary, you need to implement the `WordDictionary` class that efficiently supports adding words and searching for words, where the search can include wildcard characters ('.') that match any letter.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        # Initialize a TrieNode with children and a flag to indicate the end of a word.\n",
-        "        self.children = {}\n",
-        "        self.is_end_of_word = False\n",
-        "\n",
-        "class WordDictionary:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize the WordDictionary with a root node.\n",
-        "        self.root = TrieNode()\n",
-        "\n",
-        "    def addWord(self, word: str) -> None:\n",
-        "        node = self.root\n",
-        "        # Iterate through the characters in the word.\n",
-        "        for char in word:\n",
-        "            if char not in node.children:\n",
-        "                # Create a new node for the character if it doesn't exist.\n",
-        "                node.children[char] = TrieNode()\n",
-        "            # Move to the next node.\n",
-        "            node = node.children[char]\n",
-        "        # Mark the end of the word by setting the flag to True.\n",
-        "        node.is_end_of_word = True\n",
-        "\n",
-        "    def search_helper(self, node: TrieNode, word: str) -> bool:\n",
-        "        if not word:\n",
-        "            # If there are no characters left in the word, check if we reached the end of a word in the trie.\n",
-        "            return node.is_end_of_word\n",
-        "        \n",
-        "        char = word[0]\n",
-        "        if char == '.':\n",
-        "            # If the character is a dot, explore all possible child nodes.\n",
-        "            for child in node.children.values():\n",
-        "                if self.search_helper(child, word[1:]):\n",
-        "                    return True\n",
-        "        elif char in node.children:\n",
-        "            # If the character is in the children of the current node, move to the next node.\n",
-        "            return self.search_helper(node.children[char], word[1:])\n",
-        "        \n",
-        "        # If the character is not found and is not a dot, the word is not in the trie.\n",
-        "        return False\n",
-        "\n",
-        "    def search(self, word: str) -> bool:\n",
-        "        # Start the search from the root of the trie.\n",
-        "        return self.search_helper(self.root, word)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This code defines a `WordDictionary` class that uses a Trie data structure to efficiently store and search for words. Here's a step-by-step explanation:\n",
-        "\n",
-        "1. `TrieNode` class: This class represents nodes in the Trie data structure. Each node has two attributes: `children` (a dictionary to store child nodes) and `is_end_of_word` (a flag to indicate whether the node marks the end of a word).\n",
-        "\n",
-        "2. `WordDictionary` class: This class initializes with an empty Trie by creating a root node.\n",
-        "\n",
-        "3. `addWord` method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the `is_end_of_word` flag to `True` for the final character of the word to mark the end of the word.\n",
-        "\n",
-        "4. `search_helper` method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (`node`) and a word to search (`word`) as input. If there are no characters left in the word (`not word`), it checks if the current node marks the end of a word. If it does, it returns `True`.\n",
-        "\n",
-        "5. If the first character of the word is a dot ('.'), the function explores all possible child nodes by iterating through `node.children.values()` and recursively calls `search_helper` for each child with the remaining part of the word (`word[1:]`).\n",
-        "\n",
-        "6. If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling `search_helper` on the child node and the remaining part of the word.\n",
-        "\n",
-        "7. If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns `False`.\n",
-        "\n",
-        "8. `search` method: This is the public method for searching words. It initiates the search process by calling `search_helper` starting from the root node of the Trie.\n",
-        "\n",
-        "Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots ('.')."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n",
-            "True\n",
-            "True\n",
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "\n",
-        "wordDictionary = WordDictionary()\n",
-        "wordDictionary.addWord(\"bad\")\n",
-        "wordDictionary.addWord(\"dad\")\n",
-        "wordDictionary.addWord(\"mad\")\n",
-        "print(wordDictionary.search(\"pad\"))  # Output: False\n",
-        "print(wordDictionary.search(\"bad\"))  # Output: True\n",
-        "print(wordDictionary.search(\".ad\"))  # Output: True\n",
-        "print(wordDictionary.search(\"b..\"))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `WordDictionary` class methods:\n",
-        "\n",
-        "1. `addWord` Method:\n",
-        "\n",
-        "   - Time Complexity: O(L)\n",
-        "     - L is the length of the word being added.\n",
-        "     - In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.\n",
-        "\n",
-        "2. `search_helper` Method (called by `search`):\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - M is the maximum number of dots ('.') in the search word.\n",
-        "     - In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.\n",
-        "     - So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.\n",
-        "\n",
-        "3. `search` Method:\n",
-        "\n",
-        "   - Time Complexity: O(2^M * L)\n",
-        "     - The `search` method calls the `search_helper` method, which has the same time complexity explained above.\n",
-        "\n",
-        "   - Space Complexity: O(L)\n",
-        "     - The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.\n",
-        "\n",
-        "Overall, the time complexity of the `search` method is mainly affected by the number of dots ('.') in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.\n",
-        "\n",
-        "The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.\n",
-        "\n",
-        "In summary:\n",
-        "\n",
-        "- Time Complexity for `addWord`: O(L)\n",
-        "- Time Complexity for `search`: O(2^M * L)\n",
-        "- Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.\n",
-        "\n",
-        "Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dictionary Auto-Completion**: Extend the `WordDictionary` class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.\n",
-        "\n",
-        "2. **Support Word Deletion**: Extend the `WordDictionary` class to support word deletion. Add a method `deleteWord(word)` that removes a word from the data structure. Ensure that the search operation still works correctly after deletion."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/08. Tries/212. Word Search II.ipynb b/docs/_build/html/_sources/08. Tries/212. Word Search II.ipynb
deleted file mode 100644
index 71597b8..0000000
--- a/docs/_build/html/_sources/08. Tries/212. Word Search II.ipynb	
+++ /dev/null
@@ -1,316 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 212. Word Search II\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search II problem on LeetCode, click here!](https://leetcode.com/problems/word-search-ii/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` `board` of characters and a list of strings `words`, the task is to return *all words on the board*.\n",
-        "\n",
-        "Each word must be constructed from letters of sequentially **adjacent cells**, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n == board[i].length`\n",
-        "- `1 <= m, n <= 12`\n",
-        "- `board[i][j]` is a lowercase English letter.\n",
-        "- 1 <= `words.length` <= $3 * 10^4$\n",
-        "- `1 <= words[i].length <= 10`\n",
-        "- `words[i]` consists of lowercase English letters.\n",
-        "- All the strings of `words` are unique."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "To solve the \"Word Search II\" problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here's a step-by-step approach to solve the problem:\n",
-        "\n",
-        "1. Build a Trie from the given list of words:\n",
-        "   - Create a Trie data structure to store all the words from the input list.\n",
-        "   - For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.\n",
-        "\n",
-        "2. Perform DFS on the board:\n",
-        "   - Iterate through each cell (i, j) on the board.\n",
-        "   - For each cell, start a DFS traversal from that cell to search for words.\n",
-        "   - During the DFS traversal, maintain a current path string.\n",
-        "   - At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.\n",
-        "   - If the current path string matches a word in the Trie, add it to the result.\n",
-        "\n",
-        "3. Implement DFS with backtracking:\n",
-        "   - During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven't been visited before.\n",
-        "   - To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like '#') before exploring it and restore its original character after the DFS traversal.\n",
-        "\n",
-        "4. Return the result:\n",
-        "   - After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.\n",
-        "   - Convert the result set to a list and return it as the final output.\n",
-        "\n",
-        "This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Define a TrieNode class to represent nodes in the Trie.\n",
-        "class TrieNode:\n",
-        "    def __init__(self):\n",
-        "        self.children = {}  # Dictionary to store child nodes.\n",
-        "        self.is_end_of_word = False  # Flag to mark the end of a word.\n",
-        "\n",
-        "# Main function to find words on the board.\n",
-        "def findWords(board, words):\n",
-        "    # DFS function to search for words starting from a given cell.\n",
-        "    def dfs(node, i, j, path):\n",
-        "        char = board[i][j]  # Get the character at the current cell.\n",
-        "        curr_node = node.children.get(char)  # Find the corresponding Trie node.\n",
-        "\n",
-        "        if not curr_node:\n",
-        "            return  # If no matching Trie node, stop the search.\n",
-        "\n",
-        "        path += char  # Add the character to the current path.\n",
-        "\n",
-        "        if curr_node.is_end_of_word:\n",
-        "            result.add(path)  # If the path matches a word, add it to the result.\n",
-        "\n",
-        "        temp, board[i][j] = board[i][j], \"#\"  # Mark the cell as visited.\n",
-        "\n",
-        "        # Explore neighboring cells (up, down, left, right).\n",
-        "        if i > 0:\n",
-        "            dfs(curr_node, i - 1, j, path)\n",
-        "        if i < m - 1:\n",
-        "            dfs(curr_node, i + 1, j, path)\n",
-        "        if j > 0:\n",
-        "            dfs(curr_node, i, j - 1, path)\n",
-        "        if j < n - 1:\n",
-        "            dfs(curr_node, i, j + 1, path)\n",
-        "\n",
-        "        board[i][j] = temp  # Restore the cell's original character.\n",
-        "\n",
-        "    # Function to build a Trie from the list of words.\n",
-        "    def buildTrie():\n",
-        "        root = TrieNode()  # Create a root node.\n",
-        "        for word in words:\n",
-        "            node = root\n",
-        "            for char in word:\n",
-        "                if char not in node.children:\n",
-        "                    node.children[char] = TrieNode()  # Create a new node if needed.\n",
-        "                node = node.children[char]\n",
-        "            node.is_end_of_word = True  # Mark the end of the word.\n",
-        "        return root\n",
-        "\n",
-        "    m, n = len(board), len(board[0])  # Get the dimensions of the board.\n",
-        "    root = buildTrie()  # Build the Trie from the list of words.\n",
-        "    result = set()  # Use a set to store unique words found on the board.\n",
-        "\n",
-        "    # Iterate through each cell on the board and start DFS from there.\n",
-        "    for i in range(m):\n",
-        "        for j in range(n):\n",
-        "            dfs(root, i, j, \"\")  # Start DFS from each cell on the board.\n",
-        "\n",
-        "    return list(result)  # Convert the set to a list and return the result."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code solves the \"Word Search II\" problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.\n",
-        "\n",
-        "The code does the following:\n",
-        "\n",
-        "1. Defines a `TrieNode` class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.\n",
-        "\n",
-        "2. Defines the `findWords` function, which takes the grid (`board`) and a list of words (`words`) as input.\n",
-        "\n",
-        "3. Inside the `findWords` function, there is a `dfs` (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.\n",
-        "\n",
-        "4. The code also includes a `buildTrie` function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.\n",
-        "\n",
-        "5. The dimensions of the grid are obtained (m x n).\n",
-        "\n",
-        "6. A Trie is built using the `buildTrie` function.\n",
-        "\n",
-        "7. A set called `result` is used to store unique words found in the grid.\n",
-        "\n",
-        "8. The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.\n",
-        "\n",
-        "9. During the DFS, it explores neighboring cells (up, down, left, right) if they haven't been visited before and if the current path matches a prefix in the Trie.\n",
-        "\n",
-        "10. When a word is found during the DFS traversal, it is added to the `result` set.\n",
-        "\n",
-        "11. The grid cell is marked as visited during the DFS by changing its character to \"#\", and it is restored to its original character after the DFS traversal.\n",
-        "\n",
-        "12. Finally, the set of unique words found is converted to a list and returned as the output.\n",
-        "\n",
-        "The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "['eat', 'oath']\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "board1 = [[\"o\",\"a\",\"a\",\"n\"],[\"e\",\"t\",\"a\",\"e\"],[\"i\",\"h\",\"k\",\"r\"],[\"i\",\"f\",\"l\",\"v\"]]\n",
-        "words1 = [\"oath\",\"pea\",\"eat\",\"rain\"]\n",
-        "print(findWords(board1, words1))  # Output: [\"eat\", \"oath\"]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "c748b879-a2d8-4298-a42c-c7f61f9c7fc6",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "board2 = [[\"a\",\"b\"],[\"c\",\"d\"]]\n",
-        "words2 = [\"abcb\"]\n",
-        "print(findWords(board2, words2))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. **Building the Trie (`buildTrie` function):** \n",
-        "   - Suppose there are `N` words in the input list, and the average length of a word is `L`.\n",
-        "   - Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.\n",
-        "\n",
-        "2. **DFS Traversal (`dfs` function):** \n",
-        "   - In the worst case, the DFS function explores all possible paths in the grid.\n",
-        "   - The maximum number of recursive calls for each cell is 4 (up, down, left, right).\n",
-        "   - The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most `L`.\n",
-        "   - Therefore, the DFS traversal for each cell takes $O(4^L)$ time.\n",
-        "\n",
-        "3. **Iterating Through the Grid (`findWords` function):**\n",
-        "   - In the worst case, we iterate through all `m` rows and `n` columns in the grid.\n",
-        "   - For each cell, we start a DFS traversal.\n",
-        "   - Therefore, iterating through the entire grid takes $O(m * n * 4^L)$ time.\n",
-        "\n",
-        "Overall, the time complexity of the code is $O(N * L + m * n * 4^L)$.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. **Trie Data Structure:**\n",
-        "   - The space required to store the Trie depends on the number of unique characters in all the words.\n",
-        "   - In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).\n",
-        "   - In practice, it may be less if there are common prefixes among words.\n",
-        "\n",
-        "2. **DFS Stack (Recursive Calls):**\n",
-        "   - The depth of the recursive call stack during DFS is at most `L`, where `L` is the length of the longest word in the Trie.\n",
-        "   - Therefore, the space complexity for the recursive call stack is O(L).\n",
-        "\n",
-        "3. **Result Set (`result` set):**\n",
-        "   - The space used to store the result set depends on the number of valid words found in the grid.\n",
-        "   - In the worst case, when all words are found, the space complexity of the result set is O(N * L).\n",
-        "\n",
-        "Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Word Search Paths:**\n",
-        "   Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.\n",
-        "\n",
-        "\n",
-        "2. **Reverse Word Search:**\n",
-        "   Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.)."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/08. Tries/README.md b/docs/_build/html/_sources/08. Tries/README.md
deleted file mode 100644
index 22c3bcd..0000000
--- a/docs/_build/html/_sources/08. Tries/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Trie Problems - Blind 75 LeetCode
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/docs/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
deleted file mode 100644
index cb66b6a..0000000
--- a/docs/_build/html/_sources/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb	
+++ /dev/null
@@ -1,254 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 1046. Last Stone Weight\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Last Stone Weight problem on LeetCode, click here!](https://leetcode.com/problems/last-stone-weight/)\n",
-        "\n",
-        "---\n",
-        "You are given an array of integers `stones` where `stones[i]` is the weight of the `i`th stone.\n",
-        "\n",
-        "We are playing a game with the stones. On each turn, you choose the **heaviest two stones** and smash them together. Suppose the heaviest two stones have weights `x` and `y` with `x <= y`. The result of this smash is:\n",
-        "\n",
-        "1. If `x == y`, both stones are destroyed.\n",
-        "2. If `x != y`, the stone of weight `x` is destroyed, and the stone of weight `y` has new weight `y - x`.\n",
-        "\n",
-        "At the end of the game, there is **at most one** stone left.\n",
-        "\n",
-        "Return *the weight of the last remaining stone*. If there are no stones left, return `0`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= stones.length <= 30`\n",
-        "- `1 <= stones[i] <= 1000`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Last Stone Weight\" problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.\n",
-        "\n",
-        "Here's how the game works:\n",
-        "\n",
-        "1. You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.\n",
-        "\n",
-        "2. In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you've found the answer.\n",
-        "\n",
-        "3. If there are two stones with weights `x` and `y`, where `x` is less than or equal to `y`, the following happens:\n",
-        "   - If `x` is equal to `y`, both stones are completely destroyed, and they are removed from the array of stones.\n",
-        "   - If `x` is not equal to `y`, the stone with weight `x` is destroyed, and the stone with weight `y` now has a new weight of `y - x`. The stone with weight `x` is removed from the array, and the modified stone with weight `y - x` remains in the array.\n",
-        "\n",
-        "4. The game continues with the modified array of stones until there is at most one stone left.\n",
-        "\n",
-        "5. The goal is to find the weight of the last remaining stone, or if there are no stones left, return `0`.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "def lastStoneWeight(stones):\n",
-        "    # Convert the input list to a max heap (negate the values to simulate a max heap)\n",
-        "    max_heap = [-stone for stone in stones]\n",
-        "    heapq.heapify(max_heap)\n",
-        "\n",
-        "    # Continue as long as there are more than 1 stone in the heap\n",
-        "    while len(max_heap) > 1:\n",
-        "        # Get the two heaviest stones\n",
-        "        y = -heapq.heappop(max_heap)  # Get the heaviest stone and negate it back to positive\n",
-        "        x = -heapq.heappop(max_heap)  # Get the second heaviest stone and negate it back to positive\n",
-        "\n",
-        "        # Calculate the new stone's weight after smashing\n",
-        "        if x != y:\n",
-        "            new_stone = y - x\n",
-        "            heapq.heappush(max_heap, -new_stone)  # Negate the value and push it back to the heap\n",
-        "\n",
-        "    # If there is one stone left, return its weight (negate it back to positive)\n",
-        "    if max_heap:\n",
-        "        return -max_heap[0]\n",
-        "    else:\n",
-        "        return 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a Python function called `lastStoneWeight` that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.\n",
-        "\n",
-        "Here's a step-by-step explanation of the code:\n",
-        "\n",
-        "1. We import the `heapq` library, which allows us to create and manipulate a heap (priority queue).\n",
-        "\n",
-        "2. Inside the `lastStoneWeight` function:\n",
-        "   - We create a max heap (negating stone weights to simulate a max heap) using the `heapq.heapify` function. This heap will keep track of the heaviest stones.\n",
-        "   \n",
-        "   - We enter a loop that continues as long as there are more than 1 stone in the heap.\n",
-        "   \n",
-        "   - Inside the loop, we:\n",
-        "     - Retrieve and negate the heaviest stone (`y`) from the heap.\n",
-        "     - Retrieve and negate the second heaviest stone (`x`) from the heap.\n",
-        "   \n",
-        "     - Calculate the new stone's weight after smashing (`y - x`), and negate it back to simulate a max heap.\n",
-        "     - Add the new stone back to the heap using `heapq.heappush`.\n",
-        "   \n",
-        "3. After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.\n",
-        "   \n",
-        "4. If there are no stones left (the heap is empty), we return `0`, indicating that no stones remain.\n",
-        "\n",
-        "5. Finally, we provide two test cases to demonstrate the function's usage and correctness.\n",
-        "\n",
-        "In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "stones1 = [2, 7, 4, 1, 8, 1]\n",
-        "print(lastStoneWeight(stones1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 16,
-      "id": "b7e79514-4821-48d0-bb9d-0f2de8150945",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2: \n",
-        "\n",
-        "stones2 = [1]\n",
-        "print(lastStoneWeight(stones2))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided Python code for the \"Last Stone Weight\" problem:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. The `heapq.heapify` operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.\n",
-        "\n",
-        "2. The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:\n",
-        "   - Retrieving and negating the heaviest stone (`y`) from the heap, which takes O(log n) time.\n",
-        "   - Retrieving and negating the second heaviest stone (`x`) from the heap, also taking O(log n) time.\n",
-        "   - Calculating the new stone's weight and pushing it back into the heap using `heapq.heappush`, which takes O(log n) time.\n",
-        "\n",
-        "3. In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.\n",
-        "\n",
-        "Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).\n",
-        "\n",
-        "2. The rest of the variables used in the function (e.g., `x`, `y`, `new_stone`) require only constant space, so they do not significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.\n",
-        "\n",
-        "In summary:\n",
-        "- Time Complexity: $O(n\\ log\\ n)$\n",
-        "- Space Complexity: $O(n)$\n",
-        "\n",
-        "The algorithm is efficient enough to handle the problem's constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Kth Last Stone Weight**: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.\n",
-        "\n",
-        "\n",
-        "2. **Multiple Stones Smash**: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/docs/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
deleted file mode 100644
index 847dd60..0000000
--- a/docs/_build/html/_sources/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 295. Find Median from Data Stream\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Find Median from Data Stream problem on LeetCode, click here!](https://leetcode.com/problems/find-median-from-data-stream/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "The **median** is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.\n",
-        "\n",
-        "Implement the MedianFinder class:\n",
-        "\n",
-        "- `MedianFinder()` initializes the `MedianFinder` object.\n",
-        "- `void addNum(int num)` adds the integer `num` from the data stream to the data structure.\n",
-        "- `double findMedian()` returns the median of all elements so far. Answers within $10^{-5}$ of the actual answer will be accepted.\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- $-10^{5}$ <= `num` <= $10^{5}$\n",
-        "- There will be at least one element in the data structure before calling `findMedian`.\n",
-        "- At most $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "**Follow-up:**\n",
-        "\n",
-        "1. If all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?\n",
-        "2. If `99%` of all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem, \"Find Median from Data Stream,\" deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.\n",
-        "\n",
-        "Here's a breakdown of the problem:\n",
-        "\n",
-        "1. **Initialization**: You are asked to implement a `MedianFinder` class that supports the following operations:\n",
-        "\n",
-        "    - `MedianFinder()`: Initializes the MedianFinder object.\n",
-        "    - `addNum(int num)`: Adds an integer `num` from the data stream to the data structure.\n",
-        "    - `findMedian()`: Returns the median of all elements added to the data structure.\n",
-        "\n",
-        "2. **Median Calculation**: The `findMedian` operation should efficiently compute the median, and the result should have a precision of at least $10^{-5}$ (i.e., answers within this range will be considered correct).\n",
-        "\n",
-        "3. **Examples**:\n",
-        "   \n",
-        "   - If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.\n",
-        "   - If you add numbers [1, 2, 3], the median should be 2 because it's the middle value.\n",
-        "   \n",
-        "4. **Constraints**:\n",
-        "\n",
-        "   - The integers provided in the data stream are in the range from $-10^5$ to $10^5$.\n",
-        "   - There will be at least one element in the data structure before calling `findMedian`.\n",
-        "   - At most, $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-        "\n",
-        "The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "\n",
-        "class MedianFinder:\n",
-        "\n",
-        "    def __init__(self):\n",
-        "        # Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,\n",
-        "        # and a min-heap (large_half) for the larger half of numbers.\n",
-        "        self.small_half = []  # Max-heap for the smaller half of the numbers\n",
-        "        self.large_half = []  # Min-heap for the larger half of the numbers\n",
-        "\n",
-        "    def addNum(self, num: int) -> None:\n",
-        "        # Add the number to the appropriate heap based on its value\n",
-        "        if not self.small_half or num <= -self.small_half[0]:\n",
-        "            # If the number is less than or equal to the current maximum in the smaller half,\n",
-        "            # add it to the smaller half (max-heap)\n",
-        "            heapq.heappush(self.small_half, -num)\n",
-        "        else:\n",
-        "            # Otherwise, add it to the larger half (min-heap)\n",
-        "            heapq.heappush(self.large_half, num)\n",
-        "\n",
-        "        # Balance the heaps if necessary to ensure the size difference is at most 1\n",
-        "        if len(self.small_half) > len(self.large_half) + 1:\n",
-        "            # If the size of the smaller half is more than one greater than the size of the larger half,\n",
-        "            # move the maximum from the smaller half to the larger half to balance them.\n",
-        "            heapq.heappush(self.large_half, -heapq.heappop(self.small_half))\n",
-        "        elif len(self.large_half) > len(self.small_half):\n",
-        "            # If the size of the larger half is greater than the size of the smaller half,\n",
-        "            # move the minimum from the larger half to the smaller half to balance them.\n",
-        "            heapq.heappush(self.small_half, -heapq.heappop(self.large_half))\n",
-        "\n",
-        "    def findMedian(self) -> float:\n",
-        "        if len(self.small_half) == len(self.large_half):\n",
-        "            # If both halves have the same size, there's an even number of elements,\n",
-        "            # so the median is the average of the top elements in both heaps.\n",
-        "            return (-self.small_half[0] + self.large_half[0]) / 2.0\n",
-        "        else:\n",
-        "            # If the smaller half has more elements, it contains the median (odd number of elements).\n",
-        "            return -self.small_half[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a `MedianFinder` class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (`small_half`) to store the smaller half of the numbers and a min-heap (`large_half`) to store the larger half. Here's how the code works:\n",
-        "\n",
-        "1. The `__init__` method initializes the two heaps.\n",
-        "\n",
-        "2. The `addNum` method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.\n",
-        "\n",
-        "3. The `findMedian` method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.\n",
-        "\n",
-        "In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1.5\n",
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "medianFinder = MedianFinder()\n",
-        "medianFinder.addNum(1)\n",
-        "medianFinder.addNum(2)\n",
-        "print(medianFinder.findMedian())  # Output: 1.5\n",
-        "medianFinder.addNum(3)\n",
-        "print(medianFinder.findMedian())  # Output: 2.0\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `MedianFinder` class:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.\n",
-        "\n",
-        "2. `addNum(int num)`: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.\n",
-        "\n",
-        "3. `findMedian()`: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. `MedianFinder()` Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.\n",
-        "\n",
-        "2. `addNum(int num)`: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.\n",
-        "\n",
-        "3. `findMedian()`: The space complexity for finding the median is O(1). It doesn't require any additional data structures that grow with the input size.\n",
-        "\n",
-        "In summary, the time complexity of the `addNum` operation is O(log N), and the time complexity of the `findMedian` operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized kth Element**: Extend the `MedianFinder` class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.\n",
-        "\n",
-        "2. **Sliding Window Median**: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/docs/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
deleted file mode 100644
index 2e1522d..0000000
--- a/docs/_build/html/_sources/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb	
+++ /dev/null
@@ -1,239 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 703. Kth Largest Element in a Stream\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Kth Largest Element in a Stream problem on LeetCode, click here!](https://leetcode.com/problems/kth-largest-element-in-a-stream/)\n",
-        "\n",
-        "---\n",
-        "Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.\n",
-        "\n",
-        "Implement the `KthLargest` class with the following methods:\n",
-        "\n",
-        "- `KthLargest(int k, int[] nums)`: Initializes the object with the integer `k` and the stream of integers `nums`.\n",
-        "- `int add(int val)`: Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.\n",
-        "\n",
-        "\n",
-        "**Constraints:**\n",
-        "\n",
-        "- 1 <= `k` <= $10^4$\n",
-        "- 0 <= `nums.length` <= $10^4$\n",
-        "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-        "- $-10^4$ <= `val` <= $10^4$\n",
-        "- At most $10^4$ calls will be made to `add`.\n",
-        "- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem you're trying to solve is to design a class called `KthLargest` that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:\n",
-        "\n",
-        "To solve this problem efficiently, you can use a min-heap data structure. Here's how the approach works:\n",
-        "\n",
-        "1. Initialize a min-heap to store the k largest elements. Initially, it's empty.\n",
-        "\n",
-        "2. In the `__init__` method, populate the min-heap with the first `k` elements from `nums`. This ensures that you have the k largest elements seen so far.\n",
-        "\n",
-        "3. Whenever you add a new element to the stream using the `add` method, follow these steps:\n",
-        "   - Add the new element to the min-heap.\n",
-        "   - If the size of the min-heap exceeds `k`, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.\n",
-        "   - The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.\n",
-        "\n",
-        "Here's why this approach works efficiently:\n",
-        "\n",
-        "- By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.\n",
-        "\n",
-        "- When you add a new element, the min-heap's size is kept at most `k`, which ensures that you only track the k largest elements and discard the smaller ones.\n",
-        "\n",
-        "- The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).\n",
-        "\n",
-        "- This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.\n",
-        "\n",
-        "In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "import heapq\n",
-        "from typing import List  # Import the List type from the typing module\n",
-        "\n",
-        "class KthLargest:\n",
-        "\n",
-        "    def __init__(self, k: int, nums: List[int]):\n",
-        "        # Initialize the KthLargest object with k and nums.\n",
-        "        self.k = k\n",
-        "        # Create a min-heap to store the k largest elements.\n",
-        "        self.min_heap = []\n",
-        "        # Populate the min-heap with the first k elements from nums.\n",
-        "        for num in nums:\n",
-        "            self.add(num)\n",
-        "\n",
-        "    def add(self, val: int) -> int:\n",
-        "        # Add val to the min-heap.\n",
-        "        heapq.heappush(self.min_heap, val)\n",
-        "        # If the size of the min-heap exceeds k, remove the smallest element.\n",
-        "        if len(self.min_heap) > self.k:\n",
-        "            heapq.heappop(self.min_heap)\n",
-        "        # The root of the min-heap is the kth largest element.\n",
-        "        return self.min_heap[0]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "- We start by importing the necessary modules:\n",
-        "  - `heapq`: This module provides functions to create and manipulate heaps.\n",
-        "  - `List` from the `typing` module: This is used to specify the type of the `nums` parameter.\n",
-        "\n",
-        "- We define the `KthLargest` class:\n",
-        "  - The `__init__` method initializes the object with the integer `k` and the list of integers `nums`.\n",
-        "  - It also creates an empty min-heap called `self.min_heap` to store the k largest elements.\n",
-        "  - It populates the min-heap with the first `k` elements from `nums` by calling the `add` method.\n",
-        "\n",
-        "- The `add` method:\n",
-        "  - Adds the new integer `val` to the min-heap using `heapq.heappush`. This maintains the min-heap property.\n",
-        "  - Checks if the size of the min-heap exceeds `k`. If it does, it removes the smallest element (the k+1th largest) using `heapq.heappop`.\n",
-        "  - Finally, it returns the smallest element in the min-heap, which is always the kth largest element.\n",
-        "\n",
-        "Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "4\n",
-            "5\n",
-            "5\n",
-            "8\n",
-            "8\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example usage:\n",
-        "kthLargest = KthLargest(3, [4, 5, 8, 2])\n",
-        "print(kthLargest.add(3))  # Output: 4\n",
-        "print(kthLargest.add(5))  # Output: 5\n",
-        "print(kthLargest.add(10)) # Output: 5\n",
-        "print(kthLargest.add(9))  # Output: 8\n",
-        "print(kthLargest.add(4))  # Output: 8"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `KthLargest` class using the min-heap approach:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. `__init__` method:\n",
-        "   - In the `__init__` method, you iterate over the first `k` elements in `nums` and add them to the min-heap. Each `heapq.heappush` operation takes O(log k) time.\n",
-        "   - Therefore, the time complexity of the `__init__` method is O(k * log k).\n",
-        "\n",
-        "2. `add` method:\n",
-        "   - In the `add` method, you perform the following operations:\n",
-        "     - `heapq.heappush`: O(log k) to add the new element to the min-heap.\n",
-        "     - If the size of the min-heap exceeds `k`, you perform `heapq.heappop`, which is also O(log k).\n",
-        "     - Finally, you return the smallest element from the min-heap, which is O(1) because it's always the root.\n",
-        "   - Overall, the time complexity of the `add` method is O(log k).\n",
-        "\n",
-        "3. Overall, if you make `n` calls to the `add` method, the total time complexity is O(n * log k), where `n` is the total number of elements added to the stream.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The space complexity is determined by the space used to store the min-heap and the instance variables.\n",
-        "2. The min-heap stores at most `k` elements at any given time, so its space complexity is O(k).\n",
-        "3. The instance variables (such as `self.k` and `self.min_heap`) have constant space requirements.\n",
-        "4. Therefore, the overall space complexity of the `KthLargest` class is O(k).\n",
-        "\n",
-        "In summary, the time complexity of the `KthLargest` class is O(n * log k) for `n` add operations, and the space complexity is O(k), where `k` is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem's constraints."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Dynamic k:** Modify the `KthLargest` class to support dynamic changes in the value of `k`. Implement a method `update_k` that allows changing the value of `k` during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of `k`.\n",
-        "\n",
-        "\n",
-        "2. **Implement kth Smallest:** Create a new class called `KthSmallest` that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/09. Heap - Priority Queue/README.md b/docs/_build/html/_sources/09. Heap - Priority Queue/README.md
deleted file mode 100644
index 2eac70c..0000000
--- a/docs/_build/html/_sources/09. Heap - Priority Queue/README.md	
+++ /dev/null
@@ -1,18 +0,0 @@
-# Heap / Priority Queue Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [703. Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)     | Easy       |
-| [1046. Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)     | Easy       |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb b/docs/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb
deleted file mode 100644
index 228a62e..0000000
--- a/docs/_build/html/_sources/10. Backtracking/39. Combination Sum.ipynb	
+++ /dev/null
@@ -1,282 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 39. Combination Sum\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Combination Sum problem on LeetCode, click here!](https://leetcode.com/problems/combination-sum/)\n",
-        "\n",
-        "---\n",
-        "Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of `candidates` where the chosen numbers sum to the `target`*. You may return the combinations in **any order**. \n",
-        "\n",
-        "The **same** number may be chosen from `candidates` an **unlimited number** of times. Two combinations are unique if the **frequency** of at least one of the chosen numbers is different.\n",
-        "\n",
-        "The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= candidates.length <= 30`\n",
-        "- `2 <= candidates[i] <= 40`\n",
-        "- All elements of `candidates` are **distinct**.\n",
-        "- `1 <= target <= 40`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:\n",
-        "\n",
-        "- You are given an array of distinct integers called \"candidates.\"\n",
-        "- You are also given a target integer called \"target.\"\n",
-        "\n",
-        "The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "**Example 1:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 6, 7], target = 7\n",
-        "Output: [[2, 2, 3], [7]]\n",
-        "```\n",
-        "In this example, there are two unique combinations that sum up to the target:\n",
-        "- 2 + 2 + 3 = 7\n",
-        "- 7 = 7\n",
-        "\n",
-        "**Example 2:**\n",
-        "```python\n",
-        "Input: candidates = [2, 3, 5], target = 8\n",
-        "Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n",
-        "```\n",
-        "Here, there are three unique combinations that sum up to the target.\n",
-        "\n",
-        "**Example 3:**\n",
-        "```python\n",
-        "Input: candidates = [2], target = 1\n",
-        "Output: []\n",
-        "```\n",
-        "In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.\n",
-        "\n",
-        "The problem asks you to find and return these combinations in any order.\n",
-        "\n",
-        "The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def combinationSum(candidates, target):\n",
-        "    # Define a recursive DFS function to find combinations\n",
-        "    def dfs(remaining, start, path):\n",
-        "        # If the remaining target is 0, we found a valid combination\n",
-        "        if remaining == 0:\n",
-        "            result.append(path)\n",
-        "            return\n",
-        "        # If the remaining target is negative, this path is invalid\n",
-        "        if remaining < 0:\n",
-        "            return\n",
-        "        # Iterate through candidates starting from 'start' to avoid duplicates\n",
-        "        for i in range(start, len(candidates)):\n",
-        "            # Explore the current candidate by subtracting it from the remaining target\n",
-        "            # Add the current candidate to the path\n",
-        "            dfs(remaining - candidates[i], i, path + [candidates[i]])\n",
-        "\n",
-        "    result = []  # Initialize an empty list to store the result\n",
-        "    candidates.sort()  # Sort the candidates for deduplication and early stopping\n",
-        "    dfs(target, 0, [])  # Start the DFS from the target value with an empty path\n",
-        "    return result  # Return the list of unique combinations"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `combinationSum` function takes an array of distinct integers `candidates` and a target integer `target`. It returns a list of all unique combinations of `candidates` where the chosen numbers sum to the `target`. Each number in the `candidates` array can be used an unlimited number of times.\n",
-        "\n",
-        "Here's an overview of how the code works:\n",
-        "\n",
-        "1. The `combinationSum` function is defined, and it takes two arguments: `candidates` and `target`.\n",
-        "\n",
-        "2. Inside the function, there is a nested helper function called `backtrack`. This function is responsible for the actual combination generation using a recursive approach.\n",
-        "\n",
-        "3. The `backtrack` function is called with three arguments: `start`, `target`, and `path`. The `start` variable helps keep track of the current index in the `candidates` array, `target` keeps track of the remaining sum to be achieved, and `path` is a list that stores the current combination.\n",
-        "\n",
-        "4. Within the `backtrack` function, there are three main conditional statements:\n",
-        "   - If `target` becomes zero, it means we have found a combination that sums up to the target, so we add `path` to the `result` list.\n",
-        "   - If `target` becomes negative, it means the current combination doesn't work, so we return without doing anything.\n",
-        "   - Otherwise, we enter a loop that iterates over the `candidates` array, starting from the current index `start`.\n",
-        "\n",
-        "5. In the loop, the `backtrack` function is called recursively with the updated `target` and `path` after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.\n",
-        "\n",
-        "6. After the loop completes, the `result` list contains all unique combinations that sum to the target.\n",
-        "\n",
-        "7. The `candidates` array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.\n",
-        "\n",
-        "8. Finally, the `backtrack` function is initially called from the `combinationSum` function with `start` set to 0, `target` set to the original target value, and an empty `path`. The result is returned as a list of unique combinations.\n",
-        "\n",
-        "The code includes a few example cases to demonstrate how the function works with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 3], [7]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Example 1\n",
-        "candidates1 = [2, 3, 6, 7]\n",
-        "target1 = 7\n",
-        "print(combinationSum(candidates1, target1))  # Output: [[2, 2, 3], [7]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "candidates2 = [2, 3, 5]\n",
-        "target2 = 8\n",
-        "print(combinationSum(candidates2, target2))  # Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "candidates3 = [2]\n",
-        "target3 = 1\n",
-        "print(combinationSum(candidates3, target3))  # Output: []"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `combinationSum` function.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "The time complexity of this function is influenced by the number of recursive calls made by the `backtrack` function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.\n",
-        "\n",
-        "The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as $O(2^n)$, where 'n' is the maximum number of recursive calls. In this context, 'n' corresponds to the number of elements in the `candidates` list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.\n",
-        "\n",
-        "1. The space required for the `result` list can be up to $O(2^n)$ in the worst case because each combination is stored.\n",
-        "\n",
-        "2. The stack space for the recursive calls can also be up to O(n) in the worst case, where 'n' is the number of elements in the `candidates` list.\n",
-        "\n",
-        "Therefore, the overall space complexity of the function is $O(2^n + n)$. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.\n",
-        "\n",
-        "In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Find the Number of Unique Combinations:** Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.\n",
-        "\n",
-        "2. **Combinations with a Maximum Value:** Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/10. Backtracking/79. Word Search.ipynb b/docs/_build/html/_sources/10. Backtracking/79. Word Search.ipynb
deleted file mode 100644
index cee509b..0000000
--- a/docs/_build/html/_sources/10. Backtracking/79. Word Search.ipynb	
+++ /dev/null
@@ -1,298 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 79. Word Search\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Word Search problem on LeetCode, click here!](https://leetcode.com/problems/word-search/)\n",
-        "\n",
-        "---\n",
-        "Given an `m x n` grid of characters `board` and a string `word`, return *`true` if `word` exists in the grid.*\n",
-        "\n",
-        "The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == board.length`\n",
-        "- `n = board[i].length`\n",
-        "- `1 <= m, n <= 6`\n",
-        "- `1 <= word.length <= 15`\n",
-        "- `board` and `word` consists of only lowercase and uppercase English letters.\n",
-        "\n",
-        "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given word can be constructed from characters in an `m x n` grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.\n",
-        "\n",
-        "Here are the specifics of the problem:\n",
-        "\n",
-        "- You are given an `m x n` grid, which is a 2D board of characters.\n",
-        "- You are also given a string `word` consisting of lowercase and uppercase English letters.\n",
-        "- Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.\n",
-        "- You can't use the same cell more than once when forming the word.\n",
-        "- If it's possible to form the word in the grid, return `True`; otherwise, return `False`.\n",
-        "\n",
-        "For example, consider the following grid and word:\n",
-        "\n",
-        "```python\n",
-        "board = [[\"A\", \"B\", \"C\", \"E\"],\n",
-        "         [\"S\", \"F\", \"C\", \"S\"],\n",
-        "         [\"A\", \"D\", \"E\", \"E\"]]         \n",
-        "word = \"ABCCED\"\n",
-        "```\n",
-        "\n",
-        "In this case, the word \"ABCCED\" can be formed by moving through the cells (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,3) in the grid. Therefore, the function should return `True`.\n",
-        "\n",
-        "Conversely, if the word is impossible to construct, such as in the case of the word \"ABCB\" for the same grid, where there's no valid path that forms the word, the function should return `False`.\n",
-        "\n",
-        "The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 3,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def exist(self, board: List[List[str]], word: str) -> bool:\n",
-        "        def dfs(i, j, k):\n",
-        "            # Check if the current position is out of bounds or doesn't match the character in the word.\n",
-        "            if not (0 <= i < len(board)) or not (0 <= j < len(board[0])) or board[i][j] != word[k]:\n",
-        "                return False\n",
-        "            \n",
-        "            # If we have matched all characters in the word, return True.\n",
-        "            if k == len(word) - 1:\n",
-        "                return True\n",
-        "\n",
-        "            # Temporarily mark the current cell to prevent revisiting.\n",
-        "            tmp, board[i][j] = board[i][j], \"/\"\n",
-        "\n",
-        "            # Explore adjacent cells by making recursive calls in all four directions.\n",
-        "            found = dfs(i + 1, j, k + 1) or dfs(i - 1, j, k + 1) or dfs(i, j + 1, k + 1) or dfs(i, j - 1, k + 1)\n",
-        "\n",
-        "            # Restore the original character in the cell.\n",
-        "            board[i][j] = tmp\n",
-        "\n",
-        "            return found\n",
-        "\n",
-        "        # Iterate through all cells in the board.\n",
-        "        for i in range(len(board)):\n",
-        "            for j in range(len(board[0])):\n",
-        "                # Check if the 'dfs' function starting from this cell returns True.\n",
-        "                if dfs(i, j, 0):\n",
-        "                    return True\n",
-        "\n",
-        "        # If no match is found after exploring all cells, return False.\n",
-        "        return False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "1. Import the necessary module:\n",
-        "   - `from typing import List`: This line imports the `List` type from the `typing` module, which is used to specify the type of the `board` parameter in the method signature.\n",
-        "\n",
-        "2. Define the `Solution` class:\n",
-        "   - `class Solution:`: This line defines a class called `Solution` to encapsulate the solution for the word search problem.\n",
-        "\n",
-        "3. Define the `exist` method:\n",
-        "   - `def exist(self, board: List[List[str]], word: str) -> bool:`: This method is a member of the `Solution` class and takes two parameters: `board`, which is a 2D list of characters, and `word`, which is a string. It returns a boolean value, indicating whether the word exists in the board.\n",
-        "\n",
-        "4. Implement the inner `dfs` function:\n",
-        "   - `def dfs(i, j, k):`: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: `i` and `j` representing the current position on the board, and `k` representing the current index in the `word` string.\n",
-        "\n",
-        "   - Inside `dfs`, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the `word`. If either of these conditions is met, it returns `False`.\n",
-        "\n",
-        "   - If `k` is equal to the length of the `word` minus one, it means we have successfully matched all characters in the `word`, so it returns `True`.\n",
-        "\n",
-        "   - The function then temporarily replaces the character at the current position with a marker, \"/\", to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return `True`, it propagates the `True` result up the call stack. After the exploration is complete, it restores the original character in the cell.\n",
-        "\n",
-        "5. Iterate through the board:\n",
-        "   - The outer loop iterates through all cells in the `board` using two nested loops. For each cell, it checks if the `dfs` function starting from that cell (with `k` initially set to 0) returns `True`. If it does, it means the word exists, so the method returns `True`.\n",
-        "\n",
-        "6. Return `False`:\n",
-        "   - If the loop completes without finding the word in the board, the method returns `False`.\n",
-        "\n",
-        "To use this code, you can create an instance of the `Solution` class and call the `exist` method on that instance, passing the `board` and the `word` as arguments to check if the word exists in the board."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 4,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1: \n",
-        "\n",
-        "# Create an instance of the Solution class\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Test case 1: Word \"ABCCED\" can be found in the grid\n",
-        "board1 = [[\"A\",\"B\",\"C\",\"E\"],\n",
-        "          [\"S\",\"F\",\"C\",\"S\"],\n",
-        "          [\"A\",\"D\",\"E\",\"E\"]]\n",
-        "word1 = \"ABCCED\"\n",
-        "print(solution.exist(board1, word1))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "\n",
-        "# Test case 2: Word \"SEE\" can be found in the grid\n",
-        "word2 = \"SEE\"\n",
-        "print(solution.exist(board1, word2))  # Expected output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 3\n",
-        "\n",
-        "# Test case 3: Word \"ABCB\" cannot be found in the grid\n",
-        "word3 = \"ABCB\"\n",
-        "print(solution.exist(board1, word3))  # Expected output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `exist` method in the given code.\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "The primary work in this code is done by the `dfs` function, which performs a depth-first search through the grid. The time complexity of the `dfs` function is $O(4^(n))$, where \"n\" is the length of the `word`. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the `word`.\n",
-        "\n",
-        "The outer loops iterate through all cells in the `board`, which has dimensions `m x n`. So, the total number of iterations of `dfs` is O(m * n). However, since the `dfs` function has a higher time complexity, the overall time complexity is still dominated by the `dfs` function.\n",
-        "\n",
-        "Therefore, the overall time complexity of the `exist` method is $O(m * n * 4^n)$, where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. The primary space usage comes from the recursive calls in the `dfs` function. The depth of the recursion can be at most equal to the length of the `word`, which is O(n).\n",
-        "\n",
-        "2. Additionally, the `tmp` variable and the recursive calls on the call stack consume a small amount of additional memory.\n",
-        "\n",
-        "3. The marking of visited cells with the \"/\" character temporarily modifies the `board` in-place but doesn't significantly contribute to the space complexity.\n",
-        "\n",
-        "Therefore, the overall space complexity is O(n) due to the recursive call stack.\n",
-        "\n",
-        "In summary, the time complexity is $O(m * n * 4^n)$, and the space complexity is O(n), where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the code to find all unique words that can be constructed from the grid. Instead of returning `True` or `False`, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.\n",
-        "\n",
-        "2. **Board Generation:** Create a function to generate random grids of characters and then use the `exist` method to solve them. Test the efficiency and correctness of your code by generating larger boards and words."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/10. Backtracking/README.md b/docs/_build/html/_sources/10. Backtracking/README.md
deleted file mode 100644
index 0d1ea13..0000000
--- a/docs/_build/html/_sources/10. Backtracking/README.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-# Backtracking Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)        | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb b/docs/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb
deleted file mode 100644
index 07351b6..0000000
--- a/docs/_build/html/_sources/11. Graphs/133. Clone Graph.ipynb	
+++ /dev/null
@@ -1,317 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 133. Clone Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Clone Graph problem on LeetCode, click here!](https://leetcode.com/problems/clone-graph/)\n",
-        "\n",
-        "---\n",
-        "Given a reference of a node in a **connected** undirected graph.\n",
-        "\n",
-        "Return a **deep copy** (clone) of the graph.\n",
-        "\n",
-        "Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n",
-        "\n",
-        "```\n",
-        "class Node {\n",
-        "    public int val;\n",
-        "    public List<Node> neighbors;\n",
-        "}\n",
-        "```\n",
-        "\n",
-        "**Test case format:**\n",
-        "\n",
-        "For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n",
-        "\n",
-        "**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n",
-        "\n",
-        "The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- The number of nodes in the graph is in the range `[0, 100]`.\n",
-        "- `1 <= Node.val <= 100`\n",
-        "- `Node.val` is unique for each node.\n",
-        "- There are no repeated edges and no self-loops in the graph.\n",
-        "- The Graph is connected and all nodes can be visited starting from the given node."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.\n",
-        "\n",
-        "Here are the key aspects of the problem:\n",
-        "\n",
-        "1. **Input**: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.\n",
-        "\n",
-        "2. **Output**: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.\n",
-        "\n",
-        "3. **Graph Structure**: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.\n",
-        "\n",
-        "4. **Connected Graph**: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.\n",
-        "\n",
-        "To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.\n",
-        "\n",
-        "The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "# Definition for a Node.\n",
-        "class Node:\n",
-        "    def __init__(self, val=0, neighbors=None):\n",
-        "        self.val = val\n",
-        "        self.neighbors = neighbors if neighbors is not None else []\n",
-        "\n",
-        "class Solution:\n",
-        "    def cloneGraph(self, node: 'Node') -> 'Node':\n",
-        "        if not node:\n",
-        "            return None\n",
-        "\n",
-        "        visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "        def dfs(original_node):\n",
-        "            if original_node in visited:\n",
-        "                return visited[original_node]\n",
-        "\n",
-        "            # Create a copy of the original node\n",
-        "            copy_node = Node(original_node.val)\n",
-        "            visited[original_node] = copy_node\n",
-        "\n",
-        "            # Recursively clone the neighbors of the original node\n",
-        "            for neighbor in original_node.neighbors:\n",
-        "                copy_node.neighbors.append(dfs(neighbor))\n",
-        "\n",
-        "            return copy_node\n",
-        "\n",
-        "        return dfs(node)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The given code defines a Python class, `Node`, and a solution class, `Solution`, to clone a connected undirected graph represented by nodes and their neighbors. Here's an explanation of the code:\n",
-        "\n",
-        "1. The `Node` class defines a node in the graph. Each node has a value (`val`) which is an integer and a list of neighbors (`neighbors`) that are other nodes in the graph.\n",
-        "\n",
-        "2. The `Solution` class contains the method `cloneGraph`, which takes a reference to the first node of the graph (`node`) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.\n",
-        "\n",
-        "3. Inside the `cloneGraph` method:\n",
-        "   - It first checks if the input `node` is `None`. If it's `None`, it means there is no graph to clone, and the method returns `None`.\n",
-        "\n",
-        "   - It initializes a `visited` dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.\n",
-        "\n",
-        "   - The `dfs` (depth-first search) function is defined within the `cloneGraph` method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.\n",
-        "\n",
-        "   - Inside the `dfs` function:\n",
-        "     - It checks if the original node has been visited before by looking it up in the `visited` dictionary. If it has been visited, it returns the corresponding clone from the `visited` dictionary.\n",
-        "\n",
-        "     - If the original node is not visited, it creates a new node, `copy_node`, with the same value as the original node. This is the first step in creating the clone of the original node.\n",
-        "\n",
-        "     - It then recursively clones the neighbors of the original node by iterating through the `neighbors` list of the original node and appending the corresponding cloned neighbors to the `neighbors` list of the `copy_node`. This step ensures that the relationships between nodes are preserved in the clone.\n",
-        "\n",
-        "     - The `copy_node` is added to the `visited` dictionary with the original node as the key and the clone as the value.\n",
-        "\n",
-        "     - Finally, the `copy_node` is returned as the result of the DFS for the original node.\n",
-        "\n",
-        "4. The `cloneGraph` method returns the result of the DFS on the input `node`, which is the clone of the entire graph with its structure and relationships intact.\n",
-        "\n",
-        "In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1, 2, 4]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "def get_adjacency_list(node):\n",
-        "    visited = {}  # Dictionary to keep track of visited nodes\n",
-        "\n",
-        "    def dfs(node):\n",
-        "        if not node:\n",
-        "            return []\n",
-        "\n",
-        "        if node in visited:\n",
-        "            return visited[node]\n",
-        "\n",
-        "        neighbors = [n.val for n in node.neighbors]\n",
-        "        visited[node] = neighbors\n",
-        "\n",
-        "        for neighbor in node.neighbors:\n",
-        "            dfs(neighbor)\n",
-        "\n",
-        "    dfs(node)\n",
-        "    result = []\n",
-        "\n",
-        "    def get_node_and_neighbors(node):\n",
-        "        result.append([node.val] + visited[node])\n",
-        "\n",
-        "    get_node_and_neighbors(node)\n",
-        "    return result\n",
-        "\n",
-        "\n",
-        "# Testing the code with the provided examples\n",
-        "adjList1 = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "nodes = [Node(i) for i in range(1, len(adjList1) + 1)]\n",
-        "for i, adj in enumerate(adjList1):\n",
-        "    nodes[i].neighbors = [nodes[j - 1] for j in adj]\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(nodes[0])\n",
-        "cloned_adjList1 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList1)\n",
-        "\n",
-        "# Output should match adjList1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[1]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "# Input: adjList = [[]]\n",
-        "\n",
-        "adjList2 = [[]]\n",
-        "solution = Solution()\n",
-        "\n",
-        "# Create the graph from adjList\n",
-        "node1 = Node(1)\n",
-        "\n",
-        "# Clone the graph and get its adjacency list\n",
-        "cloned_node1 = solution.cloneGraph(node1)\n",
-        "cloned_adjList2 = get_adjacency_list(cloned_node1)\n",
-        "\n",
-        "# Print the cloned graph as an adjacency list\n",
-        "print(cloned_adjList2)\n",
-        "\n",
-        "# Output should be [[]], which represents an empty graph"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Creating the graph: The time complexity to create the original graph from `adjList` is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in `adjList`.\n",
-        "\n",
-        "2. Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.\n",
-        "\n",
-        "Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.\n",
-        "\n",
-        "2. Storage for the visited dictionary: The `visited` dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.\n",
-        "\n",
-        "3. Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the `visited` dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).\n",
-        "\n",
-        "In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Cyclic Graph**: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn't fall into an infinite loop during traversal.\n",
-        "\n",
-        "\n",
-        "2. **Partial Graph Cloning**: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb b/docs/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb
deleted file mode 100644
index e0235d6..0000000
--- a/docs/_build/html/_sources/11. Graphs/178. Graph Valid Tree.ipynb	
+++ /dev/null
@@ -1,248 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 178. Graph Valid Tree\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Graph Valid Tree problem on LintCode, click here!](https://www.lintcode.com/problem/178/)\n",
-        "\n",
-        "---\n",
-        "Given `n` nodes labeled from `0` to `n - 1` and a list of `undirected` edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You can assume that no duplicate edges will appear in edges. Since all edges are `undirected`, `[0, 1]` is the same as `[1, 0]` and thus will not appear together in edges."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a \"tree\" is a specific type of graph with the following properties:\n",
-        "\n",
-        "1. It is a connected graph, meaning there is a path between any pair of nodes in the graph.\n",
-        "2. It has no cycles, which means there are no closed loops or circuits in the graph.\n",
-        "3. It has exactly `n - 1` edges, where `n` is the number of nodes in the tree.\n",
-        "\n",
-        "The problem is typically given with two pieces of information:\n",
-        "\n",
-        "1. The number of nodes (`n`), which are usually labeled from 0 to `n-1`.\n",
-        "2. A list of undirected edges, where each edge is represented as a pair of nodes.\n",
-        "\n",
-        "The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.\n",
-        "\n",
-        "To solve this problem, you need to check the following conditions:\n",
-        "\n",
-        "1. There should be exactly `n - 1` edges to ensure that the graph is connected and tree-like.\n",
-        "2. There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.\n",
-        "3. The graph should be connected, which means you can reach any node from any other node through a series of edges.\n",
-        "\n",
-        "The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 10,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def validTree(n, edges):\n",
-        "    if len(edges) != n - 1:\n",
-        "        return False  # A tree with n nodes must have n-1 edges.\n",
-        "\n",
-        "    # Create an adjacency list to represent the graph.\n",
-        "    adj_list = {i: [] for i in range(n)}\n",
-        "    for u, v in edges:\n",
-        "        adj_list[u].append(v)\n",
-        "        adj_list[v].append(u)\n",
-        "\n",
-        "    visited = set()\n",
-        "\n",
-        "    # Define a recursive DFS function.\n",
-        "    def dfs(node, parent):\n",
-        "        if node in visited:\n",
-        "            return False  # If we encounter a visited node, there's a cycle.\n",
-        "        visited.add(node)\n",
-        "\n",
-        "        for neighbor in adj_list[node]:\n",
-        "            if neighbor != parent:\n",
-        "                if not dfs(neighbor, node):\n",
-        "                    return False\n",
-        "\n",
-        "        return True\n",
-        "\n",
-        "    # Start DFS from any node (e.g., node 0).\n",
-        "    if not dfs(0, -1):\n",
-        "        return False  # If there's a cycle, it's not a valid tree.\n",
-        "\n",
-        "    return len(visited) == n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The `validTree` function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:\n",
-        "\n",
-        "1. It has exactly `n - 1` edges, where `n` is the number of nodes.\n",
-        "2. There are no cycles in the graph.\n",
-        "3. The graph is connected, meaning all nodes are reachable from any starting node.\n",
-        "\n",
-        "The code accomplishes this as follows:\n",
-        "\n",
-        "- It first checks if the number of edges is equal to `n - 1`. If not, it immediately returns `False` since a tree with `n` nodes must have `n - 1` edges to be connected.\n",
-        "\n",
-        "- It then constructs an adjacency list (`adj_list`) to represent the graph efficiently. This data structure stores the neighbors of each node.\n",
-        "\n",
-        "- The code uses a `visited` set to keep track of nodes visited during depth-first search (DFS).\n",
-        "\n",
-        "- The `dfs` function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns `False`.\n",
-        "\n",
-        "- The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.\n",
-        "\n",
-        "- After the DFS is complete, the code checks if the number of visited nodes is equal to `n`, ensuring the graph is connected.\n",
-        "\n",
-        "- Finally, if all conditions are met, the code returns `True`, indicating that the given edges form a valid tree. Otherwise, it returns `False`.\n",
-        "\n",
-        "The code provides examples to demonstrate how to use the `validTree` function to check whether a set of edges forms a valid tree or not."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 11,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 5\n",
-        "edges1 = [[0, 1], [0, 2], [0, 3], [1, 4]]\n",
-        "print(validTree(n1, edges1))  # Output: true"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 12,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 5\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]\n",
-        "print(validTree(n2, edges2))  # Output: false"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexities of the `validTree` function:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "1. Constructing the adjacency list (`adj_list`) takes O(E) time, where E is the number of edges in the input graph (|edges|).\n",
-        "\n",
-        "2. The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.\n",
-        "\n",
-        "3. Checking if the number of visited nodes is equal to `n` takes O(1) time.\n",
-        "\n",
-        "Overall, the time complexity of the `validTree` function is O(E + V) in the worst case.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "1. The adjacency list (`adj_list`) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.\n",
-        "\n",
-        "2. The `visited` set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.\n",
-        "\n",
-        "3. The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.\n",
-        "\n",
-        "Overall, the space complexity of the `validTree` function is O(V + E) due to the adjacency list and O(V) due to the `visited` set and DFS call stack.\n",
-        "\n",
-        "In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Minimum Spanning Tree (MST)**: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal's or Prim's algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.\n",
-        "\n",
-        "2. **Detecting Cycles**: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it's not a tree. This exercise enhances your ability to detect and visualize cycles in a graph."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb b/docs/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb
deleted file mode 100644
index a8a7727..0000000
--- a/docs/_build/html/_sources/11. Graphs/200. Number of Islands.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 200. Number of Islands\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Islands problem on LeetCode, click here!](https://leetcode.com/problems/number-of-islands/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return *the number of islands*. \n",
-        "\n",
-        "An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == grid.length`\n",
-        "- `n == grid[i].length`\n",
-        "- `1 <= m, n <= 300`\n",
-        "- `grid[i][j]` is `'0'` or `'1'`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is about counting the number of islands in a 2D binary grid. In this grid, '1' represents land, and '0' represents water. An island is defined as a group of '1' cells that are adjacent to each other either horizontally or vertically. It's important to note that diagonal connections do not count. Additionally, it's assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn't \"wrap around.\"\n",
-        "\n",
-        "The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected '1' cells, and these connections can only occur horizontally or vertically. If there are no '1' cells in the grid, the number of islands would be zero.\n",
-        "\n",
-        "The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one '1' cell and explore its adjacent cells to determine the extent of the island. Once you've visited all the '1' cells in an island, you move on to the next unvisited '1' cell and repeat the process until you've counted all the islands in the grid.\n",
-        "\n",
-        "In essence, the problem asks you to analyze the grid to find groups of connected '1' cells and count them as individual islands. The goal is to return the total count of islands in the given grid.\n",
-        "\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def numIslands(self, grid: List[List[str]]) -> int:\n",
-        "        if not grid:\n",
-        "            return 0\n",
-        "\n",
-        "        m, n = len(grid), len(grid[0])  # Get the dimensions of the grid\n",
-        "        num_islands = 0  # Initialize the count of islands\n",
-        "\n",
-        "        def dfs(row, col):\n",
-        "            if row < 0 or row >= m or col < 0 or col >= n or grid[row][col] == '0':\n",
-        "                return\n",
-        "\n",
-        "            grid[row][col] = '0'  # Mark the current cell as visited by changing it to '0'\n",
-        "            directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]  # Define four possible directions to move\n",
-        "\n",
-        "            for dr, dc in directions:\n",
-        "                # Explore adjacent cells\n",
-        "                dfs(row + dr, col + dc)\n",
-        "\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if grid[i][j] == '1':\n",
-        "                    num_islands += 1  # Increment the island count\n",
-        "                    dfs(i, j)  # Start a DFS from the current '1' cell to explore the entire island\n",
-        "\n",
-        "        return num_islands\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided code defines a Python class called `Solution` with a method called `numIslands`. This class is designed to count the number of islands in a 2D binary grid.\n",
-        "\n",
-        "The `numIslands` method takes a 2D grid as input, where '1' represents land, and '0' represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:\n",
-        "\n",
-        "1. Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).\n",
-        "\n",
-        "2. Determining the dimensions of the grid (number of rows and columns).\n",
-        "\n",
-        "3. Initializing a variable `num_islands` to keep track of the count of islands.\n",
-        "\n",
-        "4. Defining a nested function `dfs` to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing '1' to '0'.\n",
-        "\n",
-        "5. In the `dfs` function, it checks for boundary conditions and whether the current cell is '0'. If these conditions are met, it returns without further exploration.\n",
-        "\n",
-        "6. The `dfs` function explores neighboring cells in all four directions (up, down, left, right) using a loop.\n",
-        "\n",
-        "7. The main loop iterates through each cell of the grid. When a '1' cell is encountered, it increments the `num_islands` count and starts a DFS from that cell to explore the entire island.\n",
-        "\n",
-        "8. Finally, the method returns the total count of islands found in the grid.\n",
-        "\n",
-        "This code encapsulates the solution in a class, allowing you to create an instance of the `Solution` class and call the `numIslands` method on it to count the number of islands in a given grid."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 Output: 1\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid1 = [\n",
-        "  [\"1\", \"1\", \"1\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"1\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"0\", \"0\"]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "result1 = solution.numIslands(grid1)\n",
-        "print(\"Example 1 Output:\", result1)  # Expected output: 1\n"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 6,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "grid2 = [\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"1\", \"0\", \"0\"],\n",
-        "  [\"0\", \"0\", \"0\", \"1\", \"1\"]\n",
-        "]\n",
-        "\n",
-        "result2 = solution.numIslands(grid2)\n",
-        "print(\"Example 2 Output:\", result2)  # Expected output: 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code:\n",
-        "\n",
-        "Time Complexity:\n",
-        "- The code uses a depth-first search (DFS) to explore the grid and count the number of islands.\n",
-        "- In the worst case, it visits every cell in the grid exactly once.\n",
-        "- The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of $O(4^{max(m, n)})$, where m is the number of rows and n is the number of columns.\n",
-        "- Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.\n",
-        "\n",
-        "Space Complexity:\n",
-        "- The space complexity is determined by the recursive calls and the depth of the DFS stack.\n",
-        "- In the worst case, when the entire grid consists of '1's, the depth of the DFS recursion can be as deep as max(m, n).\n",
-        "- Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.\n",
-        "\n",
-        "In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it's important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n))."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Identify Largest Island:** In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.\n",
-        "\n",
-        "2. **Optimize for Space:** Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb b/docs/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb
deleted file mode 100644
index 37624f6..0000000
--- a/docs/_build/html/_sources/11. Graphs/207. Course Schedule.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 207. Course Schedule\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Course Schedule problem on LeetCode, click here!](https://leetcode.com/problems/course-schedule/)\n",
-        "\n",
-        "---\n",
-        "There are a total of `numCourses` courses to take, labeled from 0 to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`. \n",
-        "\n",
-        "- For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.\n",
-        "\n",
-        "Return `true` if you can finish all courses. Otherwise, return `false`.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- 1 <= `numCourses` <= 2000\n",
-        "- 0 <= `prerequisites.length` <= 5000\n",
-        "- `prerequisites[i].length` == 2\n",
-        "- 0 <= `ai`, `bi` < `numCourses`\n",
-        "- All the pairs `prerequisites[i]` are **unique**."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem is to determine whether it's possible to complete a set of courses given a list of prerequisites. You are given the following:\n",
-        "\n",
-        "- `numCourses`: The total number of courses to be taken, labeled from 0 to `numCourses - 1`.\n",
-        "- `prerequisites`: A list of prerequisite courses, where each element `prerequisites[i]` is a pair `[ai, bi]`, indicating that you must take course `bi` before you can take course `ai`.\n",
-        "\n",
-        "The goal is to check whether it's possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.\n",
-        "\n",
-        "For example:\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0]]`, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it's possible to complete all courses, so the function should return `True`.\n",
-        "\n",
-        "- If `numCourses` is 2, and `prerequisites` is `[[1, 0], [0, 1]]`, it means you have two courses, but there's a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it's impossible to complete all courses, so the function should return `False`.\n",
-        "\n",
-        "The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it's possible to complete all courses; otherwise, it's not possible.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 18,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n",
-        "        # Create a graph using an adjacency list to represent the courses and their prerequisites.\n",
-        "        graph = defaultdict(list)  # Initialize an empty adjacency list.\n",
-        "        in_degree = [0] * numCourses  # Initialize an array to store in-degrees of courses.\n",
-        "\n",
-        "        # Populate the graph and calculate in-degrees.\n",
-        "        for course, prerequisite in prerequisites:\n",
-        "            graph[prerequisite].append(course)  # Add the course as a neighbor to its prerequisite.\n",
-        "            in_degree[course] += 1  # Increment the in-degree of the course.\n",
-        "\n",
-        "        # Initialize a queue with courses that have no prerequisites.\n",
-        "        queue = deque()\n",
-        "        for course in range(numCourses):\n",
-        "            if in_degree[course] == 0:\n",
-        "                queue.append(course)\n",
-        "\n",
-        "        # Perform topological sorting.\n",
-        "        while queue:\n",
-        "            course = queue.popleft()  # Take a course with no prerequisites.\n",
-        "            numCourses -= 1  # Decrement the count of remaining courses.\n",
-        "\n",
-        "            for neighbor in graph[course]:\n",
-        "                in_degree[neighbor] -= 1  # Remove the prerequisite relationship.\n",
-        "                if in_degree[neighbor] == 0:\n",
-        "                    queue.append(neighbor)  # If no more prerequisites, add to the queue.\n",
-        "\n",
-        "        # If all courses were successfully taken (numCourses becomes 0), return True.\n",
-        "        return numCourses == 0"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here's a brief explanation of the code:\n",
-        "\n",
-        "1. The code defines a `Solution` class with a `canFinish` method that takes two parameters: `numCourses` (the total number of courses) and `prerequisites` (a list of pairs indicating which course must be taken before another).\n",
-        "\n",
-        "2. It initializes an empty graph as an adjacency list using a `defaultdict` to represent the courses and their prerequisites. It also initializes a list called `in_degree` to keep track of the in-degrees of courses, which is used in the topological sorting process.\n",
-        "\n",
-        "3. The code then populates the graph by iterating through the `prerequisites` list. For each pair `(ai, bi)`, it adds course `ai` as a neighbor to its prerequisite course `bi` in the graph and increments the in-degree of course `ai`.\n",
-        "\n",
-        "4. Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.\n",
-        "\n",
-        "5. The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).\n",
-        "\n",
-        "6. For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor's in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.\n",
-        "\n",
-        "7. The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.\n",
-        "\n",
-        "8. After the loop, if all courses were successfully taken (i.e., `numCourses` becomes 0), it means that there were no circular dependencies, and it's possible to finish all courses. In this case, the method returns `True`. Otherwise, if there are remaining courses (indicating a circular dependency), it returns `False`."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 20,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "True\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "numCourses1 = 2\n",
-        "prerequisites1 = [[1, 0]]\n",
-        "sol = Solution()\n",
-        "print(sol.canFinish(numCourses1, prerequisites1))  # Output: True"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 21,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "False\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "numCourses2 = 2\n",
-        "prerequisites2 = [[1, 0], [0, 1]]\n",
-        "print(sol.canFinish(numCourses2, prerequisites2))  # Output: False"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the `canFinish` method:\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "\n",
-        "1. Constructing the graph: In the first loop where we iterate through the `prerequisites` list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).\n",
-        "\n",
-        "2. Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all `numCourses` courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).\n",
-        "\n",
-        "3. Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).\n",
-        "\n",
-        "The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "\n",
-        "1. Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.\n",
-        "\n",
-        "2. In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.\n",
-        "\n",
-        "3. Queue: The space complexity for the queue is O(V), as it may contain all the courses.\n",
-        "\n",
-        "The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-        "\n",
-        "In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimizing Course Scheduling**: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.\n",
-        "\n",
-        "2. **Detecting Cycles in Course Dependencies**: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/docs/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
deleted file mode 100644
index fb186f2..0000000
--- a/docs/_build/html/_sources/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb	
+++ /dev/null
@@ -1,236 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 3651. Number of Connected Components in an Undirected Graph\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!](https://www.lintcode.com/problem/3651/)\n",
-        "\n",
-        "---\n",
-        "In this problem, there is an undirected graph with `n` nodes. There is also an `edges` array. Where `edges[i] = [a, b]` means that there is an edge between *node a* and *node b* in the graph.\n",
-        "\n",
-        "You need to return *the number of connected components in that graph*."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand is to determine the number of connected components in an undirected graph. Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "- You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.\n",
-        "\n",
-        "- A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.\n",
-        "\n",
-        "- Your task is to write a function that takes as input the number of nodes `n` and a list of edges `edges`, where each edge is represented as a pair of nodes `[a, b]` indicating an edge between node `a` and node `b`.\n",
-        "\n",
-        "- The goal is to determine the number of distinct connected components in the graph.\n",
-        "\n",
-        "- You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 13,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "def countConnectedComponents(n, edges):\n",
-        "    # Define a helper function for depth-first search (DFS).\n",
-        "    def dfs(node):\n",
-        "        if not visited[node]:  # If the node has not been visited yet:\n",
-        "            visited[node] = True  # Mark it as visited.\n",
-        "            for neighbor in graph[node]:  # Explore all neighbors of the current node.\n",
-        "                dfs(neighbor)  # Recursively call DFS on the neighbor.\n",
-        "\n",
-        "    # Create an empty adjacency list to represent the graph.\n",
-        "    graph = [[] for _ in range(n)]\n",
-        "\n",
-        "    # Initialize a boolean list to keep track of visited nodes.\n",
-        "    visited = [False] * n\n",
-        "\n",
-        "    # Populate the adjacency list with edges from the input.\n",
-        "    for a, b in edges:\n",
-        "        graph[a].append(b)\n",
-        "        graph[b].append(a)  # Since the graph is undirected, we add edges in both directions.\n",
-        "\n",
-        "    # Initialize a counter to keep track of the number of connected components.\n",
-        "    count = 0\n",
-        "\n",
-        "    # Iterate through all nodes in the graph.\n",
-        "    for i in range(n):\n",
-        "        if not visited[i]:  # If the node has not been visited:\n",
-        "            count += 1  # Increment the count since we've found a new connected component.\n",
-        "            dfs(i)  # Start a depth-first search from the unvisited node to explore the component.\n",
-        "\n",
-        "    return count"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The provided Python code calculates the number of connected components in an undirected graph. Here's a high-level explanation of how the code works:\n",
-        "\n",
-        "1. The `countConnectedComponents` function takes two arguments: `n` (the number of nodes in the graph) and `edges` (a list of edge pairs representing connections between nodes).\n",
-        "\n",
-        "2. Inside the function, there is a helper function called `dfs` (depth-first search), which is used to explore and mark nodes as visited.\n",
-        "\n",
-        "3. An empty adjacency list called `graph` is created to represent the graph. The `graph` is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.\n",
-        "\n",
-        "4. Another list called `visited` is created to keep track of visited nodes. Initially, all nodes are marked as not visited (`False`).\n",
-        "\n",
-        "5. The code populates the `graph` by iterating through the `edges` list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.\n",
-        "\n",
-        "6. A counter variable called `count` is initialized to keep track of the number of connected components.\n",
-        "\n",
-        "7. The code iterates through all nodes from `0` to `n-1`. For each node, it checks whether it has been visited yet. If it hasn't been visited, it means a new connected component is found. The counter `count` is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.\n",
-        "\n",
-        "8. The `dfs` function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling `dfs` on unvisited neighbors.\n",
-        "\n",
-        "9. After the loop through all nodes, the `count` variable contains the total number of connected components in the graph.\n",
-        "\n",
-        "10. The function returns the value of `count`, which represents the number of connected components.\n",
-        "\n",
-        "11. Two examples are provided at the end to demonstrate how to use the function with different inputs."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 14,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "1\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "n1 = 3\n",
-        "edges1 = [[0, 1], [0, 2]]\n",
-        "print(countConnectedComponents(n1, edges1))  # Output: 1"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 15,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "n2 = 6\n",
-        "edges2 = [[0, 1], [1, 2], [2, 3], [4, 5]]\n",
-        "print(countConnectedComponents(n2, edges2))  # Output: 2"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).\n",
-        "\n",
-        "**Time Complexity:**\n",
-        "- The code iterates through all nodes in the graph (from 0 to `n-1`).\n",
-        "- For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.\n",
-        "- In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.\n",
-        "- The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.\n",
-        "- In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.\n",
-        "\n",
-        "So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.\n",
-        "\n",
-        "**Space Complexity:**\n",
-        "- The main data structures used are the `graph` (adjacency list), `visited` (boolean array), and the recursive call stack for DFS.\n",
-        "- The `graph` has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.\n",
-        "- The `visited` boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.\n",
-        "- The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.\n",
-        "\n",
-        "So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).\n",
-        "\n",
-        "In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Disconnected Components with Multiple Queries:** You are given an undirected graph with `n` nodes and `m` edges. Initially, the graph is disconnected, and you need to process `q` queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.\n",
-        "\n",
-        "2. **Maximum Size of Connected Components:** Given an undirected graph with `n` nodes and `m` edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.\n"
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/docs/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
deleted file mode 100644
index eb34497..0000000
--- a/docs/_build/html/_sources/11. Graphs/417. Pacific Atlantic Water Flow.ipynb	
+++ /dev/null
@@ -1,261 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 417. Pacific Atlantic Water Flow\n",
-        "\n",
-        "\n",
-        "**Difficulty:** Medium\n",
-        "\n",
-        "**Link to Problem:** [To see the Pacific Atlantic Water Flow problem on LeetCode, click here!](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n",
-        "\n",
-        "---\n",
-        "There is an `m x n` rectangular island that borders both the **Pacific Ocean** and **Atlantic Ocean**. The **Pacific Ocea**n touches the island's left and top edges, and the **Atlantic Ocean** touches the island's right and bottom edges.\n",
-        "\n",
-        "The island is partitioned into a grid of square cells. You are given an `m x n` integer matrix `heights` where `heights[r][c]` represents the **height above sea level** of the cell at coordinate `(r, c)`.\n",
-        "\n",
-        "The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is **less than or equal to** the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.\n",
-        "\n",
-        "Return *a **2D list** of grid coordinates `result` where $result[i] = [r_i, c_i]$ denotes that rain water can flow from cell $(r_i, c_i)$ to **both** the Pacific and Atlantic oceans*.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `m == heights.length`\n",
-        "- `n == heights[r].length`\n",
-        "- `1 <= m, n <= 200`\n",
-        "- 0 <= `heights[r][c]` <= $10^5$"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island's left and top edges, while the Atlantic Ocean is in contact with the island's right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "Here are the key details and constraints of the problem:\n",
-        "\n",
-        "1. The island is divided into a grid of square cells.\n",
-        "\n",
-        "2. Each cell is represented by an integer value in a matrix `heights`. The value at `heights[r][c]` represents the height above sea level of the cell at coordinates `(r, c)` on the island.\n",
-        "\n",
-        "3. Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "4. Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.\n",
-        "\n",
-        "The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.\n",
-        "\n",
-        "The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.\n",
-        "\n",
-        "The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 24,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from typing import List\n",
-        "\n",
-        "class Solution:\n",
-        "    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:\n",
-        "        # Check if the input matrix is empty\n",
-        "        if not heights:\n",
-        "            return []\n",
-        "        \n",
-        "        m, n = len(heights), len(heights[0])\n",
-        "        \n",
-        "        # Initialize boolean matrices to keep track of cells reachable from each ocean\n",
-        "        pacific_reachable = [[False] * n for _ in range(m)]\n",
-        "        atlantic_reachable = [[False] * n for _ in range(m)]\n",
-        "        \n",
-        "        # Depth-First Search (DFS) function to mark cells that can be reached from an ocean\n",
-        "        def dfs(x, y, reachable):\n",
-        "            if reachable[x][y]:\n",
-        "                return\n",
-        "            reachable[x][y] = True\n",
-        "            for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n",
-        "                new_x, new_y = x + dx, y + dy\n",
-        "                if 0 <= new_x < m and 0 <= new_y < n and heights[new_x][new_y] >= heights[x][y]:\n",
-        "                    dfs(new_x, new_y, reachable)\n",
-        "        \n",
-        "        # Start DFS from the Pacific Ocean (left and top edges)\n",
-        "        for i in range(m):\n",
-        "            dfs(i, 0, pacific_reachable)\n",
-        "            dfs(i, n - 1, atlantic_reachable)\n",
-        "        \n",
-        "        for j in range(n):\n",
-        "            dfs(0, j, pacific_reachable)\n",
-        "            dfs(m - 1, j, atlantic_reachable)\n",
-        "        \n",
-        "        result = []\n",
-        "        \n",
-        "        # Find cells that can flow to both the Pacific and Atlantic oceans\n",
-        "        for i in range(m):\n",
-        "            for j in range(n):\n",
-        "                if pacific_reachable[i][j] and atlantic_reachable[i][j]:\n",
-        "                    result.append([i, j])\n",
-        "        \n",
-        "        return result"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class called `Solution` with a method named `pacificAtlantic`. This method takes a 2D matrix `heights`, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, `pacific_reachable` and `atlantic_reachable`, to keep track of cells that can be reached from each ocean.\n",
-        "\n",
-        "The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell's height is less than or equal to the current cell's height.\n",
-        "\n",
-        "After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the `result` list.\n",
-        "\n",
-        "Finally, the code returns the `result` list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-        "\n",
-        "The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 25,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "heights1 = [\n",
-        "    [1,2,2,3,5],\n",
-        "    [3,2,3,4,4],\n",
-        "    [2,4,5,3,1],\n",
-        "    [6,7,1,4,5],\n",
-        "    [5,1,1,2,4]\n",
-        "]\n",
-        "\n",
-        "solution = Solution()\n",
-        "print(solution.pacificAtlantic(heights1)) # Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 26,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "[[0, 0]]\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "heights2 = [[1]]\n",
-        "print(solution.pacificAtlantic(heights2)) # Expected Output: [[0, 0]]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of this solution is O(m * n), where 'm' is the number of rows in the input matrix and 'n' is the number of columns. Here's a breakdown of the time complexity:\n",
-        "\n",
-        "1. Creating the `pacific_reachable` and `atlantic_reachable` matrices with dimensions m x n takes O(m * n) time.\n",
-        "\n",
-        "2. Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.\n",
-        "\n",
-        "3. The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.\n",
-        "\n",
-        "4. The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.\n",
-        "\n",
-        "Overall, the time complexity is dominated by the DFS and is O(m * n).\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of this solution is also O(m * n). Here's how the space is used:\n",
-        "\n",
-        "1. Two boolean matrices, `pacific_reachable` and `atlantic_reachable`, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.\n",
-        "\n",
-        "2. The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).\n",
-        "\n",
-        "3. The `result` list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.\n",
-        "\n",
-        "The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n)."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Optimization Challenge:** Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.\n",
-        "\n",
-        "2. **Efficiency Challenge:** Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/11. Graphs/README.md b/docs/_build/html/_sources/11. Graphs/README.md
deleted file mode 100644
index aad262c..0000000
--- a/docs/_build/html/_sources/11. Graphs/README.md	
+++ /dev/null
@@ -1,23 +0,0 @@
-# Graphs Problems - Blind 75 LeetCode
-
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb b/docs/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb
deleted file mode 100644
index 81f0e5b..0000000
--- a/docs/_build/html/_sources/12. Advanced Graphs/892. Alien Dictionary.ipynb	
+++ /dev/null
@@ -1,256 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {
-        "jp-MarkdownHeadingCollapsed": true
-      },
-      "source": [
-        "# 892. Alien Dictionary\n",
-        "\n",
-        "**Difficulty:** Hard\n",
-        "\n",
-        "**Link to Problem:** [To see the Alien Dictionary problem on LintCode, click here!](https://www.lintcode.com/problem/892/)\n",
-        "\n",
-        "---\n",
-        "\n",
-        "There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of **non-empty** words from the dictionary, where words are **sorted lexicographically by the rules of this new language**. Derive the order of letters in this language.\n",
-        "\n",
-        "**Constraints:**\n",
-        "- You may assume all letters are in lowercase.\n",
-        "- The dictionary is invalid, if string a is prefix of string b and b is appear before a.\n",
-        "- If the order is invalid, return an empty string.\n",
-        "- There may be multiple valid order of letters, return the smallest in normal lexicographical order.\n",
-        "- The letters in **one** string are of the same rank by default and are sorted in Human dictionary order."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.\n",
-        "\n",
-        "Here's a more detailed explanation of the problem:\n",
-        "\n",
-        "1. The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.\n",
-        "\n",
-        "2. Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.\n",
-        "\n",
-        "3. Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string 'a' is a prefix of another string 'b,' and 'b' appears before 'a' in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.\n",
-        "\n",
-        "4. Multiple valid orders: It's possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.\n",
-        "\n",
-        "To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it's valid, and an empty string if the order is invalid.\n",
-        "\n",
-        "The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 7,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "from collections import defaultdict, deque\n",
-        "\n",
-        "def alienOrder(words):\n",
-        "    # Create an adjacency list to represent the graph\n",
-        "    graph = defaultdict(list)\n",
-        "    \n",
-        "    # Create a dictionary to store the in-degrees of each letter\n",
-        "    in_degree = {}\n",
-        "    \n",
-        "    # Initialize in-degrees to 0 for all letters\n",
-        "    for word in words:\n",
-        "        for char in word:\n",
-        "            if char not in in_degree:\n",
-        "                in_degree[char] = 0\n",
-        "    \n",
-        "    # Build the graph and update in-degrees\n",
-        "    for i in range(1, len(words)):\n",
-        "        word1, word2 = words[i-1], words[i]\n",
-        "        min_length = min(len(word1), len(word2))\n",
-        "        \n",
-        "        # Compare characters in the two words\n",
-        "        j = 0\n",
-        "        while j < min_length and word1[j] == word2[j]:\n",
-        "            j += 1\n",
-        "        \n",
-        "        if j < min_length:\n",
-        "            # If word1[j] is lexicographically before word2[j], add an edge\n",
-        "            graph[word1[j]].append(word2[j])\n",
-        "            in_degree[word2[j]] += 1\n",
-        "            \n",
-        "            # Break the loop to avoid further comparisons\n",
-        "            break\n",
-        "    \n",
-        "    # Perform topological sorting using Kahn's algorithm\n",
-        "    result = []\n",
-        "    queue = deque([char for char in in_degree if in_degree[char] == 0])\n",
-        "    \n",
-        "    while queue:\n",
-        "        char = queue.popleft()\n",
-        "        result.append(char)\n",
-        "        \n",
-        "        for neighbor in graph[char]:\n",
-        "            in_degree[neighbor] -= 1\n",
-        "            if in_degree[neighbor] == 0:\n",
-        "                queue.append(neighbor)\n",
-        "    \n",
-        "    # Check if there is a valid order\n",
-        "    if len(result) < len(in_degree):\n",
-        "        return \"\"\n",
-        "    \n",
-        "    return \"\".join(result)"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.\n",
-        "\n",
-        "The code follows these main steps:\n",
-        "\n",
-        "1. Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called `in_degree` to keep track of the in-degrees (the number of letters that precede a letter) for each letter.\n",
-        "\n",
-        "2. Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the `in_degree` dictionary with an initial in-degree of 0.\n",
-        "\n",
-        "3. Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there's an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.\n",
-        "\n",
-        "4. After constructing the graph, the code performs a topological sorting of the letters using Kahn's algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.\n",
-        "\n",
-        "5. Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there's a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.\n",
-        "\n",
-        "The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 8,
-      "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "wrtef\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1\n",
-        "words1 = [\"wrt\", \"wrf\", \"er\", \"ett\", \"rftt\"]\n",
-        "print(alienOrder(words1))  # Output: \"wertf\""
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 9,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "zx\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2\n",
-        "words2 = [\"z\", \"x\"]\n",
-        "print(alienOrder(words2))  # Output: \"zx\""
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Let's analyze the time and space complexity of the provided code for determining the order of letters in an alien language.\n",
-        "\n",
-        "Time Complexity:\n",
-        "1. Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.\n",
-        "2. Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.\n",
-        "\n",
-        "Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.\n",
-        "\n",
-        "Space Complexity:\n",
-        "1. Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.\n",
-        "2. Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.\n",
-        "3. Queue: The space used by the queue during topological sorting is also O(V).\n",
-        "\n",
-        "Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.\n",
-        "\n",
-        "In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.\n",
-        "\n",
-        "In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Multiple Valid Orders**: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.\n",
-        "\n",
-        "2. **Detect Invalid Dictionary**: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/12. Advanced Graphs/README.md b/docs/_build/html/_sources/12. Advanced Graphs/README.md
deleted file mode 100644
index f362de7..0000000
--- a/docs/_build/html/_sources/12. Advanced Graphs/README.md	
+++ /dev/null
@@ -1,16 +0,0 @@
-# Advanced Graphs Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb b/docs/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb
deleted file mode 100644
index 8d32e21..0000000
--- a/docs/_build/html/_sources/13. One-D Dynamic Programming/198. House Robber.ipynb	
+++ /dev/null
@@ -1,103 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night.**\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight **without alerting the police**.*\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 400`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nThe problem is a classic dynamic programming challenge known as the \"House Robber\" problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.\n\nThe goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.\n\nThe input to the problem is an array `nums`, where `nums[i]` represents the amount of money in the `i`-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.\n\nFor example:\n```\nInput: nums = [1,2,3,1]\nOutput: 4\nExplanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).\nTotal amount you can rob = 1 + 3 = 4.\n\nInput: nums = [2,7,9,3,1]\nOutput: 12\nExplanation: Rob house 1 (money = 2), rob house 3 (money = 9), and rob house 5 (money = 1).\nTotal amount you can rob = 2 + 9 + 1 = 12.\n```\n\nThe challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        # Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses\n        prev, curr = 0, 0\n\n        # Iterate through the houses\n        for n in nums:\n            # Calculate the maximum amount of money that can be robbed at the current house\n            # It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),\n            # or skipping the current house and taking the maximum amount from the previous house (curr)\n            temp = max(n + prev, curr)\n\n            # Update the variables for the next iteration\n            prev, curr = curr, temp\n\n        # The final result is the maximum amount of money that can be robbed at the last house\n        return curr",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 4,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code is a Python implementation of the \"House Robber\" problem using a dynamic programming approach. It's part of a class `Solution` and includes a method `rob` that takes a list of integers `nums` as input and returns the maximum amount of money that can be robbed without alerting the police.\n\nThe key idea of the algorithm is to maintain two variables, `prev` and `curr`, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.\n\nThe loop calculates a temporary variable `temp` that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (`n + prev`), or skipping the current house and taking the maximum amount from the previous house (`curr`). The maximum of these two scenarios is assigned to `temp`.\n\nThe `prev` and `curr` variables are then updated for the next iteration. `prev` is set to the previous value of `curr`, and `curr` is set to the calculated `temp`.\n\nThe final result is the value stored in the `curr` variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the `rob` method.\n\nThe provided test cases at the end demonstrate the usage of the `rob` method with different input arrays.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\nsol = Solution()\n\nnums1 = [1, 2, 3, 1]\nprint(sol.rob(nums1))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 5,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [2, 7, 9, 3, 1]\nprint(sol.rob(nums2))  # Output: 12",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 6,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "12\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code.\n\n### Time Complexity:\n\nThe time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).\n\n### Space Complexity:\n\nThe space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables `prev`, `curr`, and `temp` are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).\n\nIn summary:\n- Time Complexity: O(n)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Variation with Maximum Number of Houses to Rob:** Modify the problem to include an additional constraint: you are allowed to rob at most 'k' houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.\n\n2. **Robbing in a Circular Street:** Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.\n\n\n**Link to Problem:** [To see the House Robber problem on LeetCode, click here!](https://leetcode.com/problems/house-robber/description/)\n",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/docs/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb b/docs/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb
deleted file mode 100644
index b1080e8..0000000
--- a/docs/_build/html/_sources/13. One-D Dynamic Programming/213. House Robber II.ipynb	
+++ /dev/null
@@ -1,119 +0,0 @@
-{
-  "metadata": {
-    "kernelspec": {
-      "name": "python",
-      "display_name": "Python (Pyodide)",
-      "language": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat_minor": 5,
-  "nbformat": 4,
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "source": "# House Robber II\n**Difficulty:** Medium\n\n---\nYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle**. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatically contact the police if two adjacent houses were broken into on the same night**.\n\nGiven an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight without alerting the police*.\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 1000`",
-      "metadata": {},
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Probelm Explanation:\n\nCertainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.\n\nThe twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.\n\nThe goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array `nums` representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.\n\nHere are a few examples to illustrate the problem:\n\n1. **Example 1:**\n   ```python\n   Input: nums = [2, 3, 2]\n   Output: 3\n   Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2) because they are adjacent houses. The optimal strategy is to rob house 2 (money = 3).\n   ```\n\n2. **Example 2:**\n   ```python\n   Input: nums = [1, 2, 3, 1]\n   Output: 4\n   Explanation: Robbing house 1 (money = 1) and then robbing house 3 (money = 3) results in a total amount of 4. Robbing house 2 is skipped to avoid alerting the police.\n   ```\n\n3. **Example 3:**\n   ```python\n   Input: nums = [1, 2, 3]\n   Output: 3\n   Explanation: Since the houses are in a circle, you can choose either house 1, 2, or 3. The optimal strategy is to rob house 3 for a total amount of 3.\n   ```\n\nThe constraints for the problem are that the length of the `nums` array is between 1 and 100, and the amount of money in each house (`nums[i]`) is between 0 and 1000.\n\n## Solution:\nHere's a Python function to implement this algorithm:",
-      "metadata": {},
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76"
-    },
-    {
-      "cell_type": "code",
-      "source": "from typing import List\n\nclass Solution:\n    def rob(self, nums: List[int]) -> int:\n        def simple_rob(nums):\n            # Helper function for basic house robbery problem\n            prev, curr = 0, 0\n            for num in nums:\n                # Calculate the maximum amount of money that can be robbed\n                # without alerting the police for each house\n                prev, curr = curr, max(prev + num, curr)\n            return curr\n\n        # Check the base cases where the length of nums is 1 or 2\n        if len(nums) == 1:\n            return nums[0]\n        elif len(nums) == 2:\n            return max(nums[0], nums[1])\n\n        # Case 1: First house is robbed, last house is not\n        case1 = simple_rob(nums[:-1])\n\n        # Case 2: First house is not robbed, last house is\n        case2 = simple_rob(nums[1:])\n\n        # Maximum of the two cases\n        return max(case1, case2)",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 7,
-      "outputs": [],
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Explanation:\n\nThe provided code defines a class `Solution` with a method `rob`, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.\n\nThe code uses dynamic programming to solve the problem efficiently. It contains a helper function `simple_rob` that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method `rob` handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.\n\nThe class is instantiated as `solution`, and the `rob` method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system.",
-      "metadata": {},
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Test cases:\n\nHere's how you can use this solution:",
-      "metadata": {},
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 1:\n\n# Create an instance of the Solution class\nsolution = Solution()\n\nnums1 = [2, 3, 2]\nprint(solution.rob(nums1))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 8,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums2 = [1, 2, 3, 1]\nprint(solution.rob(nums2))  # Output: 4",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 9,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "4\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3"
-    },
-    {
-      "cell_type": "code",
-      "source": "# Example 2:\nnums3 = [1, 2, 3]\nprint(solution.rob(nums3))  # Output: 3",
-      "metadata": {
-        "trusted": true
-      },
-      "execution_count": 10,
-      "outputs": [
-        {
-          "name": "stdout",
-          "text": "3\n",
-          "output_type": "stream"
-        }
-      ],
-      "id": "e6e1554f-ae77-410c-8af2-e59e5428166c"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Time and Space Complexity Analysis\n\nLet's analyze the time and space complexity of the provided code:\n\n### Time Complexity:\nThe time complexity is primarily determined by the `simple_rob` helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main `rob` function calls `simple_rob` twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).\n\n### Space Complexity:\nThe space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are `prev` and `curr` in the `simple_rob` function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).\n\nIn summary:\n- Time Complexity: O(N)\n- Space Complexity: O(1)",
-      "metadata": {},
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2"
-    },
-    {
-      "cell_type": "markdown",
-      "source": "## Challenging Exercises:\n\n1. **Optimization Challenge:** Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?\n\n2. **Circular Robbery Variations:** Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.\n\n**Link to Problem:** [To see the House Robber II problem on LeetCode, click here!](https://leetcode.com/problems/house-robber-ii/)",
-      "metadata": {},
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/docs/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/docs/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
deleted file mode 100644
index b727489..0000000
--- a/docs/_build/html/_sources/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
-  "cells": [
-    {
-      "cell_type": "markdown",
-      "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-      "metadata": {},
-      "source": [
-        "# 70. Climbing Stairs\n",
-        "\n",
-        "**Difficulty:** Easy\n",
-        "\n",
-        "**Link to Problem:** [To see the Climbing Stairs problem on LeetCode, click here!](https://leetcode.com/problems/climbing-stairs/)\n",
-        "\n",
-        "---\n",
-        "You are climbing a staircase. It takes `n` steps to reach the top.\n",
-        "\n",
-        "Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?\n",
-        "\n",
-        "**Constraints:**\n",
-        "- `1 <= n <= 45`"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-      "metadata": {},
-      "source": [
-        "## Probelm Explanation:\n",
-        "\n",
-        "The \"Climbing Stairs\" problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here's the problem statement:\n",
-        "\n",
-        "You are given a staircase with 'n' steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.\n",
-        "\n",
-        "For example, if 'n' is 2, there are two ways to climb to the top:\n",
-        "\n",
-        "1. Climbing two steps at once.\n",
-        "2. Climbing one step, and then another step.\n",
-        "\n",
-        "If 'n' is 3, there are three ways:\n",
-        "\n",
-        "1. Climbing one step, then one step, and finally one step.\n",
-        "2. Climbing one step, then two steps.\n",
-        "3. Climbing two steps, then one step.\n",
-        "\n",
-        "The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It's a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.\n",
-        "\n",
-        "## Solution:\n",
-        "Here's a Python function to implement this algorithm:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 1,
-      "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [],
-      "source": [
-        "class Solution:\n",
-        "    def climbStairs(self, n: int) -> int:\n",
-        "        # If there are 1 or 2 steps, there are exactly n ways to reach the top.\n",
-        "        if n <= 2:\n",
-        "            return n\n",
-        "\n",
-        "        # Create an array to store the number of ways to reach each step.\n",
-        "        dp = [0] * (n + 1)\n",
-        "\n",
-        "        # There is one way to reach the first step (base case).\n",
-        "        dp[1] = 1\n",
-        "\n",
-        "        # There are two ways to reach the second step (base case).\n",
-        "        dp[2] = 2\n",
-        "\n",
-        "        # Calculate the number of ways to reach each step from the previous steps.\n",
-        "        for i in range(3, n + 1):\n",
-        "            # The number of ways to reach step 'i' is the sum of the ways to reach\n",
-        "            # the previous two steps, as you can take 1 or 2 steps at a time.\n",
-        "            dp[i] = dp[i - 1] + dp[i - 2]\n",
-        "\n",
-        "        # The result is the number of ways to reach the top, which is stored in dp[n].\n",
-        "        return dp[n]"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-      "metadata": {},
-      "source": [
-        "## Explanation:\n",
-        "\n",
-        "The code defines a class `Solution` with a method `climbStairs` that takes an integer `n` as input and returns the number of distinct ways to climb a staircase with `n` steps.\n",
-        "\n",
-        "1. If `n` is 1 or 2, the function returns `n` directly because there are only 1 or 2 distinct ways to reach the top in those cases.\n",
-        "\n",
-        "2. For `n` greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array `dp` of length `n + 1` to store these values.\n",
-        "\n",
-        "3. The `dp[1]` and `dp[2]` are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).\n",
-        "\n",
-        "4. The code then uses a loop to fill in the `dp` array for steps 3 and above. For each step `i` from 3 to `n`, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.\n",
-        "\n",
-        "5. Finally, the function returns the value stored in `dp[n]`, which represents the total number of distinct ways to climb the staircase with `n` steps."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-      "metadata": {},
-      "source": [
-        "## Test cases:\n",
-        "\n",
-        "Here's how you can use this solution:"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 2,
-      "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 1 - Input: n = 2, Output: 2\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 1:\n",
-        "n = 2\n",
-        "solution = Solution()\n",
-        "print(f\"Example 1 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 2"
-      ]
-    },
-    {
-      "cell_type": "code",
-      "execution_count": 5,
-      "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-      "metadata": {
-        "trusted": true
-      },
-      "outputs": [
-        {
-          "name": "stdout",
-          "output_type": "stream",
-          "text": [
-            "Example 2 - Input: n = 3, Output: 3\n"
-          ]
-        }
-      ],
-      "source": [
-        "# Example 2:\n",
-        "n = 3\n",
-        "print(f\"Example 2 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 3\n"
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-      "metadata": {},
-      "source": [
-        "## Time and Space Complexity Analysis\n",
-        "\n",
-        "Time Complexity:\n",
-        "The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the `dp` array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value `n`.\n",
-        "\n",
-        "Space Complexity:\n",
-        "The space complexity of the solution is O(n) as well. We use an array `dp` of length `n + 1` to store the number of ways to reach each step. The size of this array is directly proportional to the input value `n`, which makes the space complexity linear in terms of `n`. The rest of the variables used in the function (e.g., `i`) occupy constant space and do not contribute significantly to the overall space complexity.\n",
-        "\n",
-        "In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the \"Climbing Stairs\" problem."
-      ]
-    },
-    {
-      "cell_type": "markdown",
-      "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-      "metadata": {},
-      "source": [
-        "## Challenging Exercises:\n",
-        "\n",
-        "1. **Generalized Step Sizes**: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes `[1, 2, 3]`. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.\n",
-        "\n",
-        "2. **Minimize Steps**: Given an integer `n`, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken."
-      ]
-    }
-  ],
-  "metadata": {
-    "kernelspec": {
-      "display_name": "Python (Pyodide)",
-      "language": "python",
-      "name": "python"
-    },
-    "language_info": {
-      "codemirror_mode": {
-        "name": "python",
-        "version": 3
-      },
-      "file_extension": ".py",
-      "mimetype": "text/x-python",
-      "name": "python",
-      "nbconvert_exporter": "python",
-      "pygments_lexer": "ipython3",
-      "version": "3.8"
-    }
-  },
-  "nbformat": 4,
-  "nbformat_minor": 5
-}
diff --git a/docs/_build/html/_sources/13. One-D Dynamic Programming/README.md b/docs/_build/html/_sources/13. One-D Dynamic Programming/README.md
deleted file mode 100644
index 73f4de3..0000000
--- a/docs/_build/html/_sources/13. One-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,25 +0,0 @@
-# 1-D Dynamic Programming Problems - Blind 75 LeetCode 
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Medium     |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/14. Two-D Dynamic Programming/README.md b/docs/_build/html/_sources/14. Two-D Dynamic Programming/README.md
deleted file mode 100644
index 8bab876..0000000
--- a/docs/_build/html/_sources/14. Two-D Dynamic Programming/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### 2-D Dynamic Programming
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/15. Greedy/README.md b/docs/_build/html/_sources/15. Greedy/README.md
deleted file mode 100644
index 82b6543..0000000
--- a/docs/_build/html/_sources/15. Greedy/README.md	
+++ /dev/null
@@ -1,47 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Greedy
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/16. Intervals/README.md b/docs/_build/html/_sources/16. Intervals/README.md
deleted file mode 100644
index a57713e..0000000
--- a/docs/_build/html/_sources/16. Intervals/README.md	
+++ /dev/null
@@ -1,50 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Intervals
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/17. Math Geometry/README.md b/docs/_build/html/_sources/17. Math Geometry/README.md
deleted file mode 100644
index 8b2f180..0000000
--- a/docs/_build/html/_sources/17. Math Geometry/README.md	
+++ /dev/null
@@ -1,48 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Math & Geometry
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/18. Bit Manipulation/README.md b/docs/_build/html/_sources/18. Bit Manipulation/README.md
deleted file mode 100644
index 05b2fef..0000000
--- a/docs/_build/html/_sources/18. Bit Manipulation/README.md	
+++ /dev/null
@@ -1,51 +0,0 @@
-# Blind 75 LeetCode Problems
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Bit Manupulation
-
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-Happy coding!
\ No newline at end of file
diff --git a/docs/_build/html/_sources/Book.ipynb b/docs/_build/html/_sources/Book.ipynb
deleted file mode 100644
index d400192..0000000
--- a/docs/_build/html/_sources/Book.ipynb
+++ /dev/null
@@ -1,373 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 34,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "\u001b[01mmaking output directory... \u001b[39;49;00mdone\n",
-      "[etoc] Changing master_doc to 'README'\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]  \n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.26 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.00 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]     \n",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.92 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 0.90 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 1.28 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executed notebook in 1.01 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/19. Remove Nth Node From End of List.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/206. Reverse Linked List.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/21. Merge Two Sorted Lists.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/06. Linked List/23. Merge k Sorted Lists.ipynb: Executed notebook in 1.13 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executing notebook using local CWD [mystnb]      \n",
-      "/workspaces/LeetCode-Solutions/07. Trees/100. Same Tree.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/102. Binary Tree Level Order Traversal.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/104. Maximum Depth of Binary Tree.ipynb: Executed notebook in 0.91 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb: Executed notebook in 1.17 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/124. Binary Tree Maximum Path Sum.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/199. Binary Tree Right Side View.ipynb: Executed notebook in 1.07 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/226. Invert Binary Tree.ipynb: Executed notebook in 0.96 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/230. Kth Smallest Element in a BST.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb: Executed notebook in 1.11 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb: Executed notebook in 1.16 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/07. Trees/98. Validate Binary Search Tree.ipynb: Executed notebook in 1.15 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/208. Implement Trie (Prefix Tree).ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/211. Design Add and Search Words Data Structure.ipynb: Executed notebook in 1.05 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executing notebook using local CWD [mystnb] \n",
-      "/workspaces/LeetCode-Solutions/08. Tries/212. Word Search II.ipynb: Executed notebook in 1.27 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb: Executed notebook in 0.93 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/39. Combination Sum.ipynb: Executed notebook in 1.24 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/10. Backtracking/79. Word Search.ipynb: Executed notebook in 4.03 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executing notebook using local CWD [mystnb]   \n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/133. Clone Graph.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/178. Graph Valid Tree.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/200. Number of Islands.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/207. Course Schedule.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/11. Graphs/417. Pacific Atlantic Water Flow.ipynb: Executed notebook in 0.87 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/12. Advanced Graphs/892. Alien Dictionary.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/198. House Robber.ipynb: Executed notebook in 0.99 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/213. House Robber II.ipynb: Executed notebook in 1.08 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb: Executed notebook in 1.06 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/Book.ipynb: Executing notebook using local CWD [mystnb]                          \n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mSECURITY\u001b[39;49;00m                                              \n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/07. Trees/572. Subtree of Another Tree.ipynb:30008: WARNING: Non-consecutive header level increase; H1 to H3 [myst.header]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Executing notebook failed: CellTimeoutError [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: Notebook exception traceback saved in: /workspaces/LeetCode-Solutions/_build/html/reports/Book.err.log [mystnb.exec]\u001b[39;49;00m\n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/Book.ipynb: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CODE_OF_CONDUCT.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/CONTRIBUTING.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/SECURITY.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[ 94%] \u001b[32mBook\u001b[39;49;00m                                                   raph\u001b[39;49;00m0m\r"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
diff --git a/docs/_build/html/_sources/CODE_OF_CONDUCT.md b/docs/_build/html/_sources/CODE_OF_CONDUCT.md
deleted file mode 100644
index 5fe5041..0000000
--- a/docs/_build/html/_sources/CODE_OF_CONDUCT.md
+++ /dev/null
@@ -1,128 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, religion, or sexual identity
-and orientation.
-
-We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.
-
-## Our Standards
-
-Examples of behavior that contributes to a positive environment for our
-community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes,
-  and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the
-  overall community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or
-  advances of any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or email
-  address, without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Enforcement Responsibilities
-
-Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.
-
-Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.
-
-## Scope
-
-This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official e-mail address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-Email.
-All complaints will be reviewed and investigated promptly and fairly.
-
-All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.
-
-## Enforcement Guidelines
-
-Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:
-
-### 1. Correction
-
-**Community Impact**: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.
-
-**Consequence**: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.
-
-### 2. Warning
-
-**Community Impact**: A violation through a single incident or series
-of actions.
-
-**Consequence**: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or
-permanent ban.
-
-### 3. Temporary Ban
-
-**Community Impact**: A serious violation of community standards, including
-sustained inappropriate behavior.
-
-**Consequence**: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.
-
-### 4. Permanent Ban
-
-**Community Impact**: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior,  harassment of an
-individual, or aggression toward or disparagement of classes of individuals.
-
-**Consequence**: A permanent ban from any sort of public interaction within
-the community.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage],
-version 2.0, available at
-https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
-
-Community Impact Guidelines were inspired by [Mozilla's code of conduct
-enforcement ladder](https://github.com/mozilla/diversity).
-
-[homepage]: https://www.contributor-covenant.org
-
-For answers to common questions about this code of conduct, see the FAQ at
-https://www.contributor-covenant.org/faq. Translations are available at
-https://www.contributor-covenant.org/translations.
diff --git a/docs/_build/html/_sources/CONTRIBUTING.md b/docs/_build/html/_sources/CONTRIBUTING.md
deleted file mode 100644
index ca794ef..0000000
--- a/docs/_build/html/_sources/CONTRIBUTING.md
+++ /dev/null
@@ -1,79 +0,0 @@
-# Contributing Guidelines
-
-Thank you for considering contributing to the Blind 75 LeetCode repository! We welcome contributions from the community to help improve this resource and make it even more valuable.
-
-Please take a moment to review this document to understand how you can contribute.
-
-## Table of Contents
-- [Ways to Contribute](#ways-to-contribute)
-- [Getting Started](#getting-started)
-- [Contributing Process](#contributing-process)
-- [Code of Conduct](#code-of-conduct)
-
-## Ways to Contribute
-
-There are several ways you can contribute to this repository:
-
-1. **Suggest Improvements**: If you have ideas for making the Blind 75 LeetCode repository better, please open an issue to discuss your suggestions.
-
-2. **Report Issues**: If you encounter any issues with the existing content or code, please open an issue and provide as much detail as possible.
-
-3. **Contribute Solutions**: You can contribute solutions to the problems listed in the repository. Please follow the guidelines mentioned below when submitting your solutions.
-
-4. **Enhance Documentation**: Improve documentation, including explanations and time/space complexity analysis, for existing solutions.
-
-5. **Fix Bugs**: If you find and fix any bugs in the existing code or documentation, you are welcome to submit a pull request.
-
-## Getting Started
-
-Before you start contributing, please ensure you have the following prerequisites:
-
-- A GitHub account.
-- Familiarity with Git and GitHub.
-- Code editor or IDE for making changes.
-
-## Contributing Process
-
-Here's the general process for contributing:
-
-1. **Fork the Repository**: Click the "Fork" button at the top of this repository to create your copy.
-
-2. **Clone Your Fork**: Clone your fork to your local machine.
-
-    ```
-    git clone https://github.com/your-username/Blind-75-LeetCode.git
-    ```
-
-3. **Create a Branch**: Create a new branch for your contribution.
-
-    ```
-    git checkout -b feature/your-feature-name
-    ```
-
-4. **Make Changes**: Implement your changes, following the guidelines provided.
-
-5. **Test Your Changes**: Ensure that your changes do not introduce new issues and are consistent with the repository's style and structure.
-
-6. **Commit Changes**: Commit your changes with a meaningful commit message.
-
-    ```
-    git commit -m "Add solution to problem X"
-    ```
-
-7. **Push Changes**: Push your changes to your fork on GitHub.
-
-    ```
-    git push origin feature/your-feature-name
-    ```
-
-8. **Create a Pull Request**: Go to the original repository and create a pull request. Please provide a detailed description of your changes.
-
-9. **Review and Collaboration**: Your pull request will be reviewed, and you may need to make further changes. Be responsive to comments and feedback.
-
-10. **Merge**: Once your pull request is approved, it will be merged into the main branch.
-
-## Code of Conduct
-
-Please note that we have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-We appreciate your contributions to the Blind 75 LeetCode repository and look forward to working together to make it an even better resource for the community!
diff --git a/docs/_build/html/_sources/README.md b/docs/_build/html/_sources/README.md
deleted file mode 100644
index a9b8b2e..0000000
--- a/docs/_build/html/_sources/README.md
+++ /dev/null
@@ -1,216 +0,0 @@
-# Blind 75 LeetCode Solutions
-
-![Blind 75 LeetCode](https://img.shields.io/badge/Blind_75_LeetCode-Solutions-blue?labelColor=red)
-
-This repository contains a curated list of 75 LeetCode problems that are commonly known as the "Blind 75." These problems cover a wide range of data structures and algorithms and are frequently asked in technical interviews. Solving these problems can help you build a strong foundation in algorithmic problem-solving.
-
-## Problem List
-
-### Array & Hashing
-![Array & Hashing](https://img.shields.io/badge/Array_&_Hashing-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                        | Easy       |
-| [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)                                  | Easy       |
-| [1. Two Sum](https://leetcode.com/problems/two-sum/)                                              | Easy       |
-| [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/)                                | Medium     |
-| [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)              | Medium     |
-| [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)    | Medium     |
-| [659. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)          | Medium     |
-| [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)    | Hard       |
-
-### Two Pointers
-![Array & Hashing](https://img.shields.io/badge/Two_Pointers-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)                            | Easy       |
-| [15. 3Sum](https://leetcode.com/problems/3sum/)                                                       | Medium     |
-| [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)           | Medium     |
-
-### Sliding Window
-![Array & Hashing](https://img.shields.io/badge/Sliding_Window-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [121. Best Time to Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy       |
-| [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
-| [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium |
-| [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)             | Hard       |
-
-### Stack
-![Array & Hashing](https://img.shields.io/badge/Stack-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                            | Easy       |
-
-### Binary Search
-![Array & Hashing](https://img.shields.io/badge/Binary_Search-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [153. Find Minimum In Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium |
-| [33. Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)   | Medium     |
-
-### Linked List
-![Array & Hashing](https://img.shields.io/badge/Linked_List-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)                       | Easy       |
-| [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                   | Easy       |
-| [143. Reorder List](https://leetcode.com/problems/reorder-list/)                                     | Medium     |
-| [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium |
-| [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)                           | Medium     |
-| [23. Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                       | Hard       |
-
-### Trees
-![Array & Hashing](https://img.shields.io/badge/Trees-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                          | Easy       |
-| [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)     | Easy       |
-| [100. Same Tree](https://leetcode.com/problems/same-tree/)                                           | Easy       |
-| [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)               | Easy       |
-| [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy |
-| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium |
-| [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)       | Medium     |
-| [230. Kth Smallest Element In a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)   | Medium     |
-| [105. Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium |
-| [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)     | Hard       |
-| [297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard |
-
-### Tries
-![Array & Hashing](https://img.shields.io/badge/Tries-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [208. Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)         | Medium     |
-| [211. Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium |
-| [212. Word Search II](https://leetcode.com/problems/word-search-ii/)                                 | Hard       |
-
-### Heap / Priority Queue
-![Array & Hashing](https://img.shields.io/badge/Heap_/_Priority_Queue-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [295. Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)     | Hard       |
-
-### Backtracking
-![Array & Hashing](https://img.shields.io/badge/Backtracking-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [39. Combination Sum](https://leetcode.com/problems/combination-sum/)                                 | Medium     |
-| [79. Word Search](https://leetcode.com/problems/word-search/)                                         | Medium     |
-
-### Graphs
-![Array & Hashing](https://img.shields.io/badge/Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)                           | Medium     |
-| [133. Clone Graph](https://leetcode.com/problems/clone-graph/)                                       | Medium     |
-| [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)       | Medium     |
-| [207. Course Schedule](https://leetcode.com/problems/course-schedule/)                                 | Medium     |
-| [323. Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium |
-| [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)                               | Medium     |
-
-### Advanced Graphs
-![Array & Hashing](https://img.shields.io/badge/Advanced_Graphs-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)                               | Hard       |
-
-### 1-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/1_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                   | Easy       |
-| [198. House Robber](https://leetcode.com/problems/house-robber/)                                       | Easy       |
-| [213. House Robber II](https://leetcode.com/problems/house-robber-ii/)                                 | Medium     |
-| [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)       | Medium     |
-| [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)                   | Medium     |
-| [91. Decode Ways](https://leetcode.com/problems/decode-ways/)                                         | Medium     |
-| [322. Coin Change](https://leetcode.com/problems/coin-change/)                                         | Medium     |
-| [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)             | Medium     |
-| [139. Word Break](https://leetcode.com/problems/word-break/)                                           | Medium     |
-| [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium     |
-
-### 2-D Dynamic Programming
-![Array & Hashing](https://img.shields.io/badge/2_D_Dynamic_Programming-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [62. Unique Paths](https://leetcode.com/problems/unique-paths/)                                         | Medium     |
-| [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)       | Medium     |
-
-### Greedy
-![Array & Hashing](https://img.shields.io/badge/Greedy-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                   | Easy       |
-| [55. Jump Game](https://leetcode.com/problems/jump-game/)                                                 | Medium     |
-
-### Intervals
-![Array & Hashing](https://img.shields.io/badge/Intervals-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [57. Insert Interval](https://leetcode.com/problems/insert-interval/)                                     | Hard       |
-| [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                   | Medium     |
-| [435. Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)             | Medium     |
-| [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)                                       | Easy       |
-| [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)                                 | Medium     |
-
-### Math & Geometry
-![Array & Hashing](https://img.shields.io/badge/Math_&_Geometry-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [48. Rotate Image](https://leetcode.com/problems/rotate-image/)                                           | Medium     |
-| [54. Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                         | Medium     |
-| [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                               | Medium     |
-
-### Bit Manipulation
-![Array & Hashing](https://img.shields.io/badge/Bit_Manipulation-Solutions-blue?labelColor=red)
-| Problem Name                                    | Difficulty |
-| ----------------------------------------------- | ---------- |
-| [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)                                   | Easy       |
-| [338. Counting Bits](https://leetcode.com/problems/counting-bits/)                                         | Medium     |
-| [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/)                                           | Easy       |
-| [268. Missing Number](https://leetcode.com/problems/missing-number/)                                       | Easy       |
-| [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)                             | Medium     |
-
-
-## How to Use
-
-1. Clone or download this repository to your local machine.
-
-```bash
-git clone https://github.com/mohsentabibian/LeetCode-Solutions/Blind-75-LeetCode.git
-```
-
-2. Navigate to the directory of the specific problem you want to solve.
-
-```bash
-cd Blind-75-LeetCode/Problem-Directory
-```
-
-3. Open the problem's directory to find its description, code template, and solution(s).
-
-4. Solve the problem using your preferred programming language.
-
-5. Check the solution(s) provided in the directory for reference and to compare your solution.
-
-## Contribute
-
-If you have a better solution or want to add more problems to the collection, feel free to contribute. You can create a pull request or open an issue to discuss additions or improvements.
-
-## Resources
-
-- [LeetCode](https://leetcode.com/): The official LeetCode website.
-- [LeetCode Discuss](https://leetcode.com/discuss/): LeetCode's discussion forum for each problem. You can find helpful hints and discussions here.
-
-## Disclaimer
-
-This repository is meant for educational purposes and to help individuals prepare for technical interviews. Please respect LeetCode's terms of use and guidelines when using this repository.
-
-## Code of Conduct
-
-We have a [Code of Conduct](CODE_OF_CONDUCT.md) that we expect all contributors to adhere to. By participating in this project, you agree to follow this code.
-
-## Security Policy
-
-We take security seriously. Please review our [Security Policy](SECURITY.md) for information on reporting security vulnerabilities.
-
-Happy coding!
diff --git a/docs/_build/html/_sources/SECURITY.md b/docs/_build/html/_sources/SECURITY.md
deleted file mode 100644
index 7c19993..0000000
--- a/docs/_build/html/_sources/SECURITY.md
+++ /dev/null
@@ -1,42 +0,0 @@
-# Security Policy
-
-## Reporting a Vulnerability
-
-We take the security of the Blind 75 LeetCode repository seriously. If you believe you have found a security vulnerability, please help us by following these steps:
-
-1. **Do Not Disclose Publicly**: Please do not disclose the issue publicly until it has been addressed by our team.
-
-2. **Report Privately**: Create a GitHub issue with the title "Security Vulnerability Report" and provide a detailed description of the vulnerability. You can use a sample report template as follows:
-
-    ```
-    **Description**
-    A clear and concise description of the security vulnerability.
-
-    **Steps to Reproduce**
-    Provide detailed steps on how to reproduce the vulnerability.
-
-    **Expected Behavior**
-    Describe what you expected to happen.
-
-    **Actual Behavior**
-    Describe what actually happened.
-
-    **Additional Information**
-    Any additional information that can help us understand and reproduce the issue, such as environment details, configuration, or screenshots.
-    ```
-
-3. **Secure Communication**: If the vulnerability involves sensitive data, please encrypt your communication with our PGP key. Contact us for our PGP key information.
-
-4. **Response**: We will acknowledge your report within 5 business days and provide an estimated timeline for the resolution.
-
-5. **Fix and Disclosure**: We will work to fix the issue promptly and privately. Once resolved, we will provide a security advisory and give credit to the reporter if desired.
-
-6. **Responsible Disclosure**: We encourage responsible disclosure. Please do not take advantage of the vulnerability or attempt to exploit it for malicious purposes.
-
-## Security Updates
-
-We are committed to promptly addressing and resolving any security issues. We recommend that you stay up-to-date with the latest releases of this repository, as they may include security updates and fixes.
-
-## Contact
-
-If you have any questions or need further assistance regarding security, you can contact us at mohsentabibian@gmail.com.
diff --git a/docs/_build/html/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css b/docs/_build/html/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
deleted file mode 100644
index 3225661..0000000
--- a/docs/_build/html/_sphinx_design_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
+++ /dev/null
@@ -1 +0,0 @@
-.sd-bg-primary{background-color:var(--sd-color-primary) !important}.sd-bg-text-primary{color:var(--sd-color-primary-text) !important}button.sd-bg-primary:focus,button.sd-bg-primary:hover{background-color:var(--sd-color-primary-highlight) !important}a.sd-bg-primary:focus,a.sd-bg-primary:hover{background-color:var(--sd-color-primary-highlight) !important}.sd-bg-secondary{background-color:var(--sd-color-secondary) !important}.sd-bg-text-secondary{color:var(--sd-color-secondary-text) !important}button.sd-bg-secondary:focus,button.sd-bg-secondary:hover{background-color:var(--sd-color-secondary-highlight) !important}a.sd-bg-secondary:focus,a.sd-bg-secondary:hover{background-color:var(--sd-color-secondary-highlight) !important}.sd-bg-success{background-color:var(--sd-color-success) !important}.sd-bg-text-success{color:var(--sd-color-success-text) !important}button.sd-bg-success:focus,button.sd-bg-success:hover{background-color:var(--sd-color-success-highlight) !important}a.sd-bg-success:focus,a.sd-bg-success:hover{background-color:var(--sd-color-success-highlight) !important}.sd-bg-info{background-color:var(--sd-color-info) !important}.sd-bg-text-info{color:var(--sd-color-info-text) !important}button.sd-bg-info:focus,button.sd-bg-info:hover{background-color:var(--sd-color-info-highlight) !important}a.sd-bg-info:focus,a.sd-bg-info:hover{background-color:var(--sd-color-info-highlight) !important}.sd-bg-warning{background-color:var(--sd-color-warning) !important}.sd-bg-text-warning{color:var(--sd-color-warning-text) !important}button.sd-bg-warning:focus,button.sd-bg-warning:hover{background-color:var(--sd-color-warning-highlight) !important}a.sd-bg-warning:focus,a.sd-bg-warning:hover{background-color:var(--sd-color-warning-highlight) !important}.sd-bg-danger{background-color:var(--sd-color-danger) !important}.sd-bg-text-danger{color:var(--sd-color-danger-text) !important}button.sd-bg-danger:focus,button.sd-bg-danger:hover{background-color:var(--sd-color-danger-highlight) !important}a.sd-bg-danger:focus,a.sd-bg-danger:hover{background-color:var(--sd-color-danger-highlight) !important}.sd-bg-light{background-color:var(--sd-color-light) !important}.sd-bg-text-light{color:var(--sd-color-light-text) !important}button.sd-bg-light:focus,button.sd-bg-light:hover{background-color:var(--sd-color-light-highlight) !important}a.sd-bg-light:focus,a.sd-bg-light:hover{background-color:var(--sd-color-light-highlight) !important}.sd-bg-muted{background-color:var(--sd-color-muted) !important}.sd-bg-text-muted{color:var(--sd-color-muted-text) !important}button.sd-bg-muted:focus,button.sd-bg-muted:hover{background-color:var(--sd-color-muted-highlight) !important}a.sd-bg-muted:focus,a.sd-bg-muted:hover{background-color:var(--sd-color-muted-highlight) !important}.sd-bg-dark{background-color:var(--sd-color-dark) !important}.sd-bg-text-dark{color:var(--sd-color-dark-text) !important}button.sd-bg-dark:focus,button.sd-bg-dark:hover{background-color:var(--sd-color-dark-highlight) !important}a.sd-bg-dark:focus,a.sd-bg-dark:hover{background-color:var(--sd-color-dark-highlight) !important}.sd-bg-black{background-color:var(--sd-color-black) !important}.sd-bg-text-black{color:var(--sd-color-black-text) !important}button.sd-bg-black:focus,button.sd-bg-black:hover{background-color:var(--sd-color-black-highlight) !important}a.sd-bg-black:focus,a.sd-bg-black:hover{background-color:var(--sd-color-black-highlight) !important}.sd-bg-white{background-color:var(--sd-color-white) !important}.sd-bg-text-white{color:var(--sd-color-white-text) !important}button.sd-bg-white:focus,button.sd-bg-white:hover{background-color:var(--sd-color-white-highlight) !important}a.sd-bg-white:focus,a.sd-bg-white:hover{background-color:var(--sd-color-white-highlight) !important}.sd-text-primary,.sd-text-primary>p{color:var(--sd-color-primary) !important}a.sd-text-primary:focus,a.sd-text-primary:hover{color:var(--sd-color-primary-highlight) !important}.sd-text-secondary,.sd-text-secondary>p{color:var(--sd-color-secondary) !important}a.sd-text-secondary:focus,a.sd-text-secondary:hover{color:var(--sd-color-secondary-highlight) !important}.sd-text-success,.sd-text-success>p{color:var(--sd-color-success) !important}a.sd-text-success:focus,a.sd-text-success:hover{color:var(--sd-color-success-highlight) !important}.sd-text-info,.sd-text-info>p{color:var(--sd-color-info) !important}a.sd-text-info:focus,a.sd-text-info:hover{color:var(--sd-color-info-highlight) !important}.sd-text-warning,.sd-text-warning>p{color:var(--sd-color-warning) !important}a.sd-text-warning:focus,a.sd-text-warning:hover{color:var(--sd-color-warning-highlight) !important}.sd-text-danger,.sd-text-danger>p{color:var(--sd-color-danger) !important}a.sd-text-danger:focus,a.sd-text-danger:hover{color:var(--sd-color-danger-highlight) !important}.sd-text-light,.sd-text-light>p{color:var(--sd-color-light) !important}a.sd-text-light:focus,a.sd-text-light:hover{color:var(--sd-color-light-highlight) !important}.sd-text-muted,.sd-text-muted>p{color:var(--sd-color-muted) !important}a.sd-text-muted:focus,a.sd-text-muted:hover{color:var(--sd-color-muted-highlight) !important}.sd-text-dark,.sd-text-dark>p{color:var(--sd-color-dark) !important}a.sd-text-dark:focus,a.sd-text-dark:hover{color:var(--sd-color-dark-highlight) !important}.sd-text-black,.sd-text-black>p{color:var(--sd-color-black) !important}a.sd-text-black:focus,a.sd-text-black:hover{color:var(--sd-color-black-highlight) !important}.sd-text-white,.sd-text-white>p{color:var(--sd-color-white) !important}a.sd-text-white:focus,a.sd-text-white:hover{color:var(--sd-color-white-highlight) !important}.sd-outline-primary{border-color:var(--sd-color-primary) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-primary:focus,a.sd-outline-primary:hover{border-color:var(--sd-color-primary-highlight) !important}.sd-outline-secondary{border-color:var(--sd-color-secondary) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-secondary:focus,a.sd-outline-secondary:hover{border-color:var(--sd-color-secondary-highlight) !important}.sd-outline-success{border-color:var(--sd-color-success) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-success:focus,a.sd-outline-success:hover{border-color:var(--sd-color-success-highlight) !important}.sd-outline-info{border-color:var(--sd-color-info) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-info:focus,a.sd-outline-info:hover{border-color:var(--sd-color-info-highlight) !important}.sd-outline-warning{border-color:var(--sd-color-warning) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-warning:focus,a.sd-outline-warning:hover{border-color:var(--sd-color-warning-highlight) !important}.sd-outline-danger{border-color:var(--sd-color-danger) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-danger:focus,a.sd-outline-danger:hover{border-color:var(--sd-color-danger-highlight) !important}.sd-outline-light{border-color:var(--sd-color-light) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-light:focus,a.sd-outline-light:hover{border-color:var(--sd-color-light-highlight) !important}.sd-outline-muted{border-color:var(--sd-color-muted) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-muted:focus,a.sd-outline-muted:hover{border-color:var(--sd-color-muted-highlight) !important}.sd-outline-dark{border-color:var(--sd-color-dark) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-dark:focus,a.sd-outline-dark:hover{border-color:var(--sd-color-dark-highlight) !important}.sd-outline-black{border-color:var(--sd-color-black) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-black:focus,a.sd-outline-black:hover{border-color:var(--sd-color-black-highlight) !important}.sd-outline-white{border-color:var(--sd-color-white) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-white:focus,a.sd-outline-white:hover{border-color:var(--sd-color-white-highlight) !important}.sd-bg-transparent{background-color:transparent !important}.sd-outline-transparent{border-color:transparent !important}.sd-text-transparent{color:transparent !important}.sd-p-0{padding:0 !important}.sd-pt-0,.sd-py-0{padding-top:0 !important}.sd-pr-0,.sd-px-0{padding-right:0 !important}.sd-pb-0,.sd-py-0{padding-bottom:0 !important}.sd-pl-0,.sd-px-0{padding-left:0 !important}.sd-p-1{padding:.25rem !important}.sd-pt-1,.sd-py-1{padding-top:.25rem !important}.sd-pr-1,.sd-px-1{padding-right:.25rem !important}.sd-pb-1,.sd-py-1{padding-bottom:.25rem !important}.sd-pl-1,.sd-px-1{padding-left:.25rem !important}.sd-p-2{padding:.5rem !important}.sd-pt-2,.sd-py-2{padding-top:.5rem !important}.sd-pr-2,.sd-px-2{padding-right:.5rem !important}.sd-pb-2,.sd-py-2{padding-bottom:.5rem !important}.sd-pl-2,.sd-px-2{padding-left:.5rem !important}.sd-p-3{padding:1rem !important}.sd-pt-3,.sd-py-3{padding-top:1rem !important}.sd-pr-3,.sd-px-3{padding-right:1rem !important}.sd-pb-3,.sd-py-3{padding-bottom:1rem !important}.sd-pl-3,.sd-px-3{padding-left:1rem !important}.sd-p-4{padding:1.5rem !important}.sd-pt-4,.sd-py-4{padding-top:1.5rem !important}.sd-pr-4,.sd-px-4{padding-right:1.5rem !important}.sd-pb-4,.sd-py-4{padding-bottom:1.5rem !important}.sd-pl-4,.sd-px-4{padding-left:1.5rem !important}.sd-p-5{padding:3rem !important}.sd-pt-5,.sd-py-5{padding-top:3rem !important}.sd-pr-5,.sd-px-5{padding-right:3rem !important}.sd-pb-5,.sd-py-5{padding-bottom:3rem !important}.sd-pl-5,.sd-px-5{padding-left:3rem !important}.sd-m-auto{margin:auto !important}.sd-mt-auto,.sd-my-auto{margin-top:auto !important}.sd-mr-auto,.sd-mx-auto{margin-right:auto !important}.sd-mb-auto,.sd-my-auto{margin-bottom:auto !important}.sd-ml-auto,.sd-mx-auto{margin-left:auto !important}.sd-m-0{margin:0 !important}.sd-mt-0,.sd-my-0{margin-top:0 !important}.sd-mr-0,.sd-mx-0{margin-right:0 !important}.sd-mb-0,.sd-my-0{margin-bottom:0 !important}.sd-ml-0,.sd-mx-0{margin-left:0 !important}.sd-m-1{margin:.25rem !important}.sd-mt-1,.sd-my-1{margin-top:.25rem !important}.sd-mr-1,.sd-mx-1{margin-right:.25rem !important}.sd-mb-1,.sd-my-1{margin-bottom:.25rem !important}.sd-ml-1,.sd-mx-1{margin-left:.25rem !important}.sd-m-2{margin:.5rem !important}.sd-mt-2,.sd-my-2{margin-top:.5rem !important}.sd-mr-2,.sd-mx-2{margin-right:.5rem !important}.sd-mb-2,.sd-my-2{margin-bottom:.5rem !important}.sd-ml-2,.sd-mx-2{margin-left:.5rem !important}.sd-m-3{margin:1rem !important}.sd-mt-3,.sd-my-3{margin-top:1rem !important}.sd-mr-3,.sd-mx-3{margin-right:1rem !important}.sd-mb-3,.sd-my-3{margin-bottom:1rem !important}.sd-ml-3,.sd-mx-3{margin-left:1rem !important}.sd-m-4{margin:1.5rem !important}.sd-mt-4,.sd-my-4{margin-top:1.5rem !important}.sd-mr-4,.sd-mx-4{margin-right:1.5rem !important}.sd-mb-4,.sd-my-4{margin-bottom:1.5rem !important}.sd-ml-4,.sd-mx-4{margin-left:1.5rem !important}.sd-m-5{margin:3rem !important}.sd-mt-5,.sd-my-5{margin-top:3rem !important}.sd-mr-5,.sd-mx-5{margin-right:3rem !important}.sd-mb-5,.sd-my-5{margin-bottom:3rem !important}.sd-ml-5,.sd-mx-5{margin-left:3rem !important}.sd-w-25{width:25% !important}.sd-w-50{width:50% !important}.sd-w-75{width:75% !important}.sd-w-100{width:100% !important}.sd-w-auto{width:auto !important}.sd-h-25{height:25% !important}.sd-h-50{height:50% !important}.sd-h-75{height:75% !important}.sd-h-100{height:100% !important}.sd-h-auto{height:auto !important}.sd-d-none{display:none !important}.sd-d-inline{display:inline !important}.sd-d-inline-block{display:inline-block !important}.sd-d-block{display:block !important}.sd-d-grid{display:grid !important}.sd-d-flex-row{display:-ms-flexbox !important;display:flex !important;flex-direction:row !important}.sd-d-flex-column{display:-ms-flexbox !important;display:flex !important;flex-direction:column !important}.sd-d-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}@media(min-width: 576px){.sd-d-sm-none{display:none !important}.sd-d-sm-inline{display:inline !important}.sd-d-sm-inline-block{display:inline-block !important}.sd-d-sm-block{display:block !important}.sd-d-sm-grid{display:grid !important}.sd-d-sm-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-sm-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 768px){.sd-d-md-none{display:none !important}.sd-d-md-inline{display:inline !important}.sd-d-md-inline-block{display:inline-block !important}.sd-d-md-block{display:block !important}.sd-d-md-grid{display:grid !important}.sd-d-md-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-md-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 992px){.sd-d-lg-none{display:none !important}.sd-d-lg-inline{display:inline !important}.sd-d-lg-inline-block{display:inline-block !important}.sd-d-lg-block{display:block !important}.sd-d-lg-grid{display:grid !important}.sd-d-lg-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-lg-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 1200px){.sd-d-xl-none{display:none !important}.sd-d-xl-inline{display:inline !important}.sd-d-xl-inline-block{display:inline-block !important}.sd-d-xl-block{display:block !important}.sd-d-xl-grid{display:grid !important}.sd-d-xl-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-xl-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}.sd-align-major-start{justify-content:flex-start !important}.sd-align-major-end{justify-content:flex-end !important}.sd-align-major-center{justify-content:center !important}.sd-align-major-justify{justify-content:space-between !important}.sd-align-major-spaced{justify-content:space-evenly !important}.sd-align-minor-start{align-items:flex-start !important}.sd-align-minor-end{align-items:flex-end !important}.sd-align-minor-center{align-items:center !important}.sd-align-minor-stretch{align-items:stretch !important}.sd-text-justify{text-align:justify !important}.sd-text-left{text-align:left !important}.sd-text-right{text-align:right !important}.sd-text-center{text-align:center !important}.sd-font-weight-light{font-weight:300 !important}.sd-font-weight-lighter{font-weight:lighter !important}.sd-font-weight-normal{font-weight:400 !important}.sd-font-weight-bold{font-weight:700 !important}.sd-font-weight-bolder{font-weight:bolder !important}.sd-font-italic{font-style:italic !important}.sd-text-decoration-none{text-decoration:none !important}.sd-text-lowercase{text-transform:lowercase !important}.sd-text-uppercase{text-transform:uppercase !important}.sd-text-capitalize{text-transform:capitalize !important}.sd-text-wrap{white-space:normal !important}.sd-text-nowrap{white-space:nowrap !important}.sd-text-truncate{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.sd-fs-1,.sd-fs-1>p{font-size:calc(1.375rem + 1.5vw) !important;line-height:unset !important}.sd-fs-2,.sd-fs-2>p{font-size:calc(1.325rem + 0.9vw) !important;line-height:unset !important}.sd-fs-3,.sd-fs-3>p{font-size:calc(1.3rem + 0.6vw) !important;line-height:unset !important}.sd-fs-4,.sd-fs-4>p{font-size:calc(1.275rem + 0.3vw) !important;line-height:unset !important}.sd-fs-5,.sd-fs-5>p{font-size:1.25rem !important;line-height:unset !important}.sd-fs-6,.sd-fs-6>p{font-size:1rem !important;line-height:unset !important}.sd-border-0{border:0 solid !important}.sd-border-top-0{border-top:0 solid !important}.sd-border-bottom-0{border-bottom:0 solid !important}.sd-border-right-0{border-right:0 solid !important}.sd-border-left-0{border-left:0 solid !important}.sd-border-1{border:1px solid !important}.sd-border-top-1{border-top:1px solid !important}.sd-border-bottom-1{border-bottom:1px solid !important}.sd-border-right-1{border-right:1px solid !important}.sd-border-left-1{border-left:1px solid !important}.sd-border-2{border:2px solid !important}.sd-border-top-2{border-top:2px solid !important}.sd-border-bottom-2{border-bottom:2px solid !important}.sd-border-right-2{border-right:2px solid !important}.sd-border-left-2{border-left:2px solid !important}.sd-border-3{border:3px solid !important}.sd-border-top-3{border-top:3px solid !important}.sd-border-bottom-3{border-bottom:3px solid !important}.sd-border-right-3{border-right:3px solid !important}.sd-border-left-3{border-left:3px solid !important}.sd-border-4{border:4px solid !important}.sd-border-top-4{border-top:4px solid !important}.sd-border-bottom-4{border-bottom:4px solid !important}.sd-border-right-4{border-right:4px solid !important}.sd-border-left-4{border-left:4px solid !important}.sd-border-5{border:5px solid !important}.sd-border-top-5{border-top:5px solid !important}.sd-border-bottom-5{border-bottom:5px solid !important}.sd-border-right-5{border-right:5px solid !important}.sd-border-left-5{border-left:5px solid !important}.sd-rounded-0{border-radius:0 !important}.sd-rounded-1{border-radius:.2rem !important}.sd-rounded-2{border-radius:.3rem !important}.sd-rounded-3{border-radius:.5rem !important}.sd-rounded-pill{border-radius:50rem !important}.sd-rounded-circle{border-radius:50% !important}.shadow-none{box-shadow:none !important}.sd-shadow-sm{box-shadow:0 .125rem .25rem var(--sd-color-shadow) !important}.sd-shadow-md{box-shadow:0 .5rem 1rem var(--sd-color-shadow) !important}.sd-shadow-lg{box-shadow:0 1rem 3rem var(--sd-color-shadow) !important}@keyframes sd-slide-from-left{0%{transform:translateX(-100%)}100%{transform:translateX(0)}}@keyframes sd-slide-from-right{0%{transform:translateX(200%)}100%{transform:translateX(0)}}@keyframes sd-grow100{0%{transform:scale(0);opacity:.5}100%{transform:scale(1);opacity:1}}@keyframes sd-grow50{0%{transform:scale(0.5);opacity:.5}100%{transform:scale(1);opacity:1}}@keyframes sd-grow50-rot20{0%{transform:scale(0.5) rotateZ(-20deg);opacity:.5}75%{transform:scale(1) rotateZ(5deg);opacity:1}95%{transform:scale(1) rotateZ(-1deg);opacity:1}100%{transform:scale(1) rotateZ(0);opacity:1}}.sd-animate-slide-from-left{animation:1s ease-out 0s 1 normal none running sd-slide-from-left}.sd-animate-slide-from-right{animation:1s ease-out 0s 1 normal none running sd-slide-from-right}.sd-animate-grow100{animation:1s ease-out 0s 1 normal none running sd-grow100}.sd-animate-grow50{animation:1s ease-out 0s 1 normal none running sd-grow50}.sd-animate-grow50-rot20{animation:1s ease-out 0s 1 normal none running sd-grow50-rot20}.sd-badge{display:inline-block;padding:.35em .65em;font-size:.75em;font-weight:700;line-height:1;text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:.25rem}.sd-badge:empty{display:none}a.sd-badge{text-decoration:none}.sd-btn .sd-badge{position:relative;top:-1px}.sd-btn{background-color:transparent;border:1px solid transparent;border-radius:.25rem;cursor:pointer;display:inline-block;font-weight:400;font-size:1rem;line-height:1.5;padding:.375rem .75rem;text-align:center;text-decoration:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;vertical-align:middle;user-select:none;-moz-user-select:none;-ms-user-select:none;-webkit-user-select:none}.sd-btn:hover{text-decoration:none}@media(prefers-reduced-motion: reduce){.sd-btn{transition:none}}.sd-btn-primary,.sd-btn-outline-primary:hover,.sd-btn-outline-primary:focus{color:var(--sd-color-primary-text) !important;background-color:var(--sd-color-primary) !important;border-color:var(--sd-color-primary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-primary:hover,.sd-btn-primary:focus{color:var(--sd-color-primary-text) !important;background-color:var(--sd-color-primary-highlight) !important;border-color:var(--sd-color-primary-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-primary{color:var(--sd-color-primary) !important;border-color:var(--sd-color-primary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-secondary,.sd-btn-outline-secondary:hover,.sd-btn-outline-secondary:focus{color:var(--sd-color-secondary-text) !important;background-color:var(--sd-color-secondary) !important;border-color:var(--sd-color-secondary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-secondary:hover,.sd-btn-secondary:focus{color:var(--sd-color-secondary-text) !important;background-color:var(--sd-color-secondary-highlight) !important;border-color:var(--sd-color-secondary-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-secondary{color:var(--sd-color-secondary) !important;border-color:var(--sd-color-secondary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-success,.sd-btn-outline-success:hover,.sd-btn-outline-success:focus{color:var(--sd-color-success-text) !important;background-color:var(--sd-color-success) !important;border-color:var(--sd-color-success) !important;border-width:1px !important;border-style:solid !important}.sd-btn-success:hover,.sd-btn-success:focus{color:var(--sd-color-success-text) !important;background-color:var(--sd-color-success-highlight) !important;border-color:var(--sd-color-success-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-success{color:var(--sd-color-success) !important;border-color:var(--sd-color-success) !important;border-width:1px !important;border-style:solid !important}.sd-btn-info,.sd-btn-outline-info:hover,.sd-btn-outline-info:focus{color:var(--sd-color-info-text) !important;background-color:var(--sd-color-info) !important;border-color:var(--sd-color-info) !important;border-width:1px !important;border-style:solid !important}.sd-btn-info:hover,.sd-btn-info:focus{color:var(--sd-color-info-text) !important;background-color:var(--sd-color-info-highlight) !important;border-color:var(--sd-color-info-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-info{color:var(--sd-color-info) !important;border-color:var(--sd-color-info) !important;border-width:1px !important;border-style:solid !important}.sd-btn-warning,.sd-btn-outline-warning:hover,.sd-btn-outline-warning:focus{color:var(--sd-color-warning-text) !important;background-color:var(--sd-color-warning) !important;border-color:var(--sd-color-warning) !important;border-width:1px !important;border-style:solid !important}.sd-btn-warning:hover,.sd-btn-warning:focus{color:var(--sd-color-warning-text) !important;background-color:var(--sd-color-warning-highlight) !important;border-color:var(--sd-color-warning-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-warning{color:var(--sd-color-warning) !important;border-color:var(--sd-color-warning) !important;border-width:1px !important;border-style:solid !important}.sd-btn-danger,.sd-btn-outline-danger:hover,.sd-btn-outline-danger:focus{color:var(--sd-color-danger-text) !important;background-color:var(--sd-color-danger) !important;border-color:var(--sd-color-danger) !important;border-width:1px !important;border-style:solid !important}.sd-btn-danger:hover,.sd-btn-danger:focus{color:var(--sd-color-danger-text) !important;background-color:var(--sd-color-danger-highlight) !important;border-color:var(--sd-color-danger-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-danger{color:var(--sd-color-danger) !important;border-color:var(--sd-color-danger) !important;border-width:1px !important;border-style:solid !important}.sd-btn-light,.sd-btn-outline-light:hover,.sd-btn-outline-light:focus{color:var(--sd-color-light-text) !important;background-color:var(--sd-color-light) !important;border-color:var(--sd-color-light) !important;border-width:1px !important;border-style:solid !important}.sd-btn-light:hover,.sd-btn-light:focus{color:var(--sd-color-light-text) !important;background-color:var(--sd-color-light-highlight) !important;border-color:var(--sd-color-light-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-light{color:var(--sd-color-light) !important;border-color:var(--sd-color-light) !important;border-width:1px !important;border-style:solid !important}.sd-btn-muted,.sd-btn-outline-muted:hover,.sd-btn-outline-muted:focus{color:var(--sd-color-muted-text) !important;background-color:var(--sd-color-muted) !important;border-color:var(--sd-color-muted) !important;border-width:1px !important;border-style:solid !important}.sd-btn-muted:hover,.sd-btn-muted:focus{color:var(--sd-color-muted-text) !important;background-color:var(--sd-color-muted-highlight) !important;border-color:var(--sd-color-muted-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-muted{color:var(--sd-color-muted) !important;border-color:var(--sd-color-muted) !important;border-width:1px !important;border-style:solid !important}.sd-btn-dark,.sd-btn-outline-dark:hover,.sd-btn-outline-dark:focus{color:var(--sd-color-dark-text) !important;background-color:var(--sd-color-dark) !important;border-color:var(--sd-color-dark) !important;border-width:1px !important;border-style:solid !important}.sd-btn-dark:hover,.sd-btn-dark:focus{color:var(--sd-color-dark-text) !important;background-color:var(--sd-color-dark-highlight) !important;border-color:var(--sd-color-dark-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-dark{color:var(--sd-color-dark) !important;border-color:var(--sd-color-dark) !important;border-width:1px !important;border-style:solid !important}.sd-btn-black,.sd-btn-outline-black:hover,.sd-btn-outline-black:focus{color:var(--sd-color-black-text) !important;background-color:var(--sd-color-black) !important;border-color:var(--sd-color-black) !important;border-width:1px !important;border-style:solid !important}.sd-btn-black:hover,.sd-btn-black:focus{color:var(--sd-color-black-text) !important;background-color:var(--sd-color-black-highlight) !important;border-color:var(--sd-color-black-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-black{color:var(--sd-color-black) !important;border-color:var(--sd-color-black) !important;border-width:1px !important;border-style:solid !important}.sd-btn-white,.sd-btn-outline-white:hover,.sd-btn-outline-white:focus{color:var(--sd-color-white-text) !important;background-color:var(--sd-color-white) !important;border-color:var(--sd-color-white) !important;border-width:1px !important;border-style:solid !important}.sd-btn-white:hover,.sd-btn-white:focus{color:var(--sd-color-white-text) !important;background-color:var(--sd-color-white-highlight) !important;border-color:var(--sd-color-white-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-white{color:var(--sd-color-white) !important;border-color:var(--sd-color-white) !important;border-width:1px !important;border-style:solid !important}.sd-stretched-link::after{position:absolute;top:0;right:0;bottom:0;left:0;z-index:1;content:""}.sd-hide-link-text{font-size:0}.sd-octicon,.sd-material-icon{display:inline-block;fill:currentColor;vertical-align:middle}.sd-avatar-xs{border-radius:50%;object-fit:cover;object-position:center;width:1rem;height:1rem}.sd-avatar-sm{border-radius:50%;object-fit:cover;object-position:center;width:3rem;height:3rem}.sd-avatar-md{border-radius:50%;object-fit:cover;object-position:center;width:5rem;height:5rem}.sd-avatar-lg{border-radius:50%;object-fit:cover;object-position:center;width:7rem;height:7rem}.sd-avatar-xl{border-radius:50%;object-fit:cover;object-position:center;width:10rem;height:10rem}.sd-avatar-inherit{border-radius:50%;object-fit:cover;object-position:center;width:inherit;height:inherit}.sd-avatar-initial{border-radius:50%;object-fit:cover;object-position:center;width:initial;height:initial}.sd-card{background-clip:border-box;background-color:var(--sd-color-card-background);border:1px solid var(--sd-color-card-border);border-radius:.25rem;color:var(--sd-color-card-text);display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;min-width:0;position:relative;word-wrap:break-word}.sd-card>hr{margin-left:0;margin-right:0}.sd-card-hover:hover{border-color:var(--sd-color-card-border-hover);transform:scale(1.01)}.sd-card-body{-ms-flex:1 1 auto;flex:1 1 auto;padding:1rem 1rem}.sd-card-title{margin-bottom:.5rem}.sd-card-subtitle{margin-top:-0.25rem;margin-bottom:0}.sd-card-text:last-child{margin-bottom:0}.sd-card-link:hover{text-decoration:none}.sd-card-link+.card-link{margin-left:1rem}.sd-card-header{padding:.5rem 1rem;margin-bottom:0;background-color:var(--sd-color-card-header);border-bottom:1px solid var(--sd-color-card-border)}.sd-card-header:first-child{border-radius:calc(0.25rem - 1px) calc(0.25rem - 1px) 0 0}.sd-card-footer{padding:.5rem 1rem;background-color:var(--sd-color-card-footer);border-top:1px solid var(--sd-color-card-border)}.sd-card-footer:last-child{border-radius:0 0 calc(0.25rem - 1px) calc(0.25rem - 1px)}.sd-card-header-tabs{margin-right:-0.5rem;margin-bottom:-0.5rem;margin-left:-0.5rem;border-bottom:0}.sd-card-header-pills{margin-right:-0.5rem;margin-left:-0.5rem}.sd-card-img-overlay{position:absolute;top:0;right:0;bottom:0;left:0;padding:1rem;border-radius:calc(0.25rem - 1px)}.sd-card-img,.sd-card-img-bottom,.sd-card-img-top{width:100%}.sd-card-img,.sd-card-img-top{border-top-left-radius:calc(0.25rem - 1px);border-top-right-radius:calc(0.25rem - 1px)}.sd-card-img,.sd-card-img-bottom{border-bottom-left-radius:calc(0.25rem - 1px);border-bottom-right-radius:calc(0.25rem - 1px)}.sd-cards-carousel{width:100%;display:flex;flex-wrap:nowrap;-ms-flex-direction:row;flex-direction:row;overflow-x:hidden;scroll-snap-type:x mandatory}.sd-cards-carousel.sd-show-scrollbar{overflow-x:auto}.sd-cards-carousel:hover,.sd-cards-carousel:focus{overflow-x:auto}.sd-cards-carousel>.sd-card{flex-shrink:0;scroll-snap-align:start}.sd-cards-carousel>.sd-card:not(:last-child){margin-right:3px}.sd-card-cols-1>.sd-card{width:90%}.sd-card-cols-2>.sd-card{width:45%}.sd-card-cols-3>.sd-card{width:30%}.sd-card-cols-4>.sd-card{width:22.5%}.sd-card-cols-5>.sd-card{width:18%}.sd-card-cols-6>.sd-card{width:15%}.sd-card-cols-7>.sd-card{width:12.8571428571%}.sd-card-cols-8>.sd-card{width:11.25%}.sd-card-cols-9>.sd-card{width:10%}.sd-card-cols-10>.sd-card{width:9%}.sd-card-cols-11>.sd-card{width:8.1818181818%}.sd-card-cols-12>.sd-card{width:7.5%}.sd-container,.sd-container-fluid,.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container-xl{margin-left:auto;margin-right:auto;padding-left:var(--sd-gutter-x, 0.75rem);padding-right:var(--sd-gutter-x, 0.75rem);width:100%}@media(min-width: 576px){.sd-container-sm,.sd-container{max-width:540px}}@media(min-width: 768px){.sd-container-md,.sd-container-sm,.sd-container{max-width:720px}}@media(min-width: 992px){.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container{max-width:960px}}@media(min-width: 1200px){.sd-container-xl,.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container{max-width:1140px}}.sd-row{--sd-gutter-x: 1.5rem;--sd-gutter-y: 0;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;margin-top:calc(var(--sd-gutter-y) * -1);margin-right:calc(var(--sd-gutter-x) * -0.5);margin-left:calc(var(--sd-gutter-x) * -0.5)}.sd-row>*{box-sizing:border-box;flex-shrink:0;width:100%;max-width:100%;padding-right:calc(var(--sd-gutter-x) * 0.5);padding-left:calc(var(--sd-gutter-x) * 0.5);margin-top:var(--sd-gutter-y)}.sd-col{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-auto>*{flex:0 0 auto;width:auto}.sd-row-cols-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}@media(min-width: 576px){.sd-col-sm{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-sm-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-sm-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-sm-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-sm-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-sm-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-sm-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-sm-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-sm-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-sm-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-sm-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-sm-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-sm-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-sm-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 768px){.sd-col-md{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-md-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-md-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-md-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-md-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-md-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-md-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-md-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-md-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-md-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-md-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-md-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-md-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-md-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 992px){.sd-col-lg{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-lg-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-lg-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-lg-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-lg-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-lg-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-lg-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-lg-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-lg-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-lg-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-lg-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-lg-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-lg-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-lg-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 1200px){.sd-col-xl{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-xl-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-xl-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-xl-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-xl-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-xl-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-xl-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-xl-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-xl-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-xl-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-xl-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-xl-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-xl-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-xl-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}.sd-col-auto{flex:0 0 auto;-ms-flex:0 0 auto;width:auto}.sd-col-1{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}.sd-col-2{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-col-3{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-col-4{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-col-5{flex:0 0 auto;-ms-flex:0 0 auto;width:41.6666666667%}.sd-col-6{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-col-7{flex:0 0 auto;-ms-flex:0 0 auto;width:58.3333333333%}.sd-col-8{flex:0 0 auto;-ms-flex:0 0 auto;width:66.6666666667%}.sd-col-9{flex:0 0 auto;-ms-flex:0 0 auto;width:75%}.sd-col-10{flex:0 0 auto;-ms-flex:0 0 auto;width:83.3333333333%}.sd-col-11{flex:0 0 auto;-ms-flex:0 0 auto;width:91.6666666667%}.sd-col-12{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-g-0,.sd-gy-0{--sd-gutter-y: 0}.sd-g-0,.sd-gx-0{--sd-gutter-x: 0}.sd-g-1,.sd-gy-1{--sd-gutter-y: 0.25rem}.sd-g-1,.sd-gx-1{--sd-gutter-x: 0.25rem}.sd-g-2,.sd-gy-2{--sd-gutter-y: 0.5rem}.sd-g-2,.sd-gx-2{--sd-gutter-x: 0.5rem}.sd-g-3,.sd-gy-3{--sd-gutter-y: 1rem}.sd-g-3,.sd-gx-3{--sd-gutter-x: 1rem}.sd-g-4,.sd-gy-4{--sd-gutter-y: 1.5rem}.sd-g-4,.sd-gx-4{--sd-gutter-x: 1.5rem}.sd-g-5,.sd-gy-5{--sd-gutter-y: 3rem}.sd-g-5,.sd-gx-5{--sd-gutter-x: 3rem}@media(min-width: 576px){.sd-col-sm-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-sm-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-sm-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-sm-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-sm-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-sm-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-sm-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-sm-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-sm-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-sm-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-sm-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-sm-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-sm-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-sm-0,.sd-gy-sm-0{--sd-gutter-y: 0}.sd-g-sm-0,.sd-gx-sm-0{--sd-gutter-x: 0}.sd-g-sm-1,.sd-gy-sm-1{--sd-gutter-y: 0.25rem}.sd-g-sm-1,.sd-gx-sm-1{--sd-gutter-x: 0.25rem}.sd-g-sm-2,.sd-gy-sm-2{--sd-gutter-y: 0.5rem}.sd-g-sm-2,.sd-gx-sm-2{--sd-gutter-x: 0.5rem}.sd-g-sm-3,.sd-gy-sm-3{--sd-gutter-y: 1rem}.sd-g-sm-3,.sd-gx-sm-3{--sd-gutter-x: 1rem}.sd-g-sm-4,.sd-gy-sm-4{--sd-gutter-y: 1.5rem}.sd-g-sm-4,.sd-gx-sm-4{--sd-gutter-x: 1.5rem}.sd-g-sm-5,.sd-gy-sm-5{--sd-gutter-y: 3rem}.sd-g-sm-5,.sd-gx-sm-5{--sd-gutter-x: 3rem}}@media(min-width: 768px){.sd-col-md-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-md-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-md-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-md-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-md-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-md-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-md-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-md-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-md-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-md-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-md-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-md-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-md-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-md-0,.sd-gy-md-0{--sd-gutter-y: 0}.sd-g-md-0,.sd-gx-md-0{--sd-gutter-x: 0}.sd-g-md-1,.sd-gy-md-1{--sd-gutter-y: 0.25rem}.sd-g-md-1,.sd-gx-md-1{--sd-gutter-x: 0.25rem}.sd-g-md-2,.sd-gy-md-2{--sd-gutter-y: 0.5rem}.sd-g-md-2,.sd-gx-md-2{--sd-gutter-x: 0.5rem}.sd-g-md-3,.sd-gy-md-3{--sd-gutter-y: 1rem}.sd-g-md-3,.sd-gx-md-3{--sd-gutter-x: 1rem}.sd-g-md-4,.sd-gy-md-4{--sd-gutter-y: 1.5rem}.sd-g-md-4,.sd-gx-md-4{--sd-gutter-x: 1.5rem}.sd-g-md-5,.sd-gy-md-5{--sd-gutter-y: 3rem}.sd-g-md-5,.sd-gx-md-5{--sd-gutter-x: 3rem}}@media(min-width: 992px){.sd-col-lg-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-lg-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-lg-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-lg-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-lg-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-lg-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-lg-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-lg-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-lg-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-lg-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-lg-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-lg-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-lg-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-lg-0,.sd-gy-lg-0{--sd-gutter-y: 0}.sd-g-lg-0,.sd-gx-lg-0{--sd-gutter-x: 0}.sd-g-lg-1,.sd-gy-lg-1{--sd-gutter-y: 0.25rem}.sd-g-lg-1,.sd-gx-lg-1{--sd-gutter-x: 0.25rem}.sd-g-lg-2,.sd-gy-lg-2{--sd-gutter-y: 0.5rem}.sd-g-lg-2,.sd-gx-lg-2{--sd-gutter-x: 0.5rem}.sd-g-lg-3,.sd-gy-lg-3{--sd-gutter-y: 1rem}.sd-g-lg-3,.sd-gx-lg-3{--sd-gutter-x: 1rem}.sd-g-lg-4,.sd-gy-lg-4{--sd-gutter-y: 1.5rem}.sd-g-lg-4,.sd-gx-lg-4{--sd-gutter-x: 1.5rem}.sd-g-lg-5,.sd-gy-lg-5{--sd-gutter-y: 3rem}.sd-g-lg-5,.sd-gx-lg-5{--sd-gutter-x: 3rem}}@media(min-width: 1200px){.sd-col-xl-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-xl-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-xl-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-xl-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-xl-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-xl-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-xl-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-xl-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-xl-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-xl-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-xl-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-xl-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-xl-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-xl-0,.sd-gy-xl-0{--sd-gutter-y: 0}.sd-g-xl-0,.sd-gx-xl-0{--sd-gutter-x: 0}.sd-g-xl-1,.sd-gy-xl-1{--sd-gutter-y: 0.25rem}.sd-g-xl-1,.sd-gx-xl-1{--sd-gutter-x: 0.25rem}.sd-g-xl-2,.sd-gy-xl-2{--sd-gutter-y: 0.5rem}.sd-g-xl-2,.sd-gx-xl-2{--sd-gutter-x: 0.5rem}.sd-g-xl-3,.sd-gy-xl-3{--sd-gutter-y: 1rem}.sd-g-xl-3,.sd-gx-xl-3{--sd-gutter-x: 1rem}.sd-g-xl-4,.sd-gy-xl-4{--sd-gutter-y: 1.5rem}.sd-g-xl-4,.sd-gx-xl-4{--sd-gutter-x: 1.5rem}.sd-g-xl-5,.sd-gy-xl-5{--sd-gutter-y: 3rem}.sd-g-xl-5,.sd-gx-xl-5{--sd-gutter-x: 3rem}}.sd-flex-row-reverse{flex-direction:row-reverse !important}details.sd-dropdown{position:relative}details.sd-dropdown .sd-summary-title{font-weight:700;padding-right:3em !important;-moz-user-select:none;-ms-user-select:none;-webkit-user-select:none;user-select:none}details.sd-dropdown:hover{cursor:pointer}details.sd-dropdown .sd-summary-content{cursor:default}details.sd-dropdown summary{list-style:none;padding:1em}details.sd-dropdown summary .sd-octicon.no-title{vertical-align:middle}details.sd-dropdown[open] summary .sd-octicon.no-title{visibility:hidden}details.sd-dropdown summary::-webkit-details-marker{display:none}details.sd-dropdown summary:focus{outline:none}details.sd-dropdown .sd-summary-icon{margin-right:.5em}details.sd-dropdown .sd-summary-icon svg{opacity:.8}details.sd-dropdown summary:hover .sd-summary-up svg,details.sd-dropdown summary:hover .sd-summary-down svg{opacity:1;transform:scale(1.1)}details.sd-dropdown .sd-summary-up svg,details.sd-dropdown .sd-summary-down svg{display:block;opacity:.6}details.sd-dropdown .sd-summary-up,details.sd-dropdown .sd-summary-down{pointer-events:none;position:absolute;right:1em;top:1em}details.sd-dropdown[open]>.sd-summary-title .sd-summary-down{visibility:hidden}details.sd-dropdown:not([open])>.sd-summary-title .sd-summary-up{visibility:hidden}details.sd-dropdown:not([open]).sd-card{border:none}details.sd-dropdown:not([open])>.sd-card-header{border:1px solid var(--sd-color-card-border);border-radius:.25rem}details.sd-dropdown.sd-fade-in[open] summary~*{-moz-animation:sd-fade-in .5s ease-in-out;-webkit-animation:sd-fade-in .5s ease-in-out;animation:sd-fade-in .5s ease-in-out}details.sd-dropdown.sd-fade-in-slide-down[open] summary~*{-moz-animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out;-webkit-animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out;animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out}.sd-col>.sd-dropdown{width:100%}.sd-summary-content>.sd-tab-set:first-child{margin-top:0}@keyframes sd-fade-in{0%{opacity:0}100%{opacity:1}}@keyframes sd-slide-down{0%{transform:translate(0, -10px)}100%{transform:translate(0, 0)}}.sd-tab-set{border-radius:.125rem;display:flex;flex-wrap:wrap;margin:1em 0;position:relative}.sd-tab-set>input{opacity:0;position:absolute}.sd-tab-set>input:checked+label{border-color:var(--sd-color-tabs-underline-active);color:var(--sd-color-tabs-label-active)}.sd-tab-set>input:checked+label+.sd-tab-content{display:block}.sd-tab-set>input:not(:checked)+label:hover{color:var(--sd-color-tabs-label-hover);border-color:var(--sd-color-tabs-underline-hover)}.sd-tab-set>input:focus+label{outline-style:auto}.sd-tab-set>input:not(.focus-visible)+label{outline:none;-webkit-tap-highlight-color:transparent}.sd-tab-set>label{border-bottom:.125rem solid transparent;margin-bottom:0;color:var(--sd-color-tabs-label-inactive);border-color:var(--sd-color-tabs-underline-inactive);cursor:pointer;font-size:var(--sd-fontsize-tabs-label);font-weight:700;padding:1em 1.25em .5em;transition:color 250ms;width:auto;z-index:1}html .sd-tab-set>label:hover{color:var(--sd-color-tabs-label-active)}.sd-col>.sd-tab-set{width:100%}.sd-tab-content{box-shadow:0 -0.0625rem var(--sd-color-tabs-overline),0 .0625rem var(--sd-color-tabs-underline);display:none;order:99;padding-bottom:.75rem;padding-top:.75rem;width:100%}.sd-tab-content>:first-child{margin-top:0 !important}.sd-tab-content>:last-child{margin-bottom:0 !important}.sd-tab-content>.sd-tab-set{margin:0}.sd-sphinx-override,.sd-sphinx-override *{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.sd-sphinx-override p{margin-top:0}:root{--sd-color-primary: #007bff;--sd-color-secondary: #6c757d;--sd-color-success: #28a745;--sd-color-info: #17a2b8;--sd-color-warning: #f0b37e;--sd-color-danger: #dc3545;--sd-color-light: #f8f9fa;--sd-color-muted: #6c757d;--sd-color-dark: #212529;--sd-color-black: black;--sd-color-white: white;--sd-color-primary-highlight: #0069d9;--sd-color-secondary-highlight: #5c636a;--sd-color-success-highlight: #228e3b;--sd-color-info-highlight: #148a9c;--sd-color-warning-highlight: #cc986b;--sd-color-danger-highlight: #bb2d3b;--sd-color-light-highlight: #d3d4d5;--sd-color-muted-highlight: #5c636a;--sd-color-dark-highlight: #1c1f23;--sd-color-black-highlight: black;--sd-color-white-highlight: #d9d9d9;--sd-color-primary-text: #fff;--sd-color-secondary-text: #fff;--sd-color-success-text: #fff;--sd-color-info-text: #fff;--sd-color-warning-text: #212529;--sd-color-danger-text: #fff;--sd-color-light-text: #212529;--sd-color-muted-text: #fff;--sd-color-dark-text: #fff;--sd-color-black-text: #fff;--sd-color-white-text: #212529;--sd-color-shadow: rgba(0, 0, 0, 0.15);--sd-color-card-border: rgba(0, 0, 0, 0.125);--sd-color-card-border-hover: hsla(231, 99%, 66%, 1);--sd-color-card-background: transparent;--sd-color-card-text: inherit;--sd-color-card-header: transparent;--sd-color-card-footer: transparent;--sd-color-tabs-label-active: hsla(231, 99%, 66%, 1);--sd-color-tabs-label-hover: hsla(231, 99%, 66%, 1);--sd-color-tabs-label-inactive: hsl(0, 0%, 66%);--sd-color-tabs-underline-active: hsla(231, 99%, 66%, 1);--sd-color-tabs-underline-hover: rgba(178, 206, 245, 0.62);--sd-color-tabs-underline-inactive: transparent;--sd-color-tabs-overline: rgb(222, 222, 222);--sd-color-tabs-underline: rgb(222, 222, 222);--sd-fontsize-tabs-label: 1rem}
diff --git a/docs/_build/html/_sphinx_design_static/design-tabs.js b/docs/_build/html/_sphinx_design_static/design-tabs.js
deleted file mode 100644
index 36b38cf..0000000
--- a/docs/_build/html/_sphinx_design_static/design-tabs.js
+++ /dev/null
@@ -1,27 +0,0 @@
-var sd_labels_by_text = {};
-
-function ready() {
-  const li = document.getElementsByClassName("sd-tab-label");
-  for (const label of li) {
-    syncId = label.getAttribute("data-sync-id");
-    if (syncId) {
-      label.onclick = onLabelClick;
-      if (!sd_labels_by_text[syncId]) {
-        sd_labels_by_text[syncId] = [];
-      }
-      sd_labels_by_text[syncId].push(label);
-    }
-  }
-}
-
-function onLabelClick() {
-  // Activate other inputs with the same sync id.
-  syncId = this.getAttribute("data-sync-id");
-  for (label of sd_labels_by_text[syncId]) {
-    if (label === this) continue;
-    label.previousElementSibling.checked = true;
-  }
-  window.localStorage.setItem("sphinx-design-last-tab", syncId);
-}
-
-document.addEventListener("DOMContentLoaded", ready, false);
diff --git a/docs/_build/html/_static/_sphinx_javascript_frameworks_compat.js b/docs/_build/html/_static/_sphinx_javascript_frameworks_compat.js
deleted file mode 100644
index 8549469..0000000
--- a/docs/_build/html/_static/_sphinx_javascript_frameworks_compat.js
+++ /dev/null
@@ -1,134 +0,0 @@
-/*
- * _sphinx_javascript_frameworks_compat.js
- * ~~~~~~~~~~
- *
- * Compatability shim for jQuery and underscores.js.
- *
- * WILL BE REMOVED IN Sphinx 6.0
- * xref RemovedInSphinx60Warning
- *
- */
-
-/**
- * select a different prefix for underscore
- */
-$u = _.noConflict();
-
-
-/**
- * small helper function to urldecode strings
- *
- * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL
- */
-jQuery.urldecode = function(x) {
-    if (!x) {
-        return x
-    }
-    return decodeURIComponent(x.replace(/\+/g, ' '));
-};
-
-/**
- * small helper function to urlencode strings
- */
-jQuery.urlencode = encodeURIComponent;
-
-/**
- * This function returns the parsed url parameters of the
- * current request. Multiple values per key are supported,
- * it will always return arrays of strings for the value parts.
- */
-jQuery.getQueryParameters = function(s) {
-    if (typeof s === 'undefined')
-        s = document.location.search;
-    var parts = s.substr(s.indexOf('?') + 1).split('&');
-    var result = {};
-    for (var i = 0; i < parts.length; i++) {
-        var tmp = parts[i].split('=', 2);
-        var key = jQuery.urldecode(tmp[0]);
-        var value = jQuery.urldecode(tmp[1]);
-        if (key in result)
-            result[key].push(value);
-        else
-            result[key] = [value];
-    }
-    return result;
-};
-
-/**
- * highlight a given string on a jquery object by wrapping it in
- * span elements with the given class name.
- */
-jQuery.fn.highlightText = function(text, className) {
-    function highlight(node, addItems) {
-        if (node.nodeType === 3) {
-            var val = node.nodeValue;
-            var pos = val.toLowerCase().indexOf(text);
-            if (pos >= 0 &&
-                !jQuery(node.parentNode).hasClass(className) &&
-                !jQuery(node.parentNode).hasClass("nohighlight")) {
-                var span;
-                var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg");
-                if (isInSVG) {
-                    span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
-                } else {
-                    span = document.createElement("span");
-                    span.className = className;
-                }
-                span.appendChild(document.createTextNode(val.substr(pos, text.length)));
-                node.parentNode.insertBefore(span, node.parentNode.insertBefore(
-                    document.createTextNode(val.substr(pos + text.length)),
-                    node.nextSibling));
-                node.nodeValue = val.substr(0, pos);
-                if (isInSVG) {
-                    var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect");
-                    var bbox = node.parentElement.getBBox();
-                    rect.x.baseVal.value = bbox.x;
-                    rect.y.baseVal.value = bbox.y;
-                    rect.width.baseVal.value = bbox.width;
-                    rect.height.baseVal.value = bbox.height;
-                    rect.setAttribute('class', className);
-                    addItems.push({
-                        "parent": node.parentNode,
-                        "target": rect});
-                }
-            }
-        }
-        else if (!jQuery(node).is("button, select, textarea")) {
-            jQuery.each(node.childNodes, function() {
-                highlight(this, addItems);
-            });
-        }
-    }
-    var addItems = [];
-    var result = this.each(function() {
-        highlight(this, addItems);
-    });
-    for (var i = 0; i < addItems.length; ++i) {
-        jQuery(addItems[i].parent).before(addItems[i].target);
-    }
-    return result;
-};
-
-/*
- * backward compatibility for jQuery.browser
- * This will be supported until firefox bug is fixed.
- */
-if (!jQuery.browser) {
-    jQuery.uaMatch = function(ua) {
-        ua = ua.toLowerCase();
-
-        var match = /(chrome)[ \/]([\w.]+)/.exec(ua) ||
-            /(webkit)[ \/]([\w.]+)/.exec(ua) ||
-            /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) ||
-            /(msie) ([\w.]+)/.exec(ua) ||
-            ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) ||
-            [];
-
-        return {
-            browser: match[ 1 ] || "",
-            version: match[ 2 ] || "0"
-        };
-    };
-    jQuery.browser = {};
-    jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true;
-}
diff --git a/docs/_build/html/_static/basic.css b/docs/_build/html/_static/basic.css
deleted file mode 100644
index 9e364ed..0000000
--- a/docs/_build/html/_static/basic.css
+++ /dev/null
@@ -1,930 +0,0 @@
-/*
- * basic.css
- * ~~~~~~~~~
- *
- * Sphinx stylesheet -- basic theme.
- *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
- * :license: BSD, see LICENSE for details.
- *
- */
-
-/* -- main layout ----------------------------------------------------------- */
-
-div.clearer {
-    clear: both;
-}
-
-div.section::after {
-    display: block;
-    content: '';
-    clear: left;
-}
-
-/* -- relbar ---------------------------------------------------------------- */
-
-div.related {
-    width: 100%;
-    font-size: 90%;
-}
-
-div.related h3 {
-    display: none;
-}
-
-div.related ul {
-    margin: 0;
-    padding: 0 0 0 10px;
-    list-style: none;
-}
-
-div.related li {
-    display: inline;
-}
-
-div.related li.right {
-    float: right;
-    margin-right: 5px;
-}
-
-/* -- sidebar --------------------------------------------------------------- */
-
-div.sphinxsidebarwrapper {
-    padding: 10px 5px 0 10px;
-}
-
-div.sphinxsidebar {
-    float: left;
-    width: 270px;
-    margin-left: -100%;
-    font-size: 90%;
-    word-wrap: break-word;
-    overflow-wrap : break-word;
-}
-
-div.sphinxsidebar ul {
-    list-style: none;
-}
-
-div.sphinxsidebar ul ul,
-div.sphinxsidebar ul.want-points {
-    margin-left: 20px;
-    list-style: square;
-}
-
-div.sphinxsidebar ul ul {
-    margin-top: 0;
-    margin-bottom: 0;
-}
-
-div.sphinxsidebar form {
-    margin-top: 10px;
-}
-
-div.sphinxsidebar input {
-    border: 1px solid #98dbcc;
-    font-family: sans-serif;
-    font-size: 1em;
-}
-
-div.sphinxsidebar #searchbox form.search {
-    overflow: hidden;
-}
-
-div.sphinxsidebar #searchbox input[type="text"] {
-    float: left;
-    width: 80%;
-    padding: 0.25em;
-    box-sizing: border-box;
-}
-
-div.sphinxsidebar #searchbox input[type="submit"] {
-    float: left;
-    width: 20%;
-    border-left: none;
-    padding: 0.25em;
-    box-sizing: border-box;
-}
-
-
-img {
-    border: 0;
-    max-width: 100%;
-}
-
-/* -- search page ----------------------------------------------------------- */
-
-ul.search {
-    margin: 10px 0 0 20px;
-    padding: 0;
-}
-
-ul.search li {
-    padding: 5px 0 5px 20px;
-    background-image: url(file.png);
-    background-repeat: no-repeat;
-    background-position: 0 7px;
-}
-
-ul.search li a {
-    font-weight: bold;
-}
-
-ul.search li p.context {
-    color: #888;
-    margin: 2px 0 0 30px;
-    text-align: left;
-}
-
-ul.keywordmatches li.goodmatch a {
-    font-weight: bold;
-}
-
-/* -- index page ------------------------------------------------------------ */
-
-table.contentstable {
-    width: 90%;
-    margin-left: auto;
-    margin-right: auto;
-}
-
-table.contentstable p.biglink {
-    line-height: 150%;
-}
-
-a.biglink {
-    font-size: 1.3em;
-}
-
-span.linkdescr {
-    font-style: italic;
-    padding-top: 5px;
-    font-size: 90%;
-}
-
-/* -- general index --------------------------------------------------------- */
-
-table.indextable {
-    width: 100%;
-}
-
-table.indextable td {
-    text-align: left;
-    vertical-align: top;
-}
-
-table.indextable ul {
-    margin-top: 0;
-    margin-bottom: 0;
-    list-style-type: none;
-}
-
-table.indextable > tbody > tr > td > ul {
-    padding-left: 0em;
-}
-
-table.indextable tr.pcap {
-    height: 10px;
-}
-
-table.indextable tr.cap {
-    margin-top: 10px;
-    background-color: #f2f2f2;
-}
-
-img.toggler {
-    margin-right: 3px;
-    margin-top: 3px;
-    cursor: pointer;
-}
-
-div.modindex-jumpbox {
-    border-top: 1px solid #ddd;
-    border-bottom: 1px solid #ddd;
-    margin: 1em 0 1em 0;
-    padding: 0.4em;
-}
-
-div.genindex-jumpbox {
-    border-top: 1px solid #ddd;
-    border-bottom: 1px solid #ddd;
-    margin: 1em 0 1em 0;
-    padding: 0.4em;
-}
-
-/* -- domain module index --------------------------------------------------- */
-
-table.modindextable td {
-    padding: 2px;
-    border-collapse: collapse;
-}
-
-/* -- general body styles --------------------------------------------------- */
-
-div.body {
-    min-width: 360px;
-    max-width: 800px;
-}
-
-div.body p, div.body dd, div.body li, div.body blockquote {
-    -moz-hyphens: auto;
-    -ms-hyphens: auto;
-    -webkit-hyphens: auto;
-    hyphens: auto;
-}
-
-a.headerlink {
-    visibility: hidden;
-}
-
-h1:hover > a.headerlink,
-h2:hover > a.headerlink,
-h3:hover > a.headerlink,
-h4:hover > a.headerlink,
-h5:hover > a.headerlink,
-h6:hover > a.headerlink,
-dt:hover > a.headerlink,
-caption:hover > a.headerlink,
-p.caption:hover > a.headerlink,
-div.code-block-caption:hover > a.headerlink {
-    visibility: visible;
-}
-
-div.body p.caption {
-    text-align: inherit;
-}
-
-div.body td {
-    text-align: left;
-}
-
-.first {
-    margin-top: 0 !important;
-}
-
-p.rubric {
-    margin-top: 30px;
-    font-weight: bold;
-}
-
-img.align-left, figure.align-left, .figure.align-left, object.align-left {
-    clear: left;
-    float: left;
-    margin-right: 1em;
-}
-
-img.align-right, figure.align-right, .figure.align-right, object.align-right {
-    clear: right;
-    float: right;
-    margin-left: 1em;
-}
-
-img.align-center, figure.align-center, .figure.align-center, object.align-center {
-  display: block;
-  margin-left: auto;
-  margin-right: auto;
-}
-
-img.align-default, figure.align-default, .figure.align-default {
-  display: block;
-  margin-left: auto;
-  margin-right: auto;
-}
-
-.align-left {
-    text-align: left;
-}
-
-.align-center {
-    text-align: center;
-}
-
-.align-default {
-    text-align: center;
-}
-
-.align-right {
-    text-align: right;
-}
-
-/* -- sidebars -------------------------------------------------------------- */
-
-div.sidebar,
-aside.sidebar {
-    margin: 0 0 0.5em 1em;
-    border: 1px solid #ddb;
-    padding: 7px;
-    background-color: #ffe;
-    width: 40%;
-    float: right;
-    clear: right;
-    overflow-x: auto;
-}
-
-p.sidebar-title {
-    font-weight: bold;
-}
-nav.contents,
-aside.topic,
-
-div.admonition, div.topic, blockquote {
-    clear: left;
-}
-
-/* -- topics ---------------------------------------------------------------- */
-nav.contents,
-aside.topic,
-
-div.topic {
-    border: 1px solid #ccc;
-    padding: 7px;
-    margin: 10px 0 10px 0;
-}
-
-p.topic-title {
-    font-size: 1.1em;
-    font-weight: bold;
-    margin-top: 10px;
-}
-
-/* -- admonitions ----------------------------------------------------------- */
-
-div.admonition {
-    margin-top: 10px;
-    margin-bottom: 10px;
-    padding: 7px;
-}
-
-div.admonition dt {
-    font-weight: bold;
-}
-
-p.admonition-title {
-    margin: 0px 10px 5px 0px;
-    font-weight: bold;
-}
-
-div.body p.centered {
-    text-align: center;
-    margin-top: 25px;
-}
-
-/* -- content of sidebars/topics/admonitions -------------------------------- */
-
-div.sidebar > :last-child,
-aside.sidebar > :last-child,
-nav.contents > :last-child,
-aside.topic > :last-child,
-
-div.topic > :last-child,
-div.admonition > :last-child {
-    margin-bottom: 0;
-}
-
-div.sidebar::after,
-aside.sidebar::after,
-nav.contents::after,
-aside.topic::after,
-
-div.topic::after,
-div.admonition::after,
-blockquote::after {
-    display: block;
-    content: '';
-    clear: both;
-}
-
-/* -- tables ---------------------------------------------------------------- */
-
-table.docutils {
-    margin-top: 10px;
-    margin-bottom: 10px;
-    border: 0;
-    border-collapse: collapse;
-}
-
-table.align-center {
-    margin-left: auto;
-    margin-right: auto;
-}
-
-table.align-default {
-    margin-left: auto;
-    margin-right: auto;
-}
-
-table caption span.caption-number {
-    font-style: italic;
-}
-
-table caption span.caption-text {
-}
-
-table.docutils td, table.docutils th {
-    padding: 1px 8px 1px 5px;
-    border-top: 0;
-    border-left: 0;
-    border-right: 0;
-    border-bottom: 1px solid #aaa;
-}
-
-th {
-    text-align: left;
-    padding-right: 5px;
-}
-
-table.citation {
-    border-left: solid 1px gray;
-    margin-left: 1px;
-}
-
-table.citation td {
-    border-bottom: none;
-}
-
-th > :first-child,
-td > :first-child {
-    margin-top: 0px;
-}
-
-th > :last-child,
-td > :last-child {
-    margin-bottom: 0px;
-}
-
-/* -- figures --------------------------------------------------------------- */
-
-div.figure, figure {
-    margin: 0.5em;
-    padding: 0.5em;
-}
-
-div.figure p.caption, figcaption {
-    padding: 0.3em;
-}
-
-div.figure p.caption span.caption-number,
-figcaption span.caption-number {
-    font-style: italic;
-}
-
-div.figure p.caption span.caption-text,
-figcaption span.caption-text {
-}
-
-/* -- field list styles ----------------------------------------------------- */
-
-table.field-list td, table.field-list th {
-    border: 0 !important;
-}
-
-.field-list ul {
-    margin: 0;
-    padding-left: 1em;
-}
-
-.field-list p {
-    margin: 0;
-}
-
-.field-name {
-    -moz-hyphens: manual;
-    -ms-hyphens: manual;
-    -webkit-hyphens: manual;
-    hyphens: manual;
-}
-
-/* -- hlist styles ---------------------------------------------------------- */
-
-table.hlist {
-    margin: 1em 0;
-}
-
-table.hlist td {
-    vertical-align: top;
-}
-
-/* -- object description styles --------------------------------------------- */
-
-.sig {
-	font-family: 'Consolas', 'Menlo', 'DejaVu Sans Mono', 'Bitstream Vera Sans Mono', monospace;
-}
-
-.sig-name, code.descname {
-    background-color: transparent;
-    font-weight: bold;
-}
-
-.sig-name {
-	font-size: 1.1em;
-}
-
-code.descname {
-    font-size: 1.2em;
-}
-
-.sig-prename, code.descclassname {
-    background-color: transparent;
-}
-
-.optional {
-    font-size: 1.3em;
-}
-
-.sig-paren {
-    font-size: larger;
-}
-
-.sig-param.n {
-	font-style: italic;
-}
-
-/* C++ specific styling */
-
-.sig-inline.c-texpr,
-.sig-inline.cpp-texpr {
-	font-family: unset;
-}
-
-.sig.c   .k, .sig.c   .kt,
-.sig.cpp .k, .sig.cpp .kt {
-	color: #0033B3;
-}
-
-.sig.c   .m,
-.sig.cpp .m {
-	color: #1750EB;
-}
-
-.sig.c   .s, .sig.c   .sc,
-.sig.cpp .s, .sig.cpp .sc {
-	color: #067D17;
-}
-
-
-/* -- other body styles ----------------------------------------------------- */
-
-ol.arabic {
-    list-style: decimal;
-}
-
-ol.loweralpha {
-    list-style: lower-alpha;
-}
-
-ol.upperalpha {
-    list-style: upper-alpha;
-}
-
-ol.lowerroman {
-    list-style: lower-roman;
-}
-
-ol.upperroman {
-    list-style: upper-roman;
-}
-
-:not(li) > ol > li:first-child > :first-child,
-:not(li) > ul > li:first-child > :first-child {
-    margin-top: 0px;
-}
-
-:not(li) > ol > li:last-child > :last-child,
-:not(li) > ul > li:last-child > :last-child {
-    margin-bottom: 0px;
-}
-
-ol.simple ol p,
-ol.simple ul p,
-ul.simple ol p,
-ul.simple ul p {
-    margin-top: 0;
-}
-
-ol.simple > li:not(:first-child) > p,
-ul.simple > li:not(:first-child) > p {
-    margin-top: 0;
-}
-
-ol.simple p,
-ul.simple p {
-    margin-bottom: 0;
-}
-
-/* Docutils 0.17 and older (footnotes & citations) */
-dl.footnote > dt,
-dl.citation > dt {
-    float: left;
-    margin-right: 0.5em;
-}
-
-dl.footnote > dd,
-dl.citation > dd {
-    margin-bottom: 0em;
-}
-
-dl.footnote > dd:after,
-dl.citation > dd:after {
-    content: "";
-    clear: both;
-}
-
-/* Docutils 0.18+ (footnotes & citations) */
-aside.footnote > span,
-div.citation > span {
-    float: left;
-}
-aside.footnote > span:last-of-type,
-div.citation > span:last-of-type {
-  padding-right: 0.5em;
-}
-aside.footnote > p {
-  margin-left: 2em;
-}
-div.citation > p {
-  margin-left: 4em;
-}
-aside.footnote > p:last-of-type,
-div.citation > p:last-of-type {
-    margin-bottom: 0em;
-}
-aside.footnote > p:last-of-type:after,
-div.citation > p:last-of-type:after {
-    content: "";
-    clear: both;
-}
-
-/* Footnotes & citations ends */
-
-dl.field-list {
-    display: grid;
-    grid-template-columns: fit-content(30%) auto;
-}
-
-dl.field-list > dt {
-    font-weight: bold;
-    word-break: break-word;
-    padding-left: 0.5em;
-    padding-right: 5px;
-}
-
-dl.field-list > dt:after {
-    content: ":";
-}
-
-dl.field-list > dd {
-    padding-left: 0.5em;
-    margin-top: 0em;
-    margin-left: 0em;
-    margin-bottom: 0em;
-}
-
-dl {
-    margin-bottom: 15px;
-}
-
-dd > :first-child {
-    margin-top: 0px;
-}
-
-dd ul, dd table {
-    margin-bottom: 10px;
-}
-
-dd {
-    margin-top: 3px;
-    margin-bottom: 10px;
-    margin-left: 30px;
-}
-
-dl > dd:last-child,
-dl > dd:last-child > :last-child {
-    margin-bottom: 0;
-}
-
-dt:target, span.highlighted {
-    background-color: #fbe54e;
-}
-
-rect.highlighted {
-    fill: #fbe54e;
-}
-
-dl.glossary dt {
-    font-weight: bold;
-    font-size: 1.1em;
-}
-
-.versionmodified {
-    font-style: italic;
-}
-
-.system-message {
-    background-color: #fda;
-    padding: 5px;
-    border: 3px solid red;
-}
-
-.footnote:target  {
-    background-color: #ffa;
-}
-
-.line-block {
-    display: block;
-    margin-top: 1em;
-    margin-bottom: 1em;
-}
-
-.line-block .line-block {
-    margin-top: 0;
-    margin-bottom: 0;
-    margin-left: 1.5em;
-}
-
-.guilabel, .menuselection {
-    font-family: sans-serif;
-}
-
-.accelerator {
-    text-decoration: underline;
-}
-
-.classifier {
-    font-style: oblique;
-}
-
-.classifier:before {
-    font-style: normal;
-    margin: 0 0.5em;
-    content: ":";
-    display: inline-block;
-}
-
-abbr, acronym {
-    border-bottom: dotted 1px;
-    cursor: help;
-}
-
-/* -- code displays --------------------------------------------------------- */
-
-pre {
-    overflow: auto;
-    overflow-y: hidden;  /* fixes display issues on Chrome browsers */
-}
-
-pre, div[class*="highlight-"] {
-    clear: both;
-}
-
-span.pre {
-    -moz-hyphens: none;
-    -ms-hyphens: none;
-    -webkit-hyphens: none;
-    hyphens: none;
-    white-space: nowrap;
-}
-
-div[class*="highlight-"] {
-    margin: 1em 0;
-}
-
-td.linenos pre {
-    border: 0;
-    background-color: transparent;
-    color: #aaa;
-}
-
-table.highlighttable {
-    display: block;
-}
-
-table.highlighttable tbody {
-    display: block;
-}
-
-table.highlighttable tr {
-    display: flex;
-}
-
-table.highlighttable td {
-    margin: 0;
-    padding: 0;
-}
-
-table.highlighttable td.linenos {
-    padding-right: 0.5em;
-}
-
-table.highlighttable td.code {
-    flex: 1;
-    overflow: hidden;
-}
-
-.highlight .hll {
-    display: block;
-}
-
-div.highlight pre,
-table.highlighttable pre {
-    margin: 0;
-}
-
-div.code-block-caption + div {
-    margin-top: 0;
-}
-
-div.code-block-caption {
-    margin-top: 1em;
-    padding: 2px 5px;
-    font-size: small;
-}
-
-div.code-block-caption code {
-    background-color: transparent;
-}
-
-table.highlighttable td.linenos,
-span.linenos,
-div.highlight span.gp {  /* gp: Generic.Prompt */
-  user-select: none;
-  -webkit-user-select: text; /* Safari fallback only */
-  -webkit-user-select: none; /* Chrome/Safari */
-  -moz-user-select: none; /* Firefox */
-  -ms-user-select: none; /* IE10+ */
-}
-
-div.code-block-caption span.caption-number {
-    padding: 0.1em 0.3em;
-    font-style: italic;
-}
-
-div.code-block-caption span.caption-text {
-}
-
-div.literal-block-wrapper {
-    margin: 1em 0;
-}
-
-code.xref, a code {
-    background-color: transparent;
-    font-weight: bold;
-}
-
-h1 code, h2 code, h3 code, h4 code, h5 code, h6 code {
-    background-color: transparent;
-}
-
-.viewcode-link {
-    float: right;
-}
-
-.viewcode-back {
-    float: right;
-    font-family: sans-serif;
-}
-
-div.viewcode-block:target {
-    margin: -1px -10px;
-    padding: 0 10px;
-}
-
-/* -- math display ---------------------------------------------------------- */
-
-img.math {
-    vertical-align: middle;
-}
-
-div.body div.math p {
-    text-align: center;
-}
-
-span.eqno {
-    float: right;
-}
-
-span.eqno a.headerlink {
-    position: absolute;
-    z-index: 1;
-}
-
-div.math:hover a.headerlink {
-    visibility: visible;
-}
-
-/* -- printout stylesheet --------------------------------------------------- */
-
-@media print {
-    div.document,
-    div.documentwrapper,
-    div.bodywrapper {
-        margin: 0 !important;
-        width: 100%;
-    }
-
-    div.sphinxsidebar,
-    div.related,
-    div.footer,
-    #top-link {
-        display: none;
-    }
-}
\ No newline at end of file
diff --git a/docs/_build/html/_static/check-solid.svg b/docs/_build/html/_static/check-solid.svg
deleted file mode 100644
index 92fad4b..0000000
--- a/docs/_build/html/_static/check-solid.svg
+++ /dev/null
@@ -1,4 +0,0 @@
-<svg xmlns="http://www.w3.org/2000/svg" class="icon icon-tabler icon-tabler-check" width="44" height="44" viewBox="0 0 24 24" stroke-width="2" stroke="#22863a" fill="none" stroke-linecap="round" stroke-linejoin="round">
-  <path stroke="none" d="M0 0h24v24H0z" fill="none"/>
-  <path d="M5 12l5 5l10 -10" />
-</svg>
diff --git a/docs/_build/html/_static/clipboard.min.js b/docs/_build/html/_static/clipboard.min.js
deleted file mode 100644
index 54b3c46..0000000
--- a/docs/_build/html/_static/clipboard.min.js
+++ /dev/null
@@ -1,7 +0,0 @@
-/*!
- * clipboard.js v2.0.8
- * https://clipboardjs.com/
- *
- * Licensed MIT © Zeno Rocha
- */
-!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):"object"==typeof exports?exports.ClipboardJS=e():t.ClipboardJS=e()}(this,function(){return n={686:function(t,e,n){"use strict";n.d(e,{default:function(){return o}});var e=n(279),i=n.n(e),e=n(370),u=n.n(e),e=n(817),c=n.n(e);function a(t){try{return document.execCommand(t)}catch(t){return}}var f=function(t){t=c()(t);return a("cut"),t};var l=function(t){var e,n,o,r=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{container:document.body},i="";return"string"==typeof t?(e=t,n="rtl"===document.documentElement.getAttribute("dir"),(o=document.createElement("textarea")).style.fontSize="12pt",o.style.border="0",o.style.padding="0",o.style.margin="0",o.style.position="absolute",o.style[n?"right":"left"]="-9999px",n=window.pageYOffset||document.documentElement.scrollTop,o.style.top="".concat(n,"px"),o.setAttribute("readonly",""),o.value=e,o=o,r.container.appendChild(o),i=c()(o),a("copy"),o.remove()):(i=c()(t),a("copy")),i};function r(t){return(r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}var s=function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},e=t.action,n=void 0===e?"copy":e,o=t.container,e=t.target,t=t.text;if("copy"!==n&&"cut"!==n)throw new Error('Invalid "action" value, use either "copy" or "cut"');if(void 0!==e){if(!e||"object"!==r(e)||1!==e.nodeType)throw new Error('Invalid "target" value, use a valid Element');if("copy"===n&&e.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if("cut"===n&&(e.hasAttribute("readonly")||e.hasAttribute("disabled")))throw new Error('Invalid "target" attribute. You can\'t cut text from elements with "readonly" or "disabled" attributes')}return t?l(t,{container:o}):e?"cut"===n?f(e):l(e,{container:o}):void 0};function d(t){return(d="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function p(t,e){for(var n=0;n<e.length;n++){var o=e[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(t,o.key,o)}}function y(t,e){return(y=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t})(t,e)}function h(n){var o=function(){if("undefined"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if("function"==typeof Proxy)return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],function(){})),!0}catch(t){return!1}}();return function(){var t,e=m(n);return t=o?(t=m(this).constructor,Reflect.construct(e,arguments,t)):e.apply(this,arguments),e=this,!(t=t)||"object"!==d(t)&&"function"!=typeof t?function(t){if(void 0!==t)return t;throw new ReferenceError("this hasn't been initialised - super() hasn't been called")}(e):t}}function m(t){return(m=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)})(t)}function v(t,e){t="data-clipboard-".concat(t);if(e.hasAttribute(t))return e.getAttribute(t)}var o=function(){!function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),e&&y(t,e)}(r,i());var t,e,n,o=h(r);function r(t,e){var n;return function(t){if(!(t instanceof r))throw new TypeError("Cannot call a class as a function")}(this),(n=o.call(this)).resolveOptions(e),n.listenClick(t),n}return t=r,n=[{key:"copy",value:function(t){var e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{container:document.body};return l(t,e)}},{key:"cut",value:function(t){return f(t)}},{key:"isSupported",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:["copy","cut"],t="string"==typeof t?[t]:t,e=!!document.queryCommandSupported;return t.forEach(function(t){e=e&&!!document.queryCommandSupported(t)}),e}}],(e=[{key:"resolveOptions",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};this.action="function"==typeof t.action?t.action:this.defaultAction,this.target="function"==typeof t.target?t.target:this.defaultTarget,this.text="function"==typeof t.text?t.text:this.defaultText,this.container="object"===d(t.container)?t.container:document.body}},{key:"listenClick",value:function(t){var e=this;this.listener=u()(t,"click",function(t){return e.onClick(t)})}},{key:"onClick",value:function(t){var e=t.delegateTarget||t.currentTarget,t=s({action:this.action(e),container:this.container,target:this.target(e),text:this.text(e)});this.emit(t?"success":"error",{action:this.action,text:t,trigger:e,clearSelection:function(){e&&e.focus(),document.activeElement.blur(),window.getSelection().removeAllRanges()}})}},{key:"defaultAction",value:function(t){return v("action",t)}},{key:"defaultTarget",value:function(t){t=v("target",t);if(t)return document.querySelector(t)}},{key:"defaultText",value:function(t){return v("text",t)}},{key:"destroy",value:function(){this.listener.destroy()}}])&&p(t.prototype,e),n&&p(t,n),r}()},828:function(t){var e;"undefined"==typeof Element||Element.prototype.matches||((e=Element.prototype).matches=e.matchesSelector||e.mozMatchesSelector||e.msMatchesSelector||e.oMatchesSelector||e.webkitMatchesSelector),t.exports=function(t,e){for(;t&&9!==t.nodeType;){if("function"==typeof t.matches&&t.matches(e))return t;t=t.parentNode}}},438:function(t,e,n){var u=n(828);function i(t,e,n,o,r){var i=function(e,n,t,o){return function(t){t.delegateTarget=u(t.target,n),t.delegateTarget&&o.call(e,t)}}.apply(this,arguments);return t.addEventListener(n,i,r),{destroy:function(){t.removeEventListener(n,i,r)}}}t.exports=function(t,e,n,o,r){return"function"==typeof t.addEventListener?i.apply(null,arguments):"function"==typeof n?i.bind(null,document).apply(null,arguments):("string"==typeof t&&(t=document.querySelectorAll(t)),Array.prototype.map.call(t,function(t){return i(t,e,n,o,r)}))}},879:function(t,n){n.node=function(t){return void 0!==t&&t instanceof HTMLElement&&1===t.nodeType},n.nodeList=function(t){var e=Object.prototype.toString.call(t);return void 0!==t&&("[object NodeList]"===e||"[object HTMLCollection]"===e)&&"length"in t&&(0===t.length||n.node(t[0]))},n.string=function(t){return"string"==typeof t||t instanceof String},n.fn=function(t){return"[object Function]"===Object.prototype.toString.call(t)}},370:function(t,e,n){var f=n(879),l=n(438);t.exports=function(t,e,n){if(!t&&!e&&!n)throw new Error("Missing required arguments");if(!f.string(e))throw new TypeError("Second argument must be a String");if(!f.fn(n))throw new TypeError("Third argument must be a Function");if(f.node(t))return c=e,a=n,(u=t).addEventListener(c,a),{destroy:function(){u.removeEventListener(c,a)}};if(f.nodeList(t))return o=t,r=e,i=n,Array.prototype.forEach.call(o,function(t){t.addEventListener(r,i)}),{destroy:function(){Array.prototype.forEach.call(o,function(t){t.removeEventListener(r,i)})}};if(f.string(t))return t=t,e=e,n=n,l(document.body,t,e,n);throw new TypeError("First argument must be a String, HTMLElement, HTMLCollection, or NodeList");var o,r,i,u,c,a}},817:function(t){t.exports=function(t){var e,n="SELECT"===t.nodeName?(t.focus(),t.value):"INPUT"===t.nodeName||"TEXTAREA"===t.nodeName?((e=t.hasAttribute("readonly"))||t.setAttribute("readonly",""),t.select(),t.setSelectionRange(0,t.value.length),e||t.removeAttribute("readonly"),t.value):(t.hasAttribute("contenteditable")&&t.focus(),n=window.getSelection(),(e=document.createRange()).selectNodeContents(t),n.removeAllRanges(),n.addRange(e),n.toString());return n}},279:function(t){function e(){}e.prototype={on:function(t,e,n){var o=this.e||(this.e={});return(o[t]||(o[t]=[])).push({fn:e,ctx:n}),this},once:function(t,e,n){var o=this;function r(){o.off(t,r),e.apply(n,arguments)}return r._=e,this.on(t,r,n)},emit:function(t){for(var e=[].slice.call(arguments,1),n=((this.e||(this.e={}))[t]||[]).slice(),o=0,r=n.length;o<r;o++)n[o].fn.apply(n[o].ctx,e);return this},off:function(t,e){var n=this.e||(this.e={}),o=n[t],r=[];if(o&&e)for(var i=0,u=o.length;i<u;i++)o[i].fn!==e&&o[i].fn._!==e&&r.push(o[i]);return r.length?n[t]=r:delete n[t],this}},t.exports=e,t.exports.TinyEmitter=e}},r={},o.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return o.d(e,{a:e}),e},o.d=function(t,e){for(var n in e)o.o(e,n)&&!o.o(t,n)&&Object.defineProperty(t,n,{enumerable:!0,get:e[n]})},o.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},o(686).default;function o(t){if(r[t])return r[t].exports;var e=r[t]={exports:{}};return n[t](e,e.exports,o),e.exports}var n,r});
\ No newline at end of file
diff --git a/docs/_build/html/_static/copy-button.svg b/docs/_build/html/_static/copy-button.svg
deleted file mode 100644
index 9c074da..0000000
--- a/docs/_build/html/_static/copy-button.svg
+++ /dev/null
@@ -1,5 +0,0 @@
-<svg xmlns="http://www.w3.org/2000/svg" class="icon icon-tabler icon-tabler-copy" width="44" height="44" viewBox="0 0 24 24" stroke-width="1.5" stroke="#000000" fill="none" stroke-linecap="round" stroke-linejoin="round">
-  <path stroke="none" d="M0 0h24v24H0z" fill="none"/>
-  <rect x="8" y="8" width="12" height="12" rx="2" />
-  <path d="M16 8v-2a2 2 0 0 0 -2 -2h-8a2 2 0 0 0 -2 2v8a2 2 0 0 0 2 2h2" />
-</svg>
diff --git a/docs/_build/html/_static/copybutton.css b/docs/_build/html/_static/copybutton.css
deleted file mode 100644
index f1916ec..0000000
--- a/docs/_build/html/_static/copybutton.css
+++ /dev/null
@@ -1,94 +0,0 @@
-/* Copy buttons */
-button.copybtn {
-    position: absolute;
-    display: flex;
-    top: .3em;
-    right: .3em;
-    width: 1.7em;
-    height: 1.7em;
-	opacity: 0;
-    transition: opacity 0.3s, border .3s, background-color .3s;
-    user-select: none;
-    padding: 0;
-    border: none;
-    outline: none;
-    border-radius: 0.4em;
-    /* The colors that GitHub uses */
-    border: #1b1f2426 1px solid;
-    background-color: #f6f8fa;
-    color: #57606a;
-}
-
-button.copybtn.success {
-    border-color: #22863a;
-    color: #22863a;
-}
-
-button.copybtn svg {
-    stroke: currentColor;
-    width: 1.5em;
-    height: 1.5em;
-    padding: 0.1em;
-}
-
-div.highlight  {
-    position: relative;
-}
-
-/* Show the copybutton */
-.highlight:hover button.copybtn, button.copybtn.success {
-	opacity: 1;
-}
-
-.highlight button.copybtn:hover {
-    background-color: rgb(235, 235, 235);
-}
-
-.highlight button.copybtn:active {
-    background-color: rgb(187, 187, 187);
-}
-
-/**
- * A minimal CSS-only tooltip copied from:
- *   https://codepen.io/mildrenben/pen/rVBrpK
- *
- * To use, write HTML like the following:
- *
- * <p class="o-tooltip--left" data-tooltip="Hey">Short</p>
- */
- .o-tooltip--left {
-  position: relative;
- }
-
- .o-tooltip--left:after {
-    opacity: 0;
-    visibility: hidden;
-    position: absolute;
-    content: attr(data-tooltip);
-    padding: .2em;
-    font-size: .8em;
-    left: -.2em;
-    background: grey;
-    color: white;
-    white-space: nowrap;
-    z-index: 2;
-    border-radius: 2px;
-    transform: translateX(-102%) translateY(0);
-    transition: opacity 0.2s cubic-bezier(0.64, 0.09, 0.08, 1), transform 0.2s cubic-bezier(0.64, 0.09, 0.08, 1);
-}
-
-.o-tooltip--left:hover:after {
-    display: block;
-    opacity: 1;
-    visibility: visible;
-    transform: translateX(-100%) translateY(0);
-    transition: opacity 0.2s cubic-bezier(0.64, 0.09, 0.08, 1), transform 0.2s cubic-bezier(0.64, 0.09, 0.08, 1);
-    transition-delay: .5s;
-}
-
-/* By default the copy button shouldn't show up when printing a page */
-@media print {
-    button.copybtn {
-        display: none;
-    }
-}
diff --git a/docs/_build/html/_static/copybutton.js b/docs/_build/html/_static/copybutton.js
deleted file mode 100644
index 2ea7ff3..0000000
--- a/docs/_build/html/_static/copybutton.js
+++ /dev/null
@@ -1,248 +0,0 @@
-// Localization support
-const messages = {
-  'en': {
-    'copy': 'Copy',
-    'copy_to_clipboard': 'Copy to clipboard',
-    'copy_success': 'Copied!',
-    'copy_failure': 'Failed to copy',
-  },
-  'es' : {
-    'copy': 'Copiar',
-    'copy_to_clipboard': 'Copiar al portapapeles',
-    'copy_success': '¡Copiado!',
-    'copy_failure': 'Error al copiar',
-  },
-  'de' : {
-    'copy': 'Kopieren',
-    'copy_to_clipboard': 'In die Zwischenablage kopieren',
-    'copy_success': 'Kopiert!',
-    'copy_failure': 'Fehler beim Kopieren',
-  },
-  'fr' : {
-    'copy': 'Copier',
-    'copy_to_clipboard': 'Copier dans le presse-papier',
-    'copy_success': 'Copié !',
-    'copy_failure': 'Échec de la copie',
-  },
-  'ru': {
-    'copy': 'Скопировать',
-    'copy_to_clipboard': 'Скопировать в буфер',
-    'copy_success': 'Скопировано!',
-    'copy_failure': 'Не удалось скопировать',
-  },
-  'zh-CN': {
-    'copy': '复制',
-    'copy_to_clipboard': '复制到剪贴板',
-    'copy_success': '复制成功!',
-    'copy_failure': '复制失败',
-  },
-  'it' : {
-    'copy': 'Copiare',
-    'copy_to_clipboard': 'Copiato negli appunti',
-    'copy_success': 'Copiato!',
-    'copy_failure': 'Errore durante la copia',
-  }
-}
-
-let locale = 'en'
-if( document.documentElement.lang !== undefined
-    && messages[document.documentElement.lang] !== undefined ) {
-  locale = document.documentElement.lang
-}
-
-let doc_url_root = DOCUMENTATION_OPTIONS.URL_ROOT;
-if (doc_url_root == '#') {
-    doc_url_root = '';
-}
-
-/**
- * SVG files for our copy buttons
- */
-let iconCheck = `<svg xmlns="http://www.w3.org/2000/svg" class="icon icon-tabler icon-tabler-check" width="44" height="44" viewBox="0 0 24 24" stroke-width="2" stroke="#22863a" fill="none" stroke-linecap="round" stroke-linejoin="round">
-  <title>${messages[locale]['copy_success']}</title>
-  <path stroke="none" d="M0 0h24v24H0z" fill="none"/>
-  <path d="M5 12l5 5l10 -10" />
-</svg>`
-
-// If the user specified their own SVG use that, otherwise use the default
-let iconCopy = ``;
-if (!iconCopy) {
-  iconCopy = `<svg xmlns="http://www.w3.org/2000/svg" class="icon icon-tabler icon-tabler-copy" width="44" height="44" viewBox="0 0 24 24" stroke-width="1.5" stroke="#000000" fill="none" stroke-linecap="round" stroke-linejoin="round">
-  <title>${messages[locale]['copy_to_clipboard']}</title>
-  <path stroke="none" d="M0 0h24v24H0z" fill="none"/>
-  <rect x="8" y="8" width="12" height="12" rx="2" />
-  <path d="M16 8v-2a2 2 0 0 0 -2 -2h-8a2 2 0 0 0 -2 2v8a2 2 0 0 0 2 2h2" />
-</svg>`
-}
-
-/**
- * Set up copy/paste for code blocks
- */
-
-const runWhenDOMLoaded = cb => {
-  if (document.readyState != 'loading') {
-    cb()
-  } else if (document.addEventListener) {
-    document.addEventListener('DOMContentLoaded', cb)
-  } else {
-    document.attachEvent('onreadystatechange', function() {
-      if (document.readyState == 'complete') cb()
-    })
-  }
-}
-
-const codeCellId = index => `codecell${index}`
-
-// Clears selected text since ClipboardJS will select the text when copying
-const clearSelection = () => {
-  if (window.getSelection) {
-    window.getSelection().removeAllRanges()
-  } else if (document.selection) {
-    document.selection.empty()
-  }
-}
-
-// Changes tooltip text for a moment, then changes it back
-// We want the timeout of our `success` class to be a bit shorter than the
-// tooltip and icon change, so that we can hide the icon before changing back.
-var timeoutIcon = 2000;
-var timeoutSuccessClass = 1500;
-
-const temporarilyChangeTooltip = (el, oldText, newText) => {
-  el.setAttribute('data-tooltip', newText)
-  el.classList.add('success')
-  // Remove success a little bit sooner than we change the tooltip
-  // So that we can use CSS to hide the copybutton first
-  setTimeout(() => el.classList.remove('success'), timeoutSuccessClass)
-  setTimeout(() => el.setAttribute('data-tooltip', oldText), timeoutIcon)
-}
-
-// Changes the copy button icon for two seconds, then changes it back
-const temporarilyChangeIcon = (el) => {
-  el.innerHTML = iconCheck;
-  setTimeout(() => {el.innerHTML = iconCopy}, timeoutIcon)
-}
-
-const addCopyButtonToCodeCells = () => {
-  // If ClipboardJS hasn't loaded, wait a bit and try again. This
-  // happens because we load ClipboardJS asynchronously.
-  if (window.ClipboardJS === undefined) {
-    setTimeout(addCopyButtonToCodeCells, 250)
-    return
-  }
-
-  // Add copybuttons to all of our code cells
-  const COPYBUTTON_SELECTOR = 'div.highlight pre';
-  const codeCells = document.querySelectorAll(COPYBUTTON_SELECTOR)
-  codeCells.forEach((codeCell, index) => {
-    const id = codeCellId(index)
-    codeCell.setAttribute('id', id)
-
-    const clipboardButton = id =>
-    `<button class="copybtn o-tooltip--left" data-tooltip="${messages[locale]['copy']}" data-clipboard-target="#${id}">
-      ${iconCopy}
-    </button>`
-    codeCell.insertAdjacentHTML('afterend', clipboardButton(id))
-  })
-
-function escapeRegExp(string) {
-    return string.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
-}
-
-/**
- * Removes excluded text from a Node.
- *
- * @param {Node} target Node to filter.
- * @param {string} exclude CSS selector of nodes to exclude.
- * @returns {DOMString} Text from `target` with text removed.
- */
-function filterText(target, exclude) {
-    const clone = target.cloneNode(true);  // clone as to not modify the live DOM
-    if (exclude) {
-        // remove excluded nodes
-        clone.querySelectorAll(exclude).forEach(node => node.remove());
-    }
-    return clone.innerText;
-}
-
-// Callback when a copy button is clicked. Will be passed the node that was clicked
-// should then grab the text and replace pieces of text that shouldn't be used in output
-function formatCopyText(textContent, copybuttonPromptText, isRegexp = false, onlyCopyPromptLines = true, removePrompts = true, copyEmptyLines = true, lineContinuationChar = "", hereDocDelim = "") {
-    var regexp;
-    var match;
-
-    // Do we check for line continuation characters and "HERE-documents"?
-    var useLineCont = !!lineContinuationChar
-    var useHereDoc = !!hereDocDelim
-
-    // create regexp to capture prompt and remaining line
-    if (isRegexp) {
-        regexp = new RegExp('^(' + copybuttonPromptText + ')(.*)')
-    } else {
-        regexp = new RegExp('^(' + escapeRegExp(copybuttonPromptText) + ')(.*)')
-    }
-
-    const outputLines = [];
-    var promptFound = false;
-    var gotLineCont = false;
-    var gotHereDoc = false;
-    const lineGotPrompt = [];
-    for (const line of textContent.split('\n')) {
-        match = line.match(regexp)
-        if (match || gotLineCont || gotHereDoc) {
-            promptFound = regexp.test(line)
-            lineGotPrompt.push(promptFound)
-            if (removePrompts && promptFound) {
-                outputLines.push(match[2])
-            } else {
-                outputLines.push(line)
-            }
-            gotLineCont = line.endsWith(lineContinuationChar) & useLineCont
-            if (line.includes(hereDocDelim) & useHereDoc)
-                gotHereDoc = !gotHereDoc
-        } else if (!onlyCopyPromptLines) {
-            outputLines.push(line)
-        } else if (copyEmptyLines && line.trim() === '') {
-            outputLines.push(line)
-        }
-    }
-
-    // If no lines with the prompt were found then just use original lines
-    if (lineGotPrompt.some(v => v === true)) {
-        textContent = outputLines.join('\n');
-    }
-
-    // Remove a trailing newline to avoid auto-running when pasting
-    if (textContent.endsWith("\n")) {
-        textContent = textContent.slice(0, -1)
-    }
-    return textContent
-}
-
-
-var copyTargetText = (trigger) => {
-  var target = document.querySelector(trigger.attributes['data-clipboard-target'].value);
-
-  // get filtered text
-  let exclude = '.linenos';
-
-  let text = filterText(target, exclude);
-  return formatCopyText(text, '', false, true, true, true, '', '')
-}
-
-  // Initialize with a callback so we can modify the text before copy
-  const clipboard = new ClipboardJS('.copybtn', {text: copyTargetText})
-
-  // Update UI with error/success messages
-  clipboard.on('success', event => {
-    clearSelection()
-    temporarilyChangeTooltip(event.trigger, messages[locale]['copy'], messages[locale]['copy_success'])
-    temporarilyChangeIcon(event.trigger)
-  })
-
-  clipboard.on('error', event => {
-    temporarilyChangeTooltip(event.trigger, messages[locale]['copy'], messages[locale]['copy_failure'])
-  })
-}
-
-runWhenDOMLoaded(addCopyButtonToCodeCells)
\ No newline at end of file
diff --git a/docs/_build/html/_static/copybutton_funcs.js b/docs/_build/html/_static/copybutton_funcs.js
deleted file mode 100644
index dbe1aaa..0000000
--- a/docs/_build/html/_static/copybutton_funcs.js
+++ /dev/null
@@ -1,73 +0,0 @@
-function escapeRegExp(string) {
-    return string.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
-}
-
-/**
- * Removes excluded text from a Node.
- *
- * @param {Node} target Node to filter.
- * @param {string} exclude CSS selector of nodes to exclude.
- * @returns {DOMString} Text from `target` with text removed.
- */
-export function filterText(target, exclude) {
-    const clone = target.cloneNode(true);  // clone as to not modify the live DOM
-    if (exclude) {
-        // remove excluded nodes
-        clone.querySelectorAll(exclude).forEach(node => node.remove());
-    }
-    return clone.innerText;
-}
-
-// Callback when a copy button is clicked. Will be passed the node that was clicked
-// should then grab the text and replace pieces of text that shouldn't be used in output
-export function formatCopyText(textContent, copybuttonPromptText, isRegexp = false, onlyCopyPromptLines = true, removePrompts = true, copyEmptyLines = true, lineContinuationChar = "", hereDocDelim = "") {
-    var regexp;
-    var match;
-
-    // Do we check for line continuation characters and "HERE-documents"?
-    var useLineCont = !!lineContinuationChar
-    var useHereDoc = !!hereDocDelim
-
-    // create regexp to capture prompt and remaining line
-    if (isRegexp) {
-        regexp = new RegExp('^(' + copybuttonPromptText + ')(.*)')
-    } else {
-        regexp = new RegExp('^(' + escapeRegExp(copybuttonPromptText) + ')(.*)')
-    }
-
-    const outputLines = [];
-    var promptFound = false;
-    var gotLineCont = false;
-    var gotHereDoc = false;
-    const lineGotPrompt = [];
-    for (const line of textContent.split('\n')) {
-        match = line.match(regexp)
-        if (match || gotLineCont || gotHereDoc) {
-            promptFound = regexp.test(line)
-            lineGotPrompt.push(promptFound)
-            if (removePrompts && promptFound) {
-                outputLines.push(match[2])
-            } else {
-                outputLines.push(line)
-            }
-            gotLineCont = line.endsWith(lineContinuationChar) & useLineCont
-            if (line.includes(hereDocDelim) & useHereDoc)
-                gotHereDoc = !gotHereDoc
-        } else if (!onlyCopyPromptLines) {
-            outputLines.push(line)
-        } else if (copyEmptyLines && line.trim() === '') {
-            outputLines.push(line)
-        }
-    }
-
-    // If no lines with the prompt were found then just use original lines
-    if (lineGotPrompt.some(v => v === true)) {
-        textContent = outputLines.join('\n');
-    }
-
-    // Remove a trailing newline to avoid auto-running when pasting
-    if (textContent.endsWith("\n")) {
-        textContent = textContent.slice(0, -1)
-    }
-    return textContent
-}
diff --git a/docs/_build/html/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css b/docs/_build/html/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
deleted file mode 100644
index 3225661..0000000
--- a/docs/_build/html/_static/design-style.4045f2051d55cab465a707391d5b2007.min.css
+++ /dev/null
@@ -1 +0,0 @@
-.sd-bg-primary{background-color:var(--sd-color-primary) !important}.sd-bg-text-primary{color:var(--sd-color-primary-text) !important}button.sd-bg-primary:focus,button.sd-bg-primary:hover{background-color:var(--sd-color-primary-highlight) !important}a.sd-bg-primary:focus,a.sd-bg-primary:hover{background-color:var(--sd-color-primary-highlight) !important}.sd-bg-secondary{background-color:var(--sd-color-secondary) !important}.sd-bg-text-secondary{color:var(--sd-color-secondary-text) !important}button.sd-bg-secondary:focus,button.sd-bg-secondary:hover{background-color:var(--sd-color-secondary-highlight) !important}a.sd-bg-secondary:focus,a.sd-bg-secondary:hover{background-color:var(--sd-color-secondary-highlight) !important}.sd-bg-success{background-color:var(--sd-color-success) !important}.sd-bg-text-success{color:var(--sd-color-success-text) !important}button.sd-bg-success:focus,button.sd-bg-success:hover{background-color:var(--sd-color-success-highlight) !important}a.sd-bg-success:focus,a.sd-bg-success:hover{background-color:var(--sd-color-success-highlight) !important}.sd-bg-info{background-color:var(--sd-color-info) !important}.sd-bg-text-info{color:var(--sd-color-info-text) !important}button.sd-bg-info:focus,button.sd-bg-info:hover{background-color:var(--sd-color-info-highlight) !important}a.sd-bg-info:focus,a.sd-bg-info:hover{background-color:var(--sd-color-info-highlight) !important}.sd-bg-warning{background-color:var(--sd-color-warning) !important}.sd-bg-text-warning{color:var(--sd-color-warning-text) !important}button.sd-bg-warning:focus,button.sd-bg-warning:hover{background-color:var(--sd-color-warning-highlight) !important}a.sd-bg-warning:focus,a.sd-bg-warning:hover{background-color:var(--sd-color-warning-highlight) !important}.sd-bg-danger{background-color:var(--sd-color-danger) !important}.sd-bg-text-danger{color:var(--sd-color-danger-text) !important}button.sd-bg-danger:focus,button.sd-bg-danger:hover{background-color:var(--sd-color-danger-highlight) !important}a.sd-bg-danger:focus,a.sd-bg-danger:hover{background-color:var(--sd-color-danger-highlight) !important}.sd-bg-light{background-color:var(--sd-color-light) !important}.sd-bg-text-light{color:var(--sd-color-light-text) !important}button.sd-bg-light:focus,button.sd-bg-light:hover{background-color:var(--sd-color-light-highlight) !important}a.sd-bg-light:focus,a.sd-bg-light:hover{background-color:var(--sd-color-light-highlight) !important}.sd-bg-muted{background-color:var(--sd-color-muted) !important}.sd-bg-text-muted{color:var(--sd-color-muted-text) !important}button.sd-bg-muted:focus,button.sd-bg-muted:hover{background-color:var(--sd-color-muted-highlight) !important}a.sd-bg-muted:focus,a.sd-bg-muted:hover{background-color:var(--sd-color-muted-highlight) !important}.sd-bg-dark{background-color:var(--sd-color-dark) !important}.sd-bg-text-dark{color:var(--sd-color-dark-text) !important}button.sd-bg-dark:focus,button.sd-bg-dark:hover{background-color:var(--sd-color-dark-highlight) !important}a.sd-bg-dark:focus,a.sd-bg-dark:hover{background-color:var(--sd-color-dark-highlight) !important}.sd-bg-black{background-color:var(--sd-color-black) !important}.sd-bg-text-black{color:var(--sd-color-black-text) !important}button.sd-bg-black:focus,button.sd-bg-black:hover{background-color:var(--sd-color-black-highlight) !important}a.sd-bg-black:focus,a.sd-bg-black:hover{background-color:var(--sd-color-black-highlight) !important}.sd-bg-white{background-color:var(--sd-color-white) !important}.sd-bg-text-white{color:var(--sd-color-white-text) !important}button.sd-bg-white:focus,button.sd-bg-white:hover{background-color:var(--sd-color-white-highlight) !important}a.sd-bg-white:focus,a.sd-bg-white:hover{background-color:var(--sd-color-white-highlight) !important}.sd-text-primary,.sd-text-primary>p{color:var(--sd-color-primary) !important}a.sd-text-primary:focus,a.sd-text-primary:hover{color:var(--sd-color-primary-highlight) !important}.sd-text-secondary,.sd-text-secondary>p{color:var(--sd-color-secondary) !important}a.sd-text-secondary:focus,a.sd-text-secondary:hover{color:var(--sd-color-secondary-highlight) !important}.sd-text-success,.sd-text-success>p{color:var(--sd-color-success) !important}a.sd-text-success:focus,a.sd-text-success:hover{color:var(--sd-color-success-highlight) !important}.sd-text-info,.sd-text-info>p{color:var(--sd-color-info) !important}a.sd-text-info:focus,a.sd-text-info:hover{color:var(--sd-color-info-highlight) !important}.sd-text-warning,.sd-text-warning>p{color:var(--sd-color-warning) !important}a.sd-text-warning:focus,a.sd-text-warning:hover{color:var(--sd-color-warning-highlight) !important}.sd-text-danger,.sd-text-danger>p{color:var(--sd-color-danger) !important}a.sd-text-danger:focus,a.sd-text-danger:hover{color:var(--sd-color-danger-highlight) !important}.sd-text-light,.sd-text-light>p{color:var(--sd-color-light) !important}a.sd-text-light:focus,a.sd-text-light:hover{color:var(--sd-color-light-highlight) !important}.sd-text-muted,.sd-text-muted>p{color:var(--sd-color-muted) !important}a.sd-text-muted:focus,a.sd-text-muted:hover{color:var(--sd-color-muted-highlight) !important}.sd-text-dark,.sd-text-dark>p{color:var(--sd-color-dark) !important}a.sd-text-dark:focus,a.sd-text-dark:hover{color:var(--sd-color-dark-highlight) !important}.sd-text-black,.sd-text-black>p{color:var(--sd-color-black) !important}a.sd-text-black:focus,a.sd-text-black:hover{color:var(--sd-color-black-highlight) !important}.sd-text-white,.sd-text-white>p{color:var(--sd-color-white) !important}a.sd-text-white:focus,a.sd-text-white:hover{color:var(--sd-color-white-highlight) !important}.sd-outline-primary{border-color:var(--sd-color-primary) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-primary:focus,a.sd-outline-primary:hover{border-color:var(--sd-color-primary-highlight) !important}.sd-outline-secondary{border-color:var(--sd-color-secondary) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-secondary:focus,a.sd-outline-secondary:hover{border-color:var(--sd-color-secondary-highlight) !important}.sd-outline-success{border-color:var(--sd-color-success) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-success:focus,a.sd-outline-success:hover{border-color:var(--sd-color-success-highlight) !important}.sd-outline-info{border-color:var(--sd-color-info) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-info:focus,a.sd-outline-info:hover{border-color:var(--sd-color-info-highlight) !important}.sd-outline-warning{border-color:var(--sd-color-warning) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-warning:focus,a.sd-outline-warning:hover{border-color:var(--sd-color-warning-highlight) !important}.sd-outline-danger{border-color:var(--sd-color-danger) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-danger:focus,a.sd-outline-danger:hover{border-color:var(--sd-color-danger-highlight) !important}.sd-outline-light{border-color:var(--sd-color-light) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-light:focus,a.sd-outline-light:hover{border-color:var(--sd-color-light-highlight) !important}.sd-outline-muted{border-color:var(--sd-color-muted) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-muted:focus,a.sd-outline-muted:hover{border-color:var(--sd-color-muted-highlight) !important}.sd-outline-dark{border-color:var(--sd-color-dark) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-dark:focus,a.sd-outline-dark:hover{border-color:var(--sd-color-dark-highlight) !important}.sd-outline-black{border-color:var(--sd-color-black) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-black:focus,a.sd-outline-black:hover{border-color:var(--sd-color-black-highlight) !important}.sd-outline-white{border-color:var(--sd-color-white) !important;border-style:solid !important;border-width:1px !important}a.sd-outline-white:focus,a.sd-outline-white:hover{border-color:var(--sd-color-white-highlight) !important}.sd-bg-transparent{background-color:transparent !important}.sd-outline-transparent{border-color:transparent !important}.sd-text-transparent{color:transparent !important}.sd-p-0{padding:0 !important}.sd-pt-0,.sd-py-0{padding-top:0 !important}.sd-pr-0,.sd-px-0{padding-right:0 !important}.sd-pb-0,.sd-py-0{padding-bottom:0 !important}.sd-pl-0,.sd-px-0{padding-left:0 !important}.sd-p-1{padding:.25rem !important}.sd-pt-1,.sd-py-1{padding-top:.25rem !important}.sd-pr-1,.sd-px-1{padding-right:.25rem !important}.sd-pb-1,.sd-py-1{padding-bottom:.25rem !important}.sd-pl-1,.sd-px-1{padding-left:.25rem !important}.sd-p-2{padding:.5rem !important}.sd-pt-2,.sd-py-2{padding-top:.5rem !important}.sd-pr-2,.sd-px-2{padding-right:.5rem !important}.sd-pb-2,.sd-py-2{padding-bottom:.5rem !important}.sd-pl-2,.sd-px-2{padding-left:.5rem !important}.sd-p-3{padding:1rem !important}.sd-pt-3,.sd-py-3{padding-top:1rem !important}.sd-pr-3,.sd-px-3{padding-right:1rem !important}.sd-pb-3,.sd-py-3{padding-bottom:1rem !important}.sd-pl-3,.sd-px-3{padding-left:1rem !important}.sd-p-4{padding:1.5rem !important}.sd-pt-4,.sd-py-4{padding-top:1.5rem !important}.sd-pr-4,.sd-px-4{padding-right:1.5rem !important}.sd-pb-4,.sd-py-4{padding-bottom:1.5rem !important}.sd-pl-4,.sd-px-4{padding-left:1.5rem !important}.sd-p-5{padding:3rem !important}.sd-pt-5,.sd-py-5{padding-top:3rem !important}.sd-pr-5,.sd-px-5{padding-right:3rem !important}.sd-pb-5,.sd-py-5{padding-bottom:3rem !important}.sd-pl-5,.sd-px-5{padding-left:3rem !important}.sd-m-auto{margin:auto !important}.sd-mt-auto,.sd-my-auto{margin-top:auto !important}.sd-mr-auto,.sd-mx-auto{margin-right:auto !important}.sd-mb-auto,.sd-my-auto{margin-bottom:auto !important}.sd-ml-auto,.sd-mx-auto{margin-left:auto !important}.sd-m-0{margin:0 !important}.sd-mt-0,.sd-my-0{margin-top:0 !important}.sd-mr-0,.sd-mx-0{margin-right:0 !important}.sd-mb-0,.sd-my-0{margin-bottom:0 !important}.sd-ml-0,.sd-mx-0{margin-left:0 !important}.sd-m-1{margin:.25rem !important}.sd-mt-1,.sd-my-1{margin-top:.25rem !important}.sd-mr-1,.sd-mx-1{margin-right:.25rem !important}.sd-mb-1,.sd-my-1{margin-bottom:.25rem !important}.sd-ml-1,.sd-mx-1{margin-left:.25rem !important}.sd-m-2{margin:.5rem !important}.sd-mt-2,.sd-my-2{margin-top:.5rem !important}.sd-mr-2,.sd-mx-2{margin-right:.5rem !important}.sd-mb-2,.sd-my-2{margin-bottom:.5rem !important}.sd-ml-2,.sd-mx-2{margin-left:.5rem !important}.sd-m-3{margin:1rem !important}.sd-mt-3,.sd-my-3{margin-top:1rem !important}.sd-mr-3,.sd-mx-3{margin-right:1rem !important}.sd-mb-3,.sd-my-3{margin-bottom:1rem !important}.sd-ml-3,.sd-mx-3{margin-left:1rem !important}.sd-m-4{margin:1.5rem !important}.sd-mt-4,.sd-my-4{margin-top:1.5rem !important}.sd-mr-4,.sd-mx-4{margin-right:1.5rem !important}.sd-mb-4,.sd-my-4{margin-bottom:1.5rem !important}.sd-ml-4,.sd-mx-4{margin-left:1.5rem !important}.sd-m-5{margin:3rem !important}.sd-mt-5,.sd-my-5{margin-top:3rem !important}.sd-mr-5,.sd-mx-5{margin-right:3rem !important}.sd-mb-5,.sd-my-5{margin-bottom:3rem !important}.sd-ml-5,.sd-mx-5{margin-left:3rem !important}.sd-w-25{width:25% !important}.sd-w-50{width:50% !important}.sd-w-75{width:75% !important}.sd-w-100{width:100% !important}.sd-w-auto{width:auto !important}.sd-h-25{height:25% !important}.sd-h-50{height:50% !important}.sd-h-75{height:75% !important}.sd-h-100{height:100% !important}.sd-h-auto{height:auto !important}.sd-d-none{display:none !important}.sd-d-inline{display:inline !important}.sd-d-inline-block{display:inline-block !important}.sd-d-block{display:block !important}.sd-d-grid{display:grid !important}.sd-d-flex-row{display:-ms-flexbox !important;display:flex !important;flex-direction:row !important}.sd-d-flex-column{display:-ms-flexbox !important;display:flex !important;flex-direction:column !important}.sd-d-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}@media(min-width: 576px){.sd-d-sm-none{display:none !important}.sd-d-sm-inline{display:inline !important}.sd-d-sm-inline-block{display:inline-block !important}.sd-d-sm-block{display:block !important}.sd-d-sm-grid{display:grid !important}.sd-d-sm-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-sm-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 768px){.sd-d-md-none{display:none !important}.sd-d-md-inline{display:inline !important}.sd-d-md-inline-block{display:inline-block !important}.sd-d-md-block{display:block !important}.sd-d-md-grid{display:grid !important}.sd-d-md-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-md-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 992px){.sd-d-lg-none{display:none !important}.sd-d-lg-inline{display:inline !important}.sd-d-lg-inline-block{display:inline-block !important}.sd-d-lg-block{display:block !important}.sd-d-lg-grid{display:grid !important}.sd-d-lg-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-lg-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}@media(min-width: 1200px){.sd-d-xl-none{display:none !important}.sd-d-xl-inline{display:inline !important}.sd-d-xl-inline-block{display:inline-block !important}.sd-d-xl-block{display:block !important}.sd-d-xl-grid{display:grid !important}.sd-d-xl-flex{display:-ms-flexbox !important;display:flex !important}.sd-d-xl-inline-flex{display:-ms-inline-flexbox !important;display:inline-flex !important}}.sd-align-major-start{justify-content:flex-start !important}.sd-align-major-end{justify-content:flex-end !important}.sd-align-major-center{justify-content:center !important}.sd-align-major-justify{justify-content:space-between !important}.sd-align-major-spaced{justify-content:space-evenly !important}.sd-align-minor-start{align-items:flex-start !important}.sd-align-minor-end{align-items:flex-end !important}.sd-align-minor-center{align-items:center !important}.sd-align-minor-stretch{align-items:stretch !important}.sd-text-justify{text-align:justify !important}.sd-text-left{text-align:left !important}.sd-text-right{text-align:right !important}.sd-text-center{text-align:center !important}.sd-font-weight-light{font-weight:300 !important}.sd-font-weight-lighter{font-weight:lighter !important}.sd-font-weight-normal{font-weight:400 !important}.sd-font-weight-bold{font-weight:700 !important}.sd-font-weight-bolder{font-weight:bolder !important}.sd-font-italic{font-style:italic !important}.sd-text-decoration-none{text-decoration:none !important}.sd-text-lowercase{text-transform:lowercase !important}.sd-text-uppercase{text-transform:uppercase !important}.sd-text-capitalize{text-transform:capitalize !important}.sd-text-wrap{white-space:normal !important}.sd-text-nowrap{white-space:nowrap !important}.sd-text-truncate{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.sd-fs-1,.sd-fs-1>p{font-size:calc(1.375rem + 1.5vw) !important;line-height:unset !important}.sd-fs-2,.sd-fs-2>p{font-size:calc(1.325rem + 0.9vw) !important;line-height:unset !important}.sd-fs-3,.sd-fs-3>p{font-size:calc(1.3rem + 0.6vw) !important;line-height:unset !important}.sd-fs-4,.sd-fs-4>p{font-size:calc(1.275rem + 0.3vw) !important;line-height:unset !important}.sd-fs-5,.sd-fs-5>p{font-size:1.25rem !important;line-height:unset !important}.sd-fs-6,.sd-fs-6>p{font-size:1rem !important;line-height:unset !important}.sd-border-0{border:0 solid !important}.sd-border-top-0{border-top:0 solid !important}.sd-border-bottom-0{border-bottom:0 solid !important}.sd-border-right-0{border-right:0 solid !important}.sd-border-left-0{border-left:0 solid !important}.sd-border-1{border:1px solid !important}.sd-border-top-1{border-top:1px solid !important}.sd-border-bottom-1{border-bottom:1px solid !important}.sd-border-right-1{border-right:1px solid !important}.sd-border-left-1{border-left:1px solid !important}.sd-border-2{border:2px solid !important}.sd-border-top-2{border-top:2px solid !important}.sd-border-bottom-2{border-bottom:2px solid !important}.sd-border-right-2{border-right:2px solid !important}.sd-border-left-2{border-left:2px solid !important}.sd-border-3{border:3px solid !important}.sd-border-top-3{border-top:3px solid !important}.sd-border-bottom-3{border-bottom:3px solid !important}.sd-border-right-3{border-right:3px solid !important}.sd-border-left-3{border-left:3px solid !important}.sd-border-4{border:4px solid !important}.sd-border-top-4{border-top:4px solid !important}.sd-border-bottom-4{border-bottom:4px solid !important}.sd-border-right-4{border-right:4px solid !important}.sd-border-left-4{border-left:4px solid !important}.sd-border-5{border:5px solid !important}.sd-border-top-5{border-top:5px solid !important}.sd-border-bottom-5{border-bottom:5px solid !important}.sd-border-right-5{border-right:5px solid !important}.sd-border-left-5{border-left:5px solid !important}.sd-rounded-0{border-radius:0 !important}.sd-rounded-1{border-radius:.2rem !important}.sd-rounded-2{border-radius:.3rem !important}.sd-rounded-3{border-radius:.5rem !important}.sd-rounded-pill{border-radius:50rem !important}.sd-rounded-circle{border-radius:50% !important}.shadow-none{box-shadow:none !important}.sd-shadow-sm{box-shadow:0 .125rem .25rem var(--sd-color-shadow) !important}.sd-shadow-md{box-shadow:0 .5rem 1rem var(--sd-color-shadow) !important}.sd-shadow-lg{box-shadow:0 1rem 3rem var(--sd-color-shadow) !important}@keyframes sd-slide-from-left{0%{transform:translateX(-100%)}100%{transform:translateX(0)}}@keyframes sd-slide-from-right{0%{transform:translateX(200%)}100%{transform:translateX(0)}}@keyframes sd-grow100{0%{transform:scale(0);opacity:.5}100%{transform:scale(1);opacity:1}}@keyframes sd-grow50{0%{transform:scale(0.5);opacity:.5}100%{transform:scale(1);opacity:1}}@keyframes sd-grow50-rot20{0%{transform:scale(0.5) rotateZ(-20deg);opacity:.5}75%{transform:scale(1) rotateZ(5deg);opacity:1}95%{transform:scale(1) rotateZ(-1deg);opacity:1}100%{transform:scale(1) rotateZ(0);opacity:1}}.sd-animate-slide-from-left{animation:1s ease-out 0s 1 normal none running sd-slide-from-left}.sd-animate-slide-from-right{animation:1s ease-out 0s 1 normal none running sd-slide-from-right}.sd-animate-grow100{animation:1s ease-out 0s 1 normal none running sd-grow100}.sd-animate-grow50{animation:1s ease-out 0s 1 normal none running sd-grow50}.sd-animate-grow50-rot20{animation:1s ease-out 0s 1 normal none running sd-grow50-rot20}.sd-badge{display:inline-block;padding:.35em .65em;font-size:.75em;font-weight:700;line-height:1;text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:.25rem}.sd-badge:empty{display:none}a.sd-badge{text-decoration:none}.sd-btn .sd-badge{position:relative;top:-1px}.sd-btn{background-color:transparent;border:1px solid transparent;border-radius:.25rem;cursor:pointer;display:inline-block;font-weight:400;font-size:1rem;line-height:1.5;padding:.375rem .75rem;text-align:center;text-decoration:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;vertical-align:middle;user-select:none;-moz-user-select:none;-ms-user-select:none;-webkit-user-select:none}.sd-btn:hover{text-decoration:none}@media(prefers-reduced-motion: reduce){.sd-btn{transition:none}}.sd-btn-primary,.sd-btn-outline-primary:hover,.sd-btn-outline-primary:focus{color:var(--sd-color-primary-text) !important;background-color:var(--sd-color-primary) !important;border-color:var(--sd-color-primary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-primary:hover,.sd-btn-primary:focus{color:var(--sd-color-primary-text) !important;background-color:var(--sd-color-primary-highlight) !important;border-color:var(--sd-color-primary-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-primary{color:var(--sd-color-primary) !important;border-color:var(--sd-color-primary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-secondary,.sd-btn-outline-secondary:hover,.sd-btn-outline-secondary:focus{color:var(--sd-color-secondary-text) !important;background-color:var(--sd-color-secondary) !important;border-color:var(--sd-color-secondary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-secondary:hover,.sd-btn-secondary:focus{color:var(--sd-color-secondary-text) !important;background-color:var(--sd-color-secondary-highlight) !important;border-color:var(--sd-color-secondary-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-secondary{color:var(--sd-color-secondary) !important;border-color:var(--sd-color-secondary) !important;border-width:1px !important;border-style:solid !important}.sd-btn-success,.sd-btn-outline-success:hover,.sd-btn-outline-success:focus{color:var(--sd-color-success-text) !important;background-color:var(--sd-color-success) !important;border-color:var(--sd-color-success) !important;border-width:1px !important;border-style:solid !important}.sd-btn-success:hover,.sd-btn-success:focus{color:var(--sd-color-success-text) !important;background-color:var(--sd-color-success-highlight) !important;border-color:var(--sd-color-success-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-success{color:var(--sd-color-success) !important;border-color:var(--sd-color-success) !important;border-width:1px !important;border-style:solid !important}.sd-btn-info,.sd-btn-outline-info:hover,.sd-btn-outline-info:focus{color:var(--sd-color-info-text) !important;background-color:var(--sd-color-info) !important;border-color:var(--sd-color-info) !important;border-width:1px !important;border-style:solid !important}.sd-btn-info:hover,.sd-btn-info:focus{color:var(--sd-color-info-text) !important;background-color:var(--sd-color-info-highlight) !important;border-color:var(--sd-color-info-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-info{color:var(--sd-color-info) !important;border-color:var(--sd-color-info) !important;border-width:1px !important;border-style:solid !important}.sd-btn-warning,.sd-btn-outline-warning:hover,.sd-btn-outline-warning:focus{color:var(--sd-color-warning-text) !important;background-color:var(--sd-color-warning) !important;border-color:var(--sd-color-warning) !important;border-width:1px !important;border-style:solid !important}.sd-btn-warning:hover,.sd-btn-warning:focus{color:var(--sd-color-warning-text) !important;background-color:var(--sd-color-warning-highlight) !important;border-color:var(--sd-color-warning-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-warning{color:var(--sd-color-warning) !important;border-color:var(--sd-color-warning) !important;border-width:1px !important;border-style:solid !important}.sd-btn-danger,.sd-btn-outline-danger:hover,.sd-btn-outline-danger:focus{color:var(--sd-color-danger-text) !important;background-color:var(--sd-color-danger) !important;border-color:var(--sd-color-danger) !important;border-width:1px !important;border-style:solid !important}.sd-btn-danger:hover,.sd-btn-danger:focus{color:var(--sd-color-danger-text) !important;background-color:var(--sd-color-danger-highlight) !important;border-color:var(--sd-color-danger-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-danger{color:var(--sd-color-danger) !important;border-color:var(--sd-color-danger) !important;border-width:1px !important;border-style:solid !important}.sd-btn-light,.sd-btn-outline-light:hover,.sd-btn-outline-light:focus{color:var(--sd-color-light-text) !important;background-color:var(--sd-color-light) !important;border-color:var(--sd-color-light) !important;border-width:1px !important;border-style:solid !important}.sd-btn-light:hover,.sd-btn-light:focus{color:var(--sd-color-light-text) !important;background-color:var(--sd-color-light-highlight) !important;border-color:var(--sd-color-light-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-light{color:var(--sd-color-light) !important;border-color:var(--sd-color-light) !important;border-width:1px !important;border-style:solid !important}.sd-btn-muted,.sd-btn-outline-muted:hover,.sd-btn-outline-muted:focus{color:var(--sd-color-muted-text) !important;background-color:var(--sd-color-muted) !important;border-color:var(--sd-color-muted) !important;border-width:1px !important;border-style:solid !important}.sd-btn-muted:hover,.sd-btn-muted:focus{color:var(--sd-color-muted-text) !important;background-color:var(--sd-color-muted-highlight) !important;border-color:var(--sd-color-muted-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-muted{color:var(--sd-color-muted) !important;border-color:var(--sd-color-muted) !important;border-width:1px !important;border-style:solid !important}.sd-btn-dark,.sd-btn-outline-dark:hover,.sd-btn-outline-dark:focus{color:var(--sd-color-dark-text) !important;background-color:var(--sd-color-dark) !important;border-color:var(--sd-color-dark) !important;border-width:1px !important;border-style:solid !important}.sd-btn-dark:hover,.sd-btn-dark:focus{color:var(--sd-color-dark-text) !important;background-color:var(--sd-color-dark-highlight) !important;border-color:var(--sd-color-dark-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-dark{color:var(--sd-color-dark) !important;border-color:var(--sd-color-dark) !important;border-width:1px !important;border-style:solid !important}.sd-btn-black,.sd-btn-outline-black:hover,.sd-btn-outline-black:focus{color:var(--sd-color-black-text) !important;background-color:var(--sd-color-black) !important;border-color:var(--sd-color-black) !important;border-width:1px !important;border-style:solid !important}.sd-btn-black:hover,.sd-btn-black:focus{color:var(--sd-color-black-text) !important;background-color:var(--sd-color-black-highlight) !important;border-color:var(--sd-color-black-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-black{color:var(--sd-color-black) !important;border-color:var(--sd-color-black) !important;border-width:1px !important;border-style:solid !important}.sd-btn-white,.sd-btn-outline-white:hover,.sd-btn-outline-white:focus{color:var(--sd-color-white-text) !important;background-color:var(--sd-color-white) !important;border-color:var(--sd-color-white) !important;border-width:1px !important;border-style:solid !important}.sd-btn-white:hover,.sd-btn-white:focus{color:var(--sd-color-white-text) !important;background-color:var(--sd-color-white-highlight) !important;border-color:var(--sd-color-white-highlight) !important;border-width:1px !important;border-style:solid !important}.sd-btn-outline-white{color:var(--sd-color-white) !important;border-color:var(--sd-color-white) !important;border-width:1px !important;border-style:solid !important}.sd-stretched-link::after{position:absolute;top:0;right:0;bottom:0;left:0;z-index:1;content:""}.sd-hide-link-text{font-size:0}.sd-octicon,.sd-material-icon{display:inline-block;fill:currentColor;vertical-align:middle}.sd-avatar-xs{border-radius:50%;object-fit:cover;object-position:center;width:1rem;height:1rem}.sd-avatar-sm{border-radius:50%;object-fit:cover;object-position:center;width:3rem;height:3rem}.sd-avatar-md{border-radius:50%;object-fit:cover;object-position:center;width:5rem;height:5rem}.sd-avatar-lg{border-radius:50%;object-fit:cover;object-position:center;width:7rem;height:7rem}.sd-avatar-xl{border-radius:50%;object-fit:cover;object-position:center;width:10rem;height:10rem}.sd-avatar-inherit{border-radius:50%;object-fit:cover;object-position:center;width:inherit;height:inherit}.sd-avatar-initial{border-radius:50%;object-fit:cover;object-position:center;width:initial;height:initial}.sd-card{background-clip:border-box;background-color:var(--sd-color-card-background);border:1px solid var(--sd-color-card-border);border-radius:.25rem;color:var(--sd-color-card-text);display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;min-width:0;position:relative;word-wrap:break-word}.sd-card>hr{margin-left:0;margin-right:0}.sd-card-hover:hover{border-color:var(--sd-color-card-border-hover);transform:scale(1.01)}.sd-card-body{-ms-flex:1 1 auto;flex:1 1 auto;padding:1rem 1rem}.sd-card-title{margin-bottom:.5rem}.sd-card-subtitle{margin-top:-0.25rem;margin-bottom:0}.sd-card-text:last-child{margin-bottom:0}.sd-card-link:hover{text-decoration:none}.sd-card-link+.card-link{margin-left:1rem}.sd-card-header{padding:.5rem 1rem;margin-bottom:0;background-color:var(--sd-color-card-header);border-bottom:1px solid var(--sd-color-card-border)}.sd-card-header:first-child{border-radius:calc(0.25rem - 1px) calc(0.25rem - 1px) 0 0}.sd-card-footer{padding:.5rem 1rem;background-color:var(--sd-color-card-footer);border-top:1px solid var(--sd-color-card-border)}.sd-card-footer:last-child{border-radius:0 0 calc(0.25rem - 1px) calc(0.25rem - 1px)}.sd-card-header-tabs{margin-right:-0.5rem;margin-bottom:-0.5rem;margin-left:-0.5rem;border-bottom:0}.sd-card-header-pills{margin-right:-0.5rem;margin-left:-0.5rem}.sd-card-img-overlay{position:absolute;top:0;right:0;bottom:0;left:0;padding:1rem;border-radius:calc(0.25rem - 1px)}.sd-card-img,.sd-card-img-bottom,.sd-card-img-top{width:100%}.sd-card-img,.sd-card-img-top{border-top-left-radius:calc(0.25rem - 1px);border-top-right-radius:calc(0.25rem - 1px)}.sd-card-img,.sd-card-img-bottom{border-bottom-left-radius:calc(0.25rem - 1px);border-bottom-right-radius:calc(0.25rem - 1px)}.sd-cards-carousel{width:100%;display:flex;flex-wrap:nowrap;-ms-flex-direction:row;flex-direction:row;overflow-x:hidden;scroll-snap-type:x mandatory}.sd-cards-carousel.sd-show-scrollbar{overflow-x:auto}.sd-cards-carousel:hover,.sd-cards-carousel:focus{overflow-x:auto}.sd-cards-carousel>.sd-card{flex-shrink:0;scroll-snap-align:start}.sd-cards-carousel>.sd-card:not(:last-child){margin-right:3px}.sd-card-cols-1>.sd-card{width:90%}.sd-card-cols-2>.sd-card{width:45%}.sd-card-cols-3>.sd-card{width:30%}.sd-card-cols-4>.sd-card{width:22.5%}.sd-card-cols-5>.sd-card{width:18%}.sd-card-cols-6>.sd-card{width:15%}.sd-card-cols-7>.sd-card{width:12.8571428571%}.sd-card-cols-8>.sd-card{width:11.25%}.sd-card-cols-9>.sd-card{width:10%}.sd-card-cols-10>.sd-card{width:9%}.sd-card-cols-11>.sd-card{width:8.1818181818%}.sd-card-cols-12>.sd-card{width:7.5%}.sd-container,.sd-container-fluid,.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container-xl{margin-left:auto;margin-right:auto;padding-left:var(--sd-gutter-x, 0.75rem);padding-right:var(--sd-gutter-x, 0.75rem);width:100%}@media(min-width: 576px){.sd-container-sm,.sd-container{max-width:540px}}@media(min-width: 768px){.sd-container-md,.sd-container-sm,.sd-container{max-width:720px}}@media(min-width: 992px){.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container{max-width:960px}}@media(min-width: 1200px){.sd-container-xl,.sd-container-lg,.sd-container-md,.sd-container-sm,.sd-container{max-width:1140px}}.sd-row{--sd-gutter-x: 1.5rem;--sd-gutter-y: 0;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;margin-top:calc(var(--sd-gutter-y) * -1);margin-right:calc(var(--sd-gutter-x) * -0.5);margin-left:calc(var(--sd-gutter-x) * -0.5)}.sd-row>*{box-sizing:border-box;flex-shrink:0;width:100%;max-width:100%;padding-right:calc(var(--sd-gutter-x) * 0.5);padding-left:calc(var(--sd-gutter-x) * 0.5);margin-top:var(--sd-gutter-y)}.sd-col{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-auto>*{flex:0 0 auto;width:auto}.sd-row-cols-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}@media(min-width: 576px){.sd-col-sm{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-sm-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-sm-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-sm-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-sm-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-sm-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-sm-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-sm-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-sm-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-sm-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-sm-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-sm-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-sm-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-sm-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 768px){.sd-col-md{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-md-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-md-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-md-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-md-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-md-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-md-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-md-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-md-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-md-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-md-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-md-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-md-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-md-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 992px){.sd-col-lg{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-lg-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-lg-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-lg-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-lg-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-lg-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-lg-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-lg-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-lg-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-lg-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-lg-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-lg-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-lg-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-lg-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}@media(min-width: 1200px){.sd-col-xl{flex:1 0 0%;-ms-flex:1 0 0%}.sd-row-cols-xl-auto{flex:1 0 auto;-ms-flex:1 0 auto;width:100%}.sd-row-cols-xl-1>*{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-row-cols-xl-2>*{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-row-cols-xl-3>*{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-row-cols-xl-4>*{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-row-cols-xl-5>*{flex:0 0 auto;-ms-flex:0 0 auto;width:20%}.sd-row-cols-xl-6>*{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-row-cols-xl-7>*{flex:0 0 auto;-ms-flex:0 0 auto;width:14.2857142857%}.sd-row-cols-xl-8>*{flex:0 0 auto;-ms-flex:0 0 auto;width:12.5%}.sd-row-cols-xl-9>*{flex:0 0 auto;-ms-flex:0 0 auto;width:11.1111111111%}.sd-row-cols-xl-10>*{flex:0 0 auto;-ms-flex:0 0 auto;width:10%}.sd-row-cols-xl-11>*{flex:0 0 auto;-ms-flex:0 0 auto;width:9.0909090909%}.sd-row-cols-xl-12>*{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}}.sd-col-auto{flex:0 0 auto;-ms-flex:0 0 auto;width:auto}.sd-col-1{flex:0 0 auto;-ms-flex:0 0 auto;width:8.3333333333%}.sd-col-2{flex:0 0 auto;-ms-flex:0 0 auto;width:16.6666666667%}.sd-col-3{flex:0 0 auto;-ms-flex:0 0 auto;width:25%}.sd-col-4{flex:0 0 auto;-ms-flex:0 0 auto;width:33.3333333333%}.sd-col-5{flex:0 0 auto;-ms-flex:0 0 auto;width:41.6666666667%}.sd-col-6{flex:0 0 auto;-ms-flex:0 0 auto;width:50%}.sd-col-7{flex:0 0 auto;-ms-flex:0 0 auto;width:58.3333333333%}.sd-col-8{flex:0 0 auto;-ms-flex:0 0 auto;width:66.6666666667%}.sd-col-9{flex:0 0 auto;-ms-flex:0 0 auto;width:75%}.sd-col-10{flex:0 0 auto;-ms-flex:0 0 auto;width:83.3333333333%}.sd-col-11{flex:0 0 auto;-ms-flex:0 0 auto;width:91.6666666667%}.sd-col-12{flex:0 0 auto;-ms-flex:0 0 auto;width:100%}.sd-g-0,.sd-gy-0{--sd-gutter-y: 0}.sd-g-0,.sd-gx-0{--sd-gutter-x: 0}.sd-g-1,.sd-gy-1{--sd-gutter-y: 0.25rem}.sd-g-1,.sd-gx-1{--sd-gutter-x: 0.25rem}.sd-g-2,.sd-gy-2{--sd-gutter-y: 0.5rem}.sd-g-2,.sd-gx-2{--sd-gutter-x: 0.5rem}.sd-g-3,.sd-gy-3{--sd-gutter-y: 1rem}.sd-g-3,.sd-gx-3{--sd-gutter-x: 1rem}.sd-g-4,.sd-gy-4{--sd-gutter-y: 1.5rem}.sd-g-4,.sd-gx-4{--sd-gutter-x: 1.5rem}.sd-g-5,.sd-gy-5{--sd-gutter-y: 3rem}.sd-g-5,.sd-gx-5{--sd-gutter-x: 3rem}@media(min-width: 576px){.sd-col-sm-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-sm-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-sm-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-sm-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-sm-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-sm-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-sm-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-sm-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-sm-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-sm-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-sm-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-sm-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-sm-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-sm-0,.sd-gy-sm-0{--sd-gutter-y: 0}.sd-g-sm-0,.sd-gx-sm-0{--sd-gutter-x: 0}.sd-g-sm-1,.sd-gy-sm-1{--sd-gutter-y: 0.25rem}.sd-g-sm-1,.sd-gx-sm-1{--sd-gutter-x: 0.25rem}.sd-g-sm-2,.sd-gy-sm-2{--sd-gutter-y: 0.5rem}.sd-g-sm-2,.sd-gx-sm-2{--sd-gutter-x: 0.5rem}.sd-g-sm-3,.sd-gy-sm-3{--sd-gutter-y: 1rem}.sd-g-sm-3,.sd-gx-sm-3{--sd-gutter-x: 1rem}.sd-g-sm-4,.sd-gy-sm-4{--sd-gutter-y: 1.5rem}.sd-g-sm-4,.sd-gx-sm-4{--sd-gutter-x: 1.5rem}.sd-g-sm-5,.sd-gy-sm-5{--sd-gutter-y: 3rem}.sd-g-sm-5,.sd-gx-sm-5{--sd-gutter-x: 3rem}}@media(min-width: 768px){.sd-col-md-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-md-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-md-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-md-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-md-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-md-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-md-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-md-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-md-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-md-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-md-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-md-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-md-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-md-0,.sd-gy-md-0{--sd-gutter-y: 0}.sd-g-md-0,.sd-gx-md-0{--sd-gutter-x: 0}.sd-g-md-1,.sd-gy-md-1{--sd-gutter-y: 0.25rem}.sd-g-md-1,.sd-gx-md-1{--sd-gutter-x: 0.25rem}.sd-g-md-2,.sd-gy-md-2{--sd-gutter-y: 0.5rem}.sd-g-md-2,.sd-gx-md-2{--sd-gutter-x: 0.5rem}.sd-g-md-3,.sd-gy-md-3{--sd-gutter-y: 1rem}.sd-g-md-3,.sd-gx-md-3{--sd-gutter-x: 1rem}.sd-g-md-4,.sd-gy-md-4{--sd-gutter-y: 1.5rem}.sd-g-md-4,.sd-gx-md-4{--sd-gutter-x: 1.5rem}.sd-g-md-5,.sd-gy-md-5{--sd-gutter-y: 3rem}.sd-g-md-5,.sd-gx-md-5{--sd-gutter-x: 3rem}}@media(min-width: 992px){.sd-col-lg-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-lg-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-lg-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-lg-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-lg-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-lg-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-lg-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-lg-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-lg-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-lg-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-lg-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-lg-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-lg-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-lg-0,.sd-gy-lg-0{--sd-gutter-y: 0}.sd-g-lg-0,.sd-gx-lg-0{--sd-gutter-x: 0}.sd-g-lg-1,.sd-gy-lg-1{--sd-gutter-y: 0.25rem}.sd-g-lg-1,.sd-gx-lg-1{--sd-gutter-x: 0.25rem}.sd-g-lg-2,.sd-gy-lg-2{--sd-gutter-y: 0.5rem}.sd-g-lg-2,.sd-gx-lg-2{--sd-gutter-x: 0.5rem}.sd-g-lg-3,.sd-gy-lg-3{--sd-gutter-y: 1rem}.sd-g-lg-3,.sd-gx-lg-3{--sd-gutter-x: 1rem}.sd-g-lg-4,.sd-gy-lg-4{--sd-gutter-y: 1.5rem}.sd-g-lg-4,.sd-gx-lg-4{--sd-gutter-x: 1.5rem}.sd-g-lg-5,.sd-gy-lg-5{--sd-gutter-y: 3rem}.sd-g-lg-5,.sd-gx-lg-5{--sd-gutter-x: 3rem}}@media(min-width: 1200px){.sd-col-xl-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto}.sd-col-xl-1{-ms-flex:0 0 auto;flex:0 0 auto;width:8.3333333333%}.sd-col-xl-2{-ms-flex:0 0 auto;flex:0 0 auto;width:16.6666666667%}.sd-col-xl-3{-ms-flex:0 0 auto;flex:0 0 auto;width:25%}.sd-col-xl-4{-ms-flex:0 0 auto;flex:0 0 auto;width:33.3333333333%}.sd-col-xl-5{-ms-flex:0 0 auto;flex:0 0 auto;width:41.6666666667%}.sd-col-xl-6{-ms-flex:0 0 auto;flex:0 0 auto;width:50%}.sd-col-xl-7{-ms-flex:0 0 auto;flex:0 0 auto;width:58.3333333333%}.sd-col-xl-8{-ms-flex:0 0 auto;flex:0 0 auto;width:66.6666666667%}.sd-col-xl-9{-ms-flex:0 0 auto;flex:0 0 auto;width:75%}.sd-col-xl-10{-ms-flex:0 0 auto;flex:0 0 auto;width:83.3333333333%}.sd-col-xl-11{-ms-flex:0 0 auto;flex:0 0 auto;width:91.6666666667%}.sd-col-xl-12{-ms-flex:0 0 auto;flex:0 0 auto;width:100%}.sd-g-xl-0,.sd-gy-xl-0{--sd-gutter-y: 0}.sd-g-xl-0,.sd-gx-xl-0{--sd-gutter-x: 0}.sd-g-xl-1,.sd-gy-xl-1{--sd-gutter-y: 0.25rem}.sd-g-xl-1,.sd-gx-xl-1{--sd-gutter-x: 0.25rem}.sd-g-xl-2,.sd-gy-xl-2{--sd-gutter-y: 0.5rem}.sd-g-xl-2,.sd-gx-xl-2{--sd-gutter-x: 0.5rem}.sd-g-xl-3,.sd-gy-xl-3{--sd-gutter-y: 1rem}.sd-g-xl-3,.sd-gx-xl-3{--sd-gutter-x: 1rem}.sd-g-xl-4,.sd-gy-xl-4{--sd-gutter-y: 1.5rem}.sd-g-xl-4,.sd-gx-xl-4{--sd-gutter-x: 1.5rem}.sd-g-xl-5,.sd-gy-xl-5{--sd-gutter-y: 3rem}.sd-g-xl-5,.sd-gx-xl-5{--sd-gutter-x: 3rem}}.sd-flex-row-reverse{flex-direction:row-reverse !important}details.sd-dropdown{position:relative}details.sd-dropdown .sd-summary-title{font-weight:700;padding-right:3em !important;-moz-user-select:none;-ms-user-select:none;-webkit-user-select:none;user-select:none}details.sd-dropdown:hover{cursor:pointer}details.sd-dropdown .sd-summary-content{cursor:default}details.sd-dropdown summary{list-style:none;padding:1em}details.sd-dropdown summary .sd-octicon.no-title{vertical-align:middle}details.sd-dropdown[open] summary .sd-octicon.no-title{visibility:hidden}details.sd-dropdown summary::-webkit-details-marker{display:none}details.sd-dropdown summary:focus{outline:none}details.sd-dropdown .sd-summary-icon{margin-right:.5em}details.sd-dropdown .sd-summary-icon svg{opacity:.8}details.sd-dropdown summary:hover .sd-summary-up svg,details.sd-dropdown summary:hover .sd-summary-down svg{opacity:1;transform:scale(1.1)}details.sd-dropdown .sd-summary-up svg,details.sd-dropdown .sd-summary-down svg{display:block;opacity:.6}details.sd-dropdown .sd-summary-up,details.sd-dropdown .sd-summary-down{pointer-events:none;position:absolute;right:1em;top:1em}details.sd-dropdown[open]>.sd-summary-title .sd-summary-down{visibility:hidden}details.sd-dropdown:not([open])>.sd-summary-title .sd-summary-up{visibility:hidden}details.sd-dropdown:not([open]).sd-card{border:none}details.sd-dropdown:not([open])>.sd-card-header{border:1px solid var(--sd-color-card-border);border-radius:.25rem}details.sd-dropdown.sd-fade-in[open] summary~*{-moz-animation:sd-fade-in .5s ease-in-out;-webkit-animation:sd-fade-in .5s ease-in-out;animation:sd-fade-in .5s ease-in-out}details.sd-dropdown.sd-fade-in-slide-down[open] summary~*{-moz-animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out;-webkit-animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out;animation:sd-fade-in .5s ease-in-out,sd-slide-down .5s ease-in-out}.sd-col>.sd-dropdown{width:100%}.sd-summary-content>.sd-tab-set:first-child{margin-top:0}@keyframes sd-fade-in{0%{opacity:0}100%{opacity:1}}@keyframes sd-slide-down{0%{transform:translate(0, -10px)}100%{transform:translate(0, 0)}}.sd-tab-set{border-radius:.125rem;display:flex;flex-wrap:wrap;margin:1em 0;position:relative}.sd-tab-set>input{opacity:0;position:absolute}.sd-tab-set>input:checked+label{border-color:var(--sd-color-tabs-underline-active);color:var(--sd-color-tabs-label-active)}.sd-tab-set>input:checked+label+.sd-tab-content{display:block}.sd-tab-set>input:not(:checked)+label:hover{color:var(--sd-color-tabs-label-hover);border-color:var(--sd-color-tabs-underline-hover)}.sd-tab-set>input:focus+label{outline-style:auto}.sd-tab-set>input:not(.focus-visible)+label{outline:none;-webkit-tap-highlight-color:transparent}.sd-tab-set>label{border-bottom:.125rem solid transparent;margin-bottom:0;color:var(--sd-color-tabs-label-inactive);border-color:var(--sd-color-tabs-underline-inactive);cursor:pointer;font-size:var(--sd-fontsize-tabs-label);font-weight:700;padding:1em 1.25em .5em;transition:color 250ms;width:auto;z-index:1}html .sd-tab-set>label:hover{color:var(--sd-color-tabs-label-active)}.sd-col>.sd-tab-set{width:100%}.sd-tab-content{box-shadow:0 -0.0625rem var(--sd-color-tabs-overline),0 .0625rem var(--sd-color-tabs-underline);display:none;order:99;padding-bottom:.75rem;padding-top:.75rem;width:100%}.sd-tab-content>:first-child{margin-top:0 !important}.sd-tab-content>:last-child{margin-bottom:0 !important}.sd-tab-content>.sd-tab-set{margin:0}.sd-sphinx-override,.sd-sphinx-override *{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.sd-sphinx-override p{margin-top:0}:root{--sd-color-primary: #007bff;--sd-color-secondary: #6c757d;--sd-color-success: #28a745;--sd-color-info: #17a2b8;--sd-color-warning: #f0b37e;--sd-color-danger: #dc3545;--sd-color-light: #f8f9fa;--sd-color-muted: #6c757d;--sd-color-dark: #212529;--sd-color-black: black;--sd-color-white: white;--sd-color-primary-highlight: #0069d9;--sd-color-secondary-highlight: #5c636a;--sd-color-success-highlight: #228e3b;--sd-color-info-highlight: #148a9c;--sd-color-warning-highlight: #cc986b;--sd-color-danger-highlight: #bb2d3b;--sd-color-light-highlight: #d3d4d5;--sd-color-muted-highlight: #5c636a;--sd-color-dark-highlight: #1c1f23;--sd-color-black-highlight: black;--sd-color-white-highlight: #d9d9d9;--sd-color-primary-text: #fff;--sd-color-secondary-text: #fff;--sd-color-success-text: #fff;--sd-color-info-text: #fff;--sd-color-warning-text: #212529;--sd-color-danger-text: #fff;--sd-color-light-text: #212529;--sd-color-muted-text: #fff;--sd-color-dark-text: #fff;--sd-color-black-text: #fff;--sd-color-white-text: #212529;--sd-color-shadow: rgba(0, 0, 0, 0.15);--sd-color-card-border: rgba(0, 0, 0, 0.125);--sd-color-card-border-hover: hsla(231, 99%, 66%, 1);--sd-color-card-background: transparent;--sd-color-card-text: inherit;--sd-color-card-header: transparent;--sd-color-card-footer: transparent;--sd-color-tabs-label-active: hsla(231, 99%, 66%, 1);--sd-color-tabs-label-hover: hsla(231, 99%, 66%, 1);--sd-color-tabs-label-inactive: hsl(0, 0%, 66%);--sd-color-tabs-underline-active: hsla(231, 99%, 66%, 1);--sd-color-tabs-underline-hover: rgba(178, 206, 245, 0.62);--sd-color-tabs-underline-inactive: transparent;--sd-color-tabs-overline: rgb(222, 222, 222);--sd-color-tabs-underline: rgb(222, 222, 222);--sd-fontsize-tabs-label: 1rem}
diff --git a/docs/_build/html/_static/design-tabs.js b/docs/_build/html/_static/design-tabs.js
deleted file mode 100644
index 36b38cf..0000000
--- a/docs/_build/html/_static/design-tabs.js
+++ /dev/null
@@ -1,27 +0,0 @@
-var sd_labels_by_text = {};
-
-function ready() {
-  const li = document.getElementsByClassName("sd-tab-label");
-  for (const label of li) {
-    syncId = label.getAttribute("data-sync-id");
-    if (syncId) {
-      label.onclick = onLabelClick;
-      if (!sd_labels_by_text[syncId]) {
-        sd_labels_by_text[syncId] = [];
-      }
-      sd_labels_by_text[syncId].push(label);
-    }
-  }
-}
-
-function onLabelClick() {
-  // Activate other inputs with the same sync id.
-  syncId = this.getAttribute("data-sync-id");
-  for (label of sd_labels_by_text[syncId]) {
-    if (label === this) continue;
-    label.previousElementSibling.checked = true;
-  }
-  window.localStorage.setItem("sphinx-design-last-tab", syncId);
-}
-
-document.addEventListener("DOMContentLoaded", ready, false);
diff --git a/docs/_build/html/_static/doctools.js b/docs/_build/html/_static/doctools.js
deleted file mode 100644
index c3db08d..0000000
--- a/docs/_build/html/_static/doctools.js
+++ /dev/null
@@ -1,264 +0,0 @@
-/*
- * doctools.js
- * ~~~~~~~~~~~
- *
- * Base JavaScript utilities for all Sphinx HTML documentation.
- *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
- * :license: BSD, see LICENSE for details.
- *
- */
-"use strict";
-
-const _ready = (callback) => {
-  if (document.readyState !== "loading") {
-    callback();
-  } else {
-    document.addEventListener("DOMContentLoaded", callback);
-  }
-};
-
-/**
- * highlight a given string on a node by wrapping it in
- * span elements with the given class name.
- */
-const _highlight = (node, addItems, text, className) => {
-  if (node.nodeType === Node.TEXT_NODE) {
-    const val = node.nodeValue;
-    const parent = node.parentNode;
-    const pos = val.toLowerCase().indexOf(text);
-    if (
-      pos >= 0 &&
-      !parent.classList.contains(className) &&
-      !parent.classList.contains("nohighlight")
-    ) {
-      let span;
-
-      const closestNode = parent.closest("body, svg, foreignObject");
-      const isInSVG = closestNode && closestNode.matches("svg");
-      if (isInSVG) {
-        span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
-      } else {
-        span = document.createElement("span");
-        span.classList.add(className);
-      }
-
-      span.appendChild(document.createTextNode(val.substr(pos, text.length)));
-      parent.insertBefore(
-        span,
-        parent.insertBefore(
-          document.createTextNode(val.substr(pos + text.length)),
-          node.nextSibling
-        )
-      );
-      node.nodeValue = val.substr(0, pos);
-
-      if (isInSVG) {
-        const rect = document.createElementNS(
-          "http://www.w3.org/2000/svg",
-          "rect"
-        );
-        const bbox = parent.getBBox();
-        rect.x.baseVal.value = bbox.x;
-        rect.y.baseVal.value = bbox.y;
-        rect.width.baseVal.value = bbox.width;
-        rect.height.baseVal.value = bbox.height;
-        rect.setAttribute("class", className);
-        addItems.push({ parent: parent, target: rect });
-      }
-    }
-  } else if (node.matches && !node.matches("button, select, textarea")) {
-    node.childNodes.forEach((el) => _highlight(el, addItems, text, className));
-  }
-};
-const _highlightText = (thisNode, text, className) => {
-  let addItems = [];
-  _highlight(thisNode, addItems, text, className);
-  addItems.forEach((obj) =>
-    obj.parent.insertAdjacentElement("beforebegin", obj.target)
-  );
-};
-
-/**
- * Small JavaScript module for the documentation.
- */
-const Documentation = {
-  init: () => {
-    Documentation.highlightSearchWords();
-    Documentation.initDomainIndexTable();
-    Documentation.initOnKeyListeners();
-  },
-
-  /**
-   * i18n support
-   */
-  TRANSLATIONS: {},
-  PLURAL_EXPR: (n) => (n === 1 ? 0 : 1),
-  LOCALE: "unknown",
-
-  // gettext and ngettext don't access this so that the functions
-  // can safely bound to a different name (_ = Documentation.gettext)
-  gettext: (string) => {
-    const translated = Documentation.TRANSLATIONS[string];
-    switch (typeof translated) {
-      case "undefined":
-        return string; // no translation
-      case "string":
-        return translated; // translation exists
-      default:
-        return translated[0]; // (singular, plural) translation tuple exists
-    }
-  },
-
-  ngettext: (singular, plural, n) => {
-    const translated = Documentation.TRANSLATIONS[singular];
-    if (typeof translated !== "undefined")
-      return translated[Documentation.PLURAL_EXPR(n)];
-    return n === 1 ? singular : plural;
-  },
-
-  addTranslations: (catalog) => {
-    Object.assign(Documentation.TRANSLATIONS, catalog.messages);
-    Documentation.PLURAL_EXPR = new Function(
-      "n",
-      `return (${catalog.plural_expr})`
-    );
-    Documentation.LOCALE = catalog.locale;
-  },
-
-  /**
-   * highlight the search words provided in the url in the text
-   */
-  highlightSearchWords: () => {
-    const highlight =
-      new URLSearchParams(window.location.search).get("highlight") || "";
-    const terms = highlight.toLowerCase().split(/\s+/).filter(x => x);
-    if (terms.length === 0) return; // nothing to do
-
-    // There should never be more than one element matching "div.body"
-    const divBody = document.querySelectorAll("div.body");
-    const body = divBody.length ? divBody[0] : document.querySelector("body");
-    window.setTimeout(() => {
-      terms.forEach((term) => _highlightText(body, term, "highlighted"));
-    }, 10);
-
-    const searchBox = document.getElementById("searchbox");
-    if (searchBox === null) return;
-    searchBox.appendChild(
-      document
-        .createRange()
-        .createContextualFragment(
-          '<p class="highlight-link">' +
-            '<a href="javascript:Documentation.hideSearchWords()">' +
-            Documentation.gettext("Hide Search Matches") +
-            "</a></p>"
-        )
-    );
-  },
-
-  /**
-   * helper function to hide the search marks again
-   */
-  hideSearchWords: () => {
-    document
-      .querySelectorAll("#searchbox .highlight-link")
-      .forEach((el) => el.remove());
-    document
-      .querySelectorAll("span.highlighted")
-      .forEach((el) => el.classList.remove("highlighted"));
-    const url = new URL(window.location);
-    url.searchParams.delete("highlight");
-    window.history.replaceState({}, "", url);
-  },
-
-  /**
-   * helper function to focus on search bar
-   */
-  focusSearchBar: () => {
-    document.querySelectorAll("input[name=q]")[0]?.focus();
-  },
-
-  /**
-   * Initialise the domain index toggle buttons
-   */
-  initDomainIndexTable: () => {
-    const toggler = (el) => {
-      const idNumber = el.id.substr(7);
-      const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`);
-      if (el.src.substr(-9) === "minus.png") {
-        el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`;
-        toggledRows.forEach((el) => (el.style.display = "none"));
-      } else {
-        el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`;
-        toggledRows.forEach((el) => (el.style.display = ""));
-      }
-    };
-
-    const togglerElements = document.querySelectorAll("img.toggler");
-    togglerElements.forEach((el) =>
-      el.addEventListener("click", (event) => toggler(event.currentTarget))
-    );
-    togglerElements.forEach((el) => (el.style.display = ""));
-    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler);
-  },
-
-  initOnKeyListeners: () => {
-    // only install a listener if it is really needed
-    if (
-      !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS &&
-      !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS
-    )
-      return;
-
-    const blacklistedElements = new Set([
-      "TEXTAREA",
-      "INPUT",
-      "SELECT",
-      "BUTTON",
-    ]);
-    document.addEventListener("keydown", (event) => {
-      if (blacklistedElements.has(document.activeElement.tagName)) return; // bail for input elements
-      if (event.altKey || event.ctrlKey || event.metaKey) return; // bail with special keys
-
-      if (!event.shiftKey) {
-        switch (event.key) {
-          case "ArrowLeft":
-            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
-
-            const prevLink = document.querySelector('link[rel="prev"]');
-            if (prevLink && prevLink.href) {
-              window.location.href = prevLink.href;
-              event.preventDefault();
-            }
-            break;
-          case "ArrowRight":
-            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
-
-            const nextLink = document.querySelector('link[rel="next"]');
-            if (nextLink && nextLink.href) {
-              window.location.href = nextLink.href;
-              event.preventDefault();
-            }
-            break;
-          case "Escape":
-            if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
-            Documentation.hideSearchWords();
-            event.preventDefault();
-        }
-      }
-
-      // some keyboard layouts may need Shift to get /
-      switch (event.key) {
-        case "/":
-          if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
-          Documentation.focusSearchBar();
-          event.preventDefault();
-      }
-    });
-  },
-};
-
-// quick alias for translations
-const _ = Documentation.gettext;
-
-_ready(Documentation.init);
diff --git a/docs/_build/html/_static/documentation_options.js b/docs/_build/html/_static/documentation_options.js
deleted file mode 100644
index 162a6ba..0000000
--- a/docs/_build/html/_static/documentation_options.js
+++ /dev/null
@@ -1,14 +0,0 @@
-var DOCUMENTATION_OPTIONS = {
-    URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'),
-    VERSION: '',
-    LANGUAGE: 'en',
-    COLLAPSE_INDEX: false,
-    BUILDER: 'html',
-    FILE_SUFFIX: '.html',
-    LINK_SUFFIX: '.html',
-    HAS_SOURCE: true,
-    SOURCELINK_SUFFIX: '',
-    NAVIGATION_WITH_KEYS: false,
-    SHOW_SEARCH_SUMMARY: true,
-    ENABLE_SEARCH_SHORTCUTS: false,
-};
\ No newline at end of file
diff --git a/docs/_build/html/_static/file.png b/docs/_build/html/_static/file.png
deleted file mode 100644
index a858a41..0000000
Binary files a/docs/_build/html/_static/file.png and /dev/null differ
diff --git a/docs/_build/html/_static/images/logo_binder.svg b/docs/_build/html/_static/images/logo_binder.svg
deleted file mode 100644
index 45fecf7..0000000
--- a/docs/_build/html/_static/images/logo_binder.svg
+++ /dev/null
@@ -1,19 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!-- Generator: Adobe Illustrator 23.0.1, SVG Export Plug-In . SVG Version: 6.00 Build 0)  -->
-<svg version="1.1" id="Layer_1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px"
-	 viewBox="0 0 44.4 44.4" style="enable-background:new 0 0 44.4 44.4;" xml:space="preserve">
-<style type="text/css">
-	.st0{fill:none;stroke:#F5A252;stroke-width:5;stroke-miterlimit:10;}
-	.st1{fill:none;stroke:#579ACA;stroke-width:5;stroke-miterlimit:10;}
-	.st2{fill:none;stroke:#E66581;stroke-width:5;stroke-miterlimit:10;}
-</style>
-<title>logo</title>
-<g>
-	<path class="st0" d="M33.9,6.4c3.6,3.9,3.4,9.9-0.5,13.5s-9.9,3.4-13.5-0.5s-3.4-9.9,0.5-13.5l0,0C24.2,2.4,30.2,2.6,33.9,6.4z"/>
-	<path class="st1" d="M35.1,27.3c2.6,4.6,1.1,10.4-3.5,13c-4.6,2.6-10.4,1.1-13-3.5s-1.1-10.4,3.5-13l0,0
-		C26.6,21.2,32.4,22.7,35.1,27.3z"/>
-	<path class="st2" d="M25.9,17.8c2.6,4.6,1.1,10.4-3.5,13s-10.4,1.1-13-3.5s-1.1-10.4,3.5-13l0,0C17.5,11.7,23.3,13.2,25.9,17.8z"/>
-	<path class="st1" d="M19.2,26.4c3.1-4.3,9.1-5.2,13.3-2.1c1.1,0.8,2,1.8,2.7,3"/>
-	<path class="st0" d="M19.9,19.4c-3.6-3.9-3.4-9.9,0.5-13.5s9.9-3.4,13.5,0.5"/>
-</g>
-</svg>
diff --git a/docs/_build/html/_static/images/logo_colab.png b/docs/_build/html/_static/images/logo_colab.png
deleted file mode 100644
index b7560ec..0000000
Binary files a/docs/_build/html/_static/images/logo_colab.png and /dev/null differ
diff --git a/docs/_build/html/_static/images/logo_deepnote.svg b/docs/_build/html/_static/images/logo_deepnote.svg
deleted file mode 100644
index fa77ebf..0000000
--- a/docs/_build/html/_static/images/logo_deepnote.svg
+++ /dev/null
@@ -1 +0,0 @@
-<svg viewBox="0 0 128 128" fill="none" xmlns="http://www.w3.org/2000/svg"><path fill-rule="evenodd" clip-rule="evenodd" d="M0 128h52.512l29.539-11.077-11.077-43.487-34.051 3.693L0 128Z" fill="#0076D4"/><path fill-rule="evenodd" clip-rule="evenodd" d="M52.513 128s16.6-8.759 19.673-24.277c3.072-15.517-12.091-26.594-35.263-26.594 0-.41 20.343-28.718 20.343-28.718l49.4 1.435L95.71 107.7l-20.452 15.978L52.513 128Z" fill="#002868"/><path fill-rule="evenodd" clip-rule="evenodd" d="M0 60.718 41.025.001s1.006.01 3.282 0c16.082-.068 81.23 3.12 81.23 60.368 0 65.352-73.025 67.631-73.025 67.631s30.495-5.839 30.495-34.816c0-28.978-27.541-32.466-45.264-32.466H0Z" fill="#00A9FF"/></svg>
diff --git a/docs/_build/html/_static/images/logo_jupyterhub.svg b/docs/_build/html/_static/images/logo_jupyterhub.svg
deleted file mode 100644
index 60cfe9f..0000000
--- a/docs/_build/html/_static/images/logo_jupyterhub.svg
+++ /dev/null
@@ -1 +0,0 @@
-<svg id="Layer_1" data-name="Layer 1" xmlns="http://www.w3.org/2000/svg" width="38.73" height="50" viewBox="0 0 38.73 50"><defs><style>.cls-1{fill:#767677;}.cls-2{fill:#f37726;}.cls-3{fill:#9e9e9e;}.cls-4{fill:#616262;}.cls-5{font-size:17.07px;fill:#fff;font-family:Roboto-Regular, Roboto;}</style></defs><title>logo_jupyterhub</title><g id="Canvas"><path id="path7_fill" data-name="path7 fill" class="cls-1" d="M39.51,3.53a3,3,0,0,1-1.7,2.9A3,3,0,0,1,34.48,6a3,3,0,0,1-.82-3.26,3,3,0,0,1,1.05-1.41A3,3,0,0,1,37.52.86a2.88,2.88,0,0,1,1,.6,3,3,0,0,1,.7.93,3.18,3.18,0,0,1,.28,1.14Z" transform="translate(-1.87 -0.69)"/><path id="path8_fill" data-name="path8 fill" class="cls-2" d="M21.91,38.39c-8,0-15.06-2.87-18.7-7.12a19.93,19.93,0,0,0,37.39,0C37,35.52,30,38.39,21.91,38.39Z" transform="translate(-1.87 -0.69)"/><path id="path9_fill" data-name="path9 fill" class="cls-2" d="M21.91,10.78c8,0,15.05,2.87,18.69,7.12a19.93,19.93,0,0,0-37.39,0C6.85,13.64,13.86,10.78,21.91,10.78Z" transform="translate(-1.87 -0.69)"/><path id="path10_fill" data-name="path10 fill" class="cls-3" d="M10.88,46.66a3.86,3.86,0,0,1-.52,2.15,3.81,3.81,0,0,1-1.62,1.51,3.93,3.93,0,0,1-2.19.34,3.79,3.79,0,0,1-2-.94,3.73,3.73,0,0,1-1.14-1.9,3.79,3.79,0,0,1,.1-2.21,3.86,3.86,0,0,1,1.33-1.78,3.92,3.92,0,0,1,3.54-.53,3.85,3.85,0,0,1,2.14,1.93,3.74,3.74,0,0,1,.37,1.43Z" transform="translate(-1.87 -0.69)"/><path id="path11_fill" data-name="path11 fill" class="cls-4" d="M4.12,9.81A2.18,2.18,0,0,1,2.9,9.48a2.23,2.23,0,0,1-.84-1A2.26,2.26,0,0,1,1.9,7.26a2.13,2.13,0,0,1,.56-1.13,2.18,2.18,0,0,1,2.36-.56,2.13,2.13,0,0,1,1,.76,2.18,2.18,0,0,1,.42,1.2A2.22,2.22,0,0,1,4.12,9.81Z" transform="translate(-1.87 -0.69)"/></g><text class="cls-5" transform="translate(5.24 30.01)">Hub</text></svg>
diff --git a/docs/_build/html/_static/jquery-3.6.0.js b/docs/_build/html/_static/jquery-3.6.0.js
deleted file mode 100644
index fc6c299..0000000
--- a/docs/_build/html/_static/jquery-3.6.0.js
+++ /dev/null
@@ -1,10881 +0,0 @@
-/*!
- * jQuery JavaScript Library v3.6.0
- * https://jquery.com/
- *
- * Includes Sizzle.js
- * https://sizzlejs.com/
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license
- * https://jquery.org/license
- *
- * Date: 2021-03-02T17:08Z
- */
-( function( global, factory ) {
-
-	"use strict";
-
-	if ( typeof module === "object" && typeof module.exports === "object" ) {
-
-		// For CommonJS and CommonJS-like environments where a proper `window`
-		// is present, execute the factory and get jQuery.
-		// For environments that do not have a `window` with a `document`
-		// (such as Node.js), expose a factory as module.exports.
-		// This accentuates the need for the creation of a real `window`.
-		// e.g. var jQuery = require("jquery")(window);
-		// See ticket #14549 for more info.
-		module.exports = global.document ?
-			factory( global, true ) :
-			function( w ) {
-				if ( !w.document ) {
-					throw new Error( "jQuery requires a window with a document" );
-				}
-				return factory( w );
-			};
-	} else {
-		factory( global );
-	}
-
-// Pass this if window is not defined yet
-} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
-
-// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1
-// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode
-// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common
-// enough that all such attempts are guarded in a try block.
-"use strict";
-
-var arr = [];
-
-var getProto = Object.getPrototypeOf;
-
-var slice = arr.slice;
-
-var flat = arr.flat ? function( array ) {
-	return arr.flat.call( array );
-} : function( array ) {
-	return arr.concat.apply( [], array );
-};
-
-
-var push = arr.push;
-
-var indexOf = arr.indexOf;
-
-var class2type = {};
-
-var toString = class2type.toString;
-
-var hasOwn = class2type.hasOwnProperty;
-
-var fnToString = hasOwn.toString;
-
-var ObjectFunctionString = fnToString.call( Object );
-
-var support = {};
-
-var isFunction = function isFunction( obj ) {
-
-		// Support: Chrome <=57, Firefox <=52
-		// In some browsers, typeof returns "function" for HTML <object> elements
-		// (i.e., `typeof document.createElement( "object" ) === "function"`).
-		// We don't want to classify *any* DOM node as a function.
-		// Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5
-		// Plus for old WebKit, typeof returns "function" for HTML collections
-		// (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756)
-		return typeof obj === "function" && typeof obj.nodeType !== "number" &&
-			typeof obj.item !== "function";
-	};
-
-
-var isWindow = function isWindow( obj ) {
-		return obj != null && obj === obj.window;
-	};
-
-
-var document = window.document;
-
-
-
-	var preservedScriptAttributes = {
-		type: true,
-		src: true,
-		nonce: true,
-		noModule: true
-	};
-
-	function DOMEval( code, node, doc ) {
-		doc = doc || document;
-
-		var i, val,
-			script = doc.createElement( "script" );
-
-		script.text = code;
-		if ( node ) {
-			for ( i in preservedScriptAttributes ) {
-
-				// Support: Firefox 64+, Edge 18+
-				// Some browsers don't support the "nonce" property on scripts.
-				// On the other hand, just using `getAttribute` is not enough as
-				// the `nonce` attribute is reset to an empty string whenever it
-				// becomes browsing-context connected.
-				// See https://github.com/whatwg/html/issues/2369
-				// See https://html.spec.whatwg.org/#nonce-attributes
-				// The `node.getAttribute` check was added for the sake of
-				// `jQuery.globalEval` so that it can fake a nonce-containing node
-				// via an object.
-				val = node[ i ] || node.getAttribute && node.getAttribute( i );
-				if ( val ) {
-					script.setAttribute( i, val );
-				}
-			}
-		}
-		doc.head.appendChild( script ).parentNode.removeChild( script );
-	}
-
-
-function toType( obj ) {
-	if ( obj == null ) {
-		return obj + "";
-	}
-
-	// Support: Android <=2.3 only (functionish RegExp)
-	return typeof obj === "object" || typeof obj === "function" ?
-		class2type[ toString.call( obj ) ] || "object" :
-		typeof obj;
-}
-/* global Symbol */
-// Defining this global in .eslintrc.json would create a danger of using the global
-// unguarded in another place, it seems safer to define global only for this module
-
-
-
-var
-	version = "3.6.0",
-
-	// Define a local copy of jQuery
-	jQuery = function( selector, context ) {
-
-		// The jQuery object is actually just the init constructor 'enhanced'
-		// Need init if jQuery is called (just allow error to be thrown if not included)
-		return new jQuery.fn.init( selector, context );
-	};
-
-jQuery.fn = jQuery.prototype = {
-
-	// The current version of jQuery being used
-	jquery: version,
-
-	constructor: jQuery,
-
-	// The default length of a jQuery object is 0
-	length: 0,
-
-	toArray: function() {
-		return slice.call( this );
-	},
-
-	// Get the Nth element in the matched element set OR
-	// Get the whole matched element set as a clean array
-	get: function( num ) {
-
-		// Return all the elements in a clean array
-		if ( num == null ) {
-			return slice.call( this );
-		}
-
-		// Return just the one element from the set
-		return num < 0 ? this[ num + this.length ] : this[ num ];
-	},
-
-	// Take an array of elements and push it onto the stack
-	// (returning the new matched element set)
-	pushStack: function( elems ) {
-
-		// Build a new jQuery matched element set
-		var ret = jQuery.merge( this.constructor(), elems );
-
-		// Add the old object onto the stack (as a reference)
-		ret.prevObject = this;
-
-		// Return the newly-formed element set
-		return ret;
-	},
-
-	// Execute a callback for every element in the matched set.
-	each: function( callback ) {
-		return jQuery.each( this, callback );
-	},
-
-	map: function( callback ) {
-		return this.pushStack( jQuery.map( this, function( elem, i ) {
-			return callback.call( elem, i, elem );
-		} ) );
-	},
-
-	slice: function() {
-		return this.pushStack( slice.apply( this, arguments ) );
-	},
-
-	first: function() {
-		return this.eq( 0 );
-	},
-
-	last: function() {
-		return this.eq( -1 );
-	},
-
-	even: function() {
-		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
-			return ( i + 1 ) % 2;
-		} ) );
-	},
-
-	odd: function() {
-		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
-			return i % 2;
-		} ) );
-	},
-
-	eq: function( i ) {
-		var len = this.length,
-			j = +i + ( i < 0 ? len : 0 );
-		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
-	},
-
-	end: function() {
-		return this.prevObject || this.constructor();
-	},
-
-	// For internal use only.
-	// Behaves like an Array's method, not like a jQuery method.
-	push: push,
-	sort: arr.sort,
-	splice: arr.splice
-};
-
-jQuery.extend = jQuery.fn.extend = function() {
-	var options, name, src, copy, copyIsArray, clone,
-		target = arguments[ 0 ] || {},
-		i = 1,
-		length = arguments.length,
-		deep = false;
-
-	// Handle a deep copy situation
-	if ( typeof target === "boolean" ) {
-		deep = target;
-
-		// Skip the boolean and the target
-		target = arguments[ i ] || {};
-		i++;
-	}
-
-	// Handle case when target is a string or something (possible in deep copy)
-	if ( typeof target !== "object" && !isFunction( target ) ) {
-		target = {};
-	}
-
-	// Extend jQuery itself if only one argument is passed
-	if ( i === length ) {
-		target = this;
-		i--;
-	}
-
-	for ( ; i < length; i++ ) {
-
-		// Only deal with non-null/undefined values
-		if ( ( options = arguments[ i ] ) != null ) {
-
-			// Extend the base object
-			for ( name in options ) {
-				copy = options[ name ];
-
-				// Prevent Object.prototype pollution
-				// Prevent never-ending loop
-				if ( name === "__proto__" || target === copy ) {
-					continue;
-				}
-
-				// Recurse if we're merging plain objects or arrays
-				if ( deep && copy && ( jQuery.isPlainObject( copy ) ||
-					( copyIsArray = Array.isArray( copy ) ) ) ) {
-					src = target[ name ];
-
-					// Ensure proper type for the source value
-					if ( copyIsArray && !Array.isArray( src ) ) {
-						clone = [];
-					} else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) {
-						clone = {};
-					} else {
-						clone = src;
-					}
-					copyIsArray = false;
-
-					// Never move original objects, clone them
-					target[ name ] = jQuery.extend( deep, clone, copy );
-
-				// Don't bring in undefined values
-				} else if ( copy !== undefined ) {
-					target[ name ] = copy;
-				}
-			}
-		}
-	}
-
-	// Return the modified object
-	return target;
-};
-
-jQuery.extend( {
-
-	// Unique for each copy of jQuery on the page
-	expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ),
-
-	// Assume jQuery is ready without the ready module
-	isReady: true,
-
-	error: function( msg ) {
-		throw new Error( msg );
-	},
-
-	noop: function() {},
-
-	isPlainObject: function( obj ) {
-		var proto, Ctor;
-
-		// Detect obvious negatives
-		// Use toString instead of jQuery.type to catch host objects
-		if ( !obj || toString.call( obj ) !== "[object Object]" ) {
-			return false;
-		}
-
-		proto = getProto( obj );
-
-		// Objects with no prototype (e.g., `Object.create( null )`) are plain
-		if ( !proto ) {
-			return true;
-		}
-
-		// Objects with prototype are plain iff they were constructed by a global Object function
-		Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor;
-		return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString;
-	},
-
-	isEmptyObject: function( obj ) {
-		var name;
-
-		for ( name in obj ) {
-			return false;
-		}
-		return true;
-	},
-
-	// Evaluates a script in a provided context; falls back to the global one
-	// if not specified.
-	globalEval: function( code, options, doc ) {
-		DOMEval( code, { nonce: options && options.nonce }, doc );
-	},
-
-	each: function( obj, callback ) {
-		var length, i = 0;
-
-		if ( isArrayLike( obj ) ) {
-			length = obj.length;
-			for ( ; i < length; i++ ) {
-				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
-					break;
-				}
-			}
-		} else {
-			for ( i in obj ) {
-				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
-					break;
-				}
-			}
-		}
-
-		return obj;
-	},
-
-	// results is for internal usage only
-	makeArray: function( arr, results ) {
-		var ret = results || [];
-
-		if ( arr != null ) {
-			if ( isArrayLike( Object( arr ) ) ) {
-				jQuery.merge( ret,
-					typeof arr === "string" ?
-						[ arr ] : arr
-				);
-			} else {
-				push.call( ret, arr );
-			}
-		}
-
-		return ret;
-	},
-
-	inArray: function( elem, arr, i ) {
-		return arr == null ? -1 : indexOf.call( arr, elem, i );
-	},
-
-	// Support: Android <=4.0 only, PhantomJS 1 only
-	// push.apply(_, arraylike) throws on ancient WebKit
-	merge: function( first, second ) {
-		var len = +second.length,
-			j = 0,
-			i = first.length;
-
-		for ( ; j < len; j++ ) {
-			first[ i++ ] = second[ j ];
-		}
-
-		first.length = i;
-
-		return first;
-	},
-
-	grep: function( elems, callback, invert ) {
-		var callbackInverse,
-			matches = [],
-			i = 0,
-			length = elems.length,
-			callbackExpect = !invert;
-
-		// Go through the array, only saving the items
-		// that pass the validator function
-		for ( ; i < length; i++ ) {
-			callbackInverse = !callback( elems[ i ], i );
-			if ( callbackInverse !== callbackExpect ) {
-				matches.push( elems[ i ] );
-			}
-		}
-
-		return matches;
-	},
-
-	// arg is for internal usage only
-	map: function( elems, callback, arg ) {
-		var length, value,
-			i = 0,
-			ret = [];
-
-		// Go through the array, translating each of the items to their new values
-		if ( isArrayLike( elems ) ) {
-			length = elems.length;
-			for ( ; i < length; i++ ) {
-				value = callback( elems[ i ], i, arg );
-
-				if ( value != null ) {
-					ret.push( value );
-				}
-			}
-
-		// Go through every key on the object,
-		} else {
-			for ( i in elems ) {
-				value = callback( elems[ i ], i, arg );
-
-				if ( value != null ) {
-					ret.push( value );
-				}
-			}
-		}
-
-		// Flatten any nested arrays
-		return flat( ret );
-	},
-
-	// A global GUID counter for objects
-	guid: 1,
-
-	// jQuery.support is not used in Core but other projects attach their
-	// properties to it so it needs to exist.
-	support: support
-} );
-
-if ( typeof Symbol === "function" ) {
-	jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ];
-}
-
-// Populate the class2type map
-jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
-	function( _i, name ) {
-		class2type[ "[object " + name + "]" ] = name.toLowerCase();
-	} );
-
-function isArrayLike( obj ) {
-
-	// Support: real iOS 8.2 only (not reproducible in simulator)
-	// `in` check used to prevent JIT error (gh-2145)
-	// hasOwn isn't used here due to false negatives
-	// regarding Nodelist length in IE
-	var length = !!obj && "length" in obj && obj.length,
-		type = toType( obj );
-
-	if ( isFunction( obj ) || isWindow( obj ) ) {
-		return false;
-	}
-
-	return type === "array" || length === 0 ||
-		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
-}
-var Sizzle =
-/*!
- * Sizzle CSS Selector Engine v2.3.6
- * https://sizzlejs.com/
- *
- * Copyright JS Foundation and other contributors
- * Released under the MIT license
- * https://js.foundation/
- *
- * Date: 2021-02-16
- */
-( function( window ) {
-var i,
-	support,
-	Expr,
-	getText,
-	isXML,
-	tokenize,
-	compile,
-	select,
-	outermostContext,
-	sortInput,
-	hasDuplicate,
-
-	// Local document vars
-	setDocument,
-	document,
-	docElem,
-	documentIsHTML,
-	rbuggyQSA,
-	rbuggyMatches,
-	matches,
-	contains,
-
-	// Instance-specific data
-	expando = "sizzle" + 1 * new Date(),
-	preferredDoc = window.document,
-	dirruns = 0,
-	done = 0,
-	classCache = createCache(),
-	tokenCache = createCache(),
-	compilerCache = createCache(),
-	nonnativeSelectorCache = createCache(),
-	sortOrder = function( a, b ) {
-		if ( a === b ) {
-			hasDuplicate = true;
-		}
-		return 0;
-	},
-
-	// Instance methods
-	hasOwn = ( {} ).hasOwnProperty,
-	arr = [],
-	pop = arr.pop,
-	pushNative = arr.push,
-	push = arr.push,
-	slice = arr.slice,
-
-	// Use a stripped-down indexOf as it's faster than native
-	// https://jsperf.com/thor-indexof-vs-for/5
-	indexOf = function( list, elem ) {
-		var i = 0,
-			len = list.length;
-		for ( ; i < len; i++ ) {
-			if ( list[ i ] === elem ) {
-				return i;
-			}
-		}
-		return -1;
-	},
-
-	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" +
-		"ismap|loop|multiple|open|readonly|required|scoped",
-
-	// Regular expressions
-
-	// http://www.w3.org/TR/css3-selectors/#whitespace
-	whitespace = "[\\x20\\t\\r\\n\\f]",
-
-	// https://www.w3.org/TR/css-syntax-3/#ident-token-diagram
-	identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace +
-		"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
-
-	// Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors
-	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
-
-		// Operator (capture 2)
-		"*([*^$|!~]?=)" + whitespace +
-
-		// "Attribute values must be CSS identifiers [capture 5]
-		// or strings [capture 3 or capture 4]"
-		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" +
-		whitespace + "*\\]",
-
-	pseudos = ":(" + identifier + ")(?:\\((" +
-
-		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
-		// 1. quoted (capture 3; capture 4 or capture 5)
-		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
-
-		// 2. simple (capture 6)
-		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
-
-		// 3. anything else (capture 2)
-		".*" +
-		")\\)|)",
-
-	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
-	rwhitespace = new RegExp( whitespace + "+", "g" ),
-	rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" +
-		whitespace + "+$", "g" ),
-
-	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
-	rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace +
-		"*" ),
-	rdescend = new RegExp( whitespace + "|>" ),
-
-	rpseudo = new RegExp( pseudos ),
-	ridentifier = new RegExp( "^" + identifier + "$" ),
-
-	matchExpr = {
-		"ID": new RegExp( "^#(" + identifier + ")" ),
-		"CLASS": new RegExp( "^\\.(" + identifier + ")" ),
-		"TAG": new RegExp( "^(" + identifier + "|[*])" ),
-		"ATTR": new RegExp( "^" + attributes ),
-		"PSEUDO": new RegExp( "^" + pseudos ),
-		"CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" +
-			whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" +
-			whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
-		"bool": new RegExp( "^(?:" + booleans + ")$", "i" ),
-
-		// For use in libraries implementing .is()
-		// We use this for POS matching in `select`
-		"needsContext": new RegExp( "^" + whitespace +
-			"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +
-			"*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
-	},
-
-	rhtml = /HTML$/i,
-	rinputs = /^(?:input|select|textarea|button)$/i,
-	rheader = /^h\d$/i,
-
-	rnative = /^[^{]+\{\s*\[native \w/,
-
-	// Easily-parseable/retrievable ID or TAG or CLASS selectors
-	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
-
-	rsibling = /[+~]/,
-
-	// CSS escapes
-	// http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
-	runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ),
-	funescape = function( escape, nonHex ) {
-		var high = "0x" + escape.slice( 1 ) - 0x10000;
-
-		return nonHex ?
-
-			// Strip the backslash prefix from a non-hex escape sequence
-			nonHex :
-
-			// Replace a hexadecimal escape sequence with the encoded Unicode code point
-			// Support: IE <=11+
-			// For values outside the Basic Multilingual Plane (BMP), manually construct a
-			// surrogate pair
-			high < 0 ?
-				String.fromCharCode( high + 0x10000 ) :
-				String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
-	},
-
-	// CSS string/identifier serialization
-	// https://drafts.csswg.org/cssom/#common-serializing-idioms
-	rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,
-	fcssescape = function( ch, asCodePoint ) {
-		if ( asCodePoint ) {
-
-			// U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER
-			if ( ch === "\0" ) {
-				return "\uFFFD";
-			}
-
-			// Control characters and (dependent upon position) numbers get escaped as code points
-			return ch.slice( 0, -1 ) + "\\" +
-				ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " ";
-		}
-
-		// Other potentially-special ASCII characters get backslash-escaped
-		return "\\" + ch;
-	},
-
-	// Used for iframes
-	// See setDocument()
-	// Removing the function wrapper causes a "Permission Denied"
-	// error in IE
-	unloadHandler = function() {
-		setDocument();
-	},
-
-	inDisabledFieldset = addCombinator(
-		function( elem ) {
-			return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset";
-		},
-		{ dir: "parentNode", next: "legend" }
-	);
-
-// Optimize for push.apply( _, NodeList )
-try {
-	push.apply(
-		( arr = slice.call( preferredDoc.childNodes ) ),
-		preferredDoc.childNodes
-	);
-
-	// Support: Android<4.0
-	// Detect silently failing push.apply
-	// eslint-disable-next-line no-unused-expressions
-	arr[ preferredDoc.childNodes.length ].nodeType;
-} catch ( e ) {
-	push = { apply: arr.length ?
-
-		// Leverage slice if possible
-		function( target, els ) {
-			pushNative.apply( target, slice.call( els ) );
-		} :
-
-		// Support: IE<9
-		// Otherwise append directly
-		function( target, els ) {
-			var j = target.length,
-				i = 0;
-
-			// Can't trust NodeList.length
-			while ( ( target[ j++ ] = els[ i++ ] ) ) {}
-			target.length = j - 1;
-		}
-	};
-}
-
-function Sizzle( selector, context, results, seed ) {
-	var m, i, elem, nid, match, groups, newSelector,
-		newContext = context && context.ownerDocument,
-
-		// nodeType defaults to 9, since context defaults to document
-		nodeType = context ? context.nodeType : 9;
-
-	results = results || [];
-
-	// Return early from calls with invalid selector or context
-	if ( typeof selector !== "string" || !selector ||
-		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
-
-		return results;
-	}
-
-	// Try to shortcut find operations (as opposed to filters) in HTML documents
-	if ( !seed ) {
-		setDocument( context );
-		context = context || document;
-
-		if ( documentIsHTML ) {
-
-			// If the selector is sufficiently simple, try using a "get*By*" DOM method
-			// (excepting DocumentFragment context, where the methods don't exist)
-			if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) {
-
-				// ID selector
-				if ( ( m = match[ 1 ] ) ) {
-
-					// Document context
-					if ( nodeType === 9 ) {
-						if ( ( elem = context.getElementById( m ) ) ) {
-
-							// Support: IE, Opera, Webkit
-							// TODO: identify versions
-							// getElementById can match elements by name instead of ID
-							if ( elem.id === m ) {
-								results.push( elem );
-								return results;
-							}
-						} else {
-							return results;
-						}
-
-					// Element context
-					} else {
-
-						// Support: IE, Opera, Webkit
-						// TODO: identify versions
-						// getElementById can match elements by name instead of ID
-						if ( newContext && ( elem = newContext.getElementById( m ) ) &&
-							contains( context, elem ) &&
-							elem.id === m ) {
-
-							results.push( elem );
-							return results;
-						}
-					}
-
-				// Type selector
-				} else if ( match[ 2 ] ) {
-					push.apply( results, context.getElementsByTagName( selector ) );
-					return results;
-
-				// Class selector
-				} else if ( ( m = match[ 3 ] ) && support.getElementsByClassName &&
-					context.getElementsByClassName ) {
-
-					push.apply( results, context.getElementsByClassName( m ) );
-					return results;
-				}
-			}
-
-			// Take advantage of querySelectorAll
-			if ( support.qsa &&
-				!nonnativeSelectorCache[ selector + " " ] &&
-				( !rbuggyQSA || !rbuggyQSA.test( selector ) ) &&
-
-				// Support: IE 8 only
-				// Exclude object elements
-				( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) {
-
-				newSelector = selector;
-				newContext = context;
-
-				// qSA considers elements outside a scoping root when evaluating child or
-				// descendant combinators, which is not what we want.
-				// In such cases, we work around the behavior by prefixing every selector in the
-				// list with an ID selector referencing the scope context.
-				// The technique has to be used as well when a leading combinator is used
-				// as such selectors are not recognized by querySelectorAll.
-				// Thanks to Andrew Dupont for this technique.
-				if ( nodeType === 1 &&
-					( rdescend.test( selector ) || rcombinators.test( selector ) ) ) {
-
-					// Expand context for sibling selectors
-					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
-						context;
-
-					// We can use :scope instead of the ID hack if the browser
-					// supports it & if we're not changing the context.
-					if ( newContext !== context || !support.scope ) {
-
-						// Capture the context ID, setting it first if necessary
-						if ( ( nid = context.getAttribute( "id" ) ) ) {
-							nid = nid.replace( rcssescape, fcssescape );
-						} else {
-							context.setAttribute( "id", ( nid = expando ) );
-						}
-					}
-
-					// Prefix every selector in the list
-					groups = tokenize( selector );
-					i = groups.length;
-					while ( i-- ) {
-						groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " +
-							toSelector( groups[ i ] );
-					}
-					newSelector = groups.join( "," );
-				}
-
-				try {
-					push.apply( results,
-						newContext.querySelectorAll( newSelector )
-					);
-					return results;
-				} catch ( qsaError ) {
-					nonnativeSelectorCache( selector, true );
-				} finally {
-					if ( nid === expando ) {
-						context.removeAttribute( "id" );
-					}
-				}
-			}
-		}
-	}
-
-	// All others
-	return select( selector.replace( rtrim, "$1" ), context, results, seed );
-}
-
-/**
- * Create key-value caches of limited size
- * @returns {function(string, object)} Returns the Object data after storing it on itself with
- *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
- *	deleting the oldest entry
- */
-function createCache() {
-	var keys = [];
-
-	function cache( key, value ) {
-
-		// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
-		if ( keys.push( key + " " ) > Expr.cacheLength ) {
-
-			// Only keep the most recent entries
-			delete cache[ keys.shift() ];
-		}
-		return ( cache[ key + " " ] = value );
-	}
-	return cache;
-}
-
-/**
- * Mark a function for special use by Sizzle
- * @param {Function} fn The function to mark
- */
-function markFunction( fn ) {
-	fn[ expando ] = true;
-	return fn;
-}
-
-/**
- * Support testing using an element
- * @param {Function} fn Passed the created element and returns a boolean result
- */
-function assert( fn ) {
-	var el = document.createElement( "fieldset" );
-
-	try {
-		return !!fn( el );
-	} catch ( e ) {
-		return false;
-	} finally {
-
-		// Remove from its parent by default
-		if ( el.parentNode ) {
-			el.parentNode.removeChild( el );
-		}
-
-		// release memory in IE
-		el = null;
-	}
-}
-
-/**
- * Adds the same handler for all of the specified attrs
- * @param {String} attrs Pipe-separated list of attributes
- * @param {Function} handler The method that will be applied
- */
-function addHandle( attrs, handler ) {
-	var arr = attrs.split( "|" ),
-		i = arr.length;
-
-	while ( i-- ) {
-		Expr.attrHandle[ arr[ i ] ] = handler;
-	}
-}
-
-/**
- * Checks document order of two siblings
- * @param {Element} a
- * @param {Element} b
- * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
- */
-function siblingCheck( a, b ) {
-	var cur = b && a,
-		diff = cur && a.nodeType === 1 && b.nodeType === 1 &&
-			a.sourceIndex - b.sourceIndex;
-
-	// Use IE sourceIndex if available on both nodes
-	if ( diff ) {
-		return diff;
-	}
-
-	// Check if b follows a
-	if ( cur ) {
-		while ( ( cur = cur.nextSibling ) ) {
-			if ( cur === b ) {
-				return -1;
-			}
-		}
-	}
-
-	return a ? 1 : -1;
-}
-
-/**
- * Returns a function to use in pseudos for input types
- * @param {String} type
- */
-function createInputPseudo( type ) {
-	return function( elem ) {
-		var name = elem.nodeName.toLowerCase();
-		return name === "input" && elem.type === type;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for buttons
- * @param {String} type
- */
-function createButtonPseudo( type ) {
-	return function( elem ) {
-		var name = elem.nodeName.toLowerCase();
-		return ( name === "input" || name === "button" ) && elem.type === type;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for :enabled/:disabled
- * @param {Boolean} disabled true for :disabled; false for :enabled
- */
-function createDisabledPseudo( disabled ) {
-
-	// Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable
-	return function( elem ) {
-
-		// Only certain elements can match :enabled or :disabled
-		// https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled
-		// https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled
-		if ( "form" in elem ) {
-
-			// Check for inherited disabledness on relevant non-disabled elements:
-			// * listed form-associated elements in a disabled fieldset
-			//   https://html.spec.whatwg.org/multipage/forms.html#category-listed
-			//   https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled
-			// * option elements in a disabled optgroup
-			//   https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled
-			// All such elements have a "form" property.
-			if ( elem.parentNode && elem.disabled === false ) {
-
-				// Option elements defer to a parent optgroup if present
-				if ( "label" in elem ) {
-					if ( "label" in elem.parentNode ) {
-						return elem.parentNode.disabled === disabled;
-					} else {
-						return elem.disabled === disabled;
-					}
-				}
-
-				// Support: IE 6 - 11
-				// Use the isDisabled shortcut property to check for disabled fieldset ancestors
-				return elem.isDisabled === disabled ||
-
-					// Where there is no isDisabled, check manually
-					/* jshint -W018 */
-					elem.isDisabled !== !disabled &&
-					inDisabledFieldset( elem ) === disabled;
-			}
-
-			return elem.disabled === disabled;
-
-		// Try to winnow out elements that can't be disabled before trusting the disabled property.
-		// Some victims get caught in our net (label, legend, menu, track), but it shouldn't
-		// even exist on them, let alone have a boolean value.
-		} else if ( "label" in elem ) {
-			return elem.disabled === disabled;
-		}
-
-		// Remaining elements are neither :enabled nor :disabled
-		return false;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for positionals
- * @param {Function} fn
- */
-function createPositionalPseudo( fn ) {
-	return markFunction( function( argument ) {
-		argument = +argument;
-		return markFunction( function( seed, matches ) {
-			var j,
-				matchIndexes = fn( [], seed.length, argument ),
-				i = matchIndexes.length;
-
-			// Match elements found at the specified indexes
-			while ( i-- ) {
-				if ( seed[ ( j = matchIndexes[ i ] ) ] ) {
-					seed[ j ] = !( matches[ j ] = seed[ j ] );
-				}
-			}
-		} );
-	} );
-}
-
-/**
- * Checks a node for validity as a Sizzle context
- * @param {Element|Object=} context
- * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
- */
-function testContext( context ) {
-	return context && typeof context.getElementsByTagName !== "undefined" && context;
-}
-
-// Expose support vars for convenience
-support = Sizzle.support = {};
-
-/**
- * Detects XML nodes
- * @param {Element|Object} elem An element or a document
- * @returns {Boolean} True iff elem is a non-HTML XML node
- */
-isXML = Sizzle.isXML = function( elem ) {
-	var namespace = elem && elem.namespaceURI,
-		docElem = elem && ( elem.ownerDocument || elem ).documentElement;
-
-	// Support: IE <=8
-	// Assume HTML when documentElement doesn't yet exist, such as inside loading iframes
-	// https://bugs.jquery.com/ticket/4833
-	return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" );
-};
-
-/**
- * Sets document-related variables once based on the current document
- * @param {Element|Object} [doc] An element or document object to use to set the document
- * @returns {Object} Returns the current document
- */
-setDocument = Sizzle.setDocument = function( node ) {
-	var hasCompare, subWindow,
-		doc = node ? node.ownerDocument || node : preferredDoc;
-
-	// Return early if doc is invalid or already selected
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) {
-		return document;
-	}
-
-	// Update global variables
-	document = doc;
-	docElem = document.documentElement;
-	documentIsHTML = !isXML( document );
-
-	// Support: IE 9 - 11+, Edge 12 - 18+
-	// Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936)
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( preferredDoc != document &&
-		( subWindow = document.defaultView ) && subWindow.top !== subWindow ) {
-
-		// Support: IE 11, Edge
-		if ( subWindow.addEventListener ) {
-			subWindow.addEventListener( "unload", unloadHandler, false );
-
-		// Support: IE 9 - 10 only
-		} else if ( subWindow.attachEvent ) {
-			subWindow.attachEvent( "onunload", unloadHandler );
-		}
-	}
-
-	// Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only,
-	// Safari 4 - 5 only, Opera <=11.6 - 12.x only
-	// IE/Edge & older browsers don't support the :scope pseudo-class.
-	// Support: Safari 6.0 only
-	// Safari 6.0 supports :scope but it's an alias of :root there.
-	support.scope = assert( function( el ) {
-		docElem.appendChild( el ).appendChild( document.createElement( "div" ) );
-		return typeof el.querySelectorAll !== "undefined" &&
-			!el.querySelectorAll( ":scope fieldset div" ).length;
-	} );
-
-	/* Attributes
-	---------------------------------------------------------------------- */
-
-	// Support: IE<8
-	// Verify that getAttribute really returns attributes and not properties
-	// (excepting IE8 booleans)
-	support.attributes = assert( function( el ) {
-		el.className = "i";
-		return !el.getAttribute( "className" );
-	} );
-
-	/* getElement(s)By*
-	---------------------------------------------------------------------- */
-
-	// Check if getElementsByTagName("*") returns only elements
-	support.getElementsByTagName = assert( function( el ) {
-		el.appendChild( document.createComment( "" ) );
-		return !el.getElementsByTagName( "*" ).length;
-	} );
-
-	// Support: IE<9
-	support.getElementsByClassName = rnative.test( document.getElementsByClassName );
-
-	// Support: IE<10
-	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programmatically-set names,
-	// so use a roundabout getElementsByName test
-	support.getById = assert( function( el ) {
-		docElem.appendChild( el ).id = expando;
-		return !document.getElementsByName || !document.getElementsByName( expando ).length;
-	} );
-
-	// ID filter and find
-	if ( support.getById ) {
-		Expr.filter[ "ID" ] = function( id ) {
-			var attrId = id.replace( runescape, funescape );
-			return function( elem ) {
-				return elem.getAttribute( "id" ) === attrId;
-			};
-		};
-		Expr.find[ "ID" ] = function( id, context ) {
-			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
-				var elem = context.getElementById( id );
-				return elem ? [ elem ] : [];
-			}
-		};
-	} else {
-		Expr.filter[ "ID" ] =  function( id ) {
-			var attrId = id.replace( runescape, funescape );
-			return function( elem ) {
-				var node = typeof elem.getAttributeNode !== "undefined" &&
-					elem.getAttributeNode( "id" );
-				return node && node.value === attrId;
-			};
-		};
-
-		// Support: IE 6 - 7 only
-		// getElementById is not reliable as a find shortcut
-		Expr.find[ "ID" ] = function( id, context ) {
-			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
-				var node, i, elems,
-					elem = context.getElementById( id );
-
-				if ( elem ) {
-
-					// Verify the id attribute
-					node = elem.getAttributeNode( "id" );
-					if ( node && node.value === id ) {
-						return [ elem ];
-					}
-
-					// Fall back on getElementsByName
-					elems = context.getElementsByName( id );
-					i = 0;
-					while ( ( elem = elems[ i++ ] ) ) {
-						node = elem.getAttributeNode( "id" );
-						if ( node && node.value === id ) {
-							return [ elem ];
-						}
-					}
-				}
-
-				return [];
-			}
-		};
-	}
-
-	// Tag
-	Expr.find[ "TAG" ] = support.getElementsByTagName ?
-		function( tag, context ) {
-			if ( typeof context.getElementsByTagName !== "undefined" ) {
-				return context.getElementsByTagName( tag );
-
-			// DocumentFragment nodes don't have gEBTN
-			} else if ( support.qsa ) {
-				return context.querySelectorAll( tag );
-			}
-		} :
-
-		function( tag, context ) {
-			var elem,
-				tmp = [],
-				i = 0,
-
-				// By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too
-				results = context.getElementsByTagName( tag );
-
-			// Filter out possible comments
-			if ( tag === "*" ) {
-				while ( ( elem = results[ i++ ] ) ) {
-					if ( elem.nodeType === 1 ) {
-						tmp.push( elem );
-					}
-				}
-
-				return tmp;
-			}
-			return results;
-		};
-
-	// Class
-	Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) {
-		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
-			return context.getElementsByClassName( className );
-		}
-	};
-
-	/* QSA/matchesSelector
-	---------------------------------------------------------------------- */
-
-	// QSA and matchesSelector support
-
-	// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
-	rbuggyMatches = [];
-
-	// qSa(:focus) reports false when true (Chrome 21)
-	// We allow this because of a bug in IE8/9 that throws an error
-	// whenever `document.activeElement` is accessed on an iframe
-	// So, we allow :focus to pass through QSA all the time to avoid the IE error
-	// See https://bugs.jquery.com/ticket/13378
-	rbuggyQSA = [];
-
-	if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) {
-
-		// Build QSA regex
-		// Regex strategy adopted from Diego Perini
-		assert( function( el ) {
-
-			var input;
-
-			// Select is set to empty string on purpose
-			// This is to test IE's treatment of not explicitly
-			// setting a boolean content attribute,
-			// since its presence should be enough
-			// https://bugs.jquery.com/ticket/12359
-			docElem.appendChild( el ).innerHTML = "<a id='" + expando + "'></a>" +
-				"<select id='" + expando + "-\r\\' msallowcapture=''>" +
-				"<option selected=''></option></select>";
-
-			// Support: IE8, Opera 11-12.16
-			// Nothing should be selected when empty strings follow ^= or $= or *=
-			// The test attribute must be unknown in Opera but "safe" for WinRT
-			// https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section
-			if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) {
-				rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );
-			}
-
-			// Support: IE8
-			// Boolean attributes and "value" are not treated correctly
-			if ( !el.querySelectorAll( "[selected]" ).length ) {
-				rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
-			}
-
-			// Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+
-			if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
-				rbuggyQSA.push( "~=" );
-			}
-
-			// Support: IE 11+, Edge 15 - 18+
-			// IE 11/Edge don't find elements on a `[name='']` query in some cases.
-			// Adding a temporary attribute to the document before the selection works
-			// around the issue.
-			// Interestingly, IE 10 & older don't seem to have the issue.
-			input = document.createElement( "input" );
-			input.setAttribute( "name", "" );
-			el.appendChild( input );
-			if ( !el.querySelectorAll( "[name='']" ).length ) {
-				rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" +
-					whitespace + "*(?:''|\"\")" );
-			}
-
-			// Webkit/Opera - :checked should return selected option elements
-			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
-			// IE8 throws error here and will not see later tests
-			if ( !el.querySelectorAll( ":checked" ).length ) {
-				rbuggyQSA.push( ":checked" );
-			}
-
-			// Support: Safari 8+, iOS 8+
-			// https://bugs.webkit.org/show_bug.cgi?id=136851
-			// In-page `selector#id sibling-combinator selector` fails
-			if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) {
-				rbuggyQSA.push( ".#.+[+~]" );
-			}
-
-			// Support: Firefox <=3.6 - 5 only
-			// Old Firefox doesn't throw on a badly-escaped identifier.
-			el.querySelectorAll( "\\\f" );
-			rbuggyQSA.push( "[\\r\\n\\f]" );
-		} );
-
-		assert( function( el ) {
-			el.innerHTML = "<a href='' disabled='disabled'></a>" +
-				"<select disabled='disabled'><option/></select>";
-
-			// Support: Windows 8 Native Apps
-			// The type and name attributes are restricted during .innerHTML assignment
-			var input = document.createElement( "input" );
-			input.setAttribute( "type", "hidden" );
-			el.appendChild( input ).setAttribute( "name", "D" );
-
-			// Support: IE8
-			// Enforce case-sensitivity of name attribute
-			if ( el.querySelectorAll( "[name=d]" ).length ) {
-				rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );
-			}
-
-			// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
-			// IE8 throws error here and will not see later tests
-			if ( el.querySelectorAll( ":enabled" ).length !== 2 ) {
-				rbuggyQSA.push( ":enabled", ":disabled" );
-			}
-
-			// Support: IE9-11+
-			// IE's :disabled selector does not pick up the children of disabled fieldsets
-			docElem.appendChild( el ).disabled = true;
-			if ( el.querySelectorAll( ":disabled" ).length !== 2 ) {
-				rbuggyQSA.push( ":enabled", ":disabled" );
-			}
-
-			// Support: Opera 10 - 11 only
-			// Opera 10-11 does not throw on post-comma invalid pseudos
-			el.querySelectorAll( "*,:x" );
-			rbuggyQSA.push( ",.*:" );
-		} );
-	}
-
-	if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches ||
-		docElem.webkitMatchesSelector ||
-		docElem.mozMatchesSelector ||
-		docElem.oMatchesSelector ||
-		docElem.msMatchesSelector ) ) ) ) {
-
-		assert( function( el ) {
-
-			// Check to see if it's possible to do matchesSelector
-			// on a disconnected node (IE 9)
-			support.disconnectedMatch = matches.call( el, "*" );
-
-			// This should fail with an exception
-			// Gecko does not error, returns false instead
-			matches.call( el, "[s!='']:x" );
-			rbuggyMatches.push( "!=", pseudos );
-		} );
-	}
-
-	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) );
-	rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) );
-
-	/* Contains
-	---------------------------------------------------------------------- */
-	hasCompare = rnative.test( docElem.compareDocumentPosition );
-
-	// Element contains another
-	// Purposefully self-exclusive
-	// As in, an element does not contain itself
-	contains = hasCompare || rnative.test( docElem.contains ) ?
-		function( a, b ) {
-			var adown = a.nodeType === 9 ? a.documentElement : a,
-				bup = b && b.parentNode;
-			return a === bup || !!( bup && bup.nodeType === 1 && (
-				adown.contains ?
-					adown.contains( bup ) :
-					a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
-			) );
-		} :
-		function( a, b ) {
-			if ( b ) {
-				while ( ( b = b.parentNode ) ) {
-					if ( b === a ) {
-						return true;
-					}
-				}
-			}
-			return false;
-		};
-
-	/* Sorting
-	---------------------------------------------------------------------- */
-
-	// Document order sorting
-	sortOrder = hasCompare ?
-	function( a, b ) {
-
-		// Flag for duplicate removal
-		if ( a === b ) {
-			hasDuplicate = true;
-			return 0;
-		}
-
-		// Sort on method existence if only one input has compareDocumentPosition
-		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
-		if ( compare ) {
-			return compare;
-		}
-
-		// Calculate position if both inputs belong to the same document
-		// Support: IE 11+, Edge 17 - 18+
-		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-		// two documents; shallow comparisons work.
-		// eslint-disable-next-line eqeqeq
-		compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ?
-			a.compareDocumentPosition( b ) :
-
-			// Otherwise we know they are disconnected
-			1;
-
-		// Disconnected nodes
-		if ( compare & 1 ||
-			( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) {
-
-			// Choose the first element that is related to our preferred document
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			// eslint-disable-next-line eqeqeq
-			if ( a == document || a.ownerDocument == preferredDoc &&
-				contains( preferredDoc, a ) ) {
-				return -1;
-			}
-
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			// eslint-disable-next-line eqeqeq
-			if ( b == document || b.ownerDocument == preferredDoc &&
-				contains( preferredDoc, b ) ) {
-				return 1;
-			}
-
-			// Maintain original order
-			return sortInput ?
-				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
-				0;
-		}
-
-		return compare & 4 ? -1 : 1;
-	} :
-	function( a, b ) {
-
-		// Exit early if the nodes are identical
-		if ( a === b ) {
-			hasDuplicate = true;
-			return 0;
-		}
-
-		var cur,
-			i = 0,
-			aup = a.parentNode,
-			bup = b.parentNode,
-			ap = [ a ],
-			bp = [ b ];
-
-		// Parentless nodes are either documents or disconnected
-		if ( !aup || !bup ) {
-
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			/* eslint-disable eqeqeq */
-			return a == document ? -1 :
-				b == document ? 1 :
-				/* eslint-enable eqeqeq */
-				aup ? -1 :
-				bup ? 1 :
-				sortInput ?
-				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
-				0;
-
-		// If the nodes are siblings, we can do a quick check
-		} else if ( aup === bup ) {
-			return siblingCheck( a, b );
-		}
-
-		// Otherwise we need full lists of their ancestors for comparison
-		cur = a;
-		while ( ( cur = cur.parentNode ) ) {
-			ap.unshift( cur );
-		}
-		cur = b;
-		while ( ( cur = cur.parentNode ) ) {
-			bp.unshift( cur );
-		}
-
-		// Walk down the tree looking for a discrepancy
-		while ( ap[ i ] === bp[ i ] ) {
-			i++;
-		}
-
-		return i ?
-
-			// Do a sibling check if the nodes have a common ancestor
-			siblingCheck( ap[ i ], bp[ i ] ) :
-
-			// Otherwise nodes in our document sort first
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			/* eslint-disable eqeqeq */
-			ap[ i ] == preferredDoc ? -1 :
-			bp[ i ] == preferredDoc ? 1 :
-			/* eslint-enable eqeqeq */
-			0;
-	};
-
-	return document;
-};
-
-Sizzle.matches = function( expr, elements ) {
-	return Sizzle( expr, null, null, elements );
-};
-
-Sizzle.matchesSelector = function( elem, expr ) {
-	setDocument( elem );
-
-	if ( support.matchesSelector && documentIsHTML &&
-		!nonnativeSelectorCache[ expr + " " ] &&
-		( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&
-		( !rbuggyQSA     || !rbuggyQSA.test( expr ) ) ) {
-
-		try {
-			var ret = matches.call( elem, expr );
-
-			// IE 9's matchesSelector returns false on disconnected nodes
-			if ( ret || support.disconnectedMatch ||
-
-				// As well, disconnected nodes are said to be in a document
-				// fragment in IE 9
-				elem.document && elem.document.nodeType !== 11 ) {
-				return ret;
-			}
-		} catch ( e ) {
-			nonnativeSelectorCache( expr, true );
-		}
-	}
-
-	return Sizzle( expr, document, null, [ elem ] ).length > 0;
-};
-
-Sizzle.contains = function( context, elem ) {
-
-	// Set document vars if needed
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( ( context.ownerDocument || context ) != document ) {
-		setDocument( context );
-	}
-	return contains( context, elem );
-};
-
-Sizzle.attr = function( elem, name ) {
-
-	// Set document vars if needed
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( ( elem.ownerDocument || elem ) != document ) {
-		setDocument( elem );
-	}
-
-	var fn = Expr.attrHandle[ name.toLowerCase() ],
-
-		// Don't get fooled by Object.prototype properties (jQuery #13807)
-		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
-			fn( elem, name, !documentIsHTML ) :
-			undefined;
-
-	return val !== undefined ?
-		val :
-		support.attributes || !documentIsHTML ?
-			elem.getAttribute( name ) :
-			( val = elem.getAttributeNode( name ) ) && val.specified ?
-				val.value :
-				null;
-};
-
-Sizzle.escape = function( sel ) {
-	return ( sel + "" ).replace( rcssescape, fcssescape );
-};
-
-Sizzle.error = function( msg ) {
-	throw new Error( "Syntax error, unrecognized expression: " + msg );
-};
-
-/**
- * Document sorting and removing duplicates
- * @param {ArrayLike} results
- */
-Sizzle.uniqueSort = function( results ) {
-	var elem,
-		duplicates = [],
-		j = 0,
-		i = 0;
-
-	// Unless we *know* we can detect duplicates, assume their presence
-	hasDuplicate = !support.detectDuplicates;
-	sortInput = !support.sortStable && results.slice( 0 );
-	results.sort( sortOrder );
-
-	if ( hasDuplicate ) {
-		while ( ( elem = results[ i++ ] ) ) {
-			if ( elem === results[ i ] ) {
-				j = duplicates.push( i );
-			}
-		}
-		while ( j-- ) {
-			results.splice( duplicates[ j ], 1 );
-		}
-	}
-
-	// Clear input after sorting to release objects
-	// See https://github.com/jquery/sizzle/pull/225
-	sortInput = null;
-
-	return results;
-};
-
-/**
- * Utility function for retrieving the text value of an array of DOM nodes
- * @param {Array|Element} elem
- */
-getText = Sizzle.getText = function( elem ) {
-	var node,
-		ret = "",
-		i = 0,
-		nodeType = elem.nodeType;
-
-	if ( !nodeType ) {
-
-		// If no nodeType, this is expected to be an array
-		while ( ( node = elem[ i++ ] ) ) {
-
-			// Do not traverse comment nodes
-			ret += getText( node );
-		}
-	} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
-
-		// Use textContent for elements
-		// innerText usage removed for consistency of new lines (jQuery #11153)
-		if ( typeof elem.textContent === "string" ) {
-			return elem.textContent;
-		} else {
-
-			// Traverse its children
-			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
-				ret += getText( elem );
-			}
-		}
-	} else if ( nodeType === 3 || nodeType === 4 ) {
-		return elem.nodeValue;
-	}
-
-	// Do not include comment or processing instruction nodes
-
-	return ret;
-};
-
-Expr = Sizzle.selectors = {
-
-	// Can be adjusted by the user
-	cacheLength: 50,
-
-	createPseudo: markFunction,
-
-	match: matchExpr,
-
-	attrHandle: {},
-
-	find: {},
-
-	relative: {
-		">": { dir: "parentNode", first: true },
-		" ": { dir: "parentNode" },
-		"+": { dir: "previousSibling", first: true },
-		"~": { dir: "previousSibling" }
-	},
-
-	preFilter: {
-		"ATTR": function( match ) {
-			match[ 1 ] = match[ 1 ].replace( runescape, funescape );
-
-			// Move the given value to match[3] whether quoted or unquoted
-			match[ 3 ] = ( match[ 3 ] || match[ 4 ] ||
-				match[ 5 ] || "" ).replace( runescape, funescape );
-
-			if ( match[ 2 ] === "~=" ) {
-				match[ 3 ] = " " + match[ 3 ] + " ";
-			}
-
-			return match.slice( 0, 4 );
-		},
-
-		"CHILD": function( match ) {
-
-			/* matches from matchExpr["CHILD"]
-				1 type (only|nth|...)
-				2 what (child|of-type)
-				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
-				4 xn-component of xn+y argument ([+-]?\d*n|)
-				5 sign of xn-component
-				6 x of xn-component
-				7 sign of y-component
-				8 y of y-component
-			*/
-			match[ 1 ] = match[ 1 ].toLowerCase();
-
-			if ( match[ 1 ].slice( 0, 3 ) === "nth" ) {
-
-				// nth-* requires argument
-				if ( !match[ 3 ] ) {
-					Sizzle.error( match[ 0 ] );
-				}
-
-				// numeric x and y parameters for Expr.filter.CHILD
-				// remember that false/true cast respectively to 0/1
-				match[ 4 ] = +( match[ 4 ] ?
-					match[ 5 ] + ( match[ 6 ] || 1 ) :
-					2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) );
-				match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" );
-
-				// other types prohibit arguments
-			} else if ( match[ 3 ] ) {
-				Sizzle.error( match[ 0 ] );
-			}
-
-			return match;
-		},
-
-		"PSEUDO": function( match ) {
-			var excess,
-				unquoted = !match[ 6 ] && match[ 2 ];
-
-			if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) {
-				return null;
-			}
-
-			// Accept quoted arguments as-is
-			if ( match[ 3 ] ) {
-				match[ 2 ] = match[ 4 ] || match[ 5 ] || "";
-
-			// Strip excess characters from unquoted arguments
-			} else if ( unquoted && rpseudo.test( unquoted ) &&
-
-				// Get excess from tokenize (recursively)
-				( excess = tokenize( unquoted, true ) ) &&
-
-				// advance to the next closing parenthesis
-				( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) {
-
-				// excess is a negative index
-				match[ 0 ] = match[ 0 ].slice( 0, excess );
-				match[ 2 ] = unquoted.slice( 0, excess );
-			}
-
-			// Return only captures needed by the pseudo filter method (type and argument)
-			return match.slice( 0, 3 );
-		}
-	},
-
-	filter: {
-
-		"TAG": function( nodeNameSelector ) {
-			var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
-			return nodeNameSelector === "*" ?
-				function() {
-					return true;
-				} :
-				function( elem ) {
-					return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
-				};
-		},
-
-		"CLASS": function( className ) {
-			var pattern = classCache[ className + " " ];
-
-			return pattern ||
-				( pattern = new RegExp( "(^|" + whitespace +
-					")" + className + "(" + whitespace + "|$)" ) ) && classCache(
-						className, function( elem ) {
-							return pattern.test(
-								typeof elem.className === "string" && elem.className ||
-								typeof elem.getAttribute !== "undefined" &&
-									elem.getAttribute( "class" ) ||
-								""
-							);
-				} );
-		},
-
-		"ATTR": function( name, operator, check ) {
-			return function( elem ) {
-				var result = Sizzle.attr( elem, name );
-
-				if ( result == null ) {
-					return operator === "!=";
-				}
-				if ( !operator ) {
-					return true;
-				}
-
-				result += "";
-
-				/* eslint-disable max-len */
-
-				return operator === "=" ? result === check :
-					operator === "!=" ? result !== check :
-					operator === "^=" ? check && result.indexOf( check ) === 0 :
-					operator === "*=" ? check && result.indexOf( check ) > -1 :
-					operator === "$=" ? check && result.slice( -check.length ) === check :
-					operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 :
-					operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :
-					false;
-				/* eslint-enable max-len */
-
-			};
-		},
-
-		"CHILD": function( type, what, _argument, first, last ) {
-			var simple = type.slice( 0, 3 ) !== "nth",
-				forward = type.slice( -4 ) !== "last",
-				ofType = what === "of-type";
-
-			return first === 1 && last === 0 ?
-
-				// Shortcut for :nth-*(n)
-				function( elem ) {
-					return !!elem.parentNode;
-				} :
-
-				function( elem, _context, xml ) {
-					var cache, uniqueCache, outerCache, node, nodeIndex, start,
-						dir = simple !== forward ? "nextSibling" : "previousSibling",
-						parent = elem.parentNode,
-						name = ofType && elem.nodeName.toLowerCase(),
-						useCache = !xml && !ofType,
-						diff = false;
-
-					if ( parent ) {
-
-						// :(first|last|only)-(child|of-type)
-						if ( simple ) {
-							while ( dir ) {
-								node = elem;
-								while ( ( node = node[ dir ] ) ) {
-									if ( ofType ?
-										node.nodeName.toLowerCase() === name :
-										node.nodeType === 1 ) {
-
-										return false;
-									}
-								}
-
-								// Reverse direction for :only-* (if we haven't yet done so)
-								start = dir = type === "only" && !start && "nextSibling";
-							}
-							return true;
-						}
-
-						start = [ forward ? parent.firstChild : parent.lastChild ];
-
-						// non-xml :nth-child(...) stores cache data on `parent`
-						if ( forward && useCache ) {
-
-							// Seek `elem` from a previously-cached index
-
-							// ...in a gzip-friendly way
-							node = parent;
-							outerCache = node[ expando ] || ( node[ expando ] = {} );
-
-							// Support: IE <9 only
-							// Defend against cloned attroperties (jQuery gh-1709)
-							uniqueCache = outerCache[ node.uniqueID ] ||
-								( outerCache[ node.uniqueID ] = {} );
-
-							cache = uniqueCache[ type ] || [];
-							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
-							diff = nodeIndex && cache[ 2 ];
-							node = nodeIndex && parent.childNodes[ nodeIndex ];
-
-							while ( ( node = ++nodeIndex && node && node[ dir ] ||
-
-								// Fallback to seeking `elem` from the start
-								( diff = nodeIndex = 0 ) || start.pop() ) ) {
-
-								// When found, cache indexes on `parent` and break
-								if ( node.nodeType === 1 && ++diff && node === elem ) {
-									uniqueCache[ type ] = [ dirruns, nodeIndex, diff ];
-									break;
-								}
-							}
-
-						} else {
-
-							// Use previously-cached element index if available
-							if ( useCache ) {
-
-								// ...in a gzip-friendly way
-								node = elem;
-								outerCache = node[ expando ] || ( node[ expando ] = {} );
-
-								// Support: IE <9 only
-								// Defend against cloned attroperties (jQuery gh-1709)
-								uniqueCache = outerCache[ node.uniqueID ] ||
-									( outerCache[ node.uniqueID ] = {} );
-
-								cache = uniqueCache[ type ] || [];
-								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
-								diff = nodeIndex;
-							}
-
-							// xml :nth-child(...)
-							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
-							if ( diff === false ) {
-
-								// Use the same loop as above to seek `elem` from the start
-								while ( ( node = ++nodeIndex && node && node[ dir ] ||
-									( diff = nodeIndex = 0 ) || start.pop() ) ) {
-
-									if ( ( ofType ?
-										node.nodeName.toLowerCase() === name :
-										node.nodeType === 1 ) &&
-										++diff ) {
-
-										// Cache the index of each encountered element
-										if ( useCache ) {
-											outerCache = node[ expando ] ||
-												( node[ expando ] = {} );
-
-											// Support: IE <9 only
-											// Defend against cloned attroperties (jQuery gh-1709)
-											uniqueCache = outerCache[ node.uniqueID ] ||
-												( outerCache[ node.uniqueID ] = {} );
-
-											uniqueCache[ type ] = [ dirruns, diff ];
-										}
-
-										if ( node === elem ) {
-											break;
-										}
-									}
-								}
-							}
-						}
-
-						// Incorporate the offset, then check against cycle size
-						diff -= last;
-						return diff === first || ( diff % first === 0 && diff / first >= 0 );
-					}
-				};
-		},
-
-		"PSEUDO": function( pseudo, argument ) {
-
-			// pseudo-class names are case-insensitive
-			// http://www.w3.org/TR/selectors/#pseudo-classes
-			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
-			// Remember that setFilters inherits from pseudos
-			var args,
-				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
-					Sizzle.error( "unsupported pseudo: " + pseudo );
-
-			// The user may use createPseudo to indicate that
-			// arguments are needed to create the filter function
-			// just as Sizzle does
-			if ( fn[ expando ] ) {
-				return fn( argument );
-			}
-
-			// But maintain support for old signatures
-			if ( fn.length > 1 ) {
-				args = [ pseudo, pseudo, "", argument ];
-				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
-					markFunction( function( seed, matches ) {
-						var idx,
-							matched = fn( seed, argument ),
-							i = matched.length;
-						while ( i-- ) {
-							idx = indexOf( seed, matched[ i ] );
-							seed[ idx ] = !( matches[ idx ] = matched[ i ] );
-						}
-					} ) :
-					function( elem ) {
-						return fn( elem, 0, args );
-					};
-			}
-
-			return fn;
-		}
-	},
-
-	pseudos: {
-
-		// Potentially complex pseudos
-		"not": markFunction( function( selector ) {
-
-			// Trim the selector passed to compile
-			// to avoid treating leading and trailing
-			// spaces as combinators
-			var input = [],
-				results = [],
-				matcher = compile( selector.replace( rtrim, "$1" ) );
-
-			return matcher[ expando ] ?
-				markFunction( function( seed, matches, _context, xml ) {
-					var elem,
-						unmatched = matcher( seed, null, xml, [] ),
-						i = seed.length;
-
-					// Match elements unmatched by `matcher`
-					while ( i-- ) {
-						if ( ( elem = unmatched[ i ] ) ) {
-							seed[ i ] = !( matches[ i ] = elem );
-						}
-					}
-				} ) :
-				function( elem, _context, xml ) {
-					input[ 0 ] = elem;
-					matcher( input, null, xml, results );
-
-					// Don't keep the element (issue #299)
-					input[ 0 ] = null;
-					return !results.pop();
-				};
-		} ),
-
-		"has": markFunction( function( selector ) {
-			return function( elem ) {
-				return Sizzle( selector, elem ).length > 0;
-			};
-		} ),
-
-		"contains": markFunction( function( text ) {
-			text = text.replace( runescape, funescape );
-			return function( elem ) {
-				return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1;
-			};
-		} ),
-
-		// "Whether an element is represented by a :lang() selector
-		// is based solely on the element's language value
-		// being equal to the identifier C,
-		// or beginning with the identifier C immediately followed by "-".
-		// The matching of C against the element's language value is performed case-insensitively.
-		// The identifier C does not have to be a valid language name."
-		// http://www.w3.org/TR/selectors/#lang-pseudo
-		"lang": markFunction( function( lang ) {
-
-			// lang value must be a valid identifier
-			if ( !ridentifier.test( lang || "" ) ) {
-				Sizzle.error( "unsupported lang: " + lang );
-			}
-			lang = lang.replace( runescape, funescape ).toLowerCase();
-			return function( elem ) {
-				var elemLang;
-				do {
-					if ( ( elemLang = documentIsHTML ?
-						elem.lang :
-						elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) {
-
-						elemLang = elemLang.toLowerCase();
-						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
-					}
-				} while ( ( elem = elem.parentNode ) && elem.nodeType === 1 );
-				return false;
-			};
-		} ),
-
-		// Miscellaneous
-		"target": function( elem ) {
-			var hash = window.location && window.location.hash;
-			return hash && hash.slice( 1 ) === elem.id;
-		},
-
-		"root": function( elem ) {
-			return elem === docElem;
-		},
-
-		"focus": function( elem ) {
-			return elem === document.activeElement &&
-				( !document.hasFocus || document.hasFocus() ) &&
-				!!( elem.type || elem.href || ~elem.tabIndex );
-		},
-
-		// Boolean properties
-		"enabled": createDisabledPseudo( false ),
-		"disabled": createDisabledPseudo( true ),
-
-		"checked": function( elem ) {
-
-			// In CSS3, :checked should return both checked and selected elements
-			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
-			var nodeName = elem.nodeName.toLowerCase();
-			return ( nodeName === "input" && !!elem.checked ) ||
-				( nodeName === "option" && !!elem.selected );
-		},
-
-		"selected": function( elem ) {
-
-			// Accessing this property makes selected-by-default
-			// options in Safari work properly
-			if ( elem.parentNode ) {
-				// eslint-disable-next-line no-unused-expressions
-				elem.parentNode.selectedIndex;
-			}
-
-			return elem.selected === true;
-		},
-
-		// Contents
-		"empty": function( elem ) {
-
-			// http://www.w3.org/TR/selectors/#empty-pseudo
-			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
-			//   but not by others (comment: 8; processing instruction: 7; etc.)
-			// nodeType < 6 works because attributes (2) do not appear as children
-			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
-				if ( elem.nodeType < 6 ) {
-					return false;
-				}
-			}
-			return true;
-		},
-
-		"parent": function( elem ) {
-			return !Expr.pseudos[ "empty" ]( elem );
-		},
-
-		// Element/input types
-		"header": function( elem ) {
-			return rheader.test( elem.nodeName );
-		},
-
-		"input": function( elem ) {
-			return rinputs.test( elem.nodeName );
-		},
-
-		"button": function( elem ) {
-			var name = elem.nodeName.toLowerCase();
-			return name === "input" && elem.type === "button" || name === "button";
-		},
-
-		"text": function( elem ) {
-			var attr;
-			return elem.nodeName.toLowerCase() === "input" &&
-				elem.type === "text" &&
-
-				// Support: IE<8
-				// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
-				( ( attr = elem.getAttribute( "type" ) ) == null ||
-					attr.toLowerCase() === "text" );
-		},
-
-		// Position-in-collection
-		"first": createPositionalPseudo( function() {
-			return [ 0 ];
-		} ),
-
-		"last": createPositionalPseudo( function( _matchIndexes, length ) {
-			return [ length - 1 ];
-		} ),
-
-		"eq": createPositionalPseudo( function( _matchIndexes, length, argument ) {
-			return [ argument < 0 ? argument + length : argument ];
-		} ),
-
-		"even": createPositionalPseudo( function( matchIndexes, length ) {
-			var i = 0;
-			for ( ; i < length; i += 2 ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		"odd": createPositionalPseudo( function( matchIndexes, length ) {
-			var i = 1;
-			for ( ; i < length; i += 2 ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		"lt": createPositionalPseudo( function( matchIndexes, length, argument ) {
-			var i = argument < 0 ?
-				argument + length :
-				argument > length ?
-					length :
-					argument;
-			for ( ; --i >= 0; ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		"gt": createPositionalPseudo( function( matchIndexes, length, argument ) {
-			var i = argument < 0 ? argument + length : argument;
-			for ( ; ++i < length; ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} )
-	}
-};
-
-Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ];
-
-// Add button/input type pseudos
-for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
-	Expr.pseudos[ i ] = createInputPseudo( i );
-}
-for ( i in { submit: true, reset: true } ) {
-	Expr.pseudos[ i ] = createButtonPseudo( i );
-}
-
-// Easy API for creating new setFilters
-function setFilters() {}
-setFilters.prototype = Expr.filters = Expr.pseudos;
-Expr.setFilters = new setFilters();
-
-tokenize = Sizzle.tokenize = function( selector, parseOnly ) {
-	var matched, match, tokens, type,
-		soFar, groups, preFilters,
-		cached = tokenCache[ selector + " " ];
-
-	if ( cached ) {
-		return parseOnly ? 0 : cached.slice( 0 );
-	}
-
-	soFar = selector;
-	groups = [];
-	preFilters = Expr.preFilter;
-
-	while ( soFar ) {
-
-		// Comma and first run
-		if ( !matched || ( match = rcomma.exec( soFar ) ) ) {
-			if ( match ) {
-
-				// Don't consume trailing commas as valid
-				soFar = soFar.slice( match[ 0 ].length ) || soFar;
-			}
-			groups.push( ( tokens = [] ) );
-		}
-
-		matched = false;
-
-		// Combinators
-		if ( ( match = rcombinators.exec( soFar ) ) ) {
-			matched = match.shift();
-			tokens.push( {
-				value: matched,
-
-				// Cast descendant combinators to space
-				type: match[ 0 ].replace( rtrim, " " )
-			} );
-			soFar = soFar.slice( matched.length );
-		}
-
-		// Filters
-		for ( type in Expr.filter ) {
-			if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||
-				( match = preFilters[ type ]( match ) ) ) ) {
-				matched = match.shift();
-				tokens.push( {
-					value: matched,
-					type: type,
-					matches: match
-				} );
-				soFar = soFar.slice( matched.length );
-			}
-		}
-
-		if ( !matched ) {
-			break;
-		}
-	}
-
-	// Return the length of the invalid excess
-	// if we're just parsing
-	// Otherwise, throw an error or return tokens
-	return parseOnly ?
-		soFar.length :
-		soFar ?
-			Sizzle.error( selector ) :
-
-			// Cache the tokens
-			tokenCache( selector, groups ).slice( 0 );
-};
-
-function toSelector( tokens ) {
-	var i = 0,
-		len = tokens.length,
-		selector = "";
-	for ( ; i < len; i++ ) {
-		selector += tokens[ i ].value;
-	}
-	return selector;
-}
-
-function addCombinator( matcher, combinator, base ) {
-	var dir = combinator.dir,
-		skip = combinator.next,
-		key = skip || dir,
-		checkNonElements = base && key === "parentNode",
-		doneName = done++;
-
-	return combinator.first ?
-
-		// Check against closest ancestor/preceding element
-		function( elem, context, xml ) {
-			while ( ( elem = elem[ dir ] ) ) {
-				if ( elem.nodeType === 1 || checkNonElements ) {
-					return matcher( elem, context, xml );
-				}
-			}
-			return false;
-		} :
-
-		// Check against all ancestor/preceding elements
-		function( elem, context, xml ) {
-			var oldCache, uniqueCache, outerCache,
-				newCache = [ dirruns, doneName ];
-
-			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
-			if ( xml ) {
-				while ( ( elem = elem[ dir ] ) ) {
-					if ( elem.nodeType === 1 || checkNonElements ) {
-						if ( matcher( elem, context, xml ) ) {
-							return true;
-						}
-					}
-				}
-			} else {
-				while ( ( elem = elem[ dir ] ) ) {
-					if ( elem.nodeType === 1 || checkNonElements ) {
-						outerCache = elem[ expando ] || ( elem[ expando ] = {} );
-
-						// Support: IE <9 only
-						// Defend against cloned attroperties (jQuery gh-1709)
-						uniqueCache = outerCache[ elem.uniqueID ] ||
-							( outerCache[ elem.uniqueID ] = {} );
-
-						if ( skip && skip === elem.nodeName.toLowerCase() ) {
-							elem = elem[ dir ] || elem;
-						} else if ( ( oldCache = uniqueCache[ key ] ) &&
-							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
-
-							// Assign to newCache so results back-propagate to previous elements
-							return ( newCache[ 2 ] = oldCache[ 2 ] );
-						} else {
-
-							// Reuse newcache so results back-propagate to previous elements
-							uniqueCache[ key ] = newCache;
-
-							// A match means we're done; a fail means we have to keep checking
-							if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {
-								return true;
-							}
-						}
-					}
-				}
-			}
-			return false;
-		};
-}
-
-function elementMatcher( matchers ) {
-	return matchers.length > 1 ?
-		function( elem, context, xml ) {
-			var i = matchers.length;
-			while ( i-- ) {
-				if ( !matchers[ i ]( elem, context, xml ) ) {
-					return false;
-				}
-			}
-			return true;
-		} :
-		matchers[ 0 ];
-}
-
-function multipleContexts( selector, contexts, results ) {
-	var i = 0,
-		len = contexts.length;
-	for ( ; i < len; i++ ) {
-		Sizzle( selector, contexts[ i ], results );
-	}
-	return results;
-}
-
-function condense( unmatched, map, filter, context, xml ) {
-	var elem,
-		newUnmatched = [],
-		i = 0,
-		len = unmatched.length,
-		mapped = map != null;
-
-	for ( ; i < len; i++ ) {
-		if ( ( elem = unmatched[ i ] ) ) {
-			if ( !filter || filter( elem, context, xml ) ) {
-				newUnmatched.push( elem );
-				if ( mapped ) {
-					map.push( i );
-				}
-			}
-		}
-	}
-
-	return newUnmatched;
-}
-
-function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
-	if ( postFilter && !postFilter[ expando ] ) {
-		postFilter = setMatcher( postFilter );
-	}
-	if ( postFinder && !postFinder[ expando ] ) {
-		postFinder = setMatcher( postFinder, postSelector );
-	}
-	return markFunction( function( seed, results, context, xml ) {
-		var temp, i, elem,
-			preMap = [],
-			postMap = [],
-			preexisting = results.length,
-
-			// Get initial elements from seed or context
-			elems = seed || multipleContexts(
-				selector || "*",
-				context.nodeType ? [ context ] : context,
-				[]
-			),
-
-			// Prefilter to get matcher input, preserving a map for seed-results synchronization
-			matcherIn = preFilter && ( seed || !selector ) ?
-				condense( elems, preMap, preFilter, context, xml ) :
-				elems,
-
-			matcherOut = matcher ?
-
-				// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
-				postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
-
-					// ...intermediate processing is necessary
-					[] :
-
-					// ...otherwise use results directly
-					results :
-				matcherIn;
-
-		// Find primary matches
-		if ( matcher ) {
-			matcher( matcherIn, matcherOut, context, xml );
-		}
-
-		// Apply postFilter
-		if ( postFilter ) {
-			temp = condense( matcherOut, postMap );
-			postFilter( temp, [], context, xml );
-
-			// Un-match failing elements by moving them back to matcherIn
-			i = temp.length;
-			while ( i-- ) {
-				if ( ( elem = temp[ i ] ) ) {
-					matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );
-				}
-			}
-		}
-
-		if ( seed ) {
-			if ( postFinder || preFilter ) {
-				if ( postFinder ) {
-
-					// Get the final matcherOut by condensing this intermediate into postFinder contexts
-					temp = [];
-					i = matcherOut.length;
-					while ( i-- ) {
-						if ( ( elem = matcherOut[ i ] ) ) {
-
-							// Restore matcherIn since elem is not yet a final match
-							temp.push( ( matcherIn[ i ] = elem ) );
-						}
-					}
-					postFinder( null, ( matcherOut = [] ), temp, xml );
-				}
-
-				// Move matched elements from seed to results to keep them synchronized
-				i = matcherOut.length;
-				while ( i-- ) {
-					if ( ( elem = matcherOut[ i ] ) &&
-						( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) {
-
-						seed[ temp ] = !( results[ temp ] = elem );
-					}
-				}
-			}
-
-		// Add elements to results, through postFinder if defined
-		} else {
-			matcherOut = condense(
-				matcherOut === results ?
-					matcherOut.splice( preexisting, matcherOut.length ) :
-					matcherOut
-			);
-			if ( postFinder ) {
-				postFinder( null, results, matcherOut, xml );
-			} else {
-				push.apply( results, matcherOut );
-			}
-		}
-	} );
-}
-
-function matcherFromTokens( tokens ) {
-	var checkContext, matcher, j,
-		len = tokens.length,
-		leadingRelative = Expr.relative[ tokens[ 0 ].type ],
-		implicitRelative = leadingRelative || Expr.relative[ " " ],
-		i = leadingRelative ? 1 : 0,
-
-		// The foundational matcher ensures that elements are reachable from top-level context(s)
-		matchContext = addCombinator( function( elem ) {
-			return elem === checkContext;
-		}, implicitRelative, true ),
-		matchAnyContext = addCombinator( function( elem ) {
-			return indexOf( checkContext, elem ) > -1;
-		}, implicitRelative, true ),
-		matchers = [ function( elem, context, xml ) {
-			var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
-				( checkContext = context ).nodeType ?
-					matchContext( elem, context, xml ) :
-					matchAnyContext( elem, context, xml ) );
-
-			// Avoid hanging onto element (issue #299)
-			checkContext = null;
-			return ret;
-		} ];
-
-	for ( ; i < len; i++ ) {
-		if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {
-			matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];
-		} else {
-			matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );
-
-			// Return special upon seeing a positional matcher
-			if ( matcher[ expando ] ) {
-
-				// Find the next relative operator (if any) for proper handling
-				j = ++i;
-				for ( ; j < len; j++ ) {
-					if ( Expr.relative[ tokens[ j ].type ] ) {
-						break;
-					}
-				}
-				return setMatcher(
-					i > 1 && elementMatcher( matchers ),
-					i > 1 && toSelector(
-
-					// If the preceding token was a descendant combinator, insert an implicit any-element `*`
-					tokens
-						.slice( 0, i - 1 )
-						.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )
-					).replace( rtrim, "$1" ),
-					matcher,
-					i < j && matcherFromTokens( tokens.slice( i, j ) ),
-					j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),
-					j < len && toSelector( tokens )
-				);
-			}
-			matchers.push( matcher );
-		}
-	}
-
-	return elementMatcher( matchers );
-}
-
-function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
-	var bySet = setMatchers.length > 0,
-		byElement = elementMatchers.length > 0,
-		superMatcher = function( seed, context, xml, results, outermost ) {
-			var elem, j, matcher,
-				matchedCount = 0,
-				i = "0",
-				unmatched = seed && [],
-				setMatched = [],
-				contextBackup = outermostContext,
-
-				// We must always have either seed elements or outermost context
-				elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ),
-
-				// Use integer dirruns iff this is the outermost matcher
-				dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),
-				len = elems.length;
-
-			if ( outermost ) {
-
-				// Support: IE 11+, Edge 17 - 18+
-				// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-				// two documents; shallow comparisons work.
-				// eslint-disable-next-line eqeqeq
-				outermostContext = context == document || context || outermost;
-			}
-
-			// Add elements passing elementMatchers directly to results
-			// Support: IE<9, Safari
-			// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id
-			for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {
-				if ( byElement && elem ) {
-					j = 0;
-
-					// Support: IE 11+, Edge 17 - 18+
-					// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-					// two documents; shallow comparisons work.
-					// eslint-disable-next-line eqeqeq
-					if ( !context && elem.ownerDocument != document ) {
-						setDocument( elem );
-						xml = !documentIsHTML;
-					}
-					while ( ( matcher = elementMatchers[ j++ ] ) ) {
-						if ( matcher( elem, context || document, xml ) ) {
-							results.push( elem );
-							break;
-						}
-					}
-					if ( outermost ) {
-						dirruns = dirrunsUnique;
-					}
-				}
-
-				// Track unmatched elements for set filters
-				if ( bySet ) {
-
-					// They will have gone through all possible matchers
-					if ( ( elem = !matcher && elem ) ) {
-						matchedCount--;
-					}
-
-					// Lengthen the array for every element, matched or not
-					if ( seed ) {
-						unmatched.push( elem );
-					}
-				}
-			}
-
-			// `i` is now the count of elements visited above, and adding it to `matchedCount`
-			// makes the latter nonnegative.
-			matchedCount += i;
-
-			// Apply set filters to unmatched elements
-			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
-			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
-			// no element matchers and no seed.
-			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
-			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
-			// numerically zero.
-			if ( bySet && i !== matchedCount ) {
-				j = 0;
-				while ( ( matcher = setMatchers[ j++ ] ) ) {
-					matcher( unmatched, setMatched, context, xml );
-				}
-
-				if ( seed ) {
-
-					// Reintegrate element matches to eliminate the need for sorting
-					if ( matchedCount > 0 ) {
-						while ( i-- ) {
-							if ( !( unmatched[ i ] || setMatched[ i ] ) ) {
-								setMatched[ i ] = pop.call( results );
-							}
-						}
-					}
-
-					// Discard index placeholder values to get only actual matches
-					setMatched = condense( setMatched );
-				}
-
-				// Add matches to results
-				push.apply( results, setMatched );
-
-				// Seedless set matches succeeding multiple successful matchers stipulate sorting
-				if ( outermost && !seed && setMatched.length > 0 &&
-					( matchedCount + setMatchers.length ) > 1 ) {
-
-					Sizzle.uniqueSort( results );
-				}
-			}
-
-			// Override manipulation of globals by nested matchers
-			if ( outermost ) {
-				dirruns = dirrunsUnique;
-				outermostContext = contextBackup;
-			}
-
-			return unmatched;
-		};
-
-	return bySet ?
-		markFunction( superMatcher ) :
-		superMatcher;
-}
-
-compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {
-	var i,
-		setMatchers = [],
-		elementMatchers = [],
-		cached = compilerCache[ selector + " " ];
-
-	if ( !cached ) {
-
-		// Generate a function of recursive functions that can be used to check each element
-		if ( !match ) {
-			match = tokenize( selector );
-		}
-		i = match.length;
-		while ( i-- ) {
-			cached = matcherFromTokens( match[ i ] );
-			if ( cached[ expando ] ) {
-				setMatchers.push( cached );
-			} else {
-				elementMatchers.push( cached );
-			}
-		}
-
-		// Cache the compiled function
-		cached = compilerCache(
-			selector,
-			matcherFromGroupMatchers( elementMatchers, setMatchers )
-		);
-
-		// Save selector and tokenization
-		cached.selector = selector;
-	}
-	return cached;
-};
-
-/**
- * A low-level selection function that works with Sizzle's compiled
- *  selector functions
- * @param {String|Function} selector A selector or a pre-compiled
- *  selector function built with Sizzle.compile
- * @param {Element} context
- * @param {Array} [results]
- * @param {Array} [seed] A set of elements to match against
- */
-select = Sizzle.select = function( selector, context, results, seed ) {
-	var i, tokens, token, type, find,
-		compiled = typeof selector === "function" && selector,
-		match = !seed && tokenize( ( selector = compiled.selector || selector ) );
-
-	results = results || [];
-
-	// Try to minimize operations if there is only one selector in the list and no seed
-	// (the latter of which guarantees us context)
-	if ( match.length === 1 ) {
-
-		// Reduce context if the leading compound selector is an ID
-		tokens = match[ 0 ] = match[ 0 ].slice( 0 );
-		if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&
-			context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {
-
-			context = ( Expr.find[ "ID" ]( token.matches[ 0 ]
-				.replace( runescape, funescape ), context ) || [] )[ 0 ];
-			if ( !context ) {
-				return results;
-
-			// Precompiled matchers will still verify ancestry, so step up a level
-			} else if ( compiled ) {
-				context = context.parentNode;
-			}
-
-			selector = selector.slice( tokens.shift().value.length );
-		}
-
-		// Fetch a seed set for right-to-left matching
-		i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length;
-		while ( i-- ) {
-			token = tokens[ i ];
-
-			// Abort if we hit a combinator
-			if ( Expr.relative[ ( type = token.type ) ] ) {
-				break;
-			}
-			if ( ( find = Expr.find[ type ] ) ) {
-
-				// Search, expanding context for leading sibling combinators
-				if ( ( seed = find(
-					token.matches[ 0 ].replace( runescape, funescape ),
-					rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) ||
-						context
-				) ) ) {
-
-					// If seed is empty or no tokens remain, we can return early
-					tokens.splice( i, 1 );
-					selector = seed.length && toSelector( tokens );
-					if ( !selector ) {
-						push.apply( results, seed );
-						return results;
-					}
-
-					break;
-				}
-			}
-		}
-	}
-
-	// Compile and execute a filtering function if one is not provided
-	// Provide `match` to avoid retokenization if we modified the selector above
-	( compiled || compile( selector, match ) )(
-		seed,
-		context,
-		!documentIsHTML,
-		results,
-		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
-	);
-	return results;
-};
-
-// One-time assignments
-
-// Sort stability
-support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;
-
-// Support: Chrome 14-35+
-// Always assume duplicates if they aren't passed to the comparison function
-support.detectDuplicates = !!hasDuplicate;
-
-// Initialize against the default document
-setDocument();
-
-// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
-// Detached nodes confoundingly follow *each other*
-support.sortDetached = assert( function( el ) {
-
-	// Should return 1, but returns 4 (following)
-	return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;
-} );
-
-// Support: IE<8
-// Prevent attribute/property "interpolation"
-// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx
-if ( !assert( function( el ) {
-	el.innerHTML = "<a href='#'></a>";
-	return el.firstChild.getAttribute( "href" ) === "#";
-} ) ) {
-	addHandle( "type|href|height|width", function( elem, name, isXML ) {
-		if ( !isXML ) {
-			return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 );
-		}
-	} );
-}
-
-// Support: IE<9
-// Use defaultValue in place of getAttribute("value")
-if ( !support.attributes || !assert( function( el ) {
-	el.innerHTML = "<input/>";
-	el.firstChild.setAttribute( "value", "" );
-	return el.firstChild.getAttribute( "value" ) === "";
-} ) ) {
-	addHandle( "value", function( elem, _name, isXML ) {
-		if ( !isXML && elem.nodeName.toLowerCase() === "input" ) {
-			return elem.defaultValue;
-		}
-	} );
-}
-
-// Support: IE<9
-// Use getAttributeNode to fetch booleans when getAttribute lies
-if ( !assert( function( el ) {
-	return el.getAttribute( "disabled" ) == null;
-} ) ) {
-	addHandle( booleans, function( elem, name, isXML ) {
-		var val;
-		if ( !isXML ) {
-			return elem[ name ] === true ? name.toLowerCase() :
-				( val = elem.getAttributeNode( name ) ) && val.specified ?
-					val.value :
-					null;
-		}
-	} );
-}
-
-return Sizzle;
-
-} )( window );
-
-
-
-jQuery.find = Sizzle;
-jQuery.expr = Sizzle.selectors;
-
-// Deprecated
-jQuery.expr[ ":" ] = jQuery.expr.pseudos;
-jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort;
-jQuery.text = Sizzle.getText;
-jQuery.isXMLDoc = Sizzle.isXML;
-jQuery.contains = Sizzle.contains;
-jQuery.escapeSelector = Sizzle.escape;
-
-
-
-
-var dir = function( elem, dir, until ) {
-	var matched = [],
-		truncate = until !== undefined;
-
-	while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {
-		if ( elem.nodeType === 1 ) {
-			if ( truncate && jQuery( elem ).is( until ) ) {
-				break;
-			}
-			matched.push( elem );
-		}
-	}
-	return matched;
-};
-
-
-var siblings = function( n, elem ) {
-	var matched = [];
-
-	for ( ; n; n = n.nextSibling ) {
-		if ( n.nodeType === 1 && n !== elem ) {
-			matched.push( n );
-		}
-	}
-
-	return matched;
-};
-
-
-var rneedsContext = jQuery.expr.match.needsContext;
-
-
-
-function nodeName( elem, name ) {
-
-	return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
-
-}
-var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i );
-
-
-
-// Implement the identical functionality for filter and not
-function winnow( elements, qualifier, not ) {
-	if ( isFunction( qualifier ) ) {
-		return jQuery.grep( elements, function( elem, i ) {
-			return !!qualifier.call( elem, i, elem ) !== not;
-		} );
-	}
-
-	// Single element
-	if ( qualifier.nodeType ) {
-		return jQuery.grep( elements, function( elem ) {
-			return ( elem === qualifier ) !== not;
-		} );
-	}
-
-	// Arraylike of elements (jQuery, arguments, Array)
-	if ( typeof qualifier !== "string" ) {
-		return jQuery.grep( elements, function( elem ) {
-			return ( indexOf.call( qualifier, elem ) > -1 ) !== not;
-		} );
-	}
-
-	// Filtered directly for both simple and complex selectors
-	return jQuery.filter( qualifier, elements, not );
-}
-
-jQuery.filter = function( expr, elems, not ) {
-	var elem = elems[ 0 ];
-
-	if ( not ) {
-		expr = ":not(" + expr + ")";
-	}
-
-	if ( elems.length === 1 && elem.nodeType === 1 ) {
-		return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [];
-	}
-
-	return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) {
-		return elem.nodeType === 1;
-	} ) );
-};
-
-jQuery.fn.extend( {
-	find: function( selector ) {
-		var i, ret,
-			len = this.length,
-			self = this;
-
-		if ( typeof selector !== "string" ) {
-			return this.pushStack( jQuery( selector ).filter( function() {
-				for ( i = 0; i < len; i++ ) {
-					if ( jQuery.contains( self[ i ], this ) ) {
-						return true;
-					}
-				}
-			} ) );
-		}
-
-		ret = this.pushStack( [] );
-
-		for ( i = 0; i < len; i++ ) {
-			jQuery.find( selector, self[ i ], ret );
-		}
-
-		return len > 1 ? jQuery.uniqueSort( ret ) : ret;
-	},
-	filter: function( selector ) {
-		return this.pushStack( winnow( this, selector || [], false ) );
-	},
-	not: function( selector ) {
-		return this.pushStack( winnow( this, selector || [], true ) );
-	},
-	is: function( selector ) {
-		return !!winnow(
-			this,
-
-			// If this is a positional/relative selector, check membership in the returned set
-			// so $("p:first").is("p:last") won't return true for a doc with two "p".
-			typeof selector === "string" && rneedsContext.test( selector ) ?
-				jQuery( selector ) :
-				selector || [],
-			false
-		).length;
-	}
-} );
-
-
-// Initialize a jQuery object
-
-
-// A central reference to the root jQuery(document)
-var rootjQuery,
-
-	// A simple way to check for HTML strings
-	// Prioritize #id over <tag> to avoid XSS via location.hash (#9521)
-	// Strict HTML recognition (#11290: must start with <)
-	// Shortcut simple #id case for speed
-	rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/,
-
-	init = jQuery.fn.init = function( selector, context, root ) {
-		var match, elem;
-
-		// HANDLE: $(""), $(null), $(undefined), $(false)
-		if ( !selector ) {
-			return this;
-		}
-
-		// Method init() accepts an alternate rootjQuery
-		// so migrate can support jQuery.sub (gh-2101)
-		root = root || rootjQuery;
-
-		// Handle HTML strings
-		if ( typeof selector === "string" ) {
-			if ( selector[ 0 ] === "<" &&
-				selector[ selector.length - 1 ] === ">" &&
-				selector.length >= 3 ) {
-
-				// Assume that strings that start and end with <> are HTML and skip the regex check
-				match = [ null, selector, null ];
-
-			} else {
-				match = rquickExpr.exec( selector );
-			}
-
-			// Match html or make sure no context is specified for #id
-			if ( match && ( match[ 1 ] || !context ) ) {
-
-				// HANDLE: $(html) -> $(array)
-				if ( match[ 1 ] ) {
-					context = context instanceof jQuery ? context[ 0 ] : context;
-
-					// Option to run scripts is true for back-compat
-					// Intentionally let the error be thrown if parseHTML is not present
-					jQuery.merge( this, jQuery.parseHTML(
-						match[ 1 ],
-						context && context.nodeType ? context.ownerDocument || context : document,
-						true
-					) );
-
-					// HANDLE: $(html, props)
-					if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) {
-						for ( match in context ) {
-
-							// Properties of context are called as methods if possible
-							if ( isFunction( this[ match ] ) ) {
-								this[ match ]( context[ match ] );
-
-							// ...and otherwise set as attributes
-							} else {
-								this.attr( match, context[ match ] );
-							}
-						}
-					}
-
-					return this;
-
-				// HANDLE: $(#id)
-				} else {
-					elem = document.getElementById( match[ 2 ] );
-
-					if ( elem ) {
-
-						// Inject the element directly into the jQuery object
-						this[ 0 ] = elem;
-						this.length = 1;
-					}
-					return this;
-				}
-
-			// HANDLE: $(expr, $(...))
-			} else if ( !context || context.jquery ) {
-				return ( context || root ).find( selector );
-
-			// HANDLE: $(expr, context)
-			// (which is just equivalent to: $(context).find(expr)
-			} else {
-				return this.constructor( context ).find( selector );
-			}
-
-		// HANDLE: $(DOMElement)
-		} else if ( selector.nodeType ) {
-			this[ 0 ] = selector;
-			this.length = 1;
-			return this;
-
-		// HANDLE: $(function)
-		// Shortcut for document ready
-		} else if ( isFunction( selector ) ) {
-			return root.ready !== undefined ?
-				root.ready( selector ) :
-
-				// Execute immediately if ready is not present
-				selector( jQuery );
-		}
-
-		return jQuery.makeArray( selector, this );
-	};
-
-// Give the init function the jQuery prototype for later instantiation
-init.prototype = jQuery.fn;
-
-// Initialize central reference
-rootjQuery = jQuery( document );
-
-
-var rparentsprev = /^(?:parents|prev(?:Until|All))/,
-
-	// Methods guaranteed to produce a unique set when starting from a unique set
-	guaranteedUnique = {
-		children: true,
-		contents: true,
-		next: true,
-		prev: true
-	};
-
-jQuery.fn.extend( {
-	has: function( target ) {
-		var targets = jQuery( target, this ),
-			l = targets.length;
-
-		return this.filter( function() {
-			var i = 0;
-			for ( ; i < l; i++ ) {
-				if ( jQuery.contains( this, targets[ i ] ) ) {
-					return true;
-				}
-			}
-		} );
-	},
-
-	closest: function( selectors, context ) {
-		var cur,
-			i = 0,
-			l = this.length,
-			matched = [],
-			targets = typeof selectors !== "string" && jQuery( selectors );
-
-		// Positional selectors never match, since there's no _selection_ context
-		if ( !rneedsContext.test( selectors ) ) {
-			for ( ; i < l; i++ ) {
-				for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) {
-
-					// Always skip document fragments
-					if ( cur.nodeType < 11 && ( targets ?
-						targets.index( cur ) > -1 :
-
-						// Don't pass non-elements to Sizzle
-						cur.nodeType === 1 &&
-							jQuery.find.matchesSelector( cur, selectors ) ) ) {
-
-						matched.push( cur );
-						break;
-					}
-				}
-			}
-		}
-
-		return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched );
-	},
-
-	// Determine the position of an element within the set
-	index: function( elem ) {
-
-		// No argument, return index in parent
-		if ( !elem ) {
-			return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1;
-		}
-
-		// Index in selector
-		if ( typeof elem === "string" ) {
-			return indexOf.call( jQuery( elem ), this[ 0 ] );
-		}
-
-		// Locate the position of the desired element
-		return indexOf.call( this,
-
-			// If it receives a jQuery object, the first element is used
-			elem.jquery ? elem[ 0 ] : elem
-		);
-	},
-
-	add: function( selector, context ) {
-		return this.pushStack(
-			jQuery.uniqueSort(
-				jQuery.merge( this.get(), jQuery( selector, context ) )
-			)
-		);
-	},
-
-	addBack: function( selector ) {
-		return this.add( selector == null ?
-			this.prevObject : this.prevObject.filter( selector )
-		);
-	}
-} );
-
-function sibling( cur, dir ) {
-	while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {}
-	return cur;
-}
-
-jQuery.each( {
-	parent: function( elem ) {
-		var parent = elem.parentNode;
-		return parent && parent.nodeType !== 11 ? parent : null;
-	},
-	parents: function( elem ) {
-		return dir( elem, "parentNode" );
-	},
-	parentsUntil: function( elem, _i, until ) {
-		return dir( elem, "parentNode", until );
-	},
-	next: function( elem ) {
-		return sibling( elem, "nextSibling" );
-	},
-	prev: function( elem ) {
-		return sibling( elem, "previousSibling" );
-	},
-	nextAll: function( elem ) {
-		return dir( elem, "nextSibling" );
-	},
-	prevAll: function( elem ) {
-		return dir( elem, "previousSibling" );
-	},
-	nextUntil: function( elem, _i, until ) {
-		return dir( elem, "nextSibling", until );
-	},
-	prevUntil: function( elem, _i, until ) {
-		return dir( elem, "previousSibling", until );
-	},
-	siblings: function( elem ) {
-		return siblings( ( elem.parentNode || {} ).firstChild, elem );
-	},
-	children: function( elem ) {
-		return siblings( elem.firstChild );
-	},
-	contents: function( elem ) {
-		if ( elem.contentDocument != null &&
-
-			// Support: IE 11+
-			// <object> elements with no `data` attribute has an object
-			// `contentDocument` with a `null` prototype.
-			getProto( elem.contentDocument ) ) {
-
-			return elem.contentDocument;
-		}
-
-		// Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only
-		// Treat the template element as a regular one in browsers that
-		// don't support it.
-		if ( nodeName( elem, "template" ) ) {
-			elem = elem.content || elem;
-		}
-
-		return jQuery.merge( [], elem.childNodes );
-	}
-}, function( name, fn ) {
-	jQuery.fn[ name ] = function( until, selector ) {
-		var matched = jQuery.map( this, fn, until );
-
-		if ( name.slice( -5 ) !== "Until" ) {
-			selector = until;
-		}
-
-		if ( selector && typeof selector === "string" ) {
-			matched = jQuery.filter( selector, matched );
-		}
-
-		if ( this.length > 1 ) {
-
-			// Remove duplicates
-			if ( !guaranteedUnique[ name ] ) {
-				jQuery.uniqueSort( matched );
-			}
-
-			// Reverse order for parents* and prev-derivatives
-			if ( rparentsprev.test( name ) ) {
-				matched.reverse();
-			}
-		}
-
-		return this.pushStack( matched );
-	};
-} );
-var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g );
-
-
-
-// Convert String-formatted options into Object-formatted ones
-function createOptions( options ) {
-	var object = {};
-	jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) {
-		object[ flag ] = true;
-	} );
-	return object;
-}
-
-/*
- * Create a callback list using the following parameters:
- *
- *	options: an optional list of space-separated options that will change how
- *			the callback list behaves or a more traditional option object
- *
- * By default a callback list will act like an event callback list and can be
- * "fired" multiple times.
- *
- * Possible options:
- *
- *	once:			will ensure the callback list can only be fired once (like a Deferred)
- *
- *	memory:			will keep track of previous values and will call any callback added
- *					after the list has been fired right away with the latest "memorized"
- *					values (like a Deferred)
- *
- *	unique:			will ensure a callback can only be added once (no duplicate in the list)
- *
- *	stopOnFalse:	interrupt callings when a callback returns false
- *
- */
-jQuery.Callbacks = function( options ) {
-
-	// Convert options from String-formatted to Object-formatted if needed
-	// (we check in cache first)
-	options = typeof options === "string" ?
-		createOptions( options ) :
-		jQuery.extend( {}, options );
-
-	var // Flag to know if list is currently firing
-		firing,
-
-		// Last fire value for non-forgettable lists
-		memory,
-
-		// Flag to know if list was already fired
-		fired,
-
-		// Flag to prevent firing
-		locked,
-
-		// Actual callback list
-		list = [],
-
-		// Queue of execution data for repeatable lists
-		queue = [],
-
-		// Index of currently firing callback (modified by add/remove as needed)
-		firingIndex = -1,
-
-		// Fire callbacks
-		fire = function() {
-
-			// Enforce single-firing
-			locked = locked || options.once;
-
-			// Execute callbacks for all pending executions,
-			// respecting firingIndex overrides and runtime changes
-			fired = firing = true;
-			for ( ; queue.length; firingIndex = -1 ) {
-				memory = queue.shift();
-				while ( ++firingIndex < list.length ) {
-
-					// Run callback and check for early termination
-					if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false &&
-						options.stopOnFalse ) {
-
-						// Jump to end and forget the data so .add doesn't re-fire
-						firingIndex = list.length;
-						memory = false;
-					}
-				}
-			}
-
-			// Forget the data if we're done with it
-			if ( !options.memory ) {
-				memory = false;
-			}
-
-			firing = false;
-
-			// Clean up if we're done firing for good
-			if ( locked ) {
-
-				// Keep an empty list if we have data for future add calls
-				if ( memory ) {
-					list = [];
-
-				// Otherwise, this object is spent
-				} else {
-					list = "";
-				}
-			}
-		},
-
-		// Actual Callbacks object
-		self = {
-
-			// Add a callback or a collection of callbacks to the list
-			add: function() {
-				if ( list ) {
-
-					// If we have memory from a past run, we should fire after adding
-					if ( memory && !firing ) {
-						firingIndex = list.length - 1;
-						queue.push( memory );
-					}
-
-					( function add( args ) {
-						jQuery.each( args, function( _, arg ) {
-							if ( isFunction( arg ) ) {
-								if ( !options.unique || !self.has( arg ) ) {
-									list.push( arg );
-								}
-							} else if ( arg && arg.length && toType( arg ) !== "string" ) {
-
-								// Inspect recursively
-								add( arg );
-							}
-						} );
-					} )( arguments );
-
-					if ( memory && !firing ) {
-						fire();
-					}
-				}
-				return this;
-			},
-
-			// Remove a callback from the list
-			remove: function() {
-				jQuery.each( arguments, function( _, arg ) {
-					var index;
-					while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) {
-						list.splice( index, 1 );
-
-						// Handle firing indexes
-						if ( index <= firingIndex ) {
-							firingIndex--;
-						}
-					}
-				} );
-				return this;
-			},
-
-			// Check if a given callback is in the list.
-			// If no argument is given, return whether or not list has callbacks attached.
-			has: function( fn ) {
-				return fn ?
-					jQuery.inArray( fn, list ) > -1 :
-					list.length > 0;
-			},
-
-			// Remove all callbacks from the list
-			empty: function() {
-				if ( list ) {
-					list = [];
-				}
-				return this;
-			},
-
-			// Disable .fire and .add
-			// Abort any current/pending executions
-			// Clear all callbacks and values
-			disable: function() {
-				locked = queue = [];
-				list = memory = "";
-				return this;
-			},
-			disabled: function() {
-				return !list;
-			},
-
-			// Disable .fire
-			// Also disable .add unless we have memory (since it would have no effect)
-			// Abort any pending executions
-			lock: function() {
-				locked = queue = [];
-				if ( !memory && !firing ) {
-					list = memory = "";
-				}
-				return this;
-			},
-			locked: function() {
-				return !!locked;
-			},
-
-			// Call all callbacks with the given context and arguments
-			fireWith: function( context, args ) {
-				if ( !locked ) {
-					args = args || [];
-					args = [ context, args.slice ? args.slice() : args ];
-					queue.push( args );
-					if ( !firing ) {
-						fire();
-					}
-				}
-				return this;
-			},
-
-			// Call all the callbacks with the given arguments
-			fire: function() {
-				self.fireWith( this, arguments );
-				return this;
-			},
-
-			// To know if the callbacks have already been called at least once
-			fired: function() {
-				return !!fired;
-			}
-		};
-
-	return self;
-};
-
-
-function Identity( v ) {
-	return v;
-}
-function Thrower( ex ) {
-	throw ex;
-}
-
-function adoptValue( value, resolve, reject, noValue ) {
-	var method;
-
-	try {
-
-		// Check for promise aspect first to privilege synchronous behavior
-		if ( value && isFunction( ( method = value.promise ) ) ) {
-			method.call( value ).done( resolve ).fail( reject );
-
-		// Other thenables
-		} else if ( value && isFunction( ( method = value.then ) ) ) {
-			method.call( value, resolve, reject );
-
-		// Other non-thenables
-		} else {
-
-			// Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer:
-			// * false: [ value ].slice( 0 ) => resolve( value )
-			// * true: [ value ].slice( 1 ) => resolve()
-			resolve.apply( undefined, [ value ].slice( noValue ) );
-		}
-
-	// For Promises/A+, convert exceptions into rejections
-	// Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in
-	// Deferred#then to conditionally suppress rejection.
-	} catch ( value ) {
-
-		// Support: Android 4.0 only
-		// Strict mode functions invoked without .call/.apply get global-object context
-		reject.apply( undefined, [ value ] );
-	}
-}
-
-jQuery.extend( {
-
-	Deferred: function( func ) {
-		var tuples = [
-
-				// action, add listener, callbacks,
-				// ... .then handlers, argument index, [final state]
-				[ "notify", "progress", jQuery.Callbacks( "memory" ),
-					jQuery.Callbacks( "memory" ), 2 ],
-				[ "resolve", "done", jQuery.Callbacks( "once memory" ),
-					jQuery.Callbacks( "once memory" ), 0, "resolved" ],
-				[ "reject", "fail", jQuery.Callbacks( "once memory" ),
-					jQuery.Callbacks( "once memory" ), 1, "rejected" ]
-			],
-			state = "pending",
-			promise = {
-				state: function() {
-					return state;
-				},
-				always: function() {
-					deferred.done( arguments ).fail( arguments );
-					return this;
-				},
-				"catch": function( fn ) {
-					return promise.then( null, fn );
-				},
-
-				// Keep pipe for back-compat
-				pipe: function( /* fnDone, fnFail, fnProgress */ ) {
-					var fns = arguments;
-
-					return jQuery.Deferred( function( newDefer ) {
-						jQuery.each( tuples, function( _i, tuple ) {
-
-							// Map tuples (progress, done, fail) to arguments (done, fail, progress)
-							var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ];
-
-							// deferred.progress(function() { bind to newDefer or newDefer.notify })
-							// deferred.done(function() { bind to newDefer or newDefer.resolve })
-							// deferred.fail(function() { bind to newDefer or newDefer.reject })
-							deferred[ tuple[ 1 ] ]( function() {
-								var returned = fn && fn.apply( this, arguments );
-								if ( returned && isFunction( returned.promise ) ) {
-									returned.promise()
-										.progress( newDefer.notify )
-										.done( newDefer.resolve )
-										.fail( newDefer.reject );
-								} else {
-									newDefer[ tuple[ 0 ] + "With" ](
-										this,
-										fn ? [ returned ] : arguments
-									);
-								}
-							} );
-						} );
-						fns = null;
-					} ).promise();
-				},
-				then: function( onFulfilled, onRejected, onProgress ) {
-					var maxDepth = 0;
-					function resolve( depth, deferred, handler, special ) {
-						return function() {
-							var that = this,
-								args = arguments,
-								mightThrow = function() {
-									var returned, then;
-
-									// Support: Promises/A+ section 2.3.3.3.3
-									// https://promisesaplus.com/#point-59
-									// Ignore double-resolution attempts
-									if ( depth < maxDepth ) {
-										return;
-									}
-
-									returned = handler.apply( that, args );
-
-									// Support: Promises/A+ section 2.3.1
-									// https://promisesaplus.com/#point-48
-									if ( returned === deferred.promise() ) {
-										throw new TypeError( "Thenable self-resolution" );
-									}
-
-									// Support: Promises/A+ sections 2.3.3.1, 3.5
-									// https://promisesaplus.com/#point-54
-									// https://promisesaplus.com/#point-75
-									// Retrieve `then` only once
-									then = returned &&
-
-										// Support: Promises/A+ section 2.3.4
-										// https://promisesaplus.com/#point-64
-										// Only check objects and functions for thenability
-										( typeof returned === "object" ||
-											typeof returned === "function" ) &&
-										returned.then;
-
-									// Handle a returned thenable
-									if ( isFunction( then ) ) {
-
-										// Special processors (notify) just wait for resolution
-										if ( special ) {
-											then.call(
-												returned,
-												resolve( maxDepth, deferred, Identity, special ),
-												resolve( maxDepth, deferred, Thrower, special )
-											);
-
-										// Normal processors (resolve) also hook into progress
-										} else {
-
-											// ...and disregard older resolution values
-											maxDepth++;
-
-											then.call(
-												returned,
-												resolve( maxDepth, deferred, Identity, special ),
-												resolve( maxDepth, deferred, Thrower, special ),
-												resolve( maxDepth, deferred, Identity,
-													deferred.notifyWith )
-											);
-										}
-
-									// Handle all other returned values
-									} else {
-
-										// Only substitute handlers pass on context
-										// and multiple values (non-spec behavior)
-										if ( handler !== Identity ) {
-											that = undefined;
-											args = [ returned ];
-										}
-
-										// Process the value(s)
-										// Default process is resolve
-										( special || deferred.resolveWith )( that, args );
-									}
-								},
-
-								// Only normal processors (resolve) catch and reject exceptions
-								process = special ?
-									mightThrow :
-									function() {
-										try {
-											mightThrow();
-										} catch ( e ) {
-
-											if ( jQuery.Deferred.exceptionHook ) {
-												jQuery.Deferred.exceptionHook( e,
-													process.stackTrace );
-											}
-
-											// Support: Promises/A+ section 2.3.3.3.4.1
-											// https://promisesaplus.com/#point-61
-											// Ignore post-resolution exceptions
-											if ( depth + 1 >= maxDepth ) {
-
-												// Only substitute handlers pass on context
-												// and multiple values (non-spec behavior)
-												if ( handler !== Thrower ) {
-													that = undefined;
-													args = [ e ];
-												}
-
-												deferred.rejectWith( that, args );
-											}
-										}
-									};
-
-							// Support: Promises/A+ section 2.3.3.3.1
-							// https://promisesaplus.com/#point-57
-							// Re-resolve promises immediately to dodge false rejection from
-							// subsequent errors
-							if ( depth ) {
-								process();
-							} else {
-
-								// Call an optional hook to record the stack, in case of exception
-								// since it's otherwise lost when execution goes async
-								if ( jQuery.Deferred.getStackHook ) {
-									process.stackTrace = jQuery.Deferred.getStackHook();
-								}
-								window.setTimeout( process );
-							}
-						};
-					}
-
-					return jQuery.Deferred( function( newDefer ) {
-
-						// progress_handlers.add( ... )
-						tuples[ 0 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onProgress ) ?
-									onProgress :
-									Identity,
-								newDefer.notifyWith
-							)
-						);
-
-						// fulfilled_handlers.add( ... )
-						tuples[ 1 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onFulfilled ) ?
-									onFulfilled :
-									Identity
-							)
-						);
-
-						// rejected_handlers.add( ... )
-						tuples[ 2 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onRejected ) ?
-									onRejected :
-									Thrower
-							)
-						);
-					} ).promise();
-				},
-
-				// Get a promise for this deferred
-				// If obj is provided, the promise aspect is added to the object
-				promise: function( obj ) {
-					return obj != null ? jQuery.extend( obj, promise ) : promise;
-				}
-			},
-			deferred = {};
-
-		// Add list-specific methods
-		jQuery.each( tuples, function( i, tuple ) {
-			var list = tuple[ 2 ],
-				stateString = tuple[ 5 ];
-
-			// promise.progress = list.add
-			// promise.done = list.add
-			// promise.fail = list.add
-			promise[ tuple[ 1 ] ] = list.add;
-
-			// Handle state
-			if ( stateString ) {
-				list.add(
-					function() {
-
-						// state = "resolved" (i.e., fulfilled)
-						// state = "rejected"
-						state = stateString;
-					},
-
-					// rejected_callbacks.disable
-					// fulfilled_callbacks.disable
-					tuples[ 3 - i ][ 2 ].disable,
-
-					// rejected_handlers.disable
-					// fulfilled_handlers.disable
-					tuples[ 3 - i ][ 3 ].disable,
-
-					// progress_callbacks.lock
-					tuples[ 0 ][ 2 ].lock,
-
-					// progress_handlers.lock
-					tuples[ 0 ][ 3 ].lock
-				);
-			}
-
-			// progress_handlers.fire
-			// fulfilled_handlers.fire
-			// rejected_handlers.fire
-			list.add( tuple[ 3 ].fire );
-
-			// deferred.notify = function() { deferred.notifyWith(...) }
-			// deferred.resolve = function() { deferred.resolveWith(...) }
-			// deferred.reject = function() { deferred.rejectWith(...) }
-			deferred[ tuple[ 0 ] ] = function() {
-				deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments );
-				return this;
-			};
-
-			// deferred.notifyWith = list.fireWith
-			// deferred.resolveWith = list.fireWith
-			// deferred.rejectWith = list.fireWith
-			deferred[ tuple[ 0 ] + "With" ] = list.fireWith;
-		} );
-
-		// Make the deferred a promise
-		promise.promise( deferred );
-
-		// Call given func if any
-		if ( func ) {
-			func.call( deferred, deferred );
-		}
-
-		// All done!
-		return deferred;
-	},
-
-	// Deferred helper
-	when: function( singleValue ) {
-		var
-
-			// count of uncompleted subordinates
-			remaining = arguments.length,
-
-			// count of unprocessed arguments
-			i = remaining,
-
-			// subordinate fulfillment data
-			resolveContexts = Array( i ),
-			resolveValues = slice.call( arguments ),
-
-			// the primary Deferred
-			primary = jQuery.Deferred(),
-
-			// subordinate callback factory
-			updateFunc = function( i ) {
-				return function( value ) {
-					resolveContexts[ i ] = this;
-					resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value;
-					if ( !( --remaining ) ) {
-						primary.resolveWith( resolveContexts, resolveValues );
-					}
-				};
-			};
-
-		// Single- and empty arguments are adopted like Promise.resolve
-		if ( remaining <= 1 ) {
-			adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject,
-				!remaining );
-
-			// Use .then() to unwrap secondary thenables (cf. gh-3000)
-			if ( primary.state() === "pending" ||
-				isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) {
-
-				return primary.then();
-			}
-		}
-
-		// Multiple arguments are aggregated like Promise.all array elements
-		while ( i-- ) {
-			adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject );
-		}
-
-		return primary.promise();
-	}
-} );
-
-
-// These usually indicate a programmer mistake during development,
-// warn about them ASAP rather than swallowing them by default.
-var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
-
-jQuery.Deferred.exceptionHook = function( error, stack ) {
-
-	// Support: IE 8 - 9 only
-	// Console exists when dev tools are open, which can happen at any time
-	if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) {
-		window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack );
-	}
-};
-
-
-
-
-jQuery.readyException = function( error ) {
-	window.setTimeout( function() {
-		throw error;
-	} );
-};
-
-
-
-
-// The deferred used on DOM ready
-var readyList = jQuery.Deferred();
-
-jQuery.fn.ready = function( fn ) {
-
-	readyList
-		.then( fn )
-
-		// Wrap jQuery.readyException in a function so that the lookup
-		// happens at the time of error handling instead of callback
-		// registration.
-		.catch( function( error ) {
-			jQuery.readyException( error );
-		} );
-
-	return this;
-};
-
-jQuery.extend( {
-
-	// Is the DOM ready to be used? Set to true once it occurs.
-	isReady: false,
-
-	// A counter to track how many items to wait for before
-	// the ready event fires. See #6781
-	readyWait: 1,
-
-	// Handle when the DOM is ready
-	ready: function( wait ) {
-
-		// Abort if there are pending holds or we're already ready
-		if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) {
-			return;
-		}
-
-		// Remember that the DOM is ready
-		jQuery.isReady = true;
-
-		// If a normal DOM Ready event fired, decrement, and wait if need be
-		if ( wait !== true && --jQuery.readyWait > 0 ) {
-			return;
-		}
-
-		// If there are functions bound, to execute
-		readyList.resolveWith( document, [ jQuery ] );
-	}
-} );
-
-jQuery.ready.then = readyList.then;
-
-// The ready event handler and self cleanup method
-function completed() {
-	document.removeEventListener( "DOMContentLoaded", completed );
-	window.removeEventListener( "load", completed );
-	jQuery.ready();
-}
-
-// Catch cases where $(document).ready() is called
-// after the browser event has already occurred.
-// Support: IE <=9 - 10 only
-// Older IE sometimes signals "interactive" too soon
-if ( document.readyState === "complete" ||
-	( document.readyState !== "loading" && !document.documentElement.doScroll ) ) {
-
-	// Handle it asynchronously to allow scripts the opportunity to delay ready
-	window.setTimeout( jQuery.ready );
-
-} else {
-
-	// Use the handy event callback
-	document.addEventListener( "DOMContentLoaded", completed );
-
-	// A fallback to window.onload, that will always work
-	window.addEventListener( "load", completed );
-}
-
-
-
-
-// Multifunctional method to get and set values of a collection
-// The value/s can optionally be executed if it's a function
-var access = function( elems, fn, key, value, chainable, emptyGet, raw ) {
-	var i = 0,
-		len = elems.length,
-		bulk = key == null;
-
-	// Sets many values
-	if ( toType( key ) === "object" ) {
-		chainable = true;
-		for ( i in key ) {
-			access( elems, fn, i, key[ i ], true, emptyGet, raw );
-		}
-
-	// Sets one value
-	} else if ( value !== undefined ) {
-		chainable = true;
-
-		if ( !isFunction( value ) ) {
-			raw = true;
-		}
-
-		if ( bulk ) {
-
-			// Bulk operations run against the entire set
-			if ( raw ) {
-				fn.call( elems, value );
-				fn = null;
-
-			// ...except when executing function values
-			} else {
-				bulk = fn;
-				fn = function( elem, _key, value ) {
-					return bulk.call( jQuery( elem ), value );
-				};
-			}
-		}
-
-		if ( fn ) {
-			for ( ; i < len; i++ ) {
-				fn(
-					elems[ i ], key, raw ?
-						value :
-						value.call( elems[ i ], i, fn( elems[ i ], key ) )
-				);
-			}
-		}
-	}
-
-	if ( chainable ) {
-		return elems;
-	}
-
-	// Gets
-	if ( bulk ) {
-		return fn.call( elems );
-	}
-
-	return len ? fn( elems[ 0 ], key ) : emptyGet;
-};
-
-
-// Matches dashed string for camelizing
-var rmsPrefix = /^-ms-/,
-	rdashAlpha = /-([a-z])/g;
-
-// Used by camelCase as callback to replace()
-function fcamelCase( _all, letter ) {
-	return letter.toUpperCase();
-}
-
-// Convert dashed to camelCase; used by the css and data modules
-// Support: IE <=9 - 11, Edge 12 - 15
-// Microsoft forgot to hump their vendor prefix (#9572)
-function camelCase( string ) {
-	return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
-}
-var acceptData = function( owner ) {
-
-	// Accepts only:
-	//  - Node
-	//    - Node.ELEMENT_NODE
-	//    - Node.DOCUMENT_NODE
-	//  - Object
-	//    - Any
-	return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );
-};
-
-
-
-
-function Data() {
-	this.expando = jQuery.expando + Data.uid++;
-}
-
-Data.uid = 1;
-
-Data.prototype = {
-
-	cache: function( owner ) {
-
-		// Check if the owner object already has a cache
-		var value = owner[ this.expando ];
-
-		// If not, create one
-		if ( !value ) {
-			value = {};
-
-			// We can accept data for non-element nodes in modern browsers,
-			// but we should not, see #8335.
-			// Always return an empty object.
-			if ( acceptData( owner ) ) {
-
-				// If it is a node unlikely to be stringify-ed or looped over
-				// use plain assignment
-				if ( owner.nodeType ) {
-					owner[ this.expando ] = value;
-
-				// Otherwise secure it in a non-enumerable property
-				// configurable must be true to allow the property to be
-				// deleted when data is removed
-				} else {
-					Object.defineProperty( owner, this.expando, {
-						value: value,
-						configurable: true
-					} );
-				}
-			}
-		}
-
-		return value;
-	},
-	set: function( owner, data, value ) {
-		var prop,
-			cache = this.cache( owner );
-
-		// Handle: [ owner, key, value ] args
-		// Always use camelCase key (gh-2257)
-		if ( typeof data === "string" ) {
-			cache[ camelCase( data ) ] = value;
-
-		// Handle: [ owner, { properties } ] args
-		} else {
-
-			// Copy the properties one-by-one to the cache object
-			for ( prop in data ) {
-				cache[ camelCase( prop ) ] = data[ prop ];
-			}
-		}
-		return cache;
-	},
-	get: function( owner, key ) {
-		return key === undefined ?
-			this.cache( owner ) :
-
-			// Always use camelCase key (gh-2257)
-			owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ];
-	},
-	access: function( owner, key, value ) {
-
-		// In cases where either:
-		//
-		//   1. No key was specified
-		//   2. A string key was specified, but no value provided
-		//
-		// Take the "read" path and allow the get method to determine
-		// which value to return, respectively either:
-		//
-		//   1. The entire cache object
-		//   2. The data stored at the key
-		//
-		if ( key === undefined ||
-				( ( key && typeof key === "string" ) && value === undefined ) ) {
-
-			return this.get( owner, key );
-		}
-
-		// When the key is not a string, or both a key and value
-		// are specified, set or extend (existing objects) with either:
-		//
-		//   1. An object of properties
-		//   2. A key and value
-		//
-		this.set( owner, key, value );
-
-		// Since the "set" path can have two possible entry points
-		// return the expected data based on which path was taken[*]
-		return value !== undefined ? value : key;
-	},
-	remove: function( owner, key ) {
-		var i,
-			cache = owner[ this.expando ];
-
-		if ( cache === undefined ) {
-			return;
-		}
-
-		if ( key !== undefined ) {
-
-			// Support array or space separated string of keys
-			if ( Array.isArray( key ) ) {
-
-				// If key is an array of keys...
-				// We always set camelCase keys, so remove that.
-				key = key.map( camelCase );
-			} else {
-				key = camelCase( key );
-
-				// If a key with the spaces exists, use it.
-				// Otherwise, create an array by matching non-whitespace
-				key = key in cache ?
-					[ key ] :
-					( key.match( rnothtmlwhite ) || [] );
-			}
-
-			i = key.length;
-
-			while ( i-- ) {
-				delete cache[ key[ i ] ];
-			}
-		}
-
-		// Remove the expando if there's no more data
-		if ( key === undefined || jQuery.isEmptyObject( cache ) ) {
-
-			// Support: Chrome <=35 - 45
-			// Webkit & Blink performance suffers when deleting properties
-			// from DOM nodes, so set to undefined instead
-			// https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted)
-			if ( owner.nodeType ) {
-				owner[ this.expando ] = undefined;
-			} else {
-				delete owner[ this.expando ];
-			}
-		}
-	},
-	hasData: function( owner ) {
-		var cache = owner[ this.expando ];
-		return cache !== undefined && !jQuery.isEmptyObject( cache );
-	}
-};
-var dataPriv = new Data();
-
-var dataUser = new Data();
-
-
-
-//	Implementation Summary
-//
-//	1. Enforce API surface and semantic compatibility with 1.9.x branch
-//	2. Improve the module's maintainability by reducing the storage
-//		paths to a single mechanism.
-//	3. Use the same single mechanism to support "private" and "user" data.
-//	4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
-//	5. Avoid exposing implementation details on user objects (eg. expando properties)
-//	6. Provide a clear path for implementation upgrade to WeakMap in 2014
-
-var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
-	rmultiDash = /[A-Z]/g;
-
-function getData( data ) {
-	if ( data === "true" ) {
-		return true;
-	}
-
-	if ( data === "false" ) {
-		return false;
-	}
-
-	if ( data === "null" ) {
-		return null;
-	}
-
-	// Only convert to a number if it doesn't change the string
-	if ( data === +data + "" ) {
-		return +data;
-	}
-
-	if ( rbrace.test( data ) ) {
-		return JSON.parse( data );
-	}
-
-	return data;
-}
-
-function dataAttr( elem, key, data ) {
-	var name;
-
-	// If nothing was found internally, try to fetch any
-	// data from the HTML5 data-* attribute
-	if ( data === undefined && elem.nodeType === 1 ) {
-		name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase();
-		data = elem.getAttribute( name );
-
-		if ( typeof data === "string" ) {
-			try {
-				data = getData( data );
-			} catch ( e ) {}
-
-			// Make sure we set the data so it isn't changed later
-			dataUser.set( elem, key, data );
-		} else {
-			data = undefined;
-		}
-	}
-	return data;
-}
-
-jQuery.extend( {
-	hasData: function( elem ) {
-		return dataUser.hasData( elem ) || dataPriv.hasData( elem );
-	},
-
-	data: function( elem, name, data ) {
-		return dataUser.access( elem, name, data );
-	},
-
-	removeData: function( elem, name ) {
-		dataUser.remove( elem, name );
-	},
-
-	// TODO: Now that all calls to _data and _removeData have been replaced
-	// with direct calls to dataPriv methods, these can be deprecated.
-	_data: function( elem, name, data ) {
-		return dataPriv.access( elem, name, data );
-	},
-
-	_removeData: function( elem, name ) {
-		dataPriv.remove( elem, name );
-	}
-} );
-
-jQuery.fn.extend( {
-	data: function( key, value ) {
-		var i, name, data,
-			elem = this[ 0 ],
-			attrs = elem && elem.attributes;
-
-		// Gets all values
-		if ( key === undefined ) {
-			if ( this.length ) {
-				data = dataUser.get( elem );
-
-				if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) {
-					i = attrs.length;
-					while ( i-- ) {
-
-						// Support: IE 11 only
-						// The attrs elements can be null (#14894)
-						if ( attrs[ i ] ) {
-							name = attrs[ i ].name;
-							if ( name.indexOf( "data-" ) === 0 ) {
-								name = camelCase( name.slice( 5 ) );
-								dataAttr( elem, name, data[ name ] );
-							}
-						}
-					}
-					dataPriv.set( elem, "hasDataAttrs", true );
-				}
-			}
-
-			return data;
-		}
-
-		// Sets multiple values
-		if ( typeof key === "object" ) {
-			return this.each( function() {
-				dataUser.set( this, key );
-			} );
-		}
-
-		return access( this, function( value ) {
-			var data;
-
-			// The calling jQuery object (element matches) is not empty
-			// (and therefore has an element appears at this[ 0 ]) and the
-			// `value` parameter was not undefined. An empty jQuery object
-			// will result in `undefined` for elem = this[ 0 ] which will
-			// throw an exception if an attempt to read a data cache is made.
-			if ( elem && value === undefined ) {
-
-				// Attempt to get data from the cache
-				// The key will always be camelCased in Data
-				data = dataUser.get( elem, key );
-				if ( data !== undefined ) {
-					return data;
-				}
-
-				// Attempt to "discover" the data in
-				// HTML5 custom data-* attrs
-				data = dataAttr( elem, key );
-				if ( data !== undefined ) {
-					return data;
-				}
-
-				// We tried really hard, but the data doesn't exist.
-				return;
-			}
-
-			// Set the data...
-			this.each( function() {
-
-				// We always store the camelCased key
-				dataUser.set( this, key, value );
-			} );
-		}, null, value, arguments.length > 1, null, true );
-	},
-
-	removeData: function( key ) {
-		return this.each( function() {
-			dataUser.remove( this, key );
-		} );
-	}
-} );
-
-
-jQuery.extend( {
-	queue: function( elem, type, data ) {
-		var queue;
-
-		if ( elem ) {
-			type = ( type || "fx" ) + "queue";
-			queue = dataPriv.get( elem, type );
-
-			// Speed up dequeue by getting out quickly if this is just a lookup
-			if ( data ) {
-				if ( !queue || Array.isArray( data ) ) {
-					queue = dataPriv.access( elem, type, jQuery.makeArray( data ) );
-				} else {
-					queue.push( data );
-				}
-			}
-			return queue || [];
-		}
-	},
-
-	dequeue: function( elem, type ) {
-		type = type || "fx";
-
-		var queue = jQuery.queue( elem, type ),
-			startLength = queue.length,
-			fn = queue.shift(),
-			hooks = jQuery._queueHooks( elem, type ),
-			next = function() {
-				jQuery.dequeue( elem, type );
-			};
-
-		// If the fx queue is dequeued, always remove the progress sentinel
-		if ( fn === "inprogress" ) {
-			fn = queue.shift();
-			startLength--;
-		}
-
-		if ( fn ) {
-
-			// Add a progress sentinel to prevent the fx queue from being
-			// automatically dequeued
-			if ( type === "fx" ) {
-				queue.unshift( "inprogress" );
-			}
-
-			// Clear up the last queue stop function
-			delete hooks.stop;
-			fn.call( elem, next, hooks );
-		}
-
-		if ( !startLength && hooks ) {
-			hooks.empty.fire();
-		}
-	},
-
-	// Not public - generate a queueHooks object, or return the current one
-	_queueHooks: function( elem, type ) {
-		var key = type + "queueHooks";
-		return dataPriv.get( elem, key ) || dataPriv.access( elem, key, {
-			empty: jQuery.Callbacks( "once memory" ).add( function() {
-				dataPriv.remove( elem, [ type + "queue", key ] );
-			} )
-		} );
-	}
-} );
-
-jQuery.fn.extend( {
-	queue: function( type, data ) {
-		var setter = 2;
-
-		if ( typeof type !== "string" ) {
-			data = type;
-			type = "fx";
-			setter--;
-		}
-
-		if ( arguments.length < setter ) {
-			return jQuery.queue( this[ 0 ], type );
-		}
-
-		return data === undefined ?
-			this :
-			this.each( function() {
-				var queue = jQuery.queue( this, type, data );
-
-				// Ensure a hooks for this queue
-				jQuery._queueHooks( this, type );
-
-				if ( type === "fx" && queue[ 0 ] !== "inprogress" ) {
-					jQuery.dequeue( this, type );
-				}
-			} );
-	},
-	dequeue: function( type ) {
-		return this.each( function() {
-			jQuery.dequeue( this, type );
-		} );
-	},
-	clearQueue: function( type ) {
-		return this.queue( type || "fx", [] );
-	},
-
-	// Get a promise resolved when queues of a certain type
-	// are emptied (fx is the type by default)
-	promise: function( type, obj ) {
-		var tmp,
-			count = 1,
-			defer = jQuery.Deferred(),
-			elements = this,
-			i = this.length,
-			resolve = function() {
-				if ( !( --count ) ) {
-					defer.resolveWith( elements, [ elements ] );
-				}
-			};
-
-		if ( typeof type !== "string" ) {
-			obj = type;
-			type = undefined;
-		}
-		type = type || "fx";
-
-		while ( i-- ) {
-			tmp = dataPriv.get( elements[ i ], type + "queueHooks" );
-			if ( tmp && tmp.empty ) {
-				count++;
-				tmp.empty.add( resolve );
-			}
-		}
-		resolve();
-		return defer.promise( obj );
-	}
-} );
-var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source;
-
-var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" );
-
-
-var cssExpand = [ "Top", "Right", "Bottom", "Left" ];
-
-var documentElement = document.documentElement;
-
-
-
-	var isAttached = function( elem ) {
-			return jQuery.contains( elem.ownerDocument, elem );
-		},
-		composed = { composed: true };
-
-	// Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only
-	// Check attachment across shadow DOM boundaries when possible (gh-3504)
-	// Support: iOS 10.0-10.2 only
-	// Early iOS 10 versions support `attachShadow` but not `getRootNode`,
-	// leading to errors. We need to check for `getRootNode`.
-	if ( documentElement.getRootNode ) {
-		isAttached = function( elem ) {
-			return jQuery.contains( elem.ownerDocument, elem ) ||
-				elem.getRootNode( composed ) === elem.ownerDocument;
-		};
-	}
-var isHiddenWithinTree = function( elem, el ) {
-
-		// isHiddenWithinTree might be called from jQuery#filter function;
-		// in that case, element will be second argument
-		elem = el || elem;
-
-		// Inline style trumps all
-		return elem.style.display === "none" ||
-			elem.style.display === "" &&
-
-			// Otherwise, check computed style
-			// Support: Firefox <=43 - 45
-			// Disconnected elements can have computed display: none, so first confirm that elem is
-			// in the document.
-			isAttached( elem ) &&
-
-			jQuery.css( elem, "display" ) === "none";
-	};
-
-
-
-function adjustCSS( elem, prop, valueParts, tween ) {
-	var adjusted, scale,
-		maxIterations = 20,
-		currentValue = tween ?
-			function() {
-				return tween.cur();
-			} :
-			function() {
-				return jQuery.css( elem, prop, "" );
-			},
-		initial = currentValue(),
-		unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ),
-
-		// Starting value computation is required for potential unit mismatches
-		initialInUnit = elem.nodeType &&
-			( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) &&
-			rcssNum.exec( jQuery.css( elem, prop ) );
-
-	if ( initialInUnit && initialInUnit[ 3 ] !== unit ) {
-
-		// Support: Firefox <=54
-		// Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144)
-		initial = initial / 2;
-
-		// Trust units reported by jQuery.css
-		unit = unit || initialInUnit[ 3 ];
-
-		// Iteratively approximate from a nonzero starting point
-		initialInUnit = +initial || 1;
-
-		while ( maxIterations-- ) {
-
-			// Evaluate and update our best guess (doubling guesses that zero out).
-			// Finish if the scale equals or crosses 1 (making the old*new product non-positive).
-			jQuery.style( elem, prop, initialInUnit + unit );
-			if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) {
-				maxIterations = 0;
-			}
-			initialInUnit = initialInUnit / scale;
-
-		}
-
-		initialInUnit = initialInUnit * 2;
-		jQuery.style( elem, prop, initialInUnit + unit );
-
-		// Make sure we update the tween properties later on
-		valueParts = valueParts || [];
-	}
-
-	if ( valueParts ) {
-		initialInUnit = +initialInUnit || +initial || 0;
-
-		// Apply relative offset (+=/-=) if specified
-		adjusted = valueParts[ 1 ] ?
-			initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] :
-			+valueParts[ 2 ];
-		if ( tween ) {
-			tween.unit = unit;
-			tween.start = initialInUnit;
-			tween.end = adjusted;
-		}
-	}
-	return adjusted;
-}
-
-
-var defaultDisplayMap = {};
-
-function getDefaultDisplay( elem ) {
-	var temp,
-		doc = elem.ownerDocument,
-		nodeName = elem.nodeName,
-		display = defaultDisplayMap[ nodeName ];
-
-	if ( display ) {
-		return display;
-	}
-
-	temp = doc.body.appendChild( doc.createElement( nodeName ) );
-	display = jQuery.css( temp, "display" );
-
-	temp.parentNode.removeChild( temp );
-
-	if ( display === "none" ) {
-		display = "block";
-	}
-	defaultDisplayMap[ nodeName ] = display;
-
-	return display;
-}
-
-function showHide( elements, show ) {
-	var display, elem,
-		values = [],
-		index = 0,
-		length = elements.length;
-
-	// Determine new display value for elements that need to change
-	for ( ; index < length; index++ ) {
-		elem = elements[ index ];
-		if ( !elem.style ) {
-			continue;
-		}
-
-		display = elem.style.display;
-		if ( show ) {
-
-			// Since we force visibility upon cascade-hidden elements, an immediate (and slow)
-			// check is required in this first loop unless we have a nonempty display value (either
-			// inline or about-to-be-restored)
-			if ( display === "none" ) {
-				values[ index ] = dataPriv.get( elem, "display" ) || null;
-				if ( !values[ index ] ) {
-					elem.style.display = "";
-				}
-			}
-			if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) {
-				values[ index ] = getDefaultDisplay( elem );
-			}
-		} else {
-			if ( display !== "none" ) {
-				values[ index ] = "none";
-
-				// Remember what we're overwriting
-				dataPriv.set( elem, "display", display );
-			}
-		}
-	}
-
-	// Set the display of the elements in a second loop to avoid constant reflow
-	for ( index = 0; index < length; index++ ) {
-		if ( values[ index ] != null ) {
-			elements[ index ].style.display = values[ index ];
-		}
-	}
-
-	return elements;
-}
-
-jQuery.fn.extend( {
-	show: function() {
-		return showHide( this, true );
-	},
-	hide: function() {
-		return showHide( this );
-	},
-	toggle: function( state ) {
-		if ( typeof state === "boolean" ) {
-			return state ? this.show() : this.hide();
-		}
-
-		return this.each( function() {
-			if ( isHiddenWithinTree( this ) ) {
-				jQuery( this ).show();
-			} else {
-				jQuery( this ).hide();
-			}
-		} );
-	}
-} );
-var rcheckableType = ( /^(?:checkbox|radio)$/i );
-
-var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i );
-
-var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i );
-
-
-
-( function() {
-	var fragment = document.createDocumentFragment(),
-		div = fragment.appendChild( document.createElement( "div" ) ),
-		input = document.createElement( "input" );
-
-	// Support: Android 4.0 - 4.3 only
-	// Check state lost if the name is set (#11217)
-	// Support: Windows Web Apps (WWA)
-	// `name` and `type` must use .setAttribute for WWA (#14901)
-	input.setAttribute( "type", "radio" );
-	input.setAttribute( "checked", "checked" );
-	input.setAttribute( "name", "t" );
-
-	div.appendChild( input );
-
-	// Support: Android <=4.1 only
-	// Older WebKit doesn't clone checked state correctly in fragments
-	support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked;
-
-	// Support: IE <=11 only
-	// Make sure textarea (and checkbox) defaultValue is properly cloned
-	div.innerHTML = "<textarea>x</textarea>";
-	support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue;
-
-	// Support: IE <=9 only
-	// IE <=9 replaces <option> tags with their contents when inserted outside of
-	// the select element.
-	div.innerHTML = "<option></option>";
-	support.option = !!div.lastChild;
-} )();
-
-
-// We have to close these tags to support XHTML (#13200)
-var wrapMap = {
-
-	// XHTML parsers do not magically insert elements in the
-	// same way that tag soup parsers do. So we cannot shorten
-	// this by omitting <tbody> or other required elements.
-	thead: [ 1, "<table>", "</table>" ],
-	col: [ 2, "<table><colgroup>", "</colgroup></table>" ],
-	tr: [ 2, "<table><tbody>", "</tbody></table>" ],
-	td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ],
-
-	_default: [ 0, "", "" ]
-};
-
-wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
-wrapMap.th = wrapMap.td;
-
-// Support: IE <=9 only
-if ( !support.option ) {
-	wrapMap.optgroup = wrapMap.option = [ 1, "<select multiple='multiple'>", "</select>" ];
-}
-
-
-function getAll( context, tag ) {
-
-	// Support: IE <=9 - 11 only
-	// Use typeof to avoid zero-argument method invocation on host objects (#15151)
-	var ret;
-
-	if ( typeof context.getElementsByTagName !== "undefined" ) {
-		ret = context.getElementsByTagName( tag || "*" );
-
-	} else if ( typeof context.querySelectorAll !== "undefined" ) {
-		ret = context.querySelectorAll( tag || "*" );
-
-	} else {
-		ret = [];
-	}
-
-	if ( tag === undefined || tag && nodeName( context, tag ) ) {
-		return jQuery.merge( [ context ], ret );
-	}
-
-	return ret;
-}
-
-
-// Mark scripts as having already been evaluated
-function setGlobalEval( elems, refElements ) {
-	var i = 0,
-		l = elems.length;
-
-	for ( ; i < l; i++ ) {
-		dataPriv.set(
-			elems[ i ],
-			"globalEval",
-			!refElements || dataPriv.get( refElements[ i ], "globalEval" )
-		);
-	}
-}
-
-
-var rhtml = /<|&#?\w+;/;
-
-function buildFragment( elems, context, scripts, selection, ignored ) {
-	var elem, tmp, tag, wrap, attached, j,
-		fragment = context.createDocumentFragment(),
-		nodes = [],
-		i = 0,
-		l = elems.length;
-
-	for ( ; i < l; i++ ) {
-		elem = elems[ i ];
-
-		if ( elem || elem === 0 ) {
-
-			// Add nodes directly
-			if ( toType( elem ) === "object" ) {
-
-				// Support: Android <=4.0 only, PhantomJS 1 only
-				// push.apply(_, arraylike) throws on ancient WebKit
-				jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem );
-
-			// Convert non-html into a text node
-			} else if ( !rhtml.test( elem ) ) {
-				nodes.push( context.createTextNode( elem ) );
-
-			// Convert html into DOM nodes
-			} else {
-				tmp = tmp || fragment.appendChild( context.createElement( "div" ) );
-
-				// Deserialize a standard representation
-				tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase();
-				wrap = wrapMap[ tag ] || wrapMap._default;
-				tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ];
-
-				// Descend through wrappers to the right content
-				j = wrap[ 0 ];
-				while ( j-- ) {
-					tmp = tmp.lastChild;
-				}
-
-				// Support: Android <=4.0 only, PhantomJS 1 only
-				// push.apply(_, arraylike) throws on ancient WebKit
-				jQuery.merge( nodes, tmp.childNodes );
-
-				// Remember the top-level container
-				tmp = fragment.firstChild;
-
-				// Ensure the created nodes are orphaned (#12392)
-				tmp.textContent = "";
-			}
-		}
-	}
-
-	// Remove wrapper from fragment
-	fragment.textContent = "";
-
-	i = 0;
-	while ( ( elem = nodes[ i++ ] ) ) {
-
-		// Skip elements already in the context collection (trac-4087)
-		if ( selection && jQuery.inArray( elem, selection ) > -1 ) {
-			if ( ignored ) {
-				ignored.push( elem );
-			}
-			continue;
-		}
-
-		attached = isAttached( elem );
-
-		// Append to fragment
-		tmp = getAll( fragment.appendChild( elem ), "script" );
-
-		// Preserve script evaluation history
-		if ( attached ) {
-			setGlobalEval( tmp );
-		}
-
-		// Capture executables
-		if ( scripts ) {
-			j = 0;
-			while ( ( elem = tmp[ j++ ] ) ) {
-				if ( rscriptType.test( elem.type || "" ) ) {
-					scripts.push( elem );
-				}
-			}
-		}
-	}
-
-	return fragment;
-}
-
-
-var rtypenamespace = /^([^.]*)(?:\.(.+)|)/;
-
-function returnTrue() {
-	return true;
-}
-
-function returnFalse() {
-	return false;
-}
-
-// Support: IE <=9 - 11+
-// focus() and blur() are asynchronous, except when they are no-op.
-// So expect focus to be synchronous when the element is already active,
-// and blur to be synchronous when the element is not already active.
-// (focus and blur are always synchronous in other supported browsers,
-// this just defines when we can count on it).
-function expectSync( elem, type ) {
-	return ( elem === safeActiveElement() ) === ( type === "focus" );
-}
-
-// Support: IE <=9 only
-// Accessing document.activeElement can throw unexpectedly
-// https://bugs.jquery.com/ticket/13393
-function safeActiveElement() {
-	try {
-		return document.activeElement;
-	} catch ( err ) { }
-}
-
-function on( elem, types, selector, data, fn, one ) {
-	var origFn, type;
-
-	// Types can be a map of types/handlers
-	if ( typeof types === "object" ) {
-
-		// ( types-Object, selector, data )
-		if ( typeof selector !== "string" ) {
-
-			// ( types-Object, data )
-			data = data || selector;
-			selector = undefined;
-		}
-		for ( type in types ) {
-			on( elem, type, selector, data, types[ type ], one );
-		}
-		return elem;
-	}
-
-	if ( data == null && fn == null ) {
-
-		// ( types, fn )
-		fn = selector;
-		data = selector = undefined;
-	} else if ( fn == null ) {
-		if ( typeof selector === "string" ) {
-
-			// ( types, selector, fn )
-			fn = data;
-			data = undefined;
-		} else {
-
-			// ( types, data, fn )
-			fn = data;
-			data = selector;
-			selector = undefined;
-		}
-	}
-	if ( fn === false ) {
-		fn = returnFalse;
-	} else if ( !fn ) {
-		return elem;
-	}
-
-	if ( one === 1 ) {
-		origFn = fn;
-		fn = function( event ) {
-
-			// Can use an empty set, since event contains the info
-			jQuery().off( event );
-			return origFn.apply( this, arguments );
-		};
-
-		// Use same guid so caller can remove using origFn
-		fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
-	}
-	return elem.each( function() {
-		jQuery.event.add( this, types, fn, data, selector );
-	} );
-}
-
-/*
- * Helper functions for managing events -- not part of the public interface.
- * Props to Dean Edwards' addEvent library for many of the ideas.
- */
-jQuery.event = {
-
-	global: {},
-
-	add: function( elem, types, handler, data, selector ) {
-
-		var handleObjIn, eventHandle, tmp,
-			events, t, handleObj,
-			special, handlers, type, namespaces, origType,
-			elemData = dataPriv.get( elem );
-
-		// Only attach events to objects that accept data
-		if ( !acceptData( elem ) ) {
-			return;
-		}
-
-		// Caller can pass in an object of custom data in lieu of the handler
-		if ( handler.handler ) {
-			handleObjIn = handler;
-			handler = handleObjIn.handler;
-			selector = handleObjIn.selector;
-		}
-
-		// Ensure that invalid selectors throw exceptions at attach time
-		// Evaluate against documentElement in case elem is a non-element node (e.g., document)
-		if ( selector ) {
-			jQuery.find.matchesSelector( documentElement, selector );
-		}
-
-		// Make sure that the handler has a unique ID, used to find/remove it later
-		if ( !handler.guid ) {
-			handler.guid = jQuery.guid++;
-		}
-
-		// Init the element's event structure and main handler, if this is the first
-		if ( !( events = elemData.events ) ) {
-			events = elemData.events = Object.create( null );
-		}
-		if ( !( eventHandle = elemData.handle ) ) {
-			eventHandle = elemData.handle = function( e ) {
-
-				// Discard the second event of a jQuery.event.trigger() and
-				// when an event is called after a page has unloaded
-				return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ?
-					jQuery.event.dispatch.apply( elem, arguments ) : undefined;
-			};
-		}
-
-		// Handle multiple events separated by a space
-		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
-		t = types.length;
-		while ( t-- ) {
-			tmp = rtypenamespace.exec( types[ t ] ) || [];
-			type = origType = tmp[ 1 ];
-			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
-
-			// There *must* be a type, no attaching namespace-only handlers
-			if ( !type ) {
-				continue;
-			}
-
-			// If event changes its type, use the special event handlers for the changed type
-			special = jQuery.event.special[ type ] || {};
-
-			// If selector defined, determine special event api type, otherwise given type
-			type = ( selector ? special.delegateType : special.bindType ) || type;
-
-			// Update special based on newly reset type
-			special = jQuery.event.special[ type ] || {};
-
-			// handleObj is passed to all event handlers
-			handleObj = jQuery.extend( {
-				type: type,
-				origType: origType,
-				data: data,
-				handler: handler,
-				guid: handler.guid,
-				selector: selector,
-				needsContext: selector && jQuery.expr.match.needsContext.test( selector ),
-				namespace: namespaces.join( "." )
-			}, handleObjIn );
-
-			// Init the event handler queue if we're the first
-			if ( !( handlers = events[ type ] ) ) {
-				handlers = events[ type ] = [];
-				handlers.delegateCount = 0;
-
-				// Only use addEventListener if the special events handler returns false
-				if ( !special.setup ||
-					special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
-
-					if ( elem.addEventListener ) {
-						elem.addEventListener( type, eventHandle );
-					}
-				}
-			}
-
-			if ( special.add ) {
-				special.add.call( elem, handleObj );
-
-				if ( !handleObj.handler.guid ) {
-					handleObj.handler.guid = handler.guid;
-				}
-			}
-
-			// Add to the element's handler list, delegates in front
-			if ( selector ) {
-				handlers.splice( handlers.delegateCount++, 0, handleObj );
-			} else {
-				handlers.push( handleObj );
-			}
-
-			// Keep track of which events have ever been used, for event optimization
-			jQuery.event.global[ type ] = true;
-		}
-
-	},
-
-	// Detach an event or set of events from an element
-	remove: function( elem, types, handler, selector, mappedTypes ) {
-
-		var j, origCount, tmp,
-			events, t, handleObj,
-			special, handlers, type, namespaces, origType,
-			elemData = dataPriv.hasData( elem ) && dataPriv.get( elem );
-
-		if ( !elemData || !( events = elemData.events ) ) {
-			return;
-		}
-
-		// Once for each type.namespace in types; type may be omitted
-		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
-		t = types.length;
-		while ( t-- ) {
-			tmp = rtypenamespace.exec( types[ t ] ) || [];
-			type = origType = tmp[ 1 ];
-			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
-
-			// Unbind all events (on this namespace, if provided) for the element
-			if ( !type ) {
-				for ( type in events ) {
-					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
-				}
-				continue;
-			}
-
-			special = jQuery.event.special[ type ] || {};
-			type = ( selector ? special.delegateType : special.bindType ) || type;
-			handlers = events[ type ] || [];
-			tmp = tmp[ 2 ] &&
-				new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" );
-
-			// Remove matching events
-			origCount = j = handlers.length;
-			while ( j-- ) {
-				handleObj = handlers[ j ];
-
-				if ( ( mappedTypes || origType === handleObj.origType ) &&
-					( !handler || handler.guid === handleObj.guid ) &&
-					( !tmp || tmp.test( handleObj.namespace ) ) &&
-					( !selector || selector === handleObj.selector ||
-						selector === "**" && handleObj.selector ) ) {
-					handlers.splice( j, 1 );
-
-					if ( handleObj.selector ) {
-						handlers.delegateCount--;
-					}
-					if ( special.remove ) {
-						special.remove.call( elem, handleObj );
-					}
-				}
-			}
-
-			// Remove generic event handler if we removed something and no more handlers exist
-			// (avoids potential for endless recursion during removal of special event handlers)
-			if ( origCount && !handlers.length ) {
-				if ( !special.teardown ||
-					special.teardown.call( elem, namespaces, elemData.handle ) === false ) {
-
-					jQuery.removeEvent( elem, type, elemData.handle );
-				}
-
-				delete events[ type ];
-			}
-		}
-
-		// Remove data and the expando if it's no longer used
-		if ( jQuery.isEmptyObject( events ) ) {
-			dataPriv.remove( elem, "handle events" );
-		}
-	},
-
-	dispatch: function( nativeEvent ) {
-
-		var i, j, ret, matched, handleObj, handlerQueue,
-			args = new Array( arguments.length ),
-
-			// Make a writable jQuery.Event from the native event object
-			event = jQuery.event.fix( nativeEvent ),
-
-			handlers = (
-				dataPriv.get( this, "events" ) || Object.create( null )
-			)[ event.type ] || [],
-			special = jQuery.event.special[ event.type ] || {};
-
-		// Use the fix-ed jQuery.Event rather than the (read-only) native event
-		args[ 0 ] = event;
-
-		for ( i = 1; i < arguments.length; i++ ) {
-			args[ i ] = arguments[ i ];
-		}
-
-		event.delegateTarget = this;
-
-		// Call the preDispatch hook for the mapped type, and let it bail if desired
-		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
-			return;
-		}
-
-		// Determine handlers
-		handlerQueue = jQuery.event.handlers.call( this, event, handlers );
-
-		// Run delegates first; they may want to stop propagation beneath us
-		i = 0;
-		while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) {
-			event.currentTarget = matched.elem;
-
-			j = 0;
-			while ( ( handleObj = matched.handlers[ j++ ] ) &&
-				!event.isImmediatePropagationStopped() ) {
-
-				// If the event is namespaced, then each handler is only invoked if it is
-				// specially universal or its namespaces are a superset of the event's.
-				if ( !event.rnamespace || handleObj.namespace === false ||
-					event.rnamespace.test( handleObj.namespace ) ) {
-
-					event.handleObj = handleObj;
-					event.data = handleObj.data;
-
-					ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle ||
-						handleObj.handler ).apply( matched.elem, args );
-
-					if ( ret !== undefined ) {
-						if ( ( event.result = ret ) === false ) {
-							event.preventDefault();
-							event.stopPropagation();
-						}
-					}
-				}
-			}
-		}
-
-		// Call the postDispatch hook for the mapped type
-		if ( special.postDispatch ) {
-			special.postDispatch.call( this, event );
-		}
-
-		return event.result;
-	},
-
-	handlers: function( event, handlers ) {
-		var i, handleObj, sel, matchedHandlers, matchedSelectors,
-			handlerQueue = [],
-			delegateCount = handlers.delegateCount,
-			cur = event.target;
-
-		// Find delegate handlers
-		if ( delegateCount &&
-
-			// Support: IE <=9
-			// Black-hole SVG <use> instance trees (trac-13180)
-			cur.nodeType &&
-
-			// Support: Firefox <=42
-			// Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861)
-			// https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click
-			// Support: IE 11 only
-			// ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343)
-			!( event.type === "click" && event.button >= 1 ) ) {
-
-			for ( ; cur !== this; cur = cur.parentNode || this ) {
-
-				// Don't check non-elements (#13208)
-				// Don't process clicks on disabled elements (#6911, #8165, #11382, #11764)
-				if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) {
-					matchedHandlers = [];
-					matchedSelectors = {};
-					for ( i = 0; i < delegateCount; i++ ) {
-						handleObj = handlers[ i ];
-
-						// Don't conflict with Object.prototype properties (#13203)
-						sel = handleObj.selector + " ";
-
-						if ( matchedSelectors[ sel ] === undefined ) {
-							matchedSelectors[ sel ] = handleObj.needsContext ?
-								jQuery( sel, this ).index( cur ) > -1 :
-								jQuery.find( sel, this, null, [ cur ] ).length;
-						}
-						if ( matchedSelectors[ sel ] ) {
-							matchedHandlers.push( handleObj );
-						}
-					}
-					if ( matchedHandlers.length ) {
-						handlerQueue.push( { elem: cur, handlers: matchedHandlers } );
-					}
-				}
-			}
-		}
-
-		// Add the remaining (directly-bound) handlers
-		cur = this;
-		if ( delegateCount < handlers.length ) {
-			handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } );
-		}
-
-		return handlerQueue;
-	},
-
-	addProp: function( name, hook ) {
-		Object.defineProperty( jQuery.Event.prototype, name, {
-			enumerable: true,
-			configurable: true,
-
-			get: isFunction( hook ) ?
-				function() {
-					if ( this.originalEvent ) {
-						return hook( this.originalEvent );
-					}
-				} :
-				function() {
-					if ( this.originalEvent ) {
-						return this.originalEvent[ name ];
-					}
-				},
-
-			set: function( value ) {
-				Object.defineProperty( this, name, {
-					enumerable: true,
-					configurable: true,
-					writable: true,
-					value: value
-				} );
-			}
-		} );
-	},
-
-	fix: function( originalEvent ) {
-		return originalEvent[ jQuery.expando ] ?
-			originalEvent :
-			new jQuery.Event( originalEvent );
-	},
-
-	special: {
-		load: {
-
-			// Prevent triggered image.load events from bubbling to window.load
-			noBubble: true
-		},
-		click: {
-
-			// Utilize native event to ensure correct state for checkable inputs
-			setup: function( data ) {
-
-				// For mutual compressibility with _default, replace `this` access with a local var.
-				// `|| data` is dead code meant only to preserve the variable through minification.
-				var el = this || data;
-
-				// Claim the first handler
-				if ( rcheckableType.test( el.type ) &&
-					el.click && nodeName( el, "input" ) ) {
-
-					// dataPriv.set( el, "click", ... )
-					leverageNative( el, "click", returnTrue );
-				}
-
-				// Return false to allow normal processing in the caller
-				return false;
-			},
-			trigger: function( data ) {
-
-				// For mutual compressibility with _default, replace `this` access with a local var.
-				// `|| data` is dead code meant only to preserve the variable through minification.
-				var el = this || data;
-
-				// Force setup before triggering a click
-				if ( rcheckableType.test( el.type ) &&
-					el.click && nodeName( el, "input" ) ) {
-
-					leverageNative( el, "click" );
-				}
-
-				// Return non-false to allow normal event-path propagation
-				return true;
-			},
-
-			// For cross-browser consistency, suppress native .click() on links
-			// Also prevent it if we're currently inside a leveraged native-event stack
-			_default: function( event ) {
-				var target = event.target;
-				return rcheckableType.test( target.type ) &&
-					target.click && nodeName( target, "input" ) &&
-					dataPriv.get( target, "click" ) ||
-					nodeName( target, "a" );
-			}
-		},
-
-		beforeunload: {
-			postDispatch: function( event ) {
-
-				// Support: Firefox 20+
-				// Firefox doesn't alert if the returnValue field is not set.
-				if ( event.result !== undefined && event.originalEvent ) {
-					event.originalEvent.returnValue = event.result;
-				}
-			}
-		}
-	}
-};
-
-// Ensure the presence of an event listener that handles manually-triggered
-// synthetic events by interrupting progress until reinvoked in response to
-// *native* events that it fires directly, ensuring that state changes have
-// already occurred before other listeners are invoked.
-function leverageNative( el, type, expectSync ) {
-
-	// Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add
-	if ( !expectSync ) {
-		if ( dataPriv.get( el, type ) === undefined ) {
-			jQuery.event.add( el, type, returnTrue );
-		}
-		return;
-	}
-
-	// Register the controller as a special universal handler for all event namespaces
-	dataPriv.set( el, type, false );
-	jQuery.event.add( el, type, {
-		namespace: false,
-		handler: function( event ) {
-			var notAsync, result,
-				saved = dataPriv.get( this, type );
-
-			if ( ( event.isTrigger & 1 ) && this[ type ] ) {
-
-				// Interrupt processing of the outer synthetic .trigger()ed event
-				// Saved data should be false in such cases, but might be a leftover capture object
-				// from an async native handler (gh-4350)
-				if ( !saved.length ) {
-
-					// Store arguments for use when handling the inner native event
-					// There will always be at least one argument (an event object), so this array
-					// will not be confused with a leftover capture object.
-					saved = slice.call( arguments );
-					dataPriv.set( this, type, saved );
-
-					// Trigger the native event and capture its result
-					// Support: IE <=9 - 11+
-					// focus() and blur() are asynchronous
-					notAsync = expectSync( this, type );
-					this[ type ]();
-					result = dataPriv.get( this, type );
-					if ( saved !== result || notAsync ) {
-						dataPriv.set( this, type, false );
-					} else {
-						result = {};
-					}
-					if ( saved !== result ) {
-
-						// Cancel the outer synthetic event
-						event.stopImmediatePropagation();
-						event.preventDefault();
-
-						// Support: Chrome 86+
-						// In Chrome, if an element having a focusout handler is blurred by
-						// clicking outside of it, it invokes the handler synchronously. If
-						// that handler calls `.remove()` on the element, the data is cleared,
-						// leaving `result` undefined. We need to guard against this.
-						return result && result.value;
-					}
-
-				// If this is an inner synthetic event for an event with a bubbling surrogate
-				// (focus or blur), assume that the surrogate already propagated from triggering the
-				// native event and prevent that from happening again here.
-				// This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the
-				// bubbling surrogate propagates *after* the non-bubbling base), but that seems
-				// less bad than duplication.
-				} else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) {
-					event.stopPropagation();
-				}
-
-			// If this is a native event triggered above, everything is now in order
-			// Fire an inner synthetic event with the original arguments
-			} else if ( saved.length ) {
-
-				// ...and capture the result
-				dataPriv.set( this, type, {
-					value: jQuery.event.trigger(
-
-						// Support: IE <=9 - 11+
-						// Extend with the prototype to reset the above stopImmediatePropagation()
-						jQuery.extend( saved[ 0 ], jQuery.Event.prototype ),
-						saved.slice( 1 ),
-						this
-					)
-				} );
-
-				// Abort handling of the native event
-				event.stopImmediatePropagation();
-			}
-		}
-	} );
-}
-
-jQuery.removeEvent = function( elem, type, handle ) {
-
-	// This "if" is needed for plain objects
-	if ( elem.removeEventListener ) {
-		elem.removeEventListener( type, handle );
-	}
-};
-
-jQuery.Event = function( src, props ) {
-
-	// Allow instantiation without the 'new' keyword
-	if ( !( this instanceof jQuery.Event ) ) {
-		return new jQuery.Event( src, props );
-	}
-
-	// Event object
-	if ( src && src.type ) {
-		this.originalEvent = src;
-		this.type = src.type;
-
-		// Events bubbling up the document may have been marked as prevented
-		// by a handler lower down the tree; reflect the correct value.
-		this.isDefaultPrevented = src.defaultPrevented ||
-				src.defaultPrevented === undefined &&
-
-				// Support: Android <=2.3 only
-				src.returnValue === false ?
-			returnTrue :
-			returnFalse;
-
-		// Create target properties
-		// Support: Safari <=6 - 7 only
-		// Target should not be a text node (#504, #13143)
-		this.target = ( src.target && src.target.nodeType === 3 ) ?
-			src.target.parentNode :
-			src.target;
-
-		this.currentTarget = src.currentTarget;
-		this.relatedTarget = src.relatedTarget;
-
-	// Event type
-	} else {
-		this.type = src;
-	}
-
-	// Put explicitly provided properties onto the event object
-	if ( props ) {
-		jQuery.extend( this, props );
-	}
-
-	// Create a timestamp if incoming event doesn't have one
-	this.timeStamp = src && src.timeStamp || Date.now();
-
-	// Mark it as fixed
-	this[ jQuery.expando ] = true;
-};
-
-// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
-// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
-jQuery.Event.prototype = {
-	constructor: jQuery.Event,
-	isDefaultPrevented: returnFalse,
-	isPropagationStopped: returnFalse,
-	isImmediatePropagationStopped: returnFalse,
-	isSimulated: false,
-
-	preventDefault: function() {
-		var e = this.originalEvent;
-
-		this.isDefaultPrevented = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.preventDefault();
-		}
-	},
-	stopPropagation: function() {
-		var e = this.originalEvent;
-
-		this.isPropagationStopped = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.stopPropagation();
-		}
-	},
-	stopImmediatePropagation: function() {
-		var e = this.originalEvent;
-
-		this.isImmediatePropagationStopped = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.stopImmediatePropagation();
-		}
-
-		this.stopPropagation();
-	}
-};
-
-// Includes all common event props including KeyEvent and MouseEvent specific props
-jQuery.each( {
-	altKey: true,
-	bubbles: true,
-	cancelable: true,
-	changedTouches: true,
-	ctrlKey: true,
-	detail: true,
-	eventPhase: true,
-	metaKey: true,
-	pageX: true,
-	pageY: true,
-	shiftKey: true,
-	view: true,
-	"char": true,
-	code: true,
-	charCode: true,
-	key: true,
-	keyCode: true,
-	button: true,
-	buttons: true,
-	clientX: true,
-	clientY: true,
-	offsetX: true,
-	offsetY: true,
-	pointerId: true,
-	pointerType: true,
-	screenX: true,
-	screenY: true,
-	targetTouches: true,
-	toElement: true,
-	touches: true,
-	which: true
-}, jQuery.event.addProp );
-
-jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) {
-	jQuery.event.special[ type ] = {
-
-		// Utilize native event if possible so blur/focus sequence is correct
-		setup: function() {
-
-			// Claim the first handler
-			// dataPriv.set( this, "focus", ... )
-			// dataPriv.set( this, "blur", ... )
-			leverageNative( this, type, expectSync );
-
-			// Return false to allow normal processing in the caller
-			return false;
-		},
-		trigger: function() {
-
-			// Force setup before trigger
-			leverageNative( this, type );
-
-			// Return non-false to allow normal event-path propagation
-			return true;
-		},
-
-		// Suppress native focus or blur as it's already being fired
-		// in leverageNative.
-		_default: function() {
-			return true;
-		},
-
-		delegateType: delegateType
-	};
-} );
-
-// Create mouseenter/leave events using mouseover/out and event-time checks
-// so that event delegation works in jQuery.
-// Do the same for pointerenter/pointerleave and pointerover/pointerout
-//
-// Support: Safari 7 only
-// Safari sends mouseenter too often; see:
-// https://bugs.chromium.org/p/chromium/issues/detail?id=470258
-// for the description of the bug (it existed in older Chrome versions as well).
-jQuery.each( {
-	mouseenter: "mouseover",
-	mouseleave: "mouseout",
-	pointerenter: "pointerover",
-	pointerleave: "pointerout"
-}, function( orig, fix ) {
-	jQuery.event.special[ orig ] = {
-		delegateType: fix,
-		bindType: fix,
-
-		handle: function( event ) {
-			var ret,
-				target = this,
-				related = event.relatedTarget,
-				handleObj = event.handleObj;
-
-			// For mouseenter/leave call the handler if related is outside the target.
-			// NB: No relatedTarget if the mouse left/entered the browser window
-			if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) {
-				event.type = handleObj.origType;
-				ret = handleObj.handler.apply( this, arguments );
-				event.type = fix;
-			}
-			return ret;
-		}
-	};
-} );
-
-jQuery.fn.extend( {
-
-	on: function( types, selector, data, fn ) {
-		return on( this, types, selector, data, fn );
-	},
-	one: function( types, selector, data, fn ) {
-		return on( this, types, selector, data, fn, 1 );
-	},
-	off: function( types, selector, fn ) {
-		var handleObj, type;
-		if ( types && types.preventDefault && types.handleObj ) {
-
-			// ( event )  dispatched jQuery.Event
-			handleObj = types.handleObj;
-			jQuery( types.delegateTarget ).off(
-				handleObj.namespace ?
-					handleObj.origType + "." + handleObj.namespace :
-					handleObj.origType,
-				handleObj.selector,
-				handleObj.handler
-			);
-			return this;
-		}
-		if ( typeof types === "object" ) {
-
-			// ( types-object [, selector] )
-			for ( type in types ) {
-				this.off( type, selector, types[ type ] );
-			}
-			return this;
-		}
-		if ( selector === false || typeof selector === "function" ) {
-
-			// ( types [, fn] )
-			fn = selector;
-			selector = undefined;
-		}
-		if ( fn === false ) {
-			fn = returnFalse;
-		}
-		return this.each( function() {
-			jQuery.event.remove( this, types, fn, selector );
-		} );
-	}
-} );
-
-
-var
-
-	// Support: IE <=10 - 11, Edge 12 - 13 only
-	// In IE/Edge using regex groups here causes severe slowdowns.
-	// See https://connect.microsoft.com/IE/feedback/details/1736512/
-	rnoInnerhtml = /<script|<style|<link/i,
-
-	// checked="checked" or checked
-	rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i,
-	rcleanScript = /^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;
-
-// Prefer a tbody over its parent table for containing new rows
-function manipulationTarget( elem, content ) {
-	if ( nodeName( elem, "table" ) &&
-		nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) {
-
-		return jQuery( elem ).children( "tbody" )[ 0 ] || elem;
-	}
-
-	return elem;
-}
-
-// Replace/restore the type attribute of script elements for safe DOM manipulation
-function disableScript( elem ) {
-	elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type;
-	return elem;
-}
-function restoreScript( elem ) {
-	if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) {
-		elem.type = elem.type.slice( 5 );
-	} else {
-		elem.removeAttribute( "type" );
-	}
-
-	return elem;
-}
-
-function cloneCopyEvent( src, dest ) {
-	var i, l, type, pdataOld, udataOld, udataCur, events;
-
-	if ( dest.nodeType !== 1 ) {
-		return;
-	}
-
-	// 1. Copy private data: events, handlers, etc.
-	if ( dataPriv.hasData( src ) ) {
-		pdataOld = dataPriv.get( src );
-		events = pdataOld.events;
-
-		if ( events ) {
-			dataPriv.remove( dest, "handle events" );
-
-			for ( type in events ) {
-				for ( i = 0, l = events[ type ].length; i < l; i++ ) {
-					jQuery.event.add( dest, type, events[ type ][ i ] );
-				}
-			}
-		}
-	}
-
-	// 2. Copy user data
-	if ( dataUser.hasData( src ) ) {
-		udataOld = dataUser.access( src );
-		udataCur = jQuery.extend( {}, udataOld );
-
-		dataUser.set( dest, udataCur );
-	}
-}
-
-// Fix IE bugs, see support tests
-function fixInput( src, dest ) {
-	var nodeName = dest.nodeName.toLowerCase();
-
-	// Fails to persist the checked state of a cloned checkbox or radio button.
-	if ( nodeName === "input" && rcheckableType.test( src.type ) ) {
-		dest.checked = src.checked;
-
-	// Fails to return the selected option to the default selected state when cloning options
-	} else if ( nodeName === "input" || nodeName === "textarea" ) {
-		dest.defaultValue = src.defaultValue;
-	}
-}
-
-function domManip( collection, args, callback, ignored ) {
-
-	// Flatten any nested arrays
-	args = flat( args );
-
-	var fragment, first, scripts, hasScripts, node, doc,
-		i = 0,
-		l = collection.length,
-		iNoClone = l - 1,
-		value = args[ 0 ],
-		valueIsFunction = isFunction( value );
-
-	// We can't cloneNode fragments that contain checked, in WebKit
-	if ( valueIsFunction ||
-			( l > 1 && typeof value === "string" &&
-				!support.checkClone && rchecked.test( value ) ) ) {
-		return collection.each( function( index ) {
-			var self = collection.eq( index );
-			if ( valueIsFunction ) {
-				args[ 0 ] = value.call( this, index, self.html() );
-			}
-			domManip( self, args, callback, ignored );
-		} );
-	}
-
-	if ( l ) {
-		fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored );
-		first = fragment.firstChild;
-
-		if ( fragment.childNodes.length === 1 ) {
-			fragment = first;
-		}
-
-		// Require either new content or an interest in ignored elements to invoke the callback
-		if ( first || ignored ) {
-			scripts = jQuery.map( getAll( fragment, "script" ), disableScript );
-			hasScripts = scripts.length;
-
-			// Use the original fragment for the last item
-			// instead of the first because it can end up
-			// being emptied incorrectly in certain situations (#8070).
-			for ( ; i < l; i++ ) {
-				node = fragment;
-
-				if ( i !== iNoClone ) {
-					node = jQuery.clone( node, true, true );
-
-					// Keep references to cloned scripts for later restoration
-					if ( hasScripts ) {
-
-						// Support: Android <=4.0 only, PhantomJS 1 only
-						// push.apply(_, arraylike) throws on ancient WebKit
-						jQuery.merge( scripts, getAll( node, "script" ) );
-					}
-				}
-
-				callback.call( collection[ i ], node, i );
-			}
-
-			if ( hasScripts ) {
-				doc = scripts[ scripts.length - 1 ].ownerDocument;
-
-				// Reenable scripts
-				jQuery.map( scripts, restoreScript );
-
-				// Evaluate executable scripts on first document insertion
-				for ( i = 0; i < hasScripts; i++ ) {
-					node = scripts[ i ];
-					if ( rscriptType.test( node.type || "" ) &&
-						!dataPriv.access( node, "globalEval" ) &&
-						jQuery.contains( doc, node ) ) {
-
-						if ( node.src && ( node.type || "" ).toLowerCase()  !== "module" ) {
-
-							// Optional AJAX dependency, but won't run scripts if not present
-							if ( jQuery._evalUrl && !node.noModule ) {
-								jQuery._evalUrl( node.src, {
-									nonce: node.nonce || node.getAttribute( "nonce" )
-								}, doc );
-							}
-						} else {
-							DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc );
-						}
-					}
-				}
-			}
-		}
-	}
-
-	return collection;
-}
-
-function remove( elem, selector, keepData ) {
-	var node,
-		nodes = selector ? jQuery.filter( selector, elem ) : elem,
-		i = 0;
-
-	for ( ; ( node = nodes[ i ] ) != null; i++ ) {
-		if ( !keepData && node.nodeType === 1 ) {
-			jQuery.cleanData( getAll( node ) );
-		}
-
-		if ( node.parentNode ) {
-			if ( keepData && isAttached( node ) ) {
-				setGlobalEval( getAll( node, "script" ) );
-			}
-			node.parentNode.removeChild( node );
-		}
-	}
-
-	return elem;
-}
-
-jQuery.extend( {
-	htmlPrefilter: function( html ) {
-		return html;
-	},
-
-	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
-		var i, l, srcElements, destElements,
-			clone = elem.cloneNode( true ),
-			inPage = isAttached( elem );
-
-		// Fix IE cloning issues
-		if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) &&
-				!jQuery.isXMLDoc( elem ) ) {
-
-			// We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2
-			destElements = getAll( clone );
-			srcElements = getAll( elem );
-
-			for ( i = 0, l = srcElements.length; i < l; i++ ) {
-				fixInput( srcElements[ i ], destElements[ i ] );
-			}
-		}
-
-		// Copy the events from the original to the clone
-		if ( dataAndEvents ) {
-			if ( deepDataAndEvents ) {
-				srcElements = srcElements || getAll( elem );
-				destElements = destElements || getAll( clone );
-
-				for ( i = 0, l = srcElements.length; i < l; i++ ) {
-					cloneCopyEvent( srcElements[ i ], destElements[ i ] );
-				}
-			} else {
-				cloneCopyEvent( elem, clone );
-			}
-		}
-
-		// Preserve script evaluation history
-		destElements = getAll( clone, "script" );
-		if ( destElements.length > 0 ) {
-			setGlobalEval( destElements, !inPage && getAll( elem, "script" ) );
-		}
-
-		// Return the cloned set
-		return clone;
-	},
-
-	cleanData: function( elems ) {
-		var data, elem, type,
-			special = jQuery.event.special,
-			i = 0;
-
-		for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) {
-			if ( acceptData( elem ) ) {
-				if ( ( data = elem[ dataPriv.expando ] ) ) {
-					if ( data.events ) {
-						for ( type in data.events ) {
-							if ( special[ type ] ) {
-								jQuery.event.remove( elem, type );
-
-							// This is a shortcut to avoid jQuery.event.remove's overhead
-							} else {
-								jQuery.removeEvent( elem, type, data.handle );
-							}
-						}
-					}
-
-					// Support: Chrome <=35 - 45+
-					// Assign undefined instead of using delete, see Data#remove
-					elem[ dataPriv.expando ] = undefined;
-				}
-				if ( elem[ dataUser.expando ] ) {
-
-					// Support: Chrome <=35 - 45+
-					// Assign undefined instead of using delete, see Data#remove
-					elem[ dataUser.expando ] = undefined;
-				}
-			}
-		}
-	}
-} );
-
-jQuery.fn.extend( {
-	detach: function( selector ) {
-		return remove( this, selector, true );
-	},
-
-	remove: function( selector ) {
-		return remove( this, selector );
-	},
-
-	text: function( value ) {
-		return access( this, function( value ) {
-			return value === undefined ?
-				jQuery.text( this ) :
-				this.empty().each( function() {
-					if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-						this.textContent = value;
-					}
-				} );
-		}, null, value, arguments.length );
-	},
-
-	append: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-				var target = manipulationTarget( this, elem );
-				target.appendChild( elem );
-			}
-		} );
-	},
-
-	prepend: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-				var target = manipulationTarget( this, elem );
-				target.insertBefore( elem, target.firstChild );
-			}
-		} );
-	},
-
-	before: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.parentNode ) {
-				this.parentNode.insertBefore( elem, this );
-			}
-		} );
-	},
-
-	after: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.parentNode ) {
-				this.parentNode.insertBefore( elem, this.nextSibling );
-			}
-		} );
-	},
-
-	empty: function() {
-		var elem,
-			i = 0;
-
-		for ( ; ( elem = this[ i ] ) != null; i++ ) {
-			if ( elem.nodeType === 1 ) {
-
-				// Prevent memory leaks
-				jQuery.cleanData( getAll( elem, false ) );
-
-				// Remove any remaining nodes
-				elem.textContent = "";
-			}
-		}
-
-		return this;
-	},
-
-	clone: function( dataAndEvents, deepDataAndEvents ) {
-		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
-		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
-
-		return this.map( function() {
-			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
-		} );
-	},
-
-	html: function( value ) {
-		return access( this, function( value ) {
-			var elem = this[ 0 ] || {},
-				i = 0,
-				l = this.length;
-
-			if ( value === undefined && elem.nodeType === 1 ) {
-				return elem.innerHTML;
-			}
-
-			// See if we can take a shortcut and just use innerHTML
-			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
-				!wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) {
-
-				value = jQuery.htmlPrefilter( value );
-
-				try {
-					for ( ; i < l; i++ ) {
-						elem = this[ i ] || {};
-
-						// Remove element nodes and prevent memory leaks
-						if ( elem.nodeType === 1 ) {
-							jQuery.cleanData( getAll( elem, false ) );
-							elem.innerHTML = value;
-						}
-					}
-
-					elem = 0;
-
-				// If using innerHTML throws an exception, use the fallback method
-				} catch ( e ) {}
-			}
-
-			if ( elem ) {
-				this.empty().append( value );
-			}
-		}, null, value, arguments.length );
-	},
-
-	replaceWith: function() {
-		var ignored = [];
-
-		// Make the changes, replacing each non-ignored context element with the new content
-		return domManip( this, arguments, function( elem ) {
-			var parent = this.parentNode;
-
-			if ( jQuery.inArray( this, ignored ) < 0 ) {
-				jQuery.cleanData( getAll( this ) );
-				if ( parent ) {
-					parent.replaceChild( elem, this );
-				}
-			}
-
-		// Force callback invocation
-		}, ignored );
-	}
-} );
-
-jQuery.each( {
-	appendTo: "append",
-	prependTo: "prepend",
-	insertBefore: "before",
-	insertAfter: "after",
-	replaceAll: "replaceWith"
-}, function( name, original ) {
-	jQuery.fn[ name ] = function( selector ) {
-		var elems,
-			ret = [],
-			insert = jQuery( selector ),
-			last = insert.length - 1,
-			i = 0;
-
-		for ( ; i <= last; i++ ) {
-			elems = i === last ? this : this.clone( true );
-			jQuery( insert[ i ] )[ original ]( elems );
-
-			// Support: Android <=4.0 only, PhantomJS 1 only
-			// .get() because push.apply(_, arraylike) throws on ancient WebKit
-			push.apply( ret, elems.get() );
-		}
-
-		return this.pushStack( ret );
-	};
-} );
-var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" );
-
-var getStyles = function( elem ) {
-
-		// Support: IE <=11 only, Firefox <=30 (#15098, #14150)
-		// IE throws on elements created in popups
-		// FF meanwhile throws on frame elements through "defaultView.getComputedStyle"
-		var view = elem.ownerDocument.defaultView;
-
-		if ( !view || !view.opener ) {
-			view = window;
-		}
-
-		return view.getComputedStyle( elem );
-	};
-
-var swap = function( elem, options, callback ) {
-	var ret, name,
-		old = {};
-
-	// Remember the old values, and insert the new ones
-	for ( name in options ) {
-		old[ name ] = elem.style[ name ];
-		elem.style[ name ] = options[ name ];
-	}
-
-	ret = callback.call( elem );
-
-	// Revert the old values
-	for ( name in options ) {
-		elem.style[ name ] = old[ name ];
-	}
-
-	return ret;
-};
-
-
-var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" );
-
-
-
-( function() {
-
-	// Executing both pixelPosition & boxSizingReliable tests require only one layout
-	// so they're executed at the same time to save the second computation.
-	function computeStyleTests() {
-
-		// This is a singleton, we need to execute it only once
-		if ( !div ) {
-			return;
-		}
-
-		container.style.cssText = "position:absolute;left:-11111px;width:60px;" +
-			"margin-top:1px;padding:0;border:0";
-		div.style.cssText =
-			"position:relative;display:block;box-sizing:border-box;overflow:scroll;" +
-			"margin:auto;border:1px;padding:1px;" +
-			"width:60%;top:1%";
-		documentElement.appendChild( container ).appendChild( div );
-
-		var divStyle = window.getComputedStyle( div );
-		pixelPositionVal = divStyle.top !== "1%";
-
-		// Support: Android 4.0 - 4.3 only, Firefox <=3 - 44
-		reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12;
-
-		// Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3
-		// Some styles come back with percentage values, even though they shouldn't
-		div.style.right = "60%";
-		pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36;
-
-		// Support: IE 9 - 11 only
-		// Detect misreporting of content dimensions for box-sizing:border-box elements
-		boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36;
-
-		// Support: IE 9 only
-		// Detect overflow:scroll screwiness (gh-3699)
-		// Support: Chrome <=64
-		// Don't get tricked when zoom affects offsetWidth (gh-4029)
-		div.style.position = "absolute";
-		scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12;
-
-		documentElement.removeChild( container );
-
-		// Nullify the div so it wouldn't be stored in the memory and
-		// it will also be a sign that checks already performed
-		div = null;
-	}
-
-	function roundPixelMeasures( measure ) {
-		return Math.round( parseFloat( measure ) );
-	}
-
-	var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal,
-		reliableTrDimensionsVal, reliableMarginLeftVal,
-		container = document.createElement( "div" ),
-		div = document.createElement( "div" );
-
-	// Finish early in limited (non-browser) environments
-	if ( !div.style ) {
-		return;
-	}
-
-	// Support: IE <=9 - 11 only
-	// Style of cloned element affects source element cloned (#8908)
-	div.style.backgroundClip = "content-box";
-	div.cloneNode( true ).style.backgroundClip = "";
-	support.clearCloneStyle = div.style.backgroundClip === "content-box";
-
-	jQuery.extend( support, {
-		boxSizingReliable: function() {
-			computeStyleTests();
-			return boxSizingReliableVal;
-		},
-		pixelBoxStyles: function() {
-			computeStyleTests();
-			return pixelBoxStylesVal;
-		},
-		pixelPosition: function() {
-			computeStyleTests();
-			return pixelPositionVal;
-		},
-		reliableMarginLeft: function() {
-			computeStyleTests();
-			return reliableMarginLeftVal;
-		},
-		scrollboxSize: function() {
-			computeStyleTests();
-			return scrollboxSizeVal;
-		},
-
-		// Support: IE 9 - 11+, Edge 15 - 18+
-		// IE/Edge misreport `getComputedStyle` of table rows with width/height
-		// set in CSS while `offset*` properties report correct values.
-		// Behavior in IE 9 is more subtle than in newer versions & it passes
-		// some versions of this test; make sure not to make it pass there!
-		//
-		// Support: Firefox 70+
-		// Only Firefox includes border widths
-		// in computed dimensions. (gh-4529)
-		reliableTrDimensions: function() {
-			var table, tr, trChild, trStyle;
-			if ( reliableTrDimensionsVal == null ) {
-				table = document.createElement( "table" );
-				tr = document.createElement( "tr" );
-				trChild = document.createElement( "div" );
-
-				table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate";
-				tr.style.cssText = "border:1px solid";
-
-				// Support: Chrome 86+
-				// Height set through cssText does not get applied.
-				// Computed height then comes back as 0.
-				tr.style.height = "1px";
-				trChild.style.height = "9px";
-
-				// Support: Android 8 Chrome 86+
-				// In our bodyBackground.html iframe,
-				// display for all div elements is set to "inline",
-				// which causes a problem only in Android 8 Chrome 86.
-				// Ensuring the div is display: block
-				// gets around this issue.
-				trChild.style.display = "block";
-
-				documentElement
-					.appendChild( table )
-					.appendChild( tr )
-					.appendChild( trChild );
-
-				trStyle = window.getComputedStyle( tr );
-				reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) +
-					parseInt( trStyle.borderTopWidth, 10 ) +
-					parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight;
-
-				documentElement.removeChild( table );
-			}
-			return reliableTrDimensionsVal;
-		}
-	} );
-} )();
-
-
-function curCSS( elem, name, computed ) {
-	var width, minWidth, maxWidth, ret,
-
-		// Support: Firefox 51+
-		// Retrieving style before computed somehow
-		// fixes an issue with getting wrong values
-		// on detached elements
-		style = elem.style;
-
-	computed = computed || getStyles( elem );
-
-	// getPropertyValue is needed for:
-	//   .css('filter') (IE 9 only, #12537)
-	//   .css('--customProperty) (#3144)
-	if ( computed ) {
-		ret = computed.getPropertyValue( name ) || computed[ name ];
-
-		if ( ret === "" && !isAttached( elem ) ) {
-			ret = jQuery.style( elem, name );
-		}
-
-		// A tribute to the "awesome hack by Dean Edwards"
-		// Android Browser returns percentage for some values,
-		// but width seems to be reliably pixels.
-		// This is against the CSSOM draft spec:
-		// https://drafts.csswg.org/cssom/#resolved-values
-		if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) {
-
-			// Remember the original values
-			width = style.width;
-			minWidth = style.minWidth;
-			maxWidth = style.maxWidth;
-
-			// Put in the new values to get a computed value out
-			style.minWidth = style.maxWidth = style.width = ret;
-			ret = computed.width;
-
-			// Revert the changed values
-			style.width = width;
-			style.minWidth = minWidth;
-			style.maxWidth = maxWidth;
-		}
-	}
-
-	return ret !== undefined ?
-
-		// Support: IE <=9 - 11 only
-		// IE returns zIndex value as an integer.
-		ret + "" :
-		ret;
-}
-
-
-function addGetHookIf( conditionFn, hookFn ) {
-
-	// Define the hook, we'll check on the first run if it's really needed.
-	return {
-		get: function() {
-			if ( conditionFn() ) {
-
-				// Hook not needed (or it's not possible to use it due
-				// to missing dependency), remove it.
-				delete this.get;
-				return;
-			}
-
-			// Hook needed; redefine it so that the support test is not executed again.
-			return ( this.get = hookFn ).apply( this, arguments );
-		}
-	};
-}
-
-
-var cssPrefixes = [ "Webkit", "Moz", "ms" ],
-	emptyStyle = document.createElement( "div" ).style,
-	vendorProps = {};
-
-// Return a vendor-prefixed property or undefined
-function vendorPropName( name ) {
-
-	// Check for vendor prefixed names
-	var capName = name[ 0 ].toUpperCase() + name.slice( 1 ),
-		i = cssPrefixes.length;
-
-	while ( i-- ) {
-		name = cssPrefixes[ i ] + capName;
-		if ( name in emptyStyle ) {
-			return name;
-		}
-	}
-}
-
-// Return a potentially-mapped jQuery.cssProps or vendor prefixed property
-function finalPropName( name ) {
-	var final = jQuery.cssProps[ name ] || vendorProps[ name ];
-
-	if ( final ) {
-		return final;
-	}
-	if ( name in emptyStyle ) {
-		return name;
-	}
-	return vendorProps[ name ] = vendorPropName( name ) || name;
-}
-
-
-var
-
-	// Swappable if display is none or starts with table
-	// except "table", "table-cell", or "table-caption"
-	// See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display
-	rdisplayswap = /^(none|table(?!-c[ea]).+)/,
-	rcustomProp = /^--/,
-	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
-	cssNormalTransform = {
-		letterSpacing: "0",
-		fontWeight: "400"
-	};
-
-function setPositiveNumber( _elem, value, subtract ) {
-
-	// Any relative (+/-) values have already been
-	// normalized at this point
-	var matches = rcssNum.exec( value );
-	return matches ?
-
-		// Guard against undefined "subtract", e.g., when used as in cssHooks
-		Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) :
-		value;
-}
-
-function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) {
-	var i = dimension === "width" ? 1 : 0,
-		extra = 0,
-		delta = 0;
-
-	// Adjustment may not be necessary
-	if ( box === ( isBorderBox ? "border" : "content" ) ) {
-		return 0;
-	}
-
-	for ( ; i < 4; i += 2 ) {
-
-		// Both box models exclude margin
-		if ( box === "margin" ) {
-			delta += jQuery.css( elem, box + cssExpand[ i ], true, styles );
-		}
-
-		// If we get here with a content-box, we're seeking "padding" or "border" or "margin"
-		if ( !isBorderBox ) {
-
-			// Add padding
-			delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
-
-			// For "border" or "margin", add border
-			if ( box !== "padding" ) {
-				delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-
-			// But still keep track of it otherwise
-			} else {
-				extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-			}
-
-		// If we get here with a border-box (content + padding + border), we're seeking "content" or
-		// "padding" or "margin"
-		} else {
-
-			// For "content", subtract padding
-			if ( box === "content" ) {
-				delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
-			}
-
-			// For "content" or "padding", subtract border
-			if ( box !== "margin" ) {
-				delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-			}
-		}
-	}
-
-	// Account for positive content-box scroll gutter when requested by providing computedVal
-	if ( !isBorderBox && computedVal >= 0 ) {
-
-		// offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border
-		// Assuming integer scroll gutter, subtract the rest and round down
-		delta += Math.max( 0, Math.ceil(
-			elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
-			computedVal -
-			delta -
-			extra -
-			0.5
-
-		// If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter
-		// Use an explicit zero to avoid NaN (gh-3964)
-		) ) || 0;
-	}
-
-	return delta;
-}
-
-function getWidthOrHeight( elem, dimension, extra ) {
-
-	// Start with computed style
-	var styles = getStyles( elem ),
-
-		// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322).
-		// Fake content-box until we know it's needed to know the true value.
-		boxSizingNeeded = !support.boxSizingReliable() || extra,
-		isBorderBox = boxSizingNeeded &&
-			jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
-		valueIsBorderBox = isBorderBox,
-
-		val = curCSS( elem, dimension, styles ),
-		offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 );
-
-	// Support: Firefox <=54
-	// Return a confounding non-pixel value or feign ignorance, as appropriate.
-	if ( rnumnonpx.test( val ) ) {
-		if ( !extra ) {
-			return val;
-		}
-		val = "auto";
-	}
-
-
-	// Support: IE 9 - 11 only
-	// Use offsetWidth/offsetHeight for when box sizing is unreliable.
-	// In those cases, the computed value can be trusted to be border-box.
-	if ( ( !support.boxSizingReliable() && isBorderBox ||
-
-		// Support: IE 10 - 11+, Edge 15 - 18+
-		// IE/Edge misreport `getComputedStyle` of table rows with width/height
-		// set in CSS while `offset*` properties report correct values.
-		// Interestingly, in some cases IE 9 doesn't suffer from this issue.
-		!support.reliableTrDimensions() && nodeName( elem, "tr" ) ||
-
-		// Fall back to offsetWidth/offsetHeight when value is "auto"
-		// This happens for inline elements with no explicit setting (gh-3571)
-		val === "auto" ||
-
-		// Support: Android <=4.1 - 4.3 only
-		// Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602)
-		!parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) &&
-
-		// Make sure the element is visible & connected
-		elem.getClientRects().length ) {
-
-		isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box";
-
-		// Where available, offsetWidth/offsetHeight approximate border box dimensions.
-		// Where not available (e.g., SVG), assume unreliable box-sizing and interpret the
-		// retrieved value as a content box dimension.
-		valueIsBorderBox = offsetProp in elem;
-		if ( valueIsBorderBox ) {
-			val = elem[ offsetProp ];
-		}
-	}
-
-	// Normalize "" and auto
-	val = parseFloat( val ) || 0;
-
-	// Adjust for the element's box model
-	return ( val +
-		boxModelAdjustment(
-			elem,
-			dimension,
-			extra || ( isBorderBox ? "border" : "content" ),
-			valueIsBorderBox,
-			styles,
-
-			// Provide the current computed size to request scroll gutter calculation (gh-3589)
-			val
-		)
-	) + "px";
-}
-
-jQuery.extend( {
-
-	// Add in style property hooks for overriding the default
-	// behavior of getting and setting a style property
-	cssHooks: {
-		opacity: {
-			get: function( elem, computed ) {
-				if ( computed ) {
-
-					// We should always get a number back from opacity
-					var ret = curCSS( elem, "opacity" );
-					return ret === "" ? "1" : ret;
-				}
-			}
-		}
-	},
-
-	// Don't automatically add "px" to these possibly-unitless properties
-	cssNumber: {
-		"animationIterationCount": true,
-		"columnCount": true,
-		"fillOpacity": true,
-		"flexGrow": true,
-		"flexShrink": true,
-		"fontWeight": true,
-		"gridArea": true,
-		"gridColumn": true,
-		"gridColumnEnd": true,
-		"gridColumnStart": true,
-		"gridRow": true,
-		"gridRowEnd": true,
-		"gridRowStart": true,
-		"lineHeight": true,
-		"opacity": true,
-		"order": true,
-		"orphans": true,
-		"widows": true,
-		"zIndex": true,
-		"zoom": true
-	},
-
-	// Add in properties whose names you wish to fix before
-	// setting or getting the value
-	cssProps: {},
-
-	// Get and set the style property on a DOM Node
-	style: function( elem, name, value, extra ) {
-
-		// Don't set styles on text and comment nodes
-		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
-			return;
-		}
-
-		// Make sure that we're working with the right name
-		var ret, type, hooks,
-			origName = camelCase( name ),
-			isCustomProp = rcustomProp.test( name ),
-			style = elem.style;
-
-		// Make sure that we're working with the right name. We don't
-		// want to query the value if it is a CSS custom property
-		// since they are user-defined.
-		if ( !isCustomProp ) {
-			name = finalPropName( origName );
-		}
-
-		// Gets hook for the prefixed version, then unprefixed version
-		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
-
-		// Check if we're setting a value
-		if ( value !== undefined ) {
-			type = typeof value;
-
-			// Convert "+=" or "-=" to relative numbers (#7345)
-			if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) {
-				value = adjustCSS( elem, name, ret );
-
-				// Fixes bug #9237
-				type = "number";
-			}
-
-			// Make sure that null and NaN values aren't set (#7116)
-			if ( value == null || value !== value ) {
-				return;
-			}
-
-			// If a number was passed in, add the unit (except for certain CSS properties)
-			// The isCustomProp check can be removed in jQuery 4.0 when we only auto-append
-			// "px" to a few hardcoded values.
-			if ( type === "number" && !isCustomProp ) {
-				value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" );
-			}
-
-			// background-* props affect original clone's values
-			if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) {
-				style[ name ] = "inherit";
-			}
-
-			// If a hook was provided, use that value, otherwise just set the specified value
-			if ( !hooks || !( "set" in hooks ) ||
-				( value = hooks.set( elem, value, extra ) ) !== undefined ) {
-
-				if ( isCustomProp ) {
-					style.setProperty( name, value );
-				} else {
-					style[ name ] = value;
-				}
-			}
-
-		} else {
-
-			// If a hook was provided get the non-computed value from there
-			if ( hooks && "get" in hooks &&
-				( ret = hooks.get( elem, false, extra ) ) !== undefined ) {
-
-				return ret;
-			}
-
-			// Otherwise just get the value from the style object
-			return style[ name ];
-		}
-	},
-
-	css: function( elem, name, extra, styles ) {
-		var val, num, hooks,
-			origName = camelCase( name ),
-			isCustomProp = rcustomProp.test( name );
-
-		// Make sure that we're working with the right name. We don't
-		// want to modify the value if it is a CSS custom property
-		// since they are user-defined.
-		if ( !isCustomProp ) {
-			name = finalPropName( origName );
-		}
-
-		// Try prefixed name followed by the unprefixed name
-		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
-
-		// If a hook was provided get the computed value from there
-		if ( hooks && "get" in hooks ) {
-			val = hooks.get( elem, true, extra );
-		}
-
-		// Otherwise, if a way to get the computed value exists, use that
-		if ( val === undefined ) {
-			val = curCSS( elem, name, styles );
-		}
-
-		// Convert "normal" to computed value
-		if ( val === "normal" && name in cssNormalTransform ) {
-			val = cssNormalTransform[ name ];
-		}
-
-		// Make numeric if forced or a qualifier was provided and val looks numeric
-		if ( extra === "" || extra ) {
-			num = parseFloat( val );
-			return extra === true || isFinite( num ) ? num || 0 : val;
-		}
-
-		return val;
-	}
-} );
-
-jQuery.each( [ "height", "width" ], function( _i, dimension ) {
-	jQuery.cssHooks[ dimension ] = {
-		get: function( elem, computed, extra ) {
-			if ( computed ) {
-
-				// Certain elements can have dimension info if we invisibly show them
-				// but it must have a current display style that would benefit
-				return rdisplayswap.test( jQuery.css( elem, "display" ) ) &&
-
-					// Support: Safari 8+
-					// Table columns in Safari have non-zero offsetWidth & zero
-					// getBoundingClientRect().width unless display is changed.
-					// Support: IE <=11 only
-					// Running getBoundingClientRect on a disconnected node
-					// in IE throws an error.
-					( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ?
-					swap( elem, cssShow, function() {
-						return getWidthOrHeight( elem, dimension, extra );
-					} ) :
-					getWidthOrHeight( elem, dimension, extra );
-			}
-		},
-
-		set: function( elem, value, extra ) {
-			var matches,
-				styles = getStyles( elem ),
-
-				// Only read styles.position if the test has a chance to fail
-				// to avoid forcing a reflow.
-				scrollboxSizeBuggy = !support.scrollboxSize() &&
-					styles.position === "absolute",
-
-				// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991)
-				boxSizingNeeded = scrollboxSizeBuggy || extra,
-				isBorderBox = boxSizingNeeded &&
-					jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
-				subtract = extra ?
-					boxModelAdjustment(
-						elem,
-						dimension,
-						extra,
-						isBorderBox,
-						styles
-					) :
-					0;
-
-			// Account for unreliable border-box dimensions by comparing offset* to computed and
-			// faking a content-box to get border and padding (gh-3699)
-			if ( isBorderBox && scrollboxSizeBuggy ) {
-				subtract -= Math.ceil(
-					elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
-					parseFloat( styles[ dimension ] ) -
-					boxModelAdjustment( elem, dimension, "border", false, styles ) -
-					0.5
-				);
-			}
-
-			// Convert to pixels if value adjustment is needed
-			if ( subtract && ( matches = rcssNum.exec( value ) ) &&
-				( matches[ 3 ] || "px" ) !== "px" ) {
-
-				elem.style[ dimension ] = value;
-				value = jQuery.css( elem, dimension );
-			}
-
-			return setPositiveNumber( elem, value, subtract );
-		}
-	};
-} );
-
-jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft,
-	function( elem, computed ) {
-		if ( computed ) {
-			return ( parseFloat( curCSS( elem, "marginLeft" ) ) ||
-				elem.getBoundingClientRect().left -
-					swap( elem, { marginLeft: 0 }, function() {
-						return elem.getBoundingClientRect().left;
-					} )
-			) + "px";
-		}
-	}
-);
-
-// These hooks are used by animate to expand properties
-jQuery.each( {
-	margin: "",
-	padding: "",
-	border: "Width"
-}, function( prefix, suffix ) {
-	jQuery.cssHooks[ prefix + suffix ] = {
-		expand: function( value ) {
-			var i = 0,
-				expanded = {},
-
-				// Assumes a single number if not a string
-				parts = typeof value === "string" ? value.split( " " ) : [ value ];
-
-			for ( ; i < 4; i++ ) {
-				expanded[ prefix + cssExpand[ i ] + suffix ] =
-					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
-			}
-
-			return expanded;
-		}
-	};
-
-	if ( prefix !== "margin" ) {
-		jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber;
-	}
-} );
-
-jQuery.fn.extend( {
-	css: function( name, value ) {
-		return access( this, function( elem, name, value ) {
-			var styles, len,
-				map = {},
-				i = 0;
-
-			if ( Array.isArray( name ) ) {
-				styles = getStyles( elem );
-				len = name.length;
-
-				for ( ; i < len; i++ ) {
-					map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles );
-				}
-
-				return map;
-			}
-
-			return value !== undefined ?
-				jQuery.style( elem, name, value ) :
-				jQuery.css( elem, name );
-		}, name, value, arguments.length > 1 );
-	}
-} );
-
-
-function Tween( elem, options, prop, end, easing ) {
-	return new Tween.prototype.init( elem, options, prop, end, easing );
-}
-jQuery.Tween = Tween;
-
-Tween.prototype = {
-	constructor: Tween,
-	init: function( elem, options, prop, end, easing, unit ) {
-		this.elem = elem;
-		this.prop = prop;
-		this.easing = easing || jQuery.easing._default;
-		this.options = options;
-		this.start = this.now = this.cur();
-		this.end = end;
-		this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" );
-	},
-	cur: function() {
-		var hooks = Tween.propHooks[ this.prop ];
-
-		return hooks && hooks.get ?
-			hooks.get( this ) :
-			Tween.propHooks._default.get( this );
-	},
-	run: function( percent ) {
-		var eased,
-			hooks = Tween.propHooks[ this.prop ];
-
-		if ( this.options.duration ) {
-			this.pos = eased = jQuery.easing[ this.easing ](
-				percent, this.options.duration * percent, 0, 1, this.options.duration
-			);
-		} else {
-			this.pos = eased = percent;
-		}
-		this.now = ( this.end - this.start ) * eased + this.start;
-
-		if ( this.options.step ) {
-			this.options.step.call( this.elem, this.now, this );
-		}
-
-		if ( hooks && hooks.set ) {
-			hooks.set( this );
-		} else {
-			Tween.propHooks._default.set( this );
-		}
-		return this;
-	}
-};
-
-Tween.prototype.init.prototype = Tween.prototype;
-
-Tween.propHooks = {
-	_default: {
-		get: function( tween ) {
-			var result;
-
-			// Use a property on the element directly when it is not a DOM element,
-			// or when there is no matching style property that exists.
-			if ( tween.elem.nodeType !== 1 ||
-				tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) {
-				return tween.elem[ tween.prop ];
-			}
-
-			// Passing an empty string as a 3rd parameter to .css will automatically
-			// attempt a parseFloat and fallback to a string if the parse fails.
-			// Simple values such as "10px" are parsed to Float;
-			// complex values such as "rotate(1rad)" are returned as-is.
-			result = jQuery.css( tween.elem, tween.prop, "" );
-
-			// Empty strings, null, undefined and "auto" are converted to 0.
-			return !result || result === "auto" ? 0 : result;
-		},
-		set: function( tween ) {
-
-			// Use step hook for back compat.
-			// Use cssHook if its there.
-			// Use .style if available and use plain properties where available.
-			if ( jQuery.fx.step[ tween.prop ] ) {
-				jQuery.fx.step[ tween.prop ]( tween );
-			} else if ( tween.elem.nodeType === 1 && (
-				jQuery.cssHooks[ tween.prop ] ||
-					tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) {
-				jQuery.style( tween.elem, tween.prop, tween.now + tween.unit );
-			} else {
-				tween.elem[ tween.prop ] = tween.now;
-			}
-		}
-	}
-};
-
-// Support: IE <=9 only
-// Panic based approach to setting things on disconnected nodes
-Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = {
-	set: function( tween ) {
-		if ( tween.elem.nodeType && tween.elem.parentNode ) {
-			tween.elem[ tween.prop ] = tween.now;
-		}
-	}
-};
-
-jQuery.easing = {
-	linear: function( p ) {
-		return p;
-	},
-	swing: function( p ) {
-		return 0.5 - Math.cos( p * Math.PI ) / 2;
-	},
-	_default: "swing"
-};
-
-jQuery.fx = Tween.prototype.init;
-
-// Back compat <1.8 extension point
-jQuery.fx.step = {};
-
-
-
-
-var
-	fxNow, inProgress,
-	rfxtypes = /^(?:toggle|show|hide)$/,
-	rrun = /queueHooks$/;
-
-function schedule() {
-	if ( inProgress ) {
-		if ( document.hidden === false && window.requestAnimationFrame ) {
-			window.requestAnimationFrame( schedule );
-		} else {
-			window.setTimeout( schedule, jQuery.fx.interval );
-		}
-
-		jQuery.fx.tick();
-	}
-}
-
-// Animations created synchronously will run synchronously
-function createFxNow() {
-	window.setTimeout( function() {
-		fxNow = undefined;
-	} );
-	return ( fxNow = Date.now() );
-}
-
-// Generate parameters to create a standard animation
-function genFx( type, includeWidth ) {
-	var which,
-		i = 0,
-		attrs = { height: type };
-
-	// If we include width, step value is 1 to do all cssExpand values,
-	// otherwise step value is 2 to skip over Left and Right
-	includeWidth = includeWidth ? 1 : 0;
-	for ( ; i < 4; i += 2 - includeWidth ) {
-		which = cssExpand[ i ];
-		attrs[ "margin" + which ] = attrs[ "padding" + which ] = type;
-	}
-
-	if ( includeWidth ) {
-		attrs.opacity = attrs.width = type;
-	}
-
-	return attrs;
-}
-
-function createTween( value, prop, animation ) {
-	var tween,
-		collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ),
-		index = 0,
-		length = collection.length;
-	for ( ; index < length; index++ ) {
-		if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) {
-
-			// We're done with this property
-			return tween;
-		}
-	}
-}
-
-function defaultPrefilter( elem, props, opts ) {
-	var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display,
-		isBox = "width" in props || "height" in props,
-		anim = this,
-		orig = {},
-		style = elem.style,
-		hidden = elem.nodeType && isHiddenWithinTree( elem ),
-		dataShow = dataPriv.get( elem, "fxshow" );
-
-	// Queue-skipping animations hijack the fx hooks
-	if ( !opts.queue ) {
-		hooks = jQuery._queueHooks( elem, "fx" );
-		if ( hooks.unqueued == null ) {
-			hooks.unqueued = 0;
-			oldfire = hooks.empty.fire;
-			hooks.empty.fire = function() {
-				if ( !hooks.unqueued ) {
-					oldfire();
-				}
-			};
-		}
-		hooks.unqueued++;
-
-		anim.always( function() {
-
-			// Ensure the complete handler is called before this completes
-			anim.always( function() {
-				hooks.unqueued--;
-				if ( !jQuery.queue( elem, "fx" ).length ) {
-					hooks.empty.fire();
-				}
-			} );
-		} );
-	}
-
-	// Detect show/hide animations
-	for ( prop in props ) {
-		value = props[ prop ];
-		if ( rfxtypes.test( value ) ) {
-			delete props[ prop ];
-			toggle = toggle || value === "toggle";
-			if ( value === ( hidden ? "hide" : "show" ) ) {
-
-				// Pretend to be hidden if this is a "show" and
-				// there is still data from a stopped show/hide
-				if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) {
-					hidden = true;
-
-				// Ignore all other no-op show/hide data
-				} else {
-					continue;
-				}
-			}
-			orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop );
-		}
-	}
-
-	// Bail out if this is a no-op like .hide().hide()
-	propTween = !jQuery.isEmptyObject( props );
-	if ( !propTween && jQuery.isEmptyObject( orig ) ) {
-		return;
-	}
-
-	// Restrict "overflow" and "display" styles during box animations
-	if ( isBox && elem.nodeType === 1 ) {
-
-		// Support: IE <=9 - 11, Edge 12 - 15
-		// Record all 3 overflow attributes because IE does not infer the shorthand
-		// from identically-valued overflowX and overflowY and Edge just mirrors
-		// the overflowX value there.
-		opts.overflow = [ style.overflow, style.overflowX, style.overflowY ];
-
-		// Identify a display type, preferring old show/hide data over the CSS cascade
-		restoreDisplay = dataShow && dataShow.display;
-		if ( restoreDisplay == null ) {
-			restoreDisplay = dataPriv.get( elem, "display" );
-		}
-		display = jQuery.css( elem, "display" );
-		if ( display === "none" ) {
-			if ( restoreDisplay ) {
-				display = restoreDisplay;
-			} else {
-
-				// Get nonempty value(s) by temporarily forcing visibility
-				showHide( [ elem ], true );
-				restoreDisplay = elem.style.display || restoreDisplay;
-				display = jQuery.css( elem, "display" );
-				showHide( [ elem ] );
-			}
-		}
-
-		// Animate inline elements as inline-block
-		if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) {
-			if ( jQuery.css( elem, "float" ) === "none" ) {
-
-				// Restore the original display value at the end of pure show/hide animations
-				if ( !propTween ) {
-					anim.done( function() {
-						style.display = restoreDisplay;
-					} );
-					if ( restoreDisplay == null ) {
-						display = style.display;
-						restoreDisplay = display === "none" ? "" : display;
-					}
-				}
-				style.display = "inline-block";
-			}
-		}
-	}
-
-	if ( opts.overflow ) {
-		style.overflow = "hidden";
-		anim.always( function() {
-			style.overflow = opts.overflow[ 0 ];
-			style.overflowX = opts.overflow[ 1 ];
-			style.overflowY = opts.overflow[ 2 ];
-		} );
-	}
-
-	// Implement show/hide animations
-	propTween = false;
-	for ( prop in orig ) {
-
-		// General show/hide setup for this element animation
-		if ( !propTween ) {
-			if ( dataShow ) {
-				if ( "hidden" in dataShow ) {
-					hidden = dataShow.hidden;
-				}
-			} else {
-				dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } );
-			}
-
-			// Store hidden/visible for toggle so `.stop().toggle()` "reverses"
-			if ( toggle ) {
-				dataShow.hidden = !hidden;
-			}
-
-			// Show elements before animating them
-			if ( hidden ) {
-				showHide( [ elem ], true );
-			}
-
-			/* eslint-disable no-loop-func */
-
-			anim.done( function() {
-
-				/* eslint-enable no-loop-func */
-
-				// The final step of a "hide" animation is actually hiding the element
-				if ( !hidden ) {
-					showHide( [ elem ] );
-				}
-				dataPriv.remove( elem, "fxshow" );
-				for ( prop in orig ) {
-					jQuery.style( elem, prop, orig[ prop ] );
-				}
-			} );
-		}
-
-		// Per-property setup
-		propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim );
-		if ( !( prop in dataShow ) ) {
-			dataShow[ prop ] = propTween.start;
-			if ( hidden ) {
-				propTween.end = propTween.start;
-				propTween.start = 0;
-			}
-		}
-	}
-}
-
-function propFilter( props, specialEasing ) {
-	var index, name, easing, value, hooks;
-
-	// camelCase, specialEasing and expand cssHook pass
-	for ( index in props ) {
-		name = camelCase( index );
-		easing = specialEasing[ name ];
-		value = props[ index ];
-		if ( Array.isArray( value ) ) {
-			easing = value[ 1 ];
-			value = props[ index ] = value[ 0 ];
-		}
-
-		if ( index !== name ) {
-			props[ name ] = value;
-			delete props[ index ];
-		}
-
-		hooks = jQuery.cssHooks[ name ];
-		if ( hooks && "expand" in hooks ) {
-			value = hooks.expand( value );
-			delete props[ name ];
-
-			// Not quite $.extend, this won't overwrite existing keys.
-			// Reusing 'index' because we have the correct "name"
-			for ( index in value ) {
-				if ( !( index in props ) ) {
-					props[ index ] = value[ index ];
-					specialEasing[ index ] = easing;
-				}
-			}
-		} else {
-			specialEasing[ name ] = easing;
-		}
-	}
-}
-
-function Animation( elem, properties, options ) {
-	var result,
-		stopped,
-		index = 0,
-		length = Animation.prefilters.length,
-		deferred = jQuery.Deferred().always( function() {
-
-			// Don't match elem in the :animated selector
-			delete tick.elem;
-		} ),
-		tick = function() {
-			if ( stopped ) {
-				return false;
-			}
-			var currentTime = fxNow || createFxNow(),
-				remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ),
-
-				// Support: Android 2.3 only
-				// Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497)
-				temp = remaining / animation.duration || 0,
-				percent = 1 - temp,
-				index = 0,
-				length = animation.tweens.length;
-
-			for ( ; index < length; index++ ) {
-				animation.tweens[ index ].run( percent );
-			}
-
-			deferred.notifyWith( elem, [ animation, percent, remaining ] );
-
-			// If there's more to do, yield
-			if ( percent < 1 && length ) {
-				return remaining;
-			}
-
-			// If this was an empty animation, synthesize a final progress notification
-			if ( !length ) {
-				deferred.notifyWith( elem, [ animation, 1, 0 ] );
-			}
-
-			// Resolve the animation and report its conclusion
-			deferred.resolveWith( elem, [ animation ] );
-			return false;
-		},
-		animation = deferred.promise( {
-			elem: elem,
-			props: jQuery.extend( {}, properties ),
-			opts: jQuery.extend( true, {
-				specialEasing: {},
-				easing: jQuery.easing._default
-			}, options ),
-			originalProperties: properties,
-			originalOptions: options,
-			startTime: fxNow || createFxNow(),
-			duration: options.duration,
-			tweens: [],
-			createTween: function( prop, end ) {
-				var tween = jQuery.Tween( elem, animation.opts, prop, end,
-					animation.opts.specialEasing[ prop ] || animation.opts.easing );
-				animation.tweens.push( tween );
-				return tween;
-			},
-			stop: function( gotoEnd ) {
-				var index = 0,
-
-					// If we are going to the end, we want to run all the tweens
-					// otherwise we skip this part
-					length = gotoEnd ? animation.tweens.length : 0;
-				if ( stopped ) {
-					return this;
-				}
-				stopped = true;
-				for ( ; index < length; index++ ) {
-					animation.tweens[ index ].run( 1 );
-				}
-
-				// Resolve when we played the last frame; otherwise, reject
-				if ( gotoEnd ) {
-					deferred.notifyWith( elem, [ animation, 1, 0 ] );
-					deferred.resolveWith( elem, [ animation, gotoEnd ] );
-				} else {
-					deferred.rejectWith( elem, [ animation, gotoEnd ] );
-				}
-				return this;
-			}
-		} ),
-		props = animation.props;
-
-	propFilter( props, animation.opts.specialEasing );
-
-	for ( ; index < length; index++ ) {
-		result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts );
-		if ( result ) {
-			if ( isFunction( result.stop ) ) {
-				jQuery._queueHooks( animation.elem, animation.opts.queue ).stop =
-					result.stop.bind( result );
-			}
-			return result;
-		}
-	}
-
-	jQuery.map( props, createTween, animation );
-
-	if ( isFunction( animation.opts.start ) ) {
-		animation.opts.start.call( elem, animation );
-	}
-
-	// Attach callbacks from options
-	animation
-		.progress( animation.opts.progress )
-		.done( animation.opts.done, animation.opts.complete )
-		.fail( animation.opts.fail )
-		.always( animation.opts.always );
-
-	jQuery.fx.timer(
-		jQuery.extend( tick, {
-			elem: elem,
-			anim: animation,
-			queue: animation.opts.queue
-		} )
-	);
-
-	return animation;
-}
-
-jQuery.Animation = jQuery.extend( Animation, {
-
-	tweeners: {
-		"*": [ function( prop, value ) {
-			var tween = this.createTween( prop, value );
-			adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween );
-			return tween;
-		} ]
-	},
-
-	tweener: function( props, callback ) {
-		if ( isFunction( props ) ) {
-			callback = props;
-			props = [ "*" ];
-		} else {
-			props = props.match( rnothtmlwhite );
-		}
-
-		var prop,
-			index = 0,
-			length = props.length;
-
-		for ( ; index < length; index++ ) {
-			prop = props[ index ];
-			Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || [];
-			Animation.tweeners[ prop ].unshift( callback );
-		}
-	},
-
-	prefilters: [ defaultPrefilter ],
-
-	prefilter: function( callback, prepend ) {
-		if ( prepend ) {
-			Animation.prefilters.unshift( callback );
-		} else {
-			Animation.prefilters.push( callback );
-		}
-	}
-} );
-
-jQuery.speed = function( speed, easing, fn ) {
-	var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
-		complete: fn || !fn && easing ||
-			isFunction( speed ) && speed,
-		duration: speed,
-		easing: fn && easing || easing && !isFunction( easing ) && easing
-	};
-
-	// Go to the end state if fx are off
-	if ( jQuery.fx.off ) {
-		opt.duration = 0;
-
-	} else {
-		if ( typeof opt.duration !== "number" ) {
-			if ( opt.duration in jQuery.fx.speeds ) {
-				opt.duration = jQuery.fx.speeds[ opt.duration ];
-
-			} else {
-				opt.duration = jQuery.fx.speeds._default;
-			}
-		}
-	}
-
-	// Normalize opt.queue - true/undefined/null -> "fx"
-	if ( opt.queue == null || opt.queue === true ) {
-		opt.queue = "fx";
-	}
-
-	// Queueing
-	opt.old = opt.complete;
-
-	opt.complete = function() {
-		if ( isFunction( opt.old ) ) {
-			opt.old.call( this );
-		}
-
-		if ( opt.queue ) {
-			jQuery.dequeue( this, opt.queue );
-		}
-	};
-
-	return opt;
-};
-
-jQuery.fn.extend( {
-	fadeTo: function( speed, to, easing, callback ) {
-
-		// Show any hidden elements after setting opacity to 0
-		return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show()
-
-			// Animate to the value specified
-			.end().animate( { opacity: to }, speed, easing, callback );
-	},
-	animate: function( prop, speed, easing, callback ) {
-		var empty = jQuery.isEmptyObject( prop ),
-			optall = jQuery.speed( speed, easing, callback ),
-			doAnimation = function() {
-
-				// Operate on a copy of prop so per-property easing won't be lost
-				var anim = Animation( this, jQuery.extend( {}, prop ), optall );
-
-				// Empty animations, or finishing resolves immediately
-				if ( empty || dataPriv.get( this, "finish" ) ) {
-					anim.stop( true );
-				}
-			};
-
-		doAnimation.finish = doAnimation;
-
-		return empty || optall.queue === false ?
-			this.each( doAnimation ) :
-			this.queue( optall.queue, doAnimation );
-	},
-	stop: function( type, clearQueue, gotoEnd ) {
-		var stopQueue = function( hooks ) {
-			var stop = hooks.stop;
-			delete hooks.stop;
-			stop( gotoEnd );
-		};
-
-		if ( typeof type !== "string" ) {
-			gotoEnd = clearQueue;
-			clearQueue = type;
-			type = undefined;
-		}
-		if ( clearQueue ) {
-			this.queue( type || "fx", [] );
-		}
-
-		return this.each( function() {
-			var dequeue = true,
-				index = type != null && type + "queueHooks",
-				timers = jQuery.timers,
-				data = dataPriv.get( this );
-
-			if ( index ) {
-				if ( data[ index ] && data[ index ].stop ) {
-					stopQueue( data[ index ] );
-				}
-			} else {
-				for ( index in data ) {
-					if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) {
-						stopQueue( data[ index ] );
-					}
-				}
-			}
-
-			for ( index = timers.length; index--; ) {
-				if ( timers[ index ].elem === this &&
-					( type == null || timers[ index ].queue === type ) ) {
-
-					timers[ index ].anim.stop( gotoEnd );
-					dequeue = false;
-					timers.splice( index, 1 );
-				}
-			}
-
-			// Start the next in the queue if the last step wasn't forced.
-			// Timers currently will call their complete callbacks, which
-			// will dequeue but only if they were gotoEnd.
-			if ( dequeue || !gotoEnd ) {
-				jQuery.dequeue( this, type );
-			}
-		} );
-	},
-	finish: function( type ) {
-		if ( type !== false ) {
-			type = type || "fx";
-		}
-		return this.each( function() {
-			var index,
-				data = dataPriv.get( this ),
-				queue = data[ type + "queue" ],
-				hooks = data[ type + "queueHooks" ],
-				timers = jQuery.timers,
-				length = queue ? queue.length : 0;
-
-			// Enable finishing flag on private data
-			data.finish = true;
-
-			// Empty the queue first
-			jQuery.queue( this, type, [] );
-
-			if ( hooks && hooks.stop ) {
-				hooks.stop.call( this, true );
-			}
-
-			// Look for any active animations, and finish them
-			for ( index = timers.length; index--; ) {
-				if ( timers[ index ].elem === this && timers[ index ].queue === type ) {
-					timers[ index ].anim.stop( true );
-					timers.splice( index, 1 );
-				}
-			}
-
-			// Look for any animations in the old queue and finish them
-			for ( index = 0; index < length; index++ ) {
-				if ( queue[ index ] && queue[ index ].finish ) {
-					queue[ index ].finish.call( this );
-				}
-			}
-
-			// Turn off finishing flag
-			delete data.finish;
-		} );
-	}
-} );
-
-jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) {
-	var cssFn = jQuery.fn[ name ];
-	jQuery.fn[ name ] = function( speed, easing, callback ) {
-		return speed == null || typeof speed === "boolean" ?
-			cssFn.apply( this, arguments ) :
-			this.animate( genFx( name, true ), speed, easing, callback );
-	};
-} );
-
-// Generate shortcuts for custom animations
-jQuery.each( {
-	slideDown: genFx( "show" ),
-	slideUp: genFx( "hide" ),
-	slideToggle: genFx( "toggle" ),
-	fadeIn: { opacity: "show" },
-	fadeOut: { opacity: "hide" },
-	fadeToggle: { opacity: "toggle" }
-}, function( name, props ) {
-	jQuery.fn[ name ] = function( speed, easing, callback ) {
-		return this.animate( props, speed, easing, callback );
-	};
-} );
-
-jQuery.timers = [];
-jQuery.fx.tick = function() {
-	var timer,
-		i = 0,
-		timers = jQuery.timers;
-
-	fxNow = Date.now();
-
-	for ( ; i < timers.length; i++ ) {
-		timer = timers[ i ];
-
-		// Run the timer and safely remove it when done (allowing for external removal)
-		if ( !timer() && timers[ i ] === timer ) {
-			timers.splice( i--, 1 );
-		}
-	}
-
-	if ( !timers.length ) {
-		jQuery.fx.stop();
-	}
-	fxNow = undefined;
-};
-
-jQuery.fx.timer = function( timer ) {
-	jQuery.timers.push( timer );
-	jQuery.fx.start();
-};
-
-jQuery.fx.interval = 13;
-jQuery.fx.start = function() {
-	if ( inProgress ) {
-		return;
-	}
-
-	inProgress = true;
-	schedule();
-};
-
-jQuery.fx.stop = function() {
-	inProgress = null;
-};
-
-jQuery.fx.speeds = {
-	slow: 600,
-	fast: 200,
-
-	// Default speed
-	_default: 400
-};
-
-
-// Based off of the plugin by Clint Helfers, with permission.
-// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/
-jQuery.fn.delay = function( time, type ) {
-	time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
-	type = type || "fx";
-
-	return this.queue( type, function( next, hooks ) {
-		var timeout = window.setTimeout( next, time );
-		hooks.stop = function() {
-			window.clearTimeout( timeout );
-		};
-	} );
-};
-
-
-( function() {
-	var input = document.createElement( "input" ),
-		select = document.createElement( "select" ),
-		opt = select.appendChild( document.createElement( "option" ) );
-
-	input.type = "checkbox";
-
-	// Support: Android <=4.3 only
-	// Default value for a checkbox should be "on"
-	support.checkOn = input.value !== "";
-
-	// Support: IE <=11 only
-	// Must access selectedIndex to make default options select
-	support.optSelected = opt.selected;
-
-	// Support: IE <=11 only
-	// An input loses its value after becoming a radio
-	input = document.createElement( "input" );
-	input.value = "t";
-	input.type = "radio";
-	support.radioValue = input.value === "t";
-} )();
-
-
-var boolHook,
-	attrHandle = jQuery.expr.attrHandle;
-
-jQuery.fn.extend( {
-	attr: function( name, value ) {
-		return access( this, jQuery.attr, name, value, arguments.length > 1 );
-	},
-
-	removeAttr: function( name ) {
-		return this.each( function() {
-			jQuery.removeAttr( this, name );
-		} );
-	}
-} );
-
-jQuery.extend( {
-	attr: function( elem, name, value ) {
-		var ret, hooks,
-			nType = elem.nodeType;
-
-		// Don't get/set attributes on text, comment and attribute nodes
-		if ( nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		// Fallback to prop when attributes are not supported
-		if ( typeof elem.getAttribute === "undefined" ) {
-			return jQuery.prop( elem, name, value );
-		}
-
-		// Attribute hooks are determined by the lowercase version
-		// Grab necessary hook if one is defined
-		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
-			hooks = jQuery.attrHooks[ name.toLowerCase() ] ||
-				( jQuery.expr.match.bool.test( name ) ? boolHook : undefined );
-		}
-
-		if ( value !== undefined ) {
-			if ( value === null ) {
-				jQuery.removeAttr( elem, name );
-				return;
-			}
-
-			if ( hooks && "set" in hooks &&
-				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
-				return ret;
-			}
-
-			elem.setAttribute( name, value + "" );
-			return value;
-		}
-
-		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
-			return ret;
-		}
-
-		ret = jQuery.find.attr( elem, name );
-
-		// Non-existent attributes return null, we normalize to undefined
-		return ret == null ? undefined : ret;
-	},
-
-	attrHooks: {
-		type: {
-			set: function( elem, value ) {
-				if ( !support.radioValue && value === "radio" &&
-					nodeName( elem, "input" ) ) {
-					var val = elem.value;
-					elem.setAttribute( "type", value );
-					if ( val ) {
-						elem.value = val;
-					}
-					return value;
-				}
-			}
-		}
-	},
-
-	removeAttr: function( elem, value ) {
-		var name,
-			i = 0,
-
-			// Attribute names can contain non-HTML whitespace characters
-			// https://html.spec.whatwg.org/multipage/syntax.html#attributes-2
-			attrNames = value && value.match( rnothtmlwhite );
-
-		if ( attrNames && elem.nodeType === 1 ) {
-			while ( ( name = attrNames[ i++ ] ) ) {
-				elem.removeAttribute( name );
-			}
-		}
-	}
-} );
-
-// Hooks for boolean attributes
-boolHook = {
-	set: function( elem, value, name ) {
-		if ( value === false ) {
-
-			// Remove boolean attributes when set to false
-			jQuery.removeAttr( elem, name );
-		} else {
-			elem.setAttribute( name, name );
-		}
-		return name;
-	}
-};
-
-jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) {
-	var getter = attrHandle[ name ] || jQuery.find.attr;
-
-	attrHandle[ name ] = function( elem, name, isXML ) {
-		var ret, handle,
-			lowercaseName = name.toLowerCase();
-
-		if ( !isXML ) {
-
-			// Avoid an infinite loop by temporarily removing this function from the getter
-			handle = attrHandle[ lowercaseName ];
-			attrHandle[ lowercaseName ] = ret;
-			ret = getter( elem, name, isXML ) != null ?
-				lowercaseName :
-				null;
-			attrHandle[ lowercaseName ] = handle;
-		}
-		return ret;
-	};
-} );
-
-
-
-
-var rfocusable = /^(?:input|select|textarea|button)$/i,
-	rclickable = /^(?:a|area)$/i;
-
-jQuery.fn.extend( {
-	prop: function( name, value ) {
-		return access( this, jQuery.prop, name, value, arguments.length > 1 );
-	},
-
-	removeProp: function( name ) {
-		return this.each( function() {
-			delete this[ jQuery.propFix[ name ] || name ];
-		} );
-	}
-} );
-
-jQuery.extend( {
-	prop: function( elem, name, value ) {
-		var ret, hooks,
-			nType = elem.nodeType;
-
-		// Don't get/set properties on text, comment and attribute nodes
-		if ( nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
-
-			// Fix name and attach hooks
-			name = jQuery.propFix[ name ] || name;
-			hooks = jQuery.propHooks[ name ];
-		}
-
-		if ( value !== undefined ) {
-			if ( hooks && "set" in hooks &&
-				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
-				return ret;
-			}
-
-			return ( elem[ name ] = value );
-		}
-
-		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
-			return ret;
-		}
-
-		return elem[ name ];
-	},
-
-	propHooks: {
-		tabIndex: {
-			get: function( elem ) {
-
-				// Support: IE <=9 - 11 only
-				// elem.tabIndex doesn't always return the
-				// correct value when it hasn't been explicitly set
-				// https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
-				// Use proper attribute retrieval(#12072)
-				var tabindex = jQuery.find.attr( elem, "tabindex" );
-
-				if ( tabindex ) {
-					return parseInt( tabindex, 10 );
-				}
-
-				if (
-					rfocusable.test( elem.nodeName ) ||
-					rclickable.test( elem.nodeName ) &&
-					elem.href
-				) {
-					return 0;
-				}
-
-				return -1;
-			}
-		}
-	},
-
-	propFix: {
-		"for": "htmlFor",
-		"class": "className"
-	}
-} );
-
-// Support: IE <=11 only
-// Accessing the selectedIndex property
-// forces the browser to respect setting selected
-// on the option
-// The getter ensures a default option is selected
-// when in an optgroup
-// eslint rule "no-unused-expressions" is disabled for this code
-// since it considers such accessions noop
-if ( !support.optSelected ) {
-	jQuery.propHooks.selected = {
-		get: function( elem ) {
-
-			/* eslint no-unused-expressions: "off" */
-
-			var parent = elem.parentNode;
-			if ( parent && parent.parentNode ) {
-				parent.parentNode.selectedIndex;
-			}
-			return null;
-		},
-		set: function( elem ) {
-
-			/* eslint no-unused-expressions: "off" */
-
-			var parent = elem.parentNode;
-			if ( parent ) {
-				parent.selectedIndex;
-
-				if ( parent.parentNode ) {
-					parent.parentNode.selectedIndex;
-				}
-			}
-		}
-	};
-}
-
-jQuery.each( [
-	"tabIndex",
-	"readOnly",
-	"maxLength",
-	"cellSpacing",
-	"cellPadding",
-	"rowSpan",
-	"colSpan",
-	"useMap",
-	"frameBorder",
-	"contentEditable"
-], function() {
-	jQuery.propFix[ this.toLowerCase() ] = this;
-} );
-
-
-
-
-	// Strip and collapse whitespace according to HTML spec
-	// https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace
-	function stripAndCollapse( value ) {
-		var tokens = value.match( rnothtmlwhite ) || [];
-		return tokens.join( " " );
-	}
-
-
-function getClass( elem ) {
-	return elem.getAttribute && elem.getAttribute( "class" ) || "";
-}
-
-function classesToArray( value ) {
-	if ( Array.isArray( value ) ) {
-		return value;
-	}
-	if ( typeof value === "string" ) {
-		return value.match( rnothtmlwhite ) || [];
-	}
-	return [];
-}
-
-jQuery.fn.extend( {
-	addClass: function( value ) {
-		var classes, elem, cur, curValue, clazz, j, finalValue,
-			i = 0;
-
-		if ( isFunction( value ) ) {
-			return this.each( function( j ) {
-				jQuery( this ).addClass( value.call( this, j, getClass( this ) ) );
-			} );
-		}
-
-		classes = classesToArray( value );
-
-		if ( classes.length ) {
-			while ( ( elem = this[ i++ ] ) ) {
-				curValue = getClass( elem );
-				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
-
-				if ( cur ) {
-					j = 0;
-					while ( ( clazz = classes[ j++ ] ) ) {
-						if ( cur.indexOf( " " + clazz + " " ) < 0 ) {
-							cur += clazz + " ";
-						}
-					}
-
-					// Only assign if different to avoid unneeded rendering.
-					finalValue = stripAndCollapse( cur );
-					if ( curValue !== finalValue ) {
-						elem.setAttribute( "class", finalValue );
-					}
-				}
-			}
-		}
-
-		return this;
-	},
-
-	removeClass: function( value ) {
-		var classes, elem, cur, curValue, clazz, j, finalValue,
-			i = 0;
-
-		if ( isFunction( value ) ) {
-			return this.each( function( j ) {
-				jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) );
-			} );
-		}
-
-		if ( !arguments.length ) {
-			return this.attr( "class", "" );
-		}
-
-		classes = classesToArray( value );
-
-		if ( classes.length ) {
-			while ( ( elem = this[ i++ ] ) ) {
-				curValue = getClass( elem );
-
-				// This expression is here for better compressibility (see addClass)
-				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
-
-				if ( cur ) {
-					j = 0;
-					while ( ( clazz = classes[ j++ ] ) ) {
-
-						// Remove *all* instances
-						while ( cur.indexOf( " " + clazz + " " ) > -1 ) {
-							cur = cur.replace( " " + clazz + " ", " " );
-						}
-					}
-
-					// Only assign if different to avoid unneeded rendering.
-					finalValue = stripAndCollapse( cur );
-					if ( curValue !== finalValue ) {
-						elem.setAttribute( "class", finalValue );
-					}
-				}
-			}
-		}
-
-		return this;
-	},
-
-	toggleClass: function( value, stateVal ) {
-		var type = typeof value,
-			isValidValue = type === "string" || Array.isArray( value );
-
-		if ( typeof stateVal === "boolean" && isValidValue ) {
-			return stateVal ? this.addClass( value ) : this.removeClass( value );
-		}
-
-		if ( isFunction( value ) ) {
-			return this.each( function( i ) {
-				jQuery( this ).toggleClass(
-					value.call( this, i, getClass( this ), stateVal ),
-					stateVal
-				);
-			} );
-		}
-
-		return this.each( function() {
-			var className, i, self, classNames;
-
-			if ( isValidValue ) {
-
-				// Toggle individual class names
-				i = 0;
-				self = jQuery( this );
-				classNames = classesToArray( value );
-
-				while ( ( className = classNames[ i++ ] ) ) {
-
-					// Check each className given, space separated list
-					if ( self.hasClass( className ) ) {
-						self.removeClass( className );
-					} else {
-						self.addClass( className );
-					}
-				}
-
-			// Toggle whole class name
-			} else if ( value === undefined || type === "boolean" ) {
-				className = getClass( this );
-				if ( className ) {
-
-					// Store className if set
-					dataPriv.set( this, "__className__", className );
-				}
-
-				// If the element has a class name or if we're passed `false`,
-				// then remove the whole classname (if there was one, the above saved it).
-				// Otherwise bring back whatever was previously saved (if anything),
-				// falling back to the empty string if nothing was stored.
-				if ( this.setAttribute ) {
-					this.setAttribute( "class",
-						className || value === false ?
-							"" :
-							dataPriv.get( this, "__className__" ) || ""
-					);
-				}
-			}
-		} );
-	},
-
-	hasClass: function( selector ) {
-		var className, elem,
-			i = 0;
-
-		className = " " + selector + " ";
-		while ( ( elem = this[ i++ ] ) ) {
-			if ( elem.nodeType === 1 &&
-				( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) {
-				return true;
-			}
-		}
-
-		return false;
-	}
-} );
-
-
-
-
-var rreturn = /\r/g;
-
-jQuery.fn.extend( {
-	val: function( value ) {
-		var hooks, ret, valueIsFunction,
-			elem = this[ 0 ];
-
-		if ( !arguments.length ) {
-			if ( elem ) {
-				hooks = jQuery.valHooks[ elem.type ] ||
-					jQuery.valHooks[ elem.nodeName.toLowerCase() ];
-
-				if ( hooks &&
-					"get" in hooks &&
-					( ret = hooks.get( elem, "value" ) ) !== undefined
-				) {
-					return ret;
-				}
-
-				ret = elem.value;
-
-				// Handle most common string cases
-				if ( typeof ret === "string" ) {
-					return ret.replace( rreturn, "" );
-				}
-
-				// Handle cases where value is null/undef or number
-				return ret == null ? "" : ret;
-			}
-
-			return;
-		}
-
-		valueIsFunction = isFunction( value );
-
-		return this.each( function( i ) {
-			var val;
-
-			if ( this.nodeType !== 1 ) {
-				return;
-			}
-
-			if ( valueIsFunction ) {
-				val = value.call( this, i, jQuery( this ).val() );
-			} else {
-				val = value;
-			}
-
-			// Treat null/undefined as ""; convert numbers to string
-			if ( val == null ) {
-				val = "";
-
-			} else if ( typeof val === "number" ) {
-				val += "";
-
-			} else if ( Array.isArray( val ) ) {
-				val = jQuery.map( val, function( value ) {
-					return value == null ? "" : value + "";
-				} );
-			}
-
-			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
-
-			// If set returns undefined, fall back to normal setting
-			if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) {
-				this.value = val;
-			}
-		} );
-	}
-} );
-
-jQuery.extend( {
-	valHooks: {
-		option: {
-			get: function( elem ) {
-
-				var val = jQuery.find.attr( elem, "value" );
-				return val != null ?
-					val :
-
-					// Support: IE <=10 - 11 only
-					// option.text throws exceptions (#14686, #14858)
-					// Strip and collapse whitespace
-					// https://html.spec.whatwg.org/#strip-and-collapse-whitespace
-					stripAndCollapse( jQuery.text( elem ) );
-			}
-		},
-		select: {
-			get: function( elem ) {
-				var value, option, i,
-					options = elem.options,
-					index = elem.selectedIndex,
-					one = elem.type === "select-one",
-					values = one ? null : [],
-					max = one ? index + 1 : options.length;
-
-				if ( index < 0 ) {
-					i = max;
-
-				} else {
-					i = one ? index : 0;
-				}
-
-				// Loop through all the selected options
-				for ( ; i < max; i++ ) {
-					option = options[ i ];
-
-					// Support: IE <=9 only
-					// IE8-9 doesn't update selected after form reset (#2551)
-					if ( ( option.selected || i === index ) &&
-
-							// Don't return options that are disabled or in a disabled optgroup
-							!option.disabled &&
-							( !option.parentNode.disabled ||
-								!nodeName( option.parentNode, "optgroup" ) ) ) {
-
-						// Get the specific value for the option
-						value = jQuery( option ).val();
-
-						// We don't need an array for one selects
-						if ( one ) {
-							return value;
-						}
-
-						// Multi-Selects return an array
-						values.push( value );
-					}
-				}
-
-				return values;
-			},
-
-			set: function( elem, value ) {
-				var optionSet, option,
-					options = elem.options,
-					values = jQuery.makeArray( value ),
-					i = options.length;
-
-				while ( i-- ) {
-					option = options[ i ];
-
-					/* eslint-disable no-cond-assign */
-
-					if ( option.selected =
-						jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1
-					) {
-						optionSet = true;
-					}
-
-					/* eslint-enable no-cond-assign */
-				}
-
-				// Force browsers to behave consistently when non-matching value is set
-				if ( !optionSet ) {
-					elem.selectedIndex = -1;
-				}
-				return values;
-			}
-		}
-	}
-} );
-
-// Radios and checkboxes getter/setter
-jQuery.each( [ "radio", "checkbox" ], function() {
-	jQuery.valHooks[ this ] = {
-		set: function( elem, value ) {
-			if ( Array.isArray( value ) ) {
-				return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 );
-			}
-		}
-	};
-	if ( !support.checkOn ) {
-		jQuery.valHooks[ this ].get = function( elem ) {
-			return elem.getAttribute( "value" ) === null ? "on" : elem.value;
-		};
-	}
-} );
-
-
-
-
-// Return jQuery for attributes-only inclusion
-
-
-support.focusin = "onfocusin" in window;
-
-
-var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
-	stopPropagationCallback = function( e ) {
-		e.stopPropagation();
-	};
-
-jQuery.extend( jQuery.event, {
-
-	trigger: function( event, data, elem, onlyHandlers ) {
-
-		var i, cur, tmp, bubbleType, ontype, handle, special, lastElement,
-			eventPath = [ elem || document ],
-			type = hasOwn.call( event, "type" ) ? event.type : event,
-			namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : [];
-
-		cur = lastElement = tmp = elem = elem || document;
-
-		// Don't do events on text and comment nodes
-		if ( elem.nodeType === 3 || elem.nodeType === 8 ) {
-			return;
-		}
-
-		// focus/blur morphs to focusin/out; ensure we're not firing them right now
-		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
-			return;
-		}
-
-		if ( type.indexOf( "." ) > -1 ) {
-
-			// Namespaced trigger; create a regexp to match event type in handle()
-			namespaces = type.split( "." );
-			type = namespaces.shift();
-			namespaces.sort();
-		}
-		ontype = type.indexOf( ":" ) < 0 && "on" + type;
-
-		// Caller can pass in a jQuery.Event object, Object, or just an event type string
-		event = event[ jQuery.expando ] ?
-			event :
-			new jQuery.Event( type, typeof event === "object" && event );
-
-		// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
-		event.isTrigger = onlyHandlers ? 2 : 3;
-		event.namespace = namespaces.join( "." );
-		event.rnamespace = event.namespace ?
-			new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) :
-			null;
-
-		// Clean up the event in case it is being reused
-		event.result = undefined;
-		if ( !event.target ) {
-			event.target = elem;
-		}
-
-		// Clone any incoming data and prepend the event, creating the handler arg list
-		data = data == null ?
-			[ event ] :
-			jQuery.makeArray( data, [ event ] );
-
-		// Allow special events to draw outside the lines
-		special = jQuery.event.special[ type ] || {};
-		if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) {
-			return;
-		}
-
-		// Determine event propagation path in advance, per W3C events spec (#9951)
-		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
-		if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) {
-
-			bubbleType = special.delegateType || type;
-			if ( !rfocusMorph.test( bubbleType + type ) ) {
-				cur = cur.parentNode;
-			}
-			for ( ; cur; cur = cur.parentNode ) {
-				eventPath.push( cur );
-				tmp = cur;
-			}
-
-			// Only add window if we got to document (e.g., not plain obj or detached DOM)
-			if ( tmp === ( elem.ownerDocument || document ) ) {
-				eventPath.push( tmp.defaultView || tmp.parentWindow || window );
-			}
-		}
-
-		// Fire handlers on the event path
-		i = 0;
-		while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) {
-			lastElement = cur;
-			event.type = i > 1 ?
-				bubbleType :
-				special.bindType || type;
-
-			// jQuery handler
-			handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] &&
-				dataPriv.get( cur, "handle" );
-			if ( handle ) {
-				handle.apply( cur, data );
-			}
-
-			// Native handler
-			handle = ontype && cur[ ontype ];
-			if ( handle && handle.apply && acceptData( cur ) ) {
-				event.result = handle.apply( cur, data );
-				if ( event.result === false ) {
-					event.preventDefault();
-				}
-			}
-		}
-		event.type = type;
-
-		// If nobody prevented the default action, do it now
-		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
-
-			if ( ( !special._default ||
-				special._default.apply( eventPath.pop(), data ) === false ) &&
-				acceptData( elem ) ) {
-
-				// Call a native DOM method on the target with the same name as the event.
-				// Don't do default actions on window, that's where global variables be (#6170)
-				if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) {
-
-					// Don't re-trigger an onFOO event when we call its FOO() method
-					tmp = elem[ ontype ];
-
-					if ( tmp ) {
-						elem[ ontype ] = null;
-					}
-
-					// Prevent re-triggering of the same event, since we already bubbled it above
-					jQuery.event.triggered = type;
-
-					if ( event.isPropagationStopped() ) {
-						lastElement.addEventListener( type, stopPropagationCallback );
-					}
-
-					elem[ type ]();
-
-					if ( event.isPropagationStopped() ) {
-						lastElement.removeEventListener( type, stopPropagationCallback );
-					}
-
-					jQuery.event.triggered = undefined;
-
-					if ( tmp ) {
-						elem[ ontype ] = tmp;
-					}
-				}
-			}
-		}
-
-		return event.result;
-	},
-
-	// Piggyback on a donor event to simulate a different one
-	// Used only for `focus(in | out)` events
-	simulate: function( type, elem, event ) {
-		var e = jQuery.extend(
-			new jQuery.Event(),
-			event,
-			{
-				type: type,
-				isSimulated: true
-			}
-		);
-
-		jQuery.event.trigger( e, null, elem );
-	}
-
-} );
-
-jQuery.fn.extend( {
-
-	trigger: function( type, data ) {
-		return this.each( function() {
-			jQuery.event.trigger( type, data, this );
-		} );
-	},
-	triggerHandler: function( type, data ) {
-		var elem = this[ 0 ];
-		if ( elem ) {
-			return jQuery.event.trigger( type, data, elem, true );
-		}
-	}
-} );
-
-
-// Support: Firefox <=44
-// Firefox doesn't have focus(in | out) events
-// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787
-//
-// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1
-// focus(in | out) events fire after focus & blur events,
-// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order
-// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857
-if ( !support.focusin ) {
-	jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) {
-
-		// Attach a single capturing handler on the document while someone wants focusin/focusout
-		var handler = function( event ) {
-			jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) );
-		};
-
-		jQuery.event.special[ fix ] = {
-			setup: function() {
-
-				// Handle: regular nodes (via `this.ownerDocument`), window
-				// (via `this.document`) & document (via `this`).
-				var doc = this.ownerDocument || this.document || this,
-					attaches = dataPriv.access( doc, fix );
-
-				if ( !attaches ) {
-					doc.addEventListener( orig, handler, true );
-				}
-				dataPriv.access( doc, fix, ( attaches || 0 ) + 1 );
-			},
-			teardown: function() {
-				var doc = this.ownerDocument || this.document || this,
-					attaches = dataPriv.access( doc, fix ) - 1;
-
-				if ( !attaches ) {
-					doc.removeEventListener( orig, handler, true );
-					dataPriv.remove( doc, fix );
-
-				} else {
-					dataPriv.access( doc, fix, attaches );
-				}
-			}
-		};
-	} );
-}
-var location = window.location;
-
-var nonce = { guid: Date.now() };
-
-var rquery = ( /\?/ );
-
-
-
-// Cross-browser xml parsing
-jQuery.parseXML = function( data ) {
-	var xml, parserErrorElem;
-	if ( !data || typeof data !== "string" ) {
-		return null;
-	}
-
-	// Support: IE 9 - 11 only
-	// IE throws on parseFromString with invalid input.
-	try {
-		xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" );
-	} catch ( e ) {}
-
-	parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ];
-	if ( !xml || parserErrorElem ) {
-		jQuery.error( "Invalid XML: " + (
-			parserErrorElem ?
-				jQuery.map( parserErrorElem.childNodes, function( el ) {
-					return el.textContent;
-				} ).join( "\n" ) :
-				data
-		) );
-	}
-	return xml;
-};
-
-
-var
-	rbracket = /\[\]$/,
-	rCRLF = /\r?\n/g,
-	rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i,
-	rsubmittable = /^(?:input|select|textarea|keygen)/i;
-
-function buildParams( prefix, obj, traditional, add ) {
-	var name;
-
-	if ( Array.isArray( obj ) ) {
-
-		// Serialize array item.
-		jQuery.each( obj, function( i, v ) {
-			if ( traditional || rbracket.test( prefix ) ) {
-
-				// Treat each array item as a scalar.
-				add( prefix, v );
-
-			} else {
-
-				// Item is non-scalar (array or object), encode its numeric index.
-				buildParams(
-					prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]",
-					v,
-					traditional,
-					add
-				);
-			}
-		} );
-
-	} else if ( !traditional && toType( obj ) === "object" ) {
-
-		// Serialize object item.
-		for ( name in obj ) {
-			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
-		}
-
-	} else {
-
-		// Serialize scalar item.
-		add( prefix, obj );
-	}
-}
-
-// Serialize an array of form elements or a set of
-// key/values into a query string
-jQuery.param = function( a, traditional ) {
-	var prefix,
-		s = [],
-		add = function( key, valueOrFunction ) {
-
-			// If value is a function, invoke it and use its return value
-			var value = isFunction( valueOrFunction ) ?
-				valueOrFunction() :
-				valueOrFunction;
-
-			s[ s.length ] = encodeURIComponent( key ) + "=" +
-				encodeURIComponent( value == null ? "" : value );
-		};
-
-	if ( a == null ) {
-		return "";
-	}
-
-	// If an array was passed in, assume that it is an array of form elements.
-	if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
-
-		// Serialize the form elements
-		jQuery.each( a, function() {
-			add( this.name, this.value );
-		} );
-
-	} else {
-
-		// If traditional, encode the "old" way (the way 1.3.2 or older
-		// did it), otherwise encode params recursively.
-		for ( prefix in a ) {
-			buildParams( prefix, a[ prefix ], traditional, add );
-		}
-	}
-
-	// Return the resulting serialization
-	return s.join( "&" );
-};
-
-jQuery.fn.extend( {
-	serialize: function() {
-		return jQuery.param( this.serializeArray() );
-	},
-	serializeArray: function() {
-		return this.map( function() {
-
-			// Can add propHook for "elements" to filter or add form elements
-			var elements = jQuery.prop( this, "elements" );
-			return elements ? jQuery.makeArray( elements ) : this;
-		} ).filter( function() {
-			var type = this.type;
-
-			// Use .is( ":disabled" ) so that fieldset[disabled] works
-			return this.name && !jQuery( this ).is( ":disabled" ) &&
-				rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) &&
-				( this.checked || !rcheckableType.test( type ) );
-		} ).map( function( _i, elem ) {
-			var val = jQuery( this ).val();
-
-			if ( val == null ) {
-				return null;
-			}
-
-			if ( Array.isArray( val ) ) {
-				return jQuery.map( val, function( val ) {
-					return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
-				} );
-			}
-
-			return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
-		} ).get();
-	}
-} );
-
-
-var
-	r20 = /%20/g,
-	rhash = /#.*$/,
-	rantiCache = /([?&])_=[^&]*/,
-	rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg,
-
-	// #7653, #8125, #8152: local protocol detection
-	rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/,
-	rnoContent = /^(?:GET|HEAD)$/,
-	rprotocol = /^\/\//,
-
-	/* Prefilters
-	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
-	 * 2) These are called:
-	 *    - BEFORE asking for a transport
-	 *    - AFTER param serialization (s.data is a string if s.processData is true)
-	 * 3) key is the dataType
-	 * 4) the catchall symbol "*" can be used
-	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
-	 */
-	prefilters = {},
-
-	/* Transports bindings
-	 * 1) key is the dataType
-	 * 2) the catchall symbol "*" can be used
-	 * 3) selection will start with transport dataType and THEN go to "*" if needed
-	 */
-	transports = {},
-
-	// Avoid comment-prolog char sequence (#10098); must appease lint and evade compression
-	allTypes = "*/".concat( "*" ),
-
-	// Anchor tag for parsing the document origin
-	originAnchor = document.createElement( "a" );
-
-originAnchor.href = location.href;
-
-// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
-function addToPrefiltersOrTransports( structure ) {
-
-	// dataTypeExpression is optional and defaults to "*"
-	return function( dataTypeExpression, func ) {
-
-		if ( typeof dataTypeExpression !== "string" ) {
-			func = dataTypeExpression;
-			dataTypeExpression = "*";
-		}
-
-		var dataType,
-			i = 0,
-			dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || [];
-
-		if ( isFunction( func ) ) {
-
-			// For each dataType in the dataTypeExpression
-			while ( ( dataType = dataTypes[ i++ ] ) ) {
-
-				// Prepend if requested
-				if ( dataType[ 0 ] === "+" ) {
-					dataType = dataType.slice( 1 ) || "*";
-					( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func );
-
-				// Otherwise append
-				} else {
-					( structure[ dataType ] = structure[ dataType ] || [] ).push( func );
-				}
-			}
-		}
-	};
-}
-
-// Base inspection function for prefilters and transports
-function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) {
-
-	var inspected = {},
-		seekingTransport = ( structure === transports );
-
-	function inspect( dataType ) {
-		var selected;
-		inspected[ dataType ] = true;
-		jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) {
-			var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR );
-			if ( typeof dataTypeOrTransport === "string" &&
-				!seekingTransport && !inspected[ dataTypeOrTransport ] ) {
-
-				options.dataTypes.unshift( dataTypeOrTransport );
-				inspect( dataTypeOrTransport );
-				return false;
-			} else if ( seekingTransport ) {
-				return !( selected = dataTypeOrTransport );
-			}
-		} );
-		return selected;
-	}
-
-	return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" );
-}
-
-// A special extend for ajax options
-// that takes "flat" options (not to be deep extended)
-// Fixes #9887
-function ajaxExtend( target, src ) {
-	var key, deep,
-		flatOptions = jQuery.ajaxSettings.flatOptions || {};
-
-	for ( key in src ) {
-		if ( src[ key ] !== undefined ) {
-			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
-		}
-	}
-	if ( deep ) {
-		jQuery.extend( true, target, deep );
-	}
-
-	return target;
-}
-
-/* Handles responses to an ajax request:
- * - finds the right dataType (mediates between content-type and expected dataType)
- * - returns the corresponding response
- */
-function ajaxHandleResponses( s, jqXHR, responses ) {
-
-	var ct, type, finalDataType, firstDataType,
-		contents = s.contents,
-		dataTypes = s.dataTypes;
-
-	// Remove auto dataType and get content-type in the process
-	while ( dataTypes[ 0 ] === "*" ) {
-		dataTypes.shift();
-		if ( ct === undefined ) {
-			ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" );
-		}
-	}
-
-	// Check if we're dealing with a known content-type
-	if ( ct ) {
-		for ( type in contents ) {
-			if ( contents[ type ] && contents[ type ].test( ct ) ) {
-				dataTypes.unshift( type );
-				break;
-			}
-		}
-	}
-
-	// Check to see if we have a response for the expected dataType
-	if ( dataTypes[ 0 ] in responses ) {
-		finalDataType = dataTypes[ 0 ];
-	} else {
-
-		// Try convertible dataTypes
-		for ( type in responses ) {
-			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) {
-				finalDataType = type;
-				break;
-			}
-			if ( !firstDataType ) {
-				firstDataType = type;
-			}
-		}
-
-		// Or just use first one
-		finalDataType = finalDataType || firstDataType;
-	}
-
-	// If we found a dataType
-	// We add the dataType to the list if needed
-	// and return the corresponding response
-	if ( finalDataType ) {
-		if ( finalDataType !== dataTypes[ 0 ] ) {
-			dataTypes.unshift( finalDataType );
-		}
-		return responses[ finalDataType ];
-	}
-}
-
-/* Chain conversions given the request and the original response
- * Also sets the responseXXX fields on the jqXHR instance
- */
-function ajaxConvert( s, response, jqXHR, isSuccess ) {
-	var conv2, current, conv, tmp, prev,
-		converters = {},
-
-		// Work with a copy of dataTypes in case we need to modify it for conversion
-		dataTypes = s.dataTypes.slice();
-
-	// Create converters map with lowercased keys
-	if ( dataTypes[ 1 ] ) {
-		for ( conv in s.converters ) {
-			converters[ conv.toLowerCase() ] = s.converters[ conv ];
-		}
-	}
-
-	current = dataTypes.shift();
-
-	// Convert to each sequential dataType
-	while ( current ) {
-
-		if ( s.responseFields[ current ] ) {
-			jqXHR[ s.responseFields[ current ] ] = response;
-		}
-
-		// Apply the dataFilter if provided
-		if ( !prev && isSuccess && s.dataFilter ) {
-			response = s.dataFilter( response, s.dataType );
-		}
-
-		prev = current;
-		current = dataTypes.shift();
-
-		if ( current ) {
-
-			// There's only work to do if current dataType is non-auto
-			if ( current === "*" ) {
-
-				current = prev;
-
-			// Convert response if prev dataType is non-auto and differs from current
-			} else if ( prev !== "*" && prev !== current ) {
-
-				// Seek a direct converter
-				conv = converters[ prev + " " + current ] || converters[ "* " + current ];
-
-				// If none found, seek a pair
-				if ( !conv ) {
-					for ( conv2 in converters ) {
-
-						// If conv2 outputs current
-						tmp = conv2.split( " " );
-						if ( tmp[ 1 ] === current ) {
-
-							// If prev can be converted to accepted input
-							conv = converters[ prev + " " + tmp[ 0 ] ] ||
-								converters[ "* " + tmp[ 0 ] ];
-							if ( conv ) {
-
-								// Condense equivalence converters
-								if ( conv === true ) {
-									conv = converters[ conv2 ];
-
-								// Otherwise, insert the intermediate dataType
-								} else if ( converters[ conv2 ] !== true ) {
-									current = tmp[ 0 ];
-									dataTypes.unshift( tmp[ 1 ] );
-								}
-								break;
-							}
-						}
-					}
-				}
-
-				// Apply converter (if not an equivalence)
-				if ( conv !== true ) {
-
-					// Unless errors are allowed to bubble, catch and return them
-					if ( conv && s.throws ) {
-						response = conv( response );
-					} else {
-						try {
-							response = conv( response );
-						} catch ( e ) {
-							return {
-								state: "parsererror",
-								error: conv ? e : "No conversion from " + prev + " to " + current
-							};
-						}
-					}
-				}
-			}
-		}
-	}
-
-	return { state: "success", data: response };
-}
-
-jQuery.extend( {
-
-	// Counter for holding the number of active queries
-	active: 0,
-
-	// Last-Modified header cache for next request
-	lastModified: {},
-	etag: {},
-
-	ajaxSettings: {
-		url: location.href,
-		type: "GET",
-		isLocal: rlocalProtocol.test( location.protocol ),
-		global: true,
-		processData: true,
-		async: true,
-		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
-
-		/*
-		timeout: 0,
-		data: null,
-		dataType: null,
-		username: null,
-		password: null,
-		cache: null,
-		throws: false,
-		traditional: false,
-		headers: {},
-		*/
-
-		accepts: {
-			"*": allTypes,
-			text: "text/plain",
-			html: "text/html",
-			xml: "application/xml, text/xml",
-			json: "application/json, text/javascript"
-		},
-
-		contents: {
-			xml: /\bxml\b/,
-			html: /\bhtml/,
-			json: /\bjson\b/
-		},
-
-		responseFields: {
-			xml: "responseXML",
-			text: "responseText",
-			json: "responseJSON"
-		},
-
-		// Data converters
-		// Keys separate source (or catchall "*") and destination types with a single space
-		converters: {
-
-			// Convert anything to text
-			"* text": String,
-
-			// Text to html (true = no transformation)
-			"text html": true,
-
-			// Evaluate text as a json expression
-			"text json": JSON.parse,
-
-			// Parse text as xml
-			"text xml": jQuery.parseXML
-		},
-
-		// For options that shouldn't be deep extended:
-		// you can add your own custom options here if
-		// and when you create one that shouldn't be
-		// deep extended (see ajaxExtend)
-		flatOptions: {
-			url: true,
-			context: true
-		}
-	},
-
-	// Creates a full fledged settings object into target
-	// with both ajaxSettings and settings fields.
-	// If target is omitted, writes into ajaxSettings.
-	ajaxSetup: function( target, settings ) {
-		return settings ?
-
-			// Building a settings object
-			ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) :
-
-			// Extending ajaxSettings
-			ajaxExtend( jQuery.ajaxSettings, target );
-	},
-
-	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
-	ajaxTransport: addToPrefiltersOrTransports( transports ),
-
-	// Main method
-	ajax: function( url, options ) {
-
-		// If url is an object, simulate pre-1.5 signature
-		if ( typeof url === "object" ) {
-			options = url;
-			url = undefined;
-		}
-
-		// Force options to be an object
-		options = options || {};
-
-		var transport,
-
-			// URL without anti-cache param
-			cacheURL,
-
-			// Response headers
-			responseHeadersString,
-			responseHeaders,
-
-			// timeout handle
-			timeoutTimer,
-
-			// Url cleanup var
-			urlAnchor,
-
-			// Request state (becomes false upon send and true upon completion)
-			completed,
-
-			// To know if global events are to be dispatched
-			fireGlobals,
-
-			// Loop variable
-			i,
-
-			// uncached part of the url
-			uncached,
-
-			// Create the final options object
-			s = jQuery.ajaxSetup( {}, options ),
-
-			// Callbacks context
-			callbackContext = s.context || s,
-
-			// Context for global events is callbackContext if it is a DOM node or jQuery collection
-			globalEventContext = s.context &&
-				( callbackContext.nodeType || callbackContext.jquery ) ?
-				jQuery( callbackContext ) :
-				jQuery.event,
-
-			// Deferreds
-			deferred = jQuery.Deferred(),
-			completeDeferred = jQuery.Callbacks( "once memory" ),
-
-			// Status-dependent callbacks
-			statusCode = s.statusCode || {},
-
-			// Headers (they are sent all at once)
-			requestHeaders = {},
-			requestHeadersNames = {},
-
-			// Default abort message
-			strAbort = "canceled",
-
-			// Fake xhr
-			jqXHR = {
-				readyState: 0,
-
-				// Builds headers hashtable if needed
-				getResponseHeader: function( key ) {
-					var match;
-					if ( completed ) {
-						if ( !responseHeaders ) {
-							responseHeaders = {};
-							while ( ( match = rheaders.exec( responseHeadersString ) ) ) {
-								responseHeaders[ match[ 1 ].toLowerCase() + " " ] =
-									( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] )
-										.concat( match[ 2 ] );
-							}
-						}
-						match = responseHeaders[ key.toLowerCase() + " " ];
-					}
-					return match == null ? null : match.join( ", " );
-				},
-
-				// Raw string
-				getAllResponseHeaders: function() {
-					return completed ? responseHeadersString : null;
-				},
-
-				// Caches the header
-				setRequestHeader: function( name, value ) {
-					if ( completed == null ) {
-						name = requestHeadersNames[ name.toLowerCase() ] =
-							requestHeadersNames[ name.toLowerCase() ] || name;
-						requestHeaders[ name ] = value;
-					}
-					return this;
-				},
-
-				// Overrides response content-type header
-				overrideMimeType: function( type ) {
-					if ( completed == null ) {
-						s.mimeType = type;
-					}
-					return this;
-				},
-
-				// Status-dependent callbacks
-				statusCode: function( map ) {
-					var code;
-					if ( map ) {
-						if ( completed ) {
-
-							// Execute the appropriate callbacks
-							jqXHR.always( map[ jqXHR.status ] );
-						} else {
-
-							// Lazy-add the new callbacks in a way that preserves old ones
-							for ( code in map ) {
-								statusCode[ code ] = [ statusCode[ code ], map[ code ] ];
-							}
-						}
-					}
-					return this;
-				},
-
-				// Cancel the request
-				abort: function( statusText ) {
-					var finalText = statusText || strAbort;
-					if ( transport ) {
-						transport.abort( finalText );
-					}
-					done( 0, finalText );
-					return this;
-				}
-			};
-
-		// Attach deferreds
-		deferred.promise( jqXHR );
-
-		// Add protocol if not provided (prefilters might expect it)
-		// Handle falsy url in the settings object (#10093: consistency with old signature)
-		// We also use the url parameter if available
-		s.url = ( ( url || s.url || location.href ) + "" )
-			.replace( rprotocol, location.protocol + "//" );
-
-		// Alias method option to type as per ticket #12004
-		s.type = options.method || options.type || s.method || s.type;
-
-		// Extract dataTypes list
-		s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ];
-
-		// A cross-domain request is in order when the origin doesn't match the current origin.
-		if ( s.crossDomain == null ) {
-			urlAnchor = document.createElement( "a" );
-
-			// Support: IE <=8 - 11, Edge 12 - 15
-			// IE throws exception on accessing the href property if url is malformed,
-			// e.g. http://example.com:80x/
-			try {
-				urlAnchor.href = s.url;
-
-				// Support: IE <=8 - 11 only
-				// Anchor's host property isn't correctly set when s.url is relative
-				urlAnchor.href = urlAnchor.href;
-				s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !==
-					urlAnchor.protocol + "//" + urlAnchor.host;
-			} catch ( e ) {
-
-				// If there is an error parsing the URL, assume it is crossDomain,
-				// it can be rejected by the transport if it is invalid
-				s.crossDomain = true;
-			}
-		}
-
-		// Convert data if not already a string
-		if ( s.data && s.processData && typeof s.data !== "string" ) {
-			s.data = jQuery.param( s.data, s.traditional );
-		}
-
-		// Apply prefilters
-		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
-
-		// If request was aborted inside a prefilter, stop there
-		if ( completed ) {
-			return jqXHR;
-		}
-
-		// We can fire global events as of now if asked to
-		// Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118)
-		fireGlobals = jQuery.event && s.global;
-
-		// Watch for a new set of requests
-		if ( fireGlobals && jQuery.active++ === 0 ) {
-			jQuery.event.trigger( "ajaxStart" );
-		}
-
-		// Uppercase the type
-		s.type = s.type.toUpperCase();
-
-		// Determine if request has content
-		s.hasContent = !rnoContent.test( s.type );
-
-		// Save the URL in case we're toying with the If-Modified-Since
-		// and/or If-None-Match header later on
-		// Remove hash to simplify url manipulation
-		cacheURL = s.url.replace( rhash, "" );
-
-		// More options handling for requests with no content
-		if ( !s.hasContent ) {
-
-			// Remember the hash so we can put it back
-			uncached = s.url.slice( cacheURL.length );
-
-			// If data is available and should be processed, append data to url
-			if ( s.data && ( s.processData || typeof s.data === "string" ) ) {
-				cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data;
-
-				// #9682: remove data so that it's not used in an eventual retry
-				delete s.data;
-			}
-
-			// Add or update anti-cache param if needed
-			if ( s.cache === false ) {
-				cacheURL = cacheURL.replace( rantiCache, "$1" );
-				uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) +
-					uncached;
-			}
-
-			// Put hash and anti-cache on the URL that will be requested (gh-1732)
-			s.url = cacheURL + uncached;
-
-		// Change '%20' to '+' if this is encoded form body content (gh-2658)
-		} else if ( s.data && s.processData &&
-			( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) {
-			s.data = s.data.replace( r20, "+" );
-		}
-
-		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
-		if ( s.ifModified ) {
-			if ( jQuery.lastModified[ cacheURL ] ) {
-				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] );
-			}
-			if ( jQuery.etag[ cacheURL ] ) {
-				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] );
-			}
-		}
-
-		// Set the correct header, if data is being sent
-		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
-			jqXHR.setRequestHeader( "Content-Type", s.contentType );
-		}
-
-		// Set the Accepts header for the server, depending on the dataType
-		jqXHR.setRequestHeader(
-			"Accept",
-			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ?
-				s.accepts[ s.dataTypes[ 0 ] ] +
-					( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
-				s.accepts[ "*" ]
-		);
-
-		// Check for headers option
-		for ( i in s.headers ) {
-			jqXHR.setRequestHeader( i, s.headers[ i ] );
-		}
-
-		// Allow custom headers/mimetypes and early abort
-		if ( s.beforeSend &&
-			( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) {
-
-			// Abort if not done already and return
-			return jqXHR.abort();
-		}
-
-		// Aborting is no longer a cancellation
-		strAbort = "abort";
-
-		// Install callbacks on deferreds
-		completeDeferred.add( s.complete );
-		jqXHR.done( s.success );
-		jqXHR.fail( s.error );
-
-		// Get transport
-		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
-
-		// If no transport, we auto-abort
-		if ( !transport ) {
-			done( -1, "No Transport" );
-		} else {
-			jqXHR.readyState = 1;
-
-			// Send global event
-			if ( fireGlobals ) {
-				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
-			}
-
-			// If request was aborted inside ajaxSend, stop there
-			if ( completed ) {
-				return jqXHR;
-			}
-
-			// Timeout
-			if ( s.async && s.timeout > 0 ) {
-				timeoutTimer = window.setTimeout( function() {
-					jqXHR.abort( "timeout" );
-				}, s.timeout );
-			}
-
-			try {
-				completed = false;
-				transport.send( requestHeaders, done );
-			} catch ( e ) {
-
-				// Rethrow post-completion exceptions
-				if ( completed ) {
-					throw e;
-				}
-
-				// Propagate others as results
-				done( -1, e );
-			}
-		}
-
-		// Callback for when everything is done
-		function done( status, nativeStatusText, responses, headers ) {
-			var isSuccess, success, error, response, modified,
-				statusText = nativeStatusText;
-
-			// Ignore repeat invocations
-			if ( completed ) {
-				return;
-			}
-
-			completed = true;
-
-			// Clear timeout if it exists
-			if ( timeoutTimer ) {
-				window.clearTimeout( timeoutTimer );
-			}
-
-			// Dereference transport for early garbage collection
-			// (no matter how long the jqXHR object will be used)
-			transport = undefined;
-
-			// Cache response headers
-			responseHeadersString = headers || "";
-
-			// Set readyState
-			jqXHR.readyState = status > 0 ? 4 : 0;
-
-			// Determine if successful
-			isSuccess = status >= 200 && status < 300 || status === 304;
-
-			// Get response data
-			if ( responses ) {
-				response = ajaxHandleResponses( s, jqXHR, responses );
-			}
-
-			// Use a noop converter for missing script but not if jsonp
-			if ( !isSuccess &&
-				jQuery.inArray( "script", s.dataTypes ) > -1 &&
-				jQuery.inArray( "json", s.dataTypes ) < 0 ) {
-				s.converters[ "text script" ] = function() {};
-			}
-
-			// Convert no matter what (that way responseXXX fields are always set)
-			response = ajaxConvert( s, response, jqXHR, isSuccess );
-
-			// If successful, handle type chaining
-			if ( isSuccess ) {
-
-				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
-				if ( s.ifModified ) {
-					modified = jqXHR.getResponseHeader( "Last-Modified" );
-					if ( modified ) {
-						jQuery.lastModified[ cacheURL ] = modified;
-					}
-					modified = jqXHR.getResponseHeader( "etag" );
-					if ( modified ) {
-						jQuery.etag[ cacheURL ] = modified;
-					}
-				}
-
-				// if no content
-				if ( status === 204 || s.type === "HEAD" ) {
-					statusText = "nocontent";
-
-				// if not modified
-				} else if ( status === 304 ) {
-					statusText = "notmodified";
-
-				// If we have data, let's convert it
-				} else {
-					statusText = response.state;
-					success = response.data;
-					error = response.error;
-					isSuccess = !error;
-				}
-			} else {
-
-				// Extract error from statusText and normalize for non-aborts
-				error = statusText;
-				if ( status || !statusText ) {
-					statusText = "error";
-					if ( status < 0 ) {
-						status = 0;
-					}
-				}
-			}
-
-			// Set data for the fake xhr object
-			jqXHR.status = status;
-			jqXHR.statusText = ( nativeStatusText || statusText ) + "";
-
-			// Success/Error
-			if ( isSuccess ) {
-				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
-			} else {
-				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
-			}
-
-			// Status-dependent callbacks
-			jqXHR.statusCode( statusCode );
-			statusCode = undefined;
-
-			if ( fireGlobals ) {
-				globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError",
-					[ jqXHR, s, isSuccess ? success : error ] );
-			}
-
-			// Complete
-			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
-
-			if ( fireGlobals ) {
-				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
-
-				// Handle the global AJAX counter
-				if ( !( --jQuery.active ) ) {
-					jQuery.event.trigger( "ajaxStop" );
-				}
-			}
-		}
-
-		return jqXHR;
-	},
-
-	getJSON: function( url, data, callback ) {
-		return jQuery.get( url, data, callback, "json" );
-	},
-
-	getScript: function( url, callback ) {
-		return jQuery.get( url, undefined, callback, "script" );
-	}
-} );
-
-jQuery.each( [ "get", "post" ], function( _i, method ) {
-	jQuery[ method ] = function( url, data, callback, type ) {
-
-		// Shift arguments if data argument was omitted
-		if ( isFunction( data ) ) {
-			type = type || callback;
-			callback = data;
-			data = undefined;
-		}
-
-		// The url can be an options object (which then must have .url)
-		return jQuery.ajax( jQuery.extend( {
-			url: url,
-			type: method,
-			dataType: type,
-			data: data,
-			success: callback
-		}, jQuery.isPlainObject( url ) && url ) );
-	};
-} );
-
-jQuery.ajaxPrefilter( function( s ) {
-	var i;
-	for ( i in s.headers ) {
-		if ( i.toLowerCase() === "content-type" ) {
-			s.contentType = s.headers[ i ] || "";
-		}
-	}
-} );
-
-
-jQuery._evalUrl = function( url, options, doc ) {
-	return jQuery.ajax( {
-		url: url,
-
-		// Make this explicit, since user can override this through ajaxSetup (#11264)
-		type: "GET",
-		dataType: "script",
-		cache: true,
-		async: false,
-		global: false,
-
-		// Only evaluate the response if it is successful (gh-4126)
-		// dataFilter is not invoked for failure responses, so using it instead
-		// of the default converter is kludgy but it works.
-		converters: {
-			"text script": function() {}
-		},
-		dataFilter: function( response ) {
-			jQuery.globalEval( response, options, doc );
-		}
-	} );
-};
-
-
-jQuery.fn.extend( {
-	wrapAll: function( html ) {
-		var wrap;
-
-		if ( this[ 0 ] ) {
-			if ( isFunction( html ) ) {
-				html = html.call( this[ 0 ] );
-			}
-
-			// The elements to wrap the target around
-			wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true );
-
-			if ( this[ 0 ].parentNode ) {
-				wrap.insertBefore( this[ 0 ] );
-			}
-
-			wrap.map( function() {
-				var elem = this;
-
-				while ( elem.firstElementChild ) {
-					elem = elem.firstElementChild;
-				}
-
-				return elem;
-			} ).append( this );
-		}
-
-		return this;
-	},
-
-	wrapInner: function( html ) {
-		if ( isFunction( html ) ) {
-			return this.each( function( i ) {
-				jQuery( this ).wrapInner( html.call( this, i ) );
-			} );
-		}
-
-		return this.each( function() {
-			var self = jQuery( this ),
-				contents = self.contents();
-
-			if ( contents.length ) {
-				contents.wrapAll( html );
-
-			} else {
-				self.append( html );
-			}
-		} );
-	},
-
-	wrap: function( html ) {
-		var htmlIsFunction = isFunction( html );
-
-		return this.each( function( i ) {
-			jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html );
-		} );
-	},
-
-	unwrap: function( selector ) {
-		this.parent( selector ).not( "body" ).each( function() {
-			jQuery( this ).replaceWith( this.childNodes );
-		} );
-		return this;
-	}
-} );
-
-
-jQuery.expr.pseudos.hidden = function( elem ) {
-	return !jQuery.expr.pseudos.visible( elem );
-};
-jQuery.expr.pseudos.visible = function( elem ) {
-	return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length );
-};
-
-
-
-
-jQuery.ajaxSettings.xhr = function() {
-	try {
-		return new window.XMLHttpRequest();
-	} catch ( e ) {}
-};
-
-var xhrSuccessStatus = {
-
-		// File protocol always yields status code 0, assume 200
-		0: 200,
-
-		// Support: IE <=9 only
-		// #1450: sometimes IE returns 1223 when it should be 204
-		1223: 204
-	},
-	xhrSupported = jQuery.ajaxSettings.xhr();
-
-support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported );
-support.ajax = xhrSupported = !!xhrSupported;
-
-jQuery.ajaxTransport( function( options ) {
-	var callback, errorCallback;
-
-	// Cross domain only allowed if supported through XMLHttpRequest
-	if ( support.cors || xhrSupported && !options.crossDomain ) {
-		return {
-			send: function( headers, complete ) {
-				var i,
-					xhr = options.xhr();
-
-				xhr.open(
-					options.type,
-					options.url,
-					options.async,
-					options.username,
-					options.password
-				);
-
-				// Apply custom fields if provided
-				if ( options.xhrFields ) {
-					for ( i in options.xhrFields ) {
-						xhr[ i ] = options.xhrFields[ i ];
-					}
-				}
-
-				// Override mime type if needed
-				if ( options.mimeType && xhr.overrideMimeType ) {
-					xhr.overrideMimeType( options.mimeType );
-				}
-
-				// X-Requested-With header
-				// For cross-domain requests, seeing as conditions for a preflight are
-				// akin to a jigsaw puzzle, we simply never set it to be sure.
-				// (it can always be set on a per-request basis or even using ajaxSetup)
-				// For same-domain requests, won't change header if already provided.
-				if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) {
-					headers[ "X-Requested-With" ] = "XMLHttpRequest";
-				}
-
-				// Set headers
-				for ( i in headers ) {
-					xhr.setRequestHeader( i, headers[ i ] );
-				}
-
-				// Callback
-				callback = function( type ) {
-					return function() {
-						if ( callback ) {
-							callback = errorCallback = xhr.onload =
-								xhr.onerror = xhr.onabort = xhr.ontimeout =
-									xhr.onreadystatechange = null;
-
-							if ( type === "abort" ) {
-								xhr.abort();
-							} else if ( type === "error" ) {
-
-								// Support: IE <=9 only
-								// On a manual native abort, IE9 throws
-								// errors on any property access that is not readyState
-								if ( typeof xhr.status !== "number" ) {
-									complete( 0, "error" );
-								} else {
-									complete(
-
-										// File: protocol always yields status 0; see #8605, #14207
-										xhr.status,
-										xhr.statusText
-									);
-								}
-							} else {
-								complete(
-									xhrSuccessStatus[ xhr.status ] || xhr.status,
-									xhr.statusText,
-
-									// Support: IE <=9 only
-									// IE9 has no XHR2 but throws on binary (trac-11426)
-									// For XHR2 non-text, let the caller handle it (gh-2498)
-									( xhr.responseType || "text" ) !== "text"  ||
-									typeof xhr.responseText !== "string" ?
-										{ binary: xhr.response } :
-										{ text: xhr.responseText },
-									xhr.getAllResponseHeaders()
-								);
-							}
-						}
-					};
-				};
-
-				// Listen to events
-				xhr.onload = callback();
-				errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" );
-
-				// Support: IE 9 only
-				// Use onreadystatechange to replace onabort
-				// to handle uncaught aborts
-				if ( xhr.onabort !== undefined ) {
-					xhr.onabort = errorCallback;
-				} else {
-					xhr.onreadystatechange = function() {
-
-						// Check readyState before timeout as it changes
-						if ( xhr.readyState === 4 ) {
-
-							// Allow onerror to be called first,
-							// but that will not handle a native abort
-							// Also, save errorCallback to a variable
-							// as xhr.onerror cannot be accessed
-							window.setTimeout( function() {
-								if ( callback ) {
-									errorCallback();
-								}
-							} );
-						}
-					};
-				}
-
-				// Create the abort callback
-				callback = callback( "abort" );
-
-				try {
-
-					// Do send the request (this may raise an exception)
-					xhr.send( options.hasContent && options.data || null );
-				} catch ( e ) {
-
-					// #14683: Only rethrow if this hasn't been notified as an error yet
-					if ( callback ) {
-						throw e;
-					}
-				}
-			},
-
-			abort: function() {
-				if ( callback ) {
-					callback();
-				}
-			}
-		};
-	}
-} );
-
-
-
-
-// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432)
-jQuery.ajaxPrefilter( function( s ) {
-	if ( s.crossDomain ) {
-		s.contents.script = false;
-	}
-} );
-
-// Install script dataType
-jQuery.ajaxSetup( {
-	accepts: {
-		script: "text/javascript, application/javascript, " +
-			"application/ecmascript, application/x-ecmascript"
-	},
-	contents: {
-		script: /\b(?:java|ecma)script\b/
-	},
-	converters: {
-		"text script": function( text ) {
-			jQuery.globalEval( text );
-			return text;
-		}
-	}
-} );
-
-// Handle cache's special case and crossDomain
-jQuery.ajaxPrefilter( "script", function( s ) {
-	if ( s.cache === undefined ) {
-		s.cache = false;
-	}
-	if ( s.crossDomain ) {
-		s.type = "GET";
-	}
-} );
-
-// Bind script tag hack transport
-jQuery.ajaxTransport( "script", function( s ) {
-
-	// This transport only deals with cross domain or forced-by-attrs requests
-	if ( s.crossDomain || s.scriptAttrs ) {
-		var script, callback;
-		return {
-			send: function( _, complete ) {
-				script = jQuery( "<script>" )
-					.attr( s.scriptAttrs || {} )
-					.prop( { charset: s.scriptCharset, src: s.url } )
-					.on( "load error", callback = function( evt ) {
-						script.remove();
-						callback = null;
-						if ( evt ) {
-							complete( evt.type === "error" ? 404 : 200, evt.type );
-						}
-					} );
-
-				// Use native DOM manipulation to avoid our domManip AJAX trickery
-				document.head.appendChild( script[ 0 ] );
-			},
-			abort: function() {
-				if ( callback ) {
-					callback();
-				}
-			}
-		};
-	}
-} );
-
-
-
-
-var oldCallbacks = [],
-	rjsonp = /(=)\?(?=&|$)|\?\?/;
-
-// Default jsonp settings
-jQuery.ajaxSetup( {
-	jsonp: "callback",
-	jsonpCallback: function() {
-		var callback = oldCallbacks.pop() || ( jQuery.expando + "_" + ( nonce.guid++ ) );
-		this[ callback ] = true;
-		return callback;
-	}
-} );
-
-// Detect, normalize options and install callbacks for jsonp requests
-jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) {
-
-	var callbackName, overwritten, responseContainer,
-		jsonProp = s.jsonp !== false && ( rjsonp.test( s.url ) ?
-			"url" :
-			typeof s.data === "string" &&
-				( s.contentType || "" )
-					.indexOf( "application/x-www-form-urlencoded" ) === 0 &&
-				rjsonp.test( s.data ) && "data"
-		);
-
-	// Handle iff the expected data type is "jsonp" or we have a parameter to set
-	if ( jsonProp || s.dataTypes[ 0 ] === "jsonp" ) {
-
-		// Get callback name, remembering preexisting value associated with it
-		callbackName = s.jsonpCallback = isFunction( s.jsonpCallback ) ?
-			s.jsonpCallback() :
-			s.jsonpCallback;
-
-		// Insert callback into url or form data
-		if ( jsonProp ) {
-			s[ jsonProp ] = s[ jsonProp ].replace( rjsonp, "$1" + callbackName );
-		} else if ( s.jsonp !== false ) {
-			s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.jsonp + "=" + callbackName;
-		}
-
-		// Use data converter to retrieve json after script execution
-		s.converters[ "script json" ] = function() {
-			if ( !responseContainer ) {
-				jQuery.error( callbackName + " was not called" );
-			}
-			return responseContainer[ 0 ];
-		};
-
-		// Force json dataType
-		s.dataTypes[ 0 ] = "json";
-
-		// Install callback
-		overwritten = window[ callbackName ];
-		window[ callbackName ] = function() {
-			responseContainer = arguments;
-		};
-
-		// Clean-up function (fires after converters)
-		jqXHR.always( function() {
-
-			// If previous value didn't exist - remove it
-			if ( overwritten === undefined ) {
-				jQuery( window ).removeProp( callbackName );
-
-			// Otherwise restore preexisting value
-			} else {
-				window[ callbackName ] = overwritten;
-			}
-
-			// Save back as free
-			if ( s[ callbackName ] ) {
-
-				// Make sure that re-using the options doesn't screw things around
-				s.jsonpCallback = originalSettings.jsonpCallback;
-
-				// Save the callback name for future use
-				oldCallbacks.push( callbackName );
-			}
-
-			// Call if it was a function and we have a response
-			if ( responseContainer && isFunction( overwritten ) ) {
-				overwritten( responseContainer[ 0 ] );
-			}
-
-			responseContainer = overwritten = undefined;
-		} );
-
-		// Delegate to script
-		return "script";
-	}
-} );
-
-
-
-
-// Support: Safari 8 only
-// In Safari 8 documents created via document.implementation.createHTMLDocument
-// collapse sibling forms: the second one becomes a child of the first one.
-// Because of that, this security measure has to be disabled in Safari 8.
-// https://bugs.webkit.org/show_bug.cgi?id=137337
-support.createHTMLDocument = ( function() {
-	var body = document.implementation.createHTMLDocument( "" ).body;
-	body.innerHTML = "<form></form><form></form>";
-	return body.childNodes.length === 2;
-} )();
-
-
-// Argument "data" should be string of html
-// context (optional): If specified, the fragment will be created in this context,
-// defaults to document
-// keepScripts (optional): If true, will include scripts passed in the html string
-jQuery.parseHTML = function( data, context, keepScripts ) {
-	if ( typeof data !== "string" ) {
-		return [];
-	}
-	if ( typeof context === "boolean" ) {
-		keepScripts = context;
-		context = false;
-	}
-
-	var base, parsed, scripts;
-
-	if ( !context ) {
-
-		// Stop scripts or inline event handlers from being executed immediately
-		// by using document.implementation
-		if ( support.createHTMLDocument ) {
-			context = document.implementation.createHTMLDocument( "" );
-
-			// Set the base href for the created document
-			// so any parsed elements with URLs
-			// are based on the document's URL (gh-2965)
-			base = context.createElement( "base" );
-			base.href = document.location.href;
-			context.head.appendChild( base );
-		} else {
-			context = document;
-		}
-	}
-
-	parsed = rsingleTag.exec( data );
-	scripts = !keepScripts && [];
-
-	// Single tag
-	if ( parsed ) {
-		return [ context.createElement( parsed[ 1 ] ) ];
-	}
-
-	parsed = buildFragment( [ data ], context, scripts );
-
-	if ( scripts && scripts.length ) {
-		jQuery( scripts ).remove();
-	}
-
-	return jQuery.merge( [], parsed.childNodes );
-};
-
-
-/**
- * Load a url into a page
- */
-jQuery.fn.load = function( url, params, callback ) {
-	var selector, type, response,
-		self = this,
-		off = url.indexOf( " " );
-
-	if ( off > -1 ) {
-		selector = stripAndCollapse( url.slice( off ) );
-		url = url.slice( 0, off );
-	}
-
-	// If it's a function
-	if ( isFunction( params ) ) {
-
-		// We assume that it's the callback
-		callback = params;
-		params = undefined;
-
-	// Otherwise, build a param string
-	} else if ( params && typeof params === "object" ) {
-		type = "POST";
-	}
-
-	// If we have elements to modify, make the request
-	if ( self.length > 0 ) {
-		jQuery.ajax( {
-			url: url,
-
-			// If "type" variable is undefined, then "GET" method will be used.
-			// Make value of this field explicit since
-			// user can override it through ajaxSetup method
-			type: type || "GET",
-			dataType: "html",
-			data: params
-		} ).done( function( responseText ) {
-
-			// Save response for use in complete callback
-			response = arguments;
-
-			self.html( selector ?
-
-				// If a selector was specified, locate the right elements in a dummy div
-				// Exclude scripts to avoid IE 'Permission Denied' errors
-				jQuery( "<div>" ).append( jQuery.parseHTML( responseText ) ).find( selector ) :
-
-				// Otherwise use the full result
-				responseText );
-
-		// If the request succeeds, this function gets "data", "status", "jqXHR"
-		// but they are ignored because response was set above.
-		// If it fails, this function gets "jqXHR", "status", "error"
-		} ).always( callback && function( jqXHR, status ) {
-			self.each( function() {
-				callback.apply( this, response || [ jqXHR.responseText, status, jqXHR ] );
-			} );
-		} );
-	}
-
-	return this;
-};
-
-
-
-
-jQuery.expr.pseudos.animated = function( elem ) {
-	return jQuery.grep( jQuery.timers, function( fn ) {
-		return elem === fn.elem;
-	} ).length;
-};
-
-
-
-
-jQuery.offset = {
-	setOffset: function( elem, options, i ) {
-		var curPosition, curLeft, curCSSTop, curTop, curOffset, curCSSLeft, calculatePosition,
-			position = jQuery.css( elem, "position" ),
-			curElem = jQuery( elem ),
-			props = {};
-
-		// Set position first, in-case top/left are set even on static elem
-		if ( position === "static" ) {
-			elem.style.position = "relative";
-		}
-
-		curOffset = curElem.offset();
-		curCSSTop = jQuery.css( elem, "top" );
-		curCSSLeft = jQuery.css( elem, "left" );
-		calculatePosition = ( position === "absolute" || position === "fixed" ) &&
-			( curCSSTop + curCSSLeft ).indexOf( "auto" ) > -1;
-
-		// Need to be able to calculate position if either
-		// top or left is auto and position is either absolute or fixed
-		if ( calculatePosition ) {
-			curPosition = curElem.position();
-			curTop = curPosition.top;
-			curLeft = curPosition.left;
-
-		} else {
-			curTop = parseFloat( curCSSTop ) || 0;
-			curLeft = parseFloat( curCSSLeft ) || 0;
-		}
-
-		if ( isFunction( options ) ) {
-
-			// Use jQuery.extend here to allow modification of coordinates argument (gh-1848)
-			options = options.call( elem, i, jQuery.extend( {}, curOffset ) );
-		}
-
-		if ( options.top != null ) {
-			props.top = ( options.top - curOffset.top ) + curTop;
-		}
-		if ( options.left != null ) {
-			props.left = ( options.left - curOffset.left ) + curLeft;
-		}
-
-		if ( "using" in options ) {
-			options.using.call( elem, props );
-
-		} else {
-			curElem.css( props );
-		}
-	}
-};
-
-jQuery.fn.extend( {
-
-	// offset() relates an element's border box to the document origin
-	offset: function( options ) {
-
-		// Preserve chaining for setter
-		if ( arguments.length ) {
-			return options === undefined ?
-				this :
-				this.each( function( i ) {
-					jQuery.offset.setOffset( this, options, i );
-				} );
-		}
-
-		var rect, win,
-			elem = this[ 0 ];
-
-		if ( !elem ) {
-			return;
-		}
-
-		// Return zeros for disconnected and hidden (display: none) elements (gh-2310)
-		// Support: IE <=11 only
-		// Running getBoundingClientRect on a
-		// disconnected node in IE throws an error
-		if ( !elem.getClientRects().length ) {
-			return { top: 0, left: 0 };
-		}
-
-		// Get document-relative position by adding viewport scroll to viewport-relative gBCR
-		rect = elem.getBoundingClientRect();
-		win = elem.ownerDocument.defaultView;
-		return {
-			top: rect.top + win.pageYOffset,
-			left: rect.left + win.pageXOffset
-		};
-	},
-
-	// position() relates an element's margin box to its offset parent's padding box
-	// This corresponds to the behavior of CSS absolute positioning
-	position: function() {
-		if ( !this[ 0 ] ) {
-			return;
-		}
-
-		var offsetParent, offset, doc,
-			elem = this[ 0 ],
-			parentOffset = { top: 0, left: 0 };
-
-		// position:fixed elements are offset from the viewport, which itself always has zero offset
-		if ( jQuery.css( elem, "position" ) === "fixed" ) {
-
-			// Assume position:fixed implies availability of getBoundingClientRect
-			offset = elem.getBoundingClientRect();
-
-		} else {
-			offset = this.offset();
-
-			// Account for the *real* offset parent, which can be the document or its root element
-			// when a statically positioned element is identified
-			doc = elem.ownerDocument;
-			offsetParent = elem.offsetParent || doc.documentElement;
-			while ( offsetParent &&
-				( offsetParent === doc.body || offsetParent === doc.documentElement ) &&
-				jQuery.css( offsetParent, "position" ) === "static" ) {
-
-				offsetParent = offsetParent.parentNode;
-			}
-			if ( offsetParent && offsetParent !== elem && offsetParent.nodeType === 1 ) {
-
-				// Incorporate borders into its offset, since they are outside its content origin
-				parentOffset = jQuery( offsetParent ).offset();
-				parentOffset.top += jQuery.css( offsetParent, "borderTopWidth", true );
-				parentOffset.left += jQuery.css( offsetParent, "borderLeftWidth", true );
-			}
-		}
-
-		// Subtract parent offsets and element margins
-		return {
-			top: offset.top - parentOffset.top - jQuery.css( elem, "marginTop", true ),
-			left: offset.left - parentOffset.left - jQuery.css( elem, "marginLeft", true )
-		};
-	},
-
-	// This method will return documentElement in the following cases:
-	// 1) For the element inside the iframe without offsetParent, this method will return
-	//    documentElement of the parent window
-	// 2) For the hidden or detached element
-	// 3) For body or html element, i.e. in case of the html node - it will return itself
-	//
-	// but those exceptions were never presented as a real life use-cases
-	// and might be considered as more preferable results.
-	//
-	// This logic, however, is not guaranteed and can change at any point in the future
-	offsetParent: function() {
-		return this.map( function() {
-			var offsetParent = this.offsetParent;
-
-			while ( offsetParent && jQuery.css( offsetParent, "position" ) === "static" ) {
-				offsetParent = offsetParent.offsetParent;
-			}
-
-			return offsetParent || documentElement;
-		} );
-	}
-} );
-
-// Create scrollLeft and scrollTop methods
-jQuery.each( { scrollLeft: "pageXOffset", scrollTop: "pageYOffset" }, function( method, prop ) {
-	var top = "pageYOffset" === prop;
-
-	jQuery.fn[ method ] = function( val ) {
-		return access( this, function( elem, method, val ) {
-
-			// Coalesce documents and windows
-			var win;
-			if ( isWindow( elem ) ) {
-				win = elem;
-			} else if ( elem.nodeType === 9 ) {
-				win = elem.defaultView;
-			}
-
-			if ( val === undefined ) {
-				return win ? win[ prop ] : elem[ method ];
-			}
-
-			if ( win ) {
-				win.scrollTo(
-					!top ? val : win.pageXOffset,
-					top ? val : win.pageYOffset
-				);
-
-			} else {
-				elem[ method ] = val;
-			}
-		}, method, val, arguments.length );
-	};
-} );
-
-// Support: Safari <=7 - 9.1, Chrome <=37 - 49
-// Add the top/left cssHooks using jQuery.fn.position
-// Webkit bug: https://bugs.webkit.org/show_bug.cgi?id=29084
-// Blink bug: https://bugs.chromium.org/p/chromium/issues/detail?id=589347
-// getComputedStyle returns percent when specified for top/left/bottom/right;
-// rather than make the css module depend on the offset module, just check for it here
-jQuery.each( [ "top", "left" ], function( _i, prop ) {
-	jQuery.cssHooks[ prop ] = addGetHookIf( support.pixelPosition,
-		function( elem, computed ) {
-			if ( computed ) {
-				computed = curCSS( elem, prop );
-
-				// If curCSS returns percentage, fallback to offset
-				return rnumnonpx.test( computed ) ?
-					jQuery( elem ).position()[ prop ] + "px" :
-					computed;
-			}
-		}
-	);
-} );
-
-
-// Create innerHeight, innerWidth, height, width, outerHeight and outerWidth methods
-jQuery.each( { Height: "height", Width: "width" }, function( name, type ) {
-	jQuery.each( {
-		padding: "inner" + name,
-		content: type,
-		"": "outer" + name
-	}, function( defaultExtra, funcName ) {
-
-		// Margin is only for outerHeight, outerWidth
-		jQuery.fn[ funcName ] = function( margin, value ) {
-			var chainable = arguments.length && ( defaultExtra || typeof margin !== "boolean" ),
-				extra = defaultExtra || ( margin === true || value === true ? "margin" : "border" );
-
-			return access( this, function( elem, type, value ) {
-				var doc;
-
-				if ( isWindow( elem ) ) {
-
-					// $( window ).outerWidth/Height return w/h including scrollbars (gh-1729)
-					return funcName.indexOf( "outer" ) === 0 ?
-						elem[ "inner" + name ] :
-						elem.document.documentElement[ "client" + name ];
-				}
-
-				// Get document width or height
-				if ( elem.nodeType === 9 ) {
-					doc = elem.documentElement;
-
-					// Either scroll[Width/Height] or offset[Width/Height] or client[Width/Height],
-					// whichever is greatest
-					return Math.max(
-						elem.body[ "scroll" + name ], doc[ "scroll" + name ],
-						elem.body[ "offset" + name ], doc[ "offset" + name ],
-						doc[ "client" + name ]
-					);
-				}
-
-				return value === undefined ?
-
-					// Get width or height on the element, requesting but not forcing parseFloat
-					jQuery.css( elem, type, extra ) :
-
-					// Set width or height on the element
-					jQuery.style( elem, type, value, extra );
-			}, type, chainable ? margin : undefined, chainable );
-		};
-	} );
-} );
-
-
-jQuery.each( [
-	"ajaxStart",
-	"ajaxStop",
-	"ajaxComplete",
-	"ajaxError",
-	"ajaxSuccess",
-	"ajaxSend"
-], function( _i, type ) {
-	jQuery.fn[ type ] = function( fn ) {
-		return this.on( type, fn );
-	};
-} );
-
-
-
-
-jQuery.fn.extend( {
-
-	bind: function( types, data, fn ) {
-		return this.on( types, null, data, fn );
-	},
-	unbind: function( types, fn ) {
-		return this.off( types, null, fn );
-	},
-
-	delegate: function( selector, types, data, fn ) {
-		return this.on( types, selector, data, fn );
-	},
-	undelegate: function( selector, types, fn ) {
-
-		// ( namespace ) or ( selector, types [, fn] )
-		return arguments.length === 1 ?
-			this.off( selector, "**" ) :
-			this.off( types, selector || "**", fn );
-	},
-
-	hover: function( fnOver, fnOut ) {
-		return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
-	}
-} );
-
-jQuery.each(
-	( "blur focus focusin focusout resize scroll click dblclick " +
-	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
-	"change select submit keydown keypress keyup contextmenu" ).split( " " ),
-	function( _i, name ) {
-
-		// Handle event binding
-		jQuery.fn[ name ] = function( data, fn ) {
-			return arguments.length > 0 ?
-				this.on( name, null, data, fn ) :
-				this.trigger( name );
-		};
-	}
-);
-
-
-
-
-// Support: Android <=4.0 only
-// Make sure we trim BOM and NBSP
-var rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;
-
-// Bind a function to a context, optionally partially applying any
-// arguments.
-// jQuery.proxy is deprecated to promote standards (specifically Function#bind)
-// However, it is not slated for removal any time soon
-jQuery.proxy = function( fn, context ) {
-	var tmp, args, proxy;
-
-	if ( typeof context === "string" ) {
-		tmp = fn[ context ];
-		context = fn;
-		fn = tmp;
-	}
-
-	// Quick check to determine if target is callable, in the spec
-	// this throws a TypeError, but we will just return undefined.
-	if ( !isFunction( fn ) ) {
-		return undefined;
-	}
-
-	// Simulated bind
-	args = slice.call( arguments, 2 );
-	proxy = function() {
-		return fn.apply( context || this, args.concat( slice.call( arguments ) ) );
-	};
-
-	// Set the guid of unique handler to the same of original handler, so it can be removed
-	proxy.guid = fn.guid = fn.guid || jQuery.guid++;
-
-	return proxy;
-};
-
-jQuery.holdReady = function( hold ) {
-	if ( hold ) {
-		jQuery.readyWait++;
-	} else {
-		jQuery.ready( true );
-	}
-};
-jQuery.isArray = Array.isArray;
-jQuery.parseJSON = JSON.parse;
-jQuery.nodeName = nodeName;
-jQuery.isFunction = isFunction;
-jQuery.isWindow = isWindow;
-jQuery.camelCase = camelCase;
-jQuery.type = toType;
-
-jQuery.now = Date.now;
-
-jQuery.isNumeric = function( obj ) {
-
-	// As of jQuery 3.0, isNumeric is limited to
-	// strings and numbers (primitives or objects)
-	// that can be coerced to finite numbers (gh-2662)
-	var type = jQuery.type( obj );
-	return ( type === "number" || type === "string" ) &&
-
-		// parseFloat NaNs numeric-cast false positives ("")
-		// ...but misinterprets leading-number strings, particularly hex literals ("0x...")
-		// subtraction forces infinities to NaN
-		!isNaN( obj - parseFloat( obj ) );
-};
-
-jQuery.trim = function( text ) {
-	return text == null ?
-		"" :
-		( text + "" ).replace( rtrim, "" );
-};
-
-
-
-// Register as a named AMD module, since jQuery can be concatenated with other
-// files that may use define, but not via a proper concatenation script that
-// understands anonymous AMD modules. A named AMD is safest and most robust
-// way to register. Lowercase jquery is used because AMD module names are
-// derived from file names, and jQuery is normally delivered in a lowercase
-// file name. Do this after creating the global so that if an AMD module wants
-// to call noConflict to hide this version of jQuery, it will work.
-
-// Note that for maximum portability, libraries that are not jQuery should
-// declare themselves as anonymous modules, and avoid setting a global if an
-// AMD loader is present. jQuery is a special case. For more information, see
-// https://github.com/jrburke/requirejs/wiki/Updating-existing-libraries#wiki-anon
-
-if ( typeof define === "function" && define.amd ) {
-	define( "jquery", [], function() {
-		return jQuery;
-	} );
-}
-
-
-
-
-var
-
-	// Map over jQuery in case of overwrite
-	_jQuery = window.jQuery,
-
-	// Map over the $ in case of overwrite
-	_$ = window.$;
-
-jQuery.noConflict = function( deep ) {
-	if ( window.$ === jQuery ) {
-		window.$ = _$;
-	}
-
-	if ( deep && window.jQuery === jQuery ) {
-		window.jQuery = _jQuery;
-	}
-
-	return jQuery;
-};
-
-// Expose jQuery and $ identifiers, even in AMD
-// (#7102#comment:10, https://github.com/jquery/jquery/pull/557)
-// and CommonJS for browser emulators (#13566)
-if ( typeof noGlobal === "undefined" ) {
-	window.jQuery = window.$ = jQuery;
-}
-
-
-
-
-return jQuery;
-} );
diff --git a/docs/_build/html/_static/jquery.js b/docs/_build/html/_static/jquery.js
deleted file mode 100644
index c4c6022..0000000
--- a/docs/_build/html/_static/jquery.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */
-!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,g=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},x=function(e){return null!=e&&e===e.window},E=C.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.6.0",S=function(e,t){return new S.fn.init(e,t)};function p(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}S.fn=S.prototype={jquery:f,constructor:S,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=S.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return S.each(this,e)},map:function(n){return this.pushStack(S.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(S.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(S.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},S.extend=S.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||m(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(S.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||S.isPlainObject(n)?n:{},i=!1,a[t]=S.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},S.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=v.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){b(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(p(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},makeArray:function(e,t){var n=t||[];return null!=e&&(p(Object(e))?S.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(p(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:y}),"function"==typeof Symbol&&(S.fn[Symbol.iterator]=t[Symbol.iterator]),S.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var d=function(n){var e,d,b,o,i,h,f,g,w,u,l,T,C,a,E,v,s,c,y,S="sizzle"+1*new Date,p=n.document,k=0,r=0,m=ue(),x=ue(),A=ue(),N=ue(),j=function(e,t){return e===t&&(l=!0),0},D={}.hasOwnProperty,t=[],q=t.pop,L=t.push,H=t.push,O=t.slice,P=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},R="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",I="(?:\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",W="\\["+M+"*("+I+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+I+"))|)"+M+"*\\]",F=":("+I+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+W+")*)|.*)\\)|)",B=new RegExp(M+"+","g"),$=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),_=new RegExp("^"+M+"*,"+M+"*"),z=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp(F),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+F),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(p.childNodes),p.childNodes),t[p.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!N[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&(U.test(t)||z.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&d.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+xe(l[o]);c=l.join(",")}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){N(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:p;return r!=C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),p!=C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.scope=ce(function(e){return a.appendChild(e).appendChild(C.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll(":scope fieldset div").length}),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=S,!C.getElementsByName||!C.getElementsByName(S).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="<a id='"+S+"'></a><select id='"+S+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=C.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push("\\["+M+"*name"+M+"*="+M+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",F)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},j=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e==C||e.ownerDocument==p&&y(p,e)?-1:t==C||t.ownerDocument==p&&y(p,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==C?-1:t==C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]==p?-1:s[r]==p?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if(T(e),d.matchesSelector&&E&&!N[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){N(t,!0)}return 0<se(t,C,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!=C&&T(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!=C&&T(e);var n=b.attrHandle[t.toLowerCase()],r=n&&D.call(b.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:d.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!d.detectDuplicates,u=!d.sortStable&&e.slice(0),e.sort(j),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(b=se.selectors={cacheLength:50,createPseudo:le,match:G,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(B," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),x="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=x&&e.nodeName.toLowerCase(),p=!n&&!x,d=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(x?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++d&&(p&&((i=(o=a[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[k,d]),a===e))break;return(d-=v)===g||d%g==0&&0<=d/g}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=P(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace($,"$1"));return s[S]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return V.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===C.activeElement&&(!C.hasFocus||C.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return J.test(e.nodeName)},input:function(e){return Q.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=de(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=he(e);function me(){}function xe(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function be(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,p=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[k,p];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[S]||(e[S]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===k&&r[1]===p)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Te(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Ce(d,h,g,v,y,e){return v&&!v[S]&&(v=Ce(v)),y&&!y[S]&&(y=Ce(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!d||!e&&h?c:Te(c,s,d,n,r),p=g?y||(e?d:l||v)?[]:t:f;if(g&&g(f,p,n,r),v){i=Te(p,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(p[u[o]]=!(f[u[o]]=a))}if(e){if(y||d){if(y){i=[],o=p.length;while(o--)(a=p[o])&&i.push(f[o]=a);y(null,p=[],i,r)}o=p.length;while(o--)(a=p[o])&&-1<(i=y?P(e,a):s[o])&&(e[i]=!(t[i]=a))}}else p=Te(p===t?p.splice(l,p.length):p),y?y(null,t,p,r):H.apply(t,p)})}function Ee(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=be(function(e){return e===i},a,!0),l=be(function(e){return-1<P(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[be(we(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return Ce(1<s&&we(c),1<s&&xe(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace($,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&xe(e))}c.push(t)}return we(c)}return me.prototype=b.filters=b.pseudos,b.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=x[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=_.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=z.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace($," ")}),a=a.slice(n.length)),b.filter)!(r=G[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):x(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,x,r,i=[],o=[],a=A[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[S]?i.push(a):o.push(a);(a=A(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=k+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t==C||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument==C||(T(o),n=!E);while(s=v[a++])if(s(o,t||C,n)){r.push(o);break}i&&(k=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=q.call(r));f=Te(f)}H.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(k=h,w=p),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=G.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&xe(o)))return H.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},d.sortStable=S.split("").sort(j).join("")===S,d.detectDuplicates=!!l,T(),d.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(C.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),d.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(R,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(C);S.find=d,S.expr=d.selectors,S.expr[":"]=S.expr.pseudos,S.uniqueSort=S.unique=d.uniqueSort,S.text=d.getText,S.isXMLDoc=d.isXML,S.contains=d.contains,S.escapeSelector=d.escape;var h=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&S(e).is(n))break;r.push(e)}return r},T=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},k=S.expr.match.needsContext;function A(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var N=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?S.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?S.grep(e,function(e){return e===n!==r}):"string"!=typeof n?S.grep(e,function(e){return-1<i.call(n,e)!==r}):S.filter(n,e,r)}S.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?S.find.matchesSelector(r,e)?[r]:[]:S.find.matches(e,S.grep(t,function(e){return 1===e.nodeType}))},S.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(S(e).filter(function(){for(t=0;t<r;t++)if(S.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)S.find(e,i[t],n);return 1<r?S.uniqueSort(n):n},filter:function(e){return this.pushStack(j(this,e||[],!1))},not:function(e){return this.pushStack(j(this,e||[],!0))},is:function(e){return!!j(this,"string"==typeof e&&k.test(e)?S(e):e||[],!1).length}});var D,q=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(S.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||D,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:q.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof S?t[0]:t,S.merge(this,S.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),N.test(r[1])&&S.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(S):S.makeArray(e,this)}).prototype=S.fn,D=S(E);var L=/^(?:parents|prev(?:Until|All))/,H={children:!0,contents:!0,next:!0,prev:!0};function O(e,t){while((e=e[t])&&1!==e.nodeType);return e}S.fn.extend({has:function(e){var t=S(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(S.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&S(e);if(!k.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&S.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?S.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(S(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(S.uniqueSort(S.merge(this.get(),S(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),S.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return h(e,"parentNode")},parentsUntil:function(e,t,n){return h(e,"parentNode",n)},next:function(e){return O(e,"nextSibling")},prev:function(e){return O(e,"previousSibling")},nextAll:function(e){return h(e,"nextSibling")},prevAll:function(e){return h(e,"previousSibling")},nextUntil:function(e,t,n){return h(e,"nextSibling",n)},prevUntil:function(e,t,n){return h(e,"previousSibling",n)},siblings:function(e){return T((e.parentNode||{}).firstChild,e)},children:function(e){return T(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(A(e,"template")&&(e=e.content||e),S.merge([],e.childNodes))}},function(r,i){S.fn[r]=function(e,t){var n=S.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=S.filter(t,n)),1<this.length&&(H[r]||S.uniqueSort(n),L.test(r)&&n.reverse()),this.pushStack(n)}});var P=/[^\x20\t\r\n\f]+/g;function R(e){return e}function M(e){throw e}function I(e,t,n,r){var i;try{e&&m(i=e.promise)?i.call(e).done(t).fail(n):e&&m(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}S.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},S.each(e.match(P)||[],function(e,t){n[t]=!0}),n):S.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){S.each(e,function(e,t){m(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==w(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return S.each(arguments,function(e,t){var n;while(-1<(n=S.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<S.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},S.extend({Deferred:function(e){var o=[["notify","progress",S.Callbacks("memory"),S.Callbacks("memory"),2],["resolve","done",S.Callbacks("once memory"),S.Callbacks("once memory"),0,"resolved"],["reject","fail",S.Callbacks("once memory"),S.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return S.Deferred(function(r){S.each(o,function(e,t){var n=m(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&m(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,m(t)?s?t.call(e,l(u,o,R,s),l(u,o,M,s)):(u++,t.call(e,l(u,o,R,s),l(u,o,M,s),l(u,o,R,o.notifyWith))):(a!==R&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){S.Deferred.exceptionHook&&S.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==M&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(S.Deferred.getStackHook&&(t.stackTrace=S.Deferred.getStackHook()),C.setTimeout(t))}}return S.Deferred(function(e){o[0][3].add(l(0,e,m(r)?r:R,e.notifyWith)),o[1][3].add(l(0,e,m(t)?t:R)),o[2][3].add(l(0,e,m(n)?n:M))}).promise()},promise:function(e){return null!=e?S.extend(e,a):a}},s={};return S.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=S.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(I(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||m(i[t]&&i[t].then)))return o.then();while(t--)I(i[t],a(t),o.reject);return o.promise()}});var W=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;S.Deferred.exceptionHook=function(e,t){C.console&&C.console.warn&&e&&W.test(e.name)&&C.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},S.readyException=function(e){C.setTimeout(function(){throw e})};var F=S.Deferred();function B(){E.removeEventListener("DOMContentLoaded",B),C.removeEventListener("load",B),S.ready()}S.fn.ready=function(e){return F.then(e)["catch"](function(e){S.readyException(e)}),this},S.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--S.readyWait:S.isReady)||(S.isReady=!0)!==e&&0<--S.readyWait||F.resolveWith(E,[S])}}),S.ready.then=F.then,"complete"===E.readyState||"loading"!==E.readyState&&!E.documentElement.doScroll?C.setTimeout(S.ready):(E.addEventListener("DOMContentLoaded",B),C.addEventListener("load",B));var $=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===w(n))for(s in i=!0,n)$(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,m(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(S(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},_=/^-ms-/,z=/-([a-z])/g;function U(e,t){return t.toUpperCase()}function X(e){return e.replace(_,"ms-").replace(z,U)}var V=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function G(){this.expando=S.expando+G.uid++}G.uid=1,G.prototype={cache:function(e){var t=e[this.expando];return t||(t={},V(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[X(t)]=n;else for(r in t)i[X(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][X(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(X):(t=X(t))in r?[t]:t.match(P)||[]).length;while(n--)delete r[t[n]]}(void 0===t||S.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!S.isEmptyObject(t)}};var Y=new G,Q=new G,J=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,K=/[A-Z]/g;function Z(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(K,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:J.test(i)?JSON.parse(i):i)}catch(e){}Q.set(e,t,n)}else n=void 0;return n}S.extend({hasData:function(e){return Q.hasData(e)||Y.hasData(e)},data:function(e,t,n){return Q.access(e,t,n)},removeData:function(e,t){Q.remove(e,t)},_data:function(e,t,n){return Y.access(e,t,n)},_removeData:function(e,t){Y.remove(e,t)}}),S.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=Q.get(o),1===o.nodeType&&!Y.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=X(r.slice(5)),Z(o,r,i[r]));Y.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){Q.set(this,n)}):$(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=Q.get(o,n))?t:void 0!==(t=Z(o,n))?t:void 0;this.each(function(){Q.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){Q.remove(this,e)})}}),S.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Y.get(e,t),n&&(!r||Array.isArray(n)?r=Y.access(e,t,S.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=S.queue(e,t),r=n.length,i=n.shift(),o=S._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){S.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:S.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),S.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?S.queue(this[0],t):void 0===n?this:this.each(function(){var e=S.queue(this,t,n);S._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&S.dequeue(this,t)})},dequeue:function(e){return this.each(function(){S.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=S.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var ee=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,te=new RegExp("^(?:([+-])=|)("+ee+")([a-z%]*)$","i"),ne=["Top","Right","Bottom","Left"],re=E.documentElement,ie=function(e){return S.contains(e.ownerDocument,e)},oe={composed:!0};re.getRootNode&&(ie=function(e){return S.contains(e.ownerDocument,e)||e.getRootNode(oe)===e.ownerDocument});var ae=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&ie(e)&&"none"===S.css(e,"display")};function se(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return S.css(e,t,"")},u=s(),l=n&&n[3]||(S.cssNumber[t]?"":"px"),c=e.nodeType&&(S.cssNumber[t]||"px"!==l&&+u)&&te.exec(S.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)S.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,S.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ue={};function le(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Y.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ae(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ue[s])||(o=a.body.appendChild(a.createElement(s)),u=S.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ue[s]=u)))):"none"!==n&&(l[c]="none",Y.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}S.fn.extend({show:function(){return le(this,!0)},hide:function(){return le(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ae(this)?S(this).show():S(this).hide()})}});var ce,fe,pe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i;ce=E.createDocumentFragment().appendChild(E.createElement("div")),(fe=E.createElement("input")).setAttribute("type","radio"),fe.setAttribute("checked","checked"),fe.setAttribute("name","t"),ce.appendChild(fe),y.checkClone=ce.cloneNode(!0).cloneNode(!0).lastChild.checked,ce.innerHTML="<textarea>x</textarea>",y.noCloneChecked=!!ce.cloneNode(!0).lastChild.defaultValue,ce.innerHTML="<option></option>",y.option=!!ce.lastChild;var ge={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?S.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n<r;n++)Y.set(e[n],"globalEval",!t||Y.get(t[n],"globalEval"))}ge.tbody=ge.tfoot=ge.colgroup=ge.caption=ge.thead,ge.th=ge.td,y.option||(ge.optgroup=ge.option=[1,"<select multiple='multiple'>","</select>"]);var me=/<|&#?\w+;/;function xe(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===w(o))S.merge(p,o.nodeType?[o]:o);else if(me.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=ge[s]||ge._default,a.innerHTML=u[1]+S.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;S.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<S.inArray(o,r))i&&i.push(o);else if(l=ie(o),a=ve(f.appendChild(o),"script"),l&&ye(a),n){c=0;while(o=a[c++])he.test(o.type||"")&&n.push(o)}return f}var be=/^([^.]*)(?:\.(.+)|)/;function we(){return!0}function Te(){return!1}function Ce(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ee(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ee(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Te;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return S().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=S.guid++)),e.each(function(){S.event.add(this,t,i,r,n)})}function Se(e,i,o){o?(Y.set(e,i,!1),S.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Y.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(S.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Y.set(this,i,r),t=o(this,i),this[i](),r!==(n=Y.get(this,i))||t?Y.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n&&n.value}else r.length&&(Y.set(this,i,{value:S.event.trigger(S.extend(r[0],S.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Y.get(e,i)&&S.event.add(e,i,we)}S.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.get(t);if(V(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&S.find.matchesSelector(re,i),n.guid||(n.guid=S.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof S&&S.event.triggered!==e.type?S.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(P)||[""]).length;while(l--)d=g=(s=be.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=S.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=S.event.special[d]||{},c=S.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&S.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),S.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.hasData(e)&&Y.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(P)||[""]).length;while(l--)if(d=g=(s=be.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=S.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||S.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)S.event.remove(e,d+t[l],n,r,!0);S.isEmptyObject(u)&&Y.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=S.event.fix(e),l=(Y.get(this,"events")||Object.create(null))[u.type]||[],c=S.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=S.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((S.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<S(i,this).index(l):S.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(S.Event.prototype,t,{enumerable:!0,configurable:!0,get:m(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[S.expando]?e:new S.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click",we),!1},trigger:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click"),!0},_default:function(e){var t=e.target;return pe.test(t.type)&&t.click&&A(t,"input")&&Y.get(t,"click")||A(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},S.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},S.Event=function(e,t){if(!(this instanceof S.Event))return new S.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?we:Te,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&S.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[S.expando]=!0},S.Event.prototype={constructor:S.Event,isDefaultPrevented:Te,isPropagationStopped:Te,isImmediatePropagationStopped:Te,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=we,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=we,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=we,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},S.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:!0},S.event.addProp),S.each({focus:"focusin",blur:"focusout"},function(e,t){S.event.special[e]={setup:function(){return Se(this,e,Ce),!1},trigger:function(){return Se(this,e),!0},_default:function(){return!0},delegateType:t}}),S.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){S.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||S.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),S.fn.extend({on:function(e,t,n,r){return Ee(this,e,t,n,r)},one:function(e,t,n,r){return Ee(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,S(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=Te),this.each(function(){S.event.remove(this,e,n,t)})}});var ke=/<script|<style|<link/i,Ae=/checked\s*(?:[^=]|=\s*.checked.)/i,Ne=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;function je(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&S(e).children("tbody")[0]||e}function De(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function qe(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Le(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)S.event.add(t,i,s[i][n]);Q.hasData(e)&&(o=Q.access(e),a=S.extend({},o),Q.set(t,a))}}function He(n,r,i,o){r=g(r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=m(d);if(h||1<f&&"string"==typeof d&&!y.checkClone&&Ae.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),He(t,r,i,o)});if(f&&(t=(e=xe(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=S.map(ve(e,"script"),De)).length;c<f;c++)u=e,c!==p&&(u=S.clone(u,!0,!0),s&&S.merge(a,ve(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,S.map(a,qe),c=0;c<s;c++)u=a[c],he.test(u.type||"")&&!Y.access(u,"globalEval")&&S.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?S._evalUrl&&!u.noModule&&S._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):b(u.textContent.replace(Ne,""),u,l))}return n}function Oe(e,t,n){for(var r,i=t?S.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||S.cleanData(ve(r)),r.parentNode&&(n&&ie(r)&&ye(ve(r,"script")),r.parentNode.removeChild(r));return e}S.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=ie(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||S.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&pe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ve(e),a=a||ve(c),r=0,i=o.length;r<i;r++)Le(o[r],a[r]);else Le(e,c);return 0<(a=ve(c,"script")).length&&ye(a,!f&&ve(e,"script")),c},cleanData:function(e){for(var t,n,r,i=S.event.special,o=0;void 0!==(n=e[o]);o++)if(V(n)){if(t=n[Y.expando]){if(t.events)for(r in t.events)i[r]?S.event.remove(n,r):S.removeEvent(n,r,t.handle);n[Y.expando]=void 0}n[Q.expando]&&(n[Q.expando]=void 0)}}}),S.fn.extend({detach:function(e){return Oe(this,e,!0)},remove:function(e){return Oe(this,e)},text:function(e){return $(this,function(e){return void 0===e?S.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return He(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||je(this,e).appendChild(e)})},prepend:function(){return He(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=je(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(S.cleanData(ve(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return S.clone(this,e,t)})},html:function(e){return $(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!ke.test(e)&&!ge[(de.exec(e)||["",""])[1].toLowerCase()]){e=S.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(S.cleanData(ve(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return He(this,arguments,function(e){var t=this.parentNode;S.inArray(this,n)<0&&(S.cleanData(ve(this)),t&&t.replaceChild(e,this))},n)}}),S.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){S.fn[e]=function(e){for(var t,n=[],r=S(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),S(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var Pe=new RegExp("^("+ee+")(?!px)[a-z%]+$","i"),Re=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=C),t.getComputedStyle(e)},Me=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Ie=new RegExp(ne.join("|"),"i");function We(e,t,n){var r,i,o,a,s=e.style;return(n=n||Re(e))&&(""!==(a=n.getPropertyValue(t)||n[t])||ie(e)||(a=S.style(e,t)),!y.pixelBoxStyles()&&Pe.test(a)&&Ie.test(t)&&(r=s.width,i=s.minWidth,o=s.maxWidth,s.minWidth=s.maxWidth=s.width=a,a=n.width,s.width=r,s.minWidth=i,s.maxWidth=o)),void 0!==a?a+"":a}function Fe(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",re.appendChild(u).appendChild(l);var e=C.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),re.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=E.createElement("div"),l=E.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",y.clearCloneStyle="content-box"===l.style.backgroundClip,S.extend(y,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=E.createElement("table"),t=E.createElement("tr"),n=E.createElement("div"),e.style.cssText="position:absolute;left:-11111px;border-collapse:separate",t.style.cssText="border:1px solid",t.style.height="1px",n.style.height="9px",n.style.display="block",re.appendChild(e).appendChild(t).appendChild(n),r=C.getComputedStyle(t),a=parseInt(r.height,10)+parseInt(r.borderTopWidth,10)+parseInt(r.borderBottomWidth,10)===t.offsetHeight,re.removeChild(e)),a}}))}();var Be=["Webkit","Moz","ms"],$e=E.createElement("div").style,_e={};function ze(e){var t=S.cssProps[e]||_e[e];return t||(e in $e?e:_e[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=Be.length;while(n--)if((e=Be[n]+t)in $e)return e}(e)||e)}var Ue=/^(none|table(?!-c[ea]).+)/,Xe=/^--/,Ve={position:"absolute",visibility:"hidden",display:"block"},Ge={letterSpacing:"0",fontWeight:"400"};function Ye(e,t,n){var r=te.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function Qe(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=S.css(e,n+ne[a],!0,i)),r?("content"===n&&(u-=S.css(e,"padding"+ne[a],!0,i)),"margin"!==n&&(u-=S.css(e,"border"+ne[a]+"Width",!0,i))):(u+=S.css(e,"padding"+ne[a],!0,i),"padding"!==n?u+=S.css(e,"border"+ne[a]+"Width",!0,i):s+=S.css(e,"border"+ne[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function Je(e,t,n){var r=Re(e),i=(!y.boxSizingReliable()||n)&&"border-box"===S.css(e,"boxSizing",!1,r),o=i,a=We(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(Pe.test(a)){if(!n)return a;a="auto"}return(!y.boxSizingReliable()&&i||!y.reliableTrDimensions()&&A(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===S.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===S.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+Qe(e,t,n||(i?"border":"content"),o,r,a)+"px"}function Ke(e,t,n,r,i){return new Ke.prototype.init(e,t,n,r,i)}S.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=We(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=X(t),u=Xe.test(t),l=e.style;if(u||(t=ze(s)),a=S.cssHooks[t]||S.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=te.exec(n))&&i[1]&&(n=se(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(S.cssNumber[s]?"":"px")),y.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=X(t);return Xe.test(t)||(t=ze(s)),(a=S.cssHooks[t]||S.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=We(e,t,r)),"normal"===i&&t in Ge&&(i=Ge[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),S.each(["height","width"],function(e,u){S.cssHooks[u]={get:function(e,t,n){if(t)return!Ue.test(S.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?Je(e,u,n):Me(e,Ve,function(){return Je(e,u,n)})},set:function(e,t,n){var r,i=Re(e),o=!y.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===S.css(e,"boxSizing",!1,i),s=n?Qe(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-Qe(e,u,"border",!1,i)-.5)),s&&(r=te.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=S.css(e,u)),Ye(0,t,s)}}}),S.cssHooks.marginLeft=Fe(y.reliableMarginLeft,function(e,t){if(t)return(parseFloat(We(e,"marginLeft"))||e.getBoundingClientRect().left-Me(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),S.each({margin:"",padding:"",border:"Width"},function(i,o){S.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+ne[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(S.cssHooks[i+o].set=Ye)}),S.fn.extend({css:function(e,t){return $(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Re(e),i=t.length;a<i;a++)o[t[a]]=S.css(e,t[a],!1,r);return o}return void 0!==n?S.style(e,t,n):S.css(e,t)},e,t,1<arguments.length)}}),((S.Tween=Ke).prototype={constructor:Ke,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||S.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(S.cssNumber[n]?"":"px")},cur:function(){var e=Ke.propHooks[this.prop];return e&&e.get?e.get(this):Ke.propHooks._default.get(this)},run:function(e){var t,n=Ke.propHooks[this.prop];return this.options.duration?this.pos=t=S.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):Ke.propHooks._default.set(this),this}}).init.prototype=Ke.prototype,(Ke.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=S.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){S.fx.step[e.prop]?S.fx.step[e.prop](e):1!==e.elem.nodeType||!S.cssHooks[e.prop]&&null==e.elem.style[ze(e.prop)]?e.elem[e.prop]=e.now:S.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=Ke.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},S.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},S.fx=Ke.prototype.init,S.fx.step={};var Ze,et,tt,nt,rt=/^(?:toggle|show|hide)$/,it=/queueHooks$/;function ot(){et&&(!1===E.hidden&&C.requestAnimationFrame?C.requestAnimationFrame(ot):C.setTimeout(ot,S.fx.interval),S.fx.tick())}function at(){return C.setTimeout(function(){Ze=void 0}),Ze=Date.now()}function st(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=ne[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function ut(e,t,n){for(var r,i=(lt.tweeners[t]||[]).concat(lt.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function lt(o,e,t){var n,a,r=0,i=lt.prefilters.length,s=S.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=Ze||at(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:S.extend({},e),opts:S.extend(!0,{specialEasing:{},easing:S.easing._default},t),originalProperties:e,originalOptions:t,startTime:Ze||at(),duration:t.duration,tweens:[],createTween:function(e,t){var n=S.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=X(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=S.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=lt.prefilters[r].call(l,o,c,l.opts))return m(n.stop)&&(S._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return S.map(c,ut,l),m(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),S.fx.timer(S.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}S.Animation=S.extend(lt,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return se(n.elem,e,te.exec(t),n),n}]},tweener:function(e,t){m(e)?(t=e,e=["*"]):e=e.match(P);for(var n,r=0,i=e.length;r<i;r++)n=e[r],lt.tweeners[n]=lt.tweeners[n]||[],lt.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&ae(e),v=Y.get(e,"fxshow");for(r in n.queue||(null==(a=S._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,S.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],rt.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||S.style(e,r)}if((u=!S.isEmptyObject(t))||!S.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=Y.get(e,"display")),"none"===(c=S.css(e,"display"))&&(l?c=l:(le([e],!0),l=e.style.display||l,c=S.css(e,"display"),le([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===S.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=Y.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&le([e],!0),p.done(function(){for(r in g||le([e]),Y.remove(e,"fxshow"),d)S.style(e,r,d[r])})),u=ut(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?lt.prefilters.unshift(e):lt.prefilters.push(e)}}),S.speed=function(e,t,n){var r=e&&"object"==typeof e?S.extend({},e):{complete:n||!n&&t||m(e)&&e,duration:e,easing:n&&t||t&&!m(t)&&t};return S.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in S.fx.speeds?r.duration=S.fx.speeds[r.duration]:r.duration=S.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){m(r.old)&&r.old.call(this),r.queue&&S.dequeue(this,r.queue)},r},S.fn.extend({fadeTo:function(e,t,n,r){return this.filter(ae).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=S.isEmptyObject(t),o=S.speed(e,n,r),a=function(){var e=lt(this,S.extend({},t),o);(i||Y.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=S.timers,r=Y.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&it.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||S.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=Y.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=S.timers,o=n?n.length:0;for(t.finish=!0,S.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),S.each(["toggle","show","hide"],function(e,r){var i=S.fn[r];S.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(st(r,!0),e,t,n)}}),S.each({slideDown:st("show"),slideUp:st("hide"),slideToggle:st("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){S.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),S.timers=[],S.fx.tick=function(){var e,t=0,n=S.timers;for(Ze=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||S.fx.stop(),Ze=void 0},S.fx.timer=function(e){S.timers.push(e),S.fx.start()},S.fx.interval=13,S.fx.start=function(){et||(et=!0,ot())},S.fx.stop=function(){et=null},S.fx.speeds={slow:600,fast:200,_default:400},S.fn.delay=function(r,e){return r=S.fx&&S.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=C.setTimeout(e,r);t.stop=function(){C.clearTimeout(n)}})},tt=E.createElement("input"),nt=E.createElement("select").appendChild(E.createElement("option")),tt.type="checkbox",y.checkOn=""!==tt.value,y.optSelected=nt.selected,(tt=E.createElement("input")).value="t",tt.type="radio",y.radioValue="t"===tt.value;var ct,ft=S.expr.attrHandle;S.fn.extend({attr:function(e,t){return $(this,S.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){S.removeAttr(this,e)})}}),S.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?S.prop(e,t,n):(1===o&&S.isXMLDoc(e)||(i=S.attrHooks[t.toLowerCase()]||(S.expr.match.bool.test(t)?ct:void 0)),void 0!==n?null===n?void S.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=S.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!y.radioValue&&"radio"===t&&A(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(P);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),ct={set:function(e,t,n){return!1===t?S.removeAttr(e,n):e.setAttribute(n,n),n}},S.each(S.expr.match.bool.source.match(/\w+/g),function(e,t){var a=ft[t]||S.find.attr;ft[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=ft[o],ft[o]=r,r=null!=a(e,t,n)?o:null,ft[o]=i),r}});var pt=/^(?:input|select|textarea|button)$/i,dt=/^(?:a|area)$/i;function ht(e){return(e.match(P)||[]).join(" ")}function gt(e){return e.getAttribute&&e.getAttribute("class")||""}function vt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(P)||[]}S.fn.extend({prop:function(e,t){return $(this,S.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[S.propFix[e]||e]})}}),S.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&S.isXMLDoc(e)||(t=S.propFix[t]||t,i=S.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=S.find.attr(e,"tabindex");return t?parseInt(t,10):pt.test(e.nodeName)||dt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),y.optSelected||(S.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),S.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){S.propFix[this.toLowerCase()]=this}),S.fn.extend({addClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).addClass(t.call(this,e,gt(this)))});if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])r.indexOf(" "+o+" ")<0&&(r+=o+" ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},removeClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).removeClass(t.call(this,e,gt(this)))});if(!arguments.length)return this.attr("class","");if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])while(-1<r.indexOf(" "+o+" "))r=r.replace(" "+o+" "," ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},toggleClass:function(i,t){var o=typeof i,a="string"===o||Array.isArray(i);return"boolean"==typeof t&&a?t?this.addClass(i):this.removeClass(i):m(i)?this.each(function(e){S(this).toggleClass(i.call(this,e,gt(this),t),t)}):this.each(function(){var e,t,n,r;if(a){t=0,n=S(this),r=vt(i);while(e=r[t++])n.hasClass(e)?n.removeClass(e):n.addClass(e)}else void 0!==i&&"boolean"!==o||((e=gt(this))&&Y.set(this,"__className__",e),this.setAttribute&&this.setAttribute("class",e||!1===i?"":Y.get(this,"__className__")||""))})},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+ht(gt(n))+" ").indexOf(t))return!0;return!1}});var yt=/\r/g;S.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=m(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,S(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=S.map(t,function(e){return null==e?"":e+""})),(r=S.valHooks[this.type]||S.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=S.valHooks[t.type]||S.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(yt,""):null==e?"":e:void 0}}),S.extend({valHooks:{option:{get:function(e){var t=S.find.attr(e,"value");return null!=t?t:ht(S.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!A(n.parentNode,"optgroup"))){if(t=S(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=S.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<S.inArray(S.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),S.each(["radio","checkbox"],function(){S.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<S.inArray(S(e).val(),t)}},y.checkOn||(S.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),y.focusin="onfocusin"in C;var mt=/^(?:focusinfocus|focusoutblur)$/,xt=function(e){e.stopPropagation()};S.extend(S.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||E],d=v.call(e,"type")?e.type:e,h=v.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||E,3!==n.nodeType&&8!==n.nodeType&&!mt.test(d+S.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[S.expando]?e:new S.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:S.makeArray(t,[e]),c=S.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||d,mt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||E)&&p.push(a.defaultView||a.parentWindow||C)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(Y.get(o,"events")||Object.create(null))[e.type]&&Y.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&V(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!V(n)||u&&m(n[d])&&!x(n)&&((a=n[u])&&(n[u]=null),S.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,xt),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,xt),S.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=S.extend(new S.Event,n,{type:e,isSimulated:!0});S.event.trigger(r,null,t)}}),S.fn.extend({trigger:function(e,t){return this.each(function(){S.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return S.event.trigger(e,t,n,!0)}}),y.focusin||S.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){S.event.simulate(r,e.target,S.event.fix(e))};S.event.special[r]={setup:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r);t||e.addEventListener(n,i,!0),Y.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r)-1;t?Y.access(e,r,t):(e.removeEventListener(n,i,!0),Y.remove(e,r))}}});var bt=C.location,wt={guid:Date.now()},Tt=/\?/;S.parseXML=function(e){var t,n;if(!e||"string"!=typeof e)return null;try{t=(new C.DOMParser).parseFromString(e,"text/xml")}catch(e){}return n=t&&t.getElementsByTagName("parsererror")[0],t&&!n||S.error("Invalid XML: "+(n?S.map(n.childNodes,function(e){return e.textContent}).join("\n"):e)),t};var Ct=/\[\]$/,Et=/\r?\n/g,St=/^(?:submit|button|image|reset|file)$/i,kt=/^(?:input|select|textarea|keygen)/i;function At(n,e,r,i){var t;if(Array.isArray(e))S.each(e,function(e,t){r||Ct.test(n)?i(n,t):At(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==w(e))i(n,e);else for(t in e)At(n+"["+t+"]",e[t],r,i)}S.param=function(e,t){var n,r=[],i=function(e,t){var n=m(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!S.isPlainObject(e))S.each(e,function(){i(this.name,this.value)});else for(n in e)At(n,e[n],t,i);return r.join("&")},S.fn.extend({serialize:function(){return S.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=S.prop(this,"elements");return e?S.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!S(this).is(":disabled")&&kt.test(this.nodeName)&&!St.test(e)&&(this.checked||!pe.test(e))}).map(function(e,t){var n=S(this).val();return null==n?null:Array.isArray(n)?S.map(n,function(e){return{name:t.name,value:e.replace(Et,"\r\n")}}):{name:t.name,value:n.replace(Et,"\r\n")}}).get()}});var Nt=/%20/g,jt=/#.*$/,Dt=/([?&])_=[^&]*/,qt=/^(.*?):[ \t]*([^\r\n]*)$/gm,Lt=/^(?:GET|HEAD)$/,Ht=/^\/\//,Ot={},Pt={},Rt="*/".concat("*"),Mt=E.createElement("a");function It(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(P)||[];if(m(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function Wt(t,i,o,a){var s={},u=t===Pt;function l(e){var r;return s[e]=!0,S.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function Ft(e,t){var n,r,i=S.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&S.extend(!0,e,r),e}Mt.href=bt.href,S.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:bt.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(bt.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":Rt,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":S.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?Ft(Ft(e,S.ajaxSettings),t):Ft(S.ajaxSettings,e)},ajaxPrefilter:It(Ot),ajaxTransport:It(Pt),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=S.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?S(y):S.event,x=S.Deferred(),b=S.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=qt.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||bt.href)+"").replace(Ht,bt.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(P)||[""],null==v.crossDomain){r=E.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Mt.protocol+"//"+Mt.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=S.param(v.data,v.traditional)),Wt(Ot,v,t,T),h)return T;for(i in(g=S.event&&v.global)&&0==S.active++&&S.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Lt.test(v.type),f=v.url.replace(jt,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(Nt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(Tt.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(Dt,"$1"),o=(Tt.test(f)?"&":"?")+"_="+wt.guid+++o),v.url=f+o),v.ifModified&&(S.lastModified[f]&&T.setRequestHeader("If-Modified-Since",S.lastModified[f]),S.etag[f]&&T.setRequestHeader("If-None-Match",S.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+Rt+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=Wt(Pt,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=C.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&C.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<S.inArray("script",v.dataTypes)&&S.inArray("json",v.dataTypes)<0&&(v.converters["text script"]=function(){}),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(S.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(S.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--S.active||S.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return S.get(e,t,n,"json")},getScript:function(e,t){return S.get(e,void 0,t,"script")}}),S.each(["get","post"],function(e,i){S[i]=function(e,t,n,r){return m(t)&&(r=r||n,n=t,t=void 0),S.ajax(S.extend({url:e,type:i,dataType:r,data:t,success:n},S.isPlainObject(e)&&e))}}),S.ajaxPrefilter(function(e){var t;for(t in e.headers)"content-type"===t.toLowerCase()&&(e.contentType=e.headers[t]||"")}),S._evalUrl=function(e,t,n){return S.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){S.globalEval(e,t,n)}})},S.fn.extend({wrapAll:function(e){var t;return this[0]&&(m(e)&&(e=e.call(this[0])),t=S(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return m(n)?this.each(function(e){S(this).wrapInner(n.call(this,e))}):this.each(function(){var e=S(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=m(t);return this.each(function(e){S(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){S(this).replaceWith(this.childNodes)}),this}}),S.expr.pseudos.hidden=function(e){return!S.expr.pseudos.visible(e)},S.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},S.ajaxSettings.xhr=function(){try{return new C.XMLHttpRequest}catch(e){}};var Bt={0:200,1223:204},$t=S.ajaxSettings.xhr();y.cors=!!$t&&"withCredentials"in $t,y.ajax=$t=!!$t,S.ajaxTransport(function(i){var o,a;if(y.cors||$t&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(Bt[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&C.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),S.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),S.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return S.globalEval(e),e}}}),S.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),S.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=S("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var _t,zt=[],Ut=/(=)\?(?=&|$)|\?\?/;S.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=zt.pop()||S.expando+"_"+wt.guid++;return this[e]=!0,e}}),S.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Ut.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Ut.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Ut,"$1"+r):!1!==e.jsonp&&(e.url+=(Tt.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||S.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?S(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,zt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((_t=E.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===_t.childNodes.length),S.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=N.exec(e))?[t.createElement(i[1])]:(i=xe([e],t,o),o&&o.length&&S(o).remove(),S.merge([],i.childNodes)));var r,i,o},S.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=ht(e.slice(s)),e=e.slice(0,s)),m(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&S.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?S("<div>").append(S.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},S.expr.pseudos.animated=function(t){return S.grep(S.timers,function(e){return t===e.elem}).length},S.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=S.css(e,"position"),c=S(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=S.css(e,"top"),u=S.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,S.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},S.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){S.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===S.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===S.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=S(e).offset()).top+=S.css(e,"borderTopWidth",!0),i.left+=S.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-S.css(r,"marginTop",!0),left:t.left-i.left-S.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===S.css(e,"position"))e=e.offsetParent;return e||re})}}),S.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;S.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),S.each(["top","left"],function(e,n){S.cssHooks[n]=Fe(y.pixelPosition,function(e,t){if(t)return t=We(e,n),Pe.test(t)?S(e).position()[n]+"px":t})}),S.each({Height:"height",Width:"width"},function(a,s){S.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){S.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?S.css(e,t,i):S.style(e,t,n,i)},s,n?e:void 0,n)}})}),S.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){S.fn[t]=function(e){return this.on(t,e)}}),S.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),S.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){S.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var Xt=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;S.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),m(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||S.guid++,i},S.holdReady=function(e){e?S.readyWait++:S.ready(!0)},S.isArray=Array.isArray,S.parseJSON=JSON.parse,S.nodeName=A,S.isFunction=m,S.isWindow=x,S.camelCase=X,S.type=w,S.now=Date.now,S.isNumeric=function(e){var t=S.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},S.trim=function(e){return null==e?"":(e+"").replace(Xt,"")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return S});var Vt=C.jQuery,Gt=C.$;return S.noConflict=function(e){return C.$===S&&(C.$=Gt),e&&C.jQuery===S&&(C.jQuery=Vt),S},"undefined"==typeof e&&(C.jQuery=C.$=S),S});
diff --git a/docs/_build/html/_static/language_data.js b/docs/_build/html/_static/language_data.js
deleted file mode 100644
index 2e22b06..0000000
--- a/docs/_build/html/_static/language_data.js
+++ /dev/null
@@ -1,199 +0,0 @@
-/*
- * language_data.js
- * ~~~~~~~~~~~~~~~~
- *
- * This script contains the language-specific data used by searchtools.js,
- * namely the list of stopwords, stemmer, scorer and splitter.
- *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
- * :license: BSD, see LICENSE for details.
- *
- */
-
-var stopwords = ["a", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "near", "no", "not", "of", "on", "or", "such", "that", "the", "their", "then", "there", "these", "they", "this", "to", "was", "will", "with"];
-
-
-/* Non-minified version is copied as a separate JS file, is available */
-
-/**
- * Porter Stemmer
- */
-var Stemmer = function() {
-
-  var step2list = {
-    ational: 'ate',
-    tional: 'tion',
-    enci: 'ence',
-    anci: 'ance',
-    izer: 'ize',
-    bli: 'ble',
-    alli: 'al',
-    entli: 'ent',
-    eli: 'e',
-    ousli: 'ous',
-    ization: 'ize',
-    ation: 'ate',
-    ator: 'ate',
-    alism: 'al',
-    iveness: 'ive',
-    fulness: 'ful',
-    ousness: 'ous',
-    aliti: 'al',
-    iviti: 'ive',
-    biliti: 'ble',
-    logi: 'log'
-  };
-
-  var step3list = {
-    icate: 'ic',
-    ative: '',
-    alize: 'al',
-    iciti: 'ic',
-    ical: 'ic',
-    ful: '',
-    ness: ''
-  };
-
-  var c = "[^aeiou]";          // consonant
-  var v = "[aeiouy]";          // vowel
-  var C = c + "[^aeiouy]*";    // consonant sequence
-  var V = v + "[aeiou]*";      // vowel sequence
-
-  var mgr0 = "^(" + C + ")?" + V + C;                      // [C]VC... is m>0
-  var meq1 = "^(" + C + ")?" + V + C + "(" + V + ")?$";    // [C]VC[V] is m=1
-  var mgr1 = "^(" + C + ")?" + V + C + V + C;              // [C]VCVC... is m>1
-  var s_v   = "^(" + C + ")?" + v;                         // vowel in stem
-
-  this.stemWord = function (w) {
-    var stem;
-    var suffix;
-    var firstch;
-    var origword = w;
-
-    if (w.length < 3)
-      return w;
-
-    var re;
-    var re2;
-    var re3;
-    var re4;
-
-    firstch = w.substr(0,1);
-    if (firstch == "y")
-      w = firstch.toUpperCase() + w.substr(1);
-
-    // Step 1a
-    re = /^(.+?)(ss|i)es$/;
-    re2 = /^(.+?)([^s])s$/;
-
-    if (re.test(w))
-      w = w.replace(re,"$1$2");
-    else if (re2.test(w))
-      w = w.replace(re2,"$1$2");
-
-    // Step 1b
-    re = /^(.+?)eed$/;
-    re2 = /^(.+?)(ed|ing)$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      re = new RegExp(mgr0);
-      if (re.test(fp[1])) {
-        re = /.$/;
-        w = w.replace(re,"");
-      }
-    }
-    else if (re2.test(w)) {
-      var fp = re2.exec(w);
-      stem = fp[1];
-      re2 = new RegExp(s_v);
-      if (re2.test(stem)) {
-        w = stem;
-        re2 = /(at|bl|iz)$/;
-        re3 = new RegExp("([^aeiouylsz])\\1$");
-        re4 = new RegExp("^" + C + v + "[^aeiouwxy]$");
-        if (re2.test(w))
-          w = w + "e";
-        else if (re3.test(w)) {
-          re = /.$/;
-          w = w.replace(re,"");
-        }
-        else if (re4.test(w))
-          w = w + "e";
-      }
-    }
-
-    // Step 1c
-    re = /^(.+?)y$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      stem = fp[1];
-      re = new RegExp(s_v);
-      if (re.test(stem))
-        w = stem + "i";
-    }
-
-    // Step 2
-    re = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      stem = fp[1];
-      suffix = fp[2];
-      re = new RegExp(mgr0);
-      if (re.test(stem))
-        w = stem + step2list[suffix];
-    }
-
-    // Step 3
-    re = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      stem = fp[1];
-      suffix = fp[2];
-      re = new RegExp(mgr0);
-      if (re.test(stem))
-        w = stem + step3list[suffix];
-    }
-
-    // Step 4
-    re = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;
-    re2 = /^(.+?)(s|t)(ion)$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      stem = fp[1];
-      re = new RegExp(mgr1);
-      if (re.test(stem))
-        w = stem;
-    }
-    else if (re2.test(w)) {
-      var fp = re2.exec(w);
-      stem = fp[1] + fp[2];
-      re2 = new RegExp(mgr1);
-      if (re2.test(stem))
-        w = stem;
-    }
-
-    // Step 5
-    re = /^(.+?)e$/;
-    if (re.test(w)) {
-      var fp = re.exec(w);
-      stem = fp[1];
-      re = new RegExp(mgr1);
-      re2 = new RegExp(meq1);
-      re3 = new RegExp("^" + C + v + "[^aeiouwxy]$");
-      if (re.test(stem) || (re2.test(stem) && !(re3.test(stem))))
-        w = stem;
-    }
-    re = /ll$/;
-    re2 = new RegExp(mgr1);
-    if (re.test(w) && re2.test(w)) {
-      re = /.$/;
-      w = w.replace(re,"");
-    }
-
-    // and turn initial Y back to y
-    if (firstch == "y")
-      w = firstch.toLowerCase() + w.substr(1);
-    return w;
-  }
-}
-
diff --git a/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 15541a6..0000000
Binary files a/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 2e8d682..0000000
--- a/docs/_build/html/_static/locales/ar/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ar\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "أقترح تحرير"
-
-msgid "Last updated on"
-msgstr "آخر تحديث في"
-
-msgid "Edit this page"
-msgstr "قم بتحرير هذه الصفحة"
-
-msgid "Launch"
-msgstr "إطلاق"
-
-msgid "Print to PDF"
-msgstr "طباعة إلى PDF"
-
-msgid "open issue"
-msgstr "قضية مفتوحة"
-
-msgid "Download notebook file"
-msgstr "تنزيل ملف دفتر الملاحظات"
-
-msgid "Toggle navigation"
-msgstr "تبديل التنقل"
-
-msgid "Source repository"
-msgstr "مستودع المصدر"
-
-msgid "By the"
-msgstr "بواسطة"
-
-msgid "next page"
-msgstr "الصفحة التالية"
-
-msgid "repository"
-msgstr "مخزن"
-
-msgid "Sphinx Book Theme"
-msgstr "موضوع كتاب أبو الهول"
-
-msgid "Download source file"
-msgstr "تنزيل ملف المصدر"
-
-msgid "Contents"
-msgstr "محتويات"
-
-msgid "By"
-msgstr "بواسطة"
-
-msgid "Copyright"
-msgstr "حقوق النشر"
-
-msgid "Fullscreen mode"
-msgstr "وضع ملء الشاشة"
-
-msgid "Open an issue"
-msgstr "افتح قضية"
-
-msgid "previous page"
-msgstr "الصفحة السابقة"
-
-msgid "Download this page"
-msgstr "قم بتنزيل هذه الصفحة"
-
-msgid "Theme by the"
-msgstr "موضوع بواسطة"
diff --git a/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index da95120..0000000
Binary files a/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 56ef0eb..0000000
--- a/docs/_build/html/_static/locales/bg/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: bg\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "предложи редактиране"
-
-msgid "Last updated on"
-msgstr "Последна актуализация на"
-
-msgid "Edit this page"
-msgstr "Редактирайте тази страница"
-
-msgid "Launch"
-msgstr "Стартиране"
-
-msgid "Print to PDF"
-msgstr "Печат в PDF"
-
-msgid "open issue"
-msgstr "отворен брой"
-
-msgid "Download notebook file"
-msgstr "Изтеглете файла на бележника"
-
-msgid "Toggle navigation"
-msgstr "Превключване на навигацията"
-
-msgid "Source repository"
-msgstr "Хранилище на източника"
-
-msgid "By the"
-msgstr "По"
-
-msgid "next page"
-msgstr "Следваща страница"
-
-msgid "repository"
-msgstr "хранилище"
-
-msgid "Sphinx Book Theme"
-msgstr "Тема на книгата Sphinx"
-
-msgid "Download source file"
-msgstr "Изтеглете изходния файл"
-
-msgid "Contents"
-msgstr "Съдържание"
-
-msgid "By"
-msgstr "От"
-
-msgid "Copyright"
-msgstr "Авторско право"
-
-msgid "Fullscreen mode"
-msgstr "Режим на цял екран"
-
-msgid "Open an issue"
-msgstr "Отворете проблем"
-
-msgid "previous page"
-msgstr "предишна страница"
-
-msgid "Download this page"
-msgstr "Изтеглете тази страница"
-
-msgid "Theme by the"
-msgstr "Тема от"
diff --git a/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 6b96639..0000000
Binary files a/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 243ca31..0000000
--- a/docs/_build/html/_static/locales/bn/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,63 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: bn\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "Last updated on"
-msgstr "সর্বশেষ আপডেট"
-
-msgid "Edit this page"
-msgstr "এই পৃষ্ঠাটি সম্পাদনা করুন"
-
-msgid "Launch"
-msgstr "শুরু করা"
-
-msgid "Print to PDF"
-msgstr "পিডিএফ প্রিন্ট করুন"
-
-msgid "open issue"
-msgstr "খোলা সমস্যা"
-
-msgid "Download notebook file"
-msgstr "নোটবুক ফাইল ডাউনলোড করুন"
-
-msgid "Toggle navigation"
-msgstr "নেভিগেশন টগল করুন"
-
-msgid "Source repository"
-msgstr "উত্স সংগ্রহস্থল"
-
-msgid "By the"
-msgstr "দ্বারা"
-
-msgid "next page"
-msgstr "পরবর্তী পৃষ্ঠা"
-
-msgid "Sphinx Book Theme"
-msgstr "স্পিনিক্স বুক থিম"
-
-msgid "Download source file"
-msgstr "উত্স ফাইল ডাউনলোড করুন"
-
-msgid "By"
-msgstr "দ্বারা"
-
-msgid "Copyright"
-msgstr "কপিরাইট"
-
-msgid "Open an issue"
-msgstr "একটি সমস্যা খুলুন"
-
-msgid "previous page"
-msgstr "আগের পৃষ্ঠা"
-
-msgid "Download this page"
-msgstr "এই পৃষ্ঠাটি ডাউনলোড করুন"
-
-msgid "Theme by the"
-msgstr "থিম দ্বারা"
diff --git a/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index a4dd30e..0000000
Binary files a/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.po
deleted file mode 100644
index b27a13d..0000000
--- a/docs/_build/html/_static/locales/ca/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ca\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "suggerir edició"
-
-msgid "Last updated on"
-msgstr "Darrera actualització el"
-
-msgid "Edit this page"
-msgstr "Editeu aquesta pàgina"
-
-msgid "Launch"
-msgstr "Llançament"
-
-msgid "Print to PDF"
-msgstr "Imprimeix a PDF"
-
-msgid "open issue"
-msgstr "número obert"
-
-msgid "Download notebook file"
-msgstr "Descarregar fitxer de quadern"
-
-msgid "Toggle navigation"
-msgstr "Commuta la navegació"
-
-msgid "Source repository"
-msgstr "Dipòsit de fonts"
-
-msgid "By the"
-msgstr "Per la"
-
-msgid "next page"
-msgstr "pàgina següent"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema del llibre Esfinx"
-
-msgid "Download source file"
-msgstr "Baixeu el fitxer font"
-
-msgid "By"
-msgstr "Per"
-
-msgid "Copyright"
-msgstr "Copyright"
-
-msgid "Open an issue"
-msgstr "Obriu un número"
-
-msgid "previous page"
-msgstr "Pàgina anterior"
-
-msgid "Download this page"
-msgstr "Descarregueu aquesta pàgina"
-
-msgid "Theme by the"
-msgstr "Tema del"
diff --git a/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index c39e01a..0000000
Binary files a/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 3818df9..0000000
--- a/docs/_build/html/_static/locales/cs/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: cs\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "navrhnout úpravy"
-
-msgid "Last updated on"
-msgstr "Naposledy aktualizováno"
-
-msgid "Edit this page"
-msgstr "Upravit tuto stránku"
-
-msgid "Launch"
-msgstr "Zahájení"
-
-msgid "Print to PDF"
-msgstr "Tisk do PDF"
-
-msgid "open issue"
-msgstr "otevřené číslo"
-
-msgid "Download notebook file"
-msgstr "Stáhnout soubor poznámkového bloku"
-
-msgid "Toggle navigation"
-msgstr "Přepnout navigaci"
-
-msgid "Source repository"
-msgstr "Zdrojové úložiště"
-
-msgid "By the"
-msgstr "Podle"
-
-msgid "next page"
-msgstr "další strana"
-
-msgid "repository"
-msgstr "úložiště"
-
-msgid "Sphinx Book Theme"
-msgstr "Téma knihy Sfinga"
-
-msgid "Download source file"
-msgstr "Stáhněte si zdrojový soubor"
-
-msgid "Contents"
-msgstr "Obsah"
-
-msgid "By"
-msgstr "Podle"
-
-msgid "Copyright"
-msgstr "autorská práva"
-
-msgid "Fullscreen mode"
-msgstr "Režim celé obrazovky"
-
-msgid "Open an issue"
-msgstr "Otevřete problém"
-
-msgid "previous page"
-msgstr "předchozí stránka"
-
-msgid "Download this page"
-msgstr "Stáhněte si tuto stránku"
-
-msgid "Theme by the"
-msgstr "Téma od"
diff --git a/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index f43157d..0000000
Binary files a/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 7f20a3b..0000000
--- a/docs/_build/html/_static/locales/da/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: da\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "foreslå redigering"
-
-msgid "Last updated on"
-msgstr "Sidst opdateret den"
-
-msgid "Edit this page"
-msgstr "Rediger denne side"
-
-msgid "Launch"
-msgstr "Start"
-
-msgid "Print to PDF"
-msgstr "Udskriv til PDF"
-
-msgid "open issue"
-msgstr "åbent nummer"
-
-msgid "Download notebook file"
-msgstr "Download notesbog-fil"
-
-msgid "Toggle navigation"
-msgstr "Skift navigation"
-
-msgid "Source repository"
-msgstr "Kildelager"
-
-msgid "By the"
-msgstr "Ved"
-
-msgid "next page"
-msgstr "Næste side"
-
-msgid "repository"
-msgstr "lager"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx bogtema"
-
-msgid "Download source file"
-msgstr "Download kildefil"
-
-msgid "Contents"
-msgstr "Indhold"
-
-msgid "By"
-msgstr "Ved"
-
-msgid "Copyright"
-msgstr "ophavsret"
-
-msgid "Fullscreen mode"
-msgstr "Fuldskærmstilstand"
-
-msgid "Open an issue"
-msgstr "Åbn et problem"
-
-msgid "previous page"
-msgstr "forrige side"
-
-msgid "Download this page"
-msgstr "Download denne side"
-
-msgid "Theme by the"
-msgstr "Tema af"
diff --git a/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 648b565..0000000
Binary files a/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.po
deleted file mode 100644
index c0027d3..0000000
--- a/docs/_build/html/_static/locales/de/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: de\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "vorschlagen zu bearbeiten"
-
-msgid "Last updated on"
-msgstr "Zuletzt aktualisiert am"
-
-msgid "Edit this page"
-msgstr "Bearbeite diese Seite"
-
-msgid "Launch"
-msgstr "Starten"
-
-msgid "Print to PDF"
-msgstr "In PDF drucken"
-
-msgid "open issue"
-msgstr "offenes Thema"
-
-msgid "Download notebook file"
-msgstr "Notebook-Datei herunterladen"
-
-msgid "Toggle navigation"
-msgstr "Navigation umschalten"
-
-msgid "Source repository"
-msgstr "Quell-Repository"
-
-msgid "By the"
-msgstr "Bis zum"
-
-msgid "next page"
-msgstr "Nächste Seite"
-
-msgid "repository"
-msgstr "Repository"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx-Buch-Thema"
-
-msgid "Download source file"
-msgstr "Quelldatei herunterladen"
-
-msgid "Contents"
-msgstr "Inhalt"
-
-msgid "By"
-msgstr "Durch"
-
-msgid "Copyright"
-msgstr "Urheberrechte ©"
-
-msgid "Fullscreen mode"
-msgstr "Vollbildmodus"
-
-msgid "Open an issue"
-msgstr "Öffnen Sie ein Problem"
-
-msgid "previous page"
-msgstr "vorherige Seite"
-
-msgid "Download this page"
-msgstr "Laden Sie diese Seite herunter"
-
-msgid "Theme by the"
-msgstr "Thema von der"
diff --git a/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index fca6e93..0000000
Binary files a/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.po
deleted file mode 100644
index bdeb327..0000000
--- a/docs/_build/html/_static/locales/el/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: el\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "προτείνω επεξεργασία"
-
-msgid "Last updated on"
-msgstr "Τελευταία ενημέρωση στις"
-
-msgid "Edit this page"
-msgstr "Επεξεργαστείτε αυτήν τη σελίδα"
-
-msgid "Launch"
-msgstr "Εκτόξευση"
-
-msgid "Print to PDF"
-msgstr "Εκτύπωση σε PDF"
-
-msgid "open issue"
-msgstr "ανοιχτό ζήτημα"
-
-msgid "Download notebook file"
-msgstr "Λήψη αρχείου σημειωματάριου"
-
-msgid "Toggle navigation"
-msgstr "Εναλλαγή πλοήγησης"
-
-msgid "Source repository"
-msgstr "Αποθήκη πηγής"
-
-msgid "By the"
-msgstr "Από το"
-
-msgid "next page"
-msgstr "επόμενη σελίδα"
-
-msgid "repository"
-msgstr "αποθήκη"
-
-msgid "Sphinx Book Theme"
-msgstr "Θέμα βιβλίου Sphinx"
-
-msgid "Download source file"
-msgstr "Λήψη αρχείου προέλευσης"
-
-msgid "Contents"
-msgstr "Περιεχόμενα"
-
-msgid "By"
-msgstr "Με"
-
-msgid "Copyright"
-msgstr "Πνευματική ιδιοκτησία"
-
-msgid "Fullscreen mode"
-msgstr "ΛΕΙΤΟΥΡΓΙΑ ΠΛΗΡΟΥΣ ΟΘΟΝΗΣ"
-
-msgid "Open an issue"
-msgstr "Ανοίξτε ένα ζήτημα"
-
-msgid "previous page"
-msgstr "προηγούμενη σελίδα"
-
-msgid "Download this page"
-msgstr "Λήψη αυτής της σελίδας"
-
-msgid "Theme by the"
-msgstr "Θέμα από το"
diff --git a/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index d1072bb..0000000
Binary files a/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 6749f3a..0000000
--- a/docs/_build/html/_static/locales/eo/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: eo\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "sugesti redaktadon"
-
-msgid "Last updated on"
-msgstr "Laste ĝisdatigita la"
-
-msgid "Edit this page"
-msgstr "Redaktu ĉi tiun paĝon"
-
-msgid "Launch"
-msgstr "Lanĉo"
-
-msgid "Print to PDF"
-msgstr "Presi al PDF"
-
-msgid "open issue"
-msgstr "malferma numero"
-
-msgid "Download notebook file"
-msgstr "Elŝutu kajeran dosieron"
-
-msgid "Toggle navigation"
-msgstr "Ŝalti navigadon"
-
-msgid "Source repository"
-msgstr "Fonto-deponejo"
-
-msgid "By the"
-msgstr "Per la"
-
-msgid "next page"
-msgstr "sekva paĝo"
-
-msgid "repository"
-msgstr "deponejo"
-
-msgid "Sphinx Book Theme"
-msgstr "Sfinksa Libro-Temo"
-
-msgid "Download source file"
-msgstr "Elŝutu fontodosieron"
-
-msgid "Contents"
-msgstr "Enhavo"
-
-msgid "By"
-msgstr "De"
-
-msgid "Copyright"
-msgstr "Kopirajto"
-
-msgid "Fullscreen mode"
-msgstr "Plenekrana reĝimo"
-
-msgid "Open an issue"
-msgstr "Malfermu numeron"
-
-msgid "previous page"
-msgstr "antaŭa paĝo"
-
-msgid "Download this page"
-msgstr "Elŝutu ĉi tiun paĝon"
-
-msgid "Theme by the"
-msgstr "Temo de la"
diff --git a/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index ba2ee4d..0000000
Binary files a/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 71dde37..0000000
--- a/docs/_build/html/_static/locales/es/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: es\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "sugerir editar"
-
-msgid "Last updated on"
-msgstr "Ultima actualización en"
-
-msgid "Edit this page"
-msgstr "Edita esta página"
-
-msgid "Launch"
-msgstr "Lanzamiento"
-
-msgid "Print to PDF"
-msgstr "Imprimir en PDF"
-
-msgid "open issue"
-msgstr "Tema abierto"
-
-msgid "Download notebook file"
-msgstr "Descargar archivo de cuaderno"
-
-msgid "Toggle navigation"
-msgstr "Navegación de palanca"
-
-msgid "Source repository"
-msgstr "Repositorio de origen"
-
-msgid "By the"
-msgstr "Por el"
-
-msgid "next page"
-msgstr "siguiente página"
-
-msgid "repository"
-msgstr "repositorio"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema del libro de la esfinge"
-
-msgid "Download source file"
-msgstr "Descargar archivo fuente"
-
-msgid "Contents"
-msgstr "Contenido"
-
-msgid "By"
-msgstr "Por"
-
-msgid "Copyright"
-msgstr "Derechos de autor"
-
-msgid "Fullscreen mode"
-msgstr "Modo de pantalla completa"
-
-msgid "Open an issue"
-msgstr "Abrir un problema"
-
-msgid "previous page"
-msgstr "pagina anterior"
-
-msgid "Download this page"
-msgstr "Descarga esta pagina"
-
-msgid "Theme by the"
-msgstr "Tema por el"
diff --git a/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 983b823..0000000
Binary files a/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.po
deleted file mode 100644
index cdcd07c..0000000
--- a/docs/_build/html/_static/locales/et/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: et\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "soovita muuta"
-
-msgid "Last updated on"
-msgstr "Viimati uuendatud"
-
-msgid "Edit this page"
-msgstr "Muutke seda lehte"
-
-msgid "Launch"
-msgstr "Käivitage"
-
-msgid "Print to PDF"
-msgstr "Prindi PDF-i"
-
-msgid "open issue"
-msgstr "avatud küsimus"
-
-msgid "Download notebook file"
-msgstr "Laadige sülearvuti fail alla"
-
-msgid "Toggle navigation"
-msgstr "Lülita navigeerimine sisse"
-
-msgid "Source repository"
-msgstr "Allikahoidla"
-
-msgid "By the"
-msgstr "Autor"
-
-msgid "next page"
-msgstr "järgmine leht"
-
-msgid "repository"
-msgstr "hoidla"
-
-msgid "Sphinx Book Theme"
-msgstr "Sfinksiraamatu teema"
-
-msgid "Download source file"
-msgstr "Laadige alla lähtefail"
-
-msgid "Contents"
-msgstr "Sisu"
-
-msgid "By"
-msgstr "Kõrval"
-
-msgid "Copyright"
-msgstr "Autoriõigus"
-
-msgid "Fullscreen mode"
-msgstr "Täisekraanirežiim"
-
-msgid "Open an issue"
-msgstr "Avage probleem"
-
-msgid "previous page"
-msgstr "eelmine leht"
-
-msgid "Download this page"
-msgstr "Laadige see leht alla"
-
-msgid "Theme by the"
-msgstr "Teema"
diff --git a/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index d8ac054..0000000
Binary files a/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 3c3dd08..0000000
--- a/docs/_build/html/_static/locales/fi/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: fi\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "ehdottaa muokkausta"
-
-msgid "Last updated on"
-msgstr "Viimeksi päivitetty"
-
-msgid "Edit this page"
-msgstr "Muokkaa tätä sivua"
-
-msgid "Launch"
-msgstr "Tuoda markkinoille"
-
-msgid "Print to PDF"
-msgstr "Tulosta PDF-tiedostoon"
-
-msgid "open issue"
-msgstr "avoin ongelma"
-
-msgid "Download notebook file"
-msgstr "Lataa muistikirjatiedosto"
-
-msgid "Toggle navigation"
-msgstr "Vaihda navigointia"
-
-msgid "Source repository"
-msgstr "Lähteen arkisto"
-
-msgid "By the"
-msgstr "Mukaan"
-
-msgid "next page"
-msgstr "seuraava sivu"
-
-msgid "repository"
-msgstr "arkisto"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx-kirjan teema"
-
-msgid "Download source file"
-msgstr "Lataa lähdetiedosto"
-
-msgid "Contents"
-msgstr "Sisällys"
-
-msgid "By"
-msgstr "Tekijä"
-
-msgid "Copyright"
-msgstr "Tekijänoikeus"
-
-msgid "Fullscreen mode"
-msgstr "Koko näytön tila"
-
-msgid "Open an issue"
-msgstr "Avaa ongelma"
-
-msgid "previous page"
-msgstr "Edellinen sivu"
-
-msgid "Download this page"
-msgstr "Lataa tämä sivu"
-
-msgid "Theme by the"
-msgstr "Teeman tekijä"
diff --git a/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index f663d39..0000000
Binary files a/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.po
deleted file mode 100644
index b57d2fe..0000000
--- a/docs/_build/html/_static/locales/fr/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: fr\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "suggestion de modification"
-
-msgid "Last updated on"
-msgstr "Dernière mise à jour le"
-
-msgid "Edit this page"
-msgstr "Modifier cette page"
-
-msgid "Launch"
-msgstr "lancement"
-
-msgid "Print to PDF"
-msgstr "Imprimer au format PDF"
-
-msgid "open issue"
-msgstr "signaler un problème"
-
-msgid "Download notebook file"
-msgstr "Télécharger le fichier notebook"
-
-msgid "Toggle navigation"
-msgstr "Basculer la navigation"
-
-msgid "Source repository"
-msgstr "Dépôt source"
-
-msgid "By the"
-msgstr "Par le"
-
-msgid "next page"
-msgstr "page suivante"
-
-msgid "repository"
-msgstr "dépôt"
-
-msgid "Sphinx Book Theme"
-msgstr "Thème du livre Sphinx"
-
-msgid "Download source file"
-msgstr "Télécharger le fichier source"
-
-msgid "Contents"
-msgstr "Contenu"
-
-msgid "By"
-msgstr "Par"
-
-msgid "Copyright"
-msgstr "droits d'auteur"
-
-msgid "Fullscreen mode"
-msgstr "Mode plein écran"
-
-msgid "Open an issue"
-msgstr "Ouvrez un problème"
-
-msgid "previous page"
-msgstr "page précédente"
-
-msgid "Download this page"
-msgstr "Téléchargez cette page"
-
-msgid "Theme by the"
-msgstr "Thème par le"
diff --git a/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index eca4a1a..0000000
Binary files a/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 4c425e8..0000000
--- a/docs/_build/html/_static/locales/hr/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: hr\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "predloži uređivanje"
-
-msgid "Last updated on"
-msgstr "Posljednje ažuriranje:"
-
-msgid "Edit this page"
-msgstr "Uredite ovu stranicu"
-
-msgid "Launch"
-msgstr "Pokrenite"
-
-msgid "Print to PDF"
-msgstr "Ispis u PDF"
-
-msgid "open issue"
-msgstr "otvoreno izdanje"
-
-msgid "Download notebook file"
-msgstr "Preuzmi datoteku bilježnice"
-
-msgid "Toggle navigation"
-msgstr "Uključi / isključi navigaciju"
-
-msgid "Source repository"
-msgstr "Izvorno spremište"
-
-msgid "By the"
-msgstr "Od strane"
-
-msgid "next page"
-msgstr "sljedeća stranica"
-
-msgid "repository"
-msgstr "spremište"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema knjige Sphinx"
-
-msgid "Download source file"
-msgstr "Preuzmi izvornu datoteku"
-
-msgid "Contents"
-msgstr "Sadržaj"
-
-msgid "By"
-msgstr "Po"
-
-msgid "Copyright"
-msgstr "Autorska prava"
-
-msgid "Fullscreen mode"
-msgstr "Način preko cijelog zaslona"
-
-msgid "Open an issue"
-msgstr "Otvorite izdanje"
-
-msgid "previous page"
-msgstr "Prethodna stranica"
-
-msgid "Download this page"
-msgstr "Preuzmite ovu stranicu"
-
-msgid "Theme by the"
-msgstr "Tema autora"
diff --git a/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index d07a06a..0000000
Binary files a/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 5db2ae1..0000000
--- a/docs/_build/html/_static/locales/id/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: id\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "menyarankan edit"
-
-msgid "Last updated on"
-msgstr "Terakhir diperbarui saat"
-
-msgid "Edit this page"
-msgstr "Edit halaman ini"
-
-msgid "Launch"
-msgstr "Meluncurkan"
-
-msgid "Print to PDF"
-msgstr "Cetak ke PDF"
-
-msgid "open issue"
-msgstr "masalah terbuka"
-
-msgid "Download notebook file"
-msgstr "Unduh file notebook"
-
-msgid "Toggle navigation"
-msgstr "Alihkan navigasi"
-
-msgid "Source repository"
-msgstr "Repositori sumber"
-
-msgid "By the"
-msgstr "Oleh"
-
-msgid "next page"
-msgstr "halaman selanjutnya"
-
-msgid "repository"
-msgstr "gudang"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema Buku Sphinx"
-
-msgid "Download source file"
-msgstr "Unduh file sumber"
-
-msgid "Contents"
-msgstr "Isi"
-
-msgid "By"
-msgstr "Oleh"
-
-msgid "Copyright"
-msgstr "hak cipta"
-
-msgid "Fullscreen mode"
-msgstr "Mode layar penuh"
-
-msgid "Open an issue"
-msgstr "Buka masalah"
-
-msgid "previous page"
-msgstr "halaman sebelumnya"
-
-msgid "Download this page"
-msgstr "Unduh halaman ini"
-
-msgid "Theme by the"
-msgstr "Tema oleh"
diff --git a/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 53ba476..0000000
Binary files a/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 7d54fde..0000000
--- a/docs/_build/html/_static/locales/it/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: it\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "suggerisci modifica"
-
-msgid "Last updated on"
-msgstr "Ultimo aggiornamento il"
-
-msgid "Edit this page"
-msgstr "Modifica questa pagina"
-
-msgid "Launch"
-msgstr "Lanciare"
-
-msgid "Print to PDF"
-msgstr "Stampa in PDF"
-
-msgid "open issue"
-msgstr "questione aperta"
-
-msgid "Download notebook file"
-msgstr "Scarica il file del taccuino"
-
-msgid "Toggle navigation"
-msgstr "Attiva / disattiva la navigazione"
-
-msgid "Source repository"
-msgstr "Repository di origine"
-
-msgid "By the"
-msgstr "Dal"
-
-msgid "next page"
-msgstr "pagina successiva"
-
-msgid "repository"
-msgstr "repository"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema del libro della Sfinge"
-
-msgid "Download source file"
-msgstr "Scarica il file sorgente"
-
-msgid "Contents"
-msgstr "Contenuti"
-
-msgid "By"
-msgstr "Di"
-
-msgid "Copyright"
-msgstr "Diritto d'autore"
-
-msgid "Fullscreen mode"
-msgstr "Modalità schermo intero"
-
-msgid "Open an issue"
-msgstr "Apri un problema"
-
-msgid "previous page"
-msgstr "pagina precedente"
-
-msgid "Download this page"
-msgstr "Scarica questa pagina"
-
-msgid "Theme by the"
-msgstr "Tema di"
diff --git a/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index a45c657..0000000
Binary files a/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 32b017c..0000000
--- a/docs/_build/html/_static/locales/iw/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: iw\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "מציע לערוך"
-
-msgid "Last updated on"
-msgstr "עודכן לאחרונה ב"
-
-msgid "Edit this page"
-msgstr "ערוך דף זה"
-
-msgid "Launch"
-msgstr "לְהַשִׁיק"
-
-msgid "Print to PDF"
-msgstr "הדפס לקובץ PDF"
-
-msgid "open issue"
-msgstr "בעיה פתוחה"
-
-msgid "Download notebook file"
-msgstr "הורד קובץ מחברת"
-
-msgid "Toggle navigation"
-msgstr "החלף ניווט"
-
-msgid "Source repository"
-msgstr "מאגר המקורות"
-
-msgid "By the"
-msgstr "דרך"
-
-msgid "next page"
-msgstr "עמוד הבא"
-
-msgid "repository"
-msgstr "מאגר"
-
-msgid "Sphinx Book Theme"
-msgstr "נושא ספר ספינקס"
-
-msgid "Download source file"
-msgstr "הורד את קובץ המקור"
-
-msgid "Contents"
-msgstr "תוכן"
-
-msgid "By"
-msgstr "על ידי"
-
-msgid "Copyright"
-msgstr "זכויות יוצרים"
-
-msgid "Fullscreen mode"
-msgstr "מצב מסך מלא"
-
-msgid "Open an issue"
-msgstr "פתח גיליון"
-
-msgid "previous page"
-msgstr "עמוד קודם"
-
-msgid "Download this page"
-msgstr "הורד דף זה"
-
-msgid "Theme by the"
-msgstr "נושא מאת"
diff --git a/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 1cefd29..0000000
Binary files a/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 16924e1..0000000
--- a/docs/_build/html/_static/locales/ja/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ja\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "編集を提案する"
-
-msgid "Last updated on"
-msgstr "最終更新日"
-
-msgid "Edit this page"
-msgstr "このページを編集"
-
-msgid "Launch"
-msgstr "起動"
-
-msgid "Print to PDF"
-msgstr "PDFに印刷"
-
-msgid "open issue"
-msgstr "未解決の問題"
-
-msgid "Download notebook file"
-msgstr "ノートブックファイルをダウンロード"
-
-msgid "Toggle navigation"
-msgstr "ナビゲーションを切り替え"
-
-msgid "Source repository"
-msgstr "ソースリポジトリ"
-
-msgid "By the"
-msgstr "によって"
-
-msgid "next page"
-msgstr "次のページ"
-
-msgid "repository"
-msgstr "リポジトリ"
-
-msgid "Sphinx Book Theme"
-msgstr "スフィンクスの本のテーマ"
-
-msgid "Download source file"
-msgstr "ソースファイルをダウンロード"
-
-msgid "Contents"
-msgstr "目次"
-
-msgid "By"
-msgstr "著者"
-
-msgid "Copyright"
-msgstr "Copyright"
-
-msgid "Fullscreen mode"
-msgstr "全画面モード"
-
-msgid "Open an issue"
-msgstr "問題を報告"
-
-msgid "previous page"
-msgstr "前のページ"
-
-msgid "Download this page"
-msgstr "このページをダウンロード"
-
-msgid "Theme by the"
-msgstr "のテーマ"
diff --git a/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 06c7ec9..0000000
Binary files a/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 69dd18f..0000000
--- a/docs/_build/html/_static/locales/ko/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ko\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "편집 제안"
-
-msgid "Last updated on"
-msgstr "마지막 업데이트"
-
-msgid "Edit this page"
-msgstr "이 페이지 편집"
-
-msgid "Launch"
-msgstr "시작하다"
-
-msgid "Print to PDF"
-msgstr "PDF로 인쇄"
-
-msgid "open issue"
-msgstr "열린 문제"
-
-msgid "Download notebook file"
-msgstr "노트북 파일 다운로드"
-
-msgid "Toggle navigation"
-msgstr "탐색 전환"
-
-msgid "Source repository"
-msgstr "소스 저장소"
-
-msgid "By the"
-msgstr "에 의해"
-
-msgid "next page"
-msgstr "다음 페이지"
-
-msgid "repository"
-msgstr "저장소"
-
-msgid "Sphinx Book Theme"
-msgstr "스핑크스 도서 테마"
-
-msgid "Download source file"
-msgstr "소스 파일 다운로드"
-
-msgid "Contents"
-msgstr "내용"
-
-msgid "By"
-msgstr "으로"
-
-msgid "Copyright"
-msgstr "저작권"
-
-msgid "Fullscreen mode"
-msgstr "전체 화면으로보기"
-
-msgid "Open an issue"
-msgstr "이슈 열기"
-
-msgid "previous page"
-msgstr "이전 페이지"
-
-msgid "Download this page"
-msgstr "이 페이지 다운로드"
-
-msgid "Theme by the"
-msgstr "테마별"
diff --git a/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 4468ba0..0000000
Binary files a/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 9f03775..0000000
--- a/docs/_build/html/_static/locales/lt/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: lt\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "pasiūlyti redaguoti"
-
-msgid "Last updated on"
-msgstr "Paskutinį kartą atnaujinta"
-
-msgid "Edit this page"
-msgstr "Redaguoti šį puslapį"
-
-msgid "Launch"
-msgstr "Paleiskite"
-
-msgid "Print to PDF"
-msgstr "Spausdinti į PDF"
-
-msgid "open issue"
-msgstr "atviras klausimas"
-
-msgid "Download notebook file"
-msgstr "Atsisiųsti nešiojamojo kompiuterio failą"
-
-msgid "Toggle navigation"
-msgstr "Perjungti naršymą"
-
-msgid "Source repository"
-msgstr "Šaltinio saugykla"
-
-msgid "By the"
-msgstr "Prie"
-
-msgid "next page"
-msgstr "Kitas puslapis"
-
-msgid "repository"
-msgstr "saugykla"
-
-msgid "Sphinx Book Theme"
-msgstr "Sfinkso knygos tema"
-
-msgid "Download source file"
-msgstr "Atsisiųsti šaltinio failą"
-
-msgid "Contents"
-msgstr "Turinys"
-
-msgid "By"
-msgstr "Iki"
-
-msgid "Copyright"
-msgstr "Autorių teisės"
-
-msgid "Fullscreen mode"
-msgstr "Pilno ekrano režimas"
-
-msgid "Open an issue"
-msgstr "Atidarykite problemą"
-
-msgid "previous page"
-msgstr "Ankstesnis puslapis"
-
-msgid "Download this page"
-msgstr "Atsisiųskite šį puslapį"
-
-msgid "Theme by the"
-msgstr "Tema"
diff --git a/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 74aa4d8..0000000
Binary files a/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.po
deleted file mode 100644
index c9633b5..0000000
--- a/docs/_build/html/_static/locales/lv/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: lv\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "ieteikt rediģēt"
-
-msgid "Last updated on"
-msgstr "Pēdējoreiz atjaunināts"
-
-msgid "Edit this page"
-msgstr "Rediģēt šo lapu"
-
-msgid "Launch"
-msgstr "Uzsākt"
-
-msgid "Print to PDF"
-msgstr "Drukāt PDF formātā"
-
-msgid "open issue"
-msgstr "atklāts jautājums"
-
-msgid "Download notebook file"
-msgstr "Lejupielādēt piezīmju grāmatiņu"
-
-msgid "Toggle navigation"
-msgstr "Pārslēgt navigāciju"
-
-msgid "Source repository"
-msgstr "Avota krātuve"
-
-msgid "By the"
-msgstr "Ar"
-
-msgid "next page"
-msgstr "nākamā lapaspuse"
-
-msgid "repository"
-msgstr "krātuve"
-
-msgid "Sphinx Book Theme"
-msgstr "Sfinksa grāmatas tēma"
-
-msgid "Download source file"
-msgstr "Lejupielādēt avota failu"
-
-msgid "Contents"
-msgstr "Saturs"
-
-msgid "By"
-msgstr "Autors"
-
-msgid "Copyright"
-msgstr "Autortiesības"
-
-msgid "Fullscreen mode"
-msgstr "Pilnekrāna režīms"
-
-msgid "Open an issue"
-msgstr "Atveriet problēmu"
-
-msgid "previous page"
-msgstr "iepriekšējā lapa"
-
-msgid "Download this page"
-msgstr "Lejupielādējiet šo lapu"
-
-msgid "Theme by the"
-msgstr "Autora tēma"
diff --git a/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 2736e8f..0000000
Binary files a/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 9a6a41e..0000000
--- a/docs/_build/html/_static/locales/ml/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ml\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "എഡിറ്റുചെയ്യാൻ നിർദ്ദേശിക്കുക"
-
-msgid "Last updated on"
-msgstr "അവസാനം അപ്‌ഡേറ്റുചെയ്‌തത്"
-
-msgid "Edit this page"
-msgstr "ഈ പേജ് എഡിറ്റുചെയ്യുക"
-
-msgid "Launch"
-msgstr "സമാരംഭിക്കുക"
-
-msgid "Print to PDF"
-msgstr "PDF- ലേക്ക് പ്രിന്റുചെയ്യുക"
-
-msgid "open issue"
-msgstr "തുറന്ന പ്രശ്നം"
-
-msgid "Download notebook file"
-msgstr "നോട്ട്ബുക്ക് ഫയൽ ഡൺലോഡ് ചെയ്യുക"
-
-msgid "Toggle navigation"
-msgstr "നാവിഗേഷൻ ടോഗിൾ ചെയ്യുക"
-
-msgid "Source repository"
-msgstr "ഉറവിട ശേഖരം"
-
-msgid "By the"
-msgstr "എഴുതിയത്"
-
-msgid "next page"
-msgstr "അടുത്ത പേജ്"
-
-msgid "Sphinx Book Theme"
-msgstr "സ്ഫിങ്ക്സ് പുസ്തക തീം"
-
-msgid "Download source file"
-msgstr "ഉറവിട ഫയൽ ഡൗൺലോഡുചെയ്യുക"
-
-msgid "By"
-msgstr "എഴുതിയത്"
-
-msgid "Copyright"
-msgstr "പകർപ്പവകാശം"
-
-msgid "Open an issue"
-msgstr "ഒരു പ്രശ്നം തുറക്കുക"
-
-msgid "previous page"
-msgstr "മുൻപത്തെ താൾ"
-
-msgid "Download this page"
-msgstr "ഈ പേജ് ഡൗൺലോഡുചെയ്യുക"
-
-msgid "Theme by the"
-msgstr "പ്രമേയം"
diff --git a/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index fe53010..0000000
Binary files a/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.po
deleted file mode 100644
index ef72d8c..0000000
--- a/docs/_build/html/_static/locales/mr/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: mr\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "संपादन सुचवा"
-
-msgid "Last updated on"
-msgstr "अखेरचे अद्यतनित"
-
-msgid "Edit this page"
-msgstr "हे पृष्ठ संपादित करा"
-
-msgid "Launch"
-msgstr "लाँच करा"
-
-msgid "Print to PDF"
-msgstr "पीडीएफवर मुद्रित करा"
-
-msgid "open issue"
-msgstr "खुला मुद्दा"
-
-msgid "Download notebook file"
-msgstr "नोटबुक फाईल डाउनलोड करा"
-
-msgid "Toggle navigation"
-msgstr "नेव्हिगेशन टॉगल करा"
-
-msgid "Source repository"
-msgstr "स्त्रोत भांडार"
-
-msgid "By the"
-msgstr "द्वारा"
-
-msgid "next page"
-msgstr "पुढील पृष्ठ"
-
-msgid "Sphinx Book Theme"
-msgstr "स्फिंक्स बुक थीम"
-
-msgid "Download source file"
-msgstr "स्त्रोत फाइल डाउनलोड करा"
-
-msgid "By"
-msgstr "द्वारा"
-
-msgid "Copyright"
-msgstr "कॉपीराइट"
-
-msgid "Open an issue"
-msgstr "एक मुद्दा उघडा"
-
-msgid "previous page"
-msgstr "मागील पान"
-
-msgid "Download this page"
-msgstr "हे पृष्ठ डाउनलोड करा"
-
-msgid "Theme by the"
-msgstr "द्वारा थीम"
diff --git a/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index f02603f..0000000
Binary files a/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.po
deleted file mode 100644
index e29cbe2..0000000
--- a/docs/_build/html/_static/locales/ms/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ms\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "cadangkan edit"
-
-msgid "Last updated on"
-msgstr "Terakhir dikemas kini pada"
-
-msgid "Edit this page"
-msgstr "Edit halaman ini"
-
-msgid "Launch"
-msgstr "Lancarkan"
-
-msgid "Print to PDF"
-msgstr "Cetak ke PDF"
-
-msgid "open issue"
-msgstr "isu terbuka"
-
-msgid "Download notebook file"
-msgstr "Muat turun fail buku nota"
-
-msgid "Toggle navigation"
-msgstr "Togol navigasi"
-
-msgid "Source repository"
-msgstr "Repositori sumber"
-
-msgid "By the"
-msgstr "Oleh"
-
-msgid "next page"
-msgstr "muka surat seterusnya"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema Buku Sphinx"
-
-msgid "Download source file"
-msgstr "Muat turun fail sumber"
-
-msgid "By"
-msgstr "Oleh"
-
-msgid "Copyright"
-msgstr "hak cipta"
-
-msgid "Open an issue"
-msgstr "Buka masalah"
-
-msgid "previous page"
-msgstr "halaman sebelumnya"
-
-msgid "Download this page"
-msgstr "Muat turun halaman ini"
-
-msgid "Theme by the"
-msgstr "Tema oleh"
diff --git a/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index e59e7ec..0000000
Binary files a/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.po
deleted file mode 100644
index e4844d7..0000000
--- a/docs/_build/html/_static/locales/nl/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: nl\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "suggereren bewerken"
-
-msgid "Last updated on"
-msgstr "Laatst geupdate op"
-
-msgid "Edit this page"
-msgstr "bewerk deze pagina"
-
-msgid "Launch"
-msgstr "Lancering"
-
-msgid "Print to PDF"
-msgstr "Afdrukken naar pdf"
-
-msgid "open issue"
-msgstr "open probleem"
-
-msgid "Download notebook file"
-msgstr "Download notebookbestand"
-
-msgid "Toggle navigation"
-msgstr "Schakel navigatie"
-
-msgid "Source repository"
-msgstr "Bronopslagplaats"
-
-msgid "By the"
-msgstr "Door de"
-
-msgid "next page"
-msgstr "volgende bladzijde"
-
-msgid "repository"
-msgstr "repository"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx-boekthema"
-
-msgid "Download source file"
-msgstr "Download het bronbestand"
-
-msgid "Contents"
-msgstr "Inhoud"
-
-msgid "By"
-msgstr "Door"
-
-msgid "Copyright"
-msgstr "auteursrechten"
-
-msgid "Fullscreen mode"
-msgstr "Volledig scherm"
-
-msgid "Open an issue"
-msgstr "Open een probleem"
-
-msgid "previous page"
-msgstr "vorige pagina"
-
-msgid "Download this page"
-msgstr "Download deze pagina"
-
-msgid "Theme by the"
-msgstr "Thema door de"
diff --git a/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 6cd15c8..0000000
Binary files a/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.po
deleted file mode 100644
index d079dd9..0000000
--- a/docs/_build/html/_static/locales/no/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: no\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "foreslå redigering"
-
-msgid "Last updated on"
-msgstr "Sist oppdatert den"
-
-msgid "Edit this page"
-msgstr "Rediger denne siden"
-
-msgid "Launch"
-msgstr "Start"
-
-msgid "Print to PDF"
-msgstr "Skriv ut til PDF"
-
-msgid "open issue"
-msgstr "åpent nummer"
-
-msgid "Download notebook file"
-msgstr "Last ned notatbokfilen"
-
-msgid "Toggle navigation"
-msgstr "Bytt navigasjon"
-
-msgid "Source repository"
-msgstr "Kildedepot"
-
-msgid "By the"
-msgstr "Ved"
-
-msgid "next page"
-msgstr "neste side"
-
-msgid "repository"
-msgstr "oppbevaringssted"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx boktema"
-
-msgid "Download source file"
-msgstr "Last ned kildefilen"
-
-msgid "Contents"
-msgstr "Innhold"
-
-msgid "By"
-msgstr "Av"
-
-msgid "Copyright"
-msgstr "opphavsrett"
-
-msgid "Fullscreen mode"
-msgstr "Fullskjerm-modus"
-
-msgid "Open an issue"
-msgstr "Åpne et problem"
-
-msgid "previous page"
-msgstr "forrige side"
-
-msgid "Download this page"
-msgstr "Last ned denne siden"
-
-msgid "Theme by the"
-msgstr "Tema av"
diff --git a/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 9ebb584..0000000
Binary files a/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.po
deleted file mode 100644
index fcac51d..0000000
--- a/docs/_build/html/_static/locales/pl/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: pl\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "zaproponuj edycję"
-
-msgid "Last updated on"
-msgstr "Ostatnia aktualizacja"
-
-msgid "Edit this page"
-msgstr "Edytuj tę strone"
-
-msgid "Launch"
-msgstr "Uruchomić"
-
-msgid "Print to PDF"
-msgstr "Drukuj do PDF"
-
-msgid "open issue"
-msgstr "otwarty problem"
-
-msgid "Download notebook file"
-msgstr "Pobierz plik notatnika"
-
-msgid "Toggle navigation"
-msgstr "Przełącz nawigację"
-
-msgid "Source repository"
-msgstr "Repozytorium źródłowe"
-
-msgid "By the"
-msgstr "Przez"
-
-msgid "next page"
-msgstr "Następna strona"
-
-msgid "repository"
-msgstr "magazyn"
-
-msgid "Sphinx Book Theme"
-msgstr "Motyw książki Sphinx"
-
-msgid "Download source file"
-msgstr "Pobierz plik źródłowy"
-
-msgid "Contents"
-msgstr "Zawartość"
-
-msgid "By"
-msgstr "Przez"
-
-msgid "Copyright"
-msgstr "prawa autorskie"
-
-msgid "Fullscreen mode"
-msgstr "Pełny ekran"
-
-msgid "Open an issue"
-msgstr "Otwórz problem"
-
-msgid "previous page"
-msgstr "Poprzednia strona"
-
-msgid "Download this page"
-msgstr "Pobierz tę stronę"
-
-msgid "Theme by the"
-msgstr "Motyw autorstwa"
diff --git a/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index d0ddb87..0000000
Binary files a/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 1761db0..0000000
--- a/docs/_build/html/_static/locales/pt/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: pt\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "sugerir edição"
-
-msgid "Last updated on"
-msgstr "Última atualização em"
-
-msgid "Edit this page"
-msgstr "Edite essa página"
-
-msgid "Launch"
-msgstr "Lançamento"
-
-msgid "Print to PDF"
-msgstr "Imprimir em PDF"
-
-msgid "open issue"
-msgstr "questão aberta"
-
-msgid "Download notebook file"
-msgstr "Baixar arquivo de notebook"
-
-msgid "Toggle navigation"
-msgstr "Alternar de navegação"
-
-msgid "Source repository"
-msgstr "Repositório fonte"
-
-msgid "By the"
-msgstr "Pelo"
-
-msgid "next page"
-msgstr "próxima página"
-
-msgid "repository"
-msgstr "repositório"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema do livro Sphinx"
-
-msgid "Download source file"
-msgstr "Baixar arquivo fonte"
-
-msgid "Contents"
-msgstr "Conteúdo"
-
-msgid "By"
-msgstr "De"
-
-msgid "Copyright"
-msgstr "direito autoral"
-
-msgid "Fullscreen mode"
-msgstr "Modo tela cheia"
-
-msgid "Open an issue"
-msgstr "Abra um problema"
-
-msgid "previous page"
-msgstr "página anterior"
-
-msgid "Download this page"
-msgstr "Baixe esta página"
-
-msgid "Theme by the"
-msgstr "Tema por"
diff --git a/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 3c36ab1..0000000
Binary files a/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.po
deleted file mode 100644
index db865c8..0000000
--- a/docs/_build/html/_static/locales/ro/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ro\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "sugerează editare"
-
-msgid "Last updated on"
-msgstr "Ultima actualizare la"
-
-msgid "Edit this page"
-msgstr "Editați această pagină"
-
-msgid "Launch"
-msgstr "Lansa"
-
-msgid "Print to PDF"
-msgstr "Imprimați în PDF"
-
-msgid "open issue"
-msgstr "problema deschisă"
-
-msgid "Download notebook file"
-msgstr "Descărcați fișierul notebook"
-
-msgid "Toggle navigation"
-msgstr "Comutare navigare"
-
-msgid "Source repository"
-msgstr "Depozit sursă"
-
-msgid "By the"
-msgstr "Langa"
-
-msgid "next page"
-msgstr "pagina următoare"
-
-msgid "repository"
-msgstr "repertoriu"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema Sphinx Book"
-
-msgid "Download source file"
-msgstr "Descărcați fișierul sursă"
-
-msgid "Contents"
-msgstr "Cuprins"
-
-msgid "By"
-msgstr "De"
-
-msgid "Copyright"
-msgstr "Drepturi de autor"
-
-msgid "Fullscreen mode"
-msgstr "Modul ecran întreg"
-
-msgid "Open an issue"
-msgstr "Deschideți o problemă"
-
-msgid "previous page"
-msgstr "pagina anterioară"
-
-msgid "Download this page"
-msgstr "Descarcă această pagină"
-
-msgid "Theme by the"
-msgstr "Tema de"
diff --git a/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 6b8ca41..0000000
Binary files a/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 84ab6eb..0000000
--- a/docs/_build/html/_static/locales/ru/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ru\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "предложить редактировать"
-
-msgid "Last updated on"
-msgstr "Последнее обновление"
-
-msgid "Edit this page"
-msgstr "Редактировать эту страницу"
-
-msgid "Launch"
-msgstr "Запуск"
-
-msgid "Print to PDF"
-msgstr "Распечатать в PDF"
-
-msgid "open issue"
-msgstr "открытый вопрос"
-
-msgid "Download notebook file"
-msgstr "Скачать файл записной книжки"
-
-msgid "Toggle navigation"
-msgstr "Переключить навигацию"
-
-msgid "Source repository"
-msgstr "Исходный репозиторий"
-
-msgid "By the"
-msgstr "Посредством"
-
-msgid "next page"
-msgstr "Следующая страница"
-
-msgid "repository"
-msgstr "хранилище"
-
-msgid "Sphinx Book Theme"
-msgstr "Тема книги Сфинкс"
-
-msgid "Download source file"
-msgstr "Скачать исходный файл"
-
-msgid "Contents"
-msgstr "Содержание"
-
-msgid "By"
-msgstr "По"
-
-msgid "Copyright"
-msgstr "авторское право"
-
-msgid "Fullscreen mode"
-msgstr "Полноэкранный режим"
-
-msgid "Open an issue"
-msgstr "Открыть вопрос"
-
-msgid "previous page"
-msgstr "Предыдущая страница"
-
-msgid "Download this page"
-msgstr "Загрузите эту страницу"
-
-msgid "Theme by the"
-msgstr "Тема от"
diff --git a/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 59bd0dd..0000000
Binary files a/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.po
deleted file mode 100644
index e44878b..0000000
--- a/docs/_build/html/_static/locales/sk/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: sk\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "navrhnúť úpravu"
-
-msgid "Last updated on"
-msgstr "Posledná aktualizácia dňa"
-
-msgid "Edit this page"
-msgstr "Upraviť túto stránku"
-
-msgid "Launch"
-msgstr "Spustiť"
-
-msgid "Print to PDF"
-msgstr "Tlač do PDF"
-
-msgid "open issue"
-msgstr "otvorené vydanie"
-
-msgid "Download notebook file"
-msgstr "Stiahnite si zošit"
-
-msgid "Toggle navigation"
-msgstr "Prepnúť navigáciu"
-
-msgid "Source repository"
-msgstr "Zdrojové úložisko"
-
-msgid "By the"
-msgstr "Podľa"
-
-msgid "next page"
-msgstr "ďalšia strana"
-
-msgid "repository"
-msgstr "Úložisko"
-
-msgid "Sphinx Book Theme"
-msgstr "Téma knihy Sfinga"
-
-msgid "Download source file"
-msgstr "Stiahnite si zdrojový súbor"
-
-msgid "Contents"
-msgstr "Obsah"
-
-msgid "By"
-msgstr "Autor:"
-
-msgid "Copyright"
-msgstr "Autorské práva"
-
-msgid "Fullscreen mode"
-msgstr "Režim celej obrazovky"
-
-msgid "Open an issue"
-msgstr "Otvorte problém"
-
-msgid "previous page"
-msgstr "predchádzajúca strana"
-
-msgid "Download this page"
-msgstr "Stiahnite si túto stránku"
-
-msgid "Theme by the"
-msgstr "Téma od"
diff --git a/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 87bf26d..0000000
Binary files a/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 228939b..0000000
--- a/docs/_build/html/_static/locales/sl/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: sl\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "predlagajte urejanje"
-
-msgid "Last updated on"
-msgstr "Nazadnje posodobljeno dne"
-
-msgid "Edit this page"
-msgstr "Uredite to stran"
-
-msgid "Launch"
-msgstr "Kosilo"
-
-msgid "Print to PDF"
-msgstr "Natisni v PDF"
-
-msgid "open issue"
-msgstr "odprto vprašanje"
-
-msgid "Download notebook file"
-msgstr "Prenesite datoteko zvezka"
-
-msgid "Toggle navigation"
-msgstr "Preklopi navigacijo"
-
-msgid "Source repository"
-msgstr "Izvorno skladišče"
-
-msgid "By the"
-msgstr "Avtor"
-
-msgid "next page"
-msgstr "Naslednja stran"
-
-msgid "repository"
-msgstr "odlagališče"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema knjige Sphinx"
-
-msgid "Download source file"
-msgstr "Prenesite izvorno datoteko"
-
-msgid "Contents"
-msgstr "Vsebina"
-
-msgid "By"
-msgstr "Avtor"
-
-msgid "Copyright"
-msgstr "avtorske pravice"
-
-msgid "Fullscreen mode"
-msgstr "Celozaslonski način"
-
-msgid "Open an issue"
-msgstr "Odprite številko"
-
-msgid "previous page"
-msgstr "Prejšnja stran"
-
-msgid "Download this page"
-msgstr "Prenesite to stran"
-
-msgid "Theme by the"
-msgstr "Tema avtorja"
diff --git a/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index ec740f4..0000000
Binary files a/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 1a712a1..0000000
--- a/docs/_build/html/_static/locales/sr/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: sr\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "предложи уређивање"
-
-msgid "Last updated on"
-msgstr "Последње ажурирање"
-
-msgid "Edit this page"
-msgstr "Уредите ову страницу"
-
-msgid "Launch"
-msgstr "Лансирање"
-
-msgid "Print to PDF"
-msgstr "Испис у ПДФ"
-
-msgid "open issue"
-msgstr "отворено издање"
-
-msgid "Download notebook file"
-msgstr "Преузмите датотеку бележнице"
-
-msgid "Toggle navigation"
-msgstr "Укључи / искључи навигацију"
-
-msgid "Source repository"
-msgstr "Изворно спремиште"
-
-msgid "By the"
-msgstr "Од"
-
-msgid "next page"
-msgstr "Следећа страна"
-
-msgid "repository"
-msgstr "спремиште"
-
-msgid "Sphinx Book Theme"
-msgstr "Тема књиге Спхинк"
-
-msgid "Download source file"
-msgstr "Преузми изворну датотеку"
-
-msgid "Contents"
-msgstr "Садржај"
-
-msgid "By"
-msgstr "Од стране"
-
-msgid "Copyright"
-msgstr "Ауторско право"
-
-msgid "Fullscreen mode"
-msgstr "Режим целог екрана"
-
-msgid "Open an issue"
-msgstr "Отворите издање"
-
-msgid "previous page"
-msgstr "Претходна страница"
-
-msgid "Download this page"
-msgstr "Преузмите ову страницу"
-
-msgid "Theme by the"
-msgstr "Тхеме би"
diff --git a/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index be951be..0000000
Binary files a/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 7d2b56d..0000000
--- a/docs/_build/html/_static/locales/sv/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: sv\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "föreslå redigering"
-
-msgid "Last updated on"
-msgstr "Senast uppdaterad den"
-
-msgid "Edit this page"
-msgstr "Redigera den här sidan"
-
-msgid "Launch"
-msgstr "Lansera"
-
-msgid "Print to PDF"
-msgstr "Skriv ut till PDF"
-
-msgid "open issue"
-msgstr "öppet problem"
-
-msgid "Download notebook file"
-msgstr "Ladda ner anteckningsbokfilen"
-
-msgid "Toggle navigation"
-msgstr "Växla navigering"
-
-msgid "Source repository"
-msgstr "Källförvar"
-
-msgid "By the"
-msgstr "Vid"
-
-msgid "next page"
-msgstr "nästa sida"
-
-msgid "repository"
-msgstr "förvar"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx boktema"
-
-msgid "Download source file"
-msgstr "Ladda ner källfil"
-
-msgid "Contents"
-msgstr "Innehåll"
-
-msgid "By"
-msgstr "Förbi"
-
-msgid "Copyright"
-msgstr "upphovsrätt"
-
-msgid "Fullscreen mode"
-msgstr "Fullskärmsläge"
-
-msgid "Open an issue"
-msgstr "Öppna ett problem"
-
-msgid "previous page"
-msgstr "föregående sida"
-
-msgid "Download this page"
-msgstr "Ladda ner den här sidan"
-
-msgid "Theme by the"
-msgstr "Tema av"
diff --git a/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 29f52e1..0000000
Binary files a/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.po
deleted file mode 100644
index c75ffe1..0000000
--- a/docs/_build/html/_static/locales/ta/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ta\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "திருத்த பரிந்துரைக்கவும்"
-
-msgid "Last updated on"
-msgstr "கடைசியாக புதுப்பிக்கப்பட்டது"
-
-msgid "Edit this page"
-msgstr "இந்தப் பக்கத்தைத் திருத்தவும்"
-
-msgid "Launch"
-msgstr "தொடங்க"
-
-msgid "Print to PDF"
-msgstr "PDF இல் அச்சிடுக"
-
-msgid "open issue"
-msgstr "திறந்த பிரச்சினை"
-
-msgid "Download notebook file"
-msgstr "நோட்புக் கோப்பைப் பதிவிறக்கவும்"
-
-msgid "Toggle navigation"
-msgstr "வழிசெலுத்தலை நிலைமாற்று"
-
-msgid "Source repository"
-msgstr "மூல களஞ்சியம்"
-
-msgid "By the"
-msgstr "மூலம்"
-
-msgid "next page"
-msgstr "அடுத்த பக்கம்"
-
-msgid "Sphinx Book Theme"
-msgstr "ஸ்பிங்க்ஸ் புத்தக தீம்"
-
-msgid "Download source file"
-msgstr "மூல கோப்பைப் பதிவிறக்குக"
-
-msgid "By"
-msgstr "வழங்கியவர்"
-
-msgid "Copyright"
-msgstr "பதிப்புரிமை"
-
-msgid "Open an issue"
-msgstr "சிக்கலைத் திறக்கவும்"
-
-msgid "previous page"
-msgstr "முந்தைய பக்கம்"
-
-msgid "Download this page"
-msgstr "இந்தப் பக்கத்தைப் பதிவிறக்கவும்"
-
-msgid "Theme by the"
-msgstr "வழங்கிய தீம்"
diff --git a/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 0a5f4b4..0000000
Binary files a/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 2595c03..0000000
--- a/docs/_build/html/_static/locales/te/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: te\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "సవరించమని సూచించండి"
-
-msgid "Last updated on"
-msgstr "చివరిగా నవీకరించబడింది"
-
-msgid "Edit this page"
-msgstr "ఈ పేజీని సవరించండి"
-
-msgid "Launch"
-msgstr "ప్రారంభించండి"
-
-msgid "Print to PDF"
-msgstr "PDF కి ముద్రించండి"
-
-msgid "open issue"
-msgstr "ఓపెన్ ఇష్యూ"
-
-msgid "Download notebook file"
-msgstr "నోట్బుక్ ఫైల్ను డౌన్లోడ్ చేయండి"
-
-msgid "Toggle navigation"
-msgstr "నావిగేషన్‌ను టోగుల్ చేయండి"
-
-msgid "Source repository"
-msgstr "మూల రిపోజిటరీ"
-
-msgid "By the"
-msgstr "ద్వారా"
-
-msgid "next page"
-msgstr "తరువాతి పేజీ"
-
-msgid "Sphinx Book Theme"
-msgstr "సింహిక పుస్తక థీమ్"
-
-msgid "Download source file"
-msgstr "మూల ఫైల్‌ను డౌన్‌లోడ్ చేయండి"
-
-msgid "By"
-msgstr "ద్వారా"
-
-msgid "Copyright"
-msgstr "కాపీరైట్"
-
-msgid "Open an issue"
-msgstr "సమస్యను తెరవండి"
-
-msgid "previous page"
-msgstr "ముందు పేజి"
-
-msgid "Download this page"
-msgstr "ఈ పేజీని డౌన్‌లోడ్ చేయండి"
-
-msgid "Theme by the"
-msgstr "ద్వారా థీమ్"
diff --git a/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index b21c6c6..0000000
Binary files a/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 73cd30e..0000000
--- a/docs/_build/html/_static/locales/tg/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: tg\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "пешниҳод вироиш"
-
-msgid "Last updated on"
-msgstr "Last навсозӣ дар"
-
-msgid "Edit this page"
-msgstr "Ин саҳифаро таҳрир кунед"
-
-msgid "Launch"
-msgstr "Оғоз"
-
-msgid "Print to PDF"
-msgstr "Чоп ба PDF"
-
-msgid "open issue"
-msgstr "барориши кушод"
-
-msgid "Download notebook file"
-msgstr "Файли дафтарро зеркашӣ кунед"
-
-msgid "Toggle navigation"
-msgstr "Гузаришро иваз кунед"
-
-msgid "Source repository"
-msgstr "Анбори манбаъ"
-
-msgid "By the"
-msgstr "Бо"
-
-msgid "next page"
-msgstr "саҳифаи оянда"
-
-msgid "repository"
-msgstr "анбор"
-
-msgid "Sphinx Book Theme"
-msgstr "Сфинкс Мавзӯи китоб"
-
-msgid "Download source file"
-msgstr "Файли манбаъро зеркашӣ кунед"
-
-msgid "Contents"
-msgstr "Мундариҷа"
-
-msgid "By"
-msgstr "Бо"
-
-msgid "Copyright"
-msgstr "Ҳуқуқи муаллиф"
-
-msgid "Fullscreen mode"
-msgstr "Ҳолати экрани пурра"
-
-msgid "Open an issue"
-msgstr "Масъаларо кушоед"
-
-msgid "previous page"
-msgstr "саҳифаи қаблӣ"
-
-msgid "Download this page"
-msgstr "Ин саҳифаро зеркашӣ кунед"
-
-msgid "Theme by the"
-msgstr "Мавзӯъи аз"
diff --git a/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index abede98..0000000
Binary files a/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 0392b4a..0000000
--- a/docs/_build/html/_static/locales/th/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: th\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "แนะนำแก้ไข"
-
-msgid "Last updated on"
-msgstr "ปรับปรุงล่าสุดเมื่อ"
-
-msgid "Edit this page"
-msgstr "แก้ไขหน้านี้"
-
-msgid "Launch"
-msgstr "เปิด"
-
-msgid "Print to PDF"
-msgstr "พิมพ์เป็น PDF"
-
-msgid "open issue"
-msgstr "เปิดปัญหา"
-
-msgid "Download notebook file"
-msgstr "ดาวน์โหลดไฟล์สมุดบันทึก"
-
-msgid "Toggle navigation"
-msgstr "ไม่ต้องสลับช่องทาง"
-
-msgid "Source repository"
-msgstr "ที่เก็บซอร์ส"
-
-msgid "By the"
-msgstr "โดย"
-
-msgid "next page"
-msgstr "หน้าต่อไป"
-
-msgid "repository"
-msgstr "ที่เก็บ"
-
-msgid "Sphinx Book Theme"
-msgstr "ธีมหนังสือสฟิงซ์"
-
-msgid "Download source file"
-msgstr "ดาวน์โหลดไฟล์ต้นฉบับ"
-
-msgid "Contents"
-msgstr "สารบัญ"
-
-msgid "By"
-msgstr "โดย"
-
-msgid "Copyright"
-msgstr "ลิขสิทธิ์"
-
-msgid "Fullscreen mode"
-msgstr "โหมดเต็มหน้าจอ"
-
-msgid "Open an issue"
-msgstr "เปิดปัญหา"
-
-msgid "previous page"
-msgstr "หน้าที่แล้ว"
-
-msgid "Download this page"
-msgstr "ดาวน์โหลดหน้านี้"
-
-msgid "Theme by the"
-msgstr "ธีมโดย"
diff --git a/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 8df1b73..0000000
Binary files a/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.po
deleted file mode 100644
index c8375b5..0000000
--- a/docs/_build/html/_static/locales/tl/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: tl\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "iminumungkahi i-edit"
-
-msgid "Last updated on"
-msgstr "Huling na-update noong"
-
-msgid "Edit this page"
-msgstr "I-edit ang pahinang ito"
-
-msgid "Launch"
-msgstr "Ilunsad"
-
-msgid "Print to PDF"
-msgstr "I-print sa PDF"
-
-msgid "open issue"
-msgstr "bukas na isyu"
-
-msgid "Download notebook file"
-msgstr "Mag-download ng file ng notebook"
-
-msgid "Toggle navigation"
-msgstr "I-toggle ang pag-navigate"
-
-msgid "Source repository"
-msgstr "Pinagmulan ng imbakan"
-
-msgid "By the"
-msgstr "Sa pamamagitan ng"
-
-msgid "next page"
-msgstr "Susunod na pahina"
-
-msgid "Sphinx Book Theme"
-msgstr "Tema ng Sphinx Book"
-
-msgid "Download source file"
-msgstr "Mag-download ng file ng pinagmulan"
-
-msgid "By"
-msgstr "Ni"
-
-msgid "Copyright"
-msgstr "Copyright"
-
-msgid "Open an issue"
-msgstr "Magbukas ng isyu"
-
-msgid "previous page"
-msgstr "Nakaraang pahina"
-
-msgid "Download this page"
-msgstr "I-download ang pahinang ito"
-
-msgid "Theme by the"
-msgstr "Tema ng"
diff --git a/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 029ae18..0000000
Binary files a/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 47d7bdf..0000000
--- a/docs/_build/html/_static/locales/tr/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: tr\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "düzenleme öner"
-
-msgid "Last updated on"
-msgstr "Son güncelleme tarihi"
-
-msgid "Edit this page"
-msgstr "Bu sayfayı düzenle"
-
-msgid "Launch"
-msgstr "Başlatmak"
-
-msgid "Print to PDF"
-msgstr "PDF olarak yazdır"
-
-msgid "open issue"
-msgstr "Açık konu"
-
-msgid "Download notebook file"
-msgstr "Defter dosyasını indirin"
-
-msgid "Toggle navigation"
-msgstr "Gezinmeyi değiştir"
-
-msgid "Source repository"
-msgstr "Kaynak kod deposu"
-
-msgid "By the"
-msgstr "Tarafından"
-
-msgid "next page"
-msgstr "sonraki Sayfa"
-
-msgid "repository"
-msgstr "depo"
-
-msgid "Sphinx Book Theme"
-msgstr "Sfenks Kitap Teması"
-
-msgid "Download source file"
-msgstr "Kaynak dosyayı indirin"
-
-msgid "Contents"
-msgstr "İçindekiler"
-
-msgid "By"
-msgstr "Tarafından"
-
-msgid "Copyright"
-msgstr "Telif hakkı"
-
-msgid "Fullscreen mode"
-msgstr "Tam ekran modu"
-
-msgid "Open an issue"
-msgstr "Bir sorunu açın"
-
-msgid "previous page"
-msgstr "önceki sayfa"
-
-msgid "Download this page"
-msgstr "Bu sayfayı indirin"
-
-msgid "Theme by the"
-msgstr "Tarafından tema"
diff --git a/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 16ab789..0000000
Binary files a/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.po
deleted file mode 100644
index e85f6f1..0000000
--- a/docs/_build/html/_static/locales/uk/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: uk\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "запропонувати редагувати"
-
-msgid "Last updated on"
-msgstr "Останнє оновлення:"
-
-msgid "Edit this page"
-msgstr "Редагувати цю сторінку"
-
-msgid "Launch"
-msgstr "Запуск"
-
-msgid "Print to PDF"
-msgstr "Друк у форматі PDF"
-
-msgid "open issue"
-msgstr "відкритий випуск"
-
-msgid "Download notebook file"
-msgstr "Завантажте файл блокнота"
-
-msgid "Toggle navigation"
-msgstr "Переключити навігацію"
-
-msgid "Source repository"
-msgstr "Джерело сховища"
-
-msgid "By the"
-msgstr "По"
-
-msgid "next page"
-msgstr "Наступна сторінка"
-
-msgid "repository"
-msgstr "сховище"
-
-msgid "Sphinx Book Theme"
-msgstr "Тема книги \"Сфінкс\""
-
-msgid "Download source file"
-msgstr "Завантажити вихідний файл"
-
-msgid "Contents"
-msgstr "Зміст"
-
-msgid "By"
-msgstr "Автор"
-
-msgid "Copyright"
-msgstr "Авторське право"
-
-msgid "Fullscreen mode"
-msgstr "Повноекранний режим"
-
-msgid "Open an issue"
-msgstr "Відкрийте випуск"
-
-msgid "previous page"
-msgstr "Попередня сторінка"
-
-msgid "Download this page"
-msgstr "Завантажте цю сторінку"
-
-msgid "Theme by the"
-msgstr "Тема від"
diff --git a/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index de8c84b..0000000
Binary files a/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 0f90726..0000000
--- a/docs/_build/html/_static/locales/ur/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,66 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: ur\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "ترمیم کی تجویز کریں"
-
-msgid "Last updated on"
-msgstr "آخری بار تازہ کاری ہوئی"
-
-msgid "Edit this page"
-msgstr "اس صفحے میں ترمیم کریں"
-
-msgid "Launch"
-msgstr "لانچ کریں"
-
-msgid "Print to PDF"
-msgstr "پی ڈی ایف پرنٹ کریں"
-
-msgid "open issue"
-msgstr "کھلا مسئلہ"
-
-msgid "Download notebook file"
-msgstr "نوٹ بک فائل ڈاؤن لوڈ کریں"
-
-msgid "Toggle navigation"
-msgstr "نیویگیشن ٹوگل کریں"
-
-msgid "Source repository"
-msgstr "ماخذ ذخیرہ"
-
-msgid "By the"
-msgstr "کی طرف"
-
-msgid "next page"
-msgstr "اگلا صفحہ"
-
-msgid "Sphinx Book Theme"
-msgstr "سپنکس بک تھیم"
-
-msgid "Download source file"
-msgstr "سورس فائل ڈاؤن لوڈ کریں"
-
-msgid "By"
-msgstr "بذریعہ"
-
-msgid "Copyright"
-msgstr "کاپی رائٹ"
-
-msgid "Open an issue"
-msgstr "ایک مسئلہ کھولیں"
-
-msgid "previous page"
-msgstr "سابقہ ​​صفحہ"
-
-msgid "Download this page"
-msgstr "اس صفحے کو ڈاؤن لوڈ کریں"
-
-msgid "Theme by the"
-msgstr "کے ذریعہ تھیم"
diff --git a/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 2bb3255..0000000
Binary files a/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 2cb5cf3..0000000
--- a/docs/_build/html/_static/locales/vi/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: vi\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "đề nghị chỉnh sửa"
-
-msgid "Last updated on"
-msgstr "Cập nhật lần cuối vào"
-
-msgid "Edit this page"
-msgstr "chỉnh sửa trang này"
-
-msgid "Launch"
-msgstr "Phóng"
-
-msgid "Print to PDF"
-msgstr "In sang PDF"
-
-msgid "open issue"
-msgstr "vấn đề mở"
-
-msgid "Download notebook file"
-msgstr "Tải xuống tệp sổ tay"
-
-msgid "Toggle navigation"
-msgstr "Chuyển đổi điều hướng thành"
-
-msgid "Source repository"
-msgstr "Kho nguồn"
-
-msgid "By the"
-msgstr "Bằng"
-
-msgid "next page"
-msgstr "Trang tiếp theo"
-
-msgid "repository"
-msgstr "kho"
-
-msgid "Sphinx Book Theme"
-msgstr "Chủ đề sách nhân sư"
-
-msgid "Download source file"
-msgstr "Tải xuống tệp nguồn"
-
-msgid "Contents"
-msgstr "Nội dung"
-
-msgid "By"
-msgstr "Bởi"
-
-msgid "Copyright"
-msgstr "Bản quyền"
-
-msgid "Fullscreen mode"
-msgstr "Chế độ toàn màn hình"
-
-msgid "Open an issue"
-msgstr "Mở một vấn đề"
-
-msgid "previous page"
-msgstr "trang trước"
-
-msgid "Download this page"
-msgstr "Tải xuống trang này"
-
-msgid "Theme by the"
-msgstr "Chủ đề của"
diff --git a/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 0e3235d..0000000
Binary files a/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.po
deleted file mode 100644
index f91f3ba..0000000
--- a/docs/_build/html/_static/locales/zh_CN/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: zh_CN\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "提出修改建议"
-
-msgid "Last updated on"
-msgstr "上次更新时间："
-
-msgid "Edit this page"
-msgstr "编辑此页面"
-
-msgid "Launch"
-msgstr "启动"
-
-msgid "Print to PDF"
-msgstr "列印成 PDF"
-
-msgid "open issue"
-msgstr "创建议题"
-
-msgid "Download notebook file"
-msgstr "下载笔记本文件"
-
-msgid "Toggle navigation"
-msgstr "显示或隐藏导航栏"
-
-msgid "Source repository"
-msgstr "源码库"
-
-msgid "By the"
-msgstr "作者："
-
-msgid "next page"
-msgstr "下一页"
-
-msgid "repository"
-msgstr "仓库"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx Book 主题"
-
-msgid "Download source file"
-msgstr "下载源文件"
-
-msgid "Contents"
-msgstr "目录"
-
-msgid "By"
-msgstr "作者："
-
-msgid "Copyright"
-msgstr "版权"
-
-msgid "Fullscreen mode"
-msgstr "全屏模式"
-
-msgid "Open an issue"
-msgstr "创建议题"
-
-msgid "previous page"
-msgstr "上一页"
-
-msgid "Download this page"
-msgstr "下载此页面"
-
-msgid "Theme by the"
-msgstr "主题作者："
diff --git a/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo b/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo
deleted file mode 100644
index 9116fa9..0000000
Binary files a/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.mo and /dev/null differ
diff --git a/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.po b/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.po
deleted file mode 100644
index 7833d90..0000000
--- a/docs/_build/html/_static/locales/zh_TW/LC_MESSAGES/booktheme.po
+++ /dev/null
@@ -1,75 +0,0 @@
-
-msgid ""
-msgstr ""
-"Project-Id-Version: Sphinx-Book-Theme\n"
-"MIME-Version: 1.0\n"
-"Content-Type: text/plain; charset=UTF-8\n"
-"Content-Transfer-Encoding: 8bit\n"
-"Language: zh_TW\n"
-"Plural-Forms: nplurals=2; plural=(n != 1);\n"
-
-msgid "suggest edit"
-msgstr "提出修改建議"
-
-msgid "Last updated on"
-msgstr "最後更新時間："
-
-msgid "Edit this page"
-msgstr "編輯此頁面"
-
-msgid "Launch"
-msgstr "啟動"
-
-msgid "Print to PDF"
-msgstr "列印成 PDF"
-
-msgid "open issue"
-msgstr "公開的問題"
-
-msgid "Download notebook file"
-msgstr "下載 Notebook 檔案"
-
-msgid "Toggle navigation"
-msgstr "顯示或隱藏導覽列"
-
-msgid "Source repository"
-msgstr "來源儲存庫"
-
-msgid "By the"
-msgstr "作者："
-
-msgid "next page"
-msgstr "下一頁"
-
-msgid "repository"
-msgstr "儲存庫"
-
-msgid "Sphinx Book Theme"
-msgstr "Sphinx Book 佈景主題"
-
-msgid "Download source file"
-msgstr "下載原始檔"
-
-msgid "Contents"
-msgstr "目錄"
-
-msgid "By"
-msgstr "作者："
-
-msgid "Copyright"
-msgstr "Copyright"
-
-msgid "Fullscreen mode"
-msgstr "全螢幕模式"
-
-msgid "Open an issue"
-msgstr "開啟議題"
-
-msgid "previous page"
-msgstr "上一頁"
-
-msgid "Download this page"
-msgstr "下載此頁面"
-
-msgid "Theme by the"
-msgstr "佈景主題作者："
diff --git a/docs/_build/html/_static/minus.png b/docs/_build/html/_static/minus.png
deleted file mode 100644
index d96755f..0000000
Binary files a/docs/_build/html/_static/minus.png and /dev/null differ
diff --git a/docs/_build/html/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css b/docs/_build/html/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css
deleted file mode 100644
index 3356631..0000000
--- a/docs/_build/html/_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css
+++ /dev/null
@@ -1,2342 +0,0 @@
-/* Variables */
-:root {
-  --mystnb-source-bg-color: #f7f7f7;
-  --mystnb-stdout-bg-color: #fcfcfc;
-  --mystnb-stderr-bg-color: #fdd;
-  --mystnb-traceback-bg-color: #fcfcfc;
-  --mystnb-source-border-color: #ccc;
-  --mystnb-source-margin-color: green;
-  --mystnb-stdout-border-color: #f7f7f7;
-  --mystnb-stderr-border-color: #f7f7f7;
-  --mystnb-traceback-border-color: #ffd6d6;
-  --mystnb-hide-prompt-opacity: 70%;
-  --mystnb-source-border-radius: .4em;
-  --mystnb-source-border-width: 1px;
-}
-
-/* Whole cell */
-div.container.cell {
-  padding-left: 0;
-  margin-bottom: 1em;
-}
-
-/* Removing all background formatting so we can control at the div level */
-.cell_input div.highlight,
-.cell_output pre,
-.cell_input pre,
-.cell_output .output {
-  border: none;
-  box-shadow: none;
-}
-
-.cell_output .output pre,
-.cell_input pre {
-  margin: 0px;
-}
-
-/* Input cells */
-div.cell div.cell_input,
-div.cell details.above-input>summary {
-  padding-left: 0em;
-  padding-right: 0em;
-  border: var(--mystnb-source-border-width) var(--mystnb-source-border-color) solid;
-  background-color: var(--mystnb-source-bg-color);
-  border-left-color: var(--mystnb-source-margin-color);
-  border-left-width: medium;
-  border-radius: var(--mystnb-source-border-radius);
-}
-
-div.cell_input>div,
-div.cell_output div.output>div.highlight {
-  margin: 0em !important;
-  border: none !important;
-}
-
-/* All cell outputs */
-.cell_output {
-  padding-left: 1em;
-  padding-right: 0em;
-  margin-top: 1em;
-}
-
-/* Text outputs from cells */
-.cell_output .output.text_plain,
-.cell_output .output.traceback,
-.cell_output .output.stream,
-.cell_output .output.stderr {
-  margin-top: 1em;
-  margin-bottom: 0em;
-  box-shadow: none;
-}
-
-.cell_output .output.text_plain,
-.cell_output .output.stream {
-  background: var(--mystnb-stdout-bg-color);
-  border: 1px solid var(--mystnb-stdout-border-color);
-}
-
-.cell_output .output.stderr {
-  background: var(--mystnb-stderr-bg-color);
-  border: 1px solid var(--mystnb-stderr-border-color);
-}
-
-.cell_output .output.traceback {
-  background: var(--mystnb-traceback-bg-color);
-  border: 1px solid var(--mystnb-traceback-border-color);
-}
-
-/* Collapsible cell content */
-div.cell details.above-input div.cell_input {
-  border-top-left-radius: 0;
-  border-top-right-radius: 0;
-  border-top: var(--mystnb-source-border-width) var(--mystnb-source-border-color) dashed;
-}
-
-div.cell div.cell_input.above-output-prompt {
-  border-bottom-left-radius: 0;
-  border-bottom-right-radius: 0;
-}
-
-div.cell details.above-input>summary {
-  border-bottom-left-radius: 0;
-  border-bottom-right-radius: 0;
-  border-bottom: var(--mystnb-source-border-width) var(--mystnb-source-border-color) dashed;
-  padding-left: 1em;
-  margin-bottom: 0;
-}
-
-div.cell details.above-output>summary {
-  background-color: var(--mystnb-source-bg-color);
-  padding-left: 1em;
-  padding-right: 0em;
-  border: var(--mystnb-source-border-width) var(--mystnb-source-border-color) solid;
-  border-radius: var(--mystnb-source-border-radius);
-  border-left-color: var(--mystnb-source-margin-color);
-  border-left-width: medium;
-}
-
-div.cell details.below-input>summary {
-  background-color: var(--mystnb-source-bg-color);
-  padding-left: 1em;
-  padding-right: 0em;
-  border: var(--mystnb-source-border-width) var(--mystnb-source-border-color) solid;
-  border-top: none;
-  border-bottom-left-radius: var(--mystnb-source-border-radius);
-  border-bottom-right-radius: var(--mystnb-source-border-radius);
-  border-left-color: var(--mystnb-source-margin-color);
-  border-left-width: medium;
-}
-
-div.cell details.hide>summary>span {
-  opacity: var(--mystnb-hide-prompt-opacity);
-}
-
-div.cell details.hide[open]>summary>span.collapsed {
-  display: none;
-}
-
-div.cell details.hide:not([open])>summary>span.expanded {
-  display: none;
-}
-
-@keyframes collapsed-fade-in {
-  0% {
-    opacity: 0;
-  }
-
-  100% {
-    opacity: 1;
-  }
-}
-div.cell details.hide[open]>summary~* {
-  -moz-animation: collapsed-fade-in 0.3s ease-in-out;
-  -webkit-animation: collapsed-fade-in 0.3s ease-in-out;
-  animation: collapsed-fade-in 0.3s ease-in-out;
-}
-
-/* Math align to the left */
-.cell_output .MathJax_Display {
-  text-align: left !important;
-}
-
-/* Pandas tables. Pulled from the Jupyter / nbsphinx CSS */
-div.cell_output table {
-  border: none;
-  border-collapse: collapse;
-  border-spacing: 0;
-  color: black;
-  font-size: 1em;
-  table-layout: fixed;
-}
-
-div.cell_output thead {
-  border-bottom: 1px solid black;
-  vertical-align: bottom;
-}
-
-div.cell_output tr,
-div.cell_output th,
-div.cell_output td {
-  text-align: right;
-  vertical-align: middle;
-  padding: 0.5em 0.5em;
-  line-height: normal;
-  white-space: normal;
-  max-width: none;
-  border: none;
-}
-
-div.cell_output th {
-  font-weight: bold;
-}
-
-div.cell_output tbody tr:nth-child(odd) {
-  background: #f5f5f5;
-}
-
-div.cell_output tbody tr:hover {
-  background: rgba(66, 165, 245, 0.2);
-}
-
-/** source code line numbers **/
-span.linenos {
-  opacity: 0.5;
-}
-
-/* Inline text from `paste` operation */
-
-span.pasted-text {
-  font-weight: bold;
-}
-
-span.pasted-inline img {
-  max-height: 2em;
-}
-
-tbody span.pasted-inline img {
-  max-height: none;
-}
-
-/* Font colors for translated ANSI escape sequences
-Color values are copied from Jupyter Notebook
-https://github.com/jupyter/notebook/blob/52581f8eda9b319eb0390ac77fe5903c38f81e3e/notebook/static/notebook/less/ansicolors.less#L14-L21
-Background colors from
-https://nbsphinx.readthedocs.io/en/latest/code-cells.html#ANSI-Colors
-*/
-div.highlight .-Color-Bold {
-  font-weight: bold;
-}
-
-div.highlight .-Color[class*=-Black] {
-  color: #3E424D
-}
-
-div.highlight .-Color[class*=-Red] {
-  color: #E75C58
-}
-
-div.highlight .-Color[class*=-Green] {
-  color: #00A250
-}
-
-div.highlight .-Color[class*=-Yellow] {
-  color: #DDB62B
-}
-
-div.highlight .-Color[class*=-Blue] {
-  color: #208FFB
-}
-
-div.highlight .-Color[class*=-Magenta] {
-  color: #D160C4
-}
-
-div.highlight .-Color[class*=-Cyan] {
-  color: #60C6C8
-}
-
-div.highlight .-Color[class*=-White] {
-  color: #C5C1B4
-}
-
-div.highlight .-Color[class*=-BGBlack] {
-  background-color: #3E424D
-}
-
-div.highlight .-Color[class*=-BGRed] {
-  background-color: #E75C58
-}
-
-div.highlight .-Color[class*=-BGGreen] {
-  background-color: #00A250
-}
-
-div.highlight .-Color[class*=-BGYellow] {
-  background-color: #DDB62B
-}
-
-div.highlight .-Color[class*=-BGBlue] {
-  background-color: #208FFB
-}
-
-div.highlight .-Color[class*=-BGMagenta] {
-  background-color: #D160C4
-}
-
-div.highlight .-Color[class*=-BGCyan] {
-  background-color: #60C6C8
-}
-
-div.highlight .-Color[class*=-BGWhite] {
-  background-color: #C5C1B4
-}
-
-/* Font colors for 8-bit ANSI */
-
-div.highlight .-Color[class*=-C0] {
-  color: #000000
-}
-
-div.highlight .-Color[class*=-BGC0] {
-  background-color: #000000
-}
-
-div.highlight .-Color[class*=-C1] {
-  color: #800000
-}
-
-div.highlight .-Color[class*=-BGC1] {
-  background-color: #800000
-}
-
-div.highlight .-Color[class*=-C2] {
-  color: #008000
-}
-
-div.highlight .-Color[class*=-BGC2] {
-  background-color: #008000
-}
-
-div.highlight .-Color[class*=-C3] {
-  color: #808000
-}
-
-div.highlight .-Color[class*=-BGC3] {
-  background-color: #808000
-}
-
-div.highlight .-Color[class*=-C4] {
-  color: #000080
-}
-
-div.highlight .-Color[class*=-BGC4] {
-  background-color: #000080
-}
-
-div.highlight .-Color[class*=-C5] {
-  color: #800080
-}
-
-div.highlight .-Color[class*=-BGC5] {
-  background-color: #800080
-}
-
-div.highlight .-Color[class*=-C6] {
-  color: #008080
-}
-
-div.highlight .-Color[class*=-BGC6] {
-  background-color: #008080
-}
-
-div.highlight .-Color[class*=-C7] {
-  color: #C0C0C0
-}
-
-div.highlight .-Color[class*=-BGC7] {
-  background-color: #C0C0C0
-}
-
-div.highlight .-Color[class*=-C8] {
-  color: #808080
-}
-
-div.highlight .-Color[class*=-BGC8] {
-  background-color: #808080
-}
-
-div.highlight .-Color[class*=-C9] {
-  color: #FF0000
-}
-
-div.highlight .-Color[class*=-BGC9] {
-  background-color: #FF0000
-}
-
-div.highlight .-Color[class*=-C10] {
-  color: #00FF00
-}
-
-div.highlight .-Color[class*=-BGC10] {
-  background-color: #00FF00
-}
-
-div.highlight .-Color[class*=-C11] {
-  color: #FFFF00
-}
-
-div.highlight .-Color[class*=-BGC11] {
-  background-color: #FFFF00
-}
-
-div.highlight .-Color[class*=-C12] {
-  color: #0000FF
-}
-
-div.highlight .-Color[class*=-BGC12] {
-  background-color: #0000FF
-}
-
-div.highlight .-Color[class*=-C13] {
-  color: #FF00FF
-}
-
-div.highlight .-Color[class*=-BGC13] {
-  background-color: #FF00FF
-}
-
-div.highlight .-Color[class*=-C14] {
-  color: #00FFFF
-}
-
-div.highlight .-Color[class*=-BGC14] {
-  background-color: #00FFFF
-}
-
-div.highlight .-Color[class*=-C15] {
-  color: #FFFFFF
-}
-
-div.highlight .-Color[class*=-BGC15] {
-  background-color: #FFFFFF
-}
-
-div.highlight .-Color[class*=-C16] {
-  color: #000000
-}
-
-div.highlight .-Color[class*=-BGC16] {
-  background-color: #000000
-}
-
-div.highlight .-Color[class*=-C17] {
-  color: #00005F
-}
-
-div.highlight .-Color[class*=-BGC17] {
-  background-color: #00005F
-}
-
-div.highlight .-Color[class*=-C18] {
-  color: #000087
-}
-
-div.highlight .-Color[class*=-BGC18] {
-  background-color: #000087
-}
-
-div.highlight .-Color[class*=-C19] {
-  color: #0000AF
-}
-
-div.highlight .-Color[class*=-BGC19] {
-  background-color: #0000AF
-}
-
-div.highlight .-Color[class*=-C20] {
-  color: #0000D7
-}
-
-div.highlight .-Color[class*=-BGC20] {
-  background-color: #0000D7
-}
-
-div.highlight .-Color[class*=-C21] {
-  color: #0000FF
-}
-
-div.highlight .-Color[class*=-BGC21] {
-  background-color: #0000FF
-}
-
-div.highlight .-Color[class*=-C22] {
-  color: #005F00
-}
-
-div.highlight .-Color[class*=-BGC22] {
-  background-color: #005F00
-}
-
-div.highlight .-Color[class*=-C23] {
-  color: #005F5F
-}
-
-div.highlight .-Color[class*=-BGC23] {
-  background-color: #005F5F
-}
-
-div.highlight .-Color[class*=-C24] {
-  color: #005F87
-}
-
-div.highlight .-Color[class*=-BGC24] {
-  background-color: #005F87
-}
-
-div.highlight .-Color[class*=-C25] {
-  color: #005FAF
-}
-
-div.highlight .-Color[class*=-BGC25] {
-  background-color: #005FAF
-}
-
-div.highlight .-Color[class*=-C26] {
-  color: #005FD7
-}
-
-div.highlight .-Color[class*=-BGC26] {
-  background-color: #005FD7
-}
-
-div.highlight .-Color[class*=-C27] {
-  color: #005FFF
-}
-
-div.highlight .-Color[class*=-BGC27] {
-  background-color: #005FFF
-}
-
-div.highlight .-Color[class*=-C28] {
-  color: #008700
-}
-
-div.highlight .-Color[class*=-BGC28] {
-  background-color: #008700
-}
-
-div.highlight .-Color[class*=-C29] {
-  color: #00875F
-}
-
-div.highlight .-Color[class*=-BGC29] {
-  background-color: #00875F
-}
-
-div.highlight .-Color[class*=-C30] {
-  color: #008787
-}
-
-div.highlight .-Color[class*=-BGC30] {
-  background-color: #008787
-}
-
-div.highlight .-Color[class*=-C31] {
-  color: #0087AF
-}
-
-div.highlight .-Color[class*=-BGC31] {
-  background-color: #0087AF
-}
-
-div.highlight .-Color[class*=-C32] {
-  color: #0087D7
-}
-
-div.highlight .-Color[class*=-BGC32] {
-  background-color: #0087D7
-}
-
-div.highlight .-Color[class*=-C33] {
-  color: #0087FF
-}
-
-div.highlight .-Color[class*=-BGC33] {
-  background-color: #0087FF
-}
-
-div.highlight .-Color[class*=-C34] {
-  color: #00AF00
-}
-
-div.highlight .-Color[class*=-BGC34] {
-  background-color: #00AF00
-}
-
-div.highlight .-Color[class*=-C35] {
-  color: #00AF5F
-}
-
-div.highlight .-Color[class*=-BGC35] {
-  background-color: #00AF5F
-}
-
-div.highlight .-Color[class*=-C36] {
-  color: #00AF87
-}
-
-div.highlight .-Color[class*=-BGC36] {
-  background-color: #00AF87
-}
-
-div.highlight .-Color[class*=-C37] {
-  color: #00AFAF
-}
-
-div.highlight .-Color[class*=-BGC37] {
-  background-color: #00AFAF
-}
-
-div.highlight .-Color[class*=-C38] {
-  color: #00AFD7
-}
-
-div.highlight .-Color[class*=-BGC38] {
-  background-color: #00AFD7
-}
-
-div.highlight .-Color[class*=-C39] {
-  color: #00AFFF
-}
-
-div.highlight .-Color[class*=-BGC39] {
-  background-color: #00AFFF
-}
-
-div.highlight .-Color[class*=-C40] {
-  color: #00D700
-}
-
-div.highlight .-Color[class*=-BGC40] {
-  background-color: #00D700
-}
-
-div.highlight .-Color[class*=-C41] {
-  color: #00D75F
-}
-
-div.highlight .-Color[class*=-BGC41] {
-  background-color: #00D75F
-}
-
-div.highlight .-Color[class*=-C42] {
-  color: #00D787
-}
-
-div.highlight .-Color[class*=-BGC42] {
-  background-color: #00D787
-}
-
-div.highlight .-Color[class*=-C43] {
-  color: #00D7AF
-}
-
-div.highlight .-Color[class*=-BGC43] {
-  background-color: #00D7AF
-}
-
-div.highlight .-Color[class*=-C44] {
-  color: #00D7D7
-}
-
-div.highlight .-Color[class*=-BGC44] {
-  background-color: #00D7D7
-}
-
-div.highlight .-Color[class*=-C45] {
-  color: #00D7FF
-}
-
-div.highlight .-Color[class*=-BGC45] {
-  background-color: #00D7FF
-}
-
-div.highlight .-Color[class*=-C46] {
-  color: #00FF00
-}
-
-div.highlight .-Color[class*=-BGC46] {
-  background-color: #00FF00
-}
-
-div.highlight .-Color[class*=-C47] {
-  color: #00FF5F
-}
-
-div.highlight .-Color[class*=-BGC47] {
-  background-color: #00FF5F
-}
-
-div.highlight .-Color[class*=-C48] {
-  color: #00FF87
-}
-
-div.highlight .-Color[class*=-BGC48] {
-  background-color: #00FF87
-}
-
-div.highlight .-Color[class*=-C49] {
-  color: #00FFAF
-}
-
-div.highlight .-Color[class*=-BGC49] {
-  background-color: #00FFAF
-}
-
-div.highlight .-Color[class*=-C50] {
-  color: #00FFD7
-}
-
-div.highlight .-Color[class*=-BGC50] {
-  background-color: #00FFD7
-}
-
-div.highlight .-Color[class*=-C51] {
-  color: #00FFFF
-}
-
-div.highlight .-Color[class*=-BGC51] {
-  background-color: #00FFFF
-}
-
-div.highlight .-Color[class*=-C52] {
-  color: #5F0000
-}
-
-div.highlight .-Color[class*=-BGC52] {
-  background-color: #5F0000
-}
-
-div.highlight .-Color[class*=-C53] {
-  color: #5F005F
-}
-
-div.highlight .-Color[class*=-BGC53] {
-  background-color: #5F005F
-}
-
-div.highlight .-Color[class*=-C54] {
-  color: #5F0087
-}
-
-div.highlight .-Color[class*=-BGC54] {
-  background-color: #5F0087
-}
-
-div.highlight .-Color[class*=-C55] {
-  color: #5F00AF
-}
-
-div.highlight .-Color[class*=-BGC55] {
-  background-color: #5F00AF
-}
-
-div.highlight .-Color[class*=-C56] {
-  color: #5F00D7
-}
-
-div.highlight .-Color[class*=-BGC56] {
-  background-color: #5F00D7
-}
-
-div.highlight .-Color[class*=-C57] {
-  color: #5F00FF
-}
-
-div.highlight .-Color[class*=-BGC57] {
-  background-color: #5F00FF
-}
-
-div.highlight .-Color[class*=-C58] {
-  color: #5F5F00
-}
-
-div.highlight .-Color[class*=-BGC58] {
-  background-color: #5F5F00
-}
-
-div.highlight .-Color[class*=-C59] {
-  color: #5F5F5F
-}
-
-div.highlight .-Color[class*=-BGC59] {
-  background-color: #5F5F5F
-}
-
-div.highlight .-Color[class*=-C60] {
-  color: #5F5F87
-}
-
-div.highlight .-Color[class*=-BGC60] {
-  background-color: #5F5F87
-}
-
-div.highlight .-Color[class*=-C61] {
-  color: #5F5FAF
-}
-
-div.highlight .-Color[class*=-BGC61] {
-  background-color: #5F5FAF
-}
-
-div.highlight .-Color[class*=-C62] {
-  color: #5F5FD7
-}
-
-div.highlight .-Color[class*=-BGC62] {
-  background-color: #5F5FD7
-}
-
-div.highlight .-Color[class*=-C63] {
-  color: #5F5FFF
-}
-
-div.highlight .-Color[class*=-BGC63] {
-  background-color: #5F5FFF
-}
-
-div.highlight .-Color[class*=-C64] {
-  color: #5F8700
-}
-
-div.highlight .-Color[class*=-BGC64] {
-  background-color: #5F8700
-}
-
-div.highlight .-Color[class*=-C65] {
-  color: #5F875F
-}
-
-div.highlight .-Color[class*=-BGC65] {
-  background-color: #5F875F
-}
-
-div.highlight .-Color[class*=-C66] {
-  color: #5F8787
-}
-
-div.highlight .-Color[class*=-BGC66] {
-  background-color: #5F8787
-}
-
-div.highlight .-Color[class*=-C67] {
-  color: #5F87AF
-}
-
-div.highlight .-Color[class*=-BGC67] {
-  background-color: #5F87AF
-}
-
-div.highlight .-Color[class*=-C68] {
-  color: #5F87D7
-}
-
-div.highlight .-Color[class*=-BGC68] {
-  background-color: #5F87D7
-}
-
-div.highlight .-Color[class*=-C69] {
-  color: #5F87FF
-}
-
-div.highlight .-Color[class*=-BGC69] {
-  background-color: #5F87FF
-}
-
-div.highlight .-Color[class*=-C70] {
-  color: #5FAF00
-}
-
-div.highlight .-Color[class*=-BGC70] {
-  background-color: #5FAF00
-}
-
-div.highlight .-Color[class*=-C71] {
-  color: #5FAF5F
-}
-
-div.highlight .-Color[class*=-BGC71] {
-  background-color: #5FAF5F
-}
-
-div.highlight .-Color[class*=-C72] {
-  color: #5FAF87
-}
-
-div.highlight .-Color[class*=-BGC72] {
-  background-color: #5FAF87
-}
-
-div.highlight .-Color[class*=-C73] {
-  color: #5FAFAF
-}
-
-div.highlight .-Color[class*=-BGC73] {
-  background-color: #5FAFAF
-}
-
-div.highlight .-Color[class*=-C74] {
-  color: #5FAFD7
-}
-
-div.highlight .-Color[class*=-BGC74] {
-  background-color: #5FAFD7
-}
-
-div.highlight .-Color[class*=-C75] {
-  color: #5FAFFF
-}
-
-div.highlight .-Color[class*=-BGC75] {
-  background-color: #5FAFFF
-}
-
-div.highlight .-Color[class*=-C76] {
-  color: #5FD700
-}
-
-div.highlight .-Color[class*=-BGC76] {
-  background-color: #5FD700
-}
-
-div.highlight .-Color[class*=-C77] {
-  color: #5FD75F
-}
-
-div.highlight .-Color[class*=-BGC77] {
-  background-color: #5FD75F
-}
-
-div.highlight .-Color[class*=-C78] {
-  color: #5FD787
-}
-
-div.highlight .-Color[class*=-BGC78] {
-  background-color: #5FD787
-}
-
-div.highlight .-Color[class*=-C79] {
-  color: #5FD7AF
-}
-
-div.highlight .-Color[class*=-BGC79] {
-  background-color: #5FD7AF
-}
-
-div.highlight .-Color[class*=-C80] {
-  color: #5FD7D7
-}
-
-div.highlight .-Color[class*=-BGC80] {
-  background-color: #5FD7D7
-}
-
-div.highlight .-Color[class*=-C81] {
-  color: #5FD7FF
-}
-
-div.highlight .-Color[class*=-BGC81] {
-  background-color: #5FD7FF
-}
-
-div.highlight .-Color[class*=-C82] {
-  color: #5FFF00
-}
-
-div.highlight .-Color[class*=-BGC82] {
-  background-color: #5FFF00
-}
-
-div.highlight .-Color[class*=-C83] {
-  color: #5FFF5F
-}
-
-div.highlight .-Color[class*=-BGC83] {
-  background-color: #5FFF5F
-}
-
-div.highlight .-Color[class*=-C84] {
-  color: #5FFF87
-}
-
-div.highlight .-Color[class*=-BGC84] {
-  background-color: #5FFF87
-}
-
-div.highlight .-Color[class*=-C85] {
-  color: #5FFFAF
-}
-
-div.highlight .-Color[class*=-BGC85] {
-  background-color: #5FFFAF
-}
-
-div.highlight .-Color[class*=-C86] {
-  color: #5FFFD7
-}
-
-div.highlight .-Color[class*=-BGC86] {
-  background-color: #5FFFD7
-}
-
-div.highlight .-Color[class*=-C87] {
-  color: #5FFFFF
-}
-
-div.highlight .-Color[class*=-BGC87] {
-  background-color: #5FFFFF
-}
-
-div.highlight .-Color[class*=-C88] {
-  color: #870000
-}
-
-div.highlight .-Color[class*=-BGC88] {
-  background-color: #870000
-}
-
-div.highlight .-Color[class*=-C89] {
-  color: #87005F
-}
-
-div.highlight .-Color[class*=-BGC89] {
-  background-color: #87005F
-}
-
-div.highlight .-Color[class*=-C90] {
-  color: #870087
-}
-
-div.highlight .-Color[class*=-BGC90] {
-  background-color: #870087
-}
-
-div.highlight .-Color[class*=-C91] {
-  color: #8700AF
-}
-
-div.highlight .-Color[class*=-BGC91] {
-  background-color: #8700AF
-}
-
-div.highlight .-Color[class*=-C92] {
-  color: #8700D7
-}
-
-div.highlight .-Color[class*=-BGC92] {
-  background-color: #8700D7
-}
-
-div.highlight .-Color[class*=-C93] {
-  color: #8700FF
-}
-
-div.highlight .-Color[class*=-BGC93] {
-  background-color: #8700FF
-}
-
-div.highlight .-Color[class*=-C94] {
-  color: #875F00
-}
-
-div.highlight .-Color[class*=-BGC94] {
-  background-color: #875F00
-}
-
-div.highlight .-Color[class*=-C95] {
-  color: #875F5F
-}
-
-div.highlight .-Color[class*=-BGC95] {
-  background-color: #875F5F
-}
-
-div.highlight .-Color[class*=-C96] {
-  color: #875F87
-}
-
-div.highlight .-Color[class*=-BGC96] {
-  background-color: #875F87
-}
-
-div.highlight .-Color[class*=-C97] {
-  color: #875FAF
-}
-
-div.highlight .-Color[class*=-BGC97] {
-  background-color: #875FAF
-}
-
-div.highlight .-Color[class*=-C98] {
-  color: #875FD7
-}
-
-div.highlight .-Color[class*=-BGC98] {
-  background-color: #875FD7
-}
-
-div.highlight .-Color[class*=-C99] {
-  color: #875FFF
-}
-
-div.highlight .-Color[class*=-BGC99] {
-  background-color: #875FFF
-}
-
-div.highlight .-Color[class*=-C100] {
-  color: #878700
-}
-
-div.highlight .-Color[class*=-BGC100] {
-  background-color: #878700
-}
-
-div.highlight .-Color[class*=-C101] {
-  color: #87875F
-}
-
-div.highlight .-Color[class*=-BGC101] {
-  background-color: #87875F
-}
-
-div.highlight .-Color[class*=-C102] {
-  color: #878787
-}
-
-div.highlight .-Color[class*=-BGC102] {
-  background-color: #878787
-}
-
-div.highlight .-Color[class*=-C103] {
-  color: #8787AF
-}
-
-div.highlight .-Color[class*=-BGC103] {
-  background-color: #8787AF
-}
-
-div.highlight .-Color[class*=-C104] {
-  color: #8787D7
-}
-
-div.highlight .-Color[class*=-BGC104] {
-  background-color: #8787D7
-}
-
-div.highlight .-Color[class*=-C105] {
-  color: #8787FF
-}
-
-div.highlight .-Color[class*=-BGC105] {
-  background-color: #8787FF
-}
-
-div.highlight .-Color[class*=-C106] {
-  color: #87AF00
-}
-
-div.highlight .-Color[class*=-BGC106] {
-  background-color: #87AF00
-}
-
-div.highlight .-Color[class*=-C107] {
-  color: #87AF5F
-}
-
-div.highlight .-Color[class*=-BGC107] {
-  background-color: #87AF5F
-}
-
-div.highlight .-Color[class*=-C108] {
-  color: #87AF87
-}
-
-div.highlight .-Color[class*=-BGC108] {
-  background-color: #87AF87
-}
-
-div.highlight .-Color[class*=-C109] {
-  color: #87AFAF
-}
-
-div.highlight .-Color[class*=-BGC109] {
-  background-color: #87AFAF
-}
-
-div.highlight .-Color[class*=-C110] {
-  color: #87AFD7
-}
-
-div.highlight .-Color[class*=-BGC110] {
-  background-color: #87AFD7
-}
-
-div.highlight .-Color[class*=-C111] {
-  color: #87AFFF
-}
-
-div.highlight .-Color[class*=-BGC111] {
-  background-color: #87AFFF
-}
-
-div.highlight .-Color[class*=-C112] {
-  color: #87D700
-}
-
-div.highlight .-Color[class*=-BGC112] {
-  background-color: #87D700
-}
-
-div.highlight .-Color[class*=-C113] {
-  color: #87D75F
-}
-
-div.highlight .-Color[class*=-BGC113] {
-  background-color: #87D75F
-}
-
-div.highlight .-Color[class*=-C114] {
-  color: #87D787
-}
-
-div.highlight .-Color[class*=-BGC114] {
-  background-color: #87D787
-}
-
-div.highlight .-Color[class*=-C115] {
-  color: #87D7AF
-}
-
-div.highlight .-Color[class*=-BGC115] {
-  background-color: #87D7AF
-}
-
-div.highlight .-Color[class*=-C116] {
-  color: #87D7D7
-}
-
-div.highlight .-Color[class*=-BGC116] {
-  background-color: #87D7D7
-}
-
-div.highlight .-Color[class*=-C117] {
-  color: #87D7FF
-}
-
-div.highlight .-Color[class*=-BGC117] {
-  background-color: #87D7FF
-}
-
-div.highlight .-Color[class*=-C118] {
-  color: #87FF00
-}
-
-div.highlight .-Color[class*=-BGC118] {
-  background-color: #87FF00
-}
-
-div.highlight .-Color[class*=-C119] {
-  color: #87FF5F
-}
-
-div.highlight .-Color[class*=-BGC119] {
-  background-color: #87FF5F
-}
-
-div.highlight .-Color[class*=-C120] {
-  color: #87FF87
-}
-
-div.highlight .-Color[class*=-BGC120] {
-  background-color: #87FF87
-}
-
-div.highlight .-Color[class*=-C121] {
-  color: #87FFAF
-}
-
-div.highlight .-Color[class*=-BGC121] {
-  background-color: #87FFAF
-}
-
-div.highlight .-Color[class*=-C122] {
-  color: #87FFD7
-}
-
-div.highlight .-Color[class*=-BGC122] {
-  background-color: #87FFD7
-}
-
-div.highlight .-Color[class*=-C123] {
-  color: #87FFFF
-}
-
-div.highlight .-Color[class*=-BGC123] {
-  background-color: #87FFFF
-}
-
-div.highlight .-Color[class*=-C124] {
-  color: #AF0000
-}
-
-div.highlight .-Color[class*=-BGC124] {
-  background-color: #AF0000
-}
-
-div.highlight .-Color[class*=-C125] {
-  color: #AF005F
-}
-
-div.highlight .-Color[class*=-BGC125] {
-  background-color: #AF005F
-}
-
-div.highlight .-Color[class*=-C126] {
-  color: #AF0087
-}
-
-div.highlight .-Color[class*=-BGC126] {
-  background-color: #AF0087
-}
-
-div.highlight .-Color[class*=-C127] {
-  color: #AF00AF
-}
-
-div.highlight .-Color[class*=-BGC127] {
-  background-color: #AF00AF
-}
-
-div.highlight .-Color[class*=-C128] {
-  color: #AF00D7
-}
-
-div.highlight .-Color[class*=-BGC128] {
-  background-color: #AF00D7
-}
-
-div.highlight .-Color[class*=-C129] {
-  color: #AF00FF
-}
-
-div.highlight .-Color[class*=-BGC129] {
-  background-color: #AF00FF
-}
-
-div.highlight .-Color[class*=-C130] {
-  color: #AF5F00
-}
-
-div.highlight .-Color[class*=-BGC130] {
-  background-color: #AF5F00
-}
-
-div.highlight .-Color[class*=-C131] {
-  color: #AF5F5F
-}
-
-div.highlight .-Color[class*=-BGC131] {
-  background-color: #AF5F5F
-}
-
-div.highlight .-Color[class*=-C132] {
-  color: #AF5F87
-}
-
-div.highlight .-Color[class*=-BGC132] {
-  background-color: #AF5F87
-}
-
-div.highlight .-Color[class*=-C133] {
-  color: #AF5FAF
-}
-
-div.highlight .-Color[class*=-BGC133] {
-  background-color: #AF5FAF
-}
-
-div.highlight .-Color[class*=-C134] {
-  color: #AF5FD7
-}
-
-div.highlight .-Color[class*=-BGC134] {
-  background-color: #AF5FD7
-}
-
-div.highlight .-Color[class*=-C135] {
-  color: #AF5FFF
-}
-
-div.highlight .-Color[class*=-BGC135] {
-  background-color: #AF5FFF
-}
-
-div.highlight .-Color[class*=-C136] {
-  color: #AF8700
-}
-
-div.highlight .-Color[class*=-BGC136] {
-  background-color: #AF8700
-}
-
-div.highlight .-Color[class*=-C137] {
-  color: #AF875F
-}
-
-div.highlight .-Color[class*=-BGC137] {
-  background-color: #AF875F
-}
-
-div.highlight .-Color[class*=-C138] {
-  color: #AF8787
-}
-
-div.highlight .-Color[class*=-BGC138] {
-  background-color: #AF8787
-}
-
-div.highlight .-Color[class*=-C139] {
-  color: #AF87AF
-}
-
-div.highlight .-Color[class*=-BGC139] {
-  background-color: #AF87AF
-}
-
-div.highlight .-Color[class*=-C140] {
-  color: #AF87D7
-}
-
-div.highlight .-Color[class*=-BGC140] {
-  background-color: #AF87D7
-}
-
-div.highlight .-Color[class*=-C141] {
-  color: #AF87FF
-}
-
-div.highlight .-Color[class*=-BGC141] {
-  background-color: #AF87FF
-}
-
-div.highlight .-Color[class*=-C142] {
-  color: #AFAF00
-}
-
-div.highlight .-Color[class*=-BGC142] {
-  background-color: #AFAF00
-}
-
-div.highlight .-Color[class*=-C143] {
-  color: #AFAF5F
-}
-
-div.highlight .-Color[class*=-BGC143] {
-  background-color: #AFAF5F
-}
-
-div.highlight .-Color[class*=-C144] {
-  color: #AFAF87
-}
-
-div.highlight .-Color[class*=-BGC144] {
-  background-color: #AFAF87
-}
-
-div.highlight .-Color[class*=-C145] {
-  color: #AFAFAF
-}
-
-div.highlight .-Color[class*=-BGC145] {
-  background-color: #AFAFAF
-}
-
-div.highlight .-Color[class*=-C146] {
-  color: #AFAFD7
-}
-
-div.highlight .-Color[class*=-BGC146] {
-  background-color: #AFAFD7
-}
-
-div.highlight .-Color[class*=-C147] {
-  color: #AFAFFF
-}
-
-div.highlight .-Color[class*=-BGC147] {
-  background-color: #AFAFFF
-}
-
-div.highlight .-Color[class*=-C148] {
-  color: #AFD700
-}
-
-div.highlight .-Color[class*=-BGC148] {
-  background-color: #AFD700
-}
-
-div.highlight .-Color[class*=-C149] {
-  color: #AFD75F
-}
-
-div.highlight .-Color[class*=-BGC149] {
-  background-color: #AFD75F
-}
-
-div.highlight .-Color[class*=-C150] {
-  color: #AFD787
-}
-
-div.highlight .-Color[class*=-BGC150] {
-  background-color: #AFD787
-}
-
-div.highlight .-Color[class*=-C151] {
-  color: #AFD7AF
-}
-
-div.highlight .-Color[class*=-BGC151] {
-  background-color: #AFD7AF
-}
-
-div.highlight .-Color[class*=-C152] {
-  color: #AFD7D7
-}
-
-div.highlight .-Color[class*=-BGC152] {
-  background-color: #AFD7D7
-}
-
-div.highlight .-Color[class*=-C153] {
-  color: #AFD7FF
-}
-
-div.highlight .-Color[class*=-BGC153] {
-  background-color: #AFD7FF
-}
-
-div.highlight .-Color[class*=-C154] {
-  color: #AFFF00
-}
-
-div.highlight .-Color[class*=-BGC154] {
-  background-color: #AFFF00
-}
-
-div.highlight .-Color[class*=-C155] {
-  color: #AFFF5F
-}
-
-div.highlight .-Color[class*=-BGC155] {
-  background-color: #AFFF5F
-}
-
-div.highlight .-Color[class*=-C156] {
-  color: #AFFF87
-}
-
-div.highlight .-Color[class*=-BGC156] {
-  background-color: #AFFF87
-}
-
-div.highlight .-Color[class*=-C157] {
-  color: #AFFFAF
-}
-
-div.highlight .-Color[class*=-BGC157] {
-  background-color: #AFFFAF
-}
-
-div.highlight .-Color[class*=-C158] {
-  color: #AFFFD7
-}
-
-div.highlight .-Color[class*=-BGC158] {
-  background-color: #AFFFD7
-}
-
-div.highlight .-Color[class*=-C159] {
-  color: #AFFFFF
-}
-
-div.highlight .-Color[class*=-BGC159] {
-  background-color: #AFFFFF
-}
-
-div.highlight .-Color[class*=-C160] {
-  color: #D70000
-}
-
-div.highlight .-Color[class*=-BGC160] {
-  background-color: #D70000
-}
-
-div.highlight .-Color[class*=-C161] {
-  color: #D7005F
-}
-
-div.highlight .-Color[class*=-BGC161] {
-  background-color: #D7005F
-}
-
-div.highlight .-Color[class*=-C162] {
-  color: #D70087
-}
-
-div.highlight .-Color[class*=-BGC162] {
-  background-color: #D70087
-}
-
-div.highlight .-Color[class*=-C163] {
-  color: #D700AF
-}
-
-div.highlight .-Color[class*=-BGC163] {
-  background-color: #D700AF
-}
-
-div.highlight .-Color[class*=-C164] {
-  color: #D700D7
-}
-
-div.highlight .-Color[class*=-BGC164] {
-  background-color: #D700D7
-}
-
-div.highlight .-Color[class*=-C165] {
-  color: #D700FF
-}
-
-div.highlight .-Color[class*=-BGC165] {
-  background-color: #D700FF
-}
-
-div.highlight .-Color[class*=-C166] {
-  color: #D75F00
-}
-
-div.highlight .-Color[class*=-BGC166] {
-  background-color: #D75F00
-}
-
-div.highlight .-Color[class*=-C167] {
-  color: #D75F5F
-}
-
-div.highlight .-Color[class*=-BGC167] {
-  background-color: #D75F5F
-}
-
-div.highlight .-Color[class*=-C168] {
-  color: #D75F87
-}
-
-div.highlight .-Color[class*=-BGC168] {
-  background-color: #D75F87
-}
-
-div.highlight .-Color[class*=-C169] {
-  color: #D75FAF
-}
-
-div.highlight .-Color[class*=-BGC169] {
-  background-color: #D75FAF
-}
-
-div.highlight .-Color[class*=-C170] {
-  color: #D75FD7
-}
-
-div.highlight .-Color[class*=-BGC170] {
-  background-color: #D75FD7
-}
-
-div.highlight .-Color[class*=-C171] {
-  color: #D75FFF
-}
-
-div.highlight .-Color[class*=-BGC171] {
-  background-color: #D75FFF
-}
-
-div.highlight .-Color[class*=-C172] {
-  color: #D78700
-}
-
-div.highlight .-Color[class*=-BGC172] {
-  background-color: #D78700
-}
-
-div.highlight .-Color[class*=-C173] {
-  color: #D7875F
-}
-
-div.highlight .-Color[class*=-BGC173] {
-  background-color: #D7875F
-}
-
-div.highlight .-Color[class*=-C174] {
-  color: #D78787
-}
-
-div.highlight .-Color[class*=-BGC174] {
-  background-color: #D78787
-}
-
-div.highlight .-Color[class*=-C175] {
-  color: #D787AF
-}
-
-div.highlight .-Color[class*=-BGC175] {
-  background-color: #D787AF
-}
-
-div.highlight .-Color[class*=-C176] {
-  color: #D787D7
-}
-
-div.highlight .-Color[class*=-BGC176] {
-  background-color: #D787D7
-}
-
-div.highlight .-Color[class*=-C177] {
-  color: #D787FF
-}
-
-div.highlight .-Color[class*=-BGC177] {
-  background-color: #D787FF
-}
-
-div.highlight .-Color[class*=-C178] {
-  color: #D7AF00
-}
-
-div.highlight .-Color[class*=-BGC178] {
-  background-color: #D7AF00
-}
-
-div.highlight .-Color[class*=-C179] {
-  color: #D7AF5F
-}
-
-div.highlight .-Color[class*=-BGC179] {
-  background-color: #D7AF5F
-}
-
-div.highlight .-Color[class*=-C180] {
-  color: #D7AF87
-}
-
-div.highlight .-Color[class*=-BGC180] {
-  background-color: #D7AF87
-}
-
-div.highlight .-Color[class*=-C181] {
-  color: #D7AFAF
-}
-
-div.highlight .-Color[class*=-BGC181] {
-  background-color: #D7AFAF
-}
-
-div.highlight .-Color[class*=-C182] {
-  color: #D7AFD7
-}
-
-div.highlight .-Color[class*=-BGC182] {
-  background-color: #D7AFD7
-}
-
-div.highlight .-Color[class*=-C183] {
-  color: #D7AFFF
-}
-
-div.highlight .-Color[class*=-BGC183] {
-  background-color: #D7AFFF
-}
-
-div.highlight .-Color[class*=-C184] {
-  color: #D7D700
-}
-
-div.highlight .-Color[class*=-BGC184] {
-  background-color: #D7D700
-}
-
-div.highlight .-Color[class*=-C185] {
-  color: #D7D75F
-}
-
-div.highlight .-Color[class*=-BGC185] {
-  background-color: #D7D75F
-}
-
-div.highlight .-Color[class*=-C186] {
-  color: #D7D787
-}
-
-div.highlight .-Color[class*=-BGC186] {
-  background-color: #D7D787
-}
-
-div.highlight .-Color[class*=-C187] {
-  color: #D7D7AF
-}
-
-div.highlight .-Color[class*=-BGC187] {
-  background-color: #D7D7AF
-}
-
-div.highlight .-Color[class*=-C188] {
-  color: #D7D7D7
-}
-
-div.highlight .-Color[class*=-BGC188] {
-  background-color: #D7D7D7
-}
-
-div.highlight .-Color[class*=-C189] {
-  color: #D7D7FF
-}
-
-div.highlight .-Color[class*=-BGC189] {
-  background-color: #D7D7FF
-}
-
-div.highlight .-Color[class*=-C190] {
-  color: #D7FF00
-}
-
-div.highlight .-Color[class*=-BGC190] {
-  background-color: #D7FF00
-}
-
-div.highlight .-Color[class*=-C191] {
-  color: #D7FF5F
-}
-
-div.highlight .-Color[class*=-BGC191] {
-  background-color: #D7FF5F
-}
-
-div.highlight .-Color[class*=-C192] {
-  color: #D7FF87
-}
-
-div.highlight .-Color[class*=-BGC192] {
-  background-color: #D7FF87
-}
-
-div.highlight .-Color[class*=-C193] {
-  color: #D7FFAF
-}
-
-div.highlight .-Color[class*=-BGC193] {
-  background-color: #D7FFAF
-}
-
-div.highlight .-Color[class*=-C194] {
-  color: #D7FFD7
-}
-
-div.highlight .-Color[class*=-BGC194] {
-  background-color: #D7FFD7
-}
-
-div.highlight .-Color[class*=-C195] {
-  color: #D7FFFF
-}
-
-div.highlight .-Color[class*=-BGC195] {
-  background-color: #D7FFFF
-}
-
-div.highlight .-Color[class*=-C196] {
-  color: #FF0000
-}
-
-div.highlight .-Color[class*=-BGC196] {
-  background-color: #FF0000
-}
-
-div.highlight .-Color[class*=-C197] {
-  color: #FF005F
-}
-
-div.highlight .-Color[class*=-BGC197] {
-  background-color: #FF005F
-}
-
-div.highlight .-Color[class*=-C198] {
-  color: #FF0087
-}
-
-div.highlight .-Color[class*=-BGC198] {
-  background-color: #FF0087
-}
-
-div.highlight .-Color[class*=-C199] {
-  color: #FF00AF
-}
-
-div.highlight .-Color[class*=-BGC199] {
-  background-color: #FF00AF
-}
-
-div.highlight .-Color[class*=-C200] {
-  color: #FF00D7
-}
-
-div.highlight .-Color[class*=-BGC200] {
-  background-color: #FF00D7
-}
-
-div.highlight .-Color[class*=-C201] {
-  color: #FF00FF
-}
-
-div.highlight .-Color[class*=-BGC201] {
-  background-color: #FF00FF
-}
-
-div.highlight .-Color[class*=-C202] {
-  color: #FF5F00
-}
-
-div.highlight .-Color[class*=-BGC202] {
-  background-color: #FF5F00
-}
-
-div.highlight .-Color[class*=-C203] {
-  color: #FF5F5F
-}
-
-div.highlight .-Color[class*=-BGC203] {
-  background-color: #FF5F5F
-}
-
-div.highlight .-Color[class*=-C204] {
-  color: #FF5F87
-}
-
-div.highlight .-Color[class*=-BGC204] {
-  background-color: #FF5F87
-}
-
-div.highlight .-Color[class*=-C205] {
-  color: #FF5FAF
-}
-
-div.highlight .-Color[class*=-BGC205] {
-  background-color: #FF5FAF
-}
-
-div.highlight .-Color[class*=-C206] {
-  color: #FF5FD7
-}
-
-div.highlight .-Color[class*=-BGC206] {
-  background-color: #FF5FD7
-}
-
-div.highlight .-Color[class*=-C207] {
-  color: #FF5FFF
-}
-
-div.highlight .-Color[class*=-BGC207] {
-  background-color: #FF5FFF
-}
-
-div.highlight .-Color[class*=-C208] {
-  color: #FF8700
-}
-
-div.highlight .-Color[class*=-BGC208] {
-  background-color: #FF8700
-}
-
-div.highlight .-Color[class*=-C209] {
-  color: #FF875F
-}
-
-div.highlight .-Color[class*=-BGC209] {
-  background-color: #FF875F
-}
-
-div.highlight .-Color[class*=-C210] {
-  color: #FF8787
-}
-
-div.highlight .-Color[class*=-BGC210] {
-  background-color: #FF8787
-}
-
-div.highlight .-Color[class*=-C211] {
-  color: #FF87AF
-}
-
-div.highlight .-Color[class*=-BGC211] {
-  background-color: #FF87AF
-}
-
-div.highlight .-Color[class*=-C212] {
-  color: #FF87D7
-}
-
-div.highlight .-Color[class*=-BGC212] {
-  background-color: #FF87D7
-}
-
-div.highlight .-Color[class*=-C213] {
-  color: #FF87FF
-}
-
-div.highlight .-Color[class*=-BGC213] {
-  background-color: #FF87FF
-}
-
-div.highlight .-Color[class*=-C214] {
-  color: #FFAF00
-}
-
-div.highlight .-Color[class*=-BGC214] {
-  background-color: #FFAF00
-}
-
-div.highlight .-Color[class*=-C215] {
-  color: #FFAF5F
-}
-
-div.highlight .-Color[class*=-BGC215] {
-  background-color: #FFAF5F
-}
-
-div.highlight .-Color[class*=-C216] {
-  color: #FFAF87
-}
-
-div.highlight .-Color[class*=-BGC216] {
-  background-color: #FFAF87
-}
-
-div.highlight .-Color[class*=-C217] {
-  color: #FFAFAF
-}
-
-div.highlight .-Color[class*=-BGC217] {
-  background-color: #FFAFAF
-}
-
-div.highlight .-Color[class*=-C218] {
-  color: #FFAFD7
-}
-
-div.highlight .-Color[class*=-BGC218] {
-  background-color: #FFAFD7
-}
-
-div.highlight .-Color[class*=-C219] {
-  color: #FFAFFF
-}
-
-div.highlight .-Color[class*=-BGC219] {
-  background-color: #FFAFFF
-}
-
-div.highlight .-Color[class*=-C220] {
-  color: #FFD700
-}
-
-div.highlight .-Color[class*=-BGC220] {
-  background-color: #FFD700
-}
-
-div.highlight .-Color[class*=-C221] {
-  color: #FFD75F
-}
-
-div.highlight .-Color[class*=-BGC221] {
-  background-color: #FFD75F
-}
-
-div.highlight .-Color[class*=-C222] {
-  color: #FFD787
-}
-
-div.highlight .-Color[class*=-BGC222] {
-  background-color: #FFD787
-}
-
-div.highlight .-Color[class*=-C223] {
-  color: #FFD7AF
-}
-
-div.highlight .-Color[class*=-BGC223] {
-  background-color: #FFD7AF
-}
-
-div.highlight .-Color[class*=-C224] {
-  color: #FFD7D7
-}
-
-div.highlight .-Color[class*=-BGC224] {
-  background-color: #FFD7D7
-}
-
-div.highlight .-Color[class*=-C225] {
-  color: #FFD7FF
-}
-
-div.highlight .-Color[class*=-BGC225] {
-  background-color: #FFD7FF
-}
-
-div.highlight .-Color[class*=-C226] {
-  color: #FFFF00
-}
-
-div.highlight .-Color[class*=-BGC226] {
-  background-color: #FFFF00
-}
-
-div.highlight .-Color[class*=-C227] {
-  color: #FFFF5F
-}
-
-div.highlight .-Color[class*=-BGC227] {
-  background-color: #FFFF5F
-}
-
-div.highlight .-Color[class*=-C228] {
-  color: #FFFF87
-}
-
-div.highlight .-Color[class*=-BGC228] {
-  background-color: #FFFF87
-}
-
-div.highlight .-Color[class*=-C229] {
-  color: #FFFFAF
-}
-
-div.highlight .-Color[class*=-BGC229] {
-  background-color: #FFFFAF
-}
-
-div.highlight .-Color[class*=-C230] {
-  color: #FFFFD7
-}
-
-div.highlight .-Color[class*=-BGC230] {
-  background-color: #FFFFD7
-}
-
-div.highlight .-Color[class*=-C231] {
-  color: #FFFFFF
-}
-
-div.highlight .-Color[class*=-BGC231] {
-  background-color: #FFFFFF
-}
-
-div.highlight .-Color[class*=-C232] {
-  color: #080808
-}
-
-div.highlight .-Color[class*=-BGC232] {
-  background-color: #080808
-}
-
-div.highlight .-Color[class*=-C233] {
-  color: #121212
-}
-
-div.highlight .-Color[class*=-BGC233] {
-  background-color: #121212
-}
-
-div.highlight .-Color[class*=-C234] {
-  color: #1C1C1C
-}
-
-div.highlight .-Color[class*=-BGC234] {
-  background-color: #1C1C1C
-}
-
-div.highlight .-Color[class*=-C235] {
-  color: #262626
-}
-
-div.highlight .-Color[class*=-BGC235] {
-  background-color: #262626
-}
-
-div.highlight .-Color[class*=-C236] {
-  color: #303030
-}
-
-div.highlight .-Color[class*=-BGC236] {
-  background-color: #303030
-}
-
-div.highlight .-Color[class*=-C237] {
-  color: #3A3A3A
-}
-
-div.highlight .-Color[class*=-BGC237] {
-  background-color: #3A3A3A
-}
-
-div.highlight .-Color[class*=-C238] {
-  color: #444444
-}
-
-div.highlight .-Color[class*=-BGC238] {
-  background-color: #444444
-}
-
-div.highlight .-Color[class*=-C239] {
-  color: #4E4E4E
-}
-
-div.highlight .-Color[class*=-BGC239] {
-  background-color: #4E4E4E
-}
-
-div.highlight .-Color[class*=-C240] {
-  color: #585858
-}
-
-div.highlight .-Color[class*=-BGC240] {
-  background-color: #585858
-}
-
-div.highlight .-Color[class*=-C241] {
-  color: #626262
-}
-
-div.highlight .-Color[class*=-BGC241] {
-  background-color: #626262
-}
-
-div.highlight .-Color[class*=-C242] {
-  color: #6C6C6C
-}
-
-div.highlight .-Color[class*=-BGC242] {
-  background-color: #6C6C6C
-}
-
-div.highlight .-Color[class*=-C243] {
-  color: #767676
-}
-
-div.highlight .-Color[class*=-BGC243] {
-  background-color: #767676
-}
-
-div.highlight .-Color[class*=-C244] {
-  color: #808080
-}
-
-div.highlight .-Color[class*=-BGC244] {
-  background-color: #808080
-}
-
-div.highlight .-Color[class*=-C245] {
-  color: #8A8A8A
-}
-
-div.highlight .-Color[class*=-BGC245] {
-  background-color: #8A8A8A
-}
-
-div.highlight .-Color[class*=-C246] {
-  color: #949494
-}
-
-div.highlight .-Color[class*=-BGC246] {
-  background-color: #949494
-}
-
-div.highlight .-Color[class*=-C247] {
-  color: #9E9E9E
-}
-
-div.highlight .-Color[class*=-BGC247] {
-  background-color: #9E9E9E
-}
-
-div.highlight .-Color[class*=-C248] {
-  color: #A8A8A8
-}
-
-div.highlight .-Color[class*=-BGC248] {
-  background-color: #A8A8A8
-}
-
-div.highlight .-Color[class*=-C249] {
-  color: #B2B2B2
-}
-
-div.highlight .-Color[class*=-BGC249] {
-  background-color: #B2B2B2
-}
-
-div.highlight .-Color[class*=-C250] {
-  color: #BCBCBC
-}
-
-div.highlight .-Color[class*=-BGC250] {
-  background-color: #BCBCBC
-}
-
-div.highlight .-Color[class*=-C251] {
-  color: #C6C6C6
-}
-
-div.highlight .-Color[class*=-BGC251] {
-  background-color: #C6C6C6
-}
-
-div.highlight .-Color[class*=-C252] {
-  color: #D0D0D0
-}
-
-div.highlight .-Color[class*=-BGC252] {
-  background-color: #D0D0D0
-}
-
-div.highlight .-Color[class*=-C253] {
-  color: #DADADA
-}
-
-div.highlight .-Color[class*=-BGC253] {
-  background-color: #DADADA
-}
-
-div.highlight .-Color[class*=-C254] {
-  color: #E4E4E4
-}
-
-div.highlight .-Color[class*=-BGC254] {
-  background-color: #E4E4E4
-}
-
-div.highlight .-Color[class*=-C255] {
-  color: #EEEEEE
-}
-
-div.highlight .-Color[class*=-BGC255] {
-  background-color: #EEEEEE
-}
diff --git a/docs/_build/html/_static/plus.png b/docs/_build/html/_static/plus.png
deleted file mode 100644
index 7107cec..0000000
Binary files a/docs/_build/html/_static/plus.png and /dev/null differ
diff --git a/docs/_build/html/_static/pygments.css b/docs/_build/html/_static/pygments.css
deleted file mode 100644
index 997797f..0000000
--- a/docs/_build/html/_static/pygments.css
+++ /dev/null
@@ -1,152 +0,0 @@
-html[data-theme="light"] .highlight pre { line-height: 125%; }
-html[data-theme="light"] .highlight td.linenos .normal { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
-html[data-theme="light"] .highlight span.linenos { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
-html[data-theme="light"] .highlight td.linenos .special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
-html[data-theme="light"] .highlight span.linenos.special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
-html[data-theme="light"] .highlight .hll { background-color: #7971292e }
-html[data-theme="light"] .highlight { background: #fefefe; color: #545454 }
-html[data-theme="light"] .highlight .c { color: #797129 } /* Comment */
-html[data-theme="light"] .highlight .err { color: #d91e18 } /* Error */
-html[data-theme="light"] .highlight .k { color: #7928a1 } /* Keyword */
-html[data-theme="light"] .highlight .l { color: #797129 } /* Literal */
-html[data-theme="light"] .highlight .n { color: #545454 } /* Name */
-html[data-theme="light"] .highlight .o { color: #008000 } /* Operator */
-html[data-theme="light"] .highlight .p { color: #545454 } /* Punctuation */
-html[data-theme="light"] .highlight .ch { color: #797129 } /* Comment.Hashbang */
-html[data-theme="light"] .highlight .cm { color: #797129 } /* Comment.Multiline */
-html[data-theme="light"] .highlight .cp { color: #797129 } /* Comment.Preproc */
-html[data-theme="light"] .highlight .cpf { color: #797129 } /* Comment.PreprocFile */
-html[data-theme="light"] .highlight .c1 { color: #797129 } /* Comment.Single */
-html[data-theme="light"] .highlight .cs { color: #797129 } /* Comment.Special */
-html[data-theme="light"] .highlight .gd { color: #007faa } /* Generic.Deleted */
-html[data-theme="light"] .highlight .ge { font-style: italic } /* Generic.Emph */
-html[data-theme="light"] .highlight .gh { color: #007faa } /* Generic.Heading */
-html[data-theme="light"] .highlight .gs { font-weight: bold } /* Generic.Strong */
-html[data-theme="light"] .highlight .gu { color: #007faa } /* Generic.Subheading */
-html[data-theme="light"] .highlight .kc { color: #7928a1 } /* Keyword.Constant */
-html[data-theme="light"] .highlight .kd { color: #7928a1 } /* Keyword.Declaration */
-html[data-theme="light"] .highlight .kn { color: #7928a1 } /* Keyword.Namespace */
-html[data-theme="light"] .highlight .kp { color: #7928a1 } /* Keyword.Pseudo */
-html[data-theme="light"] .highlight .kr { color: #7928a1 } /* Keyword.Reserved */
-html[data-theme="light"] .highlight .kt { color: #797129 } /* Keyword.Type */
-html[data-theme="light"] .highlight .ld { color: #797129 } /* Literal.Date */
-html[data-theme="light"] .highlight .m { color: #797129 } /* Literal.Number */
-html[data-theme="light"] .highlight .s { color: #008000 } /* Literal.String */
-html[data-theme="light"] .highlight .na { color: #797129 } /* Name.Attribute */
-html[data-theme="light"] .highlight .nb { color: #797129 } /* Name.Builtin */
-html[data-theme="light"] .highlight .nc { color: #007faa } /* Name.Class */
-html[data-theme="light"] .highlight .no { color: #007faa } /* Name.Constant */
-html[data-theme="light"] .highlight .nd { color: #797129 } /* Name.Decorator */
-html[data-theme="light"] .highlight .ni { color: #008000 } /* Name.Entity */
-html[data-theme="light"] .highlight .ne { color: #7928a1 } /* Name.Exception */
-html[data-theme="light"] .highlight .nf { color: #007faa } /* Name.Function */
-html[data-theme="light"] .highlight .nl { color: #797129 } /* Name.Label */
-html[data-theme="light"] .highlight .nn { color: #545454 } /* Name.Namespace */
-html[data-theme="light"] .highlight .nx { color: #545454 } /* Name.Other */
-html[data-theme="light"] .highlight .py { color: #007faa } /* Name.Property */
-html[data-theme="light"] .highlight .nt { color: #007faa } /* Name.Tag */
-html[data-theme="light"] .highlight .nv { color: #d91e18 } /* Name.Variable */
-html[data-theme="light"] .highlight .ow { color: #7928a1 } /* Operator.Word */
-html[data-theme="light"] .highlight .pm { color: #545454 } /* Punctuation.Marker */
-html[data-theme="light"] .highlight .w { color: #545454 } /* Text.Whitespace */
-html[data-theme="light"] .highlight .mb { color: #797129 } /* Literal.Number.Bin */
-html[data-theme="light"] .highlight .mf { color: #797129 } /* Literal.Number.Float */
-html[data-theme="light"] .highlight .mh { color: #797129 } /* Literal.Number.Hex */
-html[data-theme="light"] .highlight .mi { color: #797129 } /* Literal.Number.Integer */
-html[data-theme="light"] .highlight .mo { color: #797129 } /* Literal.Number.Oct */
-html[data-theme="light"] .highlight .sa { color: #008000 } /* Literal.String.Affix */
-html[data-theme="light"] .highlight .sb { color: #008000 } /* Literal.String.Backtick */
-html[data-theme="light"] .highlight .sc { color: #008000 } /* Literal.String.Char */
-html[data-theme="light"] .highlight .dl { color: #008000 } /* Literal.String.Delimiter */
-html[data-theme="light"] .highlight .sd { color: #008000 } /* Literal.String.Doc */
-html[data-theme="light"] .highlight .s2 { color: #008000 } /* Literal.String.Double */
-html[data-theme="light"] .highlight .se { color: #008000 } /* Literal.String.Escape */
-html[data-theme="light"] .highlight .sh { color: #008000 } /* Literal.String.Heredoc */
-html[data-theme="light"] .highlight .si { color: #008000 } /* Literal.String.Interpol */
-html[data-theme="light"] .highlight .sx { color: #008000 } /* Literal.String.Other */
-html[data-theme="light"] .highlight .sr { color: #d91e18 } /* Literal.String.Regex */
-html[data-theme="light"] .highlight .s1 { color: #008000 } /* Literal.String.Single */
-html[data-theme="light"] .highlight .ss { color: #007faa } /* Literal.String.Symbol */
-html[data-theme="light"] .highlight .bp { color: #797129 } /* Name.Builtin.Pseudo */
-html[data-theme="light"] .highlight .fm { color: #007faa } /* Name.Function.Magic */
-html[data-theme="light"] .highlight .vc { color: #d91e18 } /* Name.Variable.Class */
-html[data-theme="light"] .highlight .vg { color: #d91e18 } /* Name.Variable.Global */
-html[data-theme="light"] .highlight .vi { color: #d91e18 } /* Name.Variable.Instance */
-html[data-theme="light"] .highlight .vm { color: #797129 } /* Name.Variable.Magic */
-html[data-theme="light"] .highlight .il { color: #797129 } /* Literal.Number.Integer.Long */
-html[data-theme="dark"] .highlight pre { line-height: 125%; }
-html[data-theme="dark"] .highlight td.linenos .normal { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
-html[data-theme="dark"] .highlight span.linenos { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
-html[data-theme="dark"] .highlight td.linenos .special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
-html[data-theme="dark"] .highlight span.linenos.special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
-html[data-theme="dark"] .highlight .hll { background-color: #ffd9002e }
-html[data-theme="dark"] .highlight { background: #2b2b2b; color: #f8f8f2 }
-html[data-theme="dark"] .highlight .c { color: #ffd900 } /* Comment */
-html[data-theme="dark"] .highlight .err { color: #ffa07a } /* Error */
-html[data-theme="dark"] .highlight .k { color: #dcc6e0 } /* Keyword */
-html[data-theme="dark"] .highlight .l { color: #ffd900 } /* Literal */
-html[data-theme="dark"] .highlight .n { color: #f8f8f2 } /* Name */
-html[data-theme="dark"] .highlight .o { color: #abe338 } /* Operator */
-html[data-theme="dark"] .highlight .p { color: #f8f8f2 } /* Punctuation */
-html[data-theme="dark"] .highlight .ch { color: #ffd900 } /* Comment.Hashbang */
-html[data-theme="dark"] .highlight .cm { color: #ffd900 } /* Comment.Multiline */
-html[data-theme="dark"] .highlight .cp { color: #ffd900 } /* Comment.Preproc */
-html[data-theme="dark"] .highlight .cpf { color: #ffd900 } /* Comment.PreprocFile */
-html[data-theme="dark"] .highlight .c1 { color: #ffd900 } /* Comment.Single */
-html[data-theme="dark"] .highlight .cs { color: #ffd900 } /* Comment.Special */
-html[data-theme="dark"] .highlight .gd { color: #00e0e0 } /* Generic.Deleted */
-html[data-theme="dark"] .highlight .ge { font-style: italic } /* Generic.Emph */
-html[data-theme="dark"] .highlight .gh { color: #00e0e0 } /* Generic.Heading */
-html[data-theme="dark"] .highlight .gs { font-weight: bold } /* Generic.Strong */
-html[data-theme="dark"] .highlight .gu { color: #00e0e0 } /* Generic.Subheading */
-html[data-theme="dark"] .highlight .kc { color: #dcc6e0 } /* Keyword.Constant */
-html[data-theme="dark"] .highlight .kd { color: #dcc6e0 } /* Keyword.Declaration */
-html[data-theme="dark"] .highlight .kn { color: #dcc6e0 } /* Keyword.Namespace */
-html[data-theme="dark"] .highlight .kp { color: #dcc6e0 } /* Keyword.Pseudo */
-html[data-theme="dark"] .highlight .kr { color: #dcc6e0 } /* Keyword.Reserved */
-html[data-theme="dark"] .highlight .kt { color: #ffd900 } /* Keyword.Type */
-html[data-theme="dark"] .highlight .ld { color: #ffd900 } /* Literal.Date */
-html[data-theme="dark"] .highlight .m { color: #ffd900 } /* Literal.Number */
-html[data-theme="dark"] .highlight .s { color: #abe338 } /* Literal.String */
-html[data-theme="dark"] .highlight .na { color: #ffd900 } /* Name.Attribute */
-html[data-theme="dark"] .highlight .nb { color: #ffd900 } /* Name.Builtin */
-html[data-theme="dark"] .highlight .nc { color: #00e0e0 } /* Name.Class */
-html[data-theme="dark"] .highlight .no { color: #00e0e0 } /* Name.Constant */
-html[data-theme="dark"] .highlight .nd { color: #ffd900 } /* Name.Decorator */
-html[data-theme="dark"] .highlight .ni { color: #abe338 } /* Name.Entity */
-html[data-theme="dark"] .highlight .ne { color: #dcc6e0 } /* Name.Exception */
-html[data-theme="dark"] .highlight .nf { color: #00e0e0 } /* Name.Function */
-html[data-theme="dark"] .highlight .nl { color: #ffd900 } /* Name.Label */
-html[data-theme="dark"] .highlight .nn { color: #f8f8f2 } /* Name.Namespace */
-html[data-theme="dark"] .highlight .nx { color: #f8f8f2 } /* Name.Other */
-html[data-theme="dark"] .highlight .py { color: #00e0e0 } /* Name.Property */
-html[data-theme="dark"] .highlight .nt { color: #00e0e0 } /* Name.Tag */
-html[data-theme="dark"] .highlight .nv { color: #ffa07a } /* Name.Variable */
-html[data-theme="dark"] .highlight .ow { color: #dcc6e0 } /* Operator.Word */
-html[data-theme="dark"] .highlight .pm { color: #f8f8f2 } /* Punctuation.Marker */
-html[data-theme="dark"] .highlight .w { color: #f8f8f2 } /* Text.Whitespace */
-html[data-theme="dark"] .highlight .mb { color: #ffd900 } /* Literal.Number.Bin */
-html[data-theme="dark"] .highlight .mf { color: #ffd900 } /* Literal.Number.Float */
-html[data-theme="dark"] .highlight .mh { color: #ffd900 } /* Literal.Number.Hex */
-html[data-theme="dark"] .highlight .mi { color: #ffd900 } /* Literal.Number.Integer */
-html[data-theme="dark"] .highlight .mo { color: #ffd900 } /* Literal.Number.Oct */
-html[data-theme="dark"] .highlight .sa { color: #abe338 } /* Literal.String.Affix */
-html[data-theme="dark"] .highlight .sb { color: #abe338 } /* Literal.String.Backtick */
-html[data-theme="dark"] .highlight .sc { color: #abe338 } /* Literal.String.Char */
-html[data-theme="dark"] .highlight .dl { color: #abe338 } /* Literal.String.Delimiter */
-html[data-theme="dark"] .highlight .sd { color: #abe338 } /* Literal.String.Doc */
-html[data-theme="dark"] .highlight .s2 { color: #abe338 } /* Literal.String.Double */
-html[data-theme="dark"] .highlight .se { color: #abe338 } /* Literal.String.Escape */
-html[data-theme="dark"] .highlight .sh { color: #abe338 } /* Literal.String.Heredoc */
-html[data-theme="dark"] .highlight .si { color: #abe338 } /* Literal.String.Interpol */
-html[data-theme="dark"] .highlight .sx { color: #abe338 } /* Literal.String.Other */
-html[data-theme="dark"] .highlight .sr { color: #ffa07a } /* Literal.String.Regex */
-html[data-theme="dark"] .highlight .s1 { color: #abe338 } /* Literal.String.Single */
-html[data-theme="dark"] .highlight .ss { color: #00e0e0 } /* Literal.String.Symbol */
-html[data-theme="dark"] .highlight .bp { color: #ffd900 } /* Name.Builtin.Pseudo */
-html[data-theme="dark"] .highlight .fm { color: #00e0e0 } /* Name.Function.Magic */
-html[data-theme="dark"] .highlight .vc { color: #ffa07a } /* Name.Variable.Class */
-html[data-theme="dark"] .highlight .vg { color: #ffa07a } /* Name.Variable.Global */
-html[data-theme="dark"] .highlight .vi { color: #ffa07a } /* Name.Variable.Instance */
-html[data-theme="dark"] .highlight .vm { color: #ffd900 } /* Name.Variable.Magic */
-html[data-theme="dark"] .highlight .il { color: #ffd900 } /* Literal.Number.Integer.Long */
\ No newline at end of file
diff --git a/docs/_build/html/_static/sbt-webpack-macros.html b/docs/_build/html/_static/sbt-webpack-macros.html
deleted file mode 100644
index 6cbf559..0000000
--- a/docs/_build/html/_static/sbt-webpack-macros.html
+++ /dev/null
@@ -1,11 +0,0 @@
-<!--
-  All these macros are auto-generated and must **NOT** be edited by hand.
-  See the webpack.config.js file, to learn more about how this is generated.
--->
-{% macro head_pre_bootstrap() %}
-  <link href="{{ pathto('_static/styles/sphinx-book-theme.css', 1) }}" rel="stylesheet">
-{% endmacro %}
-
-{% macro body_post() %}
-  <script src="{{ pathto('_static/scripts/sphinx-book-theme.js', 1) }}"></script>
-{% endmacro %}
diff --git a/docs/_build/html/_static/scripts/bootstrap.js b/docs/_build/html/_static/scripts/bootstrap.js
deleted file mode 100644
index bda8a60..0000000
--- a/docs/_build/html/_static/scripts/bootstrap.js
+++ /dev/null
@@ -1,3 +0,0 @@
-/*! For license information please see bootstrap.js.LICENSE.txt */
-(()=>{"use strict";var t={d:(e,i)=>{for(var n in i)t.o(i,n)&&!t.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:i[n]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e),r:t=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})}},e={};t.r(e),t.d(e,{afterMain:()=>w,afterRead:()=>b,afterWrite:()=>T,applyStyles:()=>D,arrow:()=>G,auto:()=>r,basePlacements:()=>a,beforeMain:()=>v,beforeRead:()=>g,beforeWrite:()=>E,bottom:()=>n,clippingParents:()=>h,computeStyles:()=>et,createPopper:()=>St,createPopperBase:()=>Lt,createPopperLite:()=>Dt,detectOverflow:()=>gt,end:()=>c,eventListeners:()=>nt,flip:()=>_t,hide:()=>yt,left:()=>o,main:()=>y,modifierPhases:()=>C,offset:()=>wt,placements:()=>m,popper:()=>u,popperGenerator:()=>kt,popperOffsets:()=>Et,preventOverflow:()=>At,read:()=>_,reference:()=>f,right:()=>s,start:()=>l,top:()=>i,variationPlacements:()=>p,viewport:()=>d,write:()=>A});var i="top",n="bottom",s="right",o="left",r="auto",a=[i,n,s,o],l="start",c="end",h="clippingParents",d="viewport",u="popper",f="reference",p=a.reduce((function(t,e){return t.concat([e+"-"+l,e+"-"+c])}),[]),m=[].concat(a,[r]).reduce((function(t,e){return t.concat([e,e+"-"+l,e+"-"+c])}),[]),g="beforeRead",_="read",b="afterRead",v="beforeMain",y="main",w="afterMain",E="beforeWrite",A="write",T="afterWrite",C=[g,_,b,v,y,w,E,A,T];function O(t){return t?(t.nodeName||"").toLowerCase():null}function x(t){if(null==t)return window;if("[object Window]"!==t.toString()){var e=t.ownerDocument;return e&&e.defaultView||window}return t}function k(t){return t instanceof x(t).Element||t instanceof Element}function L(t){return t instanceof x(t).HTMLElement||t instanceof HTMLElement}function S(t){return"undefined"!=typeof ShadowRoot&&(t instanceof x(t).ShadowRoot||t instanceof ShadowRoot)}const D={name:"applyStyles",enabled:!0,phase:"write",fn:function(t){var e=t.state;Object.keys(e.elements).forEach((function(t){var i=e.styles[t]||{},n=e.attributes[t]||{},s=e.elements[t];L(s)&&O(s)&&(Object.assign(s.style,i),Object.keys(n).forEach((function(t){var e=n[t];!1===e?s.removeAttribute(t):s.setAttribute(t,!0===e?"":e)})))}))},effect:function(t){var e=t.state,i={popper:{position:e.options.strategy,left:"0",top:"0",margin:"0"},arrow:{position:"absolute"},reference:{}};return Object.assign(e.elements.popper.style,i.popper),e.styles=i,e.elements.arrow&&Object.assign(e.elements.arrow.style,i.arrow),function(){Object.keys(e.elements).forEach((function(t){var n=e.elements[t],s=e.attributes[t]||{},o=Object.keys(e.styles.hasOwnProperty(t)?e.styles[t]:i[t]).reduce((function(t,e){return t[e]="",t}),{});L(n)&&O(n)&&(Object.assign(n.style,o),Object.keys(s).forEach((function(t){n.removeAttribute(t)})))}))}},requires:["computeStyles"]};function $(t){return t.split("-")[0]}var I=Math.max,N=Math.min,P=Math.round;function M(){var t=navigator.userAgentData;return null!=t&&t.brands&&Array.isArray(t.brands)?t.brands.map((function(t){return t.brand+"/"+t.version})).join(" "):navigator.userAgent}function j(){return!/^((?!chrome|android).)*safari/i.test(M())}function F(t,e,i){void 0===e&&(e=!1),void 0===i&&(i=!1);var n=t.getBoundingClientRect(),s=1,o=1;e&&L(t)&&(s=t.offsetWidth>0&&P(n.width)/t.offsetWidth||1,o=t.offsetHeight>0&&P(n.height)/t.offsetHeight||1);var r=(k(t)?x(t):window).visualViewport,a=!j()&&i,l=(n.left+(a&&r?r.offsetLeft:0))/s,c=(n.top+(a&&r?r.offsetTop:0))/o,h=n.width/s,d=n.height/o;return{width:h,height:d,top:c,right:l+h,bottom:c+d,left:l,x:l,y:c}}function H(t){var e=F(t),i=t.offsetWidth,n=t.offsetHeight;return Math.abs(e.width-i)<=1&&(i=e.width),Math.abs(e.height-n)<=1&&(n=e.height),{x:t.offsetLeft,y:t.offsetTop,width:i,height:n}}function B(t,e){var i=e.getRootNode&&e.getRootNode();if(t.contains(e))return!0;if(i&&S(i)){var n=e;do{if(n&&t.isSameNode(n))return!0;n=n.parentNode||n.host}while(n)}return!1}function W(t){return x(t).getComputedStyle(t)}function z(t){return["table","td","th"].indexOf(O(t))>=0}function R(t){return((k(t)?t.ownerDocument:t.document)||window.document).documentElement}function q(t){return"html"===O(t)?t:t.assignedSlot||t.parentNode||(S(t)?t.host:null)||R(t)}function V(t){return L(t)&&"fixed"!==W(t).position?t.offsetParent:null}function Y(t){for(var e=x(t),i=V(t);i&&z(i)&&"static"===W(i).position;)i=V(i);return i&&("html"===O(i)||"body"===O(i)&&"static"===W(i).position)?e:i||function(t){var e=/firefox/i.test(M());if(/Trident/i.test(M())&&L(t)&&"fixed"===W(t).position)return null;var i=q(t);for(S(i)&&(i=i.host);L(i)&&["html","body"].indexOf(O(i))<0;){var n=W(i);if("none"!==n.transform||"none"!==n.perspective||"paint"===n.contain||-1!==["transform","perspective"].indexOf(n.willChange)||e&&"filter"===n.willChange||e&&n.filter&&"none"!==n.filter)return i;i=i.parentNode}return null}(t)||e}function K(t){return["top","bottom"].indexOf(t)>=0?"x":"y"}function Q(t,e,i){return I(t,N(e,i))}function X(t){return Object.assign({},{top:0,right:0,bottom:0,left:0},t)}function U(t,e){return e.reduce((function(e,i){return e[i]=t,e}),{})}const G={name:"arrow",enabled:!0,phase:"main",fn:function(t){var e,r=t.state,l=t.name,c=t.options,h=r.elements.arrow,d=r.modifiersData.popperOffsets,u=$(r.placement),f=K(u),p=[o,s].indexOf(u)>=0?"height":"width";if(h&&d){var m=function(t,e){return X("number"!=typeof(t="function"==typeof t?t(Object.assign({},e.rects,{placement:e.placement})):t)?t:U(t,a))}(c.padding,r),g=H(h),_="y"===f?i:o,b="y"===f?n:s,v=r.rects.reference[p]+r.rects.reference[f]-d[f]-r.rects.popper[p],y=d[f]-r.rects.reference[f],w=Y(h),E=w?"y"===f?w.clientHeight||0:w.clientWidth||0:0,A=v/2-y/2,T=m[_],C=E-g[p]-m[b],O=E/2-g[p]/2+A,x=Q(T,O,C),k=f;r.modifiersData[l]=((e={})[k]=x,e.centerOffset=x-O,e)}},effect:function(t){var e=t.state,i=t.options.element,n=void 0===i?"[data-popper-arrow]":i;null!=n&&("string"!=typeof n||(n=e.elements.popper.querySelector(n)))&&B(e.elements.popper,n)&&(e.elements.arrow=n)},requires:["popperOffsets"],requiresIfExists:["preventOverflow"]};function J(t){return t.split("-")[1]}var Z={top:"auto",right:"auto",bottom:"auto",left:"auto"};function tt(t){var e,r=t.popper,a=t.popperRect,l=t.placement,h=t.variation,d=t.offsets,u=t.position,f=t.gpuAcceleration,p=t.adaptive,m=t.roundOffsets,g=t.isFixed,_=d.x,b=void 0===_?0:_,v=d.y,y=void 0===v?0:v,w="function"==typeof m?m({x:b,y}):{x:b,y};b=w.x,y=w.y;var E=d.hasOwnProperty("x"),A=d.hasOwnProperty("y"),T=o,C=i,O=window;if(p){var k=Y(r),L="clientHeight",S="clientWidth";k===x(r)&&"static"!==W(k=R(r)).position&&"absolute"===u&&(L="scrollHeight",S="scrollWidth"),(l===i||(l===o||l===s)&&h===c)&&(C=n,y-=(g&&k===O&&O.visualViewport?O.visualViewport.height:k[L])-a.height,y*=f?1:-1),l!==o&&(l!==i&&l!==n||h!==c)||(T=s,b-=(g&&k===O&&O.visualViewport?O.visualViewport.width:k[S])-a.width,b*=f?1:-1)}var D,$=Object.assign({position:u},p&&Z),I=!0===m?function(t,e){var i=t.x,n=t.y,s=e.devicePixelRatio||1;return{x:P(i*s)/s||0,y:P(n*s)/s||0}}({x:b,y},x(r)):{x:b,y};return b=I.x,y=I.y,f?Object.assign({},$,((D={})[C]=A?"0":"",D[T]=E?"0":"",D.transform=(O.devicePixelRatio||1)<=1?"translate("+b+"px, "+y+"px)":"translate3d("+b+"px, "+y+"px, 0)",D)):Object.assign({},$,((e={})[C]=A?y+"px":"",e[T]=E?b+"px":"",e.transform="",e))}const et={name:"computeStyles",enabled:!0,phase:"beforeWrite",fn:function(t){var e=t.state,i=t.options,n=i.gpuAcceleration,s=void 0===n||n,o=i.adaptive,r=void 0===o||o,a=i.roundOffsets,l=void 0===a||a,c={placement:$(e.placement),variation:J(e.placement),popper:e.elements.popper,popperRect:e.rects.popper,gpuAcceleration:s,isFixed:"fixed"===e.options.strategy};null!=e.modifiersData.popperOffsets&&(e.styles.popper=Object.assign({},e.styles.popper,tt(Object.assign({},c,{offsets:e.modifiersData.popperOffsets,position:e.options.strategy,adaptive:r,roundOffsets:l})))),null!=e.modifiersData.arrow&&(e.styles.arrow=Object.assign({},e.styles.arrow,tt(Object.assign({},c,{offsets:e.modifiersData.arrow,position:"absolute",adaptive:!1,roundOffsets:l})))),e.attributes.popper=Object.assign({},e.attributes.popper,{"data-popper-placement":e.placement})},data:{}};var it={passive:!0};const nt={name:"eventListeners",enabled:!0,phase:"write",fn:function(){},effect:function(t){var e=t.state,i=t.instance,n=t.options,s=n.scroll,o=void 0===s||s,r=n.resize,a=void 0===r||r,l=x(e.elements.popper),c=[].concat(e.scrollParents.reference,e.scrollParents.popper);return o&&c.forEach((function(t){t.addEventListener("scroll",i.update,it)})),a&&l.addEventListener("resize",i.update,it),function(){o&&c.forEach((function(t){t.removeEventListener("scroll",i.update,it)})),a&&l.removeEventListener("resize",i.update,it)}},data:{}};var st={left:"right",right:"left",bottom:"top",top:"bottom"};function ot(t){return t.replace(/left|right|bottom|top/g,(function(t){return st[t]}))}var rt={start:"end",end:"start"};function at(t){return t.replace(/start|end/g,(function(t){return rt[t]}))}function lt(t){var e=x(t);return{scrollLeft:e.pageXOffset,scrollTop:e.pageYOffset}}function ct(t){return F(R(t)).left+lt(t).scrollLeft}function ht(t){var e=W(t),i=e.overflow,n=e.overflowX,s=e.overflowY;return/auto|scroll|overlay|hidden/.test(i+s+n)}function dt(t){return["html","body","#document"].indexOf(O(t))>=0?t.ownerDocument.body:L(t)&&ht(t)?t:dt(q(t))}function ut(t,e){var i;void 0===e&&(e=[]);var n=dt(t),s=n===(null==(i=t.ownerDocument)?void 0:i.body),o=x(n),r=s?[o].concat(o.visualViewport||[],ht(n)?n:[]):n,a=e.concat(r);return s?a:a.concat(ut(q(r)))}function ft(t){return Object.assign({},t,{left:t.x,top:t.y,right:t.x+t.width,bottom:t.y+t.height})}function pt(t,e,i){return e===d?ft(function(t,e){var i=x(t),n=R(t),s=i.visualViewport,o=n.clientWidth,r=n.clientHeight,a=0,l=0;if(s){o=s.width,r=s.height;var c=j();(c||!c&&"fixed"===e)&&(a=s.offsetLeft,l=s.offsetTop)}return{width:o,height:r,x:a+ct(t),y:l}}(t,i)):k(e)?function(t,e){var i=F(t,!1,"fixed"===e);return i.top=i.top+t.clientTop,i.left=i.left+t.clientLeft,i.bottom=i.top+t.clientHeight,i.right=i.left+t.clientWidth,i.width=t.clientWidth,i.height=t.clientHeight,i.x=i.left,i.y=i.top,i}(e,i):ft(function(t){var e,i=R(t),n=lt(t),s=null==(e=t.ownerDocument)?void 0:e.body,o=I(i.scrollWidth,i.clientWidth,s?s.scrollWidth:0,s?s.clientWidth:0),r=I(i.scrollHeight,i.clientHeight,s?s.scrollHeight:0,s?s.clientHeight:0),a=-n.scrollLeft+ct(t),l=-n.scrollTop;return"rtl"===W(s||i).direction&&(a+=I(i.clientWidth,s?s.clientWidth:0)-o),{width:o,height:r,x:a,y:l}}(R(t)))}function mt(t){var e,r=t.reference,a=t.element,h=t.placement,d=h?$(h):null,u=h?J(h):null,f=r.x+r.width/2-a.width/2,p=r.y+r.height/2-a.height/2;switch(d){case i:e={x:f,y:r.y-a.height};break;case n:e={x:f,y:r.y+r.height};break;case s:e={x:r.x+r.width,y:p};break;case o:e={x:r.x-a.width,y:p};break;default:e={x:r.x,y:r.y}}var m=d?K(d):null;if(null!=m){var g="y"===m?"height":"width";switch(u){case l:e[m]=e[m]-(r[g]/2-a[g]/2);break;case c:e[m]=e[m]+(r[g]/2-a[g]/2)}}return e}function gt(t,e){void 0===e&&(e={});var o=e,r=o.placement,l=void 0===r?t.placement:r,c=o.strategy,p=void 0===c?t.strategy:c,m=o.boundary,g=void 0===m?h:m,_=o.rootBoundary,b=void 0===_?d:_,v=o.elementContext,y=void 0===v?u:v,w=o.altBoundary,E=void 0!==w&&w,A=o.padding,T=void 0===A?0:A,C=X("number"!=typeof T?T:U(T,a)),x=y===u?f:u,S=t.rects.popper,D=t.elements[E?x:y],$=function(t,e,i,n){var s="clippingParents"===e?function(t){var e=ut(q(t)),i=["absolute","fixed"].indexOf(W(t).position)>=0&&L(t)?Y(t):t;return k(i)?e.filter((function(t){return k(t)&&B(t,i)&&"body"!==O(t)})):[]}(t):[].concat(e),o=[].concat(s,[i]),r=o[0],a=o.reduce((function(e,i){var s=pt(t,i,n);return e.top=I(s.top,e.top),e.right=N(s.right,e.right),e.bottom=N(s.bottom,e.bottom),e.left=I(s.left,e.left),e}),pt(t,r,n));return a.width=a.right-a.left,a.height=a.bottom-a.top,a.x=a.left,a.y=a.top,a}(k(D)?D:D.contextElement||R(t.elements.popper),g,b,p),P=F(t.elements.reference),M=mt({reference:P,element:S,strategy:"absolute",placement:l}),j=ft(Object.assign({},S,M)),H=y===u?j:P,z={top:$.top-H.top+C.top,bottom:H.bottom-$.bottom+C.bottom,left:$.left-H.left+C.left,right:H.right-$.right+C.right},V=t.modifiersData.offset;if(y===u&&V){var K=V[l];Object.keys(z).forEach((function(t){var e=[s,n].indexOf(t)>=0?1:-1,o=[i,n].indexOf(t)>=0?"y":"x";z[t]+=K[o]*e}))}return z}const _t={name:"flip",enabled:!0,phase:"main",fn:function(t){var e=t.state,c=t.options,h=t.name;if(!e.modifiersData[h]._skip){for(var d=c.mainAxis,u=void 0===d||d,f=c.altAxis,g=void 0===f||f,_=c.fallbackPlacements,b=c.padding,v=c.boundary,y=c.rootBoundary,w=c.altBoundary,E=c.flipVariations,A=void 0===E||E,T=c.allowedAutoPlacements,C=e.options.placement,O=$(C),x=_||(O!==C&&A?function(t){if($(t)===r)return[];var e=ot(t);return[at(t),e,at(e)]}(C):[ot(C)]),k=[C].concat(x).reduce((function(t,i){return t.concat($(i)===r?function(t,e){void 0===e&&(e={});var i=e,n=i.placement,s=i.boundary,o=i.rootBoundary,r=i.padding,l=i.flipVariations,c=i.allowedAutoPlacements,h=void 0===c?m:c,d=J(n),u=d?l?p:p.filter((function(t){return J(t)===d})):a,f=u.filter((function(t){return h.indexOf(t)>=0}));0===f.length&&(f=u);var g=f.reduce((function(e,i){return e[i]=gt(t,{placement:i,boundary:s,rootBoundary:o,padding:r})[$(i)],e}),{});return Object.keys(g).sort((function(t,e){return g[t]-g[e]}))}(e,{placement:i,boundary:v,rootBoundary:y,padding:b,flipVariations:A,allowedAutoPlacements:T}):i)}),[]),L=e.rects.reference,S=e.rects.popper,D=new Map,I=!0,N=k[0],P=0;P<k.length;P++){var M=k[P],j=$(M),F=J(M)===l,H=[i,n].indexOf(j)>=0,B=H?"width":"height",W=gt(e,{placement:M,boundary:v,rootBoundary:y,altBoundary:w,padding:b}),z=H?F?s:o:F?n:i;L[B]>S[B]&&(z=ot(z));var R=ot(z),q=[];if(u&&q.push(W[j]<=0),g&&q.push(W[z]<=0,W[R]<=0),q.every((function(t){return t}))){N=M,I=!1;break}D.set(M,q)}if(I)for(var V=function(t){var e=k.find((function(e){var i=D.get(e);if(i)return i.slice(0,t).every((function(t){return t}))}));if(e)return N=e,"break"},Y=A?3:1;Y>0&&"break"!==V(Y);Y--);e.placement!==N&&(e.modifiersData[h]._skip=!0,e.placement=N,e.reset=!0)}},requiresIfExists:["offset"],data:{_skip:!1}};function bt(t,e,i){return void 0===i&&(i={x:0,y:0}),{top:t.top-e.height-i.y,right:t.right-e.width+i.x,bottom:t.bottom-e.height+i.y,left:t.left-e.width-i.x}}function vt(t){return[i,s,n,o].some((function(e){return t[e]>=0}))}const yt={name:"hide",enabled:!0,phase:"main",requiresIfExists:["preventOverflow"],fn:function(t){var e=t.state,i=t.name,n=e.rects.reference,s=e.rects.popper,o=e.modifiersData.preventOverflow,r=gt(e,{elementContext:"reference"}),a=gt(e,{altBoundary:!0}),l=bt(r,n),c=bt(a,s,o),h=vt(l),d=vt(c);e.modifiersData[i]={referenceClippingOffsets:l,popperEscapeOffsets:c,isReferenceHidden:h,hasPopperEscaped:d},e.attributes.popper=Object.assign({},e.attributes.popper,{"data-popper-reference-hidden":h,"data-popper-escaped":d})}},wt={name:"offset",enabled:!0,phase:"main",requires:["popperOffsets"],fn:function(t){var e=t.state,n=t.options,r=t.name,a=n.offset,l=void 0===a?[0,0]:a,c=m.reduce((function(t,n){return t[n]=function(t,e,n){var r=$(t),a=[o,i].indexOf(r)>=0?-1:1,l="function"==typeof n?n(Object.assign({},e,{placement:t})):n,c=l[0],h=l[1];return c=c||0,h=(h||0)*a,[o,s].indexOf(r)>=0?{x:h,y:c}:{x:c,y:h}}(n,e.rects,l),t}),{}),h=c[e.placement],d=h.x,u=h.y;null!=e.modifiersData.popperOffsets&&(e.modifiersData.popperOffsets.x+=d,e.modifiersData.popperOffsets.y+=u),e.modifiersData[r]=c}},Et={name:"popperOffsets",enabled:!0,phase:"read",fn:function(t){var e=t.state,i=t.name;e.modifiersData[i]=mt({reference:e.rects.reference,element:e.rects.popper,strategy:"absolute",placement:e.placement})},data:{}},At={name:"preventOverflow",enabled:!0,phase:"main",fn:function(t){var e=t.state,r=t.options,a=t.name,c=r.mainAxis,h=void 0===c||c,d=r.altAxis,u=void 0!==d&&d,f=r.boundary,p=r.rootBoundary,m=r.altBoundary,g=r.padding,_=r.tether,b=void 0===_||_,v=r.tetherOffset,y=void 0===v?0:v,w=gt(e,{boundary:f,rootBoundary:p,padding:g,altBoundary:m}),E=$(e.placement),A=J(e.placement),T=!A,C=K(E),O="x"===C?"y":"x",x=e.modifiersData.popperOffsets,k=e.rects.reference,L=e.rects.popper,S="function"==typeof y?y(Object.assign({},e.rects,{placement:e.placement})):y,D="number"==typeof S?{mainAxis:S,altAxis:S}:Object.assign({mainAxis:0,altAxis:0},S),P=e.modifiersData.offset?e.modifiersData.offset[e.placement]:null,M={x:0,y:0};if(x){if(h){var j,F="y"===C?i:o,B="y"===C?n:s,W="y"===C?"height":"width",z=x[C],R=z+w[F],q=z-w[B],V=b?-L[W]/2:0,X=A===l?k[W]:L[W],U=A===l?-L[W]:-k[W],G=e.elements.arrow,Z=b&&G?H(G):{width:0,height:0},tt=e.modifiersData["arrow#persistent"]?e.modifiersData["arrow#persistent"].padding:{top:0,right:0,bottom:0,left:0},et=tt[F],it=tt[B],nt=Q(0,k[W],Z[W]),st=T?k[W]/2-V-nt-et-D.mainAxis:X-nt-et-D.mainAxis,ot=T?-k[W]/2+V+nt+it+D.mainAxis:U+nt+it+D.mainAxis,rt=e.elements.arrow&&Y(e.elements.arrow),at=rt?"y"===C?rt.clientTop||0:rt.clientLeft||0:0,lt=null!=(j=null==P?void 0:P[C])?j:0,ct=z+ot-lt,ht=Q(b?N(R,z+st-lt-at):R,z,b?I(q,ct):q);x[C]=ht,M[C]=ht-z}if(u){var dt,ut="x"===C?i:o,ft="x"===C?n:s,pt=x[O],mt="y"===O?"height":"width",_t=pt+w[ut],bt=pt-w[ft],vt=-1!==[i,o].indexOf(E),yt=null!=(dt=null==P?void 0:P[O])?dt:0,wt=vt?_t:pt-k[mt]-L[mt]-yt+D.altAxis,Et=vt?pt+k[mt]+L[mt]-yt-D.altAxis:bt,At=b&&vt?function(t,e,i){var n=Q(t,e,i);return n>i?i:n}(wt,pt,Et):Q(b?wt:_t,pt,b?Et:bt);x[O]=At,M[O]=At-pt}e.modifiersData[a]=M}},requiresIfExists:["offset"]};function Tt(t,e,i){void 0===i&&(i=!1);var n,s,o=L(e),r=L(e)&&function(t){var e=t.getBoundingClientRect(),i=P(e.width)/t.offsetWidth||1,n=P(e.height)/t.offsetHeight||1;return 1!==i||1!==n}(e),a=R(e),l=F(t,r,i),c={scrollLeft:0,scrollTop:0},h={x:0,y:0};return(o||!o&&!i)&&(("body"!==O(e)||ht(a))&&(c=(n=e)!==x(n)&&L(n)?{scrollLeft:(s=n).scrollLeft,scrollTop:s.scrollTop}:lt(n)),L(e)?((h=F(e,!0)).x+=e.clientLeft,h.y+=e.clientTop):a&&(h.x=ct(a))),{x:l.left+c.scrollLeft-h.x,y:l.top+c.scrollTop-h.y,width:l.width,height:l.height}}function Ct(t){var e=new Map,i=new Set,n=[];function s(t){i.add(t.name),[].concat(t.requires||[],t.requiresIfExists||[]).forEach((function(t){if(!i.has(t)){var n=e.get(t);n&&s(n)}})),n.push(t)}return t.forEach((function(t){e.set(t.name,t)})),t.forEach((function(t){i.has(t.name)||s(t)})),n}var Ot={placement:"bottom",modifiers:[],strategy:"absolute"};function xt(){for(var t=arguments.length,e=new Array(t),i=0;i<t;i++)e[i]=arguments[i];return!e.some((function(t){return!(t&&"function"==typeof t.getBoundingClientRect)}))}function kt(t){void 0===t&&(t={});var e=t,i=e.defaultModifiers,n=void 0===i?[]:i,s=e.defaultOptions,o=void 0===s?Ot:s;return function(t,e,i){void 0===i&&(i=o);var s,r,a={placement:"bottom",orderedModifiers:[],options:Object.assign({},Ot,o),modifiersData:{},elements:{reference:t,popper:e},attributes:{},styles:{}},l=[],c=!1,h={state:a,setOptions:function(i){var s="function"==typeof i?i(a.options):i;d(),a.options=Object.assign({},o,a.options,s),a.scrollParents={reference:k(t)?ut(t):t.contextElement?ut(t.contextElement):[],popper:ut(e)};var r,c,u=function(t){var e=Ct(t);return C.reduce((function(t,i){return t.concat(e.filter((function(t){return t.phase===i})))}),[])}((r=[].concat(n,a.options.modifiers),c=r.reduce((function(t,e){var i=t[e.name];return t[e.name]=i?Object.assign({},i,e,{options:Object.assign({},i.options,e.options),data:Object.assign({},i.data,e.data)}):e,t}),{}),Object.keys(c).map((function(t){return c[t]}))));return a.orderedModifiers=u.filter((function(t){return t.enabled})),a.orderedModifiers.forEach((function(t){var e=t.name,i=t.options,n=void 0===i?{}:i,s=t.effect;if("function"==typeof s){var o=s({state:a,name:e,instance:h,options:n});l.push(o||function(){})}})),h.update()},forceUpdate:function(){if(!c){var t=a.elements,e=t.reference,i=t.popper;if(xt(e,i)){a.rects={reference:Tt(e,Y(i),"fixed"===a.options.strategy),popper:H(i)},a.reset=!1,a.placement=a.options.placement,a.orderedModifiers.forEach((function(t){return a.modifiersData[t.name]=Object.assign({},t.data)}));for(var n=0;n<a.orderedModifiers.length;n++)if(!0!==a.reset){var s=a.orderedModifiers[n],o=s.fn,r=s.options,l=void 0===r?{}:r,d=s.name;"function"==typeof o&&(a=o({state:a,options:l,name:d,instance:h})||a)}else a.reset=!1,n=-1}}},update:(s=function(){return new Promise((function(t){h.forceUpdate(),t(a)}))},function(){return r||(r=new Promise((function(t){Promise.resolve().then((function(){r=void 0,t(s())}))}))),r}),destroy:function(){d(),c=!0}};if(!xt(t,e))return h;function d(){l.forEach((function(t){return t()})),l=[]}return h.setOptions(i).then((function(t){!c&&i.onFirstUpdate&&i.onFirstUpdate(t)})),h}}var Lt=kt(),St=kt({defaultModifiers:[nt,Et,et,D,wt,_t,At,G,yt]}),Dt=kt({defaultModifiers:[nt,Et,et,D]});const $t=new Map,It={set(t,e,i){$t.has(t)||$t.set(t,new Map);const n=$t.get(t);n.has(e)||0===n.size?n.set(e,i):console.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(n.keys())[0]}.`)},get:(t,e)=>$t.has(t)&&$t.get(t).get(e)||null,remove(t,e){if(!$t.has(t))return;const i=$t.get(t);i.delete(e),0===i.size&&$t.delete(t)}},Nt="transitionend",Pt=t=>(t&&window.CSS&&window.CSS.escape&&(t=t.replace(/#([^\s"#']+)/g,((t,e)=>`#${CSS.escape(e)}`))),t),Mt=t=>{t.dispatchEvent(new Event(Nt))},jt=t=>!(!t||"object"!=typeof t)&&(void 0!==t.jquery&&(t=t[0]),void 0!==t.nodeType),Ft=t=>jt(t)?t.jquery?t[0]:t:"string"==typeof t&&t.length>0?document.querySelector(Pt(t)):null,Ht=t=>{if(!jt(t)||0===t.getClientRects().length)return!1;const e="visible"===getComputedStyle(t).getPropertyValue("visibility"),i=t.closest("details:not([open])");if(!i)return e;if(i!==t){const e=t.closest("summary");if(e&&e.parentNode!==i)return!1;if(null===e)return!1}return e},Bt=t=>!t||t.nodeType!==Node.ELEMENT_NODE||!!t.classList.contains("disabled")||(void 0!==t.disabled?t.disabled:t.hasAttribute("disabled")&&"false"!==t.getAttribute("disabled")),Wt=t=>{if(!document.documentElement.attachShadow)return null;if("function"==typeof t.getRootNode){const e=t.getRootNode();return e instanceof ShadowRoot?e:null}return t instanceof ShadowRoot?t:t.parentNode?Wt(t.parentNode):null},zt=()=>{},Rt=t=>{t.offsetHeight},qt=()=>window.jQuery&&!document.body.hasAttribute("data-bs-no-jquery")?window.jQuery:null,Vt=[],Yt=()=>"rtl"===document.documentElement.dir,Kt=t=>{var e;e=()=>{const e=qt();if(e){const i=t.NAME,n=e.fn[i];e.fn[i]=t.jQueryInterface,e.fn[i].Constructor=t,e.fn[i].noConflict=()=>(e.fn[i]=n,t.jQueryInterface)}},"loading"===document.readyState?(Vt.length||document.addEventListener("DOMContentLoaded",(()=>{for(const t of Vt)t()})),Vt.push(e)):e()},Qt=(t,e=[],i=t)=>"function"==typeof t?t(...e):i,Xt=(t,e,i=!0)=>{if(!i)return void Qt(t);const n=(t=>{if(!t)return 0;let{transitionDuration:e,transitionDelay:i}=window.getComputedStyle(t);const n=Number.parseFloat(e),s=Number.parseFloat(i);return n||s?(e=e.split(",")[0],i=i.split(",")[0],1e3*(Number.parseFloat(e)+Number.parseFloat(i))):0})(e)+5;let s=!1;const o=({target:i})=>{i===e&&(s=!0,e.removeEventListener(Nt,o),Qt(t))};e.addEventListener(Nt,o),setTimeout((()=>{s||Mt(e)}),n)},Ut=(t,e,i,n)=>{const s=t.length;let o=t.indexOf(e);return-1===o?!i&&n?t[s-1]:t[0]:(o+=i?1:-1,n&&(o=(o+s)%s),t[Math.max(0,Math.min(o,s-1))])},Gt=/[^.]*(?=\..*)\.|.*/,Jt=/\..*/,Zt=/::\d+$/,te={};let ee=1;const ie={mouseenter:"mouseover",mouseleave:"mouseout"},ne=new Set(["click","dblclick","mouseup","mousedown","contextmenu","mousewheel","DOMMouseScroll","mouseover","mouseout","mousemove","selectstart","selectend","keydown","keypress","keyup","orientationchange","touchstart","touchmove","touchend","touchcancel","pointerdown","pointermove","pointerup","pointerleave","pointercancel","gesturestart","gesturechange","gestureend","focus","blur","change","reset","select","submit","focusin","focusout","load","unload","beforeunload","resize","move","DOMContentLoaded","readystatechange","error","abort","scroll"]);function se(t,e){return e&&`${e}::${ee++}`||t.uidEvent||ee++}function oe(t){const e=se(t);return t.uidEvent=e,te[e]=te[e]||{},te[e]}function re(t,e,i=null){return Object.values(t).find((t=>t.callable===e&&t.delegationSelector===i))}function ae(t,e,i){const n="string"==typeof e,s=n?i:e||i;let o=de(t);return ne.has(o)||(o=t),[n,s,o]}function le(t,e,i,n,s){if("string"!=typeof e||!t)return;let[o,r,a]=ae(e,i,n);if(e in ie){const t=t=>function(e){if(!e.relatedTarget||e.relatedTarget!==e.delegateTarget&&!e.delegateTarget.contains(e.relatedTarget))return t.call(this,e)};r=t(r)}const l=oe(t),c=l[a]||(l[a]={}),h=re(c,r,o?i:null);if(h)return void(h.oneOff=h.oneOff&&s);const d=se(r,e.replace(Gt,"")),u=o?function(t,e,i){return function n(s){const o=t.querySelectorAll(e);for(let{target:r}=s;r&&r!==this;r=r.parentNode)for(const a of o)if(a===r)return fe(s,{delegateTarget:r}),n.oneOff&&ue.off(t,s.type,e,i),i.apply(r,[s])}}(t,i,r):function(t,e){return function i(n){return fe(n,{delegateTarget:t}),i.oneOff&&ue.off(t,n.type,e),e.apply(t,[n])}}(t,r);u.delegationSelector=o?i:null,u.callable=r,u.oneOff=s,u.uidEvent=d,c[d]=u,t.addEventListener(a,u,o)}function ce(t,e,i,n,s){const o=re(e[i],n,s);o&&(t.removeEventListener(i,o,Boolean(s)),delete e[i][o.uidEvent])}function he(t,e,i,n){const s=e[i]||{};for(const[o,r]of Object.entries(s))o.includes(n)&&ce(t,e,i,r.callable,r.delegationSelector)}function de(t){return t=t.replace(Jt,""),ie[t]||t}const ue={on(t,e,i,n){le(t,e,i,n,!1)},one(t,e,i,n){le(t,e,i,n,!0)},off(t,e,i,n){if("string"!=typeof e||!t)return;const[s,o,r]=ae(e,i,n),a=r!==e,l=oe(t),c=l[r]||{},h=e.startsWith(".");if(void 0===o){if(h)for(const i of Object.keys(l))he(t,l,i,e.slice(1));for(const[i,n]of Object.entries(c)){const s=i.replace(Zt,"");a&&!e.includes(s)||ce(t,l,r,n.callable,n.delegationSelector)}}else{if(!Object.keys(c).length)return;ce(t,l,r,o,s?i:null)}},trigger(t,e,i){if("string"!=typeof e||!t)return null;const n=qt();let s=null,o=!0,r=!0,a=!1;e!==de(e)&&n&&(s=n.Event(e,i),n(t).trigger(s),o=!s.isPropagationStopped(),r=!s.isImmediatePropagationStopped(),a=s.isDefaultPrevented());const l=fe(new Event(e,{bubbles:o,cancelable:!0}),i);return a&&l.preventDefault(),r&&t.dispatchEvent(l),l.defaultPrevented&&s&&s.preventDefault(),l}};function fe(t,e={}){for(const[i,n]of Object.entries(e))try{t[i]=n}catch(e){Object.defineProperty(t,i,{configurable:!0,get:()=>n})}return t}function pe(t){if("true"===t)return!0;if("false"===t)return!1;if(t===Number(t).toString())return Number(t);if(""===t||"null"===t)return null;if("string"!=typeof t)return t;try{return JSON.parse(decodeURIComponent(t))}catch(e){return t}}function me(t){return t.replace(/[A-Z]/g,(t=>`-${t.toLowerCase()}`))}const ge={setDataAttribute(t,e,i){t.setAttribute(`data-bs-${me(e)}`,i)},removeDataAttribute(t,e){t.removeAttribute(`data-bs-${me(e)}`)},getDataAttributes(t){if(!t)return{};const e={},i=Object.keys(t.dataset).filter((t=>t.startsWith("bs")&&!t.startsWith("bsConfig")));for(const n of i){let i=n.replace(/^bs/,"");i=i.charAt(0).toLowerCase()+i.slice(1,i.length),e[i]=pe(t.dataset[n])}return e},getDataAttribute:(t,e)=>pe(t.getAttribute(`data-bs-${me(e)}`))};class _e{static get Default(){return{}}static get DefaultType(){return{}}static get NAME(){throw new Error('You have to implement the static method "NAME", for each component!')}_getConfig(t){return t=this._mergeConfigObj(t),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}_configAfterMerge(t){return t}_mergeConfigObj(t,e){const i=jt(e)?ge.getDataAttribute(e,"config"):{};return{...this.constructor.Default,..."object"==typeof i?i:{},...jt(e)?ge.getDataAttributes(e):{},..."object"==typeof t?t:{}}}_typeCheckConfig(t,e=this.constructor.DefaultType){for(const[n,s]of Object.entries(e)){const e=t[n],o=jt(e)?"element":null==(i=e)?`${i}`:Object.prototype.toString.call(i).match(/\s([a-z]+)/i)[1].toLowerCase();if(!new RegExp(s).test(o))throw new TypeError(`${this.constructor.NAME.toUpperCase()}: Option "${n}" provided type "${o}" but expected type "${s}".`)}var i}}class be extends _e{constructor(t,e){super(),(t=Ft(t))&&(this._element=t,this._config=this._getConfig(e),It.set(this._element,this.constructor.DATA_KEY,this))}dispose(){It.remove(this._element,this.constructor.DATA_KEY),ue.off(this._element,this.constructor.EVENT_KEY);for(const t of Object.getOwnPropertyNames(this))this[t]=null}_queueCallback(t,e,i=!0){Xt(t,e,i)}_getConfig(t){return t=this._mergeConfigObj(t,this._element),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}static getInstance(t){return It.get(Ft(t),this.DATA_KEY)}static getOrCreateInstance(t,e={}){return this.getInstance(t)||new this(t,"object"==typeof e?e:null)}static get VERSION(){return"5.3.2"}static get DATA_KEY(){return`bs.${this.NAME}`}static get EVENT_KEY(){return`.${this.DATA_KEY}`}static eventName(t){return`${t}${this.EVENT_KEY}`}}const ve=t=>{let e=t.getAttribute("data-bs-target");if(!e||"#"===e){let i=t.getAttribute("href");if(!i||!i.includes("#")&&!i.startsWith("."))return null;i.includes("#")&&!i.startsWith("#")&&(i=`#${i.split("#")[1]}`),e=i&&"#"!==i?Pt(i.trim()):null}return e},ye={find:(t,e=document.documentElement)=>[].concat(...Element.prototype.querySelectorAll.call(e,t)),findOne:(t,e=document.documentElement)=>Element.prototype.querySelector.call(e,t),children:(t,e)=>[].concat(...t.children).filter((t=>t.matches(e))),parents(t,e){const i=[];let n=t.parentNode.closest(e);for(;n;)i.push(n),n=n.parentNode.closest(e);return i},prev(t,e){let i=t.previousElementSibling;for(;i;){if(i.matches(e))return[i];i=i.previousElementSibling}return[]},next(t,e){let i=t.nextElementSibling;for(;i;){if(i.matches(e))return[i];i=i.nextElementSibling}return[]},focusableChildren(t){const e=["a","button","input","textarea","select","details","[tabindex]",'[contenteditable="true"]'].map((t=>`${t}:not([tabindex^="-"])`)).join(",");return this.find(e,t).filter((t=>!Bt(t)&&Ht(t)))},getSelectorFromElement(t){const e=ve(t);return e&&ye.findOne(e)?e:null},getElementFromSelector(t){const e=ve(t);return e?ye.findOne(e):null},getMultipleElementsFromSelector(t){const e=ve(t);return e?ye.find(e):[]}},we=(t,e="hide")=>{const i=`click.dismiss${t.EVENT_KEY}`,n=t.NAME;ue.on(document,i,`[data-bs-dismiss="${n}"]`,(function(i){if(["A","AREA"].includes(this.tagName)&&i.preventDefault(),Bt(this))return;const s=ye.getElementFromSelector(this)||this.closest(`.${n}`);t.getOrCreateInstance(s)[e]()}))},Ee=".bs.alert",Ae=`close${Ee}`,Te=`closed${Ee}`;class Ce extends be{static get NAME(){return"alert"}close(){if(ue.trigger(this._element,Ae).defaultPrevented)return;this._element.classList.remove("show");const t=this._element.classList.contains("fade");this._queueCallback((()=>this._destroyElement()),this._element,t)}_destroyElement(){this._element.remove(),ue.trigger(this._element,Te),this.dispose()}static jQueryInterface(t){return this.each((function(){const e=Ce.getOrCreateInstance(this);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}we(Ce,"close"),Kt(Ce);const Oe='[data-bs-toggle="button"]';class xe extends be{static get NAME(){return"button"}toggle(){this._element.setAttribute("aria-pressed",this._element.classList.toggle("active"))}static jQueryInterface(t){return this.each((function(){const e=xe.getOrCreateInstance(this);"toggle"===t&&e[t]()}))}}ue.on(document,"click.bs.button.data-api",Oe,(t=>{t.preventDefault();const e=t.target.closest(Oe);xe.getOrCreateInstance(e).toggle()})),Kt(xe);const ke=".bs.swipe",Le=`touchstart${ke}`,Se=`touchmove${ke}`,De=`touchend${ke}`,$e=`pointerdown${ke}`,Ie=`pointerup${ke}`,Ne={endCallback:null,leftCallback:null,rightCallback:null},Pe={endCallback:"(function|null)",leftCallback:"(function|null)",rightCallback:"(function|null)"};class Me extends _e{constructor(t,e){super(),this._element=t,t&&Me.isSupported()&&(this._config=this._getConfig(e),this._deltaX=0,this._supportPointerEvents=Boolean(window.PointerEvent),this._initEvents())}static get Default(){return Ne}static get DefaultType(){return Pe}static get NAME(){return"swipe"}dispose(){ue.off(this._element,ke)}_start(t){this._supportPointerEvents?this._eventIsPointerPenTouch(t)&&(this._deltaX=t.clientX):this._deltaX=t.touches[0].clientX}_end(t){this._eventIsPointerPenTouch(t)&&(this._deltaX=t.clientX-this._deltaX),this._handleSwipe(),Qt(this._config.endCallback)}_move(t){this._deltaX=t.touches&&t.touches.length>1?0:t.touches[0].clientX-this._deltaX}_handleSwipe(){const t=Math.abs(this._deltaX);if(t<=40)return;const e=t/this._deltaX;this._deltaX=0,e&&Qt(e>0?this._config.rightCallback:this._config.leftCallback)}_initEvents(){this._supportPointerEvents?(ue.on(this._element,$e,(t=>this._start(t))),ue.on(this._element,Ie,(t=>this._end(t))),this._element.classList.add("pointer-event")):(ue.on(this._element,Le,(t=>this._start(t))),ue.on(this._element,Se,(t=>this._move(t))),ue.on(this._element,De,(t=>this._end(t))))}_eventIsPointerPenTouch(t){return this._supportPointerEvents&&("pen"===t.pointerType||"touch"===t.pointerType)}static isSupported(){return"ontouchstart"in document.documentElement||navigator.maxTouchPoints>0}}const je=".bs.carousel",Fe=".data-api",He="next",Be="prev",We="left",ze="right",Re=`slide${je}`,qe=`slid${je}`,Ve=`keydown${je}`,Ye=`mouseenter${je}`,Ke=`mouseleave${je}`,Qe=`dragstart${je}`,Xe=`load${je}${Fe}`,Ue=`click${je}${Fe}`,Ge="carousel",Je="active",Ze=".active",ti=".carousel-item",ei=Ze+ti,ii={ArrowLeft:ze,ArrowRight:We},ni={interval:5e3,keyboard:!0,pause:"hover",ride:!1,touch:!0,wrap:!0},si={interval:"(number|boolean)",keyboard:"boolean",pause:"(string|boolean)",ride:"(boolean|string)",touch:"boolean",wrap:"boolean"};class oi extends be{constructor(t,e){super(t,e),this._interval=null,this._activeElement=null,this._isSliding=!1,this.touchTimeout=null,this._swipeHelper=null,this._indicatorsElement=ye.findOne(".carousel-indicators",this._element),this._addEventListeners(),this._config.ride===Ge&&this.cycle()}static get Default(){return ni}static get DefaultType(){return si}static get NAME(){return"carousel"}next(){this._slide(He)}nextWhenVisible(){!document.hidden&&Ht(this._element)&&this.next()}prev(){this._slide(Be)}pause(){this._isSliding&&Mt(this._element),this._clearInterval()}cycle(){this._clearInterval(),this._updateInterval(),this._interval=setInterval((()=>this.nextWhenVisible()),this._config.interval)}_maybeEnableCycle(){this._config.ride&&(this._isSliding?ue.one(this._element,qe,(()=>this.cycle())):this.cycle())}to(t){const e=this._getItems();if(t>e.length-1||t<0)return;if(this._isSliding)return void ue.one(this._element,qe,(()=>this.to(t)));const i=this._getItemIndex(this._getActive());if(i===t)return;const n=t>i?He:Be;this._slide(n,e[t])}dispose(){this._swipeHelper&&this._swipeHelper.dispose(),super.dispose()}_configAfterMerge(t){return t.defaultInterval=t.interval,t}_addEventListeners(){this._config.keyboard&&ue.on(this._element,Ve,(t=>this._keydown(t))),"hover"===this._config.pause&&(ue.on(this._element,Ye,(()=>this.pause())),ue.on(this._element,Ke,(()=>this._maybeEnableCycle()))),this._config.touch&&Me.isSupported()&&this._addTouchEventListeners()}_addTouchEventListeners(){for(const t of ye.find(".carousel-item img",this._element))ue.on(t,Qe,(t=>t.preventDefault()));const t={leftCallback:()=>this._slide(this._directionToOrder(We)),rightCallback:()=>this._slide(this._directionToOrder(ze)),endCallback:()=>{"hover"===this._config.pause&&(this.pause(),this.touchTimeout&&clearTimeout(this.touchTimeout),this.touchTimeout=setTimeout((()=>this._maybeEnableCycle()),500+this._config.interval))}};this._swipeHelper=new Me(this._element,t)}_keydown(t){if(/input|textarea/i.test(t.target.tagName))return;const e=ii[t.key];e&&(t.preventDefault(),this._slide(this._directionToOrder(e)))}_getItemIndex(t){return this._getItems().indexOf(t)}_setActiveIndicatorElement(t){if(!this._indicatorsElement)return;const e=ye.findOne(Ze,this._indicatorsElement);e.classList.remove(Je),e.removeAttribute("aria-current");const i=ye.findOne(`[data-bs-slide-to="${t}"]`,this._indicatorsElement);i&&(i.classList.add(Je),i.setAttribute("aria-current","true"))}_updateInterval(){const t=this._activeElement||this._getActive();if(!t)return;const e=Number.parseInt(t.getAttribute("data-bs-interval"),10);this._config.interval=e||this._config.defaultInterval}_slide(t,e=null){if(this._isSliding)return;const i=this._getActive(),n=t===He,s=e||Ut(this._getItems(),i,n,this._config.wrap);if(s===i)return;const o=this._getItemIndex(s),r=e=>ue.trigger(this._element,e,{relatedTarget:s,direction:this._orderToDirection(t),from:this._getItemIndex(i),to:o});if(r(Re).defaultPrevented)return;if(!i||!s)return;const a=Boolean(this._interval);this.pause(),this._isSliding=!0,this._setActiveIndicatorElement(o),this._activeElement=s;const l=n?"carousel-item-start":"carousel-item-end",c=n?"carousel-item-next":"carousel-item-prev";s.classList.add(c),Rt(s),i.classList.add(l),s.classList.add(l),this._queueCallback((()=>{s.classList.remove(l,c),s.classList.add(Je),i.classList.remove(Je,c,l),this._isSliding=!1,r(qe)}),i,this._isAnimated()),a&&this.cycle()}_isAnimated(){return this._element.classList.contains("slide")}_getActive(){return ye.findOne(ei,this._element)}_getItems(){return ye.find(ti,this._element)}_clearInterval(){this._interval&&(clearInterval(this._interval),this._interval=null)}_directionToOrder(t){return Yt()?t===We?Be:He:t===We?He:Be}_orderToDirection(t){return Yt()?t===Be?We:ze:t===Be?ze:We}static jQueryInterface(t){return this.each((function(){const e=oi.getOrCreateInstance(this,t);if("number"!=typeof t){if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}else e.to(t)}))}}ue.on(document,Ue,"[data-bs-slide], [data-bs-slide-to]",(function(t){const e=ye.getElementFromSelector(this);if(!e||!e.classList.contains(Ge))return;t.preventDefault();const i=oi.getOrCreateInstance(e),n=this.getAttribute("data-bs-slide-to");return n?(i.to(n),void i._maybeEnableCycle()):"next"===ge.getDataAttribute(this,"slide")?(i.next(),void i._maybeEnableCycle()):(i.prev(),void i._maybeEnableCycle())})),ue.on(window,Xe,(()=>{const t=ye.find('[data-bs-ride="carousel"]');for(const e of t)oi.getOrCreateInstance(e)})),Kt(oi);const ri=".bs.collapse",ai=`show${ri}`,li=`shown${ri}`,ci=`hide${ri}`,hi=`hidden${ri}`,di=`click${ri}.data-api`,ui="show",fi="collapse",pi="collapsing",mi=`:scope .${fi} .${fi}`,gi='[data-bs-toggle="collapse"]',_i={parent:null,toggle:!0},bi={parent:"(null|element)",toggle:"boolean"};class vi extends be{constructor(t,e){super(t,e),this._isTransitioning=!1,this._triggerArray=[];const i=ye.find(gi);for(const t of i){const e=ye.getSelectorFromElement(t),i=ye.find(e).filter((t=>t===this._element));null!==e&&i.length&&this._triggerArray.push(t)}this._initializeChildren(),this._config.parent||this._addAriaAndCollapsedClass(this._triggerArray,this._isShown()),this._config.toggle&&this.toggle()}static get Default(){return _i}static get DefaultType(){return bi}static get NAME(){return"collapse"}toggle(){this._isShown()?this.hide():this.show()}show(){if(this._isTransitioning||this._isShown())return;let t=[];if(this._config.parent&&(t=this._getFirstLevelChildren(".collapse.show, .collapse.collapsing").filter((t=>t!==this._element)).map((t=>vi.getOrCreateInstance(t,{toggle:!1})))),t.length&&t[0]._isTransitioning)return;if(ue.trigger(this._element,ai).defaultPrevented)return;for(const e of t)e.hide();const e=this._getDimension();this._element.classList.remove(fi),this._element.classList.add(pi),this._element.style[e]=0,this._addAriaAndCollapsedClass(this._triggerArray,!0),this._isTransitioning=!0;const i=`scroll${e[0].toUpperCase()+e.slice(1)}`;this._queueCallback((()=>{this._isTransitioning=!1,this._element.classList.remove(pi),this._element.classList.add(fi,ui),this._element.style[e]="",ue.trigger(this._element,li)}),this._element,!0),this._element.style[e]=`${this._element[i]}px`}hide(){if(this._isTransitioning||!this._isShown())return;if(ue.trigger(this._element,ci).defaultPrevented)return;const t=this._getDimension();this._element.style[t]=`${this._element.getBoundingClientRect()[t]}px`,Rt(this._element),this._element.classList.add(pi),this._element.classList.remove(fi,ui);for(const t of this._triggerArray){const e=ye.getElementFromSelector(t);e&&!this._isShown(e)&&this._addAriaAndCollapsedClass([t],!1)}this._isTransitioning=!0,this._element.style[t]="",this._queueCallback((()=>{this._isTransitioning=!1,this._element.classList.remove(pi),this._element.classList.add(fi),ue.trigger(this._element,hi)}),this._element,!0)}_isShown(t=this._element){return t.classList.contains(ui)}_configAfterMerge(t){return t.toggle=Boolean(t.toggle),t.parent=Ft(t.parent),t}_getDimension(){return this._element.classList.contains("collapse-horizontal")?"width":"height"}_initializeChildren(){if(!this._config.parent)return;const t=this._getFirstLevelChildren(gi);for(const e of t){const t=ye.getElementFromSelector(e);t&&this._addAriaAndCollapsedClass([e],this._isShown(t))}}_getFirstLevelChildren(t){const e=ye.find(mi,this._config.parent);return ye.find(t,this._config.parent).filter((t=>!e.includes(t)))}_addAriaAndCollapsedClass(t,e){if(t.length)for(const i of t)i.classList.toggle("collapsed",!e),i.setAttribute("aria-expanded",e)}static jQueryInterface(t){const e={};return"string"==typeof t&&/show|hide/.test(t)&&(e.toggle=!1),this.each((function(){const i=vi.getOrCreateInstance(this,e);if("string"==typeof t){if(void 0===i[t])throw new TypeError(`No method named "${t}"`);i[t]()}}))}}ue.on(document,di,gi,(function(t){("A"===t.target.tagName||t.delegateTarget&&"A"===t.delegateTarget.tagName)&&t.preventDefault();for(const t of ye.getMultipleElementsFromSelector(this))vi.getOrCreateInstance(t,{toggle:!1}).toggle()})),Kt(vi);const yi="dropdown",wi=".bs.dropdown",Ei=".data-api",Ai="ArrowUp",Ti="ArrowDown",Ci=`hide${wi}`,Oi=`hidden${wi}`,xi=`show${wi}`,ki=`shown${wi}`,Li=`click${wi}${Ei}`,Si=`keydown${wi}${Ei}`,Di=`keyup${wi}${Ei}`,$i="show",Ii='[data-bs-toggle="dropdown"]:not(.disabled):not(:disabled)',Ni=`${Ii}.${$i}`,Pi=".dropdown-menu",Mi=Yt()?"top-end":"top-start",ji=Yt()?"top-start":"top-end",Fi=Yt()?"bottom-end":"bottom-start",Hi=Yt()?"bottom-start":"bottom-end",Bi=Yt()?"left-start":"right-start",Wi=Yt()?"right-start":"left-start",zi={autoClose:!0,boundary:"clippingParents",display:"dynamic",offset:[0,2],popperConfig:null,reference:"toggle"},Ri={autoClose:"(boolean|string)",boundary:"(string|element)",display:"string",offset:"(array|string|function)",popperConfig:"(null|object|function)",reference:"(string|element|object)"};class qi extends be{constructor(t,e){super(t,e),this._popper=null,this._parent=this._element.parentNode,this._menu=ye.next(this._element,Pi)[0]||ye.prev(this._element,Pi)[0]||ye.findOne(Pi,this._parent),this._inNavbar=this._detectNavbar()}static get Default(){return zi}static get DefaultType(){return Ri}static get NAME(){return yi}toggle(){return this._isShown()?this.hide():this.show()}show(){if(Bt(this._element)||this._isShown())return;const t={relatedTarget:this._element};if(!ue.trigger(this._element,xi,t).defaultPrevented){if(this._createPopper(),"ontouchstart"in document.documentElement&&!this._parent.closest(".navbar-nav"))for(const t of[].concat(...document.body.children))ue.on(t,"mouseover",zt);this._element.focus(),this._element.setAttribute("aria-expanded",!0),this._menu.classList.add($i),this._element.classList.add($i),ue.trigger(this._element,ki,t)}}hide(){if(Bt(this._element)||!this._isShown())return;const t={relatedTarget:this._element};this._completeHide(t)}dispose(){this._popper&&this._popper.destroy(),super.dispose()}update(){this._inNavbar=this._detectNavbar(),this._popper&&this._popper.update()}_completeHide(t){if(!ue.trigger(this._element,Ci,t).defaultPrevented){if("ontouchstart"in document.documentElement)for(const t of[].concat(...document.body.children))ue.off(t,"mouseover",zt);this._popper&&this._popper.destroy(),this._menu.classList.remove($i),this._element.classList.remove($i),this._element.setAttribute("aria-expanded","false"),ge.removeDataAttribute(this._menu,"popper"),ue.trigger(this._element,Oi,t)}}_getConfig(t){if("object"==typeof(t=super._getConfig(t)).reference&&!jt(t.reference)&&"function"!=typeof t.reference.getBoundingClientRect)throw new TypeError(`${yi.toUpperCase()}: Option "reference" provided type "object" without a required "getBoundingClientRect" method.`);return t}_createPopper(){if(void 0===e)throw new TypeError("Bootstrap's dropdowns require Popper (https://popper.js.org)");let t=this._element;"parent"===this._config.reference?t=this._parent:jt(this._config.reference)?t=Ft(this._config.reference):"object"==typeof this._config.reference&&(t=this._config.reference);const i=this._getPopperConfig();this._popper=St(t,this._menu,i)}_isShown(){return this._menu.classList.contains($i)}_getPlacement(){const t=this._parent;if(t.classList.contains("dropend"))return Bi;if(t.classList.contains("dropstart"))return Wi;if(t.classList.contains("dropup-center"))return"top";if(t.classList.contains("dropdown-center"))return"bottom";const e="end"===getComputedStyle(this._menu).getPropertyValue("--bs-position").trim();return t.classList.contains("dropup")?e?ji:Mi:e?Hi:Fi}_detectNavbar(){return null!==this._element.closest(".navbar")}_getOffset(){const{offset:t}=this._config;return"string"==typeof t?t.split(",").map((t=>Number.parseInt(t,10))):"function"==typeof t?e=>t(e,this._element):t}_getPopperConfig(){const t={placement:this._getPlacement(),modifiers:[{name:"preventOverflow",options:{boundary:this._config.boundary}},{name:"offset",options:{offset:this._getOffset()}}]};return(this._inNavbar||"static"===this._config.display)&&(ge.setDataAttribute(this._menu,"popper","static"),t.modifiers=[{name:"applyStyles",enabled:!1}]),{...t,...Qt(this._config.popperConfig,[t])}}_selectMenuItem({key:t,target:e}){const i=ye.find(".dropdown-menu .dropdown-item:not(.disabled):not(:disabled)",this._menu).filter((t=>Ht(t)));i.length&&Ut(i,e,t===Ti,!i.includes(e)).focus()}static jQueryInterface(t){return this.each((function(){const e=qi.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}static clearMenus(t){if(2===t.button||"keyup"===t.type&&"Tab"!==t.key)return;const e=ye.find(Ni);for(const i of e){const e=qi.getInstance(i);if(!e||!1===e._config.autoClose)continue;const n=t.composedPath(),s=n.includes(e._menu);if(n.includes(e._element)||"inside"===e._config.autoClose&&!s||"outside"===e._config.autoClose&&s)continue;if(e._menu.contains(t.target)&&("keyup"===t.type&&"Tab"===t.key||/input|select|option|textarea|form/i.test(t.target.tagName)))continue;const o={relatedTarget:e._element};"click"===t.type&&(o.clickEvent=t),e._completeHide(o)}}static dataApiKeydownHandler(t){const e=/input|textarea/i.test(t.target.tagName),i="Escape"===t.key,n=[Ai,Ti].includes(t.key);if(!n&&!i)return;if(e&&!i)return;t.preventDefault();const s=this.matches(Ii)?this:ye.prev(this,Ii)[0]||ye.next(this,Ii)[0]||ye.findOne(Ii,t.delegateTarget.parentNode),o=qi.getOrCreateInstance(s);if(n)return t.stopPropagation(),o.show(),void o._selectMenuItem(t);o._isShown()&&(t.stopPropagation(),o.hide(),s.focus())}}ue.on(document,Si,Ii,qi.dataApiKeydownHandler),ue.on(document,Si,Pi,qi.dataApiKeydownHandler),ue.on(document,Li,qi.clearMenus),ue.on(document,Di,qi.clearMenus),ue.on(document,Li,Ii,(function(t){t.preventDefault(),qi.getOrCreateInstance(this).toggle()})),Kt(qi);const Vi="backdrop",Yi="show",Ki=`mousedown.bs.${Vi}`,Qi={className:"modal-backdrop",clickCallback:null,isAnimated:!1,isVisible:!0,rootElement:"body"},Xi={className:"string",clickCallback:"(function|null)",isAnimated:"boolean",isVisible:"boolean",rootElement:"(element|string)"};class Ui extends _e{constructor(t){super(),this._config=this._getConfig(t),this._isAppended=!1,this._element=null}static get Default(){return Qi}static get DefaultType(){return Xi}static get NAME(){return Vi}show(t){if(!this._config.isVisible)return void Qt(t);this._append();const e=this._getElement();this._config.isAnimated&&Rt(e),e.classList.add(Yi),this._emulateAnimation((()=>{Qt(t)}))}hide(t){this._config.isVisible?(this._getElement().classList.remove(Yi),this._emulateAnimation((()=>{this.dispose(),Qt(t)}))):Qt(t)}dispose(){this._isAppended&&(ue.off(this._element,Ki),this._element.remove(),this._isAppended=!1)}_getElement(){if(!this._element){const t=document.createElement("div");t.className=this._config.className,this._config.isAnimated&&t.classList.add("fade"),this._element=t}return this._element}_configAfterMerge(t){return t.rootElement=Ft(t.rootElement),t}_append(){if(this._isAppended)return;const t=this._getElement();this._config.rootElement.append(t),ue.on(t,Ki,(()=>{Qt(this._config.clickCallback)})),this._isAppended=!0}_emulateAnimation(t){Xt(t,this._getElement(),this._config.isAnimated)}}const Gi=".bs.focustrap",Ji=`focusin${Gi}`,Zi=`keydown.tab${Gi}`,tn="backward",en={autofocus:!0,trapElement:null},nn={autofocus:"boolean",trapElement:"element"};class sn extends _e{constructor(t){super(),this._config=this._getConfig(t),this._isActive=!1,this._lastTabNavDirection=null}static get Default(){return en}static get DefaultType(){return nn}static get NAME(){return"focustrap"}activate(){this._isActive||(this._config.autofocus&&this._config.trapElement.focus(),ue.off(document,Gi),ue.on(document,Ji,(t=>this._handleFocusin(t))),ue.on(document,Zi,(t=>this._handleKeydown(t))),this._isActive=!0)}deactivate(){this._isActive&&(this._isActive=!1,ue.off(document,Gi))}_handleFocusin(t){const{trapElement:e}=this._config;if(t.target===document||t.target===e||e.contains(t.target))return;const i=ye.focusableChildren(e);0===i.length?e.focus():this._lastTabNavDirection===tn?i[i.length-1].focus():i[0].focus()}_handleKeydown(t){"Tab"===t.key&&(this._lastTabNavDirection=t.shiftKey?tn:"forward")}}const on=".fixed-top, .fixed-bottom, .is-fixed, .sticky-top",rn=".sticky-top",an="padding-right",ln="margin-right";class cn{constructor(){this._element=document.body}getWidth(){const t=document.documentElement.clientWidth;return Math.abs(window.innerWidth-t)}hide(){const t=this.getWidth();this._disableOverFlow(),this._setElementAttributes(this._element,an,(e=>e+t)),this._setElementAttributes(on,an,(e=>e+t)),this._setElementAttributes(rn,ln,(e=>e-t))}reset(){this._resetElementAttributes(this._element,"overflow"),this._resetElementAttributes(this._element,an),this._resetElementAttributes(on,an),this._resetElementAttributes(rn,ln)}isOverflowing(){return this.getWidth()>0}_disableOverFlow(){this._saveInitialAttribute(this._element,"overflow"),this._element.style.overflow="hidden"}_setElementAttributes(t,e,i){const n=this.getWidth();this._applyManipulationCallback(t,(t=>{if(t!==this._element&&window.innerWidth>t.clientWidth+n)return;this._saveInitialAttribute(t,e);const s=window.getComputedStyle(t).getPropertyValue(e);t.style.setProperty(e,`${i(Number.parseFloat(s))}px`)}))}_saveInitialAttribute(t,e){const i=t.style.getPropertyValue(e);i&&ge.setDataAttribute(t,e,i)}_resetElementAttributes(t,e){this._applyManipulationCallback(t,(t=>{const i=ge.getDataAttribute(t,e);null!==i?(ge.removeDataAttribute(t,e),t.style.setProperty(e,i)):t.style.removeProperty(e)}))}_applyManipulationCallback(t,e){if(jt(t))e(t);else for(const i of ye.find(t,this._element))e(i)}}const hn=".bs.modal",dn=`hide${hn}`,un=`hidePrevented${hn}`,fn=`hidden${hn}`,pn=`show${hn}`,mn=`shown${hn}`,gn=`resize${hn}`,_n=`click.dismiss${hn}`,bn=`mousedown.dismiss${hn}`,vn=`keydown.dismiss${hn}`,yn=`click${hn}.data-api`,wn="modal-open",En="show",An="modal-static",Tn={backdrop:!0,focus:!0,keyboard:!0},Cn={backdrop:"(boolean|string)",focus:"boolean",keyboard:"boolean"};class On extends be{constructor(t,e){super(t,e),this._dialog=ye.findOne(".modal-dialog",this._element),this._backdrop=this._initializeBackDrop(),this._focustrap=this._initializeFocusTrap(),this._isShown=!1,this._isTransitioning=!1,this._scrollBar=new cn,this._addEventListeners()}static get Default(){return Tn}static get DefaultType(){return Cn}static get NAME(){return"modal"}toggle(t){return this._isShown?this.hide():this.show(t)}show(t){this._isShown||this._isTransitioning||ue.trigger(this._element,pn,{relatedTarget:t}).defaultPrevented||(this._isShown=!0,this._isTransitioning=!0,this._scrollBar.hide(),document.body.classList.add(wn),this._adjustDialog(),this._backdrop.show((()=>this._showElement(t))))}hide(){this._isShown&&!this._isTransitioning&&(ue.trigger(this._element,dn).defaultPrevented||(this._isShown=!1,this._isTransitioning=!0,this._focustrap.deactivate(),this._element.classList.remove(En),this._queueCallback((()=>this._hideModal()),this._element,this._isAnimated())))}dispose(){ue.off(window,hn),ue.off(this._dialog,hn),this._backdrop.dispose(),this._focustrap.deactivate(),super.dispose()}handleUpdate(){this._adjustDialog()}_initializeBackDrop(){return new Ui({isVisible:Boolean(this._config.backdrop),isAnimated:this._isAnimated()})}_initializeFocusTrap(){return new sn({trapElement:this._element})}_showElement(t){document.body.contains(this._element)||document.body.append(this._element),this._element.style.display="block",this._element.removeAttribute("aria-hidden"),this._element.setAttribute("aria-modal",!0),this._element.setAttribute("role","dialog"),this._element.scrollTop=0;const e=ye.findOne(".modal-body",this._dialog);e&&(e.scrollTop=0),Rt(this._element),this._element.classList.add(En),this._queueCallback((()=>{this._config.focus&&this._focustrap.activate(),this._isTransitioning=!1,ue.trigger(this._element,mn,{relatedTarget:t})}),this._dialog,this._isAnimated())}_addEventListeners(){ue.on(this._element,vn,(t=>{"Escape"===t.key&&(this._config.keyboard?this.hide():this._triggerBackdropTransition())})),ue.on(window,gn,(()=>{this._isShown&&!this._isTransitioning&&this._adjustDialog()})),ue.on(this._element,bn,(t=>{ue.one(this._element,_n,(e=>{this._element===t.target&&this._element===e.target&&("static"!==this._config.backdrop?this._config.backdrop&&this.hide():this._triggerBackdropTransition())}))}))}_hideModal(){this._element.style.display="none",this._element.setAttribute("aria-hidden",!0),this._element.removeAttribute("aria-modal"),this._element.removeAttribute("role"),this._isTransitioning=!1,this._backdrop.hide((()=>{document.body.classList.remove(wn),this._resetAdjustments(),this._scrollBar.reset(),ue.trigger(this._element,fn)}))}_isAnimated(){return this._element.classList.contains("fade")}_triggerBackdropTransition(){if(ue.trigger(this._element,un).defaultPrevented)return;const t=this._element.scrollHeight>document.documentElement.clientHeight,e=this._element.style.overflowY;"hidden"===e||this._element.classList.contains(An)||(t||(this._element.style.overflowY="hidden"),this._element.classList.add(An),this._queueCallback((()=>{this._element.classList.remove(An),this._queueCallback((()=>{this._element.style.overflowY=e}),this._dialog)}),this._dialog),this._element.focus())}_adjustDialog(){const t=this._element.scrollHeight>document.documentElement.clientHeight,e=this._scrollBar.getWidth(),i=e>0;if(i&&!t){const t=Yt()?"paddingLeft":"paddingRight";this._element.style[t]=`${e}px`}if(!i&&t){const t=Yt()?"paddingRight":"paddingLeft";this._element.style[t]=`${e}px`}}_resetAdjustments(){this._element.style.paddingLeft="",this._element.style.paddingRight=""}static jQueryInterface(t,e){return this.each((function(){const i=On.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===i[t])throw new TypeError(`No method named "${t}"`);i[t](e)}}))}}ue.on(document,yn,'[data-bs-toggle="modal"]',(function(t){const e=ye.getElementFromSelector(this);["A","AREA"].includes(this.tagName)&&t.preventDefault(),ue.one(e,pn,(t=>{t.defaultPrevented||ue.one(e,fn,(()=>{Ht(this)&&this.focus()}))}));const i=ye.findOne(".modal.show");i&&On.getInstance(i).hide(),On.getOrCreateInstance(e).toggle(this)})),we(On),Kt(On);const xn=".bs.offcanvas",kn=".data-api",Ln=`load${xn}${kn}`,Sn="show",Dn="showing",$n="hiding",In=".offcanvas.show",Nn=`show${xn}`,Pn=`shown${xn}`,Mn=`hide${xn}`,jn=`hidePrevented${xn}`,Fn=`hidden${xn}`,Hn=`resize${xn}`,Bn=`click${xn}${kn}`,Wn=`keydown.dismiss${xn}`,zn={backdrop:!0,keyboard:!0,scroll:!1},Rn={backdrop:"(boolean|string)",keyboard:"boolean",scroll:"boolean"};class qn extends be{constructor(t,e){super(t,e),this._isShown=!1,this._backdrop=this._initializeBackDrop(),this._focustrap=this._initializeFocusTrap(),this._addEventListeners()}static get Default(){return zn}static get DefaultType(){return Rn}static get NAME(){return"offcanvas"}toggle(t){return this._isShown?this.hide():this.show(t)}show(t){this._isShown||ue.trigger(this._element,Nn,{relatedTarget:t}).defaultPrevented||(this._isShown=!0,this._backdrop.show(),this._config.scroll||(new cn).hide(),this._element.setAttribute("aria-modal",!0),this._element.setAttribute("role","dialog"),this._element.classList.add(Dn),this._queueCallback((()=>{this._config.scroll&&!this._config.backdrop||this._focustrap.activate(),this._element.classList.add(Sn),this._element.classList.remove(Dn),ue.trigger(this._element,Pn,{relatedTarget:t})}),this._element,!0))}hide(){this._isShown&&(ue.trigger(this._element,Mn).defaultPrevented||(this._focustrap.deactivate(),this._element.blur(),this._isShown=!1,this._element.classList.add($n),this._backdrop.hide(),this._queueCallback((()=>{this._element.classList.remove(Sn,$n),this._element.removeAttribute("aria-modal"),this._element.removeAttribute("role"),this._config.scroll||(new cn).reset(),ue.trigger(this._element,Fn)}),this._element,!0)))}dispose(){this._backdrop.dispose(),this._focustrap.deactivate(),super.dispose()}_initializeBackDrop(){const t=Boolean(this._config.backdrop);return new Ui({className:"offcanvas-backdrop",isVisible:t,isAnimated:!0,rootElement:this._element.parentNode,clickCallback:t?()=>{"static"!==this._config.backdrop?this.hide():ue.trigger(this._element,jn)}:null})}_initializeFocusTrap(){return new sn({trapElement:this._element})}_addEventListeners(){ue.on(this._element,Wn,(t=>{"Escape"===t.key&&(this._config.keyboard?this.hide():ue.trigger(this._element,jn))}))}static jQueryInterface(t){return this.each((function(){const e=qn.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}ue.on(document,Bn,'[data-bs-toggle="offcanvas"]',(function(t){const e=ye.getElementFromSelector(this);if(["A","AREA"].includes(this.tagName)&&t.preventDefault(),Bt(this))return;ue.one(e,Fn,(()=>{Ht(this)&&this.focus()}));const i=ye.findOne(In);i&&i!==e&&qn.getInstance(i).hide(),qn.getOrCreateInstance(e).toggle(this)})),ue.on(window,Ln,(()=>{for(const t of ye.find(In))qn.getOrCreateInstance(t).show()})),ue.on(window,Hn,(()=>{for(const t of ye.find("[aria-modal][class*=show][class*=offcanvas-]"))"fixed"!==getComputedStyle(t).position&&qn.getOrCreateInstance(t).hide()})),we(qn),Kt(qn);const Vn={"*":["class","dir","id","lang","role",/^aria-[\w-]*$/i],a:["target","href","title","rel"],area:[],b:[],br:[],col:[],code:[],div:[],em:[],hr:[],h1:[],h2:[],h3:[],h4:[],h5:[],h6:[],i:[],img:["src","srcset","alt","title","width","height"],li:[],ol:[],p:[],pre:[],s:[],small:[],span:[],sub:[],sup:[],strong:[],u:[],ul:[]},Yn=new Set(["background","cite","href","itemtype","longdesc","poster","src","xlink:href"]),Kn=/^(?!javascript:)(?:[a-z0-9+.-]+:|[^&:/?#]*(?:[/?#]|$))/i,Qn=(t,e)=>{const i=t.nodeName.toLowerCase();return e.includes(i)?!Yn.has(i)||Boolean(Kn.test(t.nodeValue)):e.filter((t=>t instanceof RegExp)).some((t=>t.test(i)))},Xn={allowList:Vn,content:{},extraClass:"",html:!1,sanitize:!0,sanitizeFn:null,template:"<div></div>"},Un={allowList:"object",content:"object",extraClass:"(string|function)",html:"boolean",sanitize:"boolean",sanitizeFn:"(null|function)",template:"string"},Gn={entry:"(string|element|function|null)",selector:"(string|element)"};class Jn extends _e{constructor(t){super(),this._config=this._getConfig(t)}static get Default(){return Xn}static get DefaultType(){return Un}static get NAME(){return"TemplateFactory"}getContent(){return Object.values(this._config.content).map((t=>this._resolvePossibleFunction(t))).filter(Boolean)}hasContent(){return this.getContent().length>0}changeContent(t){return this._checkContent(t),this._config.content={...this._config.content,...t},this}toHtml(){const t=document.createElement("div");t.innerHTML=this._maybeSanitize(this._config.template);for(const[e,i]of Object.entries(this._config.content))this._setContent(t,i,e);const e=t.children[0],i=this._resolvePossibleFunction(this._config.extraClass);return i&&e.classList.add(...i.split(" ")),e}_typeCheckConfig(t){super._typeCheckConfig(t),this._checkContent(t.content)}_checkContent(t){for(const[e,i]of Object.entries(t))super._typeCheckConfig({selector:e,entry:i},Gn)}_setContent(t,e,i){const n=ye.findOne(i,t);n&&((e=this._resolvePossibleFunction(e))?jt(e)?this._putElementInTemplate(Ft(e),n):this._config.html?n.innerHTML=this._maybeSanitize(e):n.textContent=e:n.remove())}_maybeSanitize(t){return this._config.sanitize?function(t,e,i){if(!t.length)return t;if(i&&"function"==typeof i)return i(t);const n=(new window.DOMParser).parseFromString(t,"text/html"),s=[].concat(...n.body.querySelectorAll("*"));for(const t of s){const i=t.nodeName.toLowerCase();if(!Object.keys(e).includes(i)){t.remove();continue}const n=[].concat(...t.attributes),s=[].concat(e["*"]||[],e[i]||[]);for(const e of n)Qn(e,s)||t.removeAttribute(e.nodeName)}return n.body.innerHTML}(t,this._config.allowList,this._config.sanitizeFn):t}_resolvePossibleFunction(t){return Qt(t,[this])}_putElementInTemplate(t,e){if(this._config.html)return e.innerHTML="",void e.append(t);e.textContent=t.textContent}}const Zn=new Set(["sanitize","allowList","sanitizeFn"]),ts="fade",es="show",is=".modal",ns="hide.bs.modal",ss="hover",os="focus",rs={AUTO:"auto",TOP:"top",RIGHT:Yt()?"left":"right",BOTTOM:"bottom",LEFT:Yt()?"right":"left"},as={allowList:Vn,animation:!0,boundary:"clippingParents",container:!1,customClass:"",delay:0,fallbackPlacements:["top","right","bottom","left"],html:!1,offset:[0,6],placement:"top",popperConfig:null,sanitize:!0,sanitizeFn:null,selector:!1,template:'<div class="tooltip" role="tooltip"><div class="tooltip-arrow"></div><div class="tooltip-inner"></div></div>',title:"",trigger:"hover focus"},ls={allowList:"object",animation:"boolean",boundary:"(string|element)",container:"(string|element|boolean)",customClass:"(string|function)",delay:"(number|object)",fallbackPlacements:"array",html:"boolean",offset:"(array|string|function)",placement:"(string|function)",popperConfig:"(null|object|function)",sanitize:"boolean",sanitizeFn:"(null|function)",selector:"(string|boolean)",template:"string",title:"(string|element|function)",trigger:"string"};class cs extends be{constructor(t,i){if(void 0===e)throw new TypeError("Bootstrap's tooltips require Popper (https://popper.js.org)");super(t,i),this._isEnabled=!0,this._timeout=0,this._isHovered=null,this._activeTrigger={},this._popper=null,this._templateFactory=null,this._newContent=null,this.tip=null,this._setListeners(),this._config.selector||this._fixTitle()}static get Default(){return as}static get DefaultType(){return ls}static get NAME(){return"tooltip"}enable(){this._isEnabled=!0}disable(){this._isEnabled=!1}toggleEnabled(){this._isEnabled=!this._isEnabled}toggle(){this._isEnabled&&(this._activeTrigger.click=!this._activeTrigger.click,this._isShown()?this._leave():this._enter())}dispose(){clearTimeout(this._timeout),ue.off(this._element.closest(is),ns,this._hideModalHandler),this._element.getAttribute("data-bs-original-title")&&this._element.setAttribute("title",this._element.getAttribute("data-bs-original-title")),this._disposePopper(),super.dispose()}show(){if("none"===this._element.style.display)throw new Error("Please use show on visible elements");if(!this._isWithContent()||!this._isEnabled)return;const t=ue.trigger(this._element,this.constructor.eventName("show")),e=(Wt(this._element)||this._element.ownerDocument.documentElement).contains(this._element);if(t.defaultPrevented||!e)return;this._disposePopper();const i=this._getTipElement();this._element.setAttribute("aria-describedby",i.getAttribute("id"));const{container:n}=this._config;if(this._element.ownerDocument.documentElement.contains(this.tip)||(n.append(i),ue.trigger(this._element,this.constructor.eventName("inserted"))),this._popper=this._createPopper(i),i.classList.add(es),"ontouchstart"in document.documentElement)for(const t of[].concat(...document.body.children))ue.on(t,"mouseover",zt);this._queueCallback((()=>{ue.trigger(this._element,this.constructor.eventName("shown")),!1===this._isHovered&&this._leave(),this._isHovered=!1}),this.tip,this._isAnimated())}hide(){if(this._isShown()&&!ue.trigger(this._element,this.constructor.eventName("hide")).defaultPrevented){if(this._getTipElement().classList.remove(es),"ontouchstart"in document.documentElement)for(const t of[].concat(...document.body.children))ue.off(t,"mouseover",zt);this._activeTrigger.click=!1,this._activeTrigger[os]=!1,this._activeTrigger[ss]=!1,this._isHovered=null,this._queueCallback((()=>{this._isWithActiveTrigger()||(this._isHovered||this._disposePopper(),this._element.removeAttribute("aria-describedby"),ue.trigger(this._element,this.constructor.eventName("hidden")))}),this.tip,this._isAnimated())}}update(){this._popper&&this._popper.update()}_isWithContent(){return Boolean(this._getTitle())}_getTipElement(){return this.tip||(this.tip=this._createTipElement(this._newContent||this._getContentForTemplate())),this.tip}_createTipElement(t){const e=this._getTemplateFactory(t).toHtml();if(!e)return null;e.classList.remove(ts,es),e.classList.add(`bs-${this.constructor.NAME}-auto`);const i=(t=>{do{t+=Math.floor(1e6*Math.random())}while(document.getElementById(t));return t})(this.constructor.NAME).toString();return e.setAttribute("id",i),this._isAnimated()&&e.classList.add(ts),e}setContent(t){this._newContent=t,this._isShown()&&(this._disposePopper(),this.show())}_getTemplateFactory(t){return this._templateFactory?this._templateFactory.changeContent(t):this._templateFactory=new Jn({...this._config,content:t,extraClass:this._resolvePossibleFunction(this._config.customClass)}),this._templateFactory}_getContentForTemplate(){return{".tooltip-inner":this._getTitle()}}_getTitle(){return this._resolvePossibleFunction(this._config.title)||this._element.getAttribute("data-bs-original-title")}_initializeOnDelegatedTarget(t){return this.constructor.getOrCreateInstance(t.delegateTarget,this._getDelegateConfig())}_isAnimated(){return this._config.animation||this.tip&&this.tip.classList.contains(ts)}_isShown(){return this.tip&&this.tip.classList.contains(es)}_createPopper(t){const e=Qt(this._config.placement,[this,t,this._element]),i=rs[e.toUpperCase()];return St(this._element,t,this._getPopperConfig(i))}_getOffset(){const{offset:t}=this._config;return"string"==typeof t?t.split(",").map((t=>Number.parseInt(t,10))):"function"==typeof t?e=>t(e,this._element):t}_resolvePossibleFunction(t){return Qt(t,[this._element])}_getPopperConfig(t){const e={placement:t,modifiers:[{name:"flip",options:{fallbackPlacements:this._config.fallbackPlacements}},{name:"offset",options:{offset:this._getOffset()}},{name:"preventOverflow",options:{boundary:this._config.boundary}},{name:"arrow",options:{element:`.${this.constructor.NAME}-arrow`}},{name:"preSetPlacement",enabled:!0,phase:"beforeMain",fn:t=>{this._getTipElement().setAttribute("data-popper-placement",t.state.placement)}}]};return{...e,...Qt(this._config.popperConfig,[e])}}_setListeners(){const t=this._config.trigger.split(" ");for(const e of t)if("click"===e)ue.on(this._element,this.constructor.eventName("click"),this._config.selector,(t=>{this._initializeOnDelegatedTarget(t).toggle()}));else if("manual"!==e){const t=e===ss?this.constructor.eventName("mouseenter"):this.constructor.eventName("focusin"),i=e===ss?this.constructor.eventName("mouseleave"):this.constructor.eventName("focusout");ue.on(this._element,t,this._config.selector,(t=>{const e=this._initializeOnDelegatedTarget(t);e._activeTrigger["focusin"===t.type?os:ss]=!0,e._enter()})),ue.on(this._element,i,this._config.selector,(t=>{const e=this._initializeOnDelegatedTarget(t);e._activeTrigger["focusout"===t.type?os:ss]=e._element.contains(t.relatedTarget),e._leave()}))}this._hideModalHandler=()=>{this._element&&this.hide()},ue.on(this._element.closest(is),ns,this._hideModalHandler)}_fixTitle(){const t=this._element.getAttribute("title");t&&(this._element.getAttribute("aria-label")||this._element.textContent.trim()||this._element.setAttribute("aria-label",t),this._element.setAttribute("data-bs-original-title",t),this._element.removeAttribute("title"))}_enter(){this._isShown()||this._isHovered?this._isHovered=!0:(this._isHovered=!0,this._setTimeout((()=>{this._isHovered&&this.show()}),this._config.delay.show))}_leave(){this._isWithActiveTrigger()||(this._isHovered=!1,this._setTimeout((()=>{this._isHovered||this.hide()}),this._config.delay.hide))}_setTimeout(t,e){clearTimeout(this._timeout),this._timeout=setTimeout(t,e)}_isWithActiveTrigger(){return Object.values(this._activeTrigger).includes(!0)}_getConfig(t){const e=ge.getDataAttributes(this._element);for(const t of Object.keys(e))Zn.has(t)&&delete e[t];return t={...e,..."object"==typeof t&&t?t:{}},t=this._mergeConfigObj(t),t=this._configAfterMerge(t),this._typeCheckConfig(t),t}_configAfterMerge(t){return t.container=!1===t.container?document.body:Ft(t.container),"number"==typeof t.delay&&(t.delay={show:t.delay,hide:t.delay}),"number"==typeof t.title&&(t.title=t.title.toString()),"number"==typeof t.content&&(t.content=t.content.toString()),t}_getDelegateConfig(){const t={};for(const[e,i]of Object.entries(this._config))this.constructor.Default[e]!==i&&(t[e]=i);return t.selector=!1,t.trigger="manual",t}_disposePopper(){this._popper&&(this._popper.destroy(),this._popper=null),this.tip&&(this.tip.remove(),this.tip=null)}static jQueryInterface(t){return this.each((function(){const e=cs.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}}Kt(cs);const hs={...cs.Default,content:"",offset:[0,8],placement:"right",template:'<div class="popover" role="tooltip"><div class="popover-arrow"></div><h3 class="popover-header"></h3><div class="popover-body"></div></div>',trigger:"click"},ds={...cs.DefaultType,content:"(null|string|element|function)"};class us extends cs{static get Default(){return hs}static get DefaultType(){return ds}static get NAME(){return"popover"}_isWithContent(){return this._getTitle()||this._getContent()}_getContentForTemplate(){return{".popover-header":this._getTitle(),".popover-body":this._getContent()}}_getContent(){return this._resolvePossibleFunction(this._config.content)}static jQueryInterface(t){return this.each((function(){const e=us.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t]()}}))}}Kt(us);const fs=".bs.scrollspy",ps=`activate${fs}`,ms=`click${fs}`,gs=`load${fs}.data-api`,_s="active",bs="[href]",vs=".nav-link",ys=`${vs}, .nav-item > ${vs}, .list-group-item`,ws={offset:null,rootMargin:"0px 0px -25%",smoothScroll:!1,target:null,threshold:[.1,.5,1]},Es={offset:"(number|null)",rootMargin:"string",smoothScroll:"boolean",target:"element",threshold:"array"};class As extends be{constructor(t,e){super(t,e),this._targetLinks=new Map,this._observableSections=new Map,this._rootElement="visible"===getComputedStyle(this._element).overflowY?null:this._element,this._activeTarget=null,this._observer=null,this._previousScrollData={visibleEntryTop:0,parentScrollTop:0},this.refresh()}static get Default(){return ws}static get DefaultType(){return Es}static get NAME(){return"scrollspy"}refresh(){this._initializeTargetsAndObservables(),this._maybeEnableSmoothScroll(),this._observer?this._observer.disconnect():this._observer=this._getNewObserver();for(const t of this._observableSections.values())this._observer.observe(t)}dispose(){this._observer.disconnect(),super.dispose()}_configAfterMerge(t){return t.target=Ft(t.target)||document.body,t.rootMargin=t.offset?`${t.offset}px 0px -30%`:t.rootMargin,"string"==typeof t.threshold&&(t.threshold=t.threshold.split(",").map((t=>Number.parseFloat(t)))),t}_maybeEnableSmoothScroll(){this._config.smoothScroll&&(ue.off(this._config.target,ms),ue.on(this._config.target,ms,bs,(t=>{const e=this._observableSections.get(t.target.hash);if(e){t.preventDefault();const i=this._rootElement||window,n=e.offsetTop-this._element.offsetTop;if(i.scrollTo)return void i.scrollTo({top:n,behavior:"smooth"});i.scrollTop=n}})))}_getNewObserver(){const t={root:this._rootElement,threshold:this._config.threshold,rootMargin:this._config.rootMargin};return new IntersectionObserver((t=>this._observerCallback(t)),t)}_observerCallback(t){const e=t=>this._targetLinks.get(`#${t.target.id}`),i=t=>{this._previousScrollData.visibleEntryTop=t.target.offsetTop,this._process(e(t))},n=(this._rootElement||document.documentElement).scrollTop,s=n>=this._previousScrollData.parentScrollTop;this._previousScrollData.parentScrollTop=n;for(const o of t){if(!o.isIntersecting){this._activeTarget=null,this._clearActiveClass(e(o));continue}const t=o.target.offsetTop>=this._previousScrollData.visibleEntryTop;if(s&&t){if(i(o),!n)return}else s||t||i(o)}}_initializeTargetsAndObservables(){this._targetLinks=new Map,this._observableSections=new Map;const t=ye.find(bs,this._config.target);for(const e of t){if(!e.hash||Bt(e))continue;const t=ye.findOne(decodeURI(e.hash),this._element);Ht(t)&&(this._targetLinks.set(decodeURI(e.hash),e),this._observableSections.set(e.hash,t))}}_process(t){this._activeTarget!==t&&(this._clearActiveClass(this._config.target),this._activeTarget=t,t.classList.add(_s),this._activateParents(t),ue.trigger(this._element,ps,{relatedTarget:t}))}_activateParents(t){if(t.classList.contains("dropdown-item"))ye.findOne(".dropdown-toggle",t.closest(".dropdown")).classList.add(_s);else for(const e of ye.parents(t,".nav, .list-group"))for(const t of ye.prev(e,ys))t.classList.add(_s)}_clearActiveClass(t){t.classList.remove(_s);const e=ye.find(`${bs}.${_s}`,t);for(const t of e)t.classList.remove(_s)}static jQueryInterface(t){return this.each((function(){const e=As.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}))}}ue.on(window,gs,(()=>{for(const t of ye.find('[data-bs-spy="scroll"]'))As.getOrCreateInstance(t)})),Kt(As);const Ts=".bs.tab",Cs=`hide${Ts}`,Os=`hidden${Ts}`,xs=`show${Ts}`,ks=`shown${Ts}`,Ls=`click${Ts}`,Ss=`keydown${Ts}`,Ds=`load${Ts}`,$s="ArrowLeft",Is="ArrowRight",Ns="ArrowUp",Ps="ArrowDown",Ms="Home",js="End",Fs="active",Hs="fade",Bs="show",Ws=".dropdown-toggle",zs=`:not(${Ws})`,Rs='[data-bs-toggle="tab"], [data-bs-toggle="pill"], [data-bs-toggle="list"]',qs=`.nav-link${zs}, .list-group-item${zs}, [role="tab"]${zs}, ${Rs}`,Vs=`.${Fs}[data-bs-toggle="tab"], .${Fs}[data-bs-toggle="pill"], .${Fs}[data-bs-toggle="list"]`;class Ys extends be{constructor(t){super(t),this._parent=this._element.closest('.list-group, .nav, [role="tablist"]'),this._parent&&(this._setInitialAttributes(this._parent,this._getChildren()),ue.on(this._element,Ss,(t=>this._keydown(t))))}static get NAME(){return"tab"}show(){const t=this._element;if(this._elemIsActive(t))return;const e=this._getActiveElem(),i=e?ue.trigger(e,Cs,{relatedTarget:t}):null;ue.trigger(t,xs,{relatedTarget:e}).defaultPrevented||i&&i.defaultPrevented||(this._deactivate(e,t),this._activate(t,e))}_activate(t,e){t&&(t.classList.add(Fs),this._activate(ye.getElementFromSelector(t)),this._queueCallback((()=>{"tab"===t.getAttribute("role")?(t.removeAttribute("tabindex"),t.setAttribute("aria-selected",!0),this._toggleDropDown(t,!0),ue.trigger(t,ks,{relatedTarget:e})):t.classList.add(Bs)}),t,t.classList.contains(Hs)))}_deactivate(t,e){t&&(t.classList.remove(Fs),t.blur(),this._deactivate(ye.getElementFromSelector(t)),this._queueCallback((()=>{"tab"===t.getAttribute("role")?(t.setAttribute("aria-selected",!1),t.setAttribute("tabindex","-1"),this._toggleDropDown(t,!1),ue.trigger(t,Os,{relatedTarget:e})):t.classList.remove(Bs)}),t,t.classList.contains(Hs)))}_keydown(t){if(![$s,Is,Ns,Ps,Ms,js].includes(t.key))return;t.stopPropagation(),t.preventDefault();const e=this._getChildren().filter((t=>!Bt(t)));let i;if([Ms,js].includes(t.key))i=e[t.key===Ms?0:e.length-1];else{const n=[Is,Ps].includes(t.key);i=Ut(e,t.target,n,!0)}i&&(i.focus({preventScroll:!0}),Ys.getOrCreateInstance(i).show())}_getChildren(){return ye.find(qs,this._parent)}_getActiveElem(){return this._getChildren().find((t=>this._elemIsActive(t)))||null}_setInitialAttributes(t,e){this._setAttributeIfNotExists(t,"role","tablist");for(const t of e)this._setInitialAttributesOnChild(t)}_setInitialAttributesOnChild(t){t=this._getInnerElement(t);const e=this._elemIsActive(t),i=this._getOuterElement(t);t.setAttribute("aria-selected",e),i!==t&&this._setAttributeIfNotExists(i,"role","presentation"),e||t.setAttribute("tabindex","-1"),this._setAttributeIfNotExists(t,"role","tab"),this._setInitialAttributesOnTargetPanel(t)}_setInitialAttributesOnTargetPanel(t){const e=ye.getElementFromSelector(t);e&&(this._setAttributeIfNotExists(e,"role","tabpanel"),t.id&&this._setAttributeIfNotExists(e,"aria-labelledby",`${t.id}`))}_toggleDropDown(t,e){const i=this._getOuterElement(t);if(!i.classList.contains("dropdown"))return;const n=(t,n)=>{const s=ye.findOne(t,i);s&&s.classList.toggle(n,e)};n(Ws,Fs),n(".dropdown-menu",Bs),i.setAttribute("aria-expanded",e)}_setAttributeIfNotExists(t,e,i){t.hasAttribute(e)||t.setAttribute(e,i)}_elemIsActive(t){return t.classList.contains(Fs)}_getInnerElement(t){return t.matches(qs)?t:ye.findOne(qs,t)}_getOuterElement(t){return t.closest(".nav-item, .list-group-item")||t}static jQueryInterface(t){return this.each((function(){const e=Ys.getOrCreateInstance(this);if("string"==typeof t){if(void 0===e[t]||t.startsWith("_")||"constructor"===t)throw new TypeError(`No method named "${t}"`);e[t]()}}))}}ue.on(document,Ls,Rs,(function(t){["A","AREA"].includes(this.tagName)&&t.preventDefault(),Bt(this)||Ys.getOrCreateInstance(this).show()})),ue.on(window,Ds,(()=>{for(const t of ye.find(Vs))Ys.getOrCreateInstance(t)})),Kt(Ys);const Ks=".bs.toast",Qs=`mouseover${Ks}`,Xs=`mouseout${Ks}`,Us=`focusin${Ks}`,Gs=`focusout${Ks}`,Js=`hide${Ks}`,Zs=`hidden${Ks}`,to=`show${Ks}`,eo=`shown${Ks}`,io="hide",no="show",so="showing",oo={animation:"boolean",autohide:"boolean",delay:"number"},ro={animation:!0,autohide:!0,delay:5e3};class ao extends be{constructor(t,e){super(t,e),this._timeout=null,this._hasMouseInteraction=!1,this._hasKeyboardInteraction=!1,this._setListeners()}static get Default(){return ro}static get DefaultType(){return oo}static get NAME(){return"toast"}show(){ue.trigger(this._element,to).defaultPrevented||(this._clearTimeout(),this._config.animation&&this._element.classList.add("fade"),this._element.classList.remove(io),Rt(this._element),this._element.classList.add(no,so),this._queueCallback((()=>{this._element.classList.remove(so),ue.trigger(this._element,eo),this._maybeScheduleHide()}),this._element,this._config.animation))}hide(){this.isShown()&&(ue.trigger(this._element,Js).defaultPrevented||(this._element.classList.add(so),this._queueCallback((()=>{this._element.classList.add(io),this._element.classList.remove(so,no),ue.trigger(this._element,Zs)}),this._element,this._config.animation)))}dispose(){this._clearTimeout(),this.isShown()&&this._element.classList.remove(no),super.dispose()}isShown(){return this._element.classList.contains(no)}_maybeScheduleHide(){this._config.autohide&&(this._hasMouseInteraction||this._hasKeyboardInteraction||(this._timeout=setTimeout((()=>{this.hide()}),this._config.delay)))}_onInteraction(t,e){switch(t.type){case"mouseover":case"mouseout":this._hasMouseInteraction=e;break;case"focusin":case"focusout":this._hasKeyboardInteraction=e}if(e)return void this._clearTimeout();const i=t.relatedTarget;this._element===i||this._element.contains(i)||this._maybeScheduleHide()}_setListeners(){ue.on(this._element,Qs,(t=>this._onInteraction(t,!0))),ue.on(this._element,Xs,(t=>this._onInteraction(t,!1))),ue.on(this._element,Us,(t=>this._onInteraction(t,!0))),ue.on(this._element,Gs,(t=>this._onInteraction(t,!1)))}_clearTimeout(){clearTimeout(this._timeout),this._timeout=null}static jQueryInterface(t){return this.each((function(){const e=ao.getOrCreateInstance(this,t);if("string"==typeof t){if(void 0===e[t])throw new TypeError(`No method named "${t}"`);e[t](this)}}))}}function lo(t){"loading"!=document.readyState?t():document.addEventListener("DOMContentLoaded",t)}we(ao),Kt(ao),lo((function(){[].slice.call(document.querySelectorAll('[data-bs-toggle="tooltip"]')).map((function(t){return new cs(t,{delay:{show:500,hide:100}})}))})),lo((function(){document.getElementById("pst-back-to-top").addEventListener("click",(function(){document.body.scrollTop=0,document.documentElement.scrollTop=0}))})),lo((function(){var t=document.getElementById("pst-back-to-top"),e=document.getElementsByClassName("bd-header")[0].getBoundingClientRect();window.addEventListener("scroll",(function(){this.oldScroll>this.scrollY&&this.scrollY>e.bottom?t.style.display="block":t.style.display="none",this.oldScroll=this.scrollY}))}))})();
-//# sourceMappingURL=bootstrap.js.map
\ No newline at end of file
diff --git a/docs/_build/html/_static/scripts/bootstrap.js.LICENSE.txt b/docs/_build/html/_static/scripts/bootstrap.js.LICENSE.txt
deleted file mode 100644
index 10f979d..0000000
--- a/docs/_build/html/_static/scripts/bootstrap.js.LICENSE.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-/*!
-  * Bootstrap v5.3.2 (https://getbootstrap.com/)
-  * Copyright 2011-2023 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)
-  * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)
-  */
diff --git a/docs/_build/html/_static/scripts/bootstrap.js.map b/docs/_build/html/_static/scripts/bootstrap.js.map
deleted file mode 100644
index e5bc157..0000000
--- a/docs/_build/html/_static/scripts/bootstrap.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"scripts/bootstrap.js","mappings":";mBACA,IAAIA,EAAsB,CCA1BA,EAAwB,CAACC,EAASC,KACjC,IAAI,IAAIC,KAAOD,EACXF,EAAoBI,EAAEF,EAAYC,KAASH,EAAoBI,EAAEH,EAASE,IAC5EE,OAAOC,eAAeL,EAASE,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,IAE1E,ECNDH,EAAwB,CAACS,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClFV,EAAyBC,IACH,oBAAXa,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeL,EAASa,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeL,EAAS,aAAc,CAAEe,OAAO,GAAO,ipBCLvD,IAAI,EAAM,MACNC,EAAS,SACTC,EAAQ,QACRC,EAAO,OACPC,EAAO,OACPC,EAAiB,CAAC,EAAKJ,EAAQC,EAAOC,GACtCG,EAAQ,QACRC,EAAM,MACNC,EAAkB,kBAClBC,EAAW,WACXC,EAAS,SACTC,EAAY,YACZC,EAAmCP,EAAeQ,QAAO,SAAUC,EAAKC,GACjF,OAAOD,EAAIE,OAAO,CAACD,EAAY,IAAMT,EAAOS,EAAY,IAAMR,GAChE,GAAG,IACQ,EAA0B,GAAGS,OAAOX,EAAgB,CAACD,IAAOS,QAAO,SAAUC,EAAKC,GAC3F,OAAOD,EAAIE,OAAO,CAACD,EAAWA,EAAY,IAAMT,EAAOS,EAAY,IAAMR,GAC3E,GAAG,IAEQU,EAAa,aACbC,EAAO,OACPC,EAAY,YAEZC,EAAa,aACbC,EAAO,OACPC,EAAY,YAEZC,EAAc,cACdC,EAAQ,QACRC,EAAa,aACbC,EAAiB,CAACT,EAAYC,EAAMC,EAAWC,EAAYC,EAAMC,EAAWC,EAAaC,EAAOC,GC9B5F,SAASE,EAAYC,GAClC,OAAOA,GAAWA,EAAQC,UAAY,IAAIC,cAAgB,IAC5D,CCFe,SAASC,EAAUC,GAChC,GAAY,MAARA,EACF,OAAOC,OAGT,GAAwB,oBAApBD,EAAKE,WAAkC,CACzC,IAAIC,EAAgBH,EAAKG,cACzB,OAAOA,GAAgBA,EAAcC,aAAwBH,MAC/D,CAEA,OAAOD,CACT,CCTA,SAASK,EAAUL,GAEjB,OAAOA,aADUD,EAAUC,GAAMM,SACIN,aAAgBM,OACvD,CAEA,SAASC,EAAcP,GAErB,OAAOA,aADUD,EAAUC,GAAMQ,aACIR,aAAgBQ,WACvD,CAEA,SAASC,EAAaT,GAEpB,MAA0B,oBAAfU,aAKJV,aADUD,EAAUC,GAAMU,YACIV,aAAgBU,WACvD,CCwDA,SACEC,KAAM,cACNC,SAAS,EACTC,MAAO,QACPC,GA5EF,SAAqBC,GACnB,IAAIC,EAAQD,EAAKC,MACjB3D,OAAO4D,KAAKD,EAAME,UAAUC,SAAQ,SAAUR,GAC5C,IAAIS,EAAQJ,EAAMK,OAAOV,IAAS,CAAC,EAC/BW,EAAaN,EAAMM,WAAWX,IAAS,CAAC,EACxCf,EAAUoB,EAAME,SAASP,GAExBJ,EAAcX,IAAaD,EAAYC,KAO5CvC,OAAOkE,OAAO3B,EAAQwB,MAAOA,GAC7B/D,OAAO4D,KAAKK,GAAYH,SAAQ,SAAUR,GACxC,IAAI3C,EAAQsD,EAAWX,IAET,IAAV3C,EACF4B,EAAQ4B,gBAAgBb,GAExBf,EAAQ6B,aAAad,GAAgB,IAAV3C,EAAiB,GAAKA,EAErD,IACF,GACF,EAoDE0D,OAlDF,SAAgBC,GACd,IAAIX,EAAQW,EAAMX,MACdY,EAAgB,CAClBlD,OAAQ,CACNmD,SAAUb,EAAMc,QAAQC,SACxB5D,KAAM,IACN6D,IAAK,IACLC,OAAQ,KAEVC,MAAO,CACLL,SAAU,YAEZlD,UAAW,CAAC,GASd,OAPAtB,OAAOkE,OAAOP,EAAME,SAASxC,OAAO0C,MAAOQ,EAAclD,QACzDsC,EAAMK,OAASO,EAEXZ,EAAME,SAASgB,OACjB7E,OAAOkE,OAAOP,EAAME,SAASgB,MAAMd,MAAOQ,EAAcM,OAGnD,WACL7E,OAAO4D,KAAKD,EAAME,UAAUC,SAAQ,SAAUR,GAC5C,IAAIf,EAAUoB,EAAME,SAASP,GACzBW,EAAaN,EAAMM,WAAWX,IAAS,CAAC,EAGxCS,EAFkB/D,OAAO4D,KAAKD,EAAMK,OAAOzD,eAAe+C,GAAQK,EAAMK,OAAOV,GAAQiB,EAAcjB,IAE7E9B,QAAO,SAAUuC,EAAOe,GAElD,OADAf,EAAMe,GAAY,GACXf,CACT,GAAG,CAAC,GAECb,EAAcX,IAAaD,EAAYC,KAI5CvC,OAAOkE,OAAO3B,EAAQwB,MAAOA,GAC7B/D,OAAO4D,KAAKK,GAAYH,SAAQ,SAAUiB,GACxCxC,EAAQ4B,gBAAgBY,EAC1B,IACF,GACF,CACF,EASEC,SAAU,CAAC,kBCjFE,SAASC,EAAiBvD,GACvC,OAAOA,EAAUwD,MAAM,KAAK,EAC9B,CCHO,IAAI,EAAMC,KAAKC,IACX,EAAMD,KAAKE,IACXC,EAAQH,KAAKG,MCFT,SAASC,IACtB,IAAIC,EAASC,UAAUC,cAEvB,OAAc,MAAVF,GAAkBA,EAAOG,QAAUC,MAAMC,QAAQL,EAAOG,QACnDH,EAAOG,OAAOG,KAAI,SAAUC,GACjC,OAAOA,EAAKC,MAAQ,IAAMD,EAAKE,OACjC,IAAGC,KAAK,KAGHT,UAAUU,SACnB,CCTe,SAASC,IACtB,OAAQ,iCAAiCC,KAAKd,IAChD,CCCe,SAASe,EAAsB/D,EAASgE,EAAcC,QAC9C,IAAjBD,IACFA,GAAe,QAGO,IAApBC,IACFA,GAAkB,GAGpB,IAAIC,EAAalE,EAAQ+D,wBACrBI,EAAS,EACTC,EAAS,EAETJ,GAAgBrD,EAAcX,KAChCmE,EAASnE,EAAQqE,YAAc,GAAItB,EAAMmB,EAAWI,OAAStE,EAAQqE,aAAmB,EACxFD,EAASpE,EAAQuE,aAAe,GAAIxB,EAAMmB,EAAWM,QAAUxE,EAAQuE,cAAoB,GAG7F,IACIE,GADOhE,EAAUT,GAAWG,EAAUH,GAAWK,QAC3BoE,eAEtBC,GAAoBb,KAAsBI,EAC1CU,GAAKT,EAAW3F,MAAQmG,GAAoBD,EAAiBA,EAAeG,WAAa,IAAMT,EAC/FU,GAAKX,EAAW9B,KAAOsC,GAAoBD,EAAiBA,EAAeK,UAAY,IAAMV,EAC7FE,EAAQJ,EAAWI,MAAQH,EAC3BK,EAASN,EAAWM,OAASJ,EACjC,MAAO,CACLE,MAAOA,EACPE,OAAQA,EACRpC,IAAKyC,EACLvG,MAAOqG,EAAIL,EACXjG,OAAQwG,EAAIL,EACZjG,KAAMoG,EACNA,EAAGA,EACHE,EAAGA,EAEP,CCrCe,SAASE,EAAc/E,GACpC,IAAIkE,EAAaH,EAAsB/D,GAGnCsE,EAAQtE,EAAQqE,YAChBG,EAASxE,EAAQuE,aAUrB,OARI3B,KAAKoC,IAAId,EAAWI,MAAQA,IAAU,IACxCA,EAAQJ,EAAWI,OAGjB1B,KAAKoC,IAAId,EAAWM,OAASA,IAAW,IAC1CA,EAASN,EAAWM,QAGf,CACLG,EAAG3E,EAAQ4E,WACXC,EAAG7E,EAAQ8E,UACXR,MAAOA,EACPE,OAAQA,EAEZ,CCvBe,SAASS,EAASC,EAAQC,GACvC,IAAIC,EAAWD,EAAME,aAAeF,EAAME,cAE1C,GAAIH,EAAOD,SAASE,GAClB,OAAO,EAEJ,GAAIC,GAAYvE,EAAauE,GAAW,CACzC,IAAIE,EAAOH,EAEX,EAAG,CACD,GAAIG,GAAQJ,EAAOK,WAAWD,GAC5B,OAAO,EAITA,EAAOA,EAAKE,YAAcF,EAAKG,IACjC,OAASH,EACX,CAGF,OAAO,CACT,CCrBe,SAAS,EAAiBtF,GACvC,OAAOG,EAAUH,GAAS0F,iBAAiB1F,EAC7C,CCFe,SAAS2F,EAAe3F,GACrC,MAAO,CAAC,QAAS,KAAM,MAAM4F,QAAQ7F,EAAYC,KAAa,CAChE,CCFe,SAAS6F,EAAmB7F,GAEzC,QAASS,EAAUT,GAAWA,EAAQO,cACtCP,EAAQ8F,WAAazF,OAAOyF,UAAUC,eACxC,CCFe,SAASC,EAAchG,GACpC,MAA6B,SAAzBD,EAAYC,GACPA,EAMPA,EAAQiG,cACRjG,EAAQwF,aACR3E,EAAab,GAAWA,EAAQyF,KAAO,OAEvCI,EAAmB7F,EAGvB,CCVA,SAASkG,EAAoBlG,GAC3B,OAAKW,EAAcX,IACoB,UAAvC,EAAiBA,GAASiC,SAInBjC,EAAQmG,aAHN,IAIX,CAwCe,SAASC,EAAgBpG,GAItC,IAHA,IAAIK,EAASF,EAAUH,GACnBmG,EAAeD,EAAoBlG,GAEhCmG,GAAgBR,EAAeQ,IAA6D,WAA5C,EAAiBA,GAAclE,UACpFkE,EAAeD,EAAoBC,GAGrC,OAAIA,IAA+C,SAA9BpG,EAAYoG,IAA0D,SAA9BpG,EAAYoG,IAAwE,WAA5C,EAAiBA,GAAclE,UAC3H5B,EAGF8F,GAhDT,SAA4BnG,GAC1B,IAAIqG,EAAY,WAAWvC,KAAKd,KAGhC,GAFW,WAAWc,KAAKd,MAEfrC,EAAcX,IAII,UAFX,EAAiBA,GAEnBiC,SACb,OAAO,KAIX,IAAIqE,EAAcN,EAAchG,GAMhC,IAJIa,EAAayF,KACfA,EAAcA,EAAYb,MAGrB9E,EAAc2F,IAAgB,CAAC,OAAQ,QAAQV,QAAQ7F,EAAYuG,IAAgB,GAAG,CAC3F,IAAIC,EAAM,EAAiBD,GAI3B,GAAsB,SAAlBC,EAAIC,WAA4C,SAApBD,EAAIE,aAA0C,UAAhBF,EAAIG,UAAiF,IAA1D,CAAC,YAAa,eAAed,QAAQW,EAAII,aAAsBN,GAAgC,WAAnBE,EAAII,YAA2BN,GAAaE,EAAIK,QAAyB,SAAfL,EAAIK,OACjO,OAAON,EAEPA,EAAcA,EAAYd,UAE9B,CAEA,OAAO,IACT,CAgByBqB,CAAmB7G,IAAYK,CACxD,CCpEe,SAASyG,EAAyB3H,GAC/C,MAAO,CAAC,MAAO,UAAUyG,QAAQzG,IAAc,EAAI,IAAM,GAC3D,CCDO,SAAS4H,EAAOjE,EAAK1E,EAAOyE,GACjC,OAAO,EAAQC,EAAK,EAAQ1E,EAAOyE,GACrC,CCFe,SAASmE,EAAmBC,GACzC,OAAOxJ,OAAOkE,OAAO,CAAC,ECDf,CACLS,IAAK,EACL9D,MAAO,EACPD,OAAQ,EACRE,KAAM,GDHuC0I,EACjD,CEHe,SAASC,EAAgB9I,EAAOiD,GAC7C,OAAOA,EAAKpC,QAAO,SAAUkI,EAAS5J,GAEpC,OADA4J,EAAQ5J,GAAOa,EACR+I,CACT,GAAG,CAAC,EACN,CC4EA,SACEpG,KAAM,QACNC,SAAS,EACTC,MAAO,OACPC,GApEF,SAAeC,GACb,IAAIiG,EAEAhG,EAAQD,EAAKC,MACbL,EAAOI,EAAKJ,KACZmB,EAAUf,EAAKe,QACfmF,EAAejG,EAAME,SAASgB,MAC9BgF,EAAgBlG,EAAMmG,cAAcD,cACpCE,EAAgB9E,EAAiBtB,EAAMjC,WACvCsI,EAAOX,EAAyBU,GAEhCE,EADa,CAACnJ,EAAMD,GAAOsH,QAAQ4B,IAAkB,EAClC,SAAW,QAElC,GAAKH,GAAiBC,EAAtB,CAIA,IAAIL,EAxBgB,SAAyBU,EAASvG,GAItD,OAAO4F,EAAsC,iBAH7CW,EAA6B,mBAAZA,EAAyBA,EAAQlK,OAAOkE,OAAO,CAAC,EAAGP,EAAMwG,MAAO,CAC/EzI,UAAWiC,EAAMjC,aACbwI,GACkDA,EAAUT,EAAgBS,EAASlJ,GAC7F,CAmBsBoJ,CAAgB3F,EAAQyF,QAASvG,GACjD0G,EAAY/C,EAAcsC,GAC1BU,EAAmB,MAATN,EAAe,EAAMlJ,EAC/ByJ,EAAmB,MAATP,EAAepJ,EAASC,EAClC2J,EAAU7G,EAAMwG,MAAM7I,UAAU2I,GAAOtG,EAAMwG,MAAM7I,UAAU0I,GAAQH,EAAcG,GAAQrG,EAAMwG,MAAM9I,OAAO4I,GAC9GQ,EAAYZ,EAAcG,GAAQrG,EAAMwG,MAAM7I,UAAU0I,GACxDU,EAAoB/B,EAAgBiB,GACpCe,EAAaD,EAA6B,MAATV,EAAeU,EAAkBE,cAAgB,EAAIF,EAAkBG,aAAe,EAAI,EAC3HC,EAAoBN,EAAU,EAAIC,EAAY,EAG9CpF,EAAMmE,EAAcc,GACpBlF,EAAMuF,EAAaN,EAAUJ,GAAOT,EAAce,GAClDQ,EAASJ,EAAa,EAAIN,EAAUJ,GAAO,EAAIa,EAC/CE,EAAS1B,EAAOjE,EAAK0F,EAAQ3F,GAE7B6F,EAAWjB,EACfrG,EAAMmG,cAAcxG,KAASqG,EAAwB,CAAC,GAAyBsB,GAAYD,EAAQrB,EAAsBuB,aAAeF,EAASD,EAAQpB,EAnBzJ,CAoBF,EAkCEtF,OAhCF,SAAgBC,GACd,IAAIX,EAAQW,EAAMX,MAEdwH,EADU7G,EAAMG,QACWlC,QAC3BqH,OAAoC,IAArBuB,EAA8B,sBAAwBA,EAErD,MAAhBvB,IAKwB,iBAAjBA,IACTA,EAAejG,EAAME,SAASxC,OAAO+J,cAAcxB,MAOhDpC,EAAS7D,EAAME,SAASxC,OAAQuI,KAIrCjG,EAAME,SAASgB,MAAQ+E,EACzB,EASE5E,SAAU,CAAC,iBACXqG,iBAAkB,CAAC,oBCxFN,SAASC,EAAa5J,GACnC,OAAOA,EAAUwD,MAAM,KAAK,EAC9B,CCOA,IAAIqG,EAAa,CACf5G,IAAK,OACL9D,MAAO,OACPD,OAAQ,OACRE,KAAM,QAeD,SAAS0K,GAAYlH,GAC1B,IAAImH,EAEApK,EAASiD,EAAMjD,OACfqK,EAAapH,EAAMoH,WACnBhK,EAAY4C,EAAM5C,UAClBiK,EAAYrH,EAAMqH,UAClBC,EAAUtH,EAAMsH,QAChBpH,EAAWF,EAAME,SACjBqH,EAAkBvH,EAAMuH,gBACxBC,EAAWxH,EAAMwH,SACjBC,EAAezH,EAAMyH,aACrBC,EAAU1H,EAAM0H,QAChBC,EAAaL,EAAQ1E,EACrBA,OAAmB,IAAf+E,EAAwB,EAAIA,EAChCC,EAAaN,EAAQxE,EACrBA,OAAmB,IAAf8E,EAAwB,EAAIA,EAEhCC,EAAgC,mBAAjBJ,EAA8BA,EAAa,CAC5D7E,EAAGA,EACHE,IACG,CACHF,EAAGA,EACHE,GAGFF,EAAIiF,EAAMjF,EACVE,EAAI+E,EAAM/E,EACV,IAAIgF,EAAOR,EAAQrL,eAAe,KAC9B8L,EAAOT,EAAQrL,eAAe,KAC9B+L,EAAQxL,EACRyL,EAAQ,EACRC,EAAM5J,OAEV,GAAIkJ,EAAU,CACZ,IAAIpD,EAAeC,EAAgBtH,GAC/BoL,EAAa,eACbC,EAAY,cAEZhE,IAAiBhG,EAAUrB,IAGmB,WAA5C,EAFJqH,EAAeN,EAAmB/G,IAECmD,UAAsC,aAAbA,IAC1DiI,EAAa,eACbC,EAAY,gBAOZhL,IAAc,IAAQA,IAAcZ,GAAQY,IAAcb,IAAU8K,IAAczK,KACpFqL,EAAQ3L,EAGRwG,IAFc4E,GAAWtD,IAAiB8D,GAAOA,EAAIxF,eAAiBwF,EAAIxF,eAAeD,OACzF2B,EAAa+D,IACEf,EAAW3E,OAC1BK,GAAKyE,EAAkB,GAAK,GAG1BnK,IAAcZ,IAASY,IAAc,GAAOA,IAAcd,GAAW+K,IAAczK,KACrFoL,EAAQzL,EAGRqG,IAFc8E,GAAWtD,IAAiB8D,GAAOA,EAAIxF,eAAiBwF,EAAIxF,eAAeH,MACzF6B,EAAagE,IACEhB,EAAW7E,MAC1BK,GAAK2E,EAAkB,GAAK,EAEhC,CAEA,IAgBMc,EAhBFC,EAAe5M,OAAOkE,OAAO,CAC/BM,SAAUA,GACTsH,GAAYP,GAEXsB,GAAyB,IAAjBd,EAlFd,SAA2BrI,EAAM8I,GAC/B,IAAItF,EAAIxD,EAAKwD,EACTE,EAAI1D,EAAK0D,EACT0F,EAAMN,EAAIO,kBAAoB,EAClC,MAAO,CACL7F,EAAG5B,EAAM4B,EAAI4F,GAAOA,GAAO,EAC3B1F,EAAG9B,EAAM8B,EAAI0F,GAAOA,GAAO,EAE/B,CA0EsCE,CAAkB,CACpD9F,EAAGA,EACHE,GACC1E,EAAUrB,IAAW,CACtB6F,EAAGA,EACHE,GAMF,OAHAF,EAAI2F,EAAM3F,EACVE,EAAIyF,EAAMzF,EAENyE,EAGK7L,OAAOkE,OAAO,CAAC,EAAG0I,IAAeD,EAAiB,CAAC,GAAkBJ,GAASF,EAAO,IAAM,GAAIM,EAAeL,GAASF,EAAO,IAAM,GAAIO,EAAe5D,WAAayD,EAAIO,kBAAoB,IAAM,EAAI,aAAe7F,EAAI,OAASE,EAAI,MAAQ,eAAiBF,EAAI,OAASE,EAAI,SAAUuF,IAG5R3M,OAAOkE,OAAO,CAAC,EAAG0I,IAAenB,EAAkB,CAAC,GAAmBc,GAASF,EAAOjF,EAAI,KAAO,GAAIqE,EAAgBa,GAASF,EAAOlF,EAAI,KAAO,GAAIuE,EAAgB1C,UAAY,GAAI0C,GAC9L,CA4CA,UACEnI,KAAM,gBACNC,SAAS,EACTC,MAAO,cACPC,GA9CF,SAAuBwJ,GACrB,IAAItJ,EAAQsJ,EAAMtJ,MACdc,EAAUwI,EAAMxI,QAChByI,EAAwBzI,EAAQoH,gBAChCA,OAA4C,IAA1BqB,GAA0CA,EAC5DC,EAAoB1I,EAAQqH,SAC5BA,OAAiC,IAAtBqB,GAAsCA,EACjDC,EAAwB3I,EAAQsH,aAChCA,OAAyC,IAA1BqB,GAA0CA,EACzDR,EAAe,CACjBlL,UAAWuD,EAAiBtB,EAAMjC,WAClCiK,UAAWL,EAAa3H,EAAMjC,WAC9BL,OAAQsC,EAAME,SAASxC,OACvBqK,WAAY/H,EAAMwG,MAAM9I,OACxBwK,gBAAiBA,EACjBG,QAAoC,UAA3BrI,EAAMc,QAAQC,UAGgB,MAArCf,EAAMmG,cAAcD,gBACtBlG,EAAMK,OAAO3C,OAASrB,OAAOkE,OAAO,CAAC,EAAGP,EAAMK,OAAO3C,OAAQmK,GAAYxL,OAAOkE,OAAO,CAAC,EAAG0I,EAAc,CACvGhB,QAASjI,EAAMmG,cAAcD,cAC7BrF,SAAUb,EAAMc,QAAQC,SACxBoH,SAAUA,EACVC,aAAcA,OAIe,MAA7BpI,EAAMmG,cAAcjF,QACtBlB,EAAMK,OAAOa,MAAQ7E,OAAOkE,OAAO,CAAC,EAAGP,EAAMK,OAAOa,MAAO2G,GAAYxL,OAAOkE,OAAO,CAAC,EAAG0I,EAAc,CACrGhB,QAASjI,EAAMmG,cAAcjF,MAC7BL,SAAU,WACVsH,UAAU,EACVC,aAAcA,OAIlBpI,EAAMM,WAAW5C,OAASrB,OAAOkE,OAAO,CAAC,EAAGP,EAAMM,WAAW5C,OAAQ,CACnE,wBAAyBsC,EAAMjC,WAEnC,EAQE2L,KAAM,CAAC,GCrKT,IAAIC,GAAU,CACZA,SAAS,GAsCX,UACEhK,KAAM,iBACNC,SAAS,EACTC,MAAO,QACPC,GAAI,WAAe,EACnBY,OAxCF,SAAgBX,GACd,IAAIC,EAAQD,EAAKC,MACb4J,EAAW7J,EAAK6J,SAChB9I,EAAUf,EAAKe,QACf+I,EAAkB/I,EAAQgJ,OAC1BA,OAA6B,IAApBD,GAAoCA,EAC7CE,EAAkBjJ,EAAQkJ,OAC1BA,OAA6B,IAApBD,GAAoCA,EAC7C9K,EAASF,EAAUiB,EAAME,SAASxC,QAClCuM,EAAgB,GAAGjM,OAAOgC,EAAMiK,cAActM,UAAWqC,EAAMiK,cAAcvM,QAYjF,OAVIoM,GACFG,EAAc9J,SAAQ,SAAU+J,GAC9BA,EAAaC,iBAAiB,SAAUP,EAASQ,OAAQT,GAC3D,IAGEK,GACF/K,EAAOkL,iBAAiB,SAAUP,EAASQ,OAAQT,IAG9C,WACDG,GACFG,EAAc9J,SAAQ,SAAU+J,GAC9BA,EAAaG,oBAAoB,SAAUT,EAASQ,OAAQT,GAC9D,IAGEK,GACF/K,EAAOoL,oBAAoB,SAAUT,EAASQ,OAAQT,GAE1D,CACF,EASED,KAAM,CAAC,GC/CT,IAAIY,GAAO,CACTnN,KAAM,QACND,MAAO,OACPD,OAAQ,MACR+D,IAAK,UAEQ,SAASuJ,GAAqBxM,GAC3C,OAAOA,EAAUyM,QAAQ,0BAA0B,SAAUC,GAC3D,OAAOH,GAAKG,EACd,GACF,CCVA,IAAI,GAAO,CACTnN,MAAO,MACPC,IAAK,SAEQ,SAASmN,GAA8B3M,GACpD,OAAOA,EAAUyM,QAAQ,cAAc,SAAUC,GAC/C,OAAO,GAAKA,EACd,GACF,CCPe,SAASE,GAAgB3L,GACtC,IAAI6J,EAAM9J,EAAUC,GAGpB,MAAO,CACL4L,WAHe/B,EAAIgC,YAInBC,UAHcjC,EAAIkC,YAKtB,CCNe,SAASC,GAAoBpM,GAQ1C,OAAO+D,EAAsB8B,EAAmB7F,IAAUzB,KAAOwN,GAAgB/L,GAASgM,UAC5F,CCXe,SAASK,GAAerM,GAErC,IAAIsM,EAAoB,EAAiBtM,GACrCuM,EAAWD,EAAkBC,SAC7BC,EAAYF,EAAkBE,UAC9BC,EAAYH,EAAkBG,UAElC,MAAO,6BAA6B3I,KAAKyI,EAAWE,EAAYD,EAClE,CCLe,SAASE,GAAgBtM,GACtC,MAAI,CAAC,OAAQ,OAAQ,aAAawF,QAAQ7F,EAAYK,KAAU,EAEvDA,EAAKG,cAAcoM,KAGxBhM,EAAcP,IAASiM,GAAejM,GACjCA,EAGFsM,GAAgB1G,EAAc5F,GACvC,CCJe,SAASwM,GAAkB5M,EAAS6M,GACjD,IAAIC,OAES,IAATD,IACFA,EAAO,IAGT,IAAIvB,EAAeoB,GAAgB1M,GAC/B+M,EAASzB,KAAqE,OAAlDwB,EAAwB9M,EAAQO,oBAAyB,EAASuM,EAAsBH,MACpH1C,EAAM9J,EAAUmL,GAChB0B,EAASD,EAAS,CAAC9C,GAAK7K,OAAO6K,EAAIxF,gBAAkB,GAAI4H,GAAef,GAAgBA,EAAe,IAAMA,EAC7G2B,EAAcJ,EAAKzN,OAAO4N,GAC9B,OAAOD,EAASE,EAChBA,EAAY7N,OAAOwN,GAAkB5G,EAAcgH,IACrD,CCzBe,SAASE,GAAiBC,GACvC,OAAO1P,OAAOkE,OAAO,CAAC,EAAGwL,EAAM,CAC7B5O,KAAM4O,EAAKxI,EACXvC,IAAK+K,EAAKtI,EACVvG,MAAO6O,EAAKxI,EAAIwI,EAAK7I,MACrBjG,OAAQ8O,EAAKtI,EAAIsI,EAAK3I,QAE1B,CCqBA,SAAS4I,GAA2BpN,EAASqN,EAAgBlL,GAC3D,OAAOkL,IAAmBxO,EAAWqO,GCzBxB,SAAyBlN,EAASmC,GAC/C,IAAI8H,EAAM9J,EAAUH,GAChBsN,EAAOzH,EAAmB7F,GAC1ByE,EAAiBwF,EAAIxF,eACrBH,EAAQgJ,EAAKhF,YACb9D,EAAS8I,EAAKjF,aACd1D,EAAI,EACJE,EAAI,EAER,GAAIJ,EAAgB,CAClBH,EAAQG,EAAeH,MACvBE,EAASC,EAAeD,OACxB,IAAI+I,EAAiB1J,KAEjB0J,IAAmBA,GAA+B,UAAbpL,KACvCwC,EAAIF,EAAeG,WACnBC,EAAIJ,EAAeK,UAEvB,CAEA,MAAO,CACLR,MAAOA,EACPE,OAAQA,EACRG,EAAGA,EAAIyH,GAAoBpM,GAC3B6E,EAAGA,EAEP,CDDwD2I,CAAgBxN,EAASmC,IAAa1B,EAAU4M,GAdxG,SAAoCrN,EAASmC,GAC3C,IAAIgL,EAAOpJ,EAAsB/D,GAAS,EAAoB,UAAbmC,GASjD,OARAgL,EAAK/K,IAAM+K,EAAK/K,IAAMpC,EAAQyN,UAC9BN,EAAK5O,KAAO4O,EAAK5O,KAAOyB,EAAQ0N,WAChCP,EAAK9O,OAAS8O,EAAK/K,IAAMpC,EAAQqI,aACjC8E,EAAK7O,MAAQ6O,EAAK5O,KAAOyB,EAAQsI,YACjC6E,EAAK7I,MAAQtE,EAAQsI,YACrB6E,EAAK3I,OAASxE,EAAQqI,aACtB8E,EAAKxI,EAAIwI,EAAK5O,KACd4O,EAAKtI,EAAIsI,EAAK/K,IACP+K,CACT,CAG0HQ,CAA2BN,EAAgBlL,GAAY+K,GEtBlK,SAAyBlN,GACtC,IAAI8M,EAEAQ,EAAOzH,EAAmB7F,GAC1B4N,EAAY7B,GAAgB/L,GAC5B2M,EAA0D,OAAlDG,EAAwB9M,EAAQO,oBAAyB,EAASuM,EAAsBH,KAChGrI,EAAQ,EAAIgJ,EAAKO,YAAaP,EAAKhF,YAAaqE,EAAOA,EAAKkB,YAAc,EAAGlB,EAAOA,EAAKrE,YAAc,GACvG9D,EAAS,EAAI8I,EAAKQ,aAAcR,EAAKjF,aAAcsE,EAAOA,EAAKmB,aAAe,EAAGnB,EAAOA,EAAKtE,aAAe,GAC5G1D,GAAKiJ,EAAU5B,WAAaI,GAAoBpM,GAChD6E,GAAK+I,EAAU1B,UAMnB,MAJiD,QAA7C,EAAiBS,GAAQW,GAAMS,YACjCpJ,GAAK,EAAI2I,EAAKhF,YAAaqE,EAAOA,EAAKrE,YAAc,GAAKhE,GAGrD,CACLA,MAAOA,EACPE,OAAQA,EACRG,EAAGA,EACHE,EAAGA,EAEP,CFCkMmJ,CAAgBnI,EAAmB7F,IACrO,CG1Be,SAASiO,GAAe9M,GACrC,IAOIkI,EAPAtK,EAAYoC,EAAKpC,UACjBiB,EAAUmB,EAAKnB,QACfb,EAAYgC,EAAKhC,UACjBqI,EAAgBrI,EAAYuD,EAAiBvD,GAAa,KAC1DiK,EAAYjK,EAAY4J,EAAa5J,GAAa,KAClD+O,EAAUnP,EAAU4F,EAAI5F,EAAUuF,MAAQ,EAAItE,EAAQsE,MAAQ,EAC9D6J,EAAUpP,EAAU8F,EAAI9F,EAAUyF,OAAS,EAAIxE,EAAQwE,OAAS,EAGpE,OAAQgD,GACN,KAAK,EACH6B,EAAU,CACR1E,EAAGuJ,EACHrJ,EAAG9F,EAAU8F,EAAI7E,EAAQwE,QAE3B,MAEF,KAAKnG,EACHgL,EAAU,CACR1E,EAAGuJ,EACHrJ,EAAG9F,EAAU8F,EAAI9F,EAAUyF,QAE7B,MAEF,KAAKlG,EACH+K,EAAU,CACR1E,EAAG5F,EAAU4F,EAAI5F,EAAUuF,MAC3BO,EAAGsJ,GAEL,MAEF,KAAK5P,EACH8K,EAAU,CACR1E,EAAG5F,EAAU4F,EAAI3E,EAAQsE,MACzBO,EAAGsJ,GAEL,MAEF,QACE9E,EAAU,CACR1E,EAAG5F,EAAU4F,EACbE,EAAG9F,EAAU8F,GAInB,IAAIuJ,EAAW5G,EAAgBV,EAAyBU,GAAiB,KAEzE,GAAgB,MAAZ4G,EAAkB,CACpB,IAAI1G,EAAmB,MAAb0G,EAAmB,SAAW,QAExC,OAAQhF,GACN,KAAK1K,EACH2K,EAAQ+E,GAAY/E,EAAQ+E,IAAarP,EAAU2I,GAAO,EAAI1H,EAAQ0H,GAAO,GAC7E,MAEF,KAAK/I,EACH0K,EAAQ+E,GAAY/E,EAAQ+E,IAAarP,EAAU2I,GAAO,EAAI1H,EAAQ0H,GAAO,GAKnF,CAEA,OAAO2B,CACT,CC3De,SAASgF,GAAejN,EAAOc,QAC5B,IAAZA,IACFA,EAAU,CAAC,GAGb,IAAIoM,EAAWpM,EACXqM,EAAqBD,EAASnP,UAC9BA,OAAmC,IAAvBoP,EAAgCnN,EAAMjC,UAAYoP,EAC9DC,EAAoBF,EAASnM,SAC7BA,OAAiC,IAAtBqM,EAA+BpN,EAAMe,SAAWqM,EAC3DC,EAAoBH,EAASI,SAC7BA,OAAiC,IAAtBD,EAA+B7P,EAAkB6P,EAC5DE,EAAwBL,EAASM,aACjCA,OAAyC,IAA1BD,EAAmC9P,EAAW8P,EAC7DE,EAAwBP,EAASQ,eACjCA,OAA2C,IAA1BD,EAAmC/P,EAAS+P,EAC7DE,EAAuBT,EAASU,YAChCA,OAAuC,IAAzBD,GAA0CA,EACxDE,EAAmBX,EAAS3G,QAC5BA,OAA+B,IAArBsH,EAA8B,EAAIA,EAC5ChI,EAAgBD,EAAsC,iBAAZW,EAAuBA,EAAUT,EAAgBS,EAASlJ,IACpGyQ,EAAaJ,IAAmBhQ,EAASC,EAAYD,EACrDqK,EAAa/H,EAAMwG,MAAM9I,OACzBkB,EAAUoB,EAAME,SAAS0N,EAAcE,EAAaJ,GACpDK,EJkBS,SAAyBnP,EAAS0O,EAAUE,EAAczM,GACvE,IAAIiN,EAAmC,oBAAbV,EAlB5B,SAA4B1O,GAC1B,IAAIpB,EAAkBgO,GAAkB5G,EAAchG,IAElDqP,EADoB,CAAC,WAAY,SAASzJ,QAAQ,EAAiB5F,GAASiC,WAAa,GACnDtB,EAAcX,GAAWoG,EAAgBpG,GAAWA,EAE9F,OAAKS,EAAU4O,GAKRzQ,EAAgBgI,QAAO,SAAUyG,GACtC,OAAO5M,EAAU4M,IAAmBpI,EAASoI,EAAgBgC,IAAmD,SAAhCtP,EAAYsN,EAC9F,IANS,EAOX,CAK6DiC,CAAmBtP,GAAW,GAAGZ,OAAOsP,GAC/F9P,EAAkB,GAAGQ,OAAOgQ,EAAqB,CAACR,IAClDW,EAAsB3Q,EAAgB,GACtC4Q,EAAe5Q,EAAgBK,QAAO,SAAUwQ,EAASpC,GAC3D,IAAIF,EAAOC,GAA2BpN,EAASqN,EAAgBlL,GAK/D,OAJAsN,EAAQrN,IAAM,EAAI+K,EAAK/K,IAAKqN,EAAQrN,KACpCqN,EAAQnR,MAAQ,EAAI6O,EAAK7O,MAAOmR,EAAQnR,OACxCmR,EAAQpR,OAAS,EAAI8O,EAAK9O,OAAQoR,EAAQpR,QAC1CoR,EAAQlR,KAAO,EAAI4O,EAAK5O,KAAMkR,EAAQlR,MAC/BkR,CACT,GAAGrC,GAA2BpN,EAASuP,EAAqBpN,IAK5D,OAJAqN,EAAalL,MAAQkL,EAAalR,MAAQkR,EAAajR,KACvDiR,EAAahL,OAASgL,EAAanR,OAASmR,EAAapN,IACzDoN,EAAa7K,EAAI6K,EAAajR,KAC9BiR,EAAa3K,EAAI2K,EAAapN,IACvBoN,CACT,CInC2BE,CAAgBjP,EAAUT,GAAWA,EAAUA,EAAQ2P,gBAAkB9J,EAAmBzE,EAAME,SAASxC,QAAS4P,EAAUE,EAAczM,GACjKyN,EAAsB7L,EAAsB3C,EAAME,SAASvC,WAC3DuI,EAAgB2G,GAAe,CACjClP,UAAW6Q,EACX5P,QAASmJ,EACThH,SAAU,WACVhD,UAAWA,IAET0Q,EAAmB3C,GAAiBzP,OAAOkE,OAAO,CAAC,EAAGwH,EAAY7B,IAClEwI,EAAoBhB,IAAmBhQ,EAAS+Q,EAAmBD,EAGnEG,EAAkB,CACpB3N,IAAK+M,EAAmB/M,IAAM0N,EAAkB1N,IAAM6E,EAAc7E,IACpE/D,OAAQyR,EAAkBzR,OAAS8Q,EAAmB9Q,OAAS4I,EAAc5I,OAC7EE,KAAM4Q,EAAmB5Q,KAAOuR,EAAkBvR,KAAO0I,EAAc1I,KACvED,MAAOwR,EAAkBxR,MAAQ6Q,EAAmB7Q,MAAQ2I,EAAc3I,OAExE0R,EAAa5O,EAAMmG,cAAckB,OAErC,GAAIqG,IAAmBhQ,GAAUkR,EAAY,CAC3C,IAAIvH,EAASuH,EAAW7Q,GACxB1B,OAAO4D,KAAK0O,GAAiBxO,SAAQ,SAAUhE,GAC7C,IAAI0S,EAAW,CAAC3R,EAAOD,GAAQuH,QAAQrI,IAAQ,EAAI,GAAK,EACpDkK,EAAO,CAAC,EAAKpJ,GAAQuH,QAAQrI,IAAQ,EAAI,IAAM,IACnDwS,EAAgBxS,IAAQkL,EAAOhB,GAAQwI,CACzC,GACF,CAEA,OAAOF,CACT,CCyEA,UACEhP,KAAM,OACNC,SAAS,EACTC,MAAO,OACPC,GA5HF,SAAcC,GACZ,IAAIC,EAAQD,EAAKC,MACbc,EAAUf,EAAKe,QACfnB,EAAOI,EAAKJ,KAEhB,IAAIK,EAAMmG,cAAcxG,GAAMmP,MAA9B,CAoCA,IAhCA,IAAIC,EAAoBjO,EAAQkM,SAC5BgC,OAAsC,IAAtBD,GAAsCA,EACtDE,EAAmBnO,EAAQoO,QAC3BC,OAAoC,IAArBF,GAAqCA,EACpDG,EAA8BtO,EAAQuO,mBACtC9I,EAAUzF,EAAQyF,QAClB+G,EAAWxM,EAAQwM,SACnBE,EAAe1M,EAAQ0M,aACvBI,EAAc9M,EAAQ8M,YACtB0B,EAAwBxO,EAAQyO,eAChCA,OAA2C,IAA1BD,GAA0CA,EAC3DE,EAAwB1O,EAAQ0O,sBAChCC,EAAqBzP,EAAMc,QAAQ/C,UACnCqI,EAAgB9E,EAAiBmO,GAEjCJ,EAAqBD,IADHhJ,IAAkBqJ,GACqCF,EAjC/E,SAAuCxR,GACrC,GAAIuD,EAAiBvD,KAAeX,EAClC,MAAO,GAGT,IAAIsS,EAAoBnF,GAAqBxM,GAC7C,MAAO,CAAC2M,GAA8B3M,GAAY2R,EAAmBhF,GAA8BgF,GACrG,CA0B6IC,CAA8BF,GAA3E,CAAClF,GAAqBkF,KAChHG,EAAa,CAACH,GAAoBzR,OAAOqR,GAAoBxR,QAAO,SAAUC,EAAKC,GACrF,OAAOD,EAAIE,OAAOsD,EAAiBvD,KAAeX,ECvCvC,SAA8B4C,EAAOc,QAClC,IAAZA,IACFA,EAAU,CAAC,GAGb,IAAIoM,EAAWpM,EACX/C,EAAYmP,EAASnP,UACrBuP,EAAWJ,EAASI,SACpBE,EAAeN,EAASM,aACxBjH,EAAU2G,EAAS3G,QACnBgJ,EAAiBrC,EAASqC,eAC1BM,EAAwB3C,EAASsC,sBACjCA,OAAkD,IAA1BK,EAAmC,EAAgBA,EAC3E7H,EAAYL,EAAa5J,GACzB6R,EAAa5H,EAAYuH,EAAiB3R,EAAsBA,EAAoB4H,QAAO,SAAUzH,GACvG,OAAO4J,EAAa5J,KAAeiK,CACrC,IAAK3K,EACDyS,EAAoBF,EAAWpK,QAAO,SAAUzH,GAClD,OAAOyR,EAAsBhL,QAAQzG,IAAc,CACrD,IAEiC,IAA7B+R,EAAkBC,SACpBD,EAAoBF,GAItB,IAAII,EAAYF,EAAkBjS,QAAO,SAAUC,EAAKC,GAOtD,OANAD,EAAIC,GAAakP,GAAejN,EAAO,CACrCjC,UAAWA,EACXuP,SAAUA,EACVE,aAAcA,EACdjH,QAASA,IACRjF,EAAiBvD,IACbD,CACT,GAAG,CAAC,GACJ,OAAOzB,OAAO4D,KAAK+P,GAAWC,MAAK,SAAUC,EAAGC,GAC9C,OAAOH,EAAUE,GAAKF,EAAUG,EAClC,GACF,CDC6DC,CAAqBpQ,EAAO,CACnFjC,UAAWA,EACXuP,SAAUA,EACVE,aAAcA,EACdjH,QAASA,EACTgJ,eAAgBA,EAChBC,sBAAuBA,IACpBzR,EACP,GAAG,IACCsS,EAAgBrQ,EAAMwG,MAAM7I,UAC5BoK,EAAa/H,EAAMwG,MAAM9I,OACzB4S,EAAY,IAAIC,IAChBC,GAAqB,EACrBC,EAAwBb,EAAW,GAE9Bc,EAAI,EAAGA,EAAId,EAAWG,OAAQW,IAAK,CAC1C,IAAI3S,EAAY6R,EAAWc,GAEvBC,EAAiBrP,EAAiBvD,GAElC6S,EAAmBjJ,EAAa5J,KAAeT,EAC/CuT,EAAa,CAAC,EAAK5T,GAAQuH,QAAQmM,IAAmB,EACtDrK,EAAMuK,EAAa,QAAU,SAC7B1F,EAAW8B,GAAejN,EAAO,CACnCjC,UAAWA,EACXuP,SAAUA,EACVE,aAAcA,EACdI,YAAaA,EACbrH,QAASA,IAEPuK,EAAoBD,EAAaD,EAAmB1T,EAAQC,EAAOyT,EAAmB3T,EAAS,EAE/FoT,EAAc/J,GAAOyB,EAAWzB,KAClCwK,EAAoBvG,GAAqBuG,IAG3C,IAAIC,EAAmBxG,GAAqBuG,GACxCE,EAAS,GAUb,GARIhC,GACFgC,EAAOC,KAAK9F,EAASwF,IAAmB,GAGtCxB,GACF6B,EAAOC,KAAK9F,EAAS2F,IAAsB,EAAG3F,EAAS4F,IAAqB,GAG1EC,EAAOE,OAAM,SAAUC,GACzB,OAAOA,CACT,IAAI,CACFV,EAAwB1S,EACxByS,GAAqB,EACrB,KACF,CAEAF,EAAUc,IAAIrT,EAAWiT,EAC3B,CAEA,GAAIR,EAqBF,IAnBA,IAEIa,EAAQ,SAAeC,GACzB,IAAIC,EAAmB3B,EAAW4B,MAAK,SAAUzT,GAC/C,IAAIiT,EAASV,EAAU9T,IAAIuB,GAE3B,GAAIiT,EACF,OAAOA,EAAOS,MAAM,EAAGH,GAAIJ,OAAM,SAAUC,GACzC,OAAOA,CACT,GAEJ,IAEA,GAAII,EAEF,OADAd,EAAwBc,EACjB,OAEX,EAESD,EAnBY/B,EAAiB,EAAI,EAmBZ+B,EAAK,GAGpB,UAFFD,EAAMC,GADmBA,KAOpCtR,EAAMjC,YAAc0S,IACtBzQ,EAAMmG,cAAcxG,GAAMmP,OAAQ,EAClC9O,EAAMjC,UAAY0S,EAClBzQ,EAAM0R,OAAQ,EA5GhB,CA8GF,EAQEhK,iBAAkB,CAAC,UACnBgC,KAAM,CACJoF,OAAO,IE7IX,SAAS6C,GAAexG,EAAUY,EAAM6F,GAQtC,YAPyB,IAArBA,IACFA,EAAmB,CACjBrO,EAAG,EACHE,EAAG,IAIA,CACLzC,IAAKmK,EAASnK,IAAM+K,EAAK3I,OAASwO,EAAiBnO,EACnDvG,MAAOiO,EAASjO,MAAQ6O,EAAK7I,MAAQ0O,EAAiBrO,EACtDtG,OAAQkO,EAASlO,OAAS8O,EAAK3I,OAASwO,EAAiBnO,EACzDtG,KAAMgO,EAAShO,KAAO4O,EAAK7I,MAAQ0O,EAAiBrO,EAExD,CAEA,SAASsO,GAAsB1G,GAC7B,MAAO,CAAC,EAAKjO,EAAOD,EAAQE,GAAM2U,MAAK,SAAUC,GAC/C,OAAO5G,EAAS4G,IAAS,CAC3B,GACF,CA+BA,UACEpS,KAAM,OACNC,SAAS,EACTC,MAAO,OACP6H,iBAAkB,CAAC,mBACnB5H,GAlCF,SAAcC,GACZ,IAAIC,EAAQD,EAAKC,MACbL,EAAOI,EAAKJ,KACZ0Q,EAAgBrQ,EAAMwG,MAAM7I,UAC5BoK,EAAa/H,EAAMwG,MAAM9I,OACzBkU,EAAmB5R,EAAMmG,cAAc6L,gBACvCC,EAAoBhF,GAAejN,EAAO,CAC5C0N,eAAgB,cAEdwE,EAAoBjF,GAAejN,EAAO,CAC5C4N,aAAa,IAEXuE,EAA2BR,GAAeM,EAAmB5B,GAC7D+B,EAAsBT,GAAeO,EAAmBnK,EAAY6J,GACpES,EAAoBR,GAAsBM,GAC1CG,EAAmBT,GAAsBO,GAC7CpS,EAAMmG,cAAcxG,GAAQ,CAC1BwS,yBAA0BA,EAC1BC,oBAAqBA,EACrBC,kBAAmBA,EACnBC,iBAAkBA,GAEpBtS,EAAMM,WAAW5C,OAASrB,OAAOkE,OAAO,CAAC,EAAGP,EAAMM,WAAW5C,OAAQ,CACnE,+BAAgC2U,EAChC,sBAAuBC,GAE3B,GCJA,IACE3S,KAAM,SACNC,SAAS,EACTC,MAAO,OACPwB,SAAU,CAAC,iBACXvB,GA5BF,SAAgBa,GACd,IAAIX,EAAQW,EAAMX,MACdc,EAAUH,EAAMG,QAChBnB,EAAOgB,EAAMhB,KACb4S,EAAkBzR,EAAQuG,OAC1BA,OAA6B,IAApBkL,EAA6B,CAAC,EAAG,GAAKA,EAC/C7I,EAAO,EAAW7L,QAAO,SAAUC,EAAKC,GAE1C,OADAD,EAAIC,GA5BD,SAAiCA,EAAWyI,EAAOa,GACxD,IAAIjB,EAAgB9E,EAAiBvD,GACjCyU,EAAiB,CAACrV,EAAM,GAAKqH,QAAQ4B,IAAkB,GAAK,EAAI,EAEhErG,EAAyB,mBAAXsH,EAAwBA,EAAOhL,OAAOkE,OAAO,CAAC,EAAGiG,EAAO,CACxEzI,UAAWA,KACPsJ,EACFoL,EAAW1S,EAAK,GAChB2S,EAAW3S,EAAK,GAIpB,OAFA0S,EAAWA,GAAY,EACvBC,GAAYA,GAAY,GAAKF,EACtB,CAACrV,EAAMD,GAAOsH,QAAQ4B,IAAkB,EAAI,CACjD7C,EAAGmP,EACHjP,EAAGgP,GACD,CACFlP,EAAGkP,EACHhP,EAAGiP,EAEP,CASqBC,CAAwB5U,EAAWiC,EAAMwG,MAAOa,GAC1DvJ,CACT,GAAG,CAAC,GACA8U,EAAwBlJ,EAAK1J,EAAMjC,WACnCwF,EAAIqP,EAAsBrP,EAC1BE,EAAImP,EAAsBnP,EAEW,MAArCzD,EAAMmG,cAAcD,gBACtBlG,EAAMmG,cAAcD,cAAc3C,GAAKA,EACvCvD,EAAMmG,cAAcD,cAAczC,GAAKA,GAGzCzD,EAAMmG,cAAcxG,GAAQ+J,CAC9B,GC1BA,IACE/J,KAAM,gBACNC,SAAS,EACTC,MAAO,OACPC,GApBF,SAAuBC,GACrB,IAAIC,EAAQD,EAAKC,MACbL,EAAOI,EAAKJ,KAKhBK,EAAMmG,cAAcxG,GAAQkN,GAAe,CACzClP,UAAWqC,EAAMwG,MAAM7I,UACvBiB,QAASoB,EAAMwG,MAAM9I,OACrBqD,SAAU,WACVhD,UAAWiC,EAAMjC,WAErB,EAQE2L,KAAM,CAAC,GCgHT,IACE/J,KAAM,kBACNC,SAAS,EACTC,MAAO,OACPC,GA/HF,SAAyBC,GACvB,IAAIC,EAAQD,EAAKC,MACbc,EAAUf,EAAKe,QACfnB,EAAOI,EAAKJ,KACZoP,EAAoBjO,EAAQkM,SAC5BgC,OAAsC,IAAtBD,GAAsCA,EACtDE,EAAmBnO,EAAQoO,QAC3BC,OAAoC,IAArBF,GAAsCA,EACrD3B,EAAWxM,EAAQwM,SACnBE,EAAe1M,EAAQ0M,aACvBI,EAAc9M,EAAQ8M,YACtBrH,EAAUzF,EAAQyF,QAClBsM,EAAkB/R,EAAQgS,OAC1BA,OAA6B,IAApBD,GAAoCA,EAC7CE,EAAwBjS,EAAQkS,aAChCA,OAAyC,IAA1BD,EAAmC,EAAIA,EACtD5H,EAAW8B,GAAejN,EAAO,CACnCsN,SAAUA,EACVE,aAAcA,EACdjH,QAASA,EACTqH,YAAaA,IAEXxH,EAAgB9E,EAAiBtB,EAAMjC,WACvCiK,EAAYL,EAAa3H,EAAMjC,WAC/BkV,GAAmBjL,EACnBgF,EAAWtH,EAAyBU,GACpC8I,ECrCY,MDqCSlC,ECrCH,IAAM,IDsCxB9G,EAAgBlG,EAAMmG,cAAcD,cACpCmK,EAAgBrQ,EAAMwG,MAAM7I,UAC5BoK,EAAa/H,EAAMwG,MAAM9I,OACzBwV,EAA4C,mBAAjBF,EAA8BA,EAAa3W,OAAOkE,OAAO,CAAC,EAAGP,EAAMwG,MAAO,CACvGzI,UAAWiC,EAAMjC,aACbiV,EACFG,EAA2D,iBAAtBD,EAAiC,CACxElG,SAAUkG,EACVhE,QAASgE,GACP7W,OAAOkE,OAAO,CAChByM,SAAU,EACVkC,QAAS,GACRgE,GACCE,EAAsBpT,EAAMmG,cAAckB,OAASrH,EAAMmG,cAAckB,OAAOrH,EAAMjC,WAAa,KACjG2L,EAAO,CACTnG,EAAG,EACHE,EAAG,GAGL,GAAKyC,EAAL,CAIA,GAAI8I,EAAe,CACjB,IAAIqE,EAEAC,EAAwB,MAAbtG,EAAmB,EAAM7P,EACpCoW,EAAuB,MAAbvG,EAAmB/P,EAASC,EACtCoJ,EAAmB,MAAb0G,EAAmB,SAAW,QACpC3F,EAASnB,EAAc8G,GACvBtL,EAAM2F,EAAS8D,EAASmI,GACxB7R,EAAM4F,EAAS8D,EAASoI,GACxBC,EAAWV,GAAU/K,EAAWzB,GAAO,EAAI,EAC3CmN,EAASzL,IAAc1K,EAAQ+S,EAAc/J,GAAOyB,EAAWzB,GAC/DoN,EAAS1L,IAAc1K,GAASyK,EAAWzB,IAAQ+J,EAAc/J,GAGjEL,EAAejG,EAAME,SAASgB,MAC9BwF,EAAYoM,GAAU7M,EAAetC,EAAcsC,GAAgB,CACrE/C,MAAO,EACPE,OAAQ,GAENuQ,GAAqB3T,EAAMmG,cAAc,oBAAsBnG,EAAMmG,cAAc,oBAAoBI,QxBhFtG,CACLvF,IAAK,EACL9D,MAAO,EACPD,OAAQ,EACRE,KAAM,GwB6EFyW,GAAkBD,GAAmBL,GACrCO,GAAkBF,GAAmBJ,GAMrCO,GAAWnO,EAAO,EAAG0K,EAAc/J,GAAMI,EAAUJ,IACnDyN,GAAYd,EAAkB5C,EAAc/J,GAAO,EAAIkN,EAAWM,GAAWF,GAAkBT,EAA4BnG,SAAWyG,EAASK,GAAWF,GAAkBT,EAA4BnG,SACxMgH,GAAYf,GAAmB5C,EAAc/J,GAAO,EAAIkN,EAAWM,GAAWD,GAAkBV,EAA4BnG,SAAW0G,EAASI,GAAWD,GAAkBV,EAA4BnG,SACzMjG,GAAoB/G,EAAME,SAASgB,OAAS8D,EAAgBhF,EAAME,SAASgB,OAC3E+S,GAAelN,GAAiC,MAAbiG,EAAmBjG,GAAkBsF,WAAa,EAAItF,GAAkBuF,YAAc,EAAI,EAC7H4H,GAAwH,OAAjGb,EAA+C,MAAvBD,OAA8B,EAASA,EAAoBpG,IAAqBqG,EAAwB,EAEvJc,GAAY9M,EAAS2M,GAAYE,GACjCE,GAAkBzO,EAAOmN,EAAS,EAAQpR,EAF9B2F,EAAS0M,GAAYG,GAAsBD,IAEKvS,EAAK2F,EAAQyL,EAAS,EAAQrR,EAAK0S,IAAa1S,GAChHyE,EAAc8G,GAAYoH,GAC1B1K,EAAKsD,GAAYoH,GAAkB/M,CACrC,CAEA,GAAI8H,EAAc,CAChB,IAAIkF,GAEAC,GAAyB,MAAbtH,EAAmB,EAAM7P,EAErCoX,GAAwB,MAAbvH,EAAmB/P,EAASC,EAEvCsX,GAAUtO,EAAcgJ,GAExBuF,GAAmB,MAAZvF,EAAkB,SAAW,QAEpCwF,GAAOF,GAAUrJ,EAASmJ,IAE1BK,GAAOH,GAAUrJ,EAASoJ,IAE1BK,IAAuD,IAAxC,CAAC,EAAKzX,GAAMqH,QAAQ4B,GAEnCyO,GAAyH,OAAjGR,GAAgD,MAAvBjB,OAA8B,EAASA,EAAoBlE,IAAoBmF,GAAyB,EAEzJS,GAAaF,GAAeF,GAAOF,GAAUnE,EAAcoE,IAAQ1M,EAAW0M,IAAQI,GAAuB1B,EAA4BjE,QAEzI6F,GAAaH,GAAeJ,GAAUnE,EAAcoE,IAAQ1M,EAAW0M,IAAQI,GAAuB1B,EAA4BjE,QAAUyF,GAE5IK,GAAmBlC,GAAU8B,G1BzH9B,SAAwBlT,EAAK1E,EAAOyE,GACzC,IAAIwT,EAAItP,EAAOjE,EAAK1E,EAAOyE,GAC3B,OAAOwT,EAAIxT,EAAMA,EAAMwT,CACzB,C0BsHoDC,CAAeJ,GAAYN,GAASO,IAAcpP,EAAOmN,EAASgC,GAAaJ,GAAMF,GAAS1B,EAASiC,GAAaJ,IAEpKzO,EAAcgJ,GAAW8F,GACzBtL,EAAKwF,GAAW8F,GAAmBR,EACrC,CAEAxU,EAAMmG,cAAcxG,GAAQ+J,CAvE5B,CAwEF,EAQEhC,iBAAkB,CAAC,WE1HN,SAASyN,GAAiBC,EAAyBrQ,EAAcsD,QAC9D,IAAZA,IACFA,GAAU,GAGZ,ICnBoCrJ,ECJOJ,EFuBvCyW,EAA0B9V,EAAcwF,GACxCuQ,EAAuB/V,EAAcwF,IAf3C,SAAyBnG,GACvB,IAAImN,EAAOnN,EAAQ+D,wBACfI,EAASpB,EAAMoK,EAAK7I,OAAStE,EAAQqE,aAAe,EACpDD,EAASrB,EAAMoK,EAAK3I,QAAUxE,EAAQuE,cAAgB,EAC1D,OAAkB,IAAXJ,GAA2B,IAAXC,CACzB,CAU4DuS,CAAgBxQ,GACtEJ,EAAkBF,EAAmBM,GACrCgH,EAAOpJ,EAAsByS,EAAyBE,EAAsBjN,GAC5EyB,EAAS,CACXc,WAAY,EACZE,UAAW,GAET7C,EAAU,CACZ1E,EAAG,EACHE,EAAG,GAkBL,OAfI4R,IAA4BA,IAA4BhN,MACxB,SAA9B1J,EAAYoG,IAChBkG,GAAetG,MACbmF,GCnCgC9K,EDmCT+F,KClCdhG,EAAUC,IAAUO,EAAcP,GCJxC,CACL4L,YAFyChM,EDQbI,GCNR4L,WACpBE,UAAWlM,EAAQkM,WDGZH,GAAgB3L,IDoCnBO,EAAcwF,KAChBkD,EAAUtF,EAAsBoC,GAAc,IACtCxB,GAAKwB,EAAauH,WAC1BrE,EAAQxE,GAAKsB,EAAasH,WACjB1H,IACTsD,EAAQ1E,EAAIyH,GAAoBrG,KAI7B,CACLpB,EAAGwI,EAAK5O,KAAO2M,EAAOc,WAAa3C,EAAQ1E,EAC3CE,EAAGsI,EAAK/K,IAAM8I,EAAOgB,UAAY7C,EAAQxE,EACzCP,MAAO6I,EAAK7I,MACZE,OAAQ2I,EAAK3I,OAEjB,CGvDA,SAASoS,GAAMC,GACb,IAAItT,EAAM,IAAIoO,IACVmF,EAAU,IAAIC,IACdC,EAAS,GAKb,SAAS3F,EAAK4F,GACZH,EAAQI,IAAID,EAASlW,MACN,GAAG3B,OAAO6X,EAASxU,UAAY,GAAIwU,EAASnO,kBAAoB,IACtEvH,SAAQ,SAAU4V,GACzB,IAAKL,EAAQM,IAAID,GAAM,CACrB,IAAIE,EAAc9T,EAAI3F,IAAIuZ,GAEtBE,GACFhG,EAAKgG,EAET,CACF,IACAL,EAAO3E,KAAK4E,EACd,CAQA,OAzBAJ,EAAUtV,SAAQ,SAAU0V,GAC1B1T,EAAIiP,IAAIyE,EAASlW,KAAMkW,EACzB,IAiBAJ,EAAUtV,SAAQ,SAAU0V,GACrBH,EAAQM,IAAIH,EAASlW,OAExBsQ,EAAK4F,EAET,IACOD,CACT,CCvBA,IAAIM,GAAkB,CACpBnY,UAAW,SACX0X,UAAW,GACX1U,SAAU,YAGZ,SAASoV,KACP,IAAK,IAAI1B,EAAO2B,UAAUrG,OAAQsG,EAAO,IAAIpU,MAAMwS,GAAO6B,EAAO,EAAGA,EAAO7B,EAAM6B,IAC/ED,EAAKC,GAAQF,UAAUE,GAGzB,OAAQD,EAAKvE,MAAK,SAAUlT,GAC1B,QAASA,GAAoD,mBAAlCA,EAAQ+D,sBACrC,GACF,CAEO,SAAS4T,GAAgBC,QACL,IAArBA,IACFA,EAAmB,CAAC,GAGtB,IAAIC,EAAoBD,EACpBE,EAAwBD,EAAkBE,iBAC1CA,OAA6C,IAA1BD,EAAmC,GAAKA,EAC3DE,EAAyBH,EAAkBI,eAC3CA,OAA4C,IAA3BD,EAAoCV,GAAkBU,EAC3E,OAAO,SAAsBjZ,EAAWD,EAAQoD,QAC9B,IAAZA,IACFA,EAAU+V,GAGZ,ICxC6B/W,EAC3BgX,EDuCE9W,EAAQ,CACVjC,UAAW,SACXgZ,iBAAkB,GAClBjW,QAASzE,OAAOkE,OAAO,CAAC,EAAG2V,GAAiBW,GAC5C1Q,cAAe,CAAC,EAChBjG,SAAU,CACRvC,UAAWA,EACXD,OAAQA,GAEV4C,WAAY,CAAC,EACbD,OAAQ,CAAC,GAEP2W,EAAmB,GACnBC,GAAc,EACdrN,EAAW,CACb5J,MAAOA,EACPkX,WAAY,SAAoBC,GAC9B,IAAIrW,EAAsC,mBAArBqW,EAAkCA,EAAiBnX,EAAMc,SAAWqW,EACzFC,IACApX,EAAMc,QAAUzE,OAAOkE,OAAO,CAAC,EAAGsW,EAAgB7W,EAAMc,QAASA,GACjEd,EAAMiK,cAAgB,CACpBtM,UAAW0B,EAAU1B,GAAa6N,GAAkB7N,GAAaA,EAAU4Q,eAAiB/C,GAAkB7N,EAAU4Q,gBAAkB,GAC1I7Q,OAAQ8N,GAAkB9N,IAI5B,IElE4B+X,EAC9B4B,EFiEMN,EDhCG,SAAwBtB,GAErC,IAAIsB,EAAmBvB,GAAMC,GAE7B,OAAO/W,EAAeb,QAAO,SAAUC,EAAK+B,GAC1C,OAAO/B,EAAIE,OAAO+Y,EAAiBvR,QAAO,SAAUqQ,GAClD,OAAOA,EAAShW,QAAUA,CAC5B,IACF,GAAG,GACL,CCuB+ByX,EElEK7B,EFkEsB,GAAGzX,OAAO2Y,EAAkB3W,EAAMc,QAAQ2U,WEjE9F4B,EAAS5B,EAAU5X,QAAO,SAAUwZ,EAAQE,GAC9C,IAAIC,EAAWH,EAAOE,EAAQ5X,MAK9B,OAJA0X,EAAOE,EAAQ5X,MAAQ6X,EAAWnb,OAAOkE,OAAO,CAAC,EAAGiX,EAAUD,EAAS,CACrEzW,QAASzE,OAAOkE,OAAO,CAAC,EAAGiX,EAAS1W,QAASyW,EAAQzW,SACrD4I,KAAMrN,OAAOkE,OAAO,CAAC,EAAGiX,EAAS9N,KAAM6N,EAAQ7N,QAC5C6N,EACEF,CACT,GAAG,CAAC,GAEGhb,OAAO4D,KAAKoX,GAAQlV,KAAI,SAAUhG,GACvC,OAAOkb,EAAOlb,EAChB,MF4DM,OAJA6D,EAAM+W,iBAAmBA,EAAiBvR,QAAO,SAAUiS,GACzD,OAAOA,EAAE7X,OACX,IA+FFI,EAAM+W,iBAAiB5W,SAAQ,SAAUJ,GACvC,IAAIJ,EAAOI,EAAKJ,KACZ+X,EAAe3X,EAAKe,QACpBA,OAA2B,IAAjB4W,EAA0B,CAAC,EAAIA,EACzChX,EAASX,EAAKW,OAElB,GAAsB,mBAAXA,EAAuB,CAChC,IAAIiX,EAAYjX,EAAO,CACrBV,MAAOA,EACPL,KAAMA,EACNiK,SAAUA,EACV9I,QAASA,IAKXkW,EAAiB/F,KAAK0G,GAFT,WAAmB,EAGlC,CACF,IA/GS/N,EAASQ,QAClB,EAMAwN,YAAa,WACX,IAAIX,EAAJ,CAIA,IAAIY,EAAkB7X,EAAME,SACxBvC,EAAYka,EAAgBla,UAC5BD,EAASma,EAAgBna,OAG7B,GAAKyY,GAAiBxY,EAAWD,GAAjC,CAKAsC,EAAMwG,MAAQ,CACZ7I,UAAWwX,GAAiBxX,EAAWqH,EAAgBtH,GAAoC,UAA3BsC,EAAMc,QAAQC,UAC9ErD,OAAQiG,EAAcjG,IAOxBsC,EAAM0R,OAAQ,EACd1R,EAAMjC,UAAYiC,EAAMc,QAAQ/C,UAKhCiC,EAAM+W,iBAAiB5W,SAAQ,SAAU0V,GACvC,OAAO7V,EAAMmG,cAAc0P,EAASlW,MAAQtD,OAAOkE,OAAO,CAAC,EAAGsV,EAASnM,KACzE,IAEA,IAAK,IAAIoO,EAAQ,EAAGA,EAAQ9X,EAAM+W,iBAAiBhH,OAAQ+H,IACzD,IAAoB,IAAhB9X,EAAM0R,MAAV,CAMA,IAAIqG,EAAwB/X,EAAM+W,iBAAiBe,GAC/ChY,EAAKiY,EAAsBjY,GAC3BkY,EAAyBD,EAAsBjX,QAC/CoM,OAAsC,IAA3B8K,EAAoC,CAAC,EAAIA,EACpDrY,EAAOoY,EAAsBpY,KAEf,mBAAPG,IACTE,EAAQF,EAAG,CACTE,MAAOA,EACPc,QAASoM,EACTvN,KAAMA,EACNiK,SAAUA,KACN5J,EAdR,MAHEA,EAAM0R,OAAQ,EACdoG,GAAS,CAzBb,CATA,CAqDF,EAGA1N,QC1I2BtK,ED0IV,WACf,OAAO,IAAImY,SAAQ,SAAUC,GAC3BtO,EAASgO,cACTM,EAAQlY,EACV,GACF,EC7IG,WAUL,OATK8W,IACHA,EAAU,IAAImB,SAAQ,SAAUC,GAC9BD,QAAQC,UAAUC,MAAK,WACrBrB,OAAUsB,EACVF,EAAQpY,IACV,GACF,KAGKgX,CACT,GDmIIuB,QAAS,WACPjB,IACAH,GAAc,CAChB,GAGF,IAAKd,GAAiBxY,EAAWD,GAC/B,OAAOkM,EAmCT,SAASwN,IACPJ,EAAiB7W,SAAQ,SAAUL,GACjC,OAAOA,GACT,IACAkX,EAAmB,EACrB,CAEA,OAvCApN,EAASsN,WAAWpW,GAASqX,MAAK,SAAUnY,IACrCiX,GAAenW,EAAQwX,eAC1BxX,EAAQwX,cAActY,EAE1B,IAmCO4J,CACT,CACF,CACO,IAAI2O,GAA4BhC,KGzLnC,GAA4BA,GAAgB,CAC9CI,iBAFqB,CAAC6B,GAAgB,GAAe,GAAe,EAAa,GAAQ,GAAM,GAAiB,EAAO,MCJrH,GAA4BjC,GAAgB,CAC9CI,iBAFqB,CAAC6B,GAAgB,GAAe,GAAe,KCatE,MAAMC,GAAa,IAAIlI,IACjBmI,GAAO,CACX,GAAAtH,CAAIxS,EAASzC,EAAKyN,GACX6O,GAAWzC,IAAIpX,IAClB6Z,GAAWrH,IAAIxS,EAAS,IAAI2R,KAE9B,MAAMoI,EAAcF,GAAWjc,IAAIoC,GAI9B+Z,EAAY3C,IAAI7Z,IAA6B,IAArBwc,EAAYC,KAKzCD,EAAYvH,IAAIjV,EAAKyN,GAHnBiP,QAAQC,MAAM,+EAA+E7W,MAAM8W,KAAKJ,EAAY1Y,QAAQ,MAIhI,EACAzD,IAAG,CAACoC,EAASzC,IACPsc,GAAWzC,IAAIpX,IACV6Z,GAAWjc,IAAIoC,GAASpC,IAAIL,IAE9B,KAET,MAAA6c,CAAOpa,EAASzC,GACd,IAAKsc,GAAWzC,IAAIpX,GAClB,OAEF,MAAM+Z,EAAcF,GAAWjc,IAAIoC,GACnC+Z,EAAYM,OAAO9c,GAGM,IAArBwc,EAAYC,MACdH,GAAWQ,OAAOra,EAEtB,GAYIsa,GAAiB,gBAOjBC,GAAgBC,IAChBA,GAAYna,OAAOoa,KAAOpa,OAAOoa,IAAIC,SAEvCF,EAAWA,EAAS5O,QAAQ,iBAAiB,CAAC+O,EAAOC,IAAO,IAAIH,IAAIC,OAAOE,QAEtEJ,GA4CHK,GAAuB7a,IAC3BA,EAAQ8a,cAAc,IAAIC,MAAMT,IAAgB,EAE5C,GAAYU,MACXA,GAA4B,iBAAXA,UAGO,IAAlBA,EAAOC,SAChBD,EAASA,EAAO,SAEgB,IAApBA,EAAOE,UAEjBC,GAAaH,GAEb,GAAUA,GACLA,EAAOC,OAASD,EAAO,GAAKA,EAEf,iBAAXA,GAAuBA,EAAO7J,OAAS,EACzCrL,SAAS+C,cAAc0R,GAAcS,IAEvC,KAEHI,GAAYpb,IAChB,IAAK,GAAUA,IAAgD,IAApCA,EAAQqb,iBAAiBlK,OAClD,OAAO,EAET,MAAMmK,EAAgF,YAA7D5V,iBAAiB1F,GAASub,iBAAiB,cAE9DC,EAAgBxb,EAAQyb,QAAQ,uBACtC,IAAKD,EACH,OAAOF,EAET,GAAIE,IAAkBxb,EAAS,CAC7B,MAAM0b,EAAU1b,EAAQyb,QAAQ,WAChC,GAAIC,GAAWA,EAAQlW,aAAegW,EACpC,OAAO,EAET,GAAgB,OAAZE,EACF,OAAO,CAEX,CACA,OAAOJ,CAAgB,EAEnBK,GAAa3b,IACZA,GAAWA,EAAQkb,WAAaU,KAAKC,gBAGtC7b,EAAQ8b,UAAU7W,SAAS,mBAGC,IAArBjF,EAAQ+b,SACV/b,EAAQ+b,SAEV/b,EAAQgc,aAAa,aAAoD,UAArChc,EAAQic,aAAa,aAE5DC,GAAiBlc,IACrB,IAAK8F,SAASC,gBAAgBoW,aAC5B,OAAO,KAIT,GAAmC,mBAAxBnc,EAAQqF,YAA4B,CAC7C,MAAM+W,EAAOpc,EAAQqF,cACrB,OAAO+W,aAAgBtb,WAAasb,EAAO,IAC7C,CACA,OAAIpc,aAAmBc,WACdd,EAIJA,EAAQwF,WAGN0W,GAAelc,EAAQwF,YAFrB,IAEgC,EAErC6W,GAAO,OAUPC,GAAStc,IACbA,EAAQuE,YAAY,EAGhBgY,GAAY,IACZlc,OAAOmc,SAAW1W,SAAS6G,KAAKqP,aAAa,qBACxC3b,OAAOmc,OAET,KAEHC,GAA4B,GAgB5BC,GAAQ,IAAuC,QAAjC5W,SAASC,gBAAgB4W,IACvCC,GAAqBC,IAhBAC,QAiBN,KACjB,MAAMC,EAAIR,KAEV,GAAIQ,EAAG,CACL,MAAMhc,EAAO8b,EAAOG,KACdC,EAAqBF,EAAE7b,GAAGH,GAChCgc,EAAE7b,GAAGH,GAAQ8b,EAAOK,gBACpBH,EAAE7b,GAAGH,GAAMoc,YAAcN,EACzBE,EAAE7b,GAAGH,GAAMqc,WAAa,KACtBL,EAAE7b,GAAGH,GAAQkc,EACNJ,EAAOK,gBAElB,GA5B0B,YAAxBpX,SAASuX,YAENZ,GAA0BtL,QAC7BrL,SAASyF,iBAAiB,oBAAoB,KAC5C,IAAK,MAAMuR,KAAYL,GACrBK,GACF,IAGJL,GAA0BpK,KAAKyK,IAE/BA,GAkBA,EAEEQ,GAAU,CAACC,EAAkB9F,EAAO,GAAI+F,EAAeD,IACxB,mBAArBA,EAAkCA,KAAoB9F,GAAQ+F,EAExEC,GAAyB,CAACX,EAAUY,EAAmBC,GAAoB,KAC/E,IAAKA,EAEH,YADAL,GAAQR,GAGV,MACMc,EAhKiC5d,KACvC,IAAKA,EACH,OAAO,EAIT,IAAI,mBACF6d,EAAkB,gBAClBC,GACEzd,OAAOqF,iBAAiB1F,GAC5B,MAAM+d,EAA0BC,OAAOC,WAAWJ,GAC5CK,EAAuBF,OAAOC,WAAWH,GAG/C,OAAKC,GAA4BG,GAKjCL,EAAqBA,EAAmBlb,MAAM,KAAK,GACnDmb,EAAkBA,EAAgBnb,MAAM,KAAK,GAtDf,KAuDtBqb,OAAOC,WAAWJ,GAAsBG,OAAOC,WAAWH,KANzD,CAMoG,EA2IpFK,CAAiCT,GADlC,EAExB,IAAIU,GAAS,EACb,MAAMC,EAAU,EACdrR,aAEIA,IAAW0Q,IAGfU,GAAS,EACTV,EAAkBjS,oBAAoB6O,GAAgB+D,GACtDf,GAAQR,GAAS,EAEnBY,EAAkBnS,iBAAiB+O,GAAgB+D,GACnDC,YAAW,KACJF,GACHvD,GAAqB6C,EACvB,GACCE,EAAiB,EAYhBW,GAAuB,CAAC1R,EAAM2R,EAAeC,EAAeC,KAChE,MAAMC,EAAa9R,EAAKsE,OACxB,IAAI+H,EAAQrM,EAAKjH,QAAQ4Y,GAIzB,OAAe,IAAXtF,GACMuF,GAAiBC,EAAiB7R,EAAK8R,EAAa,GAAK9R,EAAK,IAExEqM,GAASuF,EAAgB,GAAK,EAC1BC,IACFxF,GAASA,EAAQyF,GAAcA,GAE1B9R,EAAKjK,KAAKC,IAAI,EAAGD,KAAKE,IAAIoW,EAAOyF,EAAa,KAAI,EAerDC,GAAiB,qBACjBC,GAAiB,OACjBC,GAAgB,SAChBC,GAAgB,CAAC,EACvB,IAAIC,GAAW,EACf,MAAMC,GAAe,CACnBC,WAAY,YACZC,WAAY,YAERC,GAAe,IAAIrI,IAAI,CAAC,QAAS,WAAY,UAAW,YAAa,cAAe,aAAc,iBAAkB,YAAa,WAAY,YAAa,cAAe,YAAa,UAAW,WAAY,QAAS,oBAAqB,aAAc,YAAa,WAAY,cAAe,cAAe,cAAe,YAAa,eAAgB,gBAAiB,eAAgB,gBAAiB,aAAc,QAAS,OAAQ,SAAU,QAAS,SAAU,SAAU,UAAW,WAAY,OAAQ,SAAU,eAAgB,SAAU,OAAQ,mBAAoB,mBAAoB,QAAS,QAAS,WAM/lB,SAASsI,GAAarf,EAASsf,GAC7B,OAAOA,GAAO,GAAGA,MAAQN,QAAgBhf,EAAQgf,UAAYA,IAC/D,CACA,SAASO,GAAiBvf,GACxB,MAAMsf,EAAMD,GAAarf,GAGzB,OAFAA,EAAQgf,SAAWM,EACnBP,GAAcO,GAAOP,GAAcO,IAAQ,CAAC,EACrCP,GAAcO,EACvB,CAiCA,SAASE,GAAYC,EAAQC,EAAUC,EAAqB,MAC1D,OAAOliB,OAAOmiB,OAAOH,GAAQ7M,MAAKiN,GAASA,EAAMH,WAAaA,GAAYG,EAAMF,qBAAuBA,GACzG,CACA,SAASG,GAAoBC,EAAmB1B,EAAS2B,GACvD,MAAMC,EAAiC,iBAAZ5B,EAErBqB,EAAWO,EAAcD,EAAqB3B,GAAW2B,EAC/D,IAAIE,EAAYC,GAAaJ,GAI7B,OAHKX,GAAahI,IAAI8I,KACpBA,EAAYH,GAEP,CAACE,EAAaP,EAAUQ,EACjC,CACA,SAASE,GAAWpgB,EAAS+f,EAAmB1B,EAAS2B,EAAoBK,GAC3E,GAAiC,iBAAtBN,IAAmC/f,EAC5C,OAEF,IAAKigB,EAAaP,EAAUQ,GAAaJ,GAAoBC,EAAmB1B,EAAS2B,GAIzF,GAAID,KAAqBd,GAAc,CACrC,MAAMqB,EAAepf,GACZ,SAAU2e,GACf,IAAKA,EAAMU,eAAiBV,EAAMU,gBAAkBV,EAAMW,iBAAmBX,EAAMW,eAAevb,SAAS4a,EAAMU,eAC/G,OAAOrf,EAAGjD,KAAKwiB,KAAMZ,EAEzB,EAEFH,EAAWY,EAAaZ,EAC1B,CACA,MAAMD,EAASF,GAAiBvf,GAC1B0gB,EAAWjB,EAAOS,KAAeT,EAAOS,GAAa,CAAC,GACtDS,EAAmBnB,GAAYkB,EAAUhB,EAAUO,EAAc5B,EAAU,MACjF,GAAIsC,EAEF,YADAA,EAAiBN,OAASM,EAAiBN,QAAUA,GAGvD,MAAMf,EAAMD,GAAaK,EAAUK,EAAkBnU,QAAQgT,GAAgB,KACvE1d,EAAK+e,EA5Db,SAAoCjgB,EAASwa,EAAUtZ,GACrD,OAAO,SAASmd,EAAQwB,GACtB,MAAMe,EAAc5gB,EAAQ6gB,iBAAiBrG,GAC7C,IAAK,IAAI,OACPxN,GACE6S,EAAO7S,GAAUA,IAAWyT,KAAMzT,EAASA,EAAOxH,WACpD,IAAK,MAAMsb,KAAcF,EACvB,GAAIE,IAAe9T,EASnB,OANA+T,GAAWlB,EAAO,CAChBW,eAAgBxT,IAEdqR,EAAQgC,QACVW,GAAaC,IAAIjhB,EAAS6f,EAAMqB,KAAM1G,EAAUtZ,GAE3CA,EAAGigB,MAAMnU,EAAQ,CAAC6S,GAG/B,CACF,CAwC2BuB,CAA2BphB,EAASqe,EAASqB,GAvExE,SAA0B1f,EAASkB,GACjC,OAAO,SAASmd,EAAQwB,GAOtB,OANAkB,GAAWlB,EAAO,CAChBW,eAAgBxgB,IAEdqe,EAAQgC,QACVW,GAAaC,IAAIjhB,EAAS6f,EAAMqB,KAAMhgB,GAEjCA,EAAGigB,MAAMnhB,EAAS,CAAC6f,GAC5B,CACF,CA6DoFwB,CAAiBrhB,EAAS0f,GAC5Gxe,EAAGye,mBAAqBM,EAAc5B,EAAU,KAChDnd,EAAGwe,SAAWA,EACdxe,EAAGmf,OAASA,EACZnf,EAAG8d,SAAWM,EACdoB,EAASpB,GAAOpe,EAChBlB,EAAQuL,iBAAiB2U,EAAWhf,EAAI+e,EAC1C,CACA,SAASqB,GAActhB,EAASyf,EAAQS,EAAW7B,EAASsB,GAC1D,MAAMze,EAAKse,GAAYC,EAAOS,GAAY7B,EAASsB,GAC9Cze,IAGLlB,EAAQyL,oBAAoByU,EAAWhf,EAAIqgB,QAAQ5B,WAC5CF,EAAOS,GAAWhf,EAAG8d,UAC9B,CACA,SAASwC,GAAyBxhB,EAASyf,EAAQS,EAAWuB,GAC5D,MAAMC,EAAoBjC,EAAOS,IAAc,CAAC,EAChD,IAAK,MAAOyB,EAAY9B,KAAUpiB,OAAOmkB,QAAQF,GAC3CC,EAAWE,SAASJ,IACtBH,GAActhB,EAASyf,EAAQS,EAAWL,EAAMH,SAAUG,EAAMF,mBAGtE,CACA,SAASQ,GAAaN,GAGpB,OADAA,EAAQA,EAAMjU,QAAQiT,GAAgB,IAC/BI,GAAaY,IAAUA,CAChC,CACA,MAAMmB,GAAe,CACnB,EAAAc,CAAG9hB,EAAS6f,EAAOxB,EAAS2B,GAC1BI,GAAWpgB,EAAS6f,EAAOxB,EAAS2B,GAAoB,EAC1D,EACA,GAAA+B,CAAI/hB,EAAS6f,EAAOxB,EAAS2B,GAC3BI,GAAWpgB,EAAS6f,EAAOxB,EAAS2B,GAAoB,EAC1D,EACA,GAAAiB,CAAIjhB,EAAS+f,EAAmB1B,EAAS2B,GACvC,GAAiC,iBAAtBD,IAAmC/f,EAC5C,OAEF,MAAOigB,EAAaP,EAAUQ,GAAaJ,GAAoBC,EAAmB1B,EAAS2B,GACrFgC,EAAc9B,IAAcH,EAC5BN,EAASF,GAAiBvf,GAC1B0hB,EAAoBjC,EAAOS,IAAc,CAAC,EAC1C+B,EAAclC,EAAkBmC,WAAW,KACjD,QAAwB,IAAbxC,EAAX,CAQA,GAAIuC,EACF,IAAK,MAAME,KAAgB1kB,OAAO4D,KAAKoe,GACrC+B,GAAyBxhB,EAASyf,EAAQ0C,EAAcpC,EAAkBlN,MAAM,IAGpF,IAAK,MAAOuP,EAAavC,KAAUpiB,OAAOmkB,QAAQF,GAAoB,CACpE,MAAMC,EAAaS,EAAYxW,QAAQkT,GAAe,IACjDkD,IAAejC,EAAkB8B,SAASF,IAC7CL,GAActhB,EAASyf,EAAQS,EAAWL,EAAMH,SAAUG,EAAMF,mBAEpE,CAXA,KAPA,CAEE,IAAKliB,OAAO4D,KAAKqgB,GAAmBvQ,OAClC,OAEFmQ,GAActhB,EAASyf,EAAQS,EAAWR,EAAUO,EAAc5B,EAAU,KAE9E,CAYF,EACA,OAAAgE,CAAQriB,EAAS6f,EAAOpI,GACtB,GAAqB,iBAAVoI,IAAuB7f,EAChC,OAAO,KAET,MAAM+c,EAAIR,KAGV,IAAI+F,EAAc,KACdC,GAAU,EACVC,GAAiB,EACjBC,GAAmB,EAJH5C,IADFM,GAAaN,IAMZ9C,IACjBuF,EAAcvF,EAAEhC,MAAM8E,EAAOpI,GAC7BsF,EAAE/c,GAASqiB,QAAQC,GACnBC,GAAWD,EAAYI,uBACvBF,GAAkBF,EAAYK,gCAC9BF,EAAmBH,EAAYM,sBAEjC,MAAMC,EAAM9B,GAAW,IAAIhG,MAAM8E,EAAO,CACtC0C,UACAO,YAAY,IACVrL,GAUJ,OATIgL,GACFI,EAAIE,iBAEFP,GACFxiB,EAAQ8a,cAAc+H,GAEpBA,EAAIJ,kBAAoBH,GAC1BA,EAAYS,iBAEPF,CACT,GAEF,SAAS9B,GAAWljB,EAAKmlB,EAAO,CAAC,GAC/B,IAAK,MAAOzlB,EAAKa,KAAUX,OAAOmkB,QAAQoB,GACxC,IACEnlB,EAAIN,GAAOa,CACb,CAAE,MAAO6kB,GACPxlB,OAAOC,eAAeG,EAAKN,EAAK,CAC9B2lB,cAAc,EACdtlB,IAAG,IACMQ,GAGb,CAEF,OAAOP,CACT,CASA,SAASslB,GAAc/kB,GACrB,GAAc,SAAVA,EACF,OAAO,EAET,GAAc,UAAVA,EACF,OAAO,EAET,GAAIA,IAAU4f,OAAO5f,GAAOkC,WAC1B,OAAO0d,OAAO5f,GAEhB,GAAc,KAAVA,GAA0B,SAAVA,EAClB,OAAO,KAET,GAAqB,iBAAVA,EACT,OAAOA,EAET,IACE,OAAOglB,KAAKC,MAAMC,mBAAmBllB,GACvC,CAAE,MAAO6kB,GACP,OAAO7kB,CACT,CACF,CACA,SAASmlB,GAAiBhmB,GACxB,OAAOA,EAAIqO,QAAQ,UAAU4X,GAAO,IAAIA,EAAItjB,iBAC9C,CACA,MAAMujB,GAAc,CAClB,gBAAAC,CAAiB1jB,EAASzC,EAAKa,GAC7B4B,EAAQ6B,aAAa,WAAW0hB,GAAiBhmB,KAAQa,EAC3D,EACA,mBAAAulB,CAAoB3jB,EAASzC,GAC3ByC,EAAQ4B,gBAAgB,WAAW2hB,GAAiBhmB,KACtD,EACA,iBAAAqmB,CAAkB5jB,GAChB,IAAKA,EACH,MAAO,CAAC,EAEV,MAAM0B,EAAa,CAAC,EACdmiB,EAASpmB,OAAO4D,KAAKrB,EAAQ8jB,SAASld,QAAOrJ,GAAOA,EAAI2kB,WAAW,QAAU3kB,EAAI2kB,WAAW,cAClG,IAAK,MAAM3kB,KAAOsmB,EAAQ,CACxB,IAAIE,EAAUxmB,EAAIqO,QAAQ,MAAO,IACjCmY,EAAUA,EAAQC,OAAO,GAAG9jB,cAAgB6jB,EAAQlR,MAAM,EAAGkR,EAAQ5S,QACrEzP,EAAWqiB,GAAWZ,GAAcnjB,EAAQ8jB,QAAQvmB,GACtD,CACA,OAAOmE,CACT,EACAuiB,iBAAgB,CAACjkB,EAASzC,IACjB4lB,GAAcnjB,EAAQic,aAAa,WAAWsH,GAAiBhmB,QAgB1E,MAAM2mB,GAEJ,kBAAWC,GACT,MAAO,CAAC,CACV,CACA,sBAAWC,GACT,MAAO,CAAC,CACV,CACA,eAAWpH,GACT,MAAM,IAAIqH,MAAM,sEAClB,CACA,UAAAC,CAAWC,GAIT,OAHAA,EAAS9D,KAAK+D,gBAAgBD,GAC9BA,EAAS9D,KAAKgE,kBAAkBF,GAChC9D,KAAKiE,iBAAiBH,GACfA,CACT,CACA,iBAAAE,CAAkBF,GAChB,OAAOA,CACT,CACA,eAAAC,CAAgBD,EAAQvkB,GACtB,MAAM2kB,EAAa,GAAU3kB,GAAWyjB,GAAYQ,iBAAiBjkB,EAAS,UAAY,CAAC,EAE3F,MAAO,IACFygB,KAAKmE,YAAYT,WACM,iBAAfQ,EAA0BA,EAAa,CAAC,KAC/C,GAAU3kB,GAAWyjB,GAAYG,kBAAkB5jB,GAAW,CAAC,KAC7C,iBAAXukB,EAAsBA,EAAS,CAAC,EAE/C,CACA,gBAAAG,CAAiBH,EAAQM,EAAcpE,KAAKmE,YAAYR,aACtD,IAAK,MAAO7hB,EAAUuiB,KAAkBrnB,OAAOmkB,QAAQiD,GAAc,CACnE,MAAMzmB,EAAQmmB,EAAOhiB,GACfwiB,EAAY,GAAU3mB,GAAS,UAjiBrC4c,OADSA,EAkiB+C5c,GAhiBnD,GAAG4c,IAELvd,OAAOM,UAAUuC,SAASrC,KAAK+c,GAAQL,MAAM,eAAe,GAAGza,cA+hBlE,IAAK,IAAI8kB,OAAOF,GAAehhB,KAAKihB,GAClC,MAAM,IAAIE,UAAU,GAAGxE,KAAKmE,YAAY5H,KAAKkI,0BAA0B3iB,qBAA4BwiB,yBAAiCD,MAExI,CAtiBW9J,KAuiBb,EAqBF,MAAMmK,WAAsBjB,GAC1B,WAAAU,CAAY5kB,EAASukB,GACnBa,SACAplB,EAAUmb,GAAWnb,MAIrBygB,KAAK4E,SAAWrlB,EAChBygB,KAAK6E,QAAU7E,KAAK6D,WAAWC,GAC/BzK,GAAKtH,IAAIiO,KAAK4E,SAAU5E,KAAKmE,YAAYW,SAAU9E,MACrD,CAGA,OAAA+E,GACE1L,GAAKM,OAAOqG,KAAK4E,SAAU5E,KAAKmE,YAAYW,UAC5CvE,GAAaC,IAAIR,KAAK4E,SAAU5E,KAAKmE,YAAYa,WACjD,IAAK,MAAMC,KAAgBjoB,OAAOkoB,oBAAoBlF,MACpDA,KAAKiF,GAAgB,IAEzB,CACA,cAAAE,CAAe9I,EAAU9c,EAAS6lB,GAAa,GAC7CpI,GAAuBX,EAAU9c,EAAS6lB,EAC5C,CACA,UAAAvB,CAAWC,GAIT,OAHAA,EAAS9D,KAAK+D,gBAAgBD,EAAQ9D,KAAK4E,UAC3Cd,EAAS9D,KAAKgE,kBAAkBF,GAChC9D,KAAKiE,iBAAiBH,GACfA,CACT,CAGA,kBAAOuB,CAAY9lB,GACjB,OAAO8Z,GAAKlc,IAAIud,GAAWnb,GAAUygB,KAAK8E,SAC5C,CACA,0BAAOQ,CAAoB/lB,EAASukB,EAAS,CAAC,GAC5C,OAAO9D,KAAKqF,YAAY9lB,IAAY,IAAIygB,KAAKzgB,EAA2B,iBAAXukB,EAAsBA,EAAS,KAC9F,CACA,kBAAWyB,GACT,MA5CY,OA6Cd,CACA,mBAAWT,GACT,MAAO,MAAM9E,KAAKzD,MACpB,CACA,oBAAWyI,GACT,MAAO,IAAIhF,KAAK8E,UAClB,CACA,gBAAOU,CAAUllB,GACf,MAAO,GAAGA,IAAO0f,KAAKgF,WACxB,EAUF,MAAMS,GAAclmB,IAClB,IAAIwa,EAAWxa,EAAQic,aAAa,kBACpC,IAAKzB,GAAyB,MAAbA,EAAkB,CACjC,IAAI2L,EAAgBnmB,EAAQic,aAAa,QAMzC,IAAKkK,IAAkBA,EAActE,SAAS,OAASsE,EAAcjE,WAAW,KAC9E,OAAO,KAILiE,EAActE,SAAS,OAASsE,EAAcjE,WAAW,OAC3DiE,EAAgB,IAAIA,EAAcxjB,MAAM,KAAK,MAE/C6X,EAAW2L,GAAmC,MAAlBA,EAAwB5L,GAAc4L,EAAcC,QAAU,IAC5F,CACA,OAAO5L,CAAQ,EAEX6L,GAAiB,CACrBzT,KAAI,CAAC4H,EAAUxa,EAAU8F,SAASC,kBACzB,GAAG3G,UAAUsB,QAAQ3C,UAAU8iB,iBAAiB5iB,KAAK+B,EAASwa,IAEvE8L,QAAO,CAAC9L,EAAUxa,EAAU8F,SAASC,kBAC5BrF,QAAQ3C,UAAU8K,cAAc5K,KAAK+B,EAASwa,GAEvD+L,SAAQ,CAACvmB,EAASwa,IACT,GAAGpb,UAAUY,EAAQumB,UAAU3f,QAAOzB,GAASA,EAAMqhB,QAAQhM,KAEtE,OAAAiM,CAAQzmB,EAASwa,GACf,MAAMiM,EAAU,GAChB,IAAIC,EAAW1mB,EAAQwF,WAAWiW,QAAQjB,GAC1C,KAAOkM,GACLD,EAAQpU,KAAKqU,GACbA,EAAWA,EAASlhB,WAAWiW,QAAQjB,GAEzC,OAAOiM,CACT,EACA,IAAAE,CAAK3mB,EAASwa,GACZ,IAAIoM,EAAW5mB,EAAQ6mB,uBACvB,KAAOD,GAAU,CACf,GAAIA,EAASJ,QAAQhM,GACnB,MAAO,CAACoM,GAEVA,EAAWA,EAASC,sBACtB,CACA,MAAO,EACT,EAEA,IAAAvhB,CAAKtF,EAASwa,GACZ,IAAIlV,EAAOtF,EAAQ8mB,mBACnB,KAAOxhB,GAAM,CACX,GAAIA,EAAKkhB,QAAQhM,GACf,MAAO,CAAClV,GAEVA,EAAOA,EAAKwhB,kBACd,CACA,MAAO,EACT,EACA,iBAAAC,CAAkB/mB,GAChB,MAAMgnB,EAAa,CAAC,IAAK,SAAU,QAAS,WAAY,SAAU,UAAW,aAAc,4BAA4BzjB,KAAIiX,GAAY,GAAGA,2BAAiC7W,KAAK,KAChL,OAAO8c,KAAK7N,KAAKoU,EAAYhnB,GAAS4G,QAAOqgB,IAAOtL,GAAWsL,IAAO7L,GAAU6L,IAClF,EACA,sBAAAC,CAAuBlnB,GACrB,MAAMwa,EAAW0L,GAAYlmB,GAC7B,OAAIwa,GACK6L,GAAeC,QAAQ9L,GAAYA,EAErC,IACT,EACA,sBAAA2M,CAAuBnnB,GACrB,MAAMwa,EAAW0L,GAAYlmB,GAC7B,OAAOwa,EAAW6L,GAAeC,QAAQ9L,GAAY,IACvD,EACA,+BAAA4M,CAAgCpnB,GAC9B,MAAMwa,EAAW0L,GAAYlmB,GAC7B,OAAOwa,EAAW6L,GAAezT,KAAK4H,GAAY,EACpD,GAUI6M,GAAuB,CAACC,EAAWC,EAAS,UAChD,MAAMC,EAAa,gBAAgBF,EAAU7B,YACvC1kB,EAAOumB,EAAUtK,KACvBgE,GAAac,GAAGhc,SAAU0hB,EAAY,qBAAqBzmB,OAAU,SAAU8e,GAI7E,GAHI,CAAC,IAAK,QAAQgC,SAASpB,KAAKgH,UAC9B5H,EAAMkD,iBAEJpH,GAAW8E,MACb,OAEF,MAAMzT,EAASqZ,GAAec,uBAAuB1G,OAASA,KAAKhF,QAAQ,IAAI1a,KAC9DumB,EAAUvB,oBAAoB/Y,GAGtCua,IACX,GAAE,EAiBEG,GAAc,YACdC,GAAc,QAAQD,KACtBE,GAAe,SAASF,KAQ9B,MAAMG,WAAc1C,GAElB,eAAWnI,GACT,MAfW,OAgBb,CAGA,KAAA8K,GAEE,GADmB9G,GAAaqB,QAAQ5B,KAAK4E,SAAUsC,IACxClF,iBACb,OAEFhC,KAAK4E,SAASvJ,UAAU1B,OAlBF,QAmBtB,MAAMyL,EAAapF,KAAK4E,SAASvJ,UAAU7W,SApBrB,QAqBtBwb,KAAKmF,gBAAe,IAAMnF,KAAKsH,mBAAmBtH,KAAK4E,SAAUQ,EACnE,CAGA,eAAAkC,GACEtH,KAAK4E,SAASjL,SACd4G,GAAaqB,QAAQ5B,KAAK4E,SAAUuC,IACpCnH,KAAK+E,SACP,CAGA,sBAAOtI,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO+c,GAAM9B,oBAAoBtF,MACvC,GAAsB,iBAAX8D,EAAX,CAGA,QAAqB/K,IAAjB1O,EAAKyZ,IAAyBA,EAAOrC,WAAW,MAAmB,gBAAXqC,EAC1D,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,GAAQ9D,KAJb,CAKF,GACF,EAOF4G,GAAqBQ,GAAO,SAM5BjL,GAAmBiL,IAcnB,MAKMI,GAAyB,4BAO/B,MAAMC,WAAe/C,GAEnB,eAAWnI,GACT,MAfW,QAgBb,CAGA,MAAAmL,GAEE1H,KAAK4E,SAASxjB,aAAa,eAAgB4e,KAAK4E,SAASvJ,UAAUqM,OAjB3C,UAkB1B,CAGA,sBAAOjL,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAOod,GAAOnC,oBAAoBtF,MACzB,WAAX8D,GACFzZ,EAAKyZ,IAET,GACF,EAOFvD,GAAac,GAAGhc,SAjCe,2BAiCmBmiB,IAAwBpI,IACxEA,EAAMkD,iBACN,MAAMqF,EAASvI,EAAM7S,OAAOyO,QAAQwM,IACvBC,GAAOnC,oBAAoBqC,GACnCD,QAAQ,IAOfvL,GAAmBsL,IAcnB,MACMG,GAAc,YACdC,GAAmB,aAAaD,KAChCE,GAAkB,YAAYF,KAC9BG,GAAiB,WAAWH,KAC5BI,GAAoB,cAAcJ,KAClCK,GAAkB,YAAYL,KAK9BM,GAAY,CAChBC,YAAa,KACbC,aAAc,KACdC,cAAe,MAEXC,GAAgB,CACpBH,YAAa,kBACbC,aAAc,kBACdC,cAAe,mBAOjB,MAAME,WAAc9E,GAClB,WAAAU,CAAY5kB,EAASukB,GACnBa,QACA3E,KAAK4E,SAAWrlB,EACXA,GAAYgpB,GAAMC,gBAGvBxI,KAAK6E,QAAU7E,KAAK6D,WAAWC,GAC/B9D,KAAKyI,QAAU,EACfzI,KAAK0I,sBAAwB5H,QAAQlhB,OAAO+oB,cAC5C3I,KAAK4I,cACP,CAGA,kBAAWlF,GACT,OAAOwE,EACT,CACA,sBAAWvE,GACT,OAAO2E,EACT,CACA,eAAW/L,GACT,MA/CW,OAgDb,CAGA,OAAAwI,GACExE,GAAaC,IAAIR,KAAK4E,SAAUgD,GAClC,CAGA,MAAAiB,CAAOzJ,GACAY,KAAK0I,sBAIN1I,KAAK8I,wBAAwB1J,KAC/BY,KAAKyI,QAAUrJ,EAAM2J,SAJrB/I,KAAKyI,QAAUrJ,EAAM4J,QAAQ,GAAGD,OAMpC,CACA,IAAAE,CAAK7J,GACCY,KAAK8I,wBAAwB1J,KAC/BY,KAAKyI,QAAUrJ,EAAM2J,QAAU/I,KAAKyI,SAEtCzI,KAAKkJ,eACLrM,GAAQmD,KAAK6E,QAAQsD,YACvB,CACA,KAAAgB,CAAM/J,GACJY,KAAKyI,QAAUrJ,EAAM4J,SAAW5J,EAAM4J,QAAQtY,OAAS,EAAI,EAAI0O,EAAM4J,QAAQ,GAAGD,QAAU/I,KAAKyI,OACjG,CACA,YAAAS,GACE,MAAME,EAAYjnB,KAAKoC,IAAIyb,KAAKyI,SAChC,GAAIW,GAnEgB,GAoElB,OAEF,MAAM9b,EAAY8b,EAAYpJ,KAAKyI,QACnCzI,KAAKyI,QAAU,EACVnb,GAGLuP,GAAQvP,EAAY,EAAI0S,KAAK6E,QAAQwD,cAAgBrI,KAAK6E,QAAQuD,aACpE,CACA,WAAAQ,GACM5I,KAAK0I,uBACPnI,GAAac,GAAGrB,KAAK4E,SAAUoD,IAAmB5I,GAASY,KAAK6I,OAAOzJ,KACvEmB,GAAac,GAAGrB,KAAK4E,SAAUqD,IAAiB7I,GAASY,KAAKiJ,KAAK7J,KACnEY,KAAK4E,SAASvJ,UAAU5E,IAlFG,mBAoF3B8J,GAAac,GAAGrB,KAAK4E,SAAUiD,IAAkBzI,GAASY,KAAK6I,OAAOzJ,KACtEmB,GAAac,GAAGrB,KAAK4E,SAAUkD,IAAiB1I,GAASY,KAAKmJ,MAAM/J,KACpEmB,GAAac,GAAGrB,KAAK4E,SAAUmD,IAAgB3I,GAASY,KAAKiJ,KAAK7J,KAEtE,CACA,uBAAA0J,CAAwB1J,GACtB,OAAOY,KAAK0I,wBA3FS,QA2FiBtJ,EAAMiK,aA5FrB,UA4FyDjK,EAAMiK,YACxF,CAGA,kBAAOb,GACL,MAAO,iBAAkBnjB,SAASC,iBAAmB7C,UAAU6mB,eAAiB,CAClF,EAeF,MAEMC,GAAc,eACdC,GAAiB,YAKjBC,GAAa,OACbC,GAAa,OACbC,GAAiB,OACjBC,GAAkB,QAClBC,GAAc,QAAQN,KACtBO,GAAa,OAAOP,KACpBQ,GAAkB,UAAUR,KAC5BS,GAAqB,aAAaT,KAClCU,GAAqB,aAAaV,KAClCW,GAAmB,YAAYX,KAC/BY,GAAwB,OAAOZ,KAAcC,KAC7CY,GAAyB,QAAQb,KAAcC,KAC/Ca,GAAsB,WACtBC,GAAsB,SAMtBC,GAAkB,UAClBC,GAAgB,iBAChBC,GAAuBF,GAAkBC,GAKzCE,GAAmB,CACvB,UAAoBd,GACpB,WAAqBD,IAEjBgB,GAAY,CAChBC,SAAU,IACVC,UAAU,EACVC,MAAO,QACPC,MAAM,EACNC,OAAO,EACPC,MAAM,GAEFC,GAAgB,CACpBN,SAAU,mBAEVC,SAAU,UACVC,MAAO,mBACPC,KAAM,mBACNC,MAAO,UACPC,KAAM,WAOR,MAAME,WAAiBzG,GACrB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKoL,UAAY,KACjBpL,KAAKqL,eAAiB,KACtBrL,KAAKsL,YAAa,EAClBtL,KAAKuL,aAAe,KACpBvL,KAAKwL,aAAe,KACpBxL,KAAKyL,mBAAqB7F,GAAeC,QArCjB,uBAqC8C7F,KAAK4E,UAC3E5E,KAAK0L,qBACD1L,KAAK6E,QAAQkG,OAASV,IACxBrK,KAAK2L,OAET,CAGA,kBAAWjI,GACT,OAAOiH,EACT,CACA,sBAAWhH,GACT,OAAOuH,EACT,CACA,eAAW3O,GACT,MAnFW,UAoFb,CAGA,IAAA1X,GACEmb,KAAK4L,OAAOnC,GACd,CACA,eAAAoC,IAIOxmB,SAASymB,QAAUnR,GAAUqF,KAAK4E,WACrC5E,KAAKnb,MAET,CACA,IAAAqhB,GACElG,KAAK4L,OAAOlC,GACd,CACA,KAAAoB,GACM9K,KAAKsL,YACPlR,GAAqB4F,KAAK4E,UAE5B5E,KAAK+L,gBACP,CACA,KAAAJ,GACE3L,KAAK+L,iBACL/L,KAAKgM,kBACLhM,KAAKoL,UAAYa,aAAY,IAAMjM,KAAK6L,mBAAmB7L,KAAK6E,QAAQ+F,SAC1E,CACA,iBAAAsB,GACOlM,KAAK6E,QAAQkG,OAGd/K,KAAKsL,WACP/K,GAAae,IAAItB,KAAK4E,SAAUkF,IAAY,IAAM9J,KAAK2L,UAGzD3L,KAAK2L,QACP,CACA,EAAAQ,CAAG1T,GACD,MAAM2T,EAAQpM,KAAKqM,YACnB,GAAI5T,EAAQ2T,EAAM1b,OAAS,GAAK+H,EAAQ,EACtC,OAEF,GAAIuH,KAAKsL,WAEP,YADA/K,GAAae,IAAItB,KAAK4E,SAAUkF,IAAY,IAAM9J,KAAKmM,GAAG1T,KAG5D,MAAM6T,EAActM,KAAKuM,cAAcvM,KAAKwM,cAC5C,GAAIF,IAAgB7T,EAClB,OAEF,MAAMtC,EAAQsC,EAAQ6T,EAAc7C,GAAaC,GACjD1J,KAAK4L,OAAOzV,EAAOiW,EAAM3T,GAC3B,CACA,OAAAsM,GACM/E,KAAKwL,cACPxL,KAAKwL,aAAazG,UAEpBJ,MAAMI,SACR,CAGA,iBAAAf,CAAkBF,GAEhB,OADAA,EAAO2I,gBAAkB3I,EAAO8G,SACzB9G,CACT,CACA,kBAAA4H,GACM1L,KAAK6E,QAAQgG,UACftK,GAAac,GAAGrB,KAAK4E,SAAUmF,IAAiB3K,GAASY,KAAK0M,SAAStN,KAE9C,UAAvBY,KAAK6E,QAAQiG,QACfvK,GAAac,GAAGrB,KAAK4E,SAAUoF,IAAoB,IAAMhK,KAAK8K,UAC9DvK,GAAac,GAAGrB,KAAK4E,SAAUqF,IAAoB,IAAMjK,KAAKkM,uBAE5DlM,KAAK6E,QAAQmG,OAASzC,GAAMC,eAC9BxI,KAAK2M,yBAET,CACA,uBAAAA,GACE,IAAK,MAAMC,KAAOhH,GAAezT,KArIX,qBAqImC6N,KAAK4E,UAC5DrE,GAAac,GAAGuL,EAAK1C,IAAkB9K,GAASA,EAAMkD,mBAExD,MAmBMuK,EAAc,CAClBzE,aAAc,IAAMpI,KAAK4L,OAAO5L,KAAK8M,kBAAkBnD,KACvDtB,cAAe,IAAMrI,KAAK4L,OAAO5L,KAAK8M,kBAAkBlD,KACxDzB,YAtBkB,KACS,UAAvBnI,KAAK6E,QAAQiG,QAYjB9K,KAAK8K,QACD9K,KAAKuL,cACPwB,aAAa/M,KAAKuL,cAEpBvL,KAAKuL,aAAe1N,YAAW,IAAMmC,KAAKkM,qBAjLjB,IAiL+DlM,KAAK6E,QAAQ+F,UAAS,GAOhH5K,KAAKwL,aAAe,IAAIjD,GAAMvI,KAAK4E,SAAUiI,EAC/C,CACA,QAAAH,CAAStN,GACP,GAAI,kBAAkB/b,KAAK+b,EAAM7S,OAAOya,SACtC,OAEF,MAAM1Z,EAAYod,GAAiBtL,EAAMtiB,KACrCwQ,IACF8R,EAAMkD,iBACNtC,KAAK4L,OAAO5L,KAAK8M,kBAAkBxf,IAEvC,CACA,aAAAif,CAAchtB,GACZ,OAAOygB,KAAKqM,YAAYlnB,QAAQ5F,EAClC,CACA,0BAAAytB,CAA2BvU,GACzB,IAAKuH,KAAKyL,mBACR,OAEF,MAAMwB,EAAkBrH,GAAeC,QAAQ0E,GAAiBvK,KAAKyL,oBACrEwB,EAAgB5R,UAAU1B,OAAO2Q,IACjC2C,EAAgB9rB,gBAAgB,gBAChC,MAAM+rB,EAAqBtH,GAAeC,QAAQ,sBAAsBpN,MAAWuH,KAAKyL,oBACpFyB,IACFA,EAAmB7R,UAAU5E,IAAI6T,IACjC4C,EAAmB9rB,aAAa,eAAgB,QAEpD,CACA,eAAA4qB,GACE,MAAMzsB,EAAUygB,KAAKqL,gBAAkBrL,KAAKwM,aAC5C,IAAKjtB,EACH,OAEF,MAAM4tB,EAAkB5P,OAAO6P,SAAS7tB,EAAQic,aAAa,oBAAqB,IAClFwE,KAAK6E,QAAQ+F,SAAWuC,GAAmBnN,KAAK6E,QAAQ4H,eAC1D,CACA,MAAAb,CAAOzV,EAAO5W,EAAU,MACtB,GAAIygB,KAAKsL,WACP,OAEF,MAAMvN,EAAgBiC,KAAKwM,aACrBa,EAASlX,IAAUsT,GACnB6D,EAAc/tB,GAAWue,GAAqBkC,KAAKqM,YAAatO,EAAesP,EAAQrN,KAAK6E,QAAQoG,MAC1G,GAAIqC,IAAgBvP,EAClB,OAEF,MAAMwP,EAAmBvN,KAAKuM,cAAce,GACtCE,EAAehI,GACZjF,GAAaqB,QAAQ5B,KAAK4E,SAAUY,EAAW,CACpD1F,cAAewN,EACfhgB,UAAW0S,KAAKyN,kBAAkBtX,GAClCuD,KAAMsG,KAAKuM,cAAcxO,GACzBoO,GAAIoB,IAIR,GADmBC,EAAa3D,IACjB7H,iBACb,OAEF,IAAKjE,IAAkBuP,EAGrB,OAEF,MAAMI,EAAY5M,QAAQd,KAAKoL,WAC/BpL,KAAK8K,QACL9K,KAAKsL,YAAa,EAClBtL,KAAKgN,2BAA2BO,GAChCvN,KAAKqL,eAAiBiC,EACtB,MAAMK,EAAuBN,EA3OR,sBADF,oBA6ObO,EAAiBP,EA3OH,qBACA,qBA2OpBC,EAAYjS,UAAU5E,IAAImX,GAC1B/R,GAAOyR,GACPvP,EAAc1C,UAAU5E,IAAIkX,GAC5BL,EAAYjS,UAAU5E,IAAIkX,GAQ1B3N,KAAKmF,gBAPoB,KACvBmI,EAAYjS,UAAU1B,OAAOgU,EAAsBC,GACnDN,EAAYjS,UAAU5E,IAAI6T,IAC1BvM,EAAc1C,UAAU1B,OAAO2Q,GAAqBsD,EAAgBD,GACpE3N,KAAKsL,YAAa,EAClBkC,EAAa1D,GAAW,GAEY/L,EAAeiC,KAAK6N,eACtDH,GACF1N,KAAK2L,OAET,CACA,WAAAkC,GACE,OAAO7N,KAAK4E,SAASvJ,UAAU7W,SAhQV,QAiQvB,CACA,UAAAgoB,GACE,OAAO5G,GAAeC,QAAQ4E,GAAsBzK,KAAK4E,SAC3D,CACA,SAAAyH,GACE,OAAOzG,GAAezT,KAAKqY,GAAexK,KAAK4E,SACjD,CACA,cAAAmH,GACM/L,KAAKoL,YACP0C,cAAc9N,KAAKoL,WACnBpL,KAAKoL,UAAY,KAErB,CACA,iBAAA0B,CAAkBxf,GAChB,OAAI2O,KACK3O,IAAcqc,GAAiBD,GAAaD,GAE9Cnc,IAAcqc,GAAiBF,GAAaC,EACrD,CACA,iBAAA+D,CAAkBtX,GAChB,OAAI8F,KACK9F,IAAUuT,GAAaC,GAAiBC,GAE1CzT,IAAUuT,GAAaE,GAAkBD,EAClD,CAGA,sBAAOlN,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO8gB,GAAS7F,oBAAoBtF,KAAM8D,GAChD,GAAsB,iBAAXA,GAIX,GAAsB,iBAAXA,EAAqB,CAC9B,QAAqB/K,IAAjB1O,EAAKyZ,IAAyBA,EAAOrC,WAAW,MAAmB,gBAAXqC,EAC1D,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IACP,OAREzZ,EAAK8hB,GAAGrI,EASZ,GACF,EAOFvD,GAAac,GAAGhc,SAAU+kB,GAvSE,uCAuS2C,SAAUhL,GAC/E,MAAM7S,EAASqZ,GAAec,uBAAuB1G,MACrD,IAAKzT,IAAWA,EAAO8O,UAAU7W,SAAS6lB,IACxC,OAEFjL,EAAMkD,iBACN,MAAMyL,EAAW5C,GAAS7F,oBAAoB/Y,GACxCyhB,EAAahO,KAAKxE,aAAa,oBACrC,OAAIwS,GACFD,EAAS5B,GAAG6B,QACZD,EAAS7B,qBAGyC,SAAhDlJ,GAAYQ,iBAAiBxD,KAAM,UACrC+N,EAASlpB,YACTkpB,EAAS7B,sBAGX6B,EAAS7H,YACT6H,EAAS7B,oBACX,IACA3L,GAAac,GAAGzhB,OAAQuqB,IAAuB,KAC7C,MAAM8D,EAAYrI,GAAezT,KA5TR,6BA6TzB,IAAK,MAAM4b,KAAYE,EACrB9C,GAAS7F,oBAAoByI,EAC/B,IAOF5R,GAAmBgP,IAcnB,MAEM+C,GAAc,eAEdC,GAAe,OAAOD,KACtBE,GAAgB,QAAQF,KACxBG,GAAe,OAAOH,KACtBI,GAAiB,SAASJ,KAC1BK,GAAyB,QAAQL,cACjCM,GAAoB,OACpBC,GAAsB,WACtBC,GAAwB,aAExBC,GAA6B,WAAWF,OAAwBA,KAKhEG,GAAyB,8BACzBC,GAAY,CAChBpqB,OAAQ,KACRijB,QAAQ,GAEJoH,GAAgB,CACpBrqB,OAAQ,iBACRijB,OAAQ,WAOV,MAAMqH,WAAiBrK,GACrB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKgP,kBAAmB,EACxBhP,KAAKiP,cAAgB,GACrB,MAAMC,EAAatJ,GAAezT,KAAKyc,IACvC,IAAK,MAAMO,KAAQD,EAAY,CAC7B,MAAMnV,EAAW6L,GAAea,uBAAuB0I,GACjDC,EAAgBxJ,GAAezT,KAAK4H,GAAU5T,QAAOkpB,GAAgBA,IAAiBrP,KAAK4E,WAChF,OAAb7K,GAAqBqV,EAAc1e,QACrCsP,KAAKiP,cAAcrd,KAAKud,EAE5B,CACAnP,KAAKsP,sBACAtP,KAAK6E,QAAQpgB,QAChBub,KAAKuP,0BAA0BvP,KAAKiP,cAAejP,KAAKwP,YAEtDxP,KAAK6E,QAAQ6C,QACf1H,KAAK0H,QAET,CAGA,kBAAWhE,GACT,OAAOmL,EACT,CACA,sBAAWlL,GACT,OAAOmL,EACT,CACA,eAAWvS,GACT,MA9DW,UA+Db,CAGA,MAAAmL,GACM1H,KAAKwP,WACPxP,KAAKyP,OAELzP,KAAK0P,MAET,CACA,IAAAA,GACE,GAAI1P,KAAKgP,kBAAoBhP,KAAKwP,WAChC,OAEF,IAAIG,EAAiB,GAQrB,GALI3P,KAAK6E,QAAQpgB,SACfkrB,EAAiB3P,KAAK4P,uBAhEH,wCAgE4CzpB,QAAO5G,GAAWA,IAAYygB,KAAK4E,WAAU9hB,KAAIvD,GAAWwvB,GAASzJ,oBAAoB/lB,EAAS,CAC/JmoB,QAAQ,OAGRiI,EAAejf,QAAUif,EAAe,GAAGX,iBAC7C,OAGF,GADmBzO,GAAaqB,QAAQ5B,KAAK4E,SAAUuJ,IACxCnM,iBACb,OAEF,IAAK,MAAM6N,KAAkBF,EAC3BE,EAAeJ,OAEjB,MAAMK,EAAY9P,KAAK+P,gBACvB/P,KAAK4E,SAASvJ,UAAU1B,OAAO8U,IAC/BzO,KAAK4E,SAASvJ,UAAU5E,IAAIiY,IAC5B1O,KAAK4E,SAAS7jB,MAAM+uB,GAAa,EACjC9P,KAAKuP,0BAA0BvP,KAAKiP,eAAe,GACnDjP,KAAKgP,kBAAmB,EACxB,MAQMgB,EAAa,SADUF,EAAU,GAAGrL,cAAgBqL,EAAU1d,MAAM,KAE1E4N,KAAKmF,gBATY,KACfnF,KAAKgP,kBAAmB,EACxBhP,KAAK4E,SAASvJ,UAAU1B,OAAO+U,IAC/B1O,KAAK4E,SAASvJ,UAAU5E,IAAIgY,GAAqBD,IACjDxO,KAAK4E,SAAS7jB,MAAM+uB,GAAa,GACjCvP,GAAaqB,QAAQ5B,KAAK4E,SAAUwJ,GAAc,GAItBpO,KAAK4E,UAAU,GAC7C5E,KAAK4E,SAAS7jB,MAAM+uB,GAAa,GAAG9P,KAAK4E,SAASoL,MACpD,CACA,IAAAP,GACE,GAAIzP,KAAKgP,mBAAqBhP,KAAKwP,WACjC,OAGF,GADmBjP,GAAaqB,QAAQ5B,KAAK4E,SAAUyJ,IACxCrM,iBACb,OAEF,MAAM8N,EAAY9P,KAAK+P,gBACvB/P,KAAK4E,SAAS7jB,MAAM+uB,GAAa,GAAG9P,KAAK4E,SAASthB,wBAAwBwsB,OAC1EjU,GAAOmE,KAAK4E,UACZ5E,KAAK4E,SAASvJ,UAAU5E,IAAIiY,IAC5B1O,KAAK4E,SAASvJ,UAAU1B,OAAO8U,GAAqBD,IACpD,IAAK,MAAM5M,KAAW5B,KAAKiP,cAAe,CACxC,MAAM1vB,EAAUqmB,GAAec,uBAAuB9E,GAClDriB,IAAYygB,KAAKwP,SAASjwB,IAC5BygB,KAAKuP,0BAA0B,CAAC3N,IAAU,EAE9C,CACA5B,KAAKgP,kBAAmB,EAOxBhP,KAAK4E,SAAS7jB,MAAM+uB,GAAa,GACjC9P,KAAKmF,gBAPY,KACfnF,KAAKgP,kBAAmB,EACxBhP,KAAK4E,SAASvJ,UAAU1B,OAAO+U,IAC/B1O,KAAK4E,SAASvJ,UAAU5E,IAAIgY,IAC5BlO,GAAaqB,QAAQ5B,KAAK4E,SAAU0J,GAAe,GAGvBtO,KAAK4E,UAAU,EAC/C,CACA,QAAA4K,CAASjwB,EAAUygB,KAAK4E,UACtB,OAAOrlB,EAAQ8b,UAAU7W,SAASgqB,GACpC,CAGA,iBAAAxK,CAAkBF,GAGhB,OAFAA,EAAO4D,OAAS5G,QAAQgD,EAAO4D,QAC/B5D,EAAOrf,OAASiW,GAAWoJ,EAAOrf,QAC3Bqf,CACT,CACA,aAAAiM,GACE,OAAO/P,KAAK4E,SAASvJ,UAAU7W,SA3IL,uBAChB,QACC,QA0Ib,CACA,mBAAA8qB,GACE,IAAKtP,KAAK6E,QAAQpgB,OAChB,OAEF,MAAMqhB,EAAW9F,KAAK4P,uBAAuBhB,IAC7C,IAAK,MAAMrvB,KAAWumB,EAAU,CAC9B,MAAMmK,EAAWrK,GAAec,uBAAuBnnB,GACnD0wB,GACFjQ,KAAKuP,0BAA0B,CAAChwB,GAAUygB,KAAKwP,SAASS,GAE5D,CACF,CACA,sBAAAL,CAAuB7V,GACrB,MAAM+L,EAAWF,GAAezT,KAAKwc,GAA4B3O,KAAK6E,QAAQpgB,QAE9E,OAAOmhB,GAAezT,KAAK4H,EAAUiG,KAAK6E,QAAQpgB,QAAQ0B,QAAO5G,IAAYumB,EAAS1E,SAAS7hB,IACjG,CACA,yBAAAgwB,CAA0BW,EAAcC,GACtC,GAAKD,EAAaxf,OAGlB,IAAK,MAAMnR,KAAW2wB,EACpB3wB,EAAQ8b,UAAUqM,OArKK,aAqKyByI,GAChD5wB,EAAQ6B,aAAa,gBAAiB+uB,EAE1C,CAGA,sBAAO1T,CAAgBqH,GACrB,MAAMe,EAAU,CAAC,EAIjB,MAHsB,iBAAXf,GAAuB,YAAYzgB,KAAKygB,KACjDe,EAAQ6C,QAAS,GAEZ1H,KAAKuH,MAAK,WACf,MAAMld,EAAO0kB,GAASzJ,oBAAoBtF,KAAM6E,GAChD,GAAsB,iBAAXf,EAAqB,CAC9B,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IACP,CACF,GACF,EAOFvD,GAAac,GAAGhc,SAAUkpB,GAAwBK,IAAwB,SAAUxP,IAErD,MAAzBA,EAAM7S,OAAOya,SAAmB5H,EAAMW,gBAAmD,MAAjCX,EAAMW,eAAeiH,UAC/E5H,EAAMkD,iBAER,IAAK,MAAM/iB,KAAWqmB,GAAee,gCAAgC3G,MACnE+O,GAASzJ,oBAAoB/lB,EAAS,CACpCmoB,QAAQ,IACPA,QAEP,IAMAvL,GAAmB4S,IAcnB,MAAMqB,GAAS,WAETC,GAAc,eACdC,GAAiB,YAGjBC,GAAiB,UACjBC,GAAmB,YAGnBC,GAAe,OAAOJ,KACtBK,GAAiB,SAASL,KAC1BM,GAAe,OAAON,KACtBO,GAAgB,QAAQP,KACxBQ,GAAyB,QAAQR,KAAcC,KAC/CQ,GAAyB,UAAUT,KAAcC,KACjDS,GAAuB,QAAQV,KAAcC,KAC7CU,GAAoB,OAMpBC,GAAyB,4DACzBC,GAA6B,GAAGD,MAA0BD,KAC1DG,GAAgB,iBAIhBC,GAAgBnV,KAAU,UAAY,YACtCoV,GAAmBpV,KAAU,YAAc,UAC3CqV,GAAmBrV,KAAU,aAAe,eAC5CsV,GAAsBtV,KAAU,eAAiB,aACjDuV,GAAkBvV,KAAU,aAAe,cAC3CwV,GAAiBxV,KAAU,cAAgB,aAG3CyV,GAAY,CAChBC,WAAW,EACX1jB,SAAU,kBACV2jB,QAAS,UACT5pB,OAAQ,CAAC,EAAG,GACZ6pB,aAAc,KACdvzB,UAAW,UAEPwzB,GAAgB,CACpBH,UAAW,mBACX1jB,SAAU,mBACV2jB,QAAS,SACT5pB,OAAQ,0BACR6pB,aAAc,yBACdvzB,UAAW,2BAOb,MAAMyzB,WAAiBrN,GACrB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKgS,QAAU,KACfhS,KAAKiS,QAAUjS,KAAK4E,SAAS7f,WAE7Bib,KAAKkS,MAAQtM,GAAe/gB,KAAKmb,KAAK4E,SAAUuM,IAAe,IAAMvL,GAAeM,KAAKlG,KAAK4E,SAAUuM,IAAe,IAAMvL,GAAeC,QAAQsL,GAAenR,KAAKiS,SACxKjS,KAAKmS,UAAYnS,KAAKoS,eACxB,CAGA,kBAAW1O,GACT,OAAOgO,EACT,CACA,sBAAW/N,GACT,OAAOmO,EACT,CACA,eAAWvV,GACT,OAAO6T,EACT,CAGA,MAAA1I,GACE,OAAO1H,KAAKwP,WAAaxP,KAAKyP,OAASzP,KAAK0P,MAC9C,CACA,IAAAA,GACE,GAAIxU,GAAW8E,KAAK4E,WAAa5E,KAAKwP,WACpC,OAEF,MAAM1P,EAAgB,CACpBA,cAAeE,KAAK4E,UAGtB,IADkBrE,GAAaqB,QAAQ5B,KAAK4E,SAAU+L,GAAc7Q,GACtDkC,iBAAd,CASA,GANAhC,KAAKqS,gBAMD,iBAAkBhtB,SAASC,kBAAoB0a,KAAKiS,QAAQjX,QAzExC,eA0EtB,IAAK,MAAMzb,IAAW,GAAGZ,UAAU0G,SAAS6G,KAAK4Z,UAC/CvF,GAAac,GAAG9hB,EAAS,YAAaqc,IAG1CoE,KAAK4E,SAAS0N,QACdtS,KAAK4E,SAASxjB,aAAa,iBAAiB,GAC5C4e,KAAKkS,MAAM7W,UAAU5E,IAAIua,IACzBhR,KAAK4E,SAASvJ,UAAU5E,IAAIua,IAC5BzQ,GAAaqB,QAAQ5B,KAAK4E,SAAUgM,GAAe9Q,EAhBnD,CAiBF,CACA,IAAA2P,GACE,GAAIvU,GAAW8E,KAAK4E,YAAc5E,KAAKwP,WACrC,OAEF,MAAM1P,EAAgB,CACpBA,cAAeE,KAAK4E,UAEtB5E,KAAKuS,cAAczS,EACrB,CACA,OAAAiF,GACM/E,KAAKgS,SACPhS,KAAKgS,QAAQhZ,UAEf2L,MAAMI,SACR,CACA,MAAAha,GACEiV,KAAKmS,UAAYnS,KAAKoS,gBAClBpS,KAAKgS,SACPhS,KAAKgS,QAAQjnB,QAEjB,CAGA,aAAAwnB,CAAczS,GAEZ,IADkBS,GAAaqB,QAAQ5B,KAAK4E,SAAU6L,GAAc3Q,GACtDkC,iBAAd,CAMA,GAAI,iBAAkB3c,SAASC,gBAC7B,IAAK,MAAM/F,IAAW,GAAGZ,UAAU0G,SAAS6G,KAAK4Z,UAC/CvF,GAAaC,IAAIjhB,EAAS,YAAaqc,IAGvCoE,KAAKgS,SACPhS,KAAKgS,QAAQhZ,UAEfgH,KAAKkS,MAAM7W,UAAU1B,OAAOqX,IAC5BhR,KAAK4E,SAASvJ,UAAU1B,OAAOqX,IAC/BhR,KAAK4E,SAASxjB,aAAa,gBAAiB,SAC5C4hB,GAAYE,oBAAoBlD,KAAKkS,MAAO,UAC5C3R,GAAaqB,QAAQ5B,KAAK4E,SAAU8L,GAAgB5Q,EAhBpD,CAiBF,CACA,UAAA+D,CAAWC,GAET,GAAgC,iBADhCA,EAASa,MAAMd,WAAWC,IACRxlB,YAA2B,GAAUwlB,EAAOxlB,YAAgE,mBAA3CwlB,EAAOxlB,UAAUgF,sBAElG,MAAM,IAAIkhB,UAAU,GAAG4L,GAAO3L,+GAEhC,OAAOX,CACT,CACA,aAAAuO,GACE,QAAsB,IAAX,EACT,MAAM,IAAI7N,UAAU,gEAEtB,IAAIgO,EAAmBxS,KAAK4E,SACG,WAA3B5E,KAAK6E,QAAQvmB,UACfk0B,EAAmBxS,KAAKiS,QACf,GAAUjS,KAAK6E,QAAQvmB,WAChCk0B,EAAmB9X,GAAWsF,KAAK6E,QAAQvmB,WACA,iBAA3B0hB,KAAK6E,QAAQvmB,YAC7Bk0B,EAAmBxS,KAAK6E,QAAQvmB,WAElC,MAAMuzB,EAAe7R,KAAKyS,mBAC1BzS,KAAKgS,QAAU,GAAoBQ,EAAkBxS,KAAKkS,MAAOL,EACnE,CACA,QAAArC,GACE,OAAOxP,KAAKkS,MAAM7W,UAAU7W,SAASwsB,GACvC,CACA,aAAA0B,GACE,MAAMC,EAAiB3S,KAAKiS,QAC5B,GAAIU,EAAetX,UAAU7W,SArKN,WAsKrB,OAAOgtB,GAET,GAAImB,EAAetX,UAAU7W,SAvKJ,aAwKvB,OAAOitB,GAET,GAAIkB,EAAetX,UAAU7W,SAzKA,iBA0K3B,MA5JsB,MA8JxB,GAAImuB,EAAetX,UAAU7W,SA3KE,mBA4K7B,MA9JyB,SAkK3B,MAAMouB,EAAkF,QAA1E3tB,iBAAiB+a,KAAKkS,OAAOpX,iBAAiB,iBAAiB6K,OAC7E,OAAIgN,EAAetX,UAAU7W,SArLP,UAsLbouB,EAAQvB,GAAmBD,GAE7BwB,EAAQrB,GAAsBD,EACvC,CACA,aAAAc,GACE,OAAkD,OAA3CpS,KAAK4E,SAAS5J,QAnLD,UAoLtB,CACA,UAAA6X,GACE,MAAM,OACJ7qB,GACEgY,KAAK6E,QACT,MAAsB,iBAAX7c,EACFA,EAAO9F,MAAM,KAAKY,KAAInF,GAAS4f,OAAO6P,SAASzvB,EAAO,MAEzC,mBAAXqK,EACF8qB,GAAc9qB,EAAO8qB,EAAY9S,KAAK4E,UAExC5c,CACT,CACA,gBAAAyqB,GACE,MAAMM,EAAwB,CAC5Br0B,UAAWshB,KAAK0S,gBAChBtc,UAAW,CAAC,CACV9V,KAAM,kBACNmB,QAAS,CACPwM,SAAU+R,KAAK6E,QAAQ5W,WAExB,CACD3N,KAAM,SACNmB,QAAS,CACPuG,OAAQgY,KAAK6S,iBAanB,OAPI7S,KAAKmS,WAAsC,WAAzBnS,KAAK6E,QAAQ+M,WACjC5O,GAAYC,iBAAiBjD,KAAKkS,MAAO,SAAU,UACnDa,EAAsB3c,UAAY,CAAC,CACjC9V,KAAM,cACNC,SAAS,KAGN,IACFwyB,KACAlW,GAAQmD,KAAK6E,QAAQgN,aAAc,CAACkB,IAE3C,CACA,eAAAC,EAAgB,IACdl2B,EAAG,OACHyP,IAEA,MAAM6f,EAAQxG,GAAezT,KAhOF,8DAgO+B6N,KAAKkS,OAAO/rB,QAAO5G,GAAWob,GAAUpb,KAC7F6sB,EAAM1b,QAMXoN,GAAqBsO,EAAO7f,EAAQzP,IAAQ0zB,IAAmBpE,EAAMhL,SAAS7U,IAAS+lB,OACzF,CAGA,sBAAO7V,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO0nB,GAASzM,oBAAoBtF,KAAM8D,GAChD,GAAsB,iBAAXA,EAAX,CAGA,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IAJL,CAKF,GACF,CACA,iBAAOmP,CAAW7T,GAChB,GA5QuB,IA4QnBA,EAAMuI,QAAgD,UAAfvI,EAAMqB,MA/QnC,QA+QuDrB,EAAMtiB,IACzE,OAEF,MAAMo2B,EAActN,GAAezT,KAAK+e,IACxC,IAAK,MAAMxJ,KAAUwL,EAAa,CAChC,MAAMC,EAAUpB,GAAS1M,YAAYqC,GACrC,IAAKyL,IAAyC,IAA9BA,EAAQtO,QAAQ8M,UAC9B,SAEF,MAAMyB,EAAehU,EAAMgU,eACrBC,EAAeD,EAAahS,SAAS+R,EAAQjB,OACnD,GAAIkB,EAAahS,SAAS+R,EAAQvO,WAA2C,WAA9BuO,EAAQtO,QAAQ8M,YAA2B0B,GAA8C,YAA9BF,EAAQtO,QAAQ8M,WAA2B0B,EACnJ,SAIF,GAAIF,EAAQjB,MAAM1tB,SAAS4a,EAAM7S,UAA2B,UAAf6S,EAAMqB,MA/RvC,QA+R2DrB,EAAMtiB,KAAqB,qCAAqCuG,KAAK+b,EAAM7S,OAAOya,UACvJ,SAEF,MAAMlH,EAAgB,CACpBA,cAAeqT,EAAQvO,UAEN,UAAfxF,EAAMqB,OACRX,EAAciH,WAAa3H,GAE7B+T,EAAQZ,cAAczS,EACxB,CACF,CACA,4BAAOwT,CAAsBlU,GAI3B,MAAMmU,EAAU,kBAAkBlwB,KAAK+b,EAAM7S,OAAOya,SAC9CwM,EAjTW,WAiTKpU,EAAMtiB,IACtB22B,EAAkB,CAAClD,GAAgBC,IAAkBpP,SAAShC,EAAMtiB,KAC1E,IAAK22B,IAAoBD,EACvB,OAEF,GAAID,IAAYC,EACd,OAEFpU,EAAMkD,iBAGN,MAAMoR,EAAkB1T,KAAK+F,QAAQkL,IAA0BjR,KAAO4F,GAAeM,KAAKlG,KAAMiR,IAAwB,IAAMrL,GAAe/gB,KAAKmb,KAAMiR,IAAwB,IAAMrL,GAAeC,QAAQoL,GAAwB7R,EAAMW,eAAehb,YACpPwF,EAAWwnB,GAASzM,oBAAoBoO,GAC9C,GAAID,EAIF,OAHArU,EAAMuU,kBACNppB,EAASmlB,YACTnlB,EAASyoB,gBAAgB5T,GAGvB7U,EAASilB,aAEXpQ,EAAMuU,kBACNppB,EAASklB,OACTiE,EAAgBpB,QAEpB,EAOF/R,GAAac,GAAGhc,SAAUyrB,GAAwBG,GAAwBc,GAASuB,uBACnF/S,GAAac,GAAGhc,SAAUyrB,GAAwBK,GAAeY,GAASuB,uBAC1E/S,GAAac,GAAGhc,SAAUwrB,GAAwBkB,GAASkB,YAC3D1S,GAAac,GAAGhc,SAAU0rB,GAAsBgB,GAASkB,YACzD1S,GAAac,GAAGhc,SAAUwrB,GAAwBI,IAAwB,SAAU7R,GAClFA,EAAMkD,iBACNyP,GAASzM,oBAAoBtF,MAAM0H,QACrC,IAMAvL,GAAmB4V,IAcnB,MAAM6B,GAAS,WAETC,GAAoB,OACpBC,GAAkB,gBAAgBF,KAClCG,GAAY,CAChBC,UAAW,iBACXC,cAAe,KACf7O,YAAY,EACZzK,WAAW,EAEXuZ,YAAa,QAGTC,GAAgB,CACpBH,UAAW,SACXC,cAAe,kBACf7O,WAAY,UACZzK,UAAW,UACXuZ,YAAa,oBAOf,MAAME,WAAiB3Q,GACrB,WAAAU,CAAYL,GACVa,QACA3E,KAAK6E,QAAU7E,KAAK6D,WAAWC,GAC/B9D,KAAKqU,aAAc,EACnBrU,KAAK4E,SAAW,IAClB,CAGA,kBAAWlB,GACT,OAAOqQ,EACT,CACA,sBAAWpQ,GACT,OAAOwQ,EACT,CACA,eAAW5X,GACT,OAAOqX,EACT,CAGA,IAAAlE,CAAKrT,GACH,IAAK2D,KAAK6E,QAAQlK,UAEhB,YADAkC,GAAQR,GAGV2D,KAAKsU,UACL,MAAM/0B,EAAUygB,KAAKuU,cACjBvU,KAAK6E,QAAQO,YACfvJ,GAAOtc,GAETA,EAAQ8b,UAAU5E,IAAIod,IACtB7T,KAAKwU,mBAAkB,KACrB3X,GAAQR,EAAS,GAErB,CACA,IAAAoT,CAAKpT,GACE2D,KAAK6E,QAAQlK,WAIlBqF,KAAKuU,cAAclZ,UAAU1B,OAAOka,IACpC7T,KAAKwU,mBAAkB,KACrBxU,KAAK+E,UACLlI,GAAQR,EAAS,KANjBQ,GAAQR,EAQZ,CACA,OAAA0I,GACO/E,KAAKqU,cAGV9T,GAAaC,IAAIR,KAAK4E,SAAUkP,IAChC9T,KAAK4E,SAASjL,SACdqG,KAAKqU,aAAc,EACrB,CAGA,WAAAE,GACE,IAAKvU,KAAK4E,SAAU,CAClB,MAAM6P,EAAWpvB,SAASqvB,cAAc,OACxCD,EAAST,UAAYhU,KAAK6E,QAAQmP,UAC9BhU,KAAK6E,QAAQO,YACfqP,EAASpZ,UAAU5E,IArFD,QAuFpBuJ,KAAK4E,SAAW6P,CAClB,CACA,OAAOzU,KAAK4E,QACd,CACA,iBAAAZ,CAAkBF,GAGhB,OADAA,EAAOoQ,YAAcxZ,GAAWoJ,EAAOoQ,aAChCpQ,CACT,CACA,OAAAwQ,GACE,GAAItU,KAAKqU,YACP,OAEF,MAAM90B,EAAUygB,KAAKuU,cACrBvU,KAAK6E,QAAQqP,YAAYS,OAAOp1B,GAChCghB,GAAac,GAAG9hB,EAASu0B,IAAiB,KACxCjX,GAAQmD,KAAK6E,QAAQoP,cAAc,IAErCjU,KAAKqU,aAAc,CACrB,CACA,iBAAAG,CAAkBnY,GAChBW,GAAuBX,EAAU2D,KAAKuU,cAAevU,KAAK6E,QAAQO,WACpE,EAeF,MAEMwP,GAAc,gBACdC,GAAkB,UAAUD,KAC5BE,GAAoB,cAAcF,KAGlCG,GAAmB,WACnBC,GAAY,CAChBC,WAAW,EACXC,YAAa,MAGTC,GAAgB,CACpBF,UAAW,UACXC,YAAa,WAOf,MAAME,WAAkB3R,GACtB,WAAAU,CAAYL,GACVa,QACA3E,KAAK6E,QAAU7E,KAAK6D,WAAWC,GAC/B9D,KAAKqV,WAAY,EACjBrV,KAAKsV,qBAAuB,IAC9B,CAGA,kBAAW5R,GACT,OAAOsR,EACT,CACA,sBAAWrR,GACT,OAAOwR,EACT,CACA,eAAW5Y,GACT,MAtCW,WAuCb,CAGA,QAAAgZ,GACMvV,KAAKqV,YAGLrV,KAAK6E,QAAQoQ,WACfjV,KAAK6E,QAAQqQ,YAAY5C,QAE3B/R,GAAaC,IAAInb,SAAUuvB,IAC3BrU,GAAac,GAAGhc,SAAUwvB,IAAiBzV,GAASY,KAAKwV,eAAepW,KACxEmB,GAAac,GAAGhc,SAAUyvB,IAAmB1V,GAASY,KAAKyV,eAAerW,KAC1EY,KAAKqV,WAAY,EACnB,CACA,UAAAK,GACO1V,KAAKqV,YAGVrV,KAAKqV,WAAY,EACjB9U,GAAaC,IAAInb,SAAUuvB,IAC7B,CAGA,cAAAY,CAAepW,GACb,MAAM,YACJ8V,GACElV,KAAK6E,QACT,GAAIzF,EAAM7S,SAAWlH,UAAY+Z,EAAM7S,SAAW2oB,GAAeA,EAAY1wB,SAAS4a,EAAM7S,QAC1F,OAEF,MAAM1L,EAAW+kB,GAAeU,kBAAkB4O,GAC1B,IAApBr0B,EAAS6P,OACXwkB,EAAY5C,QACHtS,KAAKsV,uBAAyBP,GACvCl0B,EAASA,EAAS6P,OAAS,GAAG4hB,QAE9BzxB,EAAS,GAAGyxB,OAEhB,CACA,cAAAmD,CAAerW,GA1ED,QA2ERA,EAAMtiB,MAGVkjB,KAAKsV,qBAAuBlW,EAAMuW,SAAWZ,GA7EzB,UA8EtB,EAeF,MAAMa,GAAyB,oDACzBC,GAA0B,cAC1BC,GAAmB,gBACnBC,GAAkB,eAMxB,MAAMC,GACJ,WAAA7R,GACEnE,KAAK4E,SAAWvf,SAAS6G,IAC3B,CAGA,QAAA+pB,GAEE,MAAMC,EAAgB7wB,SAASC,gBAAgBuC,YAC/C,OAAO1F,KAAKoC,IAAI3E,OAAOu2B,WAAaD,EACtC,CACA,IAAAzG,GACE,MAAM5rB,EAAQmc,KAAKiW,WACnBjW,KAAKoW,mBAELpW,KAAKqW,sBAAsBrW,KAAK4E,SAAUkR,IAAkBQ,GAAmBA,EAAkBzyB,IAEjGmc,KAAKqW,sBAAsBT,GAAwBE,IAAkBQ,GAAmBA,EAAkBzyB,IAC1Gmc,KAAKqW,sBAAsBR,GAAyBE,IAAiBO,GAAmBA,EAAkBzyB,GAC5G,CACA,KAAAwO,GACE2N,KAAKuW,wBAAwBvW,KAAK4E,SAAU,YAC5C5E,KAAKuW,wBAAwBvW,KAAK4E,SAAUkR,IAC5C9V,KAAKuW,wBAAwBX,GAAwBE,IACrD9V,KAAKuW,wBAAwBV,GAAyBE,GACxD,CACA,aAAAS,GACE,OAAOxW,KAAKiW,WAAa,CAC3B,CAGA,gBAAAG,GACEpW,KAAKyW,sBAAsBzW,KAAK4E,SAAU,YAC1C5E,KAAK4E,SAAS7jB,MAAM+K,SAAW,QACjC,CACA,qBAAAuqB,CAAsBtc,EAAU2c,EAAera,GAC7C,MAAMsa,EAAiB3W,KAAKiW,WAS5BjW,KAAK4W,2BAA2B7c,GARHxa,IAC3B,GAAIA,IAAYygB,KAAK4E,UAAYhlB,OAAOu2B,WAAa52B,EAAQsI,YAAc8uB,EACzE,OAEF3W,KAAKyW,sBAAsBl3B,EAASm3B,GACpC,MAAMJ,EAAkB12B,OAAOqF,iBAAiB1F,GAASub,iBAAiB4b,GAC1En3B,EAAQwB,MAAM81B,YAAYH,EAAe,GAAGra,EAASkB,OAAOC,WAAW8Y,QAAsB,GAGjG,CACA,qBAAAG,CAAsBl3B,EAASm3B,GAC7B,MAAMI,EAAcv3B,EAAQwB,MAAM+Z,iBAAiB4b,GAC/CI,GACF9T,GAAYC,iBAAiB1jB,EAASm3B,EAAeI,EAEzD,CACA,uBAAAP,CAAwBxc,EAAU2c,GAWhC1W,KAAK4W,2BAA2B7c,GAVHxa,IAC3B,MAAM5B,EAAQqlB,GAAYQ,iBAAiBjkB,EAASm3B,GAEtC,OAAV/4B,GAIJqlB,GAAYE,oBAAoB3jB,EAASm3B,GACzCn3B,EAAQwB,MAAM81B,YAAYH,EAAe/4B,IAJvC4B,EAAQwB,MAAMg2B,eAAeL,EAIgB,GAGnD,CACA,0BAAAE,CAA2B7c,EAAUid,GACnC,GAAI,GAAUjd,GACZid,EAASjd,QAGX,IAAK,MAAMkd,KAAOrR,GAAezT,KAAK4H,EAAUiG,KAAK4E,UACnDoS,EAASC,EAEb,EAeF,MAEMC,GAAc,YAGdC,GAAe,OAAOD,KACtBE,GAAyB,gBAAgBF,KACzCG,GAAiB,SAASH,KAC1BI,GAAe,OAAOJ,KACtBK,GAAgB,QAAQL,KACxBM,GAAiB,SAASN,KAC1BO,GAAsB,gBAAgBP,KACtCQ,GAA0B,oBAAoBR,KAC9CS,GAA0B,kBAAkBT,KAC5CU,GAAyB,QAAQV,cACjCW,GAAkB,aAElBC,GAAoB,OACpBC,GAAoB,eAKpBC,GAAY,CAChBvD,UAAU,EACVnC,OAAO,EACPzH,UAAU,GAENoN,GAAgB,CACpBxD,SAAU,mBACVnC,MAAO,UACPzH,SAAU,WAOZ,MAAMqN,WAAcxT,GAClB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKmY,QAAUvS,GAAeC,QArBV,gBAqBmC7F,KAAK4E,UAC5D5E,KAAKoY,UAAYpY,KAAKqY,sBACtBrY,KAAKsY,WAAatY,KAAKuY,uBACvBvY,KAAKwP,UAAW,EAChBxP,KAAKgP,kBAAmB,EACxBhP,KAAKwY,WAAa,IAAIxC,GACtBhW,KAAK0L,oBACP,CAGA,kBAAWhI,GACT,OAAOsU,EACT,CACA,sBAAWrU,GACT,OAAOsU,EACT,CACA,eAAW1b,GACT,MA1DW,OA2Db,CAGA,MAAAmL,CAAO5H,GACL,OAAOE,KAAKwP,SAAWxP,KAAKyP,OAASzP,KAAK0P,KAAK5P,EACjD,CACA,IAAA4P,CAAK5P,GACCE,KAAKwP,UAAYxP,KAAKgP,kBAGRzO,GAAaqB,QAAQ5B,KAAK4E,SAAU0S,GAAc,CAClExX,kBAEYkC,mBAGdhC,KAAKwP,UAAW,EAChBxP,KAAKgP,kBAAmB,EACxBhP,KAAKwY,WAAW/I,OAChBpqB,SAAS6G,KAAKmP,UAAU5E,IAAIohB,IAC5B7X,KAAKyY,gBACLzY,KAAKoY,UAAU1I,MAAK,IAAM1P,KAAK0Y,aAAa5Y,KAC9C,CACA,IAAA2P,GACOzP,KAAKwP,WAAYxP,KAAKgP,mBAGTzO,GAAaqB,QAAQ5B,KAAK4E,SAAUuS,IACxCnV,mBAGdhC,KAAKwP,UAAW,EAChBxP,KAAKgP,kBAAmB,EACxBhP,KAAKsY,WAAW5C,aAChB1V,KAAK4E,SAASvJ,UAAU1B,OAAOme,IAC/B9X,KAAKmF,gBAAe,IAAMnF,KAAK2Y,cAAc3Y,KAAK4E,SAAU5E,KAAK6N,gBACnE,CACA,OAAA9I,GACExE,GAAaC,IAAI5gB,OAAQs3B,IACzB3W,GAAaC,IAAIR,KAAKmY,QAASjB,IAC/BlX,KAAKoY,UAAUrT,UACf/E,KAAKsY,WAAW5C,aAChB/Q,MAAMI,SACR,CACA,YAAA6T,GACE5Y,KAAKyY,eACP,CAGA,mBAAAJ,GACE,OAAO,IAAIjE,GAAS,CAClBzZ,UAAWmG,QAAQd,KAAK6E,QAAQ4P,UAEhCrP,WAAYpF,KAAK6N,eAErB,CACA,oBAAA0K,GACE,OAAO,IAAInD,GAAU,CACnBF,YAAalV,KAAK4E,UAEtB,CACA,YAAA8T,CAAa5Y,GAENza,SAAS6G,KAAK1H,SAASwb,KAAK4E,WAC/Bvf,SAAS6G,KAAKyoB,OAAO3U,KAAK4E,UAE5B5E,KAAK4E,SAAS7jB,MAAM6wB,QAAU,QAC9B5R,KAAK4E,SAASzjB,gBAAgB,eAC9B6e,KAAK4E,SAASxjB,aAAa,cAAc,GACzC4e,KAAK4E,SAASxjB,aAAa,OAAQ,UACnC4e,KAAK4E,SAASnZ,UAAY,EAC1B,MAAMotB,EAAYjT,GAAeC,QA7GT,cA6GsC7F,KAAKmY,SAC/DU,IACFA,EAAUptB,UAAY,GAExBoQ,GAAOmE,KAAK4E,UACZ5E,KAAK4E,SAASvJ,UAAU5E,IAAIqhB,IAU5B9X,KAAKmF,gBATsB,KACrBnF,KAAK6E,QAAQyN,OACftS,KAAKsY,WAAW/C,WAElBvV,KAAKgP,kBAAmB,EACxBzO,GAAaqB,QAAQ5B,KAAK4E,SAAU2S,GAAe,CACjDzX,iBACA,GAEoCE,KAAKmY,QAASnY,KAAK6N,cAC7D,CACA,kBAAAnC,GACEnL,GAAac,GAAGrB,KAAK4E,SAAU+S,IAAyBvY,IAhJvC,WAiJXA,EAAMtiB,MAGNkjB,KAAK6E,QAAQgG,SACf7K,KAAKyP,OAGPzP,KAAK8Y,6BAA4B,IAEnCvY,GAAac,GAAGzhB,OAAQ43B,IAAgB,KAClCxX,KAAKwP,WAAaxP,KAAKgP,kBACzBhP,KAAKyY,eACP,IAEFlY,GAAac,GAAGrB,KAAK4E,SAAU8S,IAAyBtY,IAEtDmB,GAAae,IAAItB,KAAK4E,SAAU6S,IAAqBsB,IAC/C/Y,KAAK4E,WAAaxF,EAAM7S,QAAUyT,KAAK4E,WAAamU,EAAOxsB,SAGjC,WAA1ByT,KAAK6E,QAAQ4P,SAIbzU,KAAK6E,QAAQ4P,UACfzU,KAAKyP,OAJLzP,KAAK8Y,6BAKP,GACA,GAEN,CACA,UAAAH,GACE3Y,KAAK4E,SAAS7jB,MAAM6wB,QAAU,OAC9B5R,KAAK4E,SAASxjB,aAAa,eAAe,GAC1C4e,KAAK4E,SAASzjB,gBAAgB,cAC9B6e,KAAK4E,SAASzjB,gBAAgB,QAC9B6e,KAAKgP,kBAAmB,EACxBhP,KAAKoY,UAAU3I,MAAK,KAClBpqB,SAAS6G,KAAKmP,UAAU1B,OAAOke,IAC/B7X,KAAKgZ,oBACLhZ,KAAKwY,WAAWnmB,QAChBkO,GAAaqB,QAAQ5B,KAAK4E,SAAUyS,GAAe,GAEvD,CACA,WAAAxJ,GACE,OAAO7N,KAAK4E,SAASvJ,UAAU7W,SAjLT,OAkLxB,CACA,0BAAAs0B,GAEE,GADkBvY,GAAaqB,QAAQ5B,KAAK4E,SAAUwS,IACxCpV,iBACZ,OAEF,MAAMiX,EAAqBjZ,KAAK4E,SAASvX,aAAehI,SAASC,gBAAgBsC,aAC3EsxB,EAAmBlZ,KAAK4E,SAAS7jB,MAAMiL,UAEpB,WAArBktB,GAAiClZ,KAAK4E,SAASvJ,UAAU7W,SAASuzB,MAGjEkB,IACHjZ,KAAK4E,SAAS7jB,MAAMiL,UAAY,UAElCgU,KAAK4E,SAASvJ,UAAU5E,IAAIshB,IAC5B/X,KAAKmF,gBAAe,KAClBnF,KAAK4E,SAASvJ,UAAU1B,OAAOoe,IAC/B/X,KAAKmF,gBAAe,KAClBnF,KAAK4E,SAAS7jB,MAAMiL,UAAYktB,CAAgB,GAC/ClZ,KAAKmY,QAAQ,GACfnY,KAAKmY,SACRnY,KAAK4E,SAAS0N,QAChB,CAMA,aAAAmG,GACE,MAAMQ,EAAqBjZ,KAAK4E,SAASvX,aAAehI,SAASC,gBAAgBsC,aAC3E+uB,EAAiB3W,KAAKwY,WAAWvC,WACjCkD,EAAoBxC,EAAiB,EAC3C,GAAIwC,IAAsBF,EAAoB,CAC5C,MAAMn3B,EAAWma,KAAU,cAAgB,eAC3C+D,KAAK4E,SAAS7jB,MAAMe,GAAY,GAAG60B,KACrC,CACA,IAAKwC,GAAqBF,EAAoB,CAC5C,MAAMn3B,EAAWma,KAAU,eAAiB,cAC5C+D,KAAK4E,SAAS7jB,MAAMe,GAAY,GAAG60B,KACrC,CACF,CACA,iBAAAqC,GACEhZ,KAAK4E,SAAS7jB,MAAMq4B,YAAc,GAClCpZ,KAAK4E,SAAS7jB,MAAMs4B,aAAe,EACrC,CAGA,sBAAO5c,CAAgBqH,EAAQhE,GAC7B,OAAOE,KAAKuH,MAAK,WACf,MAAMld,EAAO6tB,GAAM5S,oBAAoBtF,KAAM8D,GAC7C,GAAsB,iBAAXA,EAAX,CAGA,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,GAAQhE,EAJb,CAKF,GACF,EAOFS,GAAac,GAAGhc,SAAUuyB,GA9OK,4BA8O2C,SAAUxY,GAClF,MAAM7S,EAASqZ,GAAec,uBAAuB1G,MACjD,CAAC,IAAK,QAAQoB,SAASpB,KAAKgH,UAC9B5H,EAAMkD,iBAER/B,GAAae,IAAI/U,EAAQ+qB,IAAcgC,IACjCA,EAAUtX,kBAIdzB,GAAae,IAAI/U,EAAQ8qB,IAAgB,KACnC1c,GAAUqF,OACZA,KAAKsS,OACP,GACA,IAIJ,MAAMiH,EAAc3T,GAAeC,QAnQb,eAoQlB0T,GACFrB,GAAM7S,YAAYkU,GAAa9J,OAEpByI,GAAM5S,oBAAoB/Y,GAClCmb,OAAO1H,KACd,IACA4G,GAAqBsR,IAMrB/b,GAAmB+b,IAcnB,MAEMsB,GAAc,gBACdC,GAAiB,YACjBC,GAAwB,OAAOF,KAAcC,KAE7CE,GAAoB,OACpBC,GAAuB,UACvBC,GAAoB,SAEpBC,GAAgB,kBAChBC,GAAe,OAAOP,KACtBQ,GAAgB,QAAQR,KACxBS,GAAe,OAAOT,KACtBU,GAAuB,gBAAgBV,KACvCW,GAAiB,SAASX,KAC1BY,GAAe,SAASZ,KACxBa,GAAyB,QAAQb,KAAcC,KAC/Ca,GAAwB,kBAAkBd,KAE1Ce,GAAY,CAChB9F,UAAU,EACV5J,UAAU,EACVpgB,QAAQ,GAEJ+vB,GAAgB,CACpB/F,SAAU,mBACV5J,SAAU,UACVpgB,OAAQ,WAOV,MAAMgwB,WAAkB/V,GACtB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKwP,UAAW,EAChBxP,KAAKoY,UAAYpY,KAAKqY,sBACtBrY,KAAKsY,WAAatY,KAAKuY,uBACvBvY,KAAK0L,oBACP,CAGA,kBAAWhI,GACT,OAAO6W,EACT,CACA,sBAAW5W,GACT,OAAO6W,EACT,CACA,eAAWje,GACT,MApDW,WAqDb,CAGA,MAAAmL,CAAO5H,GACL,OAAOE,KAAKwP,SAAWxP,KAAKyP,OAASzP,KAAK0P,KAAK5P,EACjD,CACA,IAAA4P,CAAK5P,GACCE,KAAKwP,UAGSjP,GAAaqB,QAAQ5B,KAAK4E,SAAUmV,GAAc,CAClEja,kBAEYkC,mBAGdhC,KAAKwP,UAAW,EAChBxP,KAAKoY,UAAU1I,OACV1P,KAAK6E,QAAQpa,SAChB,IAAIurB,IAAkBvG,OAExBzP,KAAK4E,SAASxjB,aAAa,cAAc,GACzC4e,KAAK4E,SAASxjB,aAAa,OAAQ,UACnC4e,KAAK4E,SAASvJ,UAAU5E,IAAImjB,IAW5B5Z,KAAKmF,gBAVoB,KAClBnF,KAAK6E,QAAQpa,SAAUuV,KAAK6E,QAAQ4P,UACvCzU,KAAKsY,WAAW/C,WAElBvV,KAAK4E,SAASvJ,UAAU5E,IAAIkjB,IAC5B3Z,KAAK4E,SAASvJ,UAAU1B,OAAOigB,IAC/BrZ,GAAaqB,QAAQ5B,KAAK4E,SAAUoV,GAAe,CACjDla,iBACA,GAEkCE,KAAK4E,UAAU,GACvD,CACA,IAAA6K,GACOzP,KAAKwP,WAGQjP,GAAaqB,QAAQ5B,KAAK4E,SAAUqV,IACxCjY,mBAGdhC,KAAKsY,WAAW5C,aAChB1V,KAAK4E,SAAS8V,OACd1a,KAAKwP,UAAW,EAChBxP,KAAK4E,SAASvJ,UAAU5E,IAAIojB,IAC5B7Z,KAAKoY,UAAU3I,OAUfzP,KAAKmF,gBAToB,KACvBnF,KAAK4E,SAASvJ,UAAU1B,OAAOggB,GAAmBE,IAClD7Z,KAAK4E,SAASzjB,gBAAgB,cAC9B6e,KAAK4E,SAASzjB,gBAAgB,QACzB6e,KAAK6E,QAAQpa,SAChB,IAAIurB,IAAkB3jB,QAExBkO,GAAaqB,QAAQ5B,KAAK4E,SAAUuV,GAAe,GAEfna,KAAK4E,UAAU,IACvD,CACA,OAAAG,GACE/E,KAAKoY,UAAUrT,UACf/E,KAAKsY,WAAW5C,aAChB/Q,MAAMI,SACR,CAGA,mBAAAsT,GACE,MASM1d,EAAYmG,QAAQd,KAAK6E,QAAQ4P,UACvC,OAAO,IAAIL,GAAS,CAClBJ,UA3HsB,qBA4HtBrZ,YACAyK,YAAY,EACZ8O,YAAalU,KAAK4E,SAAS7f,WAC3BkvB,cAAetZ,EAfK,KACU,WAA1BqF,KAAK6E,QAAQ4P,SAIjBzU,KAAKyP,OAHHlP,GAAaqB,QAAQ5B,KAAK4E,SAAUsV,GAG3B,EAUgC,MAE/C,CACA,oBAAA3B,GACE,OAAO,IAAInD,GAAU,CACnBF,YAAalV,KAAK4E,UAEtB,CACA,kBAAA8G,GACEnL,GAAac,GAAGrB,KAAK4E,SAAU0V,IAAuBlb,IA5IvC,WA6ITA,EAAMtiB,MAGNkjB,KAAK6E,QAAQgG,SACf7K,KAAKyP,OAGPlP,GAAaqB,QAAQ5B,KAAK4E,SAAUsV,IAAqB,GAE7D,CAGA,sBAAOzd,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAOowB,GAAUnV,oBAAoBtF,KAAM8D,GACjD,GAAsB,iBAAXA,EAAX,CAGA,QAAqB/K,IAAjB1O,EAAKyZ,IAAyBA,EAAOrC,WAAW,MAAmB,gBAAXqC,EAC1D,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,GAAQ9D,KAJb,CAKF,GACF,EAOFO,GAAac,GAAGhc,SAAUg1B,GA7JK,gCA6J2C,SAAUjb,GAClF,MAAM7S,EAASqZ,GAAec,uBAAuB1G,MAIrD,GAHI,CAAC,IAAK,QAAQoB,SAASpB,KAAKgH,UAC9B5H,EAAMkD,iBAEJpH,GAAW8E,MACb,OAEFO,GAAae,IAAI/U,EAAQ4tB,IAAgB,KAEnCxf,GAAUqF,OACZA,KAAKsS,OACP,IAIF,MAAMiH,EAAc3T,GAAeC,QAAQiU,IACvCP,GAAeA,IAAgBhtB,GACjCkuB,GAAUpV,YAAYkU,GAAa9J,OAExBgL,GAAUnV,oBAAoB/Y,GACtCmb,OAAO1H,KACd,IACAO,GAAac,GAAGzhB,OAAQ85B,IAAuB,KAC7C,IAAK,MAAM3f,KAAY6L,GAAezT,KAAK2nB,IACzCW,GAAUnV,oBAAoBvL,GAAU2V,MAC1C,IAEFnP,GAAac,GAAGzhB,OAAQw6B,IAAc,KACpC,IAAK,MAAM76B,KAAWqmB,GAAezT,KAAK,gDACG,UAAvClN,iBAAiB1F,GAASiC,UAC5Bi5B,GAAUnV,oBAAoB/lB,GAASkwB,MAE3C,IAEF7I,GAAqB6T,IAMrBte,GAAmBse,IAUnB,MACME,GAAmB,CAEvB,IAAK,CAAC,QAAS,MAAO,KAAM,OAAQ,OAHP,kBAI7B9pB,EAAG,CAAC,SAAU,OAAQ,QAAS,OAC/B+pB,KAAM,GACN9pB,EAAG,GACH+pB,GAAI,GACJC,IAAK,GACLC,KAAM,GACNC,IAAK,GACLC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,GACJnqB,EAAG,GACHub,IAAK,CAAC,MAAO,SAAU,MAAO,QAAS,QAAS,UAChD6O,GAAI,GACJC,GAAI,GACJC,EAAG,GACHC,IAAK,GACLC,EAAG,GACHC,MAAO,GACPC,KAAM,GACNC,IAAK,GACLC,IAAK,GACLC,OAAQ,GACRC,EAAG,GACHC,GAAI,IAIAC,GAAgB,IAAI/lB,IAAI,CAAC,aAAc,OAAQ,OAAQ,WAAY,WAAY,SAAU,MAAO,eAShGgmB,GAAmB,0DACnBC,GAAmB,CAACx6B,EAAWy6B,KACnC,MAAMC,EAAgB16B,EAAUvC,SAASC,cACzC,OAAI+8B,EAAqBpb,SAASqb,IAC5BJ,GAAc1lB,IAAI8lB,IACb3b,QAAQwb,GAAiBj5B,KAAKtB,EAAU26B,YAM5CF,EAAqBr2B,QAAOw2B,GAAkBA,aAA0BpY,SAAQ9R,MAAKmqB,GAASA,EAAMv5B,KAAKo5B,IAAe,EA0C3HI,GAAY,CAChBC,UAAWnC,GACXoC,QAAS,CAAC,EAEVC,WAAY,GACZnwB,MAAM,EACNowB,UAAU,EACVC,WAAY,KACZC,SAAU,eAENC,GAAgB,CACpBN,UAAW,SACXC,QAAS,SACTC,WAAY,oBACZnwB,KAAM,UACNowB,SAAU,UACVC,WAAY,kBACZC,SAAU,UAENE,GAAqB,CACzBC,MAAO,iCACPvjB,SAAU,oBAOZ,MAAMwjB,WAAwB9Z,GAC5B,WAAAU,CAAYL,GACVa,QACA3E,KAAK6E,QAAU7E,KAAK6D,WAAWC,EACjC,CAGA,kBAAWJ,GACT,OAAOmZ,EACT,CACA,sBAAWlZ,GACT,OAAOyZ,EACT,CACA,eAAW7gB,GACT,MA3CW,iBA4Cb,CAGA,UAAAihB,GACE,OAAOxgC,OAAOmiB,OAAOa,KAAK6E,QAAQkY,SAASj6B,KAAIghB,GAAU9D,KAAKyd,yBAAyB3Z,KAAS3d,OAAO2a,QACzG,CACA,UAAA4c,GACE,OAAO1d,KAAKwd,aAAa9sB,OAAS,CACpC,CACA,aAAAitB,CAAcZ,GAMZ,OALA/c,KAAK4d,cAAcb,GACnB/c,KAAK6E,QAAQkY,QAAU,IAClB/c,KAAK6E,QAAQkY,WACbA,GAEE/c,IACT,CACA,MAAA6d,GACE,MAAMC,EAAkBz4B,SAASqvB,cAAc,OAC/CoJ,EAAgBC,UAAY/d,KAAKge,eAAehe,KAAK6E,QAAQsY,UAC7D,IAAK,MAAOpjB,EAAUkkB,KAASjhC,OAAOmkB,QAAQnB,KAAK6E,QAAQkY,SACzD/c,KAAKke,YAAYJ,EAAiBG,EAAMlkB,GAE1C,MAAMojB,EAAWW,EAAgBhY,SAAS,GACpCkX,EAAahd,KAAKyd,yBAAyBzd,KAAK6E,QAAQmY,YAI9D,OAHIA,GACFG,EAAS9hB,UAAU5E,OAAOumB,EAAW96B,MAAM,MAEtCi7B,CACT,CAGA,gBAAAlZ,CAAiBH,GACfa,MAAMV,iBAAiBH,GACvB9D,KAAK4d,cAAc9Z,EAAOiZ,QAC5B,CACA,aAAAa,CAAcO,GACZ,IAAK,MAAOpkB,EAAUgjB,KAAY//B,OAAOmkB,QAAQgd,GAC/CxZ,MAAMV,iBAAiB,CACrBlK,WACAujB,MAAOP,GACNM,GAEP,CACA,WAAAa,CAAYf,EAAUJ,EAAShjB,GAC7B,MAAMqkB,EAAkBxY,GAAeC,QAAQ9L,EAAUojB,GACpDiB,KAGLrB,EAAU/c,KAAKyd,yBAAyBV,IAKpC,GAAUA,GACZ/c,KAAKqe,sBAAsB3jB,GAAWqiB,GAAUqB,GAG9Cpe,KAAK6E,QAAQhY,KACfuxB,EAAgBL,UAAY/d,KAAKge,eAAejB,GAGlDqB,EAAgBE,YAAcvB,EAX5BqB,EAAgBzkB,SAYpB,CACA,cAAAqkB,CAAeG,GACb,OAAOne,KAAK6E,QAAQoY,SApJxB,SAAsBsB,EAAYzB,EAAW0B,GAC3C,IAAKD,EAAW7tB,OACd,OAAO6tB,EAET,GAAIC,GAAgD,mBAArBA,EAC7B,OAAOA,EAAiBD,GAE1B,MACME,GADY,IAAI7+B,OAAO8+B,WACKC,gBAAgBJ,EAAY,aACxD19B,EAAW,GAAGlC,UAAU8/B,EAAgBvyB,KAAKkU,iBAAiB,MACpE,IAAK,MAAM7gB,KAAWsB,EAAU,CAC9B,MAAM+9B,EAAcr/B,EAAQC,SAASC,cACrC,IAAKzC,OAAO4D,KAAKk8B,GAAW1b,SAASwd,GAAc,CACjDr/B,EAAQoa,SACR,QACF,CACA,MAAMklB,EAAgB,GAAGlgC,UAAUY,EAAQ0B,YACrC69B,EAAoB,GAAGngC,OAAOm+B,EAAU,MAAQ,GAAIA,EAAU8B,IAAgB,IACpF,IAAK,MAAM78B,KAAa88B,EACjBtC,GAAiBx6B,EAAW+8B,IAC/Bv/B,EAAQ4B,gBAAgBY,EAAUvC,SAGxC,CACA,OAAOi/B,EAAgBvyB,KAAK6xB,SAC9B,CA2HmCgB,CAAaZ,EAAKne,KAAK6E,QAAQiY,UAAW9c,KAAK6E,QAAQqY,YAAciB,CACtG,CACA,wBAAAV,CAAyBU,GACvB,OAAOthB,GAAQshB,EAAK,CAACne,MACvB,CACA,qBAAAqe,CAAsB9+B,EAAS6+B,GAC7B,GAAIpe,KAAK6E,QAAQhY,KAGf,OAFAuxB,EAAgBL,UAAY,QAC5BK,EAAgBzJ,OAAOp1B,GAGzB6+B,EAAgBE,YAAc/+B,EAAQ++B,WACxC,EAeF,MACMU,GAAwB,IAAI1oB,IAAI,CAAC,WAAY,YAAa,eAC1D2oB,GAAoB,OAEpBC,GAAoB,OAEpBC,GAAiB,SACjBC,GAAmB,gBACnBC,GAAgB,QAChBC,GAAgB,QAahBC,GAAgB,CACpBC,KAAM,OACNC,IAAK,MACLC,MAAOzjB,KAAU,OAAS,QAC1B0jB,OAAQ,SACRC,KAAM3jB,KAAU,QAAU,QAEtB4jB,GAAY,CAChB/C,UAAWnC,GACXmF,WAAW,EACX7xB,SAAU,kBACV8xB,WAAW,EACXC,YAAa,GACbC,MAAO,EACPjwB,mBAAoB,CAAC,MAAO,QAAS,SAAU,QAC/CnD,MAAM,EACN7E,OAAQ,CAAC,EAAG,GACZtJ,UAAW,MACXmzB,aAAc,KACdoL,UAAU,EACVC,WAAY,KACZnjB,UAAU,EACVojB,SAAU,+GACV+C,MAAO,GACPte,QAAS,eAELue,GAAgB,CACpBrD,UAAW,SACXgD,UAAW,UACX7xB,SAAU,mBACV8xB,UAAW,2BACXC,YAAa,oBACbC,MAAO,kBACPjwB,mBAAoB,QACpBnD,KAAM,UACN7E,OAAQ,0BACRtJ,UAAW,oBACXmzB,aAAc,yBACdoL,SAAU,UACVC,WAAY,kBACZnjB,SAAU,mBACVojB,SAAU,SACV+C,MAAO,4BACPte,QAAS,UAOX,MAAMwe,WAAgB1b,GACpB,WAAAP,CAAY5kB,EAASukB,GACnB,QAAsB,IAAX,EACT,MAAM,IAAIU,UAAU,+DAEtBG,MAAMplB,EAASukB,GAGf9D,KAAKqgB,YAAa,EAClBrgB,KAAKsgB,SAAW,EAChBtgB,KAAKugB,WAAa,KAClBvgB,KAAKwgB,eAAiB,CAAC,EACvBxgB,KAAKgS,QAAU,KACfhS,KAAKygB,iBAAmB,KACxBzgB,KAAK0gB,YAAc,KAGnB1gB,KAAK2gB,IAAM,KACX3gB,KAAK4gB,gBACA5gB,KAAK6E,QAAQ9K,UAChBiG,KAAK6gB,WAET,CAGA,kBAAWnd,GACT,OAAOmc,EACT,CACA,sBAAWlc,GACT,OAAOwc,EACT,CACA,eAAW5jB,GACT,MAxGW,SAyGb,CAGA,MAAAukB,GACE9gB,KAAKqgB,YAAa,CACpB,CACA,OAAAU,GACE/gB,KAAKqgB,YAAa,CACpB,CACA,aAAAW,GACEhhB,KAAKqgB,YAAcrgB,KAAKqgB,UAC1B,CACA,MAAA3Y,GACO1H,KAAKqgB,aAGVrgB,KAAKwgB,eAAeS,OAASjhB,KAAKwgB,eAAeS,MAC7CjhB,KAAKwP,WACPxP,KAAKkhB,SAGPlhB,KAAKmhB,SACP,CACA,OAAApc,GACEgI,aAAa/M,KAAKsgB,UAClB/f,GAAaC,IAAIR,KAAK4E,SAAS5J,QAAQmkB,IAAiBC,GAAkBpf,KAAKohB,mBAC3EphB,KAAK4E,SAASpJ,aAAa,2BAC7BwE,KAAK4E,SAASxjB,aAAa,QAAS4e,KAAK4E,SAASpJ,aAAa,2BAEjEwE,KAAKqhB,iBACL1c,MAAMI,SACR,CACA,IAAA2K,GACE,GAAoC,SAAhC1P,KAAK4E,SAAS7jB,MAAM6wB,QACtB,MAAM,IAAIhO,MAAM,uCAElB,IAAM5D,KAAKshB,mBAAoBthB,KAAKqgB,WAClC,OAEF,MAAM/G,EAAY/Y,GAAaqB,QAAQ5B,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UAlItD,SAoIX+b,GADa9lB,GAAeuE,KAAK4E,WACL5E,KAAK4E,SAAS9kB,cAAcwF,iBAAiBd,SAASwb,KAAK4E,UAC7F,GAAI0U,EAAUtX,mBAAqBuf,EACjC,OAIFvhB,KAAKqhB,iBACL,MAAMV,EAAM3gB,KAAKwhB,iBACjBxhB,KAAK4E,SAASxjB,aAAa,mBAAoBu/B,EAAInlB,aAAa,OAChE,MAAM,UACJukB,GACE/f,KAAK6E,QAYT,GAXK7E,KAAK4E,SAAS9kB,cAAcwF,gBAAgBd,SAASwb,KAAK2gB,OAC7DZ,EAAUpL,OAAOgM,GACjBpgB,GAAaqB,QAAQ5B,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UAhJpC,cAkJnBxF,KAAKgS,QAAUhS,KAAKqS,cAAcsO,GAClCA,EAAItlB,UAAU5E,IAAIyoB,IAMd,iBAAkB75B,SAASC,gBAC7B,IAAK,MAAM/F,IAAW,GAAGZ,UAAU0G,SAAS6G,KAAK4Z,UAC/CvF,GAAac,GAAG9hB,EAAS,YAAaqc,IAU1CoE,KAAKmF,gBAPY,KACf5E,GAAaqB,QAAQ5B,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UAhKrC,WAiKQ,IAApBxF,KAAKugB,YACPvgB,KAAKkhB,SAEPlhB,KAAKugB,YAAa,CAAK,GAEKvgB,KAAK2gB,IAAK3gB,KAAK6N,cAC/C,CACA,IAAA4B,GACE,GAAKzP,KAAKwP,aAGQjP,GAAaqB,QAAQ5B,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UA/KtD,SAgLHxD,iBAAd,CAQA,GALYhC,KAAKwhB,iBACbnmB,UAAU1B,OAAOulB,IAIjB,iBAAkB75B,SAASC,gBAC7B,IAAK,MAAM/F,IAAW,GAAGZ,UAAU0G,SAAS6G,KAAK4Z,UAC/CvF,GAAaC,IAAIjhB,EAAS,YAAaqc,IAG3CoE,KAAKwgB,eAA4B,OAAI,EACrCxgB,KAAKwgB,eAAelB,KAAiB,EACrCtf,KAAKwgB,eAAenB,KAAiB,EACrCrf,KAAKugB,WAAa,KAYlBvgB,KAAKmF,gBAVY,KACXnF,KAAKyhB,yBAGJzhB,KAAKugB,YACRvgB,KAAKqhB,iBAEPrhB,KAAK4E,SAASzjB,gBAAgB,oBAC9Bof,GAAaqB,QAAQ5B,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UAzMpC,WAyM8D,GAEnDxF,KAAK2gB,IAAK3gB,KAAK6N,cA1B7C,CA2BF,CACA,MAAA9iB,GACMiV,KAAKgS,SACPhS,KAAKgS,QAAQjnB,QAEjB,CAGA,cAAAu2B,GACE,OAAOxgB,QAAQd,KAAK0hB,YACtB,CACA,cAAAF,GAIE,OAHKxhB,KAAK2gB,MACR3gB,KAAK2gB,IAAM3gB,KAAK2hB,kBAAkB3hB,KAAK0gB,aAAe1gB,KAAK4hB,2BAEtD5hB,KAAK2gB,GACd,CACA,iBAAAgB,CAAkB5E,GAChB,MAAM4D,EAAM3gB,KAAK6hB,oBAAoB9E,GAASc,SAG9C,IAAK8C,EACH,OAAO,KAETA,EAAItlB,UAAU1B,OAAOslB,GAAmBC,IAExCyB,EAAItlB,UAAU5E,IAAI,MAAMuJ,KAAKmE,YAAY5H,aACzC,MAAMulB,EAvuGKC,KACb,GACEA,GAAU5/B,KAAK6/B,MA/BH,IA+BS7/B,KAAK8/B,gBACnB58B,SAAS68B,eAAeH,IACjC,OAAOA,CAAM,EAmuGGI,CAAOniB,KAAKmE,YAAY5H,MAAM1c,WAK5C,OAJA8gC,EAAIv/B,aAAa,KAAM0gC,GACnB9hB,KAAK6N,eACP8S,EAAItlB,UAAU5E,IAAIwoB,IAEb0B,CACT,CACA,UAAAyB,CAAWrF,GACT/c,KAAK0gB,YAAc3D,EACf/c,KAAKwP,aACPxP,KAAKqhB,iBACLrhB,KAAK0P,OAET,CACA,mBAAAmS,CAAoB9E,GAYlB,OAXI/c,KAAKygB,iBACPzgB,KAAKygB,iBAAiB9C,cAAcZ,GAEpC/c,KAAKygB,iBAAmB,IAAIlD,GAAgB,IACvCvd,KAAK6E,QAGRkY,UACAC,WAAYhd,KAAKyd,yBAAyBzd,KAAK6E,QAAQmb,eAGpDhgB,KAAKygB,gBACd,CACA,sBAAAmB,GACE,MAAO,CACL,iBAA0B5hB,KAAK0hB,YAEnC,CACA,SAAAA,GACE,OAAO1hB,KAAKyd,yBAAyBzd,KAAK6E,QAAQqb,QAAUlgB,KAAK4E,SAASpJ,aAAa,yBACzF,CAGA,4BAAA6mB,CAA6BjjB,GAC3B,OAAOY,KAAKmE,YAAYmB,oBAAoBlG,EAAMW,eAAgBC,KAAKsiB,qBACzE,CACA,WAAAzU,GACE,OAAO7N,KAAK6E,QAAQib,WAAa9f,KAAK2gB,KAAO3gB,KAAK2gB,IAAItlB,UAAU7W,SAASy6B,GAC3E,CACA,QAAAzP,GACE,OAAOxP,KAAK2gB,KAAO3gB,KAAK2gB,IAAItlB,UAAU7W,SAAS06B,GACjD,CACA,aAAA7M,CAAcsO,GACZ,MAAMjiC,EAAYme,GAAQmD,KAAK6E,QAAQnmB,UAAW,CAACshB,KAAM2gB,EAAK3gB,KAAK4E,WAC7D2d,EAAahD,GAAc7gC,EAAU+lB,eAC3C,OAAO,GAAoBzE,KAAK4E,SAAU+b,EAAK3gB,KAAKyS,iBAAiB8P,GACvE,CACA,UAAA1P,GACE,MAAM,OACJ7qB,GACEgY,KAAK6E,QACT,MAAsB,iBAAX7c,EACFA,EAAO9F,MAAM,KAAKY,KAAInF,GAAS4f,OAAO6P,SAASzvB,EAAO,MAEzC,mBAAXqK,EACF8qB,GAAc9qB,EAAO8qB,EAAY9S,KAAK4E,UAExC5c,CACT,CACA,wBAAAy1B,CAAyBU,GACvB,OAAOthB,GAAQshB,EAAK,CAACne,KAAK4E,UAC5B,CACA,gBAAA6N,CAAiB8P,GACf,MAAMxP,EAAwB,CAC5Br0B,UAAW6jC,EACXnsB,UAAW,CAAC,CACV9V,KAAM,OACNmB,QAAS,CACPuO,mBAAoBgQ,KAAK6E,QAAQ7U,qBAElC,CACD1P,KAAM,SACNmB,QAAS,CACPuG,OAAQgY,KAAK6S,eAEd,CACDvyB,KAAM,kBACNmB,QAAS,CACPwM,SAAU+R,KAAK6E,QAAQ5W,WAExB,CACD3N,KAAM,QACNmB,QAAS,CACPlC,QAAS,IAAIygB,KAAKmE,YAAY5H,eAE/B,CACDjc,KAAM,kBACNC,SAAS,EACTC,MAAO,aACPC,GAAI4J,IAGF2V,KAAKwhB,iBAAiBpgC,aAAa,wBAAyBiJ,EAAK1J,MAAMjC,UAAU,KAIvF,MAAO,IACFq0B,KACAlW,GAAQmD,KAAK6E,QAAQgN,aAAc,CAACkB,IAE3C,CACA,aAAA6N,GACE,MAAM4B,EAAWxiB,KAAK6E,QAAQjD,QAAQ1f,MAAM,KAC5C,IAAK,MAAM0f,KAAW4gB,EACpB,GAAgB,UAAZ5gB,EACFrB,GAAac,GAAGrB,KAAK4E,SAAU5E,KAAKmE,YAAYqB,UAjVlC,SAiV4DxF,KAAK6E,QAAQ9K,UAAUqF,IAC/EY,KAAKqiB,6BAA6BjjB,GAC1CsI,QAAQ,SAEb,GA3VU,WA2VN9F,EAA4B,CACrC,MAAM6gB,EAAU7gB,IAAYyd,GAAgBrf,KAAKmE,YAAYqB,UAnV5C,cAmV0ExF,KAAKmE,YAAYqB,UArV5F,WAsVVkd,EAAW9gB,IAAYyd,GAAgBrf,KAAKmE,YAAYqB,UAnV7C,cAmV2ExF,KAAKmE,YAAYqB,UArV5F,YAsVjBjF,GAAac,GAAGrB,KAAK4E,SAAU6d,EAASziB,KAAK6E,QAAQ9K,UAAUqF,IAC7D,MAAM+T,EAAUnT,KAAKqiB,6BAA6BjjB,GAClD+T,EAAQqN,eAA8B,YAAfphB,EAAMqB,KAAqB6e,GAAgBD,KAAiB,EACnFlM,EAAQgO,QAAQ,IAElB5gB,GAAac,GAAGrB,KAAK4E,SAAU8d,EAAU1iB,KAAK6E,QAAQ9K,UAAUqF,IAC9D,MAAM+T,EAAUnT,KAAKqiB,6BAA6BjjB,GAClD+T,EAAQqN,eAA8B,aAAfphB,EAAMqB,KAAsB6e,GAAgBD,IAAiBlM,EAAQvO,SAASpgB,SAAS4a,EAAMU,eACpHqT,EAAQ+N,QAAQ,GAEpB,CAEFlhB,KAAKohB,kBAAoB,KACnBphB,KAAK4E,UACP5E,KAAKyP,MACP,EAEFlP,GAAac,GAAGrB,KAAK4E,SAAS5J,QAAQmkB,IAAiBC,GAAkBpf,KAAKohB,kBAChF,CACA,SAAAP,GACE,MAAMX,EAAQlgB,KAAK4E,SAASpJ,aAAa,SACpC0kB,IAGAlgB,KAAK4E,SAASpJ,aAAa,eAAkBwE,KAAK4E,SAAS0Z,YAAY3Y,QAC1E3F,KAAK4E,SAASxjB,aAAa,aAAc8+B,GAE3ClgB,KAAK4E,SAASxjB,aAAa,yBAA0B8+B,GACrDlgB,KAAK4E,SAASzjB,gBAAgB,SAChC,CACA,MAAAggC,GACMnhB,KAAKwP,YAAcxP,KAAKugB,WAC1BvgB,KAAKugB,YAAa,GAGpBvgB,KAAKugB,YAAa,EAClBvgB,KAAK2iB,aAAY,KACX3iB,KAAKugB,YACPvgB,KAAK0P,MACP,GACC1P,KAAK6E,QAAQob,MAAMvQ,MACxB,CACA,MAAAwR,GACMlhB,KAAKyhB,yBAGTzhB,KAAKugB,YAAa,EAClBvgB,KAAK2iB,aAAY,KACV3iB,KAAKugB,YACRvgB,KAAKyP,MACP,GACCzP,KAAK6E,QAAQob,MAAMxQ,MACxB,CACA,WAAAkT,CAAY/kB,EAASglB,GACnB7V,aAAa/M,KAAKsgB,UAClBtgB,KAAKsgB,SAAWziB,WAAWD,EAASglB,EACtC,CACA,oBAAAnB,GACE,OAAOzkC,OAAOmiB,OAAOa,KAAKwgB,gBAAgBpf,UAAS,EACrD,CACA,UAAAyC,CAAWC,GACT,MAAM+e,EAAiB7f,GAAYG,kBAAkBnD,KAAK4E,UAC1D,IAAK,MAAMke,KAAiB9lC,OAAO4D,KAAKiiC,GAClC7D,GAAsBroB,IAAImsB,WACrBD,EAAeC,GAU1B,OAPAhf,EAAS,IACJ+e,KACmB,iBAAX/e,GAAuBA,EAASA,EAAS,CAAC,GAEvDA,EAAS9D,KAAK+D,gBAAgBD,GAC9BA,EAAS9D,KAAKgE,kBAAkBF,GAChC9D,KAAKiE,iBAAiBH,GACfA,CACT,CACA,iBAAAE,CAAkBF,GAchB,OAbAA,EAAOic,WAAiC,IAArBjc,EAAOic,UAAsB16B,SAAS6G,KAAOwO,GAAWoJ,EAAOic,WACtD,iBAAjBjc,EAAOmc,QAChBnc,EAAOmc,MAAQ,CACbvQ,KAAM5L,EAAOmc,MACbxQ,KAAM3L,EAAOmc,QAGW,iBAAjBnc,EAAOoc,QAChBpc,EAAOoc,MAAQpc,EAAOoc,MAAMrgC,YAEA,iBAAnBikB,EAAOiZ,UAChBjZ,EAAOiZ,QAAUjZ,EAAOiZ,QAAQl9B,YAE3BikB,CACT,CACA,kBAAAwe,GACE,MAAMxe,EAAS,CAAC,EAChB,IAAK,MAAOhnB,EAAKa,KAAUX,OAAOmkB,QAAQnB,KAAK6E,SACzC7E,KAAKmE,YAAYT,QAAQ5mB,KAASa,IACpCmmB,EAAOhnB,GAAOa,GASlB,OANAmmB,EAAO/J,UAAW,EAClB+J,EAAOlC,QAAU,SAKVkC,CACT,CACA,cAAAud,GACMrhB,KAAKgS,UACPhS,KAAKgS,QAAQhZ,UACbgH,KAAKgS,QAAU,MAEbhS,KAAK2gB,MACP3gB,KAAK2gB,IAAIhnB,SACTqG,KAAK2gB,IAAM,KAEf,CAGA,sBAAOlkB,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO+1B,GAAQ9a,oBAAoBtF,KAAM8D,GAC/C,GAAsB,iBAAXA,EAAX,CAGA,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IAJL,CAKF,GACF,EAOF3H,GAAmBikB,IAcnB,MAGM2C,GAAY,IACb3C,GAAQ1c,QACXqZ,QAAS,GACT/0B,OAAQ,CAAC,EAAG,GACZtJ,UAAW,QACXy+B,SAAU,8IACVvb,QAAS,SAELohB,GAAgB,IACjB5C,GAAQzc,YACXoZ,QAAS,kCAOX,MAAMkG,WAAgB7C,GAEpB,kBAAW1c,GACT,OAAOqf,EACT,CACA,sBAAWpf,GACT,OAAOqf,EACT,CACA,eAAWzmB,GACT,MA7BW,SA8Bb,CAGA,cAAA+kB,GACE,OAAOthB,KAAK0hB,aAAe1hB,KAAKkjB,aAClC,CAGA,sBAAAtB,GACE,MAAO,CACL,kBAAkB5hB,KAAK0hB,YACvB,gBAAoB1hB,KAAKkjB,cAE7B,CACA,WAAAA,GACE,OAAOljB,KAAKyd,yBAAyBzd,KAAK6E,QAAQkY,QACpD,CAGA,sBAAOtgB,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO44B,GAAQ3d,oBAAoBtF,KAAM8D,GAC/C,GAAsB,iBAAXA,EAAX,CAGA,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IAJL,CAKF,GACF,EAOF3H,GAAmB8mB,IAcnB,MAEME,GAAc,gBAEdC,GAAiB,WAAWD,KAC5BE,GAAc,QAAQF,KACtBG,GAAwB,OAAOH,cAE/BI,GAAsB,SAEtBC,GAAwB,SAExBC,GAAqB,YAGrBC,GAAsB,GAAGD,mBAA+CA,uBAGxEE,GAAY,CAChB37B,OAAQ,KAER47B,WAAY,eACZC,cAAc,EACdt3B,OAAQ,KACRu3B,UAAW,CAAC,GAAK,GAAK,IAElBC,GAAgB,CACpB/7B,OAAQ,gBAER47B,WAAY,SACZC,aAAc,UACdt3B,OAAQ,UACRu3B,UAAW,SAOb,MAAME,WAAkBtf,GACtB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GAGf9D,KAAKikB,aAAe,IAAI/yB,IACxB8O,KAAKkkB,oBAAsB,IAAIhzB,IAC/B8O,KAAKmkB,aAA6D,YAA9Cl/B,iBAAiB+a,KAAK4E,UAAU5Y,UAA0B,KAAOgU,KAAK4E,SAC1F5E,KAAKokB,cAAgB,KACrBpkB,KAAKqkB,UAAY,KACjBrkB,KAAKskB,oBAAsB,CACzBC,gBAAiB,EACjBC,gBAAiB,GAEnBxkB,KAAKykB,SACP,CAGA,kBAAW/gB,GACT,OAAOigB,EACT,CACA,sBAAWhgB,GACT,OAAOogB,EACT,CACA,eAAWxnB,GACT,MAhEW,WAiEb,CAGA,OAAAkoB,GACEzkB,KAAK0kB,mCACL1kB,KAAK2kB,2BACD3kB,KAAKqkB,UACPrkB,KAAKqkB,UAAUO,aAEf5kB,KAAKqkB,UAAYrkB,KAAK6kB,kBAExB,IAAK,MAAMC,KAAW9kB,KAAKkkB,oBAAoB/kB,SAC7Ca,KAAKqkB,UAAUU,QAAQD,EAE3B,CACA,OAAA/f,GACE/E,KAAKqkB,UAAUO,aACfjgB,MAAMI,SACR,CAGA,iBAAAf,CAAkBF,GAShB,OAPAA,EAAOvX,OAASmO,GAAWoJ,EAAOvX,SAAWlH,SAAS6G,KAGtD4X,EAAO8f,WAAa9f,EAAO9b,OAAS,GAAG8b,EAAO9b,oBAAsB8b,EAAO8f,WAC3C,iBAArB9f,EAAOggB,YAChBhgB,EAAOggB,UAAYhgB,EAAOggB,UAAU5hC,MAAM,KAAKY,KAAInF,GAAS4f,OAAOC,WAAW7f,MAEzEmmB,CACT,CACA,wBAAA6gB,GACO3kB,KAAK6E,QAAQgf,eAKlBtjB,GAAaC,IAAIR,KAAK6E,QAAQtY,OAAQ82B,IACtC9iB,GAAac,GAAGrB,KAAK6E,QAAQtY,OAAQ82B,GAAaG,IAAuBpkB,IACvE,MAAM4lB,EAAoBhlB,KAAKkkB,oBAAoB/mC,IAAIiiB,EAAM7S,OAAOtB,MACpE,GAAI+5B,EAAmB,CACrB5lB,EAAMkD,iBACN,MAAM3G,EAAOqE,KAAKmkB,cAAgBvkC,OAC5BmE,EAASihC,EAAkB3gC,UAAY2b,KAAK4E,SAASvgB,UAC3D,GAAIsX,EAAKspB,SAKP,YAJAtpB,EAAKspB,SAAS,CACZtjC,IAAKoC,EACLmhC,SAAU,WAMdvpB,EAAKlQ,UAAY1H,CACnB,KAEJ,CACA,eAAA8gC,GACE,MAAMpjC,EAAU,CACdka,KAAMqE,KAAKmkB,aACXL,UAAW9jB,KAAK6E,QAAQif,UACxBF,WAAY5jB,KAAK6E,QAAQ+e,YAE3B,OAAO,IAAIuB,sBAAqBhkB,GAAWnB,KAAKolB,kBAAkBjkB,IAAU1f,EAC9E,CAGA,iBAAA2jC,CAAkBjkB,GAChB,MAAMkkB,EAAgB/H,GAAStd,KAAKikB,aAAa9mC,IAAI,IAAImgC,EAAM/wB,OAAO4N,MAChEob,EAAW+H,IACftd,KAAKskB,oBAAoBC,gBAAkBjH,EAAM/wB,OAAOlI,UACxD2b,KAAKslB,SAASD,EAAc/H,GAAO,EAE/BkH,GAAmBxkB,KAAKmkB,cAAgB9+B,SAASC,iBAAiBmG,UAClE85B,EAAkBf,GAAmBxkB,KAAKskB,oBAAoBE,gBACpExkB,KAAKskB,oBAAoBE,gBAAkBA,EAC3C,IAAK,MAAMlH,KAASnc,EAAS,CAC3B,IAAKmc,EAAMkI,eAAgB,CACzBxlB,KAAKokB,cAAgB,KACrBpkB,KAAKylB,kBAAkBJ,EAAc/H,IACrC,QACF,CACA,MAAMoI,EAA2BpI,EAAM/wB,OAAOlI,WAAa2b,KAAKskB,oBAAoBC,gBAEpF,GAAIgB,GAAmBG,GAGrB,GAFAnQ,EAAS+H,IAEJkH,EACH,YAMCe,GAAoBG,GACvBnQ,EAAS+H,EAEb,CACF,CACA,gCAAAoH,GACE1kB,KAAKikB,aAAe,IAAI/yB,IACxB8O,KAAKkkB,oBAAsB,IAAIhzB,IAC/B,MAAMy0B,EAAc/f,GAAezT,KAAKqxB,GAAuBxjB,KAAK6E,QAAQtY,QAC5E,IAAK,MAAMq5B,KAAUD,EAAa,CAEhC,IAAKC,EAAO36B,MAAQiQ,GAAW0qB,GAC7B,SAEF,MAAMZ,EAAoBpf,GAAeC,QAAQggB,UAAUD,EAAO36B,MAAO+U,KAAK4E,UAG1EjK,GAAUqqB,KACZhlB,KAAKikB,aAAalyB,IAAI8zB,UAAUD,EAAO36B,MAAO26B,GAC9C5lB,KAAKkkB,oBAAoBnyB,IAAI6zB,EAAO36B,KAAM+5B,GAE9C,CACF,CACA,QAAAM,CAAS/4B,GACHyT,KAAKokB,gBAAkB73B,IAG3ByT,KAAKylB,kBAAkBzlB,KAAK6E,QAAQtY,QACpCyT,KAAKokB,cAAgB73B,EACrBA,EAAO8O,UAAU5E,IAAI8sB,IACrBvjB,KAAK8lB,iBAAiBv5B,GACtBgU,GAAaqB,QAAQ5B,KAAK4E,SAAUwe,GAAgB,CAClDtjB,cAAevT,IAEnB,CACA,gBAAAu5B,CAAiBv5B,GAEf,GAAIA,EAAO8O,UAAU7W,SA9LQ,iBA+L3BohB,GAAeC,QArLc,mBAqLsBtZ,EAAOyO,QAtLtC,cAsLkEK,UAAU5E,IAAI8sB,SAGtG,IAAK,MAAMwC,KAAangB,GAAeI,QAAQzZ,EA9LnB,qBAiM1B,IAAK,MAAMxJ,KAAQ6iB,GAAeM,KAAK6f,EAAWrC,IAChD3gC,EAAKsY,UAAU5E,IAAI8sB,GAGzB,CACA,iBAAAkC,CAAkBhhC,GAChBA,EAAO4W,UAAU1B,OAAO4pB,IACxB,MAAMyC,EAAcpgB,GAAezT,KAAK,GAAGqxB,MAAyBD,KAAuB9+B,GAC3F,IAAK,MAAM9E,KAAQqmC,EACjBrmC,EAAK0b,UAAU1B,OAAO4pB,GAE1B,CAGA,sBAAO9mB,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAO25B,GAAU1e,oBAAoBtF,KAAM8D,GACjD,GAAsB,iBAAXA,EAAX,CAGA,QAAqB/K,IAAjB1O,EAAKyZ,IAAyBA,EAAOrC,WAAW,MAAmB,gBAAXqC,EAC1D,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IAJL,CAKF,GACF,EAOFvD,GAAac,GAAGzhB,OAAQ0jC,IAAuB,KAC7C,IAAK,MAAM2C,KAAOrgB,GAAezT,KApOT,0BAqOtB6xB,GAAU1e,oBAAoB2gB,EAChC,IAOF9pB,GAAmB6nB,IAcnB,MAEMkC,GAAc,UACdC,GAAe,OAAOD,KACtBE,GAAiB,SAASF,KAC1BG,GAAe,OAAOH,KACtBI,GAAgB,QAAQJ,KACxBK,GAAuB,QAAQL,KAC/BM,GAAgB,UAAUN,KAC1BO,GAAsB,OAAOP,KAC7BQ,GAAiB,YACjBC,GAAkB,aAClBC,GAAe,UACfC,GAAiB,YACjBC,GAAW,OACXC,GAAU,MACVC,GAAoB,SACpBC,GAAoB,OACpBC,GAAoB,OAEpBC,GAA2B,mBAE3BC,GAA+B,QAAQD,MAIvCE,GAAuB,2EACvBC,GAAsB,YAFOF,uBAAiDA,mBAA6CA,OAE/EC,KAC5CE,GAA8B,IAAIP,8BAA6CA,+BAA8CA,4BAMnI,MAAMQ,WAAY9iB,GAChB,WAAAP,CAAY5kB,GACVolB,MAAMplB,GACNygB,KAAKiS,QAAUjS,KAAK4E,SAAS5J,QAdN,uCAelBgF,KAAKiS,UAOVjS,KAAKynB,sBAAsBznB,KAAKiS,QAASjS,KAAK0nB,gBAC9CnnB,GAAac,GAAGrB,KAAK4E,SAAU4hB,IAAepnB,GAASY,KAAK0M,SAAStN,KACvE,CAGA,eAAW7C,GACT,MAnDW,KAoDb,CAGA,IAAAmT,GAEE,MAAMiY,EAAY3nB,KAAK4E,SACvB,GAAI5E,KAAK4nB,cAAcD,GACrB,OAIF,MAAME,EAAS7nB,KAAK8nB,iBACdC,EAAYF,EAAStnB,GAAaqB,QAAQimB,EAAQ1B,GAAc,CACpErmB,cAAe6nB,IACZ,KACapnB,GAAaqB,QAAQ+lB,EAAWtB,GAAc,CAC9DvmB,cAAe+nB,IAEH7lB,kBAAoB+lB,GAAaA,EAAU/lB,mBAGzDhC,KAAKgoB,YAAYH,EAAQF,GACzB3nB,KAAKioB,UAAUN,EAAWE,GAC5B,CAGA,SAAAI,CAAU1oC,EAAS2oC,GACZ3oC,IAGLA,EAAQ8b,UAAU5E,IAAIuwB,IACtBhnB,KAAKioB,UAAUriB,GAAec,uBAAuBnnB,IAcrDygB,KAAKmF,gBAZY,KACsB,QAAjC5lB,EAAQic,aAAa,SAIzBjc,EAAQ4B,gBAAgB,YACxB5B,EAAQ6B,aAAa,iBAAiB,GACtC4e,KAAKmoB,gBAAgB5oC,GAAS,GAC9BghB,GAAaqB,QAAQriB,EAAS+mC,GAAe,CAC3CxmB,cAAeooB,KAPf3oC,EAAQ8b,UAAU5E,IAAIywB,GAQtB,GAE0B3nC,EAASA,EAAQ8b,UAAU7W,SAASyiC,KACpE,CACA,WAAAe,CAAYzoC,EAAS2oC,GACd3oC,IAGLA,EAAQ8b,UAAU1B,OAAOqtB,IACzBznC,EAAQm7B,OACR1a,KAAKgoB,YAAYpiB,GAAec,uBAAuBnnB,IAcvDygB,KAAKmF,gBAZY,KACsB,QAAjC5lB,EAAQic,aAAa,SAIzBjc,EAAQ6B,aAAa,iBAAiB,GACtC7B,EAAQ6B,aAAa,WAAY,MACjC4e,KAAKmoB,gBAAgB5oC,GAAS,GAC9BghB,GAAaqB,QAAQriB,EAAS6mC,GAAgB,CAC5CtmB,cAAeooB,KAPf3oC,EAAQ8b,UAAU1B,OAAOutB,GAQzB,GAE0B3nC,EAASA,EAAQ8b,UAAU7W,SAASyiC,KACpE,CACA,QAAAva,CAAStN,GACP,IAAK,CAACsnB,GAAgBC,GAAiBC,GAAcC,GAAgBC,GAAUC,IAAS3lB,SAAShC,EAAMtiB,KACrG,OAEFsiB,EAAMuU,kBACNvU,EAAMkD,iBACN,MAAMwD,EAAW9F,KAAK0nB,eAAevhC,QAAO5G,IAAY2b,GAAW3b,KACnE,IAAI6oC,EACJ,GAAI,CAACtB,GAAUC,IAAS3lB,SAAShC,EAAMtiB,KACrCsrC,EAAoBtiB,EAAS1G,EAAMtiB,MAAQgqC,GAAW,EAAIhhB,EAASpV,OAAS,OACvE,CACL,MAAM2c,EAAS,CAACsZ,GAAiBE,IAAgBzlB,SAAShC,EAAMtiB,KAChEsrC,EAAoBtqB,GAAqBgI,EAAU1G,EAAM7S,OAAQ8gB,GAAQ,EAC3E,CACI+a,IACFA,EAAkB9V,MAAM,CACtB+V,eAAe,IAEjBb,GAAIliB,oBAAoB8iB,GAAmB1Y,OAE/C,CACA,YAAAgY,GAEE,OAAO9hB,GAAezT,KAAKm1B,GAAqBtnB,KAAKiS,QACvD,CACA,cAAA6V,GACE,OAAO9nB,KAAK0nB,eAAev1B,MAAKzN,GAASsb,KAAK4nB,cAAcljC,MAAW,IACzE,CACA,qBAAA+iC,CAAsBhjC,EAAQqhB,GAC5B9F,KAAKsoB,yBAAyB7jC,EAAQ,OAAQ,WAC9C,IAAK,MAAMC,KAASohB,EAClB9F,KAAKuoB,6BAA6B7jC,EAEtC,CACA,4BAAA6jC,CAA6B7jC,GAC3BA,EAAQsb,KAAKwoB,iBAAiB9jC,GAC9B,MAAM+jC,EAAWzoB,KAAK4nB,cAAcljC,GAC9BgkC,EAAY1oB,KAAK2oB,iBAAiBjkC,GACxCA,EAAMtD,aAAa,gBAAiBqnC,GAChCC,IAAchkC,GAChBsb,KAAKsoB,yBAAyBI,EAAW,OAAQ,gBAE9CD,GACH/jC,EAAMtD,aAAa,WAAY,MAEjC4e,KAAKsoB,yBAAyB5jC,EAAO,OAAQ,OAG7Csb,KAAK4oB,mCAAmClkC,EAC1C,CACA,kCAAAkkC,CAAmClkC,GACjC,MAAM6H,EAASqZ,GAAec,uBAAuBhiB,GAChD6H,IAGLyT,KAAKsoB,yBAAyB/7B,EAAQ,OAAQ,YAC1C7H,EAAMyV,IACR6F,KAAKsoB,yBAAyB/7B,EAAQ,kBAAmB,GAAG7H,EAAMyV,MAEtE,CACA,eAAAguB,CAAgB5oC,EAASspC,GACvB,MAAMH,EAAY1oB,KAAK2oB,iBAAiBppC,GACxC,IAAKmpC,EAAUrtB,UAAU7W,SApKN,YAqKjB,OAEF,MAAMkjB,EAAS,CAAC3N,EAAUia,KACxB,MAAMz0B,EAAUqmB,GAAeC,QAAQ9L,EAAU2uB,GAC7CnpC,GACFA,EAAQ8b,UAAUqM,OAAOsM,EAAW6U,EACtC,EAEFnhB,EAAOyf,GAA0BH,IACjCtf,EA5K2B,iBA4KIwf,IAC/BwB,EAAUtnC,aAAa,gBAAiBynC,EAC1C,CACA,wBAAAP,CAAyB/oC,EAASwC,EAAWpE,GACtC4B,EAAQgc,aAAaxZ,IACxBxC,EAAQ6B,aAAaW,EAAWpE,EAEpC,CACA,aAAAiqC,CAAczY,GACZ,OAAOA,EAAK9T,UAAU7W,SAASwiC,GACjC,CAGA,gBAAAwB,CAAiBrZ,GACf,OAAOA,EAAKpJ,QAAQuhB,IAAuBnY,EAAOvJ,GAAeC,QAAQyhB,GAAqBnY,EAChG,CAGA,gBAAAwZ,CAAiBxZ,GACf,OAAOA,EAAKnU,QA5LO,gCA4LoBmU,CACzC,CAGA,sBAAO1S,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAOm9B,GAAIliB,oBAAoBtF,MACrC,GAAsB,iBAAX8D,EAAX,CAGA,QAAqB/K,IAAjB1O,EAAKyZ,IAAyBA,EAAOrC,WAAW,MAAmB,gBAAXqC,EAC1D,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,IAJL,CAKF,GACF,EAOFvD,GAAac,GAAGhc,SAAUkhC,GAAsBc,IAAsB,SAAUjoB,GAC1E,CAAC,IAAK,QAAQgC,SAASpB,KAAKgH,UAC9B5H,EAAMkD,iBAEJpH,GAAW8E,OAGfwnB,GAAIliB,oBAAoBtF,MAAM0P,MAChC,IAKAnP,GAAac,GAAGzhB,OAAQ6mC,IAAqB,KAC3C,IAAK,MAAMlnC,KAAWqmB,GAAezT,KAAKo1B,IACxCC,GAAIliB,oBAAoB/lB,EAC1B,IAMF4c,GAAmBqrB,IAcnB,MAEMxiB,GAAY,YACZ8jB,GAAkB,YAAY9jB,KAC9B+jB,GAAiB,WAAW/jB,KAC5BgkB,GAAgB,UAAUhkB,KAC1BikB,GAAiB,WAAWjkB,KAC5BkkB,GAAa,OAAOlkB,KACpBmkB,GAAe,SAASnkB,KACxBokB,GAAa,OAAOpkB,KACpBqkB,GAAc,QAAQrkB,KAEtBskB,GAAkB,OAClBC,GAAkB,OAClBC,GAAqB,UACrB7lB,GAAc,CAClBmc,UAAW,UACX2J,SAAU,UACVxJ,MAAO,UAEHvc,GAAU,CACdoc,WAAW,EACX2J,UAAU,EACVxJ,MAAO,KAOT,MAAMyJ,WAAchlB,GAClB,WAAAP,CAAY5kB,EAASukB,GACnBa,MAAMplB,EAASukB,GACf9D,KAAKsgB,SAAW,KAChBtgB,KAAK2pB,sBAAuB,EAC5B3pB,KAAK4pB,yBAA0B,EAC/B5pB,KAAK4gB,eACP,CAGA,kBAAWld,GACT,OAAOA,EACT,CACA,sBAAWC,GACT,OAAOA,EACT,CACA,eAAWpH,GACT,MA/CS,OAgDX,CAGA,IAAAmT,GACoBnP,GAAaqB,QAAQ5B,KAAK4E,SAAUwkB,IACxCpnB,mBAGdhC,KAAK6pB,gBACD7pB,KAAK6E,QAAQib,WACf9f,KAAK4E,SAASvJ,UAAU5E,IA/CN,QAsDpBuJ,KAAK4E,SAASvJ,UAAU1B,OAAO2vB,IAC/BztB,GAAOmE,KAAK4E,UACZ5E,KAAK4E,SAASvJ,UAAU5E,IAAI8yB,GAAiBC,IAC7CxpB,KAAKmF,gBARY,KACfnF,KAAK4E,SAASvJ,UAAU1B,OAAO6vB,IAC/BjpB,GAAaqB,QAAQ5B,KAAK4E,SAAUykB,IACpCrpB,KAAK8pB,oBAAoB,GAKG9pB,KAAK4E,SAAU5E,KAAK6E,QAAQib,WAC5D,CACA,IAAArQ,GACOzP,KAAK+pB,YAGQxpB,GAAaqB,QAAQ5B,KAAK4E,SAAUskB,IACxClnB,mBAQdhC,KAAK4E,SAASvJ,UAAU5E,IAAI+yB,IAC5BxpB,KAAKmF,gBANY,KACfnF,KAAK4E,SAASvJ,UAAU5E,IAAI6yB,IAC5BtpB,KAAK4E,SAASvJ,UAAU1B,OAAO6vB,GAAoBD,IACnDhpB,GAAaqB,QAAQ5B,KAAK4E,SAAUukB,GAAa,GAGrBnpB,KAAK4E,SAAU5E,KAAK6E,QAAQib,YAC5D,CACA,OAAA/a,GACE/E,KAAK6pB,gBACD7pB,KAAK+pB,WACP/pB,KAAK4E,SAASvJ,UAAU1B,OAAO4vB,IAEjC5kB,MAAMI,SACR,CACA,OAAAglB,GACE,OAAO/pB,KAAK4E,SAASvJ,UAAU7W,SAAS+kC,GAC1C,CAIA,kBAAAO,GACO9pB,KAAK6E,QAAQ4kB,WAGdzpB,KAAK2pB,sBAAwB3pB,KAAK4pB,0BAGtC5pB,KAAKsgB,SAAWziB,YAAW,KACzBmC,KAAKyP,MAAM,GACVzP,KAAK6E,QAAQob,QAClB,CACA,cAAA+J,CAAe5qB,EAAO6qB,GACpB,OAAQ7qB,EAAMqB,MACZ,IAAK,YACL,IAAK,WAEDT,KAAK2pB,qBAAuBM,EAC5B,MAEJ,IAAK,UACL,IAAK,WAEDjqB,KAAK4pB,wBAA0BK,EAIrC,GAAIA,EAEF,YADAjqB,KAAK6pB,gBAGP,MAAMvc,EAAclO,EAAMU,cACtBE,KAAK4E,WAAa0I,GAAetN,KAAK4E,SAASpgB,SAAS8oB,IAG5DtN,KAAK8pB,oBACP,CACA,aAAAlJ,GACErgB,GAAac,GAAGrB,KAAK4E,SAAUkkB,IAAiB1pB,GAASY,KAAKgqB,eAAe5qB,GAAO,KACpFmB,GAAac,GAAGrB,KAAK4E,SAAUmkB,IAAgB3pB,GAASY,KAAKgqB,eAAe5qB,GAAO,KACnFmB,GAAac,GAAGrB,KAAK4E,SAAUokB,IAAe5pB,GAASY,KAAKgqB,eAAe5qB,GAAO,KAClFmB,GAAac,GAAGrB,KAAK4E,SAAUqkB,IAAgB7pB,GAASY,KAAKgqB,eAAe5qB,GAAO,IACrF,CACA,aAAAyqB,GACE9c,aAAa/M,KAAKsgB,UAClBtgB,KAAKsgB,SAAW,IAClB,CAGA,sBAAO7jB,CAAgBqH,GACrB,OAAO9D,KAAKuH,MAAK,WACf,MAAMld,EAAOq/B,GAAMpkB,oBAAoBtF,KAAM8D,GAC7C,GAAsB,iBAAXA,EAAqB,CAC9B,QAA4B,IAAjBzZ,EAAKyZ,GACd,MAAM,IAAIU,UAAU,oBAAoBV,MAE1CzZ,EAAKyZ,GAAQ9D,KACf,CACF,GACF,ECr0IK,SAASkqB,GAAc7tB,GACD,WAAvBhX,SAASuX,WAAyBP,IACjChX,SAASyF,iBAAiB,mBAAoBuR,EACrD,CDy0IAuK,GAAqB8iB,IAMrBvtB,GAAmButB,IEtyInBQ,IAvCA,WAC2B,GAAG93B,MAAM5U,KAChC6H,SAAS+a,iBAAiB,+BAETtd,KAAI,SAAUqnC,GAC/B,OAAO,IAAI/J,GAAQ+J,EAAkB,CAAElK,MAAO,CAAEvQ,KAAM,IAAKD,KAAM,MACnE,GACF,IAiCAya,IA5BA,WACY7kC,SAAS68B,eAAe,mBAC9Bp3B,iBAAiB,SAAS,WAC5BzF,SAAS6G,KAAKT,UAAY,EAC1BpG,SAASC,gBAAgBmG,UAAY,CACvC,GACF,IAuBAy+B,IArBA,WACE,IAAIE,EAAM/kC,SAAS68B,eAAe,mBAC9BmI,EAAShlC,SACVilC,uBAAuB,aAAa,GACpChnC,wBACH1D,OAAOkL,iBAAiB,UAAU,WAC5BkV,KAAKuqB,UAAYvqB,KAAKwqB,SAAWxqB,KAAKwqB,QAAUH,EAAOzsC,OACzDwsC,EAAIrpC,MAAM6wB,QAAU,QAEpBwY,EAAIrpC,MAAM6wB,QAAU,OAEtB5R,KAAKuqB,UAAYvqB,KAAKwqB,OACxB,GACF","sources":["webpack://pydata_sphinx_theme/webpack/bootstrap","webpack://pydata_sphinx_theme/webpack/runtime/define property getters","webpack://pydata_sphinx_theme/webpack/runtime/hasOwnProperty shorthand","webpack://pydata_sphinx_theme/webpack/runtime/make namespace object","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/enums.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getNodeName.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getWindow.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/instanceOf.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/applyStyles.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getBasePlacement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/math.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/userAgent.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/isLayoutViewport.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getBoundingClientRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getLayoutRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/contains.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getComputedStyle.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/isTableElement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getDocumentElement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getParentNode.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getOffsetParent.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getMainAxisFromPlacement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/within.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/mergePaddingObject.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getFreshSideObject.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/expandToHashMap.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/arrow.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getVariation.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/computeStyles.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/eventListeners.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getOppositePlacement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getOppositeVariationPlacement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getWindowScroll.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getWindowScrollBarX.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/isScrollParent.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getScrollParent.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/listScrollParents.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/rectToClientRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getClippingRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getViewportRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getDocumentRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/computeOffsets.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/detectOverflow.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/flip.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/computeAutoPlacement.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/hide.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/offset.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/popperOffsets.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/modifiers/preventOverflow.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/getAltAxis.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getCompositeRect.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getNodeScroll.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/dom-utils/getHTMLElementScroll.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/orderModifiers.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/createPopper.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/debounce.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/utils/mergeByName.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/popper.js","webpack://pydata_sphinx_theme/./node_modules/@popperjs/core/lib/popper-lite.js","webpack://pydata_sphinx_theme/./node_modules/bootstrap/dist/js/bootstrap.esm.js","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/scripts/mixin.js","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/scripts/bootstrap.js"],"sourcesContent":["// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export var top = 'top';\nexport var bottom = 'bottom';\nexport var right = 'right';\nexport var left = 'left';\nexport var auto = 'auto';\nexport var basePlacements = [top, bottom, right, left];\nexport var start = 'start';\nexport var end = 'end';\nexport var clippingParents = 'clippingParents';\nexport var viewport = 'viewport';\nexport var popper = 'popper';\nexport var reference = 'reference';\nexport var variationPlacements = /*#__PURE__*/basePlacements.reduce(function (acc, placement) {\n  return acc.concat([placement + \"-\" + start, placement + \"-\" + end]);\n}, []);\nexport var placements = /*#__PURE__*/[].concat(basePlacements, [auto]).reduce(function (acc, placement) {\n  return acc.concat([placement, placement + \"-\" + start, placement + \"-\" + end]);\n}, []); // modifiers that need to read the DOM\n\nexport var beforeRead = 'beforeRead';\nexport var read = 'read';\nexport var afterRead = 'afterRead'; // pure-logic modifiers\n\nexport var beforeMain = 'beforeMain';\nexport var main = 'main';\nexport var afterMain = 'afterMain'; // modifier with the purpose to write to the DOM (or write into a framework state)\n\nexport var beforeWrite = 'beforeWrite';\nexport var write = 'write';\nexport var afterWrite = 'afterWrite';\nexport var modifierPhases = [beforeRead, read, afterRead, beforeMain, main, afterMain, beforeWrite, write, afterWrite];","export default function getNodeName(element) {\n  return element ? (element.nodeName || '').toLowerCase() : null;\n}","export default function getWindow(node) {\n  if (node == null) {\n    return window;\n  }\n\n  if (node.toString() !== '[object Window]') {\n    var ownerDocument = node.ownerDocument;\n    return ownerDocument ? ownerDocument.defaultView || window : window;\n  }\n\n  return node;\n}","import getWindow from \"./getWindow.js\";\n\nfunction isElement(node) {\n  var OwnElement = getWindow(node).Element;\n  return node instanceof OwnElement || node instanceof Element;\n}\n\nfunction isHTMLElement(node) {\n  var OwnElement = getWindow(node).HTMLElement;\n  return node instanceof OwnElement || node instanceof HTMLElement;\n}\n\nfunction isShadowRoot(node) {\n  // IE 11 has no ShadowRoot\n  if (typeof ShadowRoot === 'undefined') {\n    return false;\n  }\n\n  var OwnElement = getWindow(node).ShadowRoot;\n  return node instanceof OwnElement || node instanceof ShadowRoot;\n}\n\nexport { isElement, isHTMLElement, isShadowRoot };","import getNodeName from \"../dom-utils/getNodeName.js\";\nimport { isHTMLElement } from \"../dom-utils/instanceOf.js\"; // This modifier takes the styles prepared by the `computeStyles` modifier\n// and applies them to the HTMLElements such as popper and arrow\n\nfunction applyStyles(_ref) {\n  var state = _ref.state;\n  Object.keys(state.elements).forEach(function (name) {\n    var style = state.styles[name] || {};\n    var attributes = state.attributes[name] || {};\n    var element = state.elements[name]; // arrow is optional + virtual elements\n\n    if (!isHTMLElement(element) || !getNodeName(element)) {\n      return;\n    } // Flow doesn't support to extend this property, but it's the most\n    // effective way to apply styles to an HTMLElement\n    // $FlowFixMe[cannot-write]\n\n\n    Object.assign(element.style, style);\n    Object.keys(attributes).forEach(function (name) {\n      var value = attributes[name];\n\n      if (value === false) {\n        element.removeAttribute(name);\n      } else {\n        element.setAttribute(name, value === true ? '' : value);\n      }\n    });\n  });\n}\n\nfunction effect(_ref2) {\n  var state = _ref2.state;\n  var initialStyles = {\n    popper: {\n      position: state.options.strategy,\n      left: '0',\n      top: '0',\n      margin: '0'\n    },\n    arrow: {\n      position: 'absolute'\n    },\n    reference: {}\n  };\n  Object.assign(state.elements.popper.style, initialStyles.popper);\n  state.styles = initialStyles;\n\n  if (state.elements.arrow) {\n    Object.assign(state.elements.arrow.style, initialStyles.arrow);\n  }\n\n  return function () {\n    Object.keys(state.elements).forEach(function (name) {\n      var element = state.elements[name];\n      var attributes = state.attributes[name] || {};\n      var styleProperties = Object.keys(state.styles.hasOwnProperty(name) ? state.styles[name] : initialStyles[name]); // Set all values to an empty string to unset them\n\n      var style = styleProperties.reduce(function (style, property) {\n        style[property] = '';\n        return style;\n      }, {}); // arrow is optional + virtual elements\n\n      if (!isHTMLElement(element) || !getNodeName(element)) {\n        return;\n      }\n\n      Object.assign(element.style, style);\n      Object.keys(attributes).forEach(function (attribute) {\n        element.removeAttribute(attribute);\n      });\n    });\n  };\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'applyStyles',\n  enabled: true,\n  phase: 'write',\n  fn: applyStyles,\n  effect: effect,\n  requires: ['computeStyles']\n};","import { auto } from \"../enums.js\";\nexport default function getBasePlacement(placement) {\n  return placement.split('-')[0];\n}","export var max = Math.max;\nexport var min = Math.min;\nexport var round = Math.round;","export default function getUAString() {\n  var uaData = navigator.userAgentData;\n\n  if (uaData != null && uaData.brands && Array.isArray(uaData.brands)) {\n    return uaData.brands.map(function (item) {\n      return item.brand + \"/\" + item.version;\n    }).join(' ');\n  }\n\n  return navigator.userAgent;\n}","import getUAString from \"../utils/userAgent.js\";\nexport default function isLayoutViewport() {\n  return !/^((?!chrome|android).)*safari/i.test(getUAString());\n}","import { isElement, isHTMLElement } from \"./instanceOf.js\";\nimport { round } from \"../utils/math.js\";\nimport getWindow from \"./getWindow.js\";\nimport isLayoutViewport from \"./isLayoutViewport.js\";\nexport default function getBoundingClientRect(element, includeScale, isFixedStrategy) {\n  if (includeScale === void 0) {\n    includeScale = false;\n  }\n\n  if (isFixedStrategy === void 0) {\n    isFixedStrategy = false;\n  }\n\n  var clientRect = element.getBoundingClientRect();\n  var scaleX = 1;\n  var scaleY = 1;\n\n  if (includeScale && isHTMLElement(element)) {\n    scaleX = element.offsetWidth > 0 ? round(clientRect.width) / element.offsetWidth || 1 : 1;\n    scaleY = element.offsetHeight > 0 ? round(clientRect.height) / element.offsetHeight || 1 : 1;\n  }\n\n  var _ref = isElement(element) ? getWindow(element) : window,\n      visualViewport = _ref.visualViewport;\n\n  var addVisualOffsets = !isLayoutViewport() && isFixedStrategy;\n  var x = (clientRect.left + (addVisualOffsets && visualViewport ? visualViewport.offsetLeft : 0)) / scaleX;\n  var y = (clientRect.top + (addVisualOffsets && visualViewport ? visualViewport.offsetTop : 0)) / scaleY;\n  var width = clientRect.width / scaleX;\n  var height = clientRect.height / scaleY;\n  return {\n    width: width,\n    height: height,\n    top: y,\n    right: x + width,\n    bottom: y + height,\n    left: x,\n    x: x,\n    y: y\n  };\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\"; // Returns the layout rect of an element relative to its offsetParent. Layout\n// means it doesn't take into account transforms.\n\nexport default function getLayoutRect(element) {\n  var clientRect = getBoundingClientRect(element); // Use the clientRect sizes if it's not been transformed.\n  // Fixes https://github.com/popperjs/popper-core/issues/1223\n\n  var width = element.offsetWidth;\n  var height = element.offsetHeight;\n\n  if (Math.abs(clientRect.width - width) <= 1) {\n    width = clientRect.width;\n  }\n\n  if (Math.abs(clientRect.height - height) <= 1) {\n    height = clientRect.height;\n  }\n\n  return {\n    x: element.offsetLeft,\n    y: element.offsetTop,\n    width: width,\n    height: height\n  };\n}","import { isShadowRoot } from \"./instanceOf.js\";\nexport default function contains(parent, child) {\n  var rootNode = child.getRootNode && child.getRootNode(); // First, attempt with faster native method\n\n  if (parent.contains(child)) {\n    return true;\n  } // then fallback to custom implementation with Shadow DOM support\n  else if (rootNode && isShadowRoot(rootNode)) {\n      var next = child;\n\n      do {\n        if (next && parent.isSameNode(next)) {\n          return true;\n        } // $FlowFixMe[prop-missing]: need a better way to handle this...\n\n\n        next = next.parentNode || next.host;\n      } while (next);\n    } // Give up, the result is false\n\n\n  return false;\n}","import getWindow from \"./getWindow.js\";\nexport default function getComputedStyle(element) {\n  return getWindow(element).getComputedStyle(element);\n}","import getNodeName from \"./getNodeName.js\";\nexport default function isTableElement(element) {\n  return ['table', 'td', 'th'].indexOf(getNodeName(element)) >= 0;\n}","import { isElement } from \"./instanceOf.js\";\nexport default function getDocumentElement(element) {\n  // $FlowFixMe[incompatible-return]: assume body is always available\n  return ((isElement(element) ? element.ownerDocument : // $FlowFixMe[prop-missing]\n  element.document) || window.document).documentElement;\n}","import getNodeName from \"./getNodeName.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport { isShadowRoot } from \"./instanceOf.js\";\nexport default function getParentNode(element) {\n  if (getNodeName(element) === 'html') {\n    return element;\n  }\n\n  return (// this is a quicker (but less type safe) way to save quite some bytes from the bundle\n    // $FlowFixMe[incompatible-return]\n    // $FlowFixMe[prop-missing]\n    element.assignedSlot || // step into the shadow DOM of the parent of a slotted node\n    element.parentNode || ( // DOM Element detected\n    isShadowRoot(element) ? element.host : null) || // ShadowRoot detected\n    // $FlowFixMe[incompatible-call]: HTMLElement is a Node\n    getDocumentElement(element) // fallback\n\n  );\n}","import getWindow from \"./getWindow.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport { isHTMLElement, isShadowRoot } from \"./instanceOf.js\";\nimport isTableElement from \"./isTableElement.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport getUAString from \"../utils/userAgent.js\";\n\nfunction getTrueOffsetParent(element) {\n  if (!isHTMLElement(element) || // https://github.com/popperjs/popper-core/issues/837\n  getComputedStyle(element).position === 'fixed') {\n    return null;\n  }\n\n  return element.offsetParent;\n} // `.offsetParent` reports `null` for fixed elements, while absolute elements\n// return the containing block\n\n\nfunction getContainingBlock(element) {\n  var isFirefox = /firefox/i.test(getUAString());\n  var isIE = /Trident/i.test(getUAString());\n\n  if (isIE && isHTMLElement(element)) {\n    // In IE 9, 10 and 11 fixed elements containing block is always established by the viewport\n    var elementCss = getComputedStyle(element);\n\n    if (elementCss.position === 'fixed') {\n      return null;\n    }\n  }\n\n  var currentNode = getParentNode(element);\n\n  if (isShadowRoot(currentNode)) {\n    currentNode = currentNode.host;\n  }\n\n  while (isHTMLElement(currentNode) && ['html', 'body'].indexOf(getNodeName(currentNode)) < 0) {\n    var css = getComputedStyle(currentNode); // This is non-exhaustive but covers the most common CSS properties that\n    // create a containing block.\n    // https://developer.mozilla.org/en-US/docs/Web/CSS/Containing_block#identifying_the_containing_block\n\n    if (css.transform !== 'none' || css.perspective !== 'none' || css.contain === 'paint' || ['transform', 'perspective'].indexOf(css.willChange) !== -1 || isFirefox && css.willChange === 'filter' || isFirefox && css.filter && css.filter !== 'none') {\n      return currentNode;\n    } else {\n      currentNode = currentNode.parentNode;\n    }\n  }\n\n  return null;\n} // Gets the closest ancestor positioned element. Handles some edge cases,\n// such as table ancestors and cross browser bugs.\n\n\nexport default function getOffsetParent(element) {\n  var window = getWindow(element);\n  var offsetParent = getTrueOffsetParent(element);\n\n  while (offsetParent && isTableElement(offsetParent) && getComputedStyle(offsetParent).position === 'static') {\n    offsetParent = getTrueOffsetParent(offsetParent);\n  }\n\n  if (offsetParent && (getNodeName(offsetParent) === 'html' || getNodeName(offsetParent) === 'body' && getComputedStyle(offsetParent).position === 'static')) {\n    return window;\n  }\n\n  return offsetParent || getContainingBlock(element) || window;\n}","export default function getMainAxisFromPlacement(placement) {\n  return ['top', 'bottom'].indexOf(placement) >= 0 ? 'x' : 'y';\n}","import { max as mathMax, min as mathMin } from \"./math.js\";\nexport function within(min, value, max) {\n  return mathMax(min, mathMin(value, max));\n}\nexport function withinMaxClamp(min, value, max) {\n  var v = within(min, value, max);\n  return v > max ? max : v;\n}","import getFreshSideObject from \"./getFreshSideObject.js\";\nexport default function mergePaddingObject(paddingObject) {\n  return Object.assign({}, getFreshSideObject(), paddingObject);\n}","export default function getFreshSideObject() {\n  return {\n    top: 0,\n    right: 0,\n    bottom: 0,\n    left: 0\n  };\n}","export default function expandToHashMap(value, keys) {\n  return keys.reduce(function (hashMap, key) {\n    hashMap[key] = value;\n    return hashMap;\n  }, {});\n}","import getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getLayoutRect from \"../dom-utils/getLayoutRect.js\";\nimport contains from \"../dom-utils/contains.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport getMainAxisFromPlacement from \"../utils/getMainAxisFromPlacement.js\";\nimport { within } from \"../utils/within.js\";\nimport mergePaddingObject from \"../utils/mergePaddingObject.js\";\nimport expandToHashMap from \"../utils/expandToHashMap.js\";\nimport { left, right, basePlacements, top, bottom } from \"../enums.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar toPaddingObject = function toPaddingObject(padding, state) {\n  padding = typeof padding === 'function' ? padding(Object.assign({}, state.rects, {\n    placement: state.placement\n  })) : padding;\n  return mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));\n};\n\nfunction arrow(_ref) {\n  var _state$modifiersData$;\n\n  var state = _ref.state,\n      name = _ref.name,\n      options = _ref.options;\n  var arrowElement = state.elements.arrow;\n  var popperOffsets = state.modifiersData.popperOffsets;\n  var basePlacement = getBasePlacement(state.placement);\n  var axis = getMainAxisFromPlacement(basePlacement);\n  var isVertical = [left, right].indexOf(basePlacement) >= 0;\n  var len = isVertical ? 'height' : 'width';\n\n  if (!arrowElement || !popperOffsets) {\n    return;\n  }\n\n  var paddingObject = toPaddingObject(options.padding, state);\n  var arrowRect = getLayoutRect(arrowElement);\n  var minProp = axis === 'y' ? top : left;\n  var maxProp = axis === 'y' ? bottom : right;\n  var endDiff = state.rects.reference[len] + state.rects.reference[axis] - popperOffsets[axis] - state.rects.popper[len];\n  var startDiff = popperOffsets[axis] - state.rects.reference[axis];\n  var arrowOffsetParent = getOffsetParent(arrowElement);\n  var clientSize = arrowOffsetParent ? axis === 'y' ? arrowOffsetParent.clientHeight || 0 : arrowOffsetParent.clientWidth || 0 : 0;\n  var centerToReference = endDiff / 2 - startDiff / 2; // Make sure the arrow doesn't overflow the popper if the center point is\n  // outside of the popper bounds\n\n  var min = paddingObject[minProp];\n  var max = clientSize - arrowRect[len] - paddingObject[maxProp];\n  var center = clientSize / 2 - arrowRect[len] / 2 + centerToReference;\n  var offset = within(min, center, max); // Prevents breaking syntax highlighting...\n\n  var axisProp = axis;\n  state.modifiersData[name] = (_state$modifiersData$ = {}, _state$modifiersData$[axisProp] = offset, _state$modifiersData$.centerOffset = offset - center, _state$modifiersData$);\n}\n\nfunction effect(_ref2) {\n  var state = _ref2.state,\n      options = _ref2.options;\n  var _options$element = options.element,\n      arrowElement = _options$element === void 0 ? '[data-popper-arrow]' : _options$element;\n\n  if (arrowElement == null) {\n    return;\n  } // CSS selector\n\n\n  if (typeof arrowElement === 'string') {\n    arrowElement = state.elements.popper.querySelector(arrowElement);\n\n    if (!arrowElement) {\n      return;\n    }\n  }\n\n  if (!contains(state.elements.popper, arrowElement)) {\n    return;\n  }\n\n  state.elements.arrow = arrowElement;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'arrow',\n  enabled: true,\n  phase: 'main',\n  fn: arrow,\n  effect: effect,\n  requires: ['popperOffsets'],\n  requiresIfExists: ['preventOverflow']\n};","export default function getVariation(placement) {\n  return placement.split('-')[1];\n}","import { top, left, right, bottom, end } from \"../enums.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport getWindow from \"../dom-utils/getWindow.js\";\nimport getDocumentElement from \"../dom-utils/getDocumentElement.js\";\nimport getComputedStyle from \"../dom-utils/getComputedStyle.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getVariation from \"../utils/getVariation.js\";\nimport { round } from \"../utils/math.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar unsetSides = {\n  top: 'auto',\n  right: 'auto',\n  bottom: 'auto',\n  left: 'auto'\n}; // Round the offsets to the nearest suitable subpixel based on the DPR.\n// Zooming can change the DPR, but it seems to report a value that will\n// cleanly divide the values into the appropriate subpixels.\n\nfunction roundOffsetsByDPR(_ref, win) {\n  var x = _ref.x,\n      y = _ref.y;\n  var dpr = win.devicePixelRatio || 1;\n  return {\n    x: round(x * dpr) / dpr || 0,\n    y: round(y * dpr) / dpr || 0\n  };\n}\n\nexport function mapToStyles(_ref2) {\n  var _Object$assign2;\n\n  var popper = _ref2.popper,\n      popperRect = _ref2.popperRect,\n      placement = _ref2.placement,\n      variation = _ref2.variation,\n      offsets = _ref2.offsets,\n      position = _ref2.position,\n      gpuAcceleration = _ref2.gpuAcceleration,\n      adaptive = _ref2.adaptive,\n      roundOffsets = _ref2.roundOffsets,\n      isFixed = _ref2.isFixed;\n  var _offsets$x = offsets.x,\n      x = _offsets$x === void 0 ? 0 : _offsets$x,\n      _offsets$y = offsets.y,\n      y = _offsets$y === void 0 ? 0 : _offsets$y;\n\n  var _ref3 = typeof roundOffsets === 'function' ? roundOffsets({\n    x: x,\n    y: y\n  }) : {\n    x: x,\n    y: y\n  };\n\n  x = _ref3.x;\n  y = _ref3.y;\n  var hasX = offsets.hasOwnProperty('x');\n  var hasY = offsets.hasOwnProperty('y');\n  var sideX = left;\n  var sideY = top;\n  var win = window;\n\n  if (adaptive) {\n    var offsetParent = getOffsetParent(popper);\n    var heightProp = 'clientHeight';\n    var widthProp = 'clientWidth';\n\n    if (offsetParent === getWindow(popper)) {\n      offsetParent = getDocumentElement(popper);\n\n      if (getComputedStyle(offsetParent).position !== 'static' && position === 'absolute') {\n        heightProp = 'scrollHeight';\n        widthProp = 'scrollWidth';\n      }\n    } // $FlowFixMe[incompatible-cast]: force type refinement, we compare offsetParent with window above, but Flow doesn't detect it\n\n\n    offsetParent = offsetParent;\n\n    if (placement === top || (placement === left || placement === right) && variation === end) {\n      sideY = bottom;\n      var offsetY = isFixed && offsetParent === win && win.visualViewport ? win.visualViewport.height : // $FlowFixMe[prop-missing]\n      offsetParent[heightProp];\n      y -= offsetY - popperRect.height;\n      y *= gpuAcceleration ? 1 : -1;\n    }\n\n    if (placement === left || (placement === top || placement === bottom) && variation === end) {\n      sideX = right;\n      var offsetX = isFixed && offsetParent === win && win.visualViewport ? win.visualViewport.width : // $FlowFixMe[prop-missing]\n      offsetParent[widthProp];\n      x -= offsetX - popperRect.width;\n      x *= gpuAcceleration ? 1 : -1;\n    }\n  }\n\n  var commonStyles = Object.assign({\n    position: position\n  }, adaptive && unsetSides);\n\n  var _ref4 = roundOffsets === true ? roundOffsetsByDPR({\n    x: x,\n    y: y\n  }, getWindow(popper)) : {\n    x: x,\n    y: y\n  };\n\n  x = _ref4.x;\n  y = _ref4.y;\n\n  if (gpuAcceleration) {\n    var _Object$assign;\n\n    return Object.assign({}, commonStyles, (_Object$assign = {}, _Object$assign[sideY] = hasY ? '0' : '', _Object$assign[sideX] = hasX ? '0' : '', _Object$assign.transform = (win.devicePixelRatio || 1) <= 1 ? \"translate(\" + x + \"px, \" + y + \"px)\" : \"translate3d(\" + x + \"px, \" + y + \"px, 0)\", _Object$assign));\n  }\n\n  return Object.assign({}, commonStyles, (_Object$assign2 = {}, _Object$assign2[sideY] = hasY ? y + \"px\" : '', _Object$assign2[sideX] = hasX ? x + \"px\" : '', _Object$assign2.transform = '', _Object$assign2));\n}\n\nfunction computeStyles(_ref5) {\n  var state = _ref5.state,\n      options = _ref5.options;\n  var _options$gpuAccelerat = options.gpuAcceleration,\n      gpuAcceleration = _options$gpuAccelerat === void 0 ? true : _options$gpuAccelerat,\n      _options$adaptive = options.adaptive,\n      adaptive = _options$adaptive === void 0 ? true : _options$adaptive,\n      _options$roundOffsets = options.roundOffsets,\n      roundOffsets = _options$roundOffsets === void 0 ? true : _options$roundOffsets;\n  var commonStyles = {\n    placement: getBasePlacement(state.placement),\n    variation: getVariation(state.placement),\n    popper: state.elements.popper,\n    popperRect: state.rects.popper,\n    gpuAcceleration: gpuAcceleration,\n    isFixed: state.options.strategy === 'fixed'\n  };\n\n  if (state.modifiersData.popperOffsets != null) {\n    state.styles.popper = Object.assign({}, state.styles.popper, mapToStyles(Object.assign({}, commonStyles, {\n      offsets: state.modifiersData.popperOffsets,\n      position: state.options.strategy,\n      adaptive: adaptive,\n      roundOffsets: roundOffsets\n    })));\n  }\n\n  if (state.modifiersData.arrow != null) {\n    state.styles.arrow = Object.assign({}, state.styles.arrow, mapToStyles(Object.assign({}, commonStyles, {\n      offsets: state.modifiersData.arrow,\n      position: 'absolute',\n      adaptive: false,\n      roundOffsets: roundOffsets\n    })));\n  }\n\n  state.attributes.popper = Object.assign({}, state.attributes.popper, {\n    'data-popper-placement': state.placement\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'computeStyles',\n  enabled: true,\n  phase: 'beforeWrite',\n  fn: computeStyles,\n  data: {}\n};","import getWindow from \"../dom-utils/getWindow.js\"; // eslint-disable-next-line import/no-unused-modules\n\nvar passive = {\n  passive: true\n};\n\nfunction effect(_ref) {\n  var state = _ref.state,\n      instance = _ref.instance,\n      options = _ref.options;\n  var _options$scroll = options.scroll,\n      scroll = _options$scroll === void 0 ? true : _options$scroll,\n      _options$resize = options.resize,\n      resize = _options$resize === void 0 ? true : _options$resize;\n  var window = getWindow(state.elements.popper);\n  var scrollParents = [].concat(state.scrollParents.reference, state.scrollParents.popper);\n\n  if (scroll) {\n    scrollParents.forEach(function (scrollParent) {\n      scrollParent.addEventListener('scroll', instance.update, passive);\n    });\n  }\n\n  if (resize) {\n    window.addEventListener('resize', instance.update, passive);\n  }\n\n  return function () {\n    if (scroll) {\n      scrollParents.forEach(function (scrollParent) {\n        scrollParent.removeEventListener('scroll', instance.update, passive);\n      });\n    }\n\n    if (resize) {\n      window.removeEventListener('resize', instance.update, passive);\n    }\n  };\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'eventListeners',\n  enabled: true,\n  phase: 'write',\n  fn: function fn() {},\n  effect: effect,\n  data: {}\n};","var hash = {\n  left: 'right',\n  right: 'left',\n  bottom: 'top',\n  top: 'bottom'\n};\nexport default function getOppositePlacement(placement) {\n  return placement.replace(/left|right|bottom|top/g, function (matched) {\n    return hash[matched];\n  });\n}","var hash = {\n  start: 'end',\n  end: 'start'\n};\nexport default function getOppositeVariationPlacement(placement) {\n  return placement.replace(/start|end/g, function (matched) {\n    return hash[matched];\n  });\n}","import getWindow from \"./getWindow.js\";\nexport default function getWindowScroll(node) {\n  var win = getWindow(node);\n  var scrollLeft = win.pageXOffset;\n  var scrollTop = win.pageYOffset;\n  return {\n    scrollLeft: scrollLeft,\n    scrollTop: scrollTop\n  };\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getWindowScroll from \"./getWindowScroll.js\";\nexport default function getWindowScrollBarX(element) {\n  // If <html> has a CSS width greater than the viewport, then this will be\n  // incorrect for RTL.\n  // Popper 1 is broken in this case and never had a bug report so let's assume\n  // it's not an issue. I don't think anyone ever specifies width on <html>\n  // anyway.\n  // Browsers where the left scrollbar doesn't cause an issue report `0` for\n  // this (e.g. Edge 2019, IE11, Safari)\n  return getBoundingClientRect(getDocumentElement(element)).left + getWindowScroll(element).scrollLeft;\n}","import getComputedStyle from \"./getComputedStyle.js\";\nexport default function isScrollParent(element) {\n  // Firefox wants us to check `-x` and `-y` variations as well\n  var _getComputedStyle = getComputedStyle(element),\n      overflow = _getComputedStyle.overflow,\n      overflowX = _getComputedStyle.overflowX,\n      overflowY = _getComputedStyle.overflowY;\n\n  return /auto|scroll|overlay|hidden/.test(overflow + overflowY + overflowX);\n}","import getParentNode from \"./getParentNode.js\";\nimport isScrollParent from \"./isScrollParent.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nexport default function getScrollParent(node) {\n  if (['html', 'body', '#document'].indexOf(getNodeName(node)) >= 0) {\n    // $FlowFixMe[incompatible-return]: assume body is always available\n    return node.ownerDocument.body;\n  }\n\n  if (isHTMLElement(node) && isScrollParent(node)) {\n    return node;\n  }\n\n  return getScrollParent(getParentNode(node));\n}","import getScrollParent from \"./getScrollParent.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport getWindow from \"./getWindow.js\";\nimport isScrollParent from \"./isScrollParent.js\";\n/*\ngiven a DOM element, return the list of all scroll parents, up the list of ancesors\nuntil we get to the top window object. This list is what we attach scroll listeners\nto, because if any of these parent elements scroll, we'll need to re-calculate the\nreference element's position.\n*/\n\nexport default function listScrollParents(element, list) {\n  var _element$ownerDocumen;\n\n  if (list === void 0) {\n    list = [];\n  }\n\n  var scrollParent = getScrollParent(element);\n  var isBody = scrollParent === ((_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body);\n  var win = getWindow(scrollParent);\n  var target = isBody ? [win].concat(win.visualViewport || [], isScrollParent(scrollParent) ? scrollParent : []) : scrollParent;\n  var updatedList = list.concat(target);\n  return isBody ? updatedList : // $FlowFixMe[incompatible-call]: isBody tells us target will be an HTMLElement here\n  updatedList.concat(listScrollParents(getParentNode(target)));\n}","export default function rectToClientRect(rect) {\n  return Object.assign({}, rect, {\n    left: rect.x,\n    top: rect.y,\n    right: rect.x + rect.width,\n    bottom: rect.y + rect.height\n  });\n}","import { viewport } from \"../enums.js\";\nimport getViewportRect from \"./getViewportRect.js\";\nimport getDocumentRect from \"./getDocumentRect.js\";\nimport listScrollParents from \"./listScrollParents.js\";\nimport getOffsetParent from \"./getOffsetParent.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport { isElement, isHTMLElement } from \"./instanceOf.js\";\nimport getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getParentNode from \"./getParentNode.js\";\nimport contains from \"./contains.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport rectToClientRect from \"../utils/rectToClientRect.js\";\nimport { max, min } from \"../utils/math.js\";\n\nfunction getInnerBoundingClientRect(element, strategy) {\n  var rect = getBoundingClientRect(element, false, strategy === 'fixed');\n  rect.top = rect.top + element.clientTop;\n  rect.left = rect.left + element.clientLeft;\n  rect.bottom = rect.top + element.clientHeight;\n  rect.right = rect.left + element.clientWidth;\n  rect.width = element.clientWidth;\n  rect.height = element.clientHeight;\n  rect.x = rect.left;\n  rect.y = rect.top;\n  return rect;\n}\n\nfunction getClientRectFromMixedType(element, clippingParent, strategy) {\n  return clippingParent === viewport ? rectToClientRect(getViewportRect(element, strategy)) : isElement(clippingParent) ? getInnerBoundingClientRect(clippingParent, strategy) : rectToClientRect(getDocumentRect(getDocumentElement(element)));\n} // A \"clipping parent\" is an overflowable container with the characteristic of\n// clipping (or hiding) overflowing elements with a position different from\n// `initial`\n\n\nfunction getClippingParents(element) {\n  var clippingParents = listScrollParents(getParentNode(element));\n  var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;\n  var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;\n\n  if (!isElement(clipperElement)) {\n    return [];\n  } // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414\n\n\n  return clippingParents.filter(function (clippingParent) {\n    return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';\n  });\n} // Gets the maximum area that the element is visible in due to any number of\n// clipping parents\n\n\nexport default function getClippingRect(element, boundary, rootBoundary, strategy) {\n  var mainClippingParents = boundary === 'clippingParents' ? getClippingParents(element) : [].concat(boundary);\n  var clippingParents = [].concat(mainClippingParents, [rootBoundary]);\n  var firstClippingParent = clippingParents[0];\n  var clippingRect = clippingParents.reduce(function (accRect, clippingParent) {\n    var rect = getClientRectFromMixedType(element, clippingParent, strategy);\n    accRect.top = max(rect.top, accRect.top);\n    accRect.right = min(rect.right, accRect.right);\n    accRect.bottom = min(rect.bottom, accRect.bottom);\n    accRect.left = max(rect.left, accRect.left);\n    return accRect;\n  }, getClientRectFromMixedType(element, firstClippingParent, strategy));\n  clippingRect.width = clippingRect.right - clippingRect.left;\n  clippingRect.height = clippingRect.bottom - clippingRect.top;\n  clippingRect.x = clippingRect.left;\n  clippingRect.y = clippingRect.top;\n  return clippingRect;\n}","import getWindow from \"./getWindow.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport isLayoutViewport from \"./isLayoutViewport.js\";\nexport default function getViewportRect(element, strategy) {\n  var win = getWindow(element);\n  var html = getDocumentElement(element);\n  var visualViewport = win.visualViewport;\n  var width = html.clientWidth;\n  var height = html.clientHeight;\n  var x = 0;\n  var y = 0;\n\n  if (visualViewport) {\n    width = visualViewport.width;\n    height = visualViewport.height;\n    var layoutViewport = isLayoutViewport();\n\n    if (layoutViewport || !layoutViewport && strategy === 'fixed') {\n      x = visualViewport.offsetLeft;\n      y = visualViewport.offsetTop;\n    }\n  }\n\n  return {\n    width: width,\n    height: height,\n    x: x + getWindowScrollBarX(element),\n    y: y\n  };\n}","import getDocumentElement from \"./getDocumentElement.js\";\nimport getComputedStyle from \"./getComputedStyle.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport getWindowScroll from \"./getWindowScroll.js\";\nimport { max } from \"../utils/math.js\"; // Gets the entire size of the scrollable document area, even extending outside\n// of the `<html>` and `<body>` rect bounds if horizontally scrollable\n\nexport default function getDocumentRect(element) {\n  var _element$ownerDocumen;\n\n  var html = getDocumentElement(element);\n  var winScroll = getWindowScroll(element);\n  var body = (_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body;\n  var width = max(html.scrollWidth, html.clientWidth, body ? body.scrollWidth : 0, body ? body.clientWidth : 0);\n  var height = max(html.scrollHeight, html.clientHeight, body ? body.scrollHeight : 0, body ? body.clientHeight : 0);\n  var x = -winScroll.scrollLeft + getWindowScrollBarX(element);\n  var y = -winScroll.scrollTop;\n\n  if (getComputedStyle(body || html).direction === 'rtl') {\n    x += max(html.clientWidth, body ? body.clientWidth : 0) - width;\n  }\n\n  return {\n    width: width,\n    height: height,\n    x: x,\n    y: y\n  };\n}","import getBasePlacement from \"./getBasePlacement.js\";\nimport getVariation from \"./getVariation.js\";\nimport getMainAxisFromPlacement from \"./getMainAxisFromPlacement.js\";\nimport { top, right, bottom, left, start, end } from \"../enums.js\";\nexport default function computeOffsets(_ref) {\n  var reference = _ref.reference,\n      element = _ref.element,\n      placement = _ref.placement;\n  var basePlacement = placement ? getBasePlacement(placement) : null;\n  var variation = placement ? getVariation(placement) : null;\n  var commonX = reference.x + reference.width / 2 - element.width / 2;\n  var commonY = reference.y + reference.height / 2 - element.height / 2;\n  var offsets;\n\n  switch (basePlacement) {\n    case top:\n      offsets = {\n        x: commonX,\n        y: reference.y - element.height\n      };\n      break;\n\n    case bottom:\n      offsets = {\n        x: commonX,\n        y: reference.y + reference.height\n      };\n      break;\n\n    case right:\n      offsets = {\n        x: reference.x + reference.width,\n        y: commonY\n      };\n      break;\n\n    case left:\n      offsets = {\n        x: reference.x - element.width,\n        y: commonY\n      };\n      break;\n\n    default:\n      offsets = {\n        x: reference.x,\n        y: reference.y\n      };\n  }\n\n  var mainAxis = basePlacement ? getMainAxisFromPlacement(basePlacement) : null;\n\n  if (mainAxis != null) {\n    var len = mainAxis === 'y' ? 'height' : 'width';\n\n    switch (variation) {\n      case start:\n        offsets[mainAxis] = offsets[mainAxis] - (reference[len] / 2 - element[len] / 2);\n        break;\n\n      case end:\n        offsets[mainAxis] = offsets[mainAxis] + (reference[len] / 2 - element[len] / 2);\n        break;\n\n      default:\n    }\n  }\n\n  return offsets;\n}","import getClippingRect from \"../dom-utils/getClippingRect.js\";\nimport getDocumentElement from \"../dom-utils/getDocumentElement.js\";\nimport getBoundingClientRect from \"../dom-utils/getBoundingClientRect.js\";\nimport computeOffsets from \"./computeOffsets.js\";\nimport rectToClientRect from \"./rectToClientRect.js\";\nimport { clippingParents, reference, popper, bottom, top, right, basePlacements, viewport } from \"../enums.js\";\nimport { isElement } from \"../dom-utils/instanceOf.js\";\nimport mergePaddingObject from \"./mergePaddingObject.js\";\nimport expandToHashMap from \"./expandToHashMap.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport default function detectOverflow(state, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  var _options = options,\n      _options$placement = _options.placement,\n      placement = _options$placement === void 0 ? state.placement : _options$placement,\n      _options$strategy = _options.strategy,\n      strategy = _options$strategy === void 0 ? state.strategy : _options$strategy,\n      _options$boundary = _options.boundary,\n      boundary = _options$boundary === void 0 ? clippingParents : _options$boundary,\n      _options$rootBoundary = _options.rootBoundary,\n      rootBoundary = _options$rootBoundary === void 0 ? viewport : _options$rootBoundary,\n      _options$elementConte = _options.elementContext,\n      elementContext = _options$elementConte === void 0 ? popper : _options$elementConte,\n      _options$altBoundary = _options.altBoundary,\n      altBoundary = _options$altBoundary === void 0 ? false : _options$altBoundary,\n      _options$padding = _options.padding,\n      padding = _options$padding === void 0 ? 0 : _options$padding;\n  var paddingObject = mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));\n  var altContext = elementContext === popper ? reference : popper;\n  var popperRect = state.rects.popper;\n  var element = state.elements[altBoundary ? altContext : elementContext];\n  var clippingClientRect = getClippingRect(isElement(element) ? element : element.contextElement || getDocumentElement(state.elements.popper), boundary, rootBoundary, strategy);\n  var referenceClientRect = getBoundingClientRect(state.elements.reference);\n  var popperOffsets = computeOffsets({\n    reference: referenceClientRect,\n    element: popperRect,\n    strategy: 'absolute',\n    placement: placement\n  });\n  var popperClientRect = rectToClientRect(Object.assign({}, popperRect, popperOffsets));\n  var elementClientRect = elementContext === popper ? popperClientRect : referenceClientRect; // positive = overflowing the clipping rect\n  // 0 or negative = within the clipping rect\n\n  var overflowOffsets = {\n    top: clippingClientRect.top - elementClientRect.top + paddingObject.top,\n    bottom: elementClientRect.bottom - clippingClientRect.bottom + paddingObject.bottom,\n    left: clippingClientRect.left - elementClientRect.left + paddingObject.left,\n    right: elementClientRect.right - clippingClientRect.right + paddingObject.right\n  };\n  var offsetData = state.modifiersData.offset; // Offsets can be applied only to the popper element\n\n  if (elementContext === popper && offsetData) {\n    var offset = offsetData[placement];\n    Object.keys(overflowOffsets).forEach(function (key) {\n      var multiply = [right, bottom].indexOf(key) >= 0 ? 1 : -1;\n      var axis = [top, bottom].indexOf(key) >= 0 ? 'y' : 'x';\n      overflowOffsets[key] += offset[axis] * multiply;\n    });\n  }\n\n  return overflowOffsets;\n}","import getOppositePlacement from \"../utils/getOppositePlacement.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getOppositeVariationPlacement from \"../utils/getOppositeVariationPlacement.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\nimport computeAutoPlacement from \"../utils/computeAutoPlacement.js\";\nimport { bottom, top, start, right, left, auto } from \"../enums.js\";\nimport getVariation from \"../utils/getVariation.js\"; // eslint-disable-next-line import/no-unused-modules\n\nfunction getExpandedFallbackPlacements(placement) {\n  if (getBasePlacement(placement) === auto) {\n    return [];\n  }\n\n  var oppositePlacement = getOppositePlacement(placement);\n  return [getOppositeVariationPlacement(placement), oppositePlacement, getOppositeVariationPlacement(oppositePlacement)];\n}\n\nfunction flip(_ref) {\n  var state = _ref.state,\n      options = _ref.options,\n      name = _ref.name;\n\n  if (state.modifiersData[name]._skip) {\n    return;\n  }\n\n  var _options$mainAxis = options.mainAxis,\n      checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,\n      _options$altAxis = options.altAxis,\n      checkAltAxis = _options$altAxis === void 0 ? true : _options$altAxis,\n      specifiedFallbackPlacements = options.fallbackPlacements,\n      padding = options.padding,\n      boundary = options.boundary,\n      rootBoundary = options.rootBoundary,\n      altBoundary = options.altBoundary,\n      _options$flipVariatio = options.flipVariations,\n      flipVariations = _options$flipVariatio === void 0 ? true : _options$flipVariatio,\n      allowedAutoPlacements = options.allowedAutoPlacements;\n  var preferredPlacement = state.options.placement;\n  var basePlacement = getBasePlacement(preferredPlacement);\n  var isBasePlacement = basePlacement === preferredPlacement;\n  var fallbackPlacements = specifiedFallbackPlacements || (isBasePlacement || !flipVariations ? [getOppositePlacement(preferredPlacement)] : getExpandedFallbackPlacements(preferredPlacement));\n  var placements = [preferredPlacement].concat(fallbackPlacements).reduce(function (acc, placement) {\n    return acc.concat(getBasePlacement(placement) === auto ? computeAutoPlacement(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      padding: padding,\n      flipVariations: flipVariations,\n      allowedAutoPlacements: allowedAutoPlacements\n    }) : placement);\n  }, []);\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var checksMap = new Map();\n  var makeFallbackChecks = true;\n  var firstFittingPlacement = placements[0];\n\n  for (var i = 0; i < placements.length; i++) {\n    var placement = placements[i];\n\n    var _basePlacement = getBasePlacement(placement);\n\n    var isStartVariation = getVariation(placement) === start;\n    var isVertical = [top, bottom].indexOf(_basePlacement) >= 0;\n    var len = isVertical ? 'width' : 'height';\n    var overflow = detectOverflow(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      altBoundary: altBoundary,\n      padding: padding\n    });\n    var mainVariationSide = isVertical ? isStartVariation ? right : left : isStartVariation ? bottom : top;\n\n    if (referenceRect[len] > popperRect[len]) {\n      mainVariationSide = getOppositePlacement(mainVariationSide);\n    }\n\n    var altVariationSide = getOppositePlacement(mainVariationSide);\n    var checks = [];\n\n    if (checkMainAxis) {\n      checks.push(overflow[_basePlacement] <= 0);\n    }\n\n    if (checkAltAxis) {\n      checks.push(overflow[mainVariationSide] <= 0, overflow[altVariationSide] <= 0);\n    }\n\n    if (checks.every(function (check) {\n      return check;\n    })) {\n      firstFittingPlacement = placement;\n      makeFallbackChecks = false;\n      break;\n    }\n\n    checksMap.set(placement, checks);\n  }\n\n  if (makeFallbackChecks) {\n    // `2` may be desired in some cases – research later\n    var numberOfChecks = flipVariations ? 3 : 1;\n\n    var _loop = function _loop(_i) {\n      var fittingPlacement = placements.find(function (placement) {\n        var checks = checksMap.get(placement);\n\n        if (checks) {\n          return checks.slice(0, _i).every(function (check) {\n            return check;\n          });\n        }\n      });\n\n      if (fittingPlacement) {\n        firstFittingPlacement = fittingPlacement;\n        return \"break\";\n      }\n    };\n\n    for (var _i = numberOfChecks; _i > 0; _i--) {\n      var _ret = _loop(_i);\n\n      if (_ret === \"break\") break;\n    }\n  }\n\n  if (state.placement !== firstFittingPlacement) {\n    state.modifiersData[name]._skip = true;\n    state.placement = firstFittingPlacement;\n    state.reset = true;\n  }\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'flip',\n  enabled: true,\n  phase: 'main',\n  fn: flip,\n  requiresIfExists: ['offset'],\n  data: {\n    _skip: false\n  }\n};","import getVariation from \"./getVariation.js\";\nimport { variationPlacements, basePlacements, placements as allPlacements } from \"../enums.js\";\nimport detectOverflow from \"./detectOverflow.js\";\nimport getBasePlacement from \"./getBasePlacement.js\";\nexport default function computeAutoPlacement(state, options) {\n  if (options === void 0) {\n    options = {};\n  }\n\n  var _options = options,\n      placement = _options.placement,\n      boundary = _options.boundary,\n      rootBoundary = _options.rootBoundary,\n      padding = _options.padding,\n      flipVariations = _options.flipVariations,\n      _options$allowedAutoP = _options.allowedAutoPlacements,\n      allowedAutoPlacements = _options$allowedAutoP === void 0 ? allPlacements : _options$allowedAutoP;\n  var variation = getVariation(placement);\n  var placements = variation ? flipVariations ? variationPlacements : variationPlacements.filter(function (placement) {\n    return getVariation(placement) === variation;\n  }) : basePlacements;\n  var allowedPlacements = placements.filter(function (placement) {\n    return allowedAutoPlacements.indexOf(placement) >= 0;\n  });\n\n  if (allowedPlacements.length === 0) {\n    allowedPlacements = placements;\n  } // $FlowFixMe[incompatible-type]: Flow seems to have problems with two array unions...\n\n\n  var overflows = allowedPlacements.reduce(function (acc, placement) {\n    acc[placement] = detectOverflow(state, {\n      placement: placement,\n      boundary: boundary,\n      rootBoundary: rootBoundary,\n      padding: padding\n    })[getBasePlacement(placement)];\n    return acc;\n  }, {});\n  return Object.keys(overflows).sort(function (a, b) {\n    return overflows[a] - overflows[b];\n  });\n}","import { top, bottom, left, right } from \"../enums.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\n\nfunction getSideOffsets(overflow, rect, preventedOffsets) {\n  if (preventedOffsets === void 0) {\n    preventedOffsets = {\n      x: 0,\n      y: 0\n    };\n  }\n\n  return {\n    top: overflow.top - rect.height - preventedOffsets.y,\n    right: overflow.right - rect.width + preventedOffsets.x,\n    bottom: overflow.bottom - rect.height + preventedOffsets.y,\n    left: overflow.left - rect.width - preventedOffsets.x\n  };\n}\n\nfunction isAnySideFullyClipped(overflow) {\n  return [top, right, bottom, left].some(function (side) {\n    return overflow[side] >= 0;\n  });\n}\n\nfunction hide(_ref) {\n  var state = _ref.state,\n      name = _ref.name;\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var preventedOffsets = state.modifiersData.preventOverflow;\n  var referenceOverflow = detectOverflow(state, {\n    elementContext: 'reference'\n  });\n  var popperAltOverflow = detectOverflow(state, {\n    altBoundary: true\n  });\n  var referenceClippingOffsets = getSideOffsets(referenceOverflow, referenceRect);\n  var popperEscapeOffsets = getSideOffsets(popperAltOverflow, popperRect, preventedOffsets);\n  var isReferenceHidden = isAnySideFullyClipped(referenceClippingOffsets);\n  var hasPopperEscaped = isAnySideFullyClipped(popperEscapeOffsets);\n  state.modifiersData[name] = {\n    referenceClippingOffsets: referenceClippingOffsets,\n    popperEscapeOffsets: popperEscapeOffsets,\n    isReferenceHidden: isReferenceHidden,\n    hasPopperEscaped: hasPopperEscaped\n  };\n  state.attributes.popper = Object.assign({}, state.attributes.popper, {\n    'data-popper-reference-hidden': isReferenceHidden,\n    'data-popper-escaped': hasPopperEscaped\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'hide',\n  enabled: true,\n  phase: 'main',\n  requiresIfExists: ['preventOverflow'],\n  fn: hide\n};","import getBasePlacement from \"../utils/getBasePlacement.js\";\nimport { top, left, right, placements } from \"../enums.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport function distanceAndSkiddingToXY(placement, rects, offset) {\n  var basePlacement = getBasePlacement(placement);\n  var invertDistance = [left, top].indexOf(basePlacement) >= 0 ? -1 : 1;\n\n  var _ref = typeof offset === 'function' ? offset(Object.assign({}, rects, {\n    placement: placement\n  })) : offset,\n      skidding = _ref[0],\n      distance = _ref[1];\n\n  skidding = skidding || 0;\n  distance = (distance || 0) * invertDistance;\n  return [left, right].indexOf(basePlacement) >= 0 ? {\n    x: distance,\n    y: skidding\n  } : {\n    x: skidding,\n    y: distance\n  };\n}\n\nfunction offset(_ref2) {\n  var state = _ref2.state,\n      options = _ref2.options,\n      name = _ref2.name;\n  var _options$offset = options.offset,\n      offset = _options$offset === void 0 ? [0, 0] : _options$offset;\n  var data = placements.reduce(function (acc, placement) {\n    acc[placement] = distanceAndSkiddingToXY(placement, state.rects, offset);\n    return acc;\n  }, {});\n  var _data$state$placement = data[state.placement],\n      x = _data$state$placement.x,\n      y = _data$state$placement.y;\n\n  if (state.modifiersData.popperOffsets != null) {\n    state.modifiersData.popperOffsets.x += x;\n    state.modifiersData.popperOffsets.y += y;\n  }\n\n  state.modifiersData[name] = data;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'offset',\n  enabled: true,\n  phase: 'main',\n  requires: ['popperOffsets'],\n  fn: offset\n};","import computeOffsets from \"../utils/computeOffsets.js\";\n\nfunction popperOffsets(_ref) {\n  var state = _ref.state,\n      name = _ref.name;\n  // Offsets are the actual position the popper needs to have to be\n  // properly positioned near its reference element\n  // This is the most basic placement, and will be adjusted by\n  // the modifiers in the next step\n  state.modifiersData[name] = computeOffsets({\n    reference: state.rects.reference,\n    element: state.rects.popper,\n    strategy: 'absolute',\n    placement: state.placement\n  });\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'popperOffsets',\n  enabled: true,\n  phase: 'read',\n  fn: popperOffsets,\n  data: {}\n};","import { top, left, right, bottom, start } from \"../enums.js\";\nimport getBasePlacement from \"../utils/getBasePlacement.js\";\nimport getMainAxisFromPlacement from \"../utils/getMainAxisFromPlacement.js\";\nimport getAltAxis from \"../utils/getAltAxis.js\";\nimport { within, withinMaxClamp } from \"../utils/within.js\";\nimport getLayoutRect from \"../dom-utils/getLayoutRect.js\";\nimport getOffsetParent from \"../dom-utils/getOffsetParent.js\";\nimport detectOverflow from \"../utils/detectOverflow.js\";\nimport getVariation from \"../utils/getVariation.js\";\nimport getFreshSideObject from \"../utils/getFreshSideObject.js\";\nimport { min as mathMin, max as mathMax } from \"../utils/math.js\";\n\nfunction preventOverflow(_ref) {\n  var state = _ref.state,\n      options = _ref.options,\n      name = _ref.name;\n  var _options$mainAxis = options.mainAxis,\n      checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,\n      _options$altAxis = options.altAxis,\n      checkAltAxis = _options$altAxis === void 0 ? false : _options$altAxis,\n      boundary = options.boundary,\n      rootBoundary = options.rootBoundary,\n      altBoundary = options.altBoundary,\n      padding = options.padding,\n      _options$tether = options.tether,\n      tether = _options$tether === void 0 ? true : _options$tether,\n      _options$tetherOffset = options.tetherOffset,\n      tetherOffset = _options$tetherOffset === void 0 ? 0 : _options$tetherOffset;\n  var overflow = detectOverflow(state, {\n    boundary: boundary,\n    rootBoundary: rootBoundary,\n    padding: padding,\n    altBoundary: altBoundary\n  });\n  var basePlacement = getBasePlacement(state.placement);\n  var variation = getVariation(state.placement);\n  var isBasePlacement = !variation;\n  var mainAxis = getMainAxisFromPlacement(basePlacement);\n  var altAxis = getAltAxis(mainAxis);\n  var popperOffsets = state.modifiersData.popperOffsets;\n  var referenceRect = state.rects.reference;\n  var popperRect = state.rects.popper;\n  var tetherOffsetValue = typeof tetherOffset === 'function' ? tetherOffset(Object.assign({}, state.rects, {\n    placement: state.placement\n  })) : tetherOffset;\n  var normalizedTetherOffsetValue = typeof tetherOffsetValue === 'number' ? {\n    mainAxis: tetherOffsetValue,\n    altAxis: tetherOffsetValue\n  } : Object.assign({\n    mainAxis: 0,\n    altAxis: 0\n  }, tetherOffsetValue);\n  var offsetModifierState = state.modifiersData.offset ? state.modifiersData.offset[state.placement] : null;\n  var data = {\n    x: 0,\n    y: 0\n  };\n\n  if (!popperOffsets) {\n    return;\n  }\n\n  if (checkMainAxis) {\n    var _offsetModifierState$;\n\n    var mainSide = mainAxis === 'y' ? top : left;\n    var altSide = mainAxis === 'y' ? bottom : right;\n    var len = mainAxis === 'y' ? 'height' : 'width';\n    var offset = popperOffsets[mainAxis];\n    var min = offset + overflow[mainSide];\n    var max = offset - overflow[altSide];\n    var additive = tether ? -popperRect[len] / 2 : 0;\n    var minLen = variation === start ? referenceRect[len] : popperRect[len];\n    var maxLen = variation === start ? -popperRect[len] : -referenceRect[len]; // We need to include the arrow in the calculation so the arrow doesn't go\n    // outside the reference bounds\n\n    var arrowElement = state.elements.arrow;\n    var arrowRect = tether && arrowElement ? getLayoutRect(arrowElement) : {\n      width: 0,\n      height: 0\n    };\n    var arrowPaddingObject = state.modifiersData['arrow#persistent'] ? state.modifiersData['arrow#persistent'].padding : getFreshSideObject();\n    var arrowPaddingMin = arrowPaddingObject[mainSide];\n    var arrowPaddingMax = arrowPaddingObject[altSide]; // If the reference length is smaller than the arrow length, we don't want\n    // to include its full size in the calculation. If the reference is small\n    // and near the edge of a boundary, the popper can overflow even if the\n    // reference is not overflowing as well (e.g. virtual elements with no\n    // width or height)\n\n    var arrowLen = within(0, referenceRect[len], arrowRect[len]);\n    var minOffset = isBasePlacement ? referenceRect[len] / 2 - additive - arrowLen - arrowPaddingMin - normalizedTetherOffsetValue.mainAxis : minLen - arrowLen - arrowPaddingMin - normalizedTetherOffsetValue.mainAxis;\n    var maxOffset = isBasePlacement ? -referenceRect[len] / 2 + additive + arrowLen + arrowPaddingMax + normalizedTetherOffsetValue.mainAxis : maxLen + arrowLen + arrowPaddingMax + normalizedTetherOffsetValue.mainAxis;\n    var arrowOffsetParent = state.elements.arrow && getOffsetParent(state.elements.arrow);\n    var clientOffset = arrowOffsetParent ? mainAxis === 'y' ? arrowOffsetParent.clientTop || 0 : arrowOffsetParent.clientLeft || 0 : 0;\n    var offsetModifierValue = (_offsetModifierState$ = offsetModifierState == null ? void 0 : offsetModifierState[mainAxis]) != null ? _offsetModifierState$ : 0;\n    var tetherMin = offset + minOffset - offsetModifierValue - clientOffset;\n    var tetherMax = offset + maxOffset - offsetModifierValue;\n    var preventedOffset = within(tether ? mathMin(min, tetherMin) : min, offset, tether ? mathMax(max, tetherMax) : max);\n    popperOffsets[mainAxis] = preventedOffset;\n    data[mainAxis] = preventedOffset - offset;\n  }\n\n  if (checkAltAxis) {\n    var _offsetModifierState$2;\n\n    var _mainSide = mainAxis === 'x' ? top : left;\n\n    var _altSide = mainAxis === 'x' ? bottom : right;\n\n    var _offset = popperOffsets[altAxis];\n\n    var _len = altAxis === 'y' ? 'height' : 'width';\n\n    var _min = _offset + overflow[_mainSide];\n\n    var _max = _offset - overflow[_altSide];\n\n    var isOriginSide = [top, left].indexOf(basePlacement) !== -1;\n\n    var _offsetModifierValue = (_offsetModifierState$2 = offsetModifierState == null ? void 0 : offsetModifierState[altAxis]) != null ? _offsetModifierState$2 : 0;\n\n    var _tetherMin = isOriginSide ? _min : _offset - referenceRect[_len] - popperRect[_len] - _offsetModifierValue + normalizedTetherOffsetValue.altAxis;\n\n    var _tetherMax = isOriginSide ? _offset + referenceRect[_len] + popperRect[_len] - _offsetModifierValue - normalizedTetherOffsetValue.altAxis : _max;\n\n    var _preventedOffset = tether && isOriginSide ? withinMaxClamp(_tetherMin, _offset, _tetherMax) : within(tether ? _tetherMin : _min, _offset, tether ? _tetherMax : _max);\n\n    popperOffsets[altAxis] = _preventedOffset;\n    data[altAxis] = _preventedOffset - _offset;\n  }\n\n  state.modifiersData[name] = data;\n} // eslint-disable-next-line import/no-unused-modules\n\n\nexport default {\n  name: 'preventOverflow',\n  enabled: true,\n  phase: 'main',\n  fn: preventOverflow,\n  requiresIfExists: ['offset']\n};","export default function getAltAxis(axis) {\n  return axis === 'x' ? 'y' : 'x';\n}","import getBoundingClientRect from \"./getBoundingClientRect.js\";\nimport getNodeScroll from \"./getNodeScroll.js\";\nimport getNodeName from \"./getNodeName.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nimport getWindowScrollBarX from \"./getWindowScrollBarX.js\";\nimport getDocumentElement from \"./getDocumentElement.js\";\nimport isScrollParent from \"./isScrollParent.js\";\nimport { round } from \"../utils/math.js\";\n\nfunction isElementScaled(element) {\n  var rect = element.getBoundingClientRect();\n  var scaleX = round(rect.width) / element.offsetWidth || 1;\n  var scaleY = round(rect.height) / element.offsetHeight || 1;\n  return scaleX !== 1 || scaleY !== 1;\n} // Returns the composite rect of an element relative to its offsetParent.\n// Composite means it takes into account transforms as well as layout.\n\n\nexport default function getCompositeRect(elementOrVirtualElement, offsetParent, isFixed) {\n  if (isFixed === void 0) {\n    isFixed = false;\n  }\n\n  var isOffsetParentAnElement = isHTMLElement(offsetParent);\n  var offsetParentIsScaled = isHTMLElement(offsetParent) && isElementScaled(offsetParent);\n  var documentElement = getDocumentElement(offsetParent);\n  var rect = getBoundingClientRect(elementOrVirtualElement, offsetParentIsScaled, isFixed);\n  var scroll = {\n    scrollLeft: 0,\n    scrollTop: 0\n  };\n  var offsets = {\n    x: 0,\n    y: 0\n  };\n\n  if (isOffsetParentAnElement || !isOffsetParentAnElement && !isFixed) {\n    if (getNodeName(offsetParent) !== 'body' || // https://github.com/popperjs/popper-core/issues/1078\n    isScrollParent(documentElement)) {\n      scroll = getNodeScroll(offsetParent);\n    }\n\n    if (isHTMLElement(offsetParent)) {\n      offsets = getBoundingClientRect(offsetParent, true);\n      offsets.x += offsetParent.clientLeft;\n      offsets.y += offsetParent.clientTop;\n    } else if (documentElement) {\n      offsets.x = getWindowScrollBarX(documentElement);\n    }\n  }\n\n  return {\n    x: rect.left + scroll.scrollLeft - offsets.x,\n    y: rect.top + scroll.scrollTop - offsets.y,\n    width: rect.width,\n    height: rect.height\n  };\n}","import getWindowScroll from \"./getWindowScroll.js\";\nimport getWindow from \"./getWindow.js\";\nimport { isHTMLElement } from \"./instanceOf.js\";\nimport getHTMLElementScroll from \"./getHTMLElementScroll.js\";\nexport default function getNodeScroll(node) {\n  if (node === getWindow(node) || !isHTMLElement(node)) {\n    return getWindowScroll(node);\n  } else {\n    return getHTMLElementScroll(node);\n  }\n}","export default function getHTMLElementScroll(element) {\n  return {\n    scrollLeft: element.scrollLeft,\n    scrollTop: element.scrollTop\n  };\n}","import { modifierPhases } from \"../enums.js\"; // source: https://stackoverflow.com/questions/49875255\n\nfunction order(modifiers) {\n  var map = new Map();\n  var visited = new Set();\n  var result = [];\n  modifiers.forEach(function (modifier) {\n    map.set(modifier.name, modifier);\n  }); // On visiting object, check for its dependencies and visit them recursively\n\n  function sort(modifier) {\n    visited.add(modifier.name);\n    var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);\n    requires.forEach(function (dep) {\n      if (!visited.has(dep)) {\n        var depModifier = map.get(dep);\n\n        if (depModifier) {\n          sort(depModifier);\n        }\n      }\n    });\n    result.push(modifier);\n  }\n\n  modifiers.forEach(function (modifier) {\n    if (!visited.has(modifier.name)) {\n      // check for visited object\n      sort(modifier);\n    }\n  });\n  return result;\n}\n\nexport default function orderModifiers(modifiers) {\n  // order based on dependencies\n  var orderedModifiers = order(modifiers); // order based on phase\n\n  return modifierPhases.reduce(function (acc, phase) {\n    return acc.concat(orderedModifiers.filter(function (modifier) {\n      return modifier.phase === phase;\n    }));\n  }, []);\n}","import getCompositeRect from \"./dom-utils/getCompositeRect.js\";\nimport getLayoutRect from \"./dom-utils/getLayoutRect.js\";\nimport listScrollParents from \"./dom-utils/listScrollParents.js\";\nimport getOffsetParent from \"./dom-utils/getOffsetParent.js\";\nimport orderModifiers from \"./utils/orderModifiers.js\";\nimport debounce from \"./utils/debounce.js\";\nimport mergeByName from \"./utils/mergeByName.js\";\nimport detectOverflow from \"./utils/detectOverflow.js\";\nimport { isElement } from \"./dom-utils/instanceOf.js\";\nvar DEFAULT_OPTIONS = {\n  placement: 'bottom',\n  modifiers: [],\n  strategy: 'absolute'\n};\n\nfunction areValidElements() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  return !args.some(function (element) {\n    return !(element && typeof element.getBoundingClientRect === 'function');\n  });\n}\n\nexport function popperGenerator(generatorOptions) {\n  if (generatorOptions === void 0) {\n    generatorOptions = {};\n  }\n\n  var _generatorOptions = generatorOptions,\n      _generatorOptions$def = _generatorOptions.defaultModifiers,\n      defaultModifiers = _generatorOptions$def === void 0 ? [] : _generatorOptions$def,\n      _generatorOptions$def2 = _generatorOptions.defaultOptions,\n      defaultOptions = _generatorOptions$def2 === void 0 ? DEFAULT_OPTIONS : _generatorOptions$def2;\n  return function createPopper(reference, popper, options) {\n    if (options === void 0) {\n      options = defaultOptions;\n    }\n\n    var state = {\n      placement: 'bottom',\n      orderedModifiers: [],\n      options: Object.assign({}, DEFAULT_OPTIONS, defaultOptions),\n      modifiersData: {},\n      elements: {\n        reference: reference,\n        popper: popper\n      },\n      attributes: {},\n      styles: {}\n    };\n    var effectCleanupFns = [];\n    var isDestroyed = false;\n    var instance = {\n      state: state,\n      setOptions: function setOptions(setOptionsAction) {\n        var options = typeof setOptionsAction === 'function' ? setOptionsAction(state.options) : setOptionsAction;\n        cleanupModifierEffects();\n        state.options = Object.assign({}, defaultOptions, state.options, options);\n        state.scrollParents = {\n          reference: isElement(reference) ? listScrollParents(reference) : reference.contextElement ? listScrollParents(reference.contextElement) : [],\n          popper: listScrollParents(popper)\n        }; // Orders the modifiers based on their dependencies and `phase`\n        // properties\n\n        var orderedModifiers = orderModifiers(mergeByName([].concat(defaultModifiers, state.options.modifiers))); // Strip out disabled modifiers\n\n        state.orderedModifiers = orderedModifiers.filter(function (m) {\n          return m.enabled;\n        });\n        runModifierEffects();\n        return instance.update();\n      },\n      // Sync update – it will always be executed, even if not necessary. This\n      // is useful for low frequency updates where sync behavior simplifies the\n      // logic.\n      // For high frequency updates (e.g. `resize` and `scroll` events), always\n      // prefer the async Popper#update method\n      forceUpdate: function forceUpdate() {\n        if (isDestroyed) {\n          return;\n        }\n\n        var _state$elements = state.elements,\n            reference = _state$elements.reference,\n            popper = _state$elements.popper; // Don't proceed if `reference` or `popper` are not valid elements\n        // anymore\n\n        if (!areValidElements(reference, popper)) {\n          return;\n        } // Store the reference and popper rects to be read by modifiers\n\n\n        state.rects = {\n          reference: getCompositeRect(reference, getOffsetParent(popper), state.options.strategy === 'fixed'),\n          popper: getLayoutRect(popper)\n        }; // Modifiers have the ability to reset the current update cycle. The\n        // most common use case for this is the `flip` modifier changing the\n        // placement, which then needs to re-run all the modifiers, because the\n        // logic was previously ran for the previous placement and is therefore\n        // stale/incorrect\n\n        state.reset = false;\n        state.placement = state.options.placement; // On each update cycle, the `modifiersData` property for each modifier\n        // is filled with the initial data specified by the modifier. This means\n        // it doesn't persist and is fresh on each update.\n        // To ensure persistent data, use `${name}#persistent`\n\n        state.orderedModifiers.forEach(function (modifier) {\n          return state.modifiersData[modifier.name] = Object.assign({}, modifier.data);\n        });\n\n        for (var index = 0; index < state.orderedModifiers.length; index++) {\n          if (state.reset === true) {\n            state.reset = false;\n            index = -1;\n            continue;\n          }\n\n          var _state$orderedModifie = state.orderedModifiers[index],\n              fn = _state$orderedModifie.fn,\n              _state$orderedModifie2 = _state$orderedModifie.options,\n              _options = _state$orderedModifie2 === void 0 ? {} : _state$orderedModifie2,\n              name = _state$orderedModifie.name;\n\n          if (typeof fn === 'function') {\n            state = fn({\n              state: state,\n              options: _options,\n              name: name,\n              instance: instance\n            }) || state;\n          }\n        }\n      },\n      // Async and optimistically optimized update – it will not be executed if\n      // not necessary (debounced to run at most once-per-tick)\n      update: debounce(function () {\n        return new Promise(function (resolve) {\n          instance.forceUpdate();\n          resolve(state);\n        });\n      }),\n      destroy: function destroy() {\n        cleanupModifierEffects();\n        isDestroyed = true;\n      }\n    };\n\n    if (!areValidElements(reference, popper)) {\n      return instance;\n    }\n\n    instance.setOptions(options).then(function (state) {\n      if (!isDestroyed && options.onFirstUpdate) {\n        options.onFirstUpdate(state);\n      }\n    }); // Modifiers have the ability to execute arbitrary code before the first\n    // update cycle runs. They will be executed in the same order as the update\n    // cycle. This is useful when a modifier adds some persistent data that\n    // other modifiers need to use, but the modifier is run after the dependent\n    // one.\n\n    function runModifierEffects() {\n      state.orderedModifiers.forEach(function (_ref) {\n        var name = _ref.name,\n            _ref$options = _ref.options,\n            options = _ref$options === void 0 ? {} : _ref$options,\n            effect = _ref.effect;\n\n        if (typeof effect === 'function') {\n          var cleanupFn = effect({\n            state: state,\n            name: name,\n            instance: instance,\n            options: options\n          });\n\n          var noopFn = function noopFn() {};\n\n          effectCleanupFns.push(cleanupFn || noopFn);\n        }\n      });\n    }\n\n    function cleanupModifierEffects() {\n      effectCleanupFns.forEach(function (fn) {\n        return fn();\n      });\n      effectCleanupFns = [];\n    }\n\n    return instance;\n  };\n}\nexport var createPopper = /*#__PURE__*/popperGenerator(); // eslint-disable-next-line import/no-unused-modules\n\nexport { detectOverflow };","export default function debounce(fn) {\n  var pending;\n  return function () {\n    if (!pending) {\n      pending = new Promise(function (resolve) {\n        Promise.resolve().then(function () {\n          pending = undefined;\n          resolve(fn());\n        });\n      });\n    }\n\n    return pending;\n  };\n}","export default function mergeByName(modifiers) {\n  var merged = modifiers.reduce(function (merged, current) {\n    var existing = merged[current.name];\n    merged[current.name] = existing ? Object.assign({}, existing, current, {\n      options: Object.assign({}, existing.options, current.options),\n      data: Object.assign({}, existing.data, current.data)\n    }) : current;\n    return merged;\n  }, {}); // IE11 does not support Object.values\n\n  return Object.keys(merged).map(function (key) {\n    return merged[key];\n  });\n}","import { popperGenerator, detectOverflow } from \"./createPopper.js\";\nimport eventListeners from \"./modifiers/eventListeners.js\";\nimport popperOffsets from \"./modifiers/popperOffsets.js\";\nimport computeStyles from \"./modifiers/computeStyles.js\";\nimport applyStyles from \"./modifiers/applyStyles.js\";\nimport offset from \"./modifiers/offset.js\";\nimport flip from \"./modifiers/flip.js\";\nimport preventOverflow from \"./modifiers/preventOverflow.js\";\nimport arrow from \"./modifiers/arrow.js\";\nimport hide from \"./modifiers/hide.js\";\nvar defaultModifiers = [eventListeners, popperOffsets, computeStyles, applyStyles, offset, flip, preventOverflow, arrow, hide];\nvar createPopper = /*#__PURE__*/popperGenerator({\n  defaultModifiers: defaultModifiers\n}); // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper, popperGenerator, defaultModifiers, detectOverflow }; // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper as createPopperLite } from \"./popper-lite.js\"; // eslint-disable-next-line import/no-unused-modules\n\nexport * from \"./modifiers/index.js\";","import { popperGenerator, detectOverflow } from \"./createPopper.js\";\nimport eventListeners from \"./modifiers/eventListeners.js\";\nimport popperOffsets from \"./modifiers/popperOffsets.js\";\nimport computeStyles from \"./modifiers/computeStyles.js\";\nimport applyStyles from \"./modifiers/applyStyles.js\";\nvar defaultModifiers = [eventListeners, popperOffsets, computeStyles, applyStyles];\nvar createPopper = /*#__PURE__*/popperGenerator({\n  defaultModifiers: defaultModifiers\n}); // eslint-disable-next-line import/no-unused-modules\n\nexport { createPopper, popperGenerator, defaultModifiers, detectOverflow };","/*!\n  * Bootstrap v5.3.2 (https://getbootstrap.com/)\n  * Copyright 2011-2023 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)\n  * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n  */\nimport * as Popper from '@popperjs/core';\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/data.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n/**\n * Constants\n */\n\nconst elementMap = new Map();\nconst Data = {\n  set(element, key, instance) {\n    if (!elementMap.has(element)) {\n      elementMap.set(element, new Map());\n    }\n    const instanceMap = elementMap.get(element);\n\n    // make it clear we only want one instance per element\n    // can be removed later when multiple key/instances are fine to be used\n    if (!instanceMap.has(key) && instanceMap.size !== 0) {\n      // eslint-disable-next-line no-console\n      console.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(instanceMap.keys())[0]}.`);\n      return;\n    }\n    instanceMap.set(key, instance);\n  },\n  get(element, key) {\n    if (elementMap.has(element)) {\n      return elementMap.get(element).get(key) || null;\n    }\n    return null;\n  },\n  remove(element, key) {\n    if (!elementMap.has(element)) {\n      return;\n    }\n    const instanceMap = elementMap.get(element);\n    instanceMap.delete(key);\n\n    // free up element references if there are no instances left for an element\n    if (instanceMap.size === 0) {\n      elementMap.delete(element);\n    }\n  }\n};\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/index.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nconst MAX_UID = 1000000;\nconst MILLISECONDS_MULTIPLIER = 1000;\nconst TRANSITION_END = 'transitionend';\n\n/**\n * Properly escape IDs selectors to handle weird IDs\n * @param {string} selector\n * @returns {string}\n */\nconst parseSelector = selector => {\n  if (selector && window.CSS && window.CSS.escape) {\n    // document.querySelector needs escaping to handle IDs (html5+) containing for instance /\n    selector = selector.replace(/#([^\\s\"#']+)/g, (match, id) => `#${CSS.escape(id)}`);\n  }\n  return selector;\n};\n\n// Shout-out Angus Croll (https://goo.gl/pxwQGp)\nconst toType = object => {\n  if (object === null || object === undefined) {\n    return `${object}`;\n  }\n  return Object.prototype.toString.call(object).match(/\\s([a-z]+)/i)[1].toLowerCase();\n};\n\n/**\n * Public Util API\n */\n\nconst getUID = prefix => {\n  do {\n    prefix += Math.floor(Math.random() * MAX_UID);\n  } while (document.getElementById(prefix));\n  return prefix;\n};\nconst getTransitionDurationFromElement = element => {\n  if (!element) {\n    return 0;\n  }\n\n  // Get transition-duration of the element\n  let {\n    transitionDuration,\n    transitionDelay\n  } = window.getComputedStyle(element);\n  const floatTransitionDuration = Number.parseFloat(transitionDuration);\n  const floatTransitionDelay = Number.parseFloat(transitionDelay);\n\n  // Return 0 if element or transition duration is not found\n  if (!floatTransitionDuration && !floatTransitionDelay) {\n    return 0;\n  }\n\n  // If multiple durations are defined, take the first\n  transitionDuration = transitionDuration.split(',')[0];\n  transitionDelay = transitionDelay.split(',')[0];\n  return (Number.parseFloat(transitionDuration) + Number.parseFloat(transitionDelay)) * MILLISECONDS_MULTIPLIER;\n};\nconst triggerTransitionEnd = element => {\n  element.dispatchEvent(new Event(TRANSITION_END));\n};\nconst isElement = object => {\n  if (!object || typeof object !== 'object') {\n    return false;\n  }\n  if (typeof object.jquery !== 'undefined') {\n    object = object[0];\n  }\n  return typeof object.nodeType !== 'undefined';\n};\nconst getElement = object => {\n  // it's a jQuery object or a node element\n  if (isElement(object)) {\n    return object.jquery ? object[0] : object;\n  }\n  if (typeof object === 'string' && object.length > 0) {\n    return document.querySelector(parseSelector(object));\n  }\n  return null;\n};\nconst isVisible = element => {\n  if (!isElement(element) || element.getClientRects().length === 0) {\n    return false;\n  }\n  const elementIsVisible = getComputedStyle(element).getPropertyValue('visibility') === 'visible';\n  // Handle `details` element as its content may falsie appear visible when it is closed\n  const closedDetails = element.closest('details:not([open])');\n  if (!closedDetails) {\n    return elementIsVisible;\n  }\n  if (closedDetails !== element) {\n    const summary = element.closest('summary');\n    if (summary && summary.parentNode !== closedDetails) {\n      return false;\n    }\n    if (summary === null) {\n      return false;\n    }\n  }\n  return elementIsVisible;\n};\nconst isDisabled = element => {\n  if (!element || element.nodeType !== Node.ELEMENT_NODE) {\n    return true;\n  }\n  if (element.classList.contains('disabled')) {\n    return true;\n  }\n  if (typeof element.disabled !== 'undefined') {\n    return element.disabled;\n  }\n  return element.hasAttribute('disabled') && element.getAttribute('disabled') !== 'false';\n};\nconst findShadowRoot = element => {\n  if (!document.documentElement.attachShadow) {\n    return null;\n  }\n\n  // Can find the shadow root otherwise it'll return the document\n  if (typeof element.getRootNode === 'function') {\n    const root = element.getRootNode();\n    return root instanceof ShadowRoot ? root : null;\n  }\n  if (element instanceof ShadowRoot) {\n    return element;\n  }\n\n  // when we don't find a shadow root\n  if (!element.parentNode) {\n    return null;\n  }\n  return findShadowRoot(element.parentNode);\n};\nconst noop = () => {};\n\n/**\n * Trick to restart an element's animation\n *\n * @param {HTMLElement} element\n * @return void\n *\n * @see https://www.charistheo.io/blog/2021/02/restart-a-css-animation-with-javascript/#restarting-a-css-animation\n */\nconst reflow = element => {\n  element.offsetHeight; // eslint-disable-line no-unused-expressions\n};\n\nconst getjQuery = () => {\n  if (window.jQuery && !document.body.hasAttribute('data-bs-no-jquery')) {\n    return window.jQuery;\n  }\n  return null;\n};\nconst DOMContentLoadedCallbacks = [];\nconst onDOMContentLoaded = callback => {\n  if (document.readyState === 'loading') {\n    // add listener on the first call when the document is in loading state\n    if (!DOMContentLoadedCallbacks.length) {\n      document.addEventListener('DOMContentLoaded', () => {\n        for (const callback of DOMContentLoadedCallbacks) {\n          callback();\n        }\n      });\n    }\n    DOMContentLoadedCallbacks.push(callback);\n  } else {\n    callback();\n  }\n};\nconst isRTL = () => document.documentElement.dir === 'rtl';\nconst defineJQueryPlugin = plugin => {\n  onDOMContentLoaded(() => {\n    const $ = getjQuery();\n    /* istanbul ignore if */\n    if ($) {\n      const name = plugin.NAME;\n      const JQUERY_NO_CONFLICT = $.fn[name];\n      $.fn[name] = plugin.jQueryInterface;\n      $.fn[name].Constructor = plugin;\n      $.fn[name].noConflict = () => {\n        $.fn[name] = JQUERY_NO_CONFLICT;\n        return plugin.jQueryInterface;\n      };\n    }\n  });\n};\nconst execute = (possibleCallback, args = [], defaultValue = possibleCallback) => {\n  return typeof possibleCallback === 'function' ? possibleCallback(...args) : defaultValue;\n};\nconst executeAfterTransition = (callback, transitionElement, waitForTransition = true) => {\n  if (!waitForTransition) {\n    execute(callback);\n    return;\n  }\n  const durationPadding = 5;\n  const emulatedDuration = getTransitionDurationFromElement(transitionElement) + durationPadding;\n  let called = false;\n  const handler = ({\n    target\n  }) => {\n    if (target !== transitionElement) {\n      return;\n    }\n    called = true;\n    transitionElement.removeEventListener(TRANSITION_END, handler);\n    execute(callback);\n  };\n  transitionElement.addEventListener(TRANSITION_END, handler);\n  setTimeout(() => {\n    if (!called) {\n      triggerTransitionEnd(transitionElement);\n    }\n  }, emulatedDuration);\n};\n\n/**\n * Return the previous/next element of a list.\n *\n * @param {array} list    The list of elements\n * @param activeElement   The active element\n * @param shouldGetNext   Choose to get next or previous element\n * @param isCycleAllowed\n * @return {Element|elem} The proper element\n */\nconst getNextActiveElement = (list, activeElement, shouldGetNext, isCycleAllowed) => {\n  const listLength = list.length;\n  let index = list.indexOf(activeElement);\n\n  // if the element does not exist in the list return an element\n  // depending on the direction and if cycle is allowed\n  if (index === -1) {\n    return !shouldGetNext && isCycleAllowed ? list[listLength - 1] : list[0];\n  }\n  index += shouldGetNext ? 1 : -1;\n  if (isCycleAllowed) {\n    index = (index + listLength) % listLength;\n  }\n  return list[Math.max(0, Math.min(index, listLength - 1))];\n};\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/event-handler.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst namespaceRegex = /[^.]*(?=\\..*)\\.|.*/;\nconst stripNameRegex = /\\..*/;\nconst stripUidRegex = /::\\d+$/;\nconst eventRegistry = {}; // Events storage\nlet uidEvent = 1;\nconst customEvents = {\n  mouseenter: 'mouseover',\n  mouseleave: 'mouseout'\n};\nconst nativeEvents = new Set(['click', 'dblclick', 'mouseup', 'mousedown', 'contextmenu', 'mousewheel', 'DOMMouseScroll', 'mouseover', 'mouseout', 'mousemove', 'selectstart', 'selectend', 'keydown', 'keypress', 'keyup', 'orientationchange', 'touchstart', 'touchmove', 'touchend', 'touchcancel', 'pointerdown', 'pointermove', 'pointerup', 'pointerleave', 'pointercancel', 'gesturestart', 'gesturechange', 'gestureend', 'focus', 'blur', 'change', 'reset', 'select', 'submit', 'focusin', 'focusout', 'load', 'unload', 'beforeunload', 'resize', 'move', 'DOMContentLoaded', 'readystatechange', 'error', 'abort', 'scroll']);\n\n/**\n * Private methods\n */\n\nfunction makeEventUid(element, uid) {\n  return uid && `${uid}::${uidEvent++}` || element.uidEvent || uidEvent++;\n}\nfunction getElementEvents(element) {\n  const uid = makeEventUid(element);\n  element.uidEvent = uid;\n  eventRegistry[uid] = eventRegistry[uid] || {};\n  return eventRegistry[uid];\n}\nfunction bootstrapHandler(element, fn) {\n  return function handler(event) {\n    hydrateObj(event, {\n      delegateTarget: element\n    });\n    if (handler.oneOff) {\n      EventHandler.off(element, event.type, fn);\n    }\n    return fn.apply(element, [event]);\n  };\n}\nfunction bootstrapDelegationHandler(element, selector, fn) {\n  return function handler(event) {\n    const domElements = element.querySelectorAll(selector);\n    for (let {\n      target\n    } = event; target && target !== this; target = target.parentNode) {\n      for (const domElement of domElements) {\n        if (domElement !== target) {\n          continue;\n        }\n        hydrateObj(event, {\n          delegateTarget: target\n        });\n        if (handler.oneOff) {\n          EventHandler.off(element, event.type, selector, fn);\n        }\n        return fn.apply(target, [event]);\n      }\n    }\n  };\n}\nfunction findHandler(events, callable, delegationSelector = null) {\n  return Object.values(events).find(event => event.callable === callable && event.delegationSelector === delegationSelector);\n}\nfunction normalizeParameters(originalTypeEvent, handler, delegationFunction) {\n  const isDelegated = typeof handler === 'string';\n  // TODO: tooltip passes `false` instead of selector, so we need to check\n  const callable = isDelegated ? delegationFunction : handler || delegationFunction;\n  let typeEvent = getTypeEvent(originalTypeEvent);\n  if (!nativeEvents.has(typeEvent)) {\n    typeEvent = originalTypeEvent;\n  }\n  return [isDelegated, callable, typeEvent];\n}\nfunction addHandler(element, originalTypeEvent, handler, delegationFunction, oneOff) {\n  if (typeof originalTypeEvent !== 'string' || !element) {\n    return;\n  }\n  let [isDelegated, callable, typeEvent] = normalizeParameters(originalTypeEvent, handler, delegationFunction);\n\n  // in case of mouseenter or mouseleave wrap the handler within a function that checks for its DOM position\n  // this prevents the handler from being dispatched the same way as mouseover or mouseout does\n  if (originalTypeEvent in customEvents) {\n    const wrapFunction = fn => {\n      return function (event) {\n        if (!event.relatedTarget || event.relatedTarget !== event.delegateTarget && !event.delegateTarget.contains(event.relatedTarget)) {\n          return fn.call(this, event);\n        }\n      };\n    };\n    callable = wrapFunction(callable);\n  }\n  const events = getElementEvents(element);\n  const handlers = events[typeEvent] || (events[typeEvent] = {});\n  const previousFunction = findHandler(handlers, callable, isDelegated ? handler : null);\n  if (previousFunction) {\n    previousFunction.oneOff = previousFunction.oneOff && oneOff;\n    return;\n  }\n  const uid = makeEventUid(callable, originalTypeEvent.replace(namespaceRegex, ''));\n  const fn = isDelegated ? bootstrapDelegationHandler(element, handler, callable) : bootstrapHandler(element, callable);\n  fn.delegationSelector = isDelegated ? handler : null;\n  fn.callable = callable;\n  fn.oneOff = oneOff;\n  fn.uidEvent = uid;\n  handlers[uid] = fn;\n  element.addEventListener(typeEvent, fn, isDelegated);\n}\nfunction removeHandler(element, events, typeEvent, handler, delegationSelector) {\n  const fn = findHandler(events[typeEvent], handler, delegationSelector);\n  if (!fn) {\n    return;\n  }\n  element.removeEventListener(typeEvent, fn, Boolean(delegationSelector));\n  delete events[typeEvent][fn.uidEvent];\n}\nfunction removeNamespacedHandlers(element, events, typeEvent, namespace) {\n  const storeElementEvent = events[typeEvent] || {};\n  for (const [handlerKey, event] of Object.entries(storeElementEvent)) {\n    if (handlerKey.includes(namespace)) {\n      removeHandler(element, events, typeEvent, event.callable, event.delegationSelector);\n    }\n  }\n}\nfunction getTypeEvent(event) {\n  // allow to get the native events from namespaced events ('click.bs.button' --> 'click')\n  event = event.replace(stripNameRegex, '');\n  return customEvents[event] || event;\n}\nconst EventHandler = {\n  on(element, event, handler, delegationFunction) {\n    addHandler(element, event, handler, delegationFunction, false);\n  },\n  one(element, event, handler, delegationFunction) {\n    addHandler(element, event, handler, delegationFunction, true);\n  },\n  off(element, originalTypeEvent, handler, delegationFunction) {\n    if (typeof originalTypeEvent !== 'string' || !element) {\n      return;\n    }\n    const [isDelegated, callable, typeEvent] = normalizeParameters(originalTypeEvent, handler, delegationFunction);\n    const inNamespace = typeEvent !== originalTypeEvent;\n    const events = getElementEvents(element);\n    const storeElementEvent = events[typeEvent] || {};\n    const isNamespace = originalTypeEvent.startsWith('.');\n    if (typeof callable !== 'undefined') {\n      // Simplest case: handler is passed, remove that listener ONLY.\n      if (!Object.keys(storeElementEvent).length) {\n        return;\n      }\n      removeHandler(element, events, typeEvent, callable, isDelegated ? handler : null);\n      return;\n    }\n    if (isNamespace) {\n      for (const elementEvent of Object.keys(events)) {\n        removeNamespacedHandlers(element, events, elementEvent, originalTypeEvent.slice(1));\n      }\n    }\n    for (const [keyHandlers, event] of Object.entries(storeElementEvent)) {\n      const handlerKey = keyHandlers.replace(stripUidRegex, '');\n      if (!inNamespace || originalTypeEvent.includes(handlerKey)) {\n        removeHandler(element, events, typeEvent, event.callable, event.delegationSelector);\n      }\n    }\n  },\n  trigger(element, event, args) {\n    if (typeof event !== 'string' || !element) {\n      return null;\n    }\n    const $ = getjQuery();\n    const typeEvent = getTypeEvent(event);\n    const inNamespace = event !== typeEvent;\n    let jQueryEvent = null;\n    let bubbles = true;\n    let nativeDispatch = true;\n    let defaultPrevented = false;\n    if (inNamespace && $) {\n      jQueryEvent = $.Event(event, args);\n      $(element).trigger(jQueryEvent);\n      bubbles = !jQueryEvent.isPropagationStopped();\n      nativeDispatch = !jQueryEvent.isImmediatePropagationStopped();\n      defaultPrevented = jQueryEvent.isDefaultPrevented();\n    }\n    const evt = hydrateObj(new Event(event, {\n      bubbles,\n      cancelable: true\n    }), args);\n    if (defaultPrevented) {\n      evt.preventDefault();\n    }\n    if (nativeDispatch) {\n      element.dispatchEvent(evt);\n    }\n    if (evt.defaultPrevented && jQueryEvent) {\n      jQueryEvent.preventDefault();\n    }\n    return evt;\n  }\n};\nfunction hydrateObj(obj, meta = {}) {\n  for (const [key, value] of Object.entries(meta)) {\n    try {\n      obj[key] = value;\n    } catch (_unused) {\n      Object.defineProperty(obj, key, {\n        configurable: true,\n        get() {\n          return value;\n        }\n      });\n    }\n  }\n  return obj;\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/manipulator.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nfunction normalizeData(value) {\n  if (value === 'true') {\n    return true;\n  }\n  if (value === 'false') {\n    return false;\n  }\n  if (value === Number(value).toString()) {\n    return Number(value);\n  }\n  if (value === '' || value === 'null') {\n    return null;\n  }\n  if (typeof value !== 'string') {\n    return value;\n  }\n  try {\n    return JSON.parse(decodeURIComponent(value));\n  } catch (_unused) {\n    return value;\n  }\n}\nfunction normalizeDataKey(key) {\n  return key.replace(/[A-Z]/g, chr => `-${chr.toLowerCase()}`);\n}\nconst Manipulator = {\n  setDataAttribute(element, key, value) {\n    element.setAttribute(`data-bs-${normalizeDataKey(key)}`, value);\n  },\n  removeDataAttribute(element, key) {\n    element.removeAttribute(`data-bs-${normalizeDataKey(key)}`);\n  },\n  getDataAttributes(element) {\n    if (!element) {\n      return {};\n    }\n    const attributes = {};\n    const bsKeys = Object.keys(element.dataset).filter(key => key.startsWith('bs') && !key.startsWith('bsConfig'));\n    for (const key of bsKeys) {\n      let pureKey = key.replace(/^bs/, '');\n      pureKey = pureKey.charAt(0).toLowerCase() + pureKey.slice(1, pureKey.length);\n      attributes[pureKey] = normalizeData(element.dataset[key]);\n    }\n    return attributes;\n  },\n  getDataAttribute(element, key) {\n    return normalizeData(element.getAttribute(`data-bs-${normalizeDataKey(key)}`));\n  }\n};\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/config.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Class definition\n */\n\nclass Config {\n  // Getters\n  static get Default() {\n    return {};\n  }\n  static get DefaultType() {\n    return {};\n  }\n  static get NAME() {\n    throw new Error('You have to implement the static method \"NAME\", for each component!');\n  }\n  _getConfig(config) {\n    config = this._mergeConfigObj(config);\n    config = this._configAfterMerge(config);\n    this._typeCheckConfig(config);\n    return config;\n  }\n  _configAfterMerge(config) {\n    return config;\n  }\n  _mergeConfigObj(config, element) {\n    const jsonConfig = isElement(element) ? Manipulator.getDataAttribute(element, 'config') : {}; // try to parse\n\n    return {\n      ...this.constructor.Default,\n      ...(typeof jsonConfig === 'object' ? jsonConfig : {}),\n      ...(isElement(element) ? Manipulator.getDataAttributes(element) : {}),\n      ...(typeof config === 'object' ? config : {})\n    };\n  }\n  _typeCheckConfig(config, configTypes = this.constructor.DefaultType) {\n    for (const [property, expectedTypes] of Object.entries(configTypes)) {\n      const value = config[property];\n      const valueType = isElement(value) ? 'element' : toType(value);\n      if (!new RegExp(expectedTypes).test(valueType)) {\n        throw new TypeError(`${this.constructor.NAME.toUpperCase()}: Option \"${property}\" provided type \"${valueType}\" but expected type \"${expectedTypes}\".`);\n      }\n    }\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap base-component.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst VERSION = '5.3.2';\n\n/**\n * Class definition\n */\n\nclass BaseComponent extends Config {\n  constructor(element, config) {\n    super();\n    element = getElement(element);\n    if (!element) {\n      return;\n    }\n    this._element = element;\n    this._config = this._getConfig(config);\n    Data.set(this._element, this.constructor.DATA_KEY, this);\n  }\n\n  // Public\n  dispose() {\n    Data.remove(this._element, this.constructor.DATA_KEY);\n    EventHandler.off(this._element, this.constructor.EVENT_KEY);\n    for (const propertyName of Object.getOwnPropertyNames(this)) {\n      this[propertyName] = null;\n    }\n  }\n  _queueCallback(callback, element, isAnimated = true) {\n    executeAfterTransition(callback, element, isAnimated);\n  }\n  _getConfig(config) {\n    config = this._mergeConfigObj(config, this._element);\n    config = this._configAfterMerge(config);\n    this._typeCheckConfig(config);\n    return config;\n  }\n\n  // Static\n  static getInstance(element) {\n    return Data.get(getElement(element), this.DATA_KEY);\n  }\n  static getOrCreateInstance(element, config = {}) {\n    return this.getInstance(element) || new this(element, typeof config === 'object' ? config : null);\n  }\n  static get VERSION() {\n    return VERSION;\n  }\n  static get DATA_KEY() {\n    return `bs.${this.NAME}`;\n  }\n  static get EVENT_KEY() {\n    return `.${this.DATA_KEY}`;\n  }\n  static eventName(name) {\n    return `${name}${this.EVENT_KEY}`;\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap dom/selector-engine.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nconst getSelector = element => {\n  let selector = element.getAttribute('data-bs-target');\n  if (!selector || selector === '#') {\n    let hrefAttribute = element.getAttribute('href');\n\n    // The only valid content that could double as a selector are IDs or classes,\n    // so everything starting with `#` or `.`. If a \"real\" URL is used as the selector,\n    // `document.querySelector` will rightfully complain it is invalid.\n    // See https://github.com/twbs/bootstrap/issues/32273\n    if (!hrefAttribute || !hrefAttribute.includes('#') && !hrefAttribute.startsWith('.')) {\n      return null;\n    }\n\n    // Just in case some CMS puts out a full URL with the anchor appended\n    if (hrefAttribute.includes('#') && !hrefAttribute.startsWith('#')) {\n      hrefAttribute = `#${hrefAttribute.split('#')[1]}`;\n    }\n    selector = hrefAttribute && hrefAttribute !== '#' ? parseSelector(hrefAttribute.trim()) : null;\n  }\n  return selector;\n};\nconst SelectorEngine = {\n  find(selector, element = document.documentElement) {\n    return [].concat(...Element.prototype.querySelectorAll.call(element, selector));\n  },\n  findOne(selector, element = document.documentElement) {\n    return Element.prototype.querySelector.call(element, selector);\n  },\n  children(element, selector) {\n    return [].concat(...element.children).filter(child => child.matches(selector));\n  },\n  parents(element, selector) {\n    const parents = [];\n    let ancestor = element.parentNode.closest(selector);\n    while (ancestor) {\n      parents.push(ancestor);\n      ancestor = ancestor.parentNode.closest(selector);\n    }\n    return parents;\n  },\n  prev(element, selector) {\n    let previous = element.previousElementSibling;\n    while (previous) {\n      if (previous.matches(selector)) {\n        return [previous];\n      }\n      previous = previous.previousElementSibling;\n    }\n    return [];\n  },\n  // TODO: this is now unused; remove later along with prev()\n  next(element, selector) {\n    let next = element.nextElementSibling;\n    while (next) {\n      if (next.matches(selector)) {\n        return [next];\n      }\n      next = next.nextElementSibling;\n    }\n    return [];\n  },\n  focusableChildren(element) {\n    const focusables = ['a', 'button', 'input', 'textarea', 'select', 'details', '[tabindex]', '[contenteditable=\"true\"]'].map(selector => `${selector}:not([tabindex^=\"-\"])`).join(',');\n    return this.find(focusables, element).filter(el => !isDisabled(el) && isVisible(el));\n  },\n  getSelectorFromElement(element) {\n    const selector = getSelector(element);\n    if (selector) {\n      return SelectorEngine.findOne(selector) ? selector : null;\n    }\n    return null;\n  },\n  getElementFromSelector(element) {\n    const selector = getSelector(element);\n    return selector ? SelectorEngine.findOne(selector) : null;\n  },\n  getMultipleElementsFromSelector(element) {\n    const selector = getSelector(element);\n    return selector ? SelectorEngine.find(selector) : [];\n  }\n};\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/component-functions.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\nconst enableDismissTrigger = (component, method = 'hide') => {\n  const clickEvent = `click.dismiss${component.EVENT_KEY}`;\n  const name = component.NAME;\n  EventHandler.on(document, clickEvent, `[data-bs-dismiss=\"${name}\"]`, function (event) {\n    if (['A', 'AREA'].includes(this.tagName)) {\n      event.preventDefault();\n    }\n    if (isDisabled(this)) {\n      return;\n    }\n    const target = SelectorEngine.getElementFromSelector(this) || this.closest(`.${name}`);\n    const instance = component.getOrCreateInstance(target);\n\n    // Method argument is left, for Alert and only, as it doesn't implement the 'hide' method\n    instance[method]();\n  });\n};\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap alert.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$f = 'alert';\nconst DATA_KEY$a = 'bs.alert';\nconst EVENT_KEY$b = `.${DATA_KEY$a}`;\nconst EVENT_CLOSE = `close${EVENT_KEY$b}`;\nconst EVENT_CLOSED = `closed${EVENT_KEY$b}`;\nconst CLASS_NAME_FADE$5 = 'fade';\nconst CLASS_NAME_SHOW$8 = 'show';\n\n/**\n * Class definition\n */\n\nclass Alert extends BaseComponent {\n  // Getters\n  static get NAME() {\n    return NAME$f;\n  }\n\n  // Public\n  close() {\n    const closeEvent = EventHandler.trigger(this._element, EVENT_CLOSE);\n    if (closeEvent.defaultPrevented) {\n      return;\n    }\n    this._element.classList.remove(CLASS_NAME_SHOW$8);\n    const isAnimated = this._element.classList.contains(CLASS_NAME_FADE$5);\n    this._queueCallback(() => this._destroyElement(), this._element, isAnimated);\n  }\n\n  // Private\n  _destroyElement() {\n    this._element.remove();\n    EventHandler.trigger(this._element, EVENT_CLOSED);\n    this.dispose();\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Alert.getOrCreateInstance(this);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config](this);\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nenableDismissTrigger(Alert, 'close');\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Alert);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap button.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$e = 'button';\nconst DATA_KEY$9 = 'bs.button';\nconst EVENT_KEY$a = `.${DATA_KEY$9}`;\nconst DATA_API_KEY$6 = '.data-api';\nconst CLASS_NAME_ACTIVE$3 = 'active';\nconst SELECTOR_DATA_TOGGLE$5 = '[data-bs-toggle=\"button\"]';\nconst EVENT_CLICK_DATA_API$6 = `click${EVENT_KEY$a}${DATA_API_KEY$6}`;\n\n/**\n * Class definition\n */\n\nclass Button extends BaseComponent {\n  // Getters\n  static get NAME() {\n    return NAME$e;\n  }\n\n  // Public\n  toggle() {\n    // Toggle class and sync the `aria-pressed` attribute with the return value of the `.toggle()` method\n    this._element.setAttribute('aria-pressed', this._element.classList.toggle(CLASS_NAME_ACTIVE$3));\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Button.getOrCreateInstance(this);\n      if (config === 'toggle') {\n        data[config]();\n      }\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API$6, SELECTOR_DATA_TOGGLE$5, event => {\n  event.preventDefault();\n  const button = event.target.closest(SELECTOR_DATA_TOGGLE$5);\n  const data = Button.getOrCreateInstance(button);\n  data.toggle();\n});\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Button);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/swipe.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$d = 'swipe';\nconst EVENT_KEY$9 = '.bs.swipe';\nconst EVENT_TOUCHSTART = `touchstart${EVENT_KEY$9}`;\nconst EVENT_TOUCHMOVE = `touchmove${EVENT_KEY$9}`;\nconst EVENT_TOUCHEND = `touchend${EVENT_KEY$9}`;\nconst EVENT_POINTERDOWN = `pointerdown${EVENT_KEY$9}`;\nconst EVENT_POINTERUP = `pointerup${EVENT_KEY$9}`;\nconst POINTER_TYPE_TOUCH = 'touch';\nconst POINTER_TYPE_PEN = 'pen';\nconst CLASS_NAME_POINTER_EVENT = 'pointer-event';\nconst SWIPE_THRESHOLD = 40;\nconst Default$c = {\n  endCallback: null,\n  leftCallback: null,\n  rightCallback: null\n};\nconst DefaultType$c = {\n  endCallback: '(function|null)',\n  leftCallback: '(function|null)',\n  rightCallback: '(function|null)'\n};\n\n/**\n * Class definition\n */\n\nclass Swipe extends Config {\n  constructor(element, config) {\n    super();\n    this._element = element;\n    if (!element || !Swipe.isSupported()) {\n      return;\n    }\n    this._config = this._getConfig(config);\n    this._deltaX = 0;\n    this._supportPointerEvents = Boolean(window.PointerEvent);\n    this._initEvents();\n  }\n\n  // Getters\n  static get Default() {\n    return Default$c;\n  }\n  static get DefaultType() {\n    return DefaultType$c;\n  }\n  static get NAME() {\n    return NAME$d;\n  }\n\n  // Public\n  dispose() {\n    EventHandler.off(this._element, EVENT_KEY$9);\n  }\n\n  // Private\n  _start(event) {\n    if (!this._supportPointerEvents) {\n      this._deltaX = event.touches[0].clientX;\n      return;\n    }\n    if (this._eventIsPointerPenTouch(event)) {\n      this._deltaX = event.clientX;\n    }\n  }\n  _end(event) {\n    if (this._eventIsPointerPenTouch(event)) {\n      this._deltaX = event.clientX - this._deltaX;\n    }\n    this._handleSwipe();\n    execute(this._config.endCallback);\n  }\n  _move(event) {\n    this._deltaX = event.touches && event.touches.length > 1 ? 0 : event.touches[0].clientX - this._deltaX;\n  }\n  _handleSwipe() {\n    const absDeltaX = Math.abs(this._deltaX);\n    if (absDeltaX <= SWIPE_THRESHOLD) {\n      return;\n    }\n    const direction = absDeltaX / this._deltaX;\n    this._deltaX = 0;\n    if (!direction) {\n      return;\n    }\n    execute(direction > 0 ? this._config.rightCallback : this._config.leftCallback);\n  }\n  _initEvents() {\n    if (this._supportPointerEvents) {\n      EventHandler.on(this._element, EVENT_POINTERDOWN, event => this._start(event));\n      EventHandler.on(this._element, EVENT_POINTERUP, event => this._end(event));\n      this._element.classList.add(CLASS_NAME_POINTER_EVENT);\n    } else {\n      EventHandler.on(this._element, EVENT_TOUCHSTART, event => this._start(event));\n      EventHandler.on(this._element, EVENT_TOUCHMOVE, event => this._move(event));\n      EventHandler.on(this._element, EVENT_TOUCHEND, event => this._end(event));\n    }\n  }\n  _eventIsPointerPenTouch(event) {\n    return this._supportPointerEvents && (event.pointerType === POINTER_TYPE_PEN || event.pointerType === POINTER_TYPE_TOUCH);\n  }\n\n  // Static\n  static isSupported() {\n    return 'ontouchstart' in document.documentElement || navigator.maxTouchPoints > 0;\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap carousel.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$c = 'carousel';\nconst DATA_KEY$8 = 'bs.carousel';\nconst EVENT_KEY$8 = `.${DATA_KEY$8}`;\nconst DATA_API_KEY$5 = '.data-api';\nconst ARROW_LEFT_KEY$1 = 'ArrowLeft';\nconst ARROW_RIGHT_KEY$1 = 'ArrowRight';\nconst TOUCHEVENT_COMPAT_WAIT = 500; // Time for mouse compat events to fire after touch\n\nconst ORDER_NEXT = 'next';\nconst ORDER_PREV = 'prev';\nconst DIRECTION_LEFT = 'left';\nconst DIRECTION_RIGHT = 'right';\nconst EVENT_SLIDE = `slide${EVENT_KEY$8}`;\nconst EVENT_SLID = `slid${EVENT_KEY$8}`;\nconst EVENT_KEYDOWN$1 = `keydown${EVENT_KEY$8}`;\nconst EVENT_MOUSEENTER$1 = `mouseenter${EVENT_KEY$8}`;\nconst EVENT_MOUSELEAVE$1 = `mouseleave${EVENT_KEY$8}`;\nconst EVENT_DRAG_START = `dragstart${EVENT_KEY$8}`;\nconst EVENT_LOAD_DATA_API$3 = `load${EVENT_KEY$8}${DATA_API_KEY$5}`;\nconst EVENT_CLICK_DATA_API$5 = `click${EVENT_KEY$8}${DATA_API_KEY$5}`;\nconst CLASS_NAME_CAROUSEL = 'carousel';\nconst CLASS_NAME_ACTIVE$2 = 'active';\nconst CLASS_NAME_SLIDE = 'slide';\nconst CLASS_NAME_END = 'carousel-item-end';\nconst CLASS_NAME_START = 'carousel-item-start';\nconst CLASS_NAME_NEXT = 'carousel-item-next';\nconst CLASS_NAME_PREV = 'carousel-item-prev';\nconst SELECTOR_ACTIVE = '.active';\nconst SELECTOR_ITEM = '.carousel-item';\nconst SELECTOR_ACTIVE_ITEM = SELECTOR_ACTIVE + SELECTOR_ITEM;\nconst SELECTOR_ITEM_IMG = '.carousel-item img';\nconst SELECTOR_INDICATORS = '.carousel-indicators';\nconst SELECTOR_DATA_SLIDE = '[data-bs-slide], [data-bs-slide-to]';\nconst SELECTOR_DATA_RIDE = '[data-bs-ride=\"carousel\"]';\nconst KEY_TO_DIRECTION = {\n  [ARROW_LEFT_KEY$1]: DIRECTION_RIGHT,\n  [ARROW_RIGHT_KEY$1]: DIRECTION_LEFT\n};\nconst Default$b = {\n  interval: 5000,\n  keyboard: true,\n  pause: 'hover',\n  ride: false,\n  touch: true,\n  wrap: true\n};\nconst DefaultType$b = {\n  interval: '(number|boolean)',\n  // TODO:v6 remove boolean support\n  keyboard: 'boolean',\n  pause: '(string|boolean)',\n  ride: '(boolean|string)',\n  touch: 'boolean',\n  wrap: 'boolean'\n};\n\n/**\n * Class definition\n */\n\nclass Carousel extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._interval = null;\n    this._activeElement = null;\n    this._isSliding = false;\n    this.touchTimeout = null;\n    this._swipeHelper = null;\n    this._indicatorsElement = SelectorEngine.findOne(SELECTOR_INDICATORS, this._element);\n    this._addEventListeners();\n    if (this._config.ride === CLASS_NAME_CAROUSEL) {\n      this.cycle();\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default$b;\n  }\n  static get DefaultType() {\n    return DefaultType$b;\n  }\n  static get NAME() {\n    return NAME$c;\n  }\n\n  // Public\n  next() {\n    this._slide(ORDER_NEXT);\n  }\n  nextWhenVisible() {\n    // FIXME TODO use `document.visibilityState`\n    // Don't call next when the page isn't visible\n    // or the carousel or its parent isn't visible\n    if (!document.hidden && isVisible(this._element)) {\n      this.next();\n    }\n  }\n  prev() {\n    this._slide(ORDER_PREV);\n  }\n  pause() {\n    if (this._isSliding) {\n      triggerTransitionEnd(this._element);\n    }\n    this._clearInterval();\n  }\n  cycle() {\n    this._clearInterval();\n    this._updateInterval();\n    this._interval = setInterval(() => this.nextWhenVisible(), this._config.interval);\n  }\n  _maybeEnableCycle() {\n    if (!this._config.ride) {\n      return;\n    }\n    if (this._isSliding) {\n      EventHandler.one(this._element, EVENT_SLID, () => this.cycle());\n      return;\n    }\n    this.cycle();\n  }\n  to(index) {\n    const items = this._getItems();\n    if (index > items.length - 1 || index < 0) {\n      return;\n    }\n    if (this._isSliding) {\n      EventHandler.one(this._element, EVENT_SLID, () => this.to(index));\n      return;\n    }\n    const activeIndex = this._getItemIndex(this._getActive());\n    if (activeIndex === index) {\n      return;\n    }\n    const order = index > activeIndex ? ORDER_NEXT : ORDER_PREV;\n    this._slide(order, items[index]);\n  }\n  dispose() {\n    if (this._swipeHelper) {\n      this._swipeHelper.dispose();\n    }\n    super.dispose();\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    config.defaultInterval = config.interval;\n    return config;\n  }\n  _addEventListeners() {\n    if (this._config.keyboard) {\n      EventHandler.on(this._element, EVENT_KEYDOWN$1, event => this._keydown(event));\n    }\n    if (this._config.pause === 'hover') {\n      EventHandler.on(this._element, EVENT_MOUSEENTER$1, () => this.pause());\n      EventHandler.on(this._element, EVENT_MOUSELEAVE$1, () => this._maybeEnableCycle());\n    }\n    if (this._config.touch && Swipe.isSupported()) {\n      this._addTouchEventListeners();\n    }\n  }\n  _addTouchEventListeners() {\n    for (const img of SelectorEngine.find(SELECTOR_ITEM_IMG, this._element)) {\n      EventHandler.on(img, EVENT_DRAG_START, event => event.preventDefault());\n    }\n    const endCallBack = () => {\n      if (this._config.pause !== 'hover') {\n        return;\n      }\n\n      // If it's a touch-enabled device, mouseenter/leave are fired as\n      // part of the mouse compatibility events on first tap - the carousel\n      // would stop cycling until user tapped out of it;\n      // here, we listen for touchend, explicitly pause the carousel\n      // (as if it's the second time we tap on it, mouseenter compat event\n      // is NOT fired) and after a timeout (to allow for mouse compatibility\n      // events to fire) we explicitly restart cycling\n\n      this.pause();\n      if (this.touchTimeout) {\n        clearTimeout(this.touchTimeout);\n      }\n      this.touchTimeout = setTimeout(() => this._maybeEnableCycle(), TOUCHEVENT_COMPAT_WAIT + this._config.interval);\n    };\n    const swipeConfig = {\n      leftCallback: () => this._slide(this._directionToOrder(DIRECTION_LEFT)),\n      rightCallback: () => this._slide(this._directionToOrder(DIRECTION_RIGHT)),\n      endCallback: endCallBack\n    };\n    this._swipeHelper = new Swipe(this._element, swipeConfig);\n  }\n  _keydown(event) {\n    if (/input|textarea/i.test(event.target.tagName)) {\n      return;\n    }\n    const direction = KEY_TO_DIRECTION[event.key];\n    if (direction) {\n      event.preventDefault();\n      this._slide(this._directionToOrder(direction));\n    }\n  }\n  _getItemIndex(element) {\n    return this._getItems().indexOf(element);\n  }\n  _setActiveIndicatorElement(index) {\n    if (!this._indicatorsElement) {\n      return;\n    }\n    const activeIndicator = SelectorEngine.findOne(SELECTOR_ACTIVE, this._indicatorsElement);\n    activeIndicator.classList.remove(CLASS_NAME_ACTIVE$2);\n    activeIndicator.removeAttribute('aria-current');\n    const newActiveIndicator = SelectorEngine.findOne(`[data-bs-slide-to=\"${index}\"]`, this._indicatorsElement);\n    if (newActiveIndicator) {\n      newActiveIndicator.classList.add(CLASS_NAME_ACTIVE$2);\n      newActiveIndicator.setAttribute('aria-current', 'true');\n    }\n  }\n  _updateInterval() {\n    const element = this._activeElement || this._getActive();\n    if (!element) {\n      return;\n    }\n    const elementInterval = Number.parseInt(element.getAttribute('data-bs-interval'), 10);\n    this._config.interval = elementInterval || this._config.defaultInterval;\n  }\n  _slide(order, element = null) {\n    if (this._isSliding) {\n      return;\n    }\n    const activeElement = this._getActive();\n    const isNext = order === ORDER_NEXT;\n    const nextElement = element || getNextActiveElement(this._getItems(), activeElement, isNext, this._config.wrap);\n    if (nextElement === activeElement) {\n      return;\n    }\n    const nextElementIndex = this._getItemIndex(nextElement);\n    const triggerEvent = eventName => {\n      return EventHandler.trigger(this._element, eventName, {\n        relatedTarget: nextElement,\n        direction: this._orderToDirection(order),\n        from: this._getItemIndex(activeElement),\n        to: nextElementIndex\n      });\n    };\n    const slideEvent = triggerEvent(EVENT_SLIDE);\n    if (slideEvent.defaultPrevented) {\n      return;\n    }\n    if (!activeElement || !nextElement) {\n      // Some weirdness is happening, so we bail\n      // TODO: change tests that use empty divs to avoid this check\n      return;\n    }\n    const isCycling = Boolean(this._interval);\n    this.pause();\n    this._isSliding = true;\n    this._setActiveIndicatorElement(nextElementIndex);\n    this._activeElement = nextElement;\n    const directionalClassName = isNext ? CLASS_NAME_START : CLASS_NAME_END;\n    const orderClassName = isNext ? CLASS_NAME_NEXT : CLASS_NAME_PREV;\n    nextElement.classList.add(orderClassName);\n    reflow(nextElement);\n    activeElement.classList.add(directionalClassName);\n    nextElement.classList.add(directionalClassName);\n    const completeCallBack = () => {\n      nextElement.classList.remove(directionalClassName, orderClassName);\n      nextElement.classList.add(CLASS_NAME_ACTIVE$2);\n      activeElement.classList.remove(CLASS_NAME_ACTIVE$2, orderClassName, directionalClassName);\n      this._isSliding = false;\n      triggerEvent(EVENT_SLID);\n    };\n    this._queueCallback(completeCallBack, activeElement, this._isAnimated());\n    if (isCycling) {\n      this.cycle();\n    }\n  }\n  _isAnimated() {\n    return this._element.classList.contains(CLASS_NAME_SLIDE);\n  }\n  _getActive() {\n    return SelectorEngine.findOne(SELECTOR_ACTIVE_ITEM, this._element);\n  }\n  _getItems() {\n    return SelectorEngine.find(SELECTOR_ITEM, this._element);\n  }\n  _clearInterval() {\n    if (this._interval) {\n      clearInterval(this._interval);\n      this._interval = null;\n    }\n  }\n  _directionToOrder(direction) {\n    if (isRTL()) {\n      return direction === DIRECTION_LEFT ? ORDER_PREV : ORDER_NEXT;\n    }\n    return direction === DIRECTION_LEFT ? ORDER_NEXT : ORDER_PREV;\n  }\n  _orderToDirection(order) {\n    if (isRTL()) {\n      return order === ORDER_PREV ? DIRECTION_LEFT : DIRECTION_RIGHT;\n    }\n    return order === ORDER_PREV ? DIRECTION_RIGHT : DIRECTION_LEFT;\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Carousel.getOrCreateInstance(this, config);\n      if (typeof config === 'number') {\n        data.to(config);\n        return;\n      }\n      if (typeof config === 'string') {\n        if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n          throw new TypeError(`No method named \"${config}\"`);\n        }\n        data[config]();\n      }\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API$5, SELECTOR_DATA_SLIDE, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this);\n  if (!target || !target.classList.contains(CLASS_NAME_CAROUSEL)) {\n    return;\n  }\n  event.preventDefault();\n  const carousel = Carousel.getOrCreateInstance(target);\n  const slideIndex = this.getAttribute('data-bs-slide-to');\n  if (slideIndex) {\n    carousel.to(slideIndex);\n    carousel._maybeEnableCycle();\n    return;\n  }\n  if (Manipulator.getDataAttribute(this, 'slide') === 'next') {\n    carousel.next();\n    carousel._maybeEnableCycle();\n    return;\n  }\n  carousel.prev();\n  carousel._maybeEnableCycle();\n});\nEventHandler.on(window, EVENT_LOAD_DATA_API$3, () => {\n  const carousels = SelectorEngine.find(SELECTOR_DATA_RIDE);\n  for (const carousel of carousels) {\n    Carousel.getOrCreateInstance(carousel);\n  }\n});\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Carousel);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap collapse.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$b = 'collapse';\nconst DATA_KEY$7 = 'bs.collapse';\nconst EVENT_KEY$7 = `.${DATA_KEY$7}`;\nconst DATA_API_KEY$4 = '.data-api';\nconst EVENT_SHOW$6 = `show${EVENT_KEY$7}`;\nconst EVENT_SHOWN$6 = `shown${EVENT_KEY$7}`;\nconst EVENT_HIDE$6 = `hide${EVENT_KEY$7}`;\nconst EVENT_HIDDEN$6 = `hidden${EVENT_KEY$7}`;\nconst EVENT_CLICK_DATA_API$4 = `click${EVENT_KEY$7}${DATA_API_KEY$4}`;\nconst CLASS_NAME_SHOW$7 = 'show';\nconst CLASS_NAME_COLLAPSE = 'collapse';\nconst CLASS_NAME_COLLAPSING = 'collapsing';\nconst CLASS_NAME_COLLAPSED = 'collapsed';\nconst CLASS_NAME_DEEPER_CHILDREN = `:scope .${CLASS_NAME_COLLAPSE} .${CLASS_NAME_COLLAPSE}`;\nconst CLASS_NAME_HORIZONTAL = 'collapse-horizontal';\nconst WIDTH = 'width';\nconst HEIGHT = 'height';\nconst SELECTOR_ACTIVES = '.collapse.show, .collapse.collapsing';\nconst SELECTOR_DATA_TOGGLE$4 = '[data-bs-toggle=\"collapse\"]';\nconst Default$a = {\n  parent: null,\n  toggle: true\n};\nconst DefaultType$a = {\n  parent: '(null|element)',\n  toggle: 'boolean'\n};\n\n/**\n * Class definition\n */\n\nclass Collapse extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._isTransitioning = false;\n    this._triggerArray = [];\n    const toggleList = SelectorEngine.find(SELECTOR_DATA_TOGGLE$4);\n    for (const elem of toggleList) {\n      const selector = SelectorEngine.getSelectorFromElement(elem);\n      const filterElement = SelectorEngine.find(selector).filter(foundElement => foundElement === this._element);\n      if (selector !== null && filterElement.length) {\n        this._triggerArray.push(elem);\n      }\n    }\n    this._initializeChildren();\n    if (!this._config.parent) {\n      this._addAriaAndCollapsedClass(this._triggerArray, this._isShown());\n    }\n    if (this._config.toggle) {\n      this.toggle();\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default$a;\n  }\n  static get DefaultType() {\n    return DefaultType$a;\n  }\n  static get NAME() {\n    return NAME$b;\n  }\n\n  // Public\n  toggle() {\n    if (this._isShown()) {\n      this.hide();\n    } else {\n      this.show();\n    }\n  }\n  show() {\n    if (this._isTransitioning || this._isShown()) {\n      return;\n    }\n    let activeChildren = [];\n\n    // find active children\n    if (this._config.parent) {\n      activeChildren = this._getFirstLevelChildren(SELECTOR_ACTIVES).filter(element => element !== this._element).map(element => Collapse.getOrCreateInstance(element, {\n        toggle: false\n      }));\n    }\n    if (activeChildren.length && activeChildren[0]._isTransitioning) {\n      return;\n    }\n    const startEvent = EventHandler.trigger(this._element, EVENT_SHOW$6);\n    if (startEvent.defaultPrevented) {\n      return;\n    }\n    for (const activeInstance of activeChildren) {\n      activeInstance.hide();\n    }\n    const dimension = this._getDimension();\n    this._element.classList.remove(CLASS_NAME_COLLAPSE);\n    this._element.classList.add(CLASS_NAME_COLLAPSING);\n    this._element.style[dimension] = 0;\n    this._addAriaAndCollapsedClass(this._triggerArray, true);\n    this._isTransitioning = true;\n    const complete = () => {\n      this._isTransitioning = false;\n      this._element.classList.remove(CLASS_NAME_COLLAPSING);\n      this._element.classList.add(CLASS_NAME_COLLAPSE, CLASS_NAME_SHOW$7);\n      this._element.style[dimension] = '';\n      EventHandler.trigger(this._element, EVENT_SHOWN$6);\n    };\n    const capitalizedDimension = dimension[0].toUpperCase() + dimension.slice(1);\n    const scrollSize = `scroll${capitalizedDimension}`;\n    this._queueCallback(complete, this._element, true);\n    this._element.style[dimension] = `${this._element[scrollSize]}px`;\n  }\n  hide() {\n    if (this._isTransitioning || !this._isShown()) {\n      return;\n    }\n    const startEvent = EventHandler.trigger(this._element, EVENT_HIDE$6);\n    if (startEvent.defaultPrevented) {\n      return;\n    }\n    const dimension = this._getDimension();\n    this._element.style[dimension] = `${this._element.getBoundingClientRect()[dimension]}px`;\n    reflow(this._element);\n    this._element.classList.add(CLASS_NAME_COLLAPSING);\n    this._element.classList.remove(CLASS_NAME_COLLAPSE, CLASS_NAME_SHOW$7);\n    for (const trigger of this._triggerArray) {\n      const element = SelectorEngine.getElementFromSelector(trigger);\n      if (element && !this._isShown(element)) {\n        this._addAriaAndCollapsedClass([trigger], false);\n      }\n    }\n    this._isTransitioning = true;\n    const complete = () => {\n      this._isTransitioning = false;\n      this._element.classList.remove(CLASS_NAME_COLLAPSING);\n      this._element.classList.add(CLASS_NAME_COLLAPSE);\n      EventHandler.trigger(this._element, EVENT_HIDDEN$6);\n    };\n    this._element.style[dimension] = '';\n    this._queueCallback(complete, this._element, true);\n  }\n  _isShown(element = this._element) {\n    return element.classList.contains(CLASS_NAME_SHOW$7);\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    config.toggle = Boolean(config.toggle); // Coerce string values\n    config.parent = getElement(config.parent);\n    return config;\n  }\n  _getDimension() {\n    return this._element.classList.contains(CLASS_NAME_HORIZONTAL) ? WIDTH : HEIGHT;\n  }\n  _initializeChildren() {\n    if (!this._config.parent) {\n      return;\n    }\n    const children = this._getFirstLevelChildren(SELECTOR_DATA_TOGGLE$4);\n    for (const element of children) {\n      const selected = SelectorEngine.getElementFromSelector(element);\n      if (selected) {\n        this._addAriaAndCollapsedClass([element], this._isShown(selected));\n      }\n    }\n  }\n  _getFirstLevelChildren(selector) {\n    const children = SelectorEngine.find(CLASS_NAME_DEEPER_CHILDREN, this._config.parent);\n    // remove children if greater depth\n    return SelectorEngine.find(selector, this._config.parent).filter(element => !children.includes(element));\n  }\n  _addAriaAndCollapsedClass(triggerArray, isOpen) {\n    if (!triggerArray.length) {\n      return;\n    }\n    for (const element of triggerArray) {\n      element.classList.toggle(CLASS_NAME_COLLAPSED, !isOpen);\n      element.setAttribute('aria-expanded', isOpen);\n    }\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    const _config = {};\n    if (typeof config === 'string' && /show|hide/.test(config)) {\n      _config.toggle = false;\n    }\n    return this.each(function () {\n      const data = Collapse.getOrCreateInstance(this, _config);\n      if (typeof config === 'string') {\n        if (typeof data[config] === 'undefined') {\n          throw new TypeError(`No method named \"${config}\"`);\n        }\n        data[config]();\n      }\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API$4, SELECTOR_DATA_TOGGLE$4, function (event) {\n  // preventDefault only for <a> elements (which change the URL) not inside the collapsible element\n  if (event.target.tagName === 'A' || event.delegateTarget && event.delegateTarget.tagName === 'A') {\n    event.preventDefault();\n  }\n  for (const element of SelectorEngine.getMultipleElementsFromSelector(this)) {\n    Collapse.getOrCreateInstance(element, {\n      toggle: false\n    }).toggle();\n  }\n});\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Collapse);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap dropdown.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$a = 'dropdown';\nconst DATA_KEY$6 = 'bs.dropdown';\nconst EVENT_KEY$6 = `.${DATA_KEY$6}`;\nconst DATA_API_KEY$3 = '.data-api';\nconst ESCAPE_KEY$2 = 'Escape';\nconst TAB_KEY$1 = 'Tab';\nconst ARROW_UP_KEY$1 = 'ArrowUp';\nconst ARROW_DOWN_KEY$1 = 'ArrowDown';\nconst RIGHT_MOUSE_BUTTON = 2; // MouseEvent.button value for the secondary button, usually the right button\n\nconst EVENT_HIDE$5 = `hide${EVENT_KEY$6}`;\nconst EVENT_HIDDEN$5 = `hidden${EVENT_KEY$6}`;\nconst EVENT_SHOW$5 = `show${EVENT_KEY$6}`;\nconst EVENT_SHOWN$5 = `shown${EVENT_KEY$6}`;\nconst EVENT_CLICK_DATA_API$3 = `click${EVENT_KEY$6}${DATA_API_KEY$3}`;\nconst EVENT_KEYDOWN_DATA_API = `keydown${EVENT_KEY$6}${DATA_API_KEY$3}`;\nconst EVENT_KEYUP_DATA_API = `keyup${EVENT_KEY$6}${DATA_API_KEY$3}`;\nconst CLASS_NAME_SHOW$6 = 'show';\nconst CLASS_NAME_DROPUP = 'dropup';\nconst CLASS_NAME_DROPEND = 'dropend';\nconst CLASS_NAME_DROPSTART = 'dropstart';\nconst CLASS_NAME_DROPUP_CENTER = 'dropup-center';\nconst CLASS_NAME_DROPDOWN_CENTER = 'dropdown-center';\nconst SELECTOR_DATA_TOGGLE$3 = '[data-bs-toggle=\"dropdown\"]:not(.disabled):not(:disabled)';\nconst SELECTOR_DATA_TOGGLE_SHOWN = `${SELECTOR_DATA_TOGGLE$3}.${CLASS_NAME_SHOW$6}`;\nconst SELECTOR_MENU = '.dropdown-menu';\nconst SELECTOR_NAVBAR = '.navbar';\nconst SELECTOR_NAVBAR_NAV = '.navbar-nav';\nconst SELECTOR_VISIBLE_ITEMS = '.dropdown-menu .dropdown-item:not(.disabled):not(:disabled)';\nconst PLACEMENT_TOP = isRTL() ? 'top-end' : 'top-start';\nconst PLACEMENT_TOPEND = isRTL() ? 'top-start' : 'top-end';\nconst PLACEMENT_BOTTOM = isRTL() ? 'bottom-end' : 'bottom-start';\nconst PLACEMENT_BOTTOMEND = isRTL() ? 'bottom-start' : 'bottom-end';\nconst PLACEMENT_RIGHT = isRTL() ? 'left-start' : 'right-start';\nconst PLACEMENT_LEFT = isRTL() ? 'right-start' : 'left-start';\nconst PLACEMENT_TOPCENTER = 'top';\nconst PLACEMENT_BOTTOMCENTER = 'bottom';\nconst Default$9 = {\n  autoClose: true,\n  boundary: 'clippingParents',\n  display: 'dynamic',\n  offset: [0, 2],\n  popperConfig: null,\n  reference: 'toggle'\n};\nconst DefaultType$9 = {\n  autoClose: '(boolean|string)',\n  boundary: '(string|element)',\n  display: 'string',\n  offset: '(array|string|function)',\n  popperConfig: '(null|object|function)',\n  reference: '(string|element|object)'\n};\n\n/**\n * Class definition\n */\n\nclass Dropdown extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._popper = null;\n    this._parent = this._element.parentNode; // dropdown wrapper\n    // TODO: v6 revert #37011 & change markup https://getbootstrap.com/docs/5.3/forms/input-group/\n    this._menu = SelectorEngine.next(this._element, SELECTOR_MENU)[0] || SelectorEngine.prev(this._element, SELECTOR_MENU)[0] || SelectorEngine.findOne(SELECTOR_MENU, this._parent);\n    this._inNavbar = this._detectNavbar();\n  }\n\n  // Getters\n  static get Default() {\n    return Default$9;\n  }\n  static get DefaultType() {\n    return DefaultType$9;\n  }\n  static get NAME() {\n    return NAME$a;\n  }\n\n  // Public\n  toggle() {\n    return this._isShown() ? this.hide() : this.show();\n  }\n  show() {\n    if (isDisabled(this._element) || this._isShown()) {\n      return;\n    }\n    const relatedTarget = {\n      relatedTarget: this._element\n    };\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW$5, relatedTarget);\n    if (showEvent.defaultPrevented) {\n      return;\n    }\n    this._createPopper();\n\n    // If this is a touch-enabled device we add extra\n    // empty mouseover listeners to the body's immediate children;\n    // only needed because of broken event delegation on iOS\n    // https://www.quirksmode.org/blog/archives/2014/02/mouse_event_bub.html\n    if ('ontouchstart' in document.documentElement && !this._parent.closest(SELECTOR_NAVBAR_NAV)) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.on(element, 'mouseover', noop);\n      }\n    }\n    this._element.focus();\n    this._element.setAttribute('aria-expanded', true);\n    this._menu.classList.add(CLASS_NAME_SHOW$6);\n    this._element.classList.add(CLASS_NAME_SHOW$6);\n    EventHandler.trigger(this._element, EVENT_SHOWN$5, relatedTarget);\n  }\n  hide() {\n    if (isDisabled(this._element) || !this._isShown()) {\n      return;\n    }\n    const relatedTarget = {\n      relatedTarget: this._element\n    };\n    this._completeHide(relatedTarget);\n  }\n  dispose() {\n    if (this._popper) {\n      this._popper.destroy();\n    }\n    super.dispose();\n  }\n  update() {\n    this._inNavbar = this._detectNavbar();\n    if (this._popper) {\n      this._popper.update();\n    }\n  }\n\n  // Private\n  _completeHide(relatedTarget) {\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE$5, relatedTarget);\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n\n    // If this is a touch-enabled device we remove the extra\n    // empty mouseover listeners we added for iOS support\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.off(element, 'mouseover', noop);\n      }\n    }\n    if (this._popper) {\n      this._popper.destroy();\n    }\n    this._menu.classList.remove(CLASS_NAME_SHOW$6);\n    this._element.classList.remove(CLASS_NAME_SHOW$6);\n    this._element.setAttribute('aria-expanded', 'false');\n    Manipulator.removeDataAttribute(this._menu, 'popper');\n    EventHandler.trigger(this._element, EVENT_HIDDEN$5, relatedTarget);\n  }\n  _getConfig(config) {\n    config = super._getConfig(config);\n    if (typeof config.reference === 'object' && !isElement(config.reference) && typeof config.reference.getBoundingClientRect !== 'function') {\n      // Popper virtual elements require a getBoundingClientRect method\n      throw new TypeError(`${NAME$a.toUpperCase()}: Option \"reference\" provided type \"object\" without a required \"getBoundingClientRect\" method.`);\n    }\n    return config;\n  }\n  _createPopper() {\n    if (typeof Popper === 'undefined') {\n      throw new TypeError('Bootstrap\\'s dropdowns require Popper (https://popper.js.org)');\n    }\n    let referenceElement = this._element;\n    if (this._config.reference === 'parent') {\n      referenceElement = this._parent;\n    } else if (isElement(this._config.reference)) {\n      referenceElement = getElement(this._config.reference);\n    } else if (typeof this._config.reference === 'object') {\n      referenceElement = this._config.reference;\n    }\n    const popperConfig = this._getPopperConfig();\n    this._popper = Popper.createPopper(referenceElement, this._menu, popperConfig);\n  }\n  _isShown() {\n    return this._menu.classList.contains(CLASS_NAME_SHOW$6);\n  }\n  _getPlacement() {\n    const parentDropdown = this._parent;\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPEND)) {\n      return PLACEMENT_RIGHT;\n    }\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPSTART)) {\n      return PLACEMENT_LEFT;\n    }\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPUP_CENTER)) {\n      return PLACEMENT_TOPCENTER;\n    }\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPDOWN_CENTER)) {\n      return PLACEMENT_BOTTOMCENTER;\n    }\n\n    // We need to trim the value because custom properties can also include spaces\n    const isEnd = getComputedStyle(this._menu).getPropertyValue('--bs-position').trim() === 'end';\n    if (parentDropdown.classList.contains(CLASS_NAME_DROPUP)) {\n      return isEnd ? PLACEMENT_TOPEND : PLACEMENT_TOP;\n    }\n    return isEnd ? PLACEMENT_BOTTOMEND : PLACEMENT_BOTTOM;\n  }\n  _detectNavbar() {\n    return this._element.closest(SELECTOR_NAVBAR) !== null;\n  }\n  _getOffset() {\n    const {\n      offset\n    } = this._config;\n    if (typeof offset === 'string') {\n      return offset.split(',').map(value => Number.parseInt(value, 10));\n    }\n    if (typeof offset === 'function') {\n      return popperData => offset(popperData, this._element);\n    }\n    return offset;\n  }\n  _getPopperConfig() {\n    const defaultBsPopperConfig = {\n      placement: this._getPlacement(),\n      modifiers: [{\n        name: 'preventOverflow',\n        options: {\n          boundary: this._config.boundary\n        }\n      }, {\n        name: 'offset',\n        options: {\n          offset: this._getOffset()\n        }\n      }]\n    };\n\n    // Disable Popper if we have a static display or Dropdown is in Navbar\n    if (this._inNavbar || this._config.display === 'static') {\n      Manipulator.setDataAttribute(this._menu, 'popper', 'static'); // TODO: v6 remove\n      defaultBsPopperConfig.modifiers = [{\n        name: 'applyStyles',\n        enabled: false\n      }];\n    }\n    return {\n      ...defaultBsPopperConfig,\n      ...execute(this._config.popperConfig, [defaultBsPopperConfig])\n    };\n  }\n  _selectMenuItem({\n    key,\n    target\n  }) {\n    const items = SelectorEngine.find(SELECTOR_VISIBLE_ITEMS, this._menu).filter(element => isVisible(element));\n    if (!items.length) {\n      return;\n    }\n\n    // if target isn't included in items (e.g. when expanding the dropdown)\n    // allow cycling to get the last item in case key equals ARROW_UP_KEY\n    getNextActiveElement(items, target, key === ARROW_DOWN_KEY$1, !items.includes(target)).focus();\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Dropdown.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config]();\n    });\n  }\n  static clearMenus(event) {\n    if (event.button === RIGHT_MOUSE_BUTTON || event.type === 'keyup' && event.key !== TAB_KEY$1) {\n      return;\n    }\n    const openToggles = SelectorEngine.find(SELECTOR_DATA_TOGGLE_SHOWN);\n    for (const toggle of openToggles) {\n      const context = Dropdown.getInstance(toggle);\n      if (!context || context._config.autoClose === false) {\n        continue;\n      }\n      const composedPath = event.composedPath();\n      const isMenuTarget = composedPath.includes(context._menu);\n      if (composedPath.includes(context._element) || context._config.autoClose === 'inside' && !isMenuTarget || context._config.autoClose === 'outside' && isMenuTarget) {\n        continue;\n      }\n\n      // Tab navigation through the dropdown menu or events from contained inputs shouldn't close the menu\n      if (context._menu.contains(event.target) && (event.type === 'keyup' && event.key === TAB_KEY$1 || /input|select|option|textarea|form/i.test(event.target.tagName))) {\n        continue;\n      }\n      const relatedTarget = {\n        relatedTarget: context._element\n      };\n      if (event.type === 'click') {\n        relatedTarget.clickEvent = event;\n      }\n      context._completeHide(relatedTarget);\n    }\n  }\n  static dataApiKeydownHandler(event) {\n    // If not an UP | DOWN | ESCAPE key => not a dropdown command\n    // If input/textarea && if key is other than ESCAPE => not a dropdown command\n\n    const isInput = /input|textarea/i.test(event.target.tagName);\n    const isEscapeEvent = event.key === ESCAPE_KEY$2;\n    const isUpOrDownEvent = [ARROW_UP_KEY$1, ARROW_DOWN_KEY$1].includes(event.key);\n    if (!isUpOrDownEvent && !isEscapeEvent) {\n      return;\n    }\n    if (isInput && !isEscapeEvent) {\n      return;\n    }\n    event.preventDefault();\n\n    // TODO: v6 revert #37011 & change markup https://getbootstrap.com/docs/5.3/forms/input-group/\n    const getToggleButton = this.matches(SELECTOR_DATA_TOGGLE$3) ? this : SelectorEngine.prev(this, SELECTOR_DATA_TOGGLE$3)[0] || SelectorEngine.next(this, SELECTOR_DATA_TOGGLE$3)[0] || SelectorEngine.findOne(SELECTOR_DATA_TOGGLE$3, event.delegateTarget.parentNode);\n    const instance = Dropdown.getOrCreateInstance(getToggleButton);\n    if (isUpOrDownEvent) {\n      event.stopPropagation();\n      instance.show();\n      instance._selectMenuItem(event);\n      return;\n    }\n    if (instance._isShown()) {\n      // else is escape and we check if it is shown\n      event.stopPropagation();\n      instance.hide();\n      getToggleButton.focus();\n    }\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_KEYDOWN_DATA_API, SELECTOR_DATA_TOGGLE$3, Dropdown.dataApiKeydownHandler);\nEventHandler.on(document, EVENT_KEYDOWN_DATA_API, SELECTOR_MENU, Dropdown.dataApiKeydownHandler);\nEventHandler.on(document, EVENT_CLICK_DATA_API$3, Dropdown.clearMenus);\nEventHandler.on(document, EVENT_KEYUP_DATA_API, Dropdown.clearMenus);\nEventHandler.on(document, EVENT_CLICK_DATA_API$3, SELECTOR_DATA_TOGGLE$3, function (event) {\n  event.preventDefault();\n  Dropdown.getOrCreateInstance(this).toggle();\n});\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Dropdown);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/backdrop.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$9 = 'backdrop';\nconst CLASS_NAME_FADE$4 = 'fade';\nconst CLASS_NAME_SHOW$5 = 'show';\nconst EVENT_MOUSEDOWN = `mousedown.bs.${NAME$9}`;\nconst Default$8 = {\n  className: 'modal-backdrop',\n  clickCallback: null,\n  isAnimated: false,\n  isVisible: true,\n  // if false, we use the backdrop helper without adding any element to the dom\n  rootElement: 'body' // give the choice to place backdrop under different elements\n};\n\nconst DefaultType$8 = {\n  className: 'string',\n  clickCallback: '(function|null)',\n  isAnimated: 'boolean',\n  isVisible: 'boolean',\n  rootElement: '(element|string)'\n};\n\n/**\n * Class definition\n */\n\nclass Backdrop extends Config {\n  constructor(config) {\n    super();\n    this._config = this._getConfig(config);\n    this._isAppended = false;\n    this._element = null;\n  }\n\n  // Getters\n  static get Default() {\n    return Default$8;\n  }\n  static get DefaultType() {\n    return DefaultType$8;\n  }\n  static get NAME() {\n    return NAME$9;\n  }\n\n  // Public\n  show(callback) {\n    if (!this._config.isVisible) {\n      execute(callback);\n      return;\n    }\n    this._append();\n    const element = this._getElement();\n    if (this._config.isAnimated) {\n      reflow(element);\n    }\n    element.classList.add(CLASS_NAME_SHOW$5);\n    this._emulateAnimation(() => {\n      execute(callback);\n    });\n  }\n  hide(callback) {\n    if (!this._config.isVisible) {\n      execute(callback);\n      return;\n    }\n    this._getElement().classList.remove(CLASS_NAME_SHOW$5);\n    this._emulateAnimation(() => {\n      this.dispose();\n      execute(callback);\n    });\n  }\n  dispose() {\n    if (!this._isAppended) {\n      return;\n    }\n    EventHandler.off(this._element, EVENT_MOUSEDOWN);\n    this._element.remove();\n    this._isAppended = false;\n  }\n\n  // Private\n  _getElement() {\n    if (!this._element) {\n      const backdrop = document.createElement('div');\n      backdrop.className = this._config.className;\n      if (this._config.isAnimated) {\n        backdrop.classList.add(CLASS_NAME_FADE$4);\n      }\n      this._element = backdrop;\n    }\n    return this._element;\n  }\n  _configAfterMerge(config) {\n    // use getElement() with the default \"body\" to get a fresh Element on each instantiation\n    config.rootElement = getElement(config.rootElement);\n    return config;\n  }\n  _append() {\n    if (this._isAppended) {\n      return;\n    }\n    const element = this._getElement();\n    this._config.rootElement.append(element);\n    EventHandler.on(element, EVENT_MOUSEDOWN, () => {\n      execute(this._config.clickCallback);\n    });\n    this._isAppended = true;\n  }\n  _emulateAnimation(callback) {\n    executeAfterTransition(callback, this._getElement(), this._config.isAnimated);\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/focustrap.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$8 = 'focustrap';\nconst DATA_KEY$5 = 'bs.focustrap';\nconst EVENT_KEY$5 = `.${DATA_KEY$5}`;\nconst EVENT_FOCUSIN$2 = `focusin${EVENT_KEY$5}`;\nconst EVENT_KEYDOWN_TAB = `keydown.tab${EVENT_KEY$5}`;\nconst TAB_KEY = 'Tab';\nconst TAB_NAV_FORWARD = 'forward';\nconst TAB_NAV_BACKWARD = 'backward';\nconst Default$7 = {\n  autofocus: true,\n  trapElement: null // The element to trap focus inside of\n};\n\nconst DefaultType$7 = {\n  autofocus: 'boolean',\n  trapElement: 'element'\n};\n\n/**\n * Class definition\n */\n\nclass FocusTrap extends Config {\n  constructor(config) {\n    super();\n    this._config = this._getConfig(config);\n    this._isActive = false;\n    this._lastTabNavDirection = null;\n  }\n\n  // Getters\n  static get Default() {\n    return Default$7;\n  }\n  static get DefaultType() {\n    return DefaultType$7;\n  }\n  static get NAME() {\n    return NAME$8;\n  }\n\n  // Public\n  activate() {\n    if (this._isActive) {\n      return;\n    }\n    if (this._config.autofocus) {\n      this._config.trapElement.focus();\n    }\n    EventHandler.off(document, EVENT_KEY$5); // guard against infinite focus loop\n    EventHandler.on(document, EVENT_FOCUSIN$2, event => this._handleFocusin(event));\n    EventHandler.on(document, EVENT_KEYDOWN_TAB, event => this._handleKeydown(event));\n    this._isActive = true;\n  }\n  deactivate() {\n    if (!this._isActive) {\n      return;\n    }\n    this._isActive = false;\n    EventHandler.off(document, EVENT_KEY$5);\n  }\n\n  // Private\n  _handleFocusin(event) {\n    const {\n      trapElement\n    } = this._config;\n    if (event.target === document || event.target === trapElement || trapElement.contains(event.target)) {\n      return;\n    }\n    const elements = SelectorEngine.focusableChildren(trapElement);\n    if (elements.length === 0) {\n      trapElement.focus();\n    } else if (this._lastTabNavDirection === TAB_NAV_BACKWARD) {\n      elements[elements.length - 1].focus();\n    } else {\n      elements[0].focus();\n    }\n  }\n  _handleKeydown(event) {\n    if (event.key !== TAB_KEY) {\n      return;\n    }\n    this._lastTabNavDirection = event.shiftKey ? TAB_NAV_BACKWARD : TAB_NAV_FORWARD;\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/scrollBar.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst SELECTOR_FIXED_CONTENT = '.fixed-top, .fixed-bottom, .is-fixed, .sticky-top';\nconst SELECTOR_STICKY_CONTENT = '.sticky-top';\nconst PROPERTY_PADDING = 'padding-right';\nconst PROPERTY_MARGIN = 'margin-right';\n\n/**\n * Class definition\n */\n\nclass ScrollBarHelper {\n  constructor() {\n    this._element = document.body;\n  }\n\n  // Public\n  getWidth() {\n    // https://developer.mozilla.org/en-US/docs/Web/API/Window/innerWidth#usage_notes\n    const documentWidth = document.documentElement.clientWidth;\n    return Math.abs(window.innerWidth - documentWidth);\n  }\n  hide() {\n    const width = this.getWidth();\n    this._disableOverFlow();\n    // give padding to element to balance the hidden scrollbar width\n    this._setElementAttributes(this._element, PROPERTY_PADDING, calculatedValue => calculatedValue + width);\n    // trick: We adjust positive paddingRight and negative marginRight to sticky-top elements to keep showing fullwidth\n    this._setElementAttributes(SELECTOR_FIXED_CONTENT, PROPERTY_PADDING, calculatedValue => calculatedValue + width);\n    this._setElementAttributes(SELECTOR_STICKY_CONTENT, PROPERTY_MARGIN, calculatedValue => calculatedValue - width);\n  }\n  reset() {\n    this._resetElementAttributes(this._element, 'overflow');\n    this._resetElementAttributes(this._element, PROPERTY_PADDING);\n    this._resetElementAttributes(SELECTOR_FIXED_CONTENT, PROPERTY_PADDING);\n    this._resetElementAttributes(SELECTOR_STICKY_CONTENT, PROPERTY_MARGIN);\n  }\n  isOverflowing() {\n    return this.getWidth() > 0;\n  }\n\n  // Private\n  _disableOverFlow() {\n    this._saveInitialAttribute(this._element, 'overflow');\n    this._element.style.overflow = 'hidden';\n  }\n  _setElementAttributes(selector, styleProperty, callback) {\n    const scrollbarWidth = this.getWidth();\n    const manipulationCallBack = element => {\n      if (element !== this._element && window.innerWidth > element.clientWidth + scrollbarWidth) {\n        return;\n      }\n      this._saveInitialAttribute(element, styleProperty);\n      const calculatedValue = window.getComputedStyle(element).getPropertyValue(styleProperty);\n      element.style.setProperty(styleProperty, `${callback(Number.parseFloat(calculatedValue))}px`);\n    };\n    this._applyManipulationCallback(selector, manipulationCallBack);\n  }\n  _saveInitialAttribute(element, styleProperty) {\n    const actualValue = element.style.getPropertyValue(styleProperty);\n    if (actualValue) {\n      Manipulator.setDataAttribute(element, styleProperty, actualValue);\n    }\n  }\n  _resetElementAttributes(selector, styleProperty) {\n    const manipulationCallBack = element => {\n      const value = Manipulator.getDataAttribute(element, styleProperty);\n      // We only want to remove the property if the value is `null`; the value can also be zero\n      if (value === null) {\n        element.style.removeProperty(styleProperty);\n        return;\n      }\n      Manipulator.removeDataAttribute(element, styleProperty);\n      element.style.setProperty(styleProperty, value);\n    };\n    this._applyManipulationCallback(selector, manipulationCallBack);\n  }\n  _applyManipulationCallback(selector, callBack) {\n    if (isElement(selector)) {\n      callBack(selector);\n      return;\n    }\n    for (const sel of SelectorEngine.find(selector, this._element)) {\n      callBack(sel);\n    }\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap modal.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$7 = 'modal';\nconst DATA_KEY$4 = 'bs.modal';\nconst EVENT_KEY$4 = `.${DATA_KEY$4}`;\nconst DATA_API_KEY$2 = '.data-api';\nconst ESCAPE_KEY$1 = 'Escape';\nconst EVENT_HIDE$4 = `hide${EVENT_KEY$4}`;\nconst EVENT_HIDE_PREVENTED$1 = `hidePrevented${EVENT_KEY$4}`;\nconst EVENT_HIDDEN$4 = `hidden${EVENT_KEY$4}`;\nconst EVENT_SHOW$4 = `show${EVENT_KEY$4}`;\nconst EVENT_SHOWN$4 = `shown${EVENT_KEY$4}`;\nconst EVENT_RESIZE$1 = `resize${EVENT_KEY$4}`;\nconst EVENT_CLICK_DISMISS = `click.dismiss${EVENT_KEY$4}`;\nconst EVENT_MOUSEDOWN_DISMISS = `mousedown.dismiss${EVENT_KEY$4}`;\nconst EVENT_KEYDOWN_DISMISS$1 = `keydown.dismiss${EVENT_KEY$4}`;\nconst EVENT_CLICK_DATA_API$2 = `click${EVENT_KEY$4}${DATA_API_KEY$2}`;\nconst CLASS_NAME_OPEN = 'modal-open';\nconst CLASS_NAME_FADE$3 = 'fade';\nconst CLASS_NAME_SHOW$4 = 'show';\nconst CLASS_NAME_STATIC = 'modal-static';\nconst OPEN_SELECTOR$1 = '.modal.show';\nconst SELECTOR_DIALOG = '.modal-dialog';\nconst SELECTOR_MODAL_BODY = '.modal-body';\nconst SELECTOR_DATA_TOGGLE$2 = '[data-bs-toggle=\"modal\"]';\nconst Default$6 = {\n  backdrop: true,\n  focus: true,\n  keyboard: true\n};\nconst DefaultType$6 = {\n  backdrop: '(boolean|string)',\n  focus: 'boolean',\n  keyboard: 'boolean'\n};\n\n/**\n * Class definition\n */\n\nclass Modal extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._dialog = SelectorEngine.findOne(SELECTOR_DIALOG, this._element);\n    this._backdrop = this._initializeBackDrop();\n    this._focustrap = this._initializeFocusTrap();\n    this._isShown = false;\n    this._isTransitioning = false;\n    this._scrollBar = new ScrollBarHelper();\n    this._addEventListeners();\n  }\n\n  // Getters\n  static get Default() {\n    return Default$6;\n  }\n  static get DefaultType() {\n    return DefaultType$6;\n  }\n  static get NAME() {\n    return NAME$7;\n  }\n\n  // Public\n  toggle(relatedTarget) {\n    return this._isShown ? this.hide() : this.show(relatedTarget);\n  }\n  show(relatedTarget) {\n    if (this._isShown || this._isTransitioning) {\n      return;\n    }\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW$4, {\n      relatedTarget\n    });\n    if (showEvent.defaultPrevented) {\n      return;\n    }\n    this._isShown = true;\n    this._isTransitioning = true;\n    this._scrollBar.hide();\n    document.body.classList.add(CLASS_NAME_OPEN);\n    this._adjustDialog();\n    this._backdrop.show(() => this._showElement(relatedTarget));\n  }\n  hide() {\n    if (!this._isShown || this._isTransitioning) {\n      return;\n    }\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE$4);\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n    this._isShown = false;\n    this._isTransitioning = true;\n    this._focustrap.deactivate();\n    this._element.classList.remove(CLASS_NAME_SHOW$4);\n    this._queueCallback(() => this._hideModal(), this._element, this._isAnimated());\n  }\n  dispose() {\n    EventHandler.off(window, EVENT_KEY$4);\n    EventHandler.off(this._dialog, EVENT_KEY$4);\n    this._backdrop.dispose();\n    this._focustrap.deactivate();\n    super.dispose();\n  }\n  handleUpdate() {\n    this._adjustDialog();\n  }\n\n  // Private\n  _initializeBackDrop() {\n    return new Backdrop({\n      isVisible: Boolean(this._config.backdrop),\n      // 'static' option will be translated to true, and booleans will keep their value,\n      isAnimated: this._isAnimated()\n    });\n  }\n  _initializeFocusTrap() {\n    return new FocusTrap({\n      trapElement: this._element\n    });\n  }\n  _showElement(relatedTarget) {\n    // try to append dynamic modal\n    if (!document.body.contains(this._element)) {\n      document.body.append(this._element);\n    }\n    this._element.style.display = 'block';\n    this._element.removeAttribute('aria-hidden');\n    this._element.setAttribute('aria-modal', true);\n    this._element.setAttribute('role', 'dialog');\n    this._element.scrollTop = 0;\n    const modalBody = SelectorEngine.findOne(SELECTOR_MODAL_BODY, this._dialog);\n    if (modalBody) {\n      modalBody.scrollTop = 0;\n    }\n    reflow(this._element);\n    this._element.classList.add(CLASS_NAME_SHOW$4);\n    const transitionComplete = () => {\n      if (this._config.focus) {\n        this._focustrap.activate();\n      }\n      this._isTransitioning = false;\n      EventHandler.trigger(this._element, EVENT_SHOWN$4, {\n        relatedTarget\n      });\n    };\n    this._queueCallback(transitionComplete, this._dialog, this._isAnimated());\n  }\n  _addEventListeners() {\n    EventHandler.on(this._element, EVENT_KEYDOWN_DISMISS$1, event => {\n      if (event.key !== ESCAPE_KEY$1) {\n        return;\n      }\n      if (this._config.keyboard) {\n        this.hide();\n        return;\n      }\n      this._triggerBackdropTransition();\n    });\n    EventHandler.on(window, EVENT_RESIZE$1, () => {\n      if (this._isShown && !this._isTransitioning) {\n        this._adjustDialog();\n      }\n    });\n    EventHandler.on(this._element, EVENT_MOUSEDOWN_DISMISS, event => {\n      // a bad trick to segregate clicks that may start inside dialog but end outside, and avoid listen to scrollbar clicks\n      EventHandler.one(this._element, EVENT_CLICK_DISMISS, event2 => {\n        if (this._element !== event.target || this._element !== event2.target) {\n          return;\n        }\n        if (this._config.backdrop === 'static') {\n          this._triggerBackdropTransition();\n          return;\n        }\n        if (this._config.backdrop) {\n          this.hide();\n        }\n      });\n    });\n  }\n  _hideModal() {\n    this._element.style.display = 'none';\n    this._element.setAttribute('aria-hidden', true);\n    this._element.removeAttribute('aria-modal');\n    this._element.removeAttribute('role');\n    this._isTransitioning = false;\n    this._backdrop.hide(() => {\n      document.body.classList.remove(CLASS_NAME_OPEN);\n      this._resetAdjustments();\n      this._scrollBar.reset();\n      EventHandler.trigger(this._element, EVENT_HIDDEN$4);\n    });\n  }\n  _isAnimated() {\n    return this._element.classList.contains(CLASS_NAME_FADE$3);\n  }\n  _triggerBackdropTransition() {\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED$1);\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n    const isModalOverflowing = this._element.scrollHeight > document.documentElement.clientHeight;\n    const initialOverflowY = this._element.style.overflowY;\n    // return if the following background transition hasn't yet completed\n    if (initialOverflowY === 'hidden' || this._element.classList.contains(CLASS_NAME_STATIC)) {\n      return;\n    }\n    if (!isModalOverflowing) {\n      this._element.style.overflowY = 'hidden';\n    }\n    this._element.classList.add(CLASS_NAME_STATIC);\n    this._queueCallback(() => {\n      this._element.classList.remove(CLASS_NAME_STATIC);\n      this._queueCallback(() => {\n        this._element.style.overflowY = initialOverflowY;\n      }, this._dialog);\n    }, this._dialog);\n    this._element.focus();\n  }\n\n  /**\n   * The following methods are used to handle overflowing modals\n   */\n\n  _adjustDialog() {\n    const isModalOverflowing = this._element.scrollHeight > document.documentElement.clientHeight;\n    const scrollbarWidth = this._scrollBar.getWidth();\n    const isBodyOverflowing = scrollbarWidth > 0;\n    if (isBodyOverflowing && !isModalOverflowing) {\n      const property = isRTL() ? 'paddingLeft' : 'paddingRight';\n      this._element.style[property] = `${scrollbarWidth}px`;\n    }\n    if (!isBodyOverflowing && isModalOverflowing) {\n      const property = isRTL() ? 'paddingRight' : 'paddingLeft';\n      this._element.style[property] = `${scrollbarWidth}px`;\n    }\n  }\n  _resetAdjustments() {\n    this._element.style.paddingLeft = '';\n    this._element.style.paddingRight = '';\n  }\n\n  // Static\n  static jQueryInterface(config, relatedTarget) {\n    return this.each(function () {\n      const data = Modal.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config](relatedTarget);\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API$2, SELECTOR_DATA_TOGGLE$2, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this);\n  if (['A', 'AREA'].includes(this.tagName)) {\n    event.preventDefault();\n  }\n  EventHandler.one(target, EVENT_SHOW$4, showEvent => {\n    if (showEvent.defaultPrevented) {\n      // only register focus restorer if modal will actually get shown\n      return;\n    }\n    EventHandler.one(target, EVENT_HIDDEN$4, () => {\n      if (isVisible(this)) {\n        this.focus();\n      }\n    });\n  });\n\n  // avoid conflict when clicking modal toggler while another one is open\n  const alreadyOpen = SelectorEngine.findOne(OPEN_SELECTOR$1);\n  if (alreadyOpen) {\n    Modal.getInstance(alreadyOpen).hide();\n  }\n  const data = Modal.getOrCreateInstance(target);\n  data.toggle(this);\n});\nenableDismissTrigger(Modal);\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Modal);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap offcanvas.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$6 = 'offcanvas';\nconst DATA_KEY$3 = 'bs.offcanvas';\nconst EVENT_KEY$3 = `.${DATA_KEY$3}`;\nconst DATA_API_KEY$1 = '.data-api';\nconst EVENT_LOAD_DATA_API$2 = `load${EVENT_KEY$3}${DATA_API_KEY$1}`;\nconst ESCAPE_KEY = 'Escape';\nconst CLASS_NAME_SHOW$3 = 'show';\nconst CLASS_NAME_SHOWING$1 = 'showing';\nconst CLASS_NAME_HIDING = 'hiding';\nconst CLASS_NAME_BACKDROP = 'offcanvas-backdrop';\nconst OPEN_SELECTOR = '.offcanvas.show';\nconst EVENT_SHOW$3 = `show${EVENT_KEY$3}`;\nconst EVENT_SHOWN$3 = `shown${EVENT_KEY$3}`;\nconst EVENT_HIDE$3 = `hide${EVENT_KEY$3}`;\nconst EVENT_HIDE_PREVENTED = `hidePrevented${EVENT_KEY$3}`;\nconst EVENT_HIDDEN$3 = `hidden${EVENT_KEY$3}`;\nconst EVENT_RESIZE = `resize${EVENT_KEY$3}`;\nconst EVENT_CLICK_DATA_API$1 = `click${EVENT_KEY$3}${DATA_API_KEY$1}`;\nconst EVENT_KEYDOWN_DISMISS = `keydown.dismiss${EVENT_KEY$3}`;\nconst SELECTOR_DATA_TOGGLE$1 = '[data-bs-toggle=\"offcanvas\"]';\nconst Default$5 = {\n  backdrop: true,\n  keyboard: true,\n  scroll: false\n};\nconst DefaultType$5 = {\n  backdrop: '(boolean|string)',\n  keyboard: 'boolean',\n  scroll: 'boolean'\n};\n\n/**\n * Class definition\n */\n\nclass Offcanvas extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._isShown = false;\n    this._backdrop = this._initializeBackDrop();\n    this._focustrap = this._initializeFocusTrap();\n    this._addEventListeners();\n  }\n\n  // Getters\n  static get Default() {\n    return Default$5;\n  }\n  static get DefaultType() {\n    return DefaultType$5;\n  }\n  static get NAME() {\n    return NAME$6;\n  }\n\n  // Public\n  toggle(relatedTarget) {\n    return this._isShown ? this.hide() : this.show(relatedTarget);\n  }\n  show(relatedTarget) {\n    if (this._isShown) {\n      return;\n    }\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW$3, {\n      relatedTarget\n    });\n    if (showEvent.defaultPrevented) {\n      return;\n    }\n    this._isShown = true;\n    this._backdrop.show();\n    if (!this._config.scroll) {\n      new ScrollBarHelper().hide();\n    }\n    this._element.setAttribute('aria-modal', true);\n    this._element.setAttribute('role', 'dialog');\n    this._element.classList.add(CLASS_NAME_SHOWING$1);\n    const completeCallBack = () => {\n      if (!this._config.scroll || this._config.backdrop) {\n        this._focustrap.activate();\n      }\n      this._element.classList.add(CLASS_NAME_SHOW$3);\n      this._element.classList.remove(CLASS_NAME_SHOWING$1);\n      EventHandler.trigger(this._element, EVENT_SHOWN$3, {\n        relatedTarget\n      });\n    };\n    this._queueCallback(completeCallBack, this._element, true);\n  }\n  hide() {\n    if (!this._isShown) {\n      return;\n    }\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE$3);\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n    this._focustrap.deactivate();\n    this._element.blur();\n    this._isShown = false;\n    this._element.classList.add(CLASS_NAME_HIDING);\n    this._backdrop.hide();\n    const completeCallback = () => {\n      this._element.classList.remove(CLASS_NAME_SHOW$3, CLASS_NAME_HIDING);\n      this._element.removeAttribute('aria-modal');\n      this._element.removeAttribute('role');\n      if (!this._config.scroll) {\n        new ScrollBarHelper().reset();\n      }\n      EventHandler.trigger(this._element, EVENT_HIDDEN$3);\n    };\n    this._queueCallback(completeCallback, this._element, true);\n  }\n  dispose() {\n    this._backdrop.dispose();\n    this._focustrap.deactivate();\n    super.dispose();\n  }\n\n  // Private\n  _initializeBackDrop() {\n    const clickCallback = () => {\n      if (this._config.backdrop === 'static') {\n        EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED);\n        return;\n      }\n      this.hide();\n    };\n\n    // 'static' option will be translated to true, and booleans will keep their value\n    const isVisible = Boolean(this._config.backdrop);\n    return new Backdrop({\n      className: CLASS_NAME_BACKDROP,\n      isVisible,\n      isAnimated: true,\n      rootElement: this._element.parentNode,\n      clickCallback: isVisible ? clickCallback : null\n    });\n  }\n  _initializeFocusTrap() {\n    return new FocusTrap({\n      trapElement: this._element\n    });\n  }\n  _addEventListeners() {\n    EventHandler.on(this._element, EVENT_KEYDOWN_DISMISS, event => {\n      if (event.key !== ESCAPE_KEY) {\n        return;\n      }\n      if (this._config.keyboard) {\n        this.hide();\n        return;\n      }\n      EventHandler.trigger(this._element, EVENT_HIDE_PREVENTED);\n    });\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Offcanvas.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config](this);\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API$1, SELECTOR_DATA_TOGGLE$1, function (event) {\n  const target = SelectorEngine.getElementFromSelector(this);\n  if (['A', 'AREA'].includes(this.tagName)) {\n    event.preventDefault();\n  }\n  if (isDisabled(this)) {\n    return;\n  }\n  EventHandler.one(target, EVENT_HIDDEN$3, () => {\n    // focus on trigger when it is closed\n    if (isVisible(this)) {\n      this.focus();\n    }\n  });\n\n  // avoid conflict when clicking a toggler of an offcanvas, while another is open\n  const alreadyOpen = SelectorEngine.findOne(OPEN_SELECTOR);\n  if (alreadyOpen && alreadyOpen !== target) {\n    Offcanvas.getInstance(alreadyOpen).hide();\n  }\n  const data = Offcanvas.getOrCreateInstance(target);\n  data.toggle(this);\n});\nEventHandler.on(window, EVENT_LOAD_DATA_API$2, () => {\n  for (const selector of SelectorEngine.find(OPEN_SELECTOR)) {\n    Offcanvas.getOrCreateInstance(selector).show();\n  }\n});\nEventHandler.on(window, EVENT_RESIZE, () => {\n  for (const element of SelectorEngine.find('[aria-modal][class*=show][class*=offcanvas-]')) {\n    if (getComputedStyle(element).position !== 'fixed') {\n      Offcanvas.getOrCreateInstance(element).hide();\n    }\n  }\n});\nenableDismissTrigger(Offcanvas);\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Offcanvas);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/sanitizer.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n// js-docs-start allow-list\nconst ARIA_ATTRIBUTE_PATTERN = /^aria-[\\w-]*$/i;\nconst DefaultAllowlist = {\n  // Global attributes allowed on any supplied element below.\n  '*': ['class', 'dir', 'id', 'lang', 'role', ARIA_ATTRIBUTE_PATTERN],\n  a: ['target', 'href', 'title', 'rel'],\n  area: [],\n  b: [],\n  br: [],\n  col: [],\n  code: [],\n  div: [],\n  em: [],\n  hr: [],\n  h1: [],\n  h2: [],\n  h3: [],\n  h4: [],\n  h5: [],\n  h6: [],\n  i: [],\n  img: ['src', 'srcset', 'alt', 'title', 'width', 'height'],\n  li: [],\n  ol: [],\n  p: [],\n  pre: [],\n  s: [],\n  small: [],\n  span: [],\n  sub: [],\n  sup: [],\n  strong: [],\n  u: [],\n  ul: []\n};\n// js-docs-end allow-list\n\nconst uriAttributes = new Set(['background', 'cite', 'href', 'itemtype', 'longdesc', 'poster', 'src', 'xlink:href']);\n\n/**\n * A pattern that recognizes URLs that are safe wrt. XSS in URL navigation\n * contexts.\n *\n * Shout-out to Angular https://github.com/angular/angular/blob/15.2.8/packages/core/src/sanitization/url_sanitizer.ts#L38\n */\n// eslint-disable-next-line unicorn/better-regex\nconst SAFE_URL_PATTERN = /^(?!javascript:)(?:[a-z0-9+.-]+:|[^&:/?#]*(?:[/?#]|$))/i;\nconst allowedAttribute = (attribute, allowedAttributeList) => {\n  const attributeName = attribute.nodeName.toLowerCase();\n  if (allowedAttributeList.includes(attributeName)) {\n    if (uriAttributes.has(attributeName)) {\n      return Boolean(SAFE_URL_PATTERN.test(attribute.nodeValue));\n    }\n    return true;\n  }\n\n  // Check if a regular expression validates the attribute.\n  return allowedAttributeList.filter(attributeRegex => attributeRegex instanceof RegExp).some(regex => regex.test(attributeName));\n};\nfunction sanitizeHtml(unsafeHtml, allowList, sanitizeFunction) {\n  if (!unsafeHtml.length) {\n    return unsafeHtml;\n  }\n  if (sanitizeFunction && typeof sanitizeFunction === 'function') {\n    return sanitizeFunction(unsafeHtml);\n  }\n  const domParser = new window.DOMParser();\n  const createdDocument = domParser.parseFromString(unsafeHtml, 'text/html');\n  const elements = [].concat(...createdDocument.body.querySelectorAll('*'));\n  for (const element of elements) {\n    const elementName = element.nodeName.toLowerCase();\n    if (!Object.keys(allowList).includes(elementName)) {\n      element.remove();\n      continue;\n    }\n    const attributeList = [].concat(...element.attributes);\n    const allowedAttributes = [].concat(allowList['*'] || [], allowList[elementName] || []);\n    for (const attribute of attributeList) {\n      if (!allowedAttribute(attribute, allowedAttributes)) {\n        element.removeAttribute(attribute.nodeName);\n      }\n    }\n  }\n  return createdDocument.body.innerHTML;\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap util/template-factory.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$5 = 'TemplateFactory';\nconst Default$4 = {\n  allowList: DefaultAllowlist,\n  content: {},\n  // { selector : text ,  selector2 : text2 , }\n  extraClass: '',\n  html: false,\n  sanitize: true,\n  sanitizeFn: null,\n  template: '<div></div>'\n};\nconst DefaultType$4 = {\n  allowList: 'object',\n  content: 'object',\n  extraClass: '(string|function)',\n  html: 'boolean',\n  sanitize: 'boolean',\n  sanitizeFn: '(null|function)',\n  template: 'string'\n};\nconst DefaultContentType = {\n  entry: '(string|element|function|null)',\n  selector: '(string|element)'\n};\n\n/**\n * Class definition\n */\n\nclass TemplateFactory extends Config {\n  constructor(config) {\n    super();\n    this._config = this._getConfig(config);\n  }\n\n  // Getters\n  static get Default() {\n    return Default$4;\n  }\n  static get DefaultType() {\n    return DefaultType$4;\n  }\n  static get NAME() {\n    return NAME$5;\n  }\n\n  // Public\n  getContent() {\n    return Object.values(this._config.content).map(config => this._resolvePossibleFunction(config)).filter(Boolean);\n  }\n  hasContent() {\n    return this.getContent().length > 0;\n  }\n  changeContent(content) {\n    this._checkContent(content);\n    this._config.content = {\n      ...this._config.content,\n      ...content\n    };\n    return this;\n  }\n  toHtml() {\n    const templateWrapper = document.createElement('div');\n    templateWrapper.innerHTML = this._maybeSanitize(this._config.template);\n    for (const [selector, text] of Object.entries(this._config.content)) {\n      this._setContent(templateWrapper, text, selector);\n    }\n    const template = templateWrapper.children[0];\n    const extraClass = this._resolvePossibleFunction(this._config.extraClass);\n    if (extraClass) {\n      template.classList.add(...extraClass.split(' '));\n    }\n    return template;\n  }\n\n  // Private\n  _typeCheckConfig(config) {\n    super._typeCheckConfig(config);\n    this._checkContent(config.content);\n  }\n  _checkContent(arg) {\n    for (const [selector, content] of Object.entries(arg)) {\n      super._typeCheckConfig({\n        selector,\n        entry: content\n      }, DefaultContentType);\n    }\n  }\n  _setContent(template, content, selector) {\n    const templateElement = SelectorEngine.findOne(selector, template);\n    if (!templateElement) {\n      return;\n    }\n    content = this._resolvePossibleFunction(content);\n    if (!content) {\n      templateElement.remove();\n      return;\n    }\n    if (isElement(content)) {\n      this._putElementInTemplate(getElement(content), templateElement);\n      return;\n    }\n    if (this._config.html) {\n      templateElement.innerHTML = this._maybeSanitize(content);\n      return;\n    }\n    templateElement.textContent = content;\n  }\n  _maybeSanitize(arg) {\n    return this._config.sanitize ? sanitizeHtml(arg, this._config.allowList, this._config.sanitizeFn) : arg;\n  }\n  _resolvePossibleFunction(arg) {\n    return execute(arg, [this]);\n  }\n  _putElementInTemplate(element, templateElement) {\n    if (this._config.html) {\n      templateElement.innerHTML = '';\n      templateElement.append(element);\n      return;\n    }\n    templateElement.textContent = element.textContent;\n  }\n}\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap tooltip.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$4 = 'tooltip';\nconst DISALLOWED_ATTRIBUTES = new Set(['sanitize', 'allowList', 'sanitizeFn']);\nconst CLASS_NAME_FADE$2 = 'fade';\nconst CLASS_NAME_MODAL = 'modal';\nconst CLASS_NAME_SHOW$2 = 'show';\nconst SELECTOR_TOOLTIP_INNER = '.tooltip-inner';\nconst SELECTOR_MODAL = `.${CLASS_NAME_MODAL}`;\nconst EVENT_MODAL_HIDE = 'hide.bs.modal';\nconst TRIGGER_HOVER = 'hover';\nconst TRIGGER_FOCUS = 'focus';\nconst TRIGGER_CLICK = 'click';\nconst TRIGGER_MANUAL = 'manual';\nconst EVENT_HIDE$2 = 'hide';\nconst EVENT_HIDDEN$2 = 'hidden';\nconst EVENT_SHOW$2 = 'show';\nconst EVENT_SHOWN$2 = 'shown';\nconst EVENT_INSERTED = 'inserted';\nconst EVENT_CLICK$1 = 'click';\nconst EVENT_FOCUSIN$1 = 'focusin';\nconst EVENT_FOCUSOUT$1 = 'focusout';\nconst EVENT_MOUSEENTER = 'mouseenter';\nconst EVENT_MOUSELEAVE = 'mouseleave';\nconst AttachmentMap = {\n  AUTO: 'auto',\n  TOP: 'top',\n  RIGHT: isRTL() ? 'left' : 'right',\n  BOTTOM: 'bottom',\n  LEFT: isRTL() ? 'right' : 'left'\n};\nconst Default$3 = {\n  allowList: DefaultAllowlist,\n  animation: true,\n  boundary: 'clippingParents',\n  container: false,\n  customClass: '',\n  delay: 0,\n  fallbackPlacements: ['top', 'right', 'bottom', 'left'],\n  html: false,\n  offset: [0, 6],\n  placement: 'top',\n  popperConfig: null,\n  sanitize: true,\n  sanitizeFn: null,\n  selector: false,\n  template: '<div class=\"tooltip\" role=\"tooltip\">' + '<div class=\"tooltip-arrow\"></div>' + '<div class=\"tooltip-inner\"></div>' + '</div>',\n  title: '',\n  trigger: 'hover focus'\n};\nconst DefaultType$3 = {\n  allowList: 'object',\n  animation: 'boolean',\n  boundary: '(string|element)',\n  container: '(string|element|boolean)',\n  customClass: '(string|function)',\n  delay: '(number|object)',\n  fallbackPlacements: 'array',\n  html: 'boolean',\n  offset: '(array|string|function)',\n  placement: '(string|function)',\n  popperConfig: '(null|object|function)',\n  sanitize: 'boolean',\n  sanitizeFn: '(null|function)',\n  selector: '(string|boolean)',\n  template: 'string',\n  title: '(string|element|function)',\n  trigger: 'string'\n};\n\n/**\n * Class definition\n */\n\nclass Tooltip extends BaseComponent {\n  constructor(element, config) {\n    if (typeof Popper === 'undefined') {\n      throw new TypeError('Bootstrap\\'s tooltips require Popper (https://popper.js.org)');\n    }\n    super(element, config);\n\n    // Private\n    this._isEnabled = true;\n    this._timeout = 0;\n    this._isHovered = null;\n    this._activeTrigger = {};\n    this._popper = null;\n    this._templateFactory = null;\n    this._newContent = null;\n\n    // Protected\n    this.tip = null;\n    this._setListeners();\n    if (!this._config.selector) {\n      this._fixTitle();\n    }\n  }\n\n  // Getters\n  static get Default() {\n    return Default$3;\n  }\n  static get DefaultType() {\n    return DefaultType$3;\n  }\n  static get NAME() {\n    return NAME$4;\n  }\n\n  // Public\n  enable() {\n    this._isEnabled = true;\n  }\n  disable() {\n    this._isEnabled = false;\n  }\n  toggleEnabled() {\n    this._isEnabled = !this._isEnabled;\n  }\n  toggle() {\n    if (!this._isEnabled) {\n      return;\n    }\n    this._activeTrigger.click = !this._activeTrigger.click;\n    if (this._isShown()) {\n      this._leave();\n      return;\n    }\n    this._enter();\n  }\n  dispose() {\n    clearTimeout(this._timeout);\n    EventHandler.off(this._element.closest(SELECTOR_MODAL), EVENT_MODAL_HIDE, this._hideModalHandler);\n    if (this._element.getAttribute('data-bs-original-title')) {\n      this._element.setAttribute('title', this._element.getAttribute('data-bs-original-title'));\n    }\n    this._disposePopper();\n    super.dispose();\n  }\n  show() {\n    if (this._element.style.display === 'none') {\n      throw new Error('Please use show on visible elements');\n    }\n    if (!(this._isWithContent() && this._isEnabled)) {\n      return;\n    }\n    const showEvent = EventHandler.trigger(this._element, this.constructor.eventName(EVENT_SHOW$2));\n    const shadowRoot = findShadowRoot(this._element);\n    const isInTheDom = (shadowRoot || this._element.ownerDocument.documentElement).contains(this._element);\n    if (showEvent.defaultPrevented || !isInTheDom) {\n      return;\n    }\n\n    // TODO: v6 remove this or make it optional\n    this._disposePopper();\n    const tip = this._getTipElement();\n    this._element.setAttribute('aria-describedby', tip.getAttribute('id'));\n    const {\n      container\n    } = this._config;\n    if (!this._element.ownerDocument.documentElement.contains(this.tip)) {\n      container.append(tip);\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_INSERTED));\n    }\n    this._popper = this._createPopper(tip);\n    tip.classList.add(CLASS_NAME_SHOW$2);\n\n    // If this is a touch-enabled device we add extra\n    // empty mouseover listeners to the body's immediate children;\n    // only needed because of broken event delegation on iOS\n    // https://www.quirksmode.org/blog/archives/2014/02/mouse_event_bub.html\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.on(element, 'mouseover', noop);\n      }\n    }\n    const complete = () => {\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_SHOWN$2));\n      if (this._isHovered === false) {\n        this._leave();\n      }\n      this._isHovered = false;\n    };\n    this._queueCallback(complete, this.tip, this._isAnimated());\n  }\n  hide() {\n    if (!this._isShown()) {\n      return;\n    }\n    const hideEvent = EventHandler.trigger(this._element, this.constructor.eventName(EVENT_HIDE$2));\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n    const tip = this._getTipElement();\n    tip.classList.remove(CLASS_NAME_SHOW$2);\n\n    // If this is a touch-enabled device we remove the extra\n    // empty mouseover listeners we added for iOS support\n    if ('ontouchstart' in document.documentElement) {\n      for (const element of [].concat(...document.body.children)) {\n        EventHandler.off(element, 'mouseover', noop);\n      }\n    }\n    this._activeTrigger[TRIGGER_CLICK] = false;\n    this._activeTrigger[TRIGGER_FOCUS] = false;\n    this._activeTrigger[TRIGGER_HOVER] = false;\n    this._isHovered = null; // it is a trick to support manual triggering\n\n    const complete = () => {\n      if (this._isWithActiveTrigger()) {\n        return;\n      }\n      if (!this._isHovered) {\n        this._disposePopper();\n      }\n      this._element.removeAttribute('aria-describedby');\n      EventHandler.trigger(this._element, this.constructor.eventName(EVENT_HIDDEN$2));\n    };\n    this._queueCallback(complete, this.tip, this._isAnimated());\n  }\n  update() {\n    if (this._popper) {\n      this._popper.update();\n    }\n  }\n\n  // Protected\n  _isWithContent() {\n    return Boolean(this._getTitle());\n  }\n  _getTipElement() {\n    if (!this.tip) {\n      this.tip = this._createTipElement(this._newContent || this._getContentForTemplate());\n    }\n    return this.tip;\n  }\n  _createTipElement(content) {\n    const tip = this._getTemplateFactory(content).toHtml();\n\n    // TODO: remove this check in v6\n    if (!tip) {\n      return null;\n    }\n    tip.classList.remove(CLASS_NAME_FADE$2, CLASS_NAME_SHOW$2);\n    // TODO: v6 the following can be achieved with CSS only\n    tip.classList.add(`bs-${this.constructor.NAME}-auto`);\n    const tipId = getUID(this.constructor.NAME).toString();\n    tip.setAttribute('id', tipId);\n    if (this._isAnimated()) {\n      tip.classList.add(CLASS_NAME_FADE$2);\n    }\n    return tip;\n  }\n  setContent(content) {\n    this._newContent = content;\n    if (this._isShown()) {\n      this._disposePopper();\n      this.show();\n    }\n  }\n  _getTemplateFactory(content) {\n    if (this._templateFactory) {\n      this._templateFactory.changeContent(content);\n    } else {\n      this._templateFactory = new TemplateFactory({\n        ...this._config,\n        // the `content` var has to be after `this._config`\n        // to override config.content in case of popover\n        content,\n        extraClass: this._resolvePossibleFunction(this._config.customClass)\n      });\n    }\n    return this._templateFactory;\n  }\n  _getContentForTemplate() {\n    return {\n      [SELECTOR_TOOLTIP_INNER]: this._getTitle()\n    };\n  }\n  _getTitle() {\n    return this._resolvePossibleFunction(this._config.title) || this._element.getAttribute('data-bs-original-title');\n  }\n\n  // Private\n  _initializeOnDelegatedTarget(event) {\n    return this.constructor.getOrCreateInstance(event.delegateTarget, this._getDelegateConfig());\n  }\n  _isAnimated() {\n    return this._config.animation || this.tip && this.tip.classList.contains(CLASS_NAME_FADE$2);\n  }\n  _isShown() {\n    return this.tip && this.tip.classList.contains(CLASS_NAME_SHOW$2);\n  }\n  _createPopper(tip) {\n    const placement = execute(this._config.placement, [this, tip, this._element]);\n    const attachment = AttachmentMap[placement.toUpperCase()];\n    return Popper.createPopper(this._element, tip, this._getPopperConfig(attachment));\n  }\n  _getOffset() {\n    const {\n      offset\n    } = this._config;\n    if (typeof offset === 'string') {\n      return offset.split(',').map(value => Number.parseInt(value, 10));\n    }\n    if (typeof offset === 'function') {\n      return popperData => offset(popperData, this._element);\n    }\n    return offset;\n  }\n  _resolvePossibleFunction(arg) {\n    return execute(arg, [this._element]);\n  }\n  _getPopperConfig(attachment) {\n    const defaultBsPopperConfig = {\n      placement: attachment,\n      modifiers: [{\n        name: 'flip',\n        options: {\n          fallbackPlacements: this._config.fallbackPlacements\n        }\n      }, {\n        name: 'offset',\n        options: {\n          offset: this._getOffset()\n        }\n      }, {\n        name: 'preventOverflow',\n        options: {\n          boundary: this._config.boundary\n        }\n      }, {\n        name: 'arrow',\n        options: {\n          element: `.${this.constructor.NAME}-arrow`\n        }\n      }, {\n        name: 'preSetPlacement',\n        enabled: true,\n        phase: 'beforeMain',\n        fn: data => {\n          // Pre-set Popper's placement attribute in order to read the arrow sizes properly.\n          // Otherwise, Popper mixes up the width and height dimensions since the initial arrow style is for top placement\n          this._getTipElement().setAttribute('data-popper-placement', data.state.placement);\n        }\n      }]\n    };\n    return {\n      ...defaultBsPopperConfig,\n      ...execute(this._config.popperConfig, [defaultBsPopperConfig])\n    };\n  }\n  _setListeners() {\n    const triggers = this._config.trigger.split(' ');\n    for (const trigger of triggers) {\n      if (trigger === 'click') {\n        EventHandler.on(this._element, this.constructor.eventName(EVENT_CLICK$1), this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event);\n          context.toggle();\n        });\n      } else if (trigger !== TRIGGER_MANUAL) {\n        const eventIn = trigger === TRIGGER_HOVER ? this.constructor.eventName(EVENT_MOUSEENTER) : this.constructor.eventName(EVENT_FOCUSIN$1);\n        const eventOut = trigger === TRIGGER_HOVER ? this.constructor.eventName(EVENT_MOUSELEAVE) : this.constructor.eventName(EVENT_FOCUSOUT$1);\n        EventHandler.on(this._element, eventIn, this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event);\n          context._activeTrigger[event.type === 'focusin' ? TRIGGER_FOCUS : TRIGGER_HOVER] = true;\n          context._enter();\n        });\n        EventHandler.on(this._element, eventOut, this._config.selector, event => {\n          const context = this._initializeOnDelegatedTarget(event);\n          context._activeTrigger[event.type === 'focusout' ? TRIGGER_FOCUS : TRIGGER_HOVER] = context._element.contains(event.relatedTarget);\n          context._leave();\n        });\n      }\n    }\n    this._hideModalHandler = () => {\n      if (this._element) {\n        this.hide();\n      }\n    };\n    EventHandler.on(this._element.closest(SELECTOR_MODAL), EVENT_MODAL_HIDE, this._hideModalHandler);\n  }\n  _fixTitle() {\n    const title = this._element.getAttribute('title');\n    if (!title) {\n      return;\n    }\n    if (!this._element.getAttribute('aria-label') && !this._element.textContent.trim()) {\n      this._element.setAttribute('aria-label', title);\n    }\n    this._element.setAttribute('data-bs-original-title', title); // DO NOT USE IT. Is only for backwards compatibility\n    this._element.removeAttribute('title');\n  }\n  _enter() {\n    if (this._isShown() || this._isHovered) {\n      this._isHovered = true;\n      return;\n    }\n    this._isHovered = true;\n    this._setTimeout(() => {\n      if (this._isHovered) {\n        this.show();\n      }\n    }, this._config.delay.show);\n  }\n  _leave() {\n    if (this._isWithActiveTrigger()) {\n      return;\n    }\n    this._isHovered = false;\n    this._setTimeout(() => {\n      if (!this._isHovered) {\n        this.hide();\n      }\n    }, this._config.delay.hide);\n  }\n  _setTimeout(handler, timeout) {\n    clearTimeout(this._timeout);\n    this._timeout = setTimeout(handler, timeout);\n  }\n  _isWithActiveTrigger() {\n    return Object.values(this._activeTrigger).includes(true);\n  }\n  _getConfig(config) {\n    const dataAttributes = Manipulator.getDataAttributes(this._element);\n    for (const dataAttribute of Object.keys(dataAttributes)) {\n      if (DISALLOWED_ATTRIBUTES.has(dataAttribute)) {\n        delete dataAttributes[dataAttribute];\n      }\n    }\n    config = {\n      ...dataAttributes,\n      ...(typeof config === 'object' && config ? config : {})\n    };\n    config = this._mergeConfigObj(config);\n    config = this._configAfterMerge(config);\n    this._typeCheckConfig(config);\n    return config;\n  }\n  _configAfterMerge(config) {\n    config.container = config.container === false ? document.body : getElement(config.container);\n    if (typeof config.delay === 'number') {\n      config.delay = {\n        show: config.delay,\n        hide: config.delay\n      };\n    }\n    if (typeof config.title === 'number') {\n      config.title = config.title.toString();\n    }\n    if (typeof config.content === 'number') {\n      config.content = config.content.toString();\n    }\n    return config;\n  }\n  _getDelegateConfig() {\n    const config = {};\n    for (const [key, value] of Object.entries(this._config)) {\n      if (this.constructor.Default[key] !== value) {\n        config[key] = value;\n      }\n    }\n    config.selector = false;\n    config.trigger = 'manual';\n\n    // In the future can be replaced with:\n    // const keysWithDifferentValues = Object.entries(this._config).filter(entry => this.constructor.Default[entry[0]] !== this._config[entry[0]])\n    // `Object.fromEntries(keysWithDifferentValues)`\n    return config;\n  }\n  _disposePopper() {\n    if (this._popper) {\n      this._popper.destroy();\n      this._popper = null;\n    }\n    if (this.tip) {\n      this.tip.remove();\n      this.tip = null;\n    }\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Tooltip.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config]();\n    });\n  }\n}\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Tooltip);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap popover.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$3 = 'popover';\nconst SELECTOR_TITLE = '.popover-header';\nconst SELECTOR_CONTENT = '.popover-body';\nconst Default$2 = {\n  ...Tooltip.Default,\n  content: '',\n  offset: [0, 8],\n  placement: 'right',\n  template: '<div class=\"popover\" role=\"tooltip\">' + '<div class=\"popover-arrow\"></div>' + '<h3 class=\"popover-header\"></h3>' + '<div class=\"popover-body\"></div>' + '</div>',\n  trigger: 'click'\n};\nconst DefaultType$2 = {\n  ...Tooltip.DefaultType,\n  content: '(null|string|element|function)'\n};\n\n/**\n * Class definition\n */\n\nclass Popover extends Tooltip {\n  // Getters\n  static get Default() {\n    return Default$2;\n  }\n  static get DefaultType() {\n    return DefaultType$2;\n  }\n  static get NAME() {\n    return NAME$3;\n  }\n\n  // Overrides\n  _isWithContent() {\n    return this._getTitle() || this._getContent();\n  }\n\n  // Private\n  _getContentForTemplate() {\n    return {\n      [SELECTOR_TITLE]: this._getTitle(),\n      [SELECTOR_CONTENT]: this._getContent()\n    };\n  }\n  _getContent() {\n    return this._resolvePossibleFunction(this._config.content);\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Popover.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (typeof data[config] === 'undefined') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config]();\n    });\n  }\n}\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Popover);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap scrollspy.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$2 = 'scrollspy';\nconst DATA_KEY$2 = 'bs.scrollspy';\nconst EVENT_KEY$2 = `.${DATA_KEY$2}`;\nconst DATA_API_KEY = '.data-api';\nconst EVENT_ACTIVATE = `activate${EVENT_KEY$2}`;\nconst EVENT_CLICK = `click${EVENT_KEY$2}`;\nconst EVENT_LOAD_DATA_API$1 = `load${EVENT_KEY$2}${DATA_API_KEY}`;\nconst CLASS_NAME_DROPDOWN_ITEM = 'dropdown-item';\nconst CLASS_NAME_ACTIVE$1 = 'active';\nconst SELECTOR_DATA_SPY = '[data-bs-spy=\"scroll\"]';\nconst SELECTOR_TARGET_LINKS = '[href]';\nconst SELECTOR_NAV_LIST_GROUP = '.nav, .list-group';\nconst SELECTOR_NAV_LINKS = '.nav-link';\nconst SELECTOR_NAV_ITEMS = '.nav-item';\nconst SELECTOR_LIST_ITEMS = '.list-group-item';\nconst SELECTOR_LINK_ITEMS = `${SELECTOR_NAV_LINKS}, ${SELECTOR_NAV_ITEMS} > ${SELECTOR_NAV_LINKS}, ${SELECTOR_LIST_ITEMS}`;\nconst SELECTOR_DROPDOWN = '.dropdown';\nconst SELECTOR_DROPDOWN_TOGGLE$1 = '.dropdown-toggle';\nconst Default$1 = {\n  offset: null,\n  // TODO: v6 @deprecated, keep it for backwards compatibility reasons\n  rootMargin: '0px 0px -25%',\n  smoothScroll: false,\n  target: null,\n  threshold: [0.1, 0.5, 1]\n};\nconst DefaultType$1 = {\n  offset: '(number|null)',\n  // TODO v6 @deprecated, keep it for backwards compatibility reasons\n  rootMargin: 'string',\n  smoothScroll: 'boolean',\n  target: 'element',\n  threshold: 'array'\n};\n\n/**\n * Class definition\n */\n\nclass ScrollSpy extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n\n    // this._element is the observablesContainer and config.target the menu links wrapper\n    this._targetLinks = new Map();\n    this._observableSections = new Map();\n    this._rootElement = getComputedStyle(this._element).overflowY === 'visible' ? null : this._element;\n    this._activeTarget = null;\n    this._observer = null;\n    this._previousScrollData = {\n      visibleEntryTop: 0,\n      parentScrollTop: 0\n    };\n    this.refresh(); // initialize\n  }\n\n  // Getters\n  static get Default() {\n    return Default$1;\n  }\n  static get DefaultType() {\n    return DefaultType$1;\n  }\n  static get NAME() {\n    return NAME$2;\n  }\n\n  // Public\n  refresh() {\n    this._initializeTargetsAndObservables();\n    this._maybeEnableSmoothScroll();\n    if (this._observer) {\n      this._observer.disconnect();\n    } else {\n      this._observer = this._getNewObserver();\n    }\n    for (const section of this._observableSections.values()) {\n      this._observer.observe(section);\n    }\n  }\n  dispose() {\n    this._observer.disconnect();\n    super.dispose();\n  }\n\n  // Private\n  _configAfterMerge(config) {\n    // TODO: on v6 target should be given explicitly & remove the {target: 'ss-target'} case\n    config.target = getElement(config.target) || document.body;\n\n    // TODO: v6 Only for backwards compatibility reasons. Use rootMargin only\n    config.rootMargin = config.offset ? `${config.offset}px 0px -30%` : config.rootMargin;\n    if (typeof config.threshold === 'string') {\n      config.threshold = config.threshold.split(',').map(value => Number.parseFloat(value));\n    }\n    return config;\n  }\n  _maybeEnableSmoothScroll() {\n    if (!this._config.smoothScroll) {\n      return;\n    }\n\n    // unregister any previous listeners\n    EventHandler.off(this._config.target, EVENT_CLICK);\n    EventHandler.on(this._config.target, EVENT_CLICK, SELECTOR_TARGET_LINKS, event => {\n      const observableSection = this._observableSections.get(event.target.hash);\n      if (observableSection) {\n        event.preventDefault();\n        const root = this._rootElement || window;\n        const height = observableSection.offsetTop - this._element.offsetTop;\n        if (root.scrollTo) {\n          root.scrollTo({\n            top: height,\n            behavior: 'smooth'\n          });\n          return;\n        }\n\n        // Chrome 60 doesn't support `scrollTo`\n        root.scrollTop = height;\n      }\n    });\n  }\n  _getNewObserver() {\n    const options = {\n      root: this._rootElement,\n      threshold: this._config.threshold,\n      rootMargin: this._config.rootMargin\n    };\n    return new IntersectionObserver(entries => this._observerCallback(entries), options);\n  }\n\n  // The logic of selection\n  _observerCallback(entries) {\n    const targetElement = entry => this._targetLinks.get(`#${entry.target.id}`);\n    const activate = entry => {\n      this._previousScrollData.visibleEntryTop = entry.target.offsetTop;\n      this._process(targetElement(entry));\n    };\n    const parentScrollTop = (this._rootElement || document.documentElement).scrollTop;\n    const userScrollsDown = parentScrollTop >= this._previousScrollData.parentScrollTop;\n    this._previousScrollData.parentScrollTop = parentScrollTop;\n    for (const entry of entries) {\n      if (!entry.isIntersecting) {\n        this._activeTarget = null;\n        this._clearActiveClass(targetElement(entry));\n        continue;\n      }\n      const entryIsLowerThanPrevious = entry.target.offsetTop >= this._previousScrollData.visibleEntryTop;\n      // if we are scrolling down, pick the bigger offsetTop\n      if (userScrollsDown && entryIsLowerThanPrevious) {\n        activate(entry);\n        // if parent isn't scrolled, let's keep the first visible item, breaking the iteration\n        if (!parentScrollTop) {\n          return;\n        }\n        continue;\n      }\n\n      // if we are scrolling up, pick the smallest offsetTop\n      if (!userScrollsDown && !entryIsLowerThanPrevious) {\n        activate(entry);\n      }\n    }\n  }\n  _initializeTargetsAndObservables() {\n    this._targetLinks = new Map();\n    this._observableSections = new Map();\n    const targetLinks = SelectorEngine.find(SELECTOR_TARGET_LINKS, this._config.target);\n    for (const anchor of targetLinks) {\n      // ensure that the anchor has an id and is not disabled\n      if (!anchor.hash || isDisabled(anchor)) {\n        continue;\n      }\n      const observableSection = SelectorEngine.findOne(decodeURI(anchor.hash), this._element);\n\n      // ensure that the observableSection exists & is visible\n      if (isVisible(observableSection)) {\n        this._targetLinks.set(decodeURI(anchor.hash), anchor);\n        this._observableSections.set(anchor.hash, observableSection);\n      }\n    }\n  }\n  _process(target) {\n    if (this._activeTarget === target) {\n      return;\n    }\n    this._clearActiveClass(this._config.target);\n    this._activeTarget = target;\n    target.classList.add(CLASS_NAME_ACTIVE$1);\n    this._activateParents(target);\n    EventHandler.trigger(this._element, EVENT_ACTIVATE, {\n      relatedTarget: target\n    });\n  }\n  _activateParents(target) {\n    // Activate dropdown parents\n    if (target.classList.contains(CLASS_NAME_DROPDOWN_ITEM)) {\n      SelectorEngine.findOne(SELECTOR_DROPDOWN_TOGGLE$1, target.closest(SELECTOR_DROPDOWN)).classList.add(CLASS_NAME_ACTIVE$1);\n      return;\n    }\n    for (const listGroup of SelectorEngine.parents(target, SELECTOR_NAV_LIST_GROUP)) {\n      // Set triggered links parents as active\n      // With both <ul> and <nav> markup a parent is the previous sibling of any nav ancestor\n      for (const item of SelectorEngine.prev(listGroup, SELECTOR_LINK_ITEMS)) {\n        item.classList.add(CLASS_NAME_ACTIVE$1);\n      }\n    }\n  }\n  _clearActiveClass(parent) {\n    parent.classList.remove(CLASS_NAME_ACTIVE$1);\n    const activeNodes = SelectorEngine.find(`${SELECTOR_TARGET_LINKS}.${CLASS_NAME_ACTIVE$1}`, parent);\n    for (const node of activeNodes) {\n      node.classList.remove(CLASS_NAME_ACTIVE$1);\n    }\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = ScrollSpy.getOrCreateInstance(this, config);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config]();\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(window, EVENT_LOAD_DATA_API$1, () => {\n  for (const spy of SelectorEngine.find(SELECTOR_DATA_SPY)) {\n    ScrollSpy.getOrCreateInstance(spy);\n  }\n});\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(ScrollSpy);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap tab.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME$1 = 'tab';\nconst DATA_KEY$1 = 'bs.tab';\nconst EVENT_KEY$1 = `.${DATA_KEY$1}`;\nconst EVENT_HIDE$1 = `hide${EVENT_KEY$1}`;\nconst EVENT_HIDDEN$1 = `hidden${EVENT_KEY$1}`;\nconst EVENT_SHOW$1 = `show${EVENT_KEY$1}`;\nconst EVENT_SHOWN$1 = `shown${EVENT_KEY$1}`;\nconst EVENT_CLICK_DATA_API = `click${EVENT_KEY$1}`;\nconst EVENT_KEYDOWN = `keydown${EVENT_KEY$1}`;\nconst EVENT_LOAD_DATA_API = `load${EVENT_KEY$1}`;\nconst ARROW_LEFT_KEY = 'ArrowLeft';\nconst ARROW_RIGHT_KEY = 'ArrowRight';\nconst ARROW_UP_KEY = 'ArrowUp';\nconst ARROW_DOWN_KEY = 'ArrowDown';\nconst HOME_KEY = 'Home';\nconst END_KEY = 'End';\nconst CLASS_NAME_ACTIVE = 'active';\nconst CLASS_NAME_FADE$1 = 'fade';\nconst CLASS_NAME_SHOW$1 = 'show';\nconst CLASS_DROPDOWN = 'dropdown';\nconst SELECTOR_DROPDOWN_TOGGLE = '.dropdown-toggle';\nconst SELECTOR_DROPDOWN_MENU = '.dropdown-menu';\nconst NOT_SELECTOR_DROPDOWN_TOGGLE = `:not(${SELECTOR_DROPDOWN_TOGGLE})`;\nconst SELECTOR_TAB_PANEL = '.list-group, .nav, [role=\"tablist\"]';\nconst SELECTOR_OUTER = '.nav-item, .list-group-item';\nconst SELECTOR_INNER = `.nav-link${NOT_SELECTOR_DROPDOWN_TOGGLE}, .list-group-item${NOT_SELECTOR_DROPDOWN_TOGGLE}, [role=\"tab\"]${NOT_SELECTOR_DROPDOWN_TOGGLE}`;\nconst SELECTOR_DATA_TOGGLE = '[data-bs-toggle=\"tab\"], [data-bs-toggle=\"pill\"], [data-bs-toggle=\"list\"]'; // TODO: could only be `tab` in v6\nconst SELECTOR_INNER_ELEM = `${SELECTOR_INNER}, ${SELECTOR_DATA_TOGGLE}`;\nconst SELECTOR_DATA_TOGGLE_ACTIVE = `.${CLASS_NAME_ACTIVE}[data-bs-toggle=\"tab\"], .${CLASS_NAME_ACTIVE}[data-bs-toggle=\"pill\"], .${CLASS_NAME_ACTIVE}[data-bs-toggle=\"list\"]`;\n\n/**\n * Class definition\n */\n\nclass Tab extends BaseComponent {\n  constructor(element) {\n    super(element);\n    this._parent = this._element.closest(SELECTOR_TAB_PANEL);\n    if (!this._parent) {\n      return;\n      // TODO: should throw exception in v6\n      // throw new TypeError(`${element.outerHTML} has not a valid parent ${SELECTOR_INNER_ELEM}`)\n    }\n\n    // Set up initial aria attributes\n    this._setInitialAttributes(this._parent, this._getChildren());\n    EventHandler.on(this._element, EVENT_KEYDOWN, event => this._keydown(event));\n  }\n\n  // Getters\n  static get NAME() {\n    return NAME$1;\n  }\n\n  // Public\n  show() {\n    // Shows this elem and deactivate the active sibling if exists\n    const innerElem = this._element;\n    if (this._elemIsActive(innerElem)) {\n      return;\n    }\n\n    // Search for active tab on same parent to deactivate it\n    const active = this._getActiveElem();\n    const hideEvent = active ? EventHandler.trigger(active, EVENT_HIDE$1, {\n      relatedTarget: innerElem\n    }) : null;\n    const showEvent = EventHandler.trigger(innerElem, EVENT_SHOW$1, {\n      relatedTarget: active\n    });\n    if (showEvent.defaultPrevented || hideEvent && hideEvent.defaultPrevented) {\n      return;\n    }\n    this._deactivate(active, innerElem);\n    this._activate(innerElem, active);\n  }\n\n  // Private\n  _activate(element, relatedElem) {\n    if (!element) {\n      return;\n    }\n    element.classList.add(CLASS_NAME_ACTIVE);\n    this._activate(SelectorEngine.getElementFromSelector(element)); // Search and activate/show the proper section\n\n    const complete = () => {\n      if (element.getAttribute('role') !== 'tab') {\n        element.classList.add(CLASS_NAME_SHOW$1);\n        return;\n      }\n      element.removeAttribute('tabindex');\n      element.setAttribute('aria-selected', true);\n      this._toggleDropDown(element, true);\n      EventHandler.trigger(element, EVENT_SHOWN$1, {\n        relatedTarget: relatedElem\n      });\n    };\n    this._queueCallback(complete, element, element.classList.contains(CLASS_NAME_FADE$1));\n  }\n  _deactivate(element, relatedElem) {\n    if (!element) {\n      return;\n    }\n    element.classList.remove(CLASS_NAME_ACTIVE);\n    element.blur();\n    this._deactivate(SelectorEngine.getElementFromSelector(element)); // Search and deactivate the shown section too\n\n    const complete = () => {\n      if (element.getAttribute('role') !== 'tab') {\n        element.classList.remove(CLASS_NAME_SHOW$1);\n        return;\n      }\n      element.setAttribute('aria-selected', false);\n      element.setAttribute('tabindex', '-1');\n      this._toggleDropDown(element, false);\n      EventHandler.trigger(element, EVENT_HIDDEN$1, {\n        relatedTarget: relatedElem\n      });\n    };\n    this._queueCallback(complete, element, element.classList.contains(CLASS_NAME_FADE$1));\n  }\n  _keydown(event) {\n    if (![ARROW_LEFT_KEY, ARROW_RIGHT_KEY, ARROW_UP_KEY, ARROW_DOWN_KEY, HOME_KEY, END_KEY].includes(event.key)) {\n      return;\n    }\n    event.stopPropagation(); // stopPropagation/preventDefault both added to support up/down keys without scrolling the page\n    event.preventDefault();\n    const children = this._getChildren().filter(element => !isDisabled(element));\n    let nextActiveElement;\n    if ([HOME_KEY, END_KEY].includes(event.key)) {\n      nextActiveElement = children[event.key === HOME_KEY ? 0 : children.length - 1];\n    } else {\n      const isNext = [ARROW_RIGHT_KEY, ARROW_DOWN_KEY].includes(event.key);\n      nextActiveElement = getNextActiveElement(children, event.target, isNext, true);\n    }\n    if (nextActiveElement) {\n      nextActiveElement.focus({\n        preventScroll: true\n      });\n      Tab.getOrCreateInstance(nextActiveElement).show();\n    }\n  }\n  _getChildren() {\n    // collection of inner elements\n    return SelectorEngine.find(SELECTOR_INNER_ELEM, this._parent);\n  }\n  _getActiveElem() {\n    return this._getChildren().find(child => this._elemIsActive(child)) || null;\n  }\n  _setInitialAttributes(parent, children) {\n    this._setAttributeIfNotExists(parent, 'role', 'tablist');\n    for (const child of children) {\n      this._setInitialAttributesOnChild(child);\n    }\n  }\n  _setInitialAttributesOnChild(child) {\n    child = this._getInnerElement(child);\n    const isActive = this._elemIsActive(child);\n    const outerElem = this._getOuterElement(child);\n    child.setAttribute('aria-selected', isActive);\n    if (outerElem !== child) {\n      this._setAttributeIfNotExists(outerElem, 'role', 'presentation');\n    }\n    if (!isActive) {\n      child.setAttribute('tabindex', '-1');\n    }\n    this._setAttributeIfNotExists(child, 'role', 'tab');\n\n    // set attributes to the related panel too\n    this._setInitialAttributesOnTargetPanel(child);\n  }\n  _setInitialAttributesOnTargetPanel(child) {\n    const target = SelectorEngine.getElementFromSelector(child);\n    if (!target) {\n      return;\n    }\n    this._setAttributeIfNotExists(target, 'role', 'tabpanel');\n    if (child.id) {\n      this._setAttributeIfNotExists(target, 'aria-labelledby', `${child.id}`);\n    }\n  }\n  _toggleDropDown(element, open) {\n    const outerElem = this._getOuterElement(element);\n    if (!outerElem.classList.contains(CLASS_DROPDOWN)) {\n      return;\n    }\n    const toggle = (selector, className) => {\n      const element = SelectorEngine.findOne(selector, outerElem);\n      if (element) {\n        element.classList.toggle(className, open);\n      }\n    };\n    toggle(SELECTOR_DROPDOWN_TOGGLE, CLASS_NAME_ACTIVE);\n    toggle(SELECTOR_DROPDOWN_MENU, CLASS_NAME_SHOW$1);\n    outerElem.setAttribute('aria-expanded', open);\n  }\n  _setAttributeIfNotExists(element, attribute, value) {\n    if (!element.hasAttribute(attribute)) {\n      element.setAttribute(attribute, value);\n    }\n  }\n  _elemIsActive(elem) {\n    return elem.classList.contains(CLASS_NAME_ACTIVE);\n  }\n\n  // Try to get the inner element (usually the .nav-link)\n  _getInnerElement(elem) {\n    return elem.matches(SELECTOR_INNER_ELEM) ? elem : SelectorEngine.findOne(SELECTOR_INNER_ELEM, elem);\n  }\n\n  // Try to get the outer element (usually the .nav-item)\n  _getOuterElement(elem) {\n    return elem.closest(SELECTOR_OUTER) || elem;\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Tab.getOrCreateInstance(this);\n      if (typeof config !== 'string') {\n        return;\n      }\n      if (data[config] === undefined || config.startsWith('_') || config === 'constructor') {\n        throw new TypeError(`No method named \"${config}\"`);\n      }\n      data[config]();\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nEventHandler.on(document, EVENT_CLICK_DATA_API, SELECTOR_DATA_TOGGLE, function (event) {\n  if (['A', 'AREA'].includes(this.tagName)) {\n    event.preventDefault();\n  }\n  if (isDisabled(this)) {\n    return;\n  }\n  Tab.getOrCreateInstance(this).show();\n});\n\n/**\n * Initialize on focus\n */\nEventHandler.on(window, EVENT_LOAD_DATA_API, () => {\n  for (const element of SelectorEngine.find(SELECTOR_DATA_TOGGLE_ACTIVE)) {\n    Tab.getOrCreateInstance(element);\n  }\n});\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Tab);\n\n/**\n * --------------------------------------------------------------------------\n * Bootstrap toast.js\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n * --------------------------------------------------------------------------\n */\n\n\n/**\n * Constants\n */\n\nconst NAME = 'toast';\nconst DATA_KEY = 'bs.toast';\nconst EVENT_KEY = `.${DATA_KEY}`;\nconst EVENT_MOUSEOVER = `mouseover${EVENT_KEY}`;\nconst EVENT_MOUSEOUT = `mouseout${EVENT_KEY}`;\nconst EVENT_FOCUSIN = `focusin${EVENT_KEY}`;\nconst EVENT_FOCUSOUT = `focusout${EVENT_KEY}`;\nconst EVENT_HIDE = `hide${EVENT_KEY}`;\nconst EVENT_HIDDEN = `hidden${EVENT_KEY}`;\nconst EVENT_SHOW = `show${EVENT_KEY}`;\nconst EVENT_SHOWN = `shown${EVENT_KEY}`;\nconst CLASS_NAME_FADE = 'fade';\nconst CLASS_NAME_HIDE = 'hide'; // @deprecated - kept here only for backwards compatibility\nconst CLASS_NAME_SHOW = 'show';\nconst CLASS_NAME_SHOWING = 'showing';\nconst DefaultType = {\n  animation: 'boolean',\n  autohide: 'boolean',\n  delay: 'number'\n};\nconst Default = {\n  animation: true,\n  autohide: true,\n  delay: 5000\n};\n\n/**\n * Class definition\n */\n\nclass Toast extends BaseComponent {\n  constructor(element, config) {\n    super(element, config);\n    this._timeout = null;\n    this._hasMouseInteraction = false;\n    this._hasKeyboardInteraction = false;\n    this._setListeners();\n  }\n\n  // Getters\n  static get Default() {\n    return Default;\n  }\n  static get DefaultType() {\n    return DefaultType;\n  }\n  static get NAME() {\n    return NAME;\n  }\n\n  // Public\n  show() {\n    const showEvent = EventHandler.trigger(this._element, EVENT_SHOW);\n    if (showEvent.defaultPrevented) {\n      return;\n    }\n    this._clearTimeout();\n    if (this._config.animation) {\n      this._element.classList.add(CLASS_NAME_FADE);\n    }\n    const complete = () => {\n      this._element.classList.remove(CLASS_NAME_SHOWING);\n      EventHandler.trigger(this._element, EVENT_SHOWN);\n      this._maybeScheduleHide();\n    };\n    this._element.classList.remove(CLASS_NAME_HIDE); // @deprecated\n    reflow(this._element);\n    this._element.classList.add(CLASS_NAME_SHOW, CLASS_NAME_SHOWING);\n    this._queueCallback(complete, this._element, this._config.animation);\n  }\n  hide() {\n    if (!this.isShown()) {\n      return;\n    }\n    const hideEvent = EventHandler.trigger(this._element, EVENT_HIDE);\n    if (hideEvent.defaultPrevented) {\n      return;\n    }\n    const complete = () => {\n      this._element.classList.add(CLASS_NAME_HIDE); // @deprecated\n      this._element.classList.remove(CLASS_NAME_SHOWING, CLASS_NAME_SHOW);\n      EventHandler.trigger(this._element, EVENT_HIDDEN);\n    };\n    this._element.classList.add(CLASS_NAME_SHOWING);\n    this._queueCallback(complete, this._element, this._config.animation);\n  }\n  dispose() {\n    this._clearTimeout();\n    if (this.isShown()) {\n      this._element.classList.remove(CLASS_NAME_SHOW);\n    }\n    super.dispose();\n  }\n  isShown() {\n    return this._element.classList.contains(CLASS_NAME_SHOW);\n  }\n\n  // Private\n\n  _maybeScheduleHide() {\n    if (!this._config.autohide) {\n      return;\n    }\n    if (this._hasMouseInteraction || this._hasKeyboardInteraction) {\n      return;\n    }\n    this._timeout = setTimeout(() => {\n      this.hide();\n    }, this._config.delay);\n  }\n  _onInteraction(event, isInteracting) {\n    switch (event.type) {\n      case 'mouseover':\n      case 'mouseout':\n        {\n          this._hasMouseInteraction = isInteracting;\n          break;\n        }\n      case 'focusin':\n      case 'focusout':\n        {\n          this._hasKeyboardInteraction = isInteracting;\n          break;\n        }\n    }\n    if (isInteracting) {\n      this._clearTimeout();\n      return;\n    }\n    const nextElement = event.relatedTarget;\n    if (this._element === nextElement || this._element.contains(nextElement)) {\n      return;\n    }\n    this._maybeScheduleHide();\n  }\n  _setListeners() {\n    EventHandler.on(this._element, EVENT_MOUSEOVER, event => this._onInteraction(event, true));\n    EventHandler.on(this._element, EVENT_MOUSEOUT, event => this._onInteraction(event, false));\n    EventHandler.on(this._element, EVENT_FOCUSIN, event => this._onInteraction(event, true));\n    EventHandler.on(this._element, EVENT_FOCUSOUT, event => this._onInteraction(event, false));\n  }\n  _clearTimeout() {\n    clearTimeout(this._timeout);\n    this._timeout = null;\n  }\n\n  // Static\n  static jQueryInterface(config) {\n    return this.each(function () {\n      const data = Toast.getOrCreateInstance(this, config);\n      if (typeof config === 'string') {\n        if (typeof data[config] === 'undefined') {\n          throw new TypeError(`No method named \"${config}\"`);\n        }\n        data[config](this);\n      }\n    });\n  }\n}\n\n/**\n * Data API implementation\n */\n\nenableDismissTrigger(Toast);\n\n/**\n * jQuery\n */\n\ndefineJQueryPlugin(Toast);\n\nexport { Alert, Button, Carousel, Collapse, Dropdown, Modal, Offcanvas, Popover, ScrollSpy, Tab, Toast, Tooltip };\n//# sourceMappingURL=bootstrap.esm.js.map\n","/* define several functions to replace jQuery methods\n * inspired by https://tobiasahlin.com/blog/move-from-jquery-to-vanilla-javascript/\n */\n\n/**\n * Execute a method if DOM has finished loading\n *\n * @param {function} callback the method to execute\n */\nexport function documentReady(callback) {\n  if (document.readyState != \"loading\") callback();\n  else document.addEventListener(\"DOMContentLoaded\", callback);\n}\n","// Import and setup functions to control Bootstrap's behavior.\nimport \"@popperjs/core\";\nimport { Tooltip } from \"bootstrap\";\nimport { documentReady } from \"./mixin\";\n\nimport \"../styles/bootstrap.scss\";\n\n/*******************************************************************************\n * Trigger tooltips\n */\n\n/**\n * Add tooltip to each element with the \"tooltip\" data-bs-toogle class\n */\nfunction TriggerTooltip() {\n  var tooltipTriggerList = [].slice.call(\n    document.querySelectorAll('[data-bs-toggle=\"tooltip\"]')\n  );\n  tooltipTriggerList.map(function (tooltipTriggerEl) {\n    return new Tooltip(tooltipTriggerEl, { delay: { show: 500, hide: 100 } });\n  });\n}\n\n/*******************************************************************************\n * back to top button\n */\nfunction backToTop() {\n  var btn = document.getElementById(\"pst-back-to-top\");\n  btn.addEventListener(\"click\", function () {\n    document.body.scrollTop = 0;\n    document.documentElement.scrollTop = 0;\n  });\n}\n\nfunction showBackToTop() {\n  var btn = document.getElementById(\"pst-back-to-top\");\n  var header = document\n    .getElementsByClassName(\"bd-header\")[0]\n    .getBoundingClientRect();\n  window.addEventListener(\"scroll\", function () {\n    if (this.oldScroll > this.scrollY && this.scrollY > header.bottom) {\n      btn.style.display = \"block\";\n    } else {\n      btn.style.display = \"none\";\n    }\n    this.oldScroll = this.scrollY;\n  });\n}\n\n/*******************************************************************************\n * Call functions after document loading.\n */\n\ndocumentReady(TriggerTooltip);\ndocumentReady(backToTop);\ndocumentReady(showBackToTop);\n"],"names":["__webpack_require__","exports","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","bottom","right","left","auto","basePlacements","start","end","clippingParents","viewport","popper","reference","variationPlacements","reduce","acc","placement","concat","beforeRead","read","afterRead","beforeMain","main","afterMain","beforeWrite","write","afterWrite","modifierPhases","getNodeName","element","nodeName","toLowerCase","getWindow","node","window","toString","ownerDocument","defaultView","isElement","Element","isHTMLElement","HTMLElement","isShadowRoot","ShadowRoot","name","enabled","phase","fn","_ref","state","keys","elements","forEach","style","styles","attributes","assign","removeAttribute","setAttribute","effect","_ref2","initialStyles","position","options","strategy","top","margin","arrow","property","attribute","requires","getBasePlacement","split","Math","max","min","round","getUAString","uaData","navigator","userAgentData","brands","Array","isArray","map","item","brand","version","join","userAgent","isLayoutViewport","test","getBoundingClientRect","includeScale","isFixedStrategy","clientRect","scaleX","scaleY","offsetWidth","width","offsetHeight","height","visualViewport","addVisualOffsets","x","offsetLeft","y","offsetTop","getLayoutRect","abs","contains","parent","child","rootNode","getRootNode","next","isSameNode","parentNode","host","getComputedStyle","isTableElement","indexOf","getDocumentElement","document","documentElement","getParentNode","assignedSlot","getTrueOffsetParent","offsetParent","getOffsetParent","isFirefox","currentNode","css","transform","perspective","contain","willChange","filter","getContainingBlock","getMainAxisFromPlacement","within","mergePaddingObject","paddingObject","expandToHashMap","hashMap","_state$modifiersData$","arrowElement","popperOffsets","modifiersData","basePlacement","axis","len","padding","rects","toPaddingObject","arrowRect","minProp","maxProp","endDiff","startDiff","arrowOffsetParent","clientSize","clientHeight","clientWidth","centerToReference","center","offset","axisProp","centerOffset","_options$element","querySelector","requiresIfExists","getVariation","unsetSides","mapToStyles","_Object$assign2","popperRect","variation","offsets","gpuAcceleration","adaptive","roundOffsets","isFixed","_offsets$x","_offsets$y","_ref3","hasX","hasY","sideX","sideY","win","heightProp","widthProp","_Object$assign","commonStyles","_ref4","dpr","devicePixelRatio","roundOffsetsByDPR","_ref5","_options$gpuAccelerat","_options$adaptive","_options$roundOffsets","data","passive","instance","_options$scroll","scroll","_options$resize","resize","scrollParents","scrollParent","addEventListener","update","removeEventListener","hash","getOppositePlacement","replace","matched","getOppositeVariationPlacement","getWindowScroll","scrollLeft","pageXOffset","scrollTop","pageYOffset","getWindowScrollBarX","isScrollParent","_getComputedStyle","overflow","overflowX","overflowY","getScrollParent","body","listScrollParents","list","_element$ownerDocumen","isBody","target","updatedList","rectToClientRect","rect","getClientRectFromMixedType","clippingParent","html","layoutViewport","getViewportRect","clientTop","clientLeft","getInnerBoundingClientRect","winScroll","scrollWidth","scrollHeight","direction","getDocumentRect","computeOffsets","commonX","commonY","mainAxis","detectOverflow","_options","_options$placement","_options$strategy","_options$boundary","boundary","_options$rootBoundary","rootBoundary","_options$elementConte","elementContext","_options$altBoundary","altBoundary","_options$padding","altContext","clippingClientRect","mainClippingParents","clipperElement","getClippingParents","firstClippingParent","clippingRect","accRect","getClippingRect","contextElement","referenceClientRect","popperClientRect","elementClientRect","overflowOffsets","offsetData","multiply","_skip","_options$mainAxis","checkMainAxis","_options$altAxis","altAxis","checkAltAxis","specifiedFallbackPlacements","fallbackPlacements","_options$flipVariatio","flipVariations","allowedAutoPlacements","preferredPlacement","oppositePlacement","getExpandedFallbackPlacements","placements","_options$allowedAutoP","allowedPlacements","length","overflows","sort","a","b","computeAutoPlacement","referenceRect","checksMap","Map","makeFallbackChecks","firstFittingPlacement","i","_basePlacement","isStartVariation","isVertical","mainVariationSide","altVariationSide","checks","push","every","check","set","_loop","_i","fittingPlacement","find","slice","reset","getSideOffsets","preventedOffsets","isAnySideFullyClipped","some","side","preventOverflow","referenceOverflow","popperAltOverflow","referenceClippingOffsets","popperEscapeOffsets","isReferenceHidden","hasPopperEscaped","_options$offset","invertDistance","skidding","distance","distanceAndSkiddingToXY","_data$state$placement","_options$tether","tether","_options$tetherOffset","tetherOffset","isBasePlacement","tetherOffsetValue","normalizedTetherOffsetValue","offsetModifierState","_offsetModifierState$","mainSide","altSide","additive","minLen","maxLen","arrowPaddingObject","arrowPaddingMin","arrowPaddingMax","arrowLen","minOffset","maxOffset","clientOffset","offsetModifierValue","tetherMax","preventedOffset","_offsetModifierState$2","_mainSide","_altSide","_offset","_len","_min","_max","isOriginSide","_offsetModifierValue","_tetherMin","_tetherMax","_preventedOffset","v","withinMaxClamp","getCompositeRect","elementOrVirtualElement","isOffsetParentAnElement","offsetParentIsScaled","isElementScaled","order","modifiers","visited","Set","result","modifier","add","dep","has","depModifier","DEFAULT_OPTIONS","areValidElements","arguments","args","_key","popperGenerator","generatorOptions","_generatorOptions","_generatorOptions$def","defaultModifiers","_generatorOptions$def2","defaultOptions","pending","orderedModifiers","effectCleanupFns","isDestroyed","setOptions","setOptionsAction","cleanupModifierEffects","merged","orderModifiers","current","existing","m","_ref$options","cleanupFn","forceUpdate","_state$elements","index","_state$orderedModifie","_state$orderedModifie2","Promise","resolve","then","undefined","destroy","onFirstUpdate","createPopper","eventListeners","elementMap","Data","instanceMap","size","console","error","from","remove","delete","TRANSITION_END","parseSelector","selector","CSS","escape","match","id","triggerTransitionEnd","dispatchEvent","Event","object","jquery","nodeType","getElement","isVisible","getClientRects","elementIsVisible","getPropertyValue","closedDetails","closest","summary","isDisabled","Node","ELEMENT_NODE","classList","disabled","hasAttribute","getAttribute","findShadowRoot","attachShadow","root","noop","reflow","getjQuery","jQuery","DOMContentLoadedCallbacks","isRTL","dir","defineJQueryPlugin","plugin","callback","$","NAME","JQUERY_NO_CONFLICT","jQueryInterface","Constructor","noConflict","readyState","execute","possibleCallback","defaultValue","executeAfterTransition","transitionElement","waitForTransition","emulatedDuration","transitionDuration","transitionDelay","floatTransitionDuration","Number","parseFloat","floatTransitionDelay","getTransitionDurationFromElement","called","handler","setTimeout","getNextActiveElement","activeElement","shouldGetNext","isCycleAllowed","listLength","namespaceRegex","stripNameRegex","stripUidRegex","eventRegistry","uidEvent","customEvents","mouseenter","mouseleave","nativeEvents","makeEventUid","uid","getElementEvents","findHandler","events","callable","delegationSelector","values","event","normalizeParameters","originalTypeEvent","delegationFunction","isDelegated","typeEvent","getTypeEvent","addHandler","oneOff","wrapFunction","relatedTarget","delegateTarget","this","handlers","previousFunction","domElements","querySelectorAll","domElement","hydrateObj","EventHandler","off","type","apply","bootstrapDelegationHandler","bootstrapHandler","removeHandler","Boolean","removeNamespacedHandlers","namespace","storeElementEvent","handlerKey","entries","includes","on","one","inNamespace","isNamespace","startsWith","elementEvent","keyHandlers","trigger","jQueryEvent","bubbles","nativeDispatch","defaultPrevented","isPropagationStopped","isImmediatePropagationStopped","isDefaultPrevented","evt","cancelable","preventDefault","meta","_unused","configurable","normalizeData","JSON","parse","decodeURIComponent","normalizeDataKey","chr","Manipulator","setDataAttribute","removeDataAttribute","getDataAttributes","bsKeys","dataset","pureKey","charAt","getDataAttribute","Config","Default","DefaultType","Error","_getConfig","config","_mergeConfigObj","_configAfterMerge","_typeCheckConfig","jsonConfig","constructor","configTypes","expectedTypes","valueType","RegExp","TypeError","toUpperCase","BaseComponent","super","_element","_config","DATA_KEY","dispose","EVENT_KEY","propertyName","getOwnPropertyNames","_queueCallback","isAnimated","getInstance","getOrCreateInstance","VERSION","eventName","getSelector","hrefAttribute","trim","SelectorEngine","findOne","children","matches","parents","ancestor","prev","previous","previousElementSibling","nextElementSibling","focusableChildren","focusables","el","getSelectorFromElement","getElementFromSelector","getMultipleElementsFromSelector","enableDismissTrigger","component","method","clickEvent","tagName","EVENT_KEY$b","EVENT_CLOSE","EVENT_CLOSED","Alert","close","_destroyElement","each","SELECTOR_DATA_TOGGLE$5","Button","toggle","button","EVENT_KEY$9","EVENT_TOUCHSTART","EVENT_TOUCHMOVE","EVENT_TOUCHEND","EVENT_POINTERDOWN","EVENT_POINTERUP","Default$c","endCallback","leftCallback","rightCallback","DefaultType$c","Swipe","isSupported","_deltaX","_supportPointerEvents","PointerEvent","_initEvents","_start","_eventIsPointerPenTouch","clientX","touches","_end","_handleSwipe","_move","absDeltaX","pointerType","maxTouchPoints","EVENT_KEY$8","DATA_API_KEY$5","ORDER_NEXT","ORDER_PREV","DIRECTION_LEFT","DIRECTION_RIGHT","EVENT_SLIDE","EVENT_SLID","EVENT_KEYDOWN$1","EVENT_MOUSEENTER$1","EVENT_MOUSELEAVE$1","EVENT_DRAG_START","EVENT_LOAD_DATA_API$3","EVENT_CLICK_DATA_API$5","CLASS_NAME_CAROUSEL","CLASS_NAME_ACTIVE$2","SELECTOR_ACTIVE","SELECTOR_ITEM","SELECTOR_ACTIVE_ITEM","KEY_TO_DIRECTION","Default$b","interval","keyboard","pause","ride","touch","wrap","DefaultType$b","Carousel","_interval","_activeElement","_isSliding","touchTimeout","_swipeHelper","_indicatorsElement","_addEventListeners","cycle","_slide","nextWhenVisible","hidden","_clearInterval","_updateInterval","setInterval","_maybeEnableCycle","to","items","_getItems","activeIndex","_getItemIndex","_getActive","defaultInterval","_keydown","_addTouchEventListeners","img","swipeConfig","_directionToOrder","clearTimeout","_setActiveIndicatorElement","activeIndicator","newActiveIndicator","elementInterval","parseInt","isNext","nextElement","nextElementIndex","triggerEvent","_orderToDirection","isCycling","directionalClassName","orderClassName","_isAnimated","clearInterval","carousel","slideIndex","carousels","EVENT_KEY$7","EVENT_SHOW$6","EVENT_SHOWN$6","EVENT_HIDE$6","EVENT_HIDDEN$6","EVENT_CLICK_DATA_API$4","CLASS_NAME_SHOW$7","CLASS_NAME_COLLAPSE","CLASS_NAME_COLLAPSING","CLASS_NAME_DEEPER_CHILDREN","SELECTOR_DATA_TOGGLE$4","Default$a","DefaultType$a","Collapse","_isTransitioning","_triggerArray","toggleList","elem","filterElement","foundElement","_initializeChildren","_addAriaAndCollapsedClass","_isShown","hide","show","activeChildren","_getFirstLevelChildren","activeInstance","dimension","_getDimension","scrollSize","selected","triggerArray","isOpen","NAME$a","EVENT_KEY$6","DATA_API_KEY$3","ARROW_UP_KEY$1","ARROW_DOWN_KEY$1","EVENT_HIDE$5","EVENT_HIDDEN$5","EVENT_SHOW$5","EVENT_SHOWN$5","EVENT_CLICK_DATA_API$3","EVENT_KEYDOWN_DATA_API","EVENT_KEYUP_DATA_API","CLASS_NAME_SHOW$6","SELECTOR_DATA_TOGGLE$3","SELECTOR_DATA_TOGGLE_SHOWN","SELECTOR_MENU","PLACEMENT_TOP","PLACEMENT_TOPEND","PLACEMENT_BOTTOM","PLACEMENT_BOTTOMEND","PLACEMENT_RIGHT","PLACEMENT_LEFT","Default$9","autoClose","display","popperConfig","DefaultType$9","Dropdown","_popper","_parent","_menu","_inNavbar","_detectNavbar","_createPopper","focus","_completeHide","referenceElement","_getPopperConfig","_getPlacement","parentDropdown","isEnd","_getOffset","popperData","defaultBsPopperConfig","_selectMenuItem","clearMenus","openToggles","context","composedPath","isMenuTarget","dataApiKeydownHandler","isInput","isEscapeEvent","isUpOrDownEvent","getToggleButton","stopPropagation","NAME$9","CLASS_NAME_SHOW$5","EVENT_MOUSEDOWN","Default$8","className","clickCallback","rootElement","DefaultType$8","Backdrop","_isAppended","_append","_getElement","_emulateAnimation","backdrop","createElement","append","EVENT_KEY$5","EVENT_FOCUSIN$2","EVENT_KEYDOWN_TAB","TAB_NAV_BACKWARD","Default$7","autofocus","trapElement","DefaultType$7","FocusTrap","_isActive","_lastTabNavDirection","activate","_handleFocusin","_handleKeydown","deactivate","shiftKey","SELECTOR_FIXED_CONTENT","SELECTOR_STICKY_CONTENT","PROPERTY_PADDING","PROPERTY_MARGIN","ScrollBarHelper","getWidth","documentWidth","innerWidth","_disableOverFlow","_setElementAttributes","calculatedValue","_resetElementAttributes","isOverflowing","_saveInitialAttribute","styleProperty","scrollbarWidth","_applyManipulationCallback","setProperty","actualValue","removeProperty","callBack","sel","EVENT_KEY$4","EVENT_HIDE$4","EVENT_HIDE_PREVENTED$1","EVENT_HIDDEN$4","EVENT_SHOW$4","EVENT_SHOWN$4","EVENT_RESIZE$1","EVENT_CLICK_DISMISS","EVENT_MOUSEDOWN_DISMISS","EVENT_KEYDOWN_DISMISS$1","EVENT_CLICK_DATA_API$2","CLASS_NAME_OPEN","CLASS_NAME_SHOW$4","CLASS_NAME_STATIC","Default$6","DefaultType$6","Modal","_dialog","_backdrop","_initializeBackDrop","_focustrap","_initializeFocusTrap","_scrollBar","_adjustDialog","_showElement","_hideModal","handleUpdate","modalBody","_triggerBackdropTransition","event2","_resetAdjustments","isModalOverflowing","initialOverflowY","isBodyOverflowing","paddingLeft","paddingRight","showEvent","alreadyOpen","EVENT_KEY$3","DATA_API_KEY$1","EVENT_LOAD_DATA_API$2","CLASS_NAME_SHOW$3","CLASS_NAME_SHOWING$1","CLASS_NAME_HIDING","OPEN_SELECTOR","EVENT_SHOW$3","EVENT_SHOWN$3","EVENT_HIDE$3","EVENT_HIDE_PREVENTED","EVENT_HIDDEN$3","EVENT_RESIZE","EVENT_CLICK_DATA_API$1","EVENT_KEYDOWN_DISMISS","Default$5","DefaultType$5","Offcanvas","blur","DefaultAllowlist","area","br","col","code","div","em","hr","h1","h2","h3","h4","h5","h6","li","ol","p","pre","s","small","span","sub","sup","strong","u","ul","uriAttributes","SAFE_URL_PATTERN","allowedAttribute","allowedAttributeList","attributeName","nodeValue","attributeRegex","regex","Default$4","allowList","content","extraClass","sanitize","sanitizeFn","template","DefaultType$4","DefaultContentType","entry","TemplateFactory","getContent","_resolvePossibleFunction","hasContent","changeContent","_checkContent","toHtml","templateWrapper","innerHTML","_maybeSanitize","text","_setContent","arg","templateElement","_putElementInTemplate","textContent","unsafeHtml","sanitizeFunction","createdDocument","DOMParser","parseFromString","elementName","attributeList","allowedAttributes","sanitizeHtml","DISALLOWED_ATTRIBUTES","CLASS_NAME_FADE$2","CLASS_NAME_SHOW$2","SELECTOR_MODAL","EVENT_MODAL_HIDE","TRIGGER_HOVER","TRIGGER_FOCUS","AttachmentMap","AUTO","TOP","RIGHT","BOTTOM","LEFT","Default$3","animation","container","customClass","delay","title","DefaultType$3","Tooltip","_isEnabled","_timeout","_isHovered","_activeTrigger","_templateFactory","_newContent","tip","_setListeners","_fixTitle","enable","disable","toggleEnabled","click","_leave","_enter","_hideModalHandler","_disposePopper","_isWithContent","isInTheDom","_getTipElement","_isWithActiveTrigger","_getTitle","_createTipElement","_getContentForTemplate","_getTemplateFactory","tipId","prefix","floor","random","getElementById","getUID","setContent","_initializeOnDelegatedTarget","_getDelegateConfig","attachment","triggers","eventIn","eventOut","_setTimeout","timeout","dataAttributes","dataAttribute","Default$2","DefaultType$2","Popover","_getContent","EVENT_KEY$2","EVENT_ACTIVATE","EVENT_CLICK","EVENT_LOAD_DATA_API$1","CLASS_NAME_ACTIVE$1","SELECTOR_TARGET_LINKS","SELECTOR_NAV_LINKS","SELECTOR_LINK_ITEMS","Default$1","rootMargin","smoothScroll","threshold","DefaultType$1","ScrollSpy","_targetLinks","_observableSections","_rootElement","_activeTarget","_observer","_previousScrollData","visibleEntryTop","parentScrollTop","refresh","_initializeTargetsAndObservables","_maybeEnableSmoothScroll","disconnect","_getNewObserver","section","observe","observableSection","scrollTo","behavior","IntersectionObserver","_observerCallback","targetElement","_process","userScrollsDown","isIntersecting","_clearActiveClass","entryIsLowerThanPrevious","targetLinks","anchor","decodeURI","_activateParents","listGroup","activeNodes","spy","EVENT_KEY$1","EVENT_HIDE$1","EVENT_HIDDEN$1","EVENT_SHOW$1","EVENT_SHOWN$1","EVENT_CLICK_DATA_API","EVENT_KEYDOWN","EVENT_LOAD_DATA_API","ARROW_LEFT_KEY","ARROW_RIGHT_KEY","ARROW_UP_KEY","ARROW_DOWN_KEY","HOME_KEY","END_KEY","CLASS_NAME_ACTIVE","CLASS_NAME_FADE$1","CLASS_NAME_SHOW$1","SELECTOR_DROPDOWN_TOGGLE","NOT_SELECTOR_DROPDOWN_TOGGLE","SELECTOR_DATA_TOGGLE","SELECTOR_INNER_ELEM","SELECTOR_DATA_TOGGLE_ACTIVE","Tab","_setInitialAttributes","_getChildren","innerElem","_elemIsActive","active","_getActiveElem","hideEvent","_deactivate","_activate","relatedElem","_toggleDropDown","nextActiveElement","preventScroll","_setAttributeIfNotExists","_setInitialAttributesOnChild","_getInnerElement","isActive","outerElem","_getOuterElement","_setInitialAttributesOnTargetPanel","open","EVENT_MOUSEOVER","EVENT_MOUSEOUT","EVENT_FOCUSIN","EVENT_FOCUSOUT","EVENT_HIDE","EVENT_HIDDEN","EVENT_SHOW","EVENT_SHOWN","CLASS_NAME_HIDE","CLASS_NAME_SHOW","CLASS_NAME_SHOWING","autohide","Toast","_hasMouseInteraction","_hasKeyboardInteraction","_clearTimeout","_maybeScheduleHide","isShown","_onInteraction","isInteracting","documentReady","tooltipTriggerEl","btn","header","getElementsByClassName","oldScroll","scrollY"],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/_build/html/_static/scripts/pydata-sphinx-theme.js b/docs/_build/html/_static/scripts/pydata-sphinx-theme.js
deleted file mode 100644
index 85ae6ba..0000000
--- a/docs/_build/html/_static/scripts/pydata-sphinx-theme.js
+++ /dev/null
@@ -1,2 +0,0 @@
-(()=>{"use strict";var e,t,n,r,o={803:(e,t,n)=>{n.d(t,{Gu:()=>r,qu:()=>o});const r=e=>"string"==typeof e&&/^[v\d]/.test(e)&&a.test(e),o=(e,t,n)=>{h(n);const r=((e,t)=>{const n=c(e),r=c(t),o=n.pop(),a=r.pop(),d=l(n,r);return 0!==d?d:o&&a?l(o.split("."),a.split(".")):o||a?o?-1:1:0})(e,t);return u[n].includes(r)},a=/^[v^~<>=]*?(\d+)(?:\.([x*]|\d+)(?:\.([x*]|\d+)(?:\.([x*]|\d+))?(?:-([\da-z\-]+(?:\.[\da-z\-]+)*))?(?:\+[\da-z\-]+(?:\.[\da-z\-]+)*)?)?)?$/i,c=e=>{if("string"!=typeof e)throw new TypeError("Invalid argument expected string");const t=e.match(a);if(!t)throw new Error(`Invalid argument not valid semver ('${e}' received)`);return t.shift(),t},d=e=>"*"===e||"x"===e||"X"===e,i=e=>{const t=parseInt(e,10);return isNaN(t)?e:t},s=(e,t)=>{if(d(e)||d(t))return 0;const[n,r]=((e,t)=>typeof e!=typeof t?[String(e),String(t)]:[e,t])(i(e),i(t));return n>r?1:n<r?-1:0},l=(e,t)=>{for(let n=0;n<Math.max(e.length,t.length);n++){const r=s(e[n]||"0",t[n]||"0");if(0!==r)return r}return 0},u={">":[1],">=":[0,1],"=":[0],"<=":[-1,0],"<":[-1]},m=Object.keys(u),h=e=>{if("string"!=typeof e)throw new TypeError("Invalid operator type, expected string but got "+typeof e);if(-1===m.indexOf(e))throw new Error(`Invalid operator, expected one of ${m.join("|")}`)}},375:(e,t,n)=>{function r(e){"loading"!=document.readyState?e():document.addEventListener("DOMContentLoaded",e)}n.d(t,{A:()=>r})},937:(e,t,n)=>{n.a(e,(async(e,t)=>{try{var r=n(375),o=n(803),a=window.matchMedia("(prefers-color-scheme: dark)");function l(e){document.documentElement.dataset.theme=a.matches?"dark":"light"}function u(e){"light"!==e&&"dark"!==e&&"auto"!==e&&(console.error(`Got invalid theme mode: ${e}. Resetting to auto.`),e="auto");var t=a.matches?"dark":"light";document.documentElement.dataset.mode=e;var n="auto"==e?t:e;document.documentElement.dataset.theme=n,document.querySelectorAll(".dropdown-menu").forEach((e=>{"dark"===n?e.classList.add("dropdown-menu-dark"):e.classList.remove("dropdown-menu-dark")})),localStorage.setItem("mode",e),localStorage.setItem("theme",n),console.log(`[PST]: Changed to ${e} mode using the ${n} theme.`),a.onchange="auto"==e?l:""}function m(){const e=document.documentElement.dataset.defaultMode||"auto",t=localStorage.getItem("mode")||e;var n,r;u(((r=(n=a.matches?["auto","light","dark"]:["auto","dark","light"]).indexOf(t)+1)===n.length&&(r=0),n[r]))}function h(){u(document.documentElement.dataset.mode),document.querySelectorAll(".theme-switch-button").forEach((e=>{e.addEventListener("click",m)}))}function p(){window.addEventListener("activate.bs.scrollspy",(function(){document.querySelectorAll(".bd-toc-nav a").forEach((e=>{e.parentElement.classList.remove("active")})),document.querySelectorAll(".bd-toc-nav a.active").forEach((e=>{e.parentElement.classList.add("active")}))}))}function f(){if(!document.querySelector(".bd-docs-nav"))return;var e=document.querySelector("div.bd-sidebar");let t=parseInt(sessionStorage.getItem("sidebar-scroll-top"),10);if(isNaN(t)){var n=document.querySelector(".bd-docs-nav").querySelectorAll(".active");if(n.length>0){var r=n[n.length-1],o=r.getBoundingClientRect().y-e.getBoundingClientRect().y;if(r.getBoundingClientRect().y>.5*window.innerHeight){let t=.25;e.scrollTop=o-e.clientHeight*t,console.log("[PST]: Scrolled sidebar using last active link...")}}}else e.scrollTop=t,console.log("[PST]: Scrolled sidebar using stored browser position...");window.addEventListener("beforeunload",(()=>{sessionStorage.setItem("sidebar-scroll-top",e.scrollTop)}))}var c=()=>{let e=document.querySelectorAll("form.bd-search");return e.length?(1==e.length?e[0]:document.querySelector("div:not(.search-button__search-container) > form.bd-search")).querySelector("input"):void 0},d=()=>{let e=c(),t=document.querySelector(".search-button__wrapper");e===t.querySelector("input")&&t.classList.toggle("show"),document.activeElement===e?e.blur():(e.focus(),e.select(),e.scrollIntoView({block:"center"}))},i=e=>{var t="";return void 0!==e.userAgentData&&null!=e.userAgentData?t=e.userAgentData.platform:void 0!==e.platform&&(t=e.platform),/mac.?os/.test(t.toLowerCase())};async function v(e){e.preventDefault();let t=`${DOCUMENTATION_OPTIONS.pagename}.html`,n=e.currentTarget.getAttribute("href"),r=n.replace(t,"");try{(await fetch(n,{method:"HEAD"})).ok?location.href=n:location.href=r}catch(e){location.href=r}}async function g(e){try{var t=new URL(e)}catch(n){if(!(n instanceof TypeError))throw n;{const n=await fetch(window.location.origin,{method:"HEAD"});t=new URL(e,n.url)}}const n=await fetch(t);return await n.json()}function y(e,t){const n=`${DOCUMENTATION_OPTIONS.pagename}.html`;t.forEach((e=>{e.dataset.activeVersionName="",e.dataset.activeVersion=""}));const r=(e=e.map((e=>(e.match=e.version==DOCUMENTATION_OPTIONS.theme_switcher_version_match,e.preferred=e.preferred||!1,"name"in e||(e.name=e.version),e)))).map((e=>e.preferred&&e.match)).some(Boolean);var o=!1;e.forEach((e=>{const a=document.createElement("a");a.setAttribute("class","dropdown-item list-group-item list-group-item-action py-1"),a.setAttribute("href",`${e.url}${n}`),a.setAttribute("role","option");const c=document.createElement("span");c.textContent=`${e.name}`,a.appendChild(c),a.dataset.versionName=e.name,a.dataset.version=e.version;let d=r&&e.preferred,i=!r&&!o&&e.match;(d||i)&&(a.classList.add("active"),t.forEach((t=>{t.innerText=e.name,t.dataset.activeVersionName=e.name,t.dataset.activeVersion=e.version})),o=!0),document.querySelectorAll(".version-switcher__menu").forEach((e=>{let t=a.cloneNode(!0);t.onclick=v,e.append(t)}))}))}function w(e){var t=DOCUMENTATION_OPTIONS.VERSION,n=e.filter((e=>e.preferred));if(1!==n.length){const e=0==n.length?"No":"Multiple";return void console.log(`[PST] ${e} versions marked "preferred" found in versions JSON, ignoring.`)}const r=n[0].version,a=n[0].url,c=(0,o.Gu)(t)&&(0,o.Gu)(r);if(c&&(0,o.qu)(t,r,"="))return;var d=document.createElement("div");const i=document.createElement("div"),s=document.createElement("div"),l=document.createElement("strong"),u=document.createElement("a");d.classList="bd-header-version-warning container-fluid",i.classList="bd-header-announcement__content",s.classList="sidebar-message",u.classList="sd-btn sd-btn-danger sd-shadow-sm sd-text-wrap font-weight-bold ms-3 my-1 align-baseline",u.href=`${a}${DOCUMENTATION_OPTIONS.pagename}.html`,u.innerText="Switch to stable version",u.onclick=v,s.innerText="This is documentation for ";const m=t.includes("dev")||t.includes("rc")||t.includes("pre"),h=c&&(0,o.qu)(t,r,">");m||h?l.innerText="an unstable development version":c&&(0,o.qu)(t,r,"<")?l.innerText=`an old version (${t})`:l.innerText=t?`version ${t}`:"an unknown version",d.appendChild(i),i.appendChild(s),s.appendChild(l),s.appendChild(document.createTextNode(".")),s.appendChild(u),document.body.prepend(d)}function b(){new MutationObserver(((e,t)=>{e.forEach((e=>{0!==e.addedNodes.length&&void 0!==e.addedNodes[0].data&&-1!=e.addedNodes[0].data.search("Inserted RTD Footer")&&e.addedNodes.forEach((e=>{document.getElementById("rtd-footer-container").append(e)}))}))})).observe(document.body,{childList:!0})}var s=document.querySelectorAll(".version-switcher__button");const E=s.length>0,_=DOCUMENTATION_OPTIONS.hasOwnProperty("theme_switcher_json_url"),S=DOCUMENTATION_OPTIONS.show_version_warning_banner;if(_&&(E||S)){const T=await g(DOCUMENTATION_OPTIONS.theme_switcher_json_url);y(T,s),S&&w(T)}(0,r.A)(h),(0,r.A)(f),(0,r.A)(p),(0,r.A)((()=>{(()=>{let e=document.querySelectorAll(".search-button__kbd-shortcut");i(window.navigator)&&e.forEach((e=>e.querySelector("kbd.kbd-shortcut__modifier").innerText="⌘"))})(),window.addEventListener("keydown",(e=>{let t=c();e.shiftKey||e.altKey||(i?!e.metaKey||e.ctrlKey:e.metaKey||!e.ctrlKey)||!/k/i.test(e.key)?document.activeElement===t&&/Escape/i.test(e.key)&&d():(e.preventDefault(),d())}),!0),document.querySelectorAll(".search-button__button").forEach((e=>{e.onclick=d}));let e=document.querySelector(".search-button__overlay");e&&(e.onclick=d)})),(0,r.A)(b),t()}catch(O){t(O)}}),1)}},a={};function c(e){var t=a[e];if(void 0!==t)return t.exports;var n=a[e]={exports:{}};return o[e](n,n.exports,c),n.exports}e="function"==typeof Symbol?Symbol("webpack queues"):"__webpack_queues__",t="function"==typeof Symbol?Symbol("webpack exports"):"__webpack_exports__",n="function"==typeof Symbol?Symbol("webpack error"):"__webpack_error__",r=e=>{e&&e.d<1&&(e.d=1,e.forEach((e=>e.r--)),e.forEach((e=>e.r--?e.r++:e())))},c.a=(o,a,c)=>{var d;c&&((d=[]).d=-1);var i,s,l,u=new Set,m=o.exports,h=new Promise(((e,t)=>{l=t,s=e}));h[t]=m,h[e]=e=>(d&&e(d),u.forEach(e),h.catch((e=>{}))),o.exports=h,a((o=>{var a;i=(o=>o.map((o=>{if(null!==o&&"object"==typeof o){if(o[e])return o;if(o.then){var a=[];a.d=0,o.then((e=>{c[t]=e,r(a)}),(e=>{c[n]=e,r(a)}));var c={};return c[e]=e=>e(a),c}}var d={};return d[e]=e=>{},d[t]=o,d})))(o);var c=()=>i.map((e=>{if(e[n])throw e[n];return e[t]})),s=new Promise((t=>{(a=()=>t(c)).r=0;var n=e=>e!==d&&!u.has(e)&&(u.add(e),e&&!e.d&&(a.r++,e.push(a)));i.map((t=>t[e](n)))}));return a.r?s:c()}),(e=>(e?l(h[n]=e):s(m),r(d)))),d&&d.d<0&&(d.d=0)},c.d=(e,t)=>{for(var n in t)c.o(t,n)&&!c.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:t[n]})},c.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),c(937)})();
-//# sourceMappingURL=pydata-sphinx-theme.js.map
\ No newline at end of file
diff --git a/docs/_build/html/_static/scripts/pydata-sphinx-theme.js.map b/docs/_build/html/_static/scripts/pydata-sphinx-theme.js.map
deleted file mode 100644
index 51965aa..0000000
--- a/docs/_build/html/_static/scripts/pydata-sphinx-theme.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"scripts/pydata-sphinx-theme.js","mappings":"uBAAIA,EACAC,EACAC,EACAC,E,4CCIG,MAiCMC,EAAYC,GAA+B,iBAAZA,GAAwB,SAASC,KAAKD,IAAYE,EAAOD,KAAKD,GAkB7FG,EAAU,CAACC,EAAIC,EAAIC,KAE5BC,EAAoBD,GAGpB,MAAME,EAxDqB,EAACJ,EAAIC,KAEhC,MAAMI,EAAKC,EAAiBN,GACtBO,EAAKD,EAAiBL,GAEtBO,EAAKH,EAAGI,MACRC,EAAKH,EAAGE,MAERE,EAAIC,EAAgBP,EAAIE,GAC9B,OAAU,IAANI,EACOA,EAEPH,GAAME,EACCE,EAAgBJ,EAAGK,MAAM,KAAMH,EAAGG,MAAM,MAE1CL,GAAME,EACJF,GAAM,EAAI,EAEd,CAAC,EAsCIM,CAAgBd,EAAIC,GAChC,OAAOc,EAAeb,GAAUc,SAASZ,EAAI,EAgD3CN,EAAS,6IACTQ,EAAoBV,IACtB,GAAuB,iBAAZA,EACP,MAAM,IAAIqB,UAAU,oCAExB,MAAMC,EAAQtB,EAAQsB,MAAMpB,GAC5B,IAAKoB,EACD,MAAM,IAAIC,MAAM,uCAAuCvB,gBAG3D,OADAsB,EAAME,QACCF,CAAK,EAEVG,EAAcC,GAAY,MAANA,GAAmB,MAANA,GAAmB,MAANA,EAC9CC,EAAYC,IACd,MAAMC,EAAIC,SAASF,EAAG,IACtB,OAAOG,MAAMF,GAAKD,EAAIC,CAAC,EAGrBG,EAAiB,CAACC,EAAGC,KACvB,GAAIT,EAAWQ,IAAMR,EAAWS,GAC5B,OAAO,EACX,MAAOC,EAAIC,GAJG,EAACH,EAAGC,WAAaD,UAAaC,EAAI,CAACG,OAAOJ,GAAII,OAAOH,IAAM,CAACD,EAAGC,GAI5DI,CAAUX,EAASM,GAAIN,EAASO,IACjD,OAAIC,EAAKC,EACE,EACPD,EAAKC,GACG,EACL,CAAC,EAENpB,EAAkB,CAACiB,EAAGC,KACxB,IAAK,IAAIK,EAAI,EAAGA,EAAIC,KAAKC,IAAIR,EAAES,OAAQR,EAAEQ,QAASH,IAAK,CACnD,MAAMxB,EAAIiB,EAAeC,EAAEM,IAAM,IAAKL,EAAEK,IAAM,KAC9C,GAAU,IAANxB,EACA,OAAOA,CACf,CACA,OAAO,CAAC,EAENI,EAAiB,CACnB,IAAK,CAAC,GACN,KAAM,CAAC,EAAG,GACV,IAAK,CAAC,GACN,KAAM,EAAE,EAAG,GACX,IAAK,EAAE,IAELwB,EAAmBC,OAAOC,KAAK1B,GAC/BZ,EAAuBuC,IACzB,GAAkB,iBAAPA,EACP,MAAM,IAAIzB,UAAU,yDAAyDyB,GAEjF,IAAsC,IAAlCH,EAAiBI,QAAQD,GACzB,MAAM,IAAIvB,MAAM,qCAAqCoB,EAAiBK,KAAK,OAC/E,C,gBCzJG,SAASC,EAAcC,GACD,WAAvBC,SAASC,WAAyBF,IACjCC,SAASE,iBAAiB,mBAAoBH,EACrD,C,8ECFII,EAAcC,OAAOC,WAAW,gCAOpC,SAASC,EAAUC,GACjBP,SAASQ,gBAAgBC,QAAQC,MAAQP,EAAYQ,QACjD,OACA,OACN,CAQA,SAASC,EAASC,GACH,UAATA,GAA6B,SAATA,GAA4B,SAATA,IACzCC,QAAQC,MAAM,2BAA2BF,yBACzCA,EAAO,QAIT,IAAIG,EAAcb,EAAYQ,QAAU,OAAS,QACjDX,SAASQ,gBAAgBC,QAAQI,KAAOA,EACxC,IAAIH,EAAgB,QAARG,EAAiBG,EAAcH,EAC3Cb,SAASQ,gBAAgBC,QAAQC,MAAQA,EAGzCV,SAASiB,iBAAiB,kBAAkBC,SAASC,IACrC,SAAVT,EACFS,EAAGC,UAAUC,IAAI,sBAEjBF,EAAGC,UAAUE,OAAO,qBACtB,IAIFC,aAAaC,QAAQ,OAAQX,GAC7BU,aAAaC,QAAQ,QAASd,GAC9BI,QAAQW,IAAI,qBAAqBZ,oBAAuBH,YAGxDP,EAAYuB,SAAmB,QAARb,EAAiBP,EAAY,EACtD,CAMA,SAASqB,IACP,MAAMC,EAAc5B,SAASQ,gBAAgBC,QAAQmB,aAAe,OAC9DC,EAAcN,aAAaO,QAAQ,SAAWF,EAEpD,IAAiBG,EACXC,EAYNpB,IAZMoB,GADWD,EASF5B,EAAYQ,QACvB,CAAC,OAAQ,QAAS,QAClB,CAAC,OAAQ,OAAQ,UAVIf,QAWSiC,GAXU,KACrBE,EAAIxC,SACvByC,EAAe,GAEVD,EAAIC,IASf,CAKA,SAASC,IAGPrB,EAASZ,SAASQ,gBAAgBC,QAAQI,MAG1Cb,SAASiB,iBAAiB,wBAAwBC,SAASC,IACzDA,EAAGjB,iBAAiB,QAASyB,EAAU,GAE3C,CAeA,SAASO,IACP9B,OAAOF,iBAAiB,yBAAyB,WAC9BF,SAASiB,iBAAiB,iBAElCC,SAASiB,IAChBA,EAAQC,cAAchB,UAAUE,OAAO,SAAS,IAG3BtB,SAASiB,iBAAiB,wBAClCC,SAASiB,IACtBA,EAAQC,cAAchB,UAAUC,IAAI,SAAS,GAEjD,GACF,CASA,SAASgB,IAEP,IAAKrC,SAASsC,cAAc,gBAC1B,OAGF,IAAIC,EAAUvC,SAASsC,cAAc,kBAIrC,IAAIE,EAAkB7D,SACpB8D,eAAeX,QAAQ,sBACvB,IAGF,GAAKlD,MAAM4D,GAIJ,CAEL,IACIE,EADa1C,SAASsC,cAAc,gBACVrB,iBAAiB,WAC/C,GAAIyB,EAAanD,OAAS,EAAG,CAE3B,IAAIoD,EAAgBD,EAAaA,EAAanD,OAAS,GACnDqD,EACFD,EAAcE,wBAAwBC,EACtCP,EAAQM,wBAAwBC,EAElC,GAAIH,EAAcE,wBAAwBC,EAAyB,GAArB1C,OAAO2C,YAAmB,CACtE,IAAIC,EAAS,IACbT,EAAQU,UAAYL,EAASL,EAAQW,aAAeF,EACpDlC,QAAQW,IAAI,oDACd,CACF,CACF,MAnBEc,EAAQU,UAAYT,EACpB1B,QAAQW,IAAI,4DAqBdrB,OAAOF,iBAAiB,gBAAgB,KACtCuC,eAAejB,QAAQ,qBAAsBe,EAAQU,UAAU,GAEnE,CASA,IAAIE,EAAkB,KACpB,IAAIC,EAAQpD,SAASiB,iBAAiB,kBACtC,OAAKmC,EAAM7D,QAKW,GAAhB6D,EAAM7D,OAED6D,EAAM,GAGNpD,SAASsC,cACd,+DAGQA,cAAc,cAZ1B,CAaF,EAQEe,EAAoB,KAEtB,IAAIC,EAAQH,IAIRI,EAAqBvD,SAASsC,cAAc,2BAE5CgB,IADcC,EAAmBjB,cAAc,UAEjDiB,EAAmBnC,UAAUoC,OAAO,QAGlCxD,SAASyD,gBAAkBH,EAC7BA,EAAMI,QAENJ,EAAMK,QACNL,EAAMM,SACNN,EAAMO,eAAe,CAAEC,MAAO,WAChC,EAsCEC,EAASC,IACX,IAAIC,EAAW,GASf,YAPqC,IAA5BD,EAAUE,eACU,MAA3BF,EAAUE,cAEVD,EAAWD,EAAUE,cAAcD,cACI,IAAvBD,EAAUC,WAC1BA,EAAWD,EAAUC,UAEhB,UAAUnH,KAAKmH,EAASE,cAAc,EAkD/CC,eAAeC,EAA2BC,GAExCA,EAAMC,iBACN,IAAIC,EAAkB,GAAGC,sBAAsBC,gBAC3CC,EAASL,EAAMM,cAAcC,aAAa,QAC1CC,EAAoBH,EAAOI,QAAQP,EAAiB,IACxD,WACmBQ,MAAML,EAAQ,CAAEM,OAAQ,UAChCC,GACPC,SAASC,KAAOT,EAEhBQ,SAASC,KAAON,CAEpB,CAAE,MAAOO,GAEPF,SAASC,KAAON,CAClB,CACF,CAOAV,eAAekB,EAAyBC,GAEtC,IACE,IAAIC,EAAS,IAAIC,IAAIF,EACvB,CAAE,MAAOF,GACP,KAAIA,aAAenH,WAOjB,MAAMmH,EAPsB,CAG5B,MAAMK,QAAeV,MAAM5E,OAAO+E,SAASO,OAAQ,CAAET,OAAQ,SAC7DO,EAAS,IAAIC,IAAIF,EAAKG,EAAOH,IAC/B,CAIF,CAEA,MAAMI,QAAiBX,MAAMQ,GAE7B,aADmBG,EAASC,MAE9B,CAGA,SAASC,EAAwBC,EAAMC,GACrC,MAAMvB,EAAkB,GAAGC,sBAAsBC,gBACjDqB,EAAoB7E,SAAS8E,IAE3BA,EAAIvF,QAA2B,kBAAI,GACnCuF,EAAIvF,QAAuB,cAAI,EAAE,IAkBnC,MAAMwF,GAXNH,EAAOA,EAAKI,KAAKC,IAEfA,EAAMhI,MACJgI,EAAMtJ,SAAW4H,sBAAsB2B,6BACzCD,EAAME,UAAYF,EAAME,YAAa,EAE/B,SAAUF,IACdA,EAAMG,KAAOH,EAAMtJ,SAEdsJ,MAGND,KAAKC,GAAUA,EAAME,WAAaF,EAAMhI,QACxCoI,KAAKC,SACR,IAAIC,GAAa,EAEjBX,EAAK5E,SAASiF,IAEZ,MAAMO,EAAS1G,SAAS2G,cAAc,KACtCD,EAAOE,aACL,QACA,6DAEFF,EAAOE,aAAa,OAAQ,GAAGT,EAAMZ,MAAMf,KAC3CkC,EAAOE,aAAa,OAAQ,UAC5B,MAAMC,EAAO7G,SAAS2G,cAAc,QACpCE,EAAKC,YAAc,GAAGX,EAAMG,OAC5BI,EAAOK,YAAYF,GAGnBH,EAAOjG,QAAqB,YAAI0F,EAAMG,KACtCI,EAAOjG,QAAiB,QAAI0F,EAAMtJ,QAIlC,IAAImK,EAAwBf,GAA6BE,EAAME,UAC3DY,GACDhB,IAA8BQ,GAAcN,EAAMhI,OACjD6I,GAAyBC,KAC3BP,EAAOtF,UAAUC,IAAI,UACrB0E,EAAoB7E,SAAS8E,IAC3BA,EAAIkB,UAAYf,EAAMG,KACtBN,EAAIvF,QAA2B,kBAAI0F,EAAMG,KACzCN,EAAIvF,QAAuB,cAAI0F,EAAMtJ,OAAO,IAE9C4J,GAAa,GAIfzG,SAASiB,iBAAiB,2BAA2BC,SAASiG,IAG5D,IAAIC,EAAOV,EAAOW,WAAU,GAC5BD,EAAKE,QAAUjD,EAIf8C,EAAKI,OAAOH,EAAK,GACjB,GAEN,CAcA,SAASI,EAAyB1B,GAChC,IAAIjJ,EAAU4H,sBAAsBgD,QAEhCC,EAAmB5B,EAAK6B,QAAQxB,GAAUA,EAAME,YACpD,GAAgC,IAA5BqB,EAAiBnI,OAAc,CACjC,MAAMqI,EAAqC,GAA3BF,EAAiBnI,OAAc,KAAO,WAItD,YAHAuB,QAAQW,IACN,SAASmG,kEAGb,CACA,MAAMC,EAAmBH,EAAiB,GAAG7K,QACvCiL,EAAeJ,EAAiB,GAAGnC,IAEnCwC,GAAwB,QAASlL,KAAY,QAASgL,GAC5D,GAAIE,IAAyB,QAAQlL,EAASgL,EAAkB,KAC9D,OAGF,IAAIG,EAAQhI,SAAS2G,cAAc,OACnC,MAAMsB,EAASjI,SAAS2G,cAAc,OAChCuB,EAAQlI,SAAS2G,cAAc,OAC/BwB,EAAOnI,SAAS2G,cAAc,UAC9ByB,EAASpI,SAAS2G,cAAc,KAEtCqB,EAAM5G,UAAY,4CAClB6G,EAAO7G,UAAY,kCACnB8G,EAAM9G,UAAY,kBAClBgH,EAAOhH,UACL,2FACFgH,EAAOhD,KAAO,GAAG0C,IAAerD,sBAAsBC,gBACtD0D,EAAOlB,UAAY,2BACnBkB,EAAOd,QAAUjD,EAEjB6D,EAAMhB,UAAY,6BAClB,MAAMmB,EACJxL,EAAQoB,SAAS,QACjBpB,EAAQoB,SAAS,OACjBpB,EAAQoB,SAAS,OACbqK,EACJP,IAAyB,QAAQlL,EAASgL,EAAkB,KAC1DQ,GAASC,EACXH,EAAKjB,UAAY,kCACRa,IAAyB,QAAQlL,EAASgL,EAAkB,KACrEM,EAAKjB,UAAY,mBAAmBrK,KAIpCsL,EAAKjB,UAHKrK,EAGO,WAAWA,IAFX,qBAInBmL,EAAMjB,YAAYkB,GAClBA,EAAOlB,YAAYmB,GACnBA,EAAMnB,YAAYoB,GAClBD,EAAMnB,YAAY/G,SAASuI,eAAe,MAC1CL,EAAMnB,YAAYqB,GAClBpI,SAASwI,KAAKC,QAAQT,EACxB,CAUA,SAASU,IAkBU,IAAIC,kBAjBG,CAACC,EAAcC,KACrCD,EAAa1H,SAAS4H,IAEe,IAA/BA,EAASC,WAAWxJ,aAGYyJ,IAAhCF,EAASC,WAAW,GAAGjD,OAGuC,GAA9DgD,EAASC,WAAW,GAAGjD,KAAKmD,OAAO,wBACrCH,EAASC,WAAW7H,SAASkG,IAC3BpH,SAASkJ,eAAe,wBAAwB3B,OAAOH,EAAK,GAEhE,GACA,IAKK+B,QAAQnJ,SAASwI,KADX,CAAEY,WAAW,GAE9B,CAIA,IAAIrD,EAAsB/F,SAASiB,iBACjC,6BAEF,MAAMoI,EAAkBtD,EAAoBxG,OAAS,EAC/C+J,EAAkB7E,sBAAsB8E,eAC5C,2BAEIC,EAAqB/E,sBAAsBgF,4BAEjD,GAAIH,IAAoBD,GAAmBG,GAAqB,CAC9D,MAAM1D,QAAaR,EACjBb,sBAAsBiF,yBAExB7D,EAAwBC,EAAMC,GAC1ByD,GACFhC,EAAyB1B,EAE7B,EAMA,OAAc7D,IACd,OAAcI,IACd,OAAcH,IACd,QAxRyB,KAZK,MAC5B,IAAIyH,EAAY3J,SAASiB,iBAAiB,gCACtC8C,EAAM3D,OAAO4D,YACf2F,EAAUzI,SACP0I,GAAOA,EAAEtH,cAAc,8BAA8B4E,UAAY,KAEtE,EAOA2C,GA7DAzJ,OAAOF,iBACL,WACCoE,IACC,IAAIhB,EAAQH,IAITmB,EAAMwF,UACNxF,EAAMyF,SAENhG,GACGO,EAAM0F,SAAY1F,EAAM2F,QACvB3F,EAAM0F,UAAW1F,EAAM2F,WAE5B,KAAKnN,KAAKwH,EAAM4F,KAMTlK,SAASyD,gBAAkBH,GAAS,UAAUxG,KAAKwH,EAAM4F,MAChE7G,KALAiB,EAAMC,iBACNlB,IAKF,IAEF,GAyCFrD,SAASiB,iBAAiB,0BAA0BC,SAAS8E,IAC3DA,EAAIsB,QAAUjE,CAAiB,IAIjC,IAAI8G,EAAUnK,SAASsC,cAAc,2BACjC6H,IACFA,EAAQ7C,QAAUjE,EACpB,KA4QF,OAAcqF,G,0BC7jBV0B,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBtB,IAAjBuB,EACH,OAAOA,EAAaC,QAGrB,IAAIC,EAASL,EAAyBE,GAAY,CAGjDE,QAAS,CAAC,GAOX,OAHAE,EAAoBJ,GAAUG,EAAQA,EAAOD,QAASH,GAG/CI,EAAOD,OACf,CJtBIhO,EAAkC,mBAAXmO,OAAwBA,OAAO,kBAAoB,qBAC1ElO,EAAmC,mBAAXkO,OAAwBA,OAAO,mBAAqB,sBAC5EjO,EAAiC,mBAAXiO,OAAwBA,OAAO,iBAAmB,oBACxEhO,EAAgBiO,IAChBA,GAASA,EAAMC,EAAI,IACrBD,EAAMC,EAAI,EACVD,EAAM1J,SAAS4J,GAAQA,EAAGlN,MAC1BgN,EAAM1J,SAAS4J,GAAQA,EAAGlN,IAAMkN,EAAGlN,IAAMkN,MAC1C,EAyBDT,EAAoBvL,EAAI,CAAC2L,EAAQjC,EAAMuC,KACtC,IAAIH,EACJG,KAAcH,EAAQ,IAAIC,GAAK,GAC/B,IAEIG,EACAC,EACAC,EAJAC,EAAY,IAAIC,IAChBZ,EAAUC,EAAOD,QAIjBa,EAAU,IAAIC,SAAQ,CAACC,EAASC,KACnCN,EAASM,EACTP,EAAeM,CAAO,IAEvBF,EAAQ5O,GAAkB+N,EAC1Ba,EAAQ7O,GAAkBsO,IAAQF,GAASE,EAAGF,GAAQO,EAAUjK,QAAQ4J,GAAKO,EAAe,OAAEI,SAC9FhB,EAAOD,QAAUa,EACjB7C,GAAMkD,IAEL,IAAIZ,EADJE,EAvCa,CAACU,GAAUA,EAAKxF,KAAKyF,IACnC,GAAW,OAARA,GAA+B,iBAARA,EAAkB,CAC3C,GAAGA,EAAInP,GAAgB,OAAOmP,EAC9B,GAAGA,EAAIC,KAAM,CACZ,IAAIhB,EAAQ,GACZA,EAAMC,EAAI,EACVc,EAAIC,MAAMhO,IACTiO,EAAIpP,GAAkBmB,EACtBjB,EAAaiO,EAAM,IAChBrK,IACHsL,EAAInP,GAAgB6D,EACpB5D,EAAaiO,EAAM,IAEpB,IAAIiB,EAAM,CAAC,EAEX,OADAA,EAAIrP,GAAkBsO,GAAQA,EAAGF,GAC1BiB,CACR,CACD,CACA,IAAIC,EAAM,CAAC,EAGX,OAFAA,EAAItP,GAAiBiP,MACrBK,EAAIrP,GAAkBkP,EACfG,CAAG,IAkBKC,CAASL,GAEvB,IAAIM,EAAY,IAAOhB,EAAY9E,KAAK2E,IACvC,GAAGA,EAAEnO,GAAe,MAAMmO,EAAEnO,GAC5B,OAAOmO,EAAEpO,EAAe,IAErB4O,EAAU,IAAIC,SAASC,KAC1BT,EAAK,IAAOS,EAAQS,IACjBpO,EAAI,EACP,IAAIqO,EAAWC,GAAOA,IAAMtB,IAAUO,EAAUgB,IAAID,KAAOf,EAAU9J,IAAI6K,GAAIA,IAAMA,EAAErB,IAAMC,EAAGlN,IAAKsO,EAAEE,KAAKtB,KAC1GE,EAAY9E,KAAKyF,GAASA,EAAInP,GAAeyP,IAAU,IAExD,OAAOnB,EAAGlN,EAAIyN,EAAUW,GAAW,IAChC3G,IAAUA,EAAM6F,EAAOG,EAAQ3O,GAAgB2I,GAAO4F,EAAaT,GAAW7N,EAAaiO,MAC/FA,GAASA,EAAMC,EAAI,IAAMD,EAAMC,EAAI,EAAE,EK9DtCR,EAAoBQ,EAAI,CAACL,EAAS6B,KACjC,IAAI,IAAInC,KAAOmC,EACXhC,EAAoBiC,EAAED,EAAYnC,KAASG,EAAoBiC,EAAE9B,EAASN,IAC5EzK,OAAO8M,eAAe/B,EAASN,EAAK,CAAEsC,YAAY,EAAMC,IAAKJ,EAAWnC,IAE1E,ECNDG,EAAoBiC,EAAI,CAACT,EAAKa,IAAUjN,OAAOkN,UAAUpD,eAAeqD,KAAKf,EAAKa,GCGxDrC,EAAoB,I","sources":["webpack://pydata_sphinx_theme/webpack/runtime/async module","webpack://pydata_sphinx_theme/./node_modules/compare-versions/lib/esm/index.js","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/scripts/mixin.js","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/scripts/pydata-sphinx-theme.js","webpack://pydata_sphinx_theme/webpack/bootstrap","webpack://pydata_sphinx_theme/webpack/runtime/define property getters","webpack://pydata_sphinx_theme/webpack/runtime/hasOwnProperty shorthand","webpack://pydata_sphinx_theme/webpack/startup"],"sourcesContent":["var webpackQueues = typeof Symbol === \"function\" ? Symbol(\"webpack queues\") : \"__webpack_queues__\";\nvar webpackExports = typeof Symbol === \"function\" ? Symbol(\"webpack exports\") : \"__webpack_exports__\";\nvar webpackError = typeof Symbol === \"function\" ? Symbol(\"webpack error\") : \"__webpack_error__\";\nvar resolveQueue = (queue) => {\n\tif(queue && queue.d < 1) {\n\t\tqueue.d = 1;\n\t\tqueue.forEach((fn) => (fn.r--));\n\t\tqueue.forEach((fn) => (fn.r-- ? fn.r++ : fn()));\n\t}\n}\nvar wrapDeps = (deps) => (deps.map((dep) => {\n\tif(dep !== null && typeof dep === \"object\") {\n\t\tif(dep[webpackQueues]) return dep;\n\t\tif(dep.then) {\n\t\t\tvar queue = [];\n\t\t\tqueue.d = 0;\n\t\t\tdep.then((r) => {\n\t\t\t\tobj[webpackExports] = r;\n\t\t\t\tresolveQueue(queue);\n\t\t\t}, (e) => {\n\t\t\t\tobj[webpackError] = e;\n\t\t\t\tresolveQueue(queue);\n\t\t\t});\n\t\t\tvar obj = {};\n\t\t\tobj[webpackQueues] = (fn) => (fn(queue));\n\t\t\treturn obj;\n\t\t}\n\t}\n\tvar ret = {};\n\tret[webpackQueues] = x => {};\n\tret[webpackExports] = dep;\n\treturn ret;\n}));\n__webpack_require__.a = (module, body, hasAwait) => {\n\tvar queue;\n\thasAwait && ((queue = []).d = -1);\n\tvar depQueues = new Set();\n\tvar exports = module.exports;\n\tvar currentDeps;\n\tvar outerResolve;\n\tvar reject;\n\tvar promise = new Promise((resolve, rej) => {\n\t\treject = rej;\n\t\touterResolve = resolve;\n\t});\n\tpromise[webpackExports] = exports;\n\tpromise[webpackQueues] = (fn) => (queue && fn(queue), depQueues.forEach(fn), promise[\"catch\"](x => {}));\n\tmodule.exports = promise;\n\tbody((deps) => {\n\t\tcurrentDeps = wrapDeps(deps);\n\t\tvar fn;\n\t\tvar getResult = () => (currentDeps.map((d) => {\n\t\t\tif(d[webpackError]) throw d[webpackError];\n\t\t\treturn d[webpackExports];\n\t\t}))\n\t\tvar promise = new Promise((resolve) => {\n\t\t\tfn = () => (resolve(getResult));\n\t\t\tfn.r = 0;\n\t\t\tvar fnQueue = (q) => (q !== queue && !depQueues.has(q) && (depQueues.add(q), q && !q.d && (fn.r++, q.push(fn))));\n\t\t\tcurrentDeps.map((dep) => (dep[webpackQueues](fnQueue)));\n\t\t});\n\t\treturn fn.r ? promise : getResult();\n\t}, (err) => ((err ? reject(promise[webpackError] = err) : outerResolve(exports)), resolveQueue(queue)));\n\tqueue && queue.d < 0 && (queue.d = 0);\n};","/**\n * Compare [semver](https://semver.org/) version strings to find greater, equal or lesser.\n * This library supports the full semver specification, including comparing versions with different number of digits like `1.0.0`, `1.0`, `1`, and pre-release versions like `1.0.0-alpha`.\n * @param v1 - First version to compare\n * @param v2 - Second version to compare\n * @returns Numeric value compatible with the [Array.sort(fn) interface](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort#Parameters).\n */\nexport const compareVersions = (v1, v2) => {\n    // validate input and split into segments\n    const n1 = validateAndParse(v1);\n    const n2 = validateAndParse(v2);\n    // pop off the patch\n    const p1 = n1.pop();\n    const p2 = n2.pop();\n    // validate numbers\n    const r = compareSegments(n1, n2);\n    if (r !== 0)\n        return r;\n    // validate pre-release\n    if (p1 && p2) {\n        return compareSegments(p1.split('.'), p2.split('.'));\n    }\n    else if (p1 || p2) {\n        return p1 ? -1 : 1;\n    }\n    return 0;\n};\n/**\n * Validate [semver](https://semver.org/) version strings.\n *\n * @param version Version number to validate\n * @returns `true` if the version number is a valid semver version number, `false` otherwise.\n *\n * @example\n * ```\n * validate('1.0.0-rc.1'); // return true\n * validate('1.0-rc.1'); // return false\n * validate('foo'); // return false\n * ```\n */\nexport const validate = (version) => typeof version === 'string' && /^[v\\d]/.test(version) && semver.test(version);\n/**\n * Compare [semver](https://semver.org/) version strings using the specified operator.\n *\n * @param v1 First version to compare\n * @param v2 Second version to compare\n * @param operator Allowed arithmetic operator to use\n * @returns `true` if the comparison between the firstVersion and the secondVersion satisfies the operator, `false` otherwise.\n *\n * @example\n * ```\n * compare('10.1.8', '10.0.4', '>'); // return true\n * compare('10.0.1', '10.0.1', '='); // return true\n * compare('10.1.1', '10.2.2', '<'); // return true\n * compare('10.1.1', '10.2.2', '<='); // return true\n * compare('10.1.1', '10.2.2', '>='); // return false\n * ```\n */\nexport const compare = (v1, v2, operator) => {\n    // validate input operator\n    assertValidOperator(operator);\n    // since result of compareVersions can only be -1 or 0 or 1\n    // a simple map can be used to replace switch\n    const res = compareVersions(v1, v2);\n    return operatorResMap[operator].includes(res);\n};\n/**\n * Match [npm semver](https://docs.npmjs.com/cli/v6/using-npm/semver) version range.\n *\n * @param version Version number to match\n * @param range Range pattern for version\n * @returns `true` if the version number is within the range, `false` otherwise.\n *\n * @example\n * ```\n * satisfies('1.1.0', '^1.0.0'); // return true\n * satisfies('1.1.0', '~1.0.0'); // return false\n * ```\n */\nexport const satisfies = (version, range) => {\n    // if no range operator then \"=\"\n    const m = range.match(/^([<>=~^]+)/);\n    const op = m ? m[1] : '=';\n    // if gt/lt/eq then operator compare\n    if (op !== '^' && op !== '~')\n        return compare(version, range, op);\n    // else range of either \"~\" or \"^\" is assumed\n    const [v1, v2, v3, , vp] = validateAndParse(version);\n    const [r1, r2, r3, , rp] = validateAndParse(range);\n    const v = [v1, v2, v3];\n    const r = [r1, r2 !== null && r2 !== void 0 ? r2 : 'x', r3 !== null && r3 !== void 0 ? r3 : 'x'];\n    // validate pre-release\n    if (rp) {\n        if (!vp)\n            return false;\n        if (compareSegments(v, r) !== 0)\n            return false;\n        if (compareSegments(vp.split('.'), rp.split('.')) === -1)\n            return false;\n    }\n    // first non-zero number\n    const nonZero = r.findIndex((v) => v !== '0') + 1;\n    // pointer to where segments can be >=\n    const i = op === '~' ? 2 : nonZero > 1 ? nonZero : 1;\n    // before pointer must be equal\n    if (compareSegments(v.slice(0, i), r.slice(0, i)) !== 0)\n        return false;\n    // after pointer must be >=\n    if (compareSegments(v.slice(i), r.slice(i)) === -1)\n        return false;\n    return true;\n};\nconst semver = /^[v^~<>=]*?(\\d+)(?:\\.([x*]|\\d+)(?:\\.([x*]|\\d+)(?:\\.([x*]|\\d+))?(?:-([\\da-z\\-]+(?:\\.[\\da-z\\-]+)*))?(?:\\+[\\da-z\\-]+(?:\\.[\\da-z\\-]+)*)?)?)?$/i;\nconst validateAndParse = (version) => {\n    if (typeof version !== 'string') {\n        throw new TypeError('Invalid argument expected string');\n    }\n    const match = version.match(semver);\n    if (!match) {\n        throw new Error(`Invalid argument not valid semver ('${version}' received)`);\n    }\n    match.shift();\n    return match;\n};\nconst isWildcard = (s) => s === '*' || s === 'x' || s === 'X';\nconst tryParse = (v) => {\n    const n = parseInt(v, 10);\n    return isNaN(n) ? v : n;\n};\nconst forceType = (a, b) => typeof a !== typeof b ? [String(a), String(b)] : [a, b];\nconst compareStrings = (a, b) => {\n    if (isWildcard(a) || isWildcard(b))\n        return 0;\n    const [ap, bp] = forceType(tryParse(a), tryParse(b));\n    if (ap > bp)\n        return 1;\n    if (ap < bp)\n        return -1;\n    return 0;\n};\nconst compareSegments = (a, b) => {\n    for (let i = 0; i < Math.max(a.length, b.length); i++) {\n        const r = compareStrings(a[i] || '0', b[i] || '0');\n        if (r !== 0)\n            return r;\n    }\n    return 0;\n};\nconst operatorResMap = {\n    '>': [1],\n    '>=': [0, 1],\n    '=': [0],\n    '<=': [-1, 0],\n    '<': [-1],\n};\nconst allowedOperators = Object.keys(operatorResMap);\nconst assertValidOperator = (op) => {\n    if (typeof op !== 'string') {\n        throw new TypeError(`Invalid operator type, expected string but got ${typeof op}`);\n    }\n    if (allowedOperators.indexOf(op) === -1) {\n        throw new Error(`Invalid operator, expected one of ${allowedOperators.join('|')}`);\n    }\n};\n//# sourceMappingURL=index.js.map","/* define several functions to replace jQuery methods\n * inspired by https://tobiasahlin.com/blog/move-from-jquery-to-vanilla-javascript/\n */\n\n/**\n * Execute a method if DOM has finished loading\n *\n * @param {function} callback the method to execute\n */\nexport function documentReady(callback) {\n  if (document.readyState != \"loading\") callback();\n  else document.addEventListener(\"DOMContentLoaded\", callback);\n}\n","// Define the custom behavior of the page\nimport { documentReady } from \"./mixin\";\nimport { compare, validate } from \"compare-versions\";\n\nimport \"../styles/pydata-sphinx-theme.scss\";\n\n/*******************************************************************************\n * Theme interaction\n */\n\nvar prefersDark = window.matchMedia(\"(prefers-color-scheme: dark)\");\n\n/**\n * set the the body theme to the one specified by the user browser\n *\n * @param {event} e\n */\nfunction autoTheme(e) {\n  document.documentElement.dataset.theme = prefersDark.matches\n    ? \"dark\"\n    : \"light\";\n}\n\n/**\n * Set the theme using the specified mode.\n * It can be one of [\"auto\", \"dark\", \"light\"]\n *\n * @param {str} mode\n */\nfunction setTheme(mode) {\n  if (mode !== \"light\" && mode !== \"dark\" && mode !== \"auto\") {\n    console.error(`Got invalid theme mode: ${mode}. Resetting to auto.`);\n    mode = \"auto\";\n  }\n\n  // get the theme\n  var colorScheme = prefersDark.matches ? \"dark\" : \"light\";\n  document.documentElement.dataset.mode = mode;\n  var theme = mode == \"auto\" ? colorScheme : mode;\n  document.documentElement.dataset.theme = theme;\n  // TODO: remove this line after Bootstrap upgrade\n  // v5.3 has a colors mode: https://getbootstrap.com/docs/5.3/customize/color-modes/\n  document.querySelectorAll(\".dropdown-menu\").forEach((el) => {\n    if (theme === \"dark\") {\n      el.classList.add(\"dropdown-menu-dark\");\n    } else {\n      el.classList.remove(\"dropdown-menu-dark\");\n    }\n  });\n\n  // save mode and theme\n  localStorage.setItem(\"mode\", mode);\n  localStorage.setItem(\"theme\", theme);\n  console.log(`[PST]: Changed to ${mode} mode using the ${theme} theme.`);\n\n  // add a listener if set on auto\n  prefersDark.onchange = mode == \"auto\" ? autoTheme : \"\";\n}\n\n/**\n * Change the theme option order so that clicking on the btn is always a change\n * from \"auto\"\n */\nfunction cycleMode() {\n  const defaultMode = document.documentElement.dataset.defaultMode || \"auto\";\n  const currentMode = localStorage.getItem(\"mode\") || defaultMode;\n\n  var loopArray = (arr, current) => {\n    var nextPosition = arr.indexOf(current) + 1;\n    if (nextPosition === arr.length) {\n      nextPosition = 0;\n    }\n    return arr[nextPosition];\n  };\n\n  // make sure the next theme after auto is always a change\n  var modeList = prefersDark.matches\n    ? [\"auto\", \"light\", \"dark\"]\n    : [\"auto\", \"dark\", \"light\"];\n  var newMode = loopArray(modeList, currentMode);\n  setTheme(newMode);\n}\n\n/**\n * add the theme listener on the btns of the navbar\n */\nfunction addModeListener() {\n  // the theme was set a first time using the initial mini-script\n  // running setMode will ensure the use of the dark mode if auto is selected\n  setTheme(document.documentElement.dataset.mode);\n\n  // Attach event handlers for toggling themes colors\n  document.querySelectorAll(\".theme-switch-button\").forEach((el) => {\n    el.addEventListener(\"click\", cycleMode);\n  });\n}\n\n/*******************************************************************************\n * TOC interactivity\n */\n\n/**\n * TOC sidebar - add \"active\" class to parent list\n *\n * Bootstrap's scrollspy adds the active class to the <a> link,\n * but for the automatic collapsing we need this on the parent list item.\n *\n * The event is triggered on \"window\" (and not the nav item as documented),\n * see https://github.com/twbs/bootstrap/issues/20086\n */\nfunction addTOCInteractivity() {\n  window.addEventListener(\"activate.bs.scrollspy\", function () {\n    const navLinks = document.querySelectorAll(\".bd-toc-nav a\");\n\n    navLinks.forEach((navLink) => {\n      navLink.parentElement.classList.remove(\"active\");\n    });\n\n    const activeNavLinks = document.querySelectorAll(\".bd-toc-nav a.active\");\n    activeNavLinks.forEach((navLink) => {\n      navLink.parentElement.classList.add(\"active\");\n    });\n  });\n}\n\n/*******************************************************************************\n * Scroll\n */\n\n/**\n * Navigation sidebar scrolling to active page\n */\nfunction scrollToActive() {\n  // If the docs nav doesn't exist, do nothing (e.g., on search page)\n  if (!document.querySelector(\".bd-docs-nav\")) {\n    return;\n  }\n\n  var sidebar = document.querySelector(\"div.bd-sidebar\");\n\n  // Remember the sidebar scroll position between page loads\n  // Inspired on source of revealjs.com\n  let storedScrollTop = parseInt(\n    sessionStorage.getItem(\"sidebar-scroll-top\"),\n    10\n  );\n\n  if (!isNaN(storedScrollTop)) {\n    // If we've got a saved scroll position, just use that\n    sidebar.scrollTop = storedScrollTop;\n    console.log(\"[PST]: Scrolled sidebar using stored browser position...\");\n  } else {\n    // Otherwise, calculate a position to scroll to based on the lowest `active` link\n    var sidebarNav = document.querySelector(\".bd-docs-nav\");\n    var active_pages = sidebarNav.querySelectorAll(\".active\");\n    if (active_pages.length > 0) {\n      // Use the last active page as the offset since it's the page we're on\n      var latest_active = active_pages[active_pages.length - 1];\n      var offset =\n        latest_active.getBoundingClientRect().y -\n        sidebar.getBoundingClientRect().y;\n      // Only scroll the navbar if the active link is lower than 50% of the page\n      if (latest_active.getBoundingClientRect().y > window.innerHeight * 0.5) {\n        let buffer = 0.25; // Buffer so we have some space above the scrolled item\n        sidebar.scrollTop = offset - sidebar.clientHeight * buffer;\n        console.log(\"[PST]: Scrolled sidebar using last active link...\");\n      }\n    }\n  }\n\n  // Store the sidebar scroll position\n  window.addEventListener(\"beforeunload\", () => {\n    sessionStorage.setItem(\"sidebar-scroll-top\", sidebar.scrollTop);\n  });\n}\n\n/*******************************************************************************\n * Search\n */\n\n/**\n * Find any search forms on the page and return their input element\n */\nvar findSearchInput = () => {\n  let forms = document.querySelectorAll(\"form.bd-search\");\n  if (!forms.length) {\n    // no search form found\n    return;\n  } else {\n    var form;\n    if (forms.length == 1) {\n      // there is exactly one search form (persistent or hidden)\n      form = forms[0];\n    } else {\n      // must be at least one persistent form, use the first persistent one\n      form = document.querySelector(\n        \"div:not(.search-button__search-container) > form.bd-search\"\n      );\n    }\n    return form.querySelector(\"input\");\n  }\n};\n\n/**\n * Activate the search field on the page.\n * - If there is a search field already visible it will be activated.\n * - If not, then a search field will pop up.\n */\nvar toggleSearchField = () => {\n  // Find the search input to highlight\n  let input = findSearchInput();\n\n  // if the input field is the hidden one (the one associated with the\n  // search button) then toggle the button state (to show/hide the field)\n  let searchPopupWrapper = document.querySelector(\".search-button__wrapper\");\n  let hiddenInput = searchPopupWrapper.querySelector(\"input\");\n  if (input === hiddenInput) {\n    searchPopupWrapper.classList.toggle(\"show\");\n  }\n  // when toggling off the search field, remove its focus\n  if (document.activeElement === input) {\n    input.blur();\n  } else {\n    input.focus();\n    input.select();\n    input.scrollIntoView({ block: \"center\" });\n  }\n};\n\n/**\n * Add an event listener for toggleSearchField() for Ctrl/Cmd + K\n */\nvar addEventListenerForSearchKeyboard = () => {\n  window.addEventListener(\n    \"keydown\",\n    (event) => {\n      let input = findSearchInput();\n      // toggle on Ctrl+k or ⌘+k\n      if (\n        // Ignore if shift or alt are pressed\n        !event.shiftKey &&\n        !event.altKey &&\n        // On Mac use ⌘, all other OS use Ctrl\n        (isMac\n          ? event.metaKey && !event.ctrlKey\n          : !event.metaKey && event.ctrlKey) &&\n        // Case-insensitive so the shortcut still works with caps lock\n        /k/i.test(event.key)\n      ) {\n        event.preventDefault();\n        toggleSearchField();\n      }\n      // also allow Escape key to hide (but not show) the dynamic search field\n      else if (document.activeElement === input && /Escape/i.test(event.key)) {\n        toggleSearchField();\n      }\n    },\n    true\n  );\n};\n\n/**\n * Find out if we're on a Mac\n */\nvar isMac = (navigator) => {\n  var platform = \"\";\n  if (\n    typeof navigator.userAgentData !== \"undefined\" &&\n    navigator.userAgentData != null\n  ) {\n    platform = navigator.userAgentData.platform;\n  } else if (typeof navigator.platform !== \"undefined\") {\n    platform = navigator.platform;\n  }\n  return /mac.?os/.test(platform.toLowerCase());\n};\n\n/**\n * Change the search hint to `meta key` if we are a Mac\n */\n\nvar changeSearchShortcutKey = () => {\n  let shortcuts = document.querySelectorAll(\".search-button__kbd-shortcut\");\n  if (isMac(window.navigator)) {\n    shortcuts.forEach(\n      (f) => (f.querySelector(\"kbd.kbd-shortcut__modifier\").innerText = \"⌘\")\n    );\n  }\n};\n\n/**\n * Activate callbacks for search button popup\n */\nvar setupSearchButtons = () => {\n  changeSearchShortcutKey();\n  addEventListenerForSearchKeyboard();\n\n  // Add the search button trigger event callback\n  document.querySelectorAll(\".search-button__button\").forEach((btn) => {\n    btn.onclick = toggleSearchField;\n  });\n\n  // Add the search button overlay event callback\n  let overlay = document.querySelector(\".search-button__overlay\");\n  if (overlay) {\n    overlay.onclick = toggleSearchField;\n  }\n};\n\n/*******************************************************************************\n * Version Switcher\n * Note that this depends on two variables existing that are defined in\n * and `html-page-context` hook:\n *\n * - DOCUMENTATION_OPTIONS.pagename\n * - DOCUMENTATION_OPTIONS.theme_switcher_url\n */\n\n/**\n * Check if corresponding page path exists in other version of docs\n * and, if so, go there instead of the homepage of the other docs version\n *\n * @param {event} event the event that trigger the check\n */\nasync function checkPageExistsAndRedirect(event) {\n  // ensure we don't follow the initial link\n  event.preventDefault();\n  let currentFilePath = `${DOCUMENTATION_OPTIONS.pagename}.html`;\n  let tryUrl = event.currentTarget.getAttribute(\"href\");\n  let otherDocsHomepage = tryUrl.replace(currentFilePath, \"\");\n  try {\n    let head = await fetch(tryUrl, { method: \"HEAD\" });\n    if (head.ok) {\n      location.href = tryUrl; // the page exists, go there\n    } else {\n      location.href = otherDocsHomepage;\n    }\n  } catch (err) {\n    // something went wrong, probably CORS restriction, fallback to other docs homepage\n    location.href = otherDocsHomepage;\n  }\n}\n\n/**\n * Load and parse the version switcher JSON file from an absolute or relative URL.\n *\n * @param {string} url The URL to load version switcher entries from.\n */\nasync function fetchVersionSwitcherJSON(url) {\n  // first check if it's a valid URL\n  try {\n    var result = new URL(url);\n  } catch (err) {\n    if (err instanceof TypeError) {\n      // assume we got a relative path, and fix accordingly. But first, we need to\n      // use `fetch()` to follow redirects so we get the correct final base URL\n      const origin = await fetch(window.location.origin, { method: \"HEAD\" });\n      result = new URL(url, origin.url);\n    } else {\n      // something unexpected happened\n      throw err;\n    }\n  }\n  // load and return the JSON\n  const response = await fetch(result);\n  const data = await response.json();\n  return data;\n}\n\n// Populate the version switcher from the JSON data\nfunction populateVersionSwitcher(data, versionSwitcherBtns) {\n  const currentFilePath = `${DOCUMENTATION_OPTIONS.pagename}.html`;\n  versionSwitcherBtns.forEach((btn) => {\n    // Set empty strings by default so that these attributes exist and can be used in CSS selectors\n    btn.dataset[\"activeVersionName\"] = \"\";\n    btn.dataset[\"activeVersion\"] = \"\";\n  });\n  // in case there are multiple entries with the same version string, this helps us\n  // decide which entry's `name` to put on the button itself. Without this, it would\n  // always be the *last* version-matching entry; now it will be either the\n  // version-matching entry that is also marked as `\"preferred\": true`, or if that\n  // doesn't exist: the *first* version-matching entry.\n  data = data.map((entry) => {\n    // does this entry match the version that we're currently building/viewing?\n    entry.match =\n      entry.version == DOCUMENTATION_OPTIONS.theme_switcher_version_match;\n    entry.preferred = entry.preferred || false;\n    // if no custom name specified (e.g., \"latest\"), use version string\n    if (!(\"name\" in entry)) {\n      entry.name = entry.version;\n    }\n    return entry;\n  });\n  const hasMatchingPreferredEntry = data\n    .map((entry) => entry.preferred && entry.match)\n    .some(Boolean);\n  var foundMatch = false;\n  // create links to the corresponding page in the other docs versions\n  data.forEach((entry) => {\n    // create the node\n    const anchor = document.createElement(\"a\");\n    anchor.setAttribute(\n      \"class\",\n      \"dropdown-item list-group-item list-group-item-action py-1\"\n    );\n    anchor.setAttribute(\"href\", `${entry.url}${currentFilePath}`);\n    anchor.setAttribute(\"role\", \"option\");\n    const span = document.createElement(\"span\");\n    span.textContent = `${entry.name}`;\n    anchor.appendChild(span);\n    // Add dataset values for the version and name in case people want\n    // to apply CSS styling based on this information.\n    anchor.dataset[\"versionName\"] = entry.name;\n    anchor.dataset[\"version\"] = entry.version;\n    // replace dropdown button text with the preferred display name of the\n    // currently-viewed version, rather than using sphinx's {{ version }} variable.\n    // also highlight the dropdown entry for the currently-viewed version's entry\n    let matchesAndIsPreferred = hasMatchingPreferredEntry && entry.preferred;\n    let matchesAndIsFirst =\n      !hasMatchingPreferredEntry && !foundMatch && entry.match;\n    if (matchesAndIsPreferred || matchesAndIsFirst) {\n      anchor.classList.add(\"active\");\n      versionSwitcherBtns.forEach((btn) => {\n        btn.innerText = entry.name;\n        btn.dataset[\"activeVersionName\"] = entry.name;\n        btn.dataset[\"activeVersion\"] = entry.version;\n      });\n      foundMatch = true;\n    }\n    // There may be multiple version-switcher elements, e.g. one\n    // in a slide-over panel displayed on smaller screens.\n    document.querySelectorAll(\".version-switcher__menu\").forEach((menu) => {\n      // we need to clone the node for each menu, but onclick attributes are not\n      // preserved by `.cloneNode()` so we add onclick here after cloning.\n      let node = anchor.cloneNode(true);\n      node.onclick = checkPageExistsAndRedirect;\n      // on click, AJAX calls will check if the linked page exists before\n      // trying to redirect, and if not, will redirect to the homepage\n      // for that version of the docs.\n      menu.append(node);\n    });\n  });\n}\n\n/*******************************************************************************\n * Warning banner when viewing non-stable version of the docs.\n */\n\n/**\n * Show a warning banner when viewing a non-stable version of the docs.\n *\n * adapted 2023-06 from https://mne.tools/versionwarning.js, which was\n * originally adapted 2020-05 from https://scikit-learn.org/versionwarning.js\n *\n * @param {Array} data The version data used to populate the switcher menu.\n */\nfunction showVersionWarningBanner(data) {\n  var version = DOCUMENTATION_OPTIONS.VERSION;\n  // figure out what latest stable version is\n  var preferredEntries = data.filter((entry) => entry.preferred);\n  if (preferredEntries.length !== 1) {\n    const howMany = preferredEntries.length == 0 ? \"No\" : \"Multiple\";\n    console.log(\n      `[PST] ${howMany} versions marked \"preferred\" found in versions JSON, ignoring.`\n    );\n    return;\n  }\n  const preferredVersion = preferredEntries[0].version;\n  const preferredURL = preferredEntries[0].url;\n  // if already on preferred version, nothing to do\n  const versionsAreComparable = validate(version) && validate(preferredVersion);\n  if (versionsAreComparable && compare(version, preferredVersion, \"=\")) {\n    return;\n  }\n  // now construct the warning banner\n  var outer = document.createElement(\"div\");\n  const middle = document.createElement(\"div\");\n  const inner = document.createElement(\"div\");\n  const bold = document.createElement(\"strong\");\n  const button = document.createElement(\"a\");\n  // these classes exist since pydata-sphinx-theme v0.10.0\n  outer.classList = \"bd-header-version-warning container-fluid\";\n  middle.classList = \"bd-header-announcement__content\";\n  inner.classList = \"sidebar-message\";\n  button.classList =\n    \"sd-btn sd-btn-danger sd-shadow-sm sd-text-wrap font-weight-bold ms-3 my-1 align-baseline\";\n  button.href = `${preferredURL}${DOCUMENTATION_OPTIONS.pagename}.html`;\n  button.innerText = \"Switch to stable version\";\n  button.onclick = checkPageExistsAndRedirect;\n  // add the version-dependent text\n  inner.innerText = \"This is documentation for \";\n  const isDev =\n    version.includes(\"dev\") ||\n    version.includes(\"rc\") ||\n    version.includes(\"pre\");\n  const newerThanPreferred =\n    versionsAreComparable && compare(version, preferredVersion, \">\");\n  if (isDev || newerThanPreferred) {\n    bold.innerText = \"an unstable development version\";\n  } else if (versionsAreComparable && compare(version, preferredVersion, \"<\")) {\n    bold.innerText = `an old version (${version})`;\n  } else if (!version) {\n    bold.innerText = \"an unknown version\"; // e.g., an empty string\n  } else {\n    bold.innerText = `version ${version}`;\n  }\n  outer.appendChild(middle);\n  middle.appendChild(inner);\n  inner.appendChild(bold);\n  inner.appendChild(document.createTextNode(\".\"));\n  inner.appendChild(button);\n  document.body.prepend(outer);\n}\n\n/*******************************************************************************\n * MutationObserver to move the ReadTheDocs button\n */\n\n/**\n * intercept the RTD flyout and place it in the rtd-footer-container if existing\n * if not it stays where on top of the page\n */\nfunction initRTDObserver() {\n  const mutatedCallback = (mutationList, observer) => {\n    mutationList.forEach((mutation) => {\n      // Check whether the mutation is for RTD, which will have a specific structure\n      if (mutation.addedNodes.length === 0) {\n        return;\n      }\n      if (mutation.addedNodes[0].data === undefined) {\n        return;\n      }\n      if (mutation.addedNodes[0].data.search(\"Inserted RTD Footer\") != -1) {\n        mutation.addedNodes.forEach((node) => {\n          document.getElementById(\"rtd-footer-container\").append(node);\n        });\n      }\n    });\n  };\n\n  const observer = new MutationObserver(mutatedCallback);\n  const config = { childList: true };\n  observer.observe(document.body, config);\n}\n\n// fetch the JSON version data (only once), then use it to populate the version\n// switcher and maybe show the version warning bar\nvar versionSwitcherBtns = document.querySelectorAll(\n  \".version-switcher__button\"\n);\nconst hasSwitcherMenu = versionSwitcherBtns.length > 0;\nconst hasVersionsJSON = DOCUMENTATION_OPTIONS.hasOwnProperty(\n  \"theme_switcher_json_url\"\n);\nconst wantsWarningBanner = DOCUMENTATION_OPTIONS.show_version_warning_banner;\n\nif (hasVersionsJSON && (hasSwitcherMenu || wantsWarningBanner)) {\n  const data = await fetchVersionSwitcherJSON(\n    DOCUMENTATION_OPTIONS.theme_switcher_json_url\n  );\n  populateVersionSwitcher(data, versionSwitcherBtns);\n  if (wantsWarningBanner) {\n    showVersionWarningBanner(data);\n  }\n}\n\n/*******************************************************************************\n * Call functions after document loading.\n */\n\ndocumentReady(addModeListener);\ndocumentReady(scrollToActive);\ndocumentReady(addTOCInteractivity);\ndocumentReady(setupSearchButtons);\ndocumentReady(initRTDObserver);\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// startup\n// Load entry module and return exports\n// This entry module used 'module' so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(937);\n"],"names":["webpackQueues","webpackExports","webpackError","resolveQueue","validate","version","test","semver","compare","v1","v2","operator","assertValidOperator","res","n1","validateAndParse","n2","p1","pop","p2","r","compareSegments","split","compareVersions","operatorResMap","includes","TypeError","match","Error","shift","isWildcard","s","tryParse","v","n","parseInt","isNaN","compareStrings","a","b","ap","bp","String","forceType","i","Math","max","length","allowedOperators","Object","keys","op","indexOf","join","documentReady","callback","document","readyState","addEventListener","prefersDark","window","matchMedia","autoTheme","e","documentElement","dataset","theme","matches","setTheme","mode","console","error","colorScheme","querySelectorAll","forEach","el","classList","add","remove","localStorage","setItem","log","onchange","cycleMode","defaultMode","currentMode","getItem","arr","nextPosition","addModeListener","addTOCInteractivity","navLink","parentElement","scrollToActive","querySelector","sidebar","storedScrollTop","sessionStorage","active_pages","latest_active","offset","getBoundingClientRect","y","innerHeight","buffer","scrollTop","clientHeight","findSearchInput","forms","toggleSearchField","input","searchPopupWrapper","toggle","activeElement","blur","focus","select","scrollIntoView","block","isMac","navigator","platform","userAgentData","toLowerCase","async","checkPageExistsAndRedirect","event","preventDefault","currentFilePath","DOCUMENTATION_OPTIONS","pagename","tryUrl","currentTarget","getAttribute","otherDocsHomepage","replace","fetch","method","ok","location","href","err","fetchVersionSwitcherJSON","url","result","URL","origin","response","json","populateVersionSwitcher","data","versionSwitcherBtns","btn","hasMatchingPreferredEntry","map","entry","theme_switcher_version_match","preferred","name","some","Boolean","foundMatch","anchor","createElement","setAttribute","span","textContent","appendChild","matchesAndIsPreferred","matchesAndIsFirst","innerText","menu","node","cloneNode","onclick","append","showVersionWarningBanner","VERSION","preferredEntries","filter","howMany","preferredVersion","preferredURL","versionsAreComparable","outer","middle","inner","bold","button","isDev","newerThanPreferred","createTextNode","body","prepend","initRTDObserver","MutationObserver","mutationList","observer","mutation","addedNodes","undefined","search","getElementById","observe","childList","hasSwitcherMenu","hasVersionsJSON","hasOwnProperty","wantsWarningBanner","show_version_warning_banner","theme_switcher_json_url","shortcuts","f","changeSearchShortcutKey","shiftKey","altKey","metaKey","ctrlKey","key","overlay","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","exports","module","__webpack_modules__","Symbol","queue","d","fn","hasAwait","currentDeps","outerResolve","reject","depQueues","Set","promise","Promise","resolve","rej","x","deps","dep","then","obj","ret","wrapDeps","getResult","fnQueue","q","has","push","definition","o","defineProperty","enumerable","get","prop","prototype","call"],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/_build/html/_static/scripts/sphinx-book-theme.js b/docs/_build/html/_static/scripts/sphinx-book-theme.js
deleted file mode 100644
index be9fa44..0000000
--- a/docs/_build/html/_static/scripts/sphinx-book-theme.js
+++ /dev/null
@@ -1,2 +0,0 @@
-!function(e){var t={};function n(r){if(t[r])return t[r].exports;var o=t[r]={i:r,l:!1,exports:{}};return e[r].call(o.exports,o,o.exports,n),o.l=!0,o.exports}n.m=e,n.c=t,n.d=function(e,t,r){n.o(e,t)||Object.defineProperty(e,t,{enumerable:!0,get:r})},n.r=function(e){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},n.t=function(e,t){if(1&t&&(e=n(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var o in e)n.d(r,o,function(t){return e[t]}.bind(null,o));return r},n.n=function(e){var t=e&&e.__esModule?function(){return e.default}:function(){return e};return n.d(t,"a",t),t},n.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},n.p="",n(n.s=0)}([function(e,t,n){e.exports=n(1)},function(e,t,n){"use strict";n.r(t);n.p;var r=e=>{"loading"!=document.readyState?e():document.addEventListener?document.addEventListener("DOMContentLoaded",e):document.attachEvent("onreadystatechange",(function(){"complete"==document.readyState&&e()}))};window.initThebeSBT=()=>{var e=document.querySelector("section h1");e.nextElementSibling.classList.contains("thebe-launch-button")||e.insertAdjacentHTML("afterend","<button class='thebe-launch-button'></button>"),initThebe()},window.toggleFullScreen=()=>{var e=document.fullscreenElement&&null!==document.fullscreenElement||document.webkitFullscreenElement&&null!==document.webkitFullscreenElement;let t=document.documentElement;e?(console.log("[SBT]: Exiting full screen"),document.exitFullscreen?document.exitFullscreen():document.webkitExitFullscreen&&document.webkitExitFullscreen()):(console.log("[SBT]: Entering full screen"),t.requestFullscreen?t.requestFullscreen():t.webkitRequestFullscreen&&t.webkitRequestFullscreen())},r(()=>{var e=[];let t=new IntersectionObserver((t,n)=>{t.forEach(t=>{if(t.isIntersecting)e.push(t.target);else for(let n=0;n<e.length;n++)if(e[n]===t.target){e.splice(n,1);break}}),e.length>0?document.querySelector("div.bd-sidebar-secondary").classList.add("hide"):document.querySelector("div.bd-sidebar-secondary").classList.remove("hide")},{rootMargin:"0px 0px -33% 0px"});let n=[];["marginnote","sidenote","margin","margin-caption","full-width","sidebar","popout"].forEach(e=>{n.push("."+e,".tag_"+e,"."+e.replace("-","_"),".tag_"+e.replace("-","_"))}),document.querySelectorAll(n.join(", ")).forEach(e=>{t.observe(e)}),new IntersectionObserver((e,t)=>{e[0].boundingClientRect.y<0?document.body.classList.add("scrolled"):document.body.classList.remove("scrolled")}).observe(document.querySelector(".sbt-scroll-pixel-helper"))}),r((function(){var e=[".bd-header-announcement",".bd-header",".bd-header-article",".bd-sidebar-primary",".bd-sidebar-secondary",".bd-footer-article",".bd-footer-content",".bd-footer"].join(",");document.querySelectorAll(e).forEach(e=>{e.classList.add("noprint")})}))}]);
-//# sourceMappingURL=sphinx-book-theme.js.map
\ No newline at end of file
diff --git a/docs/_build/html/_static/scripts/sphinx-book-theme.js.map b/docs/_build/html/_static/scripts/sphinx-book-theme.js.map
deleted file mode 100644
index b8abcf8..0000000
--- a/docs/_build/html/_static/scripts/sphinx-book-theme.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./src/sphinx_book_theme/assets/styles/index.scss","webpack:///./src/sphinx_book_theme/assets/scripts/index.js"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","sbRunWhenDOMLoaded","cb","document","readyState","addEventListener","attachEvent","window","initThebeSBT","title","querySelector","nextElementSibling","classList","contains","insertAdjacentHTML","initThebe","toggleFullScreen","isInFullScreen","fullscreenElement","webkitFullscreenElement","docElm","documentElement","console","log","exitFullscreen","webkitExitFullscreen","requestFullscreen","webkitRequestFullscreen","onScreenItems","tocObserver","IntersectionObserver","entries","observer","forEach","entry","isIntersecting","push","target","ii","length","splice","add","remove","rootMargin","marginSelector","replace","querySelectorAll","join","observe","boundingClientRect","y","body","noPrintSelector"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,sEClFtC,QCSXC,EAAsBC,IACG,WAAvBC,SAASC,WACXF,IACSC,SAASE,iBAClBF,SAASE,iBAAiB,mBAAoBH,GAE9CC,SAASG,YAAY,sBAAsB,WACd,YAAvBH,SAASC,YAA0BF,QAoK7CK,OAAOC,aAtCY,KACjB,IAAIC,EAAQN,SAASO,cAAc,cACrBD,EAAME,mBAGPC,UAAUC,SAAS,wBAC9BJ,EAAMK,mBACJ,WACA,iDAIJC,aA2BFR,OAAOS,iBAzJgB,KACrB,IAAIC,EACDd,SAASe,mBAAoD,OAA/Bf,SAASe,mBACvCf,SAASgB,yBAC6B,OAArChB,SAASgB,wBACb,IAAIC,EAASjB,SAASkB,gBACjBJ,GAQHK,QAAQC,IAAI,8BACRpB,SAASqB,eACXrB,SAASqB,iBACArB,SAASsB,sBAClBtB,SAASsB,yBAXXH,QAAQC,IAAI,+BACRH,EAAOM,kBACTN,EAAOM,oBACEN,EAAOO,yBAChBP,EAAOO,4BAmJb1B,EAzHkB,KAChB,IAAI2B,EAAgB,GACpB,IAwCIC,EAAc,IAAIC,qBAxCA,CAACC,EAASC,KAE9BD,EAAQE,QAASC,IACf,GAAIA,EAAMC,eAERP,EAAcQ,KAAKF,EAAMG,aAGzB,IAAK,IAAIC,EAAK,EAAGA,EAAKV,EAAcW,OAAQD,IAC1C,GAAIV,EAAcU,KAAQJ,EAAMG,OAAQ,CACtCT,EAAcY,OAAOF,EAAI,GACzB,SAOJV,EAAcW,OAAS,EACzBpC,SAASO,cAAc,4BAA4BE,UAAU6B,IAAI,QAEjEtC,SACGO,cAAc,4BACdE,UAAU8B,OAAO,SAaV,CAEZC,WAAY,qBAad,IAAIC,EAAiB,GATG,CACtB,aACA,WACA,SACA,iBACA,aACA,UACA,UAGcX,QAASK,IAEvBM,EAAeR,KAEX,IAAIE,EACJ,QAAQA,EACR,IAAIA,EAAGO,QAAQ,IAAK,KACpB,QAAQP,EAAGO,QAAQ,IAAK,QAI9B1C,SAAS2C,iBAAiBF,EAAeG,KAAK,OAAOd,QAASK,IAC5DT,EAAYmB,QAAQV,KAID,IAAIR,qBA1CO,CAACC,EAASC,KAEpCD,EAAQ,GAAGkB,mBAAmBC,EAAI,EACpC/C,SAASgD,KAAKvC,UAAU6B,IAAI,YAE5BtC,SAASgD,KAAKvC,UAAU8B,OAAO,cAsCpBM,QAAQ7C,SAASO,cAAc,+BAmDhDT,GA1BA,WACE,IAAImD,EAAkB,CACpB,0BACA,aACA,qBACA,sBACA,wBACA,qBACA,qBACA,cACAL,KAAK,KACP5C,SAAS2C,iBAAiBM,GAAiBnB,QAASK,IAClDA,EAAG1B,UAAU6B,IAAI","file":"scripts/sphinx-book-theme.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 0);\n","export default __webpack_public_path__ + \"styles/sphinx-book-theme.css\";","// Import CSS variables\n// ref: https://css-tricks.com/getting-javascript-to-talk-to-css-and-sass/\nimport \"../styles/index.scss\";\n\n/**\n * A helper function to load scripts when the DOM is loaded.\n * This waits for everything to be on the page first before running, since\n * some functionality doesn't behave properly until everything is ready.\n */\nvar sbRunWhenDOMLoaded = (cb) => {\n  if (document.readyState != \"loading\") {\n    cb();\n  } else if (document.addEventListener) {\n    document.addEventListener(\"DOMContentLoaded\", cb);\n  } else {\n    document.attachEvent(\"onreadystatechange\", function () {\n      if (document.readyState == \"complete\") cb();\n    });\n  }\n};\n\n/**\n * Toggle full-screen with button\n *\n * There are some browser-specific hacks in here:\n * - Safari requires a `webkit` prefix, so this uses conditionals to check for that\n *   ref: https://developer.mozilla.org/en-US/docs/Web/API/Fullscreen_API\n */\nvar toggleFullScreen = () => {\n  var isInFullScreen =\n    (document.fullscreenElement && document.fullscreenElement !== null) ||\n    (document.webkitFullscreenElement &&\n      document.webkitFullscreenElement !== null);\n  let docElm = document.documentElement;\n  if (!isInFullScreen) {\n    console.log(\"[SBT]: Entering full screen\");\n    if (docElm.requestFullscreen) {\n      docElm.requestFullscreen();\n    } else if (docElm.webkitRequestFullscreen) {\n      docElm.webkitRequestFullscreen();\n    }\n  } else {\n    console.log(\"[SBT]: Exiting full screen\");\n    if (document.exitFullscreen) {\n      document.exitFullscreen();\n    } else if (document.webkitExitFullscreen) {\n      document.webkitExitFullscreen();\n    }\n  }\n};\n\n/**\n * Manage scrolling behavior. This is primarily two things:\n *\n * 1. Hide the Table of Contents any time sidebar content is on the screen.\n *\n * This will be triggered any time a sidebar item enters or exits the screen.\n * It adds/removes items from an array if they have entered the screen, and\n * removes them when they exit the screen. It hides the TOC if anything is\n * on-screen.\n *\n * ref: https://developer.mozilla.org/en-US/docs/Web/API/Intersection_Observer_API\n *\n * 2. Add a `scrolled` class to <body> to trigger CSS changes.\n */\nvar initTocHide = () => {\n  var onScreenItems = [];\n  let hideTocCallback = (entries, observer) => {\n    // Check whether any sidebar item is displayed\n    entries.forEach((entry) => {\n      if (entry.isIntersecting) {\n        // If an element just came on screen, add it our list\n        onScreenItems.push(entry.target);\n      } else {\n        // Otherwise, if it's in our list then remove it\n        for (let ii = 0; ii < onScreenItems.length; ii++) {\n          if (onScreenItems[ii] === entry.target) {\n            onScreenItems.splice(ii, 1);\n            break;\n          }\n        }\n      }\n    });\n\n    // Hide the TOC if any margin content is displayed on the screen\n    if (onScreenItems.length > 0) {\n      document.querySelector(\"div.bd-sidebar-secondary\").classList.add(\"hide\");\n    } else {\n      document\n        .querySelector(\"div.bd-sidebar-secondary\")\n        .classList.remove(\"hide\");\n    }\n  };\n  let manageScrolledClassOnBody = (entries, observer) => {\n    // The pixel is at the top, so if we're < 0 that it means we've scrolled\n    if (entries[0].boundingClientRect.y < 0) {\n      document.body.classList.add(\"scrolled\");\n    } else {\n      document.body.classList.remove(\"scrolled\");\n    }\n  };\n\n  // Set up the intersection observer to watch all margin content\n  let options = {\n    // Trigger callback when the top of a margin item is 1/3 up the screen\n    rootMargin: \"0px 0px -33% 0px\",\n  };\n  let tocObserver = new IntersectionObserver(hideTocCallback, options);\n  // TODO: deprecate popout after v0.5.0\n  const selectorClasses = [\n    \"marginnote\",\n    \"sidenote\",\n    \"margin\",\n    \"margin-caption\",\n    \"full-width\",\n    \"sidebar\",\n    \"popout\",\n  ];\n  let marginSelector = [];\n  selectorClasses.forEach((ii) => {\n    // Use three permutations of each class name because `tag_` and `_` used to be supported\n    marginSelector.push(\n      ...[\n        `.${ii}`,\n        `.tag_${ii}`,\n        `.${ii.replace(\"-\", \"_\")}`,\n        `.tag_${ii.replace(\"-\", \"_\")}`,\n      ],\n    );\n  });\n  document.querySelectorAll(marginSelector.join(\", \")).forEach((ii) => {\n    tocObserver.observe(ii);\n  });\n\n  // Set up the observer to check if we've scrolled from top of page\n  let scrollObserver = new IntersectionObserver(manageScrolledClassOnBody);\n  scrollObserver.observe(document.querySelector(\".sbt-scroll-pixel-helper\"));\n};\n\n/**\n * Activate Thebe with a custom button click.\n */\nvar initThebeSBT = () => {\n  var title = document.querySelector(\"section h1\");\n  var sibling = title.nextElementSibling;\n  // If the next element after the title isn't a thebe button, add one now.\n  // That way it is initiatlized when thebe is first-clicked and isn't re-added after.\n  if (!sibling.classList.contains(\"thebe-launch-button\")) {\n    title.insertAdjacentHTML(\n      \"afterend\",\n      \"<button class='thebe-launch-button'></button>\",\n    );\n  }\n  // This function is provided by sphinx-thebe\n  initThebe();\n};\n\n/**\n * Add no print class to certain DOM elements\n */\n\nfunction addNoPrint() {\n  var noPrintSelector = [\n    \".bd-header-announcement\",\n    \".bd-header\",\n    \".bd-header-article\",\n    \".bd-sidebar-primary\",\n    \".bd-sidebar-secondary\",\n    \".bd-footer-article\",\n    \".bd-footer-content\",\n    \".bd-footer\",\n  ].join(\",\");\n  document.querySelectorAll(noPrintSelector).forEach((ii) => {\n    ii.classList.add(\"noprint\");\n  });\n}\n\n/**\n * Set up callback functions for UI click actions\n */\nwindow.initThebeSBT = initThebeSBT;\nwindow.toggleFullScreen = toggleFullScreen;\n\n/**\n * Set up functions to load when the DOM is ready\n */\nsbRunWhenDOMLoaded(initTocHide);\nsbRunWhenDOMLoaded(addNoPrint);\n"],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/_build/html/_static/searchtools.js b/docs/_build/html/_static/searchtools.js
deleted file mode 100644
index ac4d586..0000000
--- a/docs/_build/html/_static/searchtools.js
+++ /dev/null
@@ -1,531 +0,0 @@
-/*
- * searchtools.js
- * ~~~~~~~~~~~~~~~~
- *
- * Sphinx JavaScript utilities for the full-text search.
- *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
- * :license: BSD, see LICENSE for details.
- *
- */
-"use strict";
-
-/**
- * Simple result scoring code.
- */
-if (typeof Scorer === "undefined") {
-  var Scorer = {
-    // Implement the following function to further tweak the score for each result
-    // The function takes a result array [docname, title, anchor, descr, score, filename]
-    // and returns the new score.
-    /*
-    score: result => {
-      const [docname, title, anchor, descr, score, filename] = result
-      return score
-    },
-    */
-
-    // query matches the full name of an object
-    objNameMatch: 11,
-    // or matches in the last dotted part of the object name
-    objPartialMatch: 6,
-    // Additive scores depending on the priority of the object
-    objPrio: {
-      0: 15, // used to be importantResults
-      1: 5, // used to be objectResults
-      2: -5, // used to be unimportantResults
-    },
-    //  Used when the priority is not in the mapping.
-    objPrioDefault: 0,
-
-    // query found in title
-    title: 15,
-    partialTitle: 7,
-    // query found in terms
-    term: 5,
-    partialTerm: 2,
-  };
-}
-
-const _removeChildren = (element) => {
-  while (element && element.lastChild) element.removeChild(element.lastChild);
-};
-
-/**
- * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions#escaping
- */
-const _escapeRegExp = (string) =>
-  string.replace(/[.*+\-?^${}()|[\]\\]/g, "\\$&"); // $& means the whole matched string
-
-const _displayItem = (item, highlightTerms, searchTerms) => {
-  const docBuilder = DOCUMENTATION_OPTIONS.BUILDER;
-  const docUrlRoot = DOCUMENTATION_OPTIONS.URL_ROOT;
-  const docFileSuffix = DOCUMENTATION_OPTIONS.FILE_SUFFIX;
-  const docLinkSuffix = DOCUMENTATION_OPTIONS.LINK_SUFFIX;
-  const showSearchSummary = DOCUMENTATION_OPTIONS.SHOW_SEARCH_SUMMARY;
-
-  const [docName, title, anchor, descr] = item;
-
-  let listItem = document.createElement("li");
-  let requestUrl;
-  let linkUrl;
-  if (docBuilder === "dirhtml") {
-    // dirhtml builder
-    let dirname = docName + "/";
-    if (dirname.match(/\/index\/$/))
-      dirname = dirname.substring(0, dirname.length - 6);
-    else if (dirname === "index/") dirname = "";
-    requestUrl = docUrlRoot + dirname;
-    linkUrl = requestUrl;
-  } else {
-    // normal html builders
-    requestUrl = docUrlRoot + docName + docFileSuffix;
-    linkUrl = docName + docLinkSuffix;
-  }
-  const params = new URLSearchParams();
-  params.set("highlight", [...highlightTerms].join(" "));
-  let linkEl = listItem.appendChild(document.createElement("a"));
-  linkEl.href = linkUrl + "?" + params.toString() + anchor;
-  linkEl.innerHTML = title;
-  if (descr)
-    listItem.appendChild(document.createElement("span")).innerText =
-      " (" + descr + ")";
-  else if (showSearchSummary)
-    fetch(requestUrl)
-      .then((responseData) => responseData.text())
-      .then((data) => {
-        if (data)
-          listItem.appendChild(
-            Search.makeSearchSummary(data, searchTerms, highlightTerms)
-          );
-      });
-  Search.output.appendChild(listItem);
-};
-const _finishSearch = (resultCount) => {
-  Search.stopPulse();
-  Search.title.innerText = _("Search Results");
-  if (!resultCount)
-    Search.status.innerText = Documentation.gettext(
-      "Your search did not match any documents. Please make sure that all words are spelled correctly and that you've selected enough categories."
-    );
-  else
-    Search.status.innerText = _(
-      `Search finished, found ${resultCount} page(s) matching the search query.`
-    );
-};
-const _displayNextItem = (
-  results,
-  resultCount,
-  highlightTerms,
-  searchTerms
-) => {
-  // results left, load the summary and display it
-  // this is intended to be dynamic (don't sub resultsCount)
-  if (results.length) {
-    _displayItem(results.pop(), highlightTerms, searchTerms);
-    setTimeout(
-      () => _displayNextItem(results, resultCount, highlightTerms, searchTerms),
-      5
-    );
-  }
-  // search finished, update title and status message
-  else _finishSearch(resultCount);
-};
-
-/**
- * Default splitQuery function. Can be overridden in ``sphinx.search`` with a
- * custom function per language.
- *
- * The regular expression works by splitting the string on consecutive characters
- * that are not Unicode letters, numbers, underscores, or emoji characters.
- * This is the same as ``\W+`` in Python, preserving the surrogate pair area.
- */
-if (typeof splitQuery === "undefined") {
-  var splitQuery = (query) => query
-      .split(/[^\p{Letter}\p{Number}_\p{Emoji_Presentation}]+/gu)
-      .filter(term => term)  // remove remaining empty strings
-}
-
-/**
- * Search Module
- */
-const Search = {
-  _index: null,
-  _queued_query: null,
-  _pulse_status: -1,
-
-  htmlToText: (htmlString) => {
-    const htmlElement = document
-      .createRange()
-      .createContextualFragment(htmlString);
-    _removeChildren(htmlElement.querySelectorAll(".headerlink"));
-    const docContent = htmlElement.querySelector('[role="main"]');
-    if (docContent !== undefined) return docContent.textContent;
-    console.warn(
-      "Content block not found. Sphinx search tries to obtain it via '[role=main]'. Could you check your theme or template."
-    );
-    return "";
-  },
-
-  init: () => {
-    const query = new URLSearchParams(window.location.search).get("q");
-    document
-      .querySelectorAll('input[name="q"]')
-      .forEach((el) => (el.value = query));
-    if (query) Search.performSearch(query);
-  },
-
-  loadIndex: (url) =>
-    (document.body.appendChild(document.createElement("script")).src = url),
-
-  setIndex: (index) => {
-    Search._index = index;
-    if (Search._queued_query !== null) {
-      const query = Search._queued_query;
-      Search._queued_query = null;
-      Search.query(query);
-    }
-  },
-
-  hasIndex: () => Search._index !== null,
-
-  deferQuery: (query) => (Search._queued_query = query),
-
-  stopPulse: () => (Search._pulse_status = -1),
-
-  startPulse: () => {
-    if (Search._pulse_status >= 0) return;
-
-    const pulse = () => {
-      Search._pulse_status = (Search._pulse_status + 1) % 4;
-      Search.dots.innerText = ".".repeat(Search._pulse_status);
-      if (Search._pulse_status >= 0) window.setTimeout(pulse, 500);
-    };
-    pulse();
-  },
-
-  /**
-   * perform a search for something (or wait until index is loaded)
-   */
-  performSearch: (query) => {
-    // create the required interface elements
-    const searchText = document.createElement("h2");
-    searchText.textContent = _("Searching");
-    const searchSummary = document.createElement("p");
-    searchSummary.classList.add("search-summary");
-    searchSummary.innerText = "";
-    const searchList = document.createElement("ul");
-    searchList.classList.add("search");
-
-    const out = document.getElementById("search-results");
-    Search.title = out.appendChild(searchText);
-    Search.dots = Search.title.appendChild(document.createElement("span"));
-    Search.status = out.appendChild(searchSummary);
-    Search.output = out.appendChild(searchList);
-
-    const searchProgress = document.getElementById("search-progress");
-    // Some themes don't use the search progress node
-    if (searchProgress) {
-      searchProgress.innerText = _("Preparing search...");
-    }
-    Search.startPulse();
-
-    // index already loaded, the browser was quick!
-    if (Search.hasIndex()) Search.query(query);
-    else Search.deferQuery(query);
-  },
-
-  /**
-   * execute search (requires search index to be loaded)
-   */
-  query: (query) => {
-    // stem the search terms and add them to the correct list
-    const stemmer = new Stemmer();
-    const searchTerms = new Set();
-    const excludedTerms = new Set();
-    const highlightTerms = new Set();
-    const objectTerms = new Set(splitQuery(query.toLowerCase().trim()));
-    splitQuery(query.trim()).forEach((queryTerm) => {
-      const queryTermLower = queryTerm.toLowerCase();
-
-      // maybe skip this "word"
-      // stopwords array is from language_data.js
-      if (
-        stopwords.indexOf(queryTermLower) !== -1 ||
-        queryTerm.match(/^\d+$/)
-      )
-        return;
-
-      // stem the word
-      let word = stemmer.stemWord(queryTermLower);
-      // select the correct list
-      if (word[0] === "-") excludedTerms.add(word.substr(1));
-      else {
-        searchTerms.add(word);
-        highlightTerms.add(queryTermLower);
-      }
-    });
-
-    // console.debug("SEARCH: searching for:");
-    // console.info("required: ", [...searchTerms]);
-    // console.info("excluded: ", [...excludedTerms]);
-
-    // array of [docname, title, anchor, descr, score, filename]
-    let results = [];
-    _removeChildren(document.getElementById("search-progress"));
-
-    // lookup as object
-    objectTerms.forEach((term) =>
-      results.push(...Search.performObjectSearch(term, objectTerms))
-    );
-
-    // lookup as search terms in fulltext
-    results.push(...Search.performTermsSearch(searchTerms, excludedTerms));
-
-    // let the scorer override scores with a custom scoring function
-    if (Scorer.score) results.forEach((item) => (item[4] = Scorer.score(item)));
-
-    // now sort the results by score (in opposite order of appearance, since the
-    // display function below uses pop() to retrieve items) and then
-    // alphabetically
-    results.sort((a, b) => {
-      const leftScore = a[4];
-      const rightScore = b[4];
-      if (leftScore === rightScore) {
-        // same score: sort alphabetically
-        const leftTitle = a[1].toLowerCase();
-        const rightTitle = b[1].toLowerCase();
-        if (leftTitle === rightTitle) return 0;
-        return leftTitle > rightTitle ? -1 : 1; // inverted is intentional
-      }
-      return leftScore > rightScore ? 1 : -1;
-    });
-
-    // remove duplicate search results
-    // note the reversing of results, so that in the case of duplicates, the highest-scoring entry is kept
-    let seen = new Set();
-    results = results.reverse().reduce((acc, result) => {
-      let resultStr = result.slice(0, 4).concat([result[5]]).map(v => String(v)).join(',');
-      if (!seen.has(resultStr)) {
-        acc.push(result);
-        seen.add(resultStr);
-      }
-      return acc;
-    }, []);
-
-    results = results.reverse();
-
-    // for debugging
-    //Search.lastresults = results.slice();  // a copy
-    // console.info("search results:", Search.lastresults);
-
-    // print the results
-    _displayNextItem(results, results.length, highlightTerms, searchTerms);
-  },
-
-  /**
-   * search for object names
-   */
-  performObjectSearch: (object, objectTerms) => {
-    const filenames = Search._index.filenames;
-    const docNames = Search._index.docnames;
-    const objects = Search._index.objects;
-    const objNames = Search._index.objnames;
-    const titles = Search._index.titles;
-
-    const results = [];
-
-    const objectSearchCallback = (prefix, match) => {
-      const name = match[4]
-      const fullname = (prefix ? prefix + "." : "") + name;
-      const fullnameLower = fullname.toLowerCase();
-      if (fullnameLower.indexOf(object) < 0) return;
-
-      let score = 0;
-      const parts = fullnameLower.split(".");
-
-      // check for different match types: exact matches of full name or
-      // "last name" (i.e. last dotted part)
-      if (fullnameLower === object || parts.slice(-1)[0] === object)
-        score += Scorer.objNameMatch;
-      else if (parts.slice(-1)[0].indexOf(object) > -1)
-        score += Scorer.objPartialMatch; // matches in last name
-
-      const objName = objNames[match[1]][2];
-      const title = titles[match[0]];
-
-      // If more than one term searched for, we require other words to be
-      // found in the name/title/description
-      const otherTerms = new Set(objectTerms);
-      otherTerms.delete(object);
-      if (otherTerms.size > 0) {
-        const haystack = `${prefix} ${name} ${objName} ${title}`.toLowerCase();
-        if (
-          [...otherTerms].some((otherTerm) => haystack.indexOf(otherTerm) < 0)
-        )
-          return;
-      }
-
-      let anchor = match[3];
-      if (anchor === "") anchor = fullname;
-      else if (anchor === "-") anchor = objNames[match[1]][1] + "-" + fullname;
-
-      const descr = objName + _(", in ") + title;
-
-      // add custom score for some objects according to scorer
-      if (Scorer.objPrio.hasOwnProperty(match[2]))
-        score += Scorer.objPrio[match[2]];
-      else score += Scorer.objPrioDefault;
-
-      results.push([
-        docNames[match[0]],
-        fullname,
-        "#" + anchor,
-        descr,
-        score,
-        filenames[match[0]],
-      ]);
-    };
-    Object.keys(objects).forEach((prefix) =>
-      objects[prefix].forEach((array) =>
-        objectSearchCallback(prefix, array)
-      )
-    );
-    return results;
-  },
-
-  /**
-   * search for full-text terms in the index
-   */
-  performTermsSearch: (searchTerms, excludedTerms) => {
-    // prepare search
-    const terms = Search._index.terms;
-    const titleTerms = Search._index.titleterms;
-    const docNames = Search._index.docnames;
-    const filenames = Search._index.filenames;
-    const titles = Search._index.titles;
-
-    const scoreMap = new Map();
-    const fileMap = new Map();
-
-    // perform the search on the required terms
-    searchTerms.forEach((word) => {
-      const files = [];
-      const arr = [
-        { files: terms[word], score: Scorer.term },
-        { files: titleTerms[word], score: Scorer.title },
-      ];
-      // add support for partial matches
-      if (word.length > 2) {
-        const escapedWord = _escapeRegExp(word);
-        Object.keys(terms).forEach((term) => {
-          if (term.match(escapedWord) && !terms[word])
-            arr.push({ files: terms[term], score: Scorer.partialTerm });
-        });
-        Object.keys(titleTerms).forEach((term) => {
-          if (term.match(escapedWord) && !titleTerms[word])
-            arr.push({ files: titleTerms[word], score: Scorer.partialTitle });
-        });
-      }
-
-      // no match but word was a required one
-      if (arr.every((record) => record.files === undefined)) return;
-
-      // found search word in contents
-      arr.forEach((record) => {
-        if (record.files === undefined) return;
-
-        let recordFiles = record.files;
-        if (recordFiles.length === undefined) recordFiles = [recordFiles];
-        files.push(...recordFiles);
-
-        // set score for the word in each file
-        recordFiles.forEach((file) => {
-          if (!scoreMap.has(file)) scoreMap.set(file, {});
-          scoreMap.get(file)[word] = record.score;
-        });
-      });
-
-      // create the mapping
-      files.forEach((file) => {
-        if (fileMap.has(file) && fileMap.get(file).indexOf(word) === -1)
-          fileMap.get(file).push(word);
-        else fileMap.set(file, [word]);
-      });
-    });
-
-    // now check if the files don't contain excluded terms
-    const results = [];
-    for (const [file, wordList] of fileMap) {
-      // check if all requirements are matched
-
-      // as search terms with length < 3 are discarded
-      const filteredTermCount = [...searchTerms].filter(
-        (term) => term.length > 2
-      ).length;
-      if (
-        wordList.length !== searchTerms.size &&
-        wordList.length !== filteredTermCount
-      )
-        continue;
-
-      // ensure that none of the excluded terms is in the search result
-      if (
-        [...excludedTerms].some(
-          (term) =>
-            terms[term] === file ||
-            titleTerms[term] === file ||
-            (terms[term] || []).includes(file) ||
-            (titleTerms[term] || []).includes(file)
-        )
-      )
-        break;
-
-      // select one (max) score for the file.
-      const score = Math.max(...wordList.map((w) => scoreMap.get(file)[w]));
-      // add result to the result list
-      results.push([
-        docNames[file],
-        titles[file],
-        "",
-        null,
-        score,
-        filenames[file],
-      ]);
-    }
-    return results;
-  },
-
-  /**
-   * helper function to return a node containing the
-   * search summary for a given text. keywords is a list
-   * of stemmed words, highlightWords is the list of normal, unstemmed
-   * words. the first one is used to find the occurrence, the
-   * latter for highlighting it.
-   */
-  makeSearchSummary: (htmlText, keywords, highlightWords) => {
-    const text = Search.htmlToText(htmlText).toLowerCase();
-    if (text === "") return null;
-
-    const actualStartPosition = [...keywords]
-      .map((k) => text.indexOf(k.toLowerCase()))
-      .filter((i) => i > -1)
-      .slice(-1)[0];
-    const startWithContext = Math.max(actualStartPosition - 120, 0);
-
-    const top = startWithContext === 0 ? "" : "...";
-    const tail = startWithContext + 240 < text.length ? "..." : "";
-
-    let summary = document.createElement("div");
-    summary.classList.add("context");
-    summary.innerText = top + text.substr(startWithContext, 240).trim() + tail;
-
-    highlightWords.forEach((highlightWord) =>
-      _highlightText(summary, highlightWord, "highlighted")
-    );
-
-    return summary;
-  },
-};
-
-_ready(Search.init);
diff --git a/docs/_build/html/_static/sphinx-thebe.css b/docs/_build/html/_static/sphinx-thebe.css
deleted file mode 100644
index 1da2793..0000000
--- a/docs/_build/html/_static/sphinx-thebe.css
+++ /dev/null
@@ -1,129 +0,0 @@
-/* Thebelab Buttons */
-.thebelab-button {
-  z-index: 999;
-  display: inline-block;
-  padding: 0.35em 1.2em;
-  margin: 0px 1px;
-  border-radius: 0.12em;
-  box-sizing: border-box;
-  text-decoration: none;
-  font-family: "Roboto", sans-serif;
-  font-weight: 300;
-  text-align: center;
-  transition: all 0.2s;
-  background-color: #dddddd;
-  border: 0.05em solid white;
-  color: #000000;
-}
-
-.thebelab-button:hover {
-  border: 0.05em solid black;
-  background-color: #fcfcfc;
-}
-
-.thebe-launch-button {
-  height: 2.2em;
-  font-size: 0.8em;
-  border: 1px black solid;
-}
-
-/* Thebelab Cell */
-.thebelab-cell pre {
-  background: none;
-}
-
-.thebelab-cell .thebelab-input {
-  padding-left: 1em;
-  margin-bottom: 0.5em;
-  margin-top: 0.5em;
-}
-
-.thebelab-cell .jp-OutputArea {
-  margin-top: 0.5em;
-  margin-left: 1em;
-}
-
-button.thebelab-button.thebelab-run-button {
-  margin-left: 1.5em;
-  margin-bottom: 0.5em;
-}
-
-/* Loading button */
-button.thebe-launch-button div.spinner {
-  float: left;
-  margin-right: 1em;
-}
-
-/* Remove the spinner when thebelab is ready */
-.thebe-launch-button.thebe-status-ready .spinner {
-  display: none;
-}
-
-.thebe-launch-button span.status {
-  font-family: monospace;
-  font-weight: bold;
-}
-
-.thebe-launch-button.thebe-status-ready span.status {
-  color: green;
-}
-
-.spinner {
-  height: 2em;
-  text-align: center;
-  font-size: 0.7em;
-}
-
-.spinner > div {
-  background-color: #f37726;
-  height: 100%;
-  width: 6px;
-  display: inline-block;
-
-  -webkit-animation: sk-stretchdelay 1.2s infinite ease-in-out;
-  animation: sk-stretchdelay 1.2s infinite ease-in-out;
-}
-
-.spinner .rect2 {
-  -webkit-animation-delay: -1.1s;
-  animation-delay: -1.1s;
-}
-
-.spinner .rect3 {
-  -webkit-animation-delay: -1s;
-  animation-delay: -1s;
-}
-
-.spinner .rect4 {
-  -webkit-animation-delay: -0.9s;
-  animation-delay: -0.9s;
-}
-
-.spinner .rect5 {
-  -webkit-animation-delay: -0.8s;
-  animation-delay: -0.8s;
-}
-
-@-webkit-keyframes sk-stretchdelay {
-  0%,
-  40%,
-  100% {
-    -webkit-transform: scaleY(0.4);
-  }
-  20% {
-    -webkit-transform: scaleY(1);
-  }
-}
-
-@keyframes sk-stretchdelay {
-  0%,
-  40%,
-  100% {
-    transform: scaleY(0.4);
-    -webkit-transform: scaleY(0.4);
-  }
-  20% {
-    transform: scaleY(1);
-    -webkit-transform: scaleY(1);
-  }
-}
diff --git a/docs/_build/html/_static/sphinx-thebe.js b/docs/_build/html/_static/sphinx-thebe.js
deleted file mode 100644
index 7626dbb..0000000
--- a/docs/_build/html/_static/sphinx-thebe.js
+++ /dev/null
@@ -1,126 +0,0 @@
-/**
- * Add attributes to Thebe blocks to initialize thebe properly
- */
-var configureThebe = () => {
-  // Load thebe config in case we want to update it as some point
-  console.log("[sphinx-thebe]: Loading thebe config...");
-  thebe_config = $('script[type="text/x-thebe-config"]')[0];
-
-  // If we already detect a Thebe cell, don't re-run
-  if (document.querySelectorAll("div.thebe-cell").length > 0) {
-    return;
-  }
-
-  // Update thebe buttons with loading message
-  $(".thebe-launch-button").each((ii, button) => {
-    button.innerHTML = `
-        <div class="spinner">
-            <div class="rect1"></div>
-            <div class="rect2"></div>
-            <div class="rect3"></div>
-            <div class="rect4"></div>
-        </div>
-        <span class="loading-text"></span>`;
-  });
-
-  // Set thebe event hooks
-  var thebeStatus;
-  thebelab.on("status", function (evt, data) {
-    console.log("Status changed:", data.status, data.message);
-
-    $(".thebe-launch-button ")
-      .removeClass("thebe-status-" + thebeStatus)
-      .addClass("thebe-status-" + data.status)
-      .find(".loading-text")
-      .html(
-        "<span class='launch_msg'>Launching from mybinder.org: </span><span class='status'>" +
-          data.status +
-          "</span>"
-      );
-
-    // Now update our thebe status
-    thebeStatus = data.status;
-
-    // Find any cells with an initialization tag and ask thebe to run them when ready
-    if (data.status === "ready") {
-      var thebeInitCells = document.querySelectorAll(
-        ".thebe-init, .tag_thebe-init"
-      );
-      thebeInitCells.forEach((cell) => {
-        console.log("Initializing Thebe with cell: " + cell.id);
-        cell.querySelector(".thebelab-run-button").click();
-      });
-    }
-  });
-};
-
-/**
- * Update the page DOM to use Thebe elements
- */
-var modifyDOMForThebe = () => {
-  // Find all code cells, replace with Thebe interactive code cells
-  const codeCells = document.querySelectorAll(thebe_selector);
-  codeCells.forEach((codeCell, index) => {
-    const codeCellId = (index) => `codecell${index}`;
-    codeCell.id = codeCellId(index);
-    codeCellText = codeCell.querySelector(thebe_selector_input);
-    codeCellOutput = codeCell.querySelector(thebe_selector_output);
-
-    // Clean up the language to make it work w/ CodeMirror and add it to the cell
-    dataLanguage = detectLanguage(kernelName);
-
-    // Re-arrange the cell and add metadata
-    if (codeCellText) {
-      codeCellText.setAttribute("data-language", dataLanguage);
-      codeCellText.setAttribute("data-executable", "true");
-
-      // If we had an output, insert it just after the `pre` cell
-      if (codeCellOutput) {
-        $(codeCellOutput).attr("data-output", "");
-        $(codeCellOutput).insertAfter(codeCellText);
-      }
-    }
-
-    // Remove sphinx-copybutton blocks, which are common in Sphinx
-    codeCell.querySelectorAll("button.copybtn").forEach((el) => {
-      el.remove();
-    });
-  });
-};
-
-var initThebe = () => {
-  // Load thebe dynamically if it's not already loaded
-  if (typeof thebelab === "undefined") {
-    console.log("[sphinx-thebe]: Loading thebe from CDN...");
-    $(".thebe-launch-button ").text("Loading thebe from CDN...");
-
-    const script = document.createElement("script");
-    script.src = `${THEBE_JS_URL}`;
-    document.head.appendChild(script);
-
-    // Runs once the script has finished loading
-    script.addEventListener("load", () => {
-      console.log("[sphinx-thebe]: Finished loading thebe from CDN...");
-      configureThebe();
-      modifyDOMForThebe();
-      thebelab.bootstrap();
-    });
-  } else {
-    console.log(
-      "[sphinx-thebe]: thebe already loaded, not loading from CDN..."
-    );
-    configureThebe();
-    modifyDOMForThebe();
-    thebelab.bootstrap();
-  }
-};
-
-// Helper function to munge the language name
-var detectLanguage = (language) => {
-  if (language.indexOf("python") > -1) {
-    language = "python";
-  } else if (language === "ir") {
-    language = "r";
-  }
-  return language;
-};
diff --git a/docs/_build/html/_static/styles/bootstrap.css b/docs/_build/html/_static/styles/bootstrap.css
deleted file mode 100644
index 82b03c0..0000000
--- a/docs/_build/html/_static/styles/bootstrap.css
+++ /dev/null
@@ -1,6 +0,0 @@
-/*!
- * Bootstrap  v5.3.2 (https://getbootstrap.com/)
- * Copyright 2011-2023 The Bootstrap Authors
- * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)
- */:root,[data-bs-theme=light]{--bs-blue:#0d6efd;--bs-indigo:#6610f2;--bs-purple:#6f42c1;--bs-pink:#d63384;--bs-red:#dc3545;--bs-orange:#fd7e14;--bs-yellow:#ffc107;--bs-green:#198754;--bs-teal:#20c997;--bs-cyan:#0dcaf0;--bs-black:#000;--bs-white:#fff;--bs-gray:#6c757d;--bs-gray-dark:#343a40;--bs-gray-100:#f8f9fa;--bs-gray-200:#e9ecef;--bs-gray-300:#dee2e6;--bs-gray-400:#ced4da;--bs-gray-500:#adb5bd;--bs-gray-600:#6c757d;--bs-gray-700:#495057;--bs-gray-800:#343a40;--bs-gray-900:#212529;--bs-primary:#0d6efd;--bs-secondary:#6c757d;--bs-success:#198754;--bs-info:#0dcaf0;--bs-warning:#ffc107;--bs-danger:#dc3545;--bs-light:#f8f9fa;--bs-dark:#212529;--bs-primary-rgb:13,110,253;--bs-secondary-rgb:108,117,125;--bs-success-rgb:25,135,84;--bs-info-rgb:13,202,240;--bs-warning-rgb:255,193,7;--bs-danger-rgb:220,53,69;--bs-light-rgb:248,249,250;--bs-dark-rgb:33,37,41;--bs-primary-text-emphasis:#052c65;--bs-secondary-text-emphasis:#2b2f32;--bs-success-text-emphasis:#0a3622;--bs-info-text-emphasis:#055160;--bs-warning-text-emphasis:#664d03;--bs-danger-text-emphasis:#58151c;--bs-light-text-emphasis:#495057;--bs-dark-text-emphasis:#495057;--bs-primary-bg-subtle:#cfe2ff;--bs-secondary-bg-subtle:#e2e3e5;--bs-success-bg-subtle:#d1e7dd;--bs-info-bg-subtle:#cff4fc;--bs-warning-bg-subtle:#fff3cd;--bs-danger-bg-subtle:#f8d7da;--bs-light-bg-subtle:#fcfcfd;--bs-dark-bg-subtle:#ced4da;--bs-primary-border-subtle:#9ec5fe;--bs-secondary-border-subtle:#c4c8cb;--bs-success-border-subtle:#a3cfbb;--bs-info-border-subtle:#9eeaf9;--bs-warning-border-subtle:#ffe69c;--bs-danger-border-subtle:#f1aeb5;--bs-light-border-subtle:#e9ecef;--bs-dark-border-subtle:#adb5bd;--bs-white-rgb:255,255,255;--bs-black-rgb:0,0,0;--bs-font-sans-serif:system-ui,-apple-system,"Segoe UI",Roboto,"Helvetica Neue","Noto Sans","Liberation Sans",Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";--bs-font-monospace:SFMono-Regular,Menlo,Monaco,Consolas,"Liberation Mono","Courier New",monospace;--bs-gradient:linear-gradient(180deg,hsla(0,0%,100%,.15),hsla(0,0%,100%,0));--bs-body-font-family:var(--bs-font-sans-serif);--bs-body-font-size:1rem;--bs-body-font-weight:400;--bs-body-line-height:1.5;--bs-body-color:#212529;--bs-body-color-rgb:33,37,41;--bs-body-bg:#fff;--bs-body-bg-rgb:255,255,255;--bs-emphasis-color:#000;--bs-emphasis-color-rgb:0,0,0;--bs-secondary-color:rgba(33,37,41,.75);--bs-secondary-color-rgb:33,37,41;--bs-secondary-bg:#e9ecef;--bs-secondary-bg-rgb:233,236,239;--bs-tertiary-color:rgba(33,37,41,.5);--bs-tertiary-color-rgb:33,37,41;--bs-tertiary-bg:#f8f9fa;--bs-tertiary-bg-rgb:248,249,250;--bs-heading-color:inherit;--bs-link-color:#0d6efd;--bs-link-color-rgb:13,110,253;--bs-link-decoration:underline;--bs-link-hover-color:#0a58ca;--bs-link-hover-color-rgb:10,88,202;--bs-code-color:#d63384;--bs-highlight-color:#212529;--bs-highlight-bg:#fff3cd;--bs-border-width:1px;--bs-border-style:solid;--bs-border-color:#dee2e6;--bs-border-color-translucent:rgba(0,0,0,.175);--bs-border-radius:0.375rem;--bs-border-radius-sm:0.25rem;--bs-border-radius-lg:0.5rem;--bs-border-radius-xl:1rem;--bs-border-radius-xxl:2rem;--bs-border-radius-2xl:var(--bs-border-radius-xxl);--bs-border-radius-pill:50rem;--bs-box-shadow:0 0.5rem 1rem rgba(0,0,0,.15);--bs-box-shadow-sm:0 0.125rem 0.25rem rgba(0,0,0,.075);--bs-box-shadow-lg:0 1rem 3rem rgba(0,0,0,.175);--bs-box-shadow-inset:inset 0 1px 2px rgba(0,0,0,.075);--bs-focus-ring-width:0.25rem;--bs-focus-ring-opacity:0.25;--bs-focus-ring-color:rgba(13,110,253,.25);--bs-form-valid-color:#198754;--bs-form-valid-border-color:#198754;--bs-form-invalid-color:#dc3545;--bs-form-invalid-border-color:#dc3545}[data-bs-theme=dark]{--bs-body-color:#dee2e6;--bs-body-color-rgb:222,226,230;--bs-body-bg:#212529;--bs-body-bg-rgb:33,37,41;--bs-emphasis-color:#fff;--bs-emphasis-color-rgb:255,255,255;--bs-secondary-color:rgba(222,226,230,.75);--bs-secondary-color-rgb:222,226,230;--bs-secondary-bg:#343a40;--bs-secondary-bg-rgb:52,58,64;--bs-tertiary-color:rgba(222,226,230,.5);--bs-tertiary-color-rgb:222,226,230;--bs-tertiary-bg:#2b3035;--bs-tertiary-bg-rgb:43,48,53;--bs-primary-text-emphasis:#6ea8fe;--bs-secondary-text-emphasis:#a7acb1;--bs-success-text-emphasis:#75b798;--bs-info-text-emphasis:#6edff6;--bs-warning-text-emphasis:#ffda6a;--bs-danger-text-emphasis:#ea868f;--bs-light-text-emphasis:#f8f9fa;--bs-dark-text-emphasis:#dee2e6;--bs-primary-bg-subtle:#031633;--bs-secondary-bg-subtle:#161719;--bs-success-bg-subtle:#051b11;--bs-info-bg-subtle:#032830;--bs-warning-bg-subtle:#332701;--bs-danger-bg-subtle:#2c0b0e;--bs-light-bg-subtle:#343a40;--bs-dark-bg-subtle:#1a1d20;--bs-primary-border-subtle:#084298;--bs-secondary-border-subtle:#41464b;--bs-success-border-subtle:#0f5132;--bs-info-border-subtle:#087990;--bs-warning-border-subtle:#997404;--bs-danger-border-subtle:#842029;--bs-light-border-subtle:#495057;--bs-dark-border-subtle:#343a40;--bs-heading-color:inherit;--bs-link-color:#6ea8fe;--bs-link-hover-color:#8bb9fe;--bs-link-color-rgb:110,168,254;--bs-link-hover-color-rgb:139,185,254;--bs-code-color:#e685b5;--bs-highlight-color:#dee2e6;--bs-highlight-bg:#664d03;--bs-border-color:#495057;--bs-border-color-translucent:hsla(0,0%,100%,.15);--bs-form-valid-color:#75b798;--bs-form-valid-border-color:#75b798;--bs-form-invalid-color:#ea868f;--bs-form-invalid-border-color:#ea868f;color-scheme:dark}*,:after,:before{box-sizing:border-box}@media(prefers-reduced-motion:no-preference){:root{scroll-behavior:smooth}}body{-webkit-text-size-adjust:100%;-webkit-tap-highlight-color:rgba(0,0,0,0);background-color:var(--bs-body-bg);color:var(--bs-body-color);font-family:var(--bs-body-font-family);font-size:var(--bs-body-font-size);font-weight:var(--bs-body-font-weight);line-height:var(--bs-body-line-height);margin:0;text-align:var(--bs-body-text-align)}hr{border:0;border-top:var(--bs-border-width) solid;color:inherit;margin:1rem 0;opacity:.25}.h1,.h2,.h3,.h4,.h5,.h6,h1,h2,h3,h4,h5,h6{color:var(--bs-heading-color);font-weight:500;line-height:1.2;margin-bottom:.5rem;margin-top:0}.h1,h1{font-size:calc(1.375rem + 1.5vw)}@media(min-width:1200px){.h1,h1{font-size:2.5rem}}.h2,h2{font-size:calc(1.325rem + .9vw)}@media(min-width:1200px){.h2,h2{font-size:2rem}}.h3,h3{font-size:calc(1.3rem + .6vw)}@media(min-width:1200px){.h3,h3{font-size:1.75rem}}.h4,h4{font-size:calc(1.275rem + .3vw)}@media(min-width:1200px){.h4,h4{font-size:1.5rem}}.h5,h5{font-size:1.25rem}.h6,h6{font-size:1rem}p{margin-bottom:1rem;margin-top:0}abbr[title]{cursor:help;text-decoration:underline dotted;text-decoration-skip-ink:none}address{font-style:normal;line-height:inherit;margin-bottom:1rem}ol,ul{padding-left:2rem}dl,ol,ul{margin-bottom:1rem;margin-top:0}ol ol,ol ul,ul ol,ul ul{margin-bottom:0}dt{font-weight:700}dd{margin-bottom:.5rem;margin-left:0}blockquote{margin:0 0 1rem}b,strong{font-weight:bolder}.small,small{font-size:.875em}.mark,mark{background-color:var(--bs-highlight-bg);color:var(--bs-highlight-color);padding:.1875em}sub,sup{font-size:.75em;line-height:0;position:relative;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}a{color:rgba(var(--bs-link-color-rgb),var(--bs-link-opacity,1));text-decoration:underline}a:hover{--bs-link-color-rgb:var(--bs-link-hover-color-rgb)}a:not([href]):not([class]),a:not([href]):not([class]):hover{color:inherit;text-decoration:none}code,kbd,pre,samp{font-family:var(--bs-font-monospace);font-size:1em}pre{display:block;font-size:.875em;margin-bottom:1rem;margin-top:0;overflow:auto}pre code{color:inherit;font-size:inherit;word-break:normal}code{word-wrap:break-word;color:var(--bs-code-color);font-size:.875em}a>code{color:inherit}kbd{background-color:var(--bs-body-color);border-radius:.25rem;color:var(--bs-body-bg);font-size:.875em;padding:.1875rem .375rem}kbd kbd{font-size:1em;padding:0}figure{margin:0 0 1rem}img,svg{vertical-align:middle}table{border-collapse:collapse;caption-side:bottom}caption{color:var(--bs-secondary-color);padding-bottom:.5rem;padding-top:.5rem;text-align:left}th{text-align:inherit;text-align:-webkit-match-parent}tbody,td,tfoot,th,thead,tr{border:0 solid;border-color:inherit}label{display:inline-block}button{border-radius:0}button:focus:not(:focus-visible){outline:0}button,input,optgroup,select,textarea{font-family:inherit;font-size:inherit;line-height:inherit;margin:0}button,select{text-transform:none}[role=button]{cursor:pointer}select{word-wrap:normal}select:disabled{opacity:1}[list]:not([type=date]):not([type=datetime-local]):not([type=month]):not([type=week]):not([type=time])::-webkit-calendar-picker-indicator{display:none!important}[type=button],[type=reset],[type=submit],button{-webkit-appearance:button}[type=button]:not(:disabled),[type=reset]:not(:disabled),[type=submit]:not(:disabled),button:not(:disabled){cursor:pointer}::-moz-focus-inner{border-style:none;padding:0}textarea{resize:vertical}fieldset{border:0;margin:0;min-width:0;padding:0}legend{float:left;font-size:calc(1.275rem + .3vw);line-height:inherit;margin-bottom:.5rem;padding:0;width:100%}@media(min-width:1200px){legend{font-size:1.5rem}}legend+*{clear:left}::-webkit-datetime-edit-day-field,::-webkit-datetime-edit-fields-wrapper,::-webkit-datetime-edit-hour-field,::-webkit-datetime-edit-minute,::-webkit-datetime-edit-month-field,::-webkit-datetime-edit-text,::-webkit-datetime-edit-year-field{padding:0}::-webkit-inner-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}::-webkit-search-decoration{-webkit-appearance:none}::-webkit-color-swatch-wrapper{padding:0}::file-selector-button{-webkit-appearance:button;font:inherit}output{display:inline-block}iframe{border:0}summary{cursor:pointer;display:list-item}progress{vertical-align:baseline}[hidden]{display:none!important}.lead{font-size:1.25rem;font-weight:300}.display-1{font-size:calc(1.625rem + 4.5vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-1{font-size:5rem}}.display-2{font-size:calc(1.575rem + 3.9vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-2{font-size:4.5rem}}.display-3{font-size:calc(1.525rem + 3.3vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-3{font-size:4rem}}.display-4{font-size:calc(1.475rem + 2.7vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-4{font-size:3.5rem}}.display-5{font-size:calc(1.425rem + 2.1vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-5{font-size:3rem}}.display-6{font-size:calc(1.375rem + 1.5vw);font-weight:300;line-height:1.2}@media(min-width:1200px){.display-6{font-size:2.5rem}}.list-inline,.list-unstyled{list-style:none;padding-left:0}.list-inline-item{display:inline-block}.list-inline-item:not(:last-child){margin-right:.5rem}.initialism{font-size:.875em;text-transform:uppercase}.blockquote{font-size:1.25rem;margin-bottom:1rem}.blockquote>:last-child{margin-bottom:0}.blockquote-footer{color:#6c757d;font-size:.875em;margin-bottom:1rem;margin-top:-1rem}.blockquote-footer:before{content:"— "}.img-fluid,.img-thumbnail{height:auto;max-width:100%}.img-thumbnail{background-color:var(--bs-body-bg);border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);padding:.25rem}.figure{display:inline-block}.figure-img{line-height:1;margin-bottom:.5rem}.figure-caption{color:var(--bs-secondary-color);font-size:.875em}.container,.container-fluid,.container-lg,.container-md,.container-sm,.container-xl{--bs-gutter-x:1.5rem;--bs-gutter-y:0;margin-left:auto;margin-right:auto;padding-left:calc(var(--bs-gutter-x)*.5);padding-right:calc(var(--bs-gutter-x)*.5);width:100%}@media(min-width:540px){.container,.container-sm{max-width:540px}}@media(min-width:720px){.container,.container-md,.container-sm{max-width:720px}}@media(min-width:960px){.container,.container-lg,.container-md,.container-sm{max-width:960px}}@media(min-width:1200px){.container,.container-lg,.container-md,.container-sm,.container-xl{max-width:1400px}}:root{--bs-breakpoint-xs:0;--bs-breakpoint-sm:540px;--bs-breakpoint-md:720px;--bs-breakpoint-lg:960px;--bs-breakpoint-xl:1200px}.row{--bs-gutter-x:1.5rem;--bs-gutter-y:0;display:flex;flex-wrap:wrap;margin-left:calc(var(--bs-gutter-x)*-.5);margin-right:calc(var(--bs-gutter-x)*-.5);margin-top:calc(var(--bs-gutter-y)*-1)}.row>*{flex-shrink:0;margin-top:var(--bs-gutter-y);max-width:100%;padding-left:calc(var(--bs-gutter-x)*.5);padding-right:calc(var(--bs-gutter-x)*.5);width:100%}.col{flex:1 0 0%}.row-cols-auto>*{flex:0 0 auto;width:auto}.row-cols-1>*{flex:0 0 auto;width:100%}.row-cols-2>*{flex:0 0 auto;width:50%}.row-cols-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-4>*{flex:0 0 auto;width:25%}.row-cols-5>*{flex:0 0 auto;width:20%}.row-cols-6>*{flex:0 0 auto;width:16.66666667%}.col-auto{flex:0 0 auto;width:auto}.col-1{flex:0 0 auto;width:8.33333333%}.col-2{flex:0 0 auto;width:16.66666667%}.col-3{flex:0 0 auto;width:25%}.col-4{flex:0 0 auto;width:33.33333333%}.col-5{flex:0 0 auto;width:41.66666667%}.col-6{flex:0 0 auto;width:50%}.col-7{flex:0 0 auto;width:58.33333333%}.col-8{flex:0 0 auto;width:66.66666667%}.col-9{flex:0 0 auto;width:75%}.col-10{flex:0 0 auto;width:83.33333333%}.col-11{flex:0 0 auto;width:91.66666667%}.col-12{flex:0 0 auto;width:100%}.offset-1{margin-left:8.33333333%}.offset-2{margin-left:16.66666667%}.offset-3{margin-left:25%}.offset-4{margin-left:33.33333333%}.offset-5{margin-left:41.66666667%}.offset-6{margin-left:50%}.offset-7{margin-left:58.33333333%}.offset-8{margin-left:66.66666667%}.offset-9{margin-left:75%}.offset-10{margin-left:83.33333333%}.offset-11{margin-left:91.66666667%}.g-0,.gx-0{--bs-gutter-x:0}.g-0,.gy-0{--bs-gutter-y:0}.g-1,.gx-1{--bs-gutter-x:0.25rem}.g-1,.gy-1{--bs-gutter-y:0.25rem}.g-2,.gx-2{--bs-gutter-x:0.5rem}.g-2,.gy-2{--bs-gutter-y:0.5rem}.g-3,.gx-3{--bs-gutter-x:1rem}.g-3,.gy-3{--bs-gutter-y:1rem}.g-4,.gx-4{--bs-gutter-x:1.5rem}.g-4,.gy-4{--bs-gutter-y:1.5rem}.g-5,.gx-5{--bs-gutter-x:3rem}.g-5,.gy-5{--bs-gutter-y:3rem}@media(min-width:540px){.col-sm{flex:1 0 0%}.row-cols-sm-auto>*{flex:0 0 auto;width:auto}.row-cols-sm-1>*{flex:0 0 auto;width:100%}.row-cols-sm-2>*{flex:0 0 auto;width:50%}.row-cols-sm-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-sm-4>*{flex:0 0 auto;width:25%}.row-cols-sm-5>*{flex:0 0 auto;width:20%}.row-cols-sm-6>*{flex:0 0 auto;width:16.66666667%}.col-sm-auto{flex:0 0 auto;width:auto}.col-sm-1{flex:0 0 auto;width:8.33333333%}.col-sm-2{flex:0 0 auto;width:16.66666667%}.col-sm-3{flex:0 0 auto;width:25%}.col-sm-4{flex:0 0 auto;width:33.33333333%}.col-sm-5{flex:0 0 auto;width:41.66666667%}.col-sm-6{flex:0 0 auto;width:50%}.col-sm-7{flex:0 0 auto;width:58.33333333%}.col-sm-8{flex:0 0 auto;width:66.66666667%}.col-sm-9{flex:0 0 auto;width:75%}.col-sm-10{flex:0 0 auto;width:83.33333333%}.col-sm-11{flex:0 0 auto;width:91.66666667%}.col-sm-12{flex:0 0 auto;width:100%}.offset-sm-0{margin-left:0}.offset-sm-1{margin-left:8.33333333%}.offset-sm-2{margin-left:16.66666667%}.offset-sm-3{margin-left:25%}.offset-sm-4{margin-left:33.33333333%}.offset-sm-5{margin-left:41.66666667%}.offset-sm-6{margin-left:50%}.offset-sm-7{margin-left:58.33333333%}.offset-sm-8{margin-left:66.66666667%}.offset-sm-9{margin-left:75%}.offset-sm-10{margin-left:83.33333333%}.offset-sm-11{margin-left:91.66666667%}.g-sm-0,.gx-sm-0{--bs-gutter-x:0}.g-sm-0,.gy-sm-0{--bs-gutter-y:0}.g-sm-1,.gx-sm-1{--bs-gutter-x:0.25rem}.g-sm-1,.gy-sm-1{--bs-gutter-y:0.25rem}.g-sm-2,.gx-sm-2{--bs-gutter-x:0.5rem}.g-sm-2,.gy-sm-2{--bs-gutter-y:0.5rem}.g-sm-3,.gx-sm-3{--bs-gutter-x:1rem}.g-sm-3,.gy-sm-3{--bs-gutter-y:1rem}.g-sm-4,.gx-sm-4{--bs-gutter-x:1.5rem}.g-sm-4,.gy-sm-4{--bs-gutter-y:1.5rem}.g-sm-5,.gx-sm-5{--bs-gutter-x:3rem}.g-sm-5,.gy-sm-5{--bs-gutter-y:3rem}}@media(min-width:720px){.col-md{flex:1 0 0%}.row-cols-md-auto>*{flex:0 0 auto;width:auto}.row-cols-md-1>*{flex:0 0 auto;width:100%}.row-cols-md-2>*{flex:0 0 auto;width:50%}.row-cols-md-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-md-4>*{flex:0 0 auto;width:25%}.row-cols-md-5>*{flex:0 0 auto;width:20%}.row-cols-md-6>*{flex:0 0 auto;width:16.66666667%}.col-md-auto{flex:0 0 auto;width:auto}.col-md-1{flex:0 0 auto;width:8.33333333%}.col-md-2{flex:0 0 auto;width:16.66666667%}.col-md-3{flex:0 0 auto;width:25%}.col-md-4{flex:0 0 auto;width:33.33333333%}.col-md-5{flex:0 0 auto;width:41.66666667%}.col-md-6{flex:0 0 auto;width:50%}.col-md-7{flex:0 0 auto;width:58.33333333%}.col-md-8{flex:0 0 auto;width:66.66666667%}.col-md-9{flex:0 0 auto;width:75%}.col-md-10{flex:0 0 auto;width:83.33333333%}.col-md-11{flex:0 0 auto;width:91.66666667%}.col-md-12{flex:0 0 auto;width:100%}.offset-md-0{margin-left:0}.offset-md-1{margin-left:8.33333333%}.offset-md-2{margin-left:16.66666667%}.offset-md-3{margin-left:25%}.offset-md-4{margin-left:33.33333333%}.offset-md-5{margin-left:41.66666667%}.offset-md-6{margin-left:50%}.offset-md-7{margin-left:58.33333333%}.offset-md-8{margin-left:66.66666667%}.offset-md-9{margin-left:75%}.offset-md-10{margin-left:83.33333333%}.offset-md-11{margin-left:91.66666667%}.g-md-0,.gx-md-0{--bs-gutter-x:0}.g-md-0,.gy-md-0{--bs-gutter-y:0}.g-md-1,.gx-md-1{--bs-gutter-x:0.25rem}.g-md-1,.gy-md-1{--bs-gutter-y:0.25rem}.g-md-2,.gx-md-2{--bs-gutter-x:0.5rem}.g-md-2,.gy-md-2{--bs-gutter-y:0.5rem}.g-md-3,.gx-md-3{--bs-gutter-x:1rem}.g-md-3,.gy-md-3{--bs-gutter-y:1rem}.g-md-4,.gx-md-4{--bs-gutter-x:1.5rem}.g-md-4,.gy-md-4{--bs-gutter-y:1.5rem}.g-md-5,.gx-md-5{--bs-gutter-x:3rem}.g-md-5,.gy-md-5{--bs-gutter-y:3rem}}@media(min-width:960px){.col-lg{flex:1 0 0%}.row-cols-lg-auto>*{flex:0 0 auto;width:auto}.row-cols-lg-1>*{flex:0 0 auto;width:100%}.row-cols-lg-2>*{flex:0 0 auto;width:50%}.row-cols-lg-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-lg-4>*{flex:0 0 auto;width:25%}.row-cols-lg-5>*{flex:0 0 auto;width:20%}.row-cols-lg-6>*{flex:0 0 auto;width:16.66666667%}.col-lg-auto{flex:0 0 auto;width:auto}.col-lg-1{flex:0 0 auto;width:8.33333333%}.col-lg-2{flex:0 0 auto;width:16.66666667%}.col-lg-3{flex:0 0 auto;width:25%}.col-lg-4{flex:0 0 auto;width:33.33333333%}.col-lg-5{flex:0 0 auto;width:41.66666667%}.col-lg-6{flex:0 0 auto;width:50%}.col-lg-7{flex:0 0 auto;width:58.33333333%}.col-lg-8{flex:0 0 auto;width:66.66666667%}.col-lg-9{flex:0 0 auto;width:75%}.col-lg-10{flex:0 0 auto;width:83.33333333%}.col-lg-11{flex:0 0 auto;width:91.66666667%}.col-lg-12{flex:0 0 auto;width:100%}.offset-lg-0{margin-left:0}.offset-lg-1{margin-left:8.33333333%}.offset-lg-2{margin-left:16.66666667%}.offset-lg-3{margin-left:25%}.offset-lg-4{margin-left:33.33333333%}.offset-lg-5{margin-left:41.66666667%}.offset-lg-6{margin-left:50%}.offset-lg-7{margin-left:58.33333333%}.offset-lg-8{margin-left:66.66666667%}.offset-lg-9{margin-left:75%}.offset-lg-10{margin-left:83.33333333%}.offset-lg-11{margin-left:91.66666667%}.g-lg-0,.gx-lg-0{--bs-gutter-x:0}.g-lg-0,.gy-lg-0{--bs-gutter-y:0}.g-lg-1,.gx-lg-1{--bs-gutter-x:0.25rem}.g-lg-1,.gy-lg-1{--bs-gutter-y:0.25rem}.g-lg-2,.gx-lg-2{--bs-gutter-x:0.5rem}.g-lg-2,.gy-lg-2{--bs-gutter-y:0.5rem}.g-lg-3,.gx-lg-3{--bs-gutter-x:1rem}.g-lg-3,.gy-lg-3{--bs-gutter-y:1rem}.g-lg-4,.gx-lg-4{--bs-gutter-x:1.5rem}.g-lg-4,.gy-lg-4{--bs-gutter-y:1.5rem}.g-lg-5,.gx-lg-5{--bs-gutter-x:3rem}.g-lg-5,.gy-lg-5{--bs-gutter-y:3rem}}@media(min-width:1200px){.col-xl{flex:1 0 0%}.row-cols-xl-auto>*{flex:0 0 auto;width:auto}.row-cols-xl-1>*{flex:0 0 auto;width:100%}.row-cols-xl-2>*{flex:0 0 auto;width:50%}.row-cols-xl-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-xl-4>*{flex:0 0 auto;width:25%}.row-cols-xl-5>*{flex:0 0 auto;width:20%}.row-cols-xl-6>*{flex:0 0 auto;width:16.66666667%}.col-xl-auto{flex:0 0 auto;width:auto}.col-xl-1{flex:0 0 auto;width:8.33333333%}.col-xl-2{flex:0 0 auto;width:16.66666667%}.col-xl-3{flex:0 0 auto;width:25%}.col-xl-4{flex:0 0 auto;width:33.33333333%}.col-xl-5{flex:0 0 auto;width:41.66666667%}.col-xl-6{flex:0 0 auto;width:50%}.col-xl-7{flex:0 0 auto;width:58.33333333%}.col-xl-8{flex:0 0 auto;width:66.66666667%}.col-xl-9{flex:0 0 auto;width:75%}.col-xl-10{flex:0 0 auto;width:83.33333333%}.col-xl-11{flex:0 0 auto;width:91.66666667%}.col-xl-12{flex:0 0 auto;width:100%}.offset-xl-0{margin-left:0}.offset-xl-1{margin-left:8.33333333%}.offset-xl-2{margin-left:16.66666667%}.offset-xl-3{margin-left:25%}.offset-xl-4{margin-left:33.33333333%}.offset-xl-5{margin-left:41.66666667%}.offset-xl-6{margin-left:50%}.offset-xl-7{margin-left:58.33333333%}.offset-xl-8{margin-left:66.66666667%}.offset-xl-9{margin-left:75%}.offset-xl-10{margin-left:83.33333333%}.offset-xl-11{margin-left:91.66666667%}.g-xl-0,.gx-xl-0{--bs-gutter-x:0}.g-xl-0,.gy-xl-0{--bs-gutter-y:0}.g-xl-1,.gx-xl-1{--bs-gutter-x:0.25rem}.g-xl-1,.gy-xl-1{--bs-gutter-y:0.25rem}.g-xl-2,.gx-xl-2{--bs-gutter-x:0.5rem}.g-xl-2,.gy-xl-2{--bs-gutter-y:0.5rem}.g-xl-3,.gx-xl-3{--bs-gutter-x:1rem}.g-xl-3,.gy-xl-3{--bs-gutter-y:1rem}.g-xl-4,.gx-xl-4{--bs-gutter-x:1.5rem}.g-xl-4,.gy-xl-4{--bs-gutter-y:1.5rem}.g-xl-5,.gx-xl-5{--bs-gutter-x:3rem}.g-xl-5,.gy-xl-5{--bs-gutter-y:3rem}}.table{--bs-table-color-type:initial;--bs-table-bg-type:initial;--bs-table-color-state:initial;--bs-table-bg-state:initial;--bs-table-color:var(--bs-emphasis-color);--bs-table-bg:var(--bs-body-bg);--bs-table-border-color:var(--bs-border-color);--bs-table-accent-bg:transparent;--bs-table-striped-color:var(--bs-emphasis-color);--bs-table-striped-bg:rgba(var(--bs-emphasis-color-rgb),0.05);--bs-table-active-color:var(--bs-emphasis-color);--bs-table-active-bg:rgba(var(--bs-emphasis-color-rgb),0.1);--bs-table-hover-color:var(--bs-emphasis-color);--bs-table-hover-bg:rgba(var(--bs-emphasis-color-rgb),0.075);border-color:var(--bs-table-border-color);margin-bottom:1rem;vertical-align:top;width:100%}.table>:not(caption)>*>*{background-color:var(--bs-table-bg);border-bottom-width:var(--bs-border-width);box-shadow:inset 0 0 0 9999px var(--bs-table-bg-state,var(--bs-table-bg-type,var(--bs-table-accent-bg)));color:var(--bs-table-color-state,var(--bs-table-color-type,var(--bs-table-color)));padding:.5rem}.table>tbody{vertical-align:inherit}.table>thead{vertical-align:bottom}.table-group-divider{border-top:calc(var(--bs-border-width)*2) solid}.caption-top{caption-side:top}.table-sm>:not(caption)>*>*{padding:.25rem}.table-bordered>:not(caption)>*{border-width:var(--bs-border-width) 0}.table-bordered>:not(caption)>*>*{border-width:0 var(--bs-border-width)}.table-borderless>:not(caption)>*>*{border-bottom-width:0}.table-borderless>:not(:first-child){border-top-width:0}.table-striped-columns>:not(caption)>tr>:nth-child(2n),.table-striped>tbody>tr:nth-of-type(odd)>*{--bs-table-color-type:var(--bs-table-striped-color);--bs-table-bg-type:var(--bs-table-striped-bg)}.table-active{--bs-table-color-state:var(--bs-table-active-color);--bs-table-bg-state:var(--bs-table-active-bg)}.table-hover>tbody>tr:hover>*{--bs-table-color-state:var(--bs-table-hover-color);--bs-table-bg-state:var(--bs-table-hover-bg)}.table-primary{--bs-table-color:#000;--bs-table-bg:#cfe2ff;--bs-table-border-color:#a6b5cc;--bs-table-striped-bg:#c5d7f2;--bs-table-striped-color:#000;--bs-table-active-bg:#bacbe6;--bs-table-active-color:#000;--bs-table-hover-bg:#bfd1ec;--bs-table-hover-color:#000}.table-primary,.table-secondary{border-color:var(--bs-table-border-color);color:var(--bs-table-color)}.table-secondary{--bs-table-color:#000;--bs-table-bg:#e2e3e5;--bs-table-border-color:#b5b6b7;--bs-table-striped-bg:#d7d8da;--bs-table-striped-color:#000;--bs-table-active-bg:#cbccce;--bs-table-active-color:#000;--bs-table-hover-bg:#d1d2d4;--bs-table-hover-color:#000}.table-success{--bs-table-color:#000;--bs-table-bg:#d1e7dd;--bs-table-border-color:#a7b9b1;--bs-table-striped-bg:#c7dbd2;--bs-table-striped-color:#000;--bs-table-active-bg:#bcd0c7;--bs-table-active-color:#000;--bs-table-hover-bg:#c1d6cc;--bs-table-hover-color:#000}.table-info,.table-success{border-color:var(--bs-table-border-color);color:var(--bs-table-color)}.table-info{--bs-table-color:#000;--bs-table-bg:#cff4fc;--bs-table-border-color:#a6c3ca;--bs-table-striped-bg:#c5e8ef;--bs-table-striped-color:#000;--bs-table-active-bg:#badce3;--bs-table-active-color:#000;--bs-table-hover-bg:#bfe2e9;--bs-table-hover-color:#000}.table-warning{--bs-table-color:#000;--bs-table-bg:#fff3cd;--bs-table-border-color:#ccc2a4;--bs-table-striped-bg:#f2e7c3;--bs-table-striped-color:#000;--bs-table-active-bg:#e6dbb9;--bs-table-active-color:#000;--bs-table-hover-bg:#ece1be;--bs-table-hover-color:#000}.table-danger,.table-warning{border-color:var(--bs-table-border-color);color:var(--bs-table-color)}.table-danger{--bs-table-color:#000;--bs-table-bg:#f8d7da;--bs-table-border-color:#c6acae;--bs-table-striped-bg:#eccccf;--bs-table-striped-color:#000;--bs-table-active-bg:#dfc2c4;--bs-table-active-color:#000;--bs-table-hover-bg:#e5c7ca;--bs-table-hover-color:#000}.table-light{--bs-table-color:#000;--bs-table-bg:#f8f9fa;--bs-table-border-color:#c6c7c8;--bs-table-striped-bg:#ecedee;--bs-table-striped-color:#000;--bs-table-active-bg:#dfe0e1;--bs-table-active-color:#000;--bs-table-hover-bg:#e5e6e7;--bs-table-hover-color:#000}.table-dark,.table-light{border-color:var(--bs-table-border-color);color:var(--bs-table-color)}.table-dark{--bs-table-color:#fff;--bs-table-bg:#212529;--bs-table-border-color:#4d5154;--bs-table-striped-bg:#2c3034;--bs-table-striped-color:#fff;--bs-table-active-bg:#373b3e;--bs-table-active-color:#fff;--bs-table-hover-bg:#323539;--bs-table-hover-color:#fff}.table-responsive{-webkit-overflow-scrolling:touch;overflow-x:auto}@media(max-width:539.98px){.table-responsive-sm{-webkit-overflow-scrolling:touch;overflow-x:auto}}@media(max-width:719.98px){.table-responsive-md{-webkit-overflow-scrolling:touch;overflow-x:auto}}@media(max-width:959.98px){.table-responsive-lg{-webkit-overflow-scrolling:touch;overflow-x:auto}}@media(max-width:1199.98px){.table-responsive-xl{-webkit-overflow-scrolling:touch;overflow-x:auto}}.form-label{margin-bottom:.5rem}.col-form-label{font-size:inherit;line-height:1.5;margin-bottom:0;padding-bottom:calc(.375rem + var(--bs-border-width));padding-top:calc(.375rem + var(--bs-border-width))}.col-form-label-lg{font-size:1.25rem;padding-bottom:calc(.5rem + var(--bs-border-width));padding-top:calc(.5rem + var(--bs-border-width))}.col-form-label-sm{font-size:.875rem;padding-bottom:calc(.25rem + var(--bs-border-width));padding-top:calc(.25rem + var(--bs-border-width))}.form-text{color:var(--bs-secondary-color);font-size:.875em;margin-top:.25rem}.form-control{appearance:none;background-clip:padding-box;background-color:var(--bs-body-bg);border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);color:var(--bs-body-color);display:block;font-size:1rem;font-weight:400;line-height:1.5;padding:.375rem .75rem;transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out;width:100%}@media(prefers-reduced-motion:reduce){.form-control{transition:none}}.form-control[type=file]{overflow:hidden}.form-control[type=file]:not(:disabled):not([readonly]){cursor:pointer}.form-control:focus{background-color:var(--bs-body-bg);border-color:#86b7fe;box-shadow:0 0 0 .25rem rgba(13,110,253,.25);color:var(--bs-body-color);outline:0}.form-control::-webkit-date-and-time-value{height:1.5em;margin:0;min-width:85px}.form-control::-webkit-datetime-edit{display:block;padding:0}.form-control::placeholder{color:var(--bs-secondary-color);opacity:1}.form-control:disabled{background-color:var(--bs-secondary-bg);opacity:1}.form-control::file-selector-button{background-color:var(--bs-tertiary-bg);border:0 solid;border-color:inherit;border-inline-end-width:var(--bs-border-width);border-radius:0;color:var(--bs-body-color);margin:-.375rem -.75rem;margin-inline-end:.75rem;padding:.375rem .75rem;pointer-events:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion:reduce){.form-control::file-selector-button{transition:none}}.form-control:hover:not(:disabled):not([readonly])::file-selector-button{background-color:var(--bs-secondary-bg)}.form-control-plaintext{background-color:transparent;border:solid transparent;border-width:var(--bs-border-width) 0;color:var(--bs-body-color);display:block;line-height:1.5;margin-bottom:0;padding:.375rem 0;width:100%}.form-control-plaintext:focus{outline:0}.form-control-plaintext.form-control-lg,.form-control-plaintext.form-control-sm{padding-left:0;padding-right:0}.form-control-sm{border-radius:var(--bs-border-radius-sm);font-size:.875rem;min-height:calc(1.5em + .5rem + var(--bs-border-width)*2);padding:.25rem .5rem}.form-control-sm::file-selector-button{margin:-.25rem -.5rem;margin-inline-end:.5rem;padding:.25rem .5rem}.form-control-lg{border-radius:var(--bs-border-radius-lg);font-size:1.25rem;min-height:calc(1.5em + 1rem + var(--bs-border-width)*2);padding:.5rem 1rem}.form-control-lg::file-selector-button{margin:-.5rem -1rem;margin-inline-end:1rem;padding:.5rem 1rem}textarea.form-control{min-height:calc(1.5em + .75rem + var(--bs-border-width)*2)}textarea.form-control-sm{min-height:calc(1.5em + .5rem + var(--bs-border-width)*2)}textarea.form-control-lg{min-height:calc(1.5em + 1rem + var(--bs-border-width)*2)}.form-control-color{height:calc(1.5em + .75rem + var(--bs-border-width)*2);padding:.375rem;width:3rem}.form-control-color:not(:disabled):not([readonly]){cursor:pointer}.form-control-color::-moz-color-swatch{border:0!important;border-radius:var(--bs-border-radius)}.form-control-color::-webkit-color-swatch{border:0!important;border-radius:var(--bs-border-radius)}.form-control-color.form-control-sm{height:calc(1.5em + .5rem + var(--bs-border-width)*2)}.form-control-color.form-control-lg{height:calc(1.5em + 1rem + var(--bs-border-width)*2)}.form-select{--bs-form-select-bg-img:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3E%3Cpath fill='none' stroke='%23343a40' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/%3E%3C/svg%3E");appearance:none;background-color:var(--bs-body-bg);background-image:var(--bs-form-select-bg-img),var(--bs-form-select-bg-icon,none);background-position:right .75rem center;background-repeat:no-repeat;background-size:16px 12px;border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);color:var(--bs-body-color);display:block;font-size:1rem;font-weight:400;line-height:1.5;padding:.375rem 2.25rem .375rem .75rem;transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out;width:100%}@media(prefers-reduced-motion:reduce){.form-select{transition:none}}.form-select:focus{border-color:#86b7fe;box-shadow:0 0 0 .25rem rgba(13,110,253,.25);outline:0}.form-select[multiple],.form-select[size]:not([size="1"]){background-image:none;padding-right:.75rem}.form-select:disabled{background-color:var(--bs-secondary-bg)}.form-select:-moz-focusring{color:transparent;text-shadow:0 0 0 var(--bs-body-color)}.form-select-sm{border-radius:var(--bs-border-radius-sm);font-size:.875rem;padding-bottom:.25rem;padding-left:.5rem;padding-top:.25rem}.form-select-lg{border-radius:var(--bs-border-radius-lg);font-size:1.25rem;padding-bottom:.5rem;padding-left:1rem;padding-top:.5rem}[data-bs-theme=dark] .form-select{--bs-form-select-bg-img:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3E%3Cpath fill='none' stroke='%23dee2e6' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/%3E%3C/svg%3E")}.form-check{display:block;margin-bottom:.125rem;min-height:1.5rem;padding-left:1.5em}.form-check .form-check-input{float:left;margin-left:-1.5em}.form-check-reverse{padding-left:0;padding-right:1.5em;text-align:right}.form-check-reverse .form-check-input{float:right;margin-left:0;margin-right:-1.5em}.form-check-input{--bs-form-check-bg:var(--bs-body-bg);appearance:none;background-color:var(--bs-form-check-bg);background-image:var(--bs-form-check-bg-image);background-position:50%;background-repeat:no-repeat;background-size:contain;border:var(--bs-border-width) solid var(--bs-border-color);flex-shrink:0;height:1em;margin-top:.25em;print-color-adjust:exact;vertical-align:top;width:1em}.form-check-input[type=checkbox]{border-radius:.25em}.form-check-input[type=radio]{border-radius:50%}.form-check-input:active{filter:brightness(90%)}.form-check-input:focus{border-color:#86b7fe;box-shadow:0 0 0 .25rem rgba(13,110,253,.25);outline:0}.form-check-input:checked{background-color:#0d6efd;border-color:#0d6efd}.form-check-input:checked[type=checkbox]{--bs-form-check-bg-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3E%3Cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='m6 10 3 3 6-6'/%3E%3C/svg%3E")}.form-check-input:checked[type=radio]{--bs-form-check-bg-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3E%3Ccircle r='2' fill='%23fff'/%3E%3C/svg%3E")}.form-check-input[type=checkbox]:indeterminate{--bs-form-check-bg-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3E%3Cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10h8'/%3E%3C/svg%3E");background-color:#0d6efd;border-color:#0d6efd}.form-check-input:disabled{filter:none;opacity:.5;pointer-events:none}.form-check-input:disabled~.form-check-label,.form-check-input[disabled]~.form-check-label{cursor:default;opacity:.5}.form-switch{padding-left:2.5em}.form-switch .form-check-input{--bs-form-switch-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3E%3Ccircle r='3' fill='rgba(0, 0, 0, 0.25)'/%3E%3C/svg%3E");background-image:var(--bs-form-switch-bg);background-position:0;border-radius:2em;margin-left:-2.5em;transition:background-position .15s ease-in-out;width:2em}@media(prefers-reduced-motion:reduce){.form-switch .form-check-input{transition:none}}.form-switch .form-check-input:focus{--bs-form-switch-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3E%3Ccircle r='3' fill='%2386b7fe'/%3E%3C/svg%3E")}.form-switch .form-check-input:checked{--bs-form-switch-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3E%3Ccircle r='3' fill='%23fff'/%3E%3C/svg%3E");background-position:100%}.form-switch.form-check-reverse{padding-left:0;padding-right:2.5em}.form-switch.form-check-reverse .form-check-input{margin-left:0;margin-right:-2.5em}.form-check-inline{display:inline-block;margin-right:1rem}.btn-check{clip:rect(0,0,0,0);pointer-events:none;position:absolute}.btn-check:disabled+.btn,.btn-check[disabled]+.btn{filter:none;opacity:.65;pointer-events:none}[data-bs-theme=dark] .form-switch .form-check-input:not(:checked):not(:focus){--bs-form-switch-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3E%3Ccircle r='3' fill='rgba(255, 255, 255, 0.25)'/%3E%3C/svg%3E")}.form-range{appearance:none;background-color:transparent;height:1.5rem;padding:0;width:100%}.form-range:focus{outline:0}.form-range:focus::-webkit-slider-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.form-range:focus::-moz-range-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.form-range::-moz-focus-outer{border:0}.form-range::-webkit-slider-thumb{appearance:none;background-color:#0d6efd;border:0;border-radius:1rem;height:1rem;margin-top:-.25rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;width:1rem}@media(prefers-reduced-motion:reduce){.form-range::-webkit-slider-thumb{transition:none}}.form-range::-webkit-slider-thumb:active{background-color:#b6d4fe}.form-range::-webkit-slider-runnable-track{background-color:var(--bs-secondary-bg);border-color:transparent;border-radius:1rem;color:transparent;cursor:pointer;height:.5rem;width:100%}.form-range::-moz-range-thumb{appearance:none;background-color:#0d6efd;border:0;border-radius:1rem;height:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;width:1rem}@media(prefers-reduced-motion:reduce){.form-range::-moz-range-thumb{transition:none}}.form-range::-moz-range-thumb:active{background-color:#b6d4fe}.form-range::-moz-range-track{background-color:var(--bs-secondary-bg);border-color:transparent;border-radius:1rem;color:transparent;cursor:pointer;height:.5rem;width:100%}.form-range:disabled{pointer-events:none}.form-range:disabled::-webkit-slider-thumb{background-color:var(--bs-secondary-color)}.form-range:disabled::-moz-range-thumb{background-color:var(--bs-secondary-color)}.form-floating{position:relative}.form-floating>.form-control,.form-floating>.form-control-plaintext,.form-floating>.form-select{height:calc(3.5rem + var(--bs-border-width)*2);line-height:1.25;min-height:calc(3.5rem + var(--bs-border-width)*2)}.form-floating>label{border:var(--bs-border-width) solid transparent;height:100%;left:0;overflow:hidden;padding:1rem .75rem;pointer-events:none;position:absolute;text-align:start;text-overflow:ellipsis;top:0;transform-origin:0 0;transition:opacity .1s ease-in-out,transform .1s ease-in-out;white-space:nowrap;z-index:2}@media(prefers-reduced-motion:reduce){.form-floating>label{transition:none}}.form-floating>.form-control,.form-floating>.form-control-plaintext{padding:1rem .75rem}.form-floating>.form-control-plaintext::placeholder,.form-floating>.form-control::placeholder{color:transparent}.form-floating>.form-control-plaintext:focus,.form-floating>.form-control-plaintext:not(:placeholder-shown),.form-floating>.form-control:focus,.form-floating>.form-control:not(:placeholder-shown){padding-bottom:.625rem;padding-top:1.625rem}.form-floating>.form-control-plaintext:-webkit-autofill,.form-floating>.form-control:-webkit-autofill{padding-bottom:.625rem;padding-top:1.625rem}.form-floating>.form-select{padding-bottom:.625rem;padding-top:1.625rem}.form-floating>.form-control-plaintext~label,.form-floating>.form-control:focus~label,.form-floating>.form-control:not(:placeholder-shown)~label,.form-floating>.form-select~label{color:rgba(var(--bs-body-color-rgb),.65);transform:scale(.85) translateY(-.5rem) translateX(.15rem)}.form-floating>.form-control-plaintext~label:after,.form-floating>.form-control:focus~label:after,.form-floating>.form-control:not(:placeholder-shown)~label:after,.form-floating>.form-select~label:after{background-color:var(--bs-body-bg);border-radius:var(--bs-border-radius);content:"";height:1.5em;inset:1rem .375rem;position:absolute;z-index:-1}.form-floating>.form-control:-webkit-autofill~label{color:rgba(var(--bs-body-color-rgb),.65);transform:scale(.85) translateY(-.5rem) translateX(.15rem)}.form-floating>.form-control-plaintext~label{border-width:var(--bs-border-width) 0}.form-floating>.form-control:disabled~label,.form-floating>:disabled~label{color:#6c757d}.form-floating>.form-control:disabled~label:after,.form-floating>:disabled~label:after{background-color:var(--bs-secondary-bg)}.input-group{align-items:stretch;display:flex;flex-wrap:wrap;position:relative;width:100%}.input-group>.form-control,.input-group>.form-floating,.input-group>.form-select{flex:1 1 auto;min-width:0;position:relative;width:1%}.input-group>.form-control:focus,.input-group>.form-floating:focus-within,.input-group>.form-select:focus{z-index:5}.input-group .btn{position:relative;z-index:2}.input-group .btn:focus{z-index:5}.input-group-text{align-items:center;background-color:var(--bs-tertiary-bg);border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);color:var(--bs-body-color);display:flex;font-size:1rem;font-weight:400;line-height:1.5;padding:.375rem .75rem;text-align:center;white-space:nowrap}.input-group-lg>.btn,.input-group-lg>.form-control,.input-group-lg>.form-select,.input-group-lg>.input-group-text{border-radius:var(--bs-border-radius-lg);font-size:1.25rem;padding:.5rem 1rem}.input-group-sm>.btn,.input-group-sm>.form-control,.input-group-sm>.form-select,.input-group-sm>.input-group-text{border-radius:var(--bs-border-radius-sm);font-size:.875rem;padding:.25rem .5rem}.input-group-lg>.form-select,.input-group-sm>.form-select{padding-right:3rem}.input-group.has-validation>.dropdown-toggle:nth-last-child(n+4),.input-group.has-validation>.form-floating:nth-last-child(n+3)>.form-control,.input-group.has-validation>.form-floating:nth-last-child(n+3)>.form-select,.input-group.has-validation>:nth-last-child(n+3):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating),.input-group:not(.has-validation)>.dropdown-toggle:nth-last-child(n+3),.input-group:not(.has-validation)>.form-floating:not(:last-child)>.form-control,.input-group:not(.has-validation)>.form-floating:not(:last-child)>.form-select,.input-group:not(.has-validation)>:not(:last-child):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating){border-bottom-right-radius:0;border-top-right-radius:0}.input-group>:not(:first-child):not(.dropdown-menu):not(.valid-tooltip):not(.valid-feedback):not(.invalid-tooltip):not(.invalid-feedback){border-bottom-left-radius:0;border-top-left-radius:0;margin-left:calc(var(--bs-border-width)*-1)}.input-group>.form-floating:not(:first-child)>.form-control,.input-group>.form-floating:not(:first-child)>.form-select{border-bottom-left-radius:0;border-top-left-radius:0}.valid-feedback{color:var(--bs-form-valid-color);display:none;font-size:.875em;margin-top:.25rem;width:100%}.valid-tooltip{background-color:var(--bs-success);border-radius:var(--bs-border-radius);color:#fff;display:none;font-size:.875rem;margin-top:.1rem;max-width:100%;padding:.25rem .5rem;position:absolute;top:100%;z-index:5}.is-valid~.valid-feedback,.is-valid~.valid-tooltip,.was-validated :valid~.valid-feedback,.was-validated :valid~.valid-tooltip{display:block}.form-control.is-valid,.was-validated .form-control:valid{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3E%3Cpath fill='%23198754' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3E%3C/svg%3E");background-position:right calc(.375em + .1875rem) center;background-repeat:no-repeat;background-size:calc(.75em + .375rem) calc(.75em + .375rem);border-color:var(--bs-form-valid-border-color);padding-right:calc(1.5em + .75rem)}.form-control.is-valid:focus,.was-validated .form-control:valid:focus{border-color:var(--bs-form-valid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb),.25)}.was-validated textarea.form-control:valid,textarea.form-control.is-valid{background-position:top calc(.375em + .1875rem) right calc(.375em + .1875rem);padding-right:calc(1.5em + .75rem)}.form-select.is-valid,.was-validated .form-select:valid{border-color:var(--bs-form-valid-border-color)}.form-select.is-valid:not([multiple]):not([size]),.form-select.is-valid:not([multiple])[size="1"],.was-validated .form-select:valid:not([multiple]):not([size]),.was-validated .form-select:valid:not([multiple])[size="1"]{--bs-form-select-bg-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3E%3Cpath fill='%23198754' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3E%3C/svg%3E");background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(.75em + .375rem) calc(.75em + .375rem);padding-right:4.125rem}.form-select.is-valid:focus,.was-validated .form-select:valid:focus{border-color:var(--bs-form-valid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb),.25)}.form-control-color.is-valid,.was-validated .form-control-color:valid{width:calc(3.75rem + 1.5em)}.form-check-input.is-valid,.was-validated .form-check-input:valid{border-color:var(--bs-form-valid-border-color)}.form-check-input.is-valid:checked,.was-validated .form-check-input:valid:checked{background-color:var(--bs-form-valid-color)}.form-check-input.is-valid:focus,.was-validated .form-check-input:valid:focus{box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb),.25)}.form-check-input.is-valid~.form-check-label,.was-validated .form-check-input:valid~.form-check-label{color:var(--bs-form-valid-color)}.form-check-inline .form-check-input~.valid-feedback{margin-left:.5em}.input-group>.form-control:not(:focus).is-valid,.input-group>.form-floating:not(:focus-within).is-valid,.input-group>.form-select:not(:focus).is-valid,.was-validated .input-group>.form-control:not(:focus):valid,.was-validated .input-group>.form-floating:not(:focus-within):valid,.was-validated .input-group>.form-select:not(:focus):valid{z-index:3}.invalid-feedback{color:var(--bs-form-invalid-color);display:none;font-size:.875em;margin-top:.25rem;width:100%}.invalid-tooltip{background-color:var(--bs-danger);border-radius:var(--bs-border-radius);color:#fff;display:none;font-size:.875rem;margin-top:.1rem;max-width:100%;padding:.25rem .5rem;position:absolute;top:100%;z-index:5}.is-invalid~.invalid-feedback,.is-invalid~.invalid-tooltip,.was-validated :invalid~.invalid-feedback,.was-validated :invalid~.invalid-tooltip{display:block}.form-control.is-invalid,.was-validated .form-control:invalid{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' width='12' height='12' fill='none' stroke='%23dc3545'%3E%3Ccircle cx='6' cy='6' r='4.5'/%3E%3Cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3E%3Ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3E%3C/svg%3E");background-position:right calc(.375em + .1875rem) center;background-repeat:no-repeat;background-size:calc(.75em + .375rem) calc(.75em + .375rem);border-color:var(--bs-form-invalid-border-color);padding-right:calc(1.5em + .75rem)}.form-control.is-invalid:focus,.was-validated .form-control:invalid:focus{border-color:var(--bs-form-invalid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb),.25)}.was-validated textarea.form-control:invalid,textarea.form-control.is-invalid{background-position:top calc(.375em + .1875rem) right calc(.375em + .1875rem);padding-right:calc(1.5em + .75rem)}.form-select.is-invalid,.was-validated .form-select:invalid{border-color:var(--bs-form-invalid-border-color)}.form-select.is-invalid:not([multiple]):not([size]),.form-select.is-invalid:not([multiple])[size="1"],.was-validated .form-select:invalid:not([multiple]):not([size]),.was-validated .form-select:invalid:not([multiple])[size="1"]{--bs-form-select-bg-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' width='12' height='12' fill='none' stroke='%23dc3545'%3E%3Ccircle cx='6' cy='6' r='4.5'/%3E%3Cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3E%3Ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3E%3C/svg%3E");background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(.75em + .375rem) calc(.75em + .375rem);padding-right:4.125rem}.form-select.is-invalid:focus,.was-validated .form-select:invalid:focus{border-color:var(--bs-form-invalid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb),.25)}.form-control-color.is-invalid,.was-validated .form-control-color:invalid{width:calc(3.75rem + 1.5em)}.form-check-input.is-invalid,.was-validated .form-check-input:invalid{border-color:var(--bs-form-invalid-border-color)}.form-check-input.is-invalid:checked,.was-validated .form-check-input:invalid:checked{background-color:var(--bs-form-invalid-color)}.form-check-input.is-invalid:focus,.was-validated .form-check-input:invalid:focus{box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb),.25)}.form-check-input.is-invalid~.form-check-label,.was-validated .form-check-input:invalid~.form-check-label{color:var(--bs-form-invalid-color)}.form-check-inline .form-check-input~.invalid-feedback{margin-left:.5em}.input-group>.form-control:not(:focus).is-invalid,.input-group>.form-floating:not(:focus-within).is-invalid,.input-group>.form-select:not(:focus).is-invalid,.was-validated .input-group>.form-control:not(:focus):invalid,.was-validated .input-group>.form-floating:not(:focus-within):invalid,.was-validated .input-group>.form-select:not(:focus):invalid{z-index:4}.btn{--bs-btn-padding-x:0.75rem;--bs-btn-padding-y:0.375rem;--bs-btn-font-family: ;--bs-btn-font-size:1rem;--bs-btn-font-weight:400;--bs-btn-line-height:1.5;--bs-btn-color:var(--bs-body-color);--bs-btn-bg:transparent;--bs-btn-border-width:var(--bs-border-width);--bs-btn-border-color:transparent;--bs-btn-border-radius:var(--bs-border-radius);--bs-btn-hover-border-color:transparent;--bs-btn-box-shadow:inset 0 1px 0 hsla(0,0%,100%,.15),0 1px 1px rgba(0,0,0,.075);--bs-btn-disabled-opacity:0.65;--bs-btn-focus-box-shadow:0 0 0 0.25rem rgba(var(--bs-btn-focus-shadow-rgb),.5);background-color:var(--bs-btn-bg);border:var(--bs-btn-border-width) solid var(--bs-btn-border-color);border-radius:var(--bs-btn-border-radius);color:var(--bs-btn-color);cursor:pointer;display:inline-block;font-family:var(--bs-btn-font-family);font-size:var(--bs-btn-font-size);font-weight:var(--bs-btn-font-weight);line-height:var(--bs-btn-line-height);padding:var(--bs-btn-padding-y) var(--bs-btn-padding-x);text-align:center;text-decoration:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;user-select:none;vertical-align:middle}@media(prefers-reduced-motion:reduce){.btn{transition:none}}.btn:hover{background-color:var(--bs-btn-hover-bg);border-color:var(--bs-btn-hover-border-color);color:var(--bs-btn-hover-color)}.btn-check+.btn:hover{background-color:var(--bs-btn-bg);border-color:var(--bs-btn-border-color);color:var(--bs-btn-color)}.btn:focus-visible{background-color:var(--bs-btn-hover-bg);border-color:var(--bs-btn-hover-border-color);box-shadow:var(--bs-btn-focus-box-shadow);color:var(--bs-btn-hover-color);outline:0}.btn-check:focus-visible+.btn{border-color:var(--bs-btn-hover-border-color);box-shadow:var(--bs-btn-focus-box-shadow);outline:0}.btn-check:checked+.btn,.btn.active,.btn.show,.btn:first-child:active,:not(.btn-check)+.btn:active{background-color:var(--bs-btn-active-bg);border-color:var(--bs-btn-active-border-color);color:var(--bs-btn-active-color)}.btn-check:checked+.btn:focus-visible,.btn.active:focus-visible,.btn.show:focus-visible,.btn:first-child:active:focus-visible,:not(.btn-check)+.btn:active:focus-visible{box-shadow:var(--bs-btn-focus-box-shadow)}.btn.disabled,.btn:disabled,fieldset:disabled .btn{background-color:var(--bs-btn-disabled-bg);border-color:var(--bs-btn-disabled-border-color);color:var(--bs-btn-disabled-color);opacity:var(--bs-btn-disabled-opacity);pointer-events:none}.btn-primary{--bs-btn-color:#fff;--bs-btn-bg:#0d6efd;--bs-btn-border-color:#0d6efd;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#0b5ed7;--bs-btn-hover-border-color:#0a58ca;--bs-btn-focus-shadow-rgb:49,132,253;--bs-btn-active-color:#fff;--bs-btn-active-bg:#0a58ca;--bs-btn-active-border-color:#0a53be;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#fff;--bs-btn-disabled-bg:#0d6efd;--bs-btn-disabled-border-color:#0d6efd}.btn-secondary{--bs-btn-color:#fff;--bs-btn-bg:#6c757d;--bs-btn-border-color:#6c757d;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#5c636a;--bs-btn-hover-border-color:#565e64;--bs-btn-focus-shadow-rgb:130,138,145;--bs-btn-active-color:#fff;--bs-btn-active-bg:#565e64;--bs-btn-active-border-color:#51585e;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#fff;--bs-btn-disabled-bg:#6c757d;--bs-btn-disabled-border-color:#6c757d}.btn-success{--bs-btn-color:#fff;--bs-btn-bg:#198754;--bs-btn-border-color:#198754;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#157347;--bs-btn-hover-border-color:#146c43;--bs-btn-focus-shadow-rgb:60,153,110;--bs-btn-active-color:#fff;--bs-btn-active-bg:#146c43;--bs-btn-active-border-color:#13653f;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#fff;--bs-btn-disabled-bg:#198754;--bs-btn-disabled-border-color:#198754}.btn-info{--bs-btn-color:#000;--bs-btn-bg:#0dcaf0;--bs-btn-border-color:#0dcaf0;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#31d2f2;--bs-btn-hover-border-color:#25cff2;--bs-btn-focus-shadow-rgb:11,172,204;--bs-btn-active-color:#000;--bs-btn-active-bg:#3dd5f3;--bs-btn-active-border-color:#25cff2;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#000;--bs-btn-disabled-bg:#0dcaf0;--bs-btn-disabled-border-color:#0dcaf0}.btn-warning{--bs-btn-color:#000;--bs-btn-bg:#ffc107;--bs-btn-border-color:#ffc107;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#ffca2c;--bs-btn-hover-border-color:#ffc720;--bs-btn-focus-shadow-rgb:217,164,6;--bs-btn-active-color:#000;--bs-btn-active-bg:#ffcd39;--bs-btn-active-border-color:#ffc720;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#000;--bs-btn-disabled-bg:#ffc107;--bs-btn-disabled-border-color:#ffc107}.btn-danger{--bs-btn-color:#fff;--bs-btn-bg:#dc3545;--bs-btn-border-color:#dc3545;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#bb2d3b;--bs-btn-hover-border-color:#b02a37;--bs-btn-focus-shadow-rgb:225,83,97;--bs-btn-active-color:#fff;--bs-btn-active-bg:#b02a37;--bs-btn-active-border-color:#a52834;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#fff;--bs-btn-disabled-bg:#dc3545;--bs-btn-disabled-border-color:#dc3545}.btn-light{--bs-btn-color:#000;--bs-btn-bg:#f8f9fa;--bs-btn-border-color:#f8f9fa;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#d3d4d5;--bs-btn-hover-border-color:#c6c7c8;--bs-btn-focus-shadow-rgb:211,212,213;--bs-btn-active-color:#000;--bs-btn-active-bg:#c6c7c8;--bs-btn-active-border-color:#babbbc;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#000;--bs-btn-disabled-bg:#f8f9fa;--bs-btn-disabled-border-color:#f8f9fa}.btn-dark{--bs-btn-color:#fff;--bs-btn-bg:#212529;--bs-btn-border-color:#212529;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#424649;--bs-btn-hover-border-color:#373b3e;--bs-btn-focus-shadow-rgb:66,70,73;--bs-btn-active-color:#fff;--bs-btn-active-bg:#4d5154;--bs-btn-active-border-color:#373b3e;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#fff;--bs-btn-disabled-bg:#212529;--bs-btn-disabled-border-color:#212529}.btn-outline-primary{--bs-btn-color:#0d6efd;--bs-btn-border-color:#0d6efd;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#0d6efd;--bs-btn-hover-border-color:#0d6efd;--bs-btn-focus-shadow-rgb:13,110,253;--bs-btn-active-color:#fff;--bs-btn-active-bg:#0d6efd;--bs-btn-active-border-color:#0d6efd;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#0d6efd;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#0d6efd;--bs-gradient:none}.btn-outline-secondary{--bs-btn-color:#6c757d;--bs-btn-border-color:#6c757d;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#6c757d;--bs-btn-hover-border-color:#6c757d;--bs-btn-focus-shadow-rgb:108,117,125;--bs-btn-active-color:#fff;--bs-btn-active-bg:#6c757d;--bs-btn-active-border-color:#6c757d;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#6c757d;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#6c757d;--bs-gradient:none}.btn-outline-success{--bs-btn-color:#198754;--bs-btn-border-color:#198754;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#198754;--bs-btn-hover-border-color:#198754;--bs-btn-focus-shadow-rgb:25,135,84;--bs-btn-active-color:#fff;--bs-btn-active-bg:#198754;--bs-btn-active-border-color:#198754;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#198754;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#198754;--bs-gradient:none}.btn-outline-info{--bs-btn-color:#0dcaf0;--bs-btn-border-color:#0dcaf0;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#0dcaf0;--bs-btn-hover-border-color:#0dcaf0;--bs-btn-focus-shadow-rgb:13,202,240;--bs-btn-active-color:#000;--bs-btn-active-bg:#0dcaf0;--bs-btn-active-border-color:#0dcaf0;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#0dcaf0;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#0dcaf0;--bs-gradient:none}.btn-outline-warning{--bs-btn-color:#ffc107;--bs-btn-border-color:#ffc107;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#ffc107;--bs-btn-hover-border-color:#ffc107;--bs-btn-focus-shadow-rgb:255,193,7;--bs-btn-active-color:#000;--bs-btn-active-bg:#ffc107;--bs-btn-active-border-color:#ffc107;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#ffc107;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#ffc107;--bs-gradient:none}.btn-outline-danger{--bs-btn-color:#dc3545;--bs-btn-border-color:#dc3545;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#dc3545;--bs-btn-hover-border-color:#dc3545;--bs-btn-focus-shadow-rgb:220,53,69;--bs-btn-active-color:#fff;--bs-btn-active-bg:#dc3545;--bs-btn-active-border-color:#dc3545;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#dc3545;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#dc3545;--bs-gradient:none}.btn-outline-light{--bs-btn-color:#f8f9fa;--bs-btn-border-color:#f8f9fa;--bs-btn-hover-color:#000;--bs-btn-hover-bg:#f8f9fa;--bs-btn-hover-border-color:#f8f9fa;--bs-btn-focus-shadow-rgb:248,249,250;--bs-btn-active-color:#000;--bs-btn-active-bg:#f8f9fa;--bs-btn-active-border-color:#f8f9fa;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#f8f9fa;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#f8f9fa;--bs-gradient:none}.btn-outline-dark{--bs-btn-color:#212529;--bs-btn-border-color:#212529;--bs-btn-hover-color:#fff;--bs-btn-hover-bg:#212529;--bs-btn-hover-border-color:#212529;--bs-btn-focus-shadow-rgb:33,37,41;--bs-btn-active-color:#fff;--bs-btn-active-bg:#212529;--bs-btn-active-border-color:#212529;--bs-btn-active-shadow:inset 0 3px 5px rgba(0,0,0,.125);--bs-btn-disabled-color:#212529;--bs-btn-disabled-bg:transparent;--bs-btn-disabled-border-color:#212529;--bs-gradient:none}.btn-link{--bs-btn-font-weight:400;--bs-btn-color:var(--bs-link-color);--bs-btn-bg:transparent;--bs-btn-border-color:transparent;--bs-btn-hover-color:var(--bs-link-hover-color);--bs-btn-hover-border-color:transparent;--bs-btn-active-color:var(--bs-link-hover-color);--bs-btn-active-border-color:transparent;--bs-btn-disabled-color:#6c757d;--bs-btn-disabled-border-color:transparent;--bs-btn-box-shadow:0 0 0 #000;--bs-btn-focus-shadow-rgb:49,132,253;text-decoration:underline}.btn-link:focus-visible{color:var(--bs-btn-color)}.btn-link:hover{color:var(--bs-btn-hover-color)}.btn-group-lg>.btn,.btn-lg{--bs-btn-padding-y:0.5rem;--bs-btn-padding-x:1rem;--bs-btn-font-size:1.25rem;--bs-btn-border-radius:var(--bs-border-radius-lg)}.btn-group-sm>.btn,.btn-sm{--bs-btn-padding-y:0.25rem;--bs-btn-padding-x:0.5rem;--bs-btn-font-size:0.875rem;--bs-btn-border-radius:var(--bs-border-radius-sm)}.fade{transition:opacity .15s linear}@media(prefers-reduced-motion:reduce){.fade{transition:none}}.fade:not(.show){opacity:0}.collapse:not(.show){display:none}.collapsing{height:0;overflow:hidden;transition:height .35s ease}@media(prefers-reduced-motion:reduce){.collapsing{transition:none}}.collapsing.collapse-horizontal{height:auto;transition:width .35s ease;width:0}@media(prefers-reduced-motion:reduce){.collapsing.collapse-horizontal{transition:none}}.dropdown,.dropdown-center,.dropend,.dropstart,.dropup,.dropup-center{position:relative}.dropdown-toggle{white-space:nowrap}.dropdown-toggle:after{border-bottom:0;border-left:.3em solid transparent;border-right:.3em solid transparent;border-top:.3em solid;content:"";display:inline-block;margin-left:.255em;vertical-align:.255em}.dropdown-toggle:empty:after{margin-left:0}.dropdown-menu{--bs-dropdown-zindex:1000;--bs-dropdown-min-width:10rem;--bs-dropdown-padding-x:0;--bs-dropdown-padding-y:0.5rem;--bs-dropdown-spacer:0.125rem;--bs-dropdown-font-size:1rem;--bs-dropdown-color:var(--bs-body-color);--bs-dropdown-bg:var(--bs-body-bg);--bs-dropdown-border-color:var(--bs-border-color-translucent);--bs-dropdown-border-radius:var(--bs-border-radius);--bs-dropdown-border-width:var(--bs-border-width);--bs-dropdown-inner-border-radius:calc(var(--bs-border-radius) - var(--bs-border-width));--bs-dropdown-divider-bg:var(--bs-border-color-translucent);--bs-dropdown-divider-margin-y:0.5rem;--bs-dropdown-box-shadow:var(--bs-box-shadow);--bs-dropdown-link-color:var(--bs-body-color);--bs-dropdown-link-hover-color:var(--bs-body-color);--bs-dropdown-link-hover-bg:var(--pst-color-surface);--bs-dropdown-link-active-color:#fff;--bs-dropdown-link-active-bg:var(--pst-color-surface);--bs-dropdown-link-disabled-color:var(--bs-tertiary-color);--bs-dropdown-item-padding-x:1rem;--bs-dropdown-item-padding-y:0.25rem;--bs-dropdown-header-color:#6c757d;--bs-dropdown-header-padding-x:1rem;--bs-dropdown-header-padding-y:0.5rem;background-clip:padding-box;background-color:var(--bs-dropdown-bg);border:var(--bs-dropdown-border-width) solid var(--bs-dropdown-border-color);border-radius:var(--bs-dropdown-border-radius);color:var(--bs-dropdown-color);display:none;font-size:var(--bs-dropdown-font-size);list-style:none;margin:0;min-width:var(--bs-dropdown-min-width);padding:var(--bs-dropdown-padding-y) var(--bs-dropdown-padding-x);position:absolute;text-align:left;z-index:var(--bs-dropdown-zindex)}.dropdown-menu[data-bs-popper]{left:0;margin-top:var(--bs-dropdown-spacer);top:100%}.dropdown-menu-start{--bs-position:start}.dropdown-menu-start[data-bs-popper]{left:0;right:auto}.dropdown-menu-end{--bs-position:end}.dropdown-menu-end[data-bs-popper]{left:auto;right:0}@media(min-width:540px){.dropdown-menu-sm-start{--bs-position:start}.dropdown-menu-sm-start[data-bs-popper]{left:0;right:auto}.dropdown-menu-sm-end{--bs-position:end}.dropdown-menu-sm-end[data-bs-popper]{left:auto;right:0}}@media(min-width:720px){.dropdown-menu-md-start{--bs-position:start}.dropdown-menu-md-start[data-bs-popper]{left:0;right:auto}.dropdown-menu-md-end{--bs-position:end}.dropdown-menu-md-end[data-bs-popper]{left:auto;right:0}}@media(min-width:960px){.dropdown-menu-lg-start{--bs-position:start}.dropdown-menu-lg-start[data-bs-popper]{left:0;right:auto}.dropdown-menu-lg-end{--bs-position:end}.dropdown-menu-lg-end[data-bs-popper]{left:auto;right:0}}@media(min-width:1200px){.dropdown-menu-xl-start{--bs-position:start}.dropdown-menu-xl-start[data-bs-popper]{left:0;right:auto}.dropdown-menu-xl-end{--bs-position:end}.dropdown-menu-xl-end[data-bs-popper]{left:auto;right:0}}.dropup .dropdown-menu[data-bs-popper]{bottom:100%;margin-bottom:var(--bs-dropdown-spacer);margin-top:0;top:auto}.dropup .dropdown-toggle:after{border-bottom:.3em solid;border-left:.3em solid transparent;border-right:.3em solid transparent;border-top:0;content:"";display:inline-block;margin-left:.255em;vertical-align:.255em}.dropup .dropdown-toggle:empty:after{margin-left:0}.dropend .dropdown-menu[data-bs-popper]{left:100%;margin-left:var(--bs-dropdown-spacer);margin-top:0;right:auto;top:0}.dropend .dropdown-toggle:after{border-bottom:.3em solid transparent;border-left:.3em solid;border-right:0;border-top:.3em solid transparent;content:"";display:inline-block;margin-left:.255em;vertical-align:.255em}.dropend .dropdown-toggle:empty:after{margin-left:0}.dropend .dropdown-toggle:after{vertical-align:0}.dropstart .dropdown-menu[data-bs-popper]{left:auto;margin-right:var(--bs-dropdown-spacer);margin-top:0;right:100%;top:0}.dropstart .dropdown-toggle:after{content:"";display:inline-block;display:none;margin-left:.255em;vertical-align:.255em}.dropstart .dropdown-toggle:before{border-bottom:.3em solid transparent;border-right:.3em solid;border-top:.3em solid transparent;content:"";display:inline-block;margin-right:.255em;vertical-align:.255em}.dropstart .dropdown-toggle:empty:after{margin-left:0}.dropstart .dropdown-toggle:before{vertical-align:0}.dropdown-divider{border-top:1px solid var(--bs-dropdown-divider-bg);height:0;margin:var(--bs-dropdown-divider-margin-y) 0;opacity:1;overflow:hidden}.dropdown-item{background-color:transparent;border:0;border-radius:var(--bs-dropdown-item-border-radius,0);clear:both;color:var(--bs-dropdown-link-color);display:block;font-weight:400;padding:var(--bs-dropdown-item-padding-y) var(--bs-dropdown-item-padding-x);text-align:inherit;text-decoration:none;white-space:nowrap;width:100%}.dropdown-item:focus,.dropdown-item:hover{background-color:var(--bs-dropdown-link-hover-bg);color:var(--bs-dropdown-link-hover-color)}.dropdown-item.active,.dropdown-item:active{background-color:var(--bs-dropdown-link-active-bg);color:var(--bs-dropdown-link-active-color);text-decoration:none}.dropdown-item.disabled,.dropdown-item:disabled{background-color:transparent;color:var(--bs-dropdown-link-disabled-color);pointer-events:none}.dropdown-menu.show{display:block}.dropdown-header{color:var(--bs-dropdown-header-color);display:block;font-size:.875rem;margin-bottom:0;padding:var(--bs-dropdown-header-padding-y) var(--bs-dropdown-header-padding-x);white-space:nowrap}.dropdown-item-text{color:var(--bs-dropdown-link-color);display:block;padding:var(--bs-dropdown-item-padding-y) var(--bs-dropdown-item-padding-x)}.dropdown-menu-dark{--bs-dropdown-color:#dee2e6;--bs-dropdown-bg:#343a40;--bs-dropdown-border-color:var(--bs-border-color-translucent);--bs-dropdown-box-shadow: ;--bs-dropdown-link-color:#dee2e6;--bs-dropdown-link-hover-color:#fff;--bs-dropdown-divider-bg:var(--bs-border-color-translucent);--bs-dropdown-link-hover-bg:var(--pst-color-surface);--bs-dropdown-link-active-color:#fff;--bs-dropdown-link-active-bg:var(--pst-color-surface);--bs-dropdown-link-disabled-color:#adb5bd;--bs-dropdown-header-color:#adb5bd}.btn-group,.btn-group-vertical{display:inline-flex;position:relative;vertical-align:middle}.btn-group-vertical>.btn,.btn-group>.btn{flex:1 1 auto;position:relative}.btn-group-vertical>.btn-check:checked+.btn,.btn-group-vertical>.btn-check:focus+.btn,.btn-group-vertical>.btn.active,.btn-group-vertical>.btn:active,.btn-group-vertical>.btn:focus,.btn-group-vertical>.btn:hover,.btn-group>.btn-check:checked+.btn,.btn-group>.btn-check:focus+.btn,.btn-group>.btn.active,.btn-group>.btn:active,.btn-group>.btn:focus,.btn-group>.btn:hover{z-index:1}.btn-toolbar{display:flex;flex-wrap:wrap;justify-content:flex-start}.btn-toolbar .input-group{width:auto}.btn-group{border-radius:var(--bs-border-radius)}.btn-group>.btn-group:not(:first-child),.btn-group>:not(.btn-check:first-child)+.btn{margin-left:calc(var(--bs-border-width)*-1)}.btn-group>.btn-group:not(:last-child)>.btn,.btn-group>.btn.dropdown-toggle-split:first-child,.btn-group>.btn:not(:last-child):not(.dropdown-toggle){border-bottom-right-radius:0;border-top-right-radius:0}.btn-group>.btn-group:not(:first-child)>.btn,.btn-group>.btn:nth-child(n+3),.btn-group>:not(.btn-check)+.btn{border-bottom-left-radius:0;border-top-left-radius:0}.dropdown-toggle-split{padding-left:.5625rem;padding-right:.5625rem}.dropdown-toggle-split:after,.dropend .dropdown-toggle-split:after,.dropup .dropdown-toggle-split:after{margin-left:0}.dropstart .dropdown-toggle-split:before{margin-right:0}.btn-group-sm>.btn+.dropdown-toggle-split,.btn-sm+.dropdown-toggle-split{padding-left:.375rem;padding-right:.375rem}.btn-group-lg>.btn+.dropdown-toggle-split,.btn-lg+.dropdown-toggle-split{padding-left:.75rem;padding-right:.75rem}.btn-group-vertical{align-items:flex-start;flex-direction:column;justify-content:center}.btn-group-vertical>.btn,.btn-group-vertical>.btn-group{width:100%}.btn-group-vertical>.btn-group:not(:first-child),.btn-group-vertical>.btn:not(:first-child){margin-top:calc(var(--bs-border-width)*-1)}.btn-group-vertical>.btn-group:not(:last-child)>.btn,.btn-group-vertical>.btn:not(:last-child):not(.dropdown-toggle){border-bottom-left-radius:0;border-bottom-right-radius:0}.btn-group-vertical>.btn-group:not(:first-child)>.btn,.btn-group-vertical>.btn~.btn{border-top-left-radius:0;border-top-right-radius:0}.nav{--bs-nav-link-padding-x:1rem;--bs-nav-link-padding-y:0.5rem;--bs-nav-link-font-weight: ;--bs-nav-link-color:var(--bs-link-color);--bs-nav-link-hover-color:var(--bs-link-hover-color);--bs-nav-link-disabled-color:var(--bs-secondary-color);display:flex;flex-wrap:wrap;list-style:none;margin-bottom:0;padding-left:0}.nav-link{background:none;border:0;color:var(--bs-nav-link-color);display:block;font-size:var(--bs-nav-link-font-size);font-weight:var(--bs-nav-link-font-weight);padding:var(--bs-nav-link-padding-y) var(--bs-nav-link-padding-x);text-decoration:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out}@media(prefers-reduced-motion:reduce){.nav-link{transition:none}}.nav-link:focus,.nav-link:hover{color:var(--bs-nav-link-hover-color)}.nav-link:focus-visible{box-shadow:0 0 0 .25rem rgba(13,110,253,.25);outline:0}.nav-link.disabled,.nav-link:disabled{color:var(--bs-nav-link-disabled-color);cursor:default;pointer-events:none}.nav-tabs{--bs-nav-tabs-border-width:var(--bs-border-width);--bs-nav-tabs-border-color:var(--bs-border-color);--bs-nav-tabs-border-radius:var(--bs-border-radius);--bs-nav-tabs-link-hover-border-color:var(--bs-secondary-bg) var(--bs-secondary-bg) var(--bs-border-color);--bs-nav-tabs-link-active-color:var(--bs-emphasis-color);--bs-nav-tabs-link-active-bg:var(--bs-body-bg);--bs-nav-tabs-link-active-border-color:var(--bs-border-color) var(--bs-border-color) var(--bs-body-bg);border-bottom:var(--bs-nav-tabs-border-width) solid var(--bs-nav-tabs-border-color)}.nav-tabs .nav-link{border:var(--bs-nav-tabs-border-width) solid transparent;border-top-left-radius:var(--bs-nav-tabs-border-radius);border-top-right-radius:var(--bs-nav-tabs-border-radius);margin-bottom:calc(var(--bs-nav-tabs-border-width)*-1)}.nav-tabs .nav-link:focus,.nav-tabs .nav-link:hover{border-color:var(--bs-nav-tabs-link-hover-border-color);isolation:isolate}.nav-tabs .nav-item.show .nav-link,.nav-tabs .nav-link.active{background-color:var(--bs-nav-tabs-link-active-bg);border-color:var(--bs-nav-tabs-link-active-border-color);color:var(--bs-nav-tabs-link-active-color)}.nav-tabs .dropdown-menu{border-top-left-radius:0;border-top-right-radius:0;margin-top:calc(var(--bs-nav-tabs-border-width)*-1)}.nav-pills{--bs-nav-pills-border-radius:var(--bs-border-radius);--bs-nav-pills-link-active-color:#fff;--bs-nav-pills-link-active-bg:#0d6efd}.nav-pills .nav-link{border-radius:var(--bs-nav-pills-border-radius)}.nav-pills .nav-link.active,.nav-pills .show>.nav-link{background-color:var(--bs-nav-pills-link-active-bg);color:var(--bs-nav-pills-link-active-color)}.nav-underline{--bs-nav-underline-gap:1rem;--bs-nav-underline-border-width:0.125rem;--bs-nav-underline-link-active-color:var(--bs-emphasis-color);gap:var(--bs-nav-underline-gap)}.nav-underline .nav-link{border-bottom:var(--bs-nav-underline-border-width) solid transparent;padding-left:0;padding-right:0}.nav-underline .nav-link:focus,.nav-underline .nav-link:hover{border-bottom-color:currentcolor}.nav-underline .nav-link.active,.nav-underline .show>.nav-link{border-bottom-color:currentcolor;color:var(--bs-nav-underline-link-active-color);font-weight:700}.nav-fill .nav-item,.nav-fill>.nav-link{flex:1 1 auto;text-align:center}.nav-justified .nav-item,.nav-justified>.nav-link{flex-basis:0;flex-grow:1;text-align:center}.nav-fill .nav-item .nav-link,.nav-justified .nav-item .nav-link{width:100%}.tab-content>.tab-pane{display:none}.tab-content>.active{display:block}.navbar{--bs-navbar-padding-x:0;--bs-navbar-padding-y:0.5rem;--bs-navbar-color:rgba(var(--bs-emphasis-color-rgb),0.65);--bs-navbar-hover-color:rgba(var(--bs-emphasis-color-rgb),0.8);--bs-navbar-disabled-color:rgba(var(--bs-emphasis-color-rgb),0.3);--bs-navbar-active-color:rgba(var(--bs-emphasis-color-rgb),1);--bs-navbar-brand-padding-y:0.3125rem;--bs-navbar-brand-margin-end:1rem;--bs-navbar-brand-font-size:1.25rem;--bs-navbar-brand-color:rgba(var(--bs-emphasis-color-rgb),1);--bs-navbar-brand-hover-color:rgba(var(--bs-emphasis-color-rgb),1);--bs-navbar-nav-link-padding-x:0.5rem;--bs-navbar-toggler-padding-y:0.25rem;--bs-navbar-toggler-padding-x:0.75rem;--bs-navbar-toggler-font-size:1.25rem;--bs-navbar-toggler-icon-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'%3E%3Cpath stroke='rgba(33, 37, 41, 0.75)' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/%3E%3C/svg%3E");--bs-navbar-toggler-border-color:rgba(var(--bs-emphasis-color-rgb),0.15);--bs-navbar-toggler-border-radius:var(--bs-border-radius);--bs-navbar-toggler-focus-width:0.25rem;--bs-navbar-toggler-transition:box-shadow 0.15s ease-in-out;align-items:center;display:flex;flex-wrap:wrap;justify-content:space-between;padding:var(--bs-navbar-padding-y) var(--bs-navbar-padding-x);position:relative}.navbar>.container,.navbar>.container-fluid,.navbar>.container-lg,.navbar>.container-md,.navbar>.container-sm,.navbar>.container-xl{align-items:center;display:flex;flex-wrap:inherit;justify-content:space-between}.navbar-brand{color:var(--bs-navbar-brand-color);font-size:var(--bs-navbar-brand-font-size);margin-right:var(--bs-navbar-brand-margin-end);padding-bottom:var(--bs-navbar-brand-padding-y);padding-top:var(--bs-navbar-brand-padding-y);text-decoration:none;white-space:nowrap}.navbar-brand:focus,.navbar-brand:hover{color:var(--bs-navbar-brand-hover-color)}.navbar-nav{--bs-nav-link-padding-x:0;--bs-nav-link-padding-y:0.5rem;--bs-nav-link-font-weight: ;--bs-nav-link-color:var(--bs-navbar-color);--bs-nav-link-hover-color:var(--bs-navbar-hover-color);--bs-nav-link-disabled-color:var(--bs-navbar-disabled-color);display:flex;flex-direction:column;list-style:none;margin-bottom:0;padding-left:0}.navbar-nav .nav-link.active,.navbar-nav .nav-link.show{color:var(--bs-navbar-active-color)}.navbar-nav .dropdown-menu{position:static}.navbar-text{color:var(--bs-navbar-color);padding-bottom:.5rem;padding-top:.5rem}.navbar-text a,.navbar-text a:focus,.navbar-text a:hover{color:var(--bs-navbar-active-color)}.navbar-collapse{align-items:center;flex-basis:100%;flex-grow:1}.navbar-toggler{background-color:transparent;border:var(--bs-border-width) solid var(--bs-navbar-toggler-border-color);border-radius:var(--bs-navbar-toggler-border-radius);color:var(--bs-navbar-color);font-size:var(--bs-navbar-toggler-font-size);line-height:1;padding:var(--bs-navbar-toggler-padding-y) var(--bs-navbar-toggler-padding-x);transition:var(--bs-navbar-toggler-transition)}@media(prefers-reduced-motion:reduce){.navbar-toggler{transition:none}}.navbar-toggler:hover{text-decoration:none}.navbar-toggler:focus{box-shadow:0 0 0 var(--bs-navbar-toggler-focus-width);outline:0;text-decoration:none}.navbar-toggler-icon{background-image:var(--bs-navbar-toggler-icon-bg);background-position:50%;background-repeat:no-repeat;background-size:100%;display:inline-block;height:1.5em;vertical-align:middle;width:1.5em}.navbar-nav-scroll{max-height:var(--bs-scroll-height,75vh);overflow-y:auto}@media(min-width:540px){.navbar-expand-sm{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-sm .navbar-nav{flex-direction:row}.navbar-expand-sm .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-sm .navbar-nav .nav-link{padding-left:var(--bs-navbar-nav-link-padding-x);padding-right:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-sm .navbar-nav-scroll{overflow:visible}.navbar-expand-sm .navbar-collapse{display:flex!important;flex-basis:auto}.navbar-expand-sm .navbar-toggler{display:none}.navbar-expand-sm .offcanvas{background-color:transparent!important;border:0!important;flex-grow:1;height:auto!important;position:static;transform:none!important;transition:none;visibility:visible!important;width:auto!important;z-index:auto}.navbar-expand-sm .offcanvas .offcanvas-header{display:none}.navbar-expand-sm .offcanvas .offcanvas-body{display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(min-width:720px){.navbar-expand-md{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-md .navbar-nav{flex-direction:row}.navbar-expand-md .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-md .navbar-nav .nav-link{padding-left:var(--bs-navbar-nav-link-padding-x);padding-right:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-md .navbar-nav-scroll{overflow:visible}.navbar-expand-md .navbar-collapse{display:flex!important;flex-basis:auto}.navbar-expand-md .navbar-toggler{display:none}.navbar-expand-md .offcanvas{background-color:transparent!important;border:0!important;flex-grow:1;height:auto!important;position:static;transform:none!important;transition:none;visibility:visible!important;width:auto!important;z-index:auto}.navbar-expand-md .offcanvas .offcanvas-header{display:none}.navbar-expand-md .offcanvas .offcanvas-body{display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(min-width:960px){.navbar-expand-lg{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-lg .navbar-nav{flex-direction:row}.navbar-expand-lg .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-lg .navbar-nav .nav-link{padding-left:var(--bs-navbar-nav-link-padding-x);padding-right:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-lg .navbar-nav-scroll{overflow:visible}.navbar-expand-lg .navbar-collapse{display:flex!important;flex-basis:auto}.navbar-expand-lg .navbar-toggler{display:none}.navbar-expand-lg .offcanvas{background-color:transparent!important;border:0!important;flex-grow:1;height:auto!important;position:static;transform:none!important;transition:none;visibility:visible!important;width:auto!important;z-index:auto}.navbar-expand-lg .offcanvas .offcanvas-header{display:none}.navbar-expand-lg .offcanvas .offcanvas-body{display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(min-width:1200px){.navbar-expand-xl{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-xl .navbar-nav{flex-direction:row}.navbar-expand-xl .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-xl .navbar-nav .nav-link{padding-left:var(--bs-navbar-nav-link-padding-x);padding-right:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-xl .navbar-nav-scroll{overflow:visible}.navbar-expand-xl .navbar-collapse{display:flex!important;flex-basis:auto}.navbar-expand-xl .navbar-toggler{display:none}.navbar-expand-xl .offcanvas{background-color:transparent!important;border:0!important;flex-grow:1;height:auto!important;position:static;transform:none!important;transition:none;visibility:visible!important;width:auto!important;z-index:auto}.navbar-expand-xl .offcanvas .offcanvas-header{display:none}.navbar-expand-xl .offcanvas .offcanvas-body{display:flex;flex-grow:0;overflow-y:visible;padding:0}}.navbar-expand{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand .navbar-nav{flex-direction:row}.navbar-expand .navbar-nav .dropdown-menu{position:absolute}.navbar-expand .navbar-nav .nav-link{padding-left:var(--bs-navbar-nav-link-padding-x);padding-right:var(--bs-navbar-nav-link-padding-x)}.navbar-expand .navbar-nav-scroll{overflow:visible}.navbar-expand .navbar-collapse{display:flex!important;flex-basis:auto}.navbar-expand .navbar-toggler{display:none}.navbar-expand .offcanvas{background-color:transparent!important;border:0!important;flex-grow:1;height:auto!important;position:static;transform:none!important;transition:none;visibility:visible!important;width:auto!important;z-index:auto}.navbar-expand .offcanvas .offcanvas-header{display:none}.navbar-expand .offcanvas .offcanvas-body{display:flex;flex-grow:0;overflow-y:visible;padding:0}.navbar-dark,.navbar[data-bs-theme=dark]{--bs-navbar-color:hsla(0,0%,100%,.55);--bs-navbar-hover-color:hsla(0,0%,100%,.75);--bs-navbar-disabled-color:hsla(0,0%,100%,.25);--bs-navbar-active-color:#fff;--bs-navbar-brand-color:#fff;--bs-navbar-brand-hover-color:#fff;--bs-navbar-toggler-border-color:hsla(0,0%,100%,.1)}.navbar-dark,.navbar[data-bs-theme=dark],[data-bs-theme=dark] .navbar-toggler-icon{--bs-navbar-toggler-icon-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'%3E%3Cpath stroke='rgba(255, 255, 255, 0.55)' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/%3E%3C/svg%3E")}.card{--bs-card-spacer-y:1rem;--bs-card-spacer-x:1rem;--bs-card-title-spacer-y:0.5rem;--bs-card-title-color: ;--bs-card-subtitle-color: ;--bs-card-border-width:var(--bs-border-width);--bs-card-border-color:var(--bs-border-color-translucent);--bs-card-border-radius:var(--bs-border-radius);--bs-card-box-shadow: ;--bs-card-inner-border-radius:calc(var(--bs-border-radius) - var(--bs-border-width));--bs-card-cap-padding-y:0.5rem;--bs-card-cap-padding-x:1rem;--bs-card-cap-bg:rgba(var(--bs-body-color-rgb),0.03);--bs-card-cap-color: ;--bs-card-height: ;--bs-card-color: ;--bs-card-bg:var(--bs-body-bg);--bs-card-img-overlay-padding:1rem;--bs-card-group-margin:0.75rem;word-wrap:break-word;background-clip:border-box;background-color:var(--bs-card-bg);border:var(--bs-card-border-width) solid var(--bs-card-border-color);border-radius:var(--bs-card-border-radius);color:var(--bs-body-color);display:flex;flex-direction:column;height:var(--bs-card-height);min-width:0;position:relative}.card>hr{margin-left:0;margin-right:0}.card>.list-group{border-bottom:inherit;border-top:inherit}.card>.list-group:first-child{border-top-left-radius:var(--bs-card-inner-border-radius);border-top-right-radius:var(--bs-card-inner-border-radius);border-top-width:0}.card>.list-group:last-child{border-bottom-left-radius:var(--bs-card-inner-border-radius);border-bottom-right-radius:var(--bs-card-inner-border-radius);border-bottom-width:0}.card>.card-header+.list-group,.card>.list-group+.card-footer{border-top:0}.card-body{color:var(--bs-card-color);flex:1 1 auto;padding:var(--bs-card-spacer-y) var(--bs-card-spacer-x)}.card-title{color:var(--bs-card-title-color);margin-bottom:var(--bs-card-title-spacer-y)}.card-subtitle{color:var(--bs-card-subtitle-color);margin-top:calc(var(--bs-card-title-spacer-y)*-.5)}.card-subtitle,.card-text:last-child{margin-bottom:0}.card-link+.card-link{margin-left:var(--bs-card-spacer-x)}.card-header{background-color:var(--bs-card-cap-bg);border-bottom:var(--bs-card-border-width) solid var(--bs-card-border-color);color:var(--bs-card-cap-color);margin-bottom:0;padding:var(--bs-card-cap-padding-y) var(--bs-card-cap-padding-x)}.card-header:first-child{border-radius:var(--bs-card-inner-border-radius) var(--bs-card-inner-border-radius) 0 0}.card-footer{background-color:var(--bs-card-cap-bg);border-top:var(--bs-card-border-width) solid var(--bs-card-border-color);color:var(--bs-card-cap-color);padding:var(--bs-card-cap-padding-y) var(--bs-card-cap-padding-x)}.card-footer:last-child{border-radius:0 0 var(--bs-card-inner-border-radius) var(--bs-card-inner-border-radius)}.card-header-tabs{border-bottom:0;margin-bottom:calc(var(--bs-card-cap-padding-y)*-1);margin-left:calc(var(--bs-card-cap-padding-x)*-.5);margin-right:calc(var(--bs-card-cap-padding-x)*-.5)}.card-header-tabs .nav-link.active{background-color:var(--bs-card-bg);border-bottom-color:var(--bs-card-bg)}.card-header-pills{margin-left:calc(var(--bs-card-cap-padding-x)*-.5);margin-right:calc(var(--bs-card-cap-padding-x)*-.5)}.card-img-overlay{border-radius:var(--bs-card-inner-border-radius);bottom:0;left:0;padding:var(--bs-card-img-overlay-padding);position:absolute;right:0;top:0}.card-img,.card-img-bottom,.card-img-top{width:100%}.card-img,.card-img-top{border-top-left-radius:var(--bs-card-inner-border-radius);border-top-right-radius:var(--bs-card-inner-border-radius)}.card-img,.card-img-bottom{border-bottom-left-radius:var(--bs-card-inner-border-radius);border-bottom-right-radius:var(--bs-card-inner-border-radius)}.card-group>.card{margin-bottom:var(--bs-card-group-margin)}@media(min-width:540px){.card-group{display:flex;flex-flow:row wrap}.card-group>.card{flex:1 0 0%;margin-bottom:0}.card-group>.card+.card{border-left:0;margin-left:0}.card-group>.card:not(:last-child){border-bottom-right-radius:0;border-top-right-radius:0}.card-group>.card:not(:last-child) .card-header,.card-group>.card:not(:last-child) .card-img-top{border-top-right-radius:0}.card-group>.card:not(:last-child) .card-footer,.card-group>.card:not(:last-child) .card-img-bottom{border-bottom-right-radius:0}.card-group>.card:not(:first-child){border-bottom-left-radius:0;border-top-left-radius:0}.card-group>.card:not(:first-child) .card-header,.card-group>.card:not(:first-child) .card-img-top{border-top-left-radius:0}.card-group>.card:not(:first-child) .card-footer,.card-group>.card:not(:first-child) .card-img-bottom{border-bottom-left-radius:0}}.accordion{--bs-accordion-color:var(--bs-body-color);--bs-accordion-bg:var(--bs-body-bg);--bs-accordion-transition:color 0.15s ease-in-out,background-color 0.15s ease-in-out,border-color 0.15s ease-in-out,box-shadow 0.15s ease-in-out,border-radius 0.15s ease;--bs-accordion-border-color:var(--bs-border-color);--bs-accordion-border-width:var(--bs-border-width);--bs-accordion-border-radius:var(--bs-border-radius);--bs-accordion-inner-border-radius:calc(var(--bs-border-radius) - var(--bs-border-width));--bs-accordion-btn-padding-x:1.25rem;--bs-accordion-btn-padding-y:1rem;--bs-accordion-btn-color:var(--bs-body-color);--bs-accordion-btn-bg:var(--bs-accordion-bg);--bs-accordion-btn-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23212529'%3E%3Cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3E%3C/svg%3E");--bs-accordion-btn-icon-width:1.25rem;--bs-accordion-btn-icon-transform:rotate(-180deg);--bs-accordion-btn-icon-transition:transform 0.2s ease-in-out;--bs-accordion-btn-active-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23052c65'%3E%3Cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3E%3C/svg%3E");--bs-accordion-btn-focus-border-color:#86b7fe;--bs-accordion-btn-focus-box-shadow:0 0 0 0.25rem rgba(13,110,253,.25);--bs-accordion-body-padding-x:1.25rem;--bs-accordion-body-padding-y:1rem;--bs-accordion-active-color:var(--bs-primary-text-emphasis);--bs-accordion-active-bg:var(--bs-primary-bg-subtle)}.accordion-button{align-items:center;background-color:var(--bs-accordion-btn-bg);border:0;border-radius:0;color:var(--bs-accordion-btn-color);display:flex;font-size:1rem;overflow-anchor:none;padding:var(--bs-accordion-btn-padding-y) var(--bs-accordion-btn-padding-x);position:relative;text-align:left;transition:var(--bs-accordion-transition);width:100%}@media(prefers-reduced-motion:reduce){.accordion-button{transition:none}}.accordion-button:not(.collapsed){background-color:var(--bs-accordion-active-bg);box-shadow:inset 0 calc(var(--bs-accordion-border-width)*-1) 0 var(--bs-accordion-border-color);color:var(--bs-accordion-active-color)}.accordion-button:not(.collapsed):after{background-image:var(--bs-accordion-btn-active-icon);transform:var(--bs-accordion-btn-icon-transform)}.accordion-button:after{background-image:var(--bs-accordion-btn-icon);background-repeat:no-repeat;background-size:var(--bs-accordion-btn-icon-width);content:"";flex-shrink:0;height:var(--bs-accordion-btn-icon-width);margin-left:auto;transition:var(--bs-accordion-btn-icon-transition);width:var(--bs-accordion-btn-icon-width)}@media(prefers-reduced-motion:reduce){.accordion-button:after{transition:none}}.accordion-button:hover{z-index:2}.accordion-button:focus{border-color:var(--bs-accordion-btn-focus-border-color);box-shadow:var(--bs-accordion-btn-focus-box-shadow);outline:0;z-index:3}.accordion-header{margin-bottom:0}.accordion-item{background-color:var(--bs-accordion-bg);border:var(--bs-accordion-border-width) solid var(--bs-accordion-border-color);color:var(--bs-accordion-color)}.accordion-item:first-of-type{border-top-left-radius:var(--bs-accordion-border-radius);border-top-right-radius:var(--bs-accordion-border-radius)}.accordion-item:first-of-type .accordion-button{border-top-left-radius:var(--bs-accordion-inner-border-radius);border-top-right-radius:var(--bs-accordion-inner-border-radius)}.accordion-item:not(:first-of-type){border-top:0}.accordion-item:last-of-type{border-bottom-left-radius:var(--bs-accordion-border-radius);border-bottom-right-radius:var(--bs-accordion-border-radius)}.accordion-item:last-of-type .accordion-button.collapsed{border-bottom-left-radius:var(--bs-accordion-inner-border-radius);border-bottom-right-radius:var(--bs-accordion-inner-border-radius)}.accordion-item:last-of-type .accordion-collapse{border-bottom-left-radius:var(--bs-accordion-border-radius);border-bottom-right-radius:var(--bs-accordion-border-radius)}.accordion-body{padding:var(--bs-accordion-body-padding-y) var(--bs-accordion-body-padding-x)}.accordion-flush .accordion-collapse{border-width:0}.accordion-flush .accordion-item{border-left:0;border-radius:0;border-right:0}.accordion-flush .accordion-item:first-child{border-top:0}.accordion-flush .accordion-item:last-child{border-bottom:0}.accordion-flush .accordion-item .accordion-button,.accordion-flush .accordion-item .accordion-button.collapsed{border-radius:0}[data-bs-theme=dark] .accordion-button:after{--bs-accordion-btn-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%236ea8fe'%3E%3Cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3E%3C/svg%3E");--bs-accordion-btn-active-icon:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%236ea8fe'%3E%3Cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3E%3C/svg%3E")}.breadcrumb{--bs-breadcrumb-padding-x:0;--bs-breadcrumb-padding-y:0;--bs-breadcrumb-margin-bottom:1rem;--bs-breadcrumb-bg: ;--bs-breadcrumb-border-radius: ;--bs-breadcrumb-divider-color:var(--bs-secondary-color);--bs-breadcrumb-item-padding-x:0.5rem;--bs-breadcrumb-item-active-color:var(--bs-secondary-color);background-color:var(--bs-breadcrumb-bg);border-radius:var(--bs-breadcrumb-border-radius);display:flex;flex-wrap:wrap;font-size:var(--bs-breadcrumb-font-size);list-style:none;margin-bottom:var(--bs-breadcrumb-margin-bottom);padding:var(--bs-breadcrumb-padding-y) var(--bs-breadcrumb-padding-x)}.breadcrumb-item+.breadcrumb-item{padding-left:var(--bs-breadcrumb-item-padding-x)}.breadcrumb-item+.breadcrumb-item:before{color:var(--bs-breadcrumb-divider-color);content:var(--bs-breadcrumb-divider,"/");float:left;padding-right:var(--bs-breadcrumb-item-padding-x)}.breadcrumb-item.active{color:var(--bs-breadcrumb-item-active-color)}.pagination{--bs-pagination-padding-x:0.75rem;--bs-pagination-padding-y:0.375rem;--bs-pagination-font-size:1rem;--bs-pagination-color:var(--bs-link-color);--bs-pagination-bg:var(--bs-body-bg);--bs-pagination-border-width:var(--bs-border-width);--bs-pagination-border-color:var(--bs-border-color);--bs-pagination-border-radius:var(--bs-border-radius);--bs-pagination-hover-color:var(--bs-link-hover-color);--bs-pagination-hover-bg:var(--bs-tertiary-bg);--bs-pagination-hover-border-color:var(--bs-border-color);--bs-pagination-focus-color:var(--bs-link-hover-color);--bs-pagination-focus-bg:var(--bs-secondary-bg);--bs-pagination-focus-box-shadow:0 0 0 0.25rem rgba(13,110,253,.25);--bs-pagination-active-color:#fff;--bs-pagination-active-bg:#0d6efd;--bs-pagination-active-border-color:#0d6efd;--bs-pagination-disabled-color:var(--bs-secondary-color);--bs-pagination-disabled-bg:var(--bs-secondary-bg);--bs-pagination-disabled-border-color:var(--bs-border-color);display:flex;list-style:none;padding-left:0}.page-link{background-color:var(--bs-pagination-bg);border:var(--bs-pagination-border-width) solid var(--bs-pagination-border-color);color:var(--bs-pagination-color);display:block;font-size:var(--bs-pagination-font-size);padding:var(--bs-pagination-padding-y) var(--bs-pagination-padding-x);position:relative;text-decoration:none;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion:reduce){.page-link{transition:none}}.page-link:hover{background-color:var(--bs-pagination-hover-bg);border-color:var(--bs-pagination-hover-border-color);color:var(--bs-pagination-hover-color);z-index:2}.page-link:focus{background-color:var(--bs-pagination-focus-bg);box-shadow:var(--bs-pagination-focus-box-shadow);color:var(--bs-pagination-focus-color);outline:0;z-index:3}.active>.page-link,.page-link.active{background-color:var(--bs-pagination-active-bg);border-color:var(--bs-pagination-active-border-color);color:var(--bs-pagination-active-color);z-index:3}.disabled>.page-link,.page-link.disabled{background-color:var(--bs-pagination-disabled-bg);border-color:var(--bs-pagination-disabled-border-color);color:var(--bs-pagination-disabled-color);pointer-events:none}.page-item:not(:first-child) .page-link{margin-left:calc(var(--bs-border-width)*-1)}.page-item:first-child .page-link{border-bottom-left-radius:var(--bs-pagination-border-radius);border-top-left-radius:var(--bs-pagination-border-radius)}.page-item:last-child .page-link{border-bottom-right-radius:var(--bs-pagination-border-radius);border-top-right-radius:var(--bs-pagination-border-radius)}.pagination-lg{--bs-pagination-padding-x:1.5rem;--bs-pagination-padding-y:0.75rem;--bs-pagination-font-size:1.25rem;--bs-pagination-border-radius:var(--bs-border-radius-lg)}.pagination-sm{--bs-pagination-padding-x:0.5rem;--bs-pagination-padding-y:0.25rem;--bs-pagination-font-size:0.875rem;--bs-pagination-border-radius:var(--bs-border-radius-sm)}.badge{--bs-badge-padding-x:0.65em;--bs-badge-padding-y:0.35em;--bs-badge-font-size:0.75em;--bs-badge-font-weight:700;--bs-badge-color:#fff;--bs-badge-border-radius:var(--bs-border-radius);border-radius:var(--bs-badge-border-radius);color:var(--bs-badge-color);display:inline-block;font-size:var(--bs-badge-font-size);font-weight:var(--bs-badge-font-weight);line-height:1;padding:var(--bs-badge-padding-y) var(--bs-badge-padding-x);text-align:center;vertical-align:baseline;white-space:nowrap}.badge:empty{display:none}.btn .badge{position:relative;top:-1px}.alert{--bs-alert-bg:transparent;--bs-alert-padding-x:1rem;--bs-alert-padding-y:1rem;--bs-alert-margin-bottom:1rem;--bs-alert-color:inherit;--bs-alert-border-color:transparent;--bs-alert-border:var(--bs-border-width) solid var(--bs-alert-border-color);--bs-alert-border-radius:var(--bs-border-radius);--bs-alert-link-color:inherit;background-color:var(--bs-alert-bg);border:var(--bs-alert-border);border-radius:var(--bs-alert-border-radius);color:var(--bs-alert-color);margin-bottom:var(--bs-alert-margin-bottom);padding:var(--bs-alert-padding-y) var(--bs-alert-padding-x);position:relative}.alert-heading{color:inherit}.alert-link{color:var(--bs-alert-link-color);font-weight:700}.alert-dismissible{padding-right:3rem}.alert-dismissible .btn-close{padding:1.25rem 1rem;position:absolute;right:0;top:0;z-index:2}.alert-primary{--bs-alert-color:var(--bs-primary-text-emphasis);--bs-alert-bg:var(--bs-primary-bg-subtle);--bs-alert-border-color:var(--bs-primary-border-subtle);--bs-alert-link-color:var(--bs-primary-text-emphasis)}.alert-secondary{--bs-alert-color:var(--bs-secondary-text-emphasis);--bs-alert-bg:var(--bs-secondary-bg-subtle);--bs-alert-border-color:var(--bs-secondary-border-subtle);--bs-alert-link-color:var(--bs-secondary-text-emphasis)}.alert-success{--bs-alert-color:var(--bs-success-text-emphasis);--bs-alert-bg:var(--bs-success-bg-subtle);--bs-alert-border-color:var(--bs-success-border-subtle);--bs-alert-link-color:var(--bs-success-text-emphasis)}.alert-info{--bs-alert-color:var(--bs-info-text-emphasis);--bs-alert-bg:var(--bs-info-bg-subtle);--bs-alert-border-color:var(--bs-info-border-subtle);--bs-alert-link-color:var(--bs-info-text-emphasis)}.alert-warning{--bs-alert-color:var(--bs-warning-text-emphasis);--bs-alert-bg:var(--bs-warning-bg-subtle);--bs-alert-border-color:var(--bs-warning-border-subtle);--bs-alert-link-color:var(--bs-warning-text-emphasis)}.alert-danger{--bs-alert-color:var(--bs-danger-text-emphasis);--bs-alert-bg:var(--bs-danger-bg-subtle);--bs-alert-border-color:var(--bs-danger-border-subtle);--bs-alert-link-color:var(--bs-danger-text-emphasis)}.alert-light{--bs-alert-color:var(--bs-light-text-emphasis);--bs-alert-bg:var(--bs-light-bg-subtle);--bs-alert-border-color:var(--bs-light-border-subtle);--bs-alert-link-color:var(--bs-light-text-emphasis)}.alert-dark{--bs-alert-color:var(--bs-dark-text-emphasis);--bs-alert-bg:var(--bs-dark-bg-subtle);--bs-alert-border-color:var(--bs-dark-border-subtle);--bs-alert-link-color:var(--bs-dark-text-emphasis)}@keyframes progress-bar-stripes{0%{background-position-x:1rem}}.progress,.progress-stacked{--bs-progress-height:1rem;--bs-progress-font-size:0.75rem;--bs-progress-bg:var(--bs-secondary-bg);--bs-progress-border-radius:var(--bs-border-radius);--bs-progress-box-shadow:var(--bs-box-shadow-inset);--bs-progress-bar-color:#fff;--bs-progress-bar-bg:#0d6efd;--bs-progress-bar-transition:width 0.6s ease;background-color:var(--bs-progress-bg);border-radius:var(--bs-progress-border-radius);display:flex;font-size:var(--bs-progress-font-size);height:var(--bs-progress-height);overflow:hidden}.progress-bar{background-color:var(--bs-progress-bar-bg);color:var(--bs-progress-bar-color);display:flex;flex-direction:column;justify-content:center;overflow:hidden;text-align:center;transition:var(--bs-progress-bar-transition);white-space:nowrap}@media(prefers-reduced-motion:reduce){.progress-bar{transition:none}}.progress-bar-striped{background-image:linear-gradient(45deg,hsla(0,0%,100%,.15) 25%,transparent 0,transparent 50%,hsla(0,0%,100%,.15) 0,hsla(0,0%,100%,.15) 75%,transparent 0,transparent);background-size:var(--bs-progress-height) var(--bs-progress-height)}.progress-stacked>.progress{overflow:visible}.progress-stacked>.progress>.progress-bar{width:100%}.progress-bar-animated{animation:progress-bar-stripes 1s linear infinite}@media(prefers-reduced-motion:reduce){.progress-bar-animated{animation:none}}.list-group{--bs-list-group-color:var(--bs-body-color);--bs-list-group-bg:var(--bs-body-bg);--bs-list-group-border-color:var(--bs-border-color);--bs-list-group-border-width:var(--bs-border-width);--bs-list-group-border-radius:var(--bs-border-radius);--bs-list-group-item-padding-x:1rem;--bs-list-group-item-padding-y:0.5rem;--bs-list-group-action-color:var(--bs-secondary-color);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-tertiary-bg);--bs-list-group-action-active-color:var(--bs-body-color);--bs-list-group-action-active-bg:var(--bs-secondary-bg);--bs-list-group-disabled-color:var(--bs-secondary-color);--bs-list-group-disabled-bg:var(--bs-body-bg);--bs-list-group-active-color:#fff;--bs-list-group-active-bg:#0d6efd;--bs-list-group-active-border-color:#0d6efd;border-radius:var(--bs-list-group-border-radius);display:flex;flex-direction:column;margin-bottom:0;padding-left:0}.list-group-numbered{counter-reset:section;list-style-type:none}.list-group-numbered>.list-group-item:before{content:counters(section,".") ". ";counter-increment:section}.list-group-item-action{color:var(--bs-list-group-action-color);text-align:inherit;width:100%}.list-group-item-action:focus,.list-group-item-action:hover{background-color:var(--bs-list-group-action-hover-bg);color:var(--bs-list-group-action-hover-color);text-decoration:none;z-index:1}.list-group-item-action:active{background-color:var(--bs-list-group-action-active-bg);color:var(--bs-list-group-action-active-color)}.list-group-item{background-color:var(--bs-list-group-bg);border:var(--bs-list-group-border-width) solid var(--bs-list-group-border-color);color:var(--bs-list-group-color);display:block;padding:var(--bs-list-group-item-padding-y) var(--bs-list-group-item-padding-x);position:relative;text-decoration:none}.list-group-item:first-child{border-top-left-radius:inherit;border-top-right-radius:inherit}.list-group-item:last-child{border-bottom-left-radius:inherit;border-bottom-right-radius:inherit}.list-group-item.disabled,.list-group-item:disabled{background-color:var(--bs-list-group-disabled-bg);color:var(--bs-list-group-disabled-color);pointer-events:none}.list-group-item.active{background-color:var(--bs-list-group-active-bg);border-color:var(--bs-list-group-active-border-color);color:var(--bs-list-group-active-color);z-index:2}.list-group-item+.list-group-item{border-top-width:0}.list-group-item+.list-group-item.active{border-top-width:var(--bs-list-group-border-width);margin-top:calc(var(--bs-list-group-border-width)*-1)}.list-group-horizontal{flex-direction:row}.list-group-horizontal>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal>.list-group-item:last-child:not(:first-child){border-bottom-left-radius:0;border-top-right-radius:var(--bs-list-group-border-radius)}.list-group-horizontal>.list-group-item.active{margin-top:0}.list-group-horizontal>.list-group-item+.list-group-item{border-left-width:0;border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal>.list-group-item+.list-group-item.active{border-left-width:var(--bs-list-group-border-width);margin-left:calc(var(--bs-list-group-border-width)*-1)}@media(min-width:540px){.list-group-horizontal-sm{flex-direction:row}.list-group-horizontal-sm>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-sm>.list-group-item:last-child:not(:first-child){border-bottom-left-radius:0;border-top-right-radius:var(--bs-list-group-border-radius)}.list-group-horizontal-sm>.list-group-item.active{margin-top:0}.list-group-horizontal-sm>.list-group-item+.list-group-item{border-left-width:0;border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal-sm>.list-group-item+.list-group-item.active{border-left-width:var(--bs-list-group-border-width);margin-left:calc(var(--bs-list-group-border-width)*-1)}}@media(min-width:720px){.list-group-horizontal-md{flex-direction:row}.list-group-horizontal-md>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-md>.list-group-item:last-child:not(:first-child){border-bottom-left-radius:0;border-top-right-radius:var(--bs-list-group-border-radius)}.list-group-horizontal-md>.list-group-item.active{margin-top:0}.list-group-horizontal-md>.list-group-item+.list-group-item{border-left-width:0;border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal-md>.list-group-item+.list-group-item.active{border-left-width:var(--bs-list-group-border-width);margin-left:calc(var(--bs-list-group-border-width)*-1)}}@media(min-width:960px){.list-group-horizontal-lg{flex-direction:row}.list-group-horizontal-lg>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-lg>.list-group-item:last-child:not(:first-child){border-bottom-left-radius:0;border-top-right-radius:var(--bs-list-group-border-radius)}.list-group-horizontal-lg>.list-group-item.active{margin-top:0}.list-group-horizontal-lg>.list-group-item+.list-group-item{border-left-width:0;border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal-lg>.list-group-item+.list-group-item.active{border-left-width:var(--bs-list-group-border-width);margin-left:calc(var(--bs-list-group-border-width)*-1)}}@media(min-width:1200px){.list-group-horizontal-xl{flex-direction:row}.list-group-horizontal-xl>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-xl>.list-group-item:last-child:not(:first-child){border-bottom-left-radius:0;border-top-right-radius:var(--bs-list-group-border-radius)}.list-group-horizontal-xl>.list-group-item.active{margin-top:0}.list-group-horizontal-xl>.list-group-item+.list-group-item{border-left-width:0;border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal-xl>.list-group-item+.list-group-item.active{border-left-width:var(--bs-list-group-border-width);margin-left:calc(var(--bs-list-group-border-width)*-1)}}.list-group-flush{border-radius:0}.list-group-flush>.list-group-item{border-width:0 0 var(--bs-list-group-border-width)}.list-group-flush>.list-group-item:last-child{border-bottom-width:0}.list-group-item-primary{--bs-list-group-color:var(--bs-primary-text-emphasis);--bs-list-group-bg:var(--bs-primary-bg-subtle);--bs-list-group-border-color:var(--bs-primary-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-primary-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-primary-border-subtle);--bs-list-group-active-color:var(--bs-primary-bg-subtle);--bs-list-group-active-bg:var(--bs-primary-text-emphasis);--bs-list-group-active-border-color:var(--bs-primary-text-emphasis)}.list-group-item-secondary{--bs-list-group-color:var(--bs-secondary-text-emphasis);--bs-list-group-bg:var(--bs-secondary-bg-subtle);--bs-list-group-border-color:var(--bs-secondary-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-secondary-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-secondary-border-subtle);--bs-list-group-active-color:var(--bs-secondary-bg-subtle);--bs-list-group-active-bg:var(--bs-secondary-text-emphasis);--bs-list-group-active-border-color:var(--bs-secondary-text-emphasis)}.list-group-item-success{--bs-list-group-color:var(--bs-success-text-emphasis);--bs-list-group-bg:var(--bs-success-bg-subtle);--bs-list-group-border-color:var(--bs-success-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-success-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-success-border-subtle);--bs-list-group-active-color:var(--bs-success-bg-subtle);--bs-list-group-active-bg:var(--bs-success-text-emphasis);--bs-list-group-active-border-color:var(--bs-success-text-emphasis)}.list-group-item-info{--bs-list-group-color:var(--bs-info-text-emphasis);--bs-list-group-bg:var(--bs-info-bg-subtle);--bs-list-group-border-color:var(--bs-info-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-info-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-info-border-subtle);--bs-list-group-active-color:var(--bs-info-bg-subtle);--bs-list-group-active-bg:var(--bs-info-text-emphasis);--bs-list-group-active-border-color:var(--bs-info-text-emphasis)}.list-group-item-warning{--bs-list-group-color:var(--bs-warning-text-emphasis);--bs-list-group-bg:var(--bs-warning-bg-subtle);--bs-list-group-border-color:var(--bs-warning-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-warning-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-warning-border-subtle);--bs-list-group-active-color:var(--bs-warning-bg-subtle);--bs-list-group-active-bg:var(--bs-warning-text-emphasis);--bs-list-group-active-border-color:var(--bs-warning-text-emphasis)}.list-group-item-danger{--bs-list-group-color:var(--bs-danger-text-emphasis);--bs-list-group-bg:var(--bs-danger-bg-subtle);--bs-list-group-border-color:var(--bs-danger-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-danger-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-danger-border-subtle);--bs-list-group-active-color:var(--bs-danger-bg-subtle);--bs-list-group-active-bg:var(--bs-danger-text-emphasis);--bs-list-group-active-border-color:var(--bs-danger-text-emphasis)}.list-group-item-light{--bs-list-group-color:var(--bs-light-text-emphasis);--bs-list-group-bg:var(--bs-light-bg-subtle);--bs-list-group-border-color:var(--bs-light-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-light-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-light-border-subtle);--bs-list-group-active-color:var(--bs-light-bg-subtle);--bs-list-group-active-bg:var(--bs-light-text-emphasis);--bs-list-group-active-border-color:var(--bs-light-text-emphasis)}.list-group-item-dark{--bs-list-group-color:var(--bs-dark-text-emphasis);--bs-list-group-bg:var(--bs-dark-bg-subtle);--bs-list-group-border-color:var(--bs-dark-border-subtle);--bs-list-group-action-hover-color:var(--bs-emphasis-color);--bs-list-group-action-hover-bg:var(--bs-dark-border-subtle);--bs-list-group-action-active-color:var(--bs-emphasis-color);--bs-list-group-action-active-bg:var(--bs-dark-border-subtle);--bs-list-group-active-color:var(--bs-dark-bg-subtle);--bs-list-group-active-bg:var(--bs-dark-text-emphasis);--bs-list-group-active-border-color:var(--bs-dark-text-emphasis)}.btn-close{--bs-btn-close-color:#000;--bs-btn-close-bg:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3E%3Cpath d='M.293.293a1 1 0 0 1 1.414 0L8 6.586 14.293.293a1 1 0 1 1 1.414 1.414L9.414 8l6.293 6.293a1 1 0 0 1-1.414 1.414L8 9.414l-6.293 6.293a1 1 0 0 1-1.414-1.414L6.586 8 .293 1.707a1 1 0 0 1 0-1.414z'/%3E%3C/svg%3E");--bs-btn-close-opacity:0.5;--bs-btn-close-hover-opacity:0.75;--bs-btn-close-focus-shadow:0 0 0 0.25rem rgba(13,110,253,.25);--bs-btn-close-focus-opacity:1;--bs-btn-close-disabled-opacity:0.25;--bs-btn-close-white-filter:invert(1) grayscale(100%) brightness(200%);background:transparent var(--bs-btn-close-bg) center/1em auto no-repeat;border:0;border-radius:.375rem;box-sizing:content-box;height:1em;opacity:var(--bs-btn-close-opacity);padding:.25em;width:1em}.btn-close,.btn-close:hover{color:var(--bs-btn-close-color)}.btn-close:hover{opacity:var(--bs-btn-close-hover-opacity);text-decoration:none}.btn-close:focus{box-shadow:var(--bs-btn-close-focus-shadow);opacity:var(--bs-btn-close-focus-opacity);outline:0}.btn-close.disabled,.btn-close:disabled{opacity:var(--bs-btn-close-disabled-opacity);pointer-events:none;user-select:none}.btn-close-white,[data-bs-theme=dark] .btn-close{filter:var(--bs-btn-close-white-filter)}.toast{--bs-toast-zindex:1090;--bs-toast-padding-x:0.75rem;--bs-toast-padding-y:0.5rem;--bs-toast-spacing:1.5rem;--bs-toast-max-width:350px;--bs-toast-font-size:0.875rem;--bs-toast-color: ;--bs-toast-bg:rgba(var(--bs-body-bg-rgb),0.85);--bs-toast-border-width:var(--bs-border-width);--bs-toast-border-color:var(--bs-border-color-translucent);--bs-toast-border-radius:var(--bs-border-radius);--bs-toast-box-shadow:var(--bs-box-shadow);--bs-toast-header-color:var(--bs-secondary-color);--bs-toast-header-bg:rgba(var(--bs-body-bg-rgb),0.85);--bs-toast-header-border-color:var(--bs-border-color-translucent);background-clip:padding-box;background-color:var(--bs-toast-bg);border:var(--bs-toast-border-width) solid var(--bs-toast-border-color);border-radius:var(--bs-toast-border-radius);box-shadow:var(--bs-toast-box-shadow);color:var(--bs-toast-color);font-size:var(--bs-toast-font-size);max-width:100%;pointer-events:auto;width:var(--bs-toast-max-width)}.toast.showing{opacity:0}.toast:not(.show){display:none}.toast-container{--bs-toast-zindex:1090;max-width:100%;pointer-events:none;position:absolute;width:max-content;z-index:var(--bs-toast-zindex)}.toast-container>:not(:last-child){margin-bottom:var(--bs-toast-spacing)}.toast-header{align-items:center;background-clip:padding-box;background-color:var(--bs-toast-header-bg);border-bottom:var(--bs-toast-border-width) solid var(--bs-toast-header-border-color);border-top-left-radius:calc(var(--bs-toast-border-radius) - var(--bs-toast-border-width));border-top-right-radius:calc(var(--bs-toast-border-radius) - var(--bs-toast-border-width));color:var(--bs-toast-header-color);display:flex;padding:var(--bs-toast-padding-y) var(--bs-toast-padding-x)}.toast-header .btn-close{margin-left:var(--bs-toast-padding-x);margin-right:calc(var(--bs-toast-padding-x)*-.5)}.toast-body{word-wrap:break-word;padding:var(--bs-toast-padding-x)}.modal{--bs-modal-zindex:1055;--bs-modal-width:500px;--bs-modal-padding:1rem;--bs-modal-margin:0.5rem;--bs-modal-color: ;--bs-modal-bg:var(--bs-body-bg);--bs-modal-border-color:var(--bs-border-color-translucent);--bs-modal-border-width:var(--bs-border-width);--bs-modal-border-radius:var(--bs-border-radius-lg);--bs-modal-box-shadow:var(--bs-box-shadow-sm);--bs-modal-inner-border-radius:calc(var(--bs-border-radius-lg) - var(--bs-border-width));--bs-modal-header-padding-x:1rem;--bs-modal-header-padding-y:1rem;--bs-modal-header-padding:1rem 1rem;--bs-modal-header-border-color:var(--bs-border-color);--bs-modal-header-border-width:var(--bs-border-width);--bs-modal-title-line-height:1.5;--bs-modal-footer-gap:0.5rem;--bs-modal-footer-bg: ;--bs-modal-footer-border-color:var(--bs-border-color);--bs-modal-footer-border-width:var(--bs-border-width);display:none;height:100%;left:0;outline:0;overflow-x:hidden;overflow-y:auto;position:fixed;top:0;width:100%;z-index:var(--bs-modal-zindex)}.modal-dialog{margin:var(--bs-modal-margin);pointer-events:none;position:relative;width:auto}.modal.fade .modal-dialog{transform:translateY(-50px);transition:transform .3s ease-out}@media(prefers-reduced-motion:reduce){.modal.fade .modal-dialog{transition:none}}.modal.show .modal-dialog{transform:none}.modal.modal-static .modal-dialog{transform:scale(1.02)}.modal-dialog-scrollable{height:calc(100% - var(--bs-modal-margin)*2)}.modal-dialog-scrollable .modal-content{max-height:100%;overflow:hidden}.modal-dialog-scrollable .modal-body{overflow-y:auto}.modal-dialog-centered{align-items:center;display:flex;min-height:calc(100% - var(--bs-modal-margin)*2)}.modal-content{background-clip:padding-box;background-color:var(--bs-modal-bg);border:var(--bs-modal-border-width) solid var(--bs-modal-border-color);border-radius:var(--bs-modal-border-radius);color:var(--bs-modal-color);display:flex;flex-direction:column;outline:0;pointer-events:auto;position:relative;width:100%}.modal-backdrop{--bs-backdrop-zindex:1050;--bs-backdrop-bg:#000;--bs-backdrop-opacity:0.5;background-color:var(--bs-backdrop-bg);height:100vh;left:0;position:fixed;top:0;width:100vw;z-index:var(--bs-backdrop-zindex)}.modal-backdrop.fade{opacity:0}.modal-backdrop.show{opacity:var(--bs-backdrop-opacity)}.modal-header{align-items:center;border-bottom:var(--bs-modal-header-border-width) solid var(--bs-modal-header-border-color);border-top-left-radius:var(--bs-modal-inner-border-radius);border-top-right-radius:var(--bs-modal-inner-border-radius);display:flex;flex-shrink:0;justify-content:space-between;padding:var(--bs-modal-header-padding)}.modal-header .btn-close{margin:calc(var(--bs-modal-header-padding-y)*-.5) calc(var(--bs-modal-header-padding-x)*-.5) calc(var(--bs-modal-header-padding-y)*-.5) auto;padding:calc(var(--bs-modal-header-padding-y)*.5) calc(var(--bs-modal-header-padding-x)*.5)}.modal-title{line-height:var(--bs-modal-title-line-height);margin-bottom:0}.modal-body{flex:1 1 auto;padding:var(--bs-modal-padding);position:relative}.modal-footer{align-items:center;background-color:var(--bs-modal-footer-bg);border-bottom-left-radius:var(--bs-modal-inner-border-radius);border-bottom-right-radius:var(--bs-modal-inner-border-radius);border-top:var(--bs-modal-footer-border-width) solid var(--bs-modal-footer-border-color);display:flex;flex-shrink:0;flex-wrap:wrap;justify-content:flex-end;padding:calc(var(--bs-modal-padding) - var(--bs-modal-footer-gap)*.5)}.modal-footer>*{margin:calc(var(--bs-modal-footer-gap)*.5)}@media(min-width:540px){.modal{--bs-modal-margin:1.75rem;--bs-modal-box-shadow:var(--bs-box-shadow)}.modal-dialog{margin-left:auto;margin-right:auto;max-width:var(--bs-modal-width)}.modal-sm{--bs-modal-width:300px}}@media(min-width:960px){.modal-lg,.modal-xl{--bs-modal-width:800px}}@media(min-width:1200px){.modal-xl{--bs-modal-width:1140px}}.modal-fullscreen{height:100%;margin:0;max-width:none;width:100vw}.modal-fullscreen .modal-content{border:0;border-radius:0;height:100%}.modal-fullscreen .modal-footer,.modal-fullscreen .modal-header{border-radius:0}.modal-fullscreen .modal-body{overflow-y:auto}@media(max-width:539.98px){.modal-fullscreen-sm-down{height:100%;margin:0;max-width:none;width:100vw}.modal-fullscreen-sm-down .modal-content{border:0;border-radius:0;height:100%}.modal-fullscreen-sm-down .modal-footer,.modal-fullscreen-sm-down .modal-header{border-radius:0}.modal-fullscreen-sm-down .modal-body{overflow-y:auto}}@media(max-width:719.98px){.modal-fullscreen-md-down{height:100%;margin:0;max-width:none;width:100vw}.modal-fullscreen-md-down .modal-content{border:0;border-radius:0;height:100%}.modal-fullscreen-md-down .modal-footer,.modal-fullscreen-md-down .modal-header{border-radius:0}.modal-fullscreen-md-down .modal-body{overflow-y:auto}}@media(max-width:959.98px){.modal-fullscreen-lg-down{height:100%;margin:0;max-width:none;width:100vw}.modal-fullscreen-lg-down .modal-content{border:0;border-radius:0;height:100%}.modal-fullscreen-lg-down .modal-footer,.modal-fullscreen-lg-down .modal-header{border-radius:0}.modal-fullscreen-lg-down .modal-body{overflow-y:auto}}@media(max-width:1199.98px){.modal-fullscreen-xl-down{height:100%;margin:0;max-width:none;width:100vw}.modal-fullscreen-xl-down .modal-content{border:0;border-radius:0;height:100%}.modal-fullscreen-xl-down .modal-footer,.modal-fullscreen-xl-down .modal-header{border-radius:0}.modal-fullscreen-xl-down .modal-body{overflow-y:auto}}.tooltip{--bs-tooltip-zindex:1080;--bs-tooltip-max-width:200px;--bs-tooltip-padding-x:0.5rem;--bs-tooltip-padding-y:0.25rem;--bs-tooltip-margin: ;--bs-tooltip-font-size:0.875rem;--bs-tooltip-color:var(--bs-body-bg);--bs-tooltip-bg:var(--bs-emphasis-color);--bs-tooltip-border-radius:var(--bs-border-radius);--bs-tooltip-opacity:0.9;--bs-tooltip-arrow-width:0.8rem;--bs-tooltip-arrow-height:0.4rem;word-wrap:break-word;display:block;font-family:var(--bs-font-sans-serif);font-size:var(--bs-tooltip-font-size);font-style:normal;font-weight:400;letter-spacing:normal;line-break:auto;line-height:1.5;margin:var(--bs-tooltip-margin);opacity:0;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;white-space:normal;word-break:normal;word-spacing:normal;z-index:var(--bs-tooltip-zindex)}.tooltip.show{opacity:var(--bs-tooltip-opacity)}.tooltip .tooltip-arrow{display:block;height:var(--bs-tooltip-arrow-height);width:var(--bs-tooltip-arrow-width)}.tooltip .tooltip-arrow:before{border-color:transparent;border-style:solid;content:"";position:absolute}.bs-tooltip-auto[data-popper-placement^=top] .tooltip-arrow,.bs-tooltip-top .tooltip-arrow{bottom:calc(var(--bs-tooltip-arrow-height)*-1)}.bs-tooltip-auto[data-popper-placement^=top] .tooltip-arrow:before,.bs-tooltip-top .tooltip-arrow:before{border-top-color:var(--bs-tooltip-bg);border-width:var(--bs-tooltip-arrow-height) calc(var(--bs-tooltip-arrow-width)*.5) 0;top:-1px}.bs-tooltip-auto[data-popper-placement^=right] .tooltip-arrow,.bs-tooltip-end .tooltip-arrow{height:var(--bs-tooltip-arrow-width);left:calc(var(--bs-tooltip-arrow-height)*-1);width:var(--bs-tooltip-arrow-height)}.bs-tooltip-auto[data-popper-placement^=right] .tooltip-arrow:before,.bs-tooltip-end .tooltip-arrow:before{border-right-color:var(--bs-tooltip-bg);border-width:calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height) calc(var(--bs-tooltip-arrow-width)*.5) 0;right:-1px}.bs-tooltip-auto[data-popper-placement^=bottom] .tooltip-arrow,.bs-tooltip-bottom .tooltip-arrow{top:calc(var(--bs-tooltip-arrow-height)*-1)}.bs-tooltip-auto[data-popper-placement^=bottom] .tooltip-arrow:before,.bs-tooltip-bottom .tooltip-arrow:before{border-bottom-color:var(--bs-tooltip-bg);border-width:0 calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height);bottom:-1px}.bs-tooltip-auto[data-popper-placement^=left] .tooltip-arrow,.bs-tooltip-start .tooltip-arrow{height:var(--bs-tooltip-arrow-width);right:calc(var(--bs-tooltip-arrow-height)*-1);width:var(--bs-tooltip-arrow-height)}.bs-tooltip-auto[data-popper-placement^=left] .tooltip-arrow:before,.bs-tooltip-start .tooltip-arrow:before{border-left-color:var(--bs-tooltip-bg);border-width:calc(var(--bs-tooltip-arrow-width)*.5) 0 calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height);left:-1px}.tooltip-inner{background-color:var(--bs-tooltip-bg);border-radius:var(--bs-tooltip-border-radius);color:var(--bs-tooltip-color);max-width:var(--bs-tooltip-max-width);padding:var(--bs-tooltip-padding-y) var(--bs-tooltip-padding-x);text-align:center}.popover{--bs-popover-zindex:1070;--bs-popover-max-width:276px;--bs-popover-font-size:0.875rem;--bs-popover-bg:var(--bs-body-bg);--bs-popover-border-width:var(--bs-border-width);--bs-popover-border-color:var(--bs-border-color-translucent);--bs-popover-border-radius:var(--bs-border-radius-lg);--bs-popover-inner-border-radius:calc(var(--bs-border-radius-lg) - var(--bs-border-width));--bs-popover-box-shadow:var(--bs-box-shadow);--bs-popover-header-padding-x:1rem;--bs-popover-header-padding-y:0.5rem;--bs-popover-header-font-size:1rem;--bs-popover-header-color:inherit;--bs-popover-header-bg:var(--bs-secondary-bg);--bs-popover-body-padding-x:1rem;--bs-popover-body-padding-y:1rem;--bs-popover-body-color:var(--bs-body-color);--bs-popover-arrow-width:1rem;--bs-popover-arrow-height:0.5rem;--bs-popover-arrow-border:var(--bs-popover-border-color);word-wrap:break-word;background-clip:padding-box;background-color:var(--bs-popover-bg);border:var(--bs-popover-border-width) solid var(--bs-popover-border-color);border-radius:var(--bs-popover-border-radius);display:block;font-family:var(--bs-font-sans-serif);font-size:var(--bs-popover-font-size);font-style:normal;font-weight:400;letter-spacing:normal;line-break:auto;line-height:1.5;max-width:var(--bs-popover-max-width);text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;white-space:normal;word-break:normal;word-spacing:normal;z-index:var(--bs-popover-zindex)}.popover .popover-arrow{display:block;height:var(--bs-popover-arrow-height);width:var(--bs-popover-arrow-width)}.popover .popover-arrow:after,.popover .popover-arrow:before{border:0 solid transparent;content:"";display:block;position:absolute}.bs-popover-auto[data-popper-placement^=top]>.popover-arrow,.bs-popover-top>.popover-arrow{bottom:calc((var(--bs-popover-arrow-height))*-1 - var(--bs-popover-border-width))}.bs-popover-auto[data-popper-placement^=top]>.popover-arrow:after,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow:before,.bs-popover-top>.popover-arrow:after,.bs-popover-top>.popover-arrow:before{border-width:var(--bs-popover-arrow-height) calc(var(--bs-popover-arrow-width)*.5) 0}.bs-popover-auto[data-popper-placement^=top]>.popover-arrow:before,.bs-popover-top>.popover-arrow:before{border-top-color:var(--bs-popover-arrow-border);bottom:0}.bs-popover-auto[data-popper-placement^=top]>.popover-arrow:after,.bs-popover-top>.popover-arrow:after{border-top-color:var(--bs-popover-bg);bottom:var(--bs-popover-border-width)}.bs-popover-auto[data-popper-placement^=right]>.popover-arrow,.bs-popover-end>.popover-arrow{height:var(--bs-popover-arrow-width);left:calc((var(--bs-popover-arrow-height))*-1 - var(--bs-popover-border-width));width:var(--bs-popover-arrow-height)}.bs-popover-auto[data-popper-placement^=right]>.popover-arrow:after,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow:before,.bs-popover-end>.popover-arrow:after,.bs-popover-end>.popover-arrow:before{border-width:calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height) calc(var(--bs-popover-arrow-width)*.5) 0}.bs-popover-auto[data-popper-placement^=right]>.popover-arrow:before,.bs-popover-end>.popover-arrow:before{border-right-color:var(--bs-popover-arrow-border);left:0}.bs-popover-auto[data-popper-placement^=right]>.popover-arrow:after,.bs-popover-end>.popover-arrow:after{border-right-color:var(--bs-popover-bg);left:var(--bs-popover-border-width)}.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow,.bs-popover-bottom>.popover-arrow{top:calc((var(--bs-popover-arrow-height))*-1 - var(--bs-popover-border-width))}.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow:after,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow:before,.bs-popover-bottom>.popover-arrow:after,.bs-popover-bottom>.popover-arrow:before{border-width:0 calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height)}.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow:before,.bs-popover-bottom>.popover-arrow:before{border-bottom-color:var(--bs-popover-arrow-border);top:0}.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow:after,.bs-popover-bottom>.popover-arrow:after{border-bottom-color:var(--bs-popover-bg);top:var(--bs-popover-border-width)}.bs-popover-auto[data-popper-placement^=bottom] .popover-header:before,.bs-popover-bottom .popover-header:before{border-bottom:var(--bs-popover-border-width) solid var(--bs-popover-header-bg);content:"";display:block;left:50%;margin-left:calc(var(--bs-popover-arrow-width)*-.5);position:absolute;top:0;width:var(--bs-popover-arrow-width)}.bs-popover-auto[data-popper-placement^=left]>.popover-arrow,.bs-popover-start>.popover-arrow{height:var(--bs-popover-arrow-width);right:calc((var(--bs-popover-arrow-height))*-1 - var(--bs-popover-border-width));width:var(--bs-popover-arrow-height)}.bs-popover-auto[data-popper-placement^=left]>.popover-arrow:after,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow:before,.bs-popover-start>.popover-arrow:after,.bs-popover-start>.popover-arrow:before{border-width:calc(var(--bs-popover-arrow-width)*.5) 0 calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height)}.bs-popover-auto[data-popper-placement^=left]>.popover-arrow:before,.bs-popover-start>.popover-arrow:before{border-left-color:var(--bs-popover-arrow-border);right:0}.bs-popover-auto[data-popper-placement^=left]>.popover-arrow:after,.bs-popover-start>.popover-arrow:after{border-left-color:var(--bs-popover-bg);right:var(--bs-popover-border-width)}.popover-header{background-color:var(--bs-popover-header-bg);border-bottom:var(--bs-popover-border-width) solid var(--bs-popover-border-color);border-top-left-radius:var(--bs-popover-inner-border-radius);border-top-right-radius:var(--bs-popover-inner-border-radius);color:var(--bs-popover-header-color);font-size:var(--bs-popover-header-font-size);margin-bottom:0;padding:var(--bs-popover-header-padding-y) var(--bs-popover-header-padding-x)}.popover-header:empty{display:none}.popover-body{color:var(--bs-popover-body-color);padding:var(--bs-popover-body-padding-y) var(--bs-popover-body-padding-x)}.carousel{position:relative}.carousel.pointer-event{touch-action:pan-y}.carousel-inner{overflow:hidden;position:relative;width:100%}.carousel-inner:after{clear:both;content:"";display:block}.carousel-item{backface-visibility:hidden;display:none;float:left;margin-right:-100%;position:relative;transition:transform .6s ease-in-out;width:100%}@media(prefers-reduced-motion:reduce){.carousel-item{transition:none}}.carousel-item-next,.carousel-item-prev,.carousel-item.active{display:block}.active.carousel-item-end,.carousel-item-next:not(.carousel-item-start){transform:translateX(100%)}.active.carousel-item-start,.carousel-item-prev:not(.carousel-item-end){transform:translateX(-100%)}.carousel-fade .carousel-item{opacity:0;transform:none;transition-property:opacity}.carousel-fade .carousel-item-next.carousel-item-start,.carousel-fade .carousel-item-prev.carousel-item-end,.carousel-fade .carousel-item.active{opacity:1;z-index:1}.carousel-fade .active.carousel-item-end,.carousel-fade .active.carousel-item-start{opacity:0;transition:opacity 0s .6s;z-index:0}@media(prefers-reduced-motion:reduce){.carousel-fade .active.carousel-item-end,.carousel-fade .active.carousel-item-start{transition:none}}.carousel-control-next,.carousel-control-prev{align-items:center;background:none;border:0;bottom:0;color:#fff;display:flex;justify-content:center;opacity:.5;padding:0;position:absolute;text-align:center;top:0;transition:opacity .15s ease;width:15%;z-index:1}@media(prefers-reduced-motion:reduce){.carousel-control-next,.carousel-control-prev{transition:none}}.carousel-control-next:focus,.carousel-control-next:hover,.carousel-control-prev:focus,.carousel-control-prev:hover{color:#fff;opacity:.9;outline:0;text-decoration:none}.carousel-control-prev{left:0}.carousel-control-next{right:0}.carousel-control-next-icon,.carousel-control-prev-icon{background-position:50%;background-repeat:no-repeat;background-size:100% 100%;display:inline-block;height:2rem;width:2rem}.carousel-control-prev-icon{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23fff'%3E%3Cpath d='M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z'/%3E%3C/svg%3E")}.carousel-control-next-icon{background-image:url("data:image/svg+xml;charset=utf-8,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23fff'%3E%3Cpath d='M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z'/%3E%3C/svg%3E")}.carousel-indicators{bottom:0;display:flex;justify-content:center;left:0;margin-bottom:1rem;margin-left:15%;margin-right:15%;padding:0;position:absolute;right:0;z-index:2}.carousel-indicators [data-bs-target]{background-clip:padding-box;background-color:#fff;border:0;border-bottom:10px solid transparent;border-top:10px solid transparent;box-sizing:content-box;cursor:pointer;flex:0 1 auto;height:3px;margin-left:3px;margin-right:3px;opacity:.5;padding:0;text-indent:-999px;transition:opacity .6s ease;width:30px}@media(prefers-reduced-motion:reduce){.carousel-indicators [data-bs-target]{transition:none}}.carousel-indicators .active{opacity:1}.carousel-caption{bottom:1.25rem;color:#fff;left:15%;padding-bottom:1.25rem;padding-top:1.25rem;position:absolute;right:15%;text-align:center}.carousel-dark .carousel-control-next-icon,.carousel-dark .carousel-control-prev-icon{filter:invert(1) grayscale(100)}.carousel-dark .carousel-indicators [data-bs-target]{background-color:#000}.carousel-dark .carousel-caption{color:#000}[data-bs-theme=dark] .carousel .carousel-control-next-icon,[data-bs-theme=dark] .carousel .carousel-control-prev-icon,[data-bs-theme=dark].carousel .carousel-control-next-icon,[data-bs-theme=dark].carousel .carousel-control-prev-icon{filter:invert(1) grayscale(100)}[data-bs-theme=dark] .carousel .carousel-indicators [data-bs-target],[data-bs-theme=dark].carousel .carousel-indicators [data-bs-target]{background-color:#000}[data-bs-theme=dark] .carousel .carousel-caption,[data-bs-theme=dark].carousel .carousel-caption{color:#000}.spinner-border,.spinner-grow{animation:var(--bs-spinner-animation-speed) linear infinite var(--bs-spinner-animation-name);border-radius:50%;display:inline-block;height:var(--bs-spinner-height);vertical-align:var(--bs-spinner-vertical-align);width:var(--bs-spinner-width)}@keyframes spinner-border{to{transform:rotate(1turn)}}.spinner-border{--bs-spinner-width:2rem;--bs-spinner-height:2rem;--bs-spinner-vertical-align:-0.125em;--bs-spinner-border-width:0.25em;--bs-spinner-animation-speed:0.75s;--bs-spinner-animation-name:spinner-border;border-right-color:currentcolor;border:var(--bs-spinner-border-width) solid;border-right:var(--bs-spinner-border-width) solid transparent}.spinner-border-sm{--bs-spinner-width:1rem;--bs-spinner-height:1rem;--bs-spinner-border-width:0.2em}@keyframes spinner-grow{0%{transform:scale(0)}50%{opacity:1;transform:none}}.spinner-grow{--bs-spinner-width:2rem;--bs-spinner-height:2rem;--bs-spinner-vertical-align:-0.125em;--bs-spinner-animation-speed:0.75s;--bs-spinner-animation-name:spinner-grow;background-color:currentcolor;opacity:0}.spinner-grow-sm{--bs-spinner-width:1rem;--bs-spinner-height:1rem}@media(prefers-reduced-motion:reduce){.spinner-border,.spinner-grow{--bs-spinner-animation-speed:1.5s}}.offcanvas,.offcanvas-lg,.offcanvas-md,.offcanvas-sm,.offcanvas-xl{--bs-offcanvas-zindex:1045;--bs-offcanvas-width:400px;--bs-offcanvas-height:30vh;--bs-offcanvas-padding-x:1rem;--bs-offcanvas-padding-y:1rem;--bs-offcanvas-color:var(--bs-body-color);--bs-offcanvas-bg:var(--bs-body-bg);--bs-offcanvas-border-width:var(--bs-border-width);--bs-offcanvas-border-color:var(--bs-border-color-translucent);--bs-offcanvas-box-shadow:var(--bs-box-shadow-sm);--bs-offcanvas-transition:transform 0.3s ease-in-out;--bs-offcanvas-title-line-height:1.5}@media(max-width:539.98px){.offcanvas-sm{background-clip:padding-box;background-color:var(--bs-offcanvas-bg);bottom:0;color:var(--bs-offcanvas-color);display:flex;flex-direction:column;max-width:100%;outline:0;position:fixed;transition:var(--bs-offcanvas-transition);visibility:hidden;z-index:var(--bs-offcanvas-zindex)}}@media(max-width:539.98px)and (prefers-reduced-motion:reduce){.offcanvas-sm{transition:none}}@media(max-width:539.98px){.offcanvas-sm.offcanvas-start{border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);left:0;top:0;transform:translateX(-100%);width:var(--bs-offcanvas-width)}.offcanvas-sm.offcanvas-end{border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);right:0;top:0;transform:translateX(100%);width:var(--bs-offcanvas-width)}.offcanvas-sm.offcanvas-top{border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);top:0;transform:translateY(-100%)}.offcanvas-sm.offcanvas-bottom,.offcanvas-sm.offcanvas-top{height:var(--bs-offcanvas-height);left:0;max-height:100%;right:0}.offcanvas-sm.offcanvas-bottom{border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-sm.show:not(.hiding),.offcanvas-sm.showing{transform:none}.offcanvas-sm.hiding,.offcanvas-sm.show,.offcanvas-sm.showing{visibility:visible}}@media(min-width:540px){.offcanvas-sm{--bs-offcanvas-height:auto;--bs-offcanvas-border-width:0;background-color:transparent!important}.offcanvas-sm .offcanvas-header{display:none}.offcanvas-sm .offcanvas-body{background-color:transparent!important;display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(max-width:719.98px){.offcanvas-md{background-clip:padding-box;background-color:var(--bs-offcanvas-bg);bottom:0;color:var(--bs-offcanvas-color);display:flex;flex-direction:column;max-width:100%;outline:0;position:fixed;transition:var(--bs-offcanvas-transition);visibility:hidden;z-index:var(--bs-offcanvas-zindex)}}@media(max-width:719.98px)and (prefers-reduced-motion:reduce){.offcanvas-md{transition:none}}@media(max-width:719.98px){.offcanvas-md.offcanvas-start{border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);left:0;top:0;transform:translateX(-100%);width:var(--bs-offcanvas-width)}.offcanvas-md.offcanvas-end{border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);right:0;top:0;transform:translateX(100%);width:var(--bs-offcanvas-width)}.offcanvas-md.offcanvas-top{border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);top:0;transform:translateY(-100%)}.offcanvas-md.offcanvas-bottom,.offcanvas-md.offcanvas-top{height:var(--bs-offcanvas-height);left:0;max-height:100%;right:0}.offcanvas-md.offcanvas-bottom{border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-md.show:not(.hiding),.offcanvas-md.showing{transform:none}.offcanvas-md.hiding,.offcanvas-md.show,.offcanvas-md.showing{visibility:visible}}@media(min-width:720px){.offcanvas-md{--bs-offcanvas-height:auto;--bs-offcanvas-border-width:0;background-color:transparent!important}.offcanvas-md .offcanvas-header{display:none}.offcanvas-md .offcanvas-body{background-color:transparent!important;display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(max-width:959.98px){.offcanvas-lg{background-clip:padding-box;background-color:var(--bs-offcanvas-bg);bottom:0;color:var(--bs-offcanvas-color);display:flex;flex-direction:column;max-width:100%;outline:0;position:fixed;transition:var(--bs-offcanvas-transition);visibility:hidden;z-index:var(--bs-offcanvas-zindex)}}@media(max-width:959.98px)and (prefers-reduced-motion:reduce){.offcanvas-lg{transition:none}}@media(max-width:959.98px){.offcanvas-lg.offcanvas-start{border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);left:0;top:0;transform:translateX(-100%);width:var(--bs-offcanvas-width)}.offcanvas-lg.offcanvas-end{border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);right:0;top:0;transform:translateX(100%);width:var(--bs-offcanvas-width)}.offcanvas-lg.offcanvas-top{border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);top:0;transform:translateY(-100%)}.offcanvas-lg.offcanvas-bottom,.offcanvas-lg.offcanvas-top{height:var(--bs-offcanvas-height);left:0;max-height:100%;right:0}.offcanvas-lg.offcanvas-bottom{border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-lg.show:not(.hiding),.offcanvas-lg.showing{transform:none}.offcanvas-lg.hiding,.offcanvas-lg.show,.offcanvas-lg.showing{visibility:visible}}@media(min-width:960px){.offcanvas-lg{--bs-offcanvas-height:auto;--bs-offcanvas-border-width:0;background-color:transparent!important}.offcanvas-lg .offcanvas-header{display:none}.offcanvas-lg .offcanvas-body{background-color:transparent!important;display:flex;flex-grow:0;overflow-y:visible;padding:0}}@media(max-width:1199.98px){.offcanvas-xl{background-clip:padding-box;background-color:var(--bs-offcanvas-bg);bottom:0;color:var(--bs-offcanvas-color);display:flex;flex-direction:column;max-width:100%;outline:0;position:fixed;transition:var(--bs-offcanvas-transition);visibility:hidden;z-index:var(--bs-offcanvas-zindex)}}@media(max-width:1199.98px)and (prefers-reduced-motion:reduce){.offcanvas-xl{transition:none}}@media(max-width:1199.98px){.offcanvas-xl.offcanvas-start{border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);left:0;top:0;transform:translateX(-100%);width:var(--bs-offcanvas-width)}.offcanvas-xl.offcanvas-end{border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);right:0;top:0;transform:translateX(100%);width:var(--bs-offcanvas-width)}.offcanvas-xl.offcanvas-top{border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);top:0;transform:translateY(-100%)}.offcanvas-xl.offcanvas-bottom,.offcanvas-xl.offcanvas-top{height:var(--bs-offcanvas-height);left:0;max-height:100%;right:0}.offcanvas-xl.offcanvas-bottom{border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-xl.show:not(.hiding),.offcanvas-xl.showing{transform:none}.offcanvas-xl.hiding,.offcanvas-xl.show,.offcanvas-xl.showing{visibility:visible}}@media(min-width:1200px){.offcanvas-xl{--bs-offcanvas-height:auto;--bs-offcanvas-border-width:0;background-color:transparent!important}.offcanvas-xl .offcanvas-header{display:none}.offcanvas-xl .offcanvas-body{background-color:transparent!important;display:flex;flex-grow:0;overflow-y:visible;padding:0}}.offcanvas{background-clip:padding-box;background-color:var(--bs-offcanvas-bg);bottom:0;color:var(--bs-offcanvas-color);display:flex;flex-direction:column;max-width:100%;outline:0;position:fixed;transition:var(--bs-offcanvas-transition);visibility:hidden;z-index:var(--bs-offcanvas-zindex)}@media(prefers-reduced-motion:reduce){.offcanvas{transition:none}}.offcanvas.offcanvas-start{border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);left:0;top:0;transform:translateX(-100%);width:var(--bs-offcanvas-width)}.offcanvas.offcanvas-end{border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);right:0;top:0;transform:translateX(100%);width:var(--bs-offcanvas-width)}.offcanvas.offcanvas-top{border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);top:0;transform:translateY(-100%)}.offcanvas.offcanvas-bottom,.offcanvas.offcanvas-top{height:var(--bs-offcanvas-height);left:0;max-height:100%;right:0}.offcanvas.offcanvas-bottom{border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas.show:not(.hiding),.offcanvas.showing{transform:none}.offcanvas.hiding,.offcanvas.show,.offcanvas.showing{visibility:visible}.offcanvas-backdrop{background-color:#000;height:100vh;left:0;position:fixed;top:0;width:100vw;z-index:1040}.offcanvas-backdrop.fade{opacity:0}.offcanvas-backdrop.show{opacity:.5}.offcanvas-header{align-items:center;display:flex;justify-content:space-between;padding:var(--bs-offcanvas-padding-y) var(--bs-offcanvas-padding-x)}.offcanvas-header .btn-close{margin-bottom:calc(var(--bs-offcanvas-padding-y)*-.5);margin-right:calc(var(--bs-offcanvas-padding-x)*-.5);margin-top:calc(var(--bs-offcanvas-padding-y)*-.5);padding:calc(var(--bs-offcanvas-padding-y)*.5) calc(var(--bs-offcanvas-padding-x)*.5)}.offcanvas-title{line-height:var(--bs-offcanvas-title-line-height);margin-bottom:0}.offcanvas-body{flex-grow:1;overflow-y:auto;padding:var(--bs-offcanvas-padding-y) var(--bs-offcanvas-padding-x)}.placeholder{background-color:currentcolor;cursor:wait;display:inline-block;min-height:1em;opacity:.5;vertical-align:middle}.placeholder.btn:before{content:"";display:inline-block}.placeholder-xs{min-height:.6em}.placeholder-sm{min-height:.8em}.placeholder-lg{min-height:1.2em}.placeholder-glow .placeholder{animation:placeholder-glow 2s ease-in-out infinite}@keyframes placeholder-glow{50%{opacity:.2}}.placeholder-wave{animation:placeholder-wave 2s linear infinite;mask-image:linear-gradient(130deg,#000 55%,rgba(0,0,0,.8) 75%,#000 95%);mask-size:200% 100%}@keyframes placeholder-wave{to{mask-position:-200% 0}}.clearfix:after{clear:both;content:"";display:block}.text-bg-primary{background-color:RGBA(var(--bs-primary-rgb),var(--bs-bg-opacity,1))!important;color:#fff!important}.text-bg-secondary{background-color:RGBA(var(--bs-secondary-rgb),var(--bs-bg-opacity,1))!important;color:#fff!important}.text-bg-success{background-color:RGBA(var(--bs-success-rgb),var(--bs-bg-opacity,1))!important;color:#fff!important}.text-bg-info{background-color:RGBA(var(--bs-info-rgb),var(--bs-bg-opacity,1))!important;color:#000!important}.text-bg-warning{background-color:RGBA(var(--bs-warning-rgb),var(--bs-bg-opacity,1))!important;color:#000!important}.text-bg-danger{background-color:RGBA(var(--bs-danger-rgb),var(--bs-bg-opacity,1))!important;color:#fff!important}.text-bg-light{background-color:RGBA(var(--bs-light-rgb),var(--bs-bg-opacity,1))!important;color:#000!important}.text-bg-dark{background-color:RGBA(var(--bs-dark-rgb),var(--bs-bg-opacity,1))!important;color:#fff!important}.link-primary{color:RGBA(var(--bs-primary-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-primary-rgb),var(--bs-link-underline-opacity,1))!important}.link-primary:focus,.link-primary:hover{color:RGBA(10,88,202,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(10,88,202,var(--bs-link-underline-opacity,1))!important}.link-secondary{color:RGBA(var(--bs-secondary-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-secondary-rgb),var(--bs-link-underline-opacity,1))!important}.link-secondary:focus,.link-secondary:hover{color:RGBA(86,94,100,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(86,94,100,var(--bs-link-underline-opacity,1))!important}.link-success{color:RGBA(var(--bs-success-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-success-rgb),var(--bs-link-underline-opacity,1))!important}.link-success:focus,.link-success:hover{color:RGBA(20,108,67,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(20,108,67,var(--bs-link-underline-opacity,1))!important}.link-info{color:RGBA(var(--bs-info-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-info-rgb),var(--bs-link-underline-opacity,1))!important}.link-info:focus,.link-info:hover{color:RGBA(61,213,243,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(61,213,243,var(--bs-link-underline-opacity,1))!important}.link-warning{color:RGBA(var(--bs-warning-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-warning-rgb),var(--bs-link-underline-opacity,1))!important}.link-warning:focus,.link-warning:hover{color:RGBA(255,205,57,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(255,205,57,var(--bs-link-underline-opacity,1))!important}.link-danger{color:RGBA(var(--bs-danger-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-danger-rgb),var(--bs-link-underline-opacity,1))!important}.link-danger:focus,.link-danger:hover{color:RGBA(176,42,55,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(176,42,55,var(--bs-link-underline-opacity,1))!important}.link-light{color:RGBA(var(--bs-light-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-light-rgb),var(--bs-link-underline-opacity,1))!important}.link-light:focus,.link-light:hover{color:RGBA(249,250,251,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(249,250,251,var(--bs-link-underline-opacity,1))!important}.link-dark{color:RGBA(var(--bs-dark-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-dark-rgb),var(--bs-link-underline-opacity,1))!important}.link-dark:focus,.link-dark:hover{color:RGBA(26,30,33,var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(26,30,33,var(--bs-link-underline-opacity,1))!important}.link-body-emphasis{color:RGBA(var(--bs-emphasis-color-rgb),var(--bs-link-opacity,1))!important;text-decoration-color:RGBA(var(--bs-emphasis-color-rgb),var(--bs-link-underline-opacity,1))!important}.link-body-emphasis:focus,.link-body-emphasis:hover{color:RGBA(var(--bs-emphasis-color-rgb),var(--bs-link-opacity,.75))!important;text-decoration-color:RGBA(var(--bs-emphasis-color-rgb),var(--bs-link-underline-opacity,.75))!important}.focus-ring:focus{box-shadow:var(--bs-focus-ring-x,0) var(--bs-focus-ring-y,0) var(--bs-focus-ring-blur,0) var(--bs-focus-ring-width) var(--bs-focus-ring-color);outline:0}.icon-link{align-items:center;backface-visibility:hidden;display:inline-flex;gap:.375rem;text-decoration-color:rgba(var(--bs-link-color-rgb),var(--bs-link-opacity,.5));text-underline-offset:.25em}.icon-link>.bi{fill:currentcolor;flex-shrink:0;height:1em;transition:transform .2s ease-in-out;width:1em}@media(prefers-reduced-motion:reduce){.icon-link>.bi{transition:none}}.icon-link-hover:focus-visible>.bi,.icon-link-hover:hover>.bi{transform:var(--bs-icon-link-transform,translate3d(.25em,0,0))}.ratio{position:relative;width:100%}.ratio:before{content:"";display:block;padding-top:var(--bs-aspect-ratio)}.ratio>*{height:100%;left:0;position:absolute;top:0;width:100%}.ratio-1x1{--bs-aspect-ratio:100%}.ratio-4x3{--bs-aspect-ratio:75%}.ratio-16x9{--bs-aspect-ratio:56.25%}.ratio-21x9{--bs-aspect-ratio:42.8571428571%}.fixed-top{top:0}.fixed-bottom,.fixed-top{left:0;position:fixed;right:0;z-index:1030}.fixed-bottom{bottom:0}.sticky-top{top:0}.sticky-bottom,.sticky-top{position:sticky;z-index:1020}.sticky-bottom{bottom:0}@media(min-width:540px){.sticky-sm-top{position:sticky;top:0;z-index:1020}.sticky-sm-bottom{bottom:0;position:sticky;z-index:1020}}@media(min-width:720px){.sticky-md-top{position:sticky;top:0;z-index:1020}.sticky-md-bottom{bottom:0;position:sticky;z-index:1020}}@media(min-width:960px){.sticky-lg-top{position:sticky;top:0;z-index:1020}.sticky-lg-bottom{bottom:0;position:sticky;z-index:1020}}@media(min-width:1200px){.sticky-xl-top{position:sticky;top:0;z-index:1020}.sticky-xl-bottom{bottom:0;position:sticky;z-index:1020}}.hstack{align-items:center;flex-direction:row}.hstack,.vstack{align-self:stretch;display:flex}.vstack{flex:1 1 auto;flex-direction:column}.visually-hidden,.visually-hidden-focusable:not(:focus):not(:focus-within){clip:rect(0,0,0,0)!important;border:0!important;height:1px!important;margin:-1px!important;overflow:hidden!important;padding:0!important;white-space:nowrap!important;width:1px!important}.visually-hidden-focusable:not(:focus):not(:focus-within):not(caption),.visually-hidden:not(caption){position:absolute!important}.stretched-link:after{bottom:0;content:"";left:0;position:absolute;right:0;top:0;z-index:1}.text-truncate{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.vr{align-self:stretch;background-color:currentcolor;display:inline-block;min-height:1em;opacity:.25;width:var(--bs-border-width)}.align-baseline{vertical-align:baseline!important}.align-top{vertical-align:top!important}.align-middle{vertical-align:middle!important}.align-bottom{vertical-align:bottom!important}.align-text-bottom{vertical-align:text-bottom!important}.align-text-top{vertical-align:text-top!important}.float-start{float:left!important}.float-end{float:right!important}.float-none{float:none!important}.object-fit-contain{object-fit:contain!important}.object-fit-cover{object-fit:cover!important}.object-fit-fill{object-fit:fill!important}.object-fit-scale{object-fit:scale-down!important}.object-fit-none{object-fit:none!important}.opacity-0{opacity:0!important}.opacity-25{opacity:.25!important}.opacity-50{opacity:.5!important}.opacity-75{opacity:.75!important}.opacity-100{opacity:1!important}.overflow-auto{overflow:auto!important}.overflow-hidden{overflow:hidden!important}.overflow-visible{overflow:visible!important}.overflow-scroll{overflow:scroll!important}.overflow-x-auto{overflow-x:auto!important}.overflow-x-hidden{overflow-x:hidden!important}.overflow-x-visible{overflow-x:visible!important}.overflow-x-scroll{overflow-x:scroll!important}.overflow-y-auto{overflow-y:auto!important}.overflow-y-hidden{overflow-y:hidden!important}.overflow-y-visible{overflow-y:visible!important}.overflow-y-scroll{overflow-y:scroll!important}.d-inline{display:inline!important}.d-inline-block{display:inline-block!important}.d-block{display:block!important}.d-grid{display:grid!important}.d-inline-grid{display:inline-grid!important}.d-table{display:table!important}.d-table-row{display:table-row!important}.d-table-cell{display:table-cell!important}.d-flex{display:flex!important}.d-inline-flex{display:inline-flex!important}.d-none{display:none!important}.shadow{box-shadow:var(--bs-box-shadow)!important}.shadow-sm{box-shadow:var(--bs-box-shadow-sm)!important}.shadow-lg{box-shadow:var(--bs-box-shadow-lg)!important}.shadow-none{box-shadow:none!important}.focus-ring-primary{--bs-focus-ring-color:rgba(var(--bs-primary-rgb),var(--bs-focus-ring-opacity))}.focus-ring-secondary{--bs-focus-ring-color:rgba(var(--bs-secondary-rgb),var(--bs-focus-ring-opacity))}.focus-ring-success{--bs-focus-ring-color:rgba(var(--bs-success-rgb),var(--bs-focus-ring-opacity))}.focus-ring-info{--bs-focus-ring-color:rgba(var(--bs-info-rgb),var(--bs-focus-ring-opacity))}.focus-ring-warning{--bs-focus-ring-color:rgba(var(--bs-warning-rgb),var(--bs-focus-ring-opacity))}.focus-ring-danger{--bs-focus-ring-color:rgba(var(--bs-danger-rgb),var(--bs-focus-ring-opacity))}.focus-ring-light{--bs-focus-ring-color:rgba(var(--bs-light-rgb),var(--bs-focus-ring-opacity))}.focus-ring-dark{--bs-focus-ring-color:rgba(var(--bs-dark-rgb),var(--bs-focus-ring-opacity))}.position-static{position:static!important}.position-relative{position:relative!important}.position-absolute{position:absolute!important}.position-fixed{position:fixed!important}.position-sticky{position:sticky!important}.top-0{top:0!important}.top-50{top:50%!important}.top-100{top:100%!important}.bottom-0{bottom:0!important}.bottom-50{bottom:50%!important}.bottom-100{bottom:100%!important}.start-0{left:0!important}.start-50{left:50%!important}.start-100{left:100%!important}.end-0{right:0!important}.end-50{right:50%!important}.end-100{right:100%!important}.translate-middle{transform:translate(-50%,-50%)!important}.translate-middle-x{transform:translateX(-50%)!important}.translate-middle-y{transform:translateY(-50%)!important}.border{border:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color)!important}.border-0{border:0!important}.border-top{border-top:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color)!important}.border-top-0{border-top:0!important}.border-end{border-right:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color)!important}.border-end-0{border-right:0!important}.border-bottom{border-bottom:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color)!important}.border-bottom-0{border-bottom:0!important}.border-start{border-left:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color)!important}.border-start-0{border-left:0!important}.border-primary{--bs-border-opacity:1;border-color:rgba(var(--bs-primary-rgb),var(--bs-border-opacity))!important}.border-secondary{--bs-border-opacity:1;border-color:rgba(var(--bs-secondary-rgb),var(--bs-border-opacity))!important}.border-success{--bs-border-opacity:1;border-color:rgba(var(--bs-success-rgb),var(--bs-border-opacity))!important}.border-info{--bs-border-opacity:1;border-color:rgba(var(--bs-info-rgb),var(--bs-border-opacity))!important}.border-warning{--bs-border-opacity:1;border-color:rgba(var(--bs-warning-rgb),var(--bs-border-opacity))!important}.border-danger{--bs-border-opacity:1;border-color:rgba(var(--bs-danger-rgb),var(--bs-border-opacity))!important}.border-light{--bs-border-opacity:1;border-color:rgba(var(--bs-light-rgb),var(--bs-border-opacity))!important}.border-dark{--bs-border-opacity:1;border-color:rgba(var(--bs-dark-rgb),var(--bs-border-opacity))!important}.border-black{--bs-border-opacity:1;border-color:rgba(var(--bs-black-rgb),var(--bs-border-opacity))!important}.border-white{--bs-border-opacity:1;border-color:rgba(var(--bs-white-rgb),var(--bs-border-opacity))!important}.border-primary-subtle{border-color:var(--bs-primary-border-subtle)!important}.border-secondary-subtle{border-color:var(--bs-secondary-border-subtle)!important}.border-success-subtle{border-color:var(--bs-success-border-subtle)!important}.border-info-subtle{border-color:var(--bs-info-border-subtle)!important}.border-warning-subtle{border-color:var(--bs-warning-border-subtle)!important}.border-danger-subtle{border-color:var(--bs-danger-border-subtle)!important}.border-light-subtle{border-color:var(--bs-light-border-subtle)!important}.border-dark-subtle{border-color:var(--bs-dark-border-subtle)!important}.border-1{border-width:1px!important}.border-2{border-width:2px!important}.border-3{border-width:3px!important}.border-4{border-width:4px!important}.border-5{border-width:5px!important}.border-opacity-10{--bs-border-opacity:0.1}.border-opacity-25{--bs-border-opacity:0.25}.border-opacity-50{--bs-border-opacity:0.5}.border-opacity-75{--bs-border-opacity:0.75}.border-opacity-100{--bs-border-opacity:1}.w-25{width:25%!important}.w-50{width:50%!important}.w-75{width:75%!important}.w-100{width:100%!important}.w-auto{width:auto!important}.mw-100{max-width:100%!important}.vw-100{width:100vw!important}.min-vw-100{min-width:100vw!important}.h-25{height:25%!important}.h-50{height:50%!important}.h-75{height:75%!important}.h-100{height:100%!important}.h-auto{height:auto!important}.mh-100{max-height:100%!important}.vh-100{height:100vh!important}.min-vh-100{min-height:100vh!important}.flex-fill{flex:1 1 auto!important}.flex-row{flex-direction:row!important}.flex-column{flex-direction:column!important}.flex-row-reverse{flex-direction:row-reverse!important}.flex-column-reverse{flex-direction:column-reverse!important}.flex-grow-0{flex-grow:0!important}.flex-grow-1{flex-grow:1!important}.flex-shrink-0{flex-shrink:0!important}.flex-shrink-1{flex-shrink:1!important}.flex-wrap{flex-wrap:wrap!important}.flex-nowrap{flex-wrap:nowrap!important}.flex-wrap-reverse{flex-wrap:wrap-reverse!important}.justify-content-start{justify-content:flex-start!important}.justify-content-end{justify-content:flex-end!important}.justify-content-center{justify-content:center!important}.justify-content-between{justify-content:space-between!important}.justify-content-around{justify-content:space-around!important}.justify-content-evenly{justify-content:space-evenly!important}.align-items-start{align-items:flex-start!important}.align-items-end{align-items:flex-end!important}.align-items-center{align-items:center!important}.align-items-baseline{align-items:baseline!important}.align-items-stretch{align-items:stretch!important}.align-content-start{align-content:flex-start!important}.align-content-end{align-content:flex-end!important}.align-content-center{align-content:center!important}.align-content-between{align-content:space-between!important}.align-content-around{align-content:space-around!important}.align-content-stretch{align-content:stretch!important}.align-self-auto{align-self:auto!important}.align-self-start{align-self:flex-start!important}.align-self-end{align-self:flex-end!important}.align-self-center{align-self:center!important}.align-self-baseline{align-self:baseline!important}.align-self-stretch{align-self:stretch!important}.order-first{order:-1!important}.order-0{order:0!important}.order-1{order:1!important}.order-2{order:2!important}.order-3{order:3!important}.order-4{order:4!important}.order-5{order:5!important}.order-last{order:6!important}.m-0{margin:0!important}.m-1{margin:.25rem!important}.m-2{margin:.5rem!important}.m-3{margin:1rem!important}.m-4{margin:1.5rem!important}.m-5{margin:3rem!important}.m-auto{margin:auto!important}.mx-0{margin-left:0!important;margin-right:0!important}.mx-1{margin-left:.25rem!important;margin-right:.25rem!important}.mx-2{margin-left:.5rem!important;margin-right:.5rem!important}.mx-3{margin-left:1rem!important;margin-right:1rem!important}.mx-4{margin-left:1.5rem!important;margin-right:1.5rem!important}.mx-5{margin-left:3rem!important;margin-right:3rem!important}.mx-auto{margin-left:auto!important;margin-right:auto!important}.my-0{margin-bottom:0!important;margin-top:0!important}.my-1{margin-bottom:.25rem!important;margin-top:.25rem!important}.my-2{margin-bottom:.5rem!important;margin-top:.5rem!important}.my-3{margin-bottom:1rem!important;margin-top:1rem!important}.my-4{margin-bottom:1.5rem!important;margin-top:1.5rem!important}.my-5{margin-bottom:3rem!important;margin-top:3rem!important}.my-auto{margin-bottom:auto!important;margin-top:auto!important}.mt-0{margin-top:0!important}.mt-1{margin-top:.25rem!important}.mt-2{margin-top:.5rem!important}.mt-3{margin-top:1rem!important}.mt-4{margin-top:1.5rem!important}.mt-5{margin-top:3rem!important}.mt-auto{margin-top:auto!important}.me-0{margin-right:0!important}.me-1{margin-right:.25rem!important}.me-2{margin-right:.5rem!important}.me-3{margin-right:1rem!important}.me-4{margin-right:1.5rem!important}.me-5{margin-right:3rem!important}.me-auto{margin-right:auto!important}.mb-0{margin-bottom:0!important}.mb-1{margin-bottom:.25rem!important}.mb-2{margin-bottom:.5rem!important}.mb-3{margin-bottom:1rem!important}.mb-4{margin-bottom:1.5rem!important}.mb-5{margin-bottom:3rem!important}.mb-auto{margin-bottom:auto!important}.ms-0{margin-left:0!important}.ms-1{margin-left:.25rem!important}.ms-2{margin-left:.5rem!important}.ms-3{margin-left:1rem!important}.ms-4{margin-left:1.5rem!important}.ms-5{margin-left:3rem!important}.ms-auto{margin-left:auto!important}.p-0{padding:0!important}.p-1{padding:.25rem!important}.p-2{padding:.5rem!important}.p-3{padding:1rem!important}.p-4{padding:1.5rem!important}.p-5{padding:3rem!important}.px-0{padding-left:0!important;padding-right:0!important}.px-1{padding-left:.25rem!important;padding-right:.25rem!important}.px-2{padding-left:.5rem!important;padding-right:.5rem!important}.px-3{padding-left:1rem!important;padding-right:1rem!important}.px-4{padding-left:1.5rem!important;padding-right:1.5rem!important}.px-5{padding-left:3rem!important;padding-right:3rem!important}.py-0{padding-bottom:0!important;padding-top:0!important}.py-1{padding-bottom:.25rem!important;padding-top:.25rem!important}.py-2{padding-bottom:.5rem!important;padding-top:.5rem!important}.py-3{padding-bottom:1rem!important;padding-top:1rem!important}.py-4{padding-bottom:1.5rem!important;padding-top:1.5rem!important}.py-5{padding-bottom:3rem!important;padding-top:3rem!important}.pt-0{padding-top:0!important}.pt-1{padding-top:.25rem!important}.pt-2{padding-top:.5rem!important}.pt-3{padding-top:1rem!important}.pt-4{padding-top:1.5rem!important}.pt-5{padding-top:3rem!important}.pe-0{padding-right:0!important}.pe-1{padding-right:.25rem!important}.pe-2{padding-right:.5rem!important}.pe-3{padding-right:1rem!important}.pe-4{padding-right:1.5rem!important}.pe-5{padding-right:3rem!important}.pb-0{padding-bottom:0!important}.pb-1{padding-bottom:.25rem!important}.pb-2{padding-bottom:.5rem!important}.pb-3{padding-bottom:1rem!important}.pb-4{padding-bottom:1.5rem!important}.pb-5{padding-bottom:3rem!important}.ps-0{padding-left:0!important}.ps-1{padding-left:.25rem!important}.ps-2{padding-left:.5rem!important}.ps-3{padding-left:1rem!important}.ps-4{padding-left:1.5rem!important}.ps-5{padding-left:3rem!important}.gap-0{gap:0!important}.gap-1{gap:.25rem!important}.gap-2{gap:.5rem!important}.gap-3{gap:1rem!important}.gap-4{gap:1.5rem!important}.gap-5{gap:3rem!important}.row-gap-0{row-gap:0!important}.row-gap-1{row-gap:.25rem!important}.row-gap-2{row-gap:.5rem!important}.row-gap-3{row-gap:1rem!important}.row-gap-4{row-gap:1.5rem!important}.row-gap-5{row-gap:3rem!important}.column-gap-0{column-gap:0!important}.column-gap-1{column-gap:.25rem!important}.column-gap-2{column-gap:.5rem!important}.column-gap-3{column-gap:1rem!important}.column-gap-4{column-gap:1.5rem!important}.column-gap-5{column-gap:3rem!important}.font-monospace{font-family:var(--bs-font-monospace)!important}.fs-1{font-size:calc(1.375rem + 1.5vw)!important}.fs-2{font-size:calc(1.325rem + .9vw)!important}.fs-3{font-size:calc(1.3rem + .6vw)!important}.fs-4{font-size:calc(1.275rem + .3vw)!important}.fs-5{font-size:1.25rem!important}.fs-6{font-size:1rem!important}.fst-italic{font-style:italic!important}.fst-normal{font-style:normal!important}.fw-lighter{font-weight:lighter!important}.fw-light{font-weight:300!important}.fw-normal{font-weight:400!important}.fw-medium{font-weight:500!important}.fw-semibold{font-weight:600!important}.fw-bold{font-weight:700!important}.fw-bolder{font-weight:bolder!important}.lh-1{line-height:1!important}.lh-sm{line-height:1.25!important}.lh-base{line-height:1.5!important}.lh-lg{line-height:2!important}.text-start{text-align:left!important}.text-end{text-align:right!important}.text-center{text-align:center!important}.text-decoration-none{text-decoration:none!important}.text-decoration-underline{text-decoration:underline!important}.text-decoration-line-through{text-decoration:line-through!important}.text-lowercase{text-transform:lowercase!important}.text-uppercase{text-transform:uppercase!important}.text-capitalize{text-transform:capitalize!important}.text-wrap{white-space:normal!important}.text-nowrap{white-space:nowrap!important}.text-break{word-wrap:break-word!important;word-break:break-word!important}.text-primary{--bs-text-opacity:1;color:rgba(var(--bs-primary-rgb),var(--bs-text-opacity))!important}.text-secondary{--bs-text-opacity:1;color:rgba(var(--bs-secondary-rgb),var(--bs-text-opacity))!important}.text-success{--bs-text-opacity:1;color:rgba(var(--bs-success-rgb),var(--bs-text-opacity))!important}.text-info{--bs-text-opacity:1;color:rgba(var(--bs-info-rgb),var(--bs-text-opacity))!important}.text-warning{--bs-text-opacity:1;color:rgba(var(--bs-warning-rgb),var(--bs-text-opacity))!important}.text-danger{--bs-text-opacity:1;color:rgba(var(--bs-danger-rgb),var(--bs-text-opacity))!important}.text-light{--bs-text-opacity:1;color:rgba(var(--bs-light-rgb),var(--bs-text-opacity))!important}.text-dark{--bs-text-opacity:1;color:rgba(var(--bs-dark-rgb),var(--bs-text-opacity))!important}.text-black{--bs-text-opacity:1;color:rgba(var(--bs-black-rgb),var(--bs-text-opacity))!important}.text-white{--bs-text-opacity:1;color:rgba(var(--bs-white-rgb),var(--bs-text-opacity))!important}.text-body{--bs-text-opacity:1;color:rgba(var(--bs-body-color-rgb),var(--bs-text-opacity))!important}.text-muted{--bs-text-opacity:1;color:var(--bs-secondary-color)!important}.text-black-50{--bs-text-opacity:1;color:rgba(0,0,0,.5)!important}.text-white-50{--bs-text-opacity:1;color:hsla(0,0%,100%,.5)!important}.text-body-secondary{--bs-text-opacity:1;color:var(--bs-secondary-color)!important}.text-body-tertiary{--bs-text-opacity:1;color:var(--bs-tertiary-color)!important}.text-body-emphasis{--bs-text-opacity:1;color:var(--bs-emphasis-color)!important}.text-reset{--bs-text-opacity:1;color:inherit!important}.text-opacity-25{--bs-text-opacity:0.25}.text-opacity-50{--bs-text-opacity:0.5}.text-opacity-75{--bs-text-opacity:0.75}.text-opacity-100{--bs-text-opacity:1}.text-primary-emphasis{color:var(--bs-primary-text-emphasis)!important}.text-secondary-emphasis{color:var(--bs-secondary-text-emphasis)!important}.text-success-emphasis{color:var(--bs-success-text-emphasis)!important}.text-info-emphasis{color:var(--bs-info-text-emphasis)!important}.text-warning-emphasis{color:var(--bs-warning-text-emphasis)!important}.text-danger-emphasis{color:var(--bs-danger-text-emphasis)!important}.text-light-emphasis{color:var(--bs-light-text-emphasis)!important}.text-dark-emphasis{color:var(--bs-dark-text-emphasis)!important}.link-opacity-10,.link-opacity-10-hover:hover{--bs-link-opacity:0.1}.link-opacity-25,.link-opacity-25-hover:hover{--bs-link-opacity:0.25}.link-opacity-50,.link-opacity-50-hover:hover{--bs-link-opacity:0.5}.link-opacity-75,.link-opacity-75-hover:hover{--bs-link-opacity:0.75}.link-opacity-100,.link-opacity-100-hover:hover{--bs-link-opacity:1}.link-offset-1,.link-offset-1-hover:hover{text-underline-offset:.125em!important}.link-offset-2,.link-offset-2-hover:hover{text-underline-offset:.25em!important}.link-offset-3,.link-offset-3-hover:hover{text-underline-offset:.375em!important}.link-underline-primary{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-primary-rgb),var(--bs-link-underline-opacity))!important}.link-underline-secondary{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-secondary-rgb),var(--bs-link-underline-opacity))!important}.link-underline-success{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-success-rgb),var(--bs-link-underline-opacity))!important}.link-underline-info{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-info-rgb),var(--bs-link-underline-opacity))!important}.link-underline-warning{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-warning-rgb),var(--bs-link-underline-opacity))!important}.link-underline-danger{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-danger-rgb),var(--bs-link-underline-opacity))!important}.link-underline-light{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-light-rgb),var(--bs-link-underline-opacity))!important}.link-underline-dark{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-dark-rgb),var(--bs-link-underline-opacity))!important}.link-underline{--bs-link-underline-opacity:1;text-decoration-color:rgba(var(--bs-link-color-rgb),var(--bs-link-underline-opacity,1))!important}.link-underline-opacity-0,.link-underline-opacity-0-hover:hover{--bs-link-underline-opacity:0}.link-underline-opacity-10,.link-underline-opacity-10-hover:hover{--bs-link-underline-opacity:0.1}.link-underline-opacity-25,.link-underline-opacity-25-hover:hover{--bs-link-underline-opacity:0.25}.link-underline-opacity-50,.link-underline-opacity-50-hover:hover{--bs-link-underline-opacity:0.5}.link-underline-opacity-75,.link-underline-opacity-75-hover:hover{--bs-link-underline-opacity:0.75}.link-underline-opacity-100,.link-underline-opacity-100-hover:hover{--bs-link-underline-opacity:1}.bg-primary{--bs-bg-opacity:1;background-color:rgba(var(--bs-primary-rgb),var(--bs-bg-opacity))!important}.bg-secondary{--bs-bg-opacity:1;background-color:rgba(var(--bs-secondary-rgb),var(--bs-bg-opacity))!important}.bg-success{--bs-bg-opacity:1;background-color:rgba(var(--bs-success-rgb),var(--bs-bg-opacity))!important}.bg-info{--bs-bg-opacity:1;background-color:rgba(var(--bs-info-rgb),var(--bs-bg-opacity))!important}.bg-warning{--bs-bg-opacity:1;background-color:rgba(var(--bs-warning-rgb),var(--bs-bg-opacity))!important}.bg-danger{--bs-bg-opacity:1;background-color:rgba(var(--bs-danger-rgb),var(--bs-bg-opacity))!important}.bg-light{--bs-bg-opacity:1;background-color:rgba(var(--bs-light-rgb),var(--bs-bg-opacity))!important}.bg-dark{--bs-bg-opacity:1;background-color:rgba(var(--bs-dark-rgb),var(--bs-bg-opacity))!important}.bg-black{--bs-bg-opacity:1;background-color:rgba(var(--bs-black-rgb),var(--bs-bg-opacity))!important}.bg-white{--bs-bg-opacity:1;background-color:rgba(var(--bs-white-rgb),var(--bs-bg-opacity))!important}.bg-body{--bs-bg-opacity:1;background-color:rgba(var(--bs-body-bg-rgb),var(--bs-bg-opacity))!important}.bg-transparent{--bs-bg-opacity:1;background-color:transparent!important}.bg-body-secondary{--bs-bg-opacity:1;background-color:rgba(var(--bs-secondary-bg-rgb),var(--bs-bg-opacity))!important}.bg-body-tertiary{--bs-bg-opacity:1;background-color:rgba(var(--bs-tertiary-bg-rgb),var(--bs-bg-opacity))!important}.bg-opacity-10{--bs-bg-opacity:0.1}.bg-opacity-25{--bs-bg-opacity:0.25}.bg-opacity-50{--bs-bg-opacity:0.5}.bg-opacity-75{--bs-bg-opacity:0.75}.bg-opacity-100{--bs-bg-opacity:1}.bg-primary-subtle{background-color:var(--bs-primary-bg-subtle)!important}.bg-secondary-subtle{background-color:var(--bs-secondary-bg-subtle)!important}.bg-success-subtle{background-color:var(--bs-success-bg-subtle)!important}.bg-info-subtle{background-color:var(--bs-info-bg-subtle)!important}.bg-warning-subtle{background-color:var(--bs-warning-bg-subtle)!important}.bg-danger-subtle{background-color:var(--bs-danger-bg-subtle)!important}.bg-light-subtle{background-color:var(--bs-light-bg-subtle)!important}.bg-dark-subtle{background-color:var(--bs-dark-bg-subtle)!important}.bg-gradient{background-image:var(--bs-gradient)!important}.user-select-all{user-select:all!important}.user-select-auto{user-select:auto!important}.user-select-none{user-select:none!important}.pe-none{pointer-events:none!important}.pe-auto{pointer-events:auto!important}.rounded{border-radius:var(--bs-border-radius)!important}.rounded-0{border-radius:0!important}.rounded-1{border-radius:var(--bs-border-radius-sm)!important}.rounded-2{border-radius:var(--bs-border-radius)!important}.rounded-3{border-radius:var(--bs-border-radius-lg)!important}.rounded-4{border-radius:var(--bs-border-radius-xl)!important}.rounded-5{border-radius:var(--bs-border-radius-xxl)!important}.rounded-circle{border-radius:50%!important}.rounded-pill{border-radius:var(--bs-border-radius-pill)!important}.rounded-top{border-top-left-radius:var(--bs-border-radius)!important;border-top-right-radius:var(--bs-border-radius)!important}.rounded-top-0{border-top-left-radius:0!important;border-top-right-radius:0!important}.rounded-top-1{border-top-left-radius:var(--bs-border-radius-sm)!important;border-top-right-radius:var(--bs-border-radius-sm)!important}.rounded-top-2{border-top-left-radius:var(--bs-border-radius)!important;border-top-right-radius:var(--bs-border-radius)!important}.rounded-top-3{border-top-left-radius:var(--bs-border-radius-lg)!important;border-top-right-radius:var(--bs-border-radius-lg)!important}.rounded-top-4{border-top-left-radius:var(--bs-border-radius-xl)!important;border-top-right-radius:var(--bs-border-radius-xl)!important}.rounded-top-5{border-top-left-radius:var(--bs-border-radius-xxl)!important;border-top-right-radius:var(--bs-border-radius-xxl)!important}.rounded-top-circle{border-top-left-radius:50%!important;border-top-right-radius:50%!important}.rounded-top-pill{border-top-left-radius:var(--bs-border-radius-pill)!important;border-top-right-radius:var(--bs-border-radius-pill)!important}.rounded-end{border-bottom-right-radius:var(--bs-border-radius)!important;border-top-right-radius:var(--bs-border-radius)!important}.rounded-end-0{border-bottom-right-radius:0!important;border-top-right-radius:0!important}.rounded-end-1{border-bottom-right-radius:var(--bs-border-radius-sm)!important;border-top-right-radius:var(--bs-border-radius-sm)!important}.rounded-end-2{border-bottom-right-radius:var(--bs-border-radius)!important;border-top-right-radius:var(--bs-border-radius)!important}.rounded-end-3{border-bottom-right-radius:var(--bs-border-radius-lg)!important;border-top-right-radius:var(--bs-border-radius-lg)!important}.rounded-end-4{border-bottom-right-radius:var(--bs-border-radius-xl)!important;border-top-right-radius:var(--bs-border-radius-xl)!important}.rounded-end-5{border-bottom-right-radius:var(--bs-border-radius-xxl)!important;border-top-right-radius:var(--bs-border-radius-xxl)!important}.rounded-end-circle{border-bottom-right-radius:50%!important;border-top-right-radius:50%!important}.rounded-end-pill{border-bottom-right-radius:var(--bs-border-radius-pill)!important;border-top-right-radius:var(--bs-border-radius-pill)!important}.rounded-bottom{border-bottom-left-radius:var(--bs-border-radius)!important;border-bottom-right-radius:var(--bs-border-radius)!important}.rounded-bottom-0{border-bottom-left-radius:0!important;border-bottom-right-radius:0!important}.rounded-bottom-1{border-bottom-left-radius:var(--bs-border-radius-sm)!important;border-bottom-right-radius:var(--bs-border-radius-sm)!important}.rounded-bottom-2{border-bottom-left-radius:var(--bs-border-radius)!important;border-bottom-right-radius:var(--bs-border-radius)!important}.rounded-bottom-3{border-bottom-left-radius:var(--bs-border-radius-lg)!important;border-bottom-right-radius:var(--bs-border-radius-lg)!important}.rounded-bottom-4{border-bottom-left-radius:var(--bs-border-radius-xl)!important;border-bottom-right-radius:var(--bs-border-radius-xl)!important}.rounded-bottom-5{border-bottom-left-radius:var(--bs-border-radius-xxl)!important;border-bottom-right-radius:var(--bs-border-radius-xxl)!important}.rounded-bottom-circle{border-bottom-left-radius:50%!important;border-bottom-right-radius:50%!important}.rounded-bottom-pill{border-bottom-left-radius:var(--bs-border-radius-pill)!important;border-bottom-right-radius:var(--bs-border-radius-pill)!important}.rounded-start{border-bottom-left-radius:var(--bs-border-radius)!important;border-top-left-radius:var(--bs-border-radius)!important}.rounded-start-0{border-bottom-left-radius:0!important;border-top-left-radius:0!important}.rounded-start-1{border-bottom-left-radius:var(--bs-border-radius-sm)!important;border-top-left-radius:var(--bs-border-radius-sm)!important}.rounded-start-2{border-bottom-left-radius:var(--bs-border-radius)!important;border-top-left-radius:var(--bs-border-radius)!important}.rounded-start-3{border-bottom-left-radius:var(--bs-border-radius-lg)!important;border-top-left-radius:var(--bs-border-radius-lg)!important}.rounded-start-4{border-bottom-left-radius:var(--bs-border-radius-xl)!important;border-top-left-radius:var(--bs-border-radius-xl)!important}.rounded-start-5{border-bottom-left-radius:var(--bs-border-radius-xxl)!important;border-top-left-radius:var(--bs-border-radius-xxl)!important}.rounded-start-circle{border-bottom-left-radius:50%!important;border-top-left-radius:50%!important}.rounded-start-pill{border-bottom-left-radius:var(--bs-border-radius-pill)!important;border-top-left-radius:var(--bs-border-radius-pill)!important}.visible{visibility:visible!important}.invisible{visibility:hidden!important}.z-n1{z-index:-1!important}.z-0{z-index:0!important}.z-1{z-index:1!important}.z-2{z-index:2!important}.z-3{z-index:3!important}@media(min-width:540px){.float-sm-start{float:left!important}.float-sm-end{float:right!important}.float-sm-none{float:none!important}.object-fit-sm-contain{object-fit:contain!important}.object-fit-sm-cover{object-fit:cover!important}.object-fit-sm-fill{object-fit:fill!important}.object-fit-sm-scale{object-fit:scale-down!important}.object-fit-sm-none{object-fit:none!important}.d-sm-inline{display:inline!important}.d-sm-inline-block{display:inline-block!important}.d-sm-block{display:block!important}.d-sm-grid{display:grid!important}.d-sm-inline-grid{display:inline-grid!important}.d-sm-table{display:table!important}.d-sm-table-row{display:table-row!important}.d-sm-table-cell{display:table-cell!important}.d-sm-flex{display:flex!important}.d-sm-inline-flex{display:inline-flex!important}.d-sm-none{display:none!important}.flex-sm-fill{flex:1 1 auto!important}.flex-sm-row{flex-direction:row!important}.flex-sm-column{flex-direction:column!important}.flex-sm-row-reverse{flex-direction:row-reverse!important}.flex-sm-column-reverse{flex-direction:column-reverse!important}.flex-sm-grow-0{flex-grow:0!important}.flex-sm-grow-1{flex-grow:1!important}.flex-sm-shrink-0{flex-shrink:0!important}.flex-sm-shrink-1{flex-shrink:1!important}.flex-sm-wrap{flex-wrap:wrap!important}.flex-sm-nowrap{flex-wrap:nowrap!important}.flex-sm-wrap-reverse{flex-wrap:wrap-reverse!important}.justify-content-sm-start{justify-content:flex-start!important}.justify-content-sm-end{justify-content:flex-end!important}.justify-content-sm-center{justify-content:center!important}.justify-content-sm-between{justify-content:space-between!important}.justify-content-sm-around{justify-content:space-around!important}.justify-content-sm-evenly{justify-content:space-evenly!important}.align-items-sm-start{align-items:flex-start!important}.align-items-sm-end{align-items:flex-end!important}.align-items-sm-center{align-items:center!important}.align-items-sm-baseline{align-items:baseline!important}.align-items-sm-stretch{align-items:stretch!important}.align-content-sm-start{align-content:flex-start!important}.align-content-sm-end{align-content:flex-end!important}.align-content-sm-center{align-content:center!important}.align-content-sm-between{align-content:space-between!important}.align-content-sm-around{align-content:space-around!important}.align-content-sm-stretch{align-content:stretch!important}.align-self-sm-auto{align-self:auto!important}.align-self-sm-start{align-self:flex-start!important}.align-self-sm-end{align-self:flex-end!important}.align-self-sm-center{align-self:center!important}.align-self-sm-baseline{align-self:baseline!important}.align-self-sm-stretch{align-self:stretch!important}.order-sm-first{order:-1!important}.order-sm-0{order:0!important}.order-sm-1{order:1!important}.order-sm-2{order:2!important}.order-sm-3{order:3!important}.order-sm-4{order:4!important}.order-sm-5{order:5!important}.order-sm-last{order:6!important}.m-sm-0{margin:0!important}.m-sm-1{margin:.25rem!important}.m-sm-2{margin:.5rem!important}.m-sm-3{margin:1rem!important}.m-sm-4{margin:1.5rem!important}.m-sm-5{margin:3rem!important}.m-sm-auto{margin:auto!important}.mx-sm-0{margin-left:0!important;margin-right:0!important}.mx-sm-1{margin-left:.25rem!important;margin-right:.25rem!important}.mx-sm-2{margin-left:.5rem!important;margin-right:.5rem!important}.mx-sm-3{margin-left:1rem!important;margin-right:1rem!important}.mx-sm-4{margin-left:1.5rem!important;margin-right:1.5rem!important}.mx-sm-5{margin-left:3rem!important;margin-right:3rem!important}.mx-sm-auto{margin-left:auto!important;margin-right:auto!important}.my-sm-0{margin-bottom:0!important;margin-top:0!important}.my-sm-1{margin-bottom:.25rem!important;margin-top:.25rem!important}.my-sm-2{margin-bottom:.5rem!important;margin-top:.5rem!important}.my-sm-3{margin-bottom:1rem!important;margin-top:1rem!important}.my-sm-4{margin-bottom:1.5rem!important;margin-top:1.5rem!important}.my-sm-5{margin-bottom:3rem!important;margin-top:3rem!important}.my-sm-auto{margin-bottom:auto!important;margin-top:auto!important}.mt-sm-0{margin-top:0!important}.mt-sm-1{margin-top:.25rem!important}.mt-sm-2{margin-top:.5rem!important}.mt-sm-3{margin-top:1rem!important}.mt-sm-4{margin-top:1.5rem!important}.mt-sm-5{margin-top:3rem!important}.mt-sm-auto{margin-top:auto!important}.me-sm-0{margin-right:0!important}.me-sm-1{margin-right:.25rem!important}.me-sm-2{margin-right:.5rem!important}.me-sm-3{margin-right:1rem!important}.me-sm-4{margin-right:1.5rem!important}.me-sm-5{margin-right:3rem!important}.me-sm-auto{margin-right:auto!important}.mb-sm-0{margin-bottom:0!important}.mb-sm-1{margin-bottom:.25rem!important}.mb-sm-2{margin-bottom:.5rem!important}.mb-sm-3{margin-bottom:1rem!important}.mb-sm-4{margin-bottom:1.5rem!important}.mb-sm-5{margin-bottom:3rem!important}.mb-sm-auto{margin-bottom:auto!important}.ms-sm-0{margin-left:0!important}.ms-sm-1{margin-left:.25rem!important}.ms-sm-2{margin-left:.5rem!important}.ms-sm-3{margin-left:1rem!important}.ms-sm-4{margin-left:1.5rem!important}.ms-sm-5{margin-left:3rem!important}.ms-sm-auto{margin-left:auto!important}.p-sm-0{padding:0!important}.p-sm-1{padding:.25rem!important}.p-sm-2{padding:.5rem!important}.p-sm-3{padding:1rem!important}.p-sm-4{padding:1.5rem!important}.p-sm-5{padding:3rem!important}.px-sm-0{padding-left:0!important;padding-right:0!important}.px-sm-1{padding-left:.25rem!important;padding-right:.25rem!important}.px-sm-2{padding-left:.5rem!important;padding-right:.5rem!important}.px-sm-3{padding-left:1rem!important;padding-right:1rem!important}.px-sm-4{padding-left:1.5rem!important;padding-right:1.5rem!important}.px-sm-5{padding-left:3rem!important;padding-right:3rem!important}.py-sm-0{padding-bottom:0!important;padding-top:0!important}.py-sm-1{padding-bottom:.25rem!important;padding-top:.25rem!important}.py-sm-2{padding-bottom:.5rem!important;padding-top:.5rem!important}.py-sm-3{padding-bottom:1rem!important;padding-top:1rem!important}.py-sm-4{padding-bottom:1.5rem!important;padding-top:1.5rem!important}.py-sm-5{padding-bottom:3rem!important;padding-top:3rem!important}.pt-sm-0{padding-top:0!important}.pt-sm-1{padding-top:.25rem!important}.pt-sm-2{padding-top:.5rem!important}.pt-sm-3{padding-top:1rem!important}.pt-sm-4{padding-top:1.5rem!important}.pt-sm-5{padding-top:3rem!important}.pe-sm-0{padding-right:0!important}.pe-sm-1{padding-right:.25rem!important}.pe-sm-2{padding-right:.5rem!important}.pe-sm-3{padding-right:1rem!important}.pe-sm-4{padding-right:1.5rem!important}.pe-sm-5{padding-right:3rem!important}.pb-sm-0{padding-bottom:0!important}.pb-sm-1{padding-bottom:.25rem!important}.pb-sm-2{padding-bottom:.5rem!important}.pb-sm-3{padding-bottom:1rem!important}.pb-sm-4{padding-bottom:1.5rem!important}.pb-sm-5{padding-bottom:3rem!important}.ps-sm-0{padding-left:0!important}.ps-sm-1{padding-left:.25rem!important}.ps-sm-2{padding-left:.5rem!important}.ps-sm-3{padding-left:1rem!important}.ps-sm-4{padding-left:1.5rem!important}.ps-sm-5{padding-left:3rem!important}.gap-sm-0{gap:0!important}.gap-sm-1{gap:.25rem!important}.gap-sm-2{gap:.5rem!important}.gap-sm-3{gap:1rem!important}.gap-sm-4{gap:1.5rem!important}.gap-sm-5{gap:3rem!important}.row-gap-sm-0{row-gap:0!important}.row-gap-sm-1{row-gap:.25rem!important}.row-gap-sm-2{row-gap:.5rem!important}.row-gap-sm-3{row-gap:1rem!important}.row-gap-sm-4{row-gap:1.5rem!important}.row-gap-sm-5{row-gap:3rem!important}.column-gap-sm-0{column-gap:0!important}.column-gap-sm-1{column-gap:.25rem!important}.column-gap-sm-2{column-gap:.5rem!important}.column-gap-sm-3{column-gap:1rem!important}.column-gap-sm-4{column-gap:1.5rem!important}.column-gap-sm-5{column-gap:3rem!important}.text-sm-start{text-align:left!important}.text-sm-end{text-align:right!important}.text-sm-center{text-align:center!important}}@media(min-width:720px){.float-md-start{float:left!important}.float-md-end{float:right!important}.float-md-none{float:none!important}.object-fit-md-contain{object-fit:contain!important}.object-fit-md-cover{object-fit:cover!important}.object-fit-md-fill{object-fit:fill!important}.object-fit-md-scale{object-fit:scale-down!important}.object-fit-md-none{object-fit:none!important}.d-md-inline{display:inline!important}.d-md-inline-block{display:inline-block!important}.d-md-block{display:block!important}.d-md-grid{display:grid!important}.d-md-inline-grid{display:inline-grid!important}.d-md-table{display:table!important}.d-md-table-row{display:table-row!important}.d-md-table-cell{display:table-cell!important}.d-md-flex{display:flex!important}.d-md-inline-flex{display:inline-flex!important}.d-md-none{display:none!important}.flex-md-fill{flex:1 1 auto!important}.flex-md-row{flex-direction:row!important}.flex-md-column{flex-direction:column!important}.flex-md-row-reverse{flex-direction:row-reverse!important}.flex-md-column-reverse{flex-direction:column-reverse!important}.flex-md-grow-0{flex-grow:0!important}.flex-md-grow-1{flex-grow:1!important}.flex-md-shrink-0{flex-shrink:0!important}.flex-md-shrink-1{flex-shrink:1!important}.flex-md-wrap{flex-wrap:wrap!important}.flex-md-nowrap{flex-wrap:nowrap!important}.flex-md-wrap-reverse{flex-wrap:wrap-reverse!important}.justify-content-md-start{justify-content:flex-start!important}.justify-content-md-end{justify-content:flex-end!important}.justify-content-md-center{justify-content:center!important}.justify-content-md-between{justify-content:space-between!important}.justify-content-md-around{justify-content:space-around!important}.justify-content-md-evenly{justify-content:space-evenly!important}.align-items-md-start{align-items:flex-start!important}.align-items-md-end{align-items:flex-end!important}.align-items-md-center{align-items:center!important}.align-items-md-baseline{align-items:baseline!important}.align-items-md-stretch{align-items:stretch!important}.align-content-md-start{align-content:flex-start!important}.align-content-md-end{align-content:flex-end!important}.align-content-md-center{align-content:center!important}.align-content-md-between{align-content:space-between!important}.align-content-md-around{align-content:space-around!important}.align-content-md-stretch{align-content:stretch!important}.align-self-md-auto{align-self:auto!important}.align-self-md-start{align-self:flex-start!important}.align-self-md-end{align-self:flex-end!important}.align-self-md-center{align-self:center!important}.align-self-md-baseline{align-self:baseline!important}.align-self-md-stretch{align-self:stretch!important}.order-md-first{order:-1!important}.order-md-0{order:0!important}.order-md-1{order:1!important}.order-md-2{order:2!important}.order-md-3{order:3!important}.order-md-4{order:4!important}.order-md-5{order:5!important}.order-md-last{order:6!important}.m-md-0{margin:0!important}.m-md-1{margin:.25rem!important}.m-md-2{margin:.5rem!important}.m-md-3{margin:1rem!important}.m-md-4{margin:1.5rem!important}.m-md-5{margin:3rem!important}.m-md-auto{margin:auto!important}.mx-md-0{margin-left:0!important;margin-right:0!important}.mx-md-1{margin-left:.25rem!important;margin-right:.25rem!important}.mx-md-2{margin-left:.5rem!important;margin-right:.5rem!important}.mx-md-3{margin-left:1rem!important;margin-right:1rem!important}.mx-md-4{margin-left:1.5rem!important;margin-right:1.5rem!important}.mx-md-5{margin-left:3rem!important;margin-right:3rem!important}.mx-md-auto{margin-left:auto!important;margin-right:auto!important}.my-md-0{margin-bottom:0!important;margin-top:0!important}.my-md-1{margin-bottom:.25rem!important;margin-top:.25rem!important}.my-md-2{margin-bottom:.5rem!important;margin-top:.5rem!important}.my-md-3{margin-bottom:1rem!important;margin-top:1rem!important}.my-md-4{margin-bottom:1.5rem!important;margin-top:1.5rem!important}.my-md-5{margin-bottom:3rem!important;margin-top:3rem!important}.my-md-auto{margin-bottom:auto!important;margin-top:auto!important}.mt-md-0{margin-top:0!important}.mt-md-1{margin-top:.25rem!important}.mt-md-2{margin-top:.5rem!important}.mt-md-3{margin-top:1rem!important}.mt-md-4{margin-top:1.5rem!important}.mt-md-5{margin-top:3rem!important}.mt-md-auto{margin-top:auto!important}.me-md-0{margin-right:0!important}.me-md-1{margin-right:.25rem!important}.me-md-2{margin-right:.5rem!important}.me-md-3{margin-right:1rem!important}.me-md-4{margin-right:1.5rem!important}.me-md-5{margin-right:3rem!important}.me-md-auto{margin-right:auto!important}.mb-md-0{margin-bottom:0!important}.mb-md-1{margin-bottom:.25rem!important}.mb-md-2{margin-bottom:.5rem!important}.mb-md-3{margin-bottom:1rem!important}.mb-md-4{margin-bottom:1.5rem!important}.mb-md-5{margin-bottom:3rem!important}.mb-md-auto{margin-bottom:auto!important}.ms-md-0{margin-left:0!important}.ms-md-1{margin-left:.25rem!important}.ms-md-2{margin-left:.5rem!important}.ms-md-3{margin-left:1rem!important}.ms-md-4{margin-left:1.5rem!important}.ms-md-5{margin-left:3rem!important}.ms-md-auto{margin-left:auto!important}.p-md-0{padding:0!important}.p-md-1{padding:.25rem!important}.p-md-2{padding:.5rem!important}.p-md-3{padding:1rem!important}.p-md-4{padding:1.5rem!important}.p-md-5{padding:3rem!important}.px-md-0{padding-left:0!important;padding-right:0!important}.px-md-1{padding-left:.25rem!important;padding-right:.25rem!important}.px-md-2{padding-left:.5rem!important;padding-right:.5rem!important}.px-md-3{padding-left:1rem!important;padding-right:1rem!important}.px-md-4{padding-left:1.5rem!important;padding-right:1.5rem!important}.px-md-5{padding-left:3rem!important;padding-right:3rem!important}.py-md-0{padding-bottom:0!important;padding-top:0!important}.py-md-1{padding-bottom:.25rem!important;padding-top:.25rem!important}.py-md-2{padding-bottom:.5rem!important;padding-top:.5rem!important}.py-md-3{padding-bottom:1rem!important;padding-top:1rem!important}.py-md-4{padding-bottom:1.5rem!important;padding-top:1.5rem!important}.py-md-5{padding-bottom:3rem!important;padding-top:3rem!important}.pt-md-0{padding-top:0!important}.pt-md-1{padding-top:.25rem!important}.pt-md-2{padding-top:.5rem!important}.pt-md-3{padding-top:1rem!important}.pt-md-4{padding-top:1.5rem!important}.pt-md-5{padding-top:3rem!important}.pe-md-0{padding-right:0!important}.pe-md-1{padding-right:.25rem!important}.pe-md-2{padding-right:.5rem!important}.pe-md-3{padding-right:1rem!important}.pe-md-4{padding-right:1.5rem!important}.pe-md-5{padding-right:3rem!important}.pb-md-0{padding-bottom:0!important}.pb-md-1{padding-bottom:.25rem!important}.pb-md-2{padding-bottom:.5rem!important}.pb-md-3{padding-bottom:1rem!important}.pb-md-4{padding-bottom:1.5rem!important}.pb-md-5{padding-bottom:3rem!important}.ps-md-0{padding-left:0!important}.ps-md-1{padding-left:.25rem!important}.ps-md-2{padding-left:.5rem!important}.ps-md-3{padding-left:1rem!important}.ps-md-4{padding-left:1.5rem!important}.ps-md-5{padding-left:3rem!important}.gap-md-0{gap:0!important}.gap-md-1{gap:.25rem!important}.gap-md-2{gap:.5rem!important}.gap-md-3{gap:1rem!important}.gap-md-4{gap:1.5rem!important}.gap-md-5{gap:3rem!important}.row-gap-md-0{row-gap:0!important}.row-gap-md-1{row-gap:.25rem!important}.row-gap-md-2{row-gap:.5rem!important}.row-gap-md-3{row-gap:1rem!important}.row-gap-md-4{row-gap:1.5rem!important}.row-gap-md-5{row-gap:3rem!important}.column-gap-md-0{column-gap:0!important}.column-gap-md-1{column-gap:.25rem!important}.column-gap-md-2{column-gap:.5rem!important}.column-gap-md-3{column-gap:1rem!important}.column-gap-md-4{column-gap:1.5rem!important}.column-gap-md-5{column-gap:3rem!important}.text-md-start{text-align:left!important}.text-md-end{text-align:right!important}.text-md-center{text-align:center!important}}@media(min-width:960px){.float-lg-start{float:left!important}.float-lg-end{float:right!important}.float-lg-none{float:none!important}.object-fit-lg-contain{object-fit:contain!important}.object-fit-lg-cover{object-fit:cover!important}.object-fit-lg-fill{object-fit:fill!important}.object-fit-lg-scale{object-fit:scale-down!important}.object-fit-lg-none{object-fit:none!important}.d-lg-inline{display:inline!important}.d-lg-inline-block{display:inline-block!important}.d-lg-block{display:block!important}.d-lg-grid{display:grid!important}.d-lg-inline-grid{display:inline-grid!important}.d-lg-table{display:table!important}.d-lg-table-row{display:table-row!important}.d-lg-table-cell{display:table-cell!important}.d-lg-flex{display:flex!important}.d-lg-inline-flex{display:inline-flex!important}.d-lg-none{display:none!important}.flex-lg-fill{flex:1 1 auto!important}.flex-lg-row{flex-direction:row!important}.flex-lg-column{flex-direction:column!important}.flex-lg-row-reverse{flex-direction:row-reverse!important}.flex-lg-column-reverse{flex-direction:column-reverse!important}.flex-lg-grow-0{flex-grow:0!important}.flex-lg-grow-1{flex-grow:1!important}.flex-lg-shrink-0{flex-shrink:0!important}.flex-lg-shrink-1{flex-shrink:1!important}.flex-lg-wrap{flex-wrap:wrap!important}.flex-lg-nowrap{flex-wrap:nowrap!important}.flex-lg-wrap-reverse{flex-wrap:wrap-reverse!important}.justify-content-lg-start{justify-content:flex-start!important}.justify-content-lg-end{justify-content:flex-end!important}.justify-content-lg-center{justify-content:center!important}.justify-content-lg-between{justify-content:space-between!important}.justify-content-lg-around{justify-content:space-around!important}.justify-content-lg-evenly{justify-content:space-evenly!important}.align-items-lg-start{align-items:flex-start!important}.align-items-lg-end{align-items:flex-end!important}.align-items-lg-center{align-items:center!important}.align-items-lg-baseline{align-items:baseline!important}.align-items-lg-stretch{align-items:stretch!important}.align-content-lg-start{align-content:flex-start!important}.align-content-lg-end{align-content:flex-end!important}.align-content-lg-center{align-content:center!important}.align-content-lg-between{align-content:space-between!important}.align-content-lg-around{align-content:space-around!important}.align-content-lg-stretch{align-content:stretch!important}.align-self-lg-auto{align-self:auto!important}.align-self-lg-start{align-self:flex-start!important}.align-self-lg-end{align-self:flex-end!important}.align-self-lg-center{align-self:center!important}.align-self-lg-baseline{align-self:baseline!important}.align-self-lg-stretch{align-self:stretch!important}.order-lg-first{order:-1!important}.order-lg-0{order:0!important}.order-lg-1{order:1!important}.order-lg-2{order:2!important}.order-lg-3{order:3!important}.order-lg-4{order:4!important}.order-lg-5{order:5!important}.order-lg-last{order:6!important}.m-lg-0{margin:0!important}.m-lg-1{margin:.25rem!important}.m-lg-2{margin:.5rem!important}.m-lg-3{margin:1rem!important}.m-lg-4{margin:1.5rem!important}.m-lg-5{margin:3rem!important}.m-lg-auto{margin:auto!important}.mx-lg-0{margin-left:0!important;margin-right:0!important}.mx-lg-1{margin-left:.25rem!important;margin-right:.25rem!important}.mx-lg-2{margin-left:.5rem!important;margin-right:.5rem!important}.mx-lg-3{margin-left:1rem!important;margin-right:1rem!important}.mx-lg-4{margin-left:1.5rem!important;margin-right:1.5rem!important}.mx-lg-5{margin-left:3rem!important;margin-right:3rem!important}.mx-lg-auto{margin-left:auto!important;margin-right:auto!important}.my-lg-0{margin-bottom:0!important;margin-top:0!important}.my-lg-1{margin-bottom:.25rem!important;margin-top:.25rem!important}.my-lg-2{margin-bottom:.5rem!important;margin-top:.5rem!important}.my-lg-3{margin-bottom:1rem!important;margin-top:1rem!important}.my-lg-4{margin-bottom:1.5rem!important;margin-top:1.5rem!important}.my-lg-5{margin-bottom:3rem!important;margin-top:3rem!important}.my-lg-auto{margin-bottom:auto!important;margin-top:auto!important}.mt-lg-0{margin-top:0!important}.mt-lg-1{margin-top:.25rem!important}.mt-lg-2{margin-top:.5rem!important}.mt-lg-3{margin-top:1rem!important}.mt-lg-4{margin-top:1.5rem!important}.mt-lg-5{margin-top:3rem!important}.mt-lg-auto{margin-top:auto!important}.me-lg-0{margin-right:0!important}.me-lg-1{margin-right:.25rem!important}.me-lg-2{margin-right:.5rem!important}.me-lg-3{margin-right:1rem!important}.me-lg-4{margin-right:1.5rem!important}.me-lg-5{margin-right:3rem!important}.me-lg-auto{margin-right:auto!important}.mb-lg-0{margin-bottom:0!important}.mb-lg-1{margin-bottom:.25rem!important}.mb-lg-2{margin-bottom:.5rem!important}.mb-lg-3{margin-bottom:1rem!important}.mb-lg-4{margin-bottom:1.5rem!important}.mb-lg-5{margin-bottom:3rem!important}.mb-lg-auto{margin-bottom:auto!important}.ms-lg-0{margin-left:0!important}.ms-lg-1{margin-left:.25rem!important}.ms-lg-2{margin-left:.5rem!important}.ms-lg-3{margin-left:1rem!important}.ms-lg-4{margin-left:1.5rem!important}.ms-lg-5{margin-left:3rem!important}.ms-lg-auto{margin-left:auto!important}.p-lg-0{padding:0!important}.p-lg-1{padding:.25rem!important}.p-lg-2{padding:.5rem!important}.p-lg-3{padding:1rem!important}.p-lg-4{padding:1.5rem!important}.p-lg-5{padding:3rem!important}.px-lg-0{padding-left:0!important;padding-right:0!important}.px-lg-1{padding-left:.25rem!important;padding-right:.25rem!important}.px-lg-2{padding-left:.5rem!important;padding-right:.5rem!important}.px-lg-3{padding-left:1rem!important;padding-right:1rem!important}.px-lg-4{padding-left:1.5rem!important;padding-right:1.5rem!important}.px-lg-5{padding-left:3rem!important;padding-right:3rem!important}.py-lg-0{padding-bottom:0!important;padding-top:0!important}.py-lg-1{padding-bottom:.25rem!important;padding-top:.25rem!important}.py-lg-2{padding-bottom:.5rem!important;padding-top:.5rem!important}.py-lg-3{padding-bottom:1rem!important;padding-top:1rem!important}.py-lg-4{padding-bottom:1.5rem!important;padding-top:1.5rem!important}.py-lg-5{padding-bottom:3rem!important;padding-top:3rem!important}.pt-lg-0{padding-top:0!important}.pt-lg-1{padding-top:.25rem!important}.pt-lg-2{padding-top:.5rem!important}.pt-lg-3{padding-top:1rem!important}.pt-lg-4{padding-top:1.5rem!important}.pt-lg-5{padding-top:3rem!important}.pe-lg-0{padding-right:0!important}.pe-lg-1{padding-right:.25rem!important}.pe-lg-2{padding-right:.5rem!important}.pe-lg-3{padding-right:1rem!important}.pe-lg-4{padding-right:1.5rem!important}.pe-lg-5{padding-right:3rem!important}.pb-lg-0{padding-bottom:0!important}.pb-lg-1{padding-bottom:.25rem!important}.pb-lg-2{padding-bottom:.5rem!important}.pb-lg-3{padding-bottom:1rem!important}.pb-lg-4{padding-bottom:1.5rem!important}.pb-lg-5{padding-bottom:3rem!important}.ps-lg-0{padding-left:0!important}.ps-lg-1{padding-left:.25rem!important}.ps-lg-2{padding-left:.5rem!important}.ps-lg-3{padding-left:1rem!important}.ps-lg-4{padding-left:1.5rem!important}.ps-lg-5{padding-left:3rem!important}.gap-lg-0{gap:0!important}.gap-lg-1{gap:.25rem!important}.gap-lg-2{gap:.5rem!important}.gap-lg-3{gap:1rem!important}.gap-lg-4{gap:1.5rem!important}.gap-lg-5{gap:3rem!important}.row-gap-lg-0{row-gap:0!important}.row-gap-lg-1{row-gap:.25rem!important}.row-gap-lg-2{row-gap:.5rem!important}.row-gap-lg-3{row-gap:1rem!important}.row-gap-lg-4{row-gap:1.5rem!important}.row-gap-lg-5{row-gap:3rem!important}.column-gap-lg-0{column-gap:0!important}.column-gap-lg-1{column-gap:.25rem!important}.column-gap-lg-2{column-gap:.5rem!important}.column-gap-lg-3{column-gap:1rem!important}.column-gap-lg-4{column-gap:1.5rem!important}.column-gap-lg-5{column-gap:3rem!important}.text-lg-start{text-align:left!important}.text-lg-end{text-align:right!important}.text-lg-center{text-align:center!important}}@media(min-width:1200px){.float-xl-start{float:left!important}.float-xl-end{float:right!important}.float-xl-none{float:none!important}.object-fit-xl-contain{object-fit:contain!important}.object-fit-xl-cover{object-fit:cover!important}.object-fit-xl-fill{object-fit:fill!important}.object-fit-xl-scale{object-fit:scale-down!important}.object-fit-xl-none{object-fit:none!important}.d-xl-inline{display:inline!important}.d-xl-inline-block{display:inline-block!important}.d-xl-block{display:block!important}.d-xl-grid{display:grid!important}.d-xl-inline-grid{display:inline-grid!important}.d-xl-table{display:table!important}.d-xl-table-row{display:table-row!important}.d-xl-table-cell{display:table-cell!important}.d-xl-flex{display:flex!important}.d-xl-inline-flex{display:inline-flex!important}.d-xl-none{display:none!important}.flex-xl-fill{flex:1 1 auto!important}.flex-xl-row{flex-direction:row!important}.flex-xl-column{flex-direction:column!important}.flex-xl-row-reverse{flex-direction:row-reverse!important}.flex-xl-column-reverse{flex-direction:column-reverse!important}.flex-xl-grow-0{flex-grow:0!important}.flex-xl-grow-1{flex-grow:1!important}.flex-xl-shrink-0{flex-shrink:0!important}.flex-xl-shrink-1{flex-shrink:1!important}.flex-xl-wrap{flex-wrap:wrap!important}.flex-xl-nowrap{flex-wrap:nowrap!important}.flex-xl-wrap-reverse{flex-wrap:wrap-reverse!important}.justify-content-xl-start{justify-content:flex-start!important}.justify-content-xl-end{justify-content:flex-end!important}.justify-content-xl-center{justify-content:center!important}.justify-content-xl-between{justify-content:space-between!important}.justify-content-xl-around{justify-content:space-around!important}.justify-content-xl-evenly{justify-content:space-evenly!important}.align-items-xl-start{align-items:flex-start!important}.align-items-xl-end{align-items:flex-end!important}.align-items-xl-center{align-items:center!important}.align-items-xl-baseline{align-items:baseline!important}.align-items-xl-stretch{align-items:stretch!important}.align-content-xl-start{align-content:flex-start!important}.align-content-xl-end{align-content:flex-end!important}.align-content-xl-center{align-content:center!important}.align-content-xl-between{align-content:space-between!important}.align-content-xl-around{align-content:space-around!important}.align-content-xl-stretch{align-content:stretch!important}.align-self-xl-auto{align-self:auto!important}.align-self-xl-start{align-self:flex-start!important}.align-self-xl-end{align-self:flex-end!important}.align-self-xl-center{align-self:center!important}.align-self-xl-baseline{align-self:baseline!important}.align-self-xl-stretch{align-self:stretch!important}.order-xl-first{order:-1!important}.order-xl-0{order:0!important}.order-xl-1{order:1!important}.order-xl-2{order:2!important}.order-xl-3{order:3!important}.order-xl-4{order:4!important}.order-xl-5{order:5!important}.order-xl-last{order:6!important}.m-xl-0{margin:0!important}.m-xl-1{margin:.25rem!important}.m-xl-2{margin:.5rem!important}.m-xl-3{margin:1rem!important}.m-xl-4{margin:1.5rem!important}.m-xl-5{margin:3rem!important}.m-xl-auto{margin:auto!important}.mx-xl-0{margin-left:0!important;margin-right:0!important}.mx-xl-1{margin-left:.25rem!important;margin-right:.25rem!important}.mx-xl-2{margin-left:.5rem!important;margin-right:.5rem!important}.mx-xl-3{margin-left:1rem!important;margin-right:1rem!important}.mx-xl-4{margin-left:1.5rem!important;margin-right:1.5rem!important}.mx-xl-5{margin-left:3rem!important;margin-right:3rem!important}.mx-xl-auto{margin-left:auto!important;margin-right:auto!important}.my-xl-0{margin-bottom:0!important;margin-top:0!important}.my-xl-1{margin-bottom:.25rem!important;margin-top:.25rem!important}.my-xl-2{margin-bottom:.5rem!important;margin-top:.5rem!important}.my-xl-3{margin-bottom:1rem!important;margin-top:1rem!important}.my-xl-4{margin-bottom:1.5rem!important;margin-top:1.5rem!important}.my-xl-5{margin-bottom:3rem!important;margin-top:3rem!important}.my-xl-auto{margin-bottom:auto!important;margin-top:auto!important}.mt-xl-0{margin-top:0!important}.mt-xl-1{margin-top:.25rem!important}.mt-xl-2{margin-top:.5rem!important}.mt-xl-3{margin-top:1rem!important}.mt-xl-4{margin-top:1.5rem!important}.mt-xl-5{margin-top:3rem!important}.mt-xl-auto{margin-top:auto!important}.me-xl-0{margin-right:0!important}.me-xl-1{margin-right:.25rem!important}.me-xl-2{margin-right:.5rem!important}.me-xl-3{margin-right:1rem!important}.me-xl-4{margin-right:1.5rem!important}.me-xl-5{margin-right:3rem!important}.me-xl-auto{margin-right:auto!important}.mb-xl-0{margin-bottom:0!important}.mb-xl-1{margin-bottom:.25rem!important}.mb-xl-2{margin-bottom:.5rem!important}.mb-xl-3{margin-bottom:1rem!important}.mb-xl-4{margin-bottom:1.5rem!important}.mb-xl-5{margin-bottom:3rem!important}.mb-xl-auto{margin-bottom:auto!important}.ms-xl-0{margin-left:0!important}.ms-xl-1{margin-left:.25rem!important}.ms-xl-2{margin-left:.5rem!important}.ms-xl-3{margin-left:1rem!important}.ms-xl-4{margin-left:1.5rem!important}.ms-xl-5{margin-left:3rem!important}.ms-xl-auto{margin-left:auto!important}.p-xl-0{padding:0!important}.p-xl-1{padding:.25rem!important}.p-xl-2{padding:.5rem!important}.p-xl-3{padding:1rem!important}.p-xl-4{padding:1.5rem!important}.p-xl-5{padding:3rem!important}.px-xl-0{padding-left:0!important;padding-right:0!important}.px-xl-1{padding-left:.25rem!important;padding-right:.25rem!important}.px-xl-2{padding-left:.5rem!important;padding-right:.5rem!important}.px-xl-3{padding-left:1rem!important;padding-right:1rem!important}.px-xl-4{padding-left:1.5rem!important;padding-right:1.5rem!important}.px-xl-5{padding-left:3rem!important;padding-right:3rem!important}.py-xl-0{padding-bottom:0!important;padding-top:0!important}.py-xl-1{padding-bottom:.25rem!important;padding-top:.25rem!important}.py-xl-2{padding-bottom:.5rem!important;padding-top:.5rem!important}.py-xl-3{padding-bottom:1rem!important;padding-top:1rem!important}.py-xl-4{padding-bottom:1.5rem!important;padding-top:1.5rem!important}.py-xl-5{padding-bottom:3rem!important;padding-top:3rem!important}.pt-xl-0{padding-top:0!important}.pt-xl-1{padding-top:.25rem!important}.pt-xl-2{padding-top:.5rem!important}.pt-xl-3{padding-top:1rem!important}.pt-xl-4{padding-top:1.5rem!important}.pt-xl-5{padding-top:3rem!important}.pe-xl-0{padding-right:0!important}.pe-xl-1{padding-right:.25rem!important}.pe-xl-2{padding-right:.5rem!important}.pe-xl-3{padding-right:1rem!important}.pe-xl-4{padding-right:1.5rem!important}.pe-xl-5{padding-right:3rem!important}.pb-xl-0{padding-bottom:0!important}.pb-xl-1{padding-bottom:.25rem!important}.pb-xl-2{padding-bottom:.5rem!important}.pb-xl-3{padding-bottom:1rem!important}.pb-xl-4{padding-bottom:1.5rem!important}.pb-xl-5{padding-bottom:3rem!important}.ps-xl-0{padding-left:0!important}.ps-xl-1{padding-left:.25rem!important}.ps-xl-2{padding-left:.5rem!important}.ps-xl-3{padding-left:1rem!important}.ps-xl-4{padding-left:1.5rem!important}.ps-xl-5{padding-left:3rem!important}.gap-xl-0{gap:0!important}.gap-xl-1{gap:.25rem!important}.gap-xl-2{gap:.5rem!important}.gap-xl-3{gap:1rem!important}.gap-xl-4{gap:1.5rem!important}.gap-xl-5{gap:3rem!important}.row-gap-xl-0{row-gap:0!important}.row-gap-xl-1{row-gap:.25rem!important}.row-gap-xl-2{row-gap:.5rem!important}.row-gap-xl-3{row-gap:1rem!important}.row-gap-xl-4{row-gap:1.5rem!important}.row-gap-xl-5{row-gap:3rem!important}.column-gap-xl-0{column-gap:0!important}.column-gap-xl-1{column-gap:.25rem!important}.column-gap-xl-2{column-gap:.5rem!important}.column-gap-xl-3{column-gap:1rem!important}.column-gap-xl-4{column-gap:1.5rem!important}.column-gap-xl-5{column-gap:3rem!important}.text-xl-start{text-align:left!important}.text-xl-end{text-align:right!important}.text-xl-center{text-align:center!important}.fs-1{font-size:2.5rem!important}.fs-2{font-size:2rem!important}.fs-3{font-size:1.75rem!important}.fs-4{font-size:1.5rem!important}}@media print{.d-print-inline{display:inline!important}.d-print-inline-block{display:inline-block!important}.d-print-block{display:block!important}.d-print-grid{display:grid!important}.d-print-inline-grid{display:inline-grid!important}.d-print-table{display:table!important}.d-print-table-row{display:table-row!important}.d-print-table-cell{display:table-cell!important}.d-print-flex{display:flex!important}.d-print-inline-flex{display:inline-flex!important}.d-print-none{display:none!important}}
-/*# sourceMappingURL=bootstrap.css.map*/
\ No newline at end of file
diff --git a/docs/_build/html/_static/styles/bootstrap.css.map b/docs/_build/html/_static/styles/bootstrap.css.map
deleted file mode 100644
index 3929429..0000000
--- a/docs/_build/html/_static/styles/bootstrap.css.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"styles/bootstrap.css","mappings":"AAAA;;;;ECCE,CCDF,4BASI,qQAIA,sMAIA,iKAIA,sNAIA,iRAIA,iPAIA,iRAGF,2BACA,qBAMA,yMACA,mGACA,4EAOA,gDC2OI,wBALI,CDpOR,0BACA,0BAKA,wBACA,6BACA,kBACA,6BAEA,yBACA,8BAEA,wCACA,kCACA,0BACA,kCAEA,sCACA,iCACA,yBACA,iCAGA,2BAEA,wBACA,+BACA,+BAEA,8BACA,oCAMA,wBACA,6BACA,0BAGA,sBACA,wBACA,0BACA,+CAEA,4BACA,8BACA,6BACA,2BACA,4BACA,mDACA,8BAGA,8CACA,uDACA,gDACA,uDAIA,8BACA,6BACA,2CAIA,8BACA,qCACA,gCACA,uCEhHE,qBFyHA,wBACA,gCACA,qBACA,0BAEA,yBACA,oCAEA,2CACA,qCACA,0BACA,+BAEA,yCACA,oCACA,yBACA,8BAGE,iRAIA,iPAIA,iRAGF,2BAEA,wBACA,8BACA,gCACA,sCAEA,wBACA,6BACA,0BAEA,0BACA,kDAEA,8BACA,qCACA,gCACA,uCAlDA,iBAkDA,CGxKJ,iBAGE,sBAeE,6CANJ,MAOM,wBAcN,KASE,8BACA,0CAFA,mCAFA,2BAJA,uCF6OI,kCALI,CEtOR,uCACA,uCAJA,SAMA,oCAGA,CASF,GAGE,SACA,wCAFA,aCmnB4B,CDpnB5B,cAIA,WCynB4B,CD/mB9B,0CAOE,8BAFA,eCwjB4B,CDvjB5B,eCwjB4B,CD5jB5B,mBCwjB4B,CDzjB5B,YAMA,CAGF,OFuMQ,iCA5JJ,yBE3CJ,OF8MQ,kBEzMR,OFkMQ,gCA5JJ,yBEtCJ,OFyMQ,gBEpMR,OF6LQ,8BA5JJ,yBEjCJ,OFoMQ,mBE/LR,OFwLQ,gCA5JJ,yBE5BJ,OF+LQ,kBE1LR,OF+KM,iBALI,CErKV,OF0KM,cALI,CE1JV,EAEE,mBADA,YCyV0B,CD9U5B,YAEE,YADA,iCAEA,8BAMF,QAEE,kBACA,oBAFA,kBAEA,CAMF,MAEE,kBAGF,SAIE,mBADA,YACA,CAGF,wBAIE,gBAGF,GACE,eC6b4B,CDxb9B,GACE,oBACA,cAMF,WACE,gBAQF,SAEE,kBCsa4B,CD9Z9B,aF6EM,gBALI,CEjEV,WAGE,wCADA,gCADA,eAEA,CASF,QF0DM,eALI,CEjDR,cAFA,kBAGA,wBAGF,kBACA,cAKA,EACE,8DACA,yBCgNwC,CD9MxC,QACE,mDAWF,4DAEE,cACA,qBAOJ,kBAIE,oCCgV4B,CHlUxB,aALI,CEDV,IACE,cFKI,iBEHJ,mBADA,aAEA,aFHQ,CEQR,SAEE,cFLE,iBALI,CEWN,kBAIJ,KAGE,qBADA,2BFZI,gBEaJ,CAGA,OACE,cAIJ,IAIE,qCCu5CkC,CC5rDhC,qBFoSF,uBCu5CkC,CH/6C9B,gBALI,CE2BR,wBElSE,CFwSF,QF5BI,cE6BF,SFlCM,CE6CV,OACE,gBAMF,QAEE,sBAQF,MAEE,yBADA,mBACA,CAGF,QAGE,+BC4Z4B,CD7Z5B,oBC2X4B,CD5X5B,iBC4X4B,CDzX5B,gBAOF,GAEE,mBACA,gCAGF,2BAQE,cAAa,CAFb,oBAEA,CAQF,MACE,qBAMF,OAEE,gBAQF,iCACE,UAKF,sCAME,oBF5HI,iBALI,CEmIR,oBAHA,QAGA,CAIF,cAEE,oBAKF,cACE,eAGF,OAGE,iBAGA,gBACE,UAOJ,0IACE,uBAQF,gDAIE,0BAGE,4GACE,eAON,mBAEE,kBADA,SACA,CAKF,SACE,gBAUF,SAIE,QAAO,CADP,SAFA,YACA,SAEA,CAQF,OACE,WF9MM,gCEoNN,oBAHA,mBCmN4B,CDpN5B,UADA,UAKA,CFhXE,yBEyWJ,OFtMQ,kBE+MN,SACE,WAOJ,+OAOE,UAGF,4BACE,YASF,cACE,6BACA,oBAmBF,4BACE,wBAKF,+BACE,UAOF,uBAEE,0BADA,YACA,CAKF,OACE,qBAKF,OACE,SAOF,QAEE,eADA,iBACA,CAQF,SACE,wBAQF,SACE,uBGrkBF,MLmQM,iBALI,CK5PR,eFwoB4B,CEnoB5B,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,gBKvQN,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,kBKvQN,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,gBKvQN,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,kBKvQN,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,gBKvQN,WLgQM,iCK5PJ,eFynBkB,CExnBlB,eFwmB0B,CHzgB1B,yBKpGF,WLuQM,kBK1OR,4BC3DE,gBADA,cACA,CD8DF,kBACE,qBAEA,mCACE,kBFsoB0B,CE5nB9B,YL8MM,gBALI,CKvMR,yBAIF,YLwMM,kBKvMJ,kBLkMQ,CK/LR,wBACE,gBAIJ,mBAIE,cL2LI,gBALI,CKxLR,kBEjGO,CFgGP,gBFnFS,CEwFT,0BACE,aG1FJ,0BCCE,YAHA,cAGA,CDDF,eAEE,kCL6jDkC,CK5jDlC,2DJGE,sCILF,cCAA,CDcF,QAEE,qBAGF,YAEE,aAAY,CADZ,mBACA,CAGF,gBAEE,gCRuPI,gBGyzC8B,COllDlC,oFCHA,qBACA,gBAKA,iBADA,kBADA,yCADA,0CADA,UAIA,CCsDE,wBF5CE,yBACE,eHjBe,EK4DnB,wBF5CE,uCACE,eHjBe,EK4DnB,wBF5CE,qDACE,eHjBe,EK4DnB,yBF5CE,mEACE,gBHjBe,EMCvB,MAEI,0HAKF,KCNA,qBACA,gBACA,aACA,eAIA,yCADA,0CADA,sCAEA,CDEE,OCOF,cAKA,8BAHA,eAEA,yCADA,0CAFA,UAIA,CA+CI,KACE,YAGF,iBApCJ,cACA,WAcA,cACE,cACA,WAFF,cACE,cACA,UAFF,cACE,cACA,mBAFF,cACE,cACA,UAFF,cACE,cACA,UAFF,cACE,cACA,mBA+BE,UAhDJ,cACA,WAqDQ,OAhEN,cACA,kBA+DM,OAhEN,cACA,mBA+DM,OAhEN,cACA,UA+DM,OAhEN,cACA,mBA+DM,OAhEN,cACA,mBA+DM,OAhEN,cACA,UA+DM,OAhEN,cACA,mBA+DM,OAhEN,cACA,mBA+DM,OAhEN,cACA,UA+DM,QAhEN,cACA,mBA+DM,QAhEN,cACA,mBA+DM,QAhEN,cACA,WAuEQ,UAxDV,wBAwDU,UAxDV,yBAwDU,UAxDV,gBAwDU,UAxDV,yBAwDU,UAxDV,yBAwDU,UAxDV,gBAwDU,UAxDV,yBAwDU,UAxDV,yBAwDU,UAxDV,gBAwDU,WAxDV,yBAwDU,WAxDV,yBAmEM,WAEE,gBAGF,WAEE,gBAPF,WAEE,sBAGF,WAEE,sBAPF,WAEE,qBAGF,WAEE,qBAPF,WAEE,mBAGF,WAEE,mBAPF,WAEE,qBAGF,WAEE,qBAPF,WAEE,mBAGF,WAEE,mBF1DN,wBEUE,QACE,YAGF,oBApCJ,cACA,WAcA,iBACE,cACA,WAFF,iBACE,cACA,UAFF,iBACE,cACA,mBAFF,iBACE,cACA,UAFF,iBACE,cACA,UAFF,iBACE,cACA,mBA+BE,aAhDJ,cACA,WAqDQ,UAhEN,cACA,kBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,WAuEQ,aAxDV,cAwDU,aAxDV,wBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,cAxDV,yBAwDU,cAxDV,yBAmEM,iBAEE,gBAGF,iBAEE,gBAPF,iBAEE,sBAGF,iBAEE,sBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,mBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,oBF1DN,wBEUE,QACE,YAGF,oBApCJ,cACA,WAcA,iBACE,cACA,WAFF,iBACE,cACA,UAFF,iBACE,cACA,mBAFF,iBACE,cACA,UAFF,iBACE,cACA,UAFF,iBACE,cACA,mBA+BE,aAhDJ,cACA,WAqDQ,UAhEN,cACA,kBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,WAuEQ,aAxDV,cAwDU,aAxDV,wBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,cAxDV,yBAwDU,cAxDV,yBAmEM,iBAEE,gBAGF,iBAEE,gBAPF,iBAEE,sBAGF,iBAEE,sBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,mBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,oBF1DN,wBEUE,QACE,YAGF,oBApCJ,cACA,WAcA,iBACE,cACA,WAFF,iBACE,cACA,UAFF,iBACE,cACA,mBAFF,iBACE,cACA,UAFF,iBACE,cACA,UAFF,iBACE,cACA,mBA+BE,aAhDJ,cACA,WAqDQ,UAhEN,cACA,kBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,WAuEQ,aAxDV,cAwDU,aAxDV,wBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,cAxDV,yBAwDU,cAxDV,yBAmEM,iBAEE,gBAGF,iBAEE,gBAPF,iBAEE,sBAGF,iBAEE,sBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,mBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,oBF1DN,yBEUE,QACE,YAGF,oBApCJ,cACA,WAcA,iBACE,cACA,WAFF,iBACE,cACA,UAFF,iBACE,cACA,mBAFF,iBACE,cACA,UAFF,iBACE,cACA,UAFF,iBACE,cACA,mBA+BE,aAhDJ,cACA,WAqDQ,UAhEN,cACA,kBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,mBA+DM,UAhEN,cACA,UA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,mBA+DM,WAhEN,cACA,WAuEQ,aAxDV,cAwDU,aAxDV,wBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,aAxDV,yBAwDU,aAxDV,yBAwDU,aAxDV,gBAwDU,cAxDV,yBAwDU,cAxDV,yBAmEM,iBAEE,gBAGF,iBAEE,gBAPF,iBAEE,sBAGF,iBAEE,sBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,mBAPF,iBAEE,qBAGF,iBAEE,qBAPF,iBAEE,mBAGF,iBAEE,oBCrHV,OAEE,8BACA,2BACA,+BACA,4BAEA,0CACA,gCACA,+CACA,iCACA,kDACA,8DACA,iDACA,4DACA,gDACA,6DAKA,0CAFA,kBRtBO,CQuBP,kBZusB4B,CYzsB5B,UAGA,CAOA,yBAIE,oCACA,0CZ+sB0B,CY9sB1B,yGAHA,mFAFA,aAKA,CAGF,aACE,uBAGF,aACE,sBAIJ,qBACE,gDAOF,aACE,iBAUA,4BACE,eAeF,gCACE,sCAGA,kCACE,sCAOJ,oCACE,sBAGF,qCACE,mBAkBF,kGACE,oDACA,8CAQJ,cACE,oDACA,8CAQA,8BACE,mDACA,6CC5IF,eAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,gCAkBE,0CADA,2BACA,CAlBF,iBAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,eAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,2BAkBE,0CADA,2BACA,CAlBF,YAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,eAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,6BAkBE,0CADA,2BACA,CAlBF,cAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,aAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CAlBF,yBAkBE,0CADA,2BACA,CAlBF,YAOE,sBACA,sBACA,gCACA,8BACA,8BACA,6BACA,6BACA,4BACA,2BAGA,CDiJA,kBAEE,iCADA,eACA,CH3FF,2BGyFA,qBAEE,iCADA,eACA,EH3FF,2BGyFA,qBAEE,iCADA,eACA,EH3FF,2BGyFA,qBAEE,iCADA,eACA,EH3FF,4BGyFA,qBAEE,iCADA,eACA,EEnKN,YACE,mBdu2BsC,Cc91BxC,gBjBiRM,iBALI,CiBrQR,gBAJA,gBADA,sDADA,kDdqmB4B,Cc3lB9B,mBjBsQM,kBiBpQJ,oDADA,gDjBgQQ,CiB3PV,mBjBgQM,kBiB9PJ,qDADA,iDjB0PQ,CkBtRV,WAKE,gClBsRI,gBALI,CkBrRR,iBfm2BsC,CgBp2BxC,cASE,gBAEA,4BADA,kChBq3BsC,CgBn3BtC,2DfGE,sCePF,0BhB43BsC,CgBn4BtC,cnB0RI,cALI,CmBhRR,ehBkmB4B,CgBjmB5B,ehBymB4B,CgB7mB5B,uBCSI,qEDVJ,UAgBA,CCFI,sCDhBN,cCiBQ,iBDGN,yBACE,gBAEA,wDACE,eAKJ,oBAEE,kChBg2BoC,CgB/1BpC,oBhB82BoC,CgBx2BlC,6CARF,0BhBs2BoC,CgBn2BpC,ShBuhBoB,CgB9gBtB,2CAYE,aAKA,QAAO,CAXP,cAWA,CAKF,qCACE,cACA,UAIF,2BACE,+BhB40BoC,CgB10BpC,UAQF,uBAEE,uChB8yBoC,CgB3yBpC,UAIF,oCE1FA,sClBqiCgC,CgBl8B9B,eAFA,qBAGA,8ChBgsB0B,CgB/rB1B,gBAPA,0BhBsyBoC,CgBxyBpC,wBACA,wBhBorB0B,CgBtrB1B,uBAKA,oBCpFE,6HD0FF,CCtFE,sCD0EJ,oCCzEM,iBDwFN,yEACE,uChB47B8B,CgBn7BlC,wBAOE,6BACA,yBACA,sCAHA,0BhB2xBsC,CgBhyBtC,cAIA,ehBwf4B,CgBzf5B,gBADA,kBADA,UAOA,CAEA,8BACE,UAGF,gFAGE,cAAa,CADb,eACA,CAWJ,iBfjII,yCJ4QE,iBALI,CmBrIR,yDhB4wBsC,CgB3wBtC,oBfnIE,CeuIF,uCAEE,sBACA,wBAFA,oBhBsoB0B,CgBhoB9B,iBf9II,yCJ4QE,iBALI,CmBxHR,wDhBgwBsC,CgB/vBtC,kBfhJE,CeoJF,uCAEE,oBACA,uBAFA,kBhB6nB0B,CgBnnB5B,sBACE,0DhB6uBoC,CgB1uBtC,yBACE,yDhB0uBoC,CgBvuBtC,yBACE,wDhBuuBoC,CgBluBxC,oBAEE,sDhB8tBsC,CgB7tBtC,gBAFA,UhBmlB4B,CgB/kB5B,mDACE,eAGF,uCACE,mBfvLA,sCe2LF,0CACE,mBf5LA,sCegMF,yFhB8sBsC,CgB7sBtC,wFhB8sBsC,CmB75BxC,aACE,sQAUA,gBACA,kCnBk3BsC,CmBj3BtC,iFAEA,uCnB+9BkC,CmBh+BlC,4BAEA,yBnB+9BkC,CmB99BlC,2DlBHE,sCkBJF,0BnBy3BsC,CmBh4BtC,ctBuRI,cALI,CsB7QR,enB+lB4B,CmB9lB5B,enBsmB4B,CmB1mB5B,uCFMI,qEEPJ,UAgBA,CFLI,sCEfN,aFgBQ,iBEMN,mBACE,oBnBs3BoC,CmBh3BlC,6CALF,SnBs+B8B,CmB79BhC,0DAGE,sBADA,oBACA,CAGF,sBAEE,uCnBu1BoC,CmBl1BtC,4BACE,kBACA,uCAIJ,gBlBtCI,yCJ4QE,iBALI,CsB/NR,qBnBquB4B,CmBpuB5B,kBnBquB4B,CmBvuB5B,kBlBvCE,CkB8CJ,gBlB9CI,yCJ4QE,iBALI,CsBvNR,oBnBiuB4B,CmBhuB5B,iBnBiuB4B,CmBnuB5B,iBlB/CE,CkBwDA,kCACE,sQCxEN,YACE,cAGA,sBAFA,iBpBq6BwC,CoBp6BxC,kBpBs6BwC,CoBn6BxC,8BACE,WACA,mBAIJ,oBAEE,eADA,mBpB25BwC,CoBz5BxC,iBAEA,sCACE,YAEA,aAAY,CADZ,mBACA,CAIJ,kBACE,qCAOA,gBACA,yCACA,+CAEA,wBADA,4BAEA,wBACA,0DpB24BwC,CoBt5BxC,cAEA,UpBy4BwC,CoBx4BxC,iBASA,yBARA,mBAHA,SAWA,CAGA,iCnB3BE,oBmB+BF,8BAEE,iBpBm4BsC,CoBh4BxC,yBACE,sBpB03BsC,CoBv3BxC,wBACE,oBpBs1BoC,CoBp1BpC,6CADA,SpB+foB,CoB3ftB,0BACE,wBpB5BM,CoB6BN,oBpB7BM,CoB+BN,yCAII,qQAIJ,sCAII,6KAKN,+CAOI,+PANF,wBpBjDM,CoBkDN,oBAKE,CAIJ,2BAEE,YACA,WAFA,mBpBo2BuC,CoB31BvC,2FACE,eACA,UpBy1BqC,CoB30B3C,aACE,kBpBo1BgC,CoBl1BhC,+BACE,qLAIA,0CACA,sBnBjHA,kBmB+GA,mBHlHE,gDGiHF,SAKA,CHlHE,sCG0GJ,+BHzGM,iBGmHJ,qCACE,2KAGF,uCAMI,wKALF,wBAKE,CAKN,gCAEE,cAAa,CADb,mBACA,CAEA,kDAEE,aAAY,CADZ,mBACA,CAKN,mBACE,qBACA,iBpBsyBgC,CoBnyBlC,WAEE,mBACA,oBAFA,iBAEA,CAIE,mDAEE,YACA,YAFA,mBpBwpBwB,CoB/oB1B,8EACE,2LCnLN,YAIE,gBACA,6BAHA,cACA,UAFA,UAIA,CAEA,kBACE,UAIA,mGrB8gCuC,CqB7gCvC,+FrB6gCuC,CqB1gCzC,8BACE,SAGF,kCAIE,gBH1BF,wBlBkCQ,CqBNN,QrB6/BuC,CC1gCvC,mBoBSA,WrB8/BuC,CqB7/BvC,mBJbE,uGIWF,UAQA,CJfE,sCIMJ,kCJLM,iBIgBJ,yCHjCF,wBlB8hCyC,CqBx/BzC,2CAKE,uCrBu+B8B,CqBt+B9B,yBpB7BA,mBoB0BA,kBACA,crBu+B8B,CqBz+B9B,YrBw+B8B,CqBz+B9B,UpBxBA,CoBkCF,8BAGE,gBHpDF,wBlBkCQ,CqBoBN,QrBm+BuC,CC1gCvC,mBoBoCA,WrBm+BuC,CiB1gCrC,uGIsCF,UAOA,CJzCE,sCIiCJ,8BJhCM,iBI0CJ,qCH3DF,wBlB8hCyC,CqB99BzC,8BAKE,uCrB68B8B,CqB58B9B,yBpBvDA,mBoBoDA,kBACA,crB68B8B,CqB/8B9B,YrB88B8B,CqB/8B9B,UpBlDA,CoB4DF,qBACE,oBAEA,2CACE,0CrBg9BqC,CqB78BvC,uCACE,0CrB48BqC,CsBniC3C,eACE,kBAEA,gGAGE,8CtBwiCoC,CsBtiCpC,iBADA,kDtBwiCoC,CsBpiCtC,qBAYE,gDAPA,YAFA,OAIA,gBADA,oBAKA,oBAVA,kBAOA,iBACA,uBAPA,MAWA,qBLRE,6DKKF,mBANA,SAUA,CLLE,sCKTJ,qBLUM,iBKON,oEAEE,oBAEA,8FACE,kBAGF,oMAGE,uBADA,oBtB6gCkC,CsBzgCpC,sGAEE,uBADA,oBtBwgCkC,CsBngCtC,4BAEE,uBADA,oBtBkgCoC,CsB1/BpC,mLACE,yCACA,0DtB2/BkC,CsBz/BlC,2MAME,kCtBg0BgC,CCh3BpC,sCqB+CI,WADA,YtBm/BgC,CsBr/BhC,mBADA,kBAEA,UrB7CJ,CqBuDA,oDACE,yCACA,0DtB0+BkC,CsBr+BpC,6CACE,sCAIJ,2EAEE,atB1EO,CsB4EP,uFACE,uCtB0yBkC,CuBj4BxC,aAIE,oBAFA,aACA,eAFA,kBAIA,WAEA,iFAIE,cAEA,WAAU,CAHV,kBAEA,QACA,CAIF,0GAGE,UAMF,kBACE,kBACA,UAEA,wBACE,UAWN,kBAEE,mBAQA,sCvB06BsC,CuBz6BtC,2DtBtCE,sCsBkCF,0BvBm1BsC,CuBz1BtC,a1BgPI,cALI,C0BvOR,evByjB4B,CuBxjB5B,evBgkB4B,CuBnkB5B,uBAKA,kBACA,kBtBpCE,CsBgDJ,kHtBhDI,yCJ4QE,iBALI,C0BnNR,kBtBpDE,CsByDJ,kHtBzDI,yCJ4QE,iBALI,C0B1MR,oBtB7DE,CsBkEJ,0DAEE,mBAsBE,iqBtBzEA,4BAA2B,CAD3B,yBACA,CsBsFF,0ItBxEE,2BAA0B,CAD1B,yBsB0EA,2CtBzEA,CsB6EF,uHtB7EE,2BAA0B,CAD1B,wBACA,CuBxBF,gBAME,iCALA,a3BoQE,gBALI,C2B7PN,iBxBu0BoC,CwBx0BpC,UxBsjCqB,CwB/iCvB,eAWE,kCxBoiCqB,CC/jCrB,sCuB0BA,UxBqiCqB,CwB3iCrB,a3BwPE,iBALI,C2BhPN,iBAFA,eACA,qBALA,kBACA,SACA,SvBnBA,CuBgCA,8HAEE,cA/CF,0DAyDI,yQAEA,yDADA,4BAEA,4DAPF,8CxBuhCmB,CwBphCjB,kCAIA,CAGF,sEACE,8CxB4gCiB,CwB3gCjB,uDxB2gCiB,CwB5kCrB,0EA2EI,8EADA,kCACA,CA3EJ,wDAkFE,8CxB0/BmB,CwBv/BjB,4NAEE,iRAEA,6DACA,sEAFA,sBAEA,CAIJ,oEACE,8CxB6+BiB,CwB5+BjB,uDxB4+BiB,CwB5kCrB,sEAwGI,4BAxGJ,kEA+GE,8CxB69BmB,CwB39BnB,kFACE,2CxB09BiB,CwBv9BnB,8EACE,uDxBs9BiB,CwBn9BnB,sGACE,gCxBk9BiB,CwB78BrB,qDACE,iBAhIF,kVA0IM,UAtHR,kBAME,mCALA,a3BoQE,gBALI,C2B7PN,iBxBu0BoC,CwBx0BpC,UxBsjCqB,CwB/iCvB,iBAWE,iCxBoiCqB,CC/jCrB,sCuB0BA,UxBqiCqB,CwB3iCrB,a3BwPE,iBALI,C2BhPN,iBAFA,eACA,qBALA,kBACA,SACA,SvBnBA,CuBgCA,8IAEE,cA/CF,8DAyDI,sUAEA,yDADA,4BAEA,4DAPF,gDxBuhCmB,CwBphCjB,kCAIA,CAGF,0EACE,gDxB4gCiB,CwB3gCjB,sDxB2gCiB,CwB5kCrB,8EA2EI,8EADA,kCACA,CA3EJ,4DAkFE,gDxB0/BmB,CwBv/BjB,oOAEE,8UAEA,6DACA,sEAFA,sBAEA,CAIJ,wEACE,gDxB6+BiB,CwB5+BjB,sDxB4+BiB,CwB5kCrB,0EAwGI,4BAxGJ,sEA+GE,gDxB69BmB,CwB39BnB,sFACE,6CxB09BiB,CwBv9BnB,kFACE,sDxBs9BiB,CwBn9BnB,0GACE,kCxBk9BiB,CwB78BrB,uDACE,iBAhIF,8VA4IM,UC9IV,KAEE,2BACA,4BACA,uB5BuRI,uBALI,C4BhRR,yBACA,yBACA,oCACA,wBACA,6CACA,kCACA,+CACA,wCACA,iFACA,+BACA,gFPhBA,iCOkCqB,CAFrB,mExBjBE,0CwBUF,0BAKA,eAXA,qBAEA,sC5BsQI,iCALI,C4B/PR,sCACA,sCAJA,wDAMA,kBACA,qBRfI,8HQmBJ,iBAFA,qBAOA,CRpBI,sCQhBN,KRiBQ,iBQqBN,WAGE,wCACA,8CAHA,+BAGA,CAGF,sBAGE,kCACA,wCAFA,yBAEA,CAGF,mBPpDA,uCOsDuB,CACrB,8CAME,0CARF,gCAGA,SAKE,CAIJ,8BACE,8CAME,0CALF,SAKE,CAIJ,mGAME,yCAGA,+CAJA,gCAIA,CAGA,yKAKI,0CAKN,mDAKE,2CAEA,iDAJA,mCAKA,uCAJA,mBAIA,CAYF,aCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,qCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,eCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,sCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,aCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,qCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,UCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,qCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,aCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,oCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,YCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,oCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,WCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,sCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDyFA,UCtGA,oBACA,oBACA,8BACA,0BACA,0BACA,oCACA,mCACA,2BACA,2BACA,qCACA,wDACA,6BACA,6BACA,uCDmHA,qBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,qCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,uBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,sCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,qBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,oCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,kBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,qCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,qBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,oCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,oBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,oCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,mBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,sCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBD0FA,kBCvGA,uBACA,8BACA,0BACA,0BACA,oCACA,mCACA,2BACA,2BACA,qCACA,wDACA,gCACA,iCACA,uCACA,mBDsGF,UACE,yBACA,oCACA,wBACA,kCACA,gDACA,wCACA,iDACA,yCACA,gCACA,2CACA,+BACA,qCAEA,yBzBuRwC,CyB7QxC,wBACE,0BAGF,gBACE,gCAWJ,2BCxIE,0BACA,wB7B8NI,0BALI,C6BvNR,kDDyIF,2BC5IE,2BACA,0B7B8NI,2BALI,C6BvNR,kDCnEF,MVgBM,8BUfJ,CVmBI,sCUpBN,MVqBQ,iBUlBN,iBACE,UAMF,qBACE,aAIJ,YACE,SACA,gBVDI,2BUEJ,CVEI,sCULN,YVMQ,iBUDN,gCAEE,YVNE,2BUKF,OAEA,CVHE,sEACE,iBWpBR,sEAME,kBAGF,iBACE,mBCwBE,uBA/BF,gBACA,mCAFA,oCADA,sBAqCI,WAHA,qBACA,kB7B6hBwB,C6B5hBxB,qBAjCJ,CA0DE,6BACE,cD9CN,eAEE,0BACA,8BACA,0BACA,+BACA,8B/BuQI,4BALI,C+BhQR,yCACA,mCACA,8DACA,oDACA,kDACA,yFACA,4DACA,sCACA,8CACA,8CACA,oDACA,qDACA,qCACA,sDACA,2DACA,kCACA,qCACA,mCACA,oCACA,sCAcA,4BADA,uCAEA,6E3BzCE,+C2BoCF,+BALA,a/B6OI,sCALI,C+BjOR,gBAJA,SAFA,uCACA,kEAJA,kBAQA,gBAPA,iC3B9BE,C2B6CF,+BAEE,OACA,qCAFA,QAEA,CAwBA,qBACE,mBAAoB,CAEpB,qCAEE,MAAK,CADL,UACA,CAIJ,mBACE,iBAAkB,CAElB,mCAEE,UADA,OACA,CnB1CJ,wBmB4BA,wBACE,mBAAoB,CAEpB,wCAEE,MAAK,CADL,UACA,CAIJ,sBACE,iBAAkB,CAElB,sCAEE,UADA,OACA,EnB1CJ,wBmB4BA,wBACE,mBAAoB,CAEpB,wCAEE,MAAK,CADL,UACA,CAIJ,sBACE,iBAAkB,CAElB,sCAEE,UADA,OACA,EnB1CJ,wBmB4BA,wBACE,mBAAoB,CAEpB,wCAEE,MAAK,CADL,UACA,CAIJ,sBACE,iBAAkB,CAElB,sCAEE,UADA,OACA,EnB1CJ,yBmB4BA,wBACE,mBAAoB,CAEpB,wCAEE,MAAK,CADL,UACA,CAIJ,sBACE,iBAAkB,CAElB,sCAEE,UADA,OACA,EAUN,uCAEE,YAEA,wCADA,aAFA,QAGA,CCpFA,+BAxBF,yBACA,mCAFA,oCADA,aA8BI,WAHA,qBACA,kB7B6hBwB,C6B5hBxB,qBA1BJ,CAmDE,qCACE,cDgEJ,wCAGE,UAEA,sCADA,aAFA,WADA,KAIA,CClGA,gCAjBF,qCACA,uBAFA,eADA,kCAuBI,WAHA,qBACA,kB7B6hBwB,C6B5hBxB,qBAnBJ,CA4CE,sCACE,cD0EF,gCACE,iBAMJ,0CAGE,UAEA,uCADA,aAFA,WADA,KAIA,CCnHA,kCAIE,WAHA,qBAeE,aAdF,kB7B6hBwB,C6B5hBxB,qBACA,CAeA,mCA7BJ,qCADA,wBADA,kCAmCM,WAHA,qBACA,mB7B0gBsB,C6BzgBtB,qBAhCN,CAsCE,wCACE,cD2FF,mCACE,iBAON,kBAIE,mDAHA,SACA,6CAGA,SAAQ,CAFR,eAEA,CAMF,eAUE,6BACA,S3BtKE,sD2B+JF,WAEA,oCALA,cAIA,e5Byb4B,C4B3b5B,4EAIA,mBACA,qBACA,mBAPA,U3B7JE,C2ByKF,0CVxLA,kDU0LE,yCAEqB,CAGvB,4CV/LA,mDUiME,2CACA,oBACqB,CAGvB,gDAIE,6BAFA,6CACA,mBACA,CAMJ,oBACE,cAIF,iBAKE,sCAJA,c/BqEI,iBALI,C+B9DR,gBADA,gFAIA,mBAIF,oBAGE,oCAFA,cACA,2EACA,CAIF,oBAEE,4BACA,yBACA,8DACA,2BACA,iCACA,oCACA,4DACA,qDACA,qCACA,sDACA,0CACA,mCEtPF,+BAGE,oBADA,kBAEA,sBAEA,yCAEE,cADA,iBACA,CAKF,kXAME,UAKJ,aACE,aACA,eACA,2BAEA,0BACE,WAIJ,W7BhBI,sC6BoBF,qFAEE,4CAIF,qJ7BTE,4BAA2B,CAD3B,yBACA,C6BmBF,6G7BLE,2BAA0B,CAD1B,wBACA,C6BwBJ,uBAEE,sBADA,sBACA,CAEA,wGAGE,cAGF,yCACE,eAIJ,yEAEE,qBADA,qBACA,CAGF,yEAEE,oBADA,oBACA,CAoBF,oBAEE,uBADA,sBAEA,uBAEA,wDAEE,WAGF,4FAEE,2CAIF,qH7BzFE,2BAA0B,CAD1B,4BACA,C6B8FF,oF7B7GE,yBACA,0B8BxBJ,KAEE,6BACA,+BAEA,4BACA,yCACA,qDACA,uDAGA,aACA,eAGA,gBADA,gBADA,cAEA,CAGF,UAOE,gBACA,SAHA,+BAJA,clCuQI,sCALI,CkC/PR,2CAFA,kEAIA,qBdbI,iGcgBJ,CdZI,sCcGN,UdFQ,iBcaN,gCAEE,qCAIF,wBAEE,6CADA,S/BmhBoB,C+B9gBtB,sCAEE,wCAEA,eADA,mBACA,CAQJ,UAEE,kDACA,kDACA,oDACA,2GACA,yDACA,+CACA,uGAGA,oFAEA,oBAEE,yD9B7CA,wDACA,yD8B2CA,sD9B3CA,C8B+CA,oDAIE,wDADA,iBACA,CAIJ,8DAGE,mDACA,yDAFA,0CAEA,CAGF,yB9B/DE,yBACA,yBAAwB,C8BgExB,mD9BhEA,C8B2EJ,WAEE,qDACA,sCACA,sCAGA,qB9B5FE,gD8BgGF,uDb/GA,oDaiHE,2CACqB,CASzB,eAEE,4BACA,yCACA,8DAGA,gCAEA,yBAGE,qEADA,eADA,eAEA,CAEA,8DAEE,iCAIJ,+DAIE,iCADA,gDADA,eAEA,CAUF,wCAEE,cACA,kBAKF,kDAEE,aACA,YACA,kBAMF,iEACE,WAUF,uBACE,aAEF,qBACE,cC7LJ,QAEE,wBACA,6BACA,0DACA,+DACA,kEACA,8DACA,sCACA,kCACA,oCACA,6DACA,mEACA,sCACA,sCACA,sCACA,sCACA,qRACA,yEACA,0DACA,wCACA,4DAMA,mBAFA,aACA,eAEA,8BACA,8DALA,iBAKA,CAMA,oIAGE,mBAFA,aACA,kBAEA,8BAoBJ,cAKE,mCnC0NI,0CALI,CmCvNR,+CADA,gDADA,6CAKA,qBACA,mBAEA,wCAEE,yCAUJ,YAEE,0BACA,+BAEA,4BACA,2CACA,uDACA,6DAGA,aACA,sBAGA,gBADA,gBADA,cAEA,CAGE,wDAEE,oCAIJ,2BACE,gBASJ,aAGE,6BADA,oBhC6gCkC,CgC9gClC,iBAEA,CAEA,yDAGE,oCAaJ,iBAKE,mBAJA,gBACA,WAGA,CAIF,gBAKE,6BACA,0E/BxIE,qD+BsIF,6BnCsII,4CALI,CmClIR,cAFA,8EftII,8Ce6IJ,CfzII,sCeiIN,gBfhIQ,iBe0IN,sBACE,qBAGF,sBAGE,sDADA,UADA,oBAEA,CAMJ,qBAKE,kDAEA,wBADA,4BAEA,qBAPA,qBAEA,aACA,sBAFA,WAMA,CAGF,mBACE,wCACA,gBvB1HE,wBuBsIA,kBAEI,iBACA,2BAEA,8BACE,mBAEA,6CACE,kBAGF,wCAEE,iDADA,iDACA,CAIJ,qCACE,iBAGF,mCACE,uBACA,gBAGF,kCACE,aAGF,6BAQE,uCACA,mBALA,YAEA,sBAJA,gBAQA,yBf9NJ,gBe2NI,6BAFA,qBAFA,YASA,CAGA,+CACE,aAGF,6CACE,aACA,YAEA,mBADA,SACA,EvB5LR,wBuBsIA,kBAEI,iBACA,2BAEA,8BACE,mBAEA,6CACE,kBAGF,wCAEE,iDADA,iDACA,CAIJ,qCACE,iBAGF,mCACE,uBACA,gBAGF,kCACE,aAGF,6BAQE,uCACA,mBALA,YAEA,sBAJA,gBAQA,yBf9NJ,gBe2NI,6BAFA,qBAFA,YASA,CAGA,+CACE,aAGF,6CACE,aACA,YAEA,mBADA,SACA,EvB5LR,wBuBsIA,kBAEI,iBACA,2BAEA,8BACE,mBAEA,6CACE,kBAGF,wCAEE,iDADA,iDACA,CAIJ,qCACE,iBAGF,mCACE,uBACA,gBAGF,kCACE,aAGF,6BAQE,uCACA,mBALA,YAEA,sBAJA,gBAQA,yBf9NJ,gBe2NI,6BAFA,qBAFA,YASA,CAGA,+CACE,aAGF,6CACE,aACA,YAEA,mBADA,SACA,EvB5LR,yBuBsIA,kBAEI,iBACA,2BAEA,8BACE,mBAEA,6CACE,kBAGF,wCAEE,iDADA,iDACA,CAIJ,qCACE,iBAGF,mCACE,uBACA,gBAGF,kCACE,aAGF,6BAQE,uCACA,mBALA,YAEA,sBAJA,gBAQA,yBf9NJ,gBe2NI,6BAFA,qBAFA,YASA,CAGA,+CACE,aAGF,6CACE,aACA,YAEA,mBADA,SACA,EAtDR,eAEI,iBACA,2BAEA,2BACE,mBAEA,0CACE,kBAGF,qCAEE,iDADA,iDACA,CAIJ,kCACE,iBAGF,gCACE,uBACA,gBAGF,+BACE,aAGF,0BAQE,uCACA,mBALA,YAEA,sBAJA,gBAQA,yBf9NJ,gBe2NI,6BAFA,qBAFA,YASA,CAGA,4CACE,aAGF,0CACE,aACA,YAEA,mBADA,SACA,CAiBZ,yCAGE,sCACA,4CACA,+CACA,8BACA,6BACA,mCACA,mDACA,CAME,mFANF,uRAOI,CCzRN,MAEE,wBACA,wBACA,gCACA,wBACA,2BACA,8CACA,0DACA,gDACA,uBACA,qFACA,+BACA,6BACA,qDACA,sBACA,mBACA,kBACA,+BACA,mCACA,+BASA,qBAEA,2BADA,mCAEA,qEhCjBE,2CgCaF,2BAJA,aACA,sBAEA,6BADA,YAHA,iBhCRE,CgCqBF,SAEE,aAAY,CADZ,cACA,CAGF,kBAEE,sBADA,kBACA,CAEA,8BhCrBA,0DACA,2DgCqBE,kBhCrBF,CgCyBA,6BhCXA,6DADA,8DgCaE,qBhCZF,CgCmBF,8DAEE,aAIJ,WAKE,2BAFA,cACA,uDACA,CAGF,YAEE,iCADA,2CACA,CAGF,eAGE,oCAFA,kDAEA,CAGF,qCAJE,eAKA,CAQA,sBACE,oCAQJ,aAIE,uCACA,4EAFA,+BADA,gBADA,iEAIA,CAEA,yBhC7FE,wFgCkGJ,aAGE,uCACA,yEAFA,+BADA,iEAGA,CAEA,wBhCxGE,wFgCkHJ,kBAIE,eAAc,CAFd,oDACA,mDAFA,mDAGA,CAEA,mCACE,mCACA,sCAIJ,mBAEE,mDADA,mDACA,CAIF,kBhCpII,iDgCwIF,SACA,OACA,2CALA,kBAEA,QADA,KhCtIE,CgC8IJ,yCAGE,WAGF,wBhC3II,0DACA,2DgC+IJ,2BhCjII,6DADA,6DACA,CgC8IF,kBACE,0CxB3HA,wBwBuHJ,YAQI,aACA,mBAGA,kBAEE,YACA,gBAEA,wBAEE,aAAY,CADZ,aACA,CAKA,mChC1KJ,4BAA2B,CAD3B,yBACA,CgC6KM,iGAGE,0BAEF,oGAGE,6BAIJ,oChC3KJ,2BAA0B,CAD1B,wBACA,CgC8KM,mGAGE,yBAEF,sGAGE,6BCpOZ,WAEE,0CACA,oCACA,0KACA,mDACA,mDACA,qDACA,0FACA,qCACA,kCACA,8CACA,6CACA,sTACA,sCACA,kDACA,8DACA,6TACA,8CACA,uEACA,sCACA,mCACA,4DACA,qDAIF,kBAGE,mBAMA,4CACA,SjCtBE,gBiCmBF,oCALA,arC8PI,cALI,CqC/OR,qBAPA,4EAJA,kBAOA,gBjBvBI,0CiBmBJ,UASA,CjBxBI,sCiBWN,kBjBVQ,iBiByBN,kCAEE,+CACA,gGAFA,sCAEA,CAEA,wCACE,qDACA,iDAKJ,wBAME,8CACA,4BACA,mDAHA,WAJA,cAEA,0CACA,iBjB9CE,mDiB4CF,wCAOA,CjB/CE,sCiBsCJ,wBjBrCM,iBiBiDN,wBACE,UAGF,wBAEE,wDAEA,oDADA,UAFA,SAGA,CAIJ,kBACE,gBAGF,gBAEE,wCACA,+EAFA,+BAEA,CAEA,8BjC/DE,yDACA,0DiCiEA,gDjClEA,+DACA,gEiCsEF,oCACE,aAIF,6BjC7DE,4DADA,4DACA,CiCiEE,yDjCjEF,kEADA,kEACA,CiCsEA,iDjCtEA,4DADA,4DACA,CiC4EJ,gBACE,8EASA,qCACE,eAGF,iCAEE,cjCpHA,eAAc,CiCmHd,cjCnHA,CiCuHA,0DACA,4DAGE,gHjC3HF,gBiCqIA,6CACE,sTACA,6TC1JN,YAEE,4BACA,4BACA,mCAEA,qBACA,gCACA,wDACA,sCACA,4DASA,0FANA,aACA,etCiRI,wCALI,CsCxQR,gBAFA,iDADA,qEAIA,CAMA,kCACE,iDAEA,yCAGE,yCACA,yCAHA,WACA,iDAEA,CAIJ,wBACE,6CCrCJ,YAEE,kCACA,mCvC4RI,8BALI,CuCrRR,2CACA,qCACA,oDACA,oDACA,sDACA,uDACA,+CACA,0DACA,uDACA,gDACA,oEACA,kCACA,kCACA,4CACA,yDACA,mDACA,6DAGA,ajCnBA,gBADA,cACA,CiCuBF,WAOE,yCACA,iFAHA,iCAHA,cvCiQI,wCALI,CuC3PR,sEAFA,kBAKA,qBnBlBI,6HmBqBJ,CnBjBI,sCmBQN,WnBPQ,iBmBkBN,iBAIE,+CACA,qDAHA,uCADA,SAIA,CAGF,iBAGE,+CAEA,iDAHA,uCAEA,SpC2uCgC,CoC9uChC,SAIA,CAGF,qClBnDA,+CkBuDuB,CACrB,sDAFA,wCADA,SAGA,CAGF,yCAIE,kDACA,wDAHA,0CACA,mBAEA,CAKF,wCACE,2CpC8sCgC,CoCzsC9B,kCnC7BF,6DADA,yDACA,CmCmCE,iCnCjDF,8DADA,0DACA,CmCkEJ,eClGE,iCACA,kCxC0RI,iCALI,CwCnRR,yDDmGF,eCtGE,iCACA,kCxC0RI,kCALI,CwCnRR,yDCFF,OAEE,4BACA,4BzCuRI,2BALI,CyChRR,2BACA,sBACA,iDrCOE,4CqCCF,4BALA,qBzCgRI,mCALI,CyCxQR,wCACA,cAHA,4DAKA,kBAEA,wBADA,kBrCHE,CqCSF,aACE,aAKJ,YACE,kBACA,SChCF,OAEE,0BACA,0BACA,0BACA,8BACA,yBACA,oCACA,4EACA,iDACA,8BAOA,oCACA,8BtCHE,4CsCCF,4BADA,4CADA,4DADA,iBtCEE,CsCQJ,eAEE,cAIF,YAEE,iCADA,eACA,CAQF,mBACE,kBvCo+C8B,CuCj+C9B,8BAKE,qBAJA,kBAEA,QADA,MAEA,SACA,CAQF,eACE,iDACA,0CACA,wDACA,sDAJF,iBACE,mDACA,4CACA,0DACA,wDAJF,eACE,iDACA,0CACA,wDACA,sDAJF,YACE,8CACA,uCACA,qDACA,mDAJF,eACE,iDACA,0CACA,wDACA,sDAJF,cACE,gDACA,yCACA,uDACA,qDAJF,aACE,+CACA,wCACA,sDACA,oDAJF,YACE,8CACA,uCACA,qDACA,mDC5DF,gCACE,6BxCuhDgC,EwClhDpC,4BAGE,0B3CkRI,+BALI,C2C3QR,wCACA,oDACA,oDACA,6BACA,6BACA,6CAOA,uCvCRE,+CuCIF,a3CwQI,sCALI,C2ClQR,iCACA,evCNE,CuCaJ,cAQE,2CAHA,mCAJA,aACA,sBACA,uBACA,gBAEA,kBvBtBI,6CuBuBJ,kBAEA,CvBrBI,sCuBYN,cvBXQ,iBuBuBR,4LAEE,oEAGF,4BACE,iBAGF,0CACE,WAIA,uBACE,kDAGE,sCAJJ,uBAKM,gBC3DR,YAEE,2CACA,qCACA,oDACA,oDACA,sDACA,oCACA,sCACA,uDACA,4DACA,sDACA,yDACA,wDACA,yDACA,8CACA,kCACA,kCACA,4CxCHE,iDwCMF,aACA,sBAIA,gBADA,cxCVE,CwCeJ,qBAEE,sBADA,oBACA,CAEA,6CAEE,mCACA,0BASJ,wBAEE,wCACA,mBAFA,UAEA,CAGA,4DAKE,sDAFA,8CACA,qBAFA,SAGA,CAGF,+BAEE,uDADA,8CACA,CAQJ,iBAME,yCACA,iFAHA,iCAFA,cACA,gFAFA,kBAIA,oBAEA,CAEA,6BxCvDE,+BACA,gCwC0DF,4BxC5CE,kCADA,kCACA,CwCgDF,oDAIE,kDAFA,0CACA,mBACA,CAIF,wBAGE,gDACA,sDAFA,wCADA,SAGA,CAIF,kCACE,mBAEA,yCAEE,mDADA,qDACA,CAaF,uBACE,mBAGE,qExCvDJ,6DAZA,0BwCwEI,qExC5DJ,2BAA0B,CAZ1B,0DAYA,CwCiEI,+CACE,aAGF,yDAEE,mBAAkB,CADlB,kDACA,CAEA,gEAEE,oDADA,sDACA,ChCtFR,wBgC8DA,0BACE,mBAGE,wExCvDJ,6DAZA,0BwCwEI,wExC5DJ,2BAA0B,CAZ1B,0DAYA,CwCiEI,kDACE,aAGF,4DAEE,mBAAkB,CADlB,kDACA,CAEA,mEAEE,oDADA,sDACA,EhCtFR,wBgC8DA,0BACE,mBAGE,wExCvDJ,6DAZA,0BwCwEI,wExC5DJ,2BAA0B,CAZ1B,0DAYA,CwCiEI,kDACE,aAGF,4DAEE,mBAAkB,CADlB,kDACA,CAEA,mEAEE,oDADA,sDACA,EhCtFR,wBgC8DA,0BACE,mBAGE,wExCvDJ,6DAZA,0BwCwEI,wExC5DJ,2BAA0B,CAZ1B,0DAYA,CwCiEI,kDACE,aAGF,4DAEE,mBAAkB,CADlB,kDACA,CAEA,mEAEE,oDADA,sDACA,EhCtFR,yBgC8DA,0BACE,mBAGE,wExCvDJ,6DAZA,0BwCwEI,wExC5DJ,2BAA0B,CAZ1B,0DAYA,CwCiEI,kDACE,aAGF,4DAEE,mBAAkB,CADlB,kDACA,CAEA,mEAEE,oDADA,sDACA,EAcZ,kBxChJI,gBwCmJF,mCACE,mDAEA,8CACE,sBAaJ,yBACE,sDACA,+CACA,6DACA,4DACA,gEACA,6DACA,iEACA,yDACA,0DACA,oEAVF,2BACE,wDACA,iDACA,+DACA,4DACA,kEACA,6DACA,mEACA,2DACA,4DACA,sEAVF,yBACE,sDACA,+CACA,6DACA,4DACA,gEACA,6DACA,iEACA,yDACA,0DACA,oEAVF,sBACE,mDACA,4CACA,0DACA,4DACA,6DACA,6DACA,8DACA,sDACA,uDACA,iEAVF,yBACE,sDACA,+CACA,6DACA,4DACA,gEACA,6DACA,iEACA,yDACA,0DACA,oEAVF,wBACE,qDACA,8CACA,4DACA,4DACA,+DACA,6DACA,gEACA,wDACA,yDACA,mEAVF,uBACE,oDACA,6CACA,2DACA,4DACA,8DACA,6DACA,+DACA,uDACA,wDACA,kEAVF,sBACE,mDACA,4CACA,0DACA,4DACA,6DACA,6DACA,8DACA,sDACA,uDACA,iEC5LJ,WAEE,0BACA,oVACA,2BACA,kCACA,+DACA,+BACA,qCACA,uEAQA,wEACA,SzCJE,sByCFF,uBAEA,U1CkpD2B,C0C5oD3B,oCALA,cAFA,SAOA,CAGA,4BAPA,+BAUE,CAHF,iBAGE,0CADA,oBACA,CAGF,iBAEE,4CACA,0CAFA,SAEA,CAGF,wCAIE,6CAFA,oBACA,gBACA,CAcA,iDATF,wCCjDF,OAEE,uBACA,6BACA,4BACA,0BACA,2B9CyRI,6BALI,C8ClRR,mBACA,+CACA,+CACA,2DACA,iDACA,2CACA,kDACA,sDACA,kEASA,4BADA,oCAEA,uE1CPE,4C0CQF,sCALA,4B9CyQI,mCALI,C8CtQR,eAGA,oBAJA,+B1CAE,C0CWF,eACE,UAGF,kBACE,aAIJ,iBACE,uBAKA,eACA,oBAJA,kBAEA,kBADA,8BAGA,CAEA,mCACE,sCAIJ,cAEE,mBAIA,4BADA,2CAEA,qF1ChCE,0FACA,2F0C4BF,mCAHA,aAEA,2D1C3BE,C0CkCF,yBAEE,sCADA,gDACA,CAIJ,YAEE,qBADA,iCACA,CC9DF,OAEE,uBACA,uBACA,wBACA,yBACA,mBACA,gCACA,2DACA,+CACA,oDACA,8CACA,yFACA,iCACA,iCACA,oCACA,sDACA,sDACA,iCACA,6BACA,uBACA,sDACA,sDAOA,aAEA,YAJA,OASA,SAAQ,CAJR,kBACA,gBARA,eACA,MAIA,WAFA,8BAQA,CAOF,cAGE,8BAEA,oBAJA,kBACA,UAGA,CAGA,0BAEE,4B3B9CE,iCjB8+C8B,CiB1+C9B,sC2BwCJ,0B3BvCM,iB2B2CN,0BACE,c5C87CgC,C4C17ClC,kCACE,qB5C27CgC,C4Cv7CpC,yBACE,6CAEA,wCACE,gBACA,gBAGF,qCACE,gBAIJ,uBAEE,mBADA,aAEA,iDAIF,eASE,4BADA,oCAEA,uE3CrFE,4C2CiFF,4BAJA,aACA,sBAWA,SAAQ,CAPR,oBANA,kBAGA,UAUA,CAIF,gBAEE,0BACA,sBACA,0BC5GA,uCADA,aAHA,OAFA,eACA,MAGA,YADA,iCDkH4D,CC5G5D,+BACA,uDD2G0F,CAK5F,cAGE,mBAGA,4F3CtGE,2DACA,4D2CgGF,aACA,cAEA,8BACA,sC3CpGE,C2CwGF,yBAEE,6IADA,2FACA,CAKJ,aAEE,8CADA,eACA,CAKF,YAIE,cACA,gCAJA,iBAIA,CAIF,cAIE,mBAGA,2C3CxHE,8DADA,+D2C0HF,yFAPA,aACA,cACA,eAEA,yBACA,qE3CvHE,C2C+HF,gBACE,2CnC5GA,wBmCkHF,OACE,0BACA,2CAIF,cAGE,iBADA,kBADA,+BAEA,CAGF,UACE,wBnC/HA,wBmCoIF,oBAEE,wBnCtIA,yBmC2IF,UACE,yBAUA,kBAGE,YACA,QAAO,CAFP,eADA,WAGA,CAEA,iCAEE,S3C1MJ,eAAc,C2CyMV,W3CzMJ,C2C8ME,gE3C9MF,gB2CmNE,8BACE,gBnC3JJ,2BmCyIA,0BAGE,YACA,QAAO,CAFP,eADA,WAGA,CAEA,yCAEE,S3C1MJ,eAAc,C2CyMV,W3CzMJ,C2C8ME,gF3C9MF,gB2CmNE,sCACE,iBnC3JJ,2BmCyIA,0BAGE,YACA,QAAO,CAFP,eADA,WAGA,CAEA,yCAEE,S3C1MJ,eAAc,C2CyMV,W3CzMJ,C2C8ME,gF3C9MF,gB2CmNE,sCACE,iBnC3JJ,2BmCyIA,0BAGE,YACA,QAAO,CAFP,eADA,WAGA,CAEA,yCAEE,S3C1MJ,eAAc,C2CyMV,W3CzMJ,C2C8ME,gF3C9MF,gB2CmNE,sCACE,iBnC3JJ,4BmCyIA,0BAGE,YACA,QAAO,CAFP,eADA,WAGA,CAEA,yCAEE,S3C1MJ,eAAc,C2CyMV,W3CzMJ,C2C8ME,gF3C9MF,gB2CmNE,sCACE,iBEtOR,SAEE,yBACA,6BACA,8BACA,+BACA,sBjDwRI,+BALI,CiDjRR,qCACA,yCACA,mDACA,yBACA,gCACA,iCAYA,qBARA,cCjBA,qC/C+lB4B,CHjUxB,qCALI,CkDvRR,kBACA,e/CwmB4B,C+CjmB5B,sBAIA,gBAVA,e/C+mB4B,C8CjmB5B,gCAQA,SAAQ,CCrBR,gBACA,iBACA,qBACA,iBACA,oBAGA,mBADA,kBAEA,oBDGA,gCAUA,CAEA,gDAEA,wBACE,cAEA,sCADA,mCACA,CAEA,+BAGE,yBACA,mBAFA,WADA,iBAGA,CAKN,2FACE,+CAEA,yGAGE,sCADA,qFADA,QAEA,CAKJ,6FAGE,qCAFA,6CACA,oCACA,CAEA,2GAGE,wCADA,4HADA,UAEA,CAMJ,iGACE,4CAEA,+GAGE,yCADA,qFADA,WAEA,CAKJ,8FAGE,qCAFA,8CACA,oCACA,CAEA,4GAGE,uCADA,4HADA,SAEA,CAsBJ,eAKE,sC7CjGE,8C6C+FF,8BAFA,sCACA,gEAEA,iB7ChGE,C+CnBJ,SAEE,yBACA,6BnD4RI,+BALI,CmDrRR,kCACA,iDACA,6DACA,sDACA,2FACA,6CACA,mCACA,qCnDmRI,kCALI,CmD5QR,kCACA,8CACA,iCACA,iCACA,6CACA,8BACA,iCACA,yDAWA,qBAEA,4BADA,sCAEA,2E/ChBE,8C+CMF,cDxBA,qC/C+lB4B,CHjUxB,qCALI,CkDvRR,kBACA,e/CwmB4B,C+CjmB5B,sBAIA,gBAVA,e/C+mB4B,CgD1lB5B,sCDpBA,gBACA,iBACA,qBACA,iBACA,oBAGA,mBADA,kBAEA,oBCUA,gC/CLE,C+CoBF,wBACE,cAEA,sCADA,mCACA,CAEA,6DAOE,0BAAa,CAHb,WADA,cADA,iBAKA,CAMJ,2FACE,kFAEA,gNAEE,qFAGF,yGAEE,gDADA,QACA,CAGF,uGAEE,sCADA,qCACA,CAOJ,6FAGE,qCAFA,gFACA,oCACA,CAEA,oNAEE,4HAGF,2GAEE,kDADA,MACA,CAGF,yGAEE,wCADA,mCACA,CAQJ,iGACE,+EAEA,4NAEE,qFAGF,+GAEE,mDADA,KACA,CAGF,6GAEE,yCADA,kCACA,CAKJ,iHAQE,+EADA,WAHA,cADA,SAGA,oDALA,kBACA,MAGA,mCAGA,CAMF,8FAGE,qCAFA,iFACA,oCACA,CAEA,sNAEE,4HAGF,4GAEE,iDADA,OACA,CAGF,0GAEE,uCADA,oCACA,CAuBN,gBAKE,6CACA,kF/C5JE,6DACA,8D+CyJF,qCnDyGI,4CALI,CmDtGR,gBADA,6E/CtJE,C+C8JF,sBACE,aAIJ,cAEE,mCADA,yEACA,CCrLF,UACE,kBAGF,wBACE,mBAGF,gBAGE,gBAFA,kBACA,UACA,CCtBA,sBAEE,WACA,WAFA,aAEA,CDuBJ,eAME,2BAJA,aACA,WAEA,mBAJA,kBhCbI,qCgCgBJ,UAGA,ChCfI,sCgCQN,ehCPQ,iBgCiBR,8DAGE,cAGF,wEAEE,2BAGF,wEAEE,4BASA,8BACE,UAEA,eADA,2BACA,CAGF,iJAIE,SAAQ,CADR,SACA,CAGF,oFAGE,UhC5DE,0BgC2DF,SAEA,ChCzDE,sCgCqDJ,oFhCpDM,iBgCiER,8CAQE,mBAMA,gBACA,SAXA,SAQA,UjD1FS,CiDqFT,aAEA,uBAOA,UjD2gDmC,CiDhhDnC,UATA,kBAWA,kBAVA,MhCzEI,6BgCgFJ,SjDghDmC,CiDrhDnC,SAYA,ChCnFI,sCgCkEN,8ChCjEQ,iBgCqFN,oHAEE,UjDpGO,CiDuGP,WADA,UADA,oBjDqgDiC,CiDhgDrC,uBACE,OAGF,uBACE,QAKF,wDAME,wBADA,4BAEA,0BALA,qBAEA,WjDmgDmC,CiDpgDnC,UAIA,CAWF,4BACE,uRAEF,4BACE,wRAQF,qBAGE,SAGA,aACA,uBAHA,OAOA,mBACA,gBAFA,gBjD48CmC,CiD98CnC,UAPA,kBACA,QAGA,SjDi9CmC,CiDx8CnC,sCAWE,4BADA,qBjD1KO,CiD4KP,SAGA,qCADA,kCAbA,uBAQA,eAPA,cAEA,UjD08CiC,CiDv8CjC,ejDy8CiC,CiD18CjC,gBjD08CiC,CiDh8CjC,UjDi8CiC,CiD58CjC,UAGA,mBhChKE,4BgC2JF,UAcA,ChCrKE,sCgCoJJ,sChCnJM,iBgCuKN,6BACE,SjD87CiC,CiDr7CrC,kBAGE,cjDw7CmC,CiDp7CnC,UjDrMS,CiDkMT,SAEA,sBjDo7CmC,CiDr7CnC,mBjDq7CmC,CiDz7CnC,kBACA,UAMA,kBAMA,sFAEE,+BjDy7CiC,CiDt7CnC,qDACE,qBjDxMO,CiD2MT,iCACE,UjD5MO,CiDkMT,0OAEE,+BjDy7CiC,CiDt7CnC,yIACE,qBjDxMO,CiD2MT,iGACE,UjD5MO,CmDdX,8BAQE,6FADA,kBALA,qBAEA,gCACA,gDAFA,6BAKA,CAIF,0BACE,4BAIF,gBAEE,wBACA,yBACA,qCACA,iCACA,mCACA,2CAGA,gCACA,0GAGF,mBAEE,wBACA,yBACA,gCASF,wBACE,GACE,mBAEF,IACE,UACA,gBAKJ,cAEE,wBACA,yBACA,qCACA,mCACA,yCAGA,8BACA,UAGF,iBACE,wBACA,yBAIA,sCACE,8BAEE,mCC/EN,mEAEE,2BACA,2BACA,2BACA,8BACA,8BACA,0CACA,oCACA,mDACA,+DACA,kDACA,qDACA,qC3C6DE,2B2C5CF,cAWI,4BADA,wCAPA,SAKA,gCAHA,aACA,sBACA,eAKA,UAVA,enClBA,0CmCyBA,kBALA,kCAUA,EnC1BA,8DmCYJ,cnCXM,iBRuDJ,2B2C5BE,8BAIE,qFAFA,OADA,MAIA,4BAFA,+BAEA,CAGF,4BAIE,oFAFA,QADA,MAIA,2BAFA,+BAEA,CAGF,4BAME,sFALA,MAMA,4BAGF,2DANE,kCADA,OAEA,gBAHA,OAcA,CANF,+BAKE,mFACA,2BAGF,sDAEE,eAGF,8DAGE,oB3C5BJ,wB2C/BF,cAiEM,2BACA,8BACA,uCAEA,gCACE,aAGF,8BAME,uCALA,aACA,YAEA,mBADA,SAGA,E3CnCN,2B2C5CF,cAWI,4BADA,wCAPA,SAKA,gCAHA,aACA,sBACA,eAKA,UAVA,enClBA,0CmCyBA,kBALA,kCAUA,EnC1BA,8DmCYJ,cnCXM,iBRuDJ,2B2C5BE,8BAIE,qFAFA,OADA,MAIA,4BAFA,+BAEA,CAGF,4BAIE,oFAFA,QADA,MAIA,2BAFA,+BAEA,CAGF,4BAME,sFALA,MAMA,4BAGF,2DANE,kCADA,OAEA,gBAHA,OAcA,CANF,+BAKE,mFACA,2BAGF,sDAEE,eAGF,8DAGE,oB3C5BJ,wB2C/BF,cAiEM,2BACA,8BACA,uCAEA,gCACE,aAGF,8BAME,uCALA,aACA,YAEA,mBADA,SAGA,E3CnCN,2B2C5CF,cAWI,4BADA,wCAPA,SAKA,gCAHA,aACA,sBACA,eAKA,UAVA,enClBA,0CmCyBA,kBALA,kCAUA,EnC1BA,8DmCYJ,cnCXM,iBRuDJ,2B2C5BE,8BAIE,qFAFA,OADA,MAIA,4BAFA,+BAEA,CAGF,4BAIE,oFAFA,QADA,MAIA,2BAFA,+BAEA,CAGF,4BAME,sFALA,MAMA,4BAGF,2DANE,kCADA,OAEA,gBAHA,OAcA,CANF,+BAKE,mFACA,2BAGF,sDAEE,eAGF,8DAGE,oB3C5BJ,wB2C/BF,cAiEM,2BACA,8BACA,uCAEA,gCACE,aAGF,8BAME,uCALA,aACA,YAEA,mBADA,SAGA,E3CnCN,4B2C5CF,cAWI,4BADA,wCAPA,SAKA,gCAHA,aACA,sBACA,eAKA,UAVA,enClBA,0CmCyBA,kBALA,kCAUA,EnC1BA,+DmCYJ,cnCXM,iBRuDJ,4B2C5BE,8BAIE,qFAFA,OADA,MAIA,4BAFA,+BAEA,CAGF,4BAIE,oFAFA,QADA,MAIA,2BAFA,+BAEA,CAGF,4BAME,sFALA,MAMA,4BAGF,2DANE,kCADA,OAEA,gBAHA,OAcA,CANF,+BAKE,mFACA,2BAGF,sDAEE,eAGF,8DAGE,oB3C5BJ,yB2C/BF,cAiEM,2BACA,8BACA,uCAEA,gCACE,aAGF,8BAME,uCALA,aACA,YAEA,mBADA,SAGA,EA/ER,WAWI,4BADA,wCAPA,SAKA,gCAHA,aACA,sBACA,eAKA,UAVA,enClBA,0CmCyBA,kBALA,kCAUA,CnC1BA,sCmCYJ,WnCXM,iBmC2BF,2BAIE,qFAFA,OADA,MAIA,4BAFA,+BAEA,CAGF,yBAIE,oFAFA,QADA,MAIA,2BAFA,+BAEA,CAGF,yBAME,sFALA,MAMA,4BAGF,qDANE,kCADA,OAEA,gBAHA,OAcA,CANF,4BAKE,mFACA,2BAGF,gDAEE,eAGF,qDAGE,mBA2BR,oBP9GE,sBADA,aAHA,OAFA,eACA,MAGA,YADA,Y7CaS,C6CPT,mCACA,mC7Ci+CkC,CoDn3CpC,kBAEE,mBADA,aAEA,8BACA,oEAEA,6BAIE,sDADA,qDADA,mDADA,qFAGA,CAIJ,iBAEE,kDADA,eACA,CAGF,gBACE,YAEA,gBADA,mEACA,CChJF,aAKE,8BADA,YAHA,qBACA,eAIA,WAHA,qBrDmzCkC,CqD9yClC,wBAEE,WADA,oBACA,CAKJ,gBACE,gBAGF,gBACE,gBAGF,gBACE,iBAKA,+BACE,mDAIJ,4BACE,IACE,UrDmxCgC,EqD/wCpC,kBAGE,8CAFA,wEACA,mBACA,CAGF,4BACE,GACE,uBH9CF,gBAEE,WACA,WAFA,aAEA,CIHF,iBAEE,8EADA,oBACA,CAFF,mBAEE,gFADA,oBACA,CAFF,iBAEE,8EADA,oBACA,CAFF,cAEE,2EADA,oBACA,CAFF,iBAEE,8EADA,oBACA,CAFF,gBAEE,6EADA,oBACA,CAFF,eAEE,4EADA,oBACA,CAFF,cAEE,2EADA,oBACA,CCFF,cACE,qEACA,+FAGE,wCAGE,yDACA,mFATN,gBACE,uEACA,iGAGE,4CAGE,yDACA,mFATN,cACE,qEACA,+FAGE,wCAGE,yDACA,mFATN,WACE,kEACA,4FAGE,kCAGE,0DACA,oFATN,cACE,qEACA,+FAGE,wCAGE,0DACA,oFATN,aACE,oEACA,8FAGE,sCAGE,yDACA,mFATN,YACE,mEACA,6FAGE,oCAGE,2DACA,qFATN,WACE,kEACA,4FAGE,kCAGE,wDACA,kFAOR,oBACE,4EACA,sGAGE,oDAEE,8EACA,wGC1BN,kBAGE,+IAFA,SAEA,CCHF,WAGE,mBAGA,2BALA,oBACA,WzD6c4B,CyD3c5B,+EACA,2BACA,CAEA,eAIE,kBAHA,cAEA,UzDsc0B,CiBjcxB,qCwCNF,SAGA,CxCOE,sCwCZJ,exCaM,iBwCDJ,8DACE,+DCnBN,OACE,kBACA,WAEA,cAGE,WAFA,cACA,kCACA,CAGF,SAKE,YAFA,OAFA,kBACA,MAEA,UACA,CAKF,WACE,uBADF,WACE,sBADF,YACE,yBADF,YACE,iCCrBJ,WAEE,K3D0mCkC,C2DpmCpC,yBAJE,OAHA,eAEA,QAEA,Y3DumCkC,C2DpmCpC,cAGE,Q3DimCkC,C2DvlChC,YAEE,K3DolC8B,C2DhlChC,2BALE,gBAEA,Y3DmlC8B,C2DhlChC,eAEE,Q3D8kC8B,CS9iChC,wBkDxCA,eACE,gBACA,MACA,Y3DmlC8B,C2DhlChC,kBAEE,SADA,gBAEA,Y3D6kC8B,ES9iChC,wBkDxCA,eACE,gBACA,MACA,Y3DmlC8B,C2DhlChC,kBAEE,SADA,gBAEA,Y3D6kC8B,ES9iChC,wBkDxCA,eACE,gBACA,MACA,Y3DmlC8B,C2DhlChC,kBAEE,SADA,gBAEA,Y3D6kC8B,ES9iChC,yBkDxCA,eACE,gBACA,MACA,Y3DmlC8B,C2DhlChC,kBAEE,SADA,gBAEA,Y3D6kC8B,E4D5mCpC,QAGE,mBADA,kBAEA,CAGF,gBAHE,mBAHA,YAUA,CAJF,QAEE,cACA,qBACA,CCRF,2ECSE,6BAEA,mBANA,qBAEA,sBACA,0BAFA,oBAIA,6BANA,mBAOA,CAGA,qGACE,4BCdF,sBAIE,SAGA,WAFA,OAJA,kBAEA,QADA,MAIA,SACA,CCRJ,+BCCE,uBACA,mBCNF,IAEE,mBAGA,8BAJA,qBAGA,eAEA,YAHA,4BlE8rB4B,CmE/nBtB,gBAOI,kCAPJ,WAOI,6BAPJ,cAOI,gCAPJ,cAOI,gCAPJ,mBAOI,qCAPJ,gBAOI,kCAPJ,aAOI,qBAPJ,WAOI,sBAPJ,YAOI,qBAPJ,oBAOI,6BAPJ,kBAOI,2BAPJ,iBAOI,0BAPJ,kBAOI,gCAPJ,iBAOI,0BAPJ,WAOI,oBAPJ,YAOI,sBAPJ,YAOI,qBAPJ,YAOI,sBAPJ,aAOI,oBAPJ,eAOI,wBAPJ,iBAOI,0BAPJ,kBAOI,2BAPJ,iBAOI,0BAPJ,iBAOI,0BAPJ,mBAOI,4BAPJ,oBAOI,6BAPJ,mBAOI,4BAPJ,iBAOI,0BAPJ,mBAOI,4BAPJ,oBAOI,6BAPJ,mBAOI,4BAPJ,UAOI,yBAPJ,gBAOI,+BAPJ,SAOI,wBAPJ,QAOI,uBAPJ,eAOI,8BAPJ,SAOI,wBAPJ,aAOI,4BAPJ,cAOI,6BAPJ,QAOI,uBAPJ,eAOI,8BAPJ,QAOI,uBAPJ,QAOI,0CAPJ,WAOI,6CAPJ,WAOI,6CAPJ,aAOI,0BAjBJ,oBACE,+EADF,sBACE,iFADF,oBACE,+EADF,iBACE,4EADF,oBACE,+EADF,mBACE,8EADF,kBACE,6EADF,iBACE,4EASF,iBAOI,0BAPJ,mBAOI,4BAPJ,mBAOI,4BAPJ,gBAOI,yBAPJ,iBAOI,0BAPJ,OAOI,gBAPJ,QAOI,kBAPJ,SAOI,mBAPJ,UAOI,mBAPJ,WAOI,qBAPJ,YAOI,sBAPJ,SAOI,iBAPJ,UAOI,mBAPJ,WAOI,oBAPJ,OAOI,kBAPJ,QAOI,oBAPJ,SAOI,qBAPJ,kBAOI,yCAPJ,oBAOI,qCAPJ,oBAOI,qCAPJ,QAOI,sFAPJ,UAOI,mBAPJ,YAOI,0FAPJ,cAOI,uBAPJ,YAOI,4FAPJ,cAOI,yBAPJ,eAOI,6FAPJ,iBAOI,0BAPJ,cAOI,2FAPJ,gBAOI,wBAPJ,gBAIQ,sBAGJ,4EAPJ,kBAIQ,sBAGJ,8EAPJ,gBAIQ,sBAGJ,4EAPJ,aAIQ,sBAGJ,yEAPJ,gBAIQ,sBAGJ,4EAPJ,eAIQ,sBAGJ,2EAPJ,cAIQ,sBAGJ,0EAPJ,aAIQ,sBAGJ,yEAPJ,cAIQ,sBAGJ,0EAPJ,cAIQ,sBAGJ,0EAPJ,uBAOI,uDAPJ,yBAOI,yDAPJ,uBAOI,uDAPJ,oBAOI,oDAPJ,uBAOI,uDAPJ,sBAOI,sDAPJ,qBAOI,qDAPJ,oBAOI,oDAPJ,UAOI,2BAPJ,UAOI,2BAPJ,UAOI,2BAPJ,UAOI,2BAPJ,UAOI,2BAjBJ,mBACE,wBADF,mBACE,yBADF,mBACE,wBADF,mBACE,yBADF,oBACE,sBASF,MAOI,oBAPJ,MAOI,oBAPJ,MAOI,oBAPJ,OAOI,qBAPJ,QAOI,qBAPJ,QAOI,yBAPJ,QAOI,sBAPJ,YAOI,0BAPJ,MAOI,qBAPJ,MAOI,qBAPJ,MAOI,qBAPJ,OAOI,sBAPJ,QAOI,sBAPJ,QAOI,0BAPJ,QAOI,uBAPJ,YAOI,2BAPJ,WAOI,wBAPJ,UAOI,6BAPJ,aAOI,gCAPJ,kBAOI,qCAPJ,qBAOI,wCAPJ,aAOI,sBAPJ,aAOI,sBAPJ,eAOI,wBAPJ,eAOI,wBAPJ,WAOI,yBAPJ,aAOI,2BAPJ,mBAOI,iCAPJ,uBAOI,qCAPJ,qBAOI,mCAPJ,wBAOI,iCAPJ,yBAOI,wCAPJ,wBAOI,uCAPJ,wBAOI,uCAPJ,mBAOI,iCAPJ,iBAOI,+BAPJ,oBAOI,6BAPJ,sBAOI,+BAPJ,qBAOI,8BAPJ,qBAOI,mCAPJ,mBAOI,iCAPJ,sBAOI,+BAPJ,uBAOI,sCAPJ,sBAOI,qCAPJ,uBAOI,gCAPJ,iBAOI,0BAPJ,kBAOI,gCAPJ,gBAOI,8BAPJ,mBAOI,4BAPJ,qBAOI,8BAPJ,oBAOI,6BAPJ,aAOI,mBAPJ,SAOI,kBAPJ,SAOI,kBAPJ,SAOI,kBAPJ,SAOI,kBAPJ,SAOI,kBAPJ,SAOI,kBAPJ,YAOI,kBAPJ,KAOI,mBAPJ,KAOI,wBAPJ,KAOI,uBAPJ,KAOI,sBAPJ,KAOI,wBAPJ,KAOI,sBAPJ,QAOI,sBAPJ,MAOI,iDAPJ,MAOI,2DAPJ,MAOI,yDAPJ,MAOI,uDAPJ,MAOI,2DAPJ,MAOI,uDAPJ,SAOI,uDAPJ,MAOI,iDAPJ,MAOI,2DAPJ,MAOI,yDAPJ,MAOI,uDAPJ,MAOI,2DAPJ,MAOI,uDAPJ,SAOI,uDAPJ,MAOI,uBAPJ,MAOI,4BAPJ,MAOI,2BAPJ,MAOI,0BAPJ,MAOI,4BAPJ,MAOI,0BAPJ,SAOI,0BAPJ,MAOI,yBAPJ,MAOI,8BAPJ,MAOI,6BAPJ,MAOI,4BAPJ,MAOI,8BAPJ,MAOI,4BAPJ,SAOI,4BAPJ,MAOI,0BAPJ,MAOI,+BAPJ,MAOI,8BAPJ,MAOI,6BAPJ,MAOI,+BAPJ,MAOI,6BAPJ,SAOI,6BAPJ,MAOI,wBAPJ,MAOI,6BAPJ,MAOI,4BAPJ,MAOI,2BAPJ,MAOI,6BAPJ,MAOI,2BAPJ,SAOI,2BAPJ,KAOI,oBAPJ,KAOI,yBAPJ,KAOI,wBAPJ,KAOI,uBAPJ,KAOI,yBAPJ,KAOI,uBAPJ,MAOI,mDAPJ,MAOI,6DAPJ,MAOI,2DAPJ,MAOI,yDAPJ,MAOI,6DAPJ,MAOI,yDAPJ,MAOI,mDAPJ,MAOI,6DAPJ,MAOI,2DAPJ,MAOI,yDAPJ,MAOI,6DAPJ,MAOI,yDAPJ,MAOI,wBAPJ,MAOI,6BAPJ,MAOI,4BAPJ,MAOI,2BAPJ,MAOI,6BAPJ,MAOI,2BAPJ,MAOI,0BAPJ,MAOI,+BAPJ,MAOI,8BAPJ,MAOI,6BAPJ,MAOI,+BAPJ,MAOI,6BAPJ,MAOI,2BAPJ,MAOI,gCAPJ,MAOI,+BAPJ,MAOI,8BAPJ,MAOI,gCAPJ,MAOI,8BAPJ,MAOI,yBAPJ,MAOI,8BAPJ,MAOI,6BAPJ,MAOI,4BAPJ,MAOI,8BAPJ,MAOI,4BAPJ,OAOI,gBAPJ,OAOI,qBAPJ,OAOI,oBAPJ,OAOI,mBAPJ,OAOI,qBAPJ,OAOI,mBAPJ,WAOI,oBAPJ,WAOI,yBAPJ,WAOI,wBAPJ,WAOI,uBAPJ,WAOI,yBAPJ,WAOI,uBAPJ,cAOI,uBAPJ,cAOI,4BAPJ,cAOI,2BAPJ,cAOI,0BAPJ,cAOI,4BAPJ,cAOI,0BAPJ,gBAOI,+CAPJ,MAOI,2CAPJ,MAOI,0CAPJ,MAOI,wCAPJ,MAOI,0CAPJ,MAOI,4BAPJ,MAOI,yBAPJ,YAOI,4BAPJ,YAOI,4BAPJ,YAOI,8BAPJ,UAOI,0BAPJ,WAOI,0BAPJ,WAOI,0BAPJ,aAOI,0BAPJ,SAOI,0BAPJ,WAOI,6BAPJ,MAOI,wBAPJ,OAOI,2BAPJ,SAOI,0BAPJ,OAOI,wBAPJ,YAOI,0BAPJ,UAOI,2BAPJ,aAOI,4BAPJ,sBAOI,+BAPJ,2BAOI,oCAPJ,8BAOI,uCAPJ,gBAOI,mCAPJ,gBAOI,mCAPJ,iBAOI,oCAPJ,WAOI,6BAPJ,aAOI,6BAPJ,YAOI,+DAPJ,cAIQ,oBAGJ,mEAPJ,gBAIQ,oBAGJ,qEAPJ,cAIQ,oBAGJ,mEAPJ,WAIQ,oBAGJ,gEAPJ,cAIQ,oBAGJ,mEAPJ,aAIQ,oBAGJ,kEAPJ,YAIQ,oBAGJ,iEAPJ,WAIQ,oBAGJ,gEAPJ,YAIQ,oBAGJ,iEAPJ,YAIQ,oBAGJ,iEAPJ,WAIQ,oBAGJ,sEAPJ,YAIQ,oBAGJ,0CAPJ,eAIQ,oBAGJ,+BAPJ,eAIQ,oBAGJ,mCAPJ,qBAIQ,oBAGJ,0CAPJ,oBAIQ,oBAGJ,yCAPJ,oBAIQ,oBAGJ,yCAPJ,YAIQ,oBAGJ,wBAjBJ,iBACE,uBADF,iBACE,sBADF,iBACE,uBADF,kBACE,oBASF,uBAOI,gDAPJ,yBAOI,kDAPJ,uBAOI,gDAPJ,oBAOI,6CAPJ,uBAOI,gDAPJ,sBAOI,+CAPJ,qBAOI,8CAPJ,oBAOI,6CAZF,8CACE,sBADF,8CACE,uBADF,8CACE,sBADF,8CACE,uBADF,gDACE,oBAgBF,0CAOI,uCAPJ,0CAOI,sCAPJ,0CAOI,uCAnBN,wBAIQ,8BAGJ,6FAPJ,0BAIQ,8BAGJ,+FAPJ,wBAIQ,8BAGJ,6FAPJ,qBAIQ,8BAGJ,0FAPJ,wBAIQ,8BAGJ,6FAPJ,uBAIQ,8BAGJ,4FAPJ,sBAIQ,8BAGJ,2FAPJ,qBAIQ,8BAGJ,0FAPJ,gBAIQ,8BAGJ,kGAZF,gEACE,8BADF,kEACE,gCADF,kEACE,iCADF,kEACE,gCADF,kEACE,iCADF,oEACE,8BAIJ,YAIQ,kBAGJ,4EAPJ,cAIQ,kBAGJ,8EAPJ,YAIQ,kBAGJ,4EAPJ,SAIQ,kBAGJ,yEAPJ,YAIQ,kBAGJ,4EAPJ,WAIQ,kBAGJ,2EAPJ,UAIQ,kBAGJ,0EAPJ,SAIQ,kBAGJ,yEAPJ,UAIQ,kBAGJ,0EAPJ,UAIQ,kBAGJ,0EAPJ,SAIQ,kBAGJ,4EAPJ,gBAIQ,kBAGJ,uCAPJ,mBAIQ,kBAGJ,iFAPJ,kBAIQ,kBAGJ,gFAjBJ,eACE,oBADF,eACE,qBADF,eACE,oBADF,eACE,qBADF,gBACE,kBASF,mBAOI,uDAPJ,qBAOI,yDAPJ,mBAOI,uDAPJ,gBAOI,oDAPJ,mBAOI,uDAPJ,kBAOI,sDAPJ,iBAOI,qDAPJ,gBAOI,oDAPJ,aAOI,8CAPJ,iBAOI,0BAPJ,kBAOI,2BAPJ,kBAOI,2BAPJ,SAOI,8BAPJ,SAOI,8BAPJ,SAOI,gDAPJ,WAOI,0BAPJ,WAOI,mDAPJ,WAOI,gDAPJ,WAOI,mDAPJ,WAOI,mDAPJ,WAOI,oDAPJ,gBAOI,4BAPJ,cAOI,qDAPJ,aAOI,mHAPJ,eAOI,uEAPJ,eAOI,yHAPJ,eAOI,mHAPJ,eAOI,yHAPJ,eAOI,yHAPJ,eAOI,2HAPJ,oBAOI,2EAPJ,kBAOI,6HAPJ,aAOI,uHAPJ,eAOI,2EAPJ,eAOI,6HAPJ,eAOI,uHAPJ,eAOI,6HAPJ,eAOI,6HAPJ,eAOI,+HAPJ,oBAOI,+EAPJ,kBAOI,iIAPJ,gBAOI,yHAPJ,kBAOI,6EAPJ,kBAOI,+HAPJ,kBAOI,yHAPJ,kBAOI,+HAPJ,kBAOI,+HAPJ,kBAOI,iIAPJ,uBAOI,iFAPJ,qBAOI,mIAPJ,eAOI,qHAPJ,iBAOI,yEAPJ,iBAOI,2HAPJ,iBAOI,qHAPJ,iBAOI,2HAPJ,iBAOI,2HAPJ,iBAOI,6HAPJ,sBAOI,6EAPJ,oBAOI,+HAPJ,SAOI,6BAPJ,WAOI,4BAPJ,MAOI,qBAPJ,KAOI,oBAPJ,KAOI,oBAPJ,KAOI,oBAPJ,KAOI,oB1DVR,wB0DGI,gBAOI,qBAPJ,cAOI,sBAPJ,eAOI,qBAPJ,uBAOI,6BAPJ,qBAOI,2BAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,oBAOI,0BAPJ,aAOI,yBAPJ,mBAOI,+BAPJ,YAOI,wBAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,YAOI,wBAPJ,gBAOI,4BAPJ,iBAOI,6BAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,WAOI,uBAPJ,cAOI,wBAPJ,aAOI,6BAPJ,gBAOI,gCAPJ,qBAOI,qCAPJ,wBAOI,wCAPJ,gBAOI,sBAPJ,gBAOI,sBAPJ,kBAOI,wBAPJ,kBAOI,wBAPJ,cAOI,yBAPJ,gBAOI,2BAPJ,sBAOI,iCAPJ,0BAOI,qCAPJ,wBAOI,mCAPJ,2BAOI,iCAPJ,4BAOI,wCAPJ,2BAOI,uCAPJ,2BAOI,uCAPJ,sBAOI,iCAPJ,oBAOI,+BAPJ,uBAOI,6BAPJ,yBAOI,+BAPJ,wBAOI,8BAPJ,wBAOI,mCAPJ,sBAOI,iCAPJ,yBAOI,+BAPJ,0BAOI,sCAPJ,yBAOI,qCAPJ,0BAOI,gCAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,mBAOI,8BAPJ,sBAOI,4BAPJ,wBAOI,8BAPJ,uBAOI,6BAPJ,gBAOI,mBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,eAOI,kBAPJ,QAOI,mBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,sBAPJ,QAOI,wBAPJ,QAOI,sBAPJ,WAOI,sBAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,uBAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,4BAPJ,SAOI,0BAPJ,YAOI,0BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,YAOI,4BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,YAOI,6BAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,YAOI,2BAPJ,QAOI,oBAPJ,QAOI,yBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,yBAPJ,QAOI,uBAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,gCAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,gCAPJ,SAOI,8BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,UAOI,gBAPJ,UAOI,qBAPJ,UAOI,oBAPJ,UAOI,mBAPJ,UAOI,qBAPJ,UAOI,mBAPJ,cAOI,oBAPJ,cAOI,yBAPJ,cAOI,wBAPJ,cAOI,uBAPJ,cAOI,yBAPJ,cAOI,uBAPJ,iBAOI,uBAPJ,iBAOI,4BAPJ,iBAOI,2BAPJ,iBAOI,0BAPJ,iBAOI,4BAPJ,iBAOI,0BAPJ,eAOI,0BAPJ,aAOI,2BAPJ,gBAOI,6B1DVR,wB0DGI,gBAOI,qBAPJ,cAOI,sBAPJ,eAOI,qBAPJ,uBAOI,6BAPJ,qBAOI,2BAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,oBAOI,0BAPJ,aAOI,yBAPJ,mBAOI,+BAPJ,YAOI,wBAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,YAOI,wBAPJ,gBAOI,4BAPJ,iBAOI,6BAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,WAOI,uBAPJ,cAOI,wBAPJ,aAOI,6BAPJ,gBAOI,gCAPJ,qBAOI,qCAPJ,wBAOI,wCAPJ,gBAOI,sBAPJ,gBAOI,sBAPJ,kBAOI,wBAPJ,kBAOI,wBAPJ,cAOI,yBAPJ,gBAOI,2BAPJ,sBAOI,iCAPJ,0BAOI,qCAPJ,wBAOI,mCAPJ,2BAOI,iCAPJ,4BAOI,wCAPJ,2BAOI,uCAPJ,2BAOI,uCAPJ,sBAOI,iCAPJ,oBAOI,+BAPJ,uBAOI,6BAPJ,yBAOI,+BAPJ,wBAOI,8BAPJ,wBAOI,mCAPJ,sBAOI,iCAPJ,yBAOI,+BAPJ,0BAOI,sCAPJ,yBAOI,qCAPJ,0BAOI,gCAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,mBAOI,8BAPJ,sBAOI,4BAPJ,wBAOI,8BAPJ,uBAOI,6BAPJ,gBAOI,mBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,eAOI,kBAPJ,QAOI,mBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,sBAPJ,QAOI,wBAPJ,QAOI,sBAPJ,WAOI,sBAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,uBAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,4BAPJ,SAOI,0BAPJ,YAOI,0BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,YAOI,4BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,YAOI,6BAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,YAOI,2BAPJ,QAOI,oBAPJ,QAOI,yBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,yBAPJ,QAOI,uBAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,gCAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,gCAPJ,SAOI,8BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,UAOI,gBAPJ,UAOI,qBAPJ,UAOI,oBAPJ,UAOI,mBAPJ,UAOI,qBAPJ,UAOI,mBAPJ,cAOI,oBAPJ,cAOI,yBAPJ,cAOI,wBAPJ,cAOI,uBAPJ,cAOI,yBAPJ,cAOI,uBAPJ,iBAOI,uBAPJ,iBAOI,4BAPJ,iBAOI,2BAPJ,iBAOI,0BAPJ,iBAOI,4BAPJ,iBAOI,0BAPJ,eAOI,0BAPJ,aAOI,2BAPJ,gBAOI,6B1DVR,wB0DGI,gBAOI,qBAPJ,cAOI,sBAPJ,eAOI,qBAPJ,uBAOI,6BAPJ,qBAOI,2BAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,oBAOI,0BAPJ,aAOI,yBAPJ,mBAOI,+BAPJ,YAOI,wBAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,YAOI,wBAPJ,gBAOI,4BAPJ,iBAOI,6BAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,WAOI,uBAPJ,cAOI,wBAPJ,aAOI,6BAPJ,gBAOI,gCAPJ,qBAOI,qCAPJ,wBAOI,wCAPJ,gBAOI,sBAPJ,gBAOI,sBAPJ,kBAOI,wBAPJ,kBAOI,wBAPJ,cAOI,yBAPJ,gBAOI,2BAPJ,sBAOI,iCAPJ,0BAOI,qCAPJ,wBAOI,mCAPJ,2BAOI,iCAPJ,4BAOI,wCAPJ,2BAOI,uCAPJ,2BAOI,uCAPJ,sBAOI,iCAPJ,oBAOI,+BAPJ,uBAOI,6BAPJ,yBAOI,+BAPJ,wBAOI,8BAPJ,wBAOI,mCAPJ,sBAOI,iCAPJ,yBAOI,+BAPJ,0BAOI,sCAPJ,yBAOI,qCAPJ,0BAOI,gCAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,mBAOI,8BAPJ,sBAOI,4BAPJ,wBAOI,8BAPJ,uBAOI,6BAPJ,gBAOI,mBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,eAOI,kBAPJ,QAOI,mBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,sBAPJ,QAOI,wBAPJ,QAOI,sBAPJ,WAOI,sBAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,uBAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,4BAPJ,SAOI,0BAPJ,YAOI,0BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,YAOI,4BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,YAOI,6BAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,YAOI,2BAPJ,QAOI,oBAPJ,QAOI,yBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,yBAPJ,QAOI,uBAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,gCAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,gCAPJ,SAOI,8BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,UAOI,gBAPJ,UAOI,qBAPJ,UAOI,oBAPJ,UAOI,mBAPJ,UAOI,qBAPJ,UAOI,mBAPJ,cAOI,oBAPJ,cAOI,yBAPJ,cAOI,wBAPJ,cAOI,uBAPJ,cAOI,yBAPJ,cAOI,uBAPJ,iBAOI,uBAPJ,iBAOI,4BAPJ,iBAOI,2BAPJ,iBAOI,0BAPJ,iBAOI,4BAPJ,iBAOI,0BAPJ,eAOI,0BAPJ,aAOI,2BAPJ,gBAOI,6B1DVR,yB0DGI,gBAOI,qBAPJ,cAOI,sBAPJ,eAOI,qBAPJ,uBAOI,6BAPJ,qBAOI,2BAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,oBAOI,0BAPJ,aAOI,yBAPJ,mBAOI,+BAPJ,YAOI,wBAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,YAOI,wBAPJ,gBAOI,4BAPJ,iBAOI,6BAPJ,WAOI,uBAPJ,kBAOI,8BAPJ,WAOI,uBAPJ,cAOI,wBAPJ,aAOI,6BAPJ,gBAOI,gCAPJ,qBAOI,qCAPJ,wBAOI,wCAPJ,gBAOI,sBAPJ,gBAOI,sBAPJ,kBAOI,wBAPJ,kBAOI,wBAPJ,cAOI,yBAPJ,gBAOI,2BAPJ,sBAOI,iCAPJ,0BAOI,qCAPJ,wBAOI,mCAPJ,2BAOI,iCAPJ,4BAOI,wCAPJ,2BAOI,uCAPJ,2BAOI,uCAPJ,sBAOI,iCAPJ,oBAOI,+BAPJ,uBAOI,6BAPJ,yBAOI,+BAPJ,wBAOI,8BAPJ,wBAOI,mCAPJ,sBAOI,iCAPJ,yBAOI,+BAPJ,0BAOI,sCAPJ,yBAOI,qCAPJ,0BAOI,gCAPJ,oBAOI,0BAPJ,qBAOI,gCAPJ,mBAOI,8BAPJ,sBAOI,4BAPJ,wBAOI,8BAPJ,uBAOI,6BAPJ,gBAOI,mBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,YAOI,kBAPJ,eAOI,kBAPJ,QAOI,mBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,sBAPJ,QAOI,wBAPJ,QAOI,sBAPJ,WAOI,sBAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,iDAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,uDAPJ,SAOI,2DAPJ,SAOI,uDAPJ,YAOI,uDAPJ,SAOI,uBAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,4BAPJ,SAOI,0BAPJ,YAOI,0BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,YAOI,4BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,YAOI,6BAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,YAOI,2BAPJ,QAOI,oBAPJ,QAOI,yBAPJ,QAOI,wBAPJ,QAOI,uBAPJ,QAOI,yBAPJ,QAOI,uBAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,mDAPJ,SAOI,6DAPJ,SAOI,2DAPJ,SAOI,yDAPJ,SAOI,6DAPJ,SAOI,yDAPJ,SAOI,wBAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,2BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,0BAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,+BAPJ,SAOI,6BAPJ,SAOI,2BAPJ,SAOI,gCAPJ,SAOI,+BAPJ,SAOI,8BAPJ,SAOI,gCAPJ,SAOI,8BAPJ,SAOI,yBAPJ,SAOI,8BAPJ,SAOI,6BAPJ,SAOI,4BAPJ,SAOI,8BAPJ,SAOI,4BAPJ,UAOI,gBAPJ,UAOI,qBAPJ,UAOI,oBAPJ,UAOI,mBAPJ,UAOI,qBAPJ,UAOI,mBAPJ,cAOI,oBAPJ,cAOI,yBAPJ,cAOI,wBAPJ,cAOI,uBAPJ,cAOI,yBAPJ,cAOI,uBAPJ,iBAOI,uBAPJ,iBAOI,4BAPJ,iBAOI,2BAPJ,iBAOI,0BAPJ,iBAOI,4BAPJ,iBAOI,0BAPJ,eAOI,0BAPJ,aAOI,2BAPJ,gBAOI,4BAPJ,MAOI,2BAPJ,MAOI,yBAPJ,MAOI,4BAPJ,MAOI,4BCnCZ,aD4BQ,gBAOI,yBAPJ,sBAOI,+BAPJ,eAOI,wBAPJ,cAOI,uBAPJ,qBAOI,8BAPJ,eAOI,wBAPJ,mBAOI,4BAPJ,oBAOI,6BAPJ,cAOI,uBAPJ,qBAOI,8BAPJ,cAOI","sources":["webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/bootstrap.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_banner.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_root.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/vendor/_rfs.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_color-mode.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_reboot.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_variables.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_border-radius.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_type.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_lists.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_bootstrap.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_images.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_image.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_containers.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_container.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_breakpoints.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_grid.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_grid.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_tables.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_table-variants.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_labels.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_form-text.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_form-control.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_transition.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_gradients.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_form-select.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_form-check.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_form-range.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_floating-labels.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/forms/_input-group.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_forms.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_buttons.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_buttons.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_transitions.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_dropdown.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_caret.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_button-group.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_nav.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_navbar.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_card.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_accordion.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_breadcrumb.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_pagination.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_pagination.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_badge.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_alert.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_progress.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_list-group.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_close.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_toasts.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_modal.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_backdrop.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_tooltip.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_reset-text.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_popover.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_carousel.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_clearfix.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_spinners.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_offcanvas.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_placeholders.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_color-bg.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_colored-links.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_focus-ring.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_icon-link.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_ratio.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_position.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_stacks.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_visually-hidden.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_visually-hidden.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_stretched-link.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_text-truncation.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_text-truncate.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/helpers/_vr.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_utilities.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/utilities/_api.scss"],"sourcesContent":["/*!\n * Bootstrap  v5.3.2 (https://getbootstrap.com/)\n * Copyright 2011-2023 The Bootstrap Authors\n * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n */:root,[data-bs-theme=light]{--bs-blue: #0d6efd;--bs-indigo: #6610f2;--bs-purple: #6f42c1;--bs-pink: #d63384;--bs-red: #dc3545;--bs-orange: #fd7e14;--bs-yellow: #ffc107;--bs-green: #198754;--bs-teal: #20c997;--bs-cyan: #0dcaf0;--bs-black: #000;--bs-white: #fff;--bs-gray: #6c757d;--bs-gray-dark: #343a40;--bs-gray-100: #f8f9fa;--bs-gray-200: #e9ecef;--bs-gray-300: #dee2e6;--bs-gray-400: #ced4da;--bs-gray-500: #adb5bd;--bs-gray-600: #6c757d;--bs-gray-700: #495057;--bs-gray-800: #343a40;--bs-gray-900: #212529;--bs-primary: #0d6efd;--bs-secondary: #6c757d;--bs-success: #198754;--bs-info: #0dcaf0;--bs-warning: #ffc107;--bs-danger: #dc3545;--bs-light: #f8f9fa;--bs-dark: #212529;--bs-primary-rgb: 13, 110, 253;--bs-secondary-rgb: 108, 117, 125;--bs-success-rgb: 25, 135, 84;--bs-info-rgb: 13, 202, 240;--bs-warning-rgb: 255, 193, 7;--bs-danger-rgb: 220, 53, 69;--bs-light-rgb: 248, 249, 250;--bs-dark-rgb: 33, 37, 41;--bs-primary-text-emphasis: #052c65;--bs-secondary-text-emphasis: #2b2f32;--bs-success-text-emphasis: #0a3622;--bs-info-text-emphasis: #055160;--bs-warning-text-emphasis: #664d03;--bs-danger-text-emphasis: #58151c;--bs-light-text-emphasis: #495057;--bs-dark-text-emphasis: #495057;--bs-primary-bg-subtle: #cfe2ff;--bs-secondary-bg-subtle: #e2e3e5;--bs-success-bg-subtle: #d1e7dd;--bs-info-bg-subtle: #cff4fc;--bs-warning-bg-subtle: #fff3cd;--bs-danger-bg-subtle: #f8d7da;--bs-light-bg-subtle: #fcfcfd;--bs-dark-bg-subtle: #ced4da;--bs-primary-border-subtle: #9ec5fe;--bs-secondary-border-subtle: #c4c8cb;--bs-success-border-subtle: #a3cfbb;--bs-info-border-subtle: #9eeaf9;--bs-warning-border-subtle: #ffe69c;--bs-danger-border-subtle: #f1aeb5;--bs-light-border-subtle: #e9ecef;--bs-dark-border-subtle: #adb5bd;--bs-white-rgb: 255, 255, 255;--bs-black-rgb: 0, 0, 0;--bs-font-sans-serif: system-ui, -apple-system, \"Segoe UI\", Roboto, \"Helvetica Neue\", \"Noto Sans\", \"Liberation Sans\", Arial, sans-serif, \"Apple Color Emoji\", \"Segoe UI Emoji\", \"Segoe UI Symbol\", \"Noto Color Emoji\";--bs-font-monospace: SFMono-Regular, Menlo, Monaco, Consolas, \"Liberation Mono\", \"Courier New\", monospace;--bs-gradient: linear-gradient(180deg, rgba(255, 255, 255, 0.15), rgba(255, 255, 255, 0));--bs-body-font-family: var(--bs-font-sans-serif);--bs-body-font-size:1rem;--bs-body-font-weight: 400;--bs-body-line-height: 1.5;--bs-body-color: #212529;--bs-body-color-rgb: 33, 37, 41;--bs-body-bg: #fff;--bs-body-bg-rgb: 255, 255, 255;--bs-emphasis-color: #000;--bs-emphasis-color-rgb: 0, 0, 0;--bs-secondary-color: rgba(33, 37, 41, 0.75);--bs-secondary-color-rgb: 33, 37, 41;--bs-secondary-bg: #e9ecef;--bs-secondary-bg-rgb: 233, 236, 239;--bs-tertiary-color: rgba(33, 37, 41, 0.5);--bs-tertiary-color-rgb: 33, 37, 41;--bs-tertiary-bg: #f8f9fa;--bs-tertiary-bg-rgb: 248, 249, 250;--bs-heading-color: inherit;--bs-link-color: #0d6efd;--bs-link-color-rgb: 13, 110, 253;--bs-link-decoration: underline;--bs-link-hover-color: #0a58ca;--bs-link-hover-color-rgb: 10, 88, 202;--bs-code-color: #d63384;--bs-highlight-color: #212529;--bs-highlight-bg: #fff3cd;--bs-border-width: 1px;--bs-border-style: solid;--bs-border-color: #dee2e6;--bs-border-color-translucent: rgba(0, 0, 0, 0.175);--bs-border-radius: 0.375rem;--bs-border-radius-sm: 0.25rem;--bs-border-radius-lg: 0.5rem;--bs-border-radius-xl: 1rem;--bs-border-radius-xxl: 2rem;--bs-border-radius-2xl: var(--bs-border-radius-xxl);--bs-border-radius-pill: 50rem;--bs-box-shadow: 0 0.5rem 1rem rgba(0, 0, 0, 0.15);--bs-box-shadow-sm: 0 0.125rem 0.25rem rgba(0, 0, 0, 0.075);--bs-box-shadow-lg: 0 1rem 3rem rgba(0, 0, 0, 0.175);--bs-box-shadow-inset: inset 0 1px 2px rgba(0, 0, 0, 0.075);--bs-focus-ring-width: 0.25rem;--bs-focus-ring-opacity: 0.25;--bs-focus-ring-color: rgba(13, 110, 253, 0.25);--bs-form-valid-color: #198754;--bs-form-valid-border-color: #198754;--bs-form-invalid-color: #dc3545;--bs-form-invalid-border-color: #dc3545}[data-bs-theme=dark]{color-scheme:dark;--bs-body-color: #dee2e6;--bs-body-color-rgb: 222, 226, 230;--bs-body-bg: #212529;--bs-body-bg-rgb: 33, 37, 41;--bs-emphasis-color: #fff;--bs-emphasis-color-rgb: 255, 255, 255;--bs-secondary-color: rgba(222, 226, 230, 0.75);--bs-secondary-color-rgb: 222, 226, 230;--bs-secondary-bg: #343a40;--bs-secondary-bg-rgb: 52, 58, 64;--bs-tertiary-color: rgba(222, 226, 230, 0.5);--bs-tertiary-color-rgb: 222, 226, 230;--bs-tertiary-bg: #2b3035;--bs-tertiary-bg-rgb: 43, 48, 53;--bs-primary-text-emphasis: #6ea8fe;--bs-secondary-text-emphasis: #a7acb1;--bs-success-text-emphasis: #75b798;--bs-info-text-emphasis: #6edff6;--bs-warning-text-emphasis: #ffda6a;--bs-danger-text-emphasis: #ea868f;--bs-light-text-emphasis: #f8f9fa;--bs-dark-text-emphasis: #dee2e6;--bs-primary-bg-subtle: #031633;--bs-secondary-bg-subtle: #161719;--bs-success-bg-subtle: #051b11;--bs-info-bg-subtle: #032830;--bs-warning-bg-subtle: #332701;--bs-danger-bg-subtle: #2c0b0e;--bs-light-bg-subtle: #343a40;--bs-dark-bg-subtle: #1a1d20;--bs-primary-border-subtle: #084298;--bs-secondary-border-subtle: #41464b;--bs-success-border-subtle: #0f5132;--bs-info-border-subtle: #087990;--bs-warning-border-subtle: #997404;--bs-danger-border-subtle: #842029;--bs-light-border-subtle: #495057;--bs-dark-border-subtle: #343a40;--bs-heading-color: inherit;--bs-link-color: #6ea8fe;--bs-link-hover-color: #8bb9fe;--bs-link-color-rgb: 110, 168, 254;--bs-link-hover-color-rgb: 139, 185, 254;--bs-code-color: #e685b5;--bs-highlight-color: #dee2e6;--bs-highlight-bg: #664d03;--bs-border-color: #495057;--bs-border-color-translucent: rgba(255, 255, 255, 0.15);--bs-form-valid-color: #75b798;--bs-form-valid-border-color: #75b798;--bs-form-invalid-color: #ea868f;--bs-form-invalid-border-color: #ea868f}*,*::before,*::after{box-sizing:border-box}@media(prefers-reduced-motion: no-preference){:root{scroll-behavior:smooth}}body{margin:0;font-family:var(--bs-body-font-family);font-size:var(--bs-body-font-size);font-weight:var(--bs-body-font-weight);line-height:var(--bs-body-line-height);color:var(--bs-body-color);text-align:var(--bs-body-text-align);background-color:var(--bs-body-bg);-webkit-text-size-adjust:100%;-webkit-tap-highlight-color:rgba(0,0,0,0)}hr{margin:1rem 0;color:inherit;border:0;border-top:var(--bs-border-width) solid;opacity:.25}h6,.h6,h5,.h5,h4,.h4,h3,.h3,h2,.h2,h1,.h1{margin-top:0;margin-bottom:.5rem;font-weight:500;line-height:1.2;color:var(--bs-heading-color)}h1,.h1{font-size:calc(1.375rem + 1.5vw)}@media(min-width: 1200px){h1,.h1{font-size:2.5rem}}h2,.h2{font-size:calc(1.325rem + 0.9vw)}@media(min-width: 1200px){h2,.h2{font-size:2rem}}h3,.h3{font-size:calc(1.3rem + 0.6vw)}@media(min-width: 1200px){h3,.h3{font-size:1.75rem}}h4,.h4{font-size:calc(1.275rem + 0.3vw)}@media(min-width: 1200px){h4,.h4{font-size:1.5rem}}h5,.h5{font-size:1.25rem}h6,.h6{font-size:1rem}p{margin-top:0;margin-bottom:1rem}abbr[title]{text-decoration:underline dotted;cursor:help;text-decoration-skip-ink:none}address{margin-bottom:1rem;font-style:normal;line-height:inherit}ol,ul{padding-left:2rem}ol,ul,dl{margin-top:0;margin-bottom:1rem}ol ol,ul ul,ol ul,ul ol{margin-bottom:0}dt{font-weight:700}dd{margin-bottom:.5rem;margin-left:0}blockquote{margin:0 0 1rem}b,strong{font-weight:bolder}small,.small{font-size:0.875em}mark,.mark{padding:.1875em;color:var(--bs-highlight-color);background-color:var(--bs-highlight-bg)}sub,sup{position:relative;font-size:0.75em;line-height:0;vertical-align:baseline}sub{bottom:-0.25em}sup{top:-0.5em}a{color:rgba(var(--bs-link-color-rgb), var(--bs-link-opacity, 1));text-decoration:underline}a:hover{--bs-link-color-rgb: var(--bs-link-hover-color-rgb)}a:not([href]):not([class]),a:not([href]):not([class]):hover{color:inherit;text-decoration:none}pre,code,kbd,samp{font-family:var(--bs-font-monospace);font-size:1em}pre{display:block;margin-top:0;margin-bottom:1rem;overflow:auto;font-size:0.875em}pre code{font-size:inherit;color:inherit;word-break:normal}code{font-size:0.875em;color:var(--bs-code-color);word-wrap:break-word}a>code{color:inherit}kbd{padding:.1875rem .375rem;font-size:0.875em;color:var(--bs-body-bg);background-color:var(--bs-body-color);border-radius:.25rem}kbd kbd{padding:0;font-size:1em}figure{margin:0 0 1rem}img,svg{vertical-align:middle}table{caption-side:bottom;border-collapse:collapse}caption{padding-top:.5rem;padding-bottom:.5rem;color:var(--bs-secondary-color);text-align:left}th{text-align:inherit;text-align:-webkit-match-parent}thead,tbody,tfoot,tr,td,th{border-color:inherit;border-style:solid;border-width:0}label{display:inline-block}button{border-radius:0}button:focus:not(:focus-visible){outline:0}input,button,select,optgroup,textarea{margin:0;font-family:inherit;font-size:inherit;line-height:inherit}button,select{text-transform:none}[role=button]{cursor:pointer}select{word-wrap:normal}select:disabled{opacity:1}[list]:not([type=date]):not([type=datetime-local]):not([type=month]):not([type=week]):not([type=time])::-webkit-calendar-picker-indicator{display:none !important}button,[type=button],[type=reset],[type=submit]{-webkit-appearance:button}button:not(:disabled),[type=button]:not(:disabled),[type=reset]:not(:disabled),[type=submit]:not(:disabled){cursor:pointer}::-moz-focus-inner{padding:0;border-style:none}textarea{resize:vertical}fieldset{min-width:0;padding:0;margin:0;border:0}legend{float:left;width:100%;padding:0;margin-bottom:.5rem;font-size:calc(1.275rem + 0.3vw);line-height:inherit}@media(min-width: 1200px){legend{font-size:1.5rem}}legend+*{clear:left}::-webkit-datetime-edit-fields-wrapper,::-webkit-datetime-edit-text,::-webkit-datetime-edit-minute,::-webkit-datetime-edit-hour-field,::-webkit-datetime-edit-day-field,::-webkit-datetime-edit-month-field,::-webkit-datetime-edit-year-field{padding:0}::-webkit-inner-spin-button{height:auto}[type=search]{-webkit-appearance:textfield;outline-offset:-2px}::-webkit-search-decoration{-webkit-appearance:none}::-webkit-color-swatch-wrapper{padding:0}::file-selector-button{font:inherit;-webkit-appearance:button}output{display:inline-block}iframe{border:0}summary{display:list-item;cursor:pointer}progress{vertical-align:baseline}[hidden]{display:none !important}.lead{font-size:1.25rem;font-weight:300}.display-1{font-size:calc(1.625rem + 4.5vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-1{font-size:5rem}}.display-2{font-size:calc(1.575rem + 3.9vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-2{font-size:4.5rem}}.display-3{font-size:calc(1.525rem + 3.3vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-3{font-size:4rem}}.display-4{font-size:calc(1.475rem + 2.7vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-4{font-size:3.5rem}}.display-5{font-size:calc(1.425rem + 2.1vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-5{font-size:3rem}}.display-6{font-size:calc(1.375rem + 1.5vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.display-6{font-size:2.5rem}}.list-unstyled{padding-left:0;list-style:none}.list-inline{padding-left:0;list-style:none}.list-inline-item{display:inline-block}.list-inline-item:not(:last-child){margin-right:.5rem}.initialism{font-size:0.875em;text-transform:uppercase}.blockquote{margin-bottom:1rem;font-size:1.25rem}.blockquote>:last-child{margin-bottom:0}.blockquote-footer{margin-top:-1rem;margin-bottom:1rem;font-size:0.875em;color:#6c757d}.blockquote-footer::before{content:\"— \"}.img-fluid{max-width:100%;height:auto}.img-thumbnail{padding:.25rem;background-color:var(--bs-body-bg);border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);max-width:100%;height:auto}.figure{display:inline-block}.figure-img{margin-bottom:.5rem;line-height:1}.figure-caption{font-size:0.875em;color:var(--bs-secondary-color)}.container,.container-fluid,.container-xl,.container-lg,.container-md,.container-sm{--bs-gutter-x: 1.5rem;--bs-gutter-y: 0;width:100%;padding-right:calc(var(--bs-gutter-x)*.5);padding-left:calc(var(--bs-gutter-x)*.5);margin-right:auto;margin-left:auto}@media(min-width: 540px){.container-sm,.container{max-width:540px}}@media(min-width: 720px){.container-md,.container-sm,.container{max-width:720px}}@media(min-width: 960px){.container-lg,.container-md,.container-sm,.container{max-width:960px}}@media(min-width: 1200px){.container-xl,.container-lg,.container-md,.container-sm,.container{max-width:1400px}}:root{--bs-breakpoint-xs: 0;--bs-breakpoint-sm: 540px;--bs-breakpoint-md: 720px;--bs-breakpoint-lg: 960px;--bs-breakpoint-xl: 1200px}.row{--bs-gutter-x: 1.5rem;--bs-gutter-y: 0;display:flex;flex-wrap:wrap;margin-top:calc(-1*var(--bs-gutter-y));margin-right:calc(-0.5*var(--bs-gutter-x));margin-left:calc(-0.5*var(--bs-gutter-x))}.row>*{flex-shrink:0;width:100%;max-width:100%;padding-right:calc(var(--bs-gutter-x)*.5);padding-left:calc(var(--bs-gutter-x)*.5);margin-top:var(--bs-gutter-y)}.col{flex:1 0 0%}.row-cols-auto>*{flex:0 0 auto;width:auto}.row-cols-1>*{flex:0 0 auto;width:100%}.row-cols-2>*{flex:0 0 auto;width:50%}.row-cols-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-4>*{flex:0 0 auto;width:25%}.row-cols-5>*{flex:0 0 auto;width:20%}.row-cols-6>*{flex:0 0 auto;width:16.66666667%}.col-auto{flex:0 0 auto;width:auto}.col-1{flex:0 0 auto;width:8.33333333%}.col-2{flex:0 0 auto;width:16.66666667%}.col-3{flex:0 0 auto;width:25%}.col-4{flex:0 0 auto;width:33.33333333%}.col-5{flex:0 0 auto;width:41.66666667%}.col-6{flex:0 0 auto;width:50%}.col-7{flex:0 0 auto;width:58.33333333%}.col-8{flex:0 0 auto;width:66.66666667%}.col-9{flex:0 0 auto;width:75%}.col-10{flex:0 0 auto;width:83.33333333%}.col-11{flex:0 0 auto;width:91.66666667%}.col-12{flex:0 0 auto;width:100%}.offset-1{margin-left:8.33333333%}.offset-2{margin-left:16.66666667%}.offset-3{margin-left:25%}.offset-4{margin-left:33.33333333%}.offset-5{margin-left:41.66666667%}.offset-6{margin-left:50%}.offset-7{margin-left:58.33333333%}.offset-8{margin-left:66.66666667%}.offset-9{margin-left:75%}.offset-10{margin-left:83.33333333%}.offset-11{margin-left:91.66666667%}.g-0,.gx-0{--bs-gutter-x: 0}.g-0,.gy-0{--bs-gutter-y: 0}.g-1,.gx-1{--bs-gutter-x: 0.25rem}.g-1,.gy-1{--bs-gutter-y: 0.25rem}.g-2,.gx-2{--bs-gutter-x: 0.5rem}.g-2,.gy-2{--bs-gutter-y: 0.5rem}.g-3,.gx-3{--bs-gutter-x: 1rem}.g-3,.gy-3{--bs-gutter-y: 1rem}.g-4,.gx-4{--bs-gutter-x: 1.5rem}.g-4,.gy-4{--bs-gutter-y: 1.5rem}.g-5,.gx-5{--bs-gutter-x: 3rem}.g-5,.gy-5{--bs-gutter-y: 3rem}@media(min-width: 540px){.col-sm{flex:1 0 0%}.row-cols-sm-auto>*{flex:0 0 auto;width:auto}.row-cols-sm-1>*{flex:0 0 auto;width:100%}.row-cols-sm-2>*{flex:0 0 auto;width:50%}.row-cols-sm-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-sm-4>*{flex:0 0 auto;width:25%}.row-cols-sm-5>*{flex:0 0 auto;width:20%}.row-cols-sm-6>*{flex:0 0 auto;width:16.66666667%}.col-sm-auto{flex:0 0 auto;width:auto}.col-sm-1{flex:0 0 auto;width:8.33333333%}.col-sm-2{flex:0 0 auto;width:16.66666667%}.col-sm-3{flex:0 0 auto;width:25%}.col-sm-4{flex:0 0 auto;width:33.33333333%}.col-sm-5{flex:0 0 auto;width:41.66666667%}.col-sm-6{flex:0 0 auto;width:50%}.col-sm-7{flex:0 0 auto;width:58.33333333%}.col-sm-8{flex:0 0 auto;width:66.66666667%}.col-sm-9{flex:0 0 auto;width:75%}.col-sm-10{flex:0 0 auto;width:83.33333333%}.col-sm-11{flex:0 0 auto;width:91.66666667%}.col-sm-12{flex:0 0 auto;width:100%}.offset-sm-0{margin-left:0}.offset-sm-1{margin-left:8.33333333%}.offset-sm-2{margin-left:16.66666667%}.offset-sm-3{margin-left:25%}.offset-sm-4{margin-left:33.33333333%}.offset-sm-5{margin-left:41.66666667%}.offset-sm-6{margin-left:50%}.offset-sm-7{margin-left:58.33333333%}.offset-sm-8{margin-left:66.66666667%}.offset-sm-9{margin-left:75%}.offset-sm-10{margin-left:83.33333333%}.offset-sm-11{margin-left:91.66666667%}.g-sm-0,.gx-sm-0{--bs-gutter-x: 0}.g-sm-0,.gy-sm-0{--bs-gutter-y: 0}.g-sm-1,.gx-sm-1{--bs-gutter-x: 0.25rem}.g-sm-1,.gy-sm-1{--bs-gutter-y: 0.25rem}.g-sm-2,.gx-sm-2{--bs-gutter-x: 0.5rem}.g-sm-2,.gy-sm-2{--bs-gutter-y: 0.5rem}.g-sm-3,.gx-sm-3{--bs-gutter-x: 1rem}.g-sm-3,.gy-sm-3{--bs-gutter-y: 1rem}.g-sm-4,.gx-sm-4{--bs-gutter-x: 1.5rem}.g-sm-4,.gy-sm-4{--bs-gutter-y: 1.5rem}.g-sm-5,.gx-sm-5{--bs-gutter-x: 3rem}.g-sm-5,.gy-sm-5{--bs-gutter-y: 3rem}}@media(min-width: 720px){.col-md{flex:1 0 0%}.row-cols-md-auto>*{flex:0 0 auto;width:auto}.row-cols-md-1>*{flex:0 0 auto;width:100%}.row-cols-md-2>*{flex:0 0 auto;width:50%}.row-cols-md-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-md-4>*{flex:0 0 auto;width:25%}.row-cols-md-5>*{flex:0 0 auto;width:20%}.row-cols-md-6>*{flex:0 0 auto;width:16.66666667%}.col-md-auto{flex:0 0 auto;width:auto}.col-md-1{flex:0 0 auto;width:8.33333333%}.col-md-2{flex:0 0 auto;width:16.66666667%}.col-md-3{flex:0 0 auto;width:25%}.col-md-4{flex:0 0 auto;width:33.33333333%}.col-md-5{flex:0 0 auto;width:41.66666667%}.col-md-6{flex:0 0 auto;width:50%}.col-md-7{flex:0 0 auto;width:58.33333333%}.col-md-8{flex:0 0 auto;width:66.66666667%}.col-md-9{flex:0 0 auto;width:75%}.col-md-10{flex:0 0 auto;width:83.33333333%}.col-md-11{flex:0 0 auto;width:91.66666667%}.col-md-12{flex:0 0 auto;width:100%}.offset-md-0{margin-left:0}.offset-md-1{margin-left:8.33333333%}.offset-md-2{margin-left:16.66666667%}.offset-md-3{margin-left:25%}.offset-md-4{margin-left:33.33333333%}.offset-md-5{margin-left:41.66666667%}.offset-md-6{margin-left:50%}.offset-md-7{margin-left:58.33333333%}.offset-md-8{margin-left:66.66666667%}.offset-md-9{margin-left:75%}.offset-md-10{margin-left:83.33333333%}.offset-md-11{margin-left:91.66666667%}.g-md-0,.gx-md-0{--bs-gutter-x: 0}.g-md-0,.gy-md-0{--bs-gutter-y: 0}.g-md-1,.gx-md-1{--bs-gutter-x: 0.25rem}.g-md-1,.gy-md-1{--bs-gutter-y: 0.25rem}.g-md-2,.gx-md-2{--bs-gutter-x: 0.5rem}.g-md-2,.gy-md-2{--bs-gutter-y: 0.5rem}.g-md-3,.gx-md-3{--bs-gutter-x: 1rem}.g-md-3,.gy-md-3{--bs-gutter-y: 1rem}.g-md-4,.gx-md-4{--bs-gutter-x: 1.5rem}.g-md-4,.gy-md-4{--bs-gutter-y: 1.5rem}.g-md-5,.gx-md-5{--bs-gutter-x: 3rem}.g-md-5,.gy-md-5{--bs-gutter-y: 3rem}}@media(min-width: 960px){.col-lg{flex:1 0 0%}.row-cols-lg-auto>*{flex:0 0 auto;width:auto}.row-cols-lg-1>*{flex:0 0 auto;width:100%}.row-cols-lg-2>*{flex:0 0 auto;width:50%}.row-cols-lg-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-lg-4>*{flex:0 0 auto;width:25%}.row-cols-lg-5>*{flex:0 0 auto;width:20%}.row-cols-lg-6>*{flex:0 0 auto;width:16.66666667%}.col-lg-auto{flex:0 0 auto;width:auto}.col-lg-1{flex:0 0 auto;width:8.33333333%}.col-lg-2{flex:0 0 auto;width:16.66666667%}.col-lg-3{flex:0 0 auto;width:25%}.col-lg-4{flex:0 0 auto;width:33.33333333%}.col-lg-5{flex:0 0 auto;width:41.66666667%}.col-lg-6{flex:0 0 auto;width:50%}.col-lg-7{flex:0 0 auto;width:58.33333333%}.col-lg-8{flex:0 0 auto;width:66.66666667%}.col-lg-9{flex:0 0 auto;width:75%}.col-lg-10{flex:0 0 auto;width:83.33333333%}.col-lg-11{flex:0 0 auto;width:91.66666667%}.col-lg-12{flex:0 0 auto;width:100%}.offset-lg-0{margin-left:0}.offset-lg-1{margin-left:8.33333333%}.offset-lg-2{margin-left:16.66666667%}.offset-lg-3{margin-left:25%}.offset-lg-4{margin-left:33.33333333%}.offset-lg-5{margin-left:41.66666667%}.offset-lg-6{margin-left:50%}.offset-lg-7{margin-left:58.33333333%}.offset-lg-8{margin-left:66.66666667%}.offset-lg-9{margin-left:75%}.offset-lg-10{margin-left:83.33333333%}.offset-lg-11{margin-left:91.66666667%}.g-lg-0,.gx-lg-0{--bs-gutter-x: 0}.g-lg-0,.gy-lg-0{--bs-gutter-y: 0}.g-lg-1,.gx-lg-1{--bs-gutter-x: 0.25rem}.g-lg-1,.gy-lg-1{--bs-gutter-y: 0.25rem}.g-lg-2,.gx-lg-2{--bs-gutter-x: 0.5rem}.g-lg-2,.gy-lg-2{--bs-gutter-y: 0.5rem}.g-lg-3,.gx-lg-3{--bs-gutter-x: 1rem}.g-lg-3,.gy-lg-3{--bs-gutter-y: 1rem}.g-lg-4,.gx-lg-4{--bs-gutter-x: 1.5rem}.g-lg-4,.gy-lg-4{--bs-gutter-y: 1.5rem}.g-lg-5,.gx-lg-5{--bs-gutter-x: 3rem}.g-lg-5,.gy-lg-5{--bs-gutter-y: 3rem}}@media(min-width: 1200px){.col-xl{flex:1 0 0%}.row-cols-xl-auto>*{flex:0 0 auto;width:auto}.row-cols-xl-1>*{flex:0 0 auto;width:100%}.row-cols-xl-2>*{flex:0 0 auto;width:50%}.row-cols-xl-3>*{flex:0 0 auto;width:33.33333333%}.row-cols-xl-4>*{flex:0 0 auto;width:25%}.row-cols-xl-5>*{flex:0 0 auto;width:20%}.row-cols-xl-6>*{flex:0 0 auto;width:16.66666667%}.col-xl-auto{flex:0 0 auto;width:auto}.col-xl-1{flex:0 0 auto;width:8.33333333%}.col-xl-2{flex:0 0 auto;width:16.66666667%}.col-xl-3{flex:0 0 auto;width:25%}.col-xl-4{flex:0 0 auto;width:33.33333333%}.col-xl-5{flex:0 0 auto;width:41.66666667%}.col-xl-6{flex:0 0 auto;width:50%}.col-xl-7{flex:0 0 auto;width:58.33333333%}.col-xl-8{flex:0 0 auto;width:66.66666667%}.col-xl-9{flex:0 0 auto;width:75%}.col-xl-10{flex:0 0 auto;width:83.33333333%}.col-xl-11{flex:0 0 auto;width:91.66666667%}.col-xl-12{flex:0 0 auto;width:100%}.offset-xl-0{margin-left:0}.offset-xl-1{margin-left:8.33333333%}.offset-xl-2{margin-left:16.66666667%}.offset-xl-3{margin-left:25%}.offset-xl-4{margin-left:33.33333333%}.offset-xl-5{margin-left:41.66666667%}.offset-xl-6{margin-left:50%}.offset-xl-7{margin-left:58.33333333%}.offset-xl-8{margin-left:66.66666667%}.offset-xl-9{margin-left:75%}.offset-xl-10{margin-left:83.33333333%}.offset-xl-11{margin-left:91.66666667%}.g-xl-0,.gx-xl-0{--bs-gutter-x: 0}.g-xl-0,.gy-xl-0{--bs-gutter-y: 0}.g-xl-1,.gx-xl-1{--bs-gutter-x: 0.25rem}.g-xl-1,.gy-xl-1{--bs-gutter-y: 0.25rem}.g-xl-2,.gx-xl-2{--bs-gutter-x: 0.5rem}.g-xl-2,.gy-xl-2{--bs-gutter-y: 0.5rem}.g-xl-3,.gx-xl-3{--bs-gutter-x: 1rem}.g-xl-3,.gy-xl-3{--bs-gutter-y: 1rem}.g-xl-4,.gx-xl-4{--bs-gutter-x: 1.5rem}.g-xl-4,.gy-xl-4{--bs-gutter-y: 1.5rem}.g-xl-5,.gx-xl-5{--bs-gutter-x: 3rem}.g-xl-5,.gy-xl-5{--bs-gutter-y: 3rem}}.table{--bs-table-color-type: initial;--bs-table-bg-type: initial;--bs-table-color-state: initial;--bs-table-bg-state: initial;--bs-table-color: var(--bs-emphasis-color);--bs-table-bg: var(--bs-body-bg);--bs-table-border-color: var(--bs-border-color);--bs-table-accent-bg: transparent;--bs-table-striped-color: var(--bs-emphasis-color);--bs-table-striped-bg: rgba(var(--bs-emphasis-color-rgb), 0.05);--bs-table-active-color: var(--bs-emphasis-color);--bs-table-active-bg: rgba(var(--bs-emphasis-color-rgb), 0.1);--bs-table-hover-color: var(--bs-emphasis-color);--bs-table-hover-bg: rgba(var(--bs-emphasis-color-rgb), 0.075);width:100%;margin-bottom:1rem;vertical-align:top;border-color:var(--bs-table-border-color)}.table>:not(caption)>*>*{padding:.5rem .5rem;color:var(--bs-table-color-state, var(--bs-table-color-type, var(--bs-table-color)));background-color:var(--bs-table-bg);border-bottom-width:var(--bs-border-width);box-shadow:inset 0 0 0 9999px var(--bs-table-bg-state, var(--bs-table-bg-type, var(--bs-table-accent-bg)))}.table>tbody{vertical-align:inherit}.table>thead{vertical-align:bottom}.table-group-divider{border-top:calc(var(--bs-border-width)*2) solid currentcolor}.caption-top{caption-side:top}.table-sm>:not(caption)>*>*{padding:.25rem .25rem}.table-bordered>:not(caption)>*{border-width:var(--bs-border-width) 0}.table-bordered>:not(caption)>*>*{border-width:0 var(--bs-border-width)}.table-borderless>:not(caption)>*>*{border-bottom-width:0}.table-borderless>:not(:first-child){border-top-width:0}.table-striped>tbody>tr:nth-of-type(odd)>*{--bs-table-color-type: var(--bs-table-striped-color);--bs-table-bg-type: var(--bs-table-striped-bg)}.table-striped-columns>:not(caption)>tr>:nth-child(even){--bs-table-color-type: var(--bs-table-striped-color);--bs-table-bg-type: var(--bs-table-striped-bg)}.table-active{--bs-table-color-state: var(--bs-table-active-color);--bs-table-bg-state: var(--bs-table-active-bg)}.table-hover>tbody>tr:hover>*{--bs-table-color-state: var(--bs-table-hover-color);--bs-table-bg-state: var(--bs-table-hover-bg)}.table-primary{--bs-table-color: #000;--bs-table-bg: #cfe2ff;--bs-table-border-color: #a6b5cc;--bs-table-striped-bg: #c5d7f2;--bs-table-striped-color: #000;--bs-table-active-bg: #bacbe6;--bs-table-active-color: #000;--bs-table-hover-bg: #bfd1ec;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-secondary{--bs-table-color: #000;--bs-table-bg: #e2e3e5;--bs-table-border-color: #b5b6b7;--bs-table-striped-bg: #d7d8da;--bs-table-striped-color: #000;--bs-table-active-bg: #cbccce;--bs-table-active-color: #000;--bs-table-hover-bg: #d1d2d4;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-success{--bs-table-color: #000;--bs-table-bg: #d1e7dd;--bs-table-border-color: #a7b9b1;--bs-table-striped-bg: #c7dbd2;--bs-table-striped-color: #000;--bs-table-active-bg: #bcd0c7;--bs-table-active-color: #000;--bs-table-hover-bg: #c1d6cc;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-info{--bs-table-color: #000;--bs-table-bg: #cff4fc;--bs-table-border-color: #a6c3ca;--bs-table-striped-bg: #c5e8ef;--bs-table-striped-color: #000;--bs-table-active-bg: #badce3;--bs-table-active-color: #000;--bs-table-hover-bg: #bfe2e9;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-warning{--bs-table-color: #000;--bs-table-bg: #fff3cd;--bs-table-border-color: #ccc2a4;--bs-table-striped-bg: #f2e7c3;--bs-table-striped-color: #000;--bs-table-active-bg: #e6dbb9;--bs-table-active-color: #000;--bs-table-hover-bg: #ece1be;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-danger{--bs-table-color: #000;--bs-table-bg: #f8d7da;--bs-table-border-color: #c6acae;--bs-table-striped-bg: #eccccf;--bs-table-striped-color: #000;--bs-table-active-bg: #dfc2c4;--bs-table-active-color: #000;--bs-table-hover-bg: #e5c7ca;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-light{--bs-table-color: #000;--bs-table-bg: #f8f9fa;--bs-table-border-color: #c6c7c8;--bs-table-striped-bg: #ecedee;--bs-table-striped-color: #000;--bs-table-active-bg: #dfe0e1;--bs-table-active-color: #000;--bs-table-hover-bg: #e5e6e7;--bs-table-hover-color: #000;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-dark{--bs-table-color: #fff;--bs-table-bg: #212529;--bs-table-border-color: #4d5154;--bs-table-striped-bg: #2c3034;--bs-table-striped-color: #fff;--bs-table-active-bg: #373b3e;--bs-table-active-color: #fff;--bs-table-hover-bg: #323539;--bs-table-hover-color: #fff;color:var(--bs-table-color);border-color:var(--bs-table-border-color)}.table-responsive{overflow-x:auto;-webkit-overflow-scrolling:touch}@media(max-width: 539.98px){.table-responsive-sm{overflow-x:auto;-webkit-overflow-scrolling:touch}}@media(max-width: 719.98px){.table-responsive-md{overflow-x:auto;-webkit-overflow-scrolling:touch}}@media(max-width: 959.98px){.table-responsive-lg{overflow-x:auto;-webkit-overflow-scrolling:touch}}@media(max-width: 1199.98px){.table-responsive-xl{overflow-x:auto;-webkit-overflow-scrolling:touch}}.form-label{margin-bottom:.5rem}.col-form-label{padding-top:calc(0.375rem + var(--bs-border-width));padding-bottom:calc(0.375rem + var(--bs-border-width));margin-bottom:0;font-size:inherit;line-height:1.5}.col-form-label-lg{padding-top:calc(0.5rem + var(--bs-border-width));padding-bottom:calc(0.5rem + var(--bs-border-width));font-size:1.25rem}.col-form-label-sm{padding-top:calc(0.25rem + var(--bs-border-width));padding-bottom:calc(0.25rem + var(--bs-border-width));font-size:0.875rem}.form-text{margin-top:.25rem;font-size:0.875em;color:var(--bs-secondary-color)}.form-control{display:block;width:100%;padding:.375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:var(--bs-body-color);appearance:none;background-color:var(--bs-body-bg);background-clip:padding-box;border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-control{transition:none}}.form-control[type=file]{overflow:hidden}.form-control[type=file]:not(:disabled):not([readonly]){cursor:pointer}.form-control:focus{color:var(--bs-body-color);background-color:var(--bs-body-bg);border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.form-control::-webkit-date-and-time-value{min-width:85px;height:1.5em;margin:0}.form-control::-webkit-datetime-edit{display:block;padding:0}.form-control::placeholder{color:var(--bs-secondary-color);opacity:1}.form-control:disabled{background-color:var(--bs-secondary-bg);opacity:1}.form-control::file-selector-button{padding:.375rem .75rem;margin:-0.375rem -0.75rem;margin-inline-end:.75rem;color:var(--bs-body-color);background-color:var(--bs-tertiary-bg);pointer-events:none;border-color:inherit;border-style:solid;border-width:0;border-inline-end-width:var(--bs-border-width);border-radius:0;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-control::file-selector-button{transition:none}}.form-control:hover:not(:disabled):not([readonly])::file-selector-button{background-color:var(--bs-secondary-bg)}.form-control-plaintext{display:block;width:100%;padding:.375rem 0;margin-bottom:0;line-height:1.5;color:var(--bs-body-color);background-color:rgba(0,0,0,0);border:solid rgba(0,0,0,0);border-width:var(--bs-border-width) 0}.form-control-plaintext:focus{outline:0}.form-control-plaintext.form-control-sm,.form-control-plaintext.form-control-lg{padding-right:0;padding-left:0}.form-control-sm{min-height:calc(1.5em + 0.5rem + calc(var(--bs-border-width) * 2));padding:.25rem .5rem;font-size:0.875rem;border-radius:var(--bs-border-radius-sm)}.form-control-sm::file-selector-button{padding:.25rem .5rem;margin:-0.25rem -0.5rem;margin-inline-end:.5rem}.form-control-lg{min-height:calc(1.5em + 1rem + calc(var(--bs-border-width) * 2));padding:.5rem 1rem;font-size:1.25rem;border-radius:var(--bs-border-radius-lg)}.form-control-lg::file-selector-button{padding:.5rem 1rem;margin:-0.5rem -1rem;margin-inline-end:1rem}textarea.form-control{min-height:calc(1.5em + 0.75rem + calc(var(--bs-border-width) * 2))}textarea.form-control-sm{min-height:calc(1.5em + 0.5rem + calc(var(--bs-border-width) * 2))}textarea.form-control-lg{min-height:calc(1.5em + 1rem + calc(var(--bs-border-width) * 2))}.form-control-color{width:3rem;height:calc(1.5em + 0.75rem + calc(var(--bs-border-width) * 2));padding:.375rem}.form-control-color:not(:disabled):not([readonly]){cursor:pointer}.form-control-color::-moz-color-swatch{border:0 !important;border-radius:var(--bs-border-radius)}.form-control-color::-webkit-color-swatch{border:0 !important;border-radius:var(--bs-border-radius)}.form-control-color.form-control-sm{height:calc(1.5em + 0.5rem + calc(var(--bs-border-width) * 2))}.form-control-color.form-control-lg{height:calc(1.5em + 1rem + calc(var(--bs-border-width) * 2))}.form-select{--bs-form-select-bg-img: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3e%3cpath fill='none' stroke='%23343a40' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/%3e%3c/svg%3e\");display:block;width:100%;padding:.375rem 2.25rem .375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:var(--bs-body-color);appearance:none;background-color:var(--bs-body-bg);background-image:var(--bs-form-select-bg-img),var(--bs-form-select-bg-icon, none);background-repeat:no-repeat;background-position:right .75rem center;background-size:16px 12px;border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius);transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-select{transition:none}}.form-select:focus{border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.form-select[multiple],.form-select[size]:not([size=\"1\"]){padding-right:.75rem;background-image:none}.form-select:disabled{background-color:var(--bs-secondary-bg)}.form-select:-moz-focusring{color:rgba(0,0,0,0);text-shadow:0 0 0 var(--bs-body-color)}.form-select-sm{padding-top:.25rem;padding-bottom:.25rem;padding-left:.5rem;font-size:0.875rem;border-radius:var(--bs-border-radius-sm)}.form-select-lg{padding-top:.5rem;padding-bottom:.5rem;padding-left:1rem;font-size:1.25rem;border-radius:var(--bs-border-radius-lg)}[data-bs-theme=dark] .form-select{--bs-form-select-bg-img: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3e%3cpath fill='none' stroke='%23dee2e6' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/%3e%3c/svg%3e\")}.form-check{display:block;min-height:1.5rem;padding-left:1.5em;margin-bottom:.125rem}.form-check .form-check-input{float:left;margin-left:-1.5em}.form-check-reverse{padding-right:1.5em;padding-left:0;text-align:right}.form-check-reverse .form-check-input{float:right;margin-right:-1.5em;margin-left:0}.form-check-input{--bs-form-check-bg: var(--bs-body-bg);flex-shrink:0;width:1em;height:1em;margin-top:.25em;vertical-align:top;appearance:none;background-color:var(--bs-form-check-bg);background-image:var(--bs-form-check-bg-image);background-repeat:no-repeat;background-position:center;background-size:contain;border:var(--bs-border-width) solid var(--bs-border-color);print-color-adjust:exact}.form-check-input[type=checkbox]{border-radius:.25em}.form-check-input[type=radio]{border-radius:50%}.form-check-input:active{filter:brightness(90%)}.form-check-input:focus{border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.form-check-input:checked{background-color:#0d6efd;border-color:#0d6efd}.form-check-input:checked[type=checkbox]{--bs-form-check-bg-image: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3e%3cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='m6 10 3 3 6-6'/%3e%3c/svg%3e\")}.form-check-input:checked[type=radio]{--bs-form-check-bg-image: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='2' fill='%23fff'/%3e%3c/svg%3e\")}.form-check-input[type=checkbox]:indeterminate{background-color:#0d6efd;border-color:#0d6efd;--bs-form-check-bg-image: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3e%3cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10h8'/%3e%3c/svg%3e\")}.form-check-input:disabled{pointer-events:none;filter:none;opacity:.5}.form-check-input[disabled]~.form-check-label,.form-check-input:disabled~.form-check-label{cursor:default;opacity:.5}.form-switch{padding-left:2.5em}.form-switch .form-check-input{--bs-form-switch-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='rgba%280, 0, 0, 0.25%29'/%3e%3c/svg%3e\");width:2em;margin-left:-2.5em;background-image:var(--bs-form-switch-bg);background-position:left center;border-radius:2em;transition:background-position .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-switch .form-check-input{transition:none}}.form-switch .form-check-input:focus{--bs-form-switch-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='%2386b7fe'/%3e%3c/svg%3e\")}.form-switch .form-check-input:checked{background-position:right center;--bs-form-switch-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='%23fff'/%3e%3c/svg%3e\")}.form-switch.form-check-reverse{padding-right:2.5em;padding-left:0}.form-switch.form-check-reverse .form-check-input{margin-right:-2.5em;margin-left:0}.form-check-inline{display:inline-block;margin-right:1rem}.btn-check{position:absolute;clip:rect(0, 0, 0, 0);pointer-events:none}.btn-check[disabled]+.btn,.btn-check:disabled+.btn{pointer-events:none;filter:none;opacity:.65}[data-bs-theme=dark] .form-switch .form-check-input:not(:checked):not(:focus){--bs-form-switch-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='rgba%28255, 255, 255, 0.25%29'/%3e%3c/svg%3e\")}.form-range{width:100%;height:1.5rem;padding:0;appearance:none;background-color:rgba(0,0,0,0)}.form-range:focus{outline:0}.form-range:focus::-webkit-slider-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.form-range:focus::-moz-range-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.form-range::-moz-focus-outer{border:0}.form-range::-webkit-slider-thumb{width:1rem;height:1rem;margin-top:-0.25rem;appearance:none;background-color:#0d6efd;border:0;border-radius:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-range::-webkit-slider-thumb{transition:none}}.form-range::-webkit-slider-thumb:active{background-color:#b6d4fe}.form-range::-webkit-slider-runnable-track{width:100%;height:.5rem;color:rgba(0,0,0,0);cursor:pointer;background-color:var(--bs-secondary-bg);border-color:rgba(0,0,0,0);border-radius:1rem}.form-range::-moz-range-thumb{width:1rem;height:1rem;appearance:none;background-color:#0d6efd;border:0;border-radius:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.form-range::-moz-range-thumb{transition:none}}.form-range::-moz-range-thumb:active{background-color:#b6d4fe}.form-range::-moz-range-track{width:100%;height:.5rem;color:rgba(0,0,0,0);cursor:pointer;background-color:var(--bs-secondary-bg);border-color:rgba(0,0,0,0);border-radius:1rem}.form-range:disabled{pointer-events:none}.form-range:disabled::-webkit-slider-thumb{background-color:var(--bs-secondary-color)}.form-range:disabled::-moz-range-thumb{background-color:var(--bs-secondary-color)}.form-floating{position:relative}.form-floating>.form-control,.form-floating>.form-control-plaintext,.form-floating>.form-select{height:calc(3.5rem + calc(var(--bs-border-width) * 2));min-height:calc(3.5rem + calc(var(--bs-border-width) * 2));line-height:1.25}.form-floating>label{position:absolute;top:0;left:0;z-index:2;height:100%;padding:1rem .75rem;overflow:hidden;text-align:start;text-overflow:ellipsis;white-space:nowrap;pointer-events:none;border:var(--bs-border-width) solid rgba(0,0,0,0);transform-origin:0 0;transition:opacity .1s ease-in-out,transform .1s ease-in-out}@media(prefers-reduced-motion: reduce){.form-floating>label{transition:none}}.form-floating>.form-control,.form-floating>.form-control-plaintext{padding:1rem .75rem}.form-floating>.form-control::placeholder,.form-floating>.form-control-plaintext::placeholder{color:rgba(0,0,0,0)}.form-floating>.form-control:focus,.form-floating>.form-control:not(:placeholder-shown),.form-floating>.form-control-plaintext:focus,.form-floating>.form-control-plaintext:not(:placeholder-shown){padding-top:1.625rem;padding-bottom:.625rem}.form-floating>.form-control:-webkit-autofill,.form-floating>.form-control-plaintext:-webkit-autofill{padding-top:1.625rem;padding-bottom:.625rem}.form-floating>.form-select{padding-top:1.625rem;padding-bottom:.625rem}.form-floating>.form-control:focus~label,.form-floating>.form-control:not(:placeholder-shown)~label,.form-floating>.form-control-plaintext~label,.form-floating>.form-select~label{color:rgba(var(--bs-body-color-rgb), 0.65);transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.form-floating>.form-control:focus~label::after,.form-floating>.form-control:not(:placeholder-shown)~label::after,.form-floating>.form-control-plaintext~label::after,.form-floating>.form-select~label::after{position:absolute;inset:1rem .375rem;z-index:-1;height:1.5em;content:\"\";background-color:var(--bs-body-bg);border-radius:var(--bs-border-radius)}.form-floating>.form-control:-webkit-autofill~label{color:rgba(var(--bs-body-color-rgb), 0.65);transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.form-floating>.form-control-plaintext~label{border-width:var(--bs-border-width) 0}.form-floating>:disabled~label,.form-floating>.form-control:disabled~label{color:#6c757d}.form-floating>:disabled~label::after,.form-floating>.form-control:disabled~label::after{background-color:var(--bs-secondary-bg)}.input-group{position:relative;display:flex;flex-wrap:wrap;align-items:stretch;width:100%}.input-group>.form-control,.input-group>.form-select,.input-group>.form-floating{position:relative;flex:1 1 auto;width:1%;min-width:0}.input-group>.form-control:focus,.input-group>.form-select:focus,.input-group>.form-floating:focus-within{z-index:5}.input-group .btn{position:relative;z-index:2}.input-group .btn:focus{z-index:5}.input-group-text{display:flex;align-items:center;padding:.375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:var(--bs-body-color);text-align:center;white-space:nowrap;background-color:var(--bs-tertiary-bg);border:var(--bs-border-width) solid var(--bs-border-color);border-radius:var(--bs-border-radius)}.input-group-lg>.form-control,.input-group-lg>.form-select,.input-group-lg>.input-group-text,.input-group-lg>.btn{padding:.5rem 1rem;font-size:1.25rem;border-radius:var(--bs-border-radius-lg)}.input-group-sm>.form-control,.input-group-sm>.form-select,.input-group-sm>.input-group-text,.input-group-sm>.btn{padding:.25rem .5rem;font-size:0.875rem;border-radius:var(--bs-border-radius-sm)}.input-group-lg>.form-select,.input-group-sm>.form-select{padding-right:3rem}.input-group:not(.has-validation)>:not(:last-child):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating),.input-group:not(.has-validation)>.dropdown-toggle:nth-last-child(n+3),.input-group:not(.has-validation)>.form-floating:not(:last-child)>.form-control,.input-group:not(.has-validation)>.form-floating:not(:last-child)>.form-select{border-top-right-radius:0;border-bottom-right-radius:0}.input-group.has-validation>:nth-last-child(n+3):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating),.input-group.has-validation>.dropdown-toggle:nth-last-child(n+4),.input-group.has-validation>.form-floating:nth-last-child(n+3)>.form-control,.input-group.has-validation>.form-floating:nth-last-child(n+3)>.form-select{border-top-right-radius:0;border-bottom-right-radius:0}.input-group>:not(:first-child):not(.dropdown-menu):not(.valid-tooltip):not(.valid-feedback):not(.invalid-tooltip):not(.invalid-feedback){margin-left:calc(var(--bs-border-width)*-1);border-top-left-radius:0;border-bottom-left-radius:0}.input-group>.form-floating:not(:first-child)>.form-control,.input-group>.form-floating:not(:first-child)>.form-select{border-top-left-radius:0;border-bottom-left-radius:0}.valid-feedback{display:none;width:100%;margin-top:.25rem;font-size:0.875em;color:var(--bs-form-valid-color)}.valid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:0.875rem;color:#fff;background-color:var(--bs-success);border-radius:var(--bs-border-radius)}.was-validated :valid~.valid-feedback,.was-validated :valid~.valid-tooltip,.is-valid~.valid-feedback,.is-valid~.valid-tooltip{display:block}.was-validated .form-control:valid,.form-control.is-valid{border-color:var(--bs-form-valid-border-color);padding-right:calc(1.5em + 0.75rem);background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%23198754' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e\");background-repeat:no-repeat;background-position:right calc(0.375em + 0.1875rem) center;background-size:calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .form-control:valid:focus,.form-control.is-valid:focus{border-color:var(--bs-form-valid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb), 0.25)}.was-validated textarea.form-control:valid,textarea.form-control.is-valid{padding-right:calc(1.5em + 0.75rem);background-position:top calc(0.375em + 0.1875rem) right calc(0.375em + 0.1875rem)}.was-validated .form-select:valid,.form-select.is-valid{border-color:var(--bs-form-valid-border-color)}.was-validated .form-select:valid:not([multiple]):not([size]),.was-validated .form-select:valid:not([multiple])[size=\"1\"],.form-select.is-valid:not([multiple]):not([size]),.form-select.is-valid:not([multiple])[size=\"1\"]{--bs-form-select-bg-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%23198754' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e\");padding-right:4.125rem;background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .form-select:valid:focus,.form-select.is-valid:focus{border-color:var(--bs-form-valid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb), 0.25)}.was-validated .form-control-color:valid,.form-control-color.is-valid{width:calc(3rem + calc(1.5em + 0.75rem))}.was-validated .form-check-input:valid,.form-check-input.is-valid{border-color:var(--bs-form-valid-border-color)}.was-validated .form-check-input:valid:checked,.form-check-input.is-valid:checked{background-color:var(--bs-form-valid-color)}.was-validated .form-check-input:valid:focus,.form-check-input.is-valid:focus{box-shadow:0 0 0 .25rem rgba(var(--bs-success-rgb), 0.25)}.was-validated .form-check-input:valid~.form-check-label,.form-check-input.is-valid~.form-check-label{color:var(--bs-form-valid-color)}.form-check-inline .form-check-input~.valid-feedback{margin-left:.5em}.was-validated .input-group>.form-control:not(:focus):valid,.input-group>.form-control:not(:focus).is-valid,.was-validated .input-group>.form-select:not(:focus):valid,.input-group>.form-select:not(:focus).is-valid,.was-validated .input-group>.form-floating:not(:focus-within):valid,.input-group>.form-floating:not(:focus-within).is-valid{z-index:3}.invalid-feedback{display:none;width:100%;margin-top:.25rem;font-size:0.875em;color:var(--bs-form-invalid-color)}.invalid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:0.875rem;color:#fff;background-color:var(--bs-danger);border-radius:var(--bs-border-radius)}.was-validated :invalid~.invalid-feedback,.was-validated :invalid~.invalid-tooltip,.is-invalid~.invalid-feedback,.is-invalid~.invalid-tooltip{display:block}.was-validated .form-control:invalid,.form-control.is-invalid{border-color:var(--bs-form-invalid-border-color);padding-right:calc(1.5em + 0.75rem);background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='%23dc3545'%3e%3ccircle cx='6' cy='6' r='4.5'/%3e%3cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3e%3ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3e%3c/svg%3e\");background-repeat:no-repeat;background-position:right calc(0.375em + 0.1875rem) center;background-size:calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .form-control:invalid:focus,.form-control.is-invalid:focus{border-color:var(--bs-form-invalid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb), 0.25)}.was-validated textarea.form-control:invalid,textarea.form-control.is-invalid{padding-right:calc(1.5em + 0.75rem);background-position:top calc(0.375em + 0.1875rem) right calc(0.375em + 0.1875rem)}.was-validated .form-select:invalid,.form-select.is-invalid{border-color:var(--bs-form-invalid-border-color)}.was-validated .form-select:invalid:not([multiple]):not([size]),.was-validated .form-select:invalid:not([multiple])[size=\"1\"],.form-select.is-invalid:not([multiple]):not([size]),.form-select.is-invalid:not([multiple])[size=\"1\"]{--bs-form-select-bg-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='%23dc3545'%3e%3ccircle cx='6' cy='6' r='4.5'/%3e%3cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3e%3ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3e%3c/svg%3e\");padding-right:4.125rem;background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .form-select:invalid:focus,.form-select.is-invalid:focus{border-color:var(--bs-form-invalid-border-color);box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb), 0.25)}.was-validated .form-control-color:invalid,.form-control-color.is-invalid{width:calc(3rem + calc(1.5em + 0.75rem))}.was-validated .form-check-input:invalid,.form-check-input.is-invalid{border-color:var(--bs-form-invalid-border-color)}.was-validated .form-check-input:invalid:checked,.form-check-input.is-invalid:checked{background-color:var(--bs-form-invalid-color)}.was-validated .form-check-input:invalid:focus,.form-check-input.is-invalid:focus{box-shadow:0 0 0 .25rem rgba(var(--bs-danger-rgb), 0.25)}.was-validated .form-check-input:invalid~.form-check-label,.form-check-input.is-invalid~.form-check-label{color:var(--bs-form-invalid-color)}.form-check-inline .form-check-input~.invalid-feedback{margin-left:.5em}.was-validated .input-group>.form-control:not(:focus):invalid,.input-group>.form-control:not(:focus).is-invalid,.was-validated .input-group>.form-select:not(:focus):invalid,.input-group>.form-select:not(:focus).is-invalid,.was-validated .input-group>.form-floating:not(:focus-within):invalid,.input-group>.form-floating:not(:focus-within).is-invalid{z-index:4}.btn{--bs-btn-padding-x: 0.75rem;--bs-btn-padding-y: 0.375rem;--bs-btn-font-family: ;--bs-btn-font-size:1rem;--bs-btn-font-weight: 400;--bs-btn-line-height: 1.5;--bs-btn-color: var(--bs-body-color);--bs-btn-bg: transparent;--bs-btn-border-width: var(--bs-border-width);--bs-btn-border-color: transparent;--bs-btn-border-radius: var(--bs-border-radius);--bs-btn-hover-border-color: transparent;--bs-btn-box-shadow: inset 0 1px 0 rgba(255, 255, 255, 0.15), 0 1px 1px rgba(0, 0, 0, 0.075);--bs-btn-disabled-opacity: 0.65;--bs-btn-focus-box-shadow: 0 0 0 0.25rem rgba(var(--bs-btn-focus-shadow-rgb), .5);display:inline-block;padding:var(--bs-btn-padding-y) var(--bs-btn-padding-x);font-family:var(--bs-btn-font-family);font-size:var(--bs-btn-font-size);font-weight:var(--bs-btn-font-weight);line-height:var(--bs-btn-line-height);color:var(--bs-btn-color);text-align:center;text-decoration:none;vertical-align:middle;cursor:pointer;user-select:none;border:var(--bs-btn-border-width) solid var(--bs-btn-border-color);border-radius:var(--bs-btn-border-radius);background-color:var(--bs-btn-bg);transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.btn{transition:none}}.btn:hover{color:var(--bs-btn-hover-color);background-color:var(--bs-btn-hover-bg);border-color:var(--bs-btn-hover-border-color)}.btn-check+.btn:hover{color:var(--bs-btn-color);background-color:var(--bs-btn-bg);border-color:var(--bs-btn-border-color)}.btn:focus-visible{color:var(--bs-btn-hover-color);background-color:var(--bs-btn-hover-bg);border-color:var(--bs-btn-hover-border-color);outline:0;box-shadow:var(--bs-btn-focus-box-shadow)}.btn-check:focus-visible+.btn{border-color:var(--bs-btn-hover-border-color);outline:0;box-shadow:var(--bs-btn-focus-box-shadow)}.btn-check:checked+.btn,:not(.btn-check)+.btn:active,.btn:first-child:active,.btn.active,.btn.show{color:var(--bs-btn-active-color);background-color:var(--bs-btn-active-bg);border-color:var(--bs-btn-active-border-color)}.btn-check:checked+.btn:focus-visible,:not(.btn-check)+.btn:active:focus-visible,.btn:first-child:active:focus-visible,.btn.active:focus-visible,.btn.show:focus-visible{box-shadow:var(--bs-btn-focus-box-shadow)}.btn:disabled,.btn.disabled,fieldset:disabled .btn{color:var(--bs-btn-disabled-color);pointer-events:none;background-color:var(--bs-btn-disabled-bg);border-color:var(--bs-btn-disabled-border-color);opacity:var(--bs-btn-disabled-opacity)}.btn-primary{--bs-btn-color: #fff;--bs-btn-bg: #0d6efd;--bs-btn-border-color: #0d6efd;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #0b5ed7;--bs-btn-hover-border-color: #0a58ca;--bs-btn-focus-shadow-rgb: 49, 132, 253;--bs-btn-active-color: #fff;--bs-btn-active-bg: #0a58ca;--bs-btn-active-border-color: #0a53be;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #fff;--bs-btn-disabled-bg: #0d6efd;--bs-btn-disabled-border-color: #0d6efd}.btn-secondary{--bs-btn-color: #fff;--bs-btn-bg: #6c757d;--bs-btn-border-color: #6c757d;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #5c636a;--bs-btn-hover-border-color: #565e64;--bs-btn-focus-shadow-rgb: 130, 138, 145;--bs-btn-active-color: #fff;--bs-btn-active-bg: #565e64;--bs-btn-active-border-color: #51585e;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #fff;--bs-btn-disabled-bg: #6c757d;--bs-btn-disabled-border-color: #6c757d}.btn-success{--bs-btn-color: #fff;--bs-btn-bg: #198754;--bs-btn-border-color: #198754;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #157347;--bs-btn-hover-border-color: #146c43;--bs-btn-focus-shadow-rgb: 60, 153, 110;--bs-btn-active-color: #fff;--bs-btn-active-bg: #146c43;--bs-btn-active-border-color: #13653f;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #fff;--bs-btn-disabled-bg: #198754;--bs-btn-disabled-border-color: #198754}.btn-info{--bs-btn-color: #000;--bs-btn-bg: #0dcaf0;--bs-btn-border-color: #0dcaf0;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #31d2f2;--bs-btn-hover-border-color: #25cff2;--bs-btn-focus-shadow-rgb: 11, 172, 204;--bs-btn-active-color: #000;--bs-btn-active-bg: #3dd5f3;--bs-btn-active-border-color: #25cff2;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #000;--bs-btn-disabled-bg: #0dcaf0;--bs-btn-disabled-border-color: #0dcaf0}.btn-warning{--bs-btn-color: #000;--bs-btn-bg: #ffc107;--bs-btn-border-color: #ffc107;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #ffca2c;--bs-btn-hover-border-color: #ffc720;--bs-btn-focus-shadow-rgb: 217, 164, 6;--bs-btn-active-color: #000;--bs-btn-active-bg: #ffcd39;--bs-btn-active-border-color: #ffc720;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #000;--bs-btn-disabled-bg: #ffc107;--bs-btn-disabled-border-color: #ffc107}.btn-danger{--bs-btn-color: #fff;--bs-btn-bg: #dc3545;--bs-btn-border-color: #dc3545;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #bb2d3b;--bs-btn-hover-border-color: #b02a37;--bs-btn-focus-shadow-rgb: 225, 83, 97;--bs-btn-active-color: #fff;--bs-btn-active-bg: #b02a37;--bs-btn-active-border-color: #a52834;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #fff;--bs-btn-disabled-bg: #dc3545;--bs-btn-disabled-border-color: #dc3545}.btn-light{--bs-btn-color: #000;--bs-btn-bg: #f8f9fa;--bs-btn-border-color: #f8f9fa;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #d3d4d5;--bs-btn-hover-border-color: #c6c7c8;--bs-btn-focus-shadow-rgb: 211, 212, 213;--bs-btn-active-color: #000;--bs-btn-active-bg: #c6c7c8;--bs-btn-active-border-color: #babbbc;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #000;--bs-btn-disabled-bg: #f8f9fa;--bs-btn-disabled-border-color: #f8f9fa}.btn-dark{--bs-btn-color: #fff;--bs-btn-bg: #212529;--bs-btn-border-color: #212529;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #424649;--bs-btn-hover-border-color: #373b3e;--bs-btn-focus-shadow-rgb: 66, 70, 73;--bs-btn-active-color: #fff;--bs-btn-active-bg: #4d5154;--bs-btn-active-border-color: #373b3e;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #fff;--bs-btn-disabled-bg: #212529;--bs-btn-disabled-border-color: #212529}.btn-outline-primary{--bs-btn-color: #0d6efd;--bs-btn-border-color: #0d6efd;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #0d6efd;--bs-btn-hover-border-color: #0d6efd;--bs-btn-focus-shadow-rgb: 13, 110, 253;--bs-btn-active-color: #fff;--bs-btn-active-bg: #0d6efd;--bs-btn-active-border-color: #0d6efd;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #0d6efd;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #0d6efd;--bs-gradient: none}.btn-outline-secondary{--bs-btn-color: #6c757d;--bs-btn-border-color: #6c757d;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #6c757d;--bs-btn-hover-border-color: #6c757d;--bs-btn-focus-shadow-rgb: 108, 117, 125;--bs-btn-active-color: #fff;--bs-btn-active-bg: #6c757d;--bs-btn-active-border-color: #6c757d;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #6c757d;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #6c757d;--bs-gradient: none}.btn-outline-success{--bs-btn-color: #198754;--bs-btn-border-color: #198754;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #198754;--bs-btn-hover-border-color: #198754;--bs-btn-focus-shadow-rgb: 25, 135, 84;--bs-btn-active-color: #fff;--bs-btn-active-bg: #198754;--bs-btn-active-border-color: #198754;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #198754;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #198754;--bs-gradient: none}.btn-outline-info{--bs-btn-color: #0dcaf0;--bs-btn-border-color: #0dcaf0;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #0dcaf0;--bs-btn-hover-border-color: #0dcaf0;--bs-btn-focus-shadow-rgb: 13, 202, 240;--bs-btn-active-color: #000;--bs-btn-active-bg: #0dcaf0;--bs-btn-active-border-color: #0dcaf0;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #0dcaf0;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #0dcaf0;--bs-gradient: none}.btn-outline-warning{--bs-btn-color: #ffc107;--bs-btn-border-color: #ffc107;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #ffc107;--bs-btn-hover-border-color: #ffc107;--bs-btn-focus-shadow-rgb: 255, 193, 7;--bs-btn-active-color: #000;--bs-btn-active-bg: #ffc107;--bs-btn-active-border-color: #ffc107;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #ffc107;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #ffc107;--bs-gradient: none}.btn-outline-danger{--bs-btn-color: #dc3545;--bs-btn-border-color: #dc3545;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #dc3545;--bs-btn-hover-border-color: #dc3545;--bs-btn-focus-shadow-rgb: 220, 53, 69;--bs-btn-active-color: #fff;--bs-btn-active-bg: #dc3545;--bs-btn-active-border-color: #dc3545;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #dc3545;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #dc3545;--bs-gradient: none}.btn-outline-light{--bs-btn-color: #f8f9fa;--bs-btn-border-color: #f8f9fa;--bs-btn-hover-color: #000;--bs-btn-hover-bg: #f8f9fa;--bs-btn-hover-border-color: #f8f9fa;--bs-btn-focus-shadow-rgb: 248, 249, 250;--bs-btn-active-color: #000;--bs-btn-active-bg: #f8f9fa;--bs-btn-active-border-color: #f8f9fa;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #f8f9fa;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #f8f9fa;--bs-gradient: none}.btn-outline-dark{--bs-btn-color: #212529;--bs-btn-border-color: #212529;--bs-btn-hover-color: #fff;--bs-btn-hover-bg: #212529;--bs-btn-hover-border-color: #212529;--bs-btn-focus-shadow-rgb: 33, 37, 41;--bs-btn-active-color: #fff;--bs-btn-active-bg: #212529;--bs-btn-active-border-color: #212529;--bs-btn-active-shadow: inset 0 3px 5px rgba(0, 0, 0, 0.125);--bs-btn-disabled-color: #212529;--bs-btn-disabled-bg: transparent;--bs-btn-disabled-border-color: #212529;--bs-gradient: none}.btn-link{--bs-btn-font-weight: 400;--bs-btn-color: var(--bs-link-color);--bs-btn-bg: transparent;--bs-btn-border-color: transparent;--bs-btn-hover-color: var(--bs-link-hover-color);--bs-btn-hover-border-color: transparent;--bs-btn-active-color: var(--bs-link-hover-color);--bs-btn-active-border-color: transparent;--bs-btn-disabled-color: #6c757d;--bs-btn-disabled-border-color: transparent;--bs-btn-box-shadow: 0 0 0 #000;--bs-btn-focus-shadow-rgb: 49, 132, 253;text-decoration:underline}.btn-link:focus-visible{color:var(--bs-btn-color)}.btn-link:hover{color:var(--bs-btn-hover-color)}.btn-lg,.btn-group-lg>.btn{--bs-btn-padding-y: 0.5rem;--bs-btn-padding-x: 1rem;--bs-btn-font-size:1.25rem;--bs-btn-border-radius: var(--bs-border-radius-lg)}.btn-sm,.btn-group-sm>.btn{--bs-btn-padding-y: 0.25rem;--bs-btn-padding-x: 0.5rem;--bs-btn-font-size:0.875rem;--bs-btn-border-radius: var(--bs-border-radius-sm)}.fade{transition:opacity .15s linear}@media(prefers-reduced-motion: reduce){.fade{transition:none}}.fade:not(.show){opacity:0}.collapse:not(.show){display:none}.collapsing{height:0;overflow:hidden;transition:height .35s ease}@media(prefers-reduced-motion: reduce){.collapsing{transition:none}}.collapsing.collapse-horizontal{width:0;height:auto;transition:width .35s ease}@media(prefers-reduced-motion: reduce){.collapsing.collapse-horizontal{transition:none}}.dropup,.dropend,.dropdown,.dropstart,.dropup-center,.dropdown-center{position:relative}.dropdown-toggle{white-space:nowrap}.dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:\"\";border-top:.3em solid;border-right:.3em solid rgba(0,0,0,0);border-bottom:0;border-left:.3em solid rgba(0,0,0,0)}.dropdown-toggle:empty::after{margin-left:0}.dropdown-menu{--bs-dropdown-zindex: 1000;--bs-dropdown-min-width: 10rem;--bs-dropdown-padding-x: 0;--bs-dropdown-padding-y: 0.5rem;--bs-dropdown-spacer: 0.125rem;--bs-dropdown-font-size:1rem;--bs-dropdown-color: var(--bs-body-color);--bs-dropdown-bg: var(--bs-body-bg);--bs-dropdown-border-color: var(--bs-border-color-translucent);--bs-dropdown-border-radius: var(--bs-border-radius);--bs-dropdown-border-width: var(--bs-border-width);--bs-dropdown-inner-border-radius: calc(var(--bs-border-radius) - var(--bs-border-width));--bs-dropdown-divider-bg: var(--bs-border-color-translucent);--bs-dropdown-divider-margin-y: 0.5rem;--bs-dropdown-box-shadow: var(--bs-box-shadow);--bs-dropdown-link-color: var(--bs-body-color);--bs-dropdown-link-hover-color: var(--bs-body-color);--bs-dropdown-link-hover-bg: var(--pst-color-surface);--bs-dropdown-link-active-color: #fff;--bs-dropdown-link-active-bg: var(--pst-color-surface);--bs-dropdown-link-disabled-color: var(--bs-tertiary-color);--bs-dropdown-item-padding-x: 1rem;--bs-dropdown-item-padding-y: 0.25rem;--bs-dropdown-header-color: #6c757d;--bs-dropdown-header-padding-x: 1rem;--bs-dropdown-header-padding-y: 0.5rem;position:absolute;z-index:var(--bs-dropdown-zindex);display:none;min-width:var(--bs-dropdown-min-width);padding:var(--bs-dropdown-padding-y) var(--bs-dropdown-padding-x);margin:0;font-size:var(--bs-dropdown-font-size);color:var(--bs-dropdown-color);text-align:left;list-style:none;background-color:var(--bs-dropdown-bg);background-clip:padding-box;border:var(--bs-dropdown-border-width) solid var(--bs-dropdown-border-color);border-radius:var(--bs-dropdown-border-radius)}.dropdown-menu[data-bs-popper]{top:100%;left:0;margin-top:var(--bs-dropdown-spacer)}.dropdown-menu-start{--bs-position: start}.dropdown-menu-start[data-bs-popper]{right:auto;left:0}.dropdown-menu-end{--bs-position: end}.dropdown-menu-end[data-bs-popper]{right:0;left:auto}@media(min-width: 540px){.dropdown-menu-sm-start{--bs-position: start}.dropdown-menu-sm-start[data-bs-popper]{right:auto;left:0}.dropdown-menu-sm-end{--bs-position: end}.dropdown-menu-sm-end[data-bs-popper]{right:0;left:auto}}@media(min-width: 720px){.dropdown-menu-md-start{--bs-position: start}.dropdown-menu-md-start[data-bs-popper]{right:auto;left:0}.dropdown-menu-md-end{--bs-position: end}.dropdown-menu-md-end[data-bs-popper]{right:0;left:auto}}@media(min-width: 960px){.dropdown-menu-lg-start{--bs-position: start}.dropdown-menu-lg-start[data-bs-popper]{right:auto;left:0}.dropdown-menu-lg-end{--bs-position: end}.dropdown-menu-lg-end[data-bs-popper]{right:0;left:auto}}@media(min-width: 1200px){.dropdown-menu-xl-start{--bs-position: start}.dropdown-menu-xl-start[data-bs-popper]{right:auto;left:0}.dropdown-menu-xl-end{--bs-position: end}.dropdown-menu-xl-end[data-bs-popper]{right:0;left:auto}}.dropup .dropdown-menu[data-bs-popper]{top:auto;bottom:100%;margin-top:0;margin-bottom:var(--bs-dropdown-spacer)}.dropup .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:\"\";border-top:0;border-right:.3em solid rgba(0,0,0,0);border-bottom:.3em solid;border-left:.3em solid rgba(0,0,0,0)}.dropup .dropdown-toggle:empty::after{margin-left:0}.dropend .dropdown-menu[data-bs-popper]{top:0;right:auto;left:100%;margin-top:0;margin-left:var(--bs-dropdown-spacer)}.dropend .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:\"\";border-top:.3em solid rgba(0,0,0,0);border-right:0;border-bottom:.3em solid rgba(0,0,0,0);border-left:.3em solid}.dropend .dropdown-toggle:empty::after{margin-left:0}.dropend .dropdown-toggle::after{vertical-align:0}.dropstart .dropdown-menu[data-bs-popper]{top:0;right:100%;left:auto;margin-top:0;margin-right:var(--bs-dropdown-spacer)}.dropstart .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:\"\"}.dropstart .dropdown-toggle::after{display:none}.dropstart .dropdown-toggle::before{display:inline-block;margin-right:.255em;vertical-align:.255em;content:\"\";border-top:.3em solid rgba(0,0,0,0);border-right:.3em solid;border-bottom:.3em solid rgba(0,0,0,0)}.dropstart .dropdown-toggle:empty::after{margin-left:0}.dropstart .dropdown-toggle::before{vertical-align:0}.dropdown-divider{height:0;margin:var(--bs-dropdown-divider-margin-y) 0;overflow:hidden;border-top:1px solid var(--bs-dropdown-divider-bg);opacity:1}.dropdown-item{display:block;width:100%;padding:var(--bs-dropdown-item-padding-y) var(--bs-dropdown-item-padding-x);clear:both;font-weight:400;color:var(--bs-dropdown-link-color);text-align:inherit;text-decoration:none;white-space:nowrap;background-color:rgba(0,0,0,0);border:0;border-radius:var(--bs-dropdown-item-border-radius, 0)}.dropdown-item:hover,.dropdown-item:focus{color:var(--bs-dropdown-link-hover-color);background-color:var(--bs-dropdown-link-hover-bg)}.dropdown-item.active,.dropdown-item:active{color:var(--bs-dropdown-link-active-color);text-decoration:none;background-color:var(--bs-dropdown-link-active-bg)}.dropdown-item.disabled,.dropdown-item:disabled{color:var(--bs-dropdown-link-disabled-color);pointer-events:none;background-color:rgba(0,0,0,0)}.dropdown-menu.show{display:block}.dropdown-header{display:block;padding:var(--bs-dropdown-header-padding-y) var(--bs-dropdown-header-padding-x);margin-bottom:0;font-size:0.875rem;color:var(--bs-dropdown-header-color);white-space:nowrap}.dropdown-item-text{display:block;padding:var(--bs-dropdown-item-padding-y) var(--bs-dropdown-item-padding-x);color:var(--bs-dropdown-link-color)}.dropdown-menu-dark{--bs-dropdown-color: #dee2e6;--bs-dropdown-bg: #343a40;--bs-dropdown-border-color: var(--bs-border-color-translucent);--bs-dropdown-box-shadow: ;--bs-dropdown-link-color: #dee2e6;--bs-dropdown-link-hover-color: #fff;--bs-dropdown-divider-bg: var(--bs-border-color-translucent);--bs-dropdown-link-hover-bg: var(--pst-color-surface);--bs-dropdown-link-active-color: #fff;--bs-dropdown-link-active-bg: var(--pst-color-surface);--bs-dropdown-link-disabled-color: #adb5bd;--bs-dropdown-header-color: #adb5bd}.btn-group,.btn-group-vertical{position:relative;display:inline-flex;vertical-align:middle}.btn-group>.btn,.btn-group-vertical>.btn{position:relative;flex:1 1 auto}.btn-group>.btn-check:checked+.btn,.btn-group>.btn-check:focus+.btn,.btn-group>.btn:hover,.btn-group>.btn:focus,.btn-group>.btn:active,.btn-group>.btn.active,.btn-group-vertical>.btn-check:checked+.btn,.btn-group-vertical>.btn-check:focus+.btn,.btn-group-vertical>.btn:hover,.btn-group-vertical>.btn:focus,.btn-group-vertical>.btn:active,.btn-group-vertical>.btn.active{z-index:1}.btn-toolbar{display:flex;flex-wrap:wrap;justify-content:flex-start}.btn-toolbar .input-group{width:auto}.btn-group{border-radius:var(--bs-border-radius)}.btn-group>:not(.btn-check:first-child)+.btn,.btn-group>.btn-group:not(:first-child){margin-left:calc(var(--bs-border-width)*-1)}.btn-group>.btn:not(:last-child):not(.dropdown-toggle),.btn-group>.btn.dropdown-toggle-split:first-child,.btn-group>.btn-group:not(:last-child)>.btn{border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn:nth-child(n+3),.btn-group>:not(.btn-check)+.btn,.btn-group>.btn-group:not(:first-child)>.btn{border-top-left-radius:0;border-bottom-left-radius:0}.dropdown-toggle-split{padding-right:.5625rem;padding-left:.5625rem}.dropdown-toggle-split::after,.dropup .dropdown-toggle-split::after,.dropend .dropdown-toggle-split::after{margin-left:0}.dropstart .dropdown-toggle-split::before{margin-right:0}.btn-sm+.dropdown-toggle-split,.btn-group-sm>.btn+.dropdown-toggle-split{padding-right:.375rem;padding-left:.375rem}.btn-lg+.dropdown-toggle-split,.btn-group-lg>.btn+.dropdown-toggle-split{padding-right:.75rem;padding-left:.75rem}.btn-group-vertical{flex-direction:column;align-items:flex-start;justify-content:center}.btn-group-vertical>.btn,.btn-group-vertical>.btn-group{width:100%}.btn-group-vertical>.btn:not(:first-child),.btn-group-vertical>.btn-group:not(:first-child){margin-top:calc(var(--bs-border-width)*-1)}.btn-group-vertical>.btn:not(:last-child):not(.dropdown-toggle),.btn-group-vertical>.btn-group:not(:last-child)>.btn{border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn~.btn,.btn-group-vertical>.btn-group:not(:first-child)>.btn{border-top-left-radius:0;border-top-right-radius:0}.nav{--bs-nav-link-padding-x: 1rem;--bs-nav-link-padding-y: 0.5rem;--bs-nav-link-font-weight: ;--bs-nav-link-color: var(--bs-link-color);--bs-nav-link-hover-color: var(--bs-link-hover-color);--bs-nav-link-disabled-color: var(--bs-secondary-color);display:flex;flex-wrap:wrap;padding-left:0;margin-bottom:0;list-style:none}.nav-link{display:block;padding:var(--bs-nav-link-padding-y) var(--bs-nav-link-padding-x);font-size:var(--bs-nav-link-font-size);font-weight:var(--bs-nav-link-font-weight);color:var(--bs-nav-link-color);text-decoration:none;background:none;border:0;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out}@media(prefers-reduced-motion: reduce){.nav-link{transition:none}}.nav-link:hover,.nav-link:focus{color:var(--bs-nav-link-hover-color)}.nav-link:focus-visible{outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.nav-link.disabled,.nav-link:disabled{color:var(--bs-nav-link-disabled-color);pointer-events:none;cursor:default}.nav-tabs{--bs-nav-tabs-border-width: var(--bs-border-width);--bs-nav-tabs-border-color: var(--bs-border-color);--bs-nav-tabs-border-radius: var(--bs-border-radius);--bs-nav-tabs-link-hover-border-color: var(--bs-secondary-bg) var(--bs-secondary-bg) var(--bs-border-color);--bs-nav-tabs-link-active-color: var(--bs-emphasis-color);--bs-nav-tabs-link-active-bg: var(--bs-body-bg);--bs-nav-tabs-link-active-border-color: var(--bs-border-color) var(--bs-border-color) var(--bs-body-bg);border-bottom:var(--bs-nav-tabs-border-width) solid var(--bs-nav-tabs-border-color)}.nav-tabs .nav-link{margin-bottom:calc(-1*var(--bs-nav-tabs-border-width));border:var(--bs-nav-tabs-border-width) solid rgba(0,0,0,0);border-top-left-radius:var(--bs-nav-tabs-border-radius);border-top-right-radius:var(--bs-nav-tabs-border-radius)}.nav-tabs .nav-link:hover,.nav-tabs .nav-link:focus{isolation:isolate;border-color:var(--bs-nav-tabs-link-hover-border-color)}.nav-tabs .nav-link.active,.nav-tabs .nav-item.show .nav-link{color:var(--bs-nav-tabs-link-active-color);background-color:var(--bs-nav-tabs-link-active-bg);border-color:var(--bs-nav-tabs-link-active-border-color)}.nav-tabs .dropdown-menu{margin-top:calc(-1*var(--bs-nav-tabs-border-width));border-top-left-radius:0;border-top-right-radius:0}.nav-pills{--bs-nav-pills-border-radius: var(--bs-border-radius);--bs-nav-pills-link-active-color: #fff;--bs-nav-pills-link-active-bg: #0d6efd}.nav-pills .nav-link{border-radius:var(--bs-nav-pills-border-radius)}.nav-pills .nav-link.active,.nav-pills .show>.nav-link{color:var(--bs-nav-pills-link-active-color);background-color:var(--bs-nav-pills-link-active-bg)}.nav-underline{--bs-nav-underline-gap: 1rem;--bs-nav-underline-border-width: 0.125rem;--bs-nav-underline-link-active-color: var(--bs-emphasis-color);gap:var(--bs-nav-underline-gap)}.nav-underline .nav-link{padding-right:0;padding-left:0;border-bottom:var(--bs-nav-underline-border-width) solid rgba(0,0,0,0)}.nav-underline .nav-link:hover,.nav-underline .nav-link:focus{border-bottom-color:currentcolor}.nav-underline .nav-link.active,.nav-underline .show>.nav-link{font-weight:700;color:var(--bs-nav-underline-link-active-color);border-bottom-color:currentcolor}.nav-fill>.nav-link,.nav-fill .nav-item{flex:1 1 auto;text-align:center}.nav-justified>.nav-link,.nav-justified .nav-item{flex-basis:0;flex-grow:1;text-align:center}.nav-fill .nav-item .nav-link,.nav-justified .nav-item .nav-link{width:100%}.tab-content>.tab-pane{display:none}.tab-content>.active{display:block}.navbar{--bs-navbar-padding-x: 0;--bs-navbar-padding-y: 0.5rem;--bs-navbar-color: rgba(var(--bs-emphasis-color-rgb), 0.65);--bs-navbar-hover-color: rgba(var(--bs-emphasis-color-rgb), 0.8);--bs-navbar-disabled-color: rgba(var(--bs-emphasis-color-rgb), 0.3);--bs-navbar-active-color: rgba(var(--bs-emphasis-color-rgb), 1);--bs-navbar-brand-padding-y: 0.3125rem;--bs-navbar-brand-margin-end: 1rem;--bs-navbar-brand-font-size: 1.25rem;--bs-navbar-brand-color: rgba(var(--bs-emphasis-color-rgb), 1);--bs-navbar-brand-hover-color: rgba(var(--bs-emphasis-color-rgb), 1);--bs-navbar-nav-link-padding-x: 0.5rem;--bs-navbar-toggler-padding-y: 0.25rem;--bs-navbar-toggler-padding-x: 0.75rem;--bs-navbar-toggler-font-size: 1.25rem;--bs-navbar-toggler-icon-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'%3e%3cpath stroke='rgba%2833, 37, 41, 0.75%29' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/%3e%3c/svg%3e\");--bs-navbar-toggler-border-color: rgba(var(--bs-emphasis-color-rgb), 0.15);--bs-navbar-toggler-border-radius: var(--bs-border-radius);--bs-navbar-toggler-focus-width: 0.25rem;--bs-navbar-toggler-transition: box-shadow 0.15s ease-in-out;position:relative;display:flex;flex-wrap:wrap;align-items:center;justify-content:space-between;padding:var(--bs-navbar-padding-y) var(--bs-navbar-padding-x)}.navbar>.container,.navbar>.container-fluid,.navbar>.container-sm,.navbar>.container-md,.navbar>.container-lg,.navbar>.container-xl{display:flex;flex-wrap:inherit;align-items:center;justify-content:space-between}.navbar-brand{padding-top:var(--bs-navbar-brand-padding-y);padding-bottom:var(--bs-navbar-brand-padding-y);margin-right:var(--bs-navbar-brand-margin-end);font-size:var(--bs-navbar-brand-font-size);color:var(--bs-navbar-brand-color);text-decoration:none;white-space:nowrap}.navbar-brand:hover,.navbar-brand:focus{color:var(--bs-navbar-brand-hover-color)}.navbar-nav{--bs-nav-link-padding-x: 0;--bs-nav-link-padding-y: 0.5rem;--bs-nav-link-font-weight: ;--bs-nav-link-color: var(--bs-navbar-color);--bs-nav-link-hover-color: var(--bs-navbar-hover-color);--bs-nav-link-disabled-color: var(--bs-navbar-disabled-color);display:flex;flex-direction:column;padding-left:0;margin-bottom:0;list-style:none}.navbar-nav .nav-link.active,.navbar-nav .nav-link.show{color:var(--bs-navbar-active-color)}.navbar-nav .dropdown-menu{position:static}.navbar-text{padding-top:.5rem;padding-bottom:.5rem;color:var(--bs-navbar-color)}.navbar-text a,.navbar-text a:hover,.navbar-text a:focus{color:var(--bs-navbar-active-color)}.navbar-collapse{flex-basis:100%;flex-grow:1;align-items:center}.navbar-toggler{padding:var(--bs-navbar-toggler-padding-y) var(--bs-navbar-toggler-padding-x);font-size:var(--bs-navbar-toggler-font-size);line-height:1;color:var(--bs-navbar-color);background-color:rgba(0,0,0,0);border:var(--bs-border-width) solid var(--bs-navbar-toggler-border-color);border-radius:var(--bs-navbar-toggler-border-radius);transition:var(--bs-navbar-toggler-transition)}@media(prefers-reduced-motion: reduce){.navbar-toggler{transition:none}}.navbar-toggler:hover{text-decoration:none}.navbar-toggler:focus{text-decoration:none;outline:0;box-shadow:0 0 0 var(--bs-navbar-toggler-focus-width)}.navbar-toggler-icon{display:inline-block;width:1.5em;height:1.5em;vertical-align:middle;background-image:var(--bs-navbar-toggler-icon-bg);background-repeat:no-repeat;background-position:center;background-size:100%}.navbar-nav-scroll{max-height:var(--bs-scroll-height, 75vh);overflow-y:auto}@media(min-width: 540px){.navbar-expand-sm{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-sm .navbar-nav{flex-direction:row}.navbar-expand-sm .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-sm .navbar-nav .nav-link{padding-right:var(--bs-navbar-nav-link-padding-x);padding-left:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-sm .navbar-nav-scroll{overflow:visible}.navbar-expand-sm .navbar-collapse{display:flex !important;flex-basis:auto}.navbar-expand-sm .navbar-toggler{display:none}.navbar-expand-sm .offcanvas{position:static;z-index:auto;flex-grow:1;width:auto !important;height:auto !important;visibility:visible !important;background-color:rgba(0,0,0,0) !important;border:0 !important;transform:none !important;transition:none}.navbar-expand-sm .offcanvas .offcanvas-header{display:none}.navbar-expand-sm .offcanvas .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible}}@media(min-width: 720px){.navbar-expand-md{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-md .navbar-nav{flex-direction:row}.navbar-expand-md .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-md .navbar-nav .nav-link{padding-right:var(--bs-navbar-nav-link-padding-x);padding-left:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-md .navbar-nav-scroll{overflow:visible}.navbar-expand-md .navbar-collapse{display:flex !important;flex-basis:auto}.navbar-expand-md .navbar-toggler{display:none}.navbar-expand-md .offcanvas{position:static;z-index:auto;flex-grow:1;width:auto !important;height:auto !important;visibility:visible !important;background-color:rgba(0,0,0,0) !important;border:0 !important;transform:none !important;transition:none}.navbar-expand-md .offcanvas .offcanvas-header{display:none}.navbar-expand-md .offcanvas .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible}}@media(min-width: 960px){.navbar-expand-lg{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-lg .navbar-nav{flex-direction:row}.navbar-expand-lg .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-lg .navbar-nav .nav-link{padding-right:var(--bs-navbar-nav-link-padding-x);padding-left:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-lg .navbar-nav-scroll{overflow:visible}.navbar-expand-lg .navbar-collapse{display:flex !important;flex-basis:auto}.navbar-expand-lg .navbar-toggler{display:none}.navbar-expand-lg .offcanvas{position:static;z-index:auto;flex-grow:1;width:auto !important;height:auto !important;visibility:visible !important;background-color:rgba(0,0,0,0) !important;border:0 !important;transform:none !important;transition:none}.navbar-expand-lg .offcanvas .offcanvas-header{display:none}.navbar-expand-lg .offcanvas .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible}}@media(min-width: 1200px){.navbar-expand-xl{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand-xl .navbar-nav{flex-direction:row}.navbar-expand-xl .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-xl .navbar-nav .nav-link{padding-right:var(--bs-navbar-nav-link-padding-x);padding-left:var(--bs-navbar-nav-link-padding-x)}.navbar-expand-xl .navbar-nav-scroll{overflow:visible}.navbar-expand-xl .navbar-collapse{display:flex !important;flex-basis:auto}.navbar-expand-xl .navbar-toggler{display:none}.navbar-expand-xl .offcanvas{position:static;z-index:auto;flex-grow:1;width:auto !important;height:auto !important;visibility:visible !important;background-color:rgba(0,0,0,0) !important;border:0 !important;transform:none !important;transition:none}.navbar-expand-xl .offcanvas .offcanvas-header{display:none}.navbar-expand-xl .offcanvas .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible}}.navbar-expand{flex-wrap:nowrap;justify-content:flex-start}.navbar-expand .navbar-nav{flex-direction:row}.navbar-expand .navbar-nav .dropdown-menu{position:absolute}.navbar-expand .navbar-nav .nav-link{padding-right:var(--bs-navbar-nav-link-padding-x);padding-left:var(--bs-navbar-nav-link-padding-x)}.navbar-expand .navbar-nav-scroll{overflow:visible}.navbar-expand .navbar-collapse{display:flex !important;flex-basis:auto}.navbar-expand .navbar-toggler{display:none}.navbar-expand .offcanvas{position:static;z-index:auto;flex-grow:1;width:auto !important;height:auto !important;visibility:visible !important;background-color:rgba(0,0,0,0) !important;border:0 !important;transform:none !important;transition:none}.navbar-expand .offcanvas .offcanvas-header{display:none}.navbar-expand .offcanvas .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible}.navbar-dark,.navbar[data-bs-theme=dark]{--bs-navbar-color: rgba(255, 255, 255, 0.55);--bs-navbar-hover-color: rgba(255, 255, 255, 0.75);--bs-navbar-disabled-color: rgba(255, 255, 255, 0.25);--bs-navbar-active-color: #fff;--bs-navbar-brand-color: #fff;--bs-navbar-brand-hover-color: #fff;--bs-navbar-toggler-border-color: rgba(255, 255, 255, 0.1);--bs-navbar-toggler-icon-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'%3e%3cpath stroke='rgba%28255, 255, 255, 0.55%29' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/%3e%3c/svg%3e\")}[data-bs-theme=dark] .navbar-toggler-icon{--bs-navbar-toggler-icon-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'%3e%3cpath stroke='rgba%28255, 255, 255, 0.55%29' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/%3e%3c/svg%3e\")}.card{--bs-card-spacer-y: 1rem;--bs-card-spacer-x: 1rem;--bs-card-title-spacer-y: 0.5rem;--bs-card-title-color: ;--bs-card-subtitle-color: ;--bs-card-border-width: var(--bs-border-width);--bs-card-border-color: var(--bs-border-color-translucent);--bs-card-border-radius: var(--bs-border-radius);--bs-card-box-shadow: ;--bs-card-inner-border-radius: calc(var(--bs-border-radius) - (var(--bs-border-width)));--bs-card-cap-padding-y: 0.5rem;--bs-card-cap-padding-x: 1rem;--bs-card-cap-bg: rgba(var(--bs-body-color-rgb), 0.03);--bs-card-cap-color: ;--bs-card-height: ;--bs-card-color: ;--bs-card-bg: var(--bs-body-bg);--bs-card-img-overlay-padding: 1rem;--bs-card-group-margin: 0.75rem;position:relative;display:flex;flex-direction:column;min-width:0;height:var(--bs-card-height);color:var(--bs-body-color);word-wrap:break-word;background-color:var(--bs-card-bg);background-clip:border-box;border:var(--bs-card-border-width) solid var(--bs-card-border-color);border-radius:var(--bs-card-border-radius)}.card>hr{margin-right:0;margin-left:0}.card>.list-group{border-top:inherit;border-bottom:inherit}.card>.list-group:first-child{border-top-width:0;border-top-left-radius:var(--bs-card-inner-border-radius);border-top-right-radius:var(--bs-card-inner-border-radius)}.card>.list-group:last-child{border-bottom-width:0;border-bottom-right-radius:var(--bs-card-inner-border-radius);border-bottom-left-radius:var(--bs-card-inner-border-radius)}.card>.card-header+.list-group,.card>.list-group+.card-footer{border-top:0}.card-body{flex:1 1 auto;padding:var(--bs-card-spacer-y) var(--bs-card-spacer-x);color:var(--bs-card-color)}.card-title{margin-bottom:var(--bs-card-title-spacer-y);color:var(--bs-card-title-color)}.card-subtitle{margin-top:calc(-0.5*var(--bs-card-title-spacer-y));margin-bottom:0;color:var(--bs-card-subtitle-color)}.card-text:last-child{margin-bottom:0}.card-link+.card-link{margin-left:var(--bs-card-spacer-x)}.card-header{padding:var(--bs-card-cap-padding-y) var(--bs-card-cap-padding-x);margin-bottom:0;color:var(--bs-card-cap-color);background-color:var(--bs-card-cap-bg);border-bottom:var(--bs-card-border-width) solid var(--bs-card-border-color)}.card-header:first-child{border-radius:var(--bs-card-inner-border-radius) var(--bs-card-inner-border-radius) 0 0}.card-footer{padding:var(--bs-card-cap-padding-y) var(--bs-card-cap-padding-x);color:var(--bs-card-cap-color);background-color:var(--bs-card-cap-bg);border-top:var(--bs-card-border-width) solid var(--bs-card-border-color)}.card-footer:last-child{border-radius:0 0 var(--bs-card-inner-border-radius) var(--bs-card-inner-border-radius)}.card-header-tabs{margin-right:calc(-0.5*var(--bs-card-cap-padding-x));margin-bottom:calc(-1*var(--bs-card-cap-padding-y));margin-left:calc(-0.5*var(--bs-card-cap-padding-x));border-bottom:0}.card-header-tabs .nav-link.active{background-color:var(--bs-card-bg);border-bottom-color:var(--bs-card-bg)}.card-header-pills{margin-right:calc(-0.5*var(--bs-card-cap-padding-x));margin-left:calc(-0.5*var(--bs-card-cap-padding-x))}.card-img-overlay{position:absolute;top:0;right:0;bottom:0;left:0;padding:var(--bs-card-img-overlay-padding);border-radius:var(--bs-card-inner-border-radius)}.card-img,.card-img-top,.card-img-bottom{width:100%}.card-img,.card-img-top{border-top-left-radius:var(--bs-card-inner-border-radius);border-top-right-radius:var(--bs-card-inner-border-radius)}.card-img,.card-img-bottom{border-bottom-right-radius:var(--bs-card-inner-border-radius);border-bottom-left-radius:var(--bs-card-inner-border-radius)}.card-group>.card{margin-bottom:var(--bs-card-group-margin)}@media(min-width: 540px){.card-group{display:flex;flex-flow:row wrap}.card-group>.card{flex:1 0 0%;margin-bottom:0}.card-group>.card+.card{margin-left:0;border-left:0}.card-group>.card:not(:last-child){border-top-right-radius:0;border-bottom-right-radius:0}.card-group>.card:not(:last-child) .card-img-top,.card-group>.card:not(:last-child) .card-header{border-top-right-radius:0}.card-group>.card:not(:last-child) .card-img-bottom,.card-group>.card:not(:last-child) .card-footer{border-bottom-right-radius:0}.card-group>.card:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.card-group>.card:not(:first-child) .card-img-top,.card-group>.card:not(:first-child) .card-header{border-top-left-radius:0}.card-group>.card:not(:first-child) .card-img-bottom,.card-group>.card:not(:first-child) .card-footer{border-bottom-left-radius:0}}.accordion{--bs-accordion-color: var(--bs-body-color);--bs-accordion-bg: var(--bs-body-bg);--bs-accordion-transition: color 0.15s ease-in-out, background-color 0.15s ease-in-out, border-color 0.15s ease-in-out, box-shadow 0.15s ease-in-out, border-radius 0.15s ease;--bs-accordion-border-color: var(--bs-border-color);--bs-accordion-border-width: var(--bs-border-width);--bs-accordion-border-radius: var(--bs-border-radius);--bs-accordion-inner-border-radius: calc(var(--bs-border-radius) - (var(--bs-border-width)));--bs-accordion-btn-padding-x: 1.25rem;--bs-accordion-btn-padding-y: 1rem;--bs-accordion-btn-color: var(--bs-body-color);--bs-accordion-btn-bg: var(--bs-accordion-bg);--bs-accordion-btn-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23212529'%3e%3cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3e%3c/svg%3e\");--bs-accordion-btn-icon-width: 1.25rem;--bs-accordion-btn-icon-transform: rotate(-180deg);--bs-accordion-btn-icon-transition: transform 0.2s ease-in-out;--bs-accordion-btn-active-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23052c65'%3e%3cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3e%3c/svg%3e\");--bs-accordion-btn-focus-border-color: #86b7fe;--bs-accordion-btn-focus-box-shadow: 0 0 0 0.25rem rgba(13, 110, 253, 0.25);--bs-accordion-body-padding-x: 1.25rem;--bs-accordion-body-padding-y: 1rem;--bs-accordion-active-color: var(--bs-primary-text-emphasis);--bs-accordion-active-bg: var(--bs-primary-bg-subtle)}.accordion-button{position:relative;display:flex;align-items:center;width:100%;padding:var(--bs-accordion-btn-padding-y) var(--bs-accordion-btn-padding-x);font-size:1rem;color:var(--bs-accordion-btn-color);text-align:left;background-color:var(--bs-accordion-btn-bg);border:0;border-radius:0;overflow-anchor:none;transition:var(--bs-accordion-transition)}@media(prefers-reduced-motion: reduce){.accordion-button{transition:none}}.accordion-button:not(.collapsed){color:var(--bs-accordion-active-color);background-color:var(--bs-accordion-active-bg);box-shadow:inset 0 calc(-1*var(--bs-accordion-border-width)) 0 var(--bs-accordion-border-color)}.accordion-button:not(.collapsed)::after{background-image:var(--bs-accordion-btn-active-icon);transform:var(--bs-accordion-btn-icon-transform)}.accordion-button::after{flex-shrink:0;width:var(--bs-accordion-btn-icon-width);height:var(--bs-accordion-btn-icon-width);margin-left:auto;content:\"\";background-image:var(--bs-accordion-btn-icon);background-repeat:no-repeat;background-size:var(--bs-accordion-btn-icon-width);transition:var(--bs-accordion-btn-icon-transition)}@media(prefers-reduced-motion: reduce){.accordion-button::after{transition:none}}.accordion-button:hover{z-index:2}.accordion-button:focus{z-index:3;border-color:var(--bs-accordion-btn-focus-border-color);outline:0;box-shadow:var(--bs-accordion-btn-focus-box-shadow)}.accordion-header{margin-bottom:0}.accordion-item{color:var(--bs-accordion-color);background-color:var(--bs-accordion-bg);border:var(--bs-accordion-border-width) solid var(--bs-accordion-border-color)}.accordion-item:first-of-type{border-top-left-radius:var(--bs-accordion-border-radius);border-top-right-radius:var(--bs-accordion-border-radius)}.accordion-item:first-of-type .accordion-button{border-top-left-radius:var(--bs-accordion-inner-border-radius);border-top-right-radius:var(--bs-accordion-inner-border-radius)}.accordion-item:not(:first-of-type){border-top:0}.accordion-item:last-of-type{border-bottom-right-radius:var(--bs-accordion-border-radius);border-bottom-left-radius:var(--bs-accordion-border-radius)}.accordion-item:last-of-type .accordion-button.collapsed{border-bottom-right-radius:var(--bs-accordion-inner-border-radius);border-bottom-left-radius:var(--bs-accordion-inner-border-radius)}.accordion-item:last-of-type .accordion-collapse{border-bottom-right-radius:var(--bs-accordion-border-radius);border-bottom-left-radius:var(--bs-accordion-border-radius)}.accordion-body{padding:var(--bs-accordion-body-padding-y) var(--bs-accordion-body-padding-x)}.accordion-flush .accordion-collapse{border-width:0}.accordion-flush .accordion-item{border-right:0;border-left:0;border-radius:0}.accordion-flush .accordion-item:first-child{border-top:0}.accordion-flush .accordion-item:last-child{border-bottom:0}.accordion-flush .accordion-item .accordion-button,.accordion-flush .accordion-item .accordion-button.collapsed{border-radius:0}[data-bs-theme=dark] .accordion-button::after{--bs-accordion-btn-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%236ea8fe'%3e%3cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3e%3c/svg%3e\");--bs-accordion-btn-active-icon: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%236ea8fe'%3e%3cpath fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/%3e%3c/svg%3e\")}.breadcrumb{--bs-breadcrumb-padding-x: 0;--bs-breadcrumb-padding-y: 0;--bs-breadcrumb-margin-bottom: 1rem;--bs-breadcrumb-bg: ;--bs-breadcrumb-border-radius: ;--bs-breadcrumb-divider-color: var(--bs-secondary-color);--bs-breadcrumb-item-padding-x: 0.5rem;--bs-breadcrumb-item-active-color: var(--bs-secondary-color);display:flex;flex-wrap:wrap;padding:var(--bs-breadcrumb-padding-y) var(--bs-breadcrumb-padding-x);margin-bottom:var(--bs-breadcrumb-margin-bottom);font-size:var(--bs-breadcrumb-font-size);list-style:none;background-color:var(--bs-breadcrumb-bg);border-radius:var(--bs-breadcrumb-border-radius)}.breadcrumb-item+.breadcrumb-item{padding-left:var(--bs-breadcrumb-item-padding-x)}.breadcrumb-item+.breadcrumb-item::before{float:left;padding-right:var(--bs-breadcrumb-item-padding-x);color:var(--bs-breadcrumb-divider-color);content:var(--bs-breadcrumb-divider, \"/\") /* rtl: var(--bs-breadcrumb-divider, \"/\") */}.breadcrumb-item.active{color:var(--bs-breadcrumb-item-active-color)}.pagination{--bs-pagination-padding-x: 0.75rem;--bs-pagination-padding-y: 0.375rem;--bs-pagination-font-size:1rem;--bs-pagination-color: var(--bs-link-color);--bs-pagination-bg: var(--bs-body-bg);--bs-pagination-border-width: var(--bs-border-width);--bs-pagination-border-color: var(--bs-border-color);--bs-pagination-border-radius: var(--bs-border-radius);--bs-pagination-hover-color: var(--bs-link-hover-color);--bs-pagination-hover-bg: var(--bs-tertiary-bg);--bs-pagination-hover-border-color: var(--bs-border-color);--bs-pagination-focus-color: var(--bs-link-hover-color);--bs-pagination-focus-bg: var(--bs-secondary-bg);--bs-pagination-focus-box-shadow: 0 0 0 0.25rem rgba(13, 110, 253, 0.25);--bs-pagination-active-color: #fff;--bs-pagination-active-bg: #0d6efd;--bs-pagination-active-border-color: #0d6efd;--bs-pagination-disabled-color: var(--bs-secondary-color);--bs-pagination-disabled-bg: var(--bs-secondary-bg);--bs-pagination-disabled-border-color: var(--bs-border-color);display:flex;padding-left:0;list-style:none}.page-link{position:relative;display:block;padding:var(--bs-pagination-padding-y) var(--bs-pagination-padding-x);font-size:var(--bs-pagination-font-size);color:var(--bs-pagination-color);text-decoration:none;background-color:var(--bs-pagination-bg);border:var(--bs-pagination-border-width) solid var(--bs-pagination-border-color);transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.page-link{transition:none}}.page-link:hover{z-index:2;color:var(--bs-pagination-hover-color);background-color:var(--bs-pagination-hover-bg);border-color:var(--bs-pagination-hover-border-color)}.page-link:focus{z-index:3;color:var(--bs-pagination-focus-color);background-color:var(--bs-pagination-focus-bg);outline:0;box-shadow:var(--bs-pagination-focus-box-shadow)}.page-link.active,.active>.page-link{z-index:3;color:var(--bs-pagination-active-color);background-color:var(--bs-pagination-active-bg);border-color:var(--bs-pagination-active-border-color)}.page-link.disabled,.disabled>.page-link{color:var(--bs-pagination-disabled-color);pointer-events:none;background-color:var(--bs-pagination-disabled-bg);border-color:var(--bs-pagination-disabled-border-color)}.page-item:not(:first-child) .page-link{margin-left:calc(var(--bs-border-width)*-1)}.page-item:first-child .page-link{border-top-left-radius:var(--bs-pagination-border-radius);border-bottom-left-radius:var(--bs-pagination-border-radius)}.page-item:last-child .page-link{border-top-right-radius:var(--bs-pagination-border-radius);border-bottom-right-radius:var(--bs-pagination-border-radius)}.pagination-lg{--bs-pagination-padding-x: 1.5rem;--bs-pagination-padding-y: 0.75rem;--bs-pagination-font-size:1.25rem;--bs-pagination-border-radius: var(--bs-border-radius-lg)}.pagination-sm{--bs-pagination-padding-x: 0.5rem;--bs-pagination-padding-y: 0.25rem;--bs-pagination-font-size:0.875rem;--bs-pagination-border-radius: var(--bs-border-radius-sm)}.badge{--bs-badge-padding-x: 0.65em;--bs-badge-padding-y: 0.35em;--bs-badge-font-size:0.75em;--bs-badge-font-weight: 700;--bs-badge-color: #fff;--bs-badge-border-radius: var(--bs-border-radius);display:inline-block;padding:var(--bs-badge-padding-y) var(--bs-badge-padding-x);font-size:var(--bs-badge-font-size);font-weight:var(--bs-badge-font-weight);line-height:1;color:var(--bs-badge-color);text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:var(--bs-badge-border-radius)}.badge:empty{display:none}.btn .badge{position:relative;top:-1px}.alert{--bs-alert-bg: transparent;--bs-alert-padding-x: 1rem;--bs-alert-padding-y: 1rem;--bs-alert-margin-bottom: 1rem;--bs-alert-color: inherit;--bs-alert-border-color: transparent;--bs-alert-border: var(--bs-border-width) solid var(--bs-alert-border-color);--bs-alert-border-radius: var(--bs-border-radius);--bs-alert-link-color: inherit;position:relative;padding:var(--bs-alert-padding-y) var(--bs-alert-padding-x);margin-bottom:var(--bs-alert-margin-bottom);color:var(--bs-alert-color);background-color:var(--bs-alert-bg);border:var(--bs-alert-border);border-radius:var(--bs-alert-border-radius)}.alert-heading{color:inherit}.alert-link{font-weight:700;color:var(--bs-alert-link-color)}.alert-dismissible{padding-right:3rem}.alert-dismissible .btn-close{position:absolute;top:0;right:0;z-index:2;padding:1.25rem 1rem}.alert-primary{--bs-alert-color: var(--bs-primary-text-emphasis);--bs-alert-bg: var(--bs-primary-bg-subtle);--bs-alert-border-color: var(--bs-primary-border-subtle);--bs-alert-link-color: var(--bs-primary-text-emphasis)}.alert-secondary{--bs-alert-color: var(--bs-secondary-text-emphasis);--bs-alert-bg: var(--bs-secondary-bg-subtle);--bs-alert-border-color: var(--bs-secondary-border-subtle);--bs-alert-link-color: var(--bs-secondary-text-emphasis)}.alert-success{--bs-alert-color: var(--bs-success-text-emphasis);--bs-alert-bg: var(--bs-success-bg-subtle);--bs-alert-border-color: var(--bs-success-border-subtle);--bs-alert-link-color: var(--bs-success-text-emphasis)}.alert-info{--bs-alert-color: var(--bs-info-text-emphasis);--bs-alert-bg: var(--bs-info-bg-subtle);--bs-alert-border-color: var(--bs-info-border-subtle);--bs-alert-link-color: var(--bs-info-text-emphasis)}.alert-warning{--bs-alert-color: var(--bs-warning-text-emphasis);--bs-alert-bg: var(--bs-warning-bg-subtle);--bs-alert-border-color: var(--bs-warning-border-subtle);--bs-alert-link-color: var(--bs-warning-text-emphasis)}.alert-danger{--bs-alert-color: var(--bs-danger-text-emphasis);--bs-alert-bg: var(--bs-danger-bg-subtle);--bs-alert-border-color: var(--bs-danger-border-subtle);--bs-alert-link-color: var(--bs-danger-text-emphasis)}.alert-light{--bs-alert-color: var(--bs-light-text-emphasis);--bs-alert-bg: var(--bs-light-bg-subtle);--bs-alert-border-color: var(--bs-light-border-subtle);--bs-alert-link-color: var(--bs-light-text-emphasis)}.alert-dark{--bs-alert-color: var(--bs-dark-text-emphasis);--bs-alert-bg: var(--bs-dark-bg-subtle);--bs-alert-border-color: var(--bs-dark-border-subtle);--bs-alert-link-color: var(--bs-dark-text-emphasis)}@keyframes progress-bar-stripes{0%{background-position-x:1rem}}.progress,.progress-stacked{--bs-progress-height: 1rem;--bs-progress-font-size:0.75rem;--bs-progress-bg: var(--bs-secondary-bg);--bs-progress-border-radius: var(--bs-border-radius);--bs-progress-box-shadow: var(--bs-box-shadow-inset);--bs-progress-bar-color: #fff;--bs-progress-bar-bg: #0d6efd;--bs-progress-bar-transition: width 0.6s ease;display:flex;height:var(--bs-progress-height);overflow:hidden;font-size:var(--bs-progress-font-size);background-color:var(--bs-progress-bg);border-radius:var(--bs-progress-border-radius)}.progress-bar{display:flex;flex-direction:column;justify-content:center;overflow:hidden;color:var(--bs-progress-bar-color);text-align:center;white-space:nowrap;background-color:var(--bs-progress-bar-bg);transition:var(--bs-progress-bar-transition)}@media(prefers-reduced-motion: reduce){.progress-bar{transition:none}}.progress-bar-striped{background-image:linear-gradient(45deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);background-size:var(--bs-progress-height) var(--bs-progress-height)}.progress-stacked>.progress{overflow:visible}.progress-stacked>.progress>.progress-bar{width:100%}.progress-bar-animated{animation:1s linear infinite progress-bar-stripes}@media(prefers-reduced-motion: reduce){.progress-bar-animated{animation:none}}.list-group{--bs-list-group-color: var(--bs-body-color);--bs-list-group-bg: var(--bs-body-bg);--bs-list-group-border-color: var(--bs-border-color);--bs-list-group-border-width: var(--bs-border-width);--bs-list-group-border-radius: var(--bs-border-radius);--bs-list-group-item-padding-x: 1rem;--bs-list-group-item-padding-y: 0.5rem;--bs-list-group-action-color: var(--bs-secondary-color);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-tertiary-bg);--bs-list-group-action-active-color: var(--bs-body-color);--bs-list-group-action-active-bg: var(--bs-secondary-bg);--bs-list-group-disabled-color: var(--bs-secondary-color);--bs-list-group-disabled-bg: var(--bs-body-bg);--bs-list-group-active-color: #fff;--bs-list-group-active-bg: #0d6efd;--bs-list-group-active-border-color: #0d6efd;display:flex;flex-direction:column;padding-left:0;margin-bottom:0;border-radius:var(--bs-list-group-border-radius)}.list-group-numbered{list-style-type:none;counter-reset:section}.list-group-numbered>.list-group-item::before{content:counters(section, \".\") \". \";counter-increment:section}.list-group-item-action{width:100%;color:var(--bs-list-group-action-color);text-align:inherit}.list-group-item-action:hover,.list-group-item-action:focus{z-index:1;color:var(--bs-list-group-action-hover-color);text-decoration:none;background-color:var(--bs-list-group-action-hover-bg)}.list-group-item-action:active{color:var(--bs-list-group-action-active-color);background-color:var(--bs-list-group-action-active-bg)}.list-group-item{position:relative;display:block;padding:var(--bs-list-group-item-padding-y) var(--bs-list-group-item-padding-x);color:var(--bs-list-group-color);text-decoration:none;background-color:var(--bs-list-group-bg);border:var(--bs-list-group-border-width) solid var(--bs-list-group-border-color)}.list-group-item:first-child{border-top-left-radius:inherit;border-top-right-radius:inherit}.list-group-item:last-child{border-bottom-right-radius:inherit;border-bottom-left-radius:inherit}.list-group-item.disabled,.list-group-item:disabled{color:var(--bs-list-group-disabled-color);pointer-events:none;background-color:var(--bs-list-group-disabled-bg)}.list-group-item.active{z-index:2;color:var(--bs-list-group-active-color);background-color:var(--bs-list-group-active-bg);border-color:var(--bs-list-group-active-border-color)}.list-group-item+.list-group-item{border-top-width:0}.list-group-item+.list-group-item.active{margin-top:calc(-1*var(--bs-list-group-border-width));border-top-width:var(--bs-list-group-border-width)}.list-group-horizontal{flex-direction:row}.list-group-horizontal>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal>.list-group-item:last-child:not(:first-child){border-top-right-radius:var(--bs-list-group-border-radius);border-bottom-left-radius:0}.list-group-horizontal>.list-group-item.active{margin-top:0}.list-group-horizontal>.list-group-item+.list-group-item{border-top-width:var(--bs-list-group-border-width);border-left-width:0}.list-group-horizontal>.list-group-item+.list-group-item.active{margin-left:calc(-1*var(--bs-list-group-border-width));border-left-width:var(--bs-list-group-border-width)}@media(min-width: 540px){.list-group-horizontal-sm{flex-direction:row}.list-group-horizontal-sm>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-sm>.list-group-item:last-child:not(:first-child){border-top-right-radius:var(--bs-list-group-border-radius);border-bottom-left-radius:0}.list-group-horizontal-sm>.list-group-item.active{margin-top:0}.list-group-horizontal-sm>.list-group-item+.list-group-item{border-top-width:var(--bs-list-group-border-width);border-left-width:0}.list-group-horizontal-sm>.list-group-item+.list-group-item.active{margin-left:calc(-1*var(--bs-list-group-border-width));border-left-width:var(--bs-list-group-border-width)}}@media(min-width: 720px){.list-group-horizontal-md{flex-direction:row}.list-group-horizontal-md>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-md>.list-group-item:last-child:not(:first-child){border-top-right-radius:var(--bs-list-group-border-radius);border-bottom-left-radius:0}.list-group-horizontal-md>.list-group-item.active{margin-top:0}.list-group-horizontal-md>.list-group-item+.list-group-item{border-top-width:var(--bs-list-group-border-width);border-left-width:0}.list-group-horizontal-md>.list-group-item+.list-group-item.active{margin-left:calc(-1*var(--bs-list-group-border-width));border-left-width:var(--bs-list-group-border-width)}}@media(min-width: 960px){.list-group-horizontal-lg{flex-direction:row}.list-group-horizontal-lg>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-lg>.list-group-item:last-child:not(:first-child){border-top-right-radius:var(--bs-list-group-border-radius);border-bottom-left-radius:0}.list-group-horizontal-lg>.list-group-item.active{margin-top:0}.list-group-horizontal-lg>.list-group-item+.list-group-item{border-top-width:var(--bs-list-group-border-width);border-left-width:0}.list-group-horizontal-lg>.list-group-item+.list-group-item.active{margin-left:calc(-1*var(--bs-list-group-border-width));border-left-width:var(--bs-list-group-border-width)}}@media(min-width: 1200px){.list-group-horizontal-xl{flex-direction:row}.list-group-horizontal-xl>.list-group-item:first-child:not(:last-child){border-bottom-left-radius:var(--bs-list-group-border-radius);border-top-right-radius:0}.list-group-horizontal-xl>.list-group-item:last-child:not(:first-child){border-top-right-radius:var(--bs-list-group-border-radius);border-bottom-left-radius:0}.list-group-horizontal-xl>.list-group-item.active{margin-top:0}.list-group-horizontal-xl>.list-group-item+.list-group-item{border-top-width:var(--bs-list-group-border-width);border-left-width:0}.list-group-horizontal-xl>.list-group-item+.list-group-item.active{margin-left:calc(-1*var(--bs-list-group-border-width));border-left-width:var(--bs-list-group-border-width)}}.list-group-flush{border-radius:0}.list-group-flush>.list-group-item{border-width:0 0 var(--bs-list-group-border-width)}.list-group-flush>.list-group-item:last-child{border-bottom-width:0}.list-group-item-primary{--bs-list-group-color: var(--bs-primary-text-emphasis);--bs-list-group-bg: var(--bs-primary-bg-subtle);--bs-list-group-border-color: var(--bs-primary-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-primary-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-primary-border-subtle);--bs-list-group-active-color: var(--bs-primary-bg-subtle);--bs-list-group-active-bg: var(--bs-primary-text-emphasis);--bs-list-group-active-border-color: var(--bs-primary-text-emphasis)}.list-group-item-secondary{--bs-list-group-color: var(--bs-secondary-text-emphasis);--bs-list-group-bg: var(--bs-secondary-bg-subtle);--bs-list-group-border-color: var(--bs-secondary-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-secondary-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-secondary-border-subtle);--bs-list-group-active-color: var(--bs-secondary-bg-subtle);--bs-list-group-active-bg: var(--bs-secondary-text-emphasis);--bs-list-group-active-border-color: var(--bs-secondary-text-emphasis)}.list-group-item-success{--bs-list-group-color: var(--bs-success-text-emphasis);--bs-list-group-bg: var(--bs-success-bg-subtle);--bs-list-group-border-color: var(--bs-success-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-success-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-success-border-subtle);--bs-list-group-active-color: var(--bs-success-bg-subtle);--bs-list-group-active-bg: var(--bs-success-text-emphasis);--bs-list-group-active-border-color: var(--bs-success-text-emphasis)}.list-group-item-info{--bs-list-group-color: var(--bs-info-text-emphasis);--bs-list-group-bg: var(--bs-info-bg-subtle);--bs-list-group-border-color: var(--bs-info-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-info-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-info-border-subtle);--bs-list-group-active-color: var(--bs-info-bg-subtle);--bs-list-group-active-bg: var(--bs-info-text-emphasis);--bs-list-group-active-border-color: var(--bs-info-text-emphasis)}.list-group-item-warning{--bs-list-group-color: var(--bs-warning-text-emphasis);--bs-list-group-bg: var(--bs-warning-bg-subtle);--bs-list-group-border-color: var(--bs-warning-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-warning-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-warning-border-subtle);--bs-list-group-active-color: var(--bs-warning-bg-subtle);--bs-list-group-active-bg: var(--bs-warning-text-emphasis);--bs-list-group-active-border-color: var(--bs-warning-text-emphasis)}.list-group-item-danger{--bs-list-group-color: var(--bs-danger-text-emphasis);--bs-list-group-bg: var(--bs-danger-bg-subtle);--bs-list-group-border-color: var(--bs-danger-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-danger-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-danger-border-subtle);--bs-list-group-active-color: var(--bs-danger-bg-subtle);--bs-list-group-active-bg: var(--bs-danger-text-emphasis);--bs-list-group-active-border-color: var(--bs-danger-text-emphasis)}.list-group-item-light{--bs-list-group-color: var(--bs-light-text-emphasis);--bs-list-group-bg: var(--bs-light-bg-subtle);--bs-list-group-border-color: var(--bs-light-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-light-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-light-border-subtle);--bs-list-group-active-color: var(--bs-light-bg-subtle);--bs-list-group-active-bg: var(--bs-light-text-emphasis);--bs-list-group-active-border-color: var(--bs-light-text-emphasis)}.list-group-item-dark{--bs-list-group-color: var(--bs-dark-text-emphasis);--bs-list-group-bg: var(--bs-dark-bg-subtle);--bs-list-group-border-color: var(--bs-dark-border-subtle);--bs-list-group-action-hover-color: var(--bs-emphasis-color);--bs-list-group-action-hover-bg: var(--bs-dark-border-subtle);--bs-list-group-action-active-color: var(--bs-emphasis-color);--bs-list-group-action-active-bg: var(--bs-dark-border-subtle);--bs-list-group-active-color: var(--bs-dark-bg-subtle);--bs-list-group-active-bg: var(--bs-dark-text-emphasis);--bs-list-group-active-border-color: var(--bs-dark-text-emphasis)}.btn-close{--bs-btn-close-color: #000;--bs-btn-close-bg: url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23000'%3e%3cpath d='M.293.293a1 1 0 0 1 1.414 0L8 6.586 14.293.293a1 1 0 1 1 1.414 1.414L9.414 8l6.293 6.293a1 1 0 0 1-1.414 1.414L8 9.414l-6.293 6.293a1 1 0 0 1-1.414-1.414L6.586 8 .293 1.707a1 1 0 0 1 0-1.414z'/%3e%3c/svg%3e\");--bs-btn-close-opacity: 0.5;--bs-btn-close-hover-opacity: 0.75;--bs-btn-close-focus-shadow: 0 0 0 0.25rem rgba(13, 110, 253, 0.25);--bs-btn-close-focus-opacity: 1;--bs-btn-close-disabled-opacity: 0.25;--bs-btn-close-white-filter: invert(1) grayscale(100%) brightness(200%);box-sizing:content-box;width:1em;height:1em;padding:.25em .25em;color:var(--bs-btn-close-color);background:rgba(0,0,0,0) var(--bs-btn-close-bg) center/1em auto no-repeat;border:0;border-radius:.375rem;opacity:var(--bs-btn-close-opacity)}.btn-close:hover{color:var(--bs-btn-close-color);text-decoration:none;opacity:var(--bs-btn-close-hover-opacity)}.btn-close:focus{outline:0;box-shadow:var(--bs-btn-close-focus-shadow);opacity:var(--bs-btn-close-focus-opacity)}.btn-close:disabled,.btn-close.disabled{pointer-events:none;user-select:none;opacity:var(--bs-btn-close-disabled-opacity)}.btn-close-white{filter:var(--bs-btn-close-white-filter)}[data-bs-theme=dark] .btn-close{filter:var(--bs-btn-close-white-filter)}.toast{--bs-toast-zindex: 1090;--bs-toast-padding-x: 0.75rem;--bs-toast-padding-y: 0.5rem;--bs-toast-spacing: 1.5rem;--bs-toast-max-width: 350px;--bs-toast-font-size:0.875rem;--bs-toast-color: ;--bs-toast-bg: rgba(var(--bs-body-bg-rgb), 0.85);--bs-toast-border-width: var(--bs-border-width);--bs-toast-border-color: var(--bs-border-color-translucent);--bs-toast-border-radius: var(--bs-border-radius);--bs-toast-box-shadow: var(--bs-box-shadow);--bs-toast-header-color: var(--bs-secondary-color);--bs-toast-header-bg: rgba(var(--bs-body-bg-rgb), 0.85);--bs-toast-header-border-color: var(--bs-border-color-translucent);width:var(--bs-toast-max-width);max-width:100%;font-size:var(--bs-toast-font-size);color:var(--bs-toast-color);pointer-events:auto;background-color:var(--bs-toast-bg);background-clip:padding-box;border:var(--bs-toast-border-width) solid var(--bs-toast-border-color);box-shadow:var(--bs-toast-box-shadow);border-radius:var(--bs-toast-border-radius)}.toast.showing{opacity:0}.toast:not(.show){display:none}.toast-container{--bs-toast-zindex: 1090;position:absolute;z-index:var(--bs-toast-zindex);width:max-content;max-width:100%;pointer-events:none}.toast-container>:not(:last-child){margin-bottom:var(--bs-toast-spacing)}.toast-header{display:flex;align-items:center;padding:var(--bs-toast-padding-y) var(--bs-toast-padding-x);color:var(--bs-toast-header-color);background-color:var(--bs-toast-header-bg);background-clip:padding-box;border-bottom:var(--bs-toast-border-width) solid var(--bs-toast-header-border-color);border-top-left-radius:calc(var(--bs-toast-border-radius) - var(--bs-toast-border-width));border-top-right-radius:calc(var(--bs-toast-border-radius) - var(--bs-toast-border-width))}.toast-header .btn-close{margin-right:calc(-0.5*var(--bs-toast-padding-x));margin-left:var(--bs-toast-padding-x)}.toast-body{padding:var(--bs-toast-padding-x);word-wrap:break-word}.modal{--bs-modal-zindex: 1055;--bs-modal-width: 500px;--bs-modal-padding: 1rem;--bs-modal-margin: 0.5rem;--bs-modal-color: ;--bs-modal-bg: var(--bs-body-bg);--bs-modal-border-color: var(--bs-border-color-translucent);--bs-modal-border-width: var(--bs-border-width);--bs-modal-border-radius: var(--bs-border-radius-lg);--bs-modal-box-shadow: var(--bs-box-shadow-sm);--bs-modal-inner-border-radius: calc(var(--bs-border-radius-lg) - (var(--bs-border-width)));--bs-modal-header-padding-x: 1rem;--bs-modal-header-padding-y: 1rem;--bs-modal-header-padding: 1rem 1rem;--bs-modal-header-border-color: var(--bs-border-color);--bs-modal-header-border-width: var(--bs-border-width);--bs-modal-title-line-height: 1.5;--bs-modal-footer-gap: 0.5rem;--bs-modal-footer-bg: ;--bs-modal-footer-border-color: var(--bs-border-color);--bs-modal-footer-border-width: var(--bs-border-width);position:fixed;top:0;left:0;z-index:var(--bs-modal-zindex);display:none;width:100%;height:100%;overflow-x:hidden;overflow-y:auto;outline:0}.modal-dialog{position:relative;width:auto;margin:var(--bs-modal-margin);pointer-events:none}.modal.fade .modal-dialog{transition:transform .3s ease-out;transform:translate(0, -50px)}@media(prefers-reduced-motion: reduce){.modal.fade .modal-dialog{transition:none}}.modal.show .modal-dialog{transform:none}.modal.modal-static .modal-dialog{transform:scale(1.02)}.modal-dialog-scrollable{height:calc(100% - var(--bs-modal-margin)*2)}.modal-dialog-scrollable .modal-content{max-height:100%;overflow:hidden}.modal-dialog-scrollable .modal-body{overflow-y:auto}.modal-dialog-centered{display:flex;align-items:center;min-height:calc(100% - var(--bs-modal-margin)*2)}.modal-content{position:relative;display:flex;flex-direction:column;width:100%;color:var(--bs-modal-color);pointer-events:auto;background-color:var(--bs-modal-bg);background-clip:padding-box;border:var(--bs-modal-border-width) solid var(--bs-modal-border-color);border-radius:var(--bs-modal-border-radius);outline:0}.modal-backdrop{--bs-backdrop-zindex: 1050;--bs-backdrop-bg: #000;--bs-backdrop-opacity: 0.5;position:fixed;top:0;left:0;z-index:var(--bs-backdrop-zindex);width:100vw;height:100vh;background-color:var(--bs-backdrop-bg)}.modal-backdrop.fade{opacity:0}.modal-backdrop.show{opacity:var(--bs-backdrop-opacity)}.modal-header{display:flex;flex-shrink:0;align-items:center;justify-content:space-between;padding:var(--bs-modal-header-padding);border-bottom:var(--bs-modal-header-border-width) solid var(--bs-modal-header-border-color);border-top-left-radius:var(--bs-modal-inner-border-radius);border-top-right-radius:var(--bs-modal-inner-border-radius)}.modal-header .btn-close{padding:calc(var(--bs-modal-header-padding-y)*.5) calc(var(--bs-modal-header-padding-x)*.5);margin:calc(-0.5*var(--bs-modal-header-padding-y)) calc(-0.5*var(--bs-modal-header-padding-x)) calc(-0.5*var(--bs-modal-header-padding-y)) auto}.modal-title{margin-bottom:0;line-height:var(--bs-modal-title-line-height)}.modal-body{position:relative;flex:1 1 auto;padding:var(--bs-modal-padding)}.modal-footer{display:flex;flex-shrink:0;flex-wrap:wrap;align-items:center;justify-content:flex-end;padding:calc(var(--bs-modal-padding) - var(--bs-modal-footer-gap)*.5);background-color:var(--bs-modal-footer-bg);border-top:var(--bs-modal-footer-border-width) solid var(--bs-modal-footer-border-color);border-bottom-right-radius:var(--bs-modal-inner-border-radius);border-bottom-left-radius:var(--bs-modal-inner-border-radius)}.modal-footer>*{margin:calc(var(--bs-modal-footer-gap)*.5)}@media(min-width: 540px){.modal{--bs-modal-margin: 1.75rem;--bs-modal-box-shadow: var(--bs-box-shadow)}.modal-dialog{max-width:var(--bs-modal-width);margin-right:auto;margin-left:auto}.modal-sm{--bs-modal-width: 300px}}@media(min-width: 960px){.modal-lg,.modal-xl{--bs-modal-width: 800px}}@media(min-width: 1200px){.modal-xl{--bs-modal-width: 1140px}}.modal-fullscreen{width:100vw;max-width:none;height:100%;margin:0}.modal-fullscreen .modal-content{height:100%;border:0;border-radius:0}.modal-fullscreen .modal-header,.modal-fullscreen .modal-footer{border-radius:0}.modal-fullscreen .modal-body{overflow-y:auto}@media(max-width: 539.98px){.modal-fullscreen-sm-down{width:100vw;max-width:none;height:100%;margin:0}.modal-fullscreen-sm-down .modal-content{height:100%;border:0;border-radius:0}.modal-fullscreen-sm-down .modal-header,.modal-fullscreen-sm-down .modal-footer{border-radius:0}.modal-fullscreen-sm-down .modal-body{overflow-y:auto}}@media(max-width: 719.98px){.modal-fullscreen-md-down{width:100vw;max-width:none;height:100%;margin:0}.modal-fullscreen-md-down .modal-content{height:100%;border:0;border-radius:0}.modal-fullscreen-md-down .modal-header,.modal-fullscreen-md-down .modal-footer{border-radius:0}.modal-fullscreen-md-down .modal-body{overflow-y:auto}}@media(max-width: 959.98px){.modal-fullscreen-lg-down{width:100vw;max-width:none;height:100%;margin:0}.modal-fullscreen-lg-down .modal-content{height:100%;border:0;border-radius:0}.modal-fullscreen-lg-down .modal-header,.modal-fullscreen-lg-down .modal-footer{border-radius:0}.modal-fullscreen-lg-down .modal-body{overflow-y:auto}}@media(max-width: 1199.98px){.modal-fullscreen-xl-down{width:100vw;max-width:none;height:100%;margin:0}.modal-fullscreen-xl-down .modal-content{height:100%;border:0;border-radius:0}.modal-fullscreen-xl-down .modal-header,.modal-fullscreen-xl-down .modal-footer{border-radius:0}.modal-fullscreen-xl-down .modal-body{overflow-y:auto}}.tooltip{--bs-tooltip-zindex: 1080;--bs-tooltip-max-width: 200px;--bs-tooltip-padding-x: 0.5rem;--bs-tooltip-padding-y: 0.25rem;--bs-tooltip-margin: ;--bs-tooltip-font-size:0.875rem;--bs-tooltip-color: var(--bs-body-bg);--bs-tooltip-bg: var(--bs-emphasis-color);--bs-tooltip-border-radius: var(--bs-border-radius);--bs-tooltip-opacity: 0.9;--bs-tooltip-arrow-width: 0.8rem;--bs-tooltip-arrow-height: 0.4rem;z-index:var(--bs-tooltip-zindex);display:block;margin:var(--bs-tooltip-margin);font-family:var(--bs-font-sans-serif);font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;white-space:normal;word-spacing:normal;line-break:auto;font-size:var(--bs-tooltip-font-size);word-wrap:break-word;opacity:0}.tooltip.show{opacity:var(--bs-tooltip-opacity)}.tooltip .tooltip-arrow{display:block;width:var(--bs-tooltip-arrow-width);height:var(--bs-tooltip-arrow-height)}.tooltip .tooltip-arrow::before{position:absolute;content:\"\";border-color:rgba(0,0,0,0);border-style:solid}.bs-tooltip-top .tooltip-arrow,.bs-tooltip-auto[data-popper-placement^=top] .tooltip-arrow{bottom:calc(-1*var(--bs-tooltip-arrow-height))}.bs-tooltip-top .tooltip-arrow::before,.bs-tooltip-auto[data-popper-placement^=top] .tooltip-arrow::before{top:-1px;border-width:var(--bs-tooltip-arrow-height) calc(var(--bs-tooltip-arrow-width)*.5) 0;border-top-color:var(--bs-tooltip-bg)}.bs-tooltip-end .tooltip-arrow,.bs-tooltip-auto[data-popper-placement^=right] .tooltip-arrow{left:calc(-1*var(--bs-tooltip-arrow-height));width:var(--bs-tooltip-arrow-height);height:var(--bs-tooltip-arrow-width)}.bs-tooltip-end .tooltip-arrow::before,.bs-tooltip-auto[data-popper-placement^=right] .tooltip-arrow::before{right:-1px;border-width:calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height) calc(var(--bs-tooltip-arrow-width)*.5) 0;border-right-color:var(--bs-tooltip-bg)}.bs-tooltip-bottom .tooltip-arrow,.bs-tooltip-auto[data-popper-placement^=bottom] .tooltip-arrow{top:calc(-1*var(--bs-tooltip-arrow-height))}.bs-tooltip-bottom .tooltip-arrow::before,.bs-tooltip-auto[data-popper-placement^=bottom] .tooltip-arrow::before{bottom:-1px;border-width:0 calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height);border-bottom-color:var(--bs-tooltip-bg)}.bs-tooltip-start .tooltip-arrow,.bs-tooltip-auto[data-popper-placement^=left] .tooltip-arrow{right:calc(-1*var(--bs-tooltip-arrow-height));width:var(--bs-tooltip-arrow-height);height:var(--bs-tooltip-arrow-width)}.bs-tooltip-start .tooltip-arrow::before,.bs-tooltip-auto[data-popper-placement^=left] .tooltip-arrow::before{left:-1px;border-width:calc(var(--bs-tooltip-arrow-width)*.5) 0 calc(var(--bs-tooltip-arrow-width)*.5) var(--bs-tooltip-arrow-height);border-left-color:var(--bs-tooltip-bg)}.tooltip-inner{max-width:var(--bs-tooltip-max-width);padding:var(--bs-tooltip-padding-y) var(--bs-tooltip-padding-x);color:var(--bs-tooltip-color);text-align:center;background-color:var(--bs-tooltip-bg);border-radius:var(--bs-tooltip-border-radius)}.popover{--bs-popover-zindex: 1070;--bs-popover-max-width: 276px;--bs-popover-font-size:0.875rem;--bs-popover-bg: var(--bs-body-bg);--bs-popover-border-width: var(--bs-border-width);--bs-popover-border-color: var(--bs-border-color-translucent);--bs-popover-border-radius: var(--bs-border-radius-lg);--bs-popover-inner-border-radius: calc(var(--bs-border-radius-lg) - var(--bs-border-width));--bs-popover-box-shadow: var(--bs-box-shadow);--bs-popover-header-padding-x: 1rem;--bs-popover-header-padding-y: 0.5rem;--bs-popover-header-font-size:1rem;--bs-popover-header-color: inherit;--bs-popover-header-bg: var(--bs-secondary-bg);--bs-popover-body-padding-x: 1rem;--bs-popover-body-padding-y: 1rem;--bs-popover-body-color: var(--bs-body-color);--bs-popover-arrow-width: 1rem;--bs-popover-arrow-height: 0.5rem;--bs-popover-arrow-border: var(--bs-popover-border-color);z-index:var(--bs-popover-zindex);display:block;max-width:var(--bs-popover-max-width);font-family:var(--bs-font-sans-serif);font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;white-space:normal;word-spacing:normal;line-break:auto;font-size:var(--bs-popover-font-size);word-wrap:break-word;background-color:var(--bs-popover-bg);background-clip:padding-box;border:var(--bs-popover-border-width) solid var(--bs-popover-border-color);border-radius:var(--bs-popover-border-radius)}.popover .popover-arrow{display:block;width:var(--bs-popover-arrow-width);height:var(--bs-popover-arrow-height)}.popover .popover-arrow::before,.popover .popover-arrow::after{position:absolute;display:block;content:\"\";border-color:rgba(0,0,0,0);border-style:solid;border-width:0}.bs-popover-top>.popover-arrow,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow{bottom:calc(-1*(var(--bs-popover-arrow-height)) - var(--bs-popover-border-width))}.bs-popover-top>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow::before,.bs-popover-top>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow::after{border-width:var(--bs-popover-arrow-height) calc(var(--bs-popover-arrow-width)*.5) 0}.bs-popover-top>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow::before{bottom:0;border-top-color:var(--bs-popover-arrow-border)}.bs-popover-top>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=top]>.popover-arrow::after{bottom:var(--bs-popover-border-width);border-top-color:var(--bs-popover-bg)}.bs-popover-end>.popover-arrow,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow{left:calc(-1*(var(--bs-popover-arrow-height)) - var(--bs-popover-border-width));width:var(--bs-popover-arrow-height);height:var(--bs-popover-arrow-width)}.bs-popover-end>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow::before,.bs-popover-end>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow::after{border-width:calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height) calc(var(--bs-popover-arrow-width)*.5) 0}.bs-popover-end>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow::before{left:0;border-right-color:var(--bs-popover-arrow-border)}.bs-popover-end>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=right]>.popover-arrow::after{left:var(--bs-popover-border-width);border-right-color:var(--bs-popover-bg)}.bs-popover-bottom>.popover-arrow,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow{top:calc(-1*(var(--bs-popover-arrow-height)) - var(--bs-popover-border-width))}.bs-popover-bottom>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::before,.bs-popover-bottom>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::after{border-width:0 calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height)}.bs-popover-bottom>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::before{top:0;border-bottom-color:var(--bs-popover-arrow-border)}.bs-popover-bottom>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::after{top:var(--bs-popover-border-width);border-bottom-color:var(--bs-popover-bg)}.bs-popover-bottom .popover-header::before,.bs-popover-auto[data-popper-placement^=bottom] .popover-header::before{position:absolute;top:0;left:50%;display:block;width:var(--bs-popover-arrow-width);margin-left:calc(-0.5*var(--bs-popover-arrow-width));content:\"\";border-bottom:var(--bs-popover-border-width) solid var(--bs-popover-header-bg)}.bs-popover-start>.popover-arrow,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow{right:calc(-1*(var(--bs-popover-arrow-height)) - var(--bs-popover-border-width));width:var(--bs-popover-arrow-height);height:var(--bs-popover-arrow-width)}.bs-popover-start>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow::before,.bs-popover-start>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow::after{border-width:calc(var(--bs-popover-arrow-width)*.5) 0 calc(var(--bs-popover-arrow-width)*.5) var(--bs-popover-arrow-height)}.bs-popover-start>.popover-arrow::before,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow::before{right:0;border-left-color:var(--bs-popover-arrow-border)}.bs-popover-start>.popover-arrow::after,.bs-popover-auto[data-popper-placement^=left]>.popover-arrow::after{right:var(--bs-popover-border-width);border-left-color:var(--bs-popover-bg)}.popover-header{padding:var(--bs-popover-header-padding-y) var(--bs-popover-header-padding-x);margin-bottom:0;font-size:var(--bs-popover-header-font-size);color:var(--bs-popover-header-color);background-color:var(--bs-popover-header-bg);border-bottom:var(--bs-popover-border-width) solid var(--bs-popover-border-color);border-top-left-radius:var(--bs-popover-inner-border-radius);border-top-right-radius:var(--bs-popover-inner-border-radius)}.popover-header:empty{display:none}.popover-body{padding:var(--bs-popover-body-padding-y) var(--bs-popover-body-padding-x);color:var(--bs-popover-body-color)}.carousel{position:relative}.carousel.pointer-event{touch-action:pan-y}.carousel-inner{position:relative;width:100%;overflow:hidden}.carousel-inner::after{display:block;clear:both;content:\"\"}.carousel-item{position:relative;display:none;float:left;width:100%;margin-right:-100%;backface-visibility:hidden;transition:transform .6s ease-in-out}@media(prefers-reduced-motion: reduce){.carousel-item{transition:none}}.carousel-item.active,.carousel-item-next,.carousel-item-prev{display:block}.carousel-item-next:not(.carousel-item-start),.active.carousel-item-end{transform:translateX(100%)}.carousel-item-prev:not(.carousel-item-end),.active.carousel-item-start{transform:translateX(-100%)}.carousel-fade .carousel-item{opacity:0;transition-property:opacity;transform:none}.carousel-fade .carousel-item.active,.carousel-fade .carousel-item-next.carousel-item-start,.carousel-fade .carousel-item-prev.carousel-item-end{z-index:1;opacity:1}.carousel-fade .active.carousel-item-start,.carousel-fade .active.carousel-item-end{z-index:0;opacity:0;transition:opacity 0s .6s}@media(prefers-reduced-motion: reduce){.carousel-fade .active.carousel-item-start,.carousel-fade .active.carousel-item-end{transition:none}}.carousel-control-prev,.carousel-control-next{position:absolute;top:0;bottom:0;z-index:1;display:flex;align-items:center;justify-content:center;width:15%;padding:0;color:#fff;text-align:center;background:none;border:0;opacity:.5;transition:opacity .15s ease}@media(prefers-reduced-motion: reduce){.carousel-control-prev,.carousel-control-next{transition:none}}.carousel-control-prev:hover,.carousel-control-prev:focus,.carousel-control-next:hover,.carousel-control-next:focus{color:#fff;text-decoration:none;outline:0;opacity:.9}.carousel-control-prev{left:0}.carousel-control-next{right:0}.carousel-control-prev-icon,.carousel-control-next-icon{display:inline-block;width:2rem;height:2rem;background-repeat:no-repeat;background-position:50%;background-size:100% 100%}.carousel-control-prev-icon{background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23fff'%3e%3cpath d='M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z'/%3e%3c/svg%3e\")}.carousel-control-next-icon{background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='%23fff'%3e%3cpath d='M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z'/%3e%3c/svg%3e\")}.carousel-indicators{position:absolute;right:0;bottom:0;left:0;z-index:2;display:flex;justify-content:center;padding:0;margin-right:15%;margin-bottom:1rem;margin-left:15%}.carousel-indicators [data-bs-target]{box-sizing:content-box;flex:0 1 auto;width:30px;height:3px;padding:0;margin-right:3px;margin-left:3px;text-indent:-999px;cursor:pointer;background-color:#fff;background-clip:padding-box;border:0;border-top:10px solid rgba(0,0,0,0);border-bottom:10px solid rgba(0,0,0,0);opacity:.5;transition:opacity .6s ease}@media(prefers-reduced-motion: reduce){.carousel-indicators [data-bs-target]{transition:none}}.carousel-indicators .active{opacity:1}.carousel-caption{position:absolute;right:15%;bottom:1.25rem;left:15%;padding-top:1.25rem;padding-bottom:1.25rem;color:#fff;text-align:center}.carousel-dark .carousel-control-prev-icon,.carousel-dark .carousel-control-next-icon{filter:invert(1) grayscale(100)}.carousel-dark .carousel-indicators [data-bs-target]{background-color:#000}.carousel-dark .carousel-caption{color:#000}[data-bs-theme=dark] .carousel .carousel-control-prev-icon,[data-bs-theme=dark] .carousel .carousel-control-next-icon,[data-bs-theme=dark].carousel .carousel-control-prev-icon,[data-bs-theme=dark].carousel .carousel-control-next-icon{filter:invert(1) grayscale(100)}[data-bs-theme=dark] .carousel .carousel-indicators [data-bs-target],[data-bs-theme=dark].carousel .carousel-indicators [data-bs-target]{background-color:#000}[data-bs-theme=dark] .carousel .carousel-caption,[data-bs-theme=dark].carousel .carousel-caption{color:#000}.spinner-grow,.spinner-border{display:inline-block;width:var(--bs-spinner-width);height:var(--bs-spinner-height);vertical-align:var(--bs-spinner-vertical-align);border-radius:50%;animation:var(--bs-spinner-animation-speed) linear infinite var(--bs-spinner-animation-name)}@keyframes spinner-border{to{transform:rotate(360deg) /* rtl:ignore */}}.spinner-border{--bs-spinner-width: 2rem;--bs-spinner-height: 2rem;--bs-spinner-vertical-align: -0.125em;--bs-spinner-border-width: 0.25em;--bs-spinner-animation-speed: 0.75s;--bs-spinner-animation-name: spinner-border;border:var(--bs-spinner-border-width) solid currentcolor;border-right-color:rgba(0,0,0,0)}.spinner-border-sm{--bs-spinner-width: 1rem;--bs-spinner-height: 1rem;--bs-spinner-border-width: 0.2em}@keyframes spinner-grow{0%{transform:scale(0)}50%{opacity:1;transform:none}}.spinner-grow{--bs-spinner-width: 2rem;--bs-spinner-height: 2rem;--bs-spinner-vertical-align: -0.125em;--bs-spinner-animation-speed: 0.75s;--bs-spinner-animation-name: spinner-grow;background-color:currentcolor;opacity:0}.spinner-grow-sm{--bs-spinner-width: 1rem;--bs-spinner-height: 1rem}@media(prefers-reduced-motion: reduce){.spinner-border,.spinner-grow{--bs-spinner-animation-speed: 1.5s}}.offcanvas,.offcanvas-xl,.offcanvas-lg,.offcanvas-md,.offcanvas-sm{--bs-offcanvas-zindex: 1045;--bs-offcanvas-width: 400px;--bs-offcanvas-height: 30vh;--bs-offcanvas-padding-x: 1rem;--bs-offcanvas-padding-y: 1rem;--bs-offcanvas-color: var(--bs-body-color);--bs-offcanvas-bg: var(--bs-body-bg);--bs-offcanvas-border-width: var(--bs-border-width);--bs-offcanvas-border-color: var(--bs-border-color-translucent);--bs-offcanvas-box-shadow: var(--bs-box-shadow-sm);--bs-offcanvas-transition: transform 0.3s ease-in-out;--bs-offcanvas-title-line-height: 1.5}@media(max-width: 539.98px){.offcanvas-sm{position:fixed;bottom:0;z-index:var(--bs-offcanvas-zindex);display:flex;flex-direction:column;max-width:100%;color:var(--bs-offcanvas-color);visibility:hidden;background-color:var(--bs-offcanvas-bg);background-clip:padding-box;outline:0;transition:var(--bs-offcanvas-transition)}}@media(max-width: 539.98px)and (prefers-reduced-motion: reduce){.offcanvas-sm{transition:none}}@media(max-width: 539.98px){.offcanvas-sm.offcanvas-start{top:0;left:0;width:var(--bs-offcanvas-width);border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(-100%)}.offcanvas-sm.offcanvas-end{top:0;right:0;width:var(--bs-offcanvas-width);border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(100%)}.offcanvas-sm.offcanvas-top{top:0;right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(-100%)}.offcanvas-sm.offcanvas-bottom{right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-sm.showing,.offcanvas-sm.show:not(.hiding){transform:none}.offcanvas-sm.showing,.offcanvas-sm.hiding,.offcanvas-sm.show{visibility:visible}}@media(min-width: 540px){.offcanvas-sm{--bs-offcanvas-height: auto;--bs-offcanvas-border-width: 0;background-color:rgba(0,0,0,0) !important}.offcanvas-sm .offcanvas-header{display:none}.offcanvas-sm .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible;background-color:rgba(0,0,0,0) !important}}@media(max-width: 719.98px){.offcanvas-md{position:fixed;bottom:0;z-index:var(--bs-offcanvas-zindex);display:flex;flex-direction:column;max-width:100%;color:var(--bs-offcanvas-color);visibility:hidden;background-color:var(--bs-offcanvas-bg);background-clip:padding-box;outline:0;transition:var(--bs-offcanvas-transition)}}@media(max-width: 719.98px)and (prefers-reduced-motion: reduce){.offcanvas-md{transition:none}}@media(max-width: 719.98px){.offcanvas-md.offcanvas-start{top:0;left:0;width:var(--bs-offcanvas-width);border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(-100%)}.offcanvas-md.offcanvas-end{top:0;right:0;width:var(--bs-offcanvas-width);border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(100%)}.offcanvas-md.offcanvas-top{top:0;right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(-100%)}.offcanvas-md.offcanvas-bottom{right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-md.showing,.offcanvas-md.show:not(.hiding){transform:none}.offcanvas-md.showing,.offcanvas-md.hiding,.offcanvas-md.show{visibility:visible}}@media(min-width: 720px){.offcanvas-md{--bs-offcanvas-height: auto;--bs-offcanvas-border-width: 0;background-color:rgba(0,0,0,0) !important}.offcanvas-md .offcanvas-header{display:none}.offcanvas-md .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible;background-color:rgba(0,0,0,0) !important}}@media(max-width: 959.98px){.offcanvas-lg{position:fixed;bottom:0;z-index:var(--bs-offcanvas-zindex);display:flex;flex-direction:column;max-width:100%;color:var(--bs-offcanvas-color);visibility:hidden;background-color:var(--bs-offcanvas-bg);background-clip:padding-box;outline:0;transition:var(--bs-offcanvas-transition)}}@media(max-width: 959.98px)and (prefers-reduced-motion: reduce){.offcanvas-lg{transition:none}}@media(max-width: 959.98px){.offcanvas-lg.offcanvas-start{top:0;left:0;width:var(--bs-offcanvas-width);border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(-100%)}.offcanvas-lg.offcanvas-end{top:0;right:0;width:var(--bs-offcanvas-width);border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(100%)}.offcanvas-lg.offcanvas-top{top:0;right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(-100%)}.offcanvas-lg.offcanvas-bottom{right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-lg.showing,.offcanvas-lg.show:not(.hiding){transform:none}.offcanvas-lg.showing,.offcanvas-lg.hiding,.offcanvas-lg.show{visibility:visible}}@media(min-width: 960px){.offcanvas-lg{--bs-offcanvas-height: auto;--bs-offcanvas-border-width: 0;background-color:rgba(0,0,0,0) !important}.offcanvas-lg .offcanvas-header{display:none}.offcanvas-lg .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible;background-color:rgba(0,0,0,0) !important}}@media(max-width: 1199.98px){.offcanvas-xl{position:fixed;bottom:0;z-index:var(--bs-offcanvas-zindex);display:flex;flex-direction:column;max-width:100%;color:var(--bs-offcanvas-color);visibility:hidden;background-color:var(--bs-offcanvas-bg);background-clip:padding-box;outline:0;transition:var(--bs-offcanvas-transition)}}@media(max-width: 1199.98px)and (prefers-reduced-motion: reduce){.offcanvas-xl{transition:none}}@media(max-width: 1199.98px){.offcanvas-xl.offcanvas-start{top:0;left:0;width:var(--bs-offcanvas-width);border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(-100%)}.offcanvas-xl.offcanvas-end{top:0;right:0;width:var(--bs-offcanvas-width);border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(100%)}.offcanvas-xl.offcanvas-top{top:0;right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(-100%)}.offcanvas-xl.offcanvas-bottom{right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas-xl.showing,.offcanvas-xl.show:not(.hiding){transform:none}.offcanvas-xl.showing,.offcanvas-xl.hiding,.offcanvas-xl.show{visibility:visible}}@media(min-width: 1200px){.offcanvas-xl{--bs-offcanvas-height: auto;--bs-offcanvas-border-width: 0;background-color:rgba(0,0,0,0) !important}.offcanvas-xl .offcanvas-header{display:none}.offcanvas-xl .offcanvas-body{display:flex;flex-grow:0;padding:0;overflow-y:visible;background-color:rgba(0,0,0,0) !important}}.offcanvas{position:fixed;bottom:0;z-index:var(--bs-offcanvas-zindex);display:flex;flex-direction:column;max-width:100%;color:var(--bs-offcanvas-color);visibility:hidden;background-color:var(--bs-offcanvas-bg);background-clip:padding-box;outline:0;transition:var(--bs-offcanvas-transition)}@media(prefers-reduced-motion: reduce){.offcanvas{transition:none}}.offcanvas.offcanvas-start{top:0;left:0;width:var(--bs-offcanvas-width);border-right:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(-100%)}.offcanvas.offcanvas-end{top:0;right:0;width:var(--bs-offcanvas-width);border-left:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateX(100%)}.offcanvas.offcanvas-top{top:0;right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-bottom:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(-100%)}.offcanvas.offcanvas-bottom{right:0;left:0;height:var(--bs-offcanvas-height);max-height:100%;border-top:var(--bs-offcanvas-border-width) solid var(--bs-offcanvas-border-color);transform:translateY(100%)}.offcanvas.showing,.offcanvas.show:not(.hiding){transform:none}.offcanvas.showing,.offcanvas.hiding,.offcanvas.show{visibility:visible}.offcanvas-backdrop{position:fixed;top:0;left:0;z-index:1040;width:100vw;height:100vh;background-color:#000}.offcanvas-backdrop.fade{opacity:0}.offcanvas-backdrop.show{opacity:.5}.offcanvas-header{display:flex;align-items:center;justify-content:space-between;padding:var(--bs-offcanvas-padding-y) var(--bs-offcanvas-padding-x)}.offcanvas-header .btn-close{padding:calc(var(--bs-offcanvas-padding-y)*.5) calc(var(--bs-offcanvas-padding-x)*.5);margin-top:calc(-0.5*var(--bs-offcanvas-padding-y));margin-right:calc(-0.5*var(--bs-offcanvas-padding-x));margin-bottom:calc(-0.5*var(--bs-offcanvas-padding-y))}.offcanvas-title{margin-bottom:0;line-height:var(--bs-offcanvas-title-line-height)}.offcanvas-body{flex-grow:1;padding:var(--bs-offcanvas-padding-y) var(--bs-offcanvas-padding-x);overflow-y:auto}.placeholder{display:inline-block;min-height:1em;vertical-align:middle;cursor:wait;background-color:currentcolor;opacity:.5}.placeholder.btn::before{display:inline-block;content:\"\"}.placeholder-xs{min-height:.6em}.placeholder-sm{min-height:.8em}.placeholder-lg{min-height:1.2em}.placeholder-glow .placeholder{animation:placeholder-glow 2s ease-in-out infinite}@keyframes placeholder-glow{50%{opacity:.2}}.placeholder-wave{mask-image:linear-gradient(130deg, #000 55%, rgba(0, 0, 0, 0.8) 75%, #000 95%);mask-size:200% 100%;animation:placeholder-wave 2s linear infinite}@keyframes placeholder-wave{100%{mask-position:-200% 0%}}.clearfix::after{display:block;clear:both;content:\"\"}.text-bg-primary{color:#fff !important;background-color:RGBA(var(--bs-primary-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-secondary{color:#fff !important;background-color:RGBA(var(--bs-secondary-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-success{color:#fff !important;background-color:RGBA(var(--bs-success-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-info{color:#000 !important;background-color:RGBA(var(--bs-info-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-warning{color:#000 !important;background-color:RGBA(var(--bs-warning-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-danger{color:#fff !important;background-color:RGBA(var(--bs-danger-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-light{color:#000 !important;background-color:RGBA(var(--bs-light-rgb), var(--bs-bg-opacity, 1)) !important}.text-bg-dark{color:#fff !important;background-color:RGBA(var(--bs-dark-rgb), var(--bs-bg-opacity, 1)) !important}.link-primary{color:RGBA(var(--bs-primary-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-primary-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-primary:hover,.link-primary:focus{color:RGBA(10, 88, 202, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(10, 88, 202, var(--bs-link-underline-opacity, 1)) !important}.link-secondary{color:RGBA(var(--bs-secondary-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-secondary-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-secondary:hover,.link-secondary:focus{color:RGBA(86, 94, 100, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(86, 94, 100, var(--bs-link-underline-opacity, 1)) !important}.link-success{color:RGBA(var(--bs-success-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-success-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-success:hover,.link-success:focus{color:RGBA(20, 108, 67, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(20, 108, 67, var(--bs-link-underline-opacity, 1)) !important}.link-info{color:RGBA(var(--bs-info-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-info-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-info:hover,.link-info:focus{color:RGBA(61, 213, 243, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(61, 213, 243, var(--bs-link-underline-opacity, 1)) !important}.link-warning{color:RGBA(var(--bs-warning-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-warning-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-warning:hover,.link-warning:focus{color:RGBA(255, 205, 57, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(255, 205, 57, var(--bs-link-underline-opacity, 1)) !important}.link-danger{color:RGBA(var(--bs-danger-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-danger-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-danger:hover,.link-danger:focus{color:RGBA(176, 42, 55, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(176, 42, 55, var(--bs-link-underline-opacity, 1)) !important}.link-light{color:RGBA(var(--bs-light-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-light-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-light:hover,.link-light:focus{color:RGBA(249, 250, 251, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(249, 250, 251, var(--bs-link-underline-opacity, 1)) !important}.link-dark{color:RGBA(var(--bs-dark-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-dark-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-dark:hover,.link-dark:focus{color:RGBA(26, 30, 33, var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(26, 30, 33, var(--bs-link-underline-opacity, 1)) !important}.link-body-emphasis{color:RGBA(var(--bs-emphasis-color-rgb), var(--bs-link-opacity, 1)) !important;text-decoration-color:RGBA(var(--bs-emphasis-color-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-body-emphasis:hover,.link-body-emphasis:focus{color:RGBA(var(--bs-emphasis-color-rgb), var(--bs-link-opacity, 0.75)) !important;text-decoration-color:RGBA(var(--bs-emphasis-color-rgb), var(--bs-link-underline-opacity, 0.75)) !important}.focus-ring:focus{outline:0;box-shadow:var(--bs-focus-ring-x, 0) var(--bs-focus-ring-y, 0) var(--bs-focus-ring-blur, 0) var(--bs-focus-ring-width) var(--bs-focus-ring-color)}.icon-link{display:inline-flex;gap:.375rem;align-items:center;text-decoration-color:rgba(var(--bs-link-color-rgb), var(--bs-link-opacity, 0.5));text-underline-offset:.25em;backface-visibility:hidden}.icon-link>.bi{flex-shrink:0;width:1em;height:1em;fill:currentcolor;transition:.2s ease-in-out transform}@media(prefers-reduced-motion: reduce){.icon-link>.bi{transition:none}}.icon-link-hover:hover>.bi,.icon-link-hover:focus-visible>.bi{transform:var(--bs-icon-link-transform, translate3d(0.25em, 0, 0))}.ratio{position:relative;width:100%}.ratio::before{display:block;padding-top:var(--bs-aspect-ratio);content:\"\"}.ratio>*{position:absolute;top:0;left:0;width:100%;height:100%}.ratio-1x1{--bs-aspect-ratio: 100%}.ratio-4x3{--bs-aspect-ratio: 75%}.ratio-16x9{--bs-aspect-ratio: 56.25%}.ratio-21x9{--bs-aspect-ratio: 42.8571428571%}.fixed-top{position:fixed;top:0;right:0;left:0;z-index:1030}.fixed-bottom{position:fixed;right:0;bottom:0;left:0;z-index:1030}.sticky-top{position:sticky;top:0;z-index:1020}.sticky-bottom{position:sticky;bottom:0;z-index:1020}@media(min-width: 540px){.sticky-sm-top{position:sticky;top:0;z-index:1020}.sticky-sm-bottom{position:sticky;bottom:0;z-index:1020}}@media(min-width: 720px){.sticky-md-top{position:sticky;top:0;z-index:1020}.sticky-md-bottom{position:sticky;bottom:0;z-index:1020}}@media(min-width: 960px){.sticky-lg-top{position:sticky;top:0;z-index:1020}.sticky-lg-bottom{position:sticky;bottom:0;z-index:1020}}@media(min-width: 1200px){.sticky-xl-top{position:sticky;top:0;z-index:1020}.sticky-xl-bottom{position:sticky;bottom:0;z-index:1020}}.hstack{display:flex;flex-direction:row;align-items:center;align-self:stretch}.vstack{display:flex;flex:1 1 auto;flex-direction:column;align-self:stretch}.visually-hidden,.visually-hidden-focusable:not(:focus):not(:focus-within){width:1px !important;height:1px !important;padding:0 !important;margin:-1px !important;overflow:hidden !important;clip:rect(0, 0, 0, 0) !important;white-space:nowrap !important;border:0 !important}.visually-hidden:not(caption),.visually-hidden-focusable:not(:focus):not(:focus-within):not(caption){position:absolute !important}.stretched-link::after{position:absolute;top:0;right:0;bottom:0;left:0;z-index:1;content:\"\"}.text-truncate{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.vr{display:inline-block;align-self:stretch;width:var(--bs-border-width);min-height:1em;background-color:currentcolor;opacity:.25}.align-baseline{vertical-align:baseline !important}.align-top{vertical-align:top !important}.align-middle{vertical-align:middle !important}.align-bottom{vertical-align:bottom !important}.align-text-bottom{vertical-align:text-bottom !important}.align-text-top{vertical-align:text-top !important}.float-start{float:left !important}.float-end{float:right !important}.float-none{float:none !important}.object-fit-contain{object-fit:contain !important}.object-fit-cover{object-fit:cover !important}.object-fit-fill{object-fit:fill !important}.object-fit-scale{object-fit:scale-down !important}.object-fit-none{object-fit:none !important}.opacity-0{opacity:0 !important}.opacity-25{opacity:.25 !important}.opacity-50{opacity:.5 !important}.opacity-75{opacity:.75 !important}.opacity-100{opacity:1 !important}.overflow-auto{overflow:auto !important}.overflow-hidden{overflow:hidden !important}.overflow-visible{overflow:visible !important}.overflow-scroll{overflow:scroll !important}.overflow-x-auto{overflow-x:auto !important}.overflow-x-hidden{overflow-x:hidden !important}.overflow-x-visible{overflow-x:visible !important}.overflow-x-scroll{overflow-x:scroll !important}.overflow-y-auto{overflow-y:auto !important}.overflow-y-hidden{overflow-y:hidden !important}.overflow-y-visible{overflow-y:visible !important}.overflow-y-scroll{overflow-y:scroll !important}.d-inline{display:inline !important}.d-inline-block{display:inline-block !important}.d-block{display:block !important}.d-grid{display:grid !important}.d-inline-grid{display:inline-grid !important}.d-table{display:table !important}.d-table-row{display:table-row !important}.d-table-cell{display:table-cell !important}.d-flex{display:flex !important}.d-inline-flex{display:inline-flex !important}.d-none{display:none !important}.shadow{box-shadow:var(--bs-box-shadow) !important}.shadow-sm{box-shadow:var(--bs-box-shadow-sm) !important}.shadow-lg{box-shadow:var(--bs-box-shadow-lg) !important}.shadow-none{box-shadow:none !important}.focus-ring-primary{--bs-focus-ring-color: rgba(var(--bs-primary-rgb), var(--bs-focus-ring-opacity))}.focus-ring-secondary{--bs-focus-ring-color: rgba(var(--bs-secondary-rgb), var(--bs-focus-ring-opacity))}.focus-ring-success{--bs-focus-ring-color: rgba(var(--bs-success-rgb), var(--bs-focus-ring-opacity))}.focus-ring-info{--bs-focus-ring-color: rgba(var(--bs-info-rgb), var(--bs-focus-ring-opacity))}.focus-ring-warning{--bs-focus-ring-color: rgba(var(--bs-warning-rgb), var(--bs-focus-ring-opacity))}.focus-ring-danger{--bs-focus-ring-color: rgba(var(--bs-danger-rgb), var(--bs-focus-ring-opacity))}.focus-ring-light{--bs-focus-ring-color: rgba(var(--bs-light-rgb), var(--bs-focus-ring-opacity))}.focus-ring-dark{--bs-focus-ring-color: rgba(var(--bs-dark-rgb), var(--bs-focus-ring-opacity))}.position-static{position:static !important}.position-relative{position:relative !important}.position-absolute{position:absolute !important}.position-fixed{position:fixed !important}.position-sticky{position:sticky !important}.top-0{top:0 !important}.top-50{top:50% !important}.top-100{top:100% !important}.bottom-0{bottom:0 !important}.bottom-50{bottom:50% !important}.bottom-100{bottom:100% !important}.start-0{left:0 !important}.start-50{left:50% !important}.start-100{left:100% !important}.end-0{right:0 !important}.end-50{right:50% !important}.end-100{right:100% !important}.translate-middle{transform:translate(-50%, -50%) !important}.translate-middle-x{transform:translateX(-50%) !important}.translate-middle-y{transform:translateY(-50%) !important}.border{border:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color) !important}.border-0{border:0 !important}.border-top{border-top:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color) !important}.border-top-0{border-top:0 !important}.border-end{border-right:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color) !important}.border-end-0{border-right:0 !important}.border-bottom{border-bottom:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color) !important}.border-bottom-0{border-bottom:0 !important}.border-start{border-left:var(--bs-border-width) var(--bs-border-style) var(--bs-border-color) !important}.border-start-0{border-left:0 !important}.border-primary{--bs-border-opacity: 1;border-color:rgba(var(--bs-primary-rgb), var(--bs-border-opacity)) !important}.border-secondary{--bs-border-opacity: 1;border-color:rgba(var(--bs-secondary-rgb), var(--bs-border-opacity)) !important}.border-success{--bs-border-opacity: 1;border-color:rgba(var(--bs-success-rgb), var(--bs-border-opacity)) !important}.border-info{--bs-border-opacity: 1;border-color:rgba(var(--bs-info-rgb), var(--bs-border-opacity)) !important}.border-warning{--bs-border-opacity: 1;border-color:rgba(var(--bs-warning-rgb), var(--bs-border-opacity)) !important}.border-danger{--bs-border-opacity: 1;border-color:rgba(var(--bs-danger-rgb), var(--bs-border-opacity)) !important}.border-light{--bs-border-opacity: 1;border-color:rgba(var(--bs-light-rgb), var(--bs-border-opacity)) !important}.border-dark{--bs-border-opacity: 1;border-color:rgba(var(--bs-dark-rgb), var(--bs-border-opacity)) !important}.border-black{--bs-border-opacity: 1;border-color:rgba(var(--bs-black-rgb), var(--bs-border-opacity)) !important}.border-white{--bs-border-opacity: 1;border-color:rgba(var(--bs-white-rgb), var(--bs-border-opacity)) !important}.border-primary-subtle{border-color:var(--bs-primary-border-subtle) !important}.border-secondary-subtle{border-color:var(--bs-secondary-border-subtle) !important}.border-success-subtle{border-color:var(--bs-success-border-subtle) !important}.border-info-subtle{border-color:var(--bs-info-border-subtle) !important}.border-warning-subtle{border-color:var(--bs-warning-border-subtle) !important}.border-danger-subtle{border-color:var(--bs-danger-border-subtle) !important}.border-light-subtle{border-color:var(--bs-light-border-subtle) !important}.border-dark-subtle{border-color:var(--bs-dark-border-subtle) !important}.border-1{border-width:1px !important}.border-2{border-width:2px !important}.border-3{border-width:3px !important}.border-4{border-width:4px !important}.border-5{border-width:5px !important}.border-opacity-10{--bs-border-opacity: 0.1}.border-opacity-25{--bs-border-opacity: 0.25}.border-opacity-50{--bs-border-opacity: 0.5}.border-opacity-75{--bs-border-opacity: 0.75}.border-opacity-100{--bs-border-opacity: 1}.w-25{width:25% !important}.w-50{width:50% !important}.w-75{width:75% !important}.w-100{width:100% !important}.w-auto{width:auto !important}.mw-100{max-width:100% !important}.vw-100{width:100vw !important}.min-vw-100{min-width:100vw !important}.h-25{height:25% !important}.h-50{height:50% !important}.h-75{height:75% !important}.h-100{height:100% !important}.h-auto{height:auto !important}.mh-100{max-height:100% !important}.vh-100{height:100vh !important}.min-vh-100{min-height:100vh !important}.flex-fill{flex:1 1 auto !important}.flex-row{flex-direction:row !important}.flex-column{flex-direction:column !important}.flex-row-reverse{flex-direction:row-reverse !important}.flex-column-reverse{flex-direction:column-reverse !important}.flex-grow-0{flex-grow:0 !important}.flex-grow-1{flex-grow:1 !important}.flex-shrink-0{flex-shrink:0 !important}.flex-shrink-1{flex-shrink:1 !important}.flex-wrap{flex-wrap:wrap !important}.flex-nowrap{flex-wrap:nowrap !important}.flex-wrap-reverse{flex-wrap:wrap-reverse !important}.justify-content-start{justify-content:flex-start !important}.justify-content-end{justify-content:flex-end !important}.justify-content-center{justify-content:center !important}.justify-content-between{justify-content:space-between !important}.justify-content-around{justify-content:space-around !important}.justify-content-evenly{justify-content:space-evenly !important}.align-items-start{align-items:flex-start !important}.align-items-end{align-items:flex-end !important}.align-items-center{align-items:center !important}.align-items-baseline{align-items:baseline !important}.align-items-stretch{align-items:stretch !important}.align-content-start{align-content:flex-start !important}.align-content-end{align-content:flex-end !important}.align-content-center{align-content:center !important}.align-content-between{align-content:space-between !important}.align-content-around{align-content:space-around !important}.align-content-stretch{align-content:stretch !important}.align-self-auto{align-self:auto !important}.align-self-start{align-self:flex-start !important}.align-self-end{align-self:flex-end !important}.align-self-center{align-self:center !important}.align-self-baseline{align-self:baseline !important}.align-self-stretch{align-self:stretch !important}.order-first{order:-1 !important}.order-0{order:0 !important}.order-1{order:1 !important}.order-2{order:2 !important}.order-3{order:3 !important}.order-4{order:4 !important}.order-5{order:5 !important}.order-last{order:6 !important}.m-0{margin:0 !important}.m-1{margin:.25rem !important}.m-2{margin:.5rem !important}.m-3{margin:1rem !important}.m-4{margin:1.5rem !important}.m-5{margin:3rem !important}.m-auto{margin:auto !important}.mx-0{margin-right:0 !important;margin-left:0 !important}.mx-1{margin-right:.25rem !important;margin-left:.25rem !important}.mx-2{margin-right:.5rem !important;margin-left:.5rem !important}.mx-3{margin-right:1rem !important;margin-left:1rem !important}.mx-4{margin-right:1.5rem !important;margin-left:1.5rem !important}.mx-5{margin-right:3rem !important;margin-left:3rem !important}.mx-auto{margin-right:auto !important;margin-left:auto !important}.my-0{margin-top:0 !important;margin-bottom:0 !important}.my-1{margin-top:.25rem !important;margin-bottom:.25rem !important}.my-2{margin-top:.5rem !important;margin-bottom:.5rem !important}.my-3{margin-top:1rem !important;margin-bottom:1rem !important}.my-4{margin-top:1.5rem !important;margin-bottom:1.5rem !important}.my-5{margin-top:3rem !important;margin-bottom:3rem !important}.my-auto{margin-top:auto !important;margin-bottom:auto !important}.mt-0{margin-top:0 !important}.mt-1{margin-top:.25rem !important}.mt-2{margin-top:.5rem !important}.mt-3{margin-top:1rem !important}.mt-4{margin-top:1.5rem !important}.mt-5{margin-top:3rem !important}.mt-auto{margin-top:auto !important}.me-0{margin-right:0 !important}.me-1{margin-right:.25rem !important}.me-2{margin-right:.5rem !important}.me-3{margin-right:1rem !important}.me-4{margin-right:1.5rem !important}.me-5{margin-right:3rem !important}.me-auto{margin-right:auto !important}.mb-0{margin-bottom:0 !important}.mb-1{margin-bottom:.25rem !important}.mb-2{margin-bottom:.5rem !important}.mb-3{margin-bottom:1rem !important}.mb-4{margin-bottom:1.5rem !important}.mb-5{margin-bottom:3rem !important}.mb-auto{margin-bottom:auto !important}.ms-0{margin-left:0 !important}.ms-1{margin-left:.25rem !important}.ms-2{margin-left:.5rem !important}.ms-3{margin-left:1rem !important}.ms-4{margin-left:1.5rem !important}.ms-5{margin-left:3rem !important}.ms-auto{margin-left:auto !important}.p-0{padding:0 !important}.p-1{padding:.25rem !important}.p-2{padding:.5rem !important}.p-3{padding:1rem !important}.p-4{padding:1.5rem !important}.p-5{padding:3rem !important}.px-0{padding-right:0 !important;padding-left:0 !important}.px-1{padding-right:.25rem !important;padding-left:.25rem !important}.px-2{padding-right:.5rem !important;padding-left:.5rem !important}.px-3{padding-right:1rem !important;padding-left:1rem !important}.px-4{padding-right:1.5rem !important;padding-left:1.5rem !important}.px-5{padding-right:3rem !important;padding-left:3rem !important}.py-0{padding-top:0 !important;padding-bottom:0 !important}.py-1{padding-top:.25rem !important;padding-bottom:.25rem !important}.py-2{padding-top:.5rem !important;padding-bottom:.5rem !important}.py-3{padding-top:1rem !important;padding-bottom:1rem !important}.py-4{padding-top:1.5rem !important;padding-bottom:1.5rem !important}.py-5{padding-top:3rem !important;padding-bottom:3rem !important}.pt-0{padding-top:0 !important}.pt-1{padding-top:.25rem !important}.pt-2{padding-top:.5rem !important}.pt-3{padding-top:1rem !important}.pt-4{padding-top:1.5rem !important}.pt-5{padding-top:3rem !important}.pe-0{padding-right:0 !important}.pe-1{padding-right:.25rem !important}.pe-2{padding-right:.5rem !important}.pe-3{padding-right:1rem !important}.pe-4{padding-right:1.5rem !important}.pe-5{padding-right:3rem !important}.pb-0{padding-bottom:0 !important}.pb-1{padding-bottom:.25rem !important}.pb-2{padding-bottom:.5rem !important}.pb-3{padding-bottom:1rem !important}.pb-4{padding-bottom:1.5rem !important}.pb-5{padding-bottom:3rem !important}.ps-0{padding-left:0 !important}.ps-1{padding-left:.25rem !important}.ps-2{padding-left:.5rem !important}.ps-3{padding-left:1rem !important}.ps-4{padding-left:1.5rem !important}.ps-5{padding-left:3rem !important}.gap-0{gap:0 !important}.gap-1{gap:.25rem !important}.gap-2{gap:.5rem !important}.gap-3{gap:1rem !important}.gap-4{gap:1.5rem !important}.gap-5{gap:3rem !important}.row-gap-0{row-gap:0 !important}.row-gap-1{row-gap:.25rem !important}.row-gap-2{row-gap:.5rem !important}.row-gap-3{row-gap:1rem !important}.row-gap-4{row-gap:1.5rem !important}.row-gap-5{row-gap:3rem !important}.column-gap-0{column-gap:0 !important}.column-gap-1{column-gap:.25rem !important}.column-gap-2{column-gap:.5rem !important}.column-gap-3{column-gap:1rem !important}.column-gap-4{column-gap:1.5rem !important}.column-gap-5{column-gap:3rem !important}.font-monospace{font-family:var(--bs-font-monospace) !important}.fs-1{font-size:calc(1.375rem + 1.5vw) !important}.fs-2{font-size:calc(1.325rem + 0.9vw) !important}.fs-3{font-size:calc(1.3rem + 0.6vw) !important}.fs-4{font-size:calc(1.275rem + 0.3vw) !important}.fs-5{font-size:1.25rem !important}.fs-6{font-size:1rem !important}.fst-italic{font-style:italic !important}.fst-normal{font-style:normal !important}.fw-lighter{font-weight:lighter !important}.fw-light{font-weight:300 !important}.fw-normal{font-weight:400 !important}.fw-medium{font-weight:500 !important}.fw-semibold{font-weight:600 !important}.fw-bold{font-weight:700 !important}.fw-bolder{font-weight:bolder !important}.lh-1{line-height:1 !important}.lh-sm{line-height:1.25 !important}.lh-base{line-height:1.5 !important}.lh-lg{line-height:2 !important}.text-start{text-align:left !important}.text-end{text-align:right !important}.text-center{text-align:center !important}.text-decoration-none{text-decoration:none !important}.text-decoration-underline{text-decoration:underline !important}.text-decoration-line-through{text-decoration:line-through !important}.text-lowercase{text-transform:lowercase !important}.text-uppercase{text-transform:uppercase !important}.text-capitalize{text-transform:capitalize !important}.text-wrap{white-space:normal !important}.text-nowrap{white-space:nowrap !important}.text-break{word-wrap:break-word !important;word-break:break-word !important}.text-primary{--bs-text-opacity: 1;color:rgba(var(--bs-primary-rgb), var(--bs-text-opacity)) !important}.text-secondary{--bs-text-opacity: 1;color:rgba(var(--bs-secondary-rgb), var(--bs-text-opacity)) !important}.text-success{--bs-text-opacity: 1;color:rgba(var(--bs-success-rgb), var(--bs-text-opacity)) !important}.text-info{--bs-text-opacity: 1;color:rgba(var(--bs-info-rgb), var(--bs-text-opacity)) !important}.text-warning{--bs-text-opacity: 1;color:rgba(var(--bs-warning-rgb), var(--bs-text-opacity)) !important}.text-danger{--bs-text-opacity: 1;color:rgba(var(--bs-danger-rgb), var(--bs-text-opacity)) !important}.text-light{--bs-text-opacity: 1;color:rgba(var(--bs-light-rgb), var(--bs-text-opacity)) !important}.text-dark{--bs-text-opacity: 1;color:rgba(var(--bs-dark-rgb), var(--bs-text-opacity)) !important}.text-black{--bs-text-opacity: 1;color:rgba(var(--bs-black-rgb), var(--bs-text-opacity)) !important}.text-white{--bs-text-opacity: 1;color:rgba(var(--bs-white-rgb), var(--bs-text-opacity)) !important}.text-body{--bs-text-opacity: 1;color:rgba(var(--bs-body-color-rgb), var(--bs-text-opacity)) !important}.text-muted{--bs-text-opacity: 1;color:var(--bs-secondary-color) !important}.text-black-50{--bs-text-opacity: 1;color:rgba(0,0,0,.5) !important}.text-white-50{--bs-text-opacity: 1;color:rgba(255,255,255,.5) !important}.text-body-secondary{--bs-text-opacity: 1;color:var(--bs-secondary-color) !important}.text-body-tertiary{--bs-text-opacity: 1;color:var(--bs-tertiary-color) !important}.text-body-emphasis{--bs-text-opacity: 1;color:var(--bs-emphasis-color) !important}.text-reset{--bs-text-opacity: 1;color:inherit !important}.text-opacity-25{--bs-text-opacity: 0.25}.text-opacity-50{--bs-text-opacity: 0.5}.text-opacity-75{--bs-text-opacity: 0.75}.text-opacity-100{--bs-text-opacity: 1}.text-primary-emphasis{color:var(--bs-primary-text-emphasis) !important}.text-secondary-emphasis{color:var(--bs-secondary-text-emphasis) !important}.text-success-emphasis{color:var(--bs-success-text-emphasis) !important}.text-info-emphasis{color:var(--bs-info-text-emphasis) !important}.text-warning-emphasis{color:var(--bs-warning-text-emphasis) !important}.text-danger-emphasis{color:var(--bs-danger-text-emphasis) !important}.text-light-emphasis{color:var(--bs-light-text-emphasis) !important}.text-dark-emphasis{color:var(--bs-dark-text-emphasis) !important}.link-opacity-10{--bs-link-opacity: 0.1}.link-opacity-10-hover:hover{--bs-link-opacity: 0.1}.link-opacity-25{--bs-link-opacity: 0.25}.link-opacity-25-hover:hover{--bs-link-opacity: 0.25}.link-opacity-50{--bs-link-opacity: 0.5}.link-opacity-50-hover:hover{--bs-link-opacity: 0.5}.link-opacity-75{--bs-link-opacity: 0.75}.link-opacity-75-hover:hover{--bs-link-opacity: 0.75}.link-opacity-100{--bs-link-opacity: 1}.link-opacity-100-hover:hover{--bs-link-opacity: 1}.link-offset-1{text-underline-offset:.125em !important}.link-offset-1-hover:hover{text-underline-offset:.125em !important}.link-offset-2{text-underline-offset:.25em !important}.link-offset-2-hover:hover{text-underline-offset:.25em !important}.link-offset-3{text-underline-offset:.375em !important}.link-offset-3-hover:hover{text-underline-offset:.375em !important}.link-underline-primary{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-primary-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-secondary{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-secondary-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-success{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-success-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-info{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-info-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-warning{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-warning-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-danger{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-danger-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-light{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-light-rgb), var(--bs-link-underline-opacity)) !important}.link-underline-dark{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-dark-rgb), var(--bs-link-underline-opacity)) !important}.link-underline{--bs-link-underline-opacity: 1;text-decoration-color:rgba(var(--bs-link-color-rgb), var(--bs-link-underline-opacity, 1)) !important}.link-underline-opacity-0{--bs-link-underline-opacity: 0}.link-underline-opacity-0-hover:hover{--bs-link-underline-opacity: 0}.link-underline-opacity-10{--bs-link-underline-opacity: 0.1}.link-underline-opacity-10-hover:hover{--bs-link-underline-opacity: 0.1}.link-underline-opacity-25{--bs-link-underline-opacity: 0.25}.link-underline-opacity-25-hover:hover{--bs-link-underline-opacity: 0.25}.link-underline-opacity-50{--bs-link-underline-opacity: 0.5}.link-underline-opacity-50-hover:hover{--bs-link-underline-opacity: 0.5}.link-underline-opacity-75{--bs-link-underline-opacity: 0.75}.link-underline-opacity-75-hover:hover{--bs-link-underline-opacity: 0.75}.link-underline-opacity-100{--bs-link-underline-opacity: 1}.link-underline-opacity-100-hover:hover{--bs-link-underline-opacity: 1}.bg-primary{--bs-bg-opacity: 1;background-color:rgba(var(--bs-primary-rgb), var(--bs-bg-opacity)) !important}.bg-secondary{--bs-bg-opacity: 1;background-color:rgba(var(--bs-secondary-rgb), var(--bs-bg-opacity)) !important}.bg-success{--bs-bg-opacity: 1;background-color:rgba(var(--bs-success-rgb), var(--bs-bg-opacity)) !important}.bg-info{--bs-bg-opacity: 1;background-color:rgba(var(--bs-info-rgb), var(--bs-bg-opacity)) !important}.bg-warning{--bs-bg-opacity: 1;background-color:rgba(var(--bs-warning-rgb), var(--bs-bg-opacity)) !important}.bg-danger{--bs-bg-opacity: 1;background-color:rgba(var(--bs-danger-rgb), var(--bs-bg-opacity)) !important}.bg-light{--bs-bg-opacity: 1;background-color:rgba(var(--bs-light-rgb), var(--bs-bg-opacity)) !important}.bg-dark{--bs-bg-opacity: 1;background-color:rgba(var(--bs-dark-rgb), var(--bs-bg-opacity)) !important}.bg-black{--bs-bg-opacity: 1;background-color:rgba(var(--bs-black-rgb), var(--bs-bg-opacity)) !important}.bg-white{--bs-bg-opacity: 1;background-color:rgba(var(--bs-white-rgb), var(--bs-bg-opacity)) !important}.bg-body{--bs-bg-opacity: 1;background-color:rgba(var(--bs-body-bg-rgb), var(--bs-bg-opacity)) !important}.bg-transparent{--bs-bg-opacity: 1;background-color:rgba(0,0,0,0) !important}.bg-body-secondary{--bs-bg-opacity: 1;background-color:rgba(var(--bs-secondary-bg-rgb), var(--bs-bg-opacity)) !important}.bg-body-tertiary{--bs-bg-opacity: 1;background-color:rgba(var(--bs-tertiary-bg-rgb), var(--bs-bg-opacity)) !important}.bg-opacity-10{--bs-bg-opacity: 0.1}.bg-opacity-25{--bs-bg-opacity: 0.25}.bg-opacity-50{--bs-bg-opacity: 0.5}.bg-opacity-75{--bs-bg-opacity: 0.75}.bg-opacity-100{--bs-bg-opacity: 1}.bg-primary-subtle{background-color:var(--bs-primary-bg-subtle) !important}.bg-secondary-subtle{background-color:var(--bs-secondary-bg-subtle) !important}.bg-success-subtle{background-color:var(--bs-success-bg-subtle) !important}.bg-info-subtle{background-color:var(--bs-info-bg-subtle) !important}.bg-warning-subtle{background-color:var(--bs-warning-bg-subtle) !important}.bg-danger-subtle{background-color:var(--bs-danger-bg-subtle) !important}.bg-light-subtle{background-color:var(--bs-light-bg-subtle) !important}.bg-dark-subtle{background-color:var(--bs-dark-bg-subtle) !important}.bg-gradient{background-image:var(--bs-gradient) !important}.user-select-all{user-select:all !important}.user-select-auto{user-select:auto !important}.user-select-none{user-select:none !important}.pe-none{pointer-events:none !important}.pe-auto{pointer-events:auto !important}.rounded{border-radius:var(--bs-border-radius) !important}.rounded-0{border-radius:0 !important}.rounded-1{border-radius:var(--bs-border-radius-sm) !important}.rounded-2{border-radius:var(--bs-border-radius) !important}.rounded-3{border-radius:var(--bs-border-radius-lg) !important}.rounded-4{border-radius:var(--bs-border-radius-xl) !important}.rounded-5{border-radius:var(--bs-border-radius-xxl) !important}.rounded-circle{border-radius:50% !important}.rounded-pill{border-radius:var(--bs-border-radius-pill) !important}.rounded-top{border-top-left-radius:var(--bs-border-radius) !important;border-top-right-radius:var(--bs-border-radius) !important}.rounded-top-0{border-top-left-radius:0 !important;border-top-right-radius:0 !important}.rounded-top-1{border-top-left-radius:var(--bs-border-radius-sm) !important;border-top-right-radius:var(--bs-border-radius-sm) !important}.rounded-top-2{border-top-left-radius:var(--bs-border-radius) !important;border-top-right-radius:var(--bs-border-radius) !important}.rounded-top-3{border-top-left-radius:var(--bs-border-radius-lg) !important;border-top-right-radius:var(--bs-border-radius-lg) !important}.rounded-top-4{border-top-left-radius:var(--bs-border-radius-xl) !important;border-top-right-radius:var(--bs-border-radius-xl) !important}.rounded-top-5{border-top-left-radius:var(--bs-border-radius-xxl) !important;border-top-right-radius:var(--bs-border-radius-xxl) !important}.rounded-top-circle{border-top-left-radius:50% !important;border-top-right-radius:50% !important}.rounded-top-pill{border-top-left-radius:var(--bs-border-radius-pill) !important;border-top-right-radius:var(--bs-border-radius-pill) !important}.rounded-end{border-top-right-radius:var(--bs-border-radius) !important;border-bottom-right-radius:var(--bs-border-radius) !important}.rounded-end-0{border-top-right-radius:0 !important;border-bottom-right-radius:0 !important}.rounded-end-1{border-top-right-radius:var(--bs-border-radius-sm) !important;border-bottom-right-radius:var(--bs-border-radius-sm) !important}.rounded-end-2{border-top-right-radius:var(--bs-border-radius) !important;border-bottom-right-radius:var(--bs-border-radius) !important}.rounded-end-3{border-top-right-radius:var(--bs-border-radius-lg) !important;border-bottom-right-radius:var(--bs-border-radius-lg) !important}.rounded-end-4{border-top-right-radius:var(--bs-border-radius-xl) !important;border-bottom-right-radius:var(--bs-border-radius-xl) !important}.rounded-end-5{border-top-right-radius:var(--bs-border-radius-xxl) !important;border-bottom-right-radius:var(--bs-border-radius-xxl) !important}.rounded-end-circle{border-top-right-radius:50% !important;border-bottom-right-radius:50% !important}.rounded-end-pill{border-top-right-radius:var(--bs-border-radius-pill) !important;border-bottom-right-radius:var(--bs-border-radius-pill) !important}.rounded-bottom{border-bottom-right-radius:var(--bs-border-radius) !important;border-bottom-left-radius:var(--bs-border-radius) !important}.rounded-bottom-0{border-bottom-right-radius:0 !important;border-bottom-left-radius:0 !important}.rounded-bottom-1{border-bottom-right-radius:var(--bs-border-radius-sm) !important;border-bottom-left-radius:var(--bs-border-radius-sm) !important}.rounded-bottom-2{border-bottom-right-radius:var(--bs-border-radius) !important;border-bottom-left-radius:var(--bs-border-radius) !important}.rounded-bottom-3{border-bottom-right-radius:var(--bs-border-radius-lg) !important;border-bottom-left-radius:var(--bs-border-radius-lg) !important}.rounded-bottom-4{border-bottom-right-radius:var(--bs-border-radius-xl) !important;border-bottom-left-radius:var(--bs-border-radius-xl) !important}.rounded-bottom-5{border-bottom-right-radius:var(--bs-border-radius-xxl) !important;border-bottom-left-radius:var(--bs-border-radius-xxl) !important}.rounded-bottom-circle{border-bottom-right-radius:50% !important;border-bottom-left-radius:50% !important}.rounded-bottom-pill{border-bottom-right-radius:var(--bs-border-radius-pill) !important;border-bottom-left-radius:var(--bs-border-radius-pill) !important}.rounded-start{border-bottom-left-radius:var(--bs-border-radius) !important;border-top-left-radius:var(--bs-border-radius) !important}.rounded-start-0{border-bottom-left-radius:0 !important;border-top-left-radius:0 !important}.rounded-start-1{border-bottom-left-radius:var(--bs-border-radius-sm) !important;border-top-left-radius:var(--bs-border-radius-sm) !important}.rounded-start-2{border-bottom-left-radius:var(--bs-border-radius) !important;border-top-left-radius:var(--bs-border-radius) !important}.rounded-start-3{border-bottom-left-radius:var(--bs-border-radius-lg) !important;border-top-left-radius:var(--bs-border-radius-lg) !important}.rounded-start-4{border-bottom-left-radius:var(--bs-border-radius-xl) !important;border-top-left-radius:var(--bs-border-radius-xl) !important}.rounded-start-5{border-bottom-left-radius:var(--bs-border-radius-xxl) !important;border-top-left-radius:var(--bs-border-radius-xxl) !important}.rounded-start-circle{border-bottom-left-radius:50% !important;border-top-left-radius:50% !important}.rounded-start-pill{border-bottom-left-radius:var(--bs-border-radius-pill) !important;border-top-left-radius:var(--bs-border-radius-pill) !important}.visible{visibility:visible !important}.invisible{visibility:hidden !important}.z-n1{z-index:-1 !important}.z-0{z-index:0 !important}.z-1{z-index:1 !important}.z-2{z-index:2 !important}.z-3{z-index:3 !important}@media(min-width: 540px){.float-sm-start{float:left !important}.float-sm-end{float:right !important}.float-sm-none{float:none !important}.object-fit-sm-contain{object-fit:contain !important}.object-fit-sm-cover{object-fit:cover !important}.object-fit-sm-fill{object-fit:fill !important}.object-fit-sm-scale{object-fit:scale-down !important}.object-fit-sm-none{object-fit:none !important}.d-sm-inline{display:inline !important}.d-sm-inline-block{display:inline-block !important}.d-sm-block{display:block !important}.d-sm-grid{display:grid !important}.d-sm-inline-grid{display:inline-grid !important}.d-sm-table{display:table !important}.d-sm-table-row{display:table-row !important}.d-sm-table-cell{display:table-cell !important}.d-sm-flex{display:flex !important}.d-sm-inline-flex{display:inline-flex !important}.d-sm-none{display:none !important}.flex-sm-fill{flex:1 1 auto !important}.flex-sm-row{flex-direction:row !important}.flex-sm-column{flex-direction:column !important}.flex-sm-row-reverse{flex-direction:row-reverse !important}.flex-sm-column-reverse{flex-direction:column-reverse !important}.flex-sm-grow-0{flex-grow:0 !important}.flex-sm-grow-1{flex-grow:1 !important}.flex-sm-shrink-0{flex-shrink:0 !important}.flex-sm-shrink-1{flex-shrink:1 !important}.flex-sm-wrap{flex-wrap:wrap !important}.flex-sm-nowrap{flex-wrap:nowrap !important}.flex-sm-wrap-reverse{flex-wrap:wrap-reverse !important}.justify-content-sm-start{justify-content:flex-start !important}.justify-content-sm-end{justify-content:flex-end !important}.justify-content-sm-center{justify-content:center !important}.justify-content-sm-between{justify-content:space-between !important}.justify-content-sm-around{justify-content:space-around !important}.justify-content-sm-evenly{justify-content:space-evenly !important}.align-items-sm-start{align-items:flex-start !important}.align-items-sm-end{align-items:flex-end !important}.align-items-sm-center{align-items:center !important}.align-items-sm-baseline{align-items:baseline !important}.align-items-sm-stretch{align-items:stretch !important}.align-content-sm-start{align-content:flex-start !important}.align-content-sm-end{align-content:flex-end !important}.align-content-sm-center{align-content:center !important}.align-content-sm-between{align-content:space-between !important}.align-content-sm-around{align-content:space-around !important}.align-content-sm-stretch{align-content:stretch !important}.align-self-sm-auto{align-self:auto !important}.align-self-sm-start{align-self:flex-start !important}.align-self-sm-end{align-self:flex-end !important}.align-self-sm-center{align-self:center !important}.align-self-sm-baseline{align-self:baseline !important}.align-self-sm-stretch{align-self:stretch !important}.order-sm-first{order:-1 !important}.order-sm-0{order:0 !important}.order-sm-1{order:1 !important}.order-sm-2{order:2 !important}.order-sm-3{order:3 !important}.order-sm-4{order:4 !important}.order-sm-5{order:5 !important}.order-sm-last{order:6 !important}.m-sm-0{margin:0 !important}.m-sm-1{margin:.25rem !important}.m-sm-2{margin:.5rem !important}.m-sm-3{margin:1rem !important}.m-sm-4{margin:1.5rem !important}.m-sm-5{margin:3rem !important}.m-sm-auto{margin:auto !important}.mx-sm-0{margin-right:0 !important;margin-left:0 !important}.mx-sm-1{margin-right:.25rem !important;margin-left:.25rem !important}.mx-sm-2{margin-right:.5rem !important;margin-left:.5rem !important}.mx-sm-3{margin-right:1rem !important;margin-left:1rem !important}.mx-sm-4{margin-right:1.5rem !important;margin-left:1.5rem !important}.mx-sm-5{margin-right:3rem !important;margin-left:3rem !important}.mx-sm-auto{margin-right:auto !important;margin-left:auto !important}.my-sm-0{margin-top:0 !important;margin-bottom:0 !important}.my-sm-1{margin-top:.25rem !important;margin-bottom:.25rem !important}.my-sm-2{margin-top:.5rem !important;margin-bottom:.5rem !important}.my-sm-3{margin-top:1rem !important;margin-bottom:1rem !important}.my-sm-4{margin-top:1.5rem !important;margin-bottom:1.5rem !important}.my-sm-5{margin-top:3rem !important;margin-bottom:3rem !important}.my-sm-auto{margin-top:auto !important;margin-bottom:auto !important}.mt-sm-0{margin-top:0 !important}.mt-sm-1{margin-top:.25rem !important}.mt-sm-2{margin-top:.5rem !important}.mt-sm-3{margin-top:1rem !important}.mt-sm-4{margin-top:1.5rem !important}.mt-sm-5{margin-top:3rem !important}.mt-sm-auto{margin-top:auto !important}.me-sm-0{margin-right:0 !important}.me-sm-1{margin-right:.25rem !important}.me-sm-2{margin-right:.5rem !important}.me-sm-3{margin-right:1rem !important}.me-sm-4{margin-right:1.5rem !important}.me-sm-5{margin-right:3rem !important}.me-sm-auto{margin-right:auto !important}.mb-sm-0{margin-bottom:0 !important}.mb-sm-1{margin-bottom:.25rem !important}.mb-sm-2{margin-bottom:.5rem !important}.mb-sm-3{margin-bottom:1rem !important}.mb-sm-4{margin-bottom:1.5rem !important}.mb-sm-5{margin-bottom:3rem !important}.mb-sm-auto{margin-bottom:auto !important}.ms-sm-0{margin-left:0 !important}.ms-sm-1{margin-left:.25rem !important}.ms-sm-2{margin-left:.5rem !important}.ms-sm-3{margin-left:1rem !important}.ms-sm-4{margin-left:1.5rem !important}.ms-sm-5{margin-left:3rem !important}.ms-sm-auto{margin-left:auto !important}.p-sm-0{padding:0 !important}.p-sm-1{padding:.25rem !important}.p-sm-2{padding:.5rem !important}.p-sm-3{padding:1rem !important}.p-sm-4{padding:1.5rem !important}.p-sm-5{padding:3rem !important}.px-sm-0{padding-right:0 !important;padding-left:0 !important}.px-sm-1{padding-right:.25rem !important;padding-left:.25rem !important}.px-sm-2{padding-right:.5rem !important;padding-left:.5rem !important}.px-sm-3{padding-right:1rem !important;padding-left:1rem !important}.px-sm-4{padding-right:1.5rem !important;padding-left:1.5rem !important}.px-sm-5{padding-right:3rem !important;padding-left:3rem !important}.py-sm-0{padding-top:0 !important;padding-bottom:0 !important}.py-sm-1{padding-top:.25rem !important;padding-bottom:.25rem !important}.py-sm-2{padding-top:.5rem !important;padding-bottom:.5rem !important}.py-sm-3{padding-top:1rem !important;padding-bottom:1rem !important}.py-sm-4{padding-top:1.5rem !important;padding-bottom:1.5rem !important}.py-sm-5{padding-top:3rem !important;padding-bottom:3rem !important}.pt-sm-0{padding-top:0 !important}.pt-sm-1{padding-top:.25rem !important}.pt-sm-2{padding-top:.5rem !important}.pt-sm-3{padding-top:1rem !important}.pt-sm-4{padding-top:1.5rem !important}.pt-sm-5{padding-top:3rem !important}.pe-sm-0{padding-right:0 !important}.pe-sm-1{padding-right:.25rem !important}.pe-sm-2{padding-right:.5rem !important}.pe-sm-3{padding-right:1rem !important}.pe-sm-4{padding-right:1.5rem !important}.pe-sm-5{padding-right:3rem !important}.pb-sm-0{padding-bottom:0 !important}.pb-sm-1{padding-bottom:.25rem !important}.pb-sm-2{padding-bottom:.5rem !important}.pb-sm-3{padding-bottom:1rem !important}.pb-sm-4{padding-bottom:1.5rem !important}.pb-sm-5{padding-bottom:3rem !important}.ps-sm-0{padding-left:0 !important}.ps-sm-1{padding-left:.25rem !important}.ps-sm-2{padding-left:.5rem !important}.ps-sm-3{padding-left:1rem !important}.ps-sm-4{padding-left:1.5rem !important}.ps-sm-5{padding-left:3rem !important}.gap-sm-0{gap:0 !important}.gap-sm-1{gap:.25rem !important}.gap-sm-2{gap:.5rem !important}.gap-sm-3{gap:1rem !important}.gap-sm-4{gap:1.5rem !important}.gap-sm-5{gap:3rem !important}.row-gap-sm-0{row-gap:0 !important}.row-gap-sm-1{row-gap:.25rem !important}.row-gap-sm-2{row-gap:.5rem !important}.row-gap-sm-3{row-gap:1rem !important}.row-gap-sm-4{row-gap:1.5rem !important}.row-gap-sm-5{row-gap:3rem !important}.column-gap-sm-0{column-gap:0 !important}.column-gap-sm-1{column-gap:.25rem !important}.column-gap-sm-2{column-gap:.5rem !important}.column-gap-sm-3{column-gap:1rem !important}.column-gap-sm-4{column-gap:1.5rem !important}.column-gap-sm-5{column-gap:3rem !important}.text-sm-start{text-align:left !important}.text-sm-end{text-align:right !important}.text-sm-center{text-align:center !important}}@media(min-width: 720px){.float-md-start{float:left !important}.float-md-end{float:right !important}.float-md-none{float:none !important}.object-fit-md-contain{object-fit:contain !important}.object-fit-md-cover{object-fit:cover !important}.object-fit-md-fill{object-fit:fill !important}.object-fit-md-scale{object-fit:scale-down !important}.object-fit-md-none{object-fit:none !important}.d-md-inline{display:inline !important}.d-md-inline-block{display:inline-block !important}.d-md-block{display:block !important}.d-md-grid{display:grid !important}.d-md-inline-grid{display:inline-grid !important}.d-md-table{display:table !important}.d-md-table-row{display:table-row !important}.d-md-table-cell{display:table-cell !important}.d-md-flex{display:flex !important}.d-md-inline-flex{display:inline-flex !important}.d-md-none{display:none !important}.flex-md-fill{flex:1 1 auto !important}.flex-md-row{flex-direction:row !important}.flex-md-column{flex-direction:column !important}.flex-md-row-reverse{flex-direction:row-reverse !important}.flex-md-column-reverse{flex-direction:column-reverse !important}.flex-md-grow-0{flex-grow:0 !important}.flex-md-grow-1{flex-grow:1 !important}.flex-md-shrink-0{flex-shrink:0 !important}.flex-md-shrink-1{flex-shrink:1 !important}.flex-md-wrap{flex-wrap:wrap !important}.flex-md-nowrap{flex-wrap:nowrap !important}.flex-md-wrap-reverse{flex-wrap:wrap-reverse !important}.justify-content-md-start{justify-content:flex-start !important}.justify-content-md-end{justify-content:flex-end !important}.justify-content-md-center{justify-content:center !important}.justify-content-md-between{justify-content:space-between !important}.justify-content-md-around{justify-content:space-around !important}.justify-content-md-evenly{justify-content:space-evenly !important}.align-items-md-start{align-items:flex-start !important}.align-items-md-end{align-items:flex-end !important}.align-items-md-center{align-items:center !important}.align-items-md-baseline{align-items:baseline !important}.align-items-md-stretch{align-items:stretch !important}.align-content-md-start{align-content:flex-start !important}.align-content-md-end{align-content:flex-end !important}.align-content-md-center{align-content:center !important}.align-content-md-between{align-content:space-between !important}.align-content-md-around{align-content:space-around !important}.align-content-md-stretch{align-content:stretch !important}.align-self-md-auto{align-self:auto !important}.align-self-md-start{align-self:flex-start !important}.align-self-md-end{align-self:flex-end !important}.align-self-md-center{align-self:center !important}.align-self-md-baseline{align-self:baseline !important}.align-self-md-stretch{align-self:stretch !important}.order-md-first{order:-1 !important}.order-md-0{order:0 !important}.order-md-1{order:1 !important}.order-md-2{order:2 !important}.order-md-3{order:3 !important}.order-md-4{order:4 !important}.order-md-5{order:5 !important}.order-md-last{order:6 !important}.m-md-0{margin:0 !important}.m-md-1{margin:.25rem !important}.m-md-2{margin:.5rem !important}.m-md-3{margin:1rem !important}.m-md-4{margin:1.5rem !important}.m-md-5{margin:3rem !important}.m-md-auto{margin:auto !important}.mx-md-0{margin-right:0 !important;margin-left:0 !important}.mx-md-1{margin-right:.25rem !important;margin-left:.25rem !important}.mx-md-2{margin-right:.5rem !important;margin-left:.5rem !important}.mx-md-3{margin-right:1rem !important;margin-left:1rem !important}.mx-md-4{margin-right:1.5rem !important;margin-left:1.5rem !important}.mx-md-5{margin-right:3rem !important;margin-left:3rem !important}.mx-md-auto{margin-right:auto !important;margin-left:auto !important}.my-md-0{margin-top:0 !important;margin-bottom:0 !important}.my-md-1{margin-top:.25rem !important;margin-bottom:.25rem !important}.my-md-2{margin-top:.5rem !important;margin-bottom:.5rem !important}.my-md-3{margin-top:1rem !important;margin-bottom:1rem !important}.my-md-4{margin-top:1.5rem !important;margin-bottom:1.5rem !important}.my-md-5{margin-top:3rem !important;margin-bottom:3rem !important}.my-md-auto{margin-top:auto !important;margin-bottom:auto !important}.mt-md-0{margin-top:0 !important}.mt-md-1{margin-top:.25rem !important}.mt-md-2{margin-top:.5rem !important}.mt-md-3{margin-top:1rem !important}.mt-md-4{margin-top:1.5rem !important}.mt-md-5{margin-top:3rem !important}.mt-md-auto{margin-top:auto !important}.me-md-0{margin-right:0 !important}.me-md-1{margin-right:.25rem !important}.me-md-2{margin-right:.5rem !important}.me-md-3{margin-right:1rem !important}.me-md-4{margin-right:1.5rem !important}.me-md-5{margin-right:3rem !important}.me-md-auto{margin-right:auto !important}.mb-md-0{margin-bottom:0 !important}.mb-md-1{margin-bottom:.25rem !important}.mb-md-2{margin-bottom:.5rem !important}.mb-md-3{margin-bottom:1rem !important}.mb-md-4{margin-bottom:1.5rem !important}.mb-md-5{margin-bottom:3rem !important}.mb-md-auto{margin-bottom:auto !important}.ms-md-0{margin-left:0 !important}.ms-md-1{margin-left:.25rem !important}.ms-md-2{margin-left:.5rem !important}.ms-md-3{margin-left:1rem !important}.ms-md-4{margin-left:1.5rem !important}.ms-md-5{margin-left:3rem !important}.ms-md-auto{margin-left:auto !important}.p-md-0{padding:0 !important}.p-md-1{padding:.25rem !important}.p-md-2{padding:.5rem !important}.p-md-3{padding:1rem !important}.p-md-4{padding:1.5rem !important}.p-md-5{padding:3rem !important}.px-md-0{padding-right:0 !important;padding-left:0 !important}.px-md-1{padding-right:.25rem !important;padding-left:.25rem !important}.px-md-2{padding-right:.5rem !important;padding-left:.5rem !important}.px-md-3{padding-right:1rem !important;padding-left:1rem !important}.px-md-4{padding-right:1.5rem !important;padding-left:1.5rem !important}.px-md-5{padding-right:3rem !important;padding-left:3rem !important}.py-md-0{padding-top:0 !important;padding-bottom:0 !important}.py-md-1{padding-top:.25rem !important;padding-bottom:.25rem !important}.py-md-2{padding-top:.5rem !important;padding-bottom:.5rem !important}.py-md-3{padding-top:1rem !important;padding-bottom:1rem !important}.py-md-4{padding-top:1.5rem !important;padding-bottom:1.5rem !important}.py-md-5{padding-top:3rem !important;padding-bottom:3rem !important}.pt-md-0{padding-top:0 !important}.pt-md-1{padding-top:.25rem !important}.pt-md-2{padding-top:.5rem !important}.pt-md-3{padding-top:1rem !important}.pt-md-4{padding-top:1.5rem !important}.pt-md-5{padding-top:3rem !important}.pe-md-0{padding-right:0 !important}.pe-md-1{padding-right:.25rem !important}.pe-md-2{padding-right:.5rem !important}.pe-md-3{padding-right:1rem !important}.pe-md-4{padding-right:1.5rem !important}.pe-md-5{padding-right:3rem !important}.pb-md-0{padding-bottom:0 !important}.pb-md-1{padding-bottom:.25rem !important}.pb-md-2{padding-bottom:.5rem !important}.pb-md-3{padding-bottom:1rem !important}.pb-md-4{padding-bottom:1.5rem !important}.pb-md-5{padding-bottom:3rem !important}.ps-md-0{padding-left:0 !important}.ps-md-1{padding-left:.25rem !important}.ps-md-2{padding-left:.5rem !important}.ps-md-3{padding-left:1rem !important}.ps-md-4{padding-left:1.5rem !important}.ps-md-5{padding-left:3rem !important}.gap-md-0{gap:0 !important}.gap-md-1{gap:.25rem !important}.gap-md-2{gap:.5rem !important}.gap-md-3{gap:1rem !important}.gap-md-4{gap:1.5rem !important}.gap-md-5{gap:3rem !important}.row-gap-md-0{row-gap:0 !important}.row-gap-md-1{row-gap:.25rem !important}.row-gap-md-2{row-gap:.5rem !important}.row-gap-md-3{row-gap:1rem !important}.row-gap-md-4{row-gap:1.5rem !important}.row-gap-md-5{row-gap:3rem !important}.column-gap-md-0{column-gap:0 !important}.column-gap-md-1{column-gap:.25rem !important}.column-gap-md-2{column-gap:.5rem !important}.column-gap-md-3{column-gap:1rem !important}.column-gap-md-4{column-gap:1.5rem !important}.column-gap-md-5{column-gap:3rem !important}.text-md-start{text-align:left !important}.text-md-end{text-align:right !important}.text-md-center{text-align:center !important}}@media(min-width: 960px){.float-lg-start{float:left !important}.float-lg-end{float:right !important}.float-lg-none{float:none !important}.object-fit-lg-contain{object-fit:contain !important}.object-fit-lg-cover{object-fit:cover !important}.object-fit-lg-fill{object-fit:fill !important}.object-fit-lg-scale{object-fit:scale-down !important}.object-fit-lg-none{object-fit:none !important}.d-lg-inline{display:inline !important}.d-lg-inline-block{display:inline-block !important}.d-lg-block{display:block !important}.d-lg-grid{display:grid !important}.d-lg-inline-grid{display:inline-grid !important}.d-lg-table{display:table !important}.d-lg-table-row{display:table-row !important}.d-lg-table-cell{display:table-cell !important}.d-lg-flex{display:flex !important}.d-lg-inline-flex{display:inline-flex !important}.d-lg-none{display:none !important}.flex-lg-fill{flex:1 1 auto !important}.flex-lg-row{flex-direction:row !important}.flex-lg-column{flex-direction:column !important}.flex-lg-row-reverse{flex-direction:row-reverse !important}.flex-lg-column-reverse{flex-direction:column-reverse !important}.flex-lg-grow-0{flex-grow:0 !important}.flex-lg-grow-1{flex-grow:1 !important}.flex-lg-shrink-0{flex-shrink:0 !important}.flex-lg-shrink-1{flex-shrink:1 !important}.flex-lg-wrap{flex-wrap:wrap !important}.flex-lg-nowrap{flex-wrap:nowrap !important}.flex-lg-wrap-reverse{flex-wrap:wrap-reverse !important}.justify-content-lg-start{justify-content:flex-start !important}.justify-content-lg-end{justify-content:flex-end !important}.justify-content-lg-center{justify-content:center !important}.justify-content-lg-between{justify-content:space-between !important}.justify-content-lg-around{justify-content:space-around !important}.justify-content-lg-evenly{justify-content:space-evenly !important}.align-items-lg-start{align-items:flex-start !important}.align-items-lg-end{align-items:flex-end !important}.align-items-lg-center{align-items:center !important}.align-items-lg-baseline{align-items:baseline !important}.align-items-lg-stretch{align-items:stretch !important}.align-content-lg-start{align-content:flex-start !important}.align-content-lg-end{align-content:flex-end !important}.align-content-lg-center{align-content:center !important}.align-content-lg-between{align-content:space-between !important}.align-content-lg-around{align-content:space-around !important}.align-content-lg-stretch{align-content:stretch !important}.align-self-lg-auto{align-self:auto !important}.align-self-lg-start{align-self:flex-start !important}.align-self-lg-end{align-self:flex-end !important}.align-self-lg-center{align-self:center !important}.align-self-lg-baseline{align-self:baseline !important}.align-self-lg-stretch{align-self:stretch !important}.order-lg-first{order:-1 !important}.order-lg-0{order:0 !important}.order-lg-1{order:1 !important}.order-lg-2{order:2 !important}.order-lg-3{order:3 !important}.order-lg-4{order:4 !important}.order-lg-5{order:5 !important}.order-lg-last{order:6 !important}.m-lg-0{margin:0 !important}.m-lg-1{margin:.25rem !important}.m-lg-2{margin:.5rem !important}.m-lg-3{margin:1rem !important}.m-lg-4{margin:1.5rem !important}.m-lg-5{margin:3rem !important}.m-lg-auto{margin:auto !important}.mx-lg-0{margin-right:0 !important;margin-left:0 !important}.mx-lg-1{margin-right:.25rem !important;margin-left:.25rem !important}.mx-lg-2{margin-right:.5rem !important;margin-left:.5rem !important}.mx-lg-3{margin-right:1rem !important;margin-left:1rem !important}.mx-lg-4{margin-right:1.5rem !important;margin-left:1.5rem !important}.mx-lg-5{margin-right:3rem !important;margin-left:3rem !important}.mx-lg-auto{margin-right:auto !important;margin-left:auto !important}.my-lg-0{margin-top:0 !important;margin-bottom:0 !important}.my-lg-1{margin-top:.25rem !important;margin-bottom:.25rem !important}.my-lg-2{margin-top:.5rem !important;margin-bottom:.5rem !important}.my-lg-3{margin-top:1rem !important;margin-bottom:1rem !important}.my-lg-4{margin-top:1.5rem !important;margin-bottom:1.5rem !important}.my-lg-5{margin-top:3rem !important;margin-bottom:3rem !important}.my-lg-auto{margin-top:auto !important;margin-bottom:auto !important}.mt-lg-0{margin-top:0 !important}.mt-lg-1{margin-top:.25rem !important}.mt-lg-2{margin-top:.5rem !important}.mt-lg-3{margin-top:1rem !important}.mt-lg-4{margin-top:1.5rem !important}.mt-lg-5{margin-top:3rem !important}.mt-lg-auto{margin-top:auto !important}.me-lg-0{margin-right:0 !important}.me-lg-1{margin-right:.25rem !important}.me-lg-2{margin-right:.5rem !important}.me-lg-3{margin-right:1rem !important}.me-lg-4{margin-right:1.5rem !important}.me-lg-5{margin-right:3rem !important}.me-lg-auto{margin-right:auto !important}.mb-lg-0{margin-bottom:0 !important}.mb-lg-1{margin-bottom:.25rem !important}.mb-lg-2{margin-bottom:.5rem !important}.mb-lg-3{margin-bottom:1rem !important}.mb-lg-4{margin-bottom:1.5rem !important}.mb-lg-5{margin-bottom:3rem !important}.mb-lg-auto{margin-bottom:auto !important}.ms-lg-0{margin-left:0 !important}.ms-lg-1{margin-left:.25rem !important}.ms-lg-2{margin-left:.5rem !important}.ms-lg-3{margin-left:1rem !important}.ms-lg-4{margin-left:1.5rem !important}.ms-lg-5{margin-left:3rem !important}.ms-lg-auto{margin-left:auto !important}.p-lg-0{padding:0 !important}.p-lg-1{padding:.25rem !important}.p-lg-2{padding:.5rem !important}.p-lg-3{padding:1rem !important}.p-lg-4{padding:1.5rem !important}.p-lg-5{padding:3rem !important}.px-lg-0{padding-right:0 !important;padding-left:0 !important}.px-lg-1{padding-right:.25rem !important;padding-left:.25rem !important}.px-lg-2{padding-right:.5rem !important;padding-left:.5rem !important}.px-lg-3{padding-right:1rem !important;padding-left:1rem !important}.px-lg-4{padding-right:1.5rem !important;padding-left:1.5rem !important}.px-lg-5{padding-right:3rem !important;padding-left:3rem !important}.py-lg-0{padding-top:0 !important;padding-bottom:0 !important}.py-lg-1{padding-top:.25rem !important;padding-bottom:.25rem !important}.py-lg-2{padding-top:.5rem !important;padding-bottom:.5rem !important}.py-lg-3{padding-top:1rem !important;padding-bottom:1rem !important}.py-lg-4{padding-top:1.5rem !important;padding-bottom:1.5rem !important}.py-lg-5{padding-top:3rem !important;padding-bottom:3rem !important}.pt-lg-0{padding-top:0 !important}.pt-lg-1{padding-top:.25rem !important}.pt-lg-2{padding-top:.5rem !important}.pt-lg-3{padding-top:1rem !important}.pt-lg-4{padding-top:1.5rem !important}.pt-lg-5{padding-top:3rem !important}.pe-lg-0{padding-right:0 !important}.pe-lg-1{padding-right:.25rem !important}.pe-lg-2{padding-right:.5rem !important}.pe-lg-3{padding-right:1rem !important}.pe-lg-4{padding-right:1.5rem !important}.pe-lg-5{padding-right:3rem !important}.pb-lg-0{padding-bottom:0 !important}.pb-lg-1{padding-bottom:.25rem !important}.pb-lg-2{padding-bottom:.5rem !important}.pb-lg-3{padding-bottom:1rem !important}.pb-lg-4{padding-bottom:1.5rem !important}.pb-lg-5{padding-bottom:3rem !important}.ps-lg-0{padding-left:0 !important}.ps-lg-1{padding-left:.25rem !important}.ps-lg-2{padding-left:.5rem !important}.ps-lg-3{padding-left:1rem !important}.ps-lg-4{padding-left:1.5rem !important}.ps-lg-5{padding-left:3rem !important}.gap-lg-0{gap:0 !important}.gap-lg-1{gap:.25rem !important}.gap-lg-2{gap:.5rem !important}.gap-lg-3{gap:1rem !important}.gap-lg-4{gap:1.5rem !important}.gap-lg-5{gap:3rem !important}.row-gap-lg-0{row-gap:0 !important}.row-gap-lg-1{row-gap:.25rem !important}.row-gap-lg-2{row-gap:.5rem !important}.row-gap-lg-3{row-gap:1rem !important}.row-gap-lg-4{row-gap:1.5rem !important}.row-gap-lg-5{row-gap:3rem !important}.column-gap-lg-0{column-gap:0 !important}.column-gap-lg-1{column-gap:.25rem !important}.column-gap-lg-2{column-gap:.5rem !important}.column-gap-lg-3{column-gap:1rem !important}.column-gap-lg-4{column-gap:1.5rem !important}.column-gap-lg-5{column-gap:3rem !important}.text-lg-start{text-align:left !important}.text-lg-end{text-align:right !important}.text-lg-center{text-align:center !important}}@media(min-width: 1200px){.float-xl-start{float:left !important}.float-xl-end{float:right !important}.float-xl-none{float:none !important}.object-fit-xl-contain{object-fit:contain !important}.object-fit-xl-cover{object-fit:cover !important}.object-fit-xl-fill{object-fit:fill !important}.object-fit-xl-scale{object-fit:scale-down !important}.object-fit-xl-none{object-fit:none !important}.d-xl-inline{display:inline !important}.d-xl-inline-block{display:inline-block !important}.d-xl-block{display:block !important}.d-xl-grid{display:grid !important}.d-xl-inline-grid{display:inline-grid !important}.d-xl-table{display:table !important}.d-xl-table-row{display:table-row !important}.d-xl-table-cell{display:table-cell !important}.d-xl-flex{display:flex !important}.d-xl-inline-flex{display:inline-flex !important}.d-xl-none{display:none !important}.flex-xl-fill{flex:1 1 auto !important}.flex-xl-row{flex-direction:row !important}.flex-xl-column{flex-direction:column !important}.flex-xl-row-reverse{flex-direction:row-reverse !important}.flex-xl-column-reverse{flex-direction:column-reverse !important}.flex-xl-grow-0{flex-grow:0 !important}.flex-xl-grow-1{flex-grow:1 !important}.flex-xl-shrink-0{flex-shrink:0 !important}.flex-xl-shrink-1{flex-shrink:1 !important}.flex-xl-wrap{flex-wrap:wrap !important}.flex-xl-nowrap{flex-wrap:nowrap !important}.flex-xl-wrap-reverse{flex-wrap:wrap-reverse !important}.justify-content-xl-start{justify-content:flex-start !important}.justify-content-xl-end{justify-content:flex-end !important}.justify-content-xl-center{justify-content:center !important}.justify-content-xl-between{justify-content:space-between !important}.justify-content-xl-around{justify-content:space-around !important}.justify-content-xl-evenly{justify-content:space-evenly !important}.align-items-xl-start{align-items:flex-start !important}.align-items-xl-end{align-items:flex-end !important}.align-items-xl-center{align-items:center !important}.align-items-xl-baseline{align-items:baseline !important}.align-items-xl-stretch{align-items:stretch !important}.align-content-xl-start{align-content:flex-start !important}.align-content-xl-end{align-content:flex-end !important}.align-content-xl-center{align-content:center !important}.align-content-xl-between{align-content:space-between !important}.align-content-xl-around{align-content:space-around !important}.align-content-xl-stretch{align-content:stretch !important}.align-self-xl-auto{align-self:auto !important}.align-self-xl-start{align-self:flex-start !important}.align-self-xl-end{align-self:flex-end !important}.align-self-xl-center{align-self:center !important}.align-self-xl-baseline{align-self:baseline !important}.align-self-xl-stretch{align-self:stretch !important}.order-xl-first{order:-1 !important}.order-xl-0{order:0 !important}.order-xl-1{order:1 !important}.order-xl-2{order:2 !important}.order-xl-3{order:3 !important}.order-xl-4{order:4 !important}.order-xl-5{order:5 !important}.order-xl-last{order:6 !important}.m-xl-0{margin:0 !important}.m-xl-1{margin:.25rem !important}.m-xl-2{margin:.5rem !important}.m-xl-3{margin:1rem !important}.m-xl-4{margin:1.5rem !important}.m-xl-5{margin:3rem !important}.m-xl-auto{margin:auto !important}.mx-xl-0{margin-right:0 !important;margin-left:0 !important}.mx-xl-1{margin-right:.25rem !important;margin-left:.25rem !important}.mx-xl-2{margin-right:.5rem !important;margin-left:.5rem !important}.mx-xl-3{margin-right:1rem !important;margin-left:1rem !important}.mx-xl-4{margin-right:1.5rem !important;margin-left:1.5rem !important}.mx-xl-5{margin-right:3rem !important;margin-left:3rem !important}.mx-xl-auto{margin-right:auto !important;margin-left:auto !important}.my-xl-0{margin-top:0 !important;margin-bottom:0 !important}.my-xl-1{margin-top:.25rem !important;margin-bottom:.25rem !important}.my-xl-2{margin-top:.5rem !important;margin-bottom:.5rem !important}.my-xl-3{margin-top:1rem !important;margin-bottom:1rem !important}.my-xl-4{margin-top:1.5rem !important;margin-bottom:1.5rem !important}.my-xl-5{margin-top:3rem !important;margin-bottom:3rem !important}.my-xl-auto{margin-top:auto !important;margin-bottom:auto !important}.mt-xl-0{margin-top:0 !important}.mt-xl-1{margin-top:.25rem !important}.mt-xl-2{margin-top:.5rem !important}.mt-xl-3{margin-top:1rem !important}.mt-xl-4{margin-top:1.5rem !important}.mt-xl-5{margin-top:3rem !important}.mt-xl-auto{margin-top:auto !important}.me-xl-0{margin-right:0 !important}.me-xl-1{margin-right:.25rem !important}.me-xl-2{margin-right:.5rem !important}.me-xl-3{margin-right:1rem !important}.me-xl-4{margin-right:1.5rem !important}.me-xl-5{margin-right:3rem !important}.me-xl-auto{margin-right:auto !important}.mb-xl-0{margin-bottom:0 !important}.mb-xl-1{margin-bottom:.25rem !important}.mb-xl-2{margin-bottom:.5rem !important}.mb-xl-3{margin-bottom:1rem !important}.mb-xl-4{margin-bottom:1.5rem !important}.mb-xl-5{margin-bottom:3rem !important}.mb-xl-auto{margin-bottom:auto !important}.ms-xl-0{margin-left:0 !important}.ms-xl-1{margin-left:.25rem !important}.ms-xl-2{margin-left:.5rem !important}.ms-xl-3{margin-left:1rem !important}.ms-xl-4{margin-left:1.5rem !important}.ms-xl-5{margin-left:3rem !important}.ms-xl-auto{margin-left:auto !important}.p-xl-0{padding:0 !important}.p-xl-1{padding:.25rem !important}.p-xl-2{padding:.5rem !important}.p-xl-3{padding:1rem !important}.p-xl-4{padding:1.5rem !important}.p-xl-5{padding:3rem !important}.px-xl-0{padding-right:0 !important;padding-left:0 !important}.px-xl-1{padding-right:.25rem !important;padding-left:.25rem !important}.px-xl-2{padding-right:.5rem !important;padding-left:.5rem !important}.px-xl-3{padding-right:1rem !important;padding-left:1rem !important}.px-xl-4{padding-right:1.5rem !important;padding-left:1.5rem !important}.px-xl-5{padding-right:3rem !important;padding-left:3rem !important}.py-xl-0{padding-top:0 !important;padding-bottom:0 !important}.py-xl-1{padding-top:.25rem !important;padding-bottom:.25rem !important}.py-xl-2{padding-top:.5rem !important;padding-bottom:.5rem !important}.py-xl-3{padding-top:1rem !important;padding-bottom:1rem !important}.py-xl-4{padding-top:1.5rem !important;padding-bottom:1.5rem !important}.py-xl-5{padding-top:3rem !important;padding-bottom:3rem !important}.pt-xl-0{padding-top:0 !important}.pt-xl-1{padding-top:.25rem !important}.pt-xl-2{padding-top:.5rem !important}.pt-xl-3{padding-top:1rem !important}.pt-xl-4{padding-top:1.5rem !important}.pt-xl-5{padding-top:3rem !important}.pe-xl-0{padding-right:0 !important}.pe-xl-1{padding-right:.25rem !important}.pe-xl-2{padding-right:.5rem !important}.pe-xl-3{padding-right:1rem !important}.pe-xl-4{padding-right:1.5rem !important}.pe-xl-5{padding-right:3rem !important}.pb-xl-0{padding-bottom:0 !important}.pb-xl-1{padding-bottom:.25rem !important}.pb-xl-2{padding-bottom:.5rem !important}.pb-xl-3{padding-bottom:1rem !important}.pb-xl-4{padding-bottom:1.5rem !important}.pb-xl-5{padding-bottom:3rem !important}.ps-xl-0{padding-left:0 !important}.ps-xl-1{padding-left:.25rem !important}.ps-xl-2{padding-left:.5rem !important}.ps-xl-3{padding-left:1rem !important}.ps-xl-4{padding-left:1.5rem !important}.ps-xl-5{padding-left:3rem !important}.gap-xl-0{gap:0 !important}.gap-xl-1{gap:.25rem !important}.gap-xl-2{gap:.5rem !important}.gap-xl-3{gap:1rem !important}.gap-xl-4{gap:1.5rem !important}.gap-xl-5{gap:3rem !important}.row-gap-xl-0{row-gap:0 !important}.row-gap-xl-1{row-gap:.25rem !important}.row-gap-xl-2{row-gap:.5rem !important}.row-gap-xl-3{row-gap:1rem !important}.row-gap-xl-4{row-gap:1.5rem !important}.row-gap-xl-5{row-gap:3rem !important}.column-gap-xl-0{column-gap:0 !important}.column-gap-xl-1{column-gap:.25rem !important}.column-gap-xl-2{column-gap:.5rem !important}.column-gap-xl-3{column-gap:1rem !important}.column-gap-xl-4{column-gap:1.5rem !important}.column-gap-xl-5{column-gap:3rem !important}.text-xl-start{text-align:left !important}.text-xl-end{text-align:right !important}.text-xl-center{text-align:center !important}}@media(min-width: 1200px){.fs-1{font-size:2.5rem !important}.fs-2{font-size:2rem !important}.fs-3{font-size:1.75rem !important}.fs-4{font-size:1.5rem !important}}@media print{.d-print-inline{display:inline !important}.d-print-inline-block{display:inline-block !important}.d-print-block{display:block !important}.d-print-grid{display:grid !important}.d-print-inline-grid{display:inline-grid !important}.d-print-table{display:table !important}.d-print-table-row{display:table-row !important}.d-print-table-cell{display:table-cell !important}.d-print-flex{display:flex !important}.d-print-inline-flex{display:inline-flex !important}.d-print-none{display:none !important}}","@mixin bsBanner($file) {\n  /*!\n   * Bootstrap #{$file} v5.3.2 (https://getbootstrap.com/)\n   * Copyright 2011-2023 The Bootstrap Authors\n   * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)\n   */\n}\n",":root,\n[data-bs-theme=\"light\"] {\n  // Note: Custom variable values only support SassScript inside `#{}`.\n\n  // Colors\n  //\n  // Generate palettes for full colors, grays, and theme colors.\n\n  @each $color, $value in $colors {\n    --#{$prefix}#{$color}: #{$value};\n  }\n\n  @each $color, $value in $grays {\n    --#{$prefix}gray-#{$color}: #{$value};\n  }\n\n  @each $color, $value in $theme-colors {\n    --#{$prefix}#{$color}: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-rgb {\n    --#{$prefix}#{$color}-rgb: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-text {\n    --#{$prefix}#{$color}-text-emphasis: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-bg-subtle {\n    --#{$prefix}#{$color}-bg-subtle: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-border-subtle {\n    --#{$prefix}#{$color}-border-subtle: #{$value};\n  }\n\n  --#{$prefix}white-rgb: #{to-rgb($white)};\n  --#{$prefix}black-rgb: #{to-rgb($black)};\n\n  // Fonts\n\n  // Note: Use `inspect` for lists so that quoted items keep the quotes.\n  // See https://github.com/sass/sass/issues/2383#issuecomment-336349172\n  --#{$prefix}font-sans-serif: #{inspect($font-family-sans-serif)};\n  --#{$prefix}font-monospace: #{inspect($font-family-monospace)};\n  --#{$prefix}gradient: #{$gradient};\n\n  // Root and body\n  // scss-docs-start root-body-variables\n  @if $font-size-root != null {\n    --#{$prefix}root-font-size: #{$font-size-root};\n  }\n  --#{$prefix}body-font-family: #{inspect($font-family-base)};\n  @include rfs($font-size-base, --#{$prefix}body-font-size);\n  --#{$prefix}body-font-weight: #{$font-weight-base};\n  --#{$prefix}body-line-height: #{$line-height-base};\n  @if $body-text-align != null {\n    --#{$prefix}body-text-align: #{$body-text-align};\n  }\n\n  --#{$prefix}body-color: #{$body-color};\n  --#{$prefix}body-color-rgb: #{to-rgb($body-color)};\n  --#{$prefix}body-bg: #{$body-bg};\n  --#{$prefix}body-bg-rgb: #{to-rgb($body-bg)};\n\n  --#{$prefix}emphasis-color: #{$body-emphasis-color};\n  --#{$prefix}emphasis-color-rgb: #{to-rgb($body-emphasis-color)};\n\n  --#{$prefix}secondary-color: #{$body-secondary-color};\n  --#{$prefix}secondary-color-rgb: #{to-rgb($body-secondary-color)};\n  --#{$prefix}secondary-bg: #{$body-secondary-bg};\n  --#{$prefix}secondary-bg-rgb: #{to-rgb($body-secondary-bg)};\n\n  --#{$prefix}tertiary-color: #{$body-tertiary-color};\n  --#{$prefix}tertiary-color-rgb: #{to-rgb($body-tertiary-color)};\n  --#{$prefix}tertiary-bg: #{$body-tertiary-bg};\n  --#{$prefix}tertiary-bg-rgb: #{to-rgb($body-tertiary-bg)};\n  // scss-docs-end root-body-variables\n\n  --#{$prefix}heading-color: #{$headings-color};\n\n  --#{$prefix}link-color: #{$link-color};\n  --#{$prefix}link-color-rgb: #{to-rgb($link-color)};\n  --#{$prefix}link-decoration: #{$link-decoration};\n\n  --#{$prefix}link-hover-color: #{$link-hover-color};\n  --#{$prefix}link-hover-color-rgb: #{to-rgb($link-hover-color)};\n\n  @if $link-hover-decoration != null {\n    --#{$prefix}link-hover-decoration: #{$link-hover-decoration};\n  }\n\n  --#{$prefix}code-color: #{$code-color};\n  --#{$prefix}highlight-color: #{$mark-color};\n  --#{$prefix}highlight-bg: #{$mark-bg};\n\n  // scss-docs-start root-border-var\n  --#{$prefix}border-width: #{$border-width};\n  --#{$prefix}border-style: #{$border-style};\n  --#{$prefix}border-color: #{$border-color};\n  --#{$prefix}border-color-translucent: #{$border-color-translucent};\n\n  --#{$prefix}border-radius: #{$border-radius};\n  --#{$prefix}border-radius-sm: #{$border-radius-sm};\n  --#{$prefix}border-radius-lg: #{$border-radius-lg};\n  --#{$prefix}border-radius-xl: #{$border-radius-xl};\n  --#{$prefix}border-radius-xxl: #{$border-radius-xxl};\n  --#{$prefix}border-radius-2xl: var(--#{$prefix}border-radius-xxl); // Deprecated in v5.3.0 for consistency\n  --#{$prefix}border-radius-pill: #{$border-radius-pill};\n  // scss-docs-end root-border-var\n\n  --#{$prefix}box-shadow: #{$box-shadow};\n  --#{$prefix}box-shadow-sm: #{$box-shadow-sm};\n  --#{$prefix}box-shadow-lg: #{$box-shadow-lg};\n  --#{$prefix}box-shadow-inset: #{$box-shadow-inset};\n\n  // Focus styles\n  // scss-docs-start root-focus-variables\n  --#{$prefix}focus-ring-width: #{$focus-ring-width};\n  --#{$prefix}focus-ring-opacity: #{$focus-ring-opacity};\n  --#{$prefix}focus-ring-color: #{$focus-ring-color};\n  // scss-docs-end root-focus-variables\n\n  // scss-docs-start root-form-validation-variables\n  --#{$prefix}form-valid-color: #{$form-valid-color};\n  --#{$prefix}form-valid-border-color: #{$form-valid-border-color};\n  --#{$prefix}form-invalid-color: #{$form-invalid-color};\n  --#{$prefix}form-invalid-border-color: #{$form-invalid-border-color};\n  // scss-docs-end root-form-validation-variables\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark, true) {\n    color-scheme: dark;\n\n    // scss-docs-start root-dark-mode-vars\n    --#{$prefix}body-color: #{$body-color-dark};\n    --#{$prefix}body-color-rgb: #{to-rgb($body-color-dark)};\n    --#{$prefix}body-bg: #{$body-bg-dark};\n    --#{$prefix}body-bg-rgb: #{to-rgb($body-bg-dark)};\n\n    --#{$prefix}emphasis-color: #{$body-emphasis-color-dark};\n    --#{$prefix}emphasis-color-rgb: #{to-rgb($body-emphasis-color-dark)};\n\n    --#{$prefix}secondary-color: #{$body-secondary-color-dark};\n    --#{$prefix}secondary-color-rgb: #{to-rgb($body-secondary-color-dark)};\n    --#{$prefix}secondary-bg: #{$body-secondary-bg-dark};\n    --#{$prefix}secondary-bg-rgb: #{to-rgb($body-secondary-bg-dark)};\n\n    --#{$prefix}tertiary-color: #{$body-tertiary-color-dark};\n    --#{$prefix}tertiary-color-rgb: #{to-rgb($body-tertiary-color-dark)};\n    --#{$prefix}tertiary-bg: #{$body-tertiary-bg-dark};\n    --#{$prefix}tertiary-bg-rgb: #{to-rgb($body-tertiary-bg-dark)};\n\n    @each $color, $value in $theme-colors-text-dark {\n      --#{$prefix}#{$color}-text-emphasis: #{$value};\n    }\n\n    @each $color, $value in $theme-colors-bg-subtle-dark {\n      --#{$prefix}#{$color}-bg-subtle: #{$value};\n    }\n\n    @each $color, $value in $theme-colors-border-subtle-dark {\n      --#{$prefix}#{$color}-border-subtle: #{$value};\n    }\n\n    --#{$prefix}heading-color: #{$headings-color-dark};\n\n    --#{$prefix}link-color: #{$link-color-dark};\n    --#{$prefix}link-hover-color: #{$link-hover-color-dark};\n    --#{$prefix}link-color-rgb: #{to-rgb($link-color-dark)};\n    --#{$prefix}link-hover-color-rgb: #{to-rgb($link-hover-color-dark)};\n\n    --#{$prefix}code-color: #{$code-color-dark};\n    --#{$prefix}highlight-color: #{$mark-color-dark};\n    --#{$prefix}highlight-bg: #{$mark-bg-dark};\n\n    --#{$prefix}border-color: #{$border-color-dark};\n    --#{$prefix}border-color-translucent: #{$border-color-translucent-dark};\n\n    --#{$prefix}form-valid-color: #{$form-valid-color-dark};\n    --#{$prefix}form-valid-border-color: #{$form-valid-border-color-dark};\n    --#{$prefix}form-invalid-color: #{$form-invalid-color-dark};\n    --#{$prefix}form-invalid-border-color: #{$form-invalid-border-color-dark};\n    // scss-docs-end root-dark-mode-vars\n  }\n}\n","// stylelint-disable scss/dimension-no-non-numeric-values\n\n// SCSS RFS mixin\n//\n// Automated responsive values for font sizes, paddings, margins and much more\n//\n// Licensed under MIT (https://github.com/twbs/rfs/blob/main/LICENSE)\n\n// Configuration\n\n// Base value\n$rfs-base-value: 1.25rem !default;\n$rfs-unit: rem !default;\n\n@if $rfs-unit != rem and $rfs-unit != px {\n  @error \"`#{$rfs-unit}` is not a valid unit for $rfs-unit. Use `px` or `rem`.\";\n}\n\n// Breakpoint at where values start decreasing if screen width is smaller\n$rfs-breakpoint: 1200px !default;\n$rfs-breakpoint-unit: px !default;\n\n@if $rfs-breakpoint-unit != px and $rfs-breakpoint-unit != em and $rfs-breakpoint-unit != rem {\n  @error \"`#{$rfs-breakpoint-unit}` is not a valid unit for $rfs-breakpoint-unit. Use `px`, `em` or `rem`.\";\n}\n\n// Resize values based on screen height and width\n$rfs-two-dimensional: false !default;\n\n// Factor of decrease\n$rfs-factor: 10 !default;\n\n@if type-of($rfs-factor) != number or $rfs-factor <= 1 {\n  @error \"`#{$rfs-factor}` is not a valid  $rfs-factor, it must be greater than 1.\";\n}\n\n// Mode. Possibilities: \"min-media-query\", \"max-media-query\"\n$rfs-mode: min-media-query !default;\n\n// Generate enable or disable classes. Possibilities: false, \"enable\" or \"disable\"\n$rfs-class: false !default;\n\n// 1 rem = $rfs-rem-value px\n$rfs-rem-value: 16 !default;\n\n// Safari iframe resize bug: https://github.com/twbs/rfs/issues/14\n$rfs-safari-iframe-resize-bug-fix: false !default;\n\n// Disable RFS by setting $enable-rfs to false\n$enable-rfs: true !default;\n\n// Cache $rfs-base-value unit\n$rfs-base-value-unit: unit($rfs-base-value);\n\n@function divide($dividend, $divisor, $precision: 10) {\n  $sign: if($dividend > 0 and $divisor > 0 or $dividend < 0 and $divisor < 0, 1, -1);\n  $dividend: abs($dividend);\n  $divisor: abs($divisor);\n  @if $dividend == 0 {\n    @return 0;\n  }\n  @if $divisor == 0 {\n    @error \"Cannot divide by 0\";\n  }\n  $remainder: $dividend;\n  $result: 0;\n  $factor: 10;\n  @while ($remainder > 0 and $precision >= 0) {\n    $quotient: 0;\n    @while ($remainder >= $divisor) {\n      $remainder: $remainder - $divisor;\n      $quotient: $quotient + 1;\n    }\n    $result: $result * 10 + $quotient;\n    $factor: $factor * .1;\n    $remainder: $remainder * 10;\n    $precision: $precision - 1;\n    @if ($precision < 0 and $remainder >= $divisor * 5) {\n      $result: $result + 1;\n    }\n  }\n  $result: $result * $factor * $sign;\n  $dividend-unit: unit($dividend);\n  $divisor-unit: unit($divisor);\n  $unit-map: (\n    \"px\": 1px,\n    \"rem\": 1rem,\n    \"em\": 1em,\n    \"%\": 1%\n  );\n  @if ($dividend-unit != $divisor-unit and map-has-key($unit-map, $dividend-unit)) {\n    $result: $result * map-get($unit-map, $dividend-unit);\n  }\n  @return $result;\n}\n\n// Remove px-unit from $rfs-base-value for calculations\n@if $rfs-base-value-unit == px {\n  $rfs-base-value: divide($rfs-base-value, $rfs-base-value * 0 + 1);\n}\n@else if $rfs-base-value-unit == rem {\n  $rfs-base-value: divide($rfs-base-value, divide($rfs-base-value * 0 + 1, $rfs-rem-value));\n}\n\n// Cache $rfs-breakpoint unit to prevent multiple calls\n$rfs-breakpoint-unit-cache: unit($rfs-breakpoint);\n\n// Remove unit from $rfs-breakpoint for calculations\n@if $rfs-breakpoint-unit-cache == px {\n  $rfs-breakpoint: divide($rfs-breakpoint, $rfs-breakpoint * 0 + 1);\n}\n@else if $rfs-breakpoint-unit-cache == rem or $rfs-breakpoint-unit-cache == \"em\" {\n  $rfs-breakpoint: divide($rfs-breakpoint, divide($rfs-breakpoint * 0 + 1, $rfs-rem-value));\n}\n\n// Calculate the media query value\n$rfs-mq-value: if($rfs-breakpoint-unit == px, #{$rfs-breakpoint}px, #{divide($rfs-breakpoint, $rfs-rem-value)}#{$rfs-breakpoint-unit});\n$rfs-mq-property-width: if($rfs-mode == max-media-query, max-width, min-width);\n$rfs-mq-property-height: if($rfs-mode == max-media-query, max-height, min-height);\n\n// Internal mixin used to determine which media query needs to be used\n@mixin _rfs-media-query {\n  @if $rfs-two-dimensional {\n    @if $rfs-mode == max-media-query {\n      @media (#{$rfs-mq-property-width}: #{$rfs-mq-value}), (#{$rfs-mq-property-height}: #{$rfs-mq-value}) {\n        @content;\n      }\n    }\n    @else {\n      @media (#{$rfs-mq-property-width}: #{$rfs-mq-value}) and (#{$rfs-mq-property-height}: #{$rfs-mq-value}) {\n        @content;\n      }\n    }\n  }\n  @else {\n    @media (#{$rfs-mq-property-width}: #{$rfs-mq-value}) {\n      @content;\n    }\n  }\n}\n\n// Internal mixin that adds disable classes to the selector if needed.\n@mixin _rfs-rule {\n  @if $rfs-class == disable and $rfs-mode == max-media-query {\n    // Adding an extra class increases specificity, which prevents the media query to override the property\n    &,\n    .disable-rfs &,\n    &.disable-rfs {\n      @content;\n    }\n  }\n  @else if $rfs-class == enable and $rfs-mode == min-media-query {\n    .enable-rfs &,\n    &.enable-rfs {\n      @content;\n    }\n  } @else {\n    @content;\n  }\n}\n\n// Internal mixin that adds enable classes to the selector if needed.\n@mixin _rfs-media-query-rule {\n\n  @if $rfs-class == enable {\n    @if $rfs-mode == min-media-query {\n      @content;\n    }\n\n    @include _rfs-media-query () {\n      .enable-rfs &,\n      &.enable-rfs {\n        @content;\n      }\n    }\n  }\n  @else {\n    @if $rfs-class == disable and $rfs-mode == min-media-query {\n      .disable-rfs &,\n      &.disable-rfs {\n        @content;\n      }\n    }\n    @include _rfs-media-query () {\n      @content;\n    }\n  }\n}\n\n// Helper function to get the formatted non-responsive value\n@function rfs-value($values) {\n  // Convert to list\n  $values: if(type-of($values) != list, ($values,), $values);\n\n  $val: \"\";\n\n  // Loop over each value and calculate value\n  @each $value in $values {\n    @if $value == 0 {\n      $val: $val + \" 0\";\n    }\n    @else {\n      // Cache $value unit\n      $unit: if(type-of($value) == \"number\", unit($value), false);\n\n      @if $unit == px {\n        // Convert to rem if needed\n        $val: $val + \" \" + if($rfs-unit == rem, #{divide($value, $value * 0 + $rfs-rem-value)}rem, $value);\n      }\n      @else if $unit == rem {\n        // Convert to px if needed\n        $val: $val + \" \" + if($rfs-unit == px, #{divide($value, $value * 0 + 1) * $rfs-rem-value}px, $value);\n      } @else {\n        // If $value isn't a number (like inherit) or $value has a unit (not px or rem, like 1.5em) or $ is 0, just print the value\n        $val: $val + \" \" + $value;\n      }\n    }\n  }\n\n  // Remove first space\n  @return unquote(str-slice($val, 2));\n}\n\n// Helper function to get the responsive value calculated by RFS\n@function rfs-fluid-value($values) {\n  // Convert to list\n  $values: if(type-of($values) != list, ($values,), $values);\n\n  $val: \"\";\n\n  // Loop over each value and calculate value\n  @each $value in $values {\n    @if $value == 0 {\n      $val: $val + \" 0\";\n    } @else {\n      // Cache $value unit\n      $unit: if(type-of($value) == \"number\", unit($value), false);\n\n      // If $value isn't a number (like inherit) or $value has a unit (not px or rem, like 1.5em) or $ is 0, just print the value\n      @if not $unit or $unit != px and $unit != rem {\n        $val: $val + \" \" + $value;\n      } @else {\n        // Remove unit from $value for calculations\n        $value: divide($value, $value * 0 + if($unit == px, 1, divide(1, $rfs-rem-value)));\n\n        // Only add the media query if the value is greater than the minimum value\n        @if abs($value) <= $rfs-base-value or not $enable-rfs {\n          $val: $val + \" \" + if($rfs-unit == rem, #{divide($value, $rfs-rem-value)}rem, #{$value}px);\n        }\n        @else {\n          // Calculate the minimum value\n          $value-min: $rfs-base-value + divide(abs($value) - $rfs-base-value, $rfs-factor);\n\n          // Calculate difference between $value and the minimum value\n          $value-diff: abs($value) - $value-min;\n\n          // Base value formatting\n          $min-width: if($rfs-unit == rem, #{divide($value-min, $rfs-rem-value)}rem, #{$value-min}px);\n\n          // Use negative value if needed\n          $min-width: if($value < 0, -$min-width, $min-width);\n\n          // Use `vmin` if two-dimensional is enabled\n          $variable-unit: if($rfs-two-dimensional, vmin, vw);\n\n          // Calculate the variable width between 0 and $rfs-breakpoint\n          $variable-width: #{divide($value-diff * 100, $rfs-breakpoint)}#{$variable-unit};\n\n          // Return the calculated value\n          $val: $val + \" calc(\" + $min-width + if($value < 0, \" - \", \" + \") + $variable-width + \")\";\n        }\n      }\n    }\n  }\n\n  // Remove first space\n  @return unquote(str-slice($val, 2));\n}\n\n// RFS mixin\n@mixin rfs($values, $property: font-size) {\n  @if $values != null {\n    $val: rfs-value($values);\n    $fluid-val: rfs-fluid-value($values);\n\n    // Do not print the media query if responsive & non-responsive values are the same\n    @if $val == $fluid-val {\n      #{$property}: $val;\n    }\n    @else {\n      @include _rfs-rule () {\n        #{$property}: if($rfs-mode == max-media-query, $val, $fluid-val);\n\n        // Include safari iframe resize fix if needed\n        min-width: if($rfs-safari-iframe-resize-bug-fix, (0 * 1vw), null);\n      }\n\n      @include _rfs-media-query-rule () {\n        #{$property}: if($rfs-mode == max-media-query, $fluid-val, $val);\n      }\n    }\n  }\n}\n\n// Shorthand helper mixins\n@mixin font-size($value) {\n  @include rfs($value);\n}\n\n@mixin padding($value) {\n  @include rfs($value, padding);\n}\n\n@mixin padding-top($value) {\n  @include rfs($value, padding-top);\n}\n\n@mixin padding-right($value) {\n  @include rfs($value, padding-right);\n}\n\n@mixin padding-bottom($value) {\n  @include rfs($value, padding-bottom);\n}\n\n@mixin padding-left($value) {\n  @include rfs($value, padding-left);\n}\n\n@mixin margin($value) {\n  @include rfs($value, margin);\n}\n\n@mixin margin-top($value) {\n  @include rfs($value, margin-top);\n}\n\n@mixin margin-right($value) {\n  @include rfs($value, margin-right);\n}\n\n@mixin margin-bottom($value) {\n  @include rfs($value, margin-bottom);\n}\n\n@mixin margin-left($value) {\n  @include rfs($value, margin-left);\n}\n","// scss-docs-start color-mode-mixin\n@mixin color-mode($mode: light, $root: false) {\n  @if $color-mode-type == \"media-query\" {\n    @if $root == true {\n      @media (prefers-color-scheme: $mode) {\n        :root {\n          @content;\n        }\n      }\n    } @else {\n      @media (prefers-color-scheme: $mode) {\n        @content;\n      }\n    }\n  } @else {\n    [data-bs-theme=\"#{$mode}\"] {\n      @content;\n    }\n  }\n}\n// scss-docs-end color-mode-mixin\n","// stylelint-disable declaration-no-important, selector-no-qualifying-type, property-no-vendor-prefix\n\n\n// Reboot\n//\n// Normalization of HTML elements, manually forked from Normalize.css to remove\n// styles targeting irrelevant browsers while applying new styles.\n//\n// Normalize is licensed MIT. https://github.com/necolas/normalize.css\n\n\n// Document\n//\n// Change from `box-sizing: content-box` so that `width` is not affected by `padding` or `border`.\n\n*,\n*::before,\n*::after {\n  box-sizing: border-box;\n}\n\n\n// Root\n//\n// Ability to the value of the root font sizes, affecting the value of `rem`.\n// null by default, thus nothing is generated.\n\n:root {\n  @if $font-size-root != null {\n    @include font-size(var(--#{$prefix}root-font-size));\n  }\n\n  @if $enable-smooth-scroll {\n    @media (prefers-reduced-motion: no-preference) {\n      scroll-behavior: smooth;\n    }\n  }\n}\n\n\n// Body\n//\n// 1. Remove the margin in all browsers.\n// 2. As a best practice, apply a default `background-color`.\n// 3. Prevent adjustments of font size after orientation changes in iOS.\n// 4. Change the default tap highlight to be completely transparent in iOS.\n\n// scss-docs-start reboot-body-rules\nbody {\n  margin: 0; // 1\n  font-family: var(--#{$prefix}body-font-family);\n  @include font-size(var(--#{$prefix}body-font-size));\n  font-weight: var(--#{$prefix}body-font-weight);\n  line-height: var(--#{$prefix}body-line-height);\n  color: var(--#{$prefix}body-color);\n  text-align: var(--#{$prefix}body-text-align);\n  background-color: var(--#{$prefix}body-bg); // 2\n  -webkit-text-size-adjust: 100%; // 3\n  -webkit-tap-highlight-color: rgba($black, 0); // 4\n}\n// scss-docs-end reboot-body-rules\n\n\n// Content grouping\n//\n// 1. Reset Firefox's gray color\n\nhr {\n  margin: $hr-margin-y 0;\n  color: $hr-color; // 1\n  border: 0;\n  border-top: $hr-border-width solid $hr-border-color;\n  opacity: $hr-opacity;\n}\n\n\n// Typography\n//\n// 1. Remove top margins from headings\n//    By default, `<h1>`-`<h6>` all receive top and bottom margins. We nuke the top\n//    margin for easier control within type scales as it avoids margin collapsing.\n\n%heading {\n  margin-top: 0; // 1\n  margin-bottom: $headings-margin-bottom;\n  font-family: $headings-font-family;\n  font-style: $headings-font-style;\n  font-weight: $headings-font-weight;\n  line-height: $headings-line-height;\n  color: var(--#{$prefix}heading-color);\n}\n\nh1 {\n  @extend %heading;\n  @include font-size($h1-font-size);\n}\n\nh2 {\n  @extend %heading;\n  @include font-size($h2-font-size);\n}\n\nh3 {\n  @extend %heading;\n  @include font-size($h3-font-size);\n}\n\nh4 {\n  @extend %heading;\n  @include font-size($h4-font-size);\n}\n\nh5 {\n  @extend %heading;\n  @include font-size($h5-font-size);\n}\n\nh6 {\n  @extend %heading;\n  @include font-size($h6-font-size);\n}\n\n\n// Reset margins on paragraphs\n//\n// Similarly, the top margin on `<p>`s get reset. However, we also reset the\n// bottom margin to use `rem` units instead of `em`.\n\np {\n  margin-top: 0;\n  margin-bottom: $paragraph-margin-bottom;\n}\n\n\n// Abbreviations\n//\n// 1. Add the correct text decoration in Chrome, Edge, Opera, and Safari.\n// 2. Add explicit cursor to indicate changed behavior.\n// 3. Prevent the text-decoration to be skipped.\n\nabbr[title] {\n  text-decoration: underline dotted; // 1\n  cursor: help; // 2\n  text-decoration-skip-ink: none; // 3\n}\n\n\n// Address\n\naddress {\n  margin-bottom: 1rem;\n  font-style: normal;\n  line-height: inherit;\n}\n\n\n// Lists\n\nol,\nul {\n  padding-left: 2rem;\n}\n\nol,\nul,\ndl {\n  margin-top: 0;\n  margin-bottom: 1rem;\n}\n\nol ol,\nul ul,\nol ul,\nul ol {\n  margin-bottom: 0;\n}\n\ndt {\n  font-weight: $dt-font-weight;\n}\n\n// 1. Undo browser default\n\ndd {\n  margin-bottom: .5rem;\n  margin-left: 0; // 1\n}\n\n\n// Blockquote\n\nblockquote {\n  margin: 0 0 1rem;\n}\n\n\n// Strong\n//\n// Add the correct font weight in Chrome, Edge, and Safari\n\nb,\nstrong {\n  font-weight: $font-weight-bolder;\n}\n\n\n// Small\n//\n// Add the correct font size in all browsers\n\nsmall {\n  @include font-size($small-font-size);\n}\n\n\n// Mark\n\nmark {\n  padding: $mark-padding;\n  color: var(--#{$prefix}highlight-color);\n  background-color: var(--#{$prefix}highlight-bg);\n}\n\n\n// Sub and Sup\n//\n// Prevent `sub` and `sup` elements from affecting the line height in\n// all browsers.\n\nsub,\nsup {\n  position: relative;\n  @include font-size($sub-sup-font-size);\n  line-height: 0;\n  vertical-align: baseline;\n}\n\nsub { bottom: -.25em; }\nsup { top: -.5em; }\n\n\n// Links\n\na {\n  color: rgba(var(--#{$prefix}link-color-rgb), var(--#{$prefix}link-opacity, 1));\n  text-decoration: $link-decoration;\n\n  &:hover {\n    --#{$prefix}link-color-rgb: var(--#{$prefix}link-hover-color-rgb);\n    text-decoration: $link-hover-decoration;\n  }\n}\n\n// And undo these styles for placeholder links/named anchors (without href).\n// It would be more straightforward to just use a[href] in previous block, but that\n// causes specificity issues in many other styles that are too complex to fix.\n// See https://github.com/twbs/bootstrap/issues/19402\n\na:not([href]):not([class]) {\n  &,\n  &:hover {\n    color: inherit;\n    text-decoration: none;\n  }\n}\n\n\n// Code\n\npre,\ncode,\nkbd,\nsamp {\n  font-family: $font-family-code;\n  @include font-size(1em); // Correct the odd `em` font sizing in all browsers.\n}\n\n// 1. Remove browser default top margin\n// 2. Reset browser default of `1em` to use `rem`s\n// 3. Don't allow content to break outside\n\npre {\n  display: block;\n  margin-top: 0; // 1\n  margin-bottom: 1rem; // 2\n  overflow: auto; // 3\n  @include font-size($code-font-size);\n  color: $pre-color;\n\n  // Account for some code outputs that place code tags in pre tags\n  code {\n    @include font-size(inherit);\n    color: inherit;\n    word-break: normal;\n  }\n}\n\ncode {\n  @include font-size($code-font-size);\n  color: var(--#{$prefix}code-color);\n  word-wrap: break-word;\n\n  // Streamline the style when inside anchors to avoid broken underline and more\n  a > & {\n    color: inherit;\n  }\n}\n\nkbd {\n  padding: $kbd-padding-y $kbd-padding-x;\n  @include font-size($kbd-font-size);\n  color: $kbd-color;\n  background-color: $kbd-bg;\n  @include border-radius($border-radius-sm);\n\n  kbd {\n    padding: 0;\n    @include font-size(1em);\n    font-weight: $nested-kbd-font-weight;\n  }\n}\n\n\n// Figures\n//\n// Apply a consistent margin strategy (matches our type styles).\n\nfigure {\n  margin: 0 0 1rem;\n}\n\n\n// Images and content\n\nimg,\nsvg {\n  vertical-align: middle;\n}\n\n\n// Tables\n//\n// Prevent double borders\n\ntable {\n  caption-side: bottom;\n  border-collapse: collapse;\n}\n\ncaption {\n  padding-top: $table-cell-padding-y;\n  padding-bottom: $table-cell-padding-y;\n  color: $table-caption-color;\n  text-align: left;\n}\n\n// 1. Removes font-weight bold by inheriting\n// 2. Matches default `<td>` alignment by inheriting `text-align`.\n// 3. Fix alignment for Safari\n\nth {\n  font-weight: $table-th-font-weight; // 1\n  text-align: inherit; // 2\n  text-align: -webkit-match-parent; // 3\n}\n\nthead,\ntbody,\ntfoot,\ntr,\ntd,\nth {\n  border-color: inherit;\n  border-style: solid;\n  border-width: 0;\n}\n\n\n// Forms\n//\n// 1. Allow labels to use `margin` for spacing.\n\nlabel {\n  display: inline-block; // 1\n}\n\n// Remove the default `border-radius` that macOS Chrome adds.\n// See https://github.com/twbs/bootstrap/issues/24093\n\nbutton {\n  // stylelint-disable-next-line property-disallowed-list\n  border-radius: 0;\n}\n\n// Explicitly remove focus outline in Chromium when it shouldn't be\n// visible (e.g. as result of mouse click or touch tap). It already\n// should be doing this automatically, but seems to currently be\n// confused and applies its very visible two-tone outline anyway.\n\nbutton:focus:not(:focus-visible) {\n  outline: 0;\n}\n\n// 1. Remove the margin in Firefox and Safari\n\ninput,\nbutton,\nselect,\noptgroup,\ntextarea {\n  margin: 0; // 1\n  font-family: inherit;\n  @include font-size(inherit);\n  line-height: inherit;\n}\n\n// Remove the inheritance of text transform in Firefox\nbutton,\nselect {\n  text-transform: none;\n}\n// Set the cursor for non-`<button>` buttons\n//\n// Details at https://github.com/twbs/bootstrap/pull/30562\n[role=\"button\"] {\n  cursor: pointer;\n}\n\nselect {\n  // Remove the inheritance of word-wrap in Safari.\n  // See https://github.com/twbs/bootstrap/issues/24990\n  word-wrap: normal;\n\n  // Undo the opacity change from Chrome\n  &:disabled {\n    opacity: 1;\n  }\n}\n\n// Remove the dropdown arrow only from text type inputs built with datalists in Chrome.\n// See https://stackoverflow.com/a/54997118\n\n[list]:not([type=\"date\"]):not([type=\"datetime-local\"]):not([type=\"month\"]):not([type=\"week\"]):not([type=\"time\"])::-webkit-calendar-picker-indicator {\n  display: none !important;\n}\n\n// 1. Prevent a WebKit bug where (2) destroys native `audio` and `video`\n//    controls in Android 4.\n// 2. Correct the inability to style clickable types in iOS and Safari.\n// 3. Opinionated: add \"hand\" cursor to non-disabled button elements.\n\nbutton,\n[type=\"button\"], // 1\n[type=\"reset\"],\n[type=\"submit\"] {\n  -webkit-appearance: button; // 2\n\n  @if $enable-button-pointers {\n    &:not(:disabled) {\n      cursor: pointer; // 3\n    }\n  }\n}\n\n// Remove inner border and padding from Firefox, but don't restore the outline like Normalize.\n\n::-moz-focus-inner {\n  padding: 0;\n  border-style: none;\n}\n\n// 1. Textareas should really only resize vertically so they don't break their (horizontal) containers.\n\ntextarea {\n  resize: vertical; // 1\n}\n\n// 1. Browsers set a default `min-width: min-content;` on fieldsets,\n//    unlike e.g. `<div>`s, which have `min-width: 0;` by default.\n//    So we reset that to ensure fieldsets behave more like a standard block element.\n//    See https://github.com/twbs/bootstrap/issues/12359\n//    and https://html.spec.whatwg.org/multipage/#the-fieldset-and-legend-elements\n// 2. Reset the default outline behavior of fieldsets so they don't affect page layout.\n\nfieldset {\n  min-width: 0; // 1\n  padding: 0; // 2\n  margin: 0; // 2\n  border: 0; // 2\n}\n\n// 1. By using `float: left`, the legend will behave like a block element.\n//    This way the border of a fieldset wraps around the legend if present.\n// 2. Fix wrapping bug.\n//    See https://github.com/twbs/bootstrap/issues/29712\n\nlegend {\n  float: left; // 1\n  width: 100%;\n  padding: 0;\n  margin-bottom: $legend-margin-bottom;\n  @include font-size($legend-font-size);\n  font-weight: $legend-font-weight;\n  line-height: inherit;\n\n  + * {\n    clear: left; // 2\n  }\n}\n\n// Fix height of inputs with a type of datetime-local, date, month, week, or time\n// See https://github.com/twbs/bootstrap/issues/18842\n\n::-webkit-datetime-edit-fields-wrapper,\n::-webkit-datetime-edit-text,\n::-webkit-datetime-edit-minute,\n::-webkit-datetime-edit-hour-field,\n::-webkit-datetime-edit-day-field,\n::-webkit-datetime-edit-month-field,\n::-webkit-datetime-edit-year-field {\n  padding: 0;\n}\n\n::-webkit-inner-spin-button {\n  height: auto;\n}\n\n// 1. This overrides the extra rounded corners on search inputs in iOS so that our\n//    `.form-control` class can properly style them. Note that this cannot simply\n//    be added to `.form-control` as it's not specific enough. For details, see\n//    https://github.com/twbs/bootstrap/issues/11586.\n// 2. Correct the outline style in Safari.\n\n[type=\"search\"] {\n  -webkit-appearance: textfield; // 1\n  outline-offset: -2px; // 2\n}\n\n// 1. A few input types should stay LTR\n// See https://rtlstyling.com/posts/rtl-styling#form-inputs\n// 2. RTL only output\n// See https://rtlcss.com/learn/usage-guide/control-directives/#raw\n\n/* rtl:raw:\n[type=\"tel\"],\n[type=\"url\"],\n[type=\"email\"],\n[type=\"number\"] {\n  direction: ltr;\n}\n*/\n\n// Remove the inner padding in Chrome and Safari on macOS.\n\n::-webkit-search-decoration {\n  -webkit-appearance: none;\n}\n\n// Remove padding around color pickers in webkit browsers\n\n::-webkit-color-swatch-wrapper {\n  padding: 0;\n}\n\n\n// 1. Inherit font family and line height for file input buttons\n// 2. Correct the inability to style clickable types in iOS and Safari.\n\n::file-selector-button {\n  font: inherit; // 1\n  -webkit-appearance: button; // 2\n}\n\n// Correct element displays\n\noutput {\n  display: inline-block;\n}\n\n// Remove border from iframe\n\niframe {\n  border: 0;\n}\n\n// Summary\n//\n// 1. Add the correct display in all browsers\n\nsummary {\n  display: list-item; // 1\n  cursor: pointer;\n}\n\n\n// Progress\n//\n// Add the correct vertical alignment in Chrome, Firefox, and Opera.\n\nprogress {\n  vertical-align: baseline;\n}\n\n\n// Hidden attribute\n//\n// Always hide an element with the `hidden` HTML attribute.\n\n[hidden] {\n  display: none !important;\n}\n","// Variables\n//\n// Variables should follow the `$component-state-property-size` formula for\n// consistent naming. Ex: $nav-link-disabled-color and $modal-content-box-shadow-xs.\n\n// Color system\n\n// scss-docs-start gray-color-variables\n$white:    #fff !default;\n$gray-100: #f8f9fa !default;\n$gray-200: #e9ecef !default;\n$gray-300: #dee2e6 !default;\n$gray-400: #ced4da !default;\n$gray-500: #adb5bd !default;\n$gray-600: #6c757d !default;\n$gray-700: #495057 !default;\n$gray-800: #343a40 !default;\n$gray-900: #212529 !default;\n$black:    #000 !default;\n// scss-docs-end gray-color-variables\n\n// fusv-disable\n// scss-docs-start gray-colors-map\n$grays: (\n  \"100\": $gray-100,\n  \"200\": $gray-200,\n  \"300\": $gray-300,\n  \"400\": $gray-400,\n  \"500\": $gray-500,\n  \"600\": $gray-600,\n  \"700\": $gray-700,\n  \"800\": $gray-800,\n  \"900\": $gray-900\n) !default;\n// scss-docs-end gray-colors-map\n// fusv-enable\n\n// scss-docs-start color-variables\n$blue:    #0d6efd !default;\n$indigo:  #6610f2 !default;\n$purple:  #6f42c1 !default;\n$pink:    #d63384 !default;\n$red:     #dc3545 !default;\n$orange:  #fd7e14 !default;\n$yellow:  #ffc107 !default;\n$green:   #198754 !default;\n$teal:    #20c997 !default;\n$cyan:    #0dcaf0 !default;\n// scss-docs-end color-variables\n\n// scss-docs-start colors-map\n$colors: (\n  \"blue\":       $blue,\n  \"indigo\":     $indigo,\n  \"purple\":     $purple,\n  \"pink\":       $pink,\n  \"red\":        $red,\n  \"orange\":     $orange,\n  \"yellow\":     $yellow,\n  \"green\":      $green,\n  \"teal\":       $teal,\n  \"cyan\":       $cyan,\n  \"black\":      $black,\n  \"white\":      $white,\n  \"gray\":       $gray-600,\n  \"gray-dark\":  $gray-800\n) !default;\n// scss-docs-end colors-map\n\n// The contrast ratio to reach against white, to determine if color changes from \"light\" to \"dark\". Acceptable values for WCAG 2.0 are 3, 4.5 and 7.\n// See https://www.w3.org/TR/WCAG20/#visual-audio-contrast-contrast\n$min-contrast-ratio:   4.5 !default;\n\n// Customize the light and dark text colors for use in our color contrast function.\n$color-contrast-dark:      $black !default;\n$color-contrast-light:     $white !default;\n\n// fusv-disable\n$blue-100: tint-color($blue, 80%) !default;\n$blue-200: tint-color($blue, 60%) !default;\n$blue-300: tint-color($blue, 40%) !default;\n$blue-400: tint-color($blue, 20%) !default;\n$blue-500: $blue !default;\n$blue-600: shade-color($blue, 20%) !default;\n$blue-700: shade-color($blue, 40%) !default;\n$blue-800: shade-color($blue, 60%) !default;\n$blue-900: shade-color($blue, 80%) !default;\n\n$indigo-100: tint-color($indigo, 80%) !default;\n$indigo-200: tint-color($indigo, 60%) !default;\n$indigo-300: tint-color($indigo, 40%) !default;\n$indigo-400: tint-color($indigo, 20%) !default;\n$indigo-500: $indigo !default;\n$indigo-600: shade-color($indigo, 20%) !default;\n$indigo-700: shade-color($indigo, 40%) !default;\n$indigo-800: shade-color($indigo, 60%) !default;\n$indigo-900: shade-color($indigo, 80%) !default;\n\n$purple-100: tint-color($purple, 80%) !default;\n$purple-200: tint-color($purple, 60%) !default;\n$purple-300: tint-color($purple, 40%) !default;\n$purple-400: tint-color($purple, 20%) !default;\n$purple-500: $purple !default;\n$purple-600: shade-color($purple, 20%) !default;\n$purple-700: shade-color($purple, 40%) !default;\n$purple-800: shade-color($purple, 60%) !default;\n$purple-900: shade-color($purple, 80%) !default;\n\n$pink-100: tint-color($pink, 80%) !default;\n$pink-200: tint-color($pink, 60%) !default;\n$pink-300: tint-color($pink, 40%) !default;\n$pink-400: tint-color($pink, 20%) !default;\n$pink-500: $pink !default;\n$pink-600: shade-color($pink, 20%) !default;\n$pink-700: shade-color($pink, 40%) !default;\n$pink-800: shade-color($pink, 60%) !default;\n$pink-900: shade-color($pink, 80%) !default;\n\n$red-100: tint-color($red, 80%) !default;\n$red-200: tint-color($red, 60%) !default;\n$red-300: tint-color($red, 40%) !default;\n$red-400: tint-color($red, 20%) !default;\n$red-500: $red !default;\n$red-600: shade-color($red, 20%) !default;\n$red-700: shade-color($red, 40%) !default;\n$red-800: shade-color($red, 60%) !default;\n$red-900: shade-color($red, 80%) !default;\n\n$orange-100: tint-color($orange, 80%) !default;\n$orange-200: tint-color($orange, 60%) !default;\n$orange-300: tint-color($orange, 40%) !default;\n$orange-400: tint-color($orange, 20%) !default;\n$orange-500: $orange !default;\n$orange-600: shade-color($orange, 20%) !default;\n$orange-700: shade-color($orange, 40%) !default;\n$orange-800: shade-color($orange, 60%) !default;\n$orange-900: shade-color($orange, 80%) !default;\n\n$yellow-100: tint-color($yellow, 80%) !default;\n$yellow-200: tint-color($yellow, 60%) !default;\n$yellow-300: tint-color($yellow, 40%) !default;\n$yellow-400: tint-color($yellow, 20%) !default;\n$yellow-500: $yellow !default;\n$yellow-600: shade-color($yellow, 20%) !default;\n$yellow-700: shade-color($yellow, 40%) !default;\n$yellow-800: shade-color($yellow, 60%) !default;\n$yellow-900: shade-color($yellow, 80%) !default;\n\n$green-100: tint-color($green, 80%) !default;\n$green-200: tint-color($green, 60%) !default;\n$green-300: tint-color($green, 40%) !default;\n$green-400: tint-color($green, 20%) !default;\n$green-500: $green !default;\n$green-600: shade-color($green, 20%) !default;\n$green-700: shade-color($green, 40%) !default;\n$green-800: shade-color($green, 60%) !default;\n$green-900: shade-color($green, 80%) !default;\n\n$teal-100: tint-color($teal, 80%) !default;\n$teal-200: tint-color($teal, 60%) !default;\n$teal-300: tint-color($teal, 40%) !default;\n$teal-400: tint-color($teal, 20%) !default;\n$teal-500: $teal !default;\n$teal-600: shade-color($teal, 20%) !default;\n$teal-700: shade-color($teal, 40%) !default;\n$teal-800: shade-color($teal, 60%) !default;\n$teal-900: shade-color($teal, 80%) !default;\n\n$cyan-100: tint-color($cyan, 80%) !default;\n$cyan-200: tint-color($cyan, 60%) !default;\n$cyan-300: tint-color($cyan, 40%) !default;\n$cyan-400: tint-color($cyan, 20%) !default;\n$cyan-500: $cyan !default;\n$cyan-600: shade-color($cyan, 20%) !default;\n$cyan-700: shade-color($cyan, 40%) !default;\n$cyan-800: shade-color($cyan, 60%) !default;\n$cyan-900: shade-color($cyan, 80%) !default;\n\n$blues: (\n  \"blue-100\": $blue-100,\n  \"blue-200\": $blue-200,\n  \"blue-300\": $blue-300,\n  \"blue-400\": $blue-400,\n  \"blue-500\": $blue-500,\n  \"blue-600\": $blue-600,\n  \"blue-700\": $blue-700,\n  \"blue-800\": $blue-800,\n  \"blue-900\": $blue-900\n) !default;\n\n$indigos: (\n  \"indigo-100\": $indigo-100,\n  \"indigo-200\": $indigo-200,\n  \"indigo-300\": $indigo-300,\n  \"indigo-400\": $indigo-400,\n  \"indigo-500\": $indigo-500,\n  \"indigo-600\": $indigo-600,\n  \"indigo-700\": $indigo-700,\n  \"indigo-800\": $indigo-800,\n  \"indigo-900\": $indigo-900\n) !default;\n\n$purples: (\n  \"purple-100\": $purple-100,\n  \"purple-200\": $purple-200,\n  \"purple-300\": $purple-300,\n  \"purple-400\": $purple-400,\n  \"purple-500\": $purple-500,\n  \"purple-600\": $purple-600,\n  \"purple-700\": $purple-700,\n  \"purple-800\": $purple-800,\n  \"purple-900\": $purple-900\n) !default;\n\n$pinks: (\n  \"pink-100\": $pink-100,\n  \"pink-200\": $pink-200,\n  \"pink-300\": $pink-300,\n  \"pink-400\": $pink-400,\n  \"pink-500\": $pink-500,\n  \"pink-600\": $pink-600,\n  \"pink-700\": $pink-700,\n  \"pink-800\": $pink-800,\n  \"pink-900\": $pink-900\n) !default;\n\n$reds: (\n  \"red-100\": $red-100,\n  \"red-200\": $red-200,\n  \"red-300\": $red-300,\n  \"red-400\": $red-400,\n  \"red-500\": $red-500,\n  \"red-600\": $red-600,\n  \"red-700\": $red-700,\n  \"red-800\": $red-800,\n  \"red-900\": $red-900\n) !default;\n\n$oranges: (\n  \"orange-100\": $orange-100,\n  \"orange-200\": $orange-200,\n  \"orange-300\": $orange-300,\n  \"orange-400\": $orange-400,\n  \"orange-500\": $orange-500,\n  \"orange-600\": $orange-600,\n  \"orange-700\": $orange-700,\n  \"orange-800\": $orange-800,\n  \"orange-900\": $orange-900\n) !default;\n\n$yellows: (\n  \"yellow-100\": $yellow-100,\n  \"yellow-200\": $yellow-200,\n  \"yellow-300\": $yellow-300,\n  \"yellow-400\": $yellow-400,\n  \"yellow-500\": $yellow-500,\n  \"yellow-600\": $yellow-600,\n  \"yellow-700\": $yellow-700,\n  \"yellow-800\": $yellow-800,\n  \"yellow-900\": $yellow-900\n) !default;\n\n$greens: (\n  \"green-100\": $green-100,\n  \"green-200\": $green-200,\n  \"green-300\": $green-300,\n  \"green-400\": $green-400,\n  \"green-500\": $green-500,\n  \"green-600\": $green-600,\n  \"green-700\": $green-700,\n  \"green-800\": $green-800,\n  \"green-900\": $green-900\n) !default;\n\n$teals: (\n  \"teal-100\": $teal-100,\n  \"teal-200\": $teal-200,\n  \"teal-300\": $teal-300,\n  \"teal-400\": $teal-400,\n  \"teal-500\": $teal-500,\n  \"teal-600\": $teal-600,\n  \"teal-700\": $teal-700,\n  \"teal-800\": $teal-800,\n  \"teal-900\": $teal-900\n) !default;\n\n$cyans: (\n  \"cyan-100\": $cyan-100,\n  \"cyan-200\": $cyan-200,\n  \"cyan-300\": $cyan-300,\n  \"cyan-400\": $cyan-400,\n  \"cyan-500\": $cyan-500,\n  \"cyan-600\": $cyan-600,\n  \"cyan-700\": $cyan-700,\n  \"cyan-800\": $cyan-800,\n  \"cyan-900\": $cyan-900\n) !default;\n// fusv-enable\n\n// scss-docs-start theme-color-variables\n$primary:       $blue !default;\n$secondary:     $gray-600 !default;\n$success:       $green !default;\n$info:          $cyan !default;\n$warning:       $yellow !default;\n$danger:        $red !default;\n$light:         $gray-100 !default;\n$dark:          $gray-900 !default;\n// scss-docs-end theme-color-variables\n\n// scss-docs-start theme-colors-map\n$theme-colors: (\n  \"primary\":    $primary,\n  \"secondary\":  $secondary,\n  \"success\":    $success,\n  \"info\":       $info,\n  \"warning\":    $warning,\n  \"danger\":     $danger,\n  \"light\":      $light,\n  \"dark\":       $dark\n) !default;\n// scss-docs-end theme-colors-map\n\n// scss-docs-start theme-text-variables\n$primary-text-emphasis:   shade-color($primary, 60%) !default;\n$secondary-text-emphasis: shade-color($secondary, 60%) !default;\n$success-text-emphasis:   shade-color($success, 60%) !default;\n$info-text-emphasis:      shade-color($info, 60%) !default;\n$warning-text-emphasis:   shade-color($warning, 60%) !default;\n$danger-text-emphasis:    shade-color($danger, 60%) !default;\n$light-text-emphasis:     $gray-700 !default;\n$dark-text-emphasis:      $gray-700 !default;\n// scss-docs-end theme-text-variables\n\n// scss-docs-start theme-bg-subtle-variables\n$primary-bg-subtle:       tint-color($primary, 80%) !default;\n$secondary-bg-subtle:     tint-color($secondary, 80%) !default;\n$success-bg-subtle:       tint-color($success, 80%) !default;\n$info-bg-subtle:          tint-color($info, 80%) !default;\n$warning-bg-subtle:       tint-color($warning, 80%) !default;\n$danger-bg-subtle:        tint-color($danger, 80%) !default;\n$light-bg-subtle:         mix($gray-100, $white) !default;\n$dark-bg-subtle:          $gray-400 !default;\n// scss-docs-end theme-bg-subtle-variables\n\n// scss-docs-start theme-border-subtle-variables\n$primary-border-subtle:   tint-color($primary, 60%) !default;\n$secondary-border-subtle: tint-color($secondary, 60%) !default;\n$success-border-subtle:   tint-color($success, 60%) !default;\n$info-border-subtle:      tint-color($info, 60%) !default;\n$warning-border-subtle:   tint-color($warning, 60%) !default;\n$danger-border-subtle:    tint-color($danger, 60%) !default;\n$light-border-subtle:     $gray-200 !default;\n$dark-border-subtle:      $gray-500 !default;\n// scss-docs-end theme-border-subtle-variables\n\n// Characters which are escaped by the escape-svg function\n$escaped-characters: (\n  (\"<\", \"%3c\"),\n  (\">\", \"%3e\"),\n  (\"#\", \"%23\"),\n  (\"(\", \"%28\"),\n  (\")\", \"%29\"),\n) !default;\n\n// Options\n//\n// Quickly modify global styling by enabling or disabling optional features.\n\n$enable-caret:                true !default;\n$enable-rounded:              true !default;\n$enable-shadows:              false !default;\n$enable-gradients:            false !default;\n$enable-transitions:          true !default;\n$enable-reduced-motion:       true !default;\n$enable-smooth-scroll:        true !default;\n$enable-grid-classes:         true !default;\n$enable-container-classes:    true !default;\n$enable-cssgrid:              false !default;\n$enable-button-pointers:      true !default;\n$enable-rfs:                  true !default;\n$enable-validation-icons:     true !default;\n$enable-negative-margins:     false !default;\n$enable-deprecation-messages: true !default;\n$enable-important-utilities:  true !default;\n\n$enable-dark-mode:            true !default;\n$color-mode-type:             data !default; // `data` or `media-query`\n\n// Prefix for :root CSS variables\n\n$variable-prefix:             bs- !default; // Deprecated in v5.2.0 for the shorter `$prefix`\n$prefix:                      $variable-prefix !default;\n\n// Gradient\n//\n// The gradient which is added to components if `$enable-gradients` is `true`\n// This gradient is also added to elements with `.bg-gradient`\n// scss-docs-start variable-gradient\n$gradient: linear-gradient(180deg, rgba($white, .15), rgba($white, 0)) !default;\n// scss-docs-end variable-gradient\n\n// Spacing\n//\n// Control the default styling of most Bootstrap elements by modifying these\n// variables. Mostly focused on spacing.\n// You can add more entries to the $spacers map, should you need more variation.\n\n// scss-docs-start spacer-variables-maps\n$spacer: 1rem !default;\n$spacers: (\n  0: 0,\n  1: $spacer * .25,\n  2: $spacer * .5,\n  3: $spacer,\n  4: $spacer * 1.5,\n  5: $spacer * 3,\n) !default;\n// scss-docs-end spacer-variables-maps\n\n// Position\n//\n// Define the edge positioning anchors of the position utilities.\n\n// scss-docs-start position-map\n$position-values: (\n  0: 0,\n  50: 50%,\n  100: 100%\n) !default;\n// scss-docs-end position-map\n\n// Body\n//\n// Settings for the `<body>` element.\n\n$body-text-align:           null !default;\n$body-color:                $gray-900 !default;\n$body-bg:                   $white !default;\n\n$body-secondary-color:      rgba($body-color, .75) !default;\n$body-secondary-bg:         $gray-200 !default;\n\n$body-tertiary-color:       rgba($body-color, .5) !default;\n$body-tertiary-bg:          $gray-100 !default;\n\n$body-emphasis-color:       $black !default;\n\n// Links\n//\n// Style anchor elements.\n\n$link-color:                              $primary !default;\n$link-decoration:                         underline !default;\n$link-shade-percentage:                   20% !default;\n$link-hover-color:                        shift-color($link-color, $link-shade-percentage) !default;\n$link-hover-decoration:                   null !default;\n\n$stretched-link-pseudo-element:           after !default;\n$stretched-link-z-index:                  1 !default;\n\n// Icon links\n// scss-docs-start icon-link-variables\n$icon-link-gap:               .375rem !default;\n$icon-link-underline-offset:  .25em !default;\n$icon-link-icon-size:         1em !default;\n$icon-link-icon-transition:   .2s ease-in-out transform !default;\n$icon-link-icon-transform:    translate3d(.25em, 0, 0) !default;\n// scss-docs-end icon-link-variables\n\n// Paragraphs\n//\n// Style p element.\n\n$paragraph-margin-bottom:   1rem !default;\n\n\n// Grid breakpoints\n//\n// Define the minimum dimensions at which your layout will change,\n// adapting to different screen sizes, for use in media queries.\n\n// scss-docs-start grid-breakpoints\n$grid-breakpoints: (\n  xs: 0,\n  sm: 576px,\n  md: 768px,\n  lg: 992px,\n  xl: 1200px,\n  xxl: 1400px\n) !default;\n// scss-docs-end grid-breakpoints\n\n@include _assert-ascending($grid-breakpoints, \"$grid-breakpoints\");\n@include _assert-starts-at-zero($grid-breakpoints, \"$grid-breakpoints\");\n\n\n// Grid containers\n//\n// Define the maximum width of `.container` for different screen sizes.\n\n// scss-docs-start container-max-widths\n$container-max-widths: (\n  sm: 540px,\n  md: 720px,\n  lg: 960px,\n  xl: 1140px,\n  xxl: 1320px\n) !default;\n// scss-docs-end container-max-widths\n\n@include _assert-ascending($container-max-widths, \"$container-max-widths\");\n\n\n// Grid columns\n//\n// Set the number of columns and specify the width of the gutters.\n\n$grid-columns:                12 !default;\n$grid-gutter-width:           1.5rem !default;\n$grid-row-columns:            6 !default;\n\n// Container padding\n\n$container-padding-x: $grid-gutter-width !default;\n\n\n// Components\n//\n// Define common padding and border radius sizes and more.\n\n// scss-docs-start border-variables\n$border-width:                1px !default;\n$border-widths: (\n  1: 1px,\n  2: 2px,\n  3: 3px,\n  4: 4px,\n  5: 5px\n) !default;\n$border-style:                solid !default;\n$border-color:                $gray-300 !default;\n$border-color-translucent:    rgba($black, .175) !default;\n// scss-docs-end border-variables\n\n// scss-docs-start border-radius-variables\n$border-radius:               .375rem !default;\n$border-radius-sm:            .25rem !default;\n$border-radius-lg:            .5rem !default;\n$border-radius-xl:            1rem !default;\n$border-radius-xxl:           2rem !default;\n$border-radius-pill:          50rem !default;\n// scss-docs-end border-radius-variables\n// fusv-disable\n$border-radius-2xl:           $border-radius-xxl !default; // Deprecated in v5.3.0\n// fusv-enable\n\n// scss-docs-start box-shadow-variables\n$box-shadow:                  0 .5rem 1rem rgba($black, .15) !default;\n$box-shadow-sm:               0 .125rem .25rem rgba($black, .075) !default;\n$box-shadow-lg:               0 1rem 3rem rgba($black, .175) !default;\n$box-shadow-inset:            inset 0 1px 2px rgba($black, .075) !default;\n// scss-docs-end box-shadow-variables\n\n$component-active-color:      $white !default;\n$component-active-bg:         $primary !default;\n\n// scss-docs-start focus-ring-variables\n$focus-ring-width:      .25rem !default;\n$focus-ring-opacity:    .25 !default;\n$focus-ring-color:      rgba($primary, $focus-ring-opacity) !default;\n$focus-ring-blur:       0 !default;\n$focus-ring-box-shadow: 0 0 $focus-ring-blur $focus-ring-width $focus-ring-color !default;\n// scss-docs-end focus-ring-variables\n\n// scss-docs-start caret-variables\n$caret-width:                 .3em !default;\n$caret-vertical-align:        $caret-width * .85 !default;\n$caret-spacing:               $caret-width * .85 !default;\n// scss-docs-end caret-variables\n\n$transition-base:             all .2s ease-in-out !default;\n$transition-fade:             opacity .15s linear !default;\n// scss-docs-start collapse-transition\n$transition-collapse:         height .35s ease !default;\n$transition-collapse-width:   width .35s ease !default;\n// scss-docs-end collapse-transition\n\n// stylelint-disable function-disallowed-list\n// scss-docs-start aspect-ratios\n$aspect-ratios: (\n  \"1x1\": 100%,\n  \"4x3\": calc(3 / 4 * 100%),\n  \"16x9\": calc(9 / 16 * 100%),\n  \"21x9\": calc(9 / 21 * 100%)\n) !default;\n// scss-docs-end aspect-ratios\n// stylelint-enable function-disallowed-list\n\n// Typography\n//\n// Font, line-height, and color for body text, headings, and more.\n\n// scss-docs-start font-variables\n// stylelint-disable value-keyword-case\n$font-family-sans-serif:      system-ui, -apple-system, \"Segoe UI\", Roboto, \"Helvetica Neue\", \"Noto Sans\", \"Liberation Sans\", Arial, sans-serif, \"Apple Color Emoji\", \"Segoe UI Emoji\", \"Segoe UI Symbol\", \"Noto Color Emoji\" !default;\n$font-family-monospace:       SFMono-Regular, Menlo, Monaco, Consolas, \"Liberation Mono\", \"Courier New\", monospace !default;\n// stylelint-enable value-keyword-case\n$font-family-base:            var(--#{$prefix}font-sans-serif) !default;\n$font-family-code:            var(--#{$prefix}font-monospace) !default;\n\n// $font-size-root affects the value of `rem`, which is used for as well font sizes, paddings, and margins\n// $font-size-base affects the font size of the body text\n$font-size-root:              null !default;\n$font-size-base:              1rem !default; // Assumes the browser default, typically `16px`\n$font-size-sm:                $font-size-base * .875 !default;\n$font-size-lg:                $font-size-base * 1.25 !default;\n\n$font-weight-lighter:         lighter !default;\n$font-weight-light:           300 !default;\n$font-weight-normal:          400 !default;\n$font-weight-medium:          500 !default;\n$font-weight-semibold:        600 !default;\n$font-weight-bold:            700 !default;\n$font-weight-bolder:          bolder !default;\n\n$font-weight-base:            $font-weight-normal !default;\n\n$line-height-base:            1.5 !default;\n$line-height-sm:              1.25 !default;\n$line-height-lg:              2 !default;\n\n$h1-font-size:                $font-size-base * 2.5 !default;\n$h2-font-size:                $font-size-base * 2 !default;\n$h3-font-size:                $font-size-base * 1.75 !default;\n$h4-font-size:                $font-size-base * 1.5 !default;\n$h5-font-size:                $font-size-base * 1.25 !default;\n$h6-font-size:                $font-size-base !default;\n// scss-docs-end font-variables\n\n// scss-docs-start font-sizes\n$font-sizes: (\n  1: $h1-font-size,\n  2: $h2-font-size,\n  3: $h3-font-size,\n  4: $h4-font-size,\n  5: $h5-font-size,\n  6: $h6-font-size\n) !default;\n// scss-docs-end font-sizes\n\n// scss-docs-start headings-variables\n$headings-margin-bottom:      $spacer * .5 !default;\n$headings-font-family:        null !default;\n$headings-font-style:         null !default;\n$headings-font-weight:        500 !default;\n$headings-line-height:        1.2 !default;\n$headings-color:              inherit !default;\n// scss-docs-end headings-variables\n\n// scss-docs-start display-headings\n$display-font-sizes: (\n  1: 5rem,\n  2: 4.5rem,\n  3: 4rem,\n  4: 3.5rem,\n  5: 3rem,\n  6: 2.5rem\n) !default;\n\n$display-font-family: null !default;\n$display-font-style:  null !default;\n$display-font-weight: 300 !default;\n$display-line-height: $headings-line-height !default;\n// scss-docs-end display-headings\n\n// scss-docs-start type-variables\n$lead-font-size:              $font-size-base * 1.25 !default;\n$lead-font-weight:            300 !default;\n\n$small-font-size:             .875em !default;\n\n$sub-sup-font-size:           .75em !default;\n\n// fusv-disable\n$text-muted:                  var(--#{$prefix}secondary-color) !default; // Deprecated in 5.3.0\n// fusv-enable\n\n$initialism-font-size:        $small-font-size !default;\n\n$blockquote-margin-y:         $spacer !default;\n$blockquote-font-size:        $font-size-base * 1.25 !default;\n$blockquote-footer-color:     $gray-600 !default;\n$blockquote-footer-font-size: $small-font-size !default;\n\n$hr-margin-y:                 $spacer !default;\n$hr-color:                    inherit !default;\n\n// fusv-disable\n$hr-bg-color:                 null !default; // Deprecated in v5.2.0\n$hr-height:                   null !default; // Deprecated in v5.2.0\n// fusv-enable\n\n$hr-border-color:             null !default; // Allows for inherited colors\n$hr-border-width:             var(--#{$prefix}border-width) !default;\n$hr-opacity:                  .25 !default;\n\n// scss-docs-start vr-variables\n$vr-border-width:             var(--#{$prefix}border-width) !default;\n// scss-docs-end vr-variables\n\n$legend-margin-bottom:        .5rem !default;\n$legend-font-size:            1.5rem !default;\n$legend-font-weight:          null !default;\n\n$dt-font-weight:              $font-weight-bold !default;\n\n$list-inline-padding:         .5rem !default;\n\n$mark-padding:                .1875em !default;\n$mark-color:                  $body-color !default;\n$mark-bg:                     $yellow-100 !default;\n// scss-docs-end type-variables\n\n\n// Tables\n//\n// Customizes the `.table` component with basic values, each used across all table variations.\n\n// scss-docs-start table-variables\n$table-cell-padding-y:        .5rem !default;\n$table-cell-padding-x:        .5rem !default;\n$table-cell-padding-y-sm:     .25rem !default;\n$table-cell-padding-x-sm:     .25rem !default;\n\n$table-cell-vertical-align:   top !default;\n\n$table-color:                 var(--#{$prefix}emphasis-color) !default;\n$table-bg:                    var(--#{$prefix}body-bg) !default;\n$table-accent-bg:             transparent !default;\n\n$table-th-font-weight:        null !default;\n\n$table-striped-color:         $table-color !default;\n$table-striped-bg-factor:     .05 !default;\n$table-striped-bg:            rgba(var(--#{$prefix}emphasis-color-rgb), $table-striped-bg-factor) !default;\n\n$table-active-color:          $table-color !default;\n$table-active-bg-factor:      .1 !default;\n$table-active-bg:             rgba(var(--#{$prefix}emphasis-color-rgb), $table-active-bg-factor) !default;\n\n$table-hover-color:           $table-color !default;\n$table-hover-bg-factor:       .075 !default;\n$table-hover-bg:              rgba(var(--#{$prefix}emphasis-color-rgb), $table-hover-bg-factor) !default;\n\n$table-border-factor:         .2 !default;\n$table-border-width:          var(--#{$prefix}border-width) !default;\n$table-border-color:          var(--#{$prefix}border-color) !default;\n\n$table-striped-order:         odd !default;\n$table-striped-columns-order: even !default;\n\n$table-group-separator-color: currentcolor !default;\n\n$table-caption-color:         var(--#{$prefix}secondary-color) !default;\n\n$table-bg-scale:              -80% !default;\n// scss-docs-end table-variables\n\n// scss-docs-start table-loop\n$table-variants: (\n  \"primary\":    shift-color($primary, $table-bg-scale),\n  \"secondary\":  shift-color($secondary, $table-bg-scale),\n  \"success\":    shift-color($success, $table-bg-scale),\n  \"info\":       shift-color($info, $table-bg-scale),\n  \"warning\":    shift-color($warning, $table-bg-scale),\n  \"danger\":     shift-color($danger, $table-bg-scale),\n  \"light\":      $light,\n  \"dark\":       $dark,\n) !default;\n// scss-docs-end table-loop\n\n\n// Buttons + Forms\n//\n// Shared variables that are reassigned to `$input-` and `$btn-` specific variables.\n\n// scss-docs-start input-btn-variables\n$input-btn-padding-y:         .375rem !default;\n$input-btn-padding-x:         .75rem !default;\n$input-btn-font-family:       null !default;\n$input-btn-font-size:         $font-size-base !default;\n$input-btn-line-height:       $line-height-base !default;\n\n$input-btn-focus-width:         $focus-ring-width !default;\n$input-btn-focus-color-opacity: $focus-ring-opacity !default;\n$input-btn-focus-color:         $focus-ring-color !default;\n$input-btn-focus-blur:          $focus-ring-blur !default;\n$input-btn-focus-box-shadow:    $focus-ring-box-shadow !default;\n\n$input-btn-padding-y-sm:      .25rem !default;\n$input-btn-padding-x-sm:      .5rem !default;\n$input-btn-font-size-sm:      $font-size-sm !default;\n\n$input-btn-padding-y-lg:      .5rem !default;\n$input-btn-padding-x-lg:      1rem !default;\n$input-btn-font-size-lg:      $font-size-lg !default;\n\n$input-btn-border-width:      var(--#{$prefix}border-width) !default;\n// scss-docs-end input-btn-variables\n\n\n// Buttons\n//\n// For each of Bootstrap's buttons, define text, background, and border color.\n\n// scss-docs-start btn-variables\n$btn-color:                   var(--#{$prefix}body-color) !default;\n$btn-padding-y:               $input-btn-padding-y !default;\n$btn-padding-x:               $input-btn-padding-x !default;\n$btn-font-family:             $input-btn-font-family !default;\n$btn-font-size:               $input-btn-font-size !default;\n$btn-line-height:             $input-btn-line-height !default;\n$btn-white-space:             null !default; // Set to `nowrap` to prevent text wrapping\n\n$btn-padding-y-sm:            $input-btn-padding-y-sm !default;\n$btn-padding-x-sm:            $input-btn-padding-x-sm !default;\n$btn-font-size-sm:            $input-btn-font-size-sm !default;\n\n$btn-padding-y-lg:            $input-btn-padding-y-lg !default;\n$btn-padding-x-lg:            $input-btn-padding-x-lg !default;\n$btn-font-size-lg:            $input-btn-font-size-lg !default;\n\n$btn-border-width:            $input-btn-border-width !default;\n\n$btn-font-weight:             $font-weight-normal !default;\n$btn-box-shadow:              inset 0 1px 0 rgba($white, .15), 0 1px 1px rgba($black, .075) !default;\n$btn-focus-width:             $input-btn-focus-width !default;\n$btn-focus-box-shadow:        $input-btn-focus-box-shadow !default;\n$btn-disabled-opacity:        .65 !default;\n$btn-active-box-shadow:       inset 0 3px 5px rgba($black, .125) !default;\n\n$btn-link-color:              var(--#{$prefix}link-color) !default;\n$btn-link-hover-color:        var(--#{$prefix}link-hover-color) !default;\n$btn-link-disabled-color:     $gray-600 !default;\n$btn-link-focus-shadow-rgb:   to-rgb(mix(color-contrast($link-color), $link-color, 15%)) !default;\n\n// Allows for customizing button radius independently from global border radius\n$btn-border-radius:           var(--#{$prefix}border-radius) !default;\n$btn-border-radius-sm:        var(--#{$prefix}border-radius-sm) !default;\n$btn-border-radius-lg:        var(--#{$prefix}border-radius-lg) !default;\n\n$btn-transition:              color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$btn-hover-bg-shade-amount:       15% !default;\n$btn-hover-bg-tint-amount:        15% !default;\n$btn-hover-border-shade-amount:   20% !default;\n$btn-hover-border-tint-amount:    10% !default;\n$btn-active-bg-shade-amount:      20% !default;\n$btn-active-bg-tint-amount:       20% !default;\n$btn-active-border-shade-amount:  25% !default;\n$btn-active-border-tint-amount:   10% !default;\n// scss-docs-end btn-variables\n\n\n// Forms\n\n// scss-docs-start form-text-variables\n$form-text-margin-top:                  .25rem !default;\n$form-text-font-size:                   $small-font-size !default;\n$form-text-font-style:                  null !default;\n$form-text-font-weight:                 null !default;\n$form-text-color:                       var(--#{$prefix}secondary-color) !default;\n// scss-docs-end form-text-variables\n\n// scss-docs-start form-label-variables\n$form-label-margin-bottom:              .5rem !default;\n$form-label-font-size:                  null !default;\n$form-label-font-style:                 null !default;\n$form-label-font-weight:                null !default;\n$form-label-color:                      null !default;\n// scss-docs-end form-label-variables\n\n// scss-docs-start form-input-variables\n$input-padding-y:                       $input-btn-padding-y !default;\n$input-padding-x:                       $input-btn-padding-x !default;\n$input-font-family:                     $input-btn-font-family !default;\n$input-font-size:                       $input-btn-font-size !default;\n$input-font-weight:                     $font-weight-base !default;\n$input-line-height:                     $input-btn-line-height !default;\n\n$input-padding-y-sm:                    $input-btn-padding-y-sm !default;\n$input-padding-x-sm:                    $input-btn-padding-x-sm !default;\n$input-font-size-sm:                    $input-btn-font-size-sm !default;\n\n$input-padding-y-lg:                    $input-btn-padding-y-lg !default;\n$input-padding-x-lg:                    $input-btn-padding-x-lg !default;\n$input-font-size-lg:                    $input-btn-font-size-lg !default;\n\n$input-bg:                              var(--#{$prefix}body-bg) !default;\n$input-disabled-color:                  null !default;\n$input-disabled-bg:                     var(--#{$prefix}secondary-bg) !default;\n$input-disabled-border-color:           null !default;\n\n$input-color:                           var(--#{$prefix}body-color) !default;\n$input-border-color:                    var(--#{$prefix}border-color) !default;\n$input-border-width:                    $input-btn-border-width !default;\n$input-box-shadow:                      var(--#{$prefix}box-shadow-inset) !default;\n\n$input-border-radius:                   var(--#{$prefix}border-radius) !default;\n$input-border-radius-sm:                var(--#{$prefix}border-radius-sm) !default;\n$input-border-radius-lg:                var(--#{$prefix}border-radius-lg) !default;\n\n$input-focus-bg:                        $input-bg !default;\n$input-focus-border-color:              tint-color($component-active-bg, 50%) !default;\n$input-focus-color:                     $input-color !default;\n$input-focus-width:                     $input-btn-focus-width !default;\n$input-focus-box-shadow:                $input-btn-focus-box-shadow !default;\n\n$input-placeholder-color:               var(--#{$prefix}secondary-color) !default;\n$input-plaintext-color:                 var(--#{$prefix}body-color) !default;\n\n$input-height-border:                   calc(#{$input-border-width} * 2) !default; // stylelint-disable-line function-disallowed-list\n\n$input-height-inner:                    add($input-line-height * 1em, $input-padding-y * 2) !default;\n$input-height-inner-half:               add($input-line-height * .5em, $input-padding-y) !default;\n$input-height-inner-quarter:            add($input-line-height * .25em, $input-padding-y * .5) !default;\n\n$input-height:                          add($input-line-height * 1em, add($input-padding-y * 2, $input-height-border, false)) !default;\n$input-height-sm:                       add($input-line-height * 1em, add($input-padding-y-sm * 2, $input-height-border, false)) !default;\n$input-height-lg:                       add($input-line-height * 1em, add($input-padding-y-lg * 2, $input-height-border, false)) !default;\n\n$input-transition:                      border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$form-color-width:                      3rem !default;\n// scss-docs-end form-input-variables\n\n// scss-docs-start form-check-variables\n$form-check-input-width:                  1em !default;\n$form-check-min-height:                   $font-size-base * $line-height-base !default;\n$form-check-padding-start:                $form-check-input-width + .5em !default;\n$form-check-margin-bottom:                .125rem !default;\n$form-check-label-color:                  null !default;\n$form-check-label-cursor:                 null !default;\n$form-check-transition:                   null !default;\n\n$form-check-input-active-filter:          brightness(90%) !default;\n\n$form-check-input-bg:                     $input-bg !default;\n$form-check-input-border:                 var(--#{$prefix}border-width) solid var(--#{$prefix}border-color) !default;\n$form-check-input-border-radius:          .25em !default;\n$form-check-radio-border-radius:          50% !default;\n$form-check-input-focus-border:           $input-focus-border-color !default;\n$form-check-input-focus-box-shadow:       $focus-ring-box-shadow !default;\n\n$form-check-input-checked-color:          $component-active-color !default;\n$form-check-input-checked-bg-color:       $component-active-bg !default;\n$form-check-input-checked-border-color:   $form-check-input-checked-bg-color !default;\n$form-check-input-checked-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'><path fill='none' stroke='#{$form-check-input-checked-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='m6 10 3 3 6-6'/></svg>\") !default;\n$form-check-radio-checked-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='2' fill='#{$form-check-input-checked-color}'/></svg>\") !default;\n\n$form-check-input-indeterminate-color:          $component-active-color !default;\n$form-check-input-indeterminate-bg-color:       $component-active-bg !default;\n$form-check-input-indeterminate-border-color:   $form-check-input-indeterminate-bg-color !default;\n$form-check-input-indeterminate-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'><path fill='none' stroke='#{$form-check-input-indeterminate-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10h8'/></svg>\") !default;\n\n$form-check-input-disabled-opacity:        .5 !default;\n$form-check-label-disabled-opacity:        $form-check-input-disabled-opacity !default;\n$form-check-btn-check-disabled-opacity:    $btn-disabled-opacity !default;\n\n$form-check-inline-margin-end:    1rem !default;\n// scss-docs-end form-check-variables\n\n// scss-docs-start form-switch-variables\n$form-switch-color:               rgba($black, .25) !default;\n$form-switch-width:               2em !default;\n$form-switch-padding-start:       $form-switch-width + .5em !default;\n$form-switch-bg-image:            url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-color}'/></svg>\") !default;\n$form-switch-border-radius:       $form-switch-width !default;\n$form-switch-transition:          background-position .15s ease-in-out !default;\n\n$form-switch-focus-color:         $input-focus-border-color !default;\n$form-switch-focus-bg-image:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-focus-color}'/></svg>\") !default;\n\n$form-switch-checked-color:       $component-active-color !default;\n$form-switch-checked-bg-image:    url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-checked-color}'/></svg>\") !default;\n$form-switch-checked-bg-position: right center !default;\n// scss-docs-end form-switch-variables\n\n// scss-docs-start input-group-variables\n$input-group-addon-padding-y:           $input-padding-y !default;\n$input-group-addon-padding-x:           $input-padding-x !default;\n$input-group-addon-font-weight:         $input-font-weight !default;\n$input-group-addon-color:               $input-color !default;\n$input-group-addon-bg:                  var(--#{$prefix}tertiary-bg) !default;\n$input-group-addon-border-color:        $input-border-color !default;\n// scss-docs-end input-group-variables\n\n// scss-docs-start form-select-variables\n$form-select-padding-y:             $input-padding-y !default;\n$form-select-padding-x:             $input-padding-x !default;\n$form-select-font-family:           $input-font-family !default;\n$form-select-font-size:             $input-font-size !default;\n$form-select-indicator-padding:     $form-select-padding-x * 3 !default; // Extra padding for background-image\n$form-select-font-weight:           $input-font-weight !default;\n$form-select-line-height:           $input-line-height !default;\n$form-select-color:                 $input-color !default;\n$form-select-bg:                    $input-bg !default;\n$form-select-disabled-color:        null !default;\n$form-select-disabled-bg:           $input-disabled-bg !default;\n$form-select-disabled-border-color: $input-disabled-border-color !default;\n$form-select-bg-position:           right $form-select-padding-x center !default;\n$form-select-bg-size:               16px 12px !default; // In pixels because image dimensions\n$form-select-indicator-color:       $gray-800 !default;\n$form-select-indicator:             url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'><path fill='none' stroke='#{$form-select-indicator-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/></svg>\") !default;\n\n$form-select-feedback-icon-padding-end: $form-select-padding-x * 2.5 + $form-select-indicator-padding !default;\n$form-select-feedback-icon-position:    center right $form-select-indicator-padding !default;\n$form-select-feedback-icon-size:        $input-height-inner-half $input-height-inner-half !default;\n\n$form-select-border-width:        $input-border-width !default;\n$form-select-border-color:        $input-border-color !default;\n$form-select-border-radius:       $input-border-radius !default;\n$form-select-box-shadow:          var(--#{$prefix}box-shadow-inset) !default;\n\n$form-select-focus-border-color:  $input-focus-border-color !default;\n$form-select-focus-width:         $input-focus-width !default;\n$form-select-focus-box-shadow:    0 0 0 $form-select-focus-width $input-btn-focus-color !default;\n\n$form-select-padding-y-sm:        $input-padding-y-sm !default;\n$form-select-padding-x-sm:        $input-padding-x-sm !default;\n$form-select-font-size-sm:        $input-font-size-sm !default;\n$form-select-border-radius-sm:    $input-border-radius-sm !default;\n\n$form-select-padding-y-lg:        $input-padding-y-lg !default;\n$form-select-padding-x-lg:        $input-padding-x-lg !default;\n$form-select-font-size-lg:        $input-font-size-lg !default;\n$form-select-border-radius-lg:    $input-border-radius-lg !default;\n\n$form-select-transition:          $input-transition !default;\n// scss-docs-end form-select-variables\n\n// scss-docs-start form-range-variables\n$form-range-track-width:          100% !default;\n$form-range-track-height:         .5rem !default;\n$form-range-track-cursor:         pointer !default;\n$form-range-track-bg:             var(--#{$prefix}secondary-bg) !default;\n$form-range-track-border-radius:  1rem !default;\n$form-range-track-box-shadow:     var(--#{$prefix}box-shadow-inset) !default;\n\n$form-range-thumb-width:                   1rem !default;\n$form-range-thumb-height:                  $form-range-thumb-width !default;\n$form-range-thumb-bg:                      $component-active-bg !default;\n$form-range-thumb-border:                  0 !default;\n$form-range-thumb-border-radius:           1rem !default;\n$form-range-thumb-box-shadow:              0 .1rem .25rem rgba($black, .1) !default;\n$form-range-thumb-focus-box-shadow:        0 0 0 1px $body-bg, $input-focus-box-shadow !default;\n$form-range-thumb-focus-box-shadow-width:  $input-focus-width !default; // For focus box shadow issue in Edge\n$form-range-thumb-active-bg:               tint-color($component-active-bg, 70%) !default;\n$form-range-thumb-disabled-bg:             var(--#{$prefix}secondary-color) !default;\n$form-range-thumb-transition:              background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n// scss-docs-end form-range-variables\n\n// scss-docs-start form-file-variables\n$form-file-button-color:          $input-color !default;\n$form-file-button-bg:             var(--#{$prefix}tertiary-bg) !default;\n$form-file-button-hover-bg:       var(--#{$prefix}secondary-bg) !default;\n// scss-docs-end form-file-variables\n\n// scss-docs-start form-floating-variables\n$form-floating-height:                  add(3.5rem, $input-height-border) !default;\n$form-floating-line-height:             1.25 !default;\n$form-floating-padding-x:               $input-padding-x !default;\n$form-floating-padding-y:               1rem !default;\n$form-floating-input-padding-t:         1.625rem !default;\n$form-floating-input-padding-b:         .625rem !default;\n$form-floating-label-height:            1.5em !default;\n$form-floating-label-opacity:           .65 !default;\n$form-floating-label-transform:         scale(.85) translateY(-.5rem) translateX(.15rem) !default;\n$form-floating-label-disabled-color:    $gray-600 !default;\n$form-floating-transition:              opacity .1s ease-in-out, transform .1s ease-in-out !default;\n// scss-docs-end form-floating-variables\n\n// Form validation\n\n// scss-docs-start form-feedback-variables\n$form-feedback-margin-top:          $form-text-margin-top !default;\n$form-feedback-font-size:           $form-text-font-size !default;\n$form-feedback-font-style:          $form-text-font-style !default;\n$form-feedback-valid-color:         $success !default;\n$form-feedback-invalid-color:       $danger !default;\n\n$form-feedback-icon-valid-color:    $form-feedback-valid-color !default;\n$form-feedback-icon-valid:          url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'><path fill='#{$form-feedback-icon-valid-color}' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/></svg>\") !default;\n$form-feedback-icon-invalid-color:  $form-feedback-invalid-color !default;\n$form-feedback-icon-invalid:        url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='#{$form-feedback-icon-invalid-color}'><circle cx='6' cy='6' r='4.5'/><path stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/><circle cx='6' cy='8.2' r='.6' fill='#{$form-feedback-icon-invalid-color}' stroke='none'/></svg>\") !default;\n// scss-docs-end form-feedback-variables\n\n// scss-docs-start form-validation-colors\n$form-valid-color:                  $form-feedback-valid-color !default;\n$form-valid-border-color:           $form-feedback-valid-color !default;\n$form-invalid-color:                $form-feedback-invalid-color !default;\n$form-invalid-border-color:         $form-feedback-invalid-color !default;\n// scss-docs-end form-validation-colors\n\n// scss-docs-start form-validation-states\n$form-validation-states: (\n  \"valid\": (\n    \"color\": var(--#{$prefix}form-valid-color),\n    \"icon\": $form-feedback-icon-valid,\n    \"tooltip-color\": #fff,\n    \"tooltip-bg-color\": var(--#{$prefix}success),\n    \"focus-box-shadow\": 0 0 $input-btn-focus-blur $input-focus-width rgba(var(--#{$prefix}success-rgb), $input-btn-focus-color-opacity),\n    \"border-color\": var(--#{$prefix}form-valid-border-color),\n  ),\n  \"invalid\": (\n    \"color\": var(--#{$prefix}form-invalid-color),\n    \"icon\": $form-feedback-icon-invalid,\n    \"tooltip-color\": #fff,\n    \"tooltip-bg-color\": var(--#{$prefix}danger),\n    \"focus-box-shadow\": 0 0 $input-btn-focus-blur $input-focus-width rgba(var(--#{$prefix}danger-rgb), $input-btn-focus-color-opacity),\n    \"border-color\": var(--#{$prefix}form-invalid-border-color),\n  )\n) !default;\n// scss-docs-end form-validation-states\n\n// Z-index master list\n//\n// Warning: Avoid customizing these values. They're used for a bird's eye view\n// of components dependent on the z-axis and are designed to all work together.\n\n// scss-docs-start zindex-stack\n$zindex-dropdown:                   1000 !default;\n$zindex-sticky:                     1020 !default;\n$zindex-fixed:                      1030 !default;\n$zindex-offcanvas-backdrop:         1040 !default;\n$zindex-offcanvas:                  1045 !default;\n$zindex-modal-backdrop:             1050 !default;\n$zindex-modal:                      1055 !default;\n$zindex-popover:                    1070 !default;\n$zindex-tooltip:                    1080 !default;\n$zindex-toast:                      1090 !default;\n// scss-docs-end zindex-stack\n\n// scss-docs-start zindex-levels-map\n$zindex-levels: (\n  n1: -1,\n  0: 0,\n  1: 1,\n  2: 2,\n  3: 3\n) !default;\n// scss-docs-end zindex-levels-map\n\n\n// Navs\n\n// scss-docs-start nav-variables\n$nav-link-padding-y:                .5rem !default;\n$nav-link-padding-x:                1rem !default;\n$nav-link-font-size:                null !default;\n$nav-link-font-weight:              null !default;\n$nav-link-color:                    var(--#{$prefix}link-color) !default;\n$nav-link-hover-color:              var(--#{$prefix}link-hover-color) !default;\n$nav-link-transition:               color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out !default;\n$nav-link-disabled-color:           var(--#{$prefix}secondary-color) !default;\n$nav-link-focus-box-shadow:         $focus-ring-box-shadow !default;\n\n$nav-tabs-border-color:             var(--#{$prefix}border-color) !default;\n$nav-tabs-border-width:             var(--#{$prefix}border-width) !default;\n$nav-tabs-border-radius:            var(--#{$prefix}border-radius) !default;\n$nav-tabs-link-hover-border-color:  var(--#{$prefix}secondary-bg) var(--#{$prefix}secondary-bg) $nav-tabs-border-color !default;\n$nav-tabs-link-active-color:        var(--#{$prefix}emphasis-color) !default;\n$nav-tabs-link-active-bg:           var(--#{$prefix}body-bg) !default;\n$nav-tabs-link-active-border-color: var(--#{$prefix}border-color) var(--#{$prefix}border-color) $nav-tabs-link-active-bg !default;\n\n$nav-pills-border-radius:           var(--#{$prefix}border-radius) !default;\n$nav-pills-link-active-color:       $component-active-color !default;\n$nav-pills-link-active-bg:          $component-active-bg !default;\n\n$nav-underline-gap:                 1rem !default;\n$nav-underline-border-width:        .125rem !default;\n$nav-underline-link-active-color:   var(--#{$prefix}emphasis-color) !default;\n// scss-docs-end nav-variables\n\n\n// Navbar\n\n// scss-docs-start navbar-variables\n$navbar-padding-y:                  $spacer * .5 !default;\n$navbar-padding-x:                  null !default;\n\n$navbar-nav-link-padding-x:         .5rem !default;\n\n$navbar-brand-font-size:            $font-size-lg !default;\n// Compute the navbar-brand padding-y so the navbar-brand will have the same height as navbar-text and nav-link\n$nav-link-height:                   $font-size-base * $line-height-base + $nav-link-padding-y * 2 !default;\n$navbar-brand-height:               $navbar-brand-font-size * $line-height-base !default;\n$navbar-brand-padding-y:            ($nav-link-height - $navbar-brand-height) * .5 !default;\n$navbar-brand-margin-end:           1rem !default;\n\n$navbar-toggler-padding-y:          .25rem !default;\n$navbar-toggler-padding-x:          .75rem !default;\n$navbar-toggler-font-size:          $font-size-lg !default;\n$navbar-toggler-border-radius:      $btn-border-radius !default;\n$navbar-toggler-focus-width:        $btn-focus-width !default;\n$navbar-toggler-transition:         box-shadow .15s ease-in-out !default;\n\n$navbar-light-color:                rgba(var(--#{$prefix}emphasis-color-rgb), .65) !default;\n$navbar-light-hover-color:          rgba(var(--#{$prefix}emphasis-color-rgb), .8) !default;\n$navbar-light-active-color:         rgba(var(--#{$prefix}emphasis-color-rgb), 1) !default;\n$navbar-light-disabled-color:       rgba(var(--#{$prefix}emphasis-color-rgb), .3) !default;\n$navbar-light-icon-color:           rgba($body-color, .75) !default;\n$navbar-light-toggler-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'><path stroke='#{$navbar-light-icon-color}' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/></svg>\") !default;\n$navbar-light-toggler-border-color: rgba(var(--#{$prefix}emphasis-color-rgb), .15) !default;\n$navbar-light-brand-color:          $navbar-light-active-color !default;\n$navbar-light-brand-hover-color:    $navbar-light-active-color !default;\n// scss-docs-end navbar-variables\n\n// scss-docs-start navbar-dark-variables\n$navbar-dark-color:                 rgba($white, .55) !default;\n$navbar-dark-hover-color:           rgba($white, .75) !default;\n$navbar-dark-active-color:          $white !default;\n$navbar-dark-disabled-color:        rgba($white, .25) !default;\n$navbar-dark-icon-color:            $navbar-dark-color !default;\n$navbar-dark-toggler-icon-bg:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'><path stroke='#{$navbar-dark-icon-color}' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/></svg>\") !default;\n$navbar-dark-toggler-border-color:  rgba($white, .1) !default;\n$navbar-dark-brand-color:           $navbar-dark-active-color !default;\n$navbar-dark-brand-hover-color:     $navbar-dark-active-color !default;\n// scss-docs-end navbar-dark-variables\n\n\n// Dropdowns\n//\n// Dropdown menu container and contents.\n\n// scss-docs-start dropdown-variables\n$dropdown-min-width:                10rem !default;\n$dropdown-padding-x:                0 !default;\n$dropdown-padding-y:                .5rem !default;\n$dropdown-spacer:                   .125rem !default;\n$dropdown-font-size:                $font-size-base !default;\n$dropdown-color:                    var(--#{$prefix}body-color) !default;\n$dropdown-bg:                       var(--#{$prefix}body-bg) !default;\n$dropdown-border-color:             var(--#{$prefix}border-color-translucent) !default;\n$dropdown-border-radius:            var(--#{$prefix}border-radius) !default;\n$dropdown-border-width:             var(--#{$prefix}border-width) !default;\n$dropdown-inner-border-radius:      calc(#{$dropdown-border-radius} - #{$dropdown-border-width}) !default; // stylelint-disable-line function-disallowed-list\n$dropdown-divider-bg:               $dropdown-border-color !default;\n$dropdown-divider-margin-y:         $spacer * .5 !default;\n$dropdown-box-shadow:               var(--#{$prefix}box-shadow) !default;\n\n$dropdown-link-color:               var(--#{$prefix}body-color) !default;\n$dropdown-link-hover-color:         $dropdown-link-color !default;\n$dropdown-link-hover-bg:            var(--#{$prefix}tertiary-bg) !default;\n\n$dropdown-link-active-color:        $component-active-color !default;\n$dropdown-link-active-bg:           $component-active-bg !default;\n\n$dropdown-link-disabled-color:      var(--#{$prefix}tertiary-color) !default;\n\n$dropdown-item-padding-y:           $spacer * .25 !default;\n$dropdown-item-padding-x:           $spacer !default;\n\n$dropdown-header-color:             $gray-600 !default;\n$dropdown-header-padding-x:         $dropdown-item-padding-x !default;\n$dropdown-header-padding-y:         $dropdown-padding-y !default;\n// fusv-disable\n$dropdown-header-padding:           $dropdown-header-padding-y $dropdown-header-padding-x !default; // Deprecated in v5.2.0\n// fusv-enable\n// scss-docs-end dropdown-variables\n\n// scss-docs-start dropdown-dark-variables\n$dropdown-dark-color:               $gray-300 !default;\n$dropdown-dark-bg:                  $gray-800 !default;\n$dropdown-dark-border-color:        $dropdown-border-color !default;\n$dropdown-dark-divider-bg:          $dropdown-divider-bg !default;\n$dropdown-dark-box-shadow:          null !default;\n$dropdown-dark-link-color:          $dropdown-dark-color !default;\n$dropdown-dark-link-hover-color:    $white !default;\n$dropdown-dark-link-hover-bg:       rgba($white, .15) !default;\n$dropdown-dark-link-active-color:   $dropdown-link-active-color !default;\n$dropdown-dark-link-active-bg:      $dropdown-link-active-bg !default;\n$dropdown-dark-link-disabled-color: $gray-500 !default;\n$dropdown-dark-header-color:        $gray-500 !default;\n// scss-docs-end dropdown-dark-variables\n\n\n// Pagination\n\n// scss-docs-start pagination-variables\n$pagination-padding-y:              .375rem !default;\n$pagination-padding-x:              .75rem !default;\n$pagination-padding-y-sm:           .25rem !default;\n$pagination-padding-x-sm:           .5rem !default;\n$pagination-padding-y-lg:           .75rem !default;\n$pagination-padding-x-lg:           1.5rem !default;\n\n$pagination-font-size:              $font-size-base !default;\n\n$pagination-color:                  var(--#{$prefix}link-color) !default;\n$pagination-bg:                     var(--#{$prefix}body-bg) !default;\n$pagination-border-radius:          var(--#{$prefix}border-radius) !default;\n$pagination-border-width:           var(--#{$prefix}border-width) !default;\n$pagination-margin-start:           calc(#{$pagination-border-width} * -1) !default; // stylelint-disable-line function-disallowed-list\n$pagination-border-color:           var(--#{$prefix}border-color) !default;\n\n$pagination-focus-color:            var(--#{$prefix}link-hover-color) !default;\n$pagination-focus-bg:               var(--#{$prefix}secondary-bg) !default;\n$pagination-focus-box-shadow:       $focus-ring-box-shadow !default;\n$pagination-focus-outline:          0 !default;\n\n$pagination-hover-color:            var(--#{$prefix}link-hover-color) !default;\n$pagination-hover-bg:               var(--#{$prefix}tertiary-bg) !default;\n$pagination-hover-border-color:     var(--#{$prefix}border-color) !default; // Todo in v6: remove this?\n\n$pagination-active-color:           $component-active-color !default;\n$pagination-active-bg:              $component-active-bg !default;\n$pagination-active-border-color:    $component-active-bg !default;\n\n$pagination-disabled-color:         var(--#{$prefix}secondary-color) !default;\n$pagination-disabled-bg:            var(--#{$prefix}secondary-bg) !default;\n$pagination-disabled-border-color:  var(--#{$prefix}border-color) !default;\n\n$pagination-transition:              color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$pagination-border-radius-sm:       var(--#{$prefix}border-radius-sm) !default;\n$pagination-border-radius-lg:       var(--#{$prefix}border-radius-lg) !default;\n// scss-docs-end pagination-variables\n\n\n// Placeholders\n\n// scss-docs-start placeholders\n$placeholder-opacity-max:           .5 !default;\n$placeholder-opacity-min:           .2 !default;\n// scss-docs-end placeholders\n\n// Cards\n\n// scss-docs-start card-variables\n$card-spacer-y:                     $spacer !default;\n$card-spacer-x:                     $spacer !default;\n$card-title-spacer-y:               $spacer * .5 !default;\n$card-title-color:                  null !default;\n$card-subtitle-color:               null !default;\n$card-border-width:                 var(--#{$prefix}border-width) !default;\n$card-border-color:                 var(--#{$prefix}border-color-translucent) !default;\n$card-border-radius:                var(--#{$prefix}border-radius) !default;\n$card-box-shadow:                   null !default;\n$card-inner-border-radius:          subtract($card-border-radius, $card-border-width) !default;\n$card-cap-padding-y:                $card-spacer-y * .5 !default;\n$card-cap-padding-x:                $card-spacer-x !default;\n$card-cap-bg:                       rgba(var(--#{$prefix}body-color-rgb), .03) !default;\n$card-cap-color:                    null !default;\n$card-height:                       null !default;\n$card-color:                        null !default;\n$card-bg:                           var(--#{$prefix}body-bg) !default;\n$card-img-overlay-padding:          $spacer !default;\n$card-group-margin:                 $grid-gutter-width * .5 !default;\n// scss-docs-end card-variables\n\n// Accordion\n\n// scss-docs-start accordion-variables\n$accordion-padding-y:                     1rem !default;\n$accordion-padding-x:                     1.25rem !default;\n$accordion-color:                         var(--#{$prefix}body-color) !default;\n$accordion-bg:                            var(--#{$prefix}body-bg) !default;\n$accordion-border-width:                  var(--#{$prefix}border-width) !default;\n$accordion-border-color:                  var(--#{$prefix}border-color) !default;\n$accordion-border-radius:                 var(--#{$prefix}border-radius) !default;\n$accordion-inner-border-radius:           subtract($accordion-border-radius, $accordion-border-width) !default;\n\n$accordion-body-padding-y:                $accordion-padding-y !default;\n$accordion-body-padding-x:                $accordion-padding-x !default;\n\n$accordion-button-padding-y:              $accordion-padding-y !default;\n$accordion-button-padding-x:              $accordion-padding-x !default;\n$accordion-button-color:                  var(--#{$prefix}body-color) !default;\n$accordion-button-bg:                     var(--#{$prefix}accordion-bg) !default;\n$accordion-transition:                    $btn-transition, border-radius .15s ease !default;\n$accordion-button-active-bg:              var(--#{$prefix}primary-bg-subtle) !default;\n$accordion-button-active-color:           var(--#{$prefix}primary-text-emphasis) !default;\n\n$accordion-button-focus-border-color:     $input-focus-border-color !default;\n$accordion-button-focus-box-shadow:       $btn-focus-box-shadow !default;\n\n$accordion-icon-width:                    1.25rem !default;\n$accordion-icon-color:                    $body-color !default;\n$accordion-icon-active-color:             $primary-text-emphasis !default;\n$accordion-icon-transition:               transform .2s ease-in-out !default;\n$accordion-icon-transform:                rotate(-180deg) !default;\n\n$accordion-button-icon:         url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$accordion-icon-color}'><path fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n$accordion-button-active-icon:  url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$accordion-icon-active-color}'><path fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n// scss-docs-end accordion-variables\n\n// Tooltips\n\n// scss-docs-start tooltip-variables\n$tooltip-font-size:                 $font-size-sm !default;\n$tooltip-max-width:                 200px !default;\n$tooltip-color:                     var(--#{$prefix}body-bg) !default;\n$tooltip-bg:                        var(--#{$prefix}emphasis-color) !default;\n$tooltip-border-radius:             var(--#{$prefix}border-radius) !default;\n$tooltip-opacity:                   .9 !default;\n$tooltip-padding-y:                 $spacer * .25 !default;\n$tooltip-padding-x:                 $spacer * .5 !default;\n$tooltip-margin:                    null !default; // TODO: remove this in v6\n\n$tooltip-arrow-width:               .8rem !default;\n$tooltip-arrow-height:              .4rem !default;\n// fusv-disable\n$tooltip-arrow-color:               null !default; // Deprecated in Bootstrap 5.2.0 for CSS variables\n// fusv-enable\n// scss-docs-end tooltip-variables\n\n// Form tooltips must come after regular tooltips\n// scss-docs-start tooltip-feedback-variables\n$form-feedback-tooltip-padding-y:     $tooltip-padding-y !default;\n$form-feedback-tooltip-padding-x:     $tooltip-padding-x !default;\n$form-feedback-tooltip-font-size:     $tooltip-font-size !default;\n$form-feedback-tooltip-line-height:   null !default;\n$form-feedback-tooltip-opacity:       $tooltip-opacity !default;\n$form-feedback-tooltip-border-radius: $tooltip-border-radius !default;\n// scss-docs-end tooltip-feedback-variables\n\n\n// Popovers\n\n// scss-docs-start popover-variables\n$popover-font-size:                 $font-size-sm !default;\n$popover-bg:                        var(--#{$prefix}body-bg) !default;\n$popover-max-width:                 276px !default;\n$popover-border-width:              var(--#{$prefix}border-width) !default;\n$popover-border-color:              var(--#{$prefix}border-color-translucent) !default;\n$popover-border-radius:             var(--#{$prefix}border-radius-lg) !default;\n$popover-inner-border-radius:       calc(#{$popover-border-radius} - #{$popover-border-width}) !default; // stylelint-disable-line function-disallowed-list\n$popover-box-shadow:                var(--#{$prefix}box-shadow) !default;\n\n$popover-header-font-size:          $font-size-base !default;\n$popover-header-bg:                 var(--#{$prefix}secondary-bg) !default;\n$popover-header-color:              $headings-color !default;\n$popover-header-padding-y:          .5rem !default;\n$popover-header-padding-x:          $spacer !default;\n\n$popover-body-color:                var(--#{$prefix}body-color) !default;\n$popover-body-padding-y:            $spacer !default;\n$popover-body-padding-x:            $spacer !default;\n\n$popover-arrow-width:               1rem !default;\n$popover-arrow-height:              .5rem !default;\n// scss-docs-end popover-variables\n\n// fusv-disable\n// Deprecated in Bootstrap 5.2.0 for CSS variables\n$popover-arrow-color:               $popover-bg !default;\n$popover-arrow-outer-color:         var(--#{$prefix}border-color-translucent) !default;\n// fusv-enable\n\n\n// Toasts\n\n// scss-docs-start toast-variables\n$toast-max-width:                   350px !default;\n$toast-padding-x:                   .75rem !default;\n$toast-padding-y:                   .5rem !default;\n$toast-font-size:                   .875rem !default;\n$toast-color:                       null !default;\n$toast-background-color:            rgba(var(--#{$prefix}body-bg-rgb), .85) !default;\n$toast-border-width:                var(--#{$prefix}border-width) !default;\n$toast-border-color:                var(--#{$prefix}border-color-translucent) !default;\n$toast-border-radius:               var(--#{$prefix}border-radius) !default;\n$toast-box-shadow:                  var(--#{$prefix}box-shadow) !default;\n$toast-spacing:                     $container-padding-x !default;\n\n$toast-header-color:                var(--#{$prefix}secondary-color) !default;\n$toast-header-background-color:     rgba(var(--#{$prefix}body-bg-rgb), .85) !default;\n$toast-header-border-color:         $toast-border-color !default;\n// scss-docs-end toast-variables\n\n\n// Badges\n\n// scss-docs-start badge-variables\n$badge-font-size:                   .75em !default;\n$badge-font-weight:                 $font-weight-bold !default;\n$badge-color:                       $white !default;\n$badge-padding-y:                   .35em !default;\n$badge-padding-x:                   .65em !default;\n$badge-border-radius:               var(--#{$prefix}border-radius) !default;\n// scss-docs-end badge-variables\n\n\n// Modals\n\n// scss-docs-start modal-variables\n$modal-inner-padding:               $spacer !default;\n\n$modal-footer-margin-between:       .5rem !default;\n\n$modal-dialog-margin:               .5rem !default;\n$modal-dialog-margin-y-sm-up:       1.75rem !default;\n\n$modal-title-line-height:           $line-height-base !default;\n\n$modal-content-color:               null !default;\n$modal-content-bg:                  var(--#{$prefix}body-bg) !default;\n$modal-content-border-color:        var(--#{$prefix}border-color-translucent) !default;\n$modal-content-border-width:        var(--#{$prefix}border-width) !default;\n$modal-content-border-radius:       var(--#{$prefix}border-radius-lg) !default;\n$modal-content-inner-border-radius: subtract($modal-content-border-radius, $modal-content-border-width) !default;\n$modal-content-box-shadow-xs:       var(--#{$prefix}box-shadow-sm) !default;\n$modal-content-box-shadow-sm-up:    var(--#{$prefix}box-shadow) !default;\n\n$modal-backdrop-bg:                 $black !default;\n$modal-backdrop-opacity:            .5 !default;\n\n$modal-header-border-color:         var(--#{$prefix}border-color) !default;\n$modal-header-border-width:         $modal-content-border-width !default;\n$modal-header-padding-y:            $modal-inner-padding !default;\n$modal-header-padding-x:            $modal-inner-padding !default;\n$modal-header-padding:              $modal-header-padding-y $modal-header-padding-x !default; // Keep this for backwards compatibility\n\n$modal-footer-bg:                   null !default;\n$modal-footer-border-color:         $modal-header-border-color !default;\n$modal-footer-border-width:         $modal-header-border-width !default;\n\n$modal-sm:                          300px !default;\n$modal-md:                          500px !default;\n$modal-lg:                          800px !default;\n$modal-xl:                          1140px !default;\n\n$modal-fade-transform:              translate(0, -50px) !default;\n$modal-show-transform:              none !default;\n$modal-transition:                  transform .3s ease-out !default;\n$modal-scale-transform:             scale(1.02) !default;\n// scss-docs-end modal-variables\n\n\n// Alerts\n//\n// Define alert colors, border radius, and padding.\n\n// scss-docs-start alert-variables\n$alert-padding-y:               $spacer !default;\n$alert-padding-x:               $spacer !default;\n$alert-margin-bottom:           1rem !default;\n$alert-border-radius:           var(--#{$prefix}border-radius) !default;\n$alert-link-font-weight:        $font-weight-bold !default;\n$alert-border-width:            var(--#{$prefix}border-width) !default;\n$alert-dismissible-padding-r:   $alert-padding-x * 3 !default; // 3x covers width of x plus default padding on either side\n// scss-docs-end alert-variables\n\n// fusv-disable\n$alert-bg-scale:                -80% !default; // Deprecated in v5.2.0, to be removed in v6\n$alert-border-scale:            -70% !default; // Deprecated in v5.2.0, to be removed in v6\n$alert-color-scale:             40% !default; // Deprecated in v5.2.0, to be removed in v6\n// fusv-enable\n\n// Progress bars\n\n// scss-docs-start progress-variables\n$progress-height:                   1rem !default;\n$progress-font-size:                $font-size-base * .75 !default;\n$progress-bg:                       var(--#{$prefix}secondary-bg) !default;\n$progress-border-radius:            var(--#{$prefix}border-radius) !default;\n$progress-box-shadow:               var(--#{$prefix}box-shadow-inset) !default;\n$progress-bar-color:                $white !default;\n$progress-bar-bg:                   $primary !default;\n$progress-bar-animation-timing:     1s linear infinite !default;\n$progress-bar-transition:           width .6s ease !default;\n// scss-docs-end progress-variables\n\n\n// List group\n\n// scss-docs-start list-group-variables\n$list-group-color:                  var(--#{$prefix}body-color) !default;\n$list-group-bg:                     var(--#{$prefix}body-bg) !default;\n$list-group-border-color:           var(--#{$prefix}border-color) !default;\n$list-group-border-width:           var(--#{$prefix}border-width) !default;\n$list-group-border-radius:          var(--#{$prefix}border-radius) !default;\n\n$list-group-item-padding-y:         $spacer * .5 !default;\n$list-group-item-padding-x:         $spacer !default;\n// fusv-disable\n$list-group-item-bg-scale:          -80% !default; // Deprecated in v5.3.0\n$list-group-item-color-scale:       40% !default; // Deprecated in v5.3.0\n// fusv-enable\n\n$list-group-hover-bg:               var(--#{$prefix}tertiary-bg) !default;\n$list-group-active-color:           $component-active-color !default;\n$list-group-active-bg:              $component-active-bg !default;\n$list-group-active-border-color:    $list-group-active-bg !default;\n\n$list-group-disabled-color:         var(--#{$prefix}secondary-color) !default;\n$list-group-disabled-bg:            $list-group-bg !default;\n\n$list-group-action-color:           var(--#{$prefix}secondary-color) !default;\n$list-group-action-hover-color:     var(--#{$prefix}emphasis-color) !default;\n\n$list-group-action-active-color:    var(--#{$prefix}body-color) !default;\n$list-group-action-active-bg:       var(--#{$prefix}secondary-bg) !default;\n// scss-docs-end list-group-variables\n\n\n// Image thumbnails\n\n// scss-docs-start thumbnail-variables\n$thumbnail-padding:                 .25rem !default;\n$thumbnail-bg:                      var(--#{$prefix}body-bg) !default;\n$thumbnail-border-width:            var(--#{$prefix}border-width) !default;\n$thumbnail-border-color:            var(--#{$prefix}border-color) !default;\n$thumbnail-border-radius:           var(--#{$prefix}border-radius) !default;\n$thumbnail-box-shadow:              var(--#{$prefix}box-shadow-sm) !default;\n// scss-docs-end thumbnail-variables\n\n\n// Figures\n\n// scss-docs-start figure-variables\n$figure-caption-font-size:          $small-font-size !default;\n$figure-caption-color:              var(--#{$prefix}secondary-color) !default;\n// scss-docs-end figure-variables\n\n\n// Breadcrumbs\n\n// scss-docs-start breadcrumb-variables\n$breadcrumb-font-size:              null !default;\n$breadcrumb-padding-y:              0 !default;\n$breadcrumb-padding-x:              0 !default;\n$breadcrumb-item-padding-x:         .5rem !default;\n$breadcrumb-margin-bottom:          1rem !default;\n$breadcrumb-bg:                     null !default;\n$breadcrumb-divider-color:          var(--#{$prefix}secondary-color) !default;\n$breadcrumb-active-color:           var(--#{$prefix}secondary-color) !default;\n$breadcrumb-divider:                quote(\"/\") !default;\n$breadcrumb-divider-flipped:        $breadcrumb-divider !default;\n$breadcrumb-border-radius:          null !default;\n// scss-docs-end breadcrumb-variables\n\n// Carousel\n\n// scss-docs-start carousel-variables\n$carousel-control-color:             $white !default;\n$carousel-control-width:             15% !default;\n$carousel-control-opacity:           .5 !default;\n$carousel-control-hover-opacity:     .9 !default;\n$carousel-control-transition:        opacity .15s ease !default;\n\n$carousel-indicator-width:           30px !default;\n$carousel-indicator-height:          3px !default;\n$carousel-indicator-hit-area-height: 10px !default;\n$carousel-indicator-spacer:          3px !default;\n$carousel-indicator-opacity:         .5 !default;\n$carousel-indicator-active-bg:       $white !default;\n$carousel-indicator-active-opacity:  1 !default;\n$carousel-indicator-transition:      opacity .6s ease !default;\n\n$carousel-caption-width:             70% !default;\n$carousel-caption-color:             $white !default;\n$carousel-caption-padding-y:         1.25rem !default;\n$carousel-caption-spacer:            1.25rem !default;\n\n$carousel-control-icon-width:        2rem !default;\n\n$carousel-control-prev-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$carousel-control-color}'><path d='M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z'/></svg>\") !default;\n$carousel-control-next-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$carousel-control-color}'><path d='M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n\n$carousel-transition-duration:       .6s !default;\n$carousel-transition:                transform $carousel-transition-duration ease-in-out !default; // Define transform transition first if using multiple transitions (e.g., `transform 2s ease, opacity .5s ease-out`)\n// scss-docs-end carousel-variables\n\n// scss-docs-start carousel-dark-variables\n$carousel-dark-indicator-active-bg:  $black !default;\n$carousel-dark-caption-color:        $black !default;\n$carousel-dark-control-icon-filter:  invert(1) grayscale(100) !default;\n// scss-docs-end carousel-dark-variables\n\n\n// Spinners\n\n// scss-docs-start spinner-variables\n$spinner-width:           2rem !default;\n$spinner-height:          $spinner-width !default;\n$spinner-vertical-align:  -.125em !default;\n$spinner-border-width:    .25em !default;\n$spinner-animation-speed: .75s !default;\n\n$spinner-width-sm:        1rem !default;\n$spinner-height-sm:       $spinner-width-sm !default;\n$spinner-border-width-sm: .2em !default;\n// scss-docs-end spinner-variables\n\n\n// Close\n\n// scss-docs-start close-variables\n$btn-close-width:            1em !default;\n$btn-close-height:           $btn-close-width !default;\n$btn-close-padding-x:        .25em !default;\n$btn-close-padding-y:        $btn-close-padding-x !default;\n$btn-close-color:            $black !default;\n$btn-close-bg:               url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$btn-close-color}'><path d='M.293.293a1 1 0 0 1 1.414 0L8 6.586 14.293.293a1 1 0 1 1 1.414 1.414L9.414 8l6.293 6.293a1 1 0 0 1-1.414 1.414L8 9.414l-6.293 6.293a1 1 0 0 1-1.414-1.414L6.586 8 .293 1.707a1 1 0 0 1 0-1.414z'/></svg>\") !default;\n$btn-close-focus-shadow:     $focus-ring-box-shadow !default;\n$btn-close-opacity:          .5 !default;\n$btn-close-hover-opacity:    .75 !default;\n$btn-close-focus-opacity:    1 !default;\n$btn-close-disabled-opacity: .25 !default;\n$btn-close-white-filter:     invert(1) grayscale(100%) brightness(200%) !default;\n// scss-docs-end close-variables\n\n\n// Offcanvas\n\n// scss-docs-start offcanvas-variables\n$offcanvas-padding-y:               $modal-inner-padding !default;\n$offcanvas-padding-x:               $modal-inner-padding !default;\n$offcanvas-horizontal-width:        400px !default;\n$offcanvas-vertical-height:         30vh !default;\n$offcanvas-transition-duration:     .3s !default;\n$offcanvas-border-color:            $modal-content-border-color !default;\n$offcanvas-border-width:            $modal-content-border-width !default;\n$offcanvas-title-line-height:       $modal-title-line-height !default;\n$offcanvas-bg-color:                var(--#{$prefix}body-bg) !default;\n$offcanvas-color:                   var(--#{$prefix}body-color) !default;\n$offcanvas-box-shadow:              $modal-content-box-shadow-xs !default;\n$offcanvas-backdrop-bg:             $modal-backdrop-bg !default;\n$offcanvas-backdrop-opacity:        $modal-backdrop-opacity !default;\n// scss-docs-end offcanvas-variables\n\n// Code\n\n$code-font-size:                    $small-font-size !default;\n$code-color:                        $pink !default;\n\n$kbd-padding-y:                     .1875rem !default;\n$kbd-padding-x:                     .375rem !default;\n$kbd-font-size:                     $code-font-size !default;\n$kbd-color:                         var(--#{$prefix}body-bg) !default;\n$kbd-bg:                            var(--#{$prefix}body-color) !default;\n$nested-kbd-font-weight:            null !default; // Deprecated in v5.2.0, removing in v6\n\n$pre-color:                         null !default;\n","// stylelint-disable property-disallowed-list\n// Single side border-radius\n\n// Helper function to replace negative values with 0\n@function valid-radius($radius) {\n  $return: ();\n  @each $value in $radius {\n    @if type-of($value) == number {\n      $return: append($return, max($value, 0));\n    } @else {\n      $return: append($return, $value);\n    }\n  }\n  @return $return;\n}\n\n// scss-docs-start border-radius-mixins\n@mixin border-radius($radius: $border-radius, $fallback-border-radius: false) {\n  @if $enable-rounded {\n    border-radius: valid-radius($radius);\n  }\n  @else if $fallback-border-radius != false {\n    border-radius: $fallback-border-radius;\n  }\n}\n\n@mixin border-top-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-top-left-radius: valid-radius($radius);\n    border-top-right-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-end-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-top-right-radius: valid-radius($radius);\n    border-bottom-right-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-bottom-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-bottom-right-radius: valid-radius($radius);\n    border-bottom-left-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-start-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-top-left-radius: valid-radius($radius);\n    border-bottom-left-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-top-start-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-top-left-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-top-end-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-top-right-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-bottom-end-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-bottom-right-radius: valid-radius($radius);\n  }\n}\n\n@mixin border-bottom-start-radius($radius: $border-radius) {\n  @if $enable-rounded {\n    border-bottom-left-radius: valid-radius($radius);\n  }\n}\n// scss-docs-end border-radius-mixins\n","//\n// Headings\n//\n.h1 {\n  @extend h1;\n}\n\n.h2 {\n  @extend h2;\n}\n\n.h3 {\n  @extend h3;\n}\n\n.h4 {\n  @extend h4;\n}\n\n.h5 {\n  @extend h5;\n}\n\n.h6 {\n  @extend h6;\n}\n\n\n.lead {\n  @include font-size($lead-font-size);\n  font-weight: $lead-font-weight;\n}\n\n// Type display classes\n@each $display, $font-size in $display-font-sizes {\n  .display-#{$display} {\n    @include font-size($font-size);\n    font-family: $display-font-family;\n    font-style: $display-font-style;\n    font-weight: $display-font-weight;\n    line-height: $display-line-height;\n  }\n}\n\n//\n// Emphasis\n//\n.small {\n  @extend small;\n}\n\n.mark {\n  @extend mark;\n}\n\n//\n// Lists\n//\n\n.list-unstyled {\n  @include list-unstyled();\n}\n\n// Inline turns list items into inline-block\n.list-inline {\n  @include list-unstyled();\n}\n.list-inline-item {\n  display: inline-block;\n\n  &:not(:last-child) {\n    margin-right: $list-inline-padding;\n  }\n}\n\n\n//\n// Misc\n//\n\n// Builds on `abbr`\n.initialism {\n  @include font-size($initialism-font-size);\n  text-transform: uppercase;\n}\n\n// Blockquotes\n.blockquote {\n  margin-bottom: $blockquote-margin-y;\n  @include font-size($blockquote-font-size);\n\n  > :last-child {\n    margin-bottom: 0;\n  }\n}\n\n.blockquote-footer {\n  margin-top: -$blockquote-margin-y;\n  margin-bottom: $blockquote-margin-y;\n  @include font-size($blockquote-footer-font-size);\n  color: $blockquote-footer-color;\n\n  &::before {\n    content: \"\\2014\\00A0\"; // em dash, nbsp\n  }\n}\n","// Lists\n\n// Unstyled keeps list items block level, just removes default browser padding and list-style\n@mixin list-unstyled {\n  padding-left: 0;\n  list-style: none;\n}\n","// Override bootstrap variables\n$spacer: 1rem;\n\n$container-max-widths: (\n  sm: 540px,\n  md: 720px,\n  lg: 960px,\n  xl: 1400px,\n);\n\n$grid-breakpoints: (\n  xs: 0,\n  sm: 540px,\n  md: 720px,\n  lg: 960px,\n  xl: 1200px,\n);\n\n$dropdown-link-hover-bg: var(--pst-color-surface);\n// --pst-color-surface can also be assigned to the dark variant because it is\n// scoped to different values depending on light/dark theme\n$dropdown-dark-link-hover-bg: var(--pst-color-surface);\n$dropdown-link-active-bg: var(--pst-color-surface);\n$dropdown-dark-link-active-bg: var(--pst-color-surface);\n","// Responsive images (ensure images don't scale beyond their parents)\n//\n// This is purposefully opt-in via an explicit class rather than being the default for all `<img>`s.\n// We previously tried the \"images are responsive by default\" approach in Bootstrap v2,\n// and abandoned it in Bootstrap v3 because it breaks lots of third-party widgets (including Google Maps)\n// which weren't expecting the images within themselves to be involuntarily resized.\n// See also https://github.com/twbs/bootstrap/issues/18178\n.img-fluid {\n  @include img-fluid();\n}\n\n\n// Image thumbnails\n.img-thumbnail {\n  padding: $thumbnail-padding;\n  background-color: $thumbnail-bg;\n  border: $thumbnail-border-width solid $thumbnail-border-color;\n  @include border-radius($thumbnail-border-radius);\n  @include box-shadow($thumbnail-box-shadow);\n\n  // Keep them at most 100% wide\n  @include img-fluid();\n}\n\n//\n// Figures\n//\n\n.figure {\n  // Ensures the caption's text aligns with the image.\n  display: inline-block;\n}\n\n.figure-img {\n  margin-bottom: $spacer * .5;\n  line-height: 1;\n}\n\n.figure-caption {\n  @include font-size($figure-caption-font-size);\n  color: $figure-caption-color;\n}\n","// Image Mixins\n// - Responsive image\n// - Retina image\n\n\n// Responsive image\n//\n// Keep images from scaling beyond the width of their parents.\n\n@mixin img-fluid {\n  // Part 1: Set a maximum relative to the parent\n  max-width: 100%;\n  // Part 2: Override the height to auto, otherwise images will be stretched\n  // when setting a width and height attribute on the img element.\n  height: auto;\n}\n","// Container widths\n//\n// Set the container width, and override it for fixed navbars in media queries.\n\n@if $enable-container-classes {\n  // Single container class with breakpoint max-widths\n  .container,\n  // 100% wide container at all breakpoints\n  .container-fluid {\n    @include make-container();\n  }\n\n  // Responsive containers that are 100% wide until a breakpoint\n  @each $breakpoint, $container-max-width in $container-max-widths {\n    .container-#{$breakpoint} {\n      @extend .container-fluid;\n    }\n\n    @include media-breakpoint-up($breakpoint, $grid-breakpoints) {\n      %responsive-container-#{$breakpoint} {\n        max-width: $container-max-width;\n      }\n\n      // Extend each breakpoint which is smaller or equal to the current breakpoint\n      $extend-breakpoint: true;\n\n      @each $name, $width in $grid-breakpoints {\n        @if ($extend-breakpoint) {\n          .container#{breakpoint-infix($name, $grid-breakpoints)} {\n            @extend %responsive-container-#{$breakpoint};\n          }\n\n          // Once the current breakpoint is reached, stop extending\n          @if ($breakpoint == $name) {\n            $extend-breakpoint: false;\n          }\n        }\n      }\n    }\n  }\n}\n","// Container mixins\n\n@mixin make-container($gutter: $container-padding-x) {\n  --#{$prefix}gutter-x: #{$gutter};\n  --#{$prefix}gutter-y: 0;\n  width: 100%;\n  padding-right: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  padding-left: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  margin-right: auto;\n  margin-left: auto;\n}\n","// Breakpoint viewport sizes and media queries.\n//\n// Breakpoints are defined as a map of (name: minimum width), order from small to large:\n//\n//    (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px)\n//\n// The map defined in the `$grid-breakpoints` global variable is used as the `$breakpoints` argument by default.\n\n// Name of the next breakpoint, or null for the last breakpoint.\n//\n//    >> breakpoint-next(sm)\n//    md\n//    >> breakpoint-next(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    md\n//    >> breakpoint-next(sm, $breakpoint-names: (xs sm md lg xl xxl))\n//    md\n@function breakpoint-next($name, $breakpoints: $grid-breakpoints, $breakpoint-names: map-keys($breakpoints)) {\n  $n: index($breakpoint-names, $name);\n  @if not $n {\n    @error \"breakpoint `#{$name}` not found in `#{$breakpoints}`\";\n  }\n  @return if($n < length($breakpoint-names), nth($breakpoint-names, $n + 1), null);\n}\n\n// Minimum breakpoint width. Null for the smallest (first) breakpoint.\n//\n//    >> breakpoint-min(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    576px\n@function breakpoint-min($name, $breakpoints: $grid-breakpoints) {\n  $min: map-get($breakpoints, $name);\n  @return if($min != 0, $min, null);\n}\n\n// Maximum breakpoint width.\n// The maximum value is reduced by 0.02px to work around the limitations of\n// `min-` and `max-` prefixes and viewports with fractional widths.\n// See https://www.w3.org/TR/mediaqueries-4/#mq-min-max\n// Uses 0.02px rather than 0.01px to work around a current rounding bug in Safari.\n// See https://bugs.webkit.org/show_bug.cgi?id=178261\n//\n//    >> breakpoint-max(md, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    767.98px\n@function breakpoint-max($name, $breakpoints: $grid-breakpoints) {\n  $max: map-get($breakpoints, $name);\n  @return if($max and $max > 0, $max - .02, null);\n}\n\n// Returns a blank string if smallest breakpoint, otherwise returns the name with a dash in front.\n// Useful for making responsive utilities.\n//\n//    >> breakpoint-infix(xs, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    \"\"  (Returns a blank string)\n//    >> breakpoint-infix(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    \"-sm\"\n@function breakpoint-infix($name, $breakpoints: $grid-breakpoints) {\n  @return if(breakpoint-min($name, $breakpoints) == null, \"\", \"-#{$name}\");\n}\n\n// Media of at least the minimum breakpoint width. No query for the smallest breakpoint.\n// Makes the @content apply to the given breakpoint and wider.\n@mixin media-breakpoint-up($name, $breakpoints: $grid-breakpoints) {\n  $min: breakpoint-min($name, $breakpoints);\n  @if $min {\n    @media (min-width: $min) {\n      @content;\n    }\n  } @else {\n    @content;\n  }\n}\n\n// Media of at most the maximum breakpoint width. No query for the largest breakpoint.\n// Makes the @content apply to the given breakpoint and narrower.\n@mixin media-breakpoint-down($name, $breakpoints: $grid-breakpoints) {\n  $max: breakpoint-max($name, $breakpoints);\n  @if $max {\n    @media (max-width: $max) {\n      @content;\n    }\n  } @else {\n    @content;\n  }\n}\n\n// Media that spans multiple breakpoint widths.\n// Makes the @content apply between the min and max breakpoints\n@mixin media-breakpoint-between($lower, $upper, $breakpoints: $grid-breakpoints) {\n  $min: breakpoint-min($lower, $breakpoints);\n  $max: breakpoint-max($upper, $breakpoints);\n\n  @if $min != null and $max != null {\n    @media (min-width: $min) and (max-width: $max) {\n      @content;\n    }\n  } @else if $max == null {\n    @include media-breakpoint-up($lower, $breakpoints) {\n      @content;\n    }\n  } @else if $min == null {\n    @include media-breakpoint-down($upper, $breakpoints) {\n      @content;\n    }\n  }\n}\n\n// Media between the breakpoint's minimum and maximum widths.\n// No minimum for the smallest breakpoint, and no maximum for the largest one.\n// Makes the @content apply only to the given breakpoint, not viewports any wider or narrower.\n@mixin media-breakpoint-only($name, $breakpoints: $grid-breakpoints) {\n  $min:  breakpoint-min($name, $breakpoints);\n  $next: breakpoint-next($name, $breakpoints);\n  $max:  breakpoint-max($next, $breakpoints);\n\n  @if $min != null and $max != null {\n    @media (min-width: $min) and (max-width: $max) {\n      @content;\n    }\n  } @else if $max == null {\n    @include media-breakpoint-up($name, $breakpoints) {\n      @content;\n    }\n  } @else if $min == null {\n    @include media-breakpoint-down($next, $breakpoints) {\n      @content;\n    }\n  }\n}\n","// Row\n//\n// Rows contain your columns.\n\n:root {\n  @each $name, $value in $grid-breakpoints {\n    --#{$prefix}breakpoint-#{$name}: #{$value};\n  }\n}\n\n@if $enable-grid-classes {\n  .row {\n    @include make-row();\n\n    > * {\n      @include make-col-ready();\n    }\n  }\n}\n\n@if $enable-cssgrid {\n  .grid {\n    display: grid;\n    grid-template-rows: repeat(var(--#{$prefix}rows, 1), 1fr);\n    grid-template-columns: repeat(var(--#{$prefix}columns, #{$grid-columns}), 1fr);\n    gap: var(--#{$prefix}gap, #{$grid-gutter-width});\n\n    @include make-cssgrid();\n  }\n}\n\n\n// Columns\n//\n// Common styles for small and large grid columns\n\n@if $enable-grid-classes {\n  @include make-grid-columns();\n}\n","// Grid system\n//\n// Generate semantic grid columns with these mixins.\n\n@mixin make-row($gutter: $grid-gutter-width) {\n  --#{$prefix}gutter-x: #{$gutter};\n  --#{$prefix}gutter-y: 0;\n  display: flex;\n  flex-wrap: wrap;\n  // TODO: Revisit calc order after https://github.com/react-bootstrap/react-bootstrap/issues/6039 is fixed\n  margin-top: calc(-1 * var(--#{$prefix}gutter-y)); // stylelint-disable-line function-disallowed-list\n  margin-right: calc(-.5 * var(--#{$prefix}gutter-x)); // stylelint-disable-line function-disallowed-list\n  margin-left: calc(-.5 * var(--#{$prefix}gutter-x)); // stylelint-disable-line function-disallowed-list\n}\n\n@mixin make-col-ready() {\n  // Add box sizing if only the grid is loaded\n  box-sizing: if(variable-exists(include-column-box-sizing) and $include-column-box-sizing, border-box, null);\n  // Prevent columns from becoming too narrow when at smaller grid tiers by\n  // always setting `width: 100%;`. This works because we set the width\n  // later on to override this initial width.\n  flex-shrink: 0;\n  width: 100%;\n  max-width: 100%; // Prevent `.col-auto`, `.col` (& responsive variants) from breaking out the grid\n  padding-right: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  padding-left: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  margin-top: var(--#{$prefix}gutter-y);\n}\n\n@mixin make-col($size: false, $columns: $grid-columns) {\n  @if $size {\n    flex: 0 0 auto;\n    width: percentage(divide($size, $columns));\n\n  } @else {\n    flex: 1 1 0;\n    max-width: 100%;\n  }\n}\n\n@mixin make-col-auto() {\n  flex: 0 0 auto;\n  width: auto;\n}\n\n@mixin make-col-offset($size, $columns: $grid-columns) {\n  $num: divide($size, $columns);\n  margin-left: if($num == 0, 0, percentage($num));\n}\n\n// Row columns\n//\n// Specify on a parent element(e.g., .row) to force immediate children into NN\n// number of columns. Supports wrapping to new lines, but does not do a Masonry\n// style grid.\n@mixin row-cols($count) {\n  > * {\n    flex: 0 0 auto;\n    width: percentage(divide(1, $count));\n  }\n}\n\n// Framework grid generation\n//\n// Used only by Bootstrap to generate the correct number of grid classes given\n// any value of `$grid-columns`.\n\n@mixin make-grid-columns($columns: $grid-columns, $gutter: $grid-gutter-width, $breakpoints: $grid-breakpoints) {\n  @each $breakpoint in map-keys($breakpoints) {\n    $infix: breakpoint-infix($breakpoint, $breakpoints);\n\n    @include media-breakpoint-up($breakpoint, $breakpoints) {\n      // Provide basic `.col-{bp}` classes for equal-width flexbox columns\n      .col#{$infix} {\n        flex: 1 0 0%; // Flexbugs #4: https://github.com/philipwalton/flexbugs#flexbug-4\n      }\n\n      .row-cols#{$infix}-auto > * {\n        @include make-col-auto();\n      }\n\n      @if $grid-row-columns > 0 {\n        @for $i from 1 through $grid-row-columns {\n          .row-cols#{$infix}-#{$i} {\n            @include row-cols($i);\n          }\n        }\n      }\n\n      .col#{$infix}-auto {\n        @include make-col-auto();\n      }\n\n      @if $columns > 0 {\n        @for $i from 1 through $columns {\n          .col#{$infix}-#{$i} {\n            @include make-col($i, $columns);\n          }\n        }\n\n        // `$columns - 1` because offsetting by the width of an entire row isn't possible\n        @for $i from 0 through ($columns - 1) {\n          @if not ($infix == \"\" and $i == 0) { // Avoid emitting useless .offset-0\n            .offset#{$infix}-#{$i} {\n              @include make-col-offset($i, $columns);\n            }\n          }\n        }\n      }\n\n      // Gutters\n      //\n      // Make use of `.g-*`, `.gx-*` or `.gy-*` utilities to change spacing between the columns.\n      @each $key, $value in $gutters {\n        .g#{$infix}-#{$key},\n        .gx#{$infix}-#{$key} {\n          --#{$prefix}gutter-x: #{$value};\n        }\n\n        .g#{$infix}-#{$key},\n        .gy#{$infix}-#{$key} {\n          --#{$prefix}gutter-y: #{$value};\n        }\n      }\n    }\n  }\n}\n\n@mixin make-cssgrid($columns: $grid-columns, $breakpoints: $grid-breakpoints) {\n  @each $breakpoint in map-keys($breakpoints) {\n    $infix: breakpoint-infix($breakpoint, $breakpoints);\n\n    @include media-breakpoint-up($breakpoint, $breakpoints) {\n      @if $columns > 0 {\n        @for $i from 1 through $columns {\n          .g-col#{$infix}-#{$i} {\n            grid-column: auto / span $i;\n          }\n        }\n\n        // Start with `1` because `0` is and invalid value.\n        // Ends with `$columns - 1` because offsetting by the width of an entire row isn't possible.\n        @for $i from 1 through ($columns - 1) {\n          .g-start#{$infix}-#{$i} {\n            grid-column-start: $i;\n          }\n        }\n      }\n    }\n  }\n}\n","//\n// Basic Bootstrap table\n//\n\n.table {\n  // Reset needed for nesting tables\n  --#{$prefix}table-color-type: initial;\n  --#{$prefix}table-bg-type: initial;\n  --#{$prefix}table-color-state: initial;\n  --#{$prefix}table-bg-state: initial;\n  // End of reset\n  --#{$prefix}table-color: #{$table-color};\n  --#{$prefix}table-bg: #{$table-bg};\n  --#{$prefix}table-border-color: #{$table-border-color};\n  --#{$prefix}table-accent-bg: #{$table-accent-bg};\n  --#{$prefix}table-striped-color: #{$table-striped-color};\n  --#{$prefix}table-striped-bg: #{$table-striped-bg};\n  --#{$prefix}table-active-color: #{$table-active-color};\n  --#{$prefix}table-active-bg: #{$table-active-bg};\n  --#{$prefix}table-hover-color: #{$table-hover-color};\n  --#{$prefix}table-hover-bg: #{$table-hover-bg};\n\n  width: 100%;\n  margin-bottom: $spacer;\n  vertical-align: $table-cell-vertical-align;\n  border-color: var(--#{$prefix}table-border-color);\n\n  // Target th & td\n  // We need the child combinator to prevent styles leaking to nested tables which doesn't have a `.table` class.\n  // We use the universal selectors here to simplify the selector (else we would need 6 different selectors).\n  // Another advantage is that this generates less code and makes the selector less specific making it easier to override.\n  // stylelint-disable-next-line selector-max-universal\n  > :not(caption) > * > * {\n    padding: $table-cell-padding-y $table-cell-padding-x;\n    // Following the precept of cascades: https://codepen.io/miriamsuzanne/full/vYNgodb\n    color: var(--#{$prefix}table-color-state, var(--#{$prefix}table-color-type, var(--#{$prefix}table-color)));\n    background-color: var(--#{$prefix}table-bg);\n    border-bottom-width: $table-border-width;\n    box-shadow: inset 0 0 0 9999px var(--#{$prefix}table-bg-state, var(--#{$prefix}table-bg-type, var(--#{$prefix}table-accent-bg)));\n  }\n\n  > tbody {\n    vertical-align: inherit;\n  }\n\n  > thead {\n    vertical-align: bottom;\n  }\n}\n\n.table-group-divider {\n  border-top: calc(#{$table-border-width} * 2) solid $table-group-separator-color; // stylelint-disable-line function-disallowed-list\n}\n\n//\n// Change placement of captions with a class\n//\n\n.caption-top {\n  caption-side: top;\n}\n\n\n//\n// Condensed table w/ half padding\n//\n\n.table-sm {\n  // stylelint-disable-next-line selector-max-universal\n  > :not(caption) > * > * {\n    padding: $table-cell-padding-y-sm $table-cell-padding-x-sm;\n  }\n}\n\n\n// Border versions\n//\n// Add or remove borders all around the table and between all the columns.\n//\n// When borders are added on all sides of the cells, the corners can render odd when\n// these borders do not have the same color or if they are semi-transparent.\n// Therefor we add top and border bottoms to the `tr`s and left and right borders\n// to the `td`s or `th`s\n\n.table-bordered {\n  > :not(caption) > * {\n    border-width: $table-border-width 0;\n\n    // stylelint-disable-next-line selector-max-universal\n    > * {\n      border-width: 0 $table-border-width;\n    }\n  }\n}\n\n.table-borderless {\n  // stylelint-disable-next-line selector-max-universal\n  > :not(caption) > * > * {\n    border-bottom-width: 0;\n  }\n\n  > :not(:first-child) {\n    border-top-width: 0;\n  }\n}\n\n// Zebra-striping\n//\n// Default zebra-stripe styles (alternating gray and transparent backgrounds)\n\n// For rows\n.table-striped {\n  > tbody > tr:nth-of-type(#{$table-striped-order}) > * {\n    --#{$prefix}table-color-type: var(--#{$prefix}table-striped-color);\n    --#{$prefix}table-bg-type: var(--#{$prefix}table-striped-bg);\n  }\n}\n\n// For columns\n.table-striped-columns {\n  > :not(caption) > tr > :nth-child(#{$table-striped-columns-order}) {\n    --#{$prefix}table-color-type: var(--#{$prefix}table-striped-color);\n    --#{$prefix}table-bg-type: var(--#{$prefix}table-striped-bg);\n  }\n}\n\n// Active table\n//\n// The `.table-active` class can be added to highlight rows or cells\n\n.table-active {\n  --#{$prefix}table-color-state: var(--#{$prefix}table-active-color);\n  --#{$prefix}table-bg-state: var(--#{$prefix}table-active-bg);\n}\n\n// Hover effect\n//\n// Placed here since it has to come after the potential zebra striping\n\n.table-hover {\n  > tbody > tr:hover > * {\n    --#{$prefix}table-color-state: var(--#{$prefix}table-hover-color);\n    --#{$prefix}table-bg-state: var(--#{$prefix}table-hover-bg);\n  }\n}\n\n\n// Table variants\n//\n// Table variants set the table cell backgrounds, border colors\n// and the colors of the striped, hovered & active tables\n\n@each $color, $value in $table-variants {\n  @include table-variant($color, $value);\n}\n\n// Responsive tables\n//\n// Generate series of `.table-responsive-*` classes for configuring the screen\n// size of where your table will overflow.\n\n@each $breakpoint in map-keys($grid-breakpoints) {\n  $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n  @include media-breakpoint-down($breakpoint) {\n    .table-responsive#{$infix} {\n      overflow-x: auto;\n      -webkit-overflow-scrolling: touch;\n    }\n  }\n}\n","// scss-docs-start table-variant\n@mixin table-variant($state, $background) {\n  .table-#{$state} {\n    $color: color-contrast(opaque($body-bg, $background));\n    $hover-bg: mix($color, $background, percentage($table-hover-bg-factor));\n    $striped-bg: mix($color, $background, percentage($table-striped-bg-factor));\n    $active-bg: mix($color, $background, percentage($table-active-bg-factor));\n    $table-border-color: mix($color, $background, percentage($table-border-factor));\n\n    --#{$prefix}table-color: #{$color};\n    --#{$prefix}table-bg: #{$background};\n    --#{$prefix}table-border-color: #{$table-border-color};\n    --#{$prefix}table-striped-bg: #{$striped-bg};\n    --#{$prefix}table-striped-color: #{color-contrast($striped-bg)};\n    --#{$prefix}table-active-bg: #{$active-bg};\n    --#{$prefix}table-active-color: #{color-contrast($active-bg)};\n    --#{$prefix}table-hover-bg: #{$hover-bg};\n    --#{$prefix}table-hover-color: #{color-contrast($hover-bg)};\n\n    color: var(--#{$prefix}table-color);\n    border-color: var(--#{$prefix}table-border-color);\n  }\n}\n// scss-docs-end table-variant\n","//\n// Labels\n//\n\n.form-label {\n  margin-bottom: $form-label-margin-bottom;\n  @include font-size($form-label-font-size);\n  font-style: $form-label-font-style;\n  font-weight: $form-label-font-weight;\n  color: $form-label-color;\n}\n\n// For use with horizontal and inline forms, when you need the label (or legend)\n// text to align with the form controls.\n.col-form-label {\n  padding-top: add($input-padding-y, $input-border-width);\n  padding-bottom: add($input-padding-y, $input-border-width);\n  margin-bottom: 0; // Override the `<legend>` default\n  @include font-size(inherit); // Override the `<legend>` default\n  font-style: $form-label-font-style;\n  font-weight: $form-label-font-weight;\n  line-height: $input-line-height;\n  color: $form-label-color;\n}\n\n.col-form-label-lg {\n  padding-top: add($input-padding-y-lg, $input-border-width);\n  padding-bottom: add($input-padding-y-lg, $input-border-width);\n  @include font-size($input-font-size-lg);\n}\n\n.col-form-label-sm {\n  padding-top: add($input-padding-y-sm, $input-border-width);\n  padding-bottom: add($input-padding-y-sm, $input-border-width);\n  @include font-size($input-font-size-sm);\n}\n","//\n// Form text\n//\n\n.form-text {\n  margin-top: $form-text-margin-top;\n  @include font-size($form-text-font-size);\n  font-style: $form-text-font-style;\n  font-weight: $form-text-font-weight;\n  color: $form-text-color;\n}\n","//\n// General form controls (plus a few specific high-level interventions)\n//\n\n.form-control {\n  display: block;\n  width: 100%;\n  padding: $input-padding-y $input-padding-x;\n  font-family: $input-font-family;\n  @include font-size($input-font-size);\n  font-weight: $input-font-weight;\n  line-height: $input-line-height;\n  color: $input-color;\n  appearance: none; // Fix appearance for date inputs in Safari\n  background-color: $input-bg;\n  background-clip: padding-box;\n  border: $input-border-width solid $input-border-color;\n\n  // Note: This has no effect on <select>s in some browsers, due to the limited stylability of `<select>`s in CSS.\n  @include border-radius($input-border-radius, 0);\n\n  @include box-shadow($input-box-shadow);\n  @include transition($input-transition);\n\n  &[type=\"file\"] {\n    overflow: hidden; // prevent pseudo element button overlap\n\n    &:not(:disabled):not([readonly]) {\n      cursor: pointer;\n    }\n  }\n\n  // Customize the `:focus` state to imitate native WebKit styles.\n  &:focus {\n    color: $input-focus-color;\n    background-color: $input-focus-bg;\n    border-color: $input-focus-border-color;\n    outline: 0;\n    @if $enable-shadows {\n      @include box-shadow($input-box-shadow, $input-focus-box-shadow);\n    } @else {\n      // Avoid using mixin so we can pass custom focus shadow properly\n      box-shadow: $input-focus-box-shadow;\n    }\n  }\n\n  &::-webkit-date-and-time-value {\n    // On Android Chrome, form-control's \"width: 100%\" makes the input width too small\n    // Tested under Android 11 / Chrome 89, Android 12 / Chrome 100, Android 13 / Chrome 109\n    //\n    // On iOS Safari, form-control's \"appearance: none\" + \"width: 100%\" makes the input width too small\n    // Tested under iOS 16.2 / Safari 16.2\n    min-width: 85px; // Seems to be a good minimum safe width\n\n    // Add some height to date inputs on iOS\n    // https://github.com/twbs/bootstrap/issues/23307\n    // TODO: we can remove this workaround once https://bugs.webkit.org/show_bug.cgi?id=198959 is resolved\n    // Multiply line-height by 1em if it has no unit\n    height: if(unit($input-line-height) == \"\", $input-line-height * 1em, $input-line-height);\n\n    // Android Chrome type=\"date\" is taller than the other inputs\n    // because of \"margin: 1px 24px 1px 4px\" inside the shadow DOM\n    // Tested under Android 11 / Chrome 89, Android 12 / Chrome 100, Android 13 / Chrome 109\n    margin: 0;\n  }\n\n  // Prevent excessive date input height in Webkit\n  // https://github.com/twbs/bootstrap/issues/34433\n  &::-webkit-datetime-edit {\n    display: block;\n    padding: 0;\n  }\n\n  // Placeholder\n  &::placeholder {\n    color: $input-placeholder-color;\n    // Override Firefox's unusual default opacity; see https://github.com/twbs/bootstrap/pull/11526.\n    opacity: 1;\n  }\n\n  // Disabled inputs\n  //\n  // HTML5 says that controls under a fieldset > legend:first-child won't be\n  // disabled if the fieldset is disabled. Due to implementation difficulty, we\n  // don't honor that edge case; we style them as disabled anyway.\n  &:disabled {\n    color: $input-disabled-color;\n    background-color: $input-disabled-bg;\n    border-color: $input-disabled-border-color;\n    // iOS fix for unreadable disabled content; see https://github.com/twbs/bootstrap/issues/11655.\n    opacity: 1;\n  }\n\n  // File input buttons theming\n  &::file-selector-button {\n    padding: $input-padding-y $input-padding-x;\n    margin: (-$input-padding-y) (-$input-padding-x);\n    margin-inline-end: $input-padding-x;\n    color: $form-file-button-color;\n    @include gradient-bg($form-file-button-bg);\n    pointer-events: none;\n    border-color: inherit;\n    border-style: solid;\n    border-width: 0;\n    border-inline-end-width: $input-border-width;\n    border-radius: 0; // stylelint-disable-line property-disallowed-list\n    @include transition($btn-transition);\n  }\n\n  &:hover:not(:disabled):not([readonly])::file-selector-button {\n    background-color: $form-file-button-hover-bg;\n  }\n}\n\n// Readonly controls as plain text\n//\n// Apply class to a readonly input to make it appear like regular plain\n// text (without any border, background color, focus indicator)\n\n.form-control-plaintext {\n  display: block;\n  width: 100%;\n  padding: $input-padding-y 0;\n  margin-bottom: 0; // match inputs if this class comes on inputs with default margins\n  line-height: $input-line-height;\n  color: $input-plaintext-color;\n  background-color: transparent;\n  border: solid transparent;\n  border-width: $input-border-width 0;\n\n  &:focus {\n    outline: 0;\n  }\n\n  &.form-control-sm,\n  &.form-control-lg {\n    padding-right: 0;\n    padding-left: 0;\n  }\n}\n\n// Form control sizing\n//\n// Build on `.form-control` with modifier classes to decrease or increase the\n// height and font-size of form controls.\n//\n// Repeated in `_input_group.scss` to avoid Sass extend issues.\n\n.form-control-sm {\n  min-height: $input-height-sm;\n  padding: $input-padding-y-sm $input-padding-x-sm;\n  @include font-size($input-font-size-sm);\n  @include border-radius($input-border-radius-sm);\n\n  &::file-selector-button {\n    padding: $input-padding-y-sm $input-padding-x-sm;\n    margin: (-$input-padding-y-sm) (-$input-padding-x-sm);\n    margin-inline-end: $input-padding-x-sm;\n  }\n}\n\n.form-control-lg {\n  min-height: $input-height-lg;\n  padding: $input-padding-y-lg $input-padding-x-lg;\n  @include font-size($input-font-size-lg);\n  @include border-radius($input-border-radius-lg);\n\n  &::file-selector-button {\n    padding: $input-padding-y-lg $input-padding-x-lg;\n    margin: (-$input-padding-y-lg) (-$input-padding-x-lg);\n    margin-inline-end: $input-padding-x-lg;\n  }\n}\n\n// Make sure textareas don't shrink too much when resized\n// https://github.com/twbs/bootstrap/pull/29124\n// stylelint-disable selector-no-qualifying-type\ntextarea {\n  &.form-control {\n    min-height: $input-height;\n  }\n\n  &.form-control-sm {\n    min-height: $input-height-sm;\n  }\n\n  &.form-control-lg {\n    min-height: $input-height-lg;\n  }\n}\n// stylelint-enable selector-no-qualifying-type\n\n.form-control-color {\n  width: $form-color-width;\n  height: $input-height;\n  padding: $input-padding-y;\n\n  &:not(:disabled):not([readonly]) {\n    cursor: pointer;\n  }\n\n  &::-moz-color-swatch {\n    border: 0 !important; // stylelint-disable-line declaration-no-important\n    @include border-radius($input-border-radius);\n  }\n\n  &::-webkit-color-swatch {\n    border: 0 !important; // stylelint-disable-line declaration-no-important\n    @include border-radius($input-border-radius);\n  }\n\n  &.form-control-sm { height: $input-height-sm; }\n  &.form-control-lg { height: $input-height-lg; }\n}\n","// stylelint-disable property-disallowed-list\n@mixin transition($transition...) {\n  @if length($transition) == 0 {\n    $transition: $transition-base;\n  }\n\n  @if length($transition) > 1 {\n    @each $value in $transition {\n      @if $value == null or $value == none {\n        @warn \"The keyword 'none' or 'null' must be used as a single argument.\";\n      }\n    }\n  }\n\n  @if $enable-transitions {\n    @if nth($transition, 1) != null {\n      transition: $transition;\n    }\n\n    @if $enable-reduced-motion and nth($transition, 1) != null and nth($transition, 1) != none {\n      @media (prefers-reduced-motion: reduce) {\n        transition: none;\n      }\n    }\n  }\n}\n","// Gradients\n\n// scss-docs-start gradient-bg-mixin\n@mixin gradient-bg($color: null) {\n  background-color: $color;\n\n  @if $enable-gradients {\n    background-image: var(--#{$prefix}gradient);\n  }\n}\n// scss-docs-end gradient-bg-mixin\n\n// scss-docs-start gradient-mixins\n// Horizontal gradient, from left to right\n//\n// Creates two color stops, start and end, by specifying a color and position for each color stop.\n@mixin gradient-x($start-color: $gray-700, $end-color: $gray-800, $start-percent: 0%, $end-percent: 100%) {\n  background-image: linear-gradient(to right, $start-color $start-percent, $end-color $end-percent);\n}\n\n// Vertical gradient, from top to bottom\n//\n// Creates two color stops, start and end, by specifying a color and position for each color stop.\n@mixin gradient-y($start-color: $gray-700, $end-color: $gray-800, $start-percent: null, $end-percent: null) {\n  background-image: linear-gradient(to bottom, $start-color $start-percent, $end-color $end-percent);\n}\n\n@mixin gradient-directional($start-color: $gray-700, $end-color: $gray-800, $deg: 45deg) {\n  background-image: linear-gradient($deg, $start-color, $end-color);\n}\n\n@mixin gradient-x-three-colors($start-color: $blue, $mid-color: $purple, $color-stop: 50%, $end-color: $red) {\n  background-image: linear-gradient(to right, $start-color, $mid-color $color-stop, $end-color);\n}\n\n@mixin gradient-y-three-colors($start-color: $blue, $mid-color: $purple, $color-stop: 50%, $end-color: $red) {\n  background-image: linear-gradient($start-color, $mid-color $color-stop, $end-color);\n}\n\n@mixin gradient-radial($inner-color: $gray-700, $outer-color: $gray-800) {\n  background-image: radial-gradient(circle, $inner-color, $outer-color);\n}\n\n@mixin gradient-striped($color: rgba($white, .15), $angle: 45deg) {\n  background-image: linear-gradient($angle, $color 25%, transparent 25%, transparent 50%, $color 50%, $color 75%, transparent 75%, transparent);\n}\n// scss-docs-end gradient-mixins\n","// Select\n//\n// Replaces the browser default select with a custom one, mostly pulled from\n// https://primer.github.io/.\n\n.form-select {\n  --#{$prefix}form-select-bg-img: #{escape-svg($form-select-indicator)};\n\n  display: block;\n  width: 100%;\n  padding: $form-select-padding-y $form-select-indicator-padding $form-select-padding-y $form-select-padding-x;\n  font-family: $form-select-font-family;\n  @include font-size($form-select-font-size);\n  font-weight: $form-select-font-weight;\n  line-height: $form-select-line-height;\n  color: $form-select-color;\n  appearance: none;\n  background-color: $form-select-bg;\n  background-image: var(--#{$prefix}form-select-bg-img), var(--#{$prefix}form-select-bg-icon, none);\n  background-repeat: no-repeat;\n  background-position: $form-select-bg-position;\n  background-size: $form-select-bg-size;\n  border: $form-select-border-width solid $form-select-border-color;\n  @include border-radius($form-select-border-radius, 0);\n  @include box-shadow($form-select-box-shadow);\n  @include transition($form-select-transition);\n\n  &:focus {\n    border-color: $form-select-focus-border-color;\n    outline: 0;\n    @if $enable-shadows {\n      @include box-shadow($form-select-box-shadow, $form-select-focus-box-shadow);\n    } @else {\n      // Avoid using mixin so we can pass custom focus shadow properly\n      box-shadow: $form-select-focus-box-shadow;\n    }\n  }\n\n  &[multiple],\n  &[size]:not([size=\"1\"]) {\n    padding-right: $form-select-padding-x;\n    background-image: none;\n  }\n\n  &:disabled {\n    color: $form-select-disabled-color;\n    background-color: $form-select-disabled-bg;\n    border-color: $form-select-disabled-border-color;\n  }\n\n  // Remove outline from select box in FF\n  &:-moz-focusring {\n    color: transparent;\n    text-shadow: 0 0 0 $form-select-color;\n  }\n}\n\n.form-select-sm {\n  padding-top: $form-select-padding-y-sm;\n  padding-bottom: $form-select-padding-y-sm;\n  padding-left: $form-select-padding-x-sm;\n  @include font-size($form-select-font-size-sm);\n  @include border-radius($form-select-border-radius-sm);\n}\n\n.form-select-lg {\n  padding-top: $form-select-padding-y-lg;\n  padding-bottom: $form-select-padding-y-lg;\n  padding-left: $form-select-padding-x-lg;\n  @include font-size($form-select-font-size-lg);\n  @include border-radius($form-select-border-radius-lg);\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    .form-select {\n      --#{$prefix}form-select-bg-img: #{escape-svg($form-select-indicator-dark)};\n    }\n  }\n}\n","//\n// Check/radio\n//\n\n.form-check {\n  display: block;\n  min-height: $form-check-min-height;\n  padding-left: $form-check-padding-start;\n  margin-bottom: $form-check-margin-bottom;\n\n  .form-check-input {\n    float: left;\n    margin-left: $form-check-padding-start * -1;\n  }\n}\n\n.form-check-reverse {\n  padding-right: $form-check-padding-start;\n  padding-left: 0;\n  text-align: right;\n\n  .form-check-input {\n    float: right;\n    margin-right: $form-check-padding-start * -1;\n    margin-left: 0;\n  }\n}\n\n.form-check-input {\n  --#{$prefix}form-check-bg: #{$form-check-input-bg};\n\n  flex-shrink: 0;\n  width: $form-check-input-width;\n  height: $form-check-input-width;\n  margin-top: ($line-height-base - $form-check-input-width) * .5; // line-height minus check height\n  vertical-align: top;\n  appearance: none;\n  background-color: var(--#{$prefix}form-check-bg);\n  background-image: var(--#{$prefix}form-check-bg-image);\n  background-repeat: no-repeat;\n  background-position: center;\n  background-size: contain;\n  border: $form-check-input-border;\n  print-color-adjust: exact; // Keep themed appearance for print\n  @include transition($form-check-transition);\n\n  &[type=\"checkbox\"] {\n    @include border-radius($form-check-input-border-radius);\n  }\n\n  &[type=\"radio\"] {\n    // stylelint-disable-next-line property-disallowed-list\n    border-radius: $form-check-radio-border-radius;\n  }\n\n  &:active {\n    filter: $form-check-input-active-filter;\n  }\n\n  &:focus {\n    border-color: $form-check-input-focus-border;\n    outline: 0;\n    box-shadow: $form-check-input-focus-box-shadow;\n  }\n\n  &:checked {\n    background-color: $form-check-input-checked-bg-color;\n    border-color: $form-check-input-checked-border-color;\n\n    &[type=\"checkbox\"] {\n      @if $enable-gradients {\n        --#{$prefix}form-check-bg-image: #{escape-svg($form-check-input-checked-bg-image)}, var(--#{$prefix}gradient);\n      } @else {\n        --#{$prefix}form-check-bg-image: #{escape-svg($form-check-input-checked-bg-image)};\n      }\n    }\n\n    &[type=\"radio\"] {\n      @if $enable-gradients {\n        --#{$prefix}form-check-bg-image: #{escape-svg($form-check-radio-checked-bg-image)}, var(--#{$prefix}gradient);\n      } @else {\n        --#{$prefix}form-check-bg-image: #{escape-svg($form-check-radio-checked-bg-image)};\n      }\n    }\n  }\n\n  &[type=\"checkbox\"]:indeterminate {\n    background-color: $form-check-input-indeterminate-bg-color;\n    border-color: $form-check-input-indeterminate-border-color;\n\n    @if $enable-gradients {\n      --#{$prefix}form-check-bg-image: #{escape-svg($form-check-input-indeterminate-bg-image)}, var(--#{$prefix}gradient);\n    } @else {\n      --#{$prefix}form-check-bg-image: #{escape-svg($form-check-input-indeterminate-bg-image)};\n    }\n  }\n\n  &:disabled {\n    pointer-events: none;\n    filter: none;\n    opacity: $form-check-input-disabled-opacity;\n  }\n\n  // Use disabled attribute in addition of :disabled pseudo-class\n  // See: https://github.com/twbs/bootstrap/issues/28247\n  &[disabled],\n  &:disabled {\n    ~ .form-check-label {\n      cursor: default;\n      opacity: $form-check-label-disabled-opacity;\n    }\n  }\n}\n\n.form-check-label {\n  color: $form-check-label-color;\n  cursor: $form-check-label-cursor;\n}\n\n//\n// Switch\n//\n\n.form-switch {\n  padding-left: $form-switch-padding-start;\n\n  .form-check-input {\n    --#{$prefix}form-switch-bg: #{escape-svg($form-switch-bg-image)};\n\n    width: $form-switch-width;\n    margin-left: $form-switch-padding-start * -1;\n    background-image: var(--#{$prefix}form-switch-bg);\n    background-position: left center;\n    @include border-radius($form-switch-border-radius);\n    @include transition($form-switch-transition);\n\n    &:focus {\n      --#{$prefix}form-switch-bg: #{escape-svg($form-switch-focus-bg-image)};\n    }\n\n    &:checked {\n      background-position: $form-switch-checked-bg-position;\n\n      @if $enable-gradients {\n        --#{$prefix}form-switch-bg: #{escape-svg($form-switch-checked-bg-image)}, var(--#{$prefix}gradient);\n      } @else {\n        --#{$prefix}form-switch-bg: #{escape-svg($form-switch-checked-bg-image)};\n      }\n    }\n  }\n\n  &.form-check-reverse {\n    padding-right: $form-switch-padding-start;\n    padding-left: 0;\n\n    .form-check-input {\n      margin-right: $form-switch-padding-start * -1;\n      margin-left: 0;\n    }\n  }\n}\n\n.form-check-inline {\n  display: inline-block;\n  margin-right: $form-check-inline-margin-end;\n}\n\n.btn-check {\n  position: absolute;\n  clip: rect(0, 0, 0, 0);\n  pointer-events: none;\n\n  &[disabled],\n  &:disabled {\n    + .btn {\n      pointer-events: none;\n      filter: none;\n      opacity: $form-check-btn-check-disabled-opacity;\n    }\n  }\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    .form-switch .form-check-input:not(:checked):not(:focus) {\n      --#{$prefix}form-switch-bg: #{escape-svg($form-switch-bg-image-dark)};\n    }\n  }\n}\n","// Range\n//\n// Style range inputs the same across browsers. Vendor-specific rules for pseudo\n// elements cannot be mixed. As such, there are no shared styles for focus or\n// active states on prefixed selectors.\n\n.form-range {\n  width: 100%;\n  height: add($form-range-thumb-height, $form-range-thumb-focus-box-shadow-width * 2);\n  padding: 0; // Need to reset padding\n  appearance: none;\n  background-color: transparent;\n\n  &:focus {\n    outline: 0;\n\n    // Pseudo-elements must be split across multiple rulesets to have an effect.\n    // No box-shadow() mixin for focus accessibility.\n    &::-webkit-slider-thumb { box-shadow: $form-range-thumb-focus-box-shadow; }\n    &::-moz-range-thumb     { box-shadow: $form-range-thumb-focus-box-shadow; }\n  }\n\n  &::-moz-focus-outer {\n    border: 0;\n  }\n\n  &::-webkit-slider-thumb {\n    width: $form-range-thumb-width;\n    height: $form-range-thumb-height;\n    margin-top: ($form-range-track-height - $form-range-thumb-height) * .5; // Webkit specific\n    appearance: none;\n    @include gradient-bg($form-range-thumb-bg);\n    border: $form-range-thumb-border;\n    @include border-radius($form-range-thumb-border-radius);\n    @include box-shadow($form-range-thumb-box-shadow);\n    @include transition($form-range-thumb-transition);\n\n    &:active {\n      @include gradient-bg($form-range-thumb-active-bg);\n    }\n  }\n\n  &::-webkit-slider-runnable-track {\n    width: $form-range-track-width;\n    height: $form-range-track-height;\n    color: transparent; // Why?\n    cursor: $form-range-track-cursor;\n    background-color: $form-range-track-bg;\n    border-color: transparent;\n    @include border-radius($form-range-track-border-radius);\n    @include box-shadow($form-range-track-box-shadow);\n  }\n\n  &::-moz-range-thumb {\n    width: $form-range-thumb-width;\n    height: $form-range-thumb-height;\n    appearance: none;\n    @include gradient-bg($form-range-thumb-bg);\n    border: $form-range-thumb-border;\n    @include border-radius($form-range-thumb-border-radius);\n    @include box-shadow($form-range-thumb-box-shadow);\n    @include transition($form-range-thumb-transition);\n\n    &:active {\n      @include gradient-bg($form-range-thumb-active-bg);\n    }\n  }\n\n  &::-moz-range-track {\n    width: $form-range-track-width;\n    height: $form-range-track-height;\n    color: transparent;\n    cursor: $form-range-track-cursor;\n    background-color: $form-range-track-bg;\n    border-color: transparent; // Firefox specific?\n    @include border-radius($form-range-track-border-radius);\n    @include box-shadow($form-range-track-box-shadow);\n  }\n\n  &:disabled {\n    pointer-events: none;\n\n    &::-webkit-slider-thumb {\n      background-color: $form-range-thumb-disabled-bg;\n    }\n\n    &::-moz-range-thumb {\n      background-color: $form-range-thumb-disabled-bg;\n    }\n  }\n}\n",".form-floating {\n  position: relative;\n\n  > .form-control,\n  > .form-control-plaintext,\n  > .form-select {\n    height: $form-floating-height;\n    min-height: $form-floating-height;\n    line-height: $form-floating-line-height;\n  }\n\n  > label {\n    position: absolute;\n    top: 0;\n    left: 0;\n    z-index: 2;\n    height: 100%; // allow textareas\n    padding: $form-floating-padding-y $form-floating-padding-x;\n    overflow: hidden;\n    text-align: start;\n    text-overflow: ellipsis;\n    white-space: nowrap;\n    pointer-events: none;\n    border: $input-border-width solid transparent; // Required for aligning label's text with the input as it affects inner box model\n    transform-origin: 0 0;\n    @include transition($form-floating-transition);\n  }\n\n  > .form-control,\n  > .form-control-plaintext {\n    padding: $form-floating-padding-y $form-floating-padding-x;\n\n    &::placeholder {\n      color: transparent;\n    }\n\n    &:focus,\n    &:not(:placeholder-shown) {\n      padding-top: $form-floating-input-padding-t;\n      padding-bottom: $form-floating-input-padding-b;\n    }\n    // Duplicated because `:-webkit-autofill` invalidates other selectors when grouped\n    &:-webkit-autofill {\n      padding-top: $form-floating-input-padding-t;\n      padding-bottom: $form-floating-input-padding-b;\n    }\n  }\n\n  > .form-select {\n    padding-top: $form-floating-input-padding-t;\n    padding-bottom: $form-floating-input-padding-b;\n  }\n\n  > .form-control:focus,\n  > .form-control:not(:placeholder-shown),\n  > .form-control-plaintext,\n  > .form-select {\n    ~ label {\n      color: rgba(var(--#{$prefix}body-color-rgb), #{$form-floating-label-opacity});\n      transform: $form-floating-label-transform;\n\n      &::after {\n        position: absolute;\n        inset: $form-floating-padding-y ($form-floating-padding-x * .5);\n        z-index: -1;\n        height: $form-floating-label-height;\n        content: \"\";\n        background-color: $input-bg;\n        @include border-radius($input-border-radius);\n      }\n    }\n  }\n  // Duplicated because `:-webkit-autofill` invalidates other selectors when grouped\n  > .form-control:-webkit-autofill {\n    ~ label {\n      color: rgba(var(--#{$prefix}body-color-rgb), #{$form-floating-label-opacity});\n      transform: $form-floating-label-transform;\n    }\n  }\n\n  > .form-control-plaintext {\n    ~ label {\n      border-width: $input-border-width 0; // Required to properly position label text - as explained above\n    }\n  }\n\n  > :disabled ~ label,\n  > .form-control:disabled ~ label { // Required for `.form-control`s because of specificity\n    color: $form-floating-label-disabled-color;\n\n    &::after {\n      background-color: $input-disabled-bg;\n    }\n  }\n}\n","//\n// Base styles\n//\n\n.input-group {\n  position: relative;\n  display: flex;\n  flex-wrap: wrap; // For form validation feedback\n  align-items: stretch;\n  width: 100%;\n\n  > .form-control,\n  > .form-select,\n  > .form-floating {\n    position: relative; // For focus state's z-index\n    flex: 1 1 auto;\n    width: 1%;\n    min-width: 0; // https://stackoverflow.com/questions/36247140/why-dont-flex-items-shrink-past-content-size\n  }\n\n  // Bring the \"active\" form control to the top of surrounding elements\n  > .form-control:focus,\n  > .form-select:focus,\n  > .form-floating:focus-within {\n    z-index: 5;\n  }\n\n  // Ensure buttons are always above inputs for more visually pleasing borders.\n  // This isn't needed for `.input-group-text` since it shares the same border-color\n  // as our inputs.\n  .btn {\n    position: relative;\n    z-index: 2;\n\n    &:focus {\n      z-index: 5;\n    }\n  }\n}\n\n\n// Textual addons\n//\n// Serves as a catch-all element for any text or radio/checkbox input you wish\n// to prepend or append to an input.\n\n.input-group-text {\n  display: flex;\n  align-items: center;\n  padding: $input-group-addon-padding-y $input-group-addon-padding-x;\n  @include font-size($input-font-size); // Match inputs\n  font-weight: $input-group-addon-font-weight;\n  line-height: $input-line-height;\n  color: $input-group-addon-color;\n  text-align: center;\n  white-space: nowrap;\n  background-color: $input-group-addon-bg;\n  border: $input-border-width solid $input-group-addon-border-color;\n  @include border-radius($input-border-radius);\n}\n\n\n// Sizing\n//\n// Remix the default form control sizing classes into new ones for easier\n// manipulation.\n\n.input-group-lg > .form-control,\n.input-group-lg > .form-select,\n.input-group-lg > .input-group-text,\n.input-group-lg > .btn {\n  padding: $input-padding-y-lg $input-padding-x-lg;\n  @include font-size($input-font-size-lg);\n  @include border-radius($input-border-radius-lg);\n}\n\n.input-group-sm > .form-control,\n.input-group-sm > .form-select,\n.input-group-sm > .input-group-text,\n.input-group-sm > .btn {\n  padding: $input-padding-y-sm $input-padding-x-sm;\n  @include font-size($input-font-size-sm);\n  @include border-radius($input-border-radius-sm);\n}\n\n.input-group-lg > .form-select,\n.input-group-sm > .form-select {\n  padding-right: $form-select-padding-x + $form-select-indicator-padding;\n}\n\n\n// Rounded corners\n//\n// These rulesets must come after the sizing ones to properly override sm and lg\n// border-radius values when extending. They're more specific than we'd like\n// with the `.input-group >` part, but without it, we cannot override the sizing.\n\n// stylelint-disable-next-line no-duplicate-selectors\n.input-group {\n  &:not(.has-validation) {\n    > :not(:last-child):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating),\n    > .dropdown-toggle:nth-last-child(n + 3),\n    > .form-floating:not(:last-child) > .form-control,\n    > .form-floating:not(:last-child) > .form-select {\n      @include border-end-radius(0);\n    }\n  }\n\n  &.has-validation {\n    > :nth-last-child(n + 3):not(.dropdown-toggle):not(.dropdown-menu):not(.form-floating),\n    > .dropdown-toggle:nth-last-child(n + 4),\n    > .form-floating:nth-last-child(n + 3) > .form-control,\n    > .form-floating:nth-last-child(n + 3) > .form-select {\n      @include border-end-radius(0);\n    }\n  }\n\n  $validation-messages: \"\";\n  @each $state in map-keys($form-validation-states) {\n    $validation-messages: $validation-messages + \":not(.\" + unquote($state) + \"-tooltip)\" + \":not(.\" + unquote($state) + \"-feedback)\";\n  }\n\n  > :not(:first-child):not(.dropdown-menu)#{$validation-messages} {\n    margin-left: calc(#{$input-border-width} * -1); // stylelint-disable-line function-disallowed-list\n    @include border-start-radius(0);\n  }\n\n  > .form-floating:not(:first-child) > .form-control,\n  > .form-floating:not(:first-child) > .form-select {\n    @include border-start-radius(0);\n  }\n}\n","// This mixin uses an `if()` technique to be compatible with Dart Sass\n// See https://github.com/sass/sass/issues/1873#issuecomment-152293725 for more details\n\n// scss-docs-start form-validation-mixins\n@mixin form-validation-state-selector($state) {\n  @if ($state == \"valid\" or $state == \"invalid\") {\n    .was-validated #{if(&, \"&\", \"\")}:#{$state},\n    #{if(&, \"&\", \"\")}.is-#{$state} {\n      @content;\n    }\n  } @else {\n    #{if(&, \"&\", \"\")}.is-#{$state} {\n      @content;\n    }\n  }\n}\n\n@mixin form-validation-state(\n  $state,\n  $color,\n  $icon,\n  $tooltip-color: color-contrast($color),\n  $tooltip-bg-color: rgba($color, $form-feedback-tooltip-opacity),\n  $focus-box-shadow: 0 0 $input-btn-focus-blur $input-focus-width rgba($color, $input-btn-focus-color-opacity),\n  $border-color: $color\n) {\n  .#{$state}-feedback {\n    display: none;\n    width: 100%;\n    margin-top: $form-feedback-margin-top;\n    @include font-size($form-feedback-font-size);\n    font-style: $form-feedback-font-style;\n    color: $color;\n  }\n\n  .#{$state}-tooltip {\n    position: absolute;\n    top: 100%;\n    z-index: 5;\n    display: none;\n    max-width: 100%; // Contain to parent when possible\n    padding: $form-feedback-tooltip-padding-y $form-feedback-tooltip-padding-x;\n    margin-top: .1rem;\n    @include font-size($form-feedback-tooltip-font-size);\n    line-height: $form-feedback-tooltip-line-height;\n    color: $tooltip-color;\n    background-color: $tooltip-bg-color;\n    @include border-radius($form-feedback-tooltip-border-radius);\n  }\n\n  @include form-validation-state-selector($state) {\n    ~ .#{$state}-feedback,\n    ~ .#{$state}-tooltip {\n      display: block;\n    }\n  }\n\n  .form-control {\n    @include form-validation-state-selector($state) {\n      border-color: $border-color;\n\n      @if $enable-validation-icons {\n        padding-right: $input-height-inner;\n        background-image: escape-svg($icon);\n        background-repeat: no-repeat;\n        background-position: right $input-height-inner-quarter center;\n        background-size: $input-height-inner-half $input-height-inner-half;\n      }\n\n      &:focus {\n        border-color: $border-color;\n        box-shadow: $focus-box-shadow;\n      }\n    }\n  }\n\n  // stylelint-disable-next-line selector-no-qualifying-type\n  textarea.form-control {\n    @include form-validation-state-selector($state) {\n      @if $enable-validation-icons {\n        padding-right: $input-height-inner;\n        background-position: top $input-height-inner-quarter right $input-height-inner-quarter;\n      }\n    }\n  }\n\n  .form-select {\n    @include form-validation-state-selector($state) {\n      border-color: $border-color;\n\n      @if $enable-validation-icons {\n        &:not([multiple]):not([size]),\n        &:not([multiple])[size=\"1\"] {\n          --#{$prefix}form-select-bg-icon: #{escape-svg($icon)};\n          padding-right: $form-select-feedback-icon-padding-end;\n          background-position: $form-select-bg-position, $form-select-feedback-icon-position;\n          background-size: $form-select-bg-size, $form-select-feedback-icon-size;\n        }\n      }\n\n      &:focus {\n        border-color: $border-color;\n        box-shadow: $focus-box-shadow;\n      }\n    }\n  }\n\n  .form-control-color {\n    @include form-validation-state-selector($state) {\n      @if $enable-validation-icons {\n        width: add($form-color-width, $input-height-inner);\n      }\n    }\n  }\n\n  .form-check-input {\n    @include form-validation-state-selector($state) {\n      border-color: $border-color;\n\n      &:checked {\n        background-color: $color;\n      }\n\n      &:focus {\n        box-shadow: $focus-box-shadow;\n      }\n\n      ~ .form-check-label {\n        color: $color;\n      }\n    }\n  }\n  .form-check-inline .form-check-input {\n    ~ .#{$state}-feedback {\n      margin-left: .5em;\n    }\n  }\n\n  .input-group {\n    > .form-control:not(:focus),\n    > .form-select:not(:focus),\n    > .form-floating:not(:focus-within) {\n      @include form-validation-state-selector($state) {\n        @if $state == \"valid\" {\n          z-index: 3;\n        } @else if $state == \"invalid\" {\n          z-index: 4;\n        }\n      }\n    }\n  }\n}\n// scss-docs-end form-validation-mixins\n","//\n// Base styles\n//\n\n.btn {\n  // scss-docs-start btn-css-vars\n  --#{$prefix}btn-padding-x: #{$btn-padding-x};\n  --#{$prefix}btn-padding-y: #{$btn-padding-y};\n  --#{$prefix}btn-font-family: #{$btn-font-family};\n  @include rfs($btn-font-size, --#{$prefix}btn-font-size);\n  --#{$prefix}btn-font-weight: #{$btn-font-weight};\n  --#{$prefix}btn-line-height: #{$btn-line-height};\n  --#{$prefix}btn-color: #{$btn-color};\n  --#{$prefix}btn-bg: transparent;\n  --#{$prefix}btn-border-width: #{$btn-border-width};\n  --#{$prefix}btn-border-color: transparent;\n  --#{$prefix}btn-border-radius: #{$btn-border-radius};\n  --#{$prefix}btn-hover-border-color: transparent;\n  --#{$prefix}btn-box-shadow: #{$btn-box-shadow};\n  --#{$prefix}btn-disabled-opacity: #{$btn-disabled-opacity};\n  --#{$prefix}btn-focus-box-shadow: 0 0 0 #{$btn-focus-width} rgba(var(--#{$prefix}btn-focus-shadow-rgb), .5);\n  // scss-docs-end btn-css-vars\n\n  display: inline-block;\n  padding: var(--#{$prefix}btn-padding-y) var(--#{$prefix}btn-padding-x);\n  font-family: var(--#{$prefix}btn-font-family);\n  @include font-size(var(--#{$prefix}btn-font-size));\n  font-weight: var(--#{$prefix}btn-font-weight);\n  line-height: var(--#{$prefix}btn-line-height);\n  color: var(--#{$prefix}btn-color);\n  text-align: center;\n  text-decoration: if($link-decoration == none, null, none);\n  white-space: $btn-white-space;\n  vertical-align: middle;\n  cursor: if($enable-button-pointers, pointer, null);\n  user-select: none;\n  border: var(--#{$prefix}btn-border-width) solid var(--#{$prefix}btn-border-color);\n  @include border-radius(var(--#{$prefix}btn-border-radius));\n  @include gradient-bg(var(--#{$prefix}btn-bg));\n  @include box-shadow(var(--#{$prefix}btn-box-shadow));\n  @include transition($btn-transition);\n\n  &:hover {\n    color: var(--#{$prefix}btn-hover-color);\n    text-decoration: if($link-hover-decoration == underline, none, null);\n    background-color: var(--#{$prefix}btn-hover-bg);\n    border-color: var(--#{$prefix}btn-hover-border-color);\n  }\n\n  .btn-check + &:hover {\n    // override for the checkbox/radio buttons\n    color: var(--#{$prefix}btn-color);\n    background-color: var(--#{$prefix}btn-bg);\n    border-color: var(--#{$prefix}btn-border-color);\n  }\n\n  &:focus-visible {\n    color: var(--#{$prefix}btn-hover-color);\n    @include gradient-bg(var(--#{$prefix}btn-hover-bg));\n    border-color: var(--#{$prefix}btn-hover-border-color);\n    outline: 0;\n    // Avoid using mixin so we can pass custom focus shadow properly\n    @if $enable-shadows {\n      box-shadow: var(--#{$prefix}btn-box-shadow), var(--#{$prefix}btn-focus-box-shadow);\n    } @else {\n      box-shadow: var(--#{$prefix}btn-focus-box-shadow);\n    }\n  }\n\n  .btn-check:focus-visible + & {\n    border-color: var(--#{$prefix}btn-hover-border-color);\n    outline: 0;\n    // Avoid using mixin so we can pass custom focus shadow properly\n    @if $enable-shadows {\n      box-shadow: var(--#{$prefix}btn-box-shadow), var(--#{$prefix}btn-focus-box-shadow);\n    } @else {\n      box-shadow: var(--#{$prefix}btn-focus-box-shadow);\n    }\n  }\n\n  .btn-check:checked + &,\n  :not(.btn-check) + &:active,\n  &:first-child:active,\n  &.active,\n  &.show {\n    color: var(--#{$prefix}btn-active-color);\n    background-color: var(--#{$prefix}btn-active-bg);\n    // Remove CSS gradients if they're enabled\n    background-image: if($enable-gradients, none, null);\n    border-color: var(--#{$prefix}btn-active-border-color);\n    @include box-shadow(var(--#{$prefix}btn-active-shadow));\n\n    &:focus-visible {\n      // Avoid using mixin so we can pass custom focus shadow properly\n      @if $enable-shadows {\n        box-shadow: var(--#{$prefix}btn-active-shadow), var(--#{$prefix}btn-focus-box-shadow);\n      } @else {\n        box-shadow: var(--#{$prefix}btn-focus-box-shadow);\n      }\n    }\n  }\n\n  &:disabled,\n  &.disabled,\n  fieldset:disabled & {\n    color: var(--#{$prefix}btn-disabled-color);\n    pointer-events: none;\n    background-color: var(--#{$prefix}btn-disabled-bg);\n    background-image: if($enable-gradients, none, null);\n    border-color: var(--#{$prefix}btn-disabled-border-color);\n    opacity: var(--#{$prefix}btn-disabled-opacity);\n    @include box-shadow(none);\n  }\n}\n\n\n//\n// Alternate buttons\n//\n\n// scss-docs-start btn-variant-loops\n@each $color, $value in $theme-colors {\n  .btn-#{$color} {\n    @if $color == \"light\" {\n      @include button-variant(\n        $value,\n        $value,\n        $hover-background: shade-color($value, $btn-hover-bg-shade-amount),\n        $hover-border: shade-color($value, $btn-hover-border-shade-amount),\n        $active-background: shade-color($value, $btn-active-bg-shade-amount),\n        $active-border: shade-color($value, $btn-active-border-shade-amount)\n      );\n    } @else if $color == \"dark\" {\n      @include button-variant(\n        $value,\n        $value,\n        $hover-background: tint-color($value, $btn-hover-bg-tint-amount),\n        $hover-border: tint-color($value, $btn-hover-border-tint-amount),\n        $active-background: tint-color($value, $btn-active-bg-tint-amount),\n        $active-border: tint-color($value, $btn-active-border-tint-amount)\n      );\n    } @else {\n      @include button-variant($value, $value);\n    }\n  }\n}\n\n@each $color, $value in $theme-colors {\n  .btn-outline-#{$color} {\n    @include button-outline-variant($value);\n  }\n}\n// scss-docs-end btn-variant-loops\n\n\n//\n// Link buttons\n//\n\n// Make a button look and behave like a link\n.btn-link {\n  --#{$prefix}btn-font-weight: #{$font-weight-normal};\n  --#{$prefix}btn-color: #{$btn-link-color};\n  --#{$prefix}btn-bg: transparent;\n  --#{$prefix}btn-border-color: transparent;\n  --#{$prefix}btn-hover-color: #{$btn-link-hover-color};\n  --#{$prefix}btn-hover-border-color: transparent;\n  --#{$prefix}btn-active-color: #{$btn-link-hover-color};\n  --#{$prefix}btn-active-border-color: transparent;\n  --#{$prefix}btn-disabled-color: #{$btn-link-disabled-color};\n  --#{$prefix}btn-disabled-border-color: transparent;\n  --#{$prefix}btn-box-shadow: 0 0 0 #000; // Can't use `none` as keyword negates all values when used with multiple shadows\n  --#{$prefix}btn-focus-shadow-rgb: #{$btn-link-focus-shadow-rgb};\n\n  text-decoration: $link-decoration;\n  @if $enable-gradients {\n    background-image: none;\n  }\n\n  &:hover,\n  &:focus-visible {\n    text-decoration: $link-hover-decoration;\n  }\n\n  &:focus-visible {\n    color: var(--#{$prefix}btn-color);\n  }\n\n  &:hover {\n    color: var(--#{$prefix}btn-hover-color);\n  }\n\n  // No need for an active state here\n}\n\n\n//\n// Button Sizes\n//\n\n.btn-lg {\n  @include button-size($btn-padding-y-lg, $btn-padding-x-lg, $btn-font-size-lg, $btn-border-radius-lg);\n}\n\n.btn-sm {\n  @include button-size($btn-padding-y-sm, $btn-padding-x-sm, $btn-font-size-sm, $btn-border-radius-sm);\n}\n","// Button variants\n//\n// Easily pump out default styles, as well as :hover, :focus, :active,\n// and disabled options for all buttons\n\n// scss-docs-start btn-variant-mixin\n@mixin button-variant(\n  $background,\n  $border,\n  $color: color-contrast($background),\n  $hover-background: if($color == $color-contrast-light, shade-color($background, $btn-hover-bg-shade-amount), tint-color($background, $btn-hover-bg-tint-amount)),\n  $hover-border: if($color == $color-contrast-light, shade-color($border, $btn-hover-border-shade-amount), tint-color($border, $btn-hover-border-tint-amount)),\n  $hover-color: color-contrast($hover-background),\n  $active-background: if($color == $color-contrast-light, shade-color($background, $btn-active-bg-shade-amount), tint-color($background, $btn-active-bg-tint-amount)),\n  $active-border: if($color == $color-contrast-light, shade-color($border, $btn-active-border-shade-amount), tint-color($border, $btn-active-border-tint-amount)),\n  $active-color: color-contrast($active-background),\n  $disabled-background: $background,\n  $disabled-border: $border,\n  $disabled-color: color-contrast($disabled-background)\n) {\n  --#{$prefix}btn-color: #{$color};\n  --#{$prefix}btn-bg: #{$background};\n  --#{$prefix}btn-border-color: #{$border};\n  --#{$prefix}btn-hover-color: #{$hover-color};\n  --#{$prefix}btn-hover-bg: #{$hover-background};\n  --#{$prefix}btn-hover-border-color: #{$hover-border};\n  --#{$prefix}btn-focus-shadow-rgb: #{to-rgb(mix($color, $border, 15%))};\n  --#{$prefix}btn-active-color: #{$active-color};\n  --#{$prefix}btn-active-bg: #{$active-background};\n  --#{$prefix}btn-active-border-color: #{$active-border};\n  --#{$prefix}btn-active-shadow: #{$btn-active-box-shadow};\n  --#{$prefix}btn-disabled-color: #{$disabled-color};\n  --#{$prefix}btn-disabled-bg: #{$disabled-background};\n  --#{$prefix}btn-disabled-border-color: #{$disabled-border};\n}\n// scss-docs-end btn-variant-mixin\n\n// scss-docs-start btn-outline-variant-mixin\n@mixin button-outline-variant(\n  $color,\n  $color-hover: color-contrast($color),\n  $active-background: $color,\n  $active-border: $color,\n  $active-color: color-contrast($active-background)\n) {\n  --#{$prefix}btn-color: #{$color};\n  --#{$prefix}btn-border-color: #{$color};\n  --#{$prefix}btn-hover-color: #{$color-hover};\n  --#{$prefix}btn-hover-bg: #{$active-background};\n  --#{$prefix}btn-hover-border-color: #{$active-border};\n  --#{$prefix}btn-focus-shadow-rgb: #{to-rgb($color)};\n  --#{$prefix}btn-active-color: #{$active-color};\n  --#{$prefix}btn-active-bg: #{$active-background};\n  --#{$prefix}btn-active-border-color: #{$active-border};\n  --#{$prefix}btn-active-shadow: #{$btn-active-box-shadow};\n  --#{$prefix}btn-disabled-color: #{$color};\n  --#{$prefix}btn-disabled-bg: transparent;\n  --#{$prefix}btn-disabled-border-color: #{$color};\n  --#{$prefix}gradient: none;\n}\n// scss-docs-end btn-outline-variant-mixin\n\n// scss-docs-start btn-size-mixin\n@mixin button-size($padding-y, $padding-x, $font-size, $border-radius) {\n  --#{$prefix}btn-padding-y: #{$padding-y};\n  --#{$prefix}btn-padding-x: #{$padding-x};\n  @include rfs($font-size, --#{$prefix}btn-font-size);\n  --#{$prefix}btn-border-radius: #{$border-radius};\n}\n// scss-docs-end btn-size-mixin\n",".fade {\n  @include transition($transition-fade);\n\n  &:not(.show) {\n    opacity: 0;\n  }\n}\n\n// scss-docs-start collapse-classes\n.collapse {\n  &:not(.show) {\n    display: none;\n  }\n}\n\n.collapsing {\n  height: 0;\n  overflow: hidden;\n  @include transition($transition-collapse);\n\n  &.collapse-horizontal {\n    width: 0;\n    height: auto;\n    @include transition($transition-collapse-width);\n  }\n}\n// scss-docs-end collapse-classes\n","// The dropdown wrapper (`<div>`)\n.dropup,\n.dropend,\n.dropdown,\n.dropstart,\n.dropup-center,\n.dropdown-center {\n  position: relative;\n}\n\n.dropdown-toggle {\n  white-space: nowrap;\n\n  // Generate the caret automatically\n  @include caret();\n}\n\n// The dropdown menu\n.dropdown-menu {\n  // scss-docs-start dropdown-css-vars\n  --#{$prefix}dropdown-zindex: #{$zindex-dropdown};\n  --#{$prefix}dropdown-min-width: #{$dropdown-min-width};\n  --#{$prefix}dropdown-padding-x: #{$dropdown-padding-x};\n  --#{$prefix}dropdown-padding-y: #{$dropdown-padding-y};\n  --#{$prefix}dropdown-spacer: #{$dropdown-spacer};\n  @include rfs($dropdown-font-size, --#{$prefix}dropdown-font-size);\n  --#{$prefix}dropdown-color: #{$dropdown-color};\n  --#{$prefix}dropdown-bg: #{$dropdown-bg};\n  --#{$prefix}dropdown-border-color: #{$dropdown-border-color};\n  --#{$prefix}dropdown-border-radius: #{$dropdown-border-radius};\n  --#{$prefix}dropdown-border-width: #{$dropdown-border-width};\n  --#{$prefix}dropdown-inner-border-radius: #{$dropdown-inner-border-radius};\n  --#{$prefix}dropdown-divider-bg: #{$dropdown-divider-bg};\n  --#{$prefix}dropdown-divider-margin-y: #{$dropdown-divider-margin-y};\n  --#{$prefix}dropdown-box-shadow: #{$dropdown-box-shadow};\n  --#{$prefix}dropdown-link-color: #{$dropdown-link-color};\n  --#{$prefix}dropdown-link-hover-color: #{$dropdown-link-hover-color};\n  --#{$prefix}dropdown-link-hover-bg: #{$dropdown-link-hover-bg};\n  --#{$prefix}dropdown-link-active-color: #{$dropdown-link-active-color};\n  --#{$prefix}dropdown-link-active-bg: #{$dropdown-link-active-bg};\n  --#{$prefix}dropdown-link-disabled-color: #{$dropdown-link-disabled-color};\n  --#{$prefix}dropdown-item-padding-x: #{$dropdown-item-padding-x};\n  --#{$prefix}dropdown-item-padding-y: #{$dropdown-item-padding-y};\n  --#{$prefix}dropdown-header-color: #{$dropdown-header-color};\n  --#{$prefix}dropdown-header-padding-x: #{$dropdown-header-padding-x};\n  --#{$prefix}dropdown-header-padding-y: #{$dropdown-header-padding-y};\n  // scss-docs-end dropdown-css-vars\n\n  position: absolute;\n  z-index: var(--#{$prefix}dropdown-zindex);\n  display: none; // none by default, but block on \"open\" of the menu\n  min-width: var(--#{$prefix}dropdown-min-width);\n  padding: var(--#{$prefix}dropdown-padding-y) var(--#{$prefix}dropdown-padding-x);\n  margin: 0; // Override default margin of ul\n  @include font-size(var(--#{$prefix}dropdown-font-size));\n  color: var(--#{$prefix}dropdown-color);\n  text-align: left; // Ensures proper alignment if parent has it changed (e.g., modal footer)\n  list-style: none;\n  background-color: var(--#{$prefix}dropdown-bg);\n  background-clip: padding-box;\n  border: var(--#{$prefix}dropdown-border-width) solid var(--#{$prefix}dropdown-border-color);\n  @include border-radius(var(--#{$prefix}dropdown-border-radius));\n  @include box-shadow(var(--#{$prefix}dropdown-box-shadow));\n\n  &[data-bs-popper] {\n    top: 100%;\n    left: 0;\n    margin-top: var(--#{$prefix}dropdown-spacer);\n  }\n\n  @if $dropdown-padding-y == 0 {\n    > .dropdown-item:first-child,\n    > li:first-child .dropdown-item {\n      @include border-top-radius(var(--#{$prefix}dropdown-inner-border-radius));\n    }\n    > .dropdown-item:last-child,\n    > li:last-child .dropdown-item {\n      @include border-bottom-radius(var(--#{$prefix}dropdown-inner-border-radius));\n    }\n\n  }\n}\n\n// scss-docs-start responsive-breakpoints\n// We deliberately hardcode the `bs-` prefix because we check\n// this custom property in JS to determine Popper's positioning\n\n@each $breakpoint in map-keys($grid-breakpoints) {\n  @include media-breakpoint-up($breakpoint) {\n    $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n    .dropdown-menu#{$infix}-start {\n      --bs-position: start;\n\n      &[data-bs-popper] {\n        right: auto;\n        left: 0;\n      }\n    }\n\n    .dropdown-menu#{$infix}-end {\n      --bs-position: end;\n\n      &[data-bs-popper] {\n        right: 0;\n        left: auto;\n      }\n    }\n  }\n}\n// scss-docs-end responsive-breakpoints\n\n// Allow for dropdowns to go bottom up (aka, dropup-menu)\n// Just add .dropup after the standard .dropdown class and you're set.\n.dropup {\n  .dropdown-menu[data-bs-popper] {\n    top: auto;\n    bottom: 100%;\n    margin-top: 0;\n    margin-bottom: var(--#{$prefix}dropdown-spacer);\n  }\n\n  .dropdown-toggle {\n    @include caret(up);\n  }\n}\n\n.dropend {\n  .dropdown-menu[data-bs-popper] {\n    top: 0;\n    right: auto;\n    left: 100%;\n    margin-top: 0;\n    margin-left: var(--#{$prefix}dropdown-spacer);\n  }\n\n  .dropdown-toggle {\n    @include caret(end);\n    &::after {\n      vertical-align: 0;\n    }\n  }\n}\n\n.dropstart {\n  .dropdown-menu[data-bs-popper] {\n    top: 0;\n    right: 100%;\n    left: auto;\n    margin-top: 0;\n    margin-right: var(--#{$prefix}dropdown-spacer);\n  }\n\n  .dropdown-toggle {\n    @include caret(start);\n    &::before {\n      vertical-align: 0;\n    }\n  }\n}\n\n\n// Dividers (basically an `<hr>`) within the dropdown\n.dropdown-divider {\n  height: 0;\n  margin: var(--#{$prefix}dropdown-divider-margin-y) 0;\n  overflow: hidden;\n  border-top: 1px solid var(--#{$prefix}dropdown-divider-bg);\n  opacity: 1; // Revisit in v6 to de-dupe styles that conflict with <hr> element\n}\n\n// Links, buttons, and more within the dropdown menu\n//\n// `<button>`-specific styles are denoted with `// For <button>s`\n.dropdown-item {\n  display: block;\n  width: 100%; // For `<button>`s\n  padding: var(--#{$prefix}dropdown-item-padding-y) var(--#{$prefix}dropdown-item-padding-x);\n  clear: both;\n  font-weight: $font-weight-normal;\n  color: var(--#{$prefix}dropdown-link-color);\n  text-align: inherit; // For `<button>`s\n  text-decoration: if($link-decoration == none, null, none);\n  white-space: nowrap; // prevent links from randomly breaking onto new lines\n  background-color: transparent; // For `<button>`s\n  border: 0; // For `<button>`s\n  @include border-radius(var(--#{$prefix}dropdown-item-border-radius, 0));\n\n  &:hover,\n  &:focus {\n    color: var(--#{$prefix}dropdown-link-hover-color);\n    text-decoration: if($link-hover-decoration == underline, none, null);\n    @include gradient-bg(var(--#{$prefix}dropdown-link-hover-bg));\n  }\n\n  &.active,\n  &:active {\n    color: var(--#{$prefix}dropdown-link-active-color);\n    text-decoration: none;\n    @include gradient-bg(var(--#{$prefix}dropdown-link-active-bg));\n  }\n\n  &.disabled,\n  &:disabled {\n    color: var(--#{$prefix}dropdown-link-disabled-color);\n    pointer-events: none;\n    background-color: transparent;\n    // Remove CSS gradients if they're enabled\n    background-image: if($enable-gradients, none, null);\n  }\n}\n\n.dropdown-menu.show {\n  display: block;\n}\n\n// Dropdown section headers\n.dropdown-header {\n  display: block;\n  padding: var(--#{$prefix}dropdown-header-padding-y) var(--#{$prefix}dropdown-header-padding-x);\n  margin-bottom: 0; // for use with heading elements\n  @include font-size($font-size-sm);\n  color: var(--#{$prefix}dropdown-header-color);\n  white-space: nowrap; // as with > li > a\n}\n\n// Dropdown text\n.dropdown-item-text {\n  display: block;\n  padding: var(--#{$prefix}dropdown-item-padding-y) var(--#{$prefix}dropdown-item-padding-x);\n  color: var(--#{$prefix}dropdown-link-color);\n}\n\n// Dark dropdowns\n.dropdown-menu-dark {\n  // scss-docs-start dropdown-dark-css-vars\n  --#{$prefix}dropdown-color: #{$dropdown-dark-color};\n  --#{$prefix}dropdown-bg: #{$dropdown-dark-bg};\n  --#{$prefix}dropdown-border-color: #{$dropdown-dark-border-color};\n  --#{$prefix}dropdown-box-shadow: #{$dropdown-dark-box-shadow};\n  --#{$prefix}dropdown-link-color: #{$dropdown-dark-link-color};\n  --#{$prefix}dropdown-link-hover-color: #{$dropdown-dark-link-hover-color};\n  --#{$prefix}dropdown-divider-bg: #{$dropdown-dark-divider-bg};\n  --#{$prefix}dropdown-link-hover-bg: #{$dropdown-dark-link-hover-bg};\n  --#{$prefix}dropdown-link-active-color: #{$dropdown-dark-link-active-color};\n  --#{$prefix}dropdown-link-active-bg: #{$dropdown-dark-link-active-bg};\n  --#{$prefix}dropdown-link-disabled-color: #{$dropdown-dark-link-disabled-color};\n  --#{$prefix}dropdown-header-color: #{$dropdown-dark-header-color};\n  // scss-docs-end dropdown-dark-css-vars\n}\n","// scss-docs-start caret-mixins\n@mixin caret-down($width: $caret-width) {\n  border-top: $width solid;\n  border-right: $width solid transparent;\n  border-bottom: 0;\n  border-left: $width solid transparent;\n}\n\n@mixin caret-up($width: $caret-width) {\n  border-top: 0;\n  border-right: $width solid transparent;\n  border-bottom: $width solid;\n  border-left: $width solid transparent;\n}\n\n@mixin caret-end($width: $caret-width) {\n  border-top: $width solid transparent;\n  border-right: 0;\n  border-bottom: $width solid transparent;\n  border-left: $width solid;\n}\n\n@mixin caret-start($width: $caret-width) {\n  border-top: $width solid transparent;\n  border-right: $width solid;\n  border-bottom: $width solid transparent;\n}\n\n@mixin caret(\n  $direction: down,\n  $width: $caret-width,\n  $spacing: $caret-spacing,\n  $vertical-align: $caret-vertical-align\n) {\n  @if $enable-caret {\n    &::after {\n      display: inline-block;\n      margin-left: $spacing;\n      vertical-align: $vertical-align;\n      content: \"\";\n      @if $direction == down {\n        @include caret-down($width);\n      } @else if $direction == up {\n        @include caret-up($width);\n      } @else if $direction == end {\n        @include caret-end($width);\n      }\n    }\n\n    @if $direction == start {\n      &::after {\n        display: none;\n      }\n\n      &::before {\n        display: inline-block;\n        margin-right: $spacing;\n        vertical-align: $vertical-align;\n        content: \"\";\n        @include caret-start($width);\n      }\n    }\n\n    &:empty::after {\n      margin-left: 0;\n    }\n  }\n}\n// scss-docs-end caret-mixins\n","// Make the div behave like a button\n.btn-group,\n.btn-group-vertical {\n  position: relative;\n  display: inline-flex;\n  vertical-align: middle; // match .btn alignment given font-size hack above\n\n  > .btn {\n    position: relative;\n    flex: 1 1 auto;\n  }\n\n  // Bring the hover, focused, and \"active\" buttons to the front to overlay\n  // the borders properly\n  > .btn-check:checked + .btn,\n  > .btn-check:focus + .btn,\n  > .btn:hover,\n  > .btn:focus,\n  > .btn:active,\n  > .btn.active {\n    z-index: 1;\n  }\n}\n\n// Optional: Group multiple button groups together for a toolbar\n.btn-toolbar {\n  display: flex;\n  flex-wrap: wrap;\n  justify-content: flex-start;\n\n  .input-group {\n    width: auto;\n  }\n}\n\n.btn-group {\n  @include border-radius($btn-border-radius);\n\n  // Prevent double borders when buttons are next to each other\n  > :not(.btn-check:first-child) + .btn,\n  > .btn-group:not(:first-child) {\n    margin-left: calc(#{$btn-border-width} * -1); // stylelint-disable-line function-disallowed-list\n  }\n\n  // Reset rounded corners\n  > .btn:not(:last-child):not(.dropdown-toggle),\n  > .btn.dropdown-toggle-split:first-child,\n  > .btn-group:not(:last-child) > .btn {\n    @include border-end-radius(0);\n  }\n\n  // The left radius should be 0 if the button is:\n  // - the \"third or more\" child\n  // - the second child and the previous element isn't `.btn-check` (making it the first child visually)\n  // - part of a btn-group which isn't the first child\n  > .btn:nth-child(n + 3),\n  > :not(.btn-check) + .btn,\n  > .btn-group:not(:first-child) > .btn {\n    @include border-start-radius(0);\n  }\n}\n\n// Sizing\n//\n// Remix the default button sizing classes into new ones for easier manipulation.\n\n.btn-group-sm > .btn { @extend .btn-sm; }\n.btn-group-lg > .btn { @extend .btn-lg; }\n\n\n//\n// Split button dropdowns\n//\n\n.dropdown-toggle-split {\n  padding-right: $btn-padding-x * .75;\n  padding-left: $btn-padding-x * .75;\n\n  &::after,\n  .dropup &::after,\n  .dropend &::after {\n    margin-left: 0;\n  }\n\n  .dropstart &::before {\n    margin-right: 0;\n  }\n}\n\n.btn-sm + .dropdown-toggle-split {\n  padding-right: $btn-padding-x-sm * .75;\n  padding-left: $btn-padding-x-sm * .75;\n}\n\n.btn-lg + .dropdown-toggle-split {\n  padding-right: $btn-padding-x-lg * .75;\n  padding-left: $btn-padding-x-lg * .75;\n}\n\n\n// The clickable button for toggling the menu\n// Set the same inset shadow as the :active state\n.btn-group.show .dropdown-toggle {\n  @include box-shadow($btn-active-box-shadow);\n\n  // Show no shadow for `.btn-link` since it has no other button styles.\n  &.btn-link {\n    @include box-shadow(none);\n  }\n}\n\n\n//\n// Vertical button groups\n//\n\n.btn-group-vertical {\n  flex-direction: column;\n  align-items: flex-start;\n  justify-content: center;\n\n  > .btn,\n  > .btn-group {\n    width: 100%;\n  }\n\n  > .btn:not(:first-child),\n  > .btn-group:not(:first-child) {\n    margin-top: calc(#{$btn-border-width} * -1); // stylelint-disable-line function-disallowed-list\n  }\n\n  // Reset rounded corners\n  > .btn:not(:last-child):not(.dropdown-toggle),\n  > .btn-group:not(:last-child) > .btn {\n    @include border-bottom-radius(0);\n  }\n\n  > .btn ~ .btn,\n  > .btn-group:not(:first-child) > .btn {\n    @include border-top-radius(0);\n  }\n}\n","// Base class\n//\n// Kickstart any navigation component with a set of style resets. Works with\n// `<nav>`s, `<ul>`s or `<ol>`s.\n\n.nav {\n  // scss-docs-start nav-css-vars\n  --#{$prefix}nav-link-padding-x: #{$nav-link-padding-x};\n  --#{$prefix}nav-link-padding-y: #{$nav-link-padding-y};\n  @include rfs($nav-link-font-size, --#{$prefix}nav-link-font-size);\n  --#{$prefix}nav-link-font-weight: #{$nav-link-font-weight};\n  --#{$prefix}nav-link-color: #{$nav-link-color};\n  --#{$prefix}nav-link-hover-color: #{$nav-link-hover-color};\n  --#{$prefix}nav-link-disabled-color: #{$nav-link-disabled-color};\n  // scss-docs-end nav-css-vars\n\n  display: flex;\n  flex-wrap: wrap;\n  padding-left: 0;\n  margin-bottom: 0;\n  list-style: none;\n}\n\n.nav-link {\n  display: block;\n  padding: var(--#{$prefix}nav-link-padding-y) var(--#{$prefix}nav-link-padding-x);\n  @include font-size(var(--#{$prefix}nav-link-font-size));\n  font-weight: var(--#{$prefix}nav-link-font-weight);\n  color: var(--#{$prefix}nav-link-color);\n  text-decoration: if($link-decoration == none, null, none);\n  background: none;\n  border: 0;\n  @include transition($nav-link-transition);\n\n  &:hover,\n  &:focus {\n    color: var(--#{$prefix}nav-link-hover-color);\n    text-decoration: if($link-hover-decoration == underline, none, null);\n  }\n\n  &:focus-visible {\n    outline: 0;\n    box-shadow: $nav-link-focus-box-shadow;\n  }\n\n  // Disabled state lightens text\n  &.disabled,\n  &:disabled {\n    color: var(--#{$prefix}nav-link-disabled-color);\n    pointer-events: none;\n    cursor: default;\n  }\n}\n\n//\n// Tabs\n//\n\n.nav-tabs {\n  // scss-docs-start nav-tabs-css-vars\n  --#{$prefix}nav-tabs-border-width: #{$nav-tabs-border-width};\n  --#{$prefix}nav-tabs-border-color: #{$nav-tabs-border-color};\n  --#{$prefix}nav-tabs-border-radius: #{$nav-tabs-border-radius};\n  --#{$prefix}nav-tabs-link-hover-border-color: #{$nav-tabs-link-hover-border-color};\n  --#{$prefix}nav-tabs-link-active-color: #{$nav-tabs-link-active-color};\n  --#{$prefix}nav-tabs-link-active-bg: #{$nav-tabs-link-active-bg};\n  --#{$prefix}nav-tabs-link-active-border-color: #{$nav-tabs-link-active-border-color};\n  // scss-docs-end nav-tabs-css-vars\n\n  border-bottom: var(--#{$prefix}nav-tabs-border-width) solid var(--#{$prefix}nav-tabs-border-color);\n\n  .nav-link {\n    margin-bottom: calc(-1 * var(--#{$prefix}nav-tabs-border-width)); // stylelint-disable-line function-disallowed-list\n    border: var(--#{$prefix}nav-tabs-border-width) solid transparent;\n    @include border-top-radius(var(--#{$prefix}nav-tabs-border-radius));\n\n    &:hover,\n    &:focus {\n      // Prevents active .nav-link tab overlapping focus outline of previous/next .nav-link\n      isolation: isolate;\n      border-color: var(--#{$prefix}nav-tabs-link-hover-border-color);\n    }\n  }\n\n  .nav-link.active,\n  .nav-item.show .nav-link {\n    color: var(--#{$prefix}nav-tabs-link-active-color);\n    background-color: var(--#{$prefix}nav-tabs-link-active-bg);\n    border-color: var(--#{$prefix}nav-tabs-link-active-border-color);\n  }\n\n  .dropdown-menu {\n    // Make dropdown border overlap tab border\n    margin-top: calc(-1 * var(--#{$prefix}nav-tabs-border-width)); // stylelint-disable-line function-disallowed-list\n    // Remove the top rounded corners here since there is a hard edge above the menu\n    @include border-top-radius(0);\n  }\n}\n\n\n//\n// Pills\n//\n\n.nav-pills {\n  // scss-docs-start nav-pills-css-vars\n  --#{$prefix}nav-pills-border-radius: #{$nav-pills-border-radius};\n  --#{$prefix}nav-pills-link-active-color: #{$nav-pills-link-active-color};\n  --#{$prefix}nav-pills-link-active-bg: #{$nav-pills-link-active-bg};\n  // scss-docs-end nav-pills-css-vars\n\n  .nav-link {\n    @include border-radius(var(--#{$prefix}nav-pills-border-radius));\n  }\n\n  .nav-link.active,\n  .show > .nav-link {\n    color: var(--#{$prefix}nav-pills-link-active-color);\n    @include gradient-bg(var(--#{$prefix}nav-pills-link-active-bg));\n  }\n}\n\n\n//\n// Underline\n//\n\n.nav-underline {\n  // scss-docs-start nav-underline-css-vars\n  --#{$prefix}nav-underline-gap: #{$nav-underline-gap};\n  --#{$prefix}nav-underline-border-width: #{$nav-underline-border-width};\n  --#{$prefix}nav-underline-link-active-color: #{$nav-underline-link-active-color};\n  // scss-docs-end nav-underline-css-vars\n\n  gap: var(--#{$prefix}nav-underline-gap);\n\n  .nav-link {\n    padding-right: 0;\n    padding-left: 0;\n    border-bottom: var(--#{$prefix}nav-underline-border-width) solid transparent;\n\n    &:hover,\n    &:focus {\n      border-bottom-color: currentcolor;\n    }\n  }\n\n  .nav-link.active,\n  .show > .nav-link {\n    font-weight: $font-weight-bold;\n    color: var(--#{$prefix}nav-underline-link-active-color);\n    border-bottom-color: currentcolor;\n  }\n}\n\n\n//\n// Justified variants\n//\n\n.nav-fill {\n  > .nav-link,\n  .nav-item {\n    flex: 1 1 auto;\n    text-align: center;\n  }\n}\n\n.nav-justified {\n  > .nav-link,\n  .nav-item {\n    flex-basis: 0;\n    flex-grow: 1;\n    text-align: center;\n  }\n}\n\n.nav-fill,\n.nav-justified {\n  .nav-item .nav-link {\n    width: 100%; // Make sure button will grow\n  }\n}\n\n\n// Tabbable tabs\n//\n// Hide tabbable panes to start, show them when `.active`\n\n.tab-content {\n  > .tab-pane {\n    display: none;\n  }\n  > .active {\n    display: block;\n  }\n}\n","// Navbar\n//\n// Provide a static navbar from which we expand to create full-width, fixed, and\n// other navbar variations.\n\n.navbar {\n  // scss-docs-start navbar-css-vars\n  --#{$prefix}navbar-padding-x: #{if($navbar-padding-x == null, 0, $navbar-padding-x)};\n  --#{$prefix}navbar-padding-y: #{$navbar-padding-y};\n  --#{$prefix}navbar-color: #{$navbar-light-color};\n  --#{$prefix}navbar-hover-color: #{$navbar-light-hover-color};\n  --#{$prefix}navbar-disabled-color: #{$navbar-light-disabled-color};\n  --#{$prefix}navbar-active-color: #{$navbar-light-active-color};\n  --#{$prefix}navbar-brand-padding-y: #{$navbar-brand-padding-y};\n  --#{$prefix}navbar-brand-margin-end: #{$navbar-brand-margin-end};\n  --#{$prefix}navbar-brand-font-size: #{$navbar-brand-font-size};\n  --#{$prefix}navbar-brand-color: #{$navbar-light-brand-color};\n  --#{$prefix}navbar-brand-hover-color: #{$navbar-light-brand-hover-color};\n  --#{$prefix}navbar-nav-link-padding-x: #{$navbar-nav-link-padding-x};\n  --#{$prefix}navbar-toggler-padding-y: #{$navbar-toggler-padding-y};\n  --#{$prefix}navbar-toggler-padding-x: #{$navbar-toggler-padding-x};\n  --#{$prefix}navbar-toggler-font-size: #{$navbar-toggler-font-size};\n  --#{$prefix}navbar-toggler-icon-bg: #{escape-svg($navbar-light-toggler-icon-bg)};\n  --#{$prefix}navbar-toggler-border-color: #{$navbar-light-toggler-border-color};\n  --#{$prefix}navbar-toggler-border-radius: #{$navbar-toggler-border-radius};\n  --#{$prefix}navbar-toggler-focus-width: #{$navbar-toggler-focus-width};\n  --#{$prefix}navbar-toggler-transition: #{$navbar-toggler-transition};\n  // scss-docs-end navbar-css-vars\n\n  position: relative;\n  display: flex;\n  flex-wrap: wrap; // allow us to do the line break for collapsing content\n  align-items: center;\n  justify-content: space-between; // space out brand from logo\n  padding: var(--#{$prefix}navbar-padding-y) var(--#{$prefix}navbar-padding-x);\n  @include gradient-bg();\n\n  // Because flex properties aren't inherited, we need to redeclare these first\n  // few properties so that content nested within behave properly.\n  // The `flex-wrap` property is inherited to simplify the expanded navbars\n  %container-flex-properties {\n    display: flex;\n    flex-wrap: inherit;\n    align-items: center;\n    justify-content: space-between;\n  }\n\n  > .container,\n  > .container-fluid {\n    @extend %container-flex-properties;\n  }\n\n  @each $breakpoint, $container-max-width in $container-max-widths {\n    > .container#{breakpoint-infix($breakpoint, $container-max-widths)} {\n      @extend %container-flex-properties;\n    }\n  }\n}\n\n\n// Navbar brand\n//\n// Used for brand, project, or site names.\n\n.navbar-brand {\n  padding-top: var(--#{$prefix}navbar-brand-padding-y);\n  padding-bottom: var(--#{$prefix}navbar-brand-padding-y);\n  margin-right: var(--#{$prefix}navbar-brand-margin-end);\n  @include font-size(var(--#{$prefix}navbar-brand-font-size));\n  color: var(--#{$prefix}navbar-brand-color);\n  text-decoration: if($link-decoration == none, null, none);\n  white-space: nowrap;\n\n  &:hover,\n  &:focus {\n    color: var(--#{$prefix}navbar-brand-hover-color);\n    text-decoration: if($link-hover-decoration == underline, none, null);\n  }\n}\n\n\n// Navbar nav\n//\n// Custom navbar navigation (doesn't require `.nav`, but does make use of `.nav-link`).\n\n.navbar-nav {\n  // scss-docs-start navbar-nav-css-vars\n  --#{$prefix}nav-link-padding-x: 0;\n  --#{$prefix}nav-link-padding-y: #{$nav-link-padding-y};\n  @include rfs($nav-link-font-size, --#{$prefix}nav-link-font-size);\n  --#{$prefix}nav-link-font-weight: #{$nav-link-font-weight};\n  --#{$prefix}nav-link-color: var(--#{$prefix}navbar-color);\n  --#{$prefix}nav-link-hover-color: var(--#{$prefix}navbar-hover-color);\n  --#{$prefix}nav-link-disabled-color: var(--#{$prefix}navbar-disabled-color);\n  // scss-docs-end navbar-nav-css-vars\n\n  display: flex;\n  flex-direction: column; // cannot use `inherit` to get the `.navbar`s value\n  padding-left: 0;\n  margin-bottom: 0;\n  list-style: none;\n\n  .nav-link {\n    &.active,\n    &.show {\n      color: var(--#{$prefix}navbar-active-color);\n    }\n  }\n\n  .dropdown-menu {\n    position: static;\n  }\n}\n\n\n// Navbar text\n//\n//\n\n.navbar-text {\n  padding-top: $nav-link-padding-y;\n  padding-bottom: $nav-link-padding-y;\n  color: var(--#{$prefix}navbar-color);\n\n  a,\n  a:hover,\n  a:focus  {\n    color: var(--#{$prefix}navbar-active-color);\n  }\n}\n\n\n// Responsive navbar\n//\n// Custom styles for responsive collapsing and toggling of navbar contents.\n// Powered by the collapse Bootstrap JavaScript plugin.\n\n// When collapsed, prevent the toggleable navbar contents from appearing in\n// the default flexbox row orientation. Requires the use of `flex-wrap: wrap`\n// on the `.navbar` parent.\n.navbar-collapse {\n  flex-basis: 100%;\n  flex-grow: 1;\n  // For always expanded or extra full navbars, ensure content aligns itself\n  // properly vertically. Can be easily overridden with flex utilities.\n  align-items: center;\n}\n\n// Button for toggling the navbar when in its collapsed state\n.navbar-toggler {\n  padding: var(--#{$prefix}navbar-toggler-padding-y) var(--#{$prefix}navbar-toggler-padding-x);\n  @include font-size(var(--#{$prefix}navbar-toggler-font-size));\n  line-height: 1;\n  color: var(--#{$prefix}navbar-color);\n  background-color: transparent; // remove default button style\n  border: var(--#{$prefix}border-width) solid var(--#{$prefix}navbar-toggler-border-color); // remove default button style\n  @include border-radius(var(--#{$prefix}navbar-toggler-border-radius));\n  @include transition(var(--#{$prefix}navbar-toggler-transition));\n\n  &:hover {\n    text-decoration: none;\n  }\n\n  &:focus {\n    text-decoration: none;\n    outline: 0;\n    box-shadow: 0 0 0 var(--#{$prefix}navbar-toggler-focus-width);\n  }\n}\n\n// Keep as a separate element so folks can easily override it with another icon\n// or image file as needed.\n.navbar-toggler-icon {\n  display: inline-block;\n  width: 1.5em;\n  height: 1.5em;\n  vertical-align: middle;\n  background-image: var(--#{$prefix}navbar-toggler-icon-bg);\n  background-repeat: no-repeat;\n  background-position: center;\n  background-size: 100%;\n}\n\n.navbar-nav-scroll {\n  max-height: var(--#{$prefix}scroll-height, 75vh);\n  overflow-y: auto;\n}\n\n// scss-docs-start navbar-expand-loop\n// Generate series of `.navbar-expand-*` responsive classes for configuring\n// where your navbar collapses.\n.navbar-expand {\n  @each $breakpoint in map-keys($grid-breakpoints) {\n    $next: breakpoint-next($breakpoint, $grid-breakpoints);\n    $infix: breakpoint-infix($next, $grid-breakpoints);\n\n    // stylelint-disable-next-line scss/selector-no-union-class-name\n    &#{$infix} {\n      @include media-breakpoint-up($next) {\n        flex-wrap: nowrap;\n        justify-content: flex-start;\n\n        .navbar-nav {\n          flex-direction: row;\n\n          .dropdown-menu {\n            position: absolute;\n          }\n\n          .nav-link {\n            padding-right: var(--#{$prefix}navbar-nav-link-padding-x);\n            padding-left: var(--#{$prefix}navbar-nav-link-padding-x);\n          }\n        }\n\n        .navbar-nav-scroll {\n          overflow: visible;\n        }\n\n        .navbar-collapse {\n          display: flex !important; // stylelint-disable-line declaration-no-important\n          flex-basis: auto;\n        }\n\n        .navbar-toggler {\n          display: none;\n        }\n\n        .offcanvas {\n          // stylelint-disable declaration-no-important\n          position: static;\n          z-index: auto;\n          flex-grow: 1;\n          width: auto !important;\n          height: auto !important;\n          visibility: visible !important;\n          background-color: transparent !important;\n          border: 0 !important;\n          transform: none !important;\n          @include box-shadow(none);\n          @include transition(none);\n          // stylelint-enable declaration-no-important\n\n          .offcanvas-header {\n            display: none;\n          }\n\n          .offcanvas-body {\n            display: flex;\n            flex-grow: 0;\n            padding: 0;\n            overflow-y: visible;\n          }\n        }\n      }\n    }\n  }\n}\n// scss-docs-end navbar-expand-loop\n\n// Navbar themes\n//\n// Styles for switching between navbars with light or dark background.\n\n.navbar-light {\n  @include deprecate(\"`.navbar-light`\", \"v5.2.0\", \"v6.0.0\", true);\n}\n\n.navbar-dark,\n.navbar[data-bs-theme=\"dark\"] {\n  // scss-docs-start navbar-dark-css-vars\n  --#{$prefix}navbar-color: #{$navbar-dark-color};\n  --#{$prefix}navbar-hover-color: #{$navbar-dark-hover-color};\n  --#{$prefix}navbar-disabled-color: #{$navbar-dark-disabled-color};\n  --#{$prefix}navbar-active-color: #{$navbar-dark-active-color};\n  --#{$prefix}navbar-brand-color: #{$navbar-dark-brand-color};\n  --#{$prefix}navbar-brand-hover-color: #{$navbar-dark-brand-hover-color};\n  --#{$prefix}navbar-toggler-border-color: #{$navbar-dark-toggler-border-color};\n  --#{$prefix}navbar-toggler-icon-bg: #{escape-svg($navbar-dark-toggler-icon-bg)};\n  // scss-docs-end navbar-dark-css-vars\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    .navbar-toggler-icon {\n      --#{$prefix}navbar-toggler-icon-bg: #{escape-svg($navbar-dark-toggler-icon-bg)};\n    }\n  }\n}\n","//\n// Base styles\n//\n\n.card {\n  // scss-docs-start card-css-vars\n  --#{$prefix}card-spacer-y: #{$card-spacer-y};\n  --#{$prefix}card-spacer-x: #{$card-spacer-x};\n  --#{$prefix}card-title-spacer-y: #{$card-title-spacer-y};\n  --#{$prefix}card-title-color: #{$card-title-color};\n  --#{$prefix}card-subtitle-color: #{$card-subtitle-color};\n  --#{$prefix}card-border-width: #{$card-border-width};\n  --#{$prefix}card-border-color: #{$card-border-color};\n  --#{$prefix}card-border-radius: #{$card-border-radius};\n  --#{$prefix}card-box-shadow: #{$card-box-shadow};\n  --#{$prefix}card-inner-border-radius: #{$card-inner-border-radius};\n  --#{$prefix}card-cap-padding-y: #{$card-cap-padding-y};\n  --#{$prefix}card-cap-padding-x: #{$card-cap-padding-x};\n  --#{$prefix}card-cap-bg: #{$card-cap-bg};\n  --#{$prefix}card-cap-color: #{$card-cap-color};\n  --#{$prefix}card-height: #{$card-height};\n  --#{$prefix}card-color: #{$card-color};\n  --#{$prefix}card-bg: #{$card-bg};\n  --#{$prefix}card-img-overlay-padding: #{$card-img-overlay-padding};\n  --#{$prefix}card-group-margin: #{$card-group-margin};\n  // scss-docs-end card-css-vars\n\n  position: relative;\n  display: flex;\n  flex-direction: column;\n  min-width: 0; // See https://github.com/twbs/bootstrap/pull/22740#issuecomment-305868106\n  height: var(--#{$prefix}card-height);\n  color: var(--#{$prefix}body-color);\n  word-wrap: break-word;\n  background-color: var(--#{$prefix}card-bg);\n  background-clip: border-box;\n  border: var(--#{$prefix}card-border-width) solid var(--#{$prefix}card-border-color);\n  @include border-radius(var(--#{$prefix}card-border-radius));\n  @include box-shadow(var(--#{$prefix}card-box-shadow));\n\n  > hr {\n    margin-right: 0;\n    margin-left: 0;\n  }\n\n  > .list-group {\n    border-top: inherit;\n    border-bottom: inherit;\n\n    &:first-child {\n      border-top-width: 0;\n      @include border-top-radius(var(--#{$prefix}card-inner-border-radius));\n    }\n\n    &:last-child  {\n      border-bottom-width: 0;\n      @include border-bottom-radius(var(--#{$prefix}card-inner-border-radius));\n    }\n  }\n\n  // Due to specificity of the above selector (`.card > .list-group`), we must\n  // use a child selector here to prevent double borders.\n  > .card-header + .list-group,\n  > .list-group + .card-footer {\n    border-top: 0;\n  }\n}\n\n.card-body {\n  // Enable `flex-grow: 1` for decks and groups so that card blocks take up\n  // as much space as possible, ensuring footers are aligned to the bottom.\n  flex: 1 1 auto;\n  padding: var(--#{$prefix}card-spacer-y) var(--#{$prefix}card-spacer-x);\n  color: var(--#{$prefix}card-color);\n}\n\n.card-title {\n  margin-bottom: var(--#{$prefix}card-title-spacer-y);\n  color: var(--#{$prefix}card-title-color);\n}\n\n.card-subtitle {\n  margin-top: calc(-.5 * var(--#{$prefix}card-title-spacer-y)); // stylelint-disable-line function-disallowed-list\n  margin-bottom: 0;\n  color: var(--#{$prefix}card-subtitle-color);\n}\n\n.card-text:last-child {\n  margin-bottom: 0;\n}\n\n.card-link {\n  &:hover {\n    text-decoration: if($link-hover-decoration == underline, none, null);\n  }\n\n  + .card-link {\n    margin-left: var(--#{$prefix}card-spacer-x);\n  }\n}\n\n//\n// Optional textual caps\n//\n\n.card-header {\n  padding: var(--#{$prefix}card-cap-padding-y) var(--#{$prefix}card-cap-padding-x);\n  margin-bottom: 0; // Removes the default margin-bottom of <hN>\n  color: var(--#{$prefix}card-cap-color);\n  background-color: var(--#{$prefix}card-cap-bg);\n  border-bottom: var(--#{$prefix}card-border-width) solid var(--#{$prefix}card-border-color);\n\n  &:first-child {\n    @include border-radius(var(--#{$prefix}card-inner-border-radius) var(--#{$prefix}card-inner-border-radius) 0 0);\n  }\n}\n\n.card-footer {\n  padding: var(--#{$prefix}card-cap-padding-y) var(--#{$prefix}card-cap-padding-x);\n  color: var(--#{$prefix}card-cap-color);\n  background-color: var(--#{$prefix}card-cap-bg);\n  border-top: var(--#{$prefix}card-border-width) solid var(--#{$prefix}card-border-color);\n\n  &:last-child {\n    @include border-radius(0 0 var(--#{$prefix}card-inner-border-radius) var(--#{$prefix}card-inner-border-radius));\n  }\n}\n\n\n//\n// Header navs\n//\n\n.card-header-tabs {\n  margin-right: calc(-.5 * var(--#{$prefix}card-cap-padding-x)); // stylelint-disable-line function-disallowed-list\n  margin-bottom: calc(-1 * var(--#{$prefix}card-cap-padding-y)); // stylelint-disable-line function-disallowed-list\n  margin-left: calc(-.5 * var(--#{$prefix}card-cap-padding-x)); // stylelint-disable-line function-disallowed-list\n  border-bottom: 0;\n\n  .nav-link.active {\n    background-color: var(--#{$prefix}card-bg);\n    border-bottom-color: var(--#{$prefix}card-bg);\n  }\n}\n\n.card-header-pills {\n  margin-right: calc(-.5 * var(--#{$prefix}card-cap-padding-x)); // stylelint-disable-line function-disallowed-list\n  margin-left: calc(-.5 * var(--#{$prefix}card-cap-padding-x)); // stylelint-disable-line function-disallowed-list\n}\n\n// Card image\n.card-img-overlay {\n  position: absolute;\n  top: 0;\n  right: 0;\n  bottom: 0;\n  left: 0;\n  padding: var(--#{$prefix}card-img-overlay-padding);\n  @include border-radius(var(--#{$prefix}card-inner-border-radius));\n}\n\n.card-img,\n.card-img-top,\n.card-img-bottom {\n  width: 100%; // Required because we use flexbox and this inherently applies align-self: stretch\n}\n\n.card-img,\n.card-img-top {\n  @include border-top-radius(var(--#{$prefix}card-inner-border-radius));\n}\n\n.card-img,\n.card-img-bottom {\n  @include border-bottom-radius(var(--#{$prefix}card-inner-border-radius));\n}\n\n\n//\n// Card groups\n//\n\n.card-group {\n  // The child selector allows nested `.card` within `.card-group`\n  // to display properly.\n  > .card {\n    margin-bottom: var(--#{$prefix}card-group-margin);\n  }\n\n  @include media-breakpoint-up(sm) {\n    display: flex;\n    flex-flow: row wrap;\n    // The child selector allows nested `.card` within `.card-group`\n    // to display properly.\n    > .card {\n      // Flexbugs #4: https://github.com/philipwalton/flexbugs#flexbug-4\n      flex: 1 0 0%;\n      margin-bottom: 0;\n\n      + .card {\n        margin-left: 0;\n        border-left: 0;\n      }\n\n      // Handle rounded corners\n      @if $enable-rounded {\n        &:not(:last-child) {\n          @include border-end-radius(0);\n\n          .card-img-top,\n          .card-header {\n            // stylelint-disable-next-line property-disallowed-list\n            border-top-right-radius: 0;\n          }\n          .card-img-bottom,\n          .card-footer {\n            // stylelint-disable-next-line property-disallowed-list\n            border-bottom-right-radius: 0;\n          }\n        }\n\n        &:not(:first-child) {\n          @include border-start-radius(0);\n\n          .card-img-top,\n          .card-header {\n            // stylelint-disable-next-line property-disallowed-list\n            border-top-left-radius: 0;\n          }\n          .card-img-bottom,\n          .card-footer {\n            // stylelint-disable-next-line property-disallowed-list\n            border-bottom-left-radius: 0;\n          }\n        }\n      }\n    }\n  }\n}\n","//\n// Base styles\n//\n\n.accordion {\n  // scss-docs-start accordion-css-vars\n  --#{$prefix}accordion-color: #{$accordion-color};\n  --#{$prefix}accordion-bg: #{$accordion-bg};\n  --#{$prefix}accordion-transition: #{$accordion-transition};\n  --#{$prefix}accordion-border-color: #{$accordion-border-color};\n  --#{$prefix}accordion-border-width: #{$accordion-border-width};\n  --#{$prefix}accordion-border-radius: #{$accordion-border-radius};\n  --#{$prefix}accordion-inner-border-radius: #{$accordion-inner-border-radius};\n  --#{$prefix}accordion-btn-padding-x: #{$accordion-button-padding-x};\n  --#{$prefix}accordion-btn-padding-y: #{$accordion-button-padding-y};\n  --#{$prefix}accordion-btn-color: #{$accordion-button-color};\n  --#{$prefix}accordion-btn-bg: #{$accordion-button-bg};\n  --#{$prefix}accordion-btn-icon: #{escape-svg($accordion-button-icon)};\n  --#{$prefix}accordion-btn-icon-width: #{$accordion-icon-width};\n  --#{$prefix}accordion-btn-icon-transform: #{$accordion-icon-transform};\n  --#{$prefix}accordion-btn-icon-transition: #{$accordion-icon-transition};\n  --#{$prefix}accordion-btn-active-icon: #{escape-svg($accordion-button-active-icon)};\n  --#{$prefix}accordion-btn-focus-border-color: #{$accordion-button-focus-border-color};\n  --#{$prefix}accordion-btn-focus-box-shadow: #{$accordion-button-focus-box-shadow};\n  --#{$prefix}accordion-body-padding-x: #{$accordion-body-padding-x};\n  --#{$prefix}accordion-body-padding-y: #{$accordion-body-padding-y};\n  --#{$prefix}accordion-active-color: #{$accordion-button-active-color};\n  --#{$prefix}accordion-active-bg: #{$accordion-button-active-bg};\n  // scss-docs-end accordion-css-vars\n}\n\n.accordion-button {\n  position: relative;\n  display: flex;\n  align-items: center;\n  width: 100%;\n  padding: var(--#{$prefix}accordion-btn-padding-y) var(--#{$prefix}accordion-btn-padding-x);\n  @include font-size($font-size-base);\n  color: var(--#{$prefix}accordion-btn-color);\n  text-align: left; // Reset button style\n  background-color: var(--#{$prefix}accordion-btn-bg);\n  border: 0;\n  @include border-radius(0);\n  overflow-anchor: none;\n  @include transition(var(--#{$prefix}accordion-transition));\n\n  &:not(.collapsed) {\n    color: var(--#{$prefix}accordion-active-color);\n    background-color: var(--#{$prefix}accordion-active-bg);\n    box-shadow: inset 0 calc(-1 * var(--#{$prefix}accordion-border-width)) 0 var(--#{$prefix}accordion-border-color); // stylelint-disable-line function-disallowed-list\n\n    &::after {\n      background-image: var(--#{$prefix}accordion-btn-active-icon);\n      transform: var(--#{$prefix}accordion-btn-icon-transform);\n    }\n  }\n\n  // Accordion icon\n  &::after {\n    flex-shrink: 0;\n    width: var(--#{$prefix}accordion-btn-icon-width);\n    height: var(--#{$prefix}accordion-btn-icon-width);\n    margin-left: auto;\n    content: \"\";\n    background-image: var(--#{$prefix}accordion-btn-icon);\n    background-repeat: no-repeat;\n    background-size: var(--#{$prefix}accordion-btn-icon-width);\n    @include transition(var(--#{$prefix}accordion-btn-icon-transition));\n  }\n\n  &:hover {\n    z-index: 2;\n  }\n\n  &:focus {\n    z-index: 3;\n    border-color: var(--#{$prefix}accordion-btn-focus-border-color);\n    outline: 0;\n    box-shadow: var(--#{$prefix}accordion-btn-focus-box-shadow);\n  }\n}\n\n.accordion-header {\n  margin-bottom: 0;\n}\n\n.accordion-item {\n  color: var(--#{$prefix}accordion-color);\n  background-color: var(--#{$prefix}accordion-bg);\n  border: var(--#{$prefix}accordion-border-width) solid var(--#{$prefix}accordion-border-color);\n\n  &:first-of-type {\n    @include border-top-radius(var(--#{$prefix}accordion-border-radius));\n\n    .accordion-button {\n      @include border-top-radius(var(--#{$prefix}accordion-inner-border-radius));\n    }\n  }\n\n  &:not(:first-of-type) {\n    border-top: 0;\n  }\n\n  // Only set a border-radius on the last item if the accordion is collapsed\n  &:last-of-type {\n    @include border-bottom-radius(var(--#{$prefix}accordion-border-radius));\n\n    .accordion-button {\n      &.collapsed {\n        @include border-bottom-radius(var(--#{$prefix}accordion-inner-border-radius));\n      }\n    }\n\n    .accordion-collapse {\n      @include border-bottom-radius(var(--#{$prefix}accordion-border-radius));\n    }\n  }\n}\n\n.accordion-body {\n  padding: var(--#{$prefix}accordion-body-padding-y) var(--#{$prefix}accordion-body-padding-x);\n}\n\n\n// Flush accordion items\n//\n// Remove borders and border-radius to keep accordion items edge-to-edge.\n\n.accordion-flush {\n  .accordion-collapse {\n    border-width: 0;\n  }\n\n  .accordion-item {\n    border-right: 0;\n    border-left: 0;\n    @include border-radius(0);\n\n    &:first-child { border-top: 0; }\n    &:last-child { border-bottom: 0; }\n\n    .accordion-button {\n      &,\n      &.collapsed {\n        @include border-radius(0);\n      }\n    }\n  }\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    .accordion-button::after {\n      --#{$prefix}accordion-btn-icon: #{escape-svg($accordion-button-icon-dark)};\n      --#{$prefix}accordion-btn-active-icon: #{escape-svg($accordion-button-active-icon-dark)};\n    }\n  }\n}\n",".breadcrumb {\n  // scss-docs-start breadcrumb-css-vars\n  --#{$prefix}breadcrumb-padding-x: #{$breadcrumb-padding-x};\n  --#{$prefix}breadcrumb-padding-y: #{$breadcrumb-padding-y};\n  --#{$prefix}breadcrumb-margin-bottom: #{$breadcrumb-margin-bottom};\n  @include rfs($breadcrumb-font-size, --#{$prefix}breadcrumb-font-size);\n  --#{$prefix}breadcrumb-bg: #{$breadcrumb-bg};\n  --#{$prefix}breadcrumb-border-radius: #{$breadcrumb-border-radius};\n  --#{$prefix}breadcrumb-divider-color: #{$breadcrumb-divider-color};\n  --#{$prefix}breadcrumb-item-padding-x: #{$breadcrumb-item-padding-x};\n  --#{$prefix}breadcrumb-item-active-color: #{$breadcrumb-active-color};\n  // scss-docs-end breadcrumb-css-vars\n\n  display: flex;\n  flex-wrap: wrap;\n  padding: var(--#{$prefix}breadcrumb-padding-y) var(--#{$prefix}breadcrumb-padding-x);\n  margin-bottom: var(--#{$prefix}breadcrumb-margin-bottom);\n  @include font-size(var(--#{$prefix}breadcrumb-font-size));\n  list-style: none;\n  background-color: var(--#{$prefix}breadcrumb-bg);\n  @include border-radius(var(--#{$prefix}breadcrumb-border-radius));\n}\n\n.breadcrumb-item {\n  // The separator between breadcrumbs (by default, a forward-slash: \"/\")\n  + .breadcrumb-item {\n    padding-left: var(--#{$prefix}breadcrumb-item-padding-x);\n\n    &::before {\n      float: left; // Suppress inline spacings and underlining of the separator\n      padding-right: var(--#{$prefix}breadcrumb-item-padding-x);\n      color: var(--#{$prefix}breadcrumb-divider-color);\n      content: var(--#{$prefix}breadcrumb-divider, escape-svg($breadcrumb-divider)) #{\"/* rtl:\"} var(--#{$prefix}breadcrumb-divider, escape-svg($breadcrumb-divider-flipped)) #{\"*/\"};\n    }\n  }\n\n  &.active {\n    color: var(--#{$prefix}breadcrumb-item-active-color);\n  }\n}\n",".pagination {\n  // scss-docs-start pagination-css-vars\n  --#{$prefix}pagination-padding-x: #{$pagination-padding-x};\n  --#{$prefix}pagination-padding-y: #{$pagination-padding-y};\n  @include rfs($pagination-font-size, --#{$prefix}pagination-font-size);\n  --#{$prefix}pagination-color: #{$pagination-color};\n  --#{$prefix}pagination-bg: #{$pagination-bg};\n  --#{$prefix}pagination-border-width: #{$pagination-border-width};\n  --#{$prefix}pagination-border-color: #{$pagination-border-color};\n  --#{$prefix}pagination-border-radius: #{$pagination-border-radius};\n  --#{$prefix}pagination-hover-color: #{$pagination-hover-color};\n  --#{$prefix}pagination-hover-bg: #{$pagination-hover-bg};\n  --#{$prefix}pagination-hover-border-color: #{$pagination-hover-border-color};\n  --#{$prefix}pagination-focus-color: #{$pagination-focus-color};\n  --#{$prefix}pagination-focus-bg: #{$pagination-focus-bg};\n  --#{$prefix}pagination-focus-box-shadow: #{$pagination-focus-box-shadow};\n  --#{$prefix}pagination-active-color: #{$pagination-active-color};\n  --#{$prefix}pagination-active-bg: #{$pagination-active-bg};\n  --#{$prefix}pagination-active-border-color: #{$pagination-active-border-color};\n  --#{$prefix}pagination-disabled-color: #{$pagination-disabled-color};\n  --#{$prefix}pagination-disabled-bg: #{$pagination-disabled-bg};\n  --#{$prefix}pagination-disabled-border-color: #{$pagination-disabled-border-color};\n  // scss-docs-end pagination-css-vars\n\n  display: flex;\n  @include list-unstyled();\n}\n\n.page-link {\n  position: relative;\n  display: block;\n  padding: var(--#{$prefix}pagination-padding-y) var(--#{$prefix}pagination-padding-x);\n  @include font-size(var(--#{$prefix}pagination-font-size));\n  color: var(--#{$prefix}pagination-color);\n  text-decoration: if($link-decoration == none, null, none);\n  background-color: var(--#{$prefix}pagination-bg);\n  border: var(--#{$prefix}pagination-border-width) solid var(--#{$prefix}pagination-border-color);\n  @include transition($pagination-transition);\n\n  &:hover {\n    z-index: 2;\n    color: var(--#{$prefix}pagination-hover-color);\n    text-decoration: if($link-hover-decoration == underline, none, null);\n    background-color: var(--#{$prefix}pagination-hover-bg);\n    border-color: var(--#{$prefix}pagination-hover-border-color);\n  }\n\n  &:focus {\n    z-index: 3;\n    color: var(--#{$prefix}pagination-focus-color);\n    background-color: var(--#{$prefix}pagination-focus-bg);\n    outline: $pagination-focus-outline;\n    box-shadow: var(--#{$prefix}pagination-focus-box-shadow);\n  }\n\n  &.active,\n  .active > & {\n    z-index: 3;\n    color: var(--#{$prefix}pagination-active-color);\n    @include gradient-bg(var(--#{$prefix}pagination-active-bg));\n    border-color: var(--#{$prefix}pagination-active-border-color);\n  }\n\n  &.disabled,\n  .disabled > & {\n    color: var(--#{$prefix}pagination-disabled-color);\n    pointer-events: none;\n    background-color: var(--#{$prefix}pagination-disabled-bg);\n    border-color: var(--#{$prefix}pagination-disabled-border-color);\n  }\n}\n\n.page-item {\n  &:not(:first-child) .page-link {\n    margin-left: $pagination-margin-start;\n  }\n\n  @if $pagination-margin-start == calc(#{$pagination-border-width} * -1) {\n    &:first-child {\n      .page-link {\n        @include border-start-radius(var(--#{$prefix}pagination-border-radius));\n      }\n    }\n\n    &:last-child {\n      .page-link {\n        @include border-end-radius(var(--#{$prefix}pagination-border-radius));\n      }\n    }\n  } @else {\n    // Add border-radius to all pageLinks in case they have left margin\n    .page-link {\n      @include border-radius(var(--#{$prefix}pagination-border-radius));\n    }\n  }\n}\n\n\n//\n// Sizing\n//\n\n.pagination-lg {\n  @include pagination-size($pagination-padding-y-lg, $pagination-padding-x-lg, $font-size-lg, $pagination-border-radius-lg);\n}\n\n.pagination-sm {\n  @include pagination-size($pagination-padding-y-sm, $pagination-padding-x-sm, $font-size-sm, $pagination-border-radius-sm);\n}\n","// Pagination\n\n// scss-docs-start pagination-mixin\n@mixin pagination-size($padding-y, $padding-x, $font-size, $border-radius) {\n  --#{$prefix}pagination-padding-x: #{$padding-x};\n  --#{$prefix}pagination-padding-y: #{$padding-y};\n  @include rfs($font-size, --#{$prefix}pagination-font-size);\n  --#{$prefix}pagination-border-radius: #{$border-radius};\n}\n// scss-docs-end pagination-mixin\n","// Base class\n//\n// Requires one of the contextual, color modifier classes for `color` and\n// `background-color`.\n\n.badge {\n  // scss-docs-start badge-css-vars\n  --#{$prefix}badge-padding-x: #{$badge-padding-x};\n  --#{$prefix}badge-padding-y: #{$badge-padding-y};\n  @include rfs($badge-font-size, --#{$prefix}badge-font-size);\n  --#{$prefix}badge-font-weight: #{$badge-font-weight};\n  --#{$prefix}badge-color: #{$badge-color};\n  --#{$prefix}badge-border-radius: #{$badge-border-radius};\n  // scss-docs-end badge-css-vars\n\n  display: inline-block;\n  padding: var(--#{$prefix}badge-padding-y) var(--#{$prefix}badge-padding-x);\n  @include font-size(var(--#{$prefix}badge-font-size));\n  font-weight: var(--#{$prefix}badge-font-weight);\n  line-height: 1;\n  color: var(--#{$prefix}badge-color);\n  text-align: center;\n  white-space: nowrap;\n  vertical-align: baseline;\n  @include border-radius(var(--#{$prefix}badge-border-radius));\n  @include gradient-bg();\n\n  // Empty badges collapse automatically\n  &:empty {\n    display: none;\n  }\n}\n\n// Quick fix for badges in buttons\n.btn .badge {\n  position: relative;\n  top: -1px;\n}\n","//\n// Base styles\n//\n\n.alert {\n  // scss-docs-start alert-css-vars\n  --#{$prefix}alert-bg: transparent;\n  --#{$prefix}alert-padding-x: #{$alert-padding-x};\n  --#{$prefix}alert-padding-y: #{$alert-padding-y};\n  --#{$prefix}alert-margin-bottom: #{$alert-margin-bottom};\n  --#{$prefix}alert-color: inherit;\n  --#{$prefix}alert-border-color: transparent;\n  --#{$prefix}alert-border: #{$alert-border-width} solid var(--#{$prefix}alert-border-color);\n  --#{$prefix}alert-border-radius: #{$alert-border-radius};\n  --#{$prefix}alert-link-color: inherit;\n  // scss-docs-end alert-css-vars\n\n  position: relative;\n  padding: var(--#{$prefix}alert-padding-y) var(--#{$prefix}alert-padding-x);\n  margin-bottom: var(--#{$prefix}alert-margin-bottom);\n  color: var(--#{$prefix}alert-color);\n  background-color: var(--#{$prefix}alert-bg);\n  border: var(--#{$prefix}alert-border);\n  @include border-radius(var(--#{$prefix}alert-border-radius));\n}\n\n// Headings for larger alerts\n.alert-heading {\n  // Specified to prevent conflicts of changing $headings-color\n  color: inherit;\n}\n\n// Provide class for links that match alerts\n.alert-link {\n  font-weight: $alert-link-font-weight;\n  color: var(--#{$prefix}alert-link-color);\n}\n\n\n// Dismissible alerts\n//\n// Expand the right padding and account for the close button's positioning.\n\n.alert-dismissible {\n  padding-right: $alert-dismissible-padding-r;\n\n  // Adjust close link position\n  .btn-close {\n    position: absolute;\n    top: 0;\n    right: 0;\n    z-index: $stretched-link-z-index + 1;\n    padding: $alert-padding-y * 1.25 $alert-padding-x;\n  }\n}\n\n\n// scss-docs-start alert-modifiers\n// Generate contextual modifier classes for colorizing the alert\n@each $state in map-keys($theme-colors) {\n  .alert-#{$state} {\n    --#{$prefix}alert-color: var(--#{$prefix}#{$state}-text-emphasis);\n    --#{$prefix}alert-bg: var(--#{$prefix}#{$state}-bg-subtle);\n    --#{$prefix}alert-border-color: var(--#{$prefix}#{$state}-border-subtle);\n    --#{$prefix}alert-link-color: var(--#{$prefix}#{$state}-text-emphasis);\n  }\n}\n// scss-docs-end alert-modifiers\n","// Disable animation if transitions are disabled\n\n// scss-docs-start progress-keyframes\n@if $enable-transitions {\n  @keyframes progress-bar-stripes {\n    0% { background-position-x: $progress-height; }\n  }\n}\n// scss-docs-end progress-keyframes\n\n.progress,\n.progress-stacked {\n  // scss-docs-start progress-css-vars\n  --#{$prefix}progress-height: #{$progress-height};\n  @include rfs($progress-font-size, --#{$prefix}progress-font-size);\n  --#{$prefix}progress-bg: #{$progress-bg};\n  --#{$prefix}progress-border-radius: #{$progress-border-radius};\n  --#{$prefix}progress-box-shadow: #{$progress-box-shadow};\n  --#{$prefix}progress-bar-color: #{$progress-bar-color};\n  --#{$prefix}progress-bar-bg: #{$progress-bar-bg};\n  --#{$prefix}progress-bar-transition: #{$progress-bar-transition};\n  // scss-docs-end progress-css-vars\n\n  display: flex;\n  height: var(--#{$prefix}progress-height);\n  overflow: hidden; // force rounded corners by cropping it\n  @include font-size(var(--#{$prefix}progress-font-size));\n  background-color: var(--#{$prefix}progress-bg);\n  @include border-radius(var(--#{$prefix}progress-border-radius));\n  @include box-shadow(var(--#{$prefix}progress-box-shadow));\n}\n\n.progress-bar {\n  display: flex;\n  flex-direction: column;\n  justify-content: center;\n  overflow: hidden;\n  color: var(--#{$prefix}progress-bar-color);\n  text-align: center;\n  white-space: nowrap;\n  background-color: var(--#{$prefix}progress-bar-bg);\n  @include transition(var(--#{$prefix}progress-bar-transition));\n}\n\n.progress-bar-striped {\n  @include gradient-striped();\n  background-size: var(--#{$prefix}progress-height) var(--#{$prefix}progress-height);\n}\n\n.progress-stacked > .progress {\n  overflow: visible;\n}\n\n.progress-stacked > .progress > .progress-bar {\n  width: 100%;\n}\n\n@if $enable-transitions {\n  .progress-bar-animated {\n    animation: $progress-bar-animation-timing progress-bar-stripes;\n\n    @if $enable-reduced-motion {\n      @media (prefers-reduced-motion: reduce) {\n        animation: none;\n      }\n    }\n  }\n}\n","// Base class\n//\n// Easily usable on <ul>, <ol>, or <div>.\n\n.list-group {\n  // scss-docs-start list-group-css-vars\n  --#{$prefix}list-group-color: #{$list-group-color};\n  --#{$prefix}list-group-bg: #{$list-group-bg};\n  --#{$prefix}list-group-border-color: #{$list-group-border-color};\n  --#{$prefix}list-group-border-width: #{$list-group-border-width};\n  --#{$prefix}list-group-border-radius: #{$list-group-border-radius};\n  --#{$prefix}list-group-item-padding-x: #{$list-group-item-padding-x};\n  --#{$prefix}list-group-item-padding-y: #{$list-group-item-padding-y};\n  --#{$prefix}list-group-action-color: #{$list-group-action-color};\n  --#{$prefix}list-group-action-hover-color: #{$list-group-action-hover-color};\n  --#{$prefix}list-group-action-hover-bg: #{$list-group-hover-bg};\n  --#{$prefix}list-group-action-active-color: #{$list-group-action-active-color};\n  --#{$prefix}list-group-action-active-bg: #{$list-group-action-active-bg};\n  --#{$prefix}list-group-disabled-color: #{$list-group-disabled-color};\n  --#{$prefix}list-group-disabled-bg: #{$list-group-disabled-bg};\n  --#{$prefix}list-group-active-color: #{$list-group-active-color};\n  --#{$prefix}list-group-active-bg: #{$list-group-active-bg};\n  --#{$prefix}list-group-active-border-color: #{$list-group-active-border-color};\n  // scss-docs-end list-group-css-vars\n\n  display: flex;\n  flex-direction: column;\n\n  // No need to set list-style: none; since .list-group-item is block level\n  padding-left: 0; // reset padding because ul and ol\n  margin-bottom: 0;\n  @include border-radius(var(--#{$prefix}list-group-border-radius));\n}\n\n.list-group-numbered {\n  list-style-type: none;\n  counter-reset: section;\n\n  > .list-group-item::before {\n    // Increments only this instance of the section counter\n    content: counters(section, \".\") \". \";\n    counter-increment: section;\n  }\n}\n\n// Interactive list items\n//\n// Use anchor or button elements instead of `li`s or `div`s to create interactive\n// list items. Includes an extra `.active` modifier class for selected items.\n\n.list-group-item-action {\n  width: 100%; // For `<button>`s (anchors become 100% by default though)\n  color: var(--#{$prefix}list-group-action-color);\n  text-align: inherit; // For `<button>`s (anchors inherit)\n\n  // Hover state\n  &:hover,\n  &:focus {\n    z-index: 1; // Place hover/focus items above their siblings for proper border styling\n    color: var(--#{$prefix}list-group-action-hover-color);\n    text-decoration: none;\n    background-color: var(--#{$prefix}list-group-action-hover-bg);\n  }\n\n  &:active {\n    color: var(--#{$prefix}list-group-action-active-color);\n    background-color: var(--#{$prefix}list-group-action-active-bg);\n  }\n}\n\n// Individual list items\n//\n// Use on `li`s or `div`s within the `.list-group` parent.\n\n.list-group-item {\n  position: relative;\n  display: block;\n  padding: var(--#{$prefix}list-group-item-padding-y) var(--#{$prefix}list-group-item-padding-x);\n  color: var(--#{$prefix}list-group-color);\n  text-decoration: if($link-decoration == none, null, none);\n  background-color: var(--#{$prefix}list-group-bg);\n  border: var(--#{$prefix}list-group-border-width) solid var(--#{$prefix}list-group-border-color);\n\n  &:first-child {\n    @include border-top-radius(inherit);\n  }\n\n  &:last-child {\n    @include border-bottom-radius(inherit);\n  }\n\n  &.disabled,\n  &:disabled {\n    color: var(--#{$prefix}list-group-disabled-color);\n    pointer-events: none;\n    background-color: var(--#{$prefix}list-group-disabled-bg);\n  }\n\n  // Include both here for `<a>`s and `<button>`s\n  &.active {\n    z-index: 2; // Place active items above their siblings for proper border styling\n    color: var(--#{$prefix}list-group-active-color);\n    background-color: var(--#{$prefix}list-group-active-bg);\n    border-color: var(--#{$prefix}list-group-active-border-color);\n  }\n\n  // stylelint-disable-next-line scss/selector-no-redundant-nesting-selector\n  & + .list-group-item {\n    border-top-width: 0;\n\n    &.active {\n      margin-top: calc(-1 * var(--#{$prefix}list-group-border-width)); // stylelint-disable-line function-disallowed-list\n      border-top-width: var(--#{$prefix}list-group-border-width);\n    }\n  }\n}\n\n// Horizontal\n//\n// Change the layout of list group items from vertical (default) to horizontal.\n\n@each $breakpoint in map-keys($grid-breakpoints) {\n  @include media-breakpoint-up($breakpoint) {\n    $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n    .list-group-horizontal#{$infix} {\n      flex-direction: row;\n\n      > .list-group-item {\n        &:first-child:not(:last-child) {\n          @include border-bottom-start-radius(var(--#{$prefix}list-group-border-radius));\n          @include border-top-end-radius(0);\n        }\n\n        &:last-child:not(:first-child) {\n          @include border-top-end-radius(var(--#{$prefix}list-group-border-radius));\n          @include border-bottom-start-radius(0);\n        }\n\n        &.active {\n          margin-top: 0;\n        }\n\n        + .list-group-item {\n          border-top-width: var(--#{$prefix}list-group-border-width);\n          border-left-width: 0;\n\n          &.active {\n            margin-left: calc(-1 * var(--#{$prefix}list-group-border-width)); // stylelint-disable-line function-disallowed-list\n            border-left-width: var(--#{$prefix}list-group-border-width);\n          }\n        }\n      }\n    }\n  }\n}\n\n\n// Flush list items\n//\n// Remove borders and border-radius to keep list group items edge-to-edge. Most\n// useful within other components (e.g., cards).\n\n.list-group-flush {\n  @include border-radius(0);\n\n  > .list-group-item {\n    border-width: 0 0 var(--#{$prefix}list-group-border-width);\n\n    &:last-child {\n      border-bottom-width: 0;\n    }\n  }\n}\n\n\n// scss-docs-start list-group-modifiers\n// List group contextual variants\n//\n// Add modifier classes to change text and background color on individual items.\n// Organizationally, this must come after the `:hover` states.\n\n@each $state in map-keys($theme-colors) {\n  .list-group-item-#{$state} {\n    --#{$prefix}list-group-color: var(--#{$prefix}#{$state}-text-emphasis);\n    --#{$prefix}list-group-bg: var(--#{$prefix}#{$state}-bg-subtle);\n    --#{$prefix}list-group-border-color: var(--#{$prefix}#{$state}-border-subtle);\n    --#{$prefix}list-group-action-hover-color: var(--#{$prefix}emphasis-color);\n    --#{$prefix}list-group-action-hover-bg: var(--#{$prefix}#{$state}-border-subtle);\n    --#{$prefix}list-group-action-active-color: var(--#{$prefix}emphasis-color);\n    --#{$prefix}list-group-action-active-bg: var(--#{$prefix}#{$state}-border-subtle);\n    --#{$prefix}list-group-active-color: var(--#{$prefix}#{$state}-bg-subtle);\n    --#{$prefix}list-group-active-bg: var(--#{$prefix}#{$state}-text-emphasis);\n    --#{$prefix}list-group-active-border-color: var(--#{$prefix}#{$state}-text-emphasis);\n  }\n}\n// scss-docs-end list-group-modifiers\n","// Transparent background and border properties included for button version.\n// iOS requires the button element instead of an anchor tag.\n// If you want the anchor version, it requires `href=\"#\"`.\n// See https://developer.mozilla.org/en-US/docs/Web/Events/click#Safari_Mobile\n\n.btn-close {\n  // scss-docs-start close-css-vars\n  --#{$prefix}btn-close-color: #{$btn-close-color};\n  --#{$prefix}btn-close-bg: #{ escape-svg($btn-close-bg) };\n  --#{$prefix}btn-close-opacity: #{$btn-close-opacity};\n  --#{$prefix}btn-close-hover-opacity: #{$btn-close-hover-opacity};\n  --#{$prefix}btn-close-focus-shadow: #{$btn-close-focus-shadow};\n  --#{$prefix}btn-close-focus-opacity: #{$btn-close-focus-opacity};\n  --#{$prefix}btn-close-disabled-opacity: #{$btn-close-disabled-opacity};\n  --#{$prefix}btn-close-white-filter: #{$btn-close-white-filter};\n  // scss-docs-end close-css-vars\n\n  box-sizing: content-box;\n  width: $btn-close-width;\n  height: $btn-close-height;\n  padding: $btn-close-padding-y $btn-close-padding-x;\n  color: var(--#{$prefix}btn-close-color);\n  background: transparent var(--#{$prefix}btn-close-bg) center / $btn-close-width auto no-repeat; // include transparent for button elements\n  border: 0; // for button elements\n  @include border-radius();\n  opacity: var(--#{$prefix}btn-close-opacity);\n\n  // Override <a>'s hover style\n  &:hover {\n    color: var(--#{$prefix}btn-close-color);\n    text-decoration: none;\n    opacity: var(--#{$prefix}btn-close-hover-opacity);\n  }\n\n  &:focus {\n    outline: 0;\n    box-shadow: var(--#{$prefix}btn-close-focus-shadow);\n    opacity: var(--#{$prefix}btn-close-focus-opacity);\n  }\n\n  &:disabled,\n  &.disabled {\n    pointer-events: none;\n    user-select: none;\n    opacity: var(--#{$prefix}btn-close-disabled-opacity);\n  }\n}\n\n@mixin btn-close-white() {\n  filter: var(--#{$prefix}btn-close-white-filter);\n}\n\n.btn-close-white {\n  @include btn-close-white();\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    .btn-close {\n      @include btn-close-white();\n    }\n  }\n}\n",".toast {\n  // scss-docs-start toast-css-vars\n  --#{$prefix}toast-zindex: #{$zindex-toast};\n  --#{$prefix}toast-padding-x: #{$toast-padding-x};\n  --#{$prefix}toast-padding-y: #{$toast-padding-y};\n  --#{$prefix}toast-spacing: #{$toast-spacing};\n  --#{$prefix}toast-max-width: #{$toast-max-width};\n  @include rfs($toast-font-size, --#{$prefix}toast-font-size);\n  --#{$prefix}toast-color: #{$toast-color};\n  --#{$prefix}toast-bg: #{$toast-background-color};\n  --#{$prefix}toast-border-width: #{$toast-border-width};\n  --#{$prefix}toast-border-color: #{$toast-border-color};\n  --#{$prefix}toast-border-radius: #{$toast-border-radius};\n  --#{$prefix}toast-box-shadow: #{$toast-box-shadow};\n  --#{$prefix}toast-header-color: #{$toast-header-color};\n  --#{$prefix}toast-header-bg: #{$toast-header-background-color};\n  --#{$prefix}toast-header-border-color: #{$toast-header-border-color};\n  // scss-docs-end toast-css-vars\n\n  width: var(--#{$prefix}toast-max-width);\n  max-width: 100%;\n  @include font-size(var(--#{$prefix}toast-font-size));\n  color: var(--#{$prefix}toast-color);\n  pointer-events: auto;\n  background-color: var(--#{$prefix}toast-bg);\n  background-clip: padding-box;\n  border: var(--#{$prefix}toast-border-width) solid var(--#{$prefix}toast-border-color);\n  box-shadow: var(--#{$prefix}toast-box-shadow);\n  @include border-radius(var(--#{$prefix}toast-border-radius));\n\n  &.showing {\n    opacity: 0;\n  }\n\n  &:not(.show) {\n    display: none;\n  }\n}\n\n.toast-container {\n  --#{$prefix}toast-zindex: #{$zindex-toast};\n\n  position: absolute;\n  z-index: var(--#{$prefix}toast-zindex);\n  width: max-content;\n  max-width: 100%;\n  pointer-events: none;\n\n  > :not(:last-child) {\n    margin-bottom: var(--#{$prefix}toast-spacing);\n  }\n}\n\n.toast-header {\n  display: flex;\n  align-items: center;\n  padding: var(--#{$prefix}toast-padding-y) var(--#{$prefix}toast-padding-x);\n  color: var(--#{$prefix}toast-header-color);\n  background-color: var(--#{$prefix}toast-header-bg);\n  background-clip: padding-box;\n  border-bottom: var(--#{$prefix}toast-border-width) solid var(--#{$prefix}toast-header-border-color);\n  @include border-top-radius(calc(var(--#{$prefix}toast-border-radius) - var(--#{$prefix}toast-border-width)));\n\n  .btn-close {\n    margin-right: calc(-.5 * var(--#{$prefix}toast-padding-x)); // stylelint-disable-line function-disallowed-list\n    margin-left: var(--#{$prefix}toast-padding-x);\n  }\n}\n\n.toast-body {\n  padding: var(--#{$prefix}toast-padding-x);\n  word-wrap: break-word;\n}\n","// stylelint-disable function-disallowed-list\n\n// .modal-open      - body class for killing the scroll\n// .modal           - container to scroll within\n// .modal-dialog    - positioning shell for the actual modal\n// .modal-content   - actual modal w/ bg and corners and stuff\n\n\n// Container that the modal scrolls within\n.modal {\n  // scss-docs-start modal-css-vars\n  --#{$prefix}modal-zindex: #{$zindex-modal};\n  --#{$prefix}modal-width: #{$modal-md};\n  --#{$prefix}modal-padding: #{$modal-inner-padding};\n  --#{$prefix}modal-margin: #{$modal-dialog-margin};\n  --#{$prefix}modal-color: #{$modal-content-color};\n  --#{$prefix}modal-bg: #{$modal-content-bg};\n  --#{$prefix}modal-border-color: #{$modal-content-border-color};\n  --#{$prefix}modal-border-width: #{$modal-content-border-width};\n  --#{$prefix}modal-border-radius: #{$modal-content-border-radius};\n  --#{$prefix}modal-box-shadow: #{$modal-content-box-shadow-xs};\n  --#{$prefix}modal-inner-border-radius: #{$modal-content-inner-border-radius};\n  --#{$prefix}modal-header-padding-x: #{$modal-header-padding-x};\n  --#{$prefix}modal-header-padding-y: #{$modal-header-padding-y};\n  --#{$prefix}modal-header-padding: #{$modal-header-padding}; // Todo in v6: Split this padding into x and y\n  --#{$prefix}modal-header-border-color: #{$modal-header-border-color};\n  --#{$prefix}modal-header-border-width: #{$modal-header-border-width};\n  --#{$prefix}modal-title-line-height: #{$modal-title-line-height};\n  --#{$prefix}modal-footer-gap: #{$modal-footer-margin-between};\n  --#{$prefix}modal-footer-bg: #{$modal-footer-bg};\n  --#{$prefix}modal-footer-border-color: #{$modal-footer-border-color};\n  --#{$prefix}modal-footer-border-width: #{$modal-footer-border-width};\n  // scss-docs-end modal-css-vars\n\n  position: fixed;\n  top: 0;\n  left: 0;\n  z-index: var(--#{$prefix}modal-zindex);\n  display: none;\n  width: 100%;\n  height: 100%;\n  overflow-x: hidden;\n  overflow-y: auto;\n  // Prevent Chrome on Windows from adding a focus outline. For details, see\n  // https://github.com/twbs/bootstrap/pull/10951.\n  outline: 0;\n  // We deliberately don't use `-webkit-overflow-scrolling: touch;` due to a\n  // gnarly iOS Safari bug: https://bugs.webkit.org/show_bug.cgi?id=158342\n  // See also https://github.com/twbs/bootstrap/issues/17695\n}\n\n// Shell div to position the modal with bottom padding\n.modal-dialog {\n  position: relative;\n  width: auto;\n  margin: var(--#{$prefix}modal-margin);\n  // allow clicks to pass through for custom click handling to close modal\n  pointer-events: none;\n\n  // When fading in the modal, animate it to slide down\n  .modal.fade & {\n    @include transition($modal-transition);\n    transform: $modal-fade-transform;\n  }\n  .modal.show & {\n    transform: $modal-show-transform;\n  }\n\n  // When trying to close, animate focus to scale\n  .modal.modal-static & {\n    transform: $modal-scale-transform;\n  }\n}\n\n.modal-dialog-scrollable {\n  height: calc(100% - var(--#{$prefix}modal-margin) * 2);\n\n  .modal-content {\n    max-height: 100%;\n    overflow: hidden;\n  }\n\n  .modal-body {\n    overflow-y: auto;\n  }\n}\n\n.modal-dialog-centered {\n  display: flex;\n  align-items: center;\n  min-height: calc(100% - var(--#{$prefix}modal-margin) * 2);\n}\n\n// Actual modal\n.modal-content {\n  position: relative;\n  display: flex;\n  flex-direction: column;\n  width: 100%; // Ensure `.modal-content` extends the full width of the parent `.modal-dialog`\n  // counteract the pointer-events: none; in the .modal-dialog\n  color: var(--#{$prefix}modal-color);\n  pointer-events: auto;\n  background-color: var(--#{$prefix}modal-bg);\n  background-clip: padding-box;\n  border: var(--#{$prefix}modal-border-width) solid var(--#{$prefix}modal-border-color);\n  @include border-radius(var(--#{$prefix}modal-border-radius));\n  @include box-shadow(var(--#{$prefix}modal-box-shadow));\n  // Remove focus outline from opened modal\n  outline: 0;\n}\n\n// Modal background\n.modal-backdrop {\n  // scss-docs-start modal-backdrop-css-vars\n  --#{$prefix}backdrop-zindex: #{$zindex-modal-backdrop};\n  --#{$prefix}backdrop-bg: #{$modal-backdrop-bg};\n  --#{$prefix}backdrop-opacity: #{$modal-backdrop-opacity};\n  // scss-docs-end modal-backdrop-css-vars\n\n  @include overlay-backdrop(var(--#{$prefix}backdrop-zindex), var(--#{$prefix}backdrop-bg), var(--#{$prefix}backdrop-opacity));\n}\n\n// Modal header\n// Top section of the modal w/ title and dismiss\n.modal-header {\n  display: flex;\n  flex-shrink: 0;\n  align-items: center;\n  justify-content: space-between; // Put modal header elements (title and dismiss) on opposite ends\n  padding: var(--#{$prefix}modal-header-padding);\n  border-bottom: var(--#{$prefix}modal-header-border-width) solid var(--#{$prefix}modal-header-border-color);\n  @include border-top-radius(var(--#{$prefix}modal-inner-border-radius));\n\n  .btn-close {\n    padding: calc(var(--#{$prefix}modal-header-padding-y) * .5) calc(var(--#{$prefix}modal-header-padding-x) * .5);\n    margin: calc(-.5 * var(--#{$prefix}modal-header-padding-y)) calc(-.5 * var(--#{$prefix}modal-header-padding-x)) calc(-.5 * var(--#{$prefix}modal-header-padding-y)) auto;\n  }\n}\n\n// Title text within header\n.modal-title {\n  margin-bottom: 0;\n  line-height: var(--#{$prefix}modal-title-line-height);\n}\n\n// Modal body\n// Where all modal content resides (sibling of .modal-header and .modal-footer)\n.modal-body {\n  position: relative;\n  // Enable `flex-grow: 1` so that the body take up as much space as possible\n  // when there should be a fixed height on `.modal-dialog`.\n  flex: 1 1 auto;\n  padding: var(--#{$prefix}modal-padding);\n}\n\n// Footer (for actions)\n.modal-footer {\n  display: flex;\n  flex-shrink: 0;\n  flex-wrap: wrap;\n  align-items: center; // vertically center\n  justify-content: flex-end; // Right align buttons with flex property because text-align doesn't work on flex items\n  padding: calc(var(--#{$prefix}modal-padding) - var(--#{$prefix}modal-footer-gap) * .5);\n  background-color: var(--#{$prefix}modal-footer-bg);\n  border-top: var(--#{$prefix}modal-footer-border-width) solid var(--#{$prefix}modal-footer-border-color);\n  @include border-bottom-radius(var(--#{$prefix}modal-inner-border-radius));\n\n  // Place margin between footer elements\n  // This solution is far from ideal because of the universal selector usage,\n  // but is needed to fix https://github.com/twbs/bootstrap/issues/24800\n  > * {\n    margin: calc(var(--#{$prefix}modal-footer-gap) * .5); // Todo in v6: replace with gap on parent class\n  }\n}\n\n// Scale up the modal\n@include media-breakpoint-up(sm) {\n  .modal {\n    --#{$prefix}modal-margin: #{$modal-dialog-margin-y-sm-up};\n    --#{$prefix}modal-box-shadow: #{$modal-content-box-shadow-sm-up};\n  }\n\n  // Automatically set modal's width for larger viewports\n  .modal-dialog {\n    max-width: var(--#{$prefix}modal-width);\n    margin-right: auto;\n    margin-left: auto;\n  }\n\n  .modal-sm {\n    --#{$prefix}modal-width: #{$modal-sm};\n  }\n}\n\n@include media-breakpoint-up(lg) {\n  .modal-lg,\n  .modal-xl {\n    --#{$prefix}modal-width: #{$modal-lg};\n  }\n}\n\n@include media-breakpoint-up(xl) {\n  .modal-xl {\n    --#{$prefix}modal-width: #{$modal-xl};\n  }\n}\n\n// scss-docs-start modal-fullscreen-loop\n@each $breakpoint in map-keys($grid-breakpoints) {\n  $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n  $postfix: if($infix != \"\", $infix + \"-down\", \"\");\n\n  @include media-breakpoint-down($breakpoint) {\n    .modal-fullscreen#{$postfix} {\n      width: 100vw;\n      max-width: none;\n      height: 100%;\n      margin: 0;\n\n      .modal-content {\n        height: 100%;\n        border: 0;\n        @include border-radius(0);\n      }\n\n      .modal-header,\n      .modal-footer {\n        @include border-radius(0);\n      }\n\n      .modal-body {\n        overflow-y: auto;\n      }\n    }\n  }\n}\n// scss-docs-end modal-fullscreen-loop\n","// Shared between modals and offcanvases\n@mixin overlay-backdrop($zindex, $backdrop-bg, $backdrop-opacity) {\n  position: fixed;\n  top: 0;\n  left: 0;\n  z-index: $zindex;\n  width: 100vw;\n  height: 100vh;\n  background-color: $backdrop-bg;\n\n  // Fade for backdrop\n  &.fade { opacity: 0; }\n  &.show { opacity: $backdrop-opacity; }\n}\n","// Base class\n.tooltip {\n  // scss-docs-start tooltip-css-vars\n  --#{$prefix}tooltip-zindex: #{$zindex-tooltip};\n  --#{$prefix}tooltip-max-width: #{$tooltip-max-width};\n  --#{$prefix}tooltip-padding-x: #{$tooltip-padding-x};\n  --#{$prefix}tooltip-padding-y: #{$tooltip-padding-y};\n  --#{$prefix}tooltip-margin: #{$tooltip-margin};\n  @include rfs($tooltip-font-size, --#{$prefix}tooltip-font-size);\n  --#{$prefix}tooltip-color: #{$tooltip-color};\n  --#{$prefix}tooltip-bg: #{$tooltip-bg};\n  --#{$prefix}tooltip-border-radius: #{$tooltip-border-radius};\n  --#{$prefix}tooltip-opacity: #{$tooltip-opacity};\n  --#{$prefix}tooltip-arrow-width: #{$tooltip-arrow-width};\n  --#{$prefix}tooltip-arrow-height: #{$tooltip-arrow-height};\n  // scss-docs-end tooltip-css-vars\n\n  z-index: var(--#{$prefix}tooltip-zindex);\n  display: block;\n  margin: var(--#{$prefix}tooltip-margin);\n  @include deprecate(\"`$tooltip-margin`\", \"v5\", \"v5.x\", true);\n  // Our parent element can be arbitrary since tooltips are by default inserted as a sibling of their target element.\n  // So reset our font and text properties to avoid inheriting weird values.\n  @include reset-text();\n  @include font-size(var(--#{$prefix}tooltip-font-size));\n  // Allow breaking very long words so they don't overflow the tooltip's bounds\n  word-wrap: break-word;\n  opacity: 0;\n\n  &.show { opacity: var(--#{$prefix}tooltip-opacity); }\n\n  .tooltip-arrow {\n    display: block;\n    width: var(--#{$prefix}tooltip-arrow-width);\n    height: var(--#{$prefix}tooltip-arrow-height);\n\n    &::before {\n      position: absolute;\n      content: \"\";\n      border-color: transparent;\n      border-style: solid;\n    }\n  }\n}\n\n.bs-tooltip-top .tooltip-arrow {\n  bottom: calc(-1 * var(--#{$prefix}tooltip-arrow-height)); // stylelint-disable-line function-disallowed-list\n\n  &::before {\n    top: -1px;\n    border-width: var(--#{$prefix}tooltip-arrow-height) calc(var(--#{$prefix}tooltip-arrow-width) * .5) 0; // stylelint-disable-line function-disallowed-list\n    border-top-color: var(--#{$prefix}tooltip-bg);\n  }\n}\n\n/* rtl:begin:ignore */\n.bs-tooltip-end .tooltip-arrow {\n  left: calc(-1 * var(--#{$prefix}tooltip-arrow-height)); // stylelint-disable-line function-disallowed-list\n  width: var(--#{$prefix}tooltip-arrow-height);\n  height: var(--#{$prefix}tooltip-arrow-width);\n\n  &::before {\n    right: -1px;\n    border-width: calc(var(--#{$prefix}tooltip-arrow-width) * .5) var(--#{$prefix}tooltip-arrow-height) calc(var(--#{$prefix}tooltip-arrow-width) * .5) 0; // stylelint-disable-line function-disallowed-list\n    border-right-color: var(--#{$prefix}tooltip-bg);\n  }\n}\n\n/* rtl:end:ignore */\n\n.bs-tooltip-bottom .tooltip-arrow {\n  top: calc(-1 * var(--#{$prefix}tooltip-arrow-height)); // stylelint-disable-line function-disallowed-list\n\n  &::before {\n    bottom: -1px;\n    border-width: 0 calc(var(--#{$prefix}tooltip-arrow-width) * .5) var(--#{$prefix}tooltip-arrow-height); // stylelint-disable-line function-disallowed-list\n    border-bottom-color: var(--#{$prefix}tooltip-bg);\n  }\n}\n\n/* rtl:begin:ignore */\n.bs-tooltip-start .tooltip-arrow {\n  right: calc(-1 * var(--#{$prefix}tooltip-arrow-height)); // stylelint-disable-line function-disallowed-list\n  width: var(--#{$prefix}tooltip-arrow-height);\n  height: var(--#{$prefix}tooltip-arrow-width);\n\n  &::before {\n    left: -1px;\n    border-width: calc(var(--#{$prefix}tooltip-arrow-width) * .5) 0 calc(var(--#{$prefix}tooltip-arrow-width) * .5) var(--#{$prefix}tooltip-arrow-height); // stylelint-disable-line function-disallowed-list\n    border-left-color: var(--#{$prefix}tooltip-bg);\n  }\n}\n\n/* rtl:end:ignore */\n\n.bs-tooltip-auto {\n  &[data-popper-placement^=\"top\"] {\n    @extend .bs-tooltip-top;\n  }\n  &[data-popper-placement^=\"right\"] {\n    @extend .bs-tooltip-end;\n  }\n  &[data-popper-placement^=\"bottom\"] {\n    @extend .bs-tooltip-bottom;\n  }\n  &[data-popper-placement^=\"left\"] {\n    @extend .bs-tooltip-start;\n  }\n}\n\n// Wrapper for the tooltip content\n.tooltip-inner {\n  max-width: var(--#{$prefix}tooltip-max-width);\n  padding: var(--#{$prefix}tooltip-padding-y) var(--#{$prefix}tooltip-padding-x);\n  color: var(--#{$prefix}tooltip-color);\n  text-align: center;\n  background-color: var(--#{$prefix}tooltip-bg);\n  @include border-radius(var(--#{$prefix}tooltip-border-radius));\n}\n","@mixin reset-text {\n  font-family: $font-family-base;\n  // We deliberately do NOT reset font-size or overflow-wrap / word-wrap.\n  font-style: normal;\n  font-weight: $font-weight-normal;\n  line-height: $line-height-base;\n  text-align: left; // Fallback for where `start` is not supported\n  text-align: start;\n  text-decoration: none;\n  text-shadow: none;\n  text-transform: none;\n  letter-spacing: normal;\n  word-break: normal;\n  white-space: normal;\n  word-spacing: normal;\n  line-break: auto;\n}\n",".popover {\n  // scss-docs-start popover-css-vars\n  --#{$prefix}popover-zindex: #{$zindex-popover};\n  --#{$prefix}popover-max-width: #{$popover-max-width};\n  @include rfs($popover-font-size, --#{$prefix}popover-font-size);\n  --#{$prefix}popover-bg: #{$popover-bg};\n  --#{$prefix}popover-border-width: #{$popover-border-width};\n  --#{$prefix}popover-border-color: #{$popover-border-color};\n  --#{$prefix}popover-border-radius: #{$popover-border-radius};\n  --#{$prefix}popover-inner-border-radius: #{$popover-inner-border-radius};\n  --#{$prefix}popover-box-shadow: #{$popover-box-shadow};\n  --#{$prefix}popover-header-padding-x: #{$popover-header-padding-x};\n  --#{$prefix}popover-header-padding-y: #{$popover-header-padding-y};\n  @include rfs($popover-header-font-size, --#{$prefix}popover-header-font-size);\n  --#{$prefix}popover-header-color: #{$popover-header-color};\n  --#{$prefix}popover-header-bg: #{$popover-header-bg};\n  --#{$prefix}popover-body-padding-x: #{$popover-body-padding-x};\n  --#{$prefix}popover-body-padding-y: #{$popover-body-padding-y};\n  --#{$prefix}popover-body-color: #{$popover-body-color};\n  --#{$prefix}popover-arrow-width: #{$popover-arrow-width};\n  --#{$prefix}popover-arrow-height: #{$popover-arrow-height};\n  --#{$prefix}popover-arrow-border: var(--#{$prefix}popover-border-color);\n  // scss-docs-end popover-css-vars\n\n  z-index: var(--#{$prefix}popover-zindex);\n  display: block;\n  max-width: var(--#{$prefix}popover-max-width);\n  // Our parent element can be arbitrary since tooltips are by default inserted as a sibling of their target element.\n  // So reset our font and text properties to avoid inheriting weird values.\n  @include reset-text();\n  @include font-size(var(--#{$prefix}popover-font-size));\n  // Allow breaking very long words so they don't overflow the popover's bounds\n  word-wrap: break-word;\n  background-color: var(--#{$prefix}popover-bg);\n  background-clip: padding-box;\n  border: var(--#{$prefix}popover-border-width) solid var(--#{$prefix}popover-border-color);\n  @include border-radius(var(--#{$prefix}popover-border-radius));\n  @include box-shadow(var(--#{$prefix}popover-box-shadow));\n\n  .popover-arrow {\n    display: block;\n    width: var(--#{$prefix}popover-arrow-width);\n    height: var(--#{$prefix}popover-arrow-height);\n\n    &::before,\n    &::after {\n      position: absolute;\n      display: block;\n      content: \"\";\n      border-color: transparent;\n      border-style: solid;\n      border-width: 0;\n    }\n  }\n}\n\n.bs-popover-top {\n  > .popover-arrow {\n    bottom: calc(-1 * (var(--#{$prefix}popover-arrow-height)) - var(--#{$prefix}popover-border-width)); // stylelint-disable-line function-disallowed-list\n\n    &::before,\n    &::after {\n      border-width: var(--#{$prefix}popover-arrow-height) calc(var(--#{$prefix}popover-arrow-width) * .5) 0; // stylelint-disable-line function-disallowed-list\n    }\n\n    &::before {\n      bottom: 0;\n      border-top-color: var(--#{$prefix}popover-arrow-border);\n    }\n\n    &::after {\n      bottom: var(--#{$prefix}popover-border-width);\n      border-top-color: var(--#{$prefix}popover-bg);\n    }\n  }\n}\n\n/* rtl:begin:ignore */\n.bs-popover-end {\n  > .popover-arrow {\n    left: calc(-1 * (var(--#{$prefix}popover-arrow-height)) - var(--#{$prefix}popover-border-width)); // stylelint-disable-line function-disallowed-list\n    width: var(--#{$prefix}popover-arrow-height);\n    height: var(--#{$prefix}popover-arrow-width);\n\n    &::before,\n    &::after {\n      border-width: calc(var(--#{$prefix}popover-arrow-width) * .5) var(--#{$prefix}popover-arrow-height) calc(var(--#{$prefix}popover-arrow-width) * .5) 0; // stylelint-disable-line function-disallowed-list\n    }\n\n    &::before {\n      left: 0;\n      border-right-color: var(--#{$prefix}popover-arrow-border);\n    }\n\n    &::after {\n      left: var(--#{$prefix}popover-border-width);\n      border-right-color: var(--#{$prefix}popover-bg);\n    }\n  }\n}\n\n/* rtl:end:ignore */\n\n.bs-popover-bottom {\n  > .popover-arrow {\n    top: calc(-1 * (var(--#{$prefix}popover-arrow-height)) - var(--#{$prefix}popover-border-width)); // stylelint-disable-line function-disallowed-list\n\n    &::before,\n    &::after {\n      border-width: 0 calc(var(--#{$prefix}popover-arrow-width) * .5) var(--#{$prefix}popover-arrow-height); // stylelint-disable-line function-disallowed-list\n    }\n\n    &::before {\n      top: 0;\n      border-bottom-color: var(--#{$prefix}popover-arrow-border);\n    }\n\n    &::after {\n      top: var(--#{$prefix}popover-border-width);\n      border-bottom-color: var(--#{$prefix}popover-bg);\n    }\n  }\n\n  // This will remove the popover-header's border just below the arrow\n  .popover-header::before {\n    position: absolute;\n    top: 0;\n    left: 50%;\n    display: block;\n    width: var(--#{$prefix}popover-arrow-width);\n    margin-left: calc(-.5 * var(--#{$prefix}popover-arrow-width)); // stylelint-disable-line function-disallowed-list\n    content: \"\";\n    border-bottom: var(--#{$prefix}popover-border-width) solid var(--#{$prefix}popover-header-bg);\n  }\n}\n\n/* rtl:begin:ignore */\n.bs-popover-start {\n  > .popover-arrow {\n    right: calc(-1 * (var(--#{$prefix}popover-arrow-height)) - var(--#{$prefix}popover-border-width)); // stylelint-disable-line function-disallowed-list\n    width: var(--#{$prefix}popover-arrow-height);\n    height: var(--#{$prefix}popover-arrow-width);\n\n    &::before,\n    &::after {\n      border-width: calc(var(--#{$prefix}popover-arrow-width) * .5) 0 calc(var(--#{$prefix}popover-arrow-width) * .5) var(--#{$prefix}popover-arrow-height); // stylelint-disable-line function-disallowed-list\n    }\n\n    &::before {\n      right: 0;\n      border-left-color: var(--#{$prefix}popover-arrow-border);\n    }\n\n    &::after {\n      right: var(--#{$prefix}popover-border-width);\n      border-left-color: var(--#{$prefix}popover-bg);\n    }\n  }\n}\n\n/* rtl:end:ignore */\n\n.bs-popover-auto {\n  &[data-popper-placement^=\"top\"] {\n    @extend .bs-popover-top;\n  }\n  &[data-popper-placement^=\"right\"] {\n    @extend .bs-popover-end;\n  }\n  &[data-popper-placement^=\"bottom\"] {\n    @extend .bs-popover-bottom;\n  }\n  &[data-popper-placement^=\"left\"] {\n    @extend .bs-popover-start;\n  }\n}\n\n// Offset the popover to account for the popover arrow\n.popover-header {\n  padding: var(--#{$prefix}popover-header-padding-y) var(--#{$prefix}popover-header-padding-x);\n  margin-bottom: 0; // Reset the default from Reboot\n  @include font-size(var(--#{$prefix}popover-header-font-size));\n  color: var(--#{$prefix}popover-header-color);\n  background-color: var(--#{$prefix}popover-header-bg);\n  border-bottom: var(--#{$prefix}popover-border-width) solid var(--#{$prefix}popover-border-color);\n  @include border-top-radius(var(--#{$prefix}popover-inner-border-radius));\n\n  &:empty {\n    display: none;\n  }\n}\n\n.popover-body {\n  padding: var(--#{$prefix}popover-body-padding-y) var(--#{$prefix}popover-body-padding-x);\n  color: var(--#{$prefix}popover-body-color);\n}\n","// Notes on the classes:\n//\n// 1. .carousel.pointer-event should ideally be pan-y (to allow for users to scroll vertically)\n//    even when their scroll action started on a carousel, but for compatibility (with Firefox)\n//    we're preventing all actions instead\n// 2. The .carousel-item-start and .carousel-item-end is used to indicate where\n//    the active slide is heading.\n// 3. .active.carousel-item is the current slide.\n// 4. .active.carousel-item-start and .active.carousel-item-end is the current\n//    slide in its in-transition state. Only one of these occurs at a time.\n// 5. .carousel-item-next.carousel-item-start and .carousel-item-prev.carousel-item-end\n//    is the upcoming slide in transition.\n\n.carousel {\n  position: relative;\n}\n\n.carousel.pointer-event {\n  touch-action: pan-y;\n}\n\n.carousel-inner {\n  position: relative;\n  width: 100%;\n  overflow: hidden;\n  @include clearfix();\n}\n\n.carousel-item {\n  position: relative;\n  display: none;\n  float: left;\n  width: 100%;\n  margin-right: -100%;\n  backface-visibility: hidden;\n  @include transition($carousel-transition);\n}\n\n.carousel-item.active,\n.carousel-item-next,\n.carousel-item-prev {\n  display: block;\n}\n\n.carousel-item-next:not(.carousel-item-start),\n.active.carousel-item-end {\n  transform: translateX(100%);\n}\n\n.carousel-item-prev:not(.carousel-item-end),\n.active.carousel-item-start {\n  transform: translateX(-100%);\n}\n\n\n//\n// Alternate transitions\n//\n\n.carousel-fade {\n  .carousel-item {\n    opacity: 0;\n    transition-property: opacity;\n    transform: none;\n  }\n\n  .carousel-item.active,\n  .carousel-item-next.carousel-item-start,\n  .carousel-item-prev.carousel-item-end {\n    z-index: 1;\n    opacity: 1;\n  }\n\n  .active.carousel-item-start,\n  .active.carousel-item-end {\n    z-index: 0;\n    opacity: 0;\n    @include transition(opacity 0s $carousel-transition-duration);\n  }\n}\n\n\n//\n// Left/right controls for nav\n//\n\n.carousel-control-prev,\n.carousel-control-next {\n  position: absolute;\n  top: 0;\n  bottom: 0;\n  z-index: 1;\n  // Use flex for alignment (1-3)\n  display: flex; // 1. allow flex styles\n  align-items: center; // 2. vertically center contents\n  justify-content: center; // 3. horizontally center contents\n  width: $carousel-control-width;\n  padding: 0;\n  color: $carousel-control-color;\n  text-align: center;\n  background: none;\n  border: 0;\n  opacity: $carousel-control-opacity;\n  @include transition($carousel-control-transition);\n\n  // Hover/focus state\n  &:hover,\n  &:focus {\n    color: $carousel-control-color;\n    text-decoration: none;\n    outline: 0;\n    opacity: $carousel-control-hover-opacity;\n  }\n}\n.carousel-control-prev {\n  left: 0;\n  background-image: if($enable-gradients, linear-gradient(90deg, rgba($black, .25), rgba($black, .001)), null);\n}\n.carousel-control-next {\n  right: 0;\n  background-image: if($enable-gradients, linear-gradient(270deg, rgba($black, .25), rgba($black, .001)), null);\n}\n\n// Icons for within\n.carousel-control-prev-icon,\n.carousel-control-next-icon {\n  display: inline-block;\n  width: $carousel-control-icon-width;\n  height: $carousel-control-icon-width;\n  background-repeat: no-repeat;\n  background-position: 50%;\n  background-size: 100% 100%;\n}\n\n/* rtl:options: {\n  \"autoRename\": true,\n  \"stringMap\":[ {\n    \"name\"    : \"prev-next\",\n    \"search\"  : \"prev\",\n    \"replace\" : \"next\"\n  } ]\n} */\n.carousel-control-prev-icon {\n  background-image: escape-svg($carousel-control-prev-icon-bg);\n}\n.carousel-control-next-icon {\n  background-image: escape-svg($carousel-control-next-icon-bg);\n}\n\n// Optional indicator pips/controls\n//\n// Add a container (such as a list) with the following class and add an item (ideally a focusable control,\n// like a button) with data-bs-target for each slide your carousel holds.\n\n.carousel-indicators {\n  position: absolute;\n  right: 0;\n  bottom: 0;\n  left: 0;\n  z-index: 2;\n  display: flex;\n  justify-content: center;\n  padding: 0;\n  // Use the .carousel-control's width as margin so we don't overlay those\n  margin-right: $carousel-control-width;\n  margin-bottom: 1rem;\n  margin-left: $carousel-control-width;\n\n  [data-bs-target] {\n    box-sizing: content-box;\n    flex: 0 1 auto;\n    width: $carousel-indicator-width;\n    height: $carousel-indicator-height;\n    padding: 0;\n    margin-right: $carousel-indicator-spacer;\n    margin-left: $carousel-indicator-spacer;\n    text-indent: -999px;\n    cursor: pointer;\n    background-color: $carousel-indicator-active-bg;\n    background-clip: padding-box;\n    border: 0;\n    // Use transparent borders to increase the hit area by 10px on top and bottom.\n    border-top: $carousel-indicator-hit-area-height solid transparent;\n    border-bottom: $carousel-indicator-hit-area-height solid transparent;\n    opacity: $carousel-indicator-opacity;\n    @include transition($carousel-indicator-transition);\n  }\n\n  .active {\n    opacity: $carousel-indicator-active-opacity;\n  }\n}\n\n\n// Optional captions\n//\n//\n\n.carousel-caption {\n  position: absolute;\n  right: (100% - $carousel-caption-width) * .5;\n  bottom: $carousel-caption-spacer;\n  left: (100% - $carousel-caption-width) * .5;\n  padding-top: $carousel-caption-padding-y;\n  padding-bottom: $carousel-caption-padding-y;\n  color: $carousel-caption-color;\n  text-align: center;\n}\n\n// Dark mode carousel\n\n@mixin carousel-dark() {\n  .carousel-control-prev-icon,\n  .carousel-control-next-icon {\n    filter: $carousel-dark-control-icon-filter;\n  }\n\n  .carousel-indicators [data-bs-target] {\n    background-color: $carousel-dark-indicator-active-bg;\n  }\n\n  .carousel-caption {\n    color: $carousel-dark-caption-color;\n  }\n}\n\n.carousel-dark {\n  @include carousel-dark();\n}\n\n@if $enable-dark-mode {\n  @include color-mode(dark) {\n    @if $color-mode-type == \"media-query\" {\n      .carousel {\n        @include carousel-dark();\n      }\n    } @else {\n      .carousel,\n      &.carousel {\n        @include carousel-dark();\n      }\n    }\n  }\n}\n","// scss-docs-start clearfix\n@mixin clearfix() {\n  &::after {\n    display: block;\n    clear: both;\n    content: \"\";\n  }\n}\n// scss-docs-end clearfix\n","//\n// Rotating border\n//\n\n.spinner-grow,\n.spinner-border {\n  display: inline-block;\n  width: var(--#{$prefix}spinner-width);\n  height: var(--#{$prefix}spinner-height);\n  vertical-align: var(--#{$prefix}spinner-vertical-align);\n  // stylelint-disable-next-line property-disallowed-list\n  border-radius: 50%;\n  animation: var(--#{$prefix}spinner-animation-speed) linear infinite var(--#{$prefix}spinner-animation-name);\n}\n\n// scss-docs-start spinner-border-keyframes\n@keyframes spinner-border {\n  to { transform: rotate(360deg) #{\"/* rtl:ignore */\"}; }\n}\n// scss-docs-end spinner-border-keyframes\n\n.spinner-border {\n  // scss-docs-start spinner-border-css-vars\n  --#{$prefix}spinner-width: #{$spinner-width};\n  --#{$prefix}spinner-height: #{$spinner-height};\n  --#{$prefix}spinner-vertical-align: #{$spinner-vertical-align};\n  --#{$prefix}spinner-border-width: #{$spinner-border-width};\n  --#{$prefix}spinner-animation-speed: #{$spinner-animation-speed};\n  --#{$prefix}spinner-animation-name: spinner-border;\n  // scss-docs-end spinner-border-css-vars\n\n  border: var(--#{$prefix}spinner-border-width) solid currentcolor;\n  border-right-color: transparent;\n}\n\n.spinner-border-sm {\n  // scss-docs-start spinner-border-sm-css-vars\n  --#{$prefix}spinner-width: #{$spinner-width-sm};\n  --#{$prefix}spinner-height: #{$spinner-height-sm};\n  --#{$prefix}spinner-border-width: #{$spinner-border-width-sm};\n  // scss-docs-end spinner-border-sm-css-vars\n}\n\n//\n// Growing circle\n//\n\n// scss-docs-start spinner-grow-keyframes\n@keyframes spinner-grow {\n  0% {\n    transform: scale(0);\n  }\n  50% {\n    opacity: 1;\n    transform: none;\n  }\n}\n// scss-docs-end spinner-grow-keyframes\n\n.spinner-grow {\n  // scss-docs-start spinner-grow-css-vars\n  --#{$prefix}spinner-width: #{$spinner-width};\n  --#{$prefix}spinner-height: #{$spinner-height};\n  --#{$prefix}spinner-vertical-align: #{$spinner-vertical-align};\n  --#{$prefix}spinner-animation-speed: #{$spinner-animation-speed};\n  --#{$prefix}spinner-animation-name: spinner-grow;\n  // scss-docs-end spinner-grow-css-vars\n\n  background-color: currentcolor;\n  opacity: 0;\n}\n\n.spinner-grow-sm {\n  --#{$prefix}spinner-width: #{$spinner-width-sm};\n  --#{$prefix}spinner-height: #{$spinner-height-sm};\n}\n\n@if $enable-reduced-motion {\n  @media (prefers-reduced-motion: reduce) {\n    .spinner-border,\n    .spinner-grow {\n      --#{$prefix}spinner-animation-speed: #{$spinner-animation-speed * 2};\n    }\n  }\n}\n","// stylelint-disable function-disallowed-list\n\n%offcanvas-css-vars {\n  // scss-docs-start offcanvas-css-vars\n  --#{$prefix}offcanvas-zindex: #{$zindex-offcanvas};\n  --#{$prefix}offcanvas-width: #{$offcanvas-horizontal-width};\n  --#{$prefix}offcanvas-height: #{$offcanvas-vertical-height};\n  --#{$prefix}offcanvas-padding-x: #{$offcanvas-padding-x};\n  --#{$prefix}offcanvas-padding-y: #{$offcanvas-padding-y};\n  --#{$prefix}offcanvas-color: #{$offcanvas-color};\n  --#{$prefix}offcanvas-bg: #{$offcanvas-bg-color};\n  --#{$prefix}offcanvas-border-width: #{$offcanvas-border-width};\n  --#{$prefix}offcanvas-border-color: #{$offcanvas-border-color};\n  --#{$prefix}offcanvas-box-shadow: #{$offcanvas-box-shadow};\n  --#{$prefix}offcanvas-transition: #{transform $offcanvas-transition-duration ease-in-out};\n  --#{$prefix}offcanvas-title-line-height: #{$offcanvas-title-line-height};\n  // scss-docs-end offcanvas-css-vars\n}\n\n@each $breakpoint in map-keys($grid-breakpoints) {\n  $next: breakpoint-next($breakpoint, $grid-breakpoints);\n  $infix: breakpoint-infix($next, $grid-breakpoints);\n\n  .offcanvas#{$infix} {\n    @extend %offcanvas-css-vars;\n  }\n}\n\n@each $breakpoint in map-keys($grid-breakpoints) {\n  $next: breakpoint-next($breakpoint, $grid-breakpoints);\n  $infix: breakpoint-infix($next, $grid-breakpoints);\n\n  .offcanvas#{$infix} {\n    @include media-breakpoint-down($next) {\n      position: fixed;\n      bottom: 0;\n      z-index: var(--#{$prefix}offcanvas-zindex);\n      display: flex;\n      flex-direction: column;\n      max-width: 100%;\n      color: var(--#{$prefix}offcanvas-color);\n      visibility: hidden;\n      background-color: var(--#{$prefix}offcanvas-bg);\n      background-clip: padding-box;\n      outline: 0;\n      @include box-shadow(var(--#{$prefix}offcanvas-box-shadow));\n      @include transition(var(--#{$prefix}offcanvas-transition));\n\n      &.offcanvas-start {\n        top: 0;\n        left: 0;\n        width: var(--#{$prefix}offcanvas-width);\n        border-right: var(--#{$prefix}offcanvas-border-width) solid var(--#{$prefix}offcanvas-border-color);\n        transform: translateX(-100%);\n      }\n\n      &.offcanvas-end {\n        top: 0;\n        right: 0;\n        width: var(--#{$prefix}offcanvas-width);\n        border-left: var(--#{$prefix}offcanvas-border-width) solid var(--#{$prefix}offcanvas-border-color);\n        transform: translateX(100%);\n      }\n\n      &.offcanvas-top {\n        top: 0;\n        right: 0;\n        left: 0;\n        height: var(--#{$prefix}offcanvas-height);\n        max-height: 100%;\n        border-bottom: var(--#{$prefix}offcanvas-border-width) solid var(--#{$prefix}offcanvas-border-color);\n        transform: translateY(-100%);\n      }\n\n      &.offcanvas-bottom {\n        right: 0;\n        left: 0;\n        height: var(--#{$prefix}offcanvas-height);\n        max-height: 100%;\n        border-top: var(--#{$prefix}offcanvas-border-width) solid var(--#{$prefix}offcanvas-border-color);\n        transform: translateY(100%);\n      }\n\n      &.showing,\n      &.show:not(.hiding) {\n        transform: none;\n      }\n\n      &.showing,\n      &.hiding,\n      &.show {\n        visibility: visible;\n      }\n    }\n\n    @if not ($infix == \"\") {\n      @include media-breakpoint-up($next) {\n        --#{$prefix}offcanvas-height: auto;\n        --#{$prefix}offcanvas-border-width: 0;\n        background-color: transparent !important; // stylelint-disable-line declaration-no-important\n\n        .offcanvas-header {\n          display: none;\n        }\n\n        .offcanvas-body {\n          display: flex;\n          flex-grow: 0;\n          padding: 0;\n          overflow-y: visible;\n          // Reset `background-color` in case `.bg-*` classes are used in offcanvas\n          background-color: transparent !important; // stylelint-disable-line declaration-no-important\n        }\n      }\n    }\n  }\n}\n\n.offcanvas-backdrop {\n  @include overlay-backdrop($zindex-offcanvas-backdrop, $offcanvas-backdrop-bg, $offcanvas-backdrop-opacity);\n}\n\n.offcanvas-header {\n  display: flex;\n  align-items: center;\n  justify-content: space-between;\n  padding: var(--#{$prefix}offcanvas-padding-y) var(--#{$prefix}offcanvas-padding-x);\n\n  .btn-close {\n    padding: calc(var(--#{$prefix}offcanvas-padding-y) * .5) calc(var(--#{$prefix}offcanvas-padding-x) * .5);\n    margin-top: calc(-.5 * var(--#{$prefix}offcanvas-padding-y));\n    margin-right: calc(-.5 * var(--#{$prefix}offcanvas-padding-x));\n    margin-bottom: calc(-.5 * var(--#{$prefix}offcanvas-padding-y));\n  }\n}\n\n.offcanvas-title {\n  margin-bottom: 0;\n  line-height: var(--#{$prefix}offcanvas-title-line-height);\n}\n\n.offcanvas-body {\n  flex-grow: 1;\n  padding: var(--#{$prefix}offcanvas-padding-y) var(--#{$prefix}offcanvas-padding-x);\n  overflow-y: auto;\n}\n",".placeholder {\n  display: inline-block;\n  min-height: 1em;\n  vertical-align: middle;\n  cursor: wait;\n  background-color: currentcolor;\n  opacity: $placeholder-opacity-max;\n\n  &.btn::before {\n    display: inline-block;\n    content: \"\";\n  }\n}\n\n// Sizing\n.placeholder-xs {\n  min-height: .6em;\n}\n\n.placeholder-sm {\n  min-height: .8em;\n}\n\n.placeholder-lg {\n  min-height: 1.2em;\n}\n\n// Animation\n.placeholder-glow {\n  .placeholder {\n    animation: placeholder-glow 2s ease-in-out infinite;\n  }\n}\n\n@keyframes placeholder-glow {\n  50% {\n    opacity: $placeholder-opacity-min;\n  }\n}\n\n.placeholder-wave {\n  mask-image: linear-gradient(130deg, $black 55%, rgba(0, 0, 0, (1 - $placeholder-opacity-min)) 75%, $black 95%);\n  mask-size: 200% 100%;\n  animation: placeholder-wave 2s linear infinite;\n}\n\n@keyframes placeholder-wave {\n  100% {\n    mask-position: -200% 0%;\n  }\n}\n","// All-caps `RGBA()` function used because of this Sass bug: https://github.com/sass/node-sass/issues/2251\n@each $color, $value in $theme-colors {\n  .text-bg-#{$color} {\n    color: color-contrast($value) if($enable-important-utilities, !important, null);\n    background-color: RGBA(var(--#{$prefix}#{$color}-rgb), var(--#{$prefix}bg-opacity, 1)) if($enable-important-utilities, !important, null);\n  }\n}\n","// All-caps `RGBA()` function used because of this Sass bug: https://github.com/sass/node-sass/issues/2251\n@each $color, $value in $theme-colors {\n  .link-#{$color} {\n    color: RGBA(var(--#{$prefix}#{$color}-rgb), var(--#{$prefix}link-opacity, 1)) if($enable-important-utilities, !important, null);\n    text-decoration-color: RGBA(var(--#{$prefix}#{$color}-rgb), var(--#{$prefix}link-underline-opacity, 1)) if($enable-important-utilities, !important, null);\n\n    @if $link-shade-percentage != 0 {\n      &:hover,\n      &:focus {\n        $hover-color: if(color-contrast($value) == $color-contrast-light, shade-color($value, $link-shade-percentage), tint-color($value, $link-shade-percentage));\n        color: RGBA(#{to-rgb($hover-color)}, var(--#{$prefix}link-opacity, 1)) if($enable-important-utilities, !important, null);\n        text-decoration-color: RGBA(to-rgb($hover-color), var(--#{$prefix}link-underline-opacity, 1)) if($enable-important-utilities, !important, null);\n      }\n    }\n  }\n}\n\n// One-off special link helper as a bridge until v6\n.link-body-emphasis {\n  color: RGBA(var(--#{$prefix}emphasis-color-rgb), var(--#{$prefix}link-opacity, 1)) if($enable-important-utilities, !important, null);\n  text-decoration-color: RGBA(var(--#{$prefix}emphasis-color-rgb), var(--#{$prefix}link-underline-opacity, 1)) if($enable-important-utilities, !important, null);\n\n  @if $link-shade-percentage != 0 {\n    &:hover,\n    &:focus {\n      color: RGBA(var(--#{$prefix}emphasis-color-rgb), var(--#{$prefix}link-opacity, .75)) if($enable-important-utilities, !important, null);\n      text-decoration-color: RGBA(var(--#{$prefix}emphasis-color-rgb), var(--#{$prefix}link-underline-opacity, .75)) if($enable-important-utilities, !important, null);\n    }\n  }\n}\n",".focus-ring:focus {\n  outline: 0;\n  // By default, there is no `--bs-focus-ring-x`, `--bs-focus-ring-y`, or `--bs-focus-ring-blur`, but we provide CSS variables with fallbacks to initial `0` values\n  box-shadow: var(--#{$prefix}focus-ring-x, 0) var(--#{$prefix}focus-ring-y, 0) var(--#{$prefix}focus-ring-blur, 0) var(--#{$prefix}focus-ring-width) var(--#{$prefix}focus-ring-color);\n}\n",".icon-link {\n  display: inline-flex;\n  gap: $icon-link-gap;\n  align-items: center;\n  text-decoration-color: rgba(var(--#{$prefix}link-color-rgb), var(--#{$prefix}link-opacity, .5));\n  text-underline-offset: $icon-link-underline-offset;\n  backface-visibility: hidden;\n\n  > .bi {\n    flex-shrink: 0;\n    width: $icon-link-icon-size;\n    height: $icon-link-icon-size;\n    fill: currentcolor;\n    @include transition($icon-link-icon-transition);\n  }\n}\n\n.icon-link-hover {\n  &:hover,\n  &:focus-visible {\n    > .bi {\n      transform: var(--#{$prefix}icon-link-transform, $icon-link-icon-transform);\n    }\n  }\n}\n","// Credit: Nicolas Gallagher and SUIT CSS.\n\n.ratio {\n  position: relative;\n  width: 100%;\n\n  &::before {\n    display: block;\n    padding-top: var(--#{$prefix}aspect-ratio);\n    content: \"\";\n  }\n\n  > * {\n    position: absolute;\n    top: 0;\n    left: 0;\n    width: 100%;\n    height: 100%;\n  }\n}\n\n@each $key, $ratio in $aspect-ratios {\n  .ratio-#{$key} {\n    --#{$prefix}aspect-ratio: #{$ratio};\n  }\n}\n","// Shorthand\n\n.fixed-top {\n  position: fixed;\n  top: 0;\n  right: 0;\n  left: 0;\n  z-index: $zindex-fixed;\n}\n\n.fixed-bottom {\n  position: fixed;\n  right: 0;\n  bottom: 0;\n  left: 0;\n  z-index: $zindex-fixed;\n}\n\n// Responsive sticky top and bottom\n@each $breakpoint in map-keys($grid-breakpoints) {\n  @include media-breakpoint-up($breakpoint) {\n    $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n    .sticky#{$infix}-top {\n      position: sticky;\n      top: 0;\n      z-index: $zindex-sticky;\n    }\n\n    .sticky#{$infix}-bottom {\n      position: sticky;\n      bottom: 0;\n      z-index: $zindex-sticky;\n    }\n  }\n}\n","// scss-docs-start stacks\n.hstack {\n  display: flex;\n  flex-direction: row;\n  align-items: center;\n  align-self: stretch;\n}\n\n.vstack {\n  display: flex;\n  flex: 1 1 auto;\n  flex-direction: column;\n  align-self: stretch;\n}\n// scss-docs-end stacks\n","//\n// Visually hidden\n//\n\n.visually-hidden,\n.visually-hidden-focusable:not(:focus):not(:focus-within) {\n  @include visually-hidden();\n}\n","// stylelint-disable declaration-no-important\n\n// Hide content visually while keeping it accessible to assistive technologies\n//\n// See: https://www.a11yproject.com/posts/2013-01-11-how-to-hide-content/\n// See: https://kittygiraudel.com/2016/10/13/css-hide-and-seek/\n\n@mixin visually-hidden() {\n  width: 1px !important;\n  height: 1px !important;\n  padding: 0 !important;\n  margin: -1px !important; // Fix for https://github.com/twbs/bootstrap/issues/25686\n  overflow: hidden !important;\n  clip: rect(0, 0, 0, 0) !important;\n  white-space: nowrap !important;\n  border: 0 !important;\n\n  // Fix for positioned table caption that could become anonymous cells\n  &:not(caption) {\n    position: absolute !important;\n  }\n}\n\n// Use to only display content when it's focused, or one of its child elements is focused\n// (i.e. when focus is within the element/container that the class was applied to)\n//\n// Useful for \"Skip to main content\" links; see https://www.w3.org/TR/2013/NOTE-WCAG20-TECHS-20130905/G1\n\n@mixin visually-hidden-focusable() {\n  &:not(:focus):not(:focus-within) {\n    @include visually-hidden();\n  }\n}\n","//\n// Stretched link\n//\n\n.stretched-link {\n  &::#{$stretched-link-pseudo-element} {\n    position: absolute;\n    top: 0;\n    right: 0;\n    bottom: 0;\n    left: 0;\n    z-index: $stretched-link-z-index;\n    content: \"\";\n  }\n}\n","//\n// Text truncation\n//\n\n.text-truncate {\n  @include text-truncate();\n}\n","// Text truncate\n// Requires inline-block or block for proper styling\n\n@mixin text-truncate() {\n  overflow: hidden;\n  text-overflow: ellipsis;\n  white-space: nowrap;\n}\n",".vr {\n  display: inline-block;\n  align-self: stretch;\n  width: $vr-border-width;\n  min-height: 1em;\n  background-color: currentcolor;\n  opacity: $hr-opacity;\n}\n","// Utility generator\n// Used to generate utilities & print utilities\n@mixin generate-utility($utility, $infix: \"\", $is-rfs-media-query: false) {\n  $values: map-get($utility, values);\n\n  // If the values are a list or string, convert it into a map\n  @if type-of($values) == \"string\" or type-of(nth($values, 1)) != \"list\" {\n    $values: zip($values, $values);\n  }\n\n  @each $key, $value in $values {\n    $properties: map-get($utility, property);\n\n    // Multiple properties are possible, for example with vertical or horizontal margins or paddings\n    @if type-of($properties) == \"string\" {\n      $properties: append((), $properties);\n    }\n\n    // Use custom class if present\n    $property-class: if(map-has-key($utility, class), map-get($utility, class), nth($properties, 1));\n    $property-class: if($property-class == null, \"\", $property-class);\n\n    // Use custom CSS variable name if present, otherwise default to `class`\n    $css-variable-name: if(map-has-key($utility, css-variable-name), map-get($utility, css-variable-name), map-get($utility, class));\n\n    // State params to generate pseudo-classes\n    $state: if(map-has-key($utility, state), map-get($utility, state), ());\n\n    $infix: if($property-class == \"\" and str-slice($infix, 1, 1) == \"-\", str-slice($infix, 2), $infix);\n\n    // Don't prefix if value key is null (e.g. with shadow class)\n    $property-class-modifier: if($key, if($property-class == \"\" and $infix == \"\", \"\", \"-\") + $key, \"\");\n\n    @if map-get($utility, rfs) {\n      // Inside the media query\n      @if $is-rfs-media-query {\n        $val: rfs-value($value);\n\n        // Do not render anything if fluid and non fluid values are the same\n        $value: if($val == rfs-fluid-value($value), null, $val);\n      }\n      @else {\n        $value: rfs-fluid-value($value);\n      }\n    }\n\n    $is-css-var: map-get($utility, css-var);\n    $is-local-vars: map-get($utility, local-vars);\n    $is-rtl: map-get($utility, rtl);\n\n    @if $value != null {\n      @if $is-rtl == false {\n        /* rtl:begin:remove */\n      }\n\n      @if $is-css-var {\n        .#{$property-class + $infix + $property-class-modifier} {\n          --#{$prefix}#{$css-variable-name}: #{$value};\n        }\n\n        @each $pseudo in $state {\n          .#{$property-class + $infix + $property-class-modifier}-#{$pseudo}:#{$pseudo} {\n            --#{$prefix}#{$css-variable-name}: #{$value};\n          }\n        }\n      } @else {\n        .#{$property-class + $infix + $property-class-modifier} {\n          @each $property in $properties {\n            @if $is-local-vars {\n              @each $local-var, $variable in $is-local-vars {\n                --#{$prefix}#{$local-var}: #{$variable};\n              }\n            }\n            #{$property}: $value if($enable-important-utilities, !important, null);\n          }\n        }\n\n        @each $pseudo in $state {\n          .#{$property-class + $infix + $property-class-modifier}-#{$pseudo}:#{$pseudo} {\n            @each $property in $properties {\n              @if $is-local-vars {\n                @each $local-var, $variable in $is-local-vars {\n                  --#{$prefix}#{$local-var}: #{$variable};\n                }\n              }\n              #{$property}: $value if($enable-important-utilities, !important, null);\n            }\n          }\n        }\n      }\n\n      @if $is-rtl == false {\n        /* rtl:end:remove */\n      }\n    }\n  }\n}\n","// Loop over each breakpoint\n@each $breakpoint in map-keys($grid-breakpoints) {\n\n  // Generate media query if needed\n  @include media-breakpoint-up($breakpoint) {\n    $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n    // Loop over each utility property\n    @each $key, $utility in $utilities {\n      // The utility can be disabled with `false`, thus check if the utility is a map first\n      // Only proceed if responsive media queries are enabled or if it's the base media query\n      @if type-of($utility) == \"map\" and (map-get($utility, responsive) or $infix == \"\") {\n        @include generate-utility($utility, $infix);\n      }\n    }\n  }\n}\n\n// RFS rescaling\n@media (min-width: $rfs-mq-value) {\n  @each $breakpoint in map-keys($grid-breakpoints) {\n    $infix: breakpoint-infix($breakpoint, $grid-breakpoints);\n\n    @if (map-get($grid-breakpoints, $breakpoint) < $rfs-breakpoint) {\n      // Loop over each utility property\n      @each $key, $utility in $utilities {\n        // The utility can be disabled with `false`, thus check if the utility is a map first\n        // Only proceed if responsive media queries are enabled or if it's the base media query\n        @if type-of($utility) == \"map\" and map-get($utility, rfs) and (map-get($utility, responsive) or $infix == \"\") {\n          @include generate-utility($utility, $infix, true);\n        }\n      }\n    }\n  }\n}\n\n\n// Print utilities\n@media print {\n  @each $key, $utility in $utilities {\n    // The utility can be disabled with `false`, thus check if the utility is a map first\n    // Then check if the utility needs print styles\n    @if type-of($utility) == \"map\" and map-get($utility, print) == true {\n      @include generate-utility($utility, \"-print\");\n    }\n  }\n}\n"],"names":[],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/_build/html/_static/styles/pydata-sphinx-theme.css b/docs/_build/html/_static/styles/pydata-sphinx-theme.css
deleted file mode 100644
index db7635b..0000000
--- a/docs/_build/html/_static/styles/pydata-sphinx-theme.css
+++ /dev/null
@@ -1,2 +0,0 @@
-html{--pst-header-height:4rem;--pst-header-article-height:calc(var(--pst-header-height)*2/3);--pst-sidebar-secondary:17rem;--pst-font-size-base:1rem;--pst-font-size-h1:2.5rem;--pst-font-size-h2:2rem;--pst-font-size-h3:1.75rem;--pst-font-size-h4:1.5rem;--pst-font-size-h5:1.25rem;--pst-font-size-h6:1.1rem;--pst-font-size-milli:0.9rem;--pst-sidebar-font-size:0.9rem;--pst-sidebar-font-size-mobile:1.1rem;--pst-sidebar-header-font-size:1.2rem;--pst-sidebar-header-font-weight:600;--pst-admonition-font-weight-heading:600;--pst-font-weight-caption:300;--pst-font-weight-heading:400;--pst-font-family-base-system:-apple-system,BlinkMacSystemFont,Segoe UI,"Helvetica Neue",Arial,sans-serif,Apple Color Emoji,Segoe UI Emoji,Segoe UI Symbol;--pst-font-family-monospace-system:"SFMono-Regular",Menlo,Consolas,Monaco,Liberation Mono,Lucida Console,monospace;--pst-font-family-base:var(--pst-font-family-base-system);--pst-font-family-heading:var(--pst-font-family-base-system);--pst-font-family-monospace:var(--pst-font-family-monospace-system);--pst-font-size-icon:1.5rem;--pst-icon-check-circle:"";--pst-icon-info-circle:"";--pst-icon-exclamation-triangle:"";--pst-icon-exclamation-circle:"";--pst-icon-times-circle:"";--pst-icon-lightbulb:"";--pst-icon-download:"";--pst-icon-angle-left:"";--pst-icon-angle-right:"";--pst-icon-external-link:"";--pst-icon-search-minus:"";--pst-icon-github:"";--pst-icon-gitlab:"";--pst-icon-share:"";--pst-icon-bell:"";--pst-icon-pencil:"";--pst-breadcrumb-divider:"";--pst-icon-admonition-default:var(--pst-icon-bell);--pst-icon-admonition-note:var(--pst-icon-info-circle);--pst-icon-admonition-attention:var(--pst-icon-exclamation-circle);--pst-icon-admonition-caution:var(--pst-icon-exclamation-triangle);--pst-icon-admonition-warning:var(--pst-icon-exclamation-triangle);--pst-icon-admonition-danger:var(--pst-icon-exclamation-triangle);--pst-icon-admonition-error:var(--pst-icon-times-circle);--pst-icon-admonition-hint:var(--pst-icon-lightbulb);--pst-icon-admonition-tip:var(--pst-icon-lightbulb);--pst-icon-admonition-important:var(--pst-icon-exclamation-circle);--pst-icon-admonition-seealso:var(--pst-icon-share);--pst-icon-admonition-todo:var(--pst-icon-pencil);--pst-icon-versionmodified-default:var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-added:var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-changed:var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-deprecated:var(--pst-icon-exclamation-circle);font-size:var(--pst-font-size-base);scroll-padding-top:calc(var(--pst-header-height) + 1rem)}body{background-color:var(--pst-color-background);color:var(--pst-color-text-base);display:flex;flex-direction:column;font-family:var(--pst-font-family-base);font-weight:400;line-height:1.65;min-height:100vh}body::-webkit-scrollbar-track{background:var(--pst-color-background)}p{color:var(--pst-color-text-base);font-size:1em;margin-bottom:1.15rem}p.rubric{border-bottom:1px solid var(--pst-color-border)}p.centered{text-align:center}a{word-wrap:break-word;color:var(--pst-color-link);text-decoration:underline;text-decoration-thickness:max(1px,.0625rem);text-underline-offset:.1578em}a:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration-skip-ink:none;text-decoration-thickness:max(3px,.1875rem,.12em)}a:active,a:visited{color:var(--pst-color-link)}a:visited:hover{color:var(--pst-color-link-hover)}a:focus-visible{outline:2px solid var(--pst-color-accent)}a.headerlink{color:var(--pst-color-secondary);font-size:.8em;margin-left:.2em;opacity:.7;padding:0 4px;text-decoration:none;transition:all .2s ease-out;user-select:none}a.headerlink:hover{opacity:1}a.github:before,a.gitlab:before{color:var(--pst-color-text-muted);font:var(--fa-font-brands);margin-right:.25rem}a.github:before{content:var(--pst-icon-github)}a.gitlab:before{content:var(--pst-icon-gitlab)}.heading-style,h1,h2,h3,h4,h5,h6{font-family:var(--pst-font-family-heading);font-weight:var(--pst-font-weight-heading);line-height:1.15;margin:2.75rem 0 1.05rem}h1{font-size:var(--pst-font-size-h1);margin-top:0}h1,h2{color:var(--pst-heading-color)}h2{font-size:var(--pst-font-size-h2)}h3{font-size:var(--pst-font-size-h3)}h3,h4{color:var(--pst-heading-color)}h4{font-size:var(--pst-font-size-h4)}h5{font-size:var(--pst-font-size-h5)}h5,h6{color:var(--pst-color-text-base)}h6{font-size:var(--pst-font-size-h6)}.text_small,small{font-size:var(--pst-font-size-milli)}hr{border:0;border-top:1px solid var(--pst-color-border)}code,kbd,pre,samp{font-family:var(--pst-font-family-monospace)}kbd{background-color:var(--pst-color-on-background);color:var(--pst-color-text-muted)}kbd:not(.compound){border:1px solid var(--pst-color-border);box-shadow:1px 1px 1px var(--pst-color-shadow);margin:0 .1rem;padding:.1rem .4rem}code{color:var(--pst-color-inline-code)}pre{background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);border-radius:.25rem;color:var(--pst-color-text-base);line-height:1.2em;margin:1.5em 0;padding:1rem}pre .linenos{opacity:.8;padding-right:10px}#pst-back-to-top{background-color:var(--pst-color-secondary);border:none;color:var(--pst-color-secondary-text);display:none;left:50vw;position:fixed;top:80vh;transform:translate(-50%);z-index:1080}.skip-link{background-color:var(--pst-color-warning);border-bottom:1px solid var(--pst-color-border);color:var(--pst-color-warning-text)!important;left:0;padding:.5rem;position:fixed;right:0;text-align:center;top:0;transform:translateY(-100%);transition:transform .15s ease-in-out;z-index:1055}.skip-link:focus{outline:3px solid #14181e;transform:translateY(0)}.bd-container{display:flex;flex-grow:1;justify-content:center}.bd-container .bd-container__inner{display:flex}.bd-page-width{width:100%}@media(min-width:960px){.bd-page-width{max-width:88rem}}.bd-header-announcement,.bd-header-version-warning{align-items:center;display:flex;justify-content:center;min-height:3rem;padding:.5rem 12.5%;position:relative;text-align:center;width:100%}@media(max-width:959.98px){.bd-header-announcement,.bd-header-version-warning{padding:.5rem 2%}}.bd-header-announcement p,.bd-header-version-warning p{font-weight:700;margin:0}.bd-header-announcement:after,.bd-header-version-warning:after{content:"";height:100%;left:0;position:absolute;top:0;width:100%;z-index:-1}.bd-header-announcement:empty,.bd-header-version-warning:empty{display:none}.bd-header-announcement a,.bd-header-version-warning a{color:var(--pst-color-inline-code-links)}.bd-header-announcement:after{background-color:var(--pst-color-secondary-bg)}.bd-header-version-warning:after{background-color:var(--pst-color-danger-bg)}.bd-main{display:flex;flex-direction:column;flex-grow:1;min-width:0}.bd-main .bd-content{display:flex;height:100%;justify-content:center}.bd-main .bd-content .bd-article-container{display:flex;flex-direction:column;justify-content:start;max-width:60em;overflow-x:auto;padding:1rem;width:100%}@media(min-width:1200px){.bd-main .bd-content .bd-article-container .bd-article{padding-left:2rem;padding-top:1.5rem}}.bd-footer{border-top:1px solid var(--pst-color-border);width:100%}.bd-footer .bd-footer__inner{display:flex;flex-grow:1;margin:auto;padding:1rem}.bd-footer .footer-items__center,.bd-footer .footer-items__end,.bd-footer .footer-items__start{display:flex;flex-direction:column;flex-grow:1;gap:.5rem;justify-content:center}.bd-footer .footer-items__center{text-align:center}.bd-footer .footer-items__end{text-align:end}.bd-footer .footer-item p{margin-bottom:0}.bd-footer-article{margin-top:auto}.bd-footer-article .footer-article-items{display:flex;flex-direction:column}.bd-footer-content .footer-content-items{display:flex;flex-direction:column;margin-top:auto}.bd-header{background:var(--pst-color-on-background)!important;box-shadow:0 .125rem .25rem 0 var(--pst-color-shadow);justify-content:center;max-width:100vw;padding:0;position:sticky;top:0;width:100%;z-index:1030}.bd-header .bd-header__inner{align-items:center;display:flex;height:fit-content;padding-left:1rem;padding-right:1rem}.bd-header .navbar-item{align-items:center;display:flex;height:var(--pst-header-height);max-height:var(--pst-header-height)}.bd-header .navbar-header-items{flex-shrink:1}@media(min-width:960px){.bd-header .navbar-header-items{display:flex;flex-grow:1;padding:0 0 0 .5rem}}.bd-header .navbar-header-items__center,.bd-header .navbar-header-items__end,.bd-header .navbar-header-items__start{align-items:center;display:flex;flex-flow:wrap;row-gap:0}.bd-header .navbar-header-items__center,.bd-header .navbar-header-items__end{column-gap:1rem}.bd-header .navbar-header-items__start{flex-shrink:0;gap:.5rem;margin-right:auto}.bd-header .navbar-header-items__end{justify-content:end}.bd-header .navbar-nav{display:flex}@media(min-width:960px){.bd-header .navbar-nav{align-items:center}}.bd-header .navbar-nav li a.nav-link{color:var(--pst-color-text-muted);text-decoration:none}.bd-header .navbar-nav li a.nav-link:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.bd-header .navbar-nav li a.nav-link:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-nav>.current>.nav-link{border-bottom:max(3px,.1875rem,.12em) solid var(--pst-color-primary);color:var(--pst-color-primary);font-weight:600}.bd-header .navbar-nav .dropdown button{border:none;color:var(--pst-color-text-muted);display:unset}.bd-header .navbar-nav .dropdown button:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.bd-header .navbar-nav .dropdown button:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-nav .dropdown .dropdown-menu{background-color:var(--pst-color-on-background);border:1px solid var(--pst-color-border);box-shadow:0 0 .3rem .1rem var(--pst-color-shadow);margin:.5rem 0;min-width:20rem;padding:.5rem 0;z-index:1070}.bd-header .navbar-nav .dropdown .dropdown-menu .dropdown-item{padding:.25rem 1.5rem}.bd-header .navbar-nav .dropdown .dropdown-menu .dropdown-item:focus:not(:hover):not(:active){background-color:inherit}.bd-header .navbar-nav .dropdown .dropdown-menu:not(.show){display:none}@media(min-width:960px){.navbar-center-items .navbar-item{display:inline-block}}.nav-link{transition:none}.nav-link:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.nav-link.nav-external:after{content:var(--pst-icon-external-link);font:var(--fa-font-solid);font-size:.75em;margin-left:.3em}.bd-navbar-elements li.nav-item i{font-size:.7rem;padding-left:2px;vertical-align:middle}.bd-header label.sidebar-toggle{align-items:center;color:var(--pst-color-muted);cursor:pointer;display:flex;font-size:var(--pst-font-size-icon);margin-bottom:0;padding-bottom:.25rem}.bd-header label.primary-toggle{margin-right:1rem}@media(min-width:960px){.bd-header label.primary-toggle{display:none}}.bd-header label.secondary-toggle{margin-left:1rem}@media(min-width:1200px){.bd-header label.secondary-toggle{display:none}}.bd-header label:hover{box-shadow:0 max(3px,.1875rem,.12em) 0 var(--pst-color-link-hover);color:var(--pst-color-link-hover)}.bd-header label:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-header-items{display:none}@media(min-width:960px){.bd-header .navbar-header-items{display:inherit}}.navbar-persistent--mobile{margin-left:auto}@media(min-width:960px){.navbar-persistent--mobile{display:none}}.navbar-persistent--container{display:none}@media(min-width:960px){.navbar-persistent--container{display:flex}}.header-article__inner{display:flex;padding:0 .5rem}.header-article__inner .header-article-item{height:var(--pst-header-article-height);min-height:var(--pst-header-article-height)}.header-article__inner .header-article-items__end,.header-article__inner .header-article-items__start{align-items:start;display:flex;gap:.5rem}.header-article__inner .header-article-items__end{margin-left:auto}.bd-sidebar-primary{background-color:var(--pst-color-background);border-right:1px solid var(--pst-color-border);display:flex;flex:0 0 auto;flex-direction:column;font-size:var(--pst-sidebar-font-size-mobile);gap:1rem;max-height:calc(100vh - var(--pst-header-height));overflow-y:auto;padding:2rem 1rem 1rem;position:sticky;top:var(--pst-header-height);width:25%}@media(min-width:960px){.bd-sidebar-primary{font-size:var(--pst-sidebar-font-size)}}.bd-sidebar-primary .nav-link{font-size:var(--pst-sidebar-font-size-mobile)}.bd-sidebar-primary.no-sidebar{border-right:0}@media(min-width:960px){.bd-sidebar-primary.hide-on-wide{display:none}}.bd-sidebar-primary h1,.bd-sidebar-primary h2,.bd-sidebar-primary h3,.bd-sidebar-primary h4{color:var(--pst-color-text-base)}.bd-sidebar-primary .sidebar-primary-items__end .sidebar-primary-item,.bd-sidebar-primary .sidebar-primary-items__start .sidebar-primary-item{padding:.5rem 0}.bd-sidebar-primary .sidebar-header-items{display:flex;flex-direction:column}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__title{color:var(--pst-color-text-base);font-size:var(--pst-sidebar-header-font-size);font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}.bd-sidebar-primary .sidebar-header-items .nav-item.dropdown button{display:none}.bd-sidebar-primary .sidebar-header-items .nav-item.dropdown .dropdown-menu{background-color:inherit;border:none;display:flex;flex-direction:column;font-size:inherit;margin:0;padding:0}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__center{display:flex;flex-direction:column}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__end{align-items:center;display:flex;gap:.5rem}@media(min-width:960px){.bd-sidebar-primary .sidebar-header-items{display:none}}.bd-sidebar-primary .sidebar-primary-items__start{border-top:1px solid var(--pst-color-border)}@media(min-width:960px){.bd-sidebar-primary .sidebar-primary-items__start{border-top:none}}.bd-sidebar-primary .sidebar-primary-items__end{margin-bottom:1em;margin-top:auto}.bd-sidebar-primary .list-caption{list-style:none;padding-left:0}.bd-sidebar-primary li{position:relative}.bd-sidebar-primary li.has-children>.reference{padding-right:30px}.bd-sidebar-primary label.toctree-toggle{align-items:center;cursor:pointer;display:flex;height:30px;justify-content:center;position:absolute;right:0;top:0;width:30px}.bd-sidebar-primary label.toctree-toggle:hover{background:var(--pst-color-surface)}.bd-sidebar-primary label.toctree-toggle i{display:inline-block;font-size:.75rem;text-align:center}.bd-sidebar-primary label.toctree-toggle i:hover{color:var(--pst-color-primary)}.bd-sidebar-primary .label-parts{height:100%;width:100%}.bd-sidebar-primary .label-parts:hover{background:none}.bd-sidebar-primary .label-parts i{position:absolute;right:0;top:.3em;width:30px}nav.bd-links{margin-right:-1rem}@media(min-width:960px){nav.bd-links{display:block}}nav.bd-links ul{list-style:none}nav.bd-links ul ul{padding:0 0 0 1rem}nav.bd-links li>a{box-shadow:none;color:var(--pst-color-text-muted);display:block;padding:.25rem .65rem;text-decoration:none}nav.bd-links li>a:hover{text-decoration-skip:none;background-color:transparent;text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(3px,.1875rem,.12em)}nav.bd-links li>a:active,nav.bd-links li>a:hover{color:var(--pst-color-link-hover)}nav.bd-links li>a.reference.external:after{content:var(--pst-icon-external-link);font:var(--fa-font-solid);font-size:.75em;margin-left:.3em}nav.bd-links .current>a{background-color:transparent;box-shadow:inset max(3px,.1875rem,.12em) 0 0 var(--pst-color-primary);color:var(--pst-color-primary);font-weight:600}nav.bd-links p.bd-links__title{font-size:var(--pst-sidebar-header-font-size)}nav.bd-links p.bd-links__title,nav.bd-links p.caption{font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}nav.bd-links p.caption{color:var(--pst-color-text-base);font-size:var(--pst-sidebar-font-size-mobile);margin-top:1.25rem;position:relative}nav.bd-links p.caption:first-child{margin-top:0}@media(min-width:960px){nav.bd-links p.caption{font-size:var(--pst-sidebar-font-size)}}.bd-sidebar-secondary{background-color:var(--pst-color-background);display:flex;flex-direction:column;flex-shrink:0;font-size:var(--pst-sidebar-font-size-mobile);max-height:calc(100vh - var(--pst-header-height));order:2;overflow-y:auto;padding:2rem 1rem 1rem;position:sticky;top:var(--pst-header-height);width:var(--pst-sidebar-secondary)}@media(min-width:1200px){.bd-sidebar-secondary{font-size:var(--pst-sidebar-font-size)}}.sidebar-secondary-item{padding:.5rem}@media(min-width:1200px){.sidebar-secondary-item{border-left:1px solid var(--pst-color-border);padding-left:1rem}}.sidebar-secondary-item i{padding-right:.5rem}input.sidebar-toggle{display:none}label.overlay{background-color:#000;height:0;left:0;opacity:.5;position:fixed;top:0;transition:opacity .2s ease-out;width:0;z-index:1050}input#__primary:checked+label.overlay.overlay-primary,input#__secondary:checked+label.overlay.overlay-secondary{height:100vh;width:100vw}input#__primary:checked~.bd-container .bd-sidebar-primary{margin-left:0;visibility:visible}input#__secondary:checked~.bd-container .bd-sidebar-secondary{margin-right:0;visibility:visible}@media(min-width:960px){label.sidebar-toggle.primary-toggle{display:none}input#__primary:checked+label.overlay.overlay-primary{height:0;width:0}.bd-sidebar-primary{margin-left:0;visibility:visible}}@media(max-width:959.98px){.bd-sidebar-primary{flex-grow:.75;height:100vh;left:0;margin-left:-75%;max-height:100vh;max-width:350px;position:fixed;top:0;transition:visibility .2s ease-out,margin .2s ease-out;visibility:hidden;width:75%;z-index:1055}}@media(max-width:1199.98px){.bd-sidebar-secondary{flex-grow:.75;height:100vh;margin-right:-75%;max-height:100vh;max-width:350px;position:fixed;right:0;top:0;transition:visibility .2s ease-out,margin .2s ease-out;visibility:hidden;width:75%;z-index:1055}}ul.bd-breadcrumbs{display:flex;flex-wrap:wrap;font-size:.8rem;list-style:none;padding-left:0}ul.bd-breadcrumbs li.breadcrumb-item{align-items:baseline;display:flex;font-weight:700}ul.bd-breadcrumbs li.breadcrumb-item a{color:var(--pst-color-text-muted);text-decoration:none}ul.bd-breadcrumbs li.breadcrumb-item a:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}ul.bd-breadcrumbs li.breadcrumb-item a:focus-visible{outline:2px solid var(--pst-color-accent)}ul.bd-breadcrumbs li.breadcrumb-item:not(.breadcrumb-home):before{color:var(--pst-color-text-muted);content:var(--pst-breadcrumb-divider);font:var(--fa-font-solid);font-size:.8rem;padding:0 .5rem}.navbar-icon-links{column-gap:1rem;display:flex;flex-direction:row;flex-wrap:wrap}.navbar-icon-links li.nav-item a.nav-link{padding-left:0;padding-right:0}.navbar-icon-links li.nav-item a.nav-link:hover{box-shadow:0 max(3px,.1875rem,.12em) 0 var(--pst-color-link-hover);color:var(--pst-color-link-hover)}.navbar-icon-links a span{align-items:center;display:flex}.navbar-icon-links i.fa-brands,.navbar-icon-links i.fa-regular,.navbar-icon-links i.fa-solid{font-size:var(--pst-font-size-icon);font-style:normal;vertical-align:middle}.navbar-icon-links i.fa-square-twitter:before{color:#55acee}.navbar-icon-links i.fa-square-gitlab:before{color:#548}.navbar-icon-links i.fa-bitbucket:before{color:#0052cc}.navbar-icon-links img.icon-link-image{border-radius:.2rem;height:1.5em}.navbar-brand{align-items:center;display:flex;flex-shrink:0;gap:.5rem;height:var(--pst-header-height);margin:0;max-height:var(--pst-header-height);padding:.5rem 0;position:relative;width:auto}.navbar-brand p{margin-bottom:0}.navbar-brand img{height:100%;max-width:100%;width:auto}.navbar-brand a{text-decoration:none}.navbar-brand:hover:hover,.navbar-brand:visited:hover:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.navbar-nav ul{display:block;list-style:none}.navbar-nav ul ul{padding:0 0 0 1rem}.navbar-nav li{display:flex;flex-direction:column}.navbar-nav li a{align-items:center;color:var(--pst-color-text-muted);display:flex;height:100%;padding-bottom:.25rem;padding-top:.25rem;text-decoration:none}.navbar-nav li a:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.navbar-nav li a:focus-visible{outline:2px solid var(--pst-color-accent)}.navbar-nav .toctree-checkbox{display:none;position:absolute}.navbar-nav .toctree-checkbox~ul{display:none}.navbar-nav .toctree-checkbox~label i{transform:rotate(0deg)}.navbar-nav .toctree-checkbox:checked~ul{display:block}.navbar-nav .toctree-checkbox:checked~label i{transform:rotate(180deg)}.bd-header .navbar-nav>p.sidebar-header-items__title{display:none}.page-toc .section-nav{border-bottom:none;padding-left:0}.page-toc .section-nav ul{padding-left:1rem}.page-toc .nav-link{font-size:var(--pst-sidebar-font-size-mobile)}@media(min-width:1200px){.page-toc .nav-link{font-size:var(--pst-sidebar-font-size)}}.page-toc .onthispage{color:var(--pst-color-text-base);font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}.prev-next-area{width:100%}.prev-next-area p{line-height:1.3em;margin:0 .3em}.prev-next-area i{font-size:1.2em}.prev-next-area a{align-items:center;border:none;color:var(--pst-color-text-muted);display:flex;max-width:45%;overflow-x:hidden;padding:10px;text-decoration:none}.prev-next-area a p.prev-next-title{word-wrap:break-word;color:var(--pst-color-link);font-size:1.1em;font-weight:var(--pst-admonition-font-weight-heading);text-decoration:underline;text-decoration-thickness:max(1px,.0625rem);text-underline-offset:.1578em}.prev-next-area a p.prev-next-title:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration-skip-ink:none;text-decoration-thickness:max(3px,.1875rem,.12em)}.prev-next-area a p.prev-next-title:active,.prev-next-area a p.prev-next-title:visited{color:var(--pst-color-link)}.prev-next-area a p.prev-next-title:visited:hover{color:var(--pst-color-link-hover)}.prev-next-area a p.prev-next-title:focus-visible{outline:2px solid var(--pst-color-accent)}.prev-next-area a:hover p.prev-next-title:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.prev-next-area a:visited p.prev-next-title{color:var(--pst-color-link)}.prev-next-area a:visited p.prev-next-title:hover{color:var(--pst-color-link-hover)}.prev-next-area a .prev-next-info{flex-direction:column;margin:0 .5em}.prev-next-area a .prev-next-info .prev-next-subtitle{text-transform:capitalize}.prev-next-area a.left-prev{float:left}.prev-next-area a.right-next{float:right}.prev-next-area a.right-next div.prev-next-info{text-align:right}.bd-search{border:1px solid var(--pst-color-border);border-radius:.25rem;color:var(--pst-color-text-base);gap:.5rem;padding-left:.5rem;position:relative}.bd-search,.bd-search:active{background-color:var(--pst-color-background)}.bd-search:active{color:var(--pst-color-text-muted)}.bd-search .icon{color:var(--pst-color-border);left:25px;position:absolute}.bd-search .fa-solid.fa-magnifying-glass{color:var(--pst-color-text-muted);left:calc(1.25rem - .35em);position:absolute}.bd-search input::placeholder{color:var(--pst-color-text-muted)}.bd-search input::-webkit-search-cancel-button,.bd-search input::-webkit-search-decoration{-webkit-appearance:none;appearance:none}.bd-search .search-button__kbd-shortcut{color:var(--pst-color-border);display:flex;position:absolute;right:.5rem}.form-control{background-color:var(--pst-color-background);color:var(--pst-color-text-base)}.form-control:focus,.form-control:focus-visible{background-color:var(--pst-color-background);border:none;box-shadow:none;color:var(--pst-color-text-muted);outline:3px solid var(--pst-color-accent)}.search-button{align-content:center;align-items:center;border-radius:0;color:var(--pst-color-text-muted);display:flex;padding:0 0 .25rem}.search-button:hover{box-shadow:0 max(3px,.1875rem,.12em) 0 var(--pst-color-link-hover);color:var(--pst-color-link-hover)}.search-button:focus-visible{outline:2px solid var(--pst-color-accent)}.search-button i{font-size:1.3rem}.search-button__overlay,.search-button__search-container{display:none}.search-button__wrapper.show .search-button__search-container{display:flex;left:50%;margin-top:.5rem;max-width:800px;position:fixed;right:1rem;top:30%;transform:translate(-50%,-50%);width:90%;z-index:1055}.search-button__wrapper.show .search-button__overlay{background-color:#000;display:flex;height:100%;left:0;opacity:.5;position:fixed;top:0;width:100%;z-index:1050}.search-button__wrapper.show form.bd-search{flex-grow:1;padding-bottom:0;padding-top:0}.search-button__wrapper.show input,.search-button__wrapper.show svg{font-size:var(--pst-font-size-icon)}.search-button-field{align-items:center;background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);border-radius:1.5em;color:var(--pst-color-text-muted);display:inline-flex;padding:.5em}.search-button-field:hover{border:2px solid var(--pst-color-link-hover)}.search-button-field:focus-visible{border:2px solid var(--pst-color-accent)}.search-button-field .search-button__default-text{font-size:var(--bs-nav-link-font-size);font-weight:var(--bs-nav-link-font-weight);margin-left:.5em;margin-right:.5em}.search-button-field .kbd-shortcut__modifier{font-size:.75em}.search-button-field>*{align-items:center}.search-button-field>:not(svg){display:none}@media(min-width:960px){.search-button-field>:not(svg){display:flex}}div#searchbox p.highlight-link{box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important;margin:1rem 0;width:fit-content}@media(min-width:1200px){div#searchbox p.highlight-link{margin-left:2rem}}div#searchbox p.highlight-link a{background-color:var(--pst-color-primary);border-radius:.25rem;color:var(--pst-color-primary-text);font-size:1.25rem;padding:.75rem;text-decoration:none;transition:box-shadow .25s ease-out}div#searchbox p.highlight-link a:hover{box-shadow:inset 0 0 50px 50px rgba(0,0,0,.25)}div#searchbox p.highlight-link a:before{color:unset;content:var(--pst-icon-search-minus);font:var(--fa-font-solid);margin-right:.5rem}.theme-switch-button{border-radius:0;color:var(--pst-color-text-muted);margin:0 -.5rem;padding:0}.theme-switch-button:focus-visible{outline:2px solid var(--pst-color-accent)}.theme-switch-button span{display:none;padding:.5em}.theme-switch-button span:hover{box-shadow:0 max(3px,.1875rem,.12em) 0 var(--pst-color-link-hover);color:var(--pst-color-link-hover)}.theme-switch-button span:active{color:var(--pst-color-link-hover);text-decoration:none}html[data-mode=auto] .theme-switch-button span[data-mode=auto],html[data-mode=dark] .theme-switch-button span[data-mode=dark],html[data-mode=light] .theme-switch-button span[data-mode=light]{display:flex}button.btn.version-switcher__button{border-color:var(--pst-color-border);color:var(--pst-color-text-base);margin-bottom:1em}@media(min-width:960px){button.btn.version-switcher__button{margin-bottom:unset}}button.btn.version-switcher__button:hover{text-decoration-skip:none;color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}button.btn.version-switcher__button:focus-visible{outline:2px solid var(--pst-color-accent)}button.btn.version-switcher__button:active{border-color:var(--pst-color-border);color:var(--pst-color-text-base)}.version-switcher__menu{border-color:var(--pst-color-border);border-radius:var(--bs-dropdown-border-radius)}.version-switcher__menu a.list-group-item{background-color:var(--pst-color-on-background);color:var(--pst-color-text-base);padding:.75rem 1.25rem}.version-switcher__menu a.list-group-item:not(:last-child){border-bottom:1px solid var(--pst-color-border)}.version-switcher__menu a.list-group-item:hover{text-decoration-skip:none;background-color:var(--pst-color-surface);color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(1px,.0625rem);text-decoration-thickness:max(3px,.1875rem,.12em);text-underline-offset:.1578em}.version-switcher__menu a.list-group-item.active{box-shadow:inset max(3px,.1875rem,.12em) 0 0 var(--pst-color-primary);color:var(--pst-color-primary);font-weight:600;position:relative;z-index:1}.version-switcher__menu a.list-group-item.active span:before{content:"";height:100%;left:0;position:absolute;top:0;width:100%;z-index:-1}.version-switcher__menu,button.version-switcher__button{font-size:1.1em;z-index:1055}@media(min-width:960px){.version-switcher__menu,button.version-switcher__button{font-size:unset}}nav.page-toc{margin-bottom:1rem}.bd-toc .nav .nav,.list-caption .nav{display:none}.bd-toc .nav .nav.visible,.bd-toc .nav>.active>ul,.list-caption .nav.visible,.list-caption>.active>ul,.toc-entry{display:block}.toc-entry a.nav-link,.toc-entry a>code{color:var(--pst-color-text-muted)}.toc-entry a.nav-link{display:block;margin-left:-1rem;padding:.125rem 0 .125rem 1rem;text-decoration:none}.toc-entry a.nav-link:hover{text-decoration-skip:none;background-color:transparent;text-decoration:underline;text-decoration-skip-ink:none;text-decoration-thickness:max(3px,.1875rem,.12em)}.toc-entry a.nav-link:active,.toc-entry a.nav-link:hover{color:var(--pst-color-link-hover)}.toc-entry a.nav-link.active{background-color:transparent;box-shadow:inset max(3px,.1875rem,.12em) 0 0 var(--pst-color-primary);color:var(--pst-color-primary);font-weight:600}.toc-entry a.nav-link.active:hover{color:var(--pst-color-link-hover)}div.deprecated,div.versionadded,div.versionchanged{background-color:var(--pst-color-on-background);border-left:.2rem solid;border-color:var(--pst-color-info);border-radius:.25rem;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important;margin:1.5625em auto;overflow:hidden;padding:0 .6rem;page-break-inside:avoid;position:relative;vertical-align:middle}div.deprecated>p,div.versionadded>p,div.versionchanged>p{margin-bottom:.6rem;margin-top:.6rem}div.versionadded{background-color:var(--pst-color-success-bg);border-color:var(--pst-color-success)}div.versionchanged{background-color:var(--pst-color-warning-bg);border-color:var(--pst-color-warning)}div.deprecated{background-color:var(--pst-color-danger-bg);border-color:var(--pst-color-danger)}span.versionmodified{font-weight:600}span.versionmodified:before{color:var(--pst-color-info);content:var(--pst-icon-versionmodified-default);font:var(--fa-font-solid);margin-right:.6rem}span.versionmodified.added:before{color:var(--pst-color-success);content:var(--pst-icon-versionmodified-added)}span.versionmodified.changed:before{color:var(--pst-color-warning);content:var(--pst-icon-versionmodified-changed)}span.versionmodified.deprecated:before{color:var(--pst-color-danger);content:var(--pst-icon-versionmodified-deprecated)}.sidebar-indices-items{border-top:1px solid var(--pst-color-border);display:flex;flex-direction:column}@media(min-width:960px){.sidebar-indices-items{border-top:none}}.sidebar-indices-items .sidebar-indices-items__title{color:var(--pst-color-text-base);font-size:var(--pst-sidebar-header-font-size);font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}.sidebar-indices-items ul.indices-link{list-style:none;margin-right:-1rem;padding:0}.sidebar-indices-items ul.indices-link li>a{color:var(--pst-color-text-muted);display:block;padding:.25rem 0}.sidebar-indices-items ul.indices-link li>a:hover{background-color:transparent;color:var(--pst-color-primary);text-decoration:none}.bd-sidebar-primary div#rtd-footer-container{bottom:-1rem;margin:-1rem;position:sticky}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge{font-family:var(--pst-font-family-base);font-size:.9em;max-width:unset;position:unset}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .rst-current-version{align-items:center;background-color:var(--pst-color-background);border-top:1px solid var(--pst-color-border);color:var(--pst-color-success);display:flex;gap:.2rem;height:2.5rem;transition:background-color .2s ease-out}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-book{color:var(--pst-color-text-muted);margin-right:auto}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-book:after{color:var(--pst-color-text-base);content:"Read The Docs";font-family:var(--pst-font-family-base);font-weight:var(--pst-admonition-font-weight-heading)}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-caret-down{color:var(--pst-color-text-muted)}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge.shift-up .rst-current-version{border-bottom:1px solid var(--pst-color-border)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions{background-color:var(--pst-color-surface);color:var(--pst-color-text-base)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions dl dd a{color:var(--pst-color-text-muted)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions hr{background-color:var(--pst-color-border)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions small a{color:var(--pst-color-link)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions input{background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);padding-left:.5rem}.admonition,div.admonition{background-color:var(--pst-color-on-background);border-left:.2rem solid;border-color:var(--pst-color-info);border-radius:.25rem;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important;margin:1.5625em auto;overflow:hidden;padding:0 .6rem .8rem;page-break-inside:avoid}.admonition :last-child,div.admonition :last-child{margin-bottom:0}.admonition p.admonition-title~*,div.admonition p.admonition-title~*{margin-left:1.4rem;margin-right:1.4rem}.admonition>ol,.admonition>ul,div.admonition>ol,div.admonition>ul{margin-left:1em}.admonition>.admonition-title,div.admonition>.admonition-title{font-weight:var(--pst-admonition-font-weight-heading);margin:0 -.6rem;padding:.4rem .6rem .4rem 2rem;position:relative;z-index:1}.admonition>.admonition-title:before,div.admonition>.admonition-title:before{background-color:var(--pst-color-info-bg);content:"";height:100%;left:0;pointer-events:none;position:absolute;top:0;width:100%;z-index:-1}.admonition>.admonition-title:after,div.admonition>.admonition-title:after{color:var(--pst-color-info);content:var(--pst-icon-admonition-default);font:var(--fa-font-solid);height:1rem;left:.5rem;line-height:inherit;opacity:1;position:absolute;width:1rem}.admonition>.admonition-title+*,div.admonition>.admonition-title+*{margin-top:.4em}.admonition.attention,div.admonition.attention{border-color:var(--pst-color-attention)}.admonition.attention>.admonition-title:before,div.admonition.attention>.admonition-title:before{background-color:var(--pst-color-attention-bg)}.admonition.attention>.admonition-title:after,div.admonition.attention>.admonition-title:after{color:var(--pst-color-attention);content:var(--pst-icon-admonition-attention)}.admonition.caution,div.admonition.caution{border-color:var(--pst-color-warning)}.admonition.caution>.admonition-title:before,div.admonition.caution>.admonition-title:before{background-color:var(--pst-color-warning-bg)}.admonition.caution>.admonition-title:after,div.admonition.caution>.admonition-title:after{color:var(--pst-color-warning);content:var(--pst-icon-admonition-caution)}.admonition.warning,div.admonition.warning{border-color:var(--pst-color-warning)}.admonition.warning>.admonition-title:before,div.admonition.warning>.admonition-title:before{background-color:var(--pst-color-warning-bg)}.admonition.warning>.admonition-title:after,div.admonition.warning>.admonition-title:after{color:var(--pst-color-warning);content:var(--pst-icon-admonition-warning)}.admonition.danger,div.admonition.danger{border-color:var(--pst-color-danger)}.admonition.danger>.admonition-title:before,div.admonition.danger>.admonition-title:before{background-color:var(--pst-color-danger-bg)}.admonition.danger>.admonition-title:after,div.admonition.danger>.admonition-title:after{color:var(--pst-color-danger);content:var(--pst-icon-admonition-danger)}.admonition.error,div.admonition.error{border-color:var(--pst-color-danger)}.admonition.error>.admonition-title:before,div.admonition.error>.admonition-title:before{background-color:var(--pst-color-danger-bg)}.admonition.error>.admonition-title:after,div.admonition.error>.admonition-title:after{color:var(--pst-color-danger);content:var(--pst-icon-admonition-error)}.admonition.hint,div.admonition.hint{border-color:var(--pst-color-success)}.admonition.hint>.admonition-title:before,div.admonition.hint>.admonition-title:before{background-color:var(--pst-color-success-bg)}.admonition.hint>.admonition-title:after,div.admonition.hint>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-hint)}.admonition.tip,div.admonition.tip{border-color:var(--pst-color-success)}.admonition.tip>.admonition-title:before,div.admonition.tip>.admonition-title:before{background-color:var(--pst-color-success-bg)}.admonition.tip>.admonition-title:after,div.admonition.tip>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-tip)}.admonition.important,div.admonition.important{border-color:var(--pst-color-attention)}.admonition.important>.admonition-title:before,div.admonition.important>.admonition-title:before{background-color:var(--pst-color-attention-bg)}.admonition.important>.admonition-title:after,div.admonition.important>.admonition-title:after{color:var(--pst-color-attention);content:var(--pst-icon-admonition-important)}.admonition.note,div.admonition.note{border-color:var(--pst-color-info)}.admonition.note>.admonition-title:before,div.admonition.note>.admonition-title:before{background-color:var(--pst-color-info-bg)}.admonition.note>.admonition-title:after,div.admonition.note>.admonition-title:after{color:var(--pst-color-info);content:var(--pst-icon-admonition-note)}.admonition.seealso,div.admonition.seealso{border-color:var(--pst-color-success)}.admonition.seealso>.admonition-title:before,div.admonition.seealso>.admonition-title:before{background-color:var(--pst-color-success-bg)}.admonition.seealso>.admonition-title:after,div.admonition.seealso>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-seealso)}.admonition.admonition-todo,div.admonition.admonition-todo{border-color:var(--pst-color-secondary)}.admonition.admonition-todo>.admonition-title:before,div.admonition.admonition-todo>.admonition-title:before{background-color:var(--pst-color-secondary-bg)}.admonition.admonition-todo>.admonition-title:after,div.admonition.admonition-todo>.admonition-title:after{color:var(--pst-color-secondary);content:var(--pst-icon-admonition-todo)}.admonition.sidebar,div.admonition.sidebar{border-width:0 0 0 .2rem;clear:both;float:right;margin-left:.5rem;margin-top:0;max-width:40%}.admonition.sidebar.attention,.admonition.sidebar.important,div.admonition.sidebar.attention,div.admonition.sidebar.important{border-color:var(--pst-color-attention)}.admonition.sidebar.caution,.admonition.sidebar.warning,div.admonition.sidebar.caution,div.admonition.sidebar.warning{border-color:var(--pst-color-warning)}.admonition.sidebar.danger,.admonition.sidebar.error,div.admonition.sidebar.danger,div.admonition.sidebar.error{border-color:var(--pst-color-danger)}.admonition.sidebar.hint,.admonition.sidebar.seealso,.admonition.sidebar.tip,div.admonition.sidebar.hint,div.admonition.sidebar.seealso,div.admonition.sidebar.tip{border-color:var(--pst-color-success)}.admonition.sidebar.note,.admonition.sidebar.todo,div.admonition.sidebar.note,div.admonition.sidebar.todo{border-color:var(--pst-color-info)}.admonition.sidebar p.admonition-title~*,div.admonition.sidebar p.admonition-title~*{margin-left:0;margin-right:0}aside.topic,div.topic,div.topic.contents,nav.contents{background-color:var(--pst-color-surface);border-color:var(--pst-color-border);border-radius:.25rem;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important;display:flex;flex-direction:column;padding:1rem 1.25rem}aside.topic .topic-title,div.topic .topic-title,div.topic.contents .topic-title,nav.contents .topic-title{margin:0 0 .5rem}aside.topic p,div.topic p,div.topic.contents p,nav.contents p{color:var(--pst-color-on-surface)!important}aside.topic ul.simple,div.topic ul.simple,div.topic.contents ul.simple,nav.contents ul.simple{padding-left:1rem}aside.topic ul.simple ul,div.topic ul.simple ul,div.topic.contents ul.simple ul,nav.contents ul.simple ul{padding-left:2em}aside.sidebar{background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);border-radius:.25rem;margin-left:.5rem;padding:0}aside.sidebar>:last-child{padding-bottom:1rem}aside.sidebar p.sidebar-title{border-bottom:1px solid var(--pst-color-border);font-family:var(--pst-font-family-heading);font-weight:var(--pst-admonition-font-weight-heading);margin-bottom:0;padding-bottom:.5rem;padding-top:.5rem;position:relative}aside.sidebar>:not(.sidebar-title):first-child,aside.sidebar>p.sidebar-title+*{margin-top:1rem}aside.sidebar>*{padding-left:1rem;padding-right:1rem}p.rubric{display:flex;flex-direction:column}.seealso dd{margin-bottom:0;margin-top:0}table.field-list{border-collapse:separate;border-spacing:10px;margin-left:1px}table.field-list th.field-name{background-color:var(--pst-color-surface);padding:1px 8px 1px 5px;white-space:nowrap}table.field-list td.field-body p{font-style:italic}table.field-list td.field-body p>strong{font-style:normal}table.field-list td.field-body blockquote{border-left:none;margin:0 0 .3em;padding-left:30px}.table.autosummary td:first-child{white-space:nowrap}.sig{font-family:var(--pst-font-family-monospace)}.sig-inline.c-texpr,.sig-inline.cpp-texpr{font-family:unset}.sig.c .k,.sig.c .kt,.sig.c .m,.sig.c .s,.sig.c .sc,.sig.cpp .k,.sig.cpp .kt,.sig.cpp .m,.sig.cpp .s,.sig.cpp .sc{color:var(--pst-color-text-base)}.sig-name{color:var(--pst-color-inline-code)}.sig-param .default_value,.sig-param .o{color:var(--pst-color-text-muted);font-weight:400}dt:target,span.highlighted{background-color:var(--pst-color-target)}.viewcode-back{font-family:var(--pst-font-family-base)}.viewcode-block:target{background-color:var(--pst-color-target);border-bottom:1px solid var(--pst-color-border);border-top:1px solid var(--pst-color-border);position:relative}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dd{margin-left:2rem}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dd>dl.simple>dt{display:flex}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl.field-list{display:grid;grid-template-columns:unset}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dt.field-even,dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dt.field-odd{background-color:var(--pst-color-surface);margin-bottom:.1rem;margin-top:.2rem}div.highlight,div.literal-block-wrapper,div[class*=highlight-]{border-radius:.25rem;display:flex;flex-direction:column;width:unset}div.literal-block-wrapper{border:1px solid var(--pst-color-border);border-radius:.25rem}div.literal-block-wrapper div.code-block-caption{border-bottom:1px solid var(--pst-color-border);font-size:1rem;font-weight:var(--pst-font-weight-caption);margin:0;padding:.5rem}div.literal-block-wrapper div.code-block-caption a.headerlink{font-size:inherit}div.literal-block-wrapper div[class*=highlight-]{border-radius:0;margin:0}div.literal-block-wrapper div[class*=highlight-] pre{border:none;box-shadow:none}code.literal{background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);border-radius:.25rem;padding:.1rem .25rem}a>code{color:var(--pst-color-inline-code-links)}html[data-theme=light] .highlight .nf{color:#0078a1!important}span.linenos{opacity:.8!important}figure a.headerlink{font-size:inherit;position:absolute}figure:hover a.headerlink{visibility:visible}figure figcaption{color:var(--pst-color-text-muted);font-family:var(--pst-font-family-heading);font-weight:var(--pst-font-weight-caption);margin-left:auto;margin-right:auto}figure figcaption table.table{margin-left:auto;margin-right:auto;width:fit-content}dt.label>span.brackets:not(:only-child):before{content:"["}dt.label>span.brackets:not(:only-child):after{content:"]"}a.footnote-reference{font-size:small;vertical-align:super}aside.footnote{margin-bottom:.5rem}aside.footnote:last-child{margin-bottom:1rem}aside.footnote span.backrefs,aside.footnote span.label{font-weight:700}aside.footnote:target{background-color:var(--pst-color-target)}div.doctest>div.highlight span.gp,span.linenos,table.highlighttable td.linenos{user-select:none;-webkit-user-select:text;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none}dd{margin-bottom:10px;margin-left:30px;margin-top:3px}ol,ul{padding-inline-start:2rem}ol li>p:first-child,ul li>p:first-child{margin-bottom:.25rem;margin-top:.25rem}blockquote{border-left:.25em solid var(--pst-color-border);border-radius:.25rem;color:var(--pst-color-text-muted);padding:1em;position:relative}blockquote p{color:var(--pst-color-text-base)}blockquote .line-block{margin:0}blockquote p:last-child{margin-bottom:0}blockquote:before{background-color:var(--pst-color-on-background);content:"";height:100%;left:0;pointer-events:none;position:absolute;top:0;width:100%;z-index:-1}span.guilabel{border:1px solid var(--pst-color-info);border-radius:4px;color:var(--pst-color-info);font-size:80%;font-weight:700;margin:auto 2px;padding:2.4px 6px;position:relative}span.guilabel:before{background-color:var(--pst-color-info-bg);content:"";height:100%;left:0;pointer-events:none;position:absolute;top:0;width:100%;z-index:-1}a.reference.download:before{color:var(--pst-color-text-muted);content:var(--pst-icon-download);font:var(--fa-font-solid);font-size:.8em;padding:0 .25em}table{display:table;margin-left:auto;margin-right:auto;overflow:auto}table.table-right{margin-right:0}table.table-left{margin-left:0}table caption{caption-side:top;color:var(--pst-color-text-muted);text-align:center}td.text-align\:left,th.text-align\:left{text-align:left}td.text-align\:right,th.text-align\:right{text-align:right}td.text-align\:center,th.text-align\:center{text-align:center}.table{--bs-table-bg:transparent}.toctree-wrapper p.caption{font-size:1.5em;margin-bottom:0}.toctree-wrapper>ul{padding-left:0}.toctree-wrapper li[class^=toctree-l]{list-style:none;margin-bottom:.2em}.toctree-wrapper li[class^=toctree-l]>a{font-size:1.1em;list-style:none}.toctree-wrapper li[class^=toctree-l]>ul{list-style:none;padding-inline-start:1.5em}.toctree-wrapper .toctree-l1>a{font-size:1.3em}div.topic.contents ul.simple,nav.contents ul.simple{list-style:none;padding-left:0}div.math,span.math{align-items:center;display:flex;max-width:100%;overflow:hidden}span.math{display:inline-flex}div.math{flex-direction:row-reverse;gap:.5em}div.math span.eqno a.headerlink{font-size:1em;position:relative}div.math mjx-container{flex-grow:1;overflow:auto;padding-bottom:.2rem}div.math mjx-container mjx-assistive-mml{height:0}.ablog-sidebar-item h2,.ablog-sidebar-item h3{font-size:var(--pst-sidebar-header-font-size);margin-top:.5rem}.ablog-sidebar-item h2 a,.ablog-sidebar-item h3 a{color:var(--pst-color-text-base)}.ablog-sidebar-item ul{display:flex;flex-direction:column;gap:.5em;list-style:none;margin-bottom:0;overflow-y:hidden;padding-left:0}.ablog-sidebar-item ul.ablog-cloud{flex-direction:row;flex-flow:wrap;gap:.5rem}.ablog-sidebar-item ul.ablog-cloud li{align-items:center;display:flex}.ablog__prev-next{display:flex;font-size:1.2em;padding:1rem 0}.ablog__prev-next>span{display:flex;max-width:45%}.ablog__prev-next>span a{align-items:center;display:flex;gap:1rem;line-height:1.5rem;margin-left:auto}.ablog__prev-next>span a i:before{color:var(--pst-color-text-base)}.ablog__prev-next span.ablog__prev i.fa-arrow-circle-left:before{content:var(--pst-icon-angle-left)}.ablog__prev-next span.ablog__spacer{display:none}.ablog__prev-next span.ablog__next{margin-left:auto;text-align:right}.ablog__prev-next span.ablog__next i.fa-arrow-circle-right:before{content:var(--pst-icon-angle-right)}.ablog__collection,.postlist{padding-left:0}.ablog__collection .ablog-post,.postlist .ablog-post{list-style:none}.ablog__collection .ablog-post .ablog-archive,.postlist .ablog-post .ablog-archive{display:flex;flex-direction:row;flex-wrap:wrap;font-size:.75rem;gap:1rem;list-style:none;padding-left:0}.ablog__collection .ablog-post .ablog-post-title,.postlist .ablog-post .ablog-post-title{font-size:1.25rem;margin-top:0}.ablog__collection .ablog-post .ablog-post-title a,.postlist .ablog-post .ablog-post-title a{font-weight:700}.ablog__collection .ablog-post .ablog-post-expand,.postlist .ablog-post .ablog-post-expand{margin-bottom:.5rem}.docutils.container{margin-left:unset;margin-right:unset;max-width:unset;padding-left:unset;padding-right:unset;width:unset}div.highlight button.copybtn{align-items:center;background-color:unset;background-color:var(--pst-color-surface);border:none;display:flex;justify-content:center}div.highlight button.copybtn:not(.success){color:var(--pst-color-muted)}div.highlight button.copybtn:hover:not(.success){background-color:var(--pst-color-shadow);color:var(--pst-color-text)}div.highlight button.copybtn.o-tooltip--left:after{background-color:var(--pst-color-surface);color:var(--pst-color-text)}#ethical-ad-placement .ethical-footer a,#ethical-ad-placement .ethical-footer a:active,#ethical-ad-placement .ethical-footer a:hover,#ethical-ad-placement .ethical-footer a:visited,#ethical-ad-placement .ethical-sidebar a,#ethical-ad-placement .ethical-sidebar a:active,#ethical-ad-placement .ethical-sidebar a:hover,#ethical-ad-placement .ethical-sidebar a:visited{color:var(--pst-color-text-base)}#ethical-ad-placement .ethical-footer,#ethical-ad-placement .ethical-sidebar{background-color:var(--pst-color-background);border:1px solid var(--pst-color-border);border-radius:5px;color:var(--pst-color-text-base);font-size:14px;line-height:20px}.bd-content div.jupyter_container{background-color:unset;border:none;box-shadow:none}.bd-content div.jupyter_container div.highlight,.bd-content div.jupyter_container div.output{border-radius:.25rem}.bd-content div.jupyter_container div.highlight{background-color:var(--pst-color-surface)}.bd-content div.jupyter_container .cell_input,.bd-content div.jupyter_container .cell_output{border-radius:.25rem}.bd-content div.jupyter_container .cell_input pre,.bd-content div.jupyter_container .cell_output pre{padding:1rem}.xr-wrap[hidden]{display:block!important}:root{--pst-teal-50:#f4fbfc;--pst-teal-100:#e9f6f8;--pst-teal-200:#d0ecf1;--pst-teal-300:#abdde6;--pst-teal-400:#3fb1c5;--pst-teal-500:#0a7d91;--pst-teal-600:#085d6c;--pst-teal-700:#064752;--pst-teal-800:#042c33;--pst-teal-900:#021b1f;--pst-violet-50:#f4eefb;--pst-violet-100:#e0c7ff;--pst-violet-200:#d5b4fd;--pst-violet-300:#b780ff;--pst-violet-400:#9c5ffd;--pst-violet-500:#8045e5;--pst-violet-600:#6432bd;--pst-violet-700:#4b258f;--pst-violet-800:#341a61;--pst-violet-900:#1e0e39;--pst-gray-50:#f9f9fa;--pst-gray-100:#f3f4f5;--pst-gray-200:#e5e7ea;--pst-gray-300:#d1d5da;--pst-gray-400:#9ca4af;--pst-gray-500:#677384;--pst-gray-600:#48566b;--pst-gray-700:#29313d;--pst-gray-800:#222832;--pst-gray-900:#14181e;--pst-pink-50:#fcf8fd;--pst-pink-100:#fcf0fa;--pst-pink-200:#f8dff5;--pst-pink-300:#f3c7ee;--pst-pink-400:#e47fd7;--pst-pink-500:#c132af;--pst-pink-600:#912583;--pst-pink-700:#6e1c64;--pst-pink-800:#46123f;--pst-pink-900:#2b0b27;--pst-foundation-white:#fff;--pst-foundation-black:#14181e}html:not([data-theme]){--pst-color-primary:#0a7d91;--pst-color-primary-bg:#d0ecf1;--pst-color-secondary:#8045e5;--pst-color-secondary-bg:#e0c7ff;--pst-color-accent:#c132af;--pst-color-accent-bg:#f8dff5;--pst-color-info:#276be9;--pst-color-info-bg:#dce7fc;--pst-color-warning:#f66a0a;--pst-color-warning-bg:#f8e3d0;--pst-color-success:#00843f;--pst-color-success-bg:#d6ece1;--pst-color-attention:var(--pst-color-warning);--pst-color-attention-bg:var(--pst-color-warning-bg);--pst-color-danger:#d72d47;--pst-color-danger-bg:#f9e1e4;--pst-color-text-base:#222832;--pst-color-text-muted:#48566b;--pst-color-heading-color:#fff;--pst-color-shadow:rgba(0,0,0,.1);--pst-color-border:#d1d5da;--pst-color-border-muted:rgba(23,23,26,.2);--pst-color-inline-code:#912583;--pst-color-inline-code-links:#085d6c;--pst-color-target:#f3cf95;--pst-color-background:#fff;--pst-color-on-background:#fff;--pst-color-surface:#f3f4f5;--pst-color-on-surface:#222832;--pst-color-link:var(--pst-color-primary);--pst-color-link-hover:var(--pst-color-secondary)}html:not([data-theme]) .only-dark,html:not([data-theme]) .only-dark~figcaption{display:none!important}html[data-theme=light]{--pst-color-primary-bg:#d0ecf1;--pst-color-secondary-bg:#e0c7ff;--pst-color-accent:#c132af;--pst-color-accent-bg:#f8dff5;--pst-color-info-bg:#dce7fc;--pst-color-warning-bg:#f8e3d0;--pst-color-success-bg:#d6ece1;--pst-color-attention:var(--pst-color-warning);--pst-color-attention-bg:var(--pst-color-warning-bg);--pst-color-danger-bg:#f9e1e4;--pst-color-text-base:#222832;--pst-color-text-muted:#48566b;--pst-color-heading-color:#fff;--pst-color-shadow:rgba(0,0,0,.1);--pst-color-border:#d1d5da;--pst-color-border-muted:rgba(23,23,26,.2);--pst-color-inline-code:#912583;--pst-color-inline-code-links:#085d6c;--pst-color-target:#f3cf95;--pst-color-background:#fff;--pst-color-on-background:#fff;--pst-color-surface:#f3f4f5;--pst-color-on-surface:#222832;--pst-color-link:var(--pst-color-primary);--pst-color-link-hover:var(--pst-color-secondary);color-scheme:light}html[data-theme=light] .only-dark,html[data-theme=light] .only-dark~figcaption{display:none!important}html[data-theme=dark]{--pst-color-primary-bg:#042c33;--pst-color-secondary-bg:#341a61;--pst-color-accent:#e47fd7;--pst-color-accent-bg:#46123f;--pst-color-info-bg:#06245d;--pst-color-warning-bg:#652a02;--pst-color-success-bg:#002f17;--pst-color-attention:var(--pst-color-warning);--pst-color-attention-bg:var(--pst-color-warning-bg);--pst-color-danger-bg:#4e111b;--pst-color-text-base:#ced6dd;--pst-color-text-muted:#9ca4af;--pst-color-heading-color:#14181e;--pst-color-shadow:rgba(0,0,0,.2);--pst-color-border:#48566b;--pst-color-border-muted:#29313d;--pst-color-inline-code:#f3c7ee;--pst-color-inline-code-links:#3fb1c5;--pst-color-target:#675c04;--pst-color-background:#14181e;--pst-color-on-background:#222832;--pst-color-surface:#29313d;--pst-color-on-surface:#f3f4f5;--pst-color-link:var(--pst-color-primary);--pst-color-link-hover:var(--pst-color-secondary);color-scheme:dark}html[data-theme=dark] .only-light,html[data-theme=dark] .only-light~figcaption{display:none!important}html[data-theme=dark] img:not(.only-dark):not(.dark-light){filter:brightness(.8) contrast(1.2)}html[data-theme=dark] .bd-content img:not(.only-dark):not(.dark-light){background:#fff;border-radius:.25rem}html[data-theme=dark] .MathJax_SVG *{fill:var(--pst-color-text-base)}.pst-color-primary{color:var(--pst-color-primary)}.pst-color-secondary{color:var(--pst-color-secondary)}.pst-color-accent{color:var(--pst-color-accent)}.pst-color-info{color:var(--pst-color-info)}.pst-color-warning{color:var(--pst-color-warning)}.pst-color-success{color:var(--pst-color-success)}.pst-color-attention{color:var(--pst-color-attention)}.pst-color-danger{color:var(--pst-color-danger)}.pst-color-text-base{color:var(--pst-color-text-base)}.pst-color-text-muted{color:var(--pst-color-text-muted)}.pst-color-heading-color{color:var(--pst-color-heading-color)}.pst-color-shadow{color:var(--pst-color-shadow)}.pst-color-border{color:var(--pst-color-border)}.pst-color-border-muted{color:var(--pst-color-border-muted)}.pst-color-inline-code{color:var(--pst-color-inline-code)}.pst-color-inline-code-links{color:var(--pst-color-inline-code-links)}.pst-color-target{color:var(--pst-color-target)}.pst-color-background{color:var(--pst-color-background)}.pst-color-on-background{color:var(--pst-color-on-background)}.pst-color-surface{color:var(--pst-color-surface)}.pst-color-on-surface{color:var(--pst-color-on-surface)}html[data-theme=light]{--pst-color-primary:#0a7d91;--pst-color-primary-text:#fff;--pst-color-primary-highlight:#053f49;--sd-color-primary:var(--pst-color-primary);--sd-color-primary-text:var(--pst-color-primary-text);--sd-color-primary-highlight:var(--pst-color-primary-highlight);--sd-color-primary-bg:#d0ecf1;--sd-color-primary-bg-text:#14181e;--pst-color-secondary:#8045e5;--pst-color-secondary-text:#fff;--pst-color-secondary-highlight:#591bc2;--sd-color-secondary:var(--pst-color-secondary);--sd-color-secondary-text:var(--pst-color-secondary-text);--sd-color-secondary-highlight:var(--pst-color-secondary-highlight);--sd-color-secondary-bg:#e0c7ff;--sd-color-secondary-bg-text:#14181e;--pst-color-success:#00843f;--pst-color-success-text:#fff;--pst-color-success-highlight:#00381a;--sd-color-success:var(--pst-color-success);--sd-color-success-text:var(--pst-color-success-text);--sd-color-success-highlight:var(--pst-color-success-highlight);--sd-color-success-bg:#d6ece1;--sd-color-success-bg-text:#14181e;--pst-color-info:#276be9;--pst-color-info-text:#fff;--pst-color-info-highlight:#124ab1;--sd-color-info:var(--pst-color-info);--sd-color-info-text:var(--pst-color-info-text);--sd-color-info-highlight:var(--pst-color-info-highlight);--sd-color-info-bg:#dce7fc;--sd-color-info-bg-text:#14181e;--pst-color-warning:#f66a0a;--pst-color-warning-text:#14181e;--pst-color-warning-highlight:#ad4a06;--sd-color-warning:var(--pst-color-warning);--sd-color-warning-text:var(--pst-color-warning-text);--sd-color-warning-highlight:var(--pst-color-warning-highlight);--sd-color-warning-bg:#f8e3d0;--sd-color-warning-bg-text:#14181e;--pst-color-danger:#d72d47;--pst-color-danger-text:#fff;--pst-color-danger-highlight:#9a1d30;--sd-color-danger:var(--pst-color-danger);--sd-color-danger-text:var(--pst-color-danger-text);--sd-color-danger-highlight:var(--pst-color-danger-highlight);--sd-color-danger-bg:#f9e1e4;--sd-color-danger-bg-text:#14181e;--pst-color-light:#f3f4f5;--pst-color-light-text:#14181e;--pst-color-light-highlight:#c9ced2;--sd-color-light:var(--pst-color-light);--sd-color-light-text:var(--pst-color-light-text);--sd-color-light-highlight:var(--pst-color-light-highlight);--sd-color-light-bg:#f7f7f8;--sd-color-light-bg-text:#14181e;--pst-color-muted:#29313d;--pst-color-muted-text:#fff;--pst-color-muted-highlight:#0a0c0f;--sd-color-muted:var(--pst-color-muted);--sd-color-muted-text:var(--pst-color-muted-text);--sd-color-muted-highlight:var(--pst-color-muted-highlight);--sd-color-muted-bg:#5a6c86;--sd-color-muted-bg-text:#fff;--pst-color-dark:#222832;--pst-color-dark-text:#fff;--pst-color-dark-highlight:#030404;--sd-color-dark:var(--pst-color-dark);--sd-color-dark-text:var(--pst-color-dark-text);--sd-color-dark-highlight:var(--pst-color-dark-highlight);--pst-color-black:#14181e;--pst-color-black-text:#fff;--pst-color-black-highlight:#000;--sd-color-black:var(--pst-color-black);--sd-color-black-text:var(--pst-color-black-text);--sd-color-black-highlight:var(--pst-color-black-highlight);--pst-color-white:#fff;--pst-color-white-text:#14181e;--pst-color-white-highlight:#d9d9d9;--sd-color-white:var(--pst-color-white);--sd-color-white-text:var(--pst-color-white-text);--sd-color-white-highlight:var(--pst-color-white-highlight)}html[data-theme=dark]{--pst-color-primary:#3fb1c5;--pst-color-primary-text:#14181e;--pst-color-primary-highlight:#2b7e8d;--sd-color-primary:var(--pst-color-primary);--sd-color-primary-text:var(--pst-color-primary-text);--sd-color-primary-highlight:var(--pst-color-primary-highlight);--sd-color-primary-bg:#042c33;--sd-color-primary-bg-text:#fff;--pst-color-secondary:#9c5ffd;--pst-color-secondary-text:#14181e;--pst-color-secondary-highlight:#6d13fc;--sd-color-secondary:var(--pst-color-secondary);--sd-color-secondary-text:var(--pst-color-secondary-text);--sd-color-secondary-highlight:var(--pst-color-secondary-highlight);--sd-color-secondary-bg:#341a61;--sd-color-secondary-bg-text:#fff;--pst-color-success:#5fb488;--pst-color-success-text:#14181e;--pst-color-success-highlight:#3f8762;--sd-color-success:var(--pst-color-success);--sd-color-success-text:var(--pst-color-success-text);--sd-color-success-highlight:var(--pst-color-success-highlight);--sd-color-success-bg:#002f17;--sd-color-success-bg-text:#fff;--pst-color-info:#79a3f2;--pst-color-info-text:#14181e;--pst-color-info-highlight:#3373eb;--sd-color-info:var(--pst-color-info);--sd-color-info-text:var(--pst-color-info-text);--sd-color-info-highlight:var(--pst-color-info-highlight);--sd-color-info-bg:#06245d;--sd-color-info-bg-text:#fff;--pst-color-warning:#ff9245;--pst-color-warning-text:#14181e;--pst-color-warning-highlight:#f86600;--sd-color-warning:var(--pst-color-warning);--sd-color-warning-text:var(--pst-color-warning-text);--sd-color-warning-highlight:var(--pst-color-warning-highlight);--sd-color-warning-bg:#652a02;--sd-color-warning-bg-text:#fff;--pst-color-danger:#e78894;--pst-color-danger-text:#14181e;--pst-color-danger-highlight:#da485b;--sd-color-danger:var(--pst-color-danger);--sd-color-danger-text:var(--pst-color-danger-text);--sd-color-danger-highlight:var(--pst-color-danger-highlight);--sd-color-danger-bg:#4e111b;--sd-color-danger-bg-text:#fff;--pst-color-light:#f3f4f5;--pst-color-light-text:#14181e;--pst-color-light-highlight:#c9ced2;--sd-color-light:var(--pst-color-light);--sd-color-light-text:var(--pst-color-light-text);--sd-color-light-highlight:var(--pst-color-light-highlight);--sd-color-light-bg:#a3abb2;--sd-color-light-bg-text:#14181e;--pst-color-muted:#f3f4f5;--pst-color-muted-text:#14181e;--pst-color-muted-highlight:#c9ced2;--sd-color-muted:var(--pst-color-muted);--sd-color-muted-text:var(--pst-color-muted-text);--sd-color-muted-highlight:var(--pst-color-muted-highlight);--sd-color-muted-bg:#1d222b;--sd-color-muted-bg-text:#fff;--pst-color-dark:#222832;--pst-color-dark-text:#fff;--pst-color-dark-highlight:#030404;--sd-color-dark:var(--pst-color-dark);--sd-color-dark-text:var(--pst-color-dark-text);--sd-color-dark-highlight:var(--pst-color-dark-highlight);--pst-color-black:#14181e;--pst-color-black-text:#fff;--pst-color-black-highlight:#000;--sd-color-black:var(--pst-color-black);--sd-color-black-text:var(--pst-color-black-text);--sd-color-black-highlight:var(--pst-color-black-highlight);--pst-color-white:#fff;--pst-color-white-text:#14181e;--pst-color-white-highlight:#d9d9d9;--sd-color-white:var(--pst-color-white);--sd-color-white-text:var(--pst-color-white-text);--sd-color-white-highlight:var(--pst-color-white-highlight)}html[data-theme=dark],html[data-theme=light]{--sd-color-card-border:var(--pst-color-border)}html[data-theme=light] .sd-shadow-lg,html[data-theme=light] .sd-shadow-md,html[data-theme=light] .sd-shadow-sm,html[data-theme=light] .sd-shadow-xs{box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important}.bd-content .sd-card{border:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-header{background-color:var(--pst-color-panel-background);border-bottom:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-footer{border-top:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-body,.bd-content .sd-card .sd-card-footer{background-color:var(--pst-color-panel-background)}.bd-content .sd-tab-set>input:checked+label{border-color:transparent transparent var(--pst-color-primary);color:var(--pst-color-primary)}.bd-content .sd-tab-set>input:not(:checked)+label:hover{border-color:var(--pst-color-secondary);color:var(--pst-color-secondary)}.bd-content .sd-tab-set>label{border-top:.125rem solid transparent;color:var(--pst-color-text-muted);padding-top:.5em}html .bd-content .sd-tab-set>label:hover{border-color:var(--pst-color-secondary);color:var(--pst-color-secondary)}details.sd-dropdown{border:0!important;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important}details.sd-dropdown summary.sd-card-header{border:0!important}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{border:0}details.sd-dropdown summary.sd-card-header{--pst-sd-dropdown-color:var(--pst-gray-500);--pst-sd-dropdown-bg-color:var(--pst-color-surface);align-items:center;background-color:unset!important;border-left:.2rem solid var(--pst-sd-dropdown-color)!important;display:flex;font-weight:600;padding-bottom:.5rem;padding-top:.5rem;position:relative}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-card-border)}details.sd-dropdown summary.sd-card-header.sd-bg-primary,details.sd-dropdown summary.sd-card-header.sd-bg-primary+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-primary);--pst-sd-dropdown-bg-color:var(--sd-color-primary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-primary{color:var(--sd-color-primary-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-secondary,details.sd-dropdown summary.sd-card-header.sd-bg-secondary+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-secondary);--pst-sd-dropdown-bg-color:var(--sd-color-secondary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-secondary{color:var(--sd-color-secondary-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-success,details.sd-dropdown summary.sd-card-header.sd-bg-success+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-success);--pst-sd-dropdown-bg-color:var(--sd-color-success-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-success{color:var(--sd-color-success-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-info,details.sd-dropdown summary.sd-card-header.sd-bg-info+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-info);--pst-sd-dropdown-bg-color:var(--sd-color-info-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-info{color:var(--sd-color-info-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-warning,details.sd-dropdown summary.sd-card-header.sd-bg-warning+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-warning);--pst-sd-dropdown-bg-color:var(--sd-color-warning-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-warning{color:var(--sd-color-warning-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-danger,details.sd-dropdown summary.sd-card-header.sd-bg-danger+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-danger);--pst-sd-dropdown-bg-color:var(--sd-color-danger-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-danger{color:var(--sd-color-danger-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-light,details.sd-dropdown summary.sd-card-header.sd-bg-light+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-light);--pst-sd-dropdown-bg-color:var(--sd-color-light-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-light{color:var(--sd-color-light-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-muted,details.sd-dropdown summary.sd-card-header.sd-bg-muted+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-muted);--pst-sd-dropdown-bg-color:var(--sd-color-muted-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-muted{color:var(--sd-color-muted-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-dark,details.sd-dropdown summary.sd-card-header.sd-bg-dark+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-dark);--pst-sd-dropdown-bg-color:var(--sd-color-dark-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-dark{color:var(--sd-color-dark-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-black,details.sd-dropdown summary.sd-card-header.sd-bg-black+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-black);--pst-sd-dropdown-bg-color:var(--sd-color-black-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-black{color:var(--sd-color-black-bg-text)!important}details.sd-dropdown summary.sd-card-header.sd-bg-white,details.sd-dropdown summary.sd-card-header.sd-bg-white+div.sd-summary-content{--pst-sd-dropdown-color:var(--sd-color-white);--pst-sd-dropdown-bg-color:var(--sd-color-white-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-white{color:var(--sd-color-white-bg-text)!important}details.sd-dropdown summary.sd-card-header:before{background-color:var(--pst-sd-dropdown-bg-color);content:"";height:100%;left:0;pointer-events:none;position:absolute;top:0;width:100%;z-index:-1}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{background-color:var(--pst-color-on-background);border-bottom-left-radius:calc(.25rem - 1px);border-left:.2rem solid var(--pst-sd-dropdown-color)!important}details.sd-dropdown summary.sd-card-header span.sd-summary-icon{align-items:center;color:var(--pst-sd-dropdown-color)!important;display:inline-flex}details.sd-dropdown summary.sd-card-header span.sd-summary-icon svg{opacity:1}details.sd-dropdown summary.sd-card-header .sd-summary-down,details.sd-dropdown summary.sd-card-header .sd-summary-up{top:.7rem}.bd-content .admonition button.toggle-button{color:inherit}.bd-content details.toggle-details summary{border-left:3px solid var(--pst-color-primary)}html div.rendered_html html .jp-RenderedHTMLCommon table{table-layout:auto}html[data-theme=dark] .bd-content .nboutput .output_area.rendered_html{background-color:var(--pst-color-text-base);border-radius:.25rem;color:var(--pst-color-on-background);padding:.5rem}html[data-theme=dark] .bd-content .nboutput .output_area.stderr{background:var(--pst-color-danger)}div.nblast.container{margin-bottom:1rem}div.cell_output .output{max-width:100%;overflow-x:auto}html[data-theme=dark] .bd-content div.cell_output .text_html,html[data-theme=dark] .bd-content div.cell_output img{background-color:var(--pst-color-text-base);border-radius:.25rem;color:var(--pst-color-on-background);padding:.5rem}.bd-content div.cell_input{display:flex;flex-direction:column;justify-content:stretch}.bd-content div.cell_input,.bd-content div.output{border-radius:.25rem}.bd-content div.output table{table-layout:auto}html[data-theme=dark] .bd-content img.leaflet-tile.leaflet-tile-loaded{border-radius:0;padding:0}.bd-search-container div#search-results>h2{font-size:var(--pst-font-size-icon);margin-top:0}.bd-search-container div#search-results p.search-summary{color:var(--pst-color-text-muted)}.bd-search-container ul.search{list-style:none;margin:0}.bd-search-container ul.search li{background-image:none;border-top:1px solid var(--pst-color-text-muted);margin:1rem 0;padding:1rem 0}.bd-search-container ul.search li>a{font-size:1.2em}.bd-search-container ul.search li div.context,.bd-search-container ul.search li p.context{color:var(--pst-color-text-base);margin:.5em 0 0}.bd-search-container ul.search li div.context a:before,.bd-search-container ul.search li p.context a:before{color:var(--pst-color-text-muted);content:"#";padding-right:.2em}
-/*# sourceMappingURL=pydata-sphinx-theme.css.map*/
\ No newline at end of file
diff --git a/docs/_build/html/_static/styles/pydata-sphinx-theme.css.map b/docs/_build/html/_static/styles/pydata-sphinx-theme.css.map
deleted file mode 100644
index d6e411a..0000000
--- a/docs/_build/html/_static/styles/pydata-sphinx-theme.css.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"styles/pydata-sphinx-theme.css","mappings":"AAAA,KCAA,wBAOE,+DACA,+BCRF,yBAME,0BAGA,wBACA,2BACA,0BACA,2BACA,0BACA,6BAGA,+BAGA,sCACA,sCACA,qCACA,yCAGA,8BAGA,8BACA,2JAIA,mHAGA,0DAGA,6DACA,qECzCF,2BAME,4BAGA,2BACA,oCACA,kCACA,4BACA,yBACA,wBACA,0BACA,2BACA,6BACA,4BACA,sBACA,sBACA,qBACA,oBACA,sBACA,8BCxBF,kDAKE,uDACA,mEACA,mEACA,mEACA,kEACA,yDACA,qDACA,oDACA,mEACA,oDACA,mDCfF,qEAKE,oEACA,sEACA,0ECPF,mCACE,yDLQA,CKPA,KAGF,4CACE,CAGA,gCACA,CACA,YACA,uBANA,uCACA,gBACA,iBACA,CACA,gBAGA,+BAGA,sCACE,GAMF,iCADA,aACA,CAFF,qBAGE,UAGA,+CACE,YAGF,iBACE,GAIJ,oBC8BE,4BAEA,0BAzCA,4CAhByB,8BAIH,SA8BpB,0BA0BF,iCACE,CAlD8B,6BAuB9B,CA2BA,iDA1BA,CAgCA,mBAIF,2BACE,iBACA,iCACE,iBA+FJ,yCACE,cD7IF,gCACE,CACA,cACA,CACA,gBACA,CAJA,UACA,CACA,aACA,CACA,oBACA,4BACA,iBACA,oBAEA,SACE,iCAOF,iCACE,2BACA,oBACA,iBAIJ,8BACE,iBAGF,8BACE,kCAKF,0CACA,2CACA,kBAHF,wBAIE,IAKA,iCACA,CAHF,YAIE,OADA,8BAOA,CANA,GAGF,iCAGE,IAGF,iCAGE,OADA,8BAOA,CANA,GAGF,iCAGE,IAGF,iCAGE,OADA,gCAOA,CANA,GAGF,iCAGE,mBAGF,oCAEE,IAGF,QACE,6CACA,mBAGF,4CAIE,KAGF,+CAEE,kCACA,oBAGA,wCACE,CAEA,+CAFA,cACA,oBAEA,MAIJ,kCACE,KAKA,yCACA,CAEA,wCACA,sBAHA,gCACA,kBACA,CALF,cACE,aL1HyB,cKkIzB,UAEE,mBACA,kBAYF,2CACA,aAFA,qCACA,CALA,YACA,CACA,SACA,CEq8BkC,cFx8BlC,CACA,QACA,CACA,yBACA,CANF,YASE,YGvKA,yCACA,CDqmCkC,+CChmClC,CALA,6CAEA,CANA,MACA,CAKA,aACA,CATF,cACE,CAEA,OACA,kBACA,CAJA,KACA,CASA,2BAGA,uCALA,YAMA,kBAEE,0BADF,uBAGE,eCzBF,YACA,CAFF,WACE,CACA,sBACA,oCAEA,YACE,gBAIJ,UACE,yBCoDE,eDrDJ,eTYwB,qDWjBtB,kBACA,CAHA,YACA,CAEA,sBACA,CAPF,eAEE,CAMA,oBAJA,iBACA,CAEA,iBACA,CANA,UAOA,4BDmEE,mDC5EJ,gBAaI,yDAGF,eACE,SACA,gEAQA,UACA,CAJA,WACA,OACA,CAJF,iBACE,CAGA,KACA,CAJA,UACA,CAIA,UACA,gEAGF,YACE,wDAIF,wCACE,+BAMF,8CACE,kCAKF,2CACE,UC7CF,YACA,CAFA,qBACA,CAFF,WACE,CAEA,WACA,sBAEA,YACE,CACA,YADA,sBAEA,4CAEE,YACA,sBACA,CAHF,qBACE,CAMA,cACA,gBACA,cANA,UAOA,0BFwCF,uDEpCM,kBAHJ,kBAII,aC3BR,6CADF,UAEE,8BAEA,YACE,YACA,CACA,YADA,YAEA,gGAGF,YAGE,sBACA,CAEA,YAFA,SACA,uBAEA,kCAGF,iBACE,+BAGF,cACE,2BAIF,eACE,oBC/BJ,eACE,0CAEA,YACE,sBACA,0CCJF,YACE,sBACA,gBACA,YR0mCgC,mDS/lClC,sDACA,CAIA,uBADA,eACA,CAFA,SACA,CAVF,eACE,MACA,CAKA,UAEA,CAPA,YAUA,8BAEE,kBACA,CAFF,YACE,CACA,kBACA,kBACA,mBACA,yBAOA,mBADA,YACA,CAHF,+BACE,oCAGA,iCAKA,aACA,yBNsBA,gCMxBF,YAII,YACA,oBACA,sHAOF,kBACA,CAJF,YAGE,CACA,cACA,UAEA,8EAGF,eAEE,wCAIF,aACE,CACA,UADA,iBAEA,sCAGF,mBAEE,wBAIF,YACE,yBNfA,uBMcF,kBAKI,uCAGF,iCVWF,qBACA,4CApDE,0BAsDF,iCACE,0BAzEF,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BAmCvB,oDAsIF,yCACE,2CA3BF,qEADA,8BACA,CUhEE,eVkEA,yCU1DI,YADA,iCACA,CAFF,aAGE,+CVtDJ,yBACA,mCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,uDA4HF,yCACE,iDU1EI,+CACA,CTugC4B,wCSzgC5B,mDACA,CAEA,cACA,iBAFA,eACA,CALF,YAOE,gEAEA,qBAGE,+FAGA,wBACE,4DAKJ,YACE,yBN/DN,kCMwEF,oBACE,YAIJ,eAIE,iBVnGE,yBACA,mCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,8BU2FA,qCACA,CAFF,yBACE,CACA,eACA,iBACA,mCAIJ,eACE,iBACA,sBACA,iCAcI,kBACA,6BACA,CAJA,cACA,CAFF,YACE,CACA,mCACA,CAEA,eACA,sBACA,iCAGF,iBACE,yBNpHF,gCMmHA,YAGI,oCAIJ,gBACE,0BN3HF,kCM0HA,YAGI,yBVpBJ,mEADF,iCAGI,gCAUJ,yCACE,iCUeF,YACE,yBNtIA,gCMqIF,eAGI,6BAMN,gBACE,yBN/IE,2BM8IJ,YAGI,gCAKJ,YACE,yBNvJE,8BMsJJ,YAGI,yBCxNJ,YACE,gBACA,6CAIE,wCADF,2CAEE,uGAKA,iBACA,CAHF,YAEE,CACA,SACA,mDAGF,gBACE,qBCFF,4CACA,CAFA,8CACA,CAXF,YACE,CAKA,aCoBE,CDzBF,qBACA,CAWA,8CAXA,QACA,kDACA,CAQA,eACA,CCcE,sBDjBF,CANA,eACA,6BACA,CCoBE,SDXF,yBR2CE,oBQ1DJ,sCAiBI,gCAIF,6CACE,gCAGF,cACE,yBRgCA,iCQ7BF,YAEI,8FAKJ,gCAIE,+IAKA,eACE,2CAKJ,YACE,sBACA,wEAIE,gCACA,CAFA,6CACA,CAFF,iDACE,CAEA,mBACA,qEAMA,YACE,6EAQA,wBACA,CAFA,WACA,CALF,YACE,sBACA,CAIA,kBAHA,QACA,CAFA,SAKA,yEAKJ,YACE,sBACA,sEAKA,kBACA,CAFF,YACE,CACA,SACA,yBRhCF,0CQPF,YA2CI,oDAIJ,4CAEE,yBR1CA,kDQwCF,eAII,kDAKF,kBADF,eAEE,mCAEF,eACE,eACA,wBAEF,iBACE,gDAIE,kBACE,0CAeJ,mBALA,cAEA,aAEA,CANA,WACA,CAKA,sBACA,CAVF,iBACE,CACA,OACA,CAFA,KACA,CAEA,UAOA,gDAEA,mCACE,4CAGF,oBACE,iBACA,kBACA,kDACA,8BACE,kCAKJ,YADF,UAEE,wCACA,eACE,oCAGA,iBACA,CACA,QADA,QACA,CAHF,UAIE,cAMN,kBACE,yBR9GE,aQ6GJ,aAII,kBAGF,eACE,oBAGA,kBACE,mBZtEJ,gBY4EE,iCZ7EF,CY2EA,aACE,sBACA,CZ7EF,oBY+EE,yBZnJA,0BAwEA,4BACA,CAFF,yBACE,CA/F8B,6BAuB9B,CA0EA,iDAzEA,kDAwEA,iCAOA,4CYuEI,qCACA,CAFF,yBACE,CACA,eACA,iBACA,yBZ5DJ,6BAFF,qEAEE,CAHF,8BACA,CYoEE,eAEE,gCAKJ,6CAGE,uDAFA,iDACA,oBAeA,CAdA,uBAQA,gCACA,+CAHA,kBACA,CAFA,iBASA,oCAJA,YACE,yBRnKF,uBQ4JF,sCAYI,wBEzNJ,4CAMA,CAhBF,YACE,CAEA,qBACA,CAFA,aACA,CAMA,6CACA,CAJA,iDACA,CANA,OACA,CAcA,gBATA,sBACA,CAJA,eACA,6BACA,CAEA,kCASA,0BV0CE,sBU3DJ,sCAYI,0BAQJ,aACE,0BVsCE,wBUvCJ,6CAGI,kBACA,4BAGF,mBACE,sBCrBJ,YACE,eAIF,qBACE,CACA,QACA,CAGA,MACA,CANA,UACA,CAEA,cACA,MACA,CACA,+BACA,CALA,OACA,CAIA,YdylCkC,iHcnlClC,YAEE,YACA,2DAKA,cADF,kBAEE,+DAKA,eADF,kBAEE,yBXkBA,oCWqBF,YACE,uDAIA,QACE,QACA,qBAIJ,aACE,mBACA,6BXrBA,oBWVF,aACA,Cd+iCkC,YcljClC,CAaE,OANF,gBAME,CAbF,gBACA,CAEA,eACA,CAiCF,cAxCE,MACA,CAMA,sDACA,kBAEA,CANA,SACA,CAJA,YAgBE,8BXFA,sBWVF,aACA,Cd+iCkC,YcljClC,CAOA,iBAGE,CAVF,gBACA,CAEA,eACA,CAuCF,cA9CE,CAaE,QAbF,KACA,CAMA,sDACA,kBAEA,CANA,SACA,CAJA,YAaE,oBCtEF,YACA,eACA,iBAJF,eACE,eAMA,sCAGE,oBACA,CAFF,YACE,CACA,eAIA,wCACA,iChB6EF,qBACA,8CApDE,0BAsDF,iCACE,0BAzEF,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BAmCvB,sDAsIF,yCACE,mEgB1JE,iCACA,CAFA,qCACA,CAHF,yBACE,gBACA,CAEA,eACA,oBCvBJ,eACA,CAHF,YACE,mBACA,CACA,cACA,2CAGA,cACE,gBACA,iDjB2JA,mEADF,iCAGI,2BiBvJF,mBADF,YAEE,8FASE,oCADA,iBACA,CAJF,qBAKE,+CAIF,aACE,8CAGF,UACE,0CAGF,aACE,wCAMF,oBADF,YAEE,eCrCF,kBACA,CAJA,YACA,cAEA,CACA,UATA,+BACA,CAGA,QACA,CAJA,mCACA,gBACA,CAJF,iBACE,CAGA,UAOA,iBAGA,eACE,mBAKA,WACA,CAFF,cACE,CACA,UACA,iBAIF,oBACE,ClByBA,4DAXA,yBACA,mCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,gBmBpDF,aACE,gBACA,mBAGA,kBACE,gBAKJ,YACE,sBACA,kBAGE,kBACA,CAGA,iCnBwEJ,CmB7EE,YACE,CACA,WACA,CACA,qBACA,CAFA,kBACA,CnByEJ,oBACA,wBApDE,0BAsDF,iCACE,0BAzEF,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BAmCvB,gCAsIF,yCACE,+BmBnJA,aADF,iBAEE,kCAIA,YACE,uCAEF,sBACE,0CAIF,aACE,+CAEF,wBACE,sDAMN,YACE,wBCrDE,mBADF,cAEE,2BAEA,iBACE,qBAKJ,6CACE,0BhBgDA,oBgBjDF,sCAGI,wBAIJ,gCACE,kDACA,oBACA,iBCrBJ,UACE,mBAGE,kBADF,aAEE,mBAGF,eACE,mBAKA,kBACA,YACA,CAGA,iCACA,CARF,YAEE,CAGA,aACA,kBACA,CAHA,YACA,CAGA,oBACA,qCAEA,oBrBwCF,4BAEA,CqBxCI,gBrBbkB,qDqBalB,CrBwCJ,yBAzCA,4CAhByB,8BqBkBrB,2CrBgBF,0BA0BF,iCACE,CAlD8B,6BAuB9B,CA2BA,iDA1BA,CAgCA,uFAIF,2BACE,mDACA,iCACE,mDA+FJ,yCACE,iDAxIA,yBACA,mCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,6CqBnBA,2BACE,mDACA,iCACE,mCAIJ,qBACE,cACA,uDAEA,yBACE,6BAIJ,UACE,8BAGF,WACE,iDAEA,gBACE,Y3B7BmB,wC4BvBzB,CAFA,oB5ByByB,C4BvBzB,iCAJA,SACA,CAFA,kBACA,CAFF,iBAOE,8BAJA,4CASE,CALF,kBAIE,iCACA,kBAIA,6BACA,WAFF,iBAGE,0CAKA,kCADA,0BACA,CAFF,iBAGE,+BAKA,iCACE,4FAIF,uBAEE,gBACA,yCAQF,8BAHF,YACE,kBACA,YAEA,eAIJ,4CACE,iCACA,iDAME,4CACA,CALF,WAEE,gBACA,CAEA,kCAFA,yCAGA,gBAWF,oBACA,CAFA,kBACA,CAIA,gBAHA,iCACA,CAJF,YACE,CAGA,kBAGA,sBtByFE,mEADF,iCAGI,8BAUJ,yCACE,kBsBlGF,gBACE,0DAKJ,YAEE,+DAGA,YACE,CAIA,QACA,CAEA,gBACA,CACA,gBATA,cAEA,CAIA,UACA,CrB4gCgC,OqB/gChC,CACA,8BACA,CAEA,SACA,CAPA,YAQA,sDrBwgCgC,qBqBjgChC,CAJF,YACE,CAKA,WACA,CACA,OAJA,UACA,CAJA,cACA,CAKA,KACA,CAHA,UACA,CAJA,YAOA,6CAGF,WACE,CACA,iBADA,aAEA,qEAIF,mCAEE,sBASF,kBACA,CAIA,0CAJA,wCACA,oBACA,kCACA,CALF,mBACE,CAIA,YAEA,4BAEA,4CACE,oCAEF,wCACE,mDAIF,sCACE,2CACA,CACA,iBADA,iBAEA,8CAGF,eACE,wBAIF,kBACE,gCAIF,YACE,yBlB7GA,+BkB4GF,YAII,iCCrKF,gGAFF,aACE,kBCDF,0BpBuDE,+BmBvDF,gBAMI,mCAUA,yCACA,CAJF,oBACE,CAGA,mCACA,CAJA,iBACA,eACA,CAEA,oBACA,oCAGA,wCACA,8CACE,yCAIA,WACA,CAFF,oCACE,CACA,yBACA,mBACA,sBE/BN,gBADA,iCACA,CAJF,eAEE,UAGA,oCzB2KA,yCACE,2ByBzKF,YACE,aACA,iCzB0JA,mEADF,iCAGI,kCyBxJA,kCADF,oBAEE,CASJ,+LAEF,YACE,qCC/BF,oCACE,iCACA,kBAEA,yBtB2DE,oCsB/DJ,mBAMI,4C1BuCA,yBACA,mCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,mDA4HF,yCACE,4C0BzKA,qCADF,gCAEE,yBAIJ,oCACE,+CACA,2CAEA,+CACE,iCACA,uBACA,4DAEA,+CACE,iD1BkBF,yBACA,C0BhBA,0C1BgBA,kCAOF,yBA1BA,CALgC,6BAuB9B,CAlBF,2CAhByB,CAIH,iDAOU,CAXP,6BA6CvB,C0BzBE,iD1B0GJ,qEAEE,CAHF,8BACA,C0BxGE,e1BuGF,CAGE,iB0BxGE,UACA,8DAEA,UACE,CACA,WACA,CAEA,MACA,CAHA,iBACA,CAEA,MALA,UACA,CAEA,UAGA,yDAOR,eAEE,azB4jCkC,yBGnjChC,wDsBXJ,eAKI,eCtDJ,kBAEE,sCAKA,YACE,CASA,iHAKJ,aACE,CAEE,wCADF,iC3BuFA,C2BtFE,sBAGF,aACE,CAIA,iBACA,CAJA,8BAGA,C3B6EF,oBACA,6BArEE,0BAwEA,4BACA,CAFF,yBACE,CA/F8B,6BAuB9B,CA0EA,iDAzEA,0DAwEA,iCAOA,8BAcA,6BAFF,qEAEE,CAHF,8BACA,C2BhGE,eAEE,oCAEA,iCACE,oDjCdmB,+CkCrBzB,CAJA,uBACA,mCACA,qBlCuByB,CkCrBzB,+FJHA,CILA,oBACA,CACA,eACA,CAFA,eACA,CACA,uBACA,CJCA,kBIRF,qBAaE,0DAEA,mBACE,iBACA,kBAKF,6CADF,qCAEE,oBAIA,6CADF,qCAEE,gBAIA,4CADF,oCAEE,sBAGF,eACE,6BAGE,2BACA,CACA,gDADA,yBACA,CAHF,kBAIE,mCAKF,8BACE,8CACA,qCAKF,8BACE,gDACA,wCAKF,6BACE,mDACA,wBC9DF,6CAFF,YACE,sBAEA,yBzB4DE,uByB/DJ,eAMI,uDAKA,gCACA,CAFA,6CACA,CAFF,iDACE,CAEA,mBACA,wCAIA,eACA,CAFF,kBACE,CACA,SACA,6CAIE,kCAFF,aACE,iBAEA,mDAIE,6BAFF,8BACE,qBAEA,8CC5BN,YACA,cAFF,eAGE,sEAIE,uCACA,CAFA,cACA,CACA,gBAHF,cAIE,2FAGE,kBACA,CAGA,4CACA,CACA,6CADA,8BACA,CAPF,YACE,CACA,SACA,cACA,yCAIA,kFAGF,iCACE,kBACA,wFAEA,gCACE,wBACA,wCACA,sDACA,wFAGJ,iCACE,oGAKF,+CACE,kEAIJ,yCACE,iCACA,0EAGE,iCACE,qEAIJ,wCACE,0EAGF,2BACE,wEAKA,0CADA,wCACA,CAFF,kBAGE,4BC7DqB,+CAUzB,CAJA,uBACA,mCACA,qBARyB,CAUzB,gGATF,oBAEE,CACA,eACA,CAFA,qBACA,CACA,uBPDA,oDOUA,eACE,sEAIF,kBACE,oBACA,mEAIF,eAEE,gEAMA,qDACA,CAHF,eACE,+BACA,CACA,iBACA,UAGA,8EC1BA,yCACA,CAPF,UACE,CACA,WACA,CACA,MACA,CAGA,oBALA,iBACA,CACA,KACA,CALA,UACA,CAKA,UAKA,4ED0BE,2BACA,CAEA,0CACA,CAHA,yBACA,CAHA,WACA,CAHA,UACA,CAIA,mBACA,CACA,UARF,iBACE,CACA,UAOA,oEAIF,eACE,gDAIJ,uCACE,kGAEE,8CACE,gGAGF,gCACE,6CACA,4CAKN,qCACE,8FAEE,4CACE,4FAGF,8BACE,2CACA,4CAKN,qCACE,8FAEE,4CACE,4FAGF,8BACE,2CACA,0CAKN,oCACE,4FAEE,2CACE,0FAGF,6BACE,0CACA,wCAKN,oCACE,0FAEE,2CACE,wFAGF,6BACE,yCACA,sCAKN,qCACE,wFAEE,4CACE,sFAGF,8BACE,wCACA,oCAKN,qCACE,sFAEE,4CACE,oFAGF,8BACE,uCACA,gDAKN,uCACE,kGAEE,8CACE,gGAGF,gCACE,6CACA,sCAKN,kCACE,wFAEE,yCACE,sFAGF,2BACE,wCACA,4CAKN,qCACE,8FAEE,4CACE,4FAGF,8BACE,2CACA,4DAKN,uCACE,8GAEE,8CACE,4GAGF,gCACE,wCACA,4CAcJ,yBAHA,UACA,CAFA,WACA,CACA,iBACA,aACA,CALF,aAQE,+HAIA,uCAEE,uHAGF,qCAEE,iHAGF,oCAEE,oKAGF,qCAGE,2GAGF,kCAEE,sFAIF,aACE,eACA,uDAmBJ,yCACA,qCACA,qBAtRyB,CAwRzB,gGAVF,YAKE,sBACA,CApRyB,oBPIzB,2GOuRA,gBACE,+DAIF,2CACE,+FAIF,iBACE,2GAEA,gBAEE,eASJ,yCACA,CAFF,wCACE,CACA,oBApTyB,kBAuTzB,UACA,2BACA,mBACE,+BAOA,+CACA,2CACA,uDALA,eACA,CACA,oBACA,CAFA,iBACA,CAHF,iBAOE,gFAIF,eAEE,iBAGF,iBACE,mBACA,UAOJ,YACE,sBACA,aAOA,gBADF,YAEE,kBE7VF,wBACE,oBACA,gBACA,gCAIE,0CAFF,uBACE,mBAEA,kCAKA,iBACE,yCAEA,iBACE,2CAKJ,gBACE,gBACA,kBACA,mCAWJ,kBACE,MAKJ,4CACE,2CAKF,iBAEE,CAYA,kHAGF,gCAIE,WAUF,kCACE,yCAGF,iCAEE,gBACA,4BAIF,wCAEE,gBAGF,uCACE,wBAMA,yCAFA,+CACA,CAFF,4CACE,CACA,iBAEA,4FAUA,gBACE,yGAGA,YACE,uGAIJ,YACE,4BACA,4MAMA,0CADA,mBACA,CAHF,gBAIE,gEC9HF,qBALF,YAGE,sBACA,YHPyB,2BGc3B,wCACE,qBHfyB,kDGoBvB,+CACA,CACA,cACA,4CAJF,QACE,CACA,aAGA,+DAEA,iBACE,kDAOF,gBADF,QAEE,sDACA,WACE,gBACA,cASJ,yCACA,yCACA,sBAHF,oBAIE,QAGF,wCACE,uCAKF,uBACE,cAIF,oBACE,qBClEE,kBAFF,iBAGE,2BAGF,kBACE,mBAKA,iCACA,CAHF,0CACE,2CACA,CACA,gBACA,kBACA,+BAGE,gBACA,mBAFF,iBAGE,gDCnBN,WACE,+CAGF,WACE,sBAKA,gBADF,oBAEE,gBAIF,mBACE,2BACA,kBACE,wDAEF,eAEE,uBAGF,wCACE,gFCtBJ,gBAIE,yBACA,yBACA,sBACA,qBACA,ICZA,kBACA,kBAFF,cAGE,OAGF,yBAEE,yCACA,oBACE,kBACA,YCTF,+CACA,qBRAyB,CQFzB,iCACA,CAFF,WACE,CREyB,iBQEzB,cAEA,gCACE,wBAIF,QACE,yBAIF,eACE,mBPHA,+CACA,CAPF,UACE,CACA,WACA,CACA,MACA,CAGA,oBALA,iBACA,CACA,KACA,CALA,UACA,COaF,UPHE,COIA,cCtBJ,sCACE,CAGA,iBACA,CAJA,2BACA,cACA,gBACA,CAEA,eACA,CAFA,iBACA,CACA,iBACA,sBRIE,yCACA,CAPF,UACE,CACA,WACA,CACA,MACA,CAGA,oBALA,iBACA,CACA,KACA,CALA,UACA,CAKA,UAKA,6BQDF,kCAJF,gCACE,0BACA,eACA,gBAEA,OCjBF,aACE,CACA,gBAGA,mBAJA,aAKA,mBAEA,cACE,kBAGF,aACE,eAOF,gBACA,mCAFF,iBAGE,yCAMA,eACE,2CAGF,gBACE,6CAGF,iBACE,QAKJ,yBACE,4BC5CA,eACE,gBACA,qBAGF,cACE,uCAGF,eACE,mBACA,yCAGE,gBADF,eAEE,0CAGF,eACE,2BACA,gCAKJ,eACE,qDAQF,eACE,eACA,oBChCJ,kBAEE,aACA,eACA,gBAEA,WAIF,mBACE,UAKA,2BADF,QAGE,iCAIE,cADF,iBAEE,wBAIF,WACE,CACA,cADA,oBAEA,0CAIA,QACE,+CClCJ,6CAEE,iBAEA,mDAIA,gCACE,wBASF,YAEA,sBACA,SACA,CATF,eAEE,CAOA,gBANA,iBAEA,CAHA,cAQA,oCAGA,kBACE,eACA,UACA,uCAKE,mBAFF,YAGE,mBAUN,YACA,CAFF,eACE,CACA,cACA,wBAGA,YAEE,cACA,0BAIE,kBACA,CAFF,YACE,CAEA,QACA,oBAFA,gBAGA,mCAEA,gCACE,kEAOJ,kCACE,sCAMJ,YACE,oCAIF,gBACE,iBACA,mEAEA,mCACE,8BAQN,cAEE,sDAEA,eACE,oFAGA,YACE,mBACA,eACA,CAEA,gBACA,CAHA,QACA,gBACA,CACA,cACA,0FAKA,kBADF,YAEE,8FAEA,eACE,4FAKJ,mBACE,qBC9HJ,iBACA,mBACA,gBACA,CALF,kBACE,oBACA,CAGA,WACA,8BCNA,kBACA,CACA,sBAGA,CAMA,0CANA,WAMA,CAbF,YAEE,CACA,sBAWA,4CAJA,4BACE,kDAOE,yCADF,2BAEE,oDAMF,0CADF,2BAEE,+WC7BF,gCAQE,8EAGF,4CAEE,yCACA,kBACA,iCACA,eACA,iBACA,mCCNF,sBACA,CAHF,WAEE,CACA,eACA,8FAGA,oBAEE,iDAEF,yCACE,8FAIF,oBAEE,sGACA,YACE,kBC3BN,uBACE,OC+EF,qBAIM,q+BAqNN,2BAhDY,+BAFA,8BAEA,iCAFA,2BAEA,8BAFA,yBAEA,4BAFA,4BAEA,+BAFA,4BAEA,+BAFA,+CAEA,qDAFA,2BAEA,8BAFA,8BAEA,8XAUV,yCACE,kDAXQ,CAYR,+EAIA,sBAEE,wBAlBM,8BAFA,CAEA,gCAFA,2BAEA,8BAFA,CAEA,2BAFA,CAEA,8BAFA,CAEA,8BAFA,+CAEA,qDAFA,CAEA,6BAFA,8BAEA,8XAUV,yCACE,mDAXQ,kBAuDG,CA3CX,+EAIA,sBAEE,uBAlBM,8BAFA,CAEA,gCAFA,2BAEA,8BAFA,CAEA,2BAFA,CAEA,8BAFA,CAEA,8BAFA,+CAEA,qDAFA,CAEA,6BAFA,8BAEA,6XAUV,yCACE,mDAXQ,iBAuDG,CA3CX,+EASA,sBAEE,4DAMF,mCACE,wEAMF,eACE,qBACA,sCAGF,+BACE,oBAsBJ,8BACE,sBADF,gCACE,mBADF,6BACE,iBADF,2BACE,oBADF,8BACE,oBADF,8BACE,sBADF,gCACE,mBADF,6BACE,sBADF,gCACE,uBADF,iCACE,0BADF,oCACE,mBADF,6BACE,mBADF,6BACE,yBADF,mCACE,wBADF,kCACE,8BADF,wCACE,mBADF,6BACE,uBADF,iCACE,0BADF,oCACE,oBADF,8BACE,uBADF,iCACE,wBC7OF,2BAfA,8BAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,mCAIA,8BA9BZ,gCAGA,wCAEA,gDAEA,0DACA,oEAEA,gCAgBY,qCAIA,4BA9BZ,8BAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,mCAIA,yBA9BZ,2BAGA,mCAEA,sCAEA,gDACA,0DAEA,2BAgBY,gCAIA,4BA9BZ,iCAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,mCAIA,2BA9BZ,6BAGA,qCAEA,0CAEA,oDACA,8DAEA,6BAgBY,kCAIA,0BA9BZ,+BAGA,oCAEA,wCAEA,kDACA,4DAEA,4BAgBY,iCAIA,0BA9BZ,4BAGA,oCAEA,wCAEA,kDACA,4DAEA,4BAgBY,8BAIA,yBA9BZ,2BAGA,mCAEA,sCAEA,gDACA,0DAEA,0BAVA,4BAGA,iCAEA,wCAEA,kDACA,4DAEA,uBAVA,+BAGA,oCAEA,wCAEA,kDACA,4DAEA,uBAKA,2BAfA,iCAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,gCAIA,8BA9BZ,mCAGA,wCAEA,gDAEA,0DACA,oEAEA,gCAgBY,kCAIA,4BA9BZ,iCAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,gCAIA,yBA9BZ,8BAGA,mCAEA,sCAEA,gDACA,0DAEA,2BAgBY,6BAIA,4BA9BZ,iCAGA,sCAEA,4CAEA,sDACA,gEAEA,8BAgBY,gCAIA,2BA9BZ,gCAGA,qCAEA,0CAEA,oDACA,8DAEA,6BAgBY,+BAIA,0BA9BZ,+BAGA,oCAEA,wCAEA,kDACA,4DAEA,4BAgBY,iCAIA,0BA9BZ,+BAGA,oCAEA,wCAEA,kDACA,4DAEA,4BAgBY,8BAIA,yBA9BZ,2BAGA,mCAEA,sCAEA,gDACA,0DAEA,0BAVA,4BAGA,iCAEA,wCAEA,kDACA,4DAEA,uBAVA,+BAGA,oCAEA,wCAEA,kDACA,4DAEA,CAsCE,6CADF,8CACE,qJAQF,+F3BnHA,sB2B+HF,wCACE,sCAGA,kDACE,gDACA,sCAGA,4CACA,yEAFF,kDAME,6CAUA,6DACE,+BACA,yDAIF,uCACE,iCACA,+BAMF,oCACA,CAFF,iCACE,CACA,gBACA,0CAGE,wCADF,gCAEE,qBASN,kBAEE,gG3BtLA,4C2BuLA,kBACE,mEACA,QACE,4CAaF,2CAKA,oDACA,CAXA,kBACA,CAUA,gCAqBA,gEAjCF,YACE,CAEA,eACA,CACA,oBACA,CAFA,iBACA,CAHA,iBAmCA,mEAxBA,mDACE,CAKE,yIAEA,+CACE,sDACA,+DAGJ,+CAEE,CATA,6IAEA,iDACE,wDACA,iEAGJ,iDAEE,CATA,yIAEA,+CACE,sDACA,+DAGJ,+CAEE,CATA,mIAEA,4CACE,mDACA,4DAGJ,4CAEE,CATA,yIAEA,+CACE,sDACA,+DAGJ,+CAEE,CATA,uIAEA,8CACE,qDACA,8DAGJ,8CAEE,CATA,qIAEA,6CACE,oDACA,6DAGJ,6CAEE,CATA,qIAEA,6CACE,oDACA,6DAGJ,6CAEE,CATA,mIAEA,4CACE,mDACA,4DAGJ,4CAEE,CATA,qIAEA,6CACE,oDACA,6DAGJ,6CAEE,CATA,qIAEA,6CACE,oDACA,6DAGJ,6CAEE,mDnBrNJ,gDACA,CAPF,UACE,CACA,WACA,CACA,MACA,CAGA,oBALA,iBACA,CACA,KACA,CALA,UACA,CAKA,UAKA,mEmB2NE,gDADA,4CACA,CAFF,8DAGE,iEAGA,kBACA,8CAFF,mBAGE,qEACA,SACE,uHAKJ,SAEE,8CCzPF,aACE,4CAOF,8CACE,0DCFJ,iBACE,wE7BEF,2CACA,qBACA,C6BGE,oC7BLF,CAEA,aACA,iE6BME,kCACE,sBAMN,kBACE,yBAOF,cACE,gBACA,oH7B1BA,2CACA,qBACA,C6B8BE,oC7BhCF,CAEA,aACA,4B6BsCA,YACE,sBACA,wBACA,mDAGF,oBtB5DyB,8BsBkEvB,iBACE,wEC7DN,eACE,UACA,4CCFE,mCACE,aACA,0DAGF,iCACE,gCAKF,gBADF,QAEE,mCAEA,qBACE,CAEA,iDADA,aACA,CAFA,cAGA,qCAGA,eACE,2FAGF,gCAEE,gBACA,6GAKE,kCAFF,WACE,mBAEA","sources":["webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/pydata-sphinx-theme.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_layout.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_fonts.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_icons.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_admonitions.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_versionmodified.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/base/_base.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/abstracts/_links.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/_variables.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_skip-link.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_container.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_breakpoints.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_announcement.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_article.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_footer.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_footer-article.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_footer-content.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_header.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_header-article.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_sidebar-primary.scss","webpack://pydata_sphinx_theme/./node_modules/bootstrap/scss/mixins/_grid.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_sidebar-secondary.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/sections/_sidebar-toggle.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_breadcrumbs.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_icon-links.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/header/_header-logo.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_navbar-links.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_page-toc.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_prev-next.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_search.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_searchbox.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/abstracts/_mixins.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_switcher-theme.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_switcher-version.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_toc-inpage.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_versionmodified.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_indices.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/components/_readthedocs-switcher.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_admonitions.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/abstracts/_color.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_api.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_code.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_figures.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_footnotes.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_hacks.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_lists.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_quotes.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_spans.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_tables.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_toctree.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/content/_math.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_ablog.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_bootstrap.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_copybutton.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_ethical-ads.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_execution.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_pydata.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/variables/_color.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_sphinx_design.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_togglebutton.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_notebooks.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/extensions/_leaflet.scss","webpack://pydata_sphinx_theme/./src/pydata_sphinx_theme/assets/styles/pages/_search.scss"],"sourcesContent":["html{--pst-header-height: 4rem;--pst-header-article-height: calc(var(--pst-header-height) * 2 / 3);--pst-sidebar-secondary: 17rem}html{--pst-font-size-base: 1rem;--pst-font-size-h1: 2.5rem;--pst-font-size-h2: 2rem;--pst-font-size-h3: 1.75rem;--pst-font-size-h4: 1.5rem;--pst-font-size-h5: 1.25rem;--pst-font-size-h6: 1.1rem;--pst-font-size-milli: 0.9rem;--pst-sidebar-font-size: 0.9rem;--pst-sidebar-font-size-mobile: 1.1rem;--pst-sidebar-header-font-size: 1.2rem;--pst-sidebar-header-font-weight: 600;--pst-admonition-font-weight-heading: 600;--pst-font-weight-caption: 300;--pst-font-weight-heading: 400;--pst-font-family-base-system: -apple-system, BlinkMacSystemFont, Segoe UI, \"Helvetica Neue\", Arial, sans-serif, Apple Color Emoji, Segoe UI Emoji, Segoe UI Symbol;--pst-font-family-monospace-system: \"SFMono-Regular\", Menlo, Consolas, Monaco, Liberation Mono, Lucida Console, monospace;--pst-font-family-base: var(--pst-font-family-base-system);--pst-font-family-heading: var(--pst-font-family-base-system);--pst-font-family-monospace: var(--pst-font-family-monospace-system)}html{--pst-font-size-icon: 1.5rem;--pst-icon-check-circle: \"\";--pst-icon-info-circle: \"\";--pst-icon-exclamation-triangle: \"\";--pst-icon-exclamation-circle: \"\";--pst-icon-times-circle: \"\";--pst-icon-lightbulb: \"\";--pst-icon-download: \"\";--pst-icon-angle-left: \"\";--pst-icon-angle-right: \"\";--pst-icon-external-link: \"\";--pst-icon-search-minus: \"\";--pst-icon-github: \"\";--pst-icon-gitlab: \"\";--pst-icon-share: \"\";--pst-icon-bell: \"\";--pst-icon-pencil: \"\";--pst-breadcrumb-divider: \"\"}html{--pst-icon-admonition-default: var(--pst-icon-bell);--pst-icon-admonition-note: var(--pst-icon-info-circle);--pst-icon-admonition-attention: var(--pst-icon-exclamation-circle);--pst-icon-admonition-caution: var(--pst-icon-exclamation-triangle);--pst-icon-admonition-warning: var(--pst-icon-exclamation-triangle);--pst-icon-admonition-danger: var(--pst-icon-exclamation-triangle);--pst-icon-admonition-error: var(--pst-icon-times-circle);--pst-icon-admonition-hint: var(--pst-icon-lightbulb);--pst-icon-admonition-tip: var(--pst-icon-lightbulb);--pst-icon-admonition-important: var(--pst-icon-exclamation-circle);--pst-icon-admonition-seealso: var(--pst-icon-share);--pst-icon-admonition-todo: var(--pst-icon-pencil)}html{--pst-icon-versionmodified-default: var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-added: var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-changed: var(--pst-icon-exclamation-circle);--pst-icon-versionmodified-deprecated: var(--pst-icon-exclamation-circle)}:root{--pst-teal-50: #f4fbfc;--pst-teal-100: #e9f6f8;--pst-teal-200: #d0ecf1;--pst-teal-300: #abdde6;--pst-teal-400: #3fb1c5;--pst-teal-500: #0a7d91;--pst-teal-600: #085d6c;--pst-teal-700: #064752;--pst-teal-800: #042c33;--pst-teal-900: #021b1f;--pst-violet-50: #f4eefb;--pst-violet-100: #e0c7ff;--pst-violet-200: #d5b4fd;--pst-violet-300: #b780ff;--pst-violet-400: #9c5ffd;--pst-violet-500: #8045e5;--pst-violet-600: #6432bd;--pst-violet-700: #4b258f;--pst-violet-800: #341a61;--pst-violet-900: #1e0e39;--pst-gray-50: #f9f9fa;--pst-gray-100: #f3f4f5;--pst-gray-200: #e5e7ea;--pst-gray-300: #d1d5da;--pst-gray-400: #9ca4af;--pst-gray-500: #677384;--pst-gray-600: #48566b;--pst-gray-700: #29313d;--pst-gray-800: #222832;--pst-gray-900: #14181e;--pst-pink-50: #fcf8fd;--pst-pink-100: #fcf0fa;--pst-pink-200: #f8dff5;--pst-pink-300: #f3c7ee;--pst-pink-400: #e47fd7;--pst-pink-500: #c132af;--pst-pink-600: #912583;--pst-pink-700: #6e1c64;--pst-pink-800: #46123f;--pst-pink-900: #2b0b27;--pst-foundation-white: #ffffff;--pst-foundation-black: #14181e}html:not([data-theme]){--pst-color-primary: #0a7d91;--pst-color-primary-bg: #d0ecf1;--pst-color-secondary: #8045e5;--pst-color-secondary-bg: #e0c7ff;--pst-color-accent: #c132af;--pst-color-accent-bg: #f8dff5;--pst-color-info: #276be9;--pst-color-info-bg: #dce7fc;--pst-color-warning: #f66a0a;--pst-color-warning-bg: #f8e3d0;--pst-color-success: #00843f;--pst-color-success-bg: #d6ece1;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #d72d47;--pst-color-danger-bg: #f9e1e4;--pst-color-text-base: #222832;--pst-color-text-muted: #48566b;--pst-color-heading-color: #ffffff;--pst-color-shadow: rgba(0, 0, 0, 0.1);--pst-color-border: #d1d5da;--pst-color-border-muted: rgba(23, 23, 26, 0.2);--pst-color-inline-code: #912583;--pst-color-inline-code-links: #085d6c;--pst-color-target: #f3cf95;--pst-color-background: #ffffff;--pst-color-on-background: #ffffff;--pst-color-surface: #f3f4f5;--pst-color-on-surface: #222832}html:not([data-theme]){--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html:not([data-theme]) .only-dark,html:not([data-theme]) .only-dark~figcaption{display:none !important}html[data-theme=light]{--pst-color-primary: #0a7d91;--pst-color-primary-bg: #d0ecf1;--pst-color-secondary: #8045e5;--pst-color-secondary-bg: #e0c7ff;--pst-color-accent: #c132af;--pst-color-accent-bg: #f8dff5;--pst-color-info: #276be9;--pst-color-info-bg: #dce7fc;--pst-color-warning: #f66a0a;--pst-color-warning-bg: #f8e3d0;--pst-color-success: #00843f;--pst-color-success-bg: #d6ece1;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #d72d47;--pst-color-danger-bg: #f9e1e4;--pst-color-text-base: #222832;--pst-color-text-muted: #48566b;--pst-color-heading-color: #ffffff;--pst-color-shadow: rgba(0, 0, 0, 0.1);--pst-color-border: #d1d5da;--pst-color-border-muted: rgba(23, 23, 26, 0.2);--pst-color-inline-code: #912583;--pst-color-inline-code-links: #085d6c;--pst-color-target: #f3cf95;--pst-color-background: #ffffff;--pst-color-on-background: #ffffff;--pst-color-surface: #f3f4f5;--pst-color-on-surface: #222832;color-scheme:light}html[data-theme=light]{--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html[data-theme=light] .only-dark,html[data-theme=light] .only-dark~figcaption{display:none !important}html[data-theme=dark]{--pst-color-primary: #3fb1c5;--pst-color-primary-bg: #042c33;--pst-color-secondary: #9c5ffd;--pst-color-secondary-bg: #341a61;--pst-color-accent: #e47fd7;--pst-color-accent-bg: #46123f;--pst-color-info: #79a3f2;--pst-color-info-bg: #06245d;--pst-color-warning: #ff9245;--pst-color-warning-bg: #652a02;--pst-color-success: #5fb488;--pst-color-success-bg: #002f17;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #e78894;--pst-color-danger-bg: #4e111b;--pst-color-text-base: #ced6dd;--pst-color-text-muted: #9ca4af;--pst-color-heading-color: #14181e;--pst-color-shadow: rgba(0, 0, 0, 0.2);--pst-color-border: #48566b;--pst-color-border-muted: #29313d;--pst-color-inline-code: #f3c7ee;--pst-color-inline-code-links: #3fb1c5;--pst-color-target: #675c04;--pst-color-background: #14181e;--pst-color-on-background: #222832;--pst-color-surface: #29313d;--pst-color-on-surface: #f3f4f5;color-scheme:dark}html[data-theme=dark]{--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html[data-theme=dark] .only-light,html[data-theme=dark] .only-light~figcaption{display:none !important}html[data-theme=dark] img:not(.only-dark):not(.dark-light){filter:brightness(0.8) contrast(1.2)}html[data-theme=dark] .bd-content img:not(.only-dark):not(.dark-light){background:#fff;border-radius:.25rem}html[data-theme=dark] .MathJax_SVG *{fill:var(--pst-color-text-base)}.pst-color-primary{color:var(--pst-color-primary)}.pst-color-secondary{color:var(--pst-color-secondary)}.pst-color-accent{color:var(--pst-color-accent)}.pst-color-info{color:var(--pst-color-info)}.pst-color-warning{color:var(--pst-color-warning)}.pst-color-success{color:var(--pst-color-success)}.pst-color-attention{color:var(--pst-color-attention)}.pst-color-danger{color:var(--pst-color-danger)}.pst-color-text-base{color:var(--pst-color-text-base)}.pst-color-text-muted{color:var(--pst-color-text-muted)}.pst-color-heading-color{color:var(--pst-color-heading-color)}.pst-color-shadow{color:var(--pst-color-shadow)}.pst-color-border{color:var(--pst-color-border)}.pst-color-border-muted{color:var(--pst-color-border-muted)}.pst-color-inline-code{color:var(--pst-color-inline-code)}.pst-color-inline-code-links{color:var(--pst-color-inline-code-links)}.pst-color-target{color:var(--pst-color-target)}.pst-color-background{color:var(--pst-color-background)}.pst-color-on-background{color:var(--pst-color-on-background)}.pst-color-surface{color:var(--pst-color-surface)}.pst-color-on-surface{color:var(--pst-color-on-surface)}html{font-size:var(--pst-font-size-base);scroll-padding-top:calc(var(--pst-header-height) + 1rem)}body{background-color:var(--pst-color-background);font-family:var(--pst-font-family-base);font-weight:400;line-height:1.65;color:var(--pst-color-text-base);min-height:100vh;display:flex;flex-direction:column}body::-webkit-scrollbar-track{background:var(--pst-color-background)}p{margin-bottom:1.15rem;font-size:1em;color:var(--pst-color-text-base)}p.rubric{border-bottom:1px solid var(--pst-color-border)}p.centered{text-align:center}a{word-wrap:break-word;color:var(--pst-color-link);text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em}a:hover{color:var(--pst-color-link-hover);text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}a:active{color:var(--pst-color-link)}a:visited{color:var(--pst-color-link)}a:visited:hover{color:var(--pst-color-link-hover)}a:focus-visible{outline:2px solid var(--pst-color-accent)}a.headerlink{color:var(--pst-color-secondary);opacity:.7;font-size:.8em;padding:0 4px 0 4px;margin-left:.2em;text-decoration:none;transition:all .2s ease-out;user-select:none}a.headerlink:hover{opacity:1}a.github::before,a.gitlab::before{color:var(--pst-color-text-muted);font:var(--fa-font-brands);margin-right:.25rem}a.github::before{content:var(--pst-icon-github)}a.gitlab::before{content:var(--pst-icon-gitlab)}.heading-style,h6,h5,h4,h3,h2,h1{margin:2.75rem 0 1.05rem;font-family:var(--pst-font-family-heading);font-weight:var(--pst-font-weight-heading);line-height:1.15}h1{margin-top:0;font-size:var(--pst-font-size-h1);color:var(--pst-heading-color)}h2{font-size:var(--pst-font-size-h2);color:var(--pst-heading-color)}h3{font-size:var(--pst-font-size-h3);color:var(--pst-heading-color)}h4{font-size:var(--pst-font-size-h4);color:var(--pst-heading-color)}h5{font-size:var(--pst-font-size-h5);color:var(--pst-color-text-base)}h6{font-size:var(--pst-font-size-h6);color:var(--pst-color-text-base)}small,.text_small{font-size:var(--pst-font-size-milli)}hr{border:0;border-top:1px solid var(--pst-color-border)}pre,code,kbd,samp{font-family:var(--pst-font-family-monospace)}kbd{background-color:var(--pst-color-on-background);color:var(--pst-color-text-muted)}kbd:not(.compound){border:1px solid var(--pst-color-border);margin:0 .1rem;padding:.1rem .4rem;box-shadow:1px 1px 1px var(--pst-color-shadow)}code{color:var(--pst-color-inline-code)}pre{margin:1.5em 0 1.5em 0;padding:1rem;background-color:var(--pst-color-surface);color:var(--pst-color-text-base);line-height:1.2em;border:1px solid var(--pst-color-border);border-radius:.25rem}pre .linenos{opacity:.8;padding-right:10px}#pst-back-to-top{z-index:1080;position:fixed;display:none;top:80vh;left:50vw;transform:translate(-50%);color:var(--pst-color-secondary-text);background-color:var(--pst-color-secondary);border:none}.skip-link{position:fixed;top:0;left:0;right:0;text-align:center;background-color:var(--pst-color-warning);color:var(--pst-color-warning-text) !important;padding:.5rem;z-index:1055;border-bottom:1px solid var(--pst-color-border);transform:translateY(-100%);transition:transform 150ms ease-in-out}.skip-link:focus{transform:translateY(0%);outline:3px solid #14181e}.bd-container{flex-grow:1;display:flex;justify-content:center}.bd-container .bd-container__inner{display:flex}.bd-page-width{width:100%}@media(min-width: 960px){.bd-page-width{max-width:88rem}}.bd-header-version-warning,.bd-header-announcement{min-height:3rem;width:100%;display:flex;position:relative;align-items:center;justify-content:center;text-align:center;padding:.5rem 12.5%}@media(max-width: 959.98px){.bd-header-version-warning,.bd-header-announcement{padding:.5rem 2%}}.bd-header-version-warning p,.bd-header-announcement p{font-weight:bold;margin:0}.bd-header-version-warning:after,.bd-header-announcement:after{position:absolute;width:100%;height:100%;left:0;top:0;content:\"\";z-index:-1}.bd-header-version-warning:empty,.bd-header-announcement:empty{display:none}.bd-header-version-warning a,.bd-header-announcement a{color:var(--pst-color-inline-code-links)}.bd-header-announcement:after{background-color:var(--pst-color-secondary-bg)}.bd-header-version-warning:after{background-color:var(--pst-color-danger-bg)}.bd-main{flex-grow:1;flex-direction:column;display:flex;min-width:0}.bd-main .bd-content{display:flex;justify-content:center;height:100%}.bd-main .bd-content .bd-article-container{justify-content:start;display:flex;flex-direction:column;width:100%;max-width:60em;overflow-x:auto;padding:1rem}@media(min-width: 1200px){.bd-main .bd-content .bd-article-container .bd-article{padding-top:1.5rem;padding-left:2rem}}.bd-footer{width:100%;border-top:1px solid var(--pst-color-border)}.bd-footer .bd-footer__inner{display:flex;flex-grow:1;padding:1rem;margin:auto}.bd-footer .footer-items__start,.bd-footer .footer-items__center,.bd-footer .footer-items__end{display:flex;flex-direction:column;gap:.5rem;justify-content:center;flex-grow:1}.bd-footer .footer-items__center{text-align:center}.bd-footer .footer-items__end{text-align:end}.bd-footer .footer-item p{margin-bottom:0}.bd-footer-article{margin-top:auto}.bd-footer-article .footer-article-items{display:flex;flex-direction:column}.bd-footer-content .footer-content-items{display:flex;flex-direction:column;margin-top:auto}.bd-header{position:sticky;top:0;z-index:1030;background:var(--pst-color-on-background) !important;box-shadow:0 .125rem .25rem 0 var(--pst-color-shadow);width:100%;padding:0;max-width:100vw;justify-content:center}.bd-header .bd-header__inner{display:flex;align-items:center;height:fit-content;padding-left:1rem;padding-right:1rem}.bd-header .navbar-item{height:var(--pst-header-height);max-height:var(--pst-header-height);display:flex;align-items:center}.bd-header .navbar-header-items{display:none;flex-shrink:1}@media(min-width: 960px){.bd-header .navbar-header-items{display:flex;flex-grow:1;padding:0 0 0 .5rem}}.bd-header .navbar-header-items__end,.bd-header .navbar-header-items__center,.bd-header .navbar-header-items__start{display:flex;align-items:center;flex-flow:wrap;row-gap:0}.bd-header .navbar-header-items__end,.bd-header .navbar-header-items__center{column-gap:1rem}.bd-header .navbar-header-items__start{flex-shrink:0;margin-right:auto;gap:.5rem}.bd-header .navbar-header-items__end{justify-content:end}.bd-header .navbar-nav{display:flex}@media(min-width: 960px){.bd-header .navbar-nav{align-items:center}}.bd-header .navbar-nav li a.nav-link{color:var(--pst-color-text-muted);text-decoration:none}.bd-header .navbar-nav li a.nav-link:hover{color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}.bd-header .navbar-nav li a.nav-link:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-nav>.current>.nav-link{font-weight:600;color:var(--pst-color-primary);border-bottom:max(3px, .1875rem, .12em) solid var(--pst-color-primary)}.bd-header .navbar-nav .dropdown button{display:unset;color:var(--pst-color-text-muted);border:none}.bd-header .navbar-nav .dropdown button:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.bd-header .navbar-nav .dropdown button:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-nav .dropdown .dropdown-menu{z-index:1070;border:1px solid var(--pst-color-border);box-shadow:0 0 .3rem .1rem var(--pst-color-shadow);background-color:var(--pst-color-on-background);padding:.5rem 0;margin:.5rem 0;min-width:20rem}.bd-header .navbar-nav .dropdown .dropdown-menu .dropdown-item{padding:.25rem 1.5rem}.bd-header .navbar-nav .dropdown .dropdown-menu .dropdown-item:focus:not(:hover):not(:active){background-color:inherit}.bd-header .navbar-nav .dropdown .dropdown-menu:not(.show){display:none}@media(min-width: 960px){.navbar-center-items .navbar-item{display:inline-block}}.nav-link{transition:none}.nav-link:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.nav-link.nav-external:after{font:var(--fa-font-solid);content:var(--pst-icon-external-link);font-size:.75em;margin-left:.3em}.bd-navbar-elements li.nav-item i{font-size:.7rem;padding-left:2px;vertical-align:middle}.bd-header label.sidebar-toggle{display:flex;cursor:pointer;font-size:var(--pst-font-size-icon);align-items:center;color:var(--pst-color-muted);margin-bottom:0;padding-bottom:.25rem}.bd-header label.primary-toggle{margin-right:1rem}@media(min-width: 960px){.bd-header label.primary-toggle{display:none}}.bd-header label.secondary-toggle{margin-left:1rem}@media(min-width: 1200px){.bd-header label.secondary-toggle{display:none}}.bd-header label:hover{color:var(--pst-color-link-hover);box-shadow:0px max(3px, .1875rem, .12em) 0px var(--pst-color-link-hover)}.bd-header label:focus-visible{outline:2px solid var(--pst-color-accent)}.bd-header .navbar-header-items{display:none}@media(min-width: 960px){.bd-header .navbar-header-items{display:inherit}}.navbar-persistent--mobile{margin-left:auto}@media(min-width: 960px){.navbar-persistent--mobile{display:none}}.navbar-persistent--container{display:none}@media(min-width: 960px){.navbar-persistent--container{display:flex}}.header-article__inner{display:flex;padding:0 .5rem}.header-article__inner .header-article-item{min-height:var(--pst-header-article-height);height:var(--pst-header-article-height)}.header-article__inner .header-article-items__start,.header-article__inner .header-article-items__end{display:flex;align-items:start;gap:.5rem}.header-article__inner .header-article-items__end{margin-left:auto}.bd-sidebar-primary{display:flex;flex-direction:column;gap:1rem;max-height:calc(100vh - var(--pst-header-height));position:sticky;top:var(--pst-header-height);flex:0 0 auto;width:25%;padding:2rem 1rem 1rem 1rem;border-right:1px solid var(--pst-color-border);background-color:var(--pst-color-background);overflow-y:auto;font-size:var(--pst-sidebar-font-size-mobile)}@media(min-width: 960px){.bd-sidebar-primary{font-size:var(--pst-sidebar-font-size)}}.bd-sidebar-primary .nav-link{font-size:var(--pst-sidebar-font-size-mobile)}.bd-sidebar-primary.no-sidebar{border-right:0}@media(min-width: 960px){.bd-sidebar-primary.hide-on-wide{display:none}}.bd-sidebar-primary h1,.bd-sidebar-primary h2,.bd-sidebar-primary h3,.bd-sidebar-primary h4{color:var(--pst-color-text-base)}.bd-sidebar-primary .sidebar-primary-items__start .sidebar-primary-item,.bd-sidebar-primary .sidebar-primary-items__end .sidebar-primary-item{padding:.5rem 0}.bd-sidebar-primary .sidebar-header-items{display:flex;flex-direction:column}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__title{font-weight:var(--pst-sidebar-header-font-weight);font-size:var(--pst-sidebar-header-font-size);color:var(--pst-color-text-base);margin-bottom:.5rem}.bd-sidebar-primary .sidebar-header-items .nav-item.dropdown button{display:none}.bd-sidebar-primary .sidebar-header-items .nav-item.dropdown .dropdown-menu{display:flex;flex-direction:column;padding:0;margin:0;border:none;background-color:inherit;font-size:inherit}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__center{display:flex;flex-direction:column}.bd-sidebar-primary .sidebar-header-items .sidebar-header-items__end{display:flex;align-items:center;gap:.5rem}@media(min-width: 960px){.bd-sidebar-primary .sidebar-header-items{display:none}}.bd-sidebar-primary .sidebar-primary-items__start{border-top:1px solid var(--pst-color-border)}@media(min-width: 960px){.bd-sidebar-primary .sidebar-primary-items__start{border-top:none}}.bd-sidebar-primary .sidebar-primary-items__end{margin-top:auto;margin-bottom:1em}.bd-sidebar-primary .list-caption{list-style:none;padding-left:0px}.bd-sidebar-primary li{position:relative}.bd-sidebar-primary li.has-children>.reference{padding-right:30px}.bd-sidebar-primary label.toctree-toggle{position:absolute;top:0;right:0;height:30px;width:30px;cursor:pointer;display:flex;justify-content:center;align-items:center}.bd-sidebar-primary label.toctree-toggle:hover{background:var(--pst-color-surface)}.bd-sidebar-primary label.toctree-toggle i{display:inline-block;font-size:.75rem;text-align:center}.bd-sidebar-primary label.toctree-toggle i:hover{color:var(--pst-color-primary)}.bd-sidebar-primary .label-parts{width:100%;height:100%}.bd-sidebar-primary .label-parts:hover{background:none}.bd-sidebar-primary .label-parts i{width:30px;position:absolute;top:.3em;right:0em}nav.bd-links{margin-right:-1rem}@media(min-width: 960px){nav.bd-links{display:block}}nav.bd-links ul{list-style:none}nav.bd-links ul ul{padding:0 0 0 1rem}nav.bd-links li>a{display:block;padding:.25rem .65rem;color:var(--pst-color-text-muted);text-decoration:none;box-shadow:none}nav.bd-links li>a:hover{text-decoration:underline;background-color:rgba(0,0,0,0);color:var(--pst-color-link-hover);text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}nav.bd-links li>a:active{color:var(--pst-color-link-hover)}nav.bd-links li>a.reference.external:after{font:var(--fa-font-solid);content:var(--pst-icon-external-link);font-size:.75em;margin-left:.3em}nav.bd-links .current>a{font-weight:600;color:var(--pst-color-primary);box-shadow:inset max(3px, .1875rem, .12em) 0px 0px var(--pst-color-primary);background-color:rgba(0,0,0,0)}nav.bd-links p.bd-links__title{font-size:var(--pst-sidebar-header-font-size);font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}nav.bd-links p.caption{font-weight:var(--pst-sidebar-header-font-weight);position:relative;margin-top:1.25rem;margin-bottom:.5rem;color:var(--pst-color-text-base);font-size:var(--pst-sidebar-font-size-mobile)}nav.bd-links p.caption:first-child{margin-top:0}@media(min-width: 960px){nav.bd-links p.caption{font-size:var(--pst-sidebar-font-size)}}.bd-sidebar-secondary{display:flex;order:2;flex-shrink:0;flex-direction:column;position:sticky;top:var(--pst-header-height);max-height:calc(100vh - var(--pst-header-height));padding:2rem 1rem 1rem 1rem;width:var(--pst-sidebar-secondary);font-size:var(--pst-sidebar-font-size-mobile);background-color:var(--pst-color-background);overflow-y:auto}@media(min-width: 1200px){.bd-sidebar-secondary{font-size:var(--pst-sidebar-font-size)}}.sidebar-secondary-item{padding:.5rem .5rem}@media(min-width: 1200px){.sidebar-secondary-item{border-left:1px solid var(--pst-color-border);padding-left:1rem}}.sidebar-secondary-item i{padding-right:.5rem}input.sidebar-toggle{display:none}label.overlay{background-color:#000;opacity:.5;height:0;width:0;position:fixed;top:0;left:0;transition:opacity 200ms ease-out;z-index:1050}input#__primary:checked+label.overlay.overlay-primary,input#__secondary:checked+label.overlay.overlay-secondary{height:100vh;width:100vw}input#__primary:checked~.bd-container .bd-sidebar-primary{visibility:visible;margin-left:0}input#__secondary:checked~.bd-container .bd-sidebar-secondary{visibility:visible;margin-right:0}@media(min-width: 960px){label.sidebar-toggle.primary-toggle{display:none}input#__primary:checked+label.overlay.overlay-primary{height:0;width:0}.bd-sidebar-primary{margin-left:0;visibility:visible}}@media(max-width: 959.98px){.bd-sidebar-primary{position:fixed;top:0;z-index:1055;height:100vh;max-height:100vh;width:75%;flex-grow:.75;max-width:350px;transition:visibility 200ms ease-out,margin 200ms ease-out;visibility:hidden;margin-left:-75%;left:0}}@media(max-width: 1199.98px){.bd-sidebar-secondary{position:fixed;top:0;z-index:1055;height:100vh;max-height:100vh;width:75%;flex-grow:.75;max-width:350px;transition:visibility 200ms ease-out,margin 200ms ease-out;visibility:hidden;margin-right:-75%;right:0}}ul.bd-breadcrumbs{list-style:none;padding-left:0;display:flex;flex-wrap:wrap;font-size:.8rem}ul.bd-breadcrumbs li.breadcrumb-item{display:flex;align-items:baseline;font-weight:bold}ul.bd-breadcrumbs li.breadcrumb-item a{color:var(--pst-color-text-muted);text-decoration:none}ul.bd-breadcrumbs li.breadcrumb-item a:hover{color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}ul.bd-breadcrumbs li.breadcrumb-item a:focus-visible{outline:2px solid var(--pst-color-accent)}ul.bd-breadcrumbs li.breadcrumb-item:not(.breadcrumb-home):before{font:var(--fa-font-solid);font-size:.8rem;content:var(--pst-breadcrumb-divider);color:var(--pst-color-text-muted);padding:0 .5rem}.navbar-icon-links{display:flex;flex-direction:row;column-gap:1rem;flex-wrap:wrap}.navbar-icon-links li.nav-item a.nav-link{padding-left:0;padding-right:0}.navbar-icon-links li.nav-item a.nav-link:hover{color:var(--pst-color-link-hover);box-shadow:0px max(3px, .1875rem, .12em) 0px var(--pst-color-link-hover)}.navbar-icon-links a span{display:flex;align-items:center}.navbar-icon-links i.fa-brands,.navbar-icon-links i.fa-regular,.navbar-icon-links i.fa-solid{vertical-align:middle;font-style:normal;font-size:var(--pst-font-size-icon)}.navbar-icon-links i.fa-square-twitter:before{color:#55acee}.navbar-icon-links i.fa-square-gitlab:before{color:#548}.navbar-icon-links i.fa-bitbucket:before{color:#0052cc}.navbar-icon-links img.icon-link-image{height:1.5em;border-radius:.2rem}.navbar-brand{position:relative;height:var(--pst-header-height);max-height:var(--pst-header-height);padding:.5rem 0;width:auto;margin:0;display:flex;flex-shrink:0;align-items:center;gap:.5rem}.navbar-brand p{margin-bottom:0}.navbar-brand img{max-width:100%;height:100%;width:auto}.navbar-brand a{text-decoration:none}.navbar-brand:hover:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.navbar-brand:visited:hover:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.navbar-nav ul{display:block;list-style:none}.navbar-nav ul ul{padding:0 0 0 1rem}.navbar-nav li{display:flex;flex-direction:column}.navbar-nav li a{display:flex;align-items:center;height:100%;padding-top:.25rem;padding-bottom:.25rem;color:var(--pst-color-text-muted);text-decoration:none}.navbar-nav li a:hover{color:var(--pst-color-link-hover);text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}.navbar-nav li a:focus-visible{outline:2px solid var(--pst-color-accent)}.navbar-nav .toctree-checkbox{position:absolute;display:none}.navbar-nav .toctree-checkbox~ul{display:none}.navbar-nav .toctree-checkbox~label i{transform:rotate(0deg)}.navbar-nav .toctree-checkbox:checked~ul{display:block}.navbar-nav .toctree-checkbox:checked~label i{transform:rotate(180deg)}.bd-header .navbar-nav>p.sidebar-header-items__title{display:none}.page-toc .section-nav{padding-left:0;border-bottom:none}.page-toc .section-nav ul{padding-left:1rem}.page-toc .nav-link{font-size:var(--pst-sidebar-font-size-mobile)}@media(min-width: 1200px){.page-toc .nav-link{font-size:var(--pst-sidebar-font-size)}}.page-toc .onthispage{color:var(--pst-color-text-base);font-weight:var(--pst-sidebar-header-font-weight);margin-bottom:.5rem}.prev-next-area{width:100%}.prev-next-area p{margin:0 .3em;line-height:1.3em}.prev-next-area i{font-size:1.2em}.prev-next-area a{display:flex;align-items:center;border:none;padding:10px;max-width:45%;overflow-x:hidden;color:var(--pst-color-text-muted);text-decoration:none}.prev-next-area a p.prev-next-title{word-wrap:break-word;color:var(--pst-color-link);text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;font-weight:var(--pst-admonition-font-weight-heading);font-size:1.1em}.prev-next-area a p.prev-next-title:hover{color:var(--pst-color-link-hover);text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}.prev-next-area a p.prev-next-title:active{color:var(--pst-color-link)}.prev-next-area a p.prev-next-title:visited{color:var(--pst-color-link)}.prev-next-area a p.prev-next-title:visited:hover{color:var(--pst-color-link-hover)}.prev-next-area a p.prev-next-title:focus-visible{outline:2px solid var(--pst-color-accent)}.prev-next-area a:hover p.prev-next-title:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.prev-next-area a:visited p.prev-next-title{color:var(--pst-color-link)}.prev-next-area a:visited p.prev-next-title:hover{color:var(--pst-color-link-hover)}.prev-next-area a .prev-next-info{flex-direction:column;margin:0 .5em}.prev-next-area a .prev-next-info .prev-next-subtitle{text-transform:capitalize}.prev-next-area a.left-prev{float:left}.prev-next-area a.right-next{float:right}.prev-next-area a.right-next div.prev-next-info{text-align:right}.bd-search{position:relative;padding-left:.5rem;gap:.5rem;background-color:var(--pst-color-background);border-radius:.25rem;border:1px solid var(--pst-color-border);color:var(--pst-color-text-base)}.bd-search:active{background-color:var(--pst-color-background);color:var(--pst-color-text-muted)}.bd-search .icon{position:absolute;color:var(--pst-color-border);left:25px}.bd-search .fa-solid.fa-magnifying-glass{position:absolute;left:calc((2.5rem - .7em)/2);color:var(--pst-color-text-muted)}.bd-search input::placeholder{color:var(--pst-color-text-muted)}.bd-search input::-webkit-search-cancel-button,.bd-search input::-webkit-search-decoration{-webkit-appearance:none;appearance:none}.bd-search .search-button__kbd-shortcut{display:flex;position:absolute;right:.5rem;color:var(--pst-color-border)}.form-control{background-color:var(--pst-color-background);color:var(--pst-color-text-base)}.form-control:focus,.form-control:focus-visible{border:none;box-shadow:none;outline:3px solid var(--pst-color-accent);background-color:var(--pst-color-background);color:var(--pst-color-text-muted)}.search-button{display:flex;align-items:center;align-content:center;color:var(--pst-color-text-muted);padding:0 0 .25rem 0;border-radius:0}.search-button:hover{color:var(--pst-color-link-hover);box-shadow:0px max(3px, .1875rem, .12em) 0px var(--pst-color-link-hover)}.search-button:focus-visible{outline:2px solid var(--pst-color-accent)}.search-button i{font-size:1.3rem}.search-button__search-container,.search-button__overlay{display:none}.search-button__wrapper.show .search-button__search-container{display:flex;position:fixed;z-index:1055;top:30%;left:50%;transform:translate(-50%, -50%);right:1rem;margin-top:.5rem;width:90%;max-width:800px}.search-button__wrapper.show .search-button__overlay{display:flex;position:fixed;z-index:1050;background-color:#000;opacity:.5;width:100%;height:100%;top:0px;left:0px}.search-button__wrapper.show form.bd-search{flex-grow:1;padding-top:0;padding-bottom:0}.search-button__wrapper.show svg,.search-button__wrapper.show input{font-size:var(--pst-font-size-icon)}.search-button-field{display:inline-flex;align-items:center;border:var(--pst-color-border) solid 1px;border-radius:1.5em;color:var(--pst-color-text-muted);padding:.5em;background-color:var(--pst-color-surface)}.search-button-field:hover{border:2px solid var(--pst-color-link-hover)}.search-button-field:focus-visible{border:2px solid var(--pst-color-accent)}.search-button-field .search-button__default-text{font-size:var(--bs-nav-link-font-size);font-weight:var(--bs-nav-link-font-weight);margin-right:.5em;margin-left:.5em}.search-button-field .kbd-shortcut__modifier{font-size:.75em}.search-button-field>*{align-items:center}.search-button-field>:not(svg){display:none}@media(min-width: 960px){.search-button-field>:not(svg){display:flex}}div#searchbox p.highlight-link{margin:1rem 0;width:fit-content;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important}@media(min-width: 1200px){div#searchbox p.highlight-link{margin-left:2rem}}div#searchbox p.highlight-link a{border-radius:.25rem;font-size:1.25rem;padding:.75rem;background-color:var(--pst-color-primary);color:var(--pst-color-primary-text);text-decoration:none;transition:box-shadow .25s ease-out}div#searchbox p.highlight-link a:hover{box-shadow:inset 0px 0px 50px 50px rgba(0,0,0,.25)}div#searchbox p.highlight-link a:before{content:var(--pst-icon-search-minus);color:unset;font:var(--fa-font-solid);margin-right:.5rem}.theme-switch-button{margin:0 -0.5rem;padding:0;color:var(--pst-color-text-muted);border-radius:0}.theme-switch-button:focus-visible{outline:2px solid var(--pst-color-accent)}.theme-switch-button span{display:none;padding:.5em}.theme-switch-button span:hover{color:var(--pst-color-link-hover);box-shadow:0px max(3px, .1875rem, .12em) 0px var(--pst-color-link-hover)}.theme-switch-button span:active{text-decoration:none;color:var(--pst-color-link-hover)}html[data-mode=auto] .theme-switch-button span[data-mode=auto]{display:flex}html[data-mode=light] .theme-switch-button span[data-mode=light]{display:flex}html[data-mode=dark] .theme-switch-button span[data-mode=dark]{display:flex}button.btn.version-switcher__button{border-color:var(--pst-color-border);color:var(--pst-color-text-base);margin-bottom:1em}@media(min-width: 960px){button.btn.version-switcher__button{margin-bottom:unset}}button.btn.version-switcher__button:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}button.btn.version-switcher__button:focus-visible{outline:2px solid var(--pst-color-accent)}button.btn.version-switcher__button:active{color:var(--pst-color-text-base);border-color:var(--pst-color-border)}.version-switcher__menu{border-color:var(--pst-color-border);border-radius:var(--bs-dropdown-border-radius)}.version-switcher__menu a.list-group-item{background-color:var(--pst-color-on-background);color:var(--pst-color-text-base);padding:.75rem 1.25rem}.version-switcher__menu a.list-group-item:not(:last-child){border-bottom:1px solid var(--pst-color-border)}.version-switcher__menu a.list-group-item:hover{text-decoration:underline;text-decoration-thickness:max(1px, .0625rem);text-underline-offset:.1578em;text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none;color:var(--pst-color-link-hover)}.version-switcher__menu a.list-group-item:hover{background-color:var(--pst-color-surface)}.version-switcher__menu a.list-group-item.active{font-weight:600;color:var(--pst-color-primary);box-shadow:inset max(3px, .1875rem, .12em) 0px 0px var(--pst-color-primary);position:relative;z-index:1}.version-switcher__menu a.list-group-item.active span:before{content:\"\";width:100%;height:100%;position:absolute;z-index:-1;left:0;top:0}button.version-switcher__button,.version-switcher__menu{font-size:1.1em;z-index:1055}@media(min-width: 960px){button.version-switcher__button,.version-switcher__menu{font-size:unset}}nav.page-toc{margin-bottom:1rem}.bd-toc .nav .nav,.list-caption .nav{display:none}.bd-toc .nav .nav.visible,.list-caption .nav.visible{display:block}.bd-toc .nav>.active>ul,.list-caption>.active>ul{display:block}.toc-entry{display:block}.toc-entry a>code{color:var(--pst-color-text-muted)}.toc-entry a.nav-link{display:block;padding:.125rem 0;padding-left:1rem;margin-left:-1rem;color:var(--pst-color-text-muted);text-decoration:none}.toc-entry a.nav-link:hover{text-decoration:underline;background-color:rgba(0,0,0,0);color:var(--pst-color-link-hover);text-decoration-thickness:max(3px, .1875rem, .12em);text-decoration-skip-ink:none;text-decoration-skip:none}.toc-entry a.nav-link:active{color:var(--pst-color-link-hover)}.toc-entry a.nav-link.active{font-weight:600;color:var(--pst-color-primary);box-shadow:inset max(3px, .1875rem, .12em) 0px 0px var(--pst-color-primary);background-color:rgba(0,0,0,0)}.toc-entry a.nav-link.active:hover{color:var(--pst-color-link-hover)}div.versionadded,div.versionchanged,div.deprecated{vertical-align:middle;margin:1.5625em auto;padding:0 .6rem 0 .6rem;overflow:hidden;page-break-inside:avoid;border-left:.2rem solid;border-color:var(--pst-color-info);border-radius:.25rem;background-color:var(--pst-color-on-background);box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important;position:relative}div.versionadded>p,div.versionchanged>p,div.deprecated>p{margin-bottom:.6rem;margin-top:.6rem}div.versionadded{border-color:var(--pst-color-success);background-color:var(--pst-color-success-bg)}div.versionchanged{border-color:var(--pst-color-warning);background-color:var(--pst-color-warning-bg)}div.deprecated{border-color:var(--pst-color-danger);background-color:var(--pst-color-danger-bg)}span.versionmodified{font-weight:600}span.versionmodified:before{margin-right:.6rem;color:var(--pst-color-info);font:var(--fa-font-solid);content:var(--pst-icon-versionmodified-default)}span.versionmodified.added:before{color:var(--pst-color-success);content:var(--pst-icon-versionmodified-added)}span.versionmodified.changed:before{color:var(--pst-color-warning);content:var(--pst-icon-versionmodified-changed)}span.versionmodified.deprecated:before{color:var(--pst-color-danger);content:var(--pst-icon-versionmodified-deprecated)}.sidebar-indices-items{display:flex;flex-direction:column;border-top:1px solid var(--pst-color-border)}@media(min-width: 960px){.sidebar-indices-items{border-top:none}}.sidebar-indices-items .sidebar-indices-items__title{font-weight:var(--pst-sidebar-header-font-weight);font-size:var(--pst-sidebar-header-font-size);color:var(--pst-color-text-base);margin-bottom:.5rem}.sidebar-indices-items ul.indices-link{margin-right:-1rem;list-style:none;padding:0}.sidebar-indices-items ul.indices-link li>a{display:block;padding:.25rem 0;color:var(--pst-color-text-muted)}.sidebar-indices-items ul.indices-link li>a:hover{color:var(--pst-color-primary);text-decoration:none;background-color:rgba(0,0,0,0)}.bd-sidebar-primary div#rtd-footer-container{position:sticky;bottom:-1rem;margin:-1rem}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge{position:unset;font-size:.9em;font-family:var(--pst-font-family-base);max-width:unset}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .rst-current-version{display:flex;align-items:center;gap:.2rem;height:2.5rem;transition:background-color .2s ease-out;background-color:var(--pst-color-background);color:var(--pst-color-success);border-top:1px solid var(--pst-color-border)}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-book{color:var(--pst-color-text-muted);margin-right:auto}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-book::after{color:var(--pst-color-text-base);content:\"Read The Docs\";font-family:var(--pst-font-family-base);font-weight:var(--pst-admonition-font-weight-heading)}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge .fa.fa-caret-down{color:var(--pst-color-text-muted)}.bd-sidebar-primary div#rtd-footer-container .rst-versions.rst-badge.shift-up .rst-current-version{border-bottom:1px solid var(--pst-color-border)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions{background-color:var(--pst-color-surface);color:var(--pst-color-text-base)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions dl dd a{color:var(--pst-color-text-muted)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions hr{background-color:var(--pst-color-border)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions small a{color:var(--pst-color-link)}.bd-sidebar-primary div#rtd-footer-container .rst-other-versions input{padding-left:.5rem;border:1px solid var(--pst-color-border);background-color:var(--pst-color-surface)}div.admonition,.admonition{margin:1.5625em auto;padding:0 .6rem .8rem .6rem;overflow:hidden;page-break-inside:avoid;border-left:.2rem solid;border-color:var(--pst-color-info);border-radius:.25rem;background-color:var(--pst-color-on-background);box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important}div.admonition *:last-child,.admonition *:last-child{margin-bottom:0}div.admonition p.admonition-title~*,.admonition p.admonition-title~*{margin-left:1.4rem;margin-right:1.4rem}div.admonition>ol,div.admonition>ul,.admonition>ol,.admonition>ul{margin-left:1em}div.admonition>.admonition-title,.admonition>.admonition-title{margin:0 -0.6rem;padding:.4rem .6rem .4rem 2rem;font-weight:var(--pst-admonition-font-weight-heading);position:relative;z-index:1}div.admonition>.admonition-title:before,.admonition>.admonition-title:before{content:\"\";width:100%;height:100%;position:absolute;left:0;top:0;background-color:var(--pst-color-info-bg);z-index:-1;pointer-events:none}div.admonition>.admonition-title:after,.admonition>.admonition-title:after{position:absolute;left:.5rem;width:1rem;height:1rem;color:var(--pst-color-info);font:var(--fa-font-solid);line-height:inherit;content:var(--pst-icon-admonition-default);opacity:1}div.admonition>.admonition-title+*,.admonition>.admonition-title+*{margin-top:.4em}div.admonition.attention,.admonition.attention{border-color:var(--pst-color-attention)}div.admonition.attention>.admonition-title:before,.admonition.attention>.admonition-title:before{background-color:var(--pst-color-attention-bg)}div.admonition.attention>.admonition-title:after,.admonition.attention>.admonition-title:after{color:var(--pst-color-attention);content:var(--pst-icon-admonition-attention)}div.admonition.caution,.admonition.caution{border-color:var(--pst-color-warning)}div.admonition.caution>.admonition-title:before,.admonition.caution>.admonition-title:before{background-color:var(--pst-color-warning-bg)}div.admonition.caution>.admonition-title:after,.admonition.caution>.admonition-title:after{color:var(--pst-color-warning);content:var(--pst-icon-admonition-caution)}div.admonition.warning,.admonition.warning{border-color:var(--pst-color-warning)}div.admonition.warning>.admonition-title:before,.admonition.warning>.admonition-title:before{background-color:var(--pst-color-warning-bg)}div.admonition.warning>.admonition-title:after,.admonition.warning>.admonition-title:after{color:var(--pst-color-warning);content:var(--pst-icon-admonition-warning)}div.admonition.danger,.admonition.danger{border-color:var(--pst-color-danger)}div.admonition.danger>.admonition-title:before,.admonition.danger>.admonition-title:before{background-color:var(--pst-color-danger-bg)}div.admonition.danger>.admonition-title:after,.admonition.danger>.admonition-title:after{color:var(--pst-color-danger);content:var(--pst-icon-admonition-danger)}div.admonition.error,.admonition.error{border-color:var(--pst-color-danger)}div.admonition.error>.admonition-title:before,.admonition.error>.admonition-title:before{background-color:var(--pst-color-danger-bg)}div.admonition.error>.admonition-title:after,.admonition.error>.admonition-title:after{color:var(--pst-color-danger);content:var(--pst-icon-admonition-error)}div.admonition.hint,.admonition.hint{border-color:var(--pst-color-success)}div.admonition.hint>.admonition-title:before,.admonition.hint>.admonition-title:before{background-color:var(--pst-color-success-bg)}div.admonition.hint>.admonition-title:after,.admonition.hint>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-hint)}div.admonition.tip,.admonition.tip{border-color:var(--pst-color-success)}div.admonition.tip>.admonition-title:before,.admonition.tip>.admonition-title:before{background-color:var(--pst-color-success-bg)}div.admonition.tip>.admonition-title:after,.admonition.tip>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-tip)}div.admonition.important,.admonition.important{border-color:var(--pst-color-attention)}div.admonition.important>.admonition-title:before,.admonition.important>.admonition-title:before{background-color:var(--pst-color-attention-bg)}div.admonition.important>.admonition-title:after,.admonition.important>.admonition-title:after{color:var(--pst-color-attention);content:var(--pst-icon-admonition-important)}div.admonition.note,.admonition.note{border-color:var(--pst-color-info)}div.admonition.note>.admonition-title:before,.admonition.note>.admonition-title:before{background-color:var(--pst-color-info-bg)}div.admonition.note>.admonition-title:after,.admonition.note>.admonition-title:after{color:var(--pst-color-info);content:var(--pst-icon-admonition-note)}div.admonition.seealso,.admonition.seealso{border-color:var(--pst-color-success)}div.admonition.seealso>.admonition-title:before,.admonition.seealso>.admonition-title:before{background-color:var(--pst-color-success-bg)}div.admonition.seealso>.admonition-title:after,.admonition.seealso>.admonition-title:after{color:var(--pst-color-success);content:var(--pst-icon-admonition-seealso)}div.admonition.admonition-todo,.admonition.admonition-todo{border-color:var(--pst-color-secondary)}div.admonition.admonition-todo>.admonition-title:before,.admonition.admonition-todo>.admonition-title:before{background-color:var(--pst-color-secondary-bg)}div.admonition.admonition-todo>.admonition-title:after,.admonition.admonition-todo>.admonition-title:after{color:var(--pst-color-secondary);content:var(--pst-icon-admonition-todo)}div.admonition.sidebar,.admonition.sidebar{max-width:40%;float:right;clear:both;margin-left:.5rem;margin-top:0;border-width:0 0 0 .2rem}div.admonition.sidebar.attention,div.admonition.sidebar.important,.admonition.sidebar.attention,.admonition.sidebar.important{border-color:var(--pst-color-attention)}div.admonition.sidebar.caution,div.admonition.sidebar.warning,.admonition.sidebar.caution,.admonition.sidebar.warning{border-color:var(--pst-color-warning)}div.admonition.sidebar.danger,div.admonition.sidebar.error,.admonition.sidebar.danger,.admonition.sidebar.error{border-color:var(--pst-color-danger)}div.admonition.sidebar.hint,div.admonition.sidebar.tip,div.admonition.sidebar.seealso,.admonition.sidebar.hint,.admonition.sidebar.tip,.admonition.sidebar.seealso{border-color:var(--pst-color-success)}div.admonition.sidebar.note,div.admonition.sidebar.todo,.admonition.sidebar.note,.admonition.sidebar.todo{border-color:var(--pst-color-info)}div.admonition.sidebar p.admonition-title~*,.admonition.sidebar p.admonition-title~*{margin-left:0rem;margin-right:0rem}div.topic,div.topic.contents,nav.contents,aside.topic{display:flex;flex-direction:column;background-color:var(--pst-color-surface);border-color:var(--pst-color-border);border-radius:.25rem;padding:1rem 1.25rem;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important}div.topic .topic-title,div.topic.contents .topic-title,nav.contents .topic-title,aside.topic .topic-title{margin:0 0 .5rem 0}div.topic p,div.topic.contents p,nav.contents p,aside.topic p{color:var(--pst-color-on-surface) !important}div.topic ul.simple,div.topic.contents ul.simple,nav.contents ul.simple,aside.topic ul.simple{padding-left:1rem}div.topic ul.simple ul,div.topic.contents ul.simple ul,nav.contents ul.simple ul,aside.topic ul.simple ul{padding-left:2em}aside.sidebar{border:1px solid var(--pst-color-border);background-color:var(--pst-color-surface);border-radius:.25rem;margin-left:.5rem;padding:0}aside.sidebar>*:last-child{padding-bottom:1rem}aside.sidebar p.sidebar-title{position:relative;margin-bottom:0;padding-top:.5rem;padding-bottom:.5rem;border-bottom:1px solid var(--pst-color-border);font-family:var(--pst-font-family-heading);font-weight:var(--pst-admonition-font-weight-heading)}aside.sidebar>*:not(.sidebar-title):first-child,aside.sidebar>p.sidebar-title+*{margin-top:1rem}aside.sidebar>*{padding-left:1rem;padding-right:1rem}p.rubric{display:flex;flex-direction:column}.seealso dd{margin-top:0;margin-bottom:0}table.field-list{border-collapse:separate;border-spacing:10px;margin-left:1px}table.field-list th.field-name{padding:1px 8px 1px 5px;white-space:nowrap;background-color:var(--pst-color-surface)}table.field-list td.field-body p{font-style:italic}table.field-list td.field-body p>strong{font-style:normal}table.field-list td.field-body blockquote{border-left:none;margin:0em 0em .3em;padding-left:30px}.table.autosummary td:first-child{white-space:nowrap}.sig{font-family:var(--pst-font-family-monospace)}.sig-inline.c-texpr,.sig-inline.cpp-texpr{font-family:unset}.sig.c .k,.sig.c .kt,.sig.cpp .k,.sig.cpp .kt{color:var(--pst-color-text-base)}.sig.c .m,.sig.cpp .m{color:var(--pst-color-text-base)}.sig.c .s,.sig.c .sc,.sig.cpp .s,.sig.cpp .sc{color:var(--pst-color-text-base)}.sig-name{color:var(--pst-color-inline-code)}.sig-param .o,.sig-param .default_value{color:var(--pst-color-text-muted);font-weight:normal}dt:target,span.highlighted{background-color:var(--pst-color-target)}.viewcode-back{font-family:var(--pst-font-family-base)}.viewcode-block:target{border-top:1px solid var(--pst-color-border);border-bottom:1px solid var(--pst-color-border);position:relative;background-color:var(--pst-color-target)}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dd{margin-left:2rem}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dd>dl.simple>dt{display:flex}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl.field-list{display:grid;grid-template-columns:unset}dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dt.field-odd,dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dt.field-even{margin-top:.2rem;margin-bottom:.1rem;background-color:var(--pst-color-surface)}div[class*=highlight-],div.highlight,div.literal-block-wrapper{display:flex;flex-direction:column;width:unset;border-radius:.25rem}div.literal-block-wrapper{border:1px solid var(--pst-color-border);border-radius:.25rem}div.literal-block-wrapper div.code-block-caption{margin:0;border-bottom:1px solid var(--pst-color-border);padding:.5rem;font-size:1rem;font-weight:var(--pst-font-weight-caption)}div.literal-block-wrapper div.code-block-caption a.headerlink{font-size:inherit}div.literal-block-wrapper div[class*=highlight-]{margin:0;border-radius:0}div.literal-block-wrapper div[class*=highlight-] pre{border:none;box-shadow:none}code.literal{padding:.1rem .25rem;background-color:var(--pst-color-surface);border:1px solid var(--pst-color-border);border-radius:.25rem}a>code{color:var(--pst-color-inline-code-links)}html[data-theme=light] .highlight .nf{color:#0078a1 !important}span.linenos{opacity:.8 !important}figure a.headerlink{position:absolute;font-size:inherit}figure:hover a.headerlink{visibility:visible}figure figcaption{font-family:var(--pst-font-family-heading);font-weight:var(--pst-font-weight-caption);color:var(--pst-color-text-muted);margin-left:auto;margin-right:auto}figure figcaption table.table{width:fit-content;margin-left:auto;margin-right:auto}dt.label>span.brackets:not(:only-child):before{content:\"[\"}dt.label>span.brackets:not(:only-child):after{content:\"]\"}a.footnote-reference{vertical-align:super;font-size:small}aside.footnote{margin-bottom:.5rem}aside.footnote:last-child{margin-bottom:1rem}aside.footnote span.label,aside.footnote span.backrefs{font-weight:bold}aside.footnote:target{background-color:var(--pst-color-target)}table.highlighttable td.linenos,span.linenos,div.doctest>div.highlight span.gp{user-select:none;-webkit-user-select:text;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none}dd{margin-top:3px;margin-bottom:10px;margin-left:30px}ol,ul{padding-inline-start:2rem}ol li>p:first-child,ul li>p:first-child{margin-bottom:.25rem;margin-top:.25rem}blockquote{padding:1em 1em;color:var(--pst-color-text-muted);border-left:.25em solid var(--pst-color-border);border-radius:.25rem;position:relative}blockquote p{color:var(--pst-color-text-base)}blockquote .line-block{margin:0 0}blockquote p:last-child{margin-bottom:0}blockquote:before{content:\"\";width:100%;height:100%;position:absolute;left:0;top:0;background-color:var(--pst-color-on-background);z-index:-1;pointer-events:none}blockquote:before{z-index:-1}span.guilabel{border:1px solid var(--pst-color-info);color:var(--pst-color-info);font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px;position:relative}span.guilabel:before{content:\"\";width:100%;height:100%;position:absolute;left:0;top:0;background-color:var(--pst-color-info-bg);z-index:-1;pointer-events:none}a.reference.download:before{content:var(--pst-icon-download);font:var(--fa-font-solid);font-size:.8em;padding:0 .25em;color:var(--pst-color-text-muted)}table{display:table;overflow:auto;margin-left:auto;margin-right:auto}table.table-right{margin-right:0}table.table-left{margin-left:0}table caption{text-align:center;caption-side:top;color:var(--pst-color-text-muted)}th.text-align\\:left,td.text-align\\:left{text-align:left}th.text-align\\:right,td.text-align\\:right{text-align:right}th.text-align\\:center,td.text-align\\:center{text-align:center}.table{--bs-table-bg: transparent}.toctree-wrapper p.caption{font-size:1.5em;margin-bottom:0em}.toctree-wrapper>ul{padding-left:0}.toctree-wrapper li[class^=toctree-l]{list-style:none;margin-bottom:.2em}.toctree-wrapper li[class^=toctree-l]>a{list-style:none;font-size:1.1em}.toctree-wrapper li[class^=toctree-l]>ul{list-style:none;padding-inline-start:1.5em}.toctree-wrapper .toctree-l1>a{font-size:1.3em}div.topic.contents ul.simple,nav.contents ul.simple{list-style:none;padding-left:0}span.math,div.math{align-items:center;display:flex;max-width:100%;overflow:hidden}span.math{display:inline-flex}div.math{gap:.5em;flex-direction:row-reverse}div.math span.eqno a.headerlink{position:relative;font-size:1em}div.math mjx-container{flex-grow:1;padding-bottom:.2rem;overflow:auto}div.math mjx-container mjx-assistive-mml{height:0}.ablog-sidebar-item h2,.ablog-sidebar-item h3{font-size:var(--pst-sidebar-header-font-size);margin-top:.5rem}.ablog-sidebar-item h2 a,.ablog-sidebar-item h3 a{color:var(--pst-color-text-base)}.ablog-sidebar-item ul{list-style:none;padding-left:0;overflow-y:hidden;display:flex;flex-direction:column;gap:.5em;margin-bottom:0}.ablog-sidebar-item ul.ablog-cloud{flex-direction:row;flex-flow:wrap;gap:.5rem}.ablog-sidebar-item ul.ablog-cloud li{display:flex;align-items:center}.ablog__prev-next{font-size:1.2em;display:flex;padding:1rem 0}.ablog__prev-next>span{display:flex;max-width:45%}.ablog__prev-next>span a{display:flex;align-items:center;margin-left:auto;gap:1rem;line-height:1.5rem}.ablog__prev-next>span a i:before{color:var(--pst-color-text-base)}.ablog__prev-next span.ablog__prev i.fa-arrow-circle-left:before{content:var(--pst-icon-angle-left)}.ablog__prev-next span.ablog__spacer{display:none}.ablog__prev-next span.ablog__next{margin-left:auto;text-align:right}.ablog__prev-next span.ablog__next i.fa-arrow-circle-right:before{content:var(--pst-icon-angle-right)}.ablog__collection,.postlist{padding-left:0}.ablog__collection .ablog-post,.postlist .ablog-post{list-style:none}.ablog__collection .ablog-post .ablog-archive,.postlist .ablog-post .ablog-archive{display:flex;flex-direction:row;flex-wrap:wrap;gap:1rem;list-style:none;font-size:.75rem;padding-left:0}.ablog__collection .ablog-post .ablog-post-title,.postlist .ablog-post .ablog-post-title{margin-top:0;font-size:1.25rem}.ablog__collection .ablog-post .ablog-post-title a,.postlist .ablog-post .ablog-post-title a{font-weight:bold}.ablog__collection .ablog-post .ablog-post-expand,.postlist .ablog-post .ablog-post-expand{margin-bottom:.5rem}.docutils.container{padding-left:unset;padding-right:unset;margin-left:unset;margin-right:unset;max-width:unset;width:unset}div.highlight button.copybtn{display:flex;align-items:center;justify-content:center;background-color:unset;border:none;background-color:var(--pst-color-surface)}div.highlight button.copybtn:not(.success){color:var(--pst-color-muted)}div.highlight button.copybtn:hover:not(.success){color:var(--pst-color-text);background-color:var(--pst-color-shadow)}div.highlight button.copybtn.o-tooltip--left:after{color:var(--pst-color-text);background-color:var(--pst-color-surface)}#ethical-ad-placement .ethical-sidebar a,#ethical-ad-placement .ethical-sidebar a:visited,#ethical-ad-placement .ethical-sidebar a:hover,#ethical-ad-placement .ethical-sidebar a:active,#ethical-ad-placement .ethical-footer a,#ethical-ad-placement .ethical-footer a:visited,#ethical-ad-placement .ethical-footer a:hover,#ethical-ad-placement .ethical-footer a:active{color:var(--pst-color-text-base)}#ethical-ad-placement .ethical-sidebar,#ethical-ad-placement .ethical-footer{background-color:var(--pst-color-background);border:1px solid var(--pst-color-border);border-radius:5px;color:var(--pst-color-text-base);font-size:14px;line-height:20px}.bd-content div.jupyter_container{border:none;background-color:unset;box-shadow:none}.bd-content div.jupyter_container div.output,.bd-content div.jupyter_container div.highlight{border-radius:.25rem}.bd-content div.jupyter_container div.highlight{background-color:var(--pst-color-surface)}.bd-content div.jupyter_container .cell_input,.bd-content div.jupyter_container .cell_output{border-radius:.25rem}.bd-content div.jupyter_container .cell_input pre,.bd-content div.jupyter_container .cell_output pre{padding:1rem}.xr-wrap[hidden]{display:block !important}:root{--pst-teal-50: #f4fbfc;--pst-teal-100: #e9f6f8;--pst-teal-200: #d0ecf1;--pst-teal-300: #abdde6;--pst-teal-400: #3fb1c5;--pst-teal-500: #0a7d91;--pst-teal-600: #085d6c;--pst-teal-700: #064752;--pst-teal-800: #042c33;--pst-teal-900: #021b1f;--pst-violet-50: #f4eefb;--pst-violet-100: #e0c7ff;--pst-violet-200: #d5b4fd;--pst-violet-300: #b780ff;--pst-violet-400: #9c5ffd;--pst-violet-500: #8045e5;--pst-violet-600: #6432bd;--pst-violet-700: #4b258f;--pst-violet-800: #341a61;--pst-violet-900: #1e0e39;--pst-gray-50: #f9f9fa;--pst-gray-100: #f3f4f5;--pst-gray-200: #e5e7ea;--pst-gray-300: #d1d5da;--pst-gray-400: #9ca4af;--pst-gray-500: #677384;--pst-gray-600: #48566b;--pst-gray-700: #29313d;--pst-gray-800: #222832;--pst-gray-900: #14181e;--pst-pink-50: #fcf8fd;--pst-pink-100: #fcf0fa;--pst-pink-200: #f8dff5;--pst-pink-300: #f3c7ee;--pst-pink-400: #e47fd7;--pst-pink-500: #c132af;--pst-pink-600: #912583;--pst-pink-700: #6e1c64;--pst-pink-800: #46123f;--pst-pink-900: #2b0b27;--pst-foundation-white: #ffffff;--pst-foundation-black: #14181e}html:not([data-theme]){--pst-color-primary: #0a7d91;--pst-color-primary-bg: #d0ecf1;--pst-color-secondary: #8045e5;--pst-color-secondary-bg: #e0c7ff;--pst-color-accent: #c132af;--pst-color-accent-bg: #f8dff5;--pst-color-info: #276be9;--pst-color-info-bg: #dce7fc;--pst-color-warning: #f66a0a;--pst-color-warning-bg: #f8e3d0;--pst-color-success: #00843f;--pst-color-success-bg: #d6ece1;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #d72d47;--pst-color-danger-bg: #f9e1e4;--pst-color-text-base: #222832;--pst-color-text-muted: #48566b;--pst-color-heading-color: #ffffff;--pst-color-shadow: rgba(0, 0, 0, 0.1);--pst-color-border: #d1d5da;--pst-color-border-muted: rgba(23, 23, 26, 0.2);--pst-color-inline-code: #912583;--pst-color-inline-code-links: #085d6c;--pst-color-target: #f3cf95;--pst-color-background: #ffffff;--pst-color-on-background: #ffffff;--pst-color-surface: #f3f4f5;--pst-color-on-surface: #222832}html:not([data-theme]){--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html:not([data-theme]) .only-dark,html:not([data-theme]) .only-dark~figcaption{display:none !important}html[data-theme=light]{--pst-color-primary: #0a7d91;--pst-color-primary-bg: #d0ecf1;--pst-color-secondary: #8045e5;--pst-color-secondary-bg: #e0c7ff;--pst-color-accent: #c132af;--pst-color-accent-bg: #f8dff5;--pst-color-info: #276be9;--pst-color-info-bg: #dce7fc;--pst-color-warning: #f66a0a;--pst-color-warning-bg: #f8e3d0;--pst-color-success: #00843f;--pst-color-success-bg: #d6ece1;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #d72d47;--pst-color-danger-bg: #f9e1e4;--pst-color-text-base: #222832;--pst-color-text-muted: #48566b;--pst-color-heading-color: #ffffff;--pst-color-shadow: rgba(0, 0, 0, 0.1);--pst-color-border: #d1d5da;--pst-color-border-muted: rgba(23, 23, 26, 0.2);--pst-color-inline-code: #912583;--pst-color-inline-code-links: #085d6c;--pst-color-target: #f3cf95;--pst-color-background: #ffffff;--pst-color-on-background: #ffffff;--pst-color-surface: #f3f4f5;--pst-color-on-surface: #222832;color-scheme:light}html[data-theme=light]{--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html[data-theme=light] .only-dark,html[data-theme=light] .only-dark~figcaption{display:none !important}html[data-theme=dark]{--pst-color-primary: #3fb1c5;--pst-color-primary-bg: #042c33;--pst-color-secondary: #9c5ffd;--pst-color-secondary-bg: #341a61;--pst-color-accent: #e47fd7;--pst-color-accent-bg: #46123f;--pst-color-info: #79a3f2;--pst-color-info-bg: #06245d;--pst-color-warning: #ff9245;--pst-color-warning-bg: #652a02;--pst-color-success: #5fb488;--pst-color-success-bg: #002f17;--pst-color-attention: var(--pst-color-warning);--pst-color-attention-bg: var(--pst-color-warning-bg);--pst-color-danger: #e78894;--pst-color-danger-bg: #4e111b;--pst-color-text-base: #ced6dd;--pst-color-text-muted: #9ca4af;--pst-color-heading-color: #14181e;--pst-color-shadow: rgba(0, 0, 0, 0.2);--pst-color-border: #48566b;--pst-color-border-muted: #29313d;--pst-color-inline-code: #f3c7ee;--pst-color-inline-code-links: #3fb1c5;--pst-color-target: #675c04;--pst-color-background: #14181e;--pst-color-on-background: #222832;--pst-color-surface: #29313d;--pst-color-on-surface: #f3f4f5;color-scheme:dark}html[data-theme=dark]{--pst-color-link: var(--pst-color-primary);--pst-color-link-hover: var(--pst-color-secondary)}html[data-theme=dark] .only-light,html[data-theme=dark] .only-light~figcaption{display:none !important}html[data-theme=dark] img:not(.only-dark):not(.dark-light){filter:brightness(0.8) contrast(1.2)}html[data-theme=dark] .bd-content img:not(.only-dark):not(.dark-light){background:#fff;border-radius:.25rem}html[data-theme=dark] .MathJax_SVG *{fill:var(--pst-color-text-base)}.pst-color-primary{color:var(--pst-color-primary)}.pst-color-secondary{color:var(--pst-color-secondary)}.pst-color-accent{color:var(--pst-color-accent)}.pst-color-info{color:var(--pst-color-info)}.pst-color-warning{color:var(--pst-color-warning)}.pst-color-success{color:var(--pst-color-success)}.pst-color-attention{color:var(--pst-color-attention)}.pst-color-danger{color:var(--pst-color-danger)}.pst-color-text-base{color:var(--pst-color-text-base)}.pst-color-text-muted{color:var(--pst-color-text-muted)}.pst-color-heading-color{color:var(--pst-color-heading-color)}.pst-color-shadow{color:var(--pst-color-shadow)}.pst-color-border{color:var(--pst-color-border)}.pst-color-border-muted{color:var(--pst-color-border-muted)}.pst-color-inline-code{color:var(--pst-color-inline-code)}.pst-color-inline-code-links{color:var(--pst-color-inline-code-links)}.pst-color-target{color:var(--pst-color-target)}.pst-color-background{color:var(--pst-color-background)}.pst-color-on-background{color:var(--pst-color-on-background)}.pst-color-surface{color:var(--pst-color-surface)}.pst-color-on-surface{color:var(--pst-color-on-surface)}html[data-theme=light]{--pst-color-primary: rgb(10, 125, 145);--pst-color-primary-text: #ffffff;--pst-color-primary-highlight: #053f49;--sd-color-primary: var(--pst-color-primary);--sd-color-primary-text: var(--pst-color-primary-text);--sd-color-primary-highlight: var(--pst-color-primary-highlight);--sd-color-primary-bg: #d0ecf1;--sd-color-primary-bg-text: #14181e;--pst-color-secondary: rgb(128, 69, 229);--pst-color-secondary-text: #ffffff;--pst-color-secondary-highlight: #591bc2;--sd-color-secondary: var(--pst-color-secondary);--sd-color-secondary-text: var(--pst-color-secondary-text);--sd-color-secondary-highlight: var(--pst-color-secondary-highlight);--sd-color-secondary-bg: #e0c7ff;--sd-color-secondary-bg-text: #14181e;--pst-color-success: #00843f;--pst-color-success-text: #ffffff;--pst-color-success-highlight: #00381a;--sd-color-success: var(--pst-color-success);--sd-color-success-text: var(--pst-color-success-text);--sd-color-success-highlight: var(--pst-color-success-highlight);--sd-color-success-bg: #d6ece1;--sd-color-success-bg-text: #14181e;--pst-color-info: #276be9;--pst-color-info-text: #ffffff;--pst-color-info-highlight: #124ab1;--sd-color-info: var(--pst-color-info);--sd-color-info-text: var(--pst-color-info-text);--sd-color-info-highlight: var(--pst-color-info-highlight);--sd-color-info-bg: #dce7fc;--sd-color-info-bg-text: #14181e;--pst-color-warning: #f66a0a;--pst-color-warning-text: #14181e;--pst-color-warning-highlight: #ad4a06;--sd-color-warning: var(--pst-color-warning);--sd-color-warning-text: var(--pst-color-warning-text);--sd-color-warning-highlight: var(--pst-color-warning-highlight);--sd-color-warning-bg: #f8e3d0;--sd-color-warning-bg-text: #14181e;--pst-color-danger: #d72d47;--pst-color-danger-text: #ffffff;--pst-color-danger-highlight: #9a1d30;--sd-color-danger: var(--pst-color-danger);--sd-color-danger-text: var(--pst-color-danger-text);--sd-color-danger-highlight: var(--pst-color-danger-highlight);--sd-color-danger-bg: #f9e1e4;--sd-color-danger-bg-text: #14181e;--pst-color-light: #f3f4f5;--pst-color-light-text: #14181e;--pst-color-light-highlight: #c9ced2;--sd-color-light: var(--pst-color-light);--sd-color-light-text: var(--pst-color-light-text);--sd-color-light-highlight: var(--pst-color-light-highlight);--sd-color-light-bg: #f7f7f8;--sd-color-light-bg-text: #14181e;--pst-color-muted: #29313d;--pst-color-muted-text: #ffffff;--pst-color-muted-highlight: #0a0c0f;--sd-color-muted: var(--pst-color-muted);--sd-color-muted-text: var(--pst-color-muted-text);--sd-color-muted-highlight: var(--pst-color-muted-highlight);--sd-color-muted-bg: #5a6c86;--sd-color-muted-bg-text: #ffffff;--pst-color-dark: #222832;--pst-color-dark-text: #ffffff;--pst-color-dark-highlight: #030404;--sd-color-dark: var(--pst-color-dark);--sd-color-dark-text: var(--pst-color-dark-text);--sd-color-dark-highlight: var(--pst-color-dark-highlight);--pst-color-black: #14181e;--pst-color-black-text: #ffffff;--pst-color-black-highlight: black;--sd-color-black: var(--pst-color-black);--sd-color-black-text: var(--pst-color-black-text);--sd-color-black-highlight: var(--pst-color-black-highlight);--pst-color-white: #ffffff;--pst-color-white-text: #14181e;--pst-color-white-highlight: #d9d9d9;--sd-color-white: var(--pst-color-white);--sd-color-white-text: var(--pst-color-white-text);--sd-color-white-highlight: var(--pst-color-white-highlight)}html[data-theme=dark]{--pst-color-primary: rgb(63, 177, 197);--pst-color-primary-text: #14181e;--pst-color-primary-highlight: #2b7e8d;--sd-color-primary: var(--pst-color-primary);--sd-color-primary-text: var(--pst-color-primary-text);--sd-color-primary-highlight: var(--pst-color-primary-highlight);--sd-color-primary-bg: #042c33;--sd-color-primary-bg-text: #ffffff;--pst-color-secondary: rgb(156, 95, 253);--pst-color-secondary-text: #14181e;--pst-color-secondary-highlight: #6d13fc;--sd-color-secondary: var(--pst-color-secondary);--sd-color-secondary-text: var(--pst-color-secondary-text);--sd-color-secondary-highlight: var(--pst-color-secondary-highlight);--sd-color-secondary-bg: #341a61;--sd-color-secondary-bg-text: #ffffff;--pst-color-success: #5fb488;--pst-color-success-text: #14181e;--pst-color-success-highlight: #3f8762;--sd-color-success: var(--pst-color-success);--sd-color-success-text: var(--pst-color-success-text);--sd-color-success-highlight: var(--pst-color-success-highlight);--sd-color-success-bg: #002f17;--sd-color-success-bg-text: #ffffff;--pst-color-info: #79a3f2;--pst-color-info-text: #14181e;--pst-color-info-highlight: #3373eb;--sd-color-info: var(--pst-color-info);--sd-color-info-text: var(--pst-color-info-text);--sd-color-info-highlight: var(--pst-color-info-highlight);--sd-color-info-bg: #06245d;--sd-color-info-bg-text: #ffffff;--pst-color-warning: #ff9245;--pst-color-warning-text: #14181e;--pst-color-warning-highlight: #f86600;--sd-color-warning: var(--pst-color-warning);--sd-color-warning-text: var(--pst-color-warning-text);--sd-color-warning-highlight: var(--pst-color-warning-highlight);--sd-color-warning-bg: #652a02;--sd-color-warning-bg-text: #ffffff;--pst-color-danger: #e78894;--pst-color-danger-text: #14181e;--pst-color-danger-highlight: #da485b;--sd-color-danger: var(--pst-color-danger);--sd-color-danger-text: var(--pst-color-danger-text);--sd-color-danger-highlight: var(--pst-color-danger-highlight);--sd-color-danger-bg: #4e111b;--sd-color-danger-bg-text: #ffffff;--pst-color-light: #f3f4f5;--pst-color-light-text: #14181e;--pst-color-light-highlight: #c9ced2;--sd-color-light: var(--pst-color-light);--sd-color-light-text: var(--pst-color-light-text);--sd-color-light-highlight: var(--pst-color-light-highlight);--sd-color-light-bg: #a3abb2;--sd-color-light-bg-text: #14181e;--pst-color-muted: #f3f4f5;--pst-color-muted-text: #14181e;--pst-color-muted-highlight: #c9ced2;--sd-color-muted: var(--pst-color-muted);--sd-color-muted-text: var(--pst-color-muted-text);--sd-color-muted-highlight: var(--pst-color-muted-highlight);--sd-color-muted-bg: #1d222b;--sd-color-muted-bg-text: #ffffff;--pst-color-dark: #222832;--pst-color-dark-text: #ffffff;--pst-color-dark-highlight: #030404;--sd-color-dark: var(--pst-color-dark);--sd-color-dark-text: var(--pst-color-dark-text);--sd-color-dark-highlight: var(--pst-color-dark-highlight);--pst-color-black: #14181e;--pst-color-black-text: #ffffff;--pst-color-black-highlight: black;--sd-color-black: var(--pst-color-black);--sd-color-black-text: var(--pst-color-black-text);--sd-color-black-highlight: var(--pst-color-black-highlight);--pst-color-white: #ffffff;--pst-color-white-text: #14181e;--pst-color-white-highlight: #d9d9d9;--sd-color-white: var(--pst-color-white);--sd-color-white-text: var(--pst-color-white-text);--sd-color-white-highlight: var(--pst-color-white-highlight)}html[data-theme=light]{--sd-color-card-border: var(--pst-color-border)}html[data-theme=dark]{--sd-color-card-border: var(--pst-color-border)}html[data-theme=light] .sd-shadow-xs,html[data-theme=light] .sd-shadow-sm,html[data-theme=light] .sd-shadow-md,html[data-theme=light] .sd-shadow-lg{box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important}.bd-content .sd-card{border:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-header{background-color:var(--pst-color-panel-background);border-bottom:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-footer{background-color:var(--pst-color-panel-background);border-top:1px solid var(--pst-color-border)}.bd-content .sd-card .sd-card-body{background-color:var(--pst-color-panel-background)}.bd-content .sd-tab-set>input:checked+label{border-color:rgba(0,0,0,0) rgba(0,0,0,0) var(--pst-color-primary);color:var(--pst-color-primary)}.bd-content .sd-tab-set>input:not(:checked)+label:hover{border-color:var(--pst-color-secondary);color:var(--pst-color-secondary)}.bd-content .sd-tab-set>label{color:var(--pst-color-text-muted);border-top:.125rem solid rgba(0,0,0,0);padding-top:.5em}html .bd-content .sd-tab-set>label:hover{color:var(--pst-color-secondary);border-color:var(--pst-color-secondary)}details.sd-dropdown{border:0px !important;box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow) !important}details.sd-dropdown summary.sd-card-header{border:0 !important}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{border:0}details.sd-dropdown summary.sd-card-header{display:flex;align-items:center;position:relative;font-weight:600;padding-top:.5rem;padding-bottom:.5rem;--pst-sd-dropdown-color: var(--pst-gray-500);--pst-sd-dropdown-bg-color: var(--pst-color-surface);background-color:unset !important;border-left:.2rem solid var(--pst-sd-dropdown-color) !important}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-card-border)}details.sd-dropdown summary.sd-card-header.sd-bg-primary{--pst-sd-dropdown-color: var(--sd-color-primary);--pst-sd-dropdown-bg-color: var(--sd-color-primary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-primary+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-primary);--pst-sd-dropdown-bg-color: var(--sd-color-primary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-primary{color:var(--sd-color-primary-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-secondary{--pst-sd-dropdown-color: var(--sd-color-secondary);--pst-sd-dropdown-bg-color: var(--sd-color-secondary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-secondary+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-secondary);--pst-sd-dropdown-bg-color: var(--sd-color-secondary-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-secondary{color:var(--sd-color-secondary-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-success{--pst-sd-dropdown-color: var(--sd-color-success);--pst-sd-dropdown-bg-color: var(--sd-color-success-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-success+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-success);--pst-sd-dropdown-bg-color: var(--sd-color-success-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-success{color:var(--sd-color-success-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-info{--pst-sd-dropdown-color: var(--sd-color-info);--pst-sd-dropdown-bg-color: var(--sd-color-info-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-info+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-info);--pst-sd-dropdown-bg-color: var(--sd-color-info-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-info{color:var(--sd-color-info-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-warning{--pst-sd-dropdown-color: var(--sd-color-warning);--pst-sd-dropdown-bg-color: var(--sd-color-warning-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-warning+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-warning);--pst-sd-dropdown-bg-color: var(--sd-color-warning-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-warning{color:var(--sd-color-warning-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-danger{--pst-sd-dropdown-color: var(--sd-color-danger);--pst-sd-dropdown-bg-color: var(--sd-color-danger-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-danger+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-danger);--pst-sd-dropdown-bg-color: var(--sd-color-danger-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-danger{color:var(--sd-color-danger-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-light{--pst-sd-dropdown-color: var(--sd-color-light);--pst-sd-dropdown-bg-color: var(--sd-color-light-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-light+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-light);--pst-sd-dropdown-bg-color: var(--sd-color-light-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-light{color:var(--sd-color-light-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-muted{--pst-sd-dropdown-color: var(--sd-color-muted);--pst-sd-dropdown-bg-color: var(--sd-color-muted-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-muted+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-muted);--pst-sd-dropdown-bg-color: var(--sd-color-muted-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-muted{color:var(--sd-color-muted-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-dark{--pst-sd-dropdown-color: var(--sd-color-dark);--pst-sd-dropdown-bg-color: var(--sd-color-dark-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-dark+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-dark);--pst-sd-dropdown-bg-color: var(--sd-color-dark-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-dark{color:var(--sd-color-dark-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-black{--pst-sd-dropdown-color: var(--sd-color-black);--pst-sd-dropdown-bg-color: var(--sd-color-black-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-black+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-black);--pst-sd-dropdown-bg-color: var(--sd-color-black-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-black{color:var(--sd-color-black-bg-text) !important}details.sd-dropdown summary.sd-card-header.sd-bg-white{--pst-sd-dropdown-color: var(--sd-color-white);--pst-sd-dropdown-bg-color: var(--sd-color-white-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-white+div.sd-summary-content{--pst-sd-dropdown-color: var(--sd-color-white);--pst-sd-dropdown-bg-color: var(--sd-color-white-bg)}details.sd-dropdown summary.sd-card-header.sd-bg-text-white{color:var(--sd-color-white-bg-text) !important}details.sd-dropdown summary.sd-card-header:before{content:\"\";width:100%;height:100%;position:absolute;left:0;top:0;background-color:var(--pst-sd-dropdown-bg-color);z-index:-1;pointer-events:none}details.sd-dropdown summary.sd-card-header+div.sd-summary-content{border-left:.2rem solid var(--pst-sd-dropdown-color) !important;border-bottom-left-radius:calc(.25rem - 1px);background-color:var(--pst-color-on-background)}details.sd-dropdown summary.sd-card-header span.sd-summary-icon{display:inline-flex;align-items:center;color:var(--pst-sd-dropdown-color) !important}details.sd-dropdown summary.sd-card-header span.sd-summary-icon svg{opacity:1}details.sd-dropdown summary.sd-card-header .sd-summary-up,details.sd-dropdown summary.sd-card-header .sd-summary-down{top:.7rem}.bd-content .admonition button.toggle-button{color:inherit}.bd-content details.toggle-details summary{border-left:3px solid var(--pst-color-primary)}html div.rendered_html html .jp-RenderedHTMLCommon table{table-layout:auto}html[data-theme=dark] .bd-content .nboutput .output_area.rendered_html{color:var(--pst-color-on-background);background-color:var(--pst-color-text-base);border-radius:.25rem;padding:.5rem}html[data-theme=dark] .bd-content .nboutput .output_area.stderr{background:var(--pst-color-danger)}div.nblast.container{margin-bottom:1rem}div.cell_output .output{max-width:100%;overflow-x:auto}html[data-theme=dark] .bd-content div.cell_output img,html[data-theme=dark] .bd-content div.cell_output .text_html{color:var(--pst-color-on-background);background-color:var(--pst-color-text-base);border-radius:.25rem;padding:.5rem}.bd-content div.cell_input{display:flex;flex-direction:column;justify-content:stretch}.bd-content div.cell_input,.bd-content div.output{border-radius:.25rem}.bd-content div.output table{table-layout:auto}html[data-theme=dark] .bd-content img.leaflet-tile.leaflet-tile-loaded{border-radius:0;padding:0}.bd-search-container div#search-results>h2{font-size:var(--pst-font-size-icon);margin-top:0}.bd-search-container div#search-results p.search-summary{color:var(--pst-color-text-muted)}.bd-search-container ul.search{margin:0;list-style:none}.bd-search-container ul.search li{background-image:none;padding:1rem 0;margin:1rem 0;border-top:1px solid var(--pst-color-text-muted)}.bd-search-container ul.search li>a{font-size:1.2em}.bd-search-container ul.search li div.context,.bd-search-container ul.search li p.context{color:var(--pst-color-text-base);margin:.5em 0 0 0}.bd-search-container ul.search li div.context a:before,.bd-search-container ul.search li p.context a:before{content:\"#\";padding-right:.2em;color:var(--pst-color-text-muted)}","html {\n  /*****************************************************************************\n  * Overall Layout Variables\n  */\n\n  // Header height will impact the top offset for many sections\n  // Article header is 66% of Header\n  --pst-header-height: 4rem;\n  --pst-header-article-height: calc(var(--pst-header-height) * 2 / 3);\n  --pst-sidebar-secondary: 17rem;\n}\n\n/*******************************************************************************\n* Breakpoints that trigger UI changes\n*\n* Note that media-breakpoint-down begins at the next highest level!\n* So we should choose a media-breakpoint-down one *lower* than when we want to start\n* example: media-breakpoint-up(md) and media-breakpoint-down(sm) trigger at the same time\n* ref: https://github.com/twbs/bootstrap/issues/31214\n*/\n$breakpoint-sidebar-primary: lg; // When we collapse the primary sidebar\n$breakpoint-sidebar-secondary: xl; // When we collapse the secondary sidebar\n$breakpoint-page-width: 88rem; // taken from sphinx-basic-ng, which we are ultimately going to inherit\n\n/*******************************************************************************\n* Define the animation behaviour\n*/\n$animation-time: 200ms;\n\n/*******************************************************************************\n* UI shaping and padding\n*/\n$admonition-border-radius: 0.25rem;\n","html {\n  /*****************************************************************************\n  * Font features used in this theme\n  */\n\n  // base font size - applied at body/html level\n  --pst-font-size-base: 1rem;\n\n  // heading font sizes based on bootstrap sizing\n  --pst-font-size-h1: 2.5rem;\n  --pst-font-size-h2: 2rem;\n  --pst-font-size-h3: 1.75rem;\n  --pst-font-size-h4: 1.5rem;\n  --pst-font-size-h5: 1.25rem;\n  --pst-font-size-h6: 1.1rem;\n\n  // smaller than heading font sizes\n  --pst-font-size-milli: 0.9rem;\n\n  // Sidebar styles\n  --pst-sidebar-font-size: 0.9rem;\n  --pst-sidebar-font-size-mobile: 1.1rem;\n  --pst-sidebar-header-font-size: 1.2rem;\n  --pst-sidebar-header-font-weight: 600;\n\n  // Admonition styles\n  --pst-admonition-font-weight-heading: 600;\n\n  // Font weights\n  --pst-font-weight-caption: 300;\n  --pst-font-weight-heading: 400;\n\n  // Font family\n  // These are adapted from https://systemfontstack.com/ */\n  --pst-font-family-base-system: -apple-system, BlinkMacSystemFont, Segoe UI,\n    \"Helvetica Neue\", Arial, sans-serif, Apple Color Emoji, Segoe UI Emoji,\n    Segoe UI Symbol;\n  --pst-font-family-monospace-system: \"SFMono-Regular\", Menlo, Consolas, Monaco,\n    Liberation Mono, Lucida Console, monospace;\n\n  --pst-font-family-base: var(--pst-font-family-base-system);\n  --pst-font-family-heading: var(--pst-font-family-base-system);\n  --pst-font-family-monospace: var(--pst-font-family-monospace-system);\n}\n","html {\n  /*****************************************************************************\n  * Icon\n  */\n\n  // Font size across all icons\n  --pst-font-size-icon: 1.5rem;\n\n  // Font Awesome default icons\n  --pst-icon-check-circle: \"\\f058\"; // fa-solid fa-circle-check\n  --pst-icon-info-circle: \"\\f05a\"; // fa-solid fa-circle-info\n  --pst-icon-exclamation-triangle: \"\\f071\"; // fa-solid fa-triangle-exclamation\n  --pst-icon-exclamation-circle: \"\\f06a\"; // fa-solid fa-circle-exclamation\n  --pst-icon-times-circle: \"\\f057\"; // fa-solid fa-circle-xmark\n  --pst-icon-lightbulb: \"\\f0eb\"; // fa-solid fa-lightbulb\n  --pst-icon-download: \"\\f019\"; // fa-solid fa-download\n  --pst-icon-angle-left: \"\\f104\"; // fa-solid fa-angle-left\n  --pst-icon-angle-right: \"\\f105\"; // fa-solid fa-angle-right\n  --pst-icon-external-link: \"\\f35d\"; // fa-solid fa-up-right-from-square\n  --pst-icon-search-minus: \"\\f010\"; // fa-solid fa-magnifying-glass-minus\n  --pst-icon-github: \"\\f09b\"; // fa-brands fa-github\n  --pst-icon-gitlab: \"\\f296\"; // fa-brands fa-gitlab\n  --pst-icon-share: \"\\f064\"; // fa-solid fa-share\n  --pst-icon-bell: \"\\f0f3\"; // fa-solid fa-bell\n  --pst-icon-pencil: \"\\f303\"; // fa-solid fa-pencil\n\n  // Bootstrap icons\n  --pst-breadcrumb-divider: \"\\f105\";\n}\n","html {\n  /*****************************************************************************\n  * Admonitions\n  **/\n\n  --pst-icon-admonition-default: var(--pst-icon-bell);\n  --pst-icon-admonition-note: var(--pst-icon-info-circle);\n  --pst-icon-admonition-attention: var(--pst-icon-exclamation-circle);\n  --pst-icon-admonition-caution: var(--pst-icon-exclamation-triangle);\n  --pst-icon-admonition-warning: var(--pst-icon-exclamation-triangle);\n  --pst-icon-admonition-danger: var(--pst-icon-exclamation-triangle);\n  --pst-icon-admonition-error: var(--pst-icon-times-circle);\n  --pst-icon-admonition-hint: var(--pst-icon-lightbulb);\n  --pst-icon-admonition-tip: var(--pst-icon-lightbulb);\n  --pst-icon-admonition-important: var(--pst-icon-exclamation-circle);\n  --pst-icon-admonition-seealso: var(--pst-icon-share);\n  --pst-icon-admonition-todo: var(--pst-icon-pencil);\n}\n","html {\n  /*****************************************************************************\n  * versionmodified\n  **/\n\n  --pst-icon-versionmodified-default: var(--pst-icon-exclamation-circle);\n  --pst-icon-versionmodified-added: var(--pst-icon-exclamation-circle);\n  --pst-icon-versionmodified-changed: var(--pst-icon-exclamation-circle);\n  --pst-icon-versionmodified-deprecated: var(--pst-icon-exclamation-circle);\n}\n","html {\n  font-size: var(--pst-font-size-base);\n  scroll-padding-top: calc(var(--pst-header-height) + 1rem);\n}\n\nbody {\n  background-color: var(--pst-color-background);\n  font-family: var(--pst-font-family-base);\n  font-weight: 400;\n  line-height: 1.65;\n  color: var(--pst-color-text-base);\n  min-height: 100vh;\n  display: flex;\n  flex-direction: column;\n\n  // hack to avoid the black background on some browser including Safari\n  &::-webkit-scrollbar-track {\n    background: var(--pst-color-background);\n  }\n}\n\np {\n  margin-bottom: 1.15rem;\n  font-size: 1em;\n  color: var(--pst-color-text-base);\n\n  /* section header in docstring pages */\n  &.rubric {\n    border-bottom: 1px solid var(--pst-color-border);\n  }\n\n  &.centered {\n    text-align: center;\n  }\n}\n\na {\n  @include link-style-default;\n\n  // The # anchor that appears on hover over headings\n  &.headerlink {\n    color: var(--pst-color-secondary);\n    opacity: 0.7;\n    font-size: 0.8em;\n    padding: 0 4px 0 4px;\n    margin-left: 0.2em;\n    text-decoration: none;\n    transition: all 0.2s ease-out;\n    user-select: none;\n\n    &:hover {\n      opacity: 1;\n    }\n  }\n\n  // set up a icon next to the shorten links from github and gitlab\n  &.github,\n  &.gitlab {\n    &::before {\n      color: var(--pst-color-text-muted);\n      font: var(--fa-font-brands);\n      margin-right: 0.25rem;\n    }\n  }\n\n  &.github::before {\n    content: var(--pst-icon-github);\n  }\n\n  &.gitlab::before {\n    content: var(--pst-icon-gitlab);\n  }\n}\n\n.heading-style {\n  margin: 2.75rem 0 1.05rem;\n  font-family: var(--pst-font-family-heading);\n  font-weight: var(--pst-font-weight-heading);\n  line-height: 1.15;\n}\n\nh1 {\n  @extend .heading-style;\n  margin-top: 0;\n  font-size: var(--pst-font-size-h1);\n  color: var(--pst-heading-color);\n}\n\nh2 {\n  @extend .heading-style;\n  font-size: var(--pst-font-size-h2);\n  color: var(--pst-heading-color);\n}\n\nh3 {\n  @extend .heading-style;\n  font-size: var(--pst-font-size-h3);\n  color: var(--pst-heading-color);\n}\n\nh4 {\n  @extend .heading-style;\n  font-size: var(--pst-font-size-h4);\n  color: var(--pst-heading-color);\n}\n\nh5 {\n  @extend .heading-style;\n  font-size: var(--pst-font-size-h5);\n  color: var(--pst-color-text-base);\n}\n\nh6 {\n  @extend .heading-style;\n  font-size: var(--pst-font-size-h6);\n  color: var(--pst-color-text-base);\n}\n\nsmall,\n.text_small {\n  font-size: var(--pst-font-size-milli);\n}\n\nhr {\n  border: 0;\n  border-top: 1px solid var(--pst-color-border);\n}\n\npre,\ncode,\nkbd,\nsamp {\n  font-family: var(--pst-font-family-monospace);\n}\n\nkbd {\n  // use theme negative\n  background-color: var(--pst-color-on-background);\n  color: var(--pst-color-text-muted);\n\n  // Compound keyboard elements will have nested kbd in them, so this prevents double lines\n  &:not(.compound) {\n    border: 1px solid var(--pst-color-border);\n    margin: 0 0.1rem;\n    padding: 0.1rem 0.4rem;\n    box-shadow: 1px 1px 1px var(--pst-color-shadow);\n  }\n}\n\ncode {\n  color: var(--pst-color-inline-code);\n}\n\npre {\n  margin: 1.5em 0 1.5em 0;\n  padding: 1rem;\n  background-color: var(--pst-color-surface);\n  color: var(--pst-color-text-base);\n  line-height: 1.2em;\n  border: 1px solid var(--pst-color-border);\n  border-radius: $admonition-border-radius;\n\n  .linenos {\n    // minimum opacity to make the line numbers WCAG AA conformant\n    opacity: 0.8;\n    padding-right: 10px;\n  }\n}\n\n// the back to top btn\n#pst-back-to-top {\n  z-index: $zindex-tooltip;\n  position: fixed;\n  display: none;\n  top: 80vh;\n  left: 50vw;\n  transform: translate(-50%);\n  color: var(--pst-color-secondary-text);\n  background-color: var(--pst-color-secondary);\n  border: none;\n}\n","/**\n * Consistent styling for links\n **/\n\n// Define some useful variables for links styling consistency\n//\n//  Thickness of the underline for links\n// the default will be either:\n//  - 1px\n// - 0.0625rem if it's thicker than 1px because the user has changed the text\n//   size in their browser\n$link-underline-thickness: unquote(\"max(1px, .0625rem)\") !default;\n// Offset of link underlines from text baseline\n// The default is 3px expressed as ems, as calculated against the default body\n// font size (on desktop).\n$link-underline-offset: 0.1578em !default;\n// Thickness of link underlines in hover state\n// The default for each link will be the thickest of the following:\n//  - 3px\n//  - 0.1875rem, if it's thicker than 3px because the user has changed the text\n//    size in their browser\n//  - 0.12em (relative to the link's text size)\n$link-hover-decoration-thickness: unquote(\"max(3px, .1875rem, .12em)\") !default;\n\n//  Ensures links have an underline decoration by default - needed to meet\n// WCAG SC 1.4.1\n@mixin link-decoration {\n  text-decoration: underline;\n\n  @if $link-underline-thickness {\n    text-decoration-thickness: $link-underline-thickness;\n  }\n\n  @if $link-underline-offset {\n    text-underline-offset: $link-underline-offset;\n  }\n}\n\n// Ensures links have an underline decoration on hover - distinct from the\n// default behaviour\n@mixin link-decoration-hover {\n  @if $link-hover-decoration-thickness {\n    text-decoration-thickness: $link-hover-decoration-thickness;\n    // Disable ink skipping on underlines on hover. Browsers haven't\n    // standardised on this part of the spec yet, so set both properties\n    text-decoration-skip-ink: none; // Chromium, Firefox\n    text-decoration-skip: none; // Safari\n  }\n}\n\n// Simple hover style - can be used alone or in conjunction with other mixins\n// Add the text underline and change in thickness on hover\n@mixin link-style-hover {\n  &:hover {\n    @include link-decoration;\n    @include link-decoration-hover;\n    color: var(--pst-color-link-hover);\n  }\n}\n\n// Default link styles\n//\n// Defines: default unvisited, visited, hover, and active.\n// TODO: @trallard to improve focus styles in subsequent PR\n@mixin link-style-default {\n  // So that really long links don't spill out of their container\n  word-wrap: break-word;\n\n  color: var(--pst-color-link);\n  @include link-decoration;\n\n  &:hover {\n    color: var(--pst-color-link-hover);\n    @include link-decoration-hover;\n  }\n\n  // TODO: @trallard to add active styles in subsequent PR\n  &:active {\n    color: var(--pst-color-link);\n  }\n\n  // Visited should still be hoverable\n  &:visited {\n    color: var(--pst-color-link);\n    &:hover {\n      color: var(--pst-color-link-hover);\n    }\n  }\n  @include focus-indicator;\n}\n\n// Text link styles\n//\n// Makes links use the muted text colour and removes the underline.\n// Use this mixin for navigation bar links.\n@mixin link-style-text {\n  color: var(--pst-color-text-muted);\n  text-decoration: none;\n\n  &:hover {\n    color: var(--pst-color-link-hover);\n    @include link-decoration;\n    @include link-decoration-hover;\n  }\n  @include focus-indicator;\n}\n\n// Sidebar and TOC links\n//\n// Makes links use the muted text colour and removes the underline.\n// Use this mixin for navigation the primary sidebar and table of contents.\n// Active and hover should work together rather than one overriding the other.\n@mixin link-sidebar {\n  color: var(--pst-color-text-muted);\n  text-decoration: none;\n\n  &:hover {\n    text-decoration: underline;\n    background-color: transparent;\n    color: var(--pst-color-link-hover);\n    @include link-decoration-hover;\n  }\n\n  // TODO: @trallard to update active styles in subsequent PR\n  &:active {\n    color: var(--pst-color-link-hover);\n  }\n}\n\n// Sidebar current page link styles\n//\n// Adds a vertical line on the left hand side of the link to indicate that\n// it's the current page. Note this is distinct from an active state.\n// Used on the primary sidebar and the TOC.\n// We want the side box shadow to have the same thickness as the hover underline\n@mixin link-sidebar-current {\n  font-weight: 600;\n  color: var(--pst-color-primary);\n  @if $link-hover-decoration-thickness {\n    box-shadow: inset\n      $link-hover-decoration-thickness\n      0px\n      0px\n      var(--pst-color-primary);\n  }\n}\n\n// Navigation bar current page link styles\n//\n// Adds a bottom underline, this leaves enough space for the hover state without\n// cluttering the navbar.\n// We want the side box shadow to have the same thickness as the hover underline\n@mixin link-navbar-current {\n  font-weight: 600;\n  color: var(--pst-color-primary);\n  @if $link-hover-decoration-thickness {\n    border-bottom: $link-hover-decoration-thickness\n      solid\n      var(--pst-color-primary);\n  }\n}\n\n// Navigation bar icon links hover styles\n//\n// Adds a bottom box-shadow - since there is no text we cannot use text-decoration\n// We want the side box shadow to have the same thickness as the hover underline\n@mixin icon-navbar-hover {\n  &:hover {\n    color: var(--pst-color-link-hover);\n    @if $link-hover-decoration-thickness {\n      box-shadow: 0px\n        $link-hover-decoration-thickness\n        0px\n        var(--pst-color-link-hover);\n    }\n  }\n}\n\n// Focus indicator\n@mixin focus-indicator {\n  &:focus-visible {\n    outline: 2px solid var(--pst-color-accent);\n  }\n}\n","// Variables\n//\n// Variables should follow the `$component-state-property-size` formula for\n// consistent naming. Ex: $nav-link-disabled-color and $modal-content-box-shadow-xs.\n\n// Color system\n\n// scss-docs-start gray-color-variables\n$white:    #fff !default;\n$gray-100: #f8f9fa !default;\n$gray-200: #e9ecef !default;\n$gray-300: #dee2e6 !default;\n$gray-400: #ced4da !default;\n$gray-500: #adb5bd !default;\n$gray-600: #6c757d !default;\n$gray-700: #495057 !default;\n$gray-800: #343a40 !default;\n$gray-900: #212529 !default;\n$black:    #000 !default;\n// scss-docs-end gray-color-variables\n\n// fusv-disable\n// scss-docs-start gray-colors-map\n$grays: (\n  \"100\": $gray-100,\n  \"200\": $gray-200,\n  \"300\": $gray-300,\n  \"400\": $gray-400,\n  \"500\": $gray-500,\n  \"600\": $gray-600,\n  \"700\": $gray-700,\n  \"800\": $gray-800,\n  \"900\": $gray-900\n) !default;\n// scss-docs-end gray-colors-map\n// fusv-enable\n\n// scss-docs-start color-variables\n$blue:    #0d6efd !default;\n$indigo:  #6610f2 !default;\n$purple:  #6f42c1 !default;\n$pink:    #d63384 !default;\n$red:     #dc3545 !default;\n$orange:  #fd7e14 !default;\n$yellow:  #ffc107 !default;\n$green:   #198754 !default;\n$teal:    #20c997 !default;\n$cyan:    #0dcaf0 !default;\n// scss-docs-end color-variables\n\n// scss-docs-start colors-map\n$colors: (\n  \"blue\":       $blue,\n  \"indigo\":     $indigo,\n  \"purple\":     $purple,\n  \"pink\":       $pink,\n  \"red\":        $red,\n  \"orange\":     $orange,\n  \"yellow\":     $yellow,\n  \"green\":      $green,\n  \"teal\":       $teal,\n  \"cyan\":       $cyan,\n  \"black\":      $black,\n  \"white\":      $white,\n  \"gray\":       $gray-600,\n  \"gray-dark\":  $gray-800\n) !default;\n// scss-docs-end colors-map\n\n// The contrast ratio to reach against white, to determine if color changes from \"light\" to \"dark\". Acceptable values for WCAG 2.0 are 3, 4.5 and 7.\n// See https://www.w3.org/TR/WCAG20/#visual-audio-contrast-contrast\n$min-contrast-ratio:   4.5 !default;\n\n// Customize the light and dark text colors for use in our color contrast function.\n$color-contrast-dark:      $black !default;\n$color-contrast-light:     $white !default;\n\n// fusv-disable\n$blue-100: tint-color($blue, 80%) !default;\n$blue-200: tint-color($blue, 60%) !default;\n$blue-300: tint-color($blue, 40%) !default;\n$blue-400: tint-color($blue, 20%) !default;\n$blue-500: $blue !default;\n$blue-600: shade-color($blue, 20%) !default;\n$blue-700: shade-color($blue, 40%) !default;\n$blue-800: shade-color($blue, 60%) !default;\n$blue-900: shade-color($blue, 80%) !default;\n\n$indigo-100: tint-color($indigo, 80%) !default;\n$indigo-200: tint-color($indigo, 60%) !default;\n$indigo-300: tint-color($indigo, 40%) !default;\n$indigo-400: tint-color($indigo, 20%) !default;\n$indigo-500: $indigo !default;\n$indigo-600: shade-color($indigo, 20%) !default;\n$indigo-700: shade-color($indigo, 40%) !default;\n$indigo-800: shade-color($indigo, 60%) !default;\n$indigo-900: shade-color($indigo, 80%) !default;\n\n$purple-100: tint-color($purple, 80%) !default;\n$purple-200: tint-color($purple, 60%) !default;\n$purple-300: tint-color($purple, 40%) !default;\n$purple-400: tint-color($purple, 20%) !default;\n$purple-500: $purple !default;\n$purple-600: shade-color($purple, 20%) !default;\n$purple-700: shade-color($purple, 40%) !default;\n$purple-800: shade-color($purple, 60%) !default;\n$purple-900: shade-color($purple, 80%) !default;\n\n$pink-100: tint-color($pink, 80%) !default;\n$pink-200: tint-color($pink, 60%) !default;\n$pink-300: tint-color($pink, 40%) !default;\n$pink-400: tint-color($pink, 20%) !default;\n$pink-500: $pink !default;\n$pink-600: shade-color($pink, 20%) !default;\n$pink-700: shade-color($pink, 40%) !default;\n$pink-800: shade-color($pink, 60%) !default;\n$pink-900: shade-color($pink, 80%) !default;\n\n$red-100: tint-color($red, 80%) !default;\n$red-200: tint-color($red, 60%) !default;\n$red-300: tint-color($red, 40%) !default;\n$red-400: tint-color($red, 20%) !default;\n$red-500: $red !default;\n$red-600: shade-color($red, 20%) !default;\n$red-700: shade-color($red, 40%) !default;\n$red-800: shade-color($red, 60%) !default;\n$red-900: shade-color($red, 80%) !default;\n\n$orange-100: tint-color($orange, 80%) !default;\n$orange-200: tint-color($orange, 60%) !default;\n$orange-300: tint-color($orange, 40%) !default;\n$orange-400: tint-color($orange, 20%) !default;\n$orange-500: $orange !default;\n$orange-600: shade-color($orange, 20%) !default;\n$orange-700: shade-color($orange, 40%) !default;\n$orange-800: shade-color($orange, 60%) !default;\n$orange-900: shade-color($orange, 80%) !default;\n\n$yellow-100: tint-color($yellow, 80%) !default;\n$yellow-200: tint-color($yellow, 60%) !default;\n$yellow-300: tint-color($yellow, 40%) !default;\n$yellow-400: tint-color($yellow, 20%) !default;\n$yellow-500: $yellow !default;\n$yellow-600: shade-color($yellow, 20%) !default;\n$yellow-700: shade-color($yellow, 40%) !default;\n$yellow-800: shade-color($yellow, 60%) !default;\n$yellow-900: shade-color($yellow, 80%) !default;\n\n$green-100: tint-color($green, 80%) !default;\n$green-200: tint-color($green, 60%) !default;\n$green-300: tint-color($green, 40%) !default;\n$green-400: tint-color($green, 20%) !default;\n$green-500: $green !default;\n$green-600: shade-color($green, 20%) !default;\n$green-700: shade-color($green, 40%) !default;\n$green-800: shade-color($green, 60%) !default;\n$green-900: shade-color($green, 80%) !default;\n\n$teal-100: tint-color($teal, 80%) !default;\n$teal-200: tint-color($teal, 60%) !default;\n$teal-300: tint-color($teal, 40%) !default;\n$teal-400: tint-color($teal, 20%) !default;\n$teal-500: $teal !default;\n$teal-600: shade-color($teal, 20%) !default;\n$teal-700: shade-color($teal, 40%) !default;\n$teal-800: shade-color($teal, 60%) !default;\n$teal-900: shade-color($teal, 80%) !default;\n\n$cyan-100: tint-color($cyan, 80%) !default;\n$cyan-200: tint-color($cyan, 60%) !default;\n$cyan-300: tint-color($cyan, 40%) !default;\n$cyan-400: tint-color($cyan, 20%) !default;\n$cyan-500: $cyan !default;\n$cyan-600: shade-color($cyan, 20%) !default;\n$cyan-700: shade-color($cyan, 40%) !default;\n$cyan-800: shade-color($cyan, 60%) !default;\n$cyan-900: shade-color($cyan, 80%) !default;\n\n$blues: (\n  \"blue-100\": $blue-100,\n  \"blue-200\": $blue-200,\n  \"blue-300\": $blue-300,\n  \"blue-400\": $blue-400,\n  \"blue-500\": $blue-500,\n  \"blue-600\": $blue-600,\n  \"blue-700\": $blue-700,\n  \"blue-800\": $blue-800,\n  \"blue-900\": $blue-900\n) !default;\n\n$indigos: (\n  \"indigo-100\": $indigo-100,\n  \"indigo-200\": $indigo-200,\n  \"indigo-300\": $indigo-300,\n  \"indigo-400\": $indigo-400,\n  \"indigo-500\": $indigo-500,\n  \"indigo-600\": $indigo-600,\n  \"indigo-700\": $indigo-700,\n  \"indigo-800\": $indigo-800,\n  \"indigo-900\": $indigo-900\n) !default;\n\n$purples: (\n  \"purple-100\": $purple-100,\n  \"purple-200\": $purple-200,\n  \"purple-300\": $purple-300,\n  \"purple-400\": $purple-400,\n  \"purple-500\": $purple-500,\n  \"purple-600\": $purple-600,\n  \"purple-700\": $purple-700,\n  \"purple-800\": $purple-800,\n  \"purple-900\": $purple-900\n) !default;\n\n$pinks: (\n  \"pink-100\": $pink-100,\n  \"pink-200\": $pink-200,\n  \"pink-300\": $pink-300,\n  \"pink-400\": $pink-400,\n  \"pink-500\": $pink-500,\n  \"pink-600\": $pink-600,\n  \"pink-700\": $pink-700,\n  \"pink-800\": $pink-800,\n  \"pink-900\": $pink-900\n) !default;\n\n$reds: (\n  \"red-100\": $red-100,\n  \"red-200\": $red-200,\n  \"red-300\": $red-300,\n  \"red-400\": $red-400,\n  \"red-500\": $red-500,\n  \"red-600\": $red-600,\n  \"red-700\": $red-700,\n  \"red-800\": $red-800,\n  \"red-900\": $red-900\n) !default;\n\n$oranges: (\n  \"orange-100\": $orange-100,\n  \"orange-200\": $orange-200,\n  \"orange-300\": $orange-300,\n  \"orange-400\": $orange-400,\n  \"orange-500\": $orange-500,\n  \"orange-600\": $orange-600,\n  \"orange-700\": $orange-700,\n  \"orange-800\": $orange-800,\n  \"orange-900\": $orange-900\n) !default;\n\n$yellows: (\n  \"yellow-100\": $yellow-100,\n  \"yellow-200\": $yellow-200,\n  \"yellow-300\": $yellow-300,\n  \"yellow-400\": $yellow-400,\n  \"yellow-500\": $yellow-500,\n  \"yellow-600\": $yellow-600,\n  \"yellow-700\": $yellow-700,\n  \"yellow-800\": $yellow-800,\n  \"yellow-900\": $yellow-900\n) !default;\n\n$greens: (\n  \"green-100\": $green-100,\n  \"green-200\": $green-200,\n  \"green-300\": $green-300,\n  \"green-400\": $green-400,\n  \"green-500\": $green-500,\n  \"green-600\": $green-600,\n  \"green-700\": $green-700,\n  \"green-800\": $green-800,\n  \"green-900\": $green-900\n) !default;\n\n$teals: (\n  \"teal-100\": $teal-100,\n  \"teal-200\": $teal-200,\n  \"teal-300\": $teal-300,\n  \"teal-400\": $teal-400,\n  \"teal-500\": $teal-500,\n  \"teal-600\": $teal-600,\n  \"teal-700\": $teal-700,\n  \"teal-800\": $teal-800,\n  \"teal-900\": $teal-900\n) !default;\n\n$cyans: (\n  \"cyan-100\": $cyan-100,\n  \"cyan-200\": $cyan-200,\n  \"cyan-300\": $cyan-300,\n  \"cyan-400\": $cyan-400,\n  \"cyan-500\": $cyan-500,\n  \"cyan-600\": $cyan-600,\n  \"cyan-700\": $cyan-700,\n  \"cyan-800\": $cyan-800,\n  \"cyan-900\": $cyan-900\n) !default;\n// fusv-enable\n\n// scss-docs-start theme-color-variables\n$primary:       $blue !default;\n$secondary:     $gray-600 !default;\n$success:       $green !default;\n$info:          $cyan !default;\n$warning:       $yellow !default;\n$danger:        $red !default;\n$light:         $gray-100 !default;\n$dark:          $gray-900 !default;\n// scss-docs-end theme-color-variables\n\n// scss-docs-start theme-colors-map\n$theme-colors: (\n  \"primary\":    $primary,\n  \"secondary\":  $secondary,\n  \"success\":    $success,\n  \"info\":       $info,\n  \"warning\":    $warning,\n  \"danger\":     $danger,\n  \"light\":      $light,\n  \"dark\":       $dark\n) !default;\n// scss-docs-end theme-colors-map\n\n// scss-docs-start theme-text-variables\n$primary-text-emphasis:   shade-color($primary, 60%) !default;\n$secondary-text-emphasis: shade-color($secondary, 60%) !default;\n$success-text-emphasis:   shade-color($success, 60%) !default;\n$info-text-emphasis:      shade-color($info, 60%) !default;\n$warning-text-emphasis:   shade-color($warning, 60%) !default;\n$danger-text-emphasis:    shade-color($danger, 60%) !default;\n$light-text-emphasis:     $gray-700 !default;\n$dark-text-emphasis:      $gray-700 !default;\n// scss-docs-end theme-text-variables\n\n// scss-docs-start theme-bg-subtle-variables\n$primary-bg-subtle:       tint-color($primary, 80%) !default;\n$secondary-bg-subtle:     tint-color($secondary, 80%) !default;\n$success-bg-subtle:       tint-color($success, 80%) !default;\n$info-bg-subtle:          tint-color($info, 80%) !default;\n$warning-bg-subtle:       tint-color($warning, 80%) !default;\n$danger-bg-subtle:        tint-color($danger, 80%) !default;\n$light-bg-subtle:         mix($gray-100, $white) !default;\n$dark-bg-subtle:          $gray-400 !default;\n// scss-docs-end theme-bg-subtle-variables\n\n// scss-docs-start theme-border-subtle-variables\n$primary-border-subtle:   tint-color($primary, 60%) !default;\n$secondary-border-subtle: tint-color($secondary, 60%) !default;\n$success-border-subtle:   tint-color($success, 60%) !default;\n$info-border-subtle:      tint-color($info, 60%) !default;\n$warning-border-subtle:   tint-color($warning, 60%) !default;\n$danger-border-subtle:    tint-color($danger, 60%) !default;\n$light-border-subtle:     $gray-200 !default;\n$dark-border-subtle:      $gray-500 !default;\n// scss-docs-end theme-border-subtle-variables\n\n// Characters which are escaped by the escape-svg function\n$escaped-characters: (\n  (\"<\", \"%3c\"),\n  (\">\", \"%3e\"),\n  (\"#\", \"%23\"),\n  (\"(\", \"%28\"),\n  (\")\", \"%29\"),\n) !default;\n\n// Options\n//\n// Quickly modify global styling by enabling or disabling optional features.\n\n$enable-caret:                true !default;\n$enable-rounded:              true !default;\n$enable-shadows:              false !default;\n$enable-gradients:            false !default;\n$enable-transitions:          true !default;\n$enable-reduced-motion:       true !default;\n$enable-smooth-scroll:        true !default;\n$enable-grid-classes:         true !default;\n$enable-container-classes:    true !default;\n$enable-cssgrid:              false !default;\n$enable-button-pointers:      true !default;\n$enable-rfs:                  true !default;\n$enable-validation-icons:     true !default;\n$enable-negative-margins:     false !default;\n$enable-deprecation-messages: true !default;\n$enable-important-utilities:  true !default;\n\n$enable-dark-mode:            true !default;\n$color-mode-type:             data !default; // `data` or `media-query`\n\n// Prefix for :root CSS variables\n\n$variable-prefix:             bs- !default; // Deprecated in v5.2.0 for the shorter `$prefix`\n$prefix:                      $variable-prefix !default;\n\n// Gradient\n//\n// The gradient which is added to components if `$enable-gradients` is `true`\n// This gradient is also added to elements with `.bg-gradient`\n// scss-docs-start variable-gradient\n$gradient: linear-gradient(180deg, rgba($white, .15), rgba($white, 0)) !default;\n// scss-docs-end variable-gradient\n\n// Spacing\n//\n// Control the default styling of most Bootstrap elements by modifying these\n// variables. Mostly focused on spacing.\n// You can add more entries to the $spacers map, should you need more variation.\n\n// scss-docs-start spacer-variables-maps\n$spacer: 1rem !default;\n$spacers: (\n  0: 0,\n  1: $spacer * .25,\n  2: $spacer * .5,\n  3: $spacer,\n  4: $spacer * 1.5,\n  5: $spacer * 3,\n) !default;\n// scss-docs-end spacer-variables-maps\n\n// Position\n//\n// Define the edge positioning anchors of the position utilities.\n\n// scss-docs-start position-map\n$position-values: (\n  0: 0,\n  50: 50%,\n  100: 100%\n) !default;\n// scss-docs-end position-map\n\n// Body\n//\n// Settings for the `<body>` element.\n\n$body-text-align:           null !default;\n$body-color:                $gray-900 !default;\n$body-bg:                   $white !default;\n\n$body-secondary-color:      rgba($body-color, .75) !default;\n$body-secondary-bg:         $gray-200 !default;\n\n$body-tertiary-color:       rgba($body-color, .5) !default;\n$body-tertiary-bg:          $gray-100 !default;\n\n$body-emphasis-color:       $black !default;\n\n// Links\n//\n// Style anchor elements.\n\n$link-color:                              $primary !default;\n$link-decoration:                         underline !default;\n$link-shade-percentage:                   20% !default;\n$link-hover-color:                        shift-color($link-color, $link-shade-percentage) !default;\n$link-hover-decoration:                   null !default;\n\n$stretched-link-pseudo-element:           after !default;\n$stretched-link-z-index:                  1 !default;\n\n// Icon links\n// scss-docs-start icon-link-variables\n$icon-link-gap:               .375rem !default;\n$icon-link-underline-offset:  .25em !default;\n$icon-link-icon-size:         1em !default;\n$icon-link-icon-transition:   .2s ease-in-out transform !default;\n$icon-link-icon-transform:    translate3d(.25em, 0, 0) !default;\n// scss-docs-end icon-link-variables\n\n// Paragraphs\n//\n// Style p element.\n\n$paragraph-margin-bottom:   1rem !default;\n\n\n// Grid breakpoints\n//\n// Define the minimum dimensions at which your layout will change,\n// adapting to different screen sizes, for use in media queries.\n\n// scss-docs-start grid-breakpoints\n$grid-breakpoints: (\n  xs: 0,\n  sm: 576px,\n  md: 768px,\n  lg: 992px,\n  xl: 1200px,\n  xxl: 1400px\n) !default;\n// scss-docs-end grid-breakpoints\n\n@include _assert-ascending($grid-breakpoints, \"$grid-breakpoints\");\n@include _assert-starts-at-zero($grid-breakpoints, \"$grid-breakpoints\");\n\n\n// Grid containers\n//\n// Define the maximum width of `.container` for different screen sizes.\n\n// scss-docs-start container-max-widths\n$container-max-widths: (\n  sm: 540px,\n  md: 720px,\n  lg: 960px,\n  xl: 1140px,\n  xxl: 1320px\n) !default;\n// scss-docs-end container-max-widths\n\n@include _assert-ascending($container-max-widths, \"$container-max-widths\");\n\n\n// Grid columns\n//\n// Set the number of columns and specify the width of the gutters.\n\n$grid-columns:                12 !default;\n$grid-gutter-width:           1.5rem !default;\n$grid-row-columns:            6 !default;\n\n// Container padding\n\n$container-padding-x: $grid-gutter-width !default;\n\n\n// Components\n//\n// Define common padding and border radius sizes and more.\n\n// scss-docs-start border-variables\n$border-width:                1px !default;\n$border-widths: (\n  1: 1px,\n  2: 2px,\n  3: 3px,\n  4: 4px,\n  5: 5px\n) !default;\n$border-style:                solid !default;\n$border-color:                $gray-300 !default;\n$border-color-translucent:    rgba($black, .175) !default;\n// scss-docs-end border-variables\n\n// scss-docs-start border-radius-variables\n$border-radius:               .375rem !default;\n$border-radius-sm:            .25rem !default;\n$border-radius-lg:            .5rem !default;\n$border-radius-xl:            1rem !default;\n$border-radius-xxl:           2rem !default;\n$border-radius-pill:          50rem !default;\n// scss-docs-end border-radius-variables\n// fusv-disable\n$border-radius-2xl:           $border-radius-xxl !default; // Deprecated in v5.3.0\n// fusv-enable\n\n// scss-docs-start box-shadow-variables\n$box-shadow:                  0 .5rem 1rem rgba($black, .15) !default;\n$box-shadow-sm:               0 .125rem .25rem rgba($black, .075) !default;\n$box-shadow-lg:               0 1rem 3rem rgba($black, .175) !default;\n$box-shadow-inset:            inset 0 1px 2px rgba($black, .075) !default;\n// scss-docs-end box-shadow-variables\n\n$component-active-color:      $white !default;\n$component-active-bg:         $primary !default;\n\n// scss-docs-start focus-ring-variables\n$focus-ring-width:      .25rem !default;\n$focus-ring-opacity:    .25 !default;\n$focus-ring-color:      rgba($primary, $focus-ring-opacity) !default;\n$focus-ring-blur:       0 !default;\n$focus-ring-box-shadow: 0 0 $focus-ring-blur $focus-ring-width $focus-ring-color !default;\n// scss-docs-end focus-ring-variables\n\n// scss-docs-start caret-variables\n$caret-width:                 .3em !default;\n$caret-vertical-align:        $caret-width * .85 !default;\n$caret-spacing:               $caret-width * .85 !default;\n// scss-docs-end caret-variables\n\n$transition-base:             all .2s ease-in-out !default;\n$transition-fade:             opacity .15s linear !default;\n// scss-docs-start collapse-transition\n$transition-collapse:         height .35s ease !default;\n$transition-collapse-width:   width .35s ease !default;\n// scss-docs-end collapse-transition\n\n// stylelint-disable function-disallowed-list\n// scss-docs-start aspect-ratios\n$aspect-ratios: (\n  \"1x1\": 100%,\n  \"4x3\": calc(3 / 4 * 100%),\n  \"16x9\": calc(9 / 16 * 100%),\n  \"21x9\": calc(9 / 21 * 100%)\n) !default;\n// scss-docs-end aspect-ratios\n// stylelint-enable function-disallowed-list\n\n// Typography\n//\n// Font, line-height, and color for body text, headings, and more.\n\n// scss-docs-start font-variables\n// stylelint-disable value-keyword-case\n$font-family-sans-serif:      system-ui, -apple-system, \"Segoe UI\", Roboto, \"Helvetica Neue\", \"Noto Sans\", \"Liberation Sans\", Arial, sans-serif, \"Apple Color Emoji\", \"Segoe UI Emoji\", \"Segoe UI Symbol\", \"Noto Color Emoji\" !default;\n$font-family-monospace:       SFMono-Regular, Menlo, Monaco, Consolas, \"Liberation Mono\", \"Courier New\", monospace !default;\n// stylelint-enable value-keyword-case\n$font-family-base:            var(--#{$prefix}font-sans-serif) !default;\n$font-family-code:            var(--#{$prefix}font-monospace) !default;\n\n// $font-size-root affects the value of `rem`, which is used for as well font sizes, paddings, and margins\n// $font-size-base affects the font size of the body text\n$font-size-root:              null !default;\n$font-size-base:              1rem !default; // Assumes the browser default, typically `16px`\n$font-size-sm:                $font-size-base * .875 !default;\n$font-size-lg:                $font-size-base * 1.25 !default;\n\n$font-weight-lighter:         lighter !default;\n$font-weight-light:           300 !default;\n$font-weight-normal:          400 !default;\n$font-weight-medium:          500 !default;\n$font-weight-semibold:        600 !default;\n$font-weight-bold:            700 !default;\n$font-weight-bolder:          bolder !default;\n\n$font-weight-base:            $font-weight-normal !default;\n\n$line-height-base:            1.5 !default;\n$line-height-sm:              1.25 !default;\n$line-height-lg:              2 !default;\n\n$h1-font-size:                $font-size-base * 2.5 !default;\n$h2-font-size:                $font-size-base * 2 !default;\n$h3-font-size:                $font-size-base * 1.75 !default;\n$h4-font-size:                $font-size-base * 1.5 !default;\n$h5-font-size:                $font-size-base * 1.25 !default;\n$h6-font-size:                $font-size-base !default;\n// scss-docs-end font-variables\n\n// scss-docs-start font-sizes\n$font-sizes: (\n  1: $h1-font-size,\n  2: $h2-font-size,\n  3: $h3-font-size,\n  4: $h4-font-size,\n  5: $h5-font-size,\n  6: $h6-font-size\n) !default;\n// scss-docs-end font-sizes\n\n// scss-docs-start headings-variables\n$headings-margin-bottom:      $spacer * .5 !default;\n$headings-font-family:        null !default;\n$headings-font-style:         null !default;\n$headings-font-weight:        500 !default;\n$headings-line-height:        1.2 !default;\n$headings-color:              inherit !default;\n// scss-docs-end headings-variables\n\n// scss-docs-start display-headings\n$display-font-sizes: (\n  1: 5rem,\n  2: 4.5rem,\n  3: 4rem,\n  4: 3.5rem,\n  5: 3rem,\n  6: 2.5rem\n) !default;\n\n$display-font-family: null !default;\n$display-font-style:  null !default;\n$display-font-weight: 300 !default;\n$display-line-height: $headings-line-height !default;\n// scss-docs-end display-headings\n\n// scss-docs-start type-variables\n$lead-font-size:              $font-size-base * 1.25 !default;\n$lead-font-weight:            300 !default;\n\n$small-font-size:             .875em !default;\n\n$sub-sup-font-size:           .75em !default;\n\n// fusv-disable\n$text-muted:                  var(--#{$prefix}secondary-color) !default; // Deprecated in 5.3.0\n// fusv-enable\n\n$initialism-font-size:        $small-font-size !default;\n\n$blockquote-margin-y:         $spacer !default;\n$blockquote-font-size:        $font-size-base * 1.25 !default;\n$blockquote-footer-color:     $gray-600 !default;\n$blockquote-footer-font-size: $small-font-size !default;\n\n$hr-margin-y:                 $spacer !default;\n$hr-color:                    inherit !default;\n\n// fusv-disable\n$hr-bg-color:                 null !default; // Deprecated in v5.2.0\n$hr-height:                   null !default; // Deprecated in v5.2.0\n// fusv-enable\n\n$hr-border-color:             null !default; // Allows for inherited colors\n$hr-border-width:             var(--#{$prefix}border-width) !default;\n$hr-opacity:                  .25 !default;\n\n// scss-docs-start vr-variables\n$vr-border-width:             var(--#{$prefix}border-width) !default;\n// scss-docs-end vr-variables\n\n$legend-margin-bottom:        .5rem !default;\n$legend-font-size:            1.5rem !default;\n$legend-font-weight:          null !default;\n\n$dt-font-weight:              $font-weight-bold !default;\n\n$list-inline-padding:         .5rem !default;\n\n$mark-padding:                .1875em !default;\n$mark-color:                  $body-color !default;\n$mark-bg:                     $yellow-100 !default;\n// scss-docs-end type-variables\n\n\n// Tables\n//\n// Customizes the `.table` component with basic values, each used across all table variations.\n\n// scss-docs-start table-variables\n$table-cell-padding-y:        .5rem !default;\n$table-cell-padding-x:        .5rem !default;\n$table-cell-padding-y-sm:     .25rem !default;\n$table-cell-padding-x-sm:     .25rem !default;\n\n$table-cell-vertical-align:   top !default;\n\n$table-color:                 var(--#{$prefix}emphasis-color) !default;\n$table-bg:                    var(--#{$prefix}body-bg) !default;\n$table-accent-bg:             transparent !default;\n\n$table-th-font-weight:        null !default;\n\n$table-striped-color:         $table-color !default;\n$table-striped-bg-factor:     .05 !default;\n$table-striped-bg:            rgba(var(--#{$prefix}emphasis-color-rgb), $table-striped-bg-factor) !default;\n\n$table-active-color:          $table-color !default;\n$table-active-bg-factor:      .1 !default;\n$table-active-bg:             rgba(var(--#{$prefix}emphasis-color-rgb), $table-active-bg-factor) !default;\n\n$table-hover-color:           $table-color !default;\n$table-hover-bg-factor:       .075 !default;\n$table-hover-bg:              rgba(var(--#{$prefix}emphasis-color-rgb), $table-hover-bg-factor) !default;\n\n$table-border-factor:         .2 !default;\n$table-border-width:          var(--#{$prefix}border-width) !default;\n$table-border-color:          var(--#{$prefix}border-color) !default;\n\n$table-striped-order:         odd !default;\n$table-striped-columns-order: even !default;\n\n$table-group-separator-color: currentcolor !default;\n\n$table-caption-color:         var(--#{$prefix}secondary-color) !default;\n\n$table-bg-scale:              -80% !default;\n// scss-docs-end table-variables\n\n// scss-docs-start table-loop\n$table-variants: (\n  \"primary\":    shift-color($primary, $table-bg-scale),\n  \"secondary\":  shift-color($secondary, $table-bg-scale),\n  \"success\":    shift-color($success, $table-bg-scale),\n  \"info\":       shift-color($info, $table-bg-scale),\n  \"warning\":    shift-color($warning, $table-bg-scale),\n  \"danger\":     shift-color($danger, $table-bg-scale),\n  \"light\":      $light,\n  \"dark\":       $dark,\n) !default;\n// scss-docs-end table-loop\n\n\n// Buttons + Forms\n//\n// Shared variables that are reassigned to `$input-` and `$btn-` specific variables.\n\n// scss-docs-start input-btn-variables\n$input-btn-padding-y:         .375rem !default;\n$input-btn-padding-x:         .75rem !default;\n$input-btn-font-family:       null !default;\n$input-btn-font-size:         $font-size-base !default;\n$input-btn-line-height:       $line-height-base !default;\n\n$input-btn-focus-width:         $focus-ring-width !default;\n$input-btn-focus-color-opacity: $focus-ring-opacity !default;\n$input-btn-focus-color:         $focus-ring-color !default;\n$input-btn-focus-blur:          $focus-ring-blur !default;\n$input-btn-focus-box-shadow:    $focus-ring-box-shadow !default;\n\n$input-btn-padding-y-sm:      .25rem !default;\n$input-btn-padding-x-sm:      .5rem !default;\n$input-btn-font-size-sm:      $font-size-sm !default;\n\n$input-btn-padding-y-lg:      .5rem !default;\n$input-btn-padding-x-lg:      1rem !default;\n$input-btn-font-size-lg:      $font-size-lg !default;\n\n$input-btn-border-width:      var(--#{$prefix}border-width) !default;\n// scss-docs-end input-btn-variables\n\n\n// Buttons\n//\n// For each of Bootstrap's buttons, define text, background, and border color.\n\n// scss-docs-start btn-variables\n$btn-color:                   var(--#{$prefix}body-color) !default;\n$btn-padding-y:               $input-btn-padding-y !default;\n$btn-padding-x:               $input-btn-padding-x !default;\n$btn-font-family:             $input-btn-font-family !default;\n$btn-font-size:               $input-btn-font-size !default;\n$btn-line-height:             $input-btn-line-height !default;\n$btn-white-space:             null !default; // Set to `nowrap` to prevent text wrapping\n\n$btn-padding-y-sm:            $input-btn-padding-y-sm !default;\n$btn-padding-x-sm:            $input-btn-padding-x-sm !default;\n$btn-font-size-sm:            $input-btn-font-size-sm !default;\n\n$btn-padding-y-lg:            $input-btn-padding-y-lg !default;\n$btn-padding-x-lg:            $input-btn-padding-x-lg !default;\n$btn-font-size-lg:            $input-btn-font-size-lg !default;\n\n$btn-border-width:            $input-btn-border-width !default;\n\n$btn-font-weight:             $font-weight-normal !default;\n$btn-box-shadow:              inset 0 1px 0 rgba($white, .15), 0 1px 1px rgba($black, .075) !default;\n$btn-focus-width:             $input-btn-focus-width !default;\n$btn-focus-box-shadow:        $input-btn-focus-box-shadow !default;\n$btn-disabled-opacity:        .65 !default;\n$btn-active-box-shadow:       inset 0 3px 5px rgba($black, .125) !default;\n\n$btn-link-color:              var(--#{$prefix}link-color) !default;\n$btn-link-hover-color:        var(--#{$prefix}link-hover-color) !default;\n$btn-link-disabled-color:     $gray-600 !default;\n$btn-link-focus-shadow-rgb:   to-rgb(mix(color-contrast($link-color), $link-color, 15%)) !default;\n\n// Allows for customizing button radius independently from global border radius\n$btn-border-radius:           var(--#{$prefix}border-radius) !default;\n$btn-border-radius-sm:        var(--#{$prefix}border-radius-sm) !default;\n$btn-border-radius-lg:        var(--#{$prefix}border-radius-lg) !default;\n\n$btn-transition:              color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$btn-hover-bg-shade-amount:       15% !default;\n$btn-hover-bg-tint-amount:        15% !default;\n$btn-hover-border-shade-amount:   20% !default;\n$btn-hover-border-tint-amount:    10% !default;\n$btn-active-bg-shade-amount:      20% !default;\n$btn-active-bg-tint-amount:       20% !default;\n$btn-active-border-shade-amount:  25% !default;\n$btn-active-border-tint-amount:   10% !default;\n// scss-docs-end btn-variables\n\n\n// Forms\n\n// scss-docs-start form-text-variables\n$form-text-margin-top:                  .25rem !default;\n$form-text-font-size:                   $small-font-size !default;\n$form-text-font-style:                  null !default;\n$form-text-font-weight:                 null !default;\n$form-text-color:                       var(--#{$prefix}secondary-color) !default;\n// scss-docs-end form-text-variables\n\n// scss-docs-start form-label-variables\n$form-label-margin-bottom:              .5rem !default;\n$form-label-font-size:                  null !default;\n$form-label-font-style:                 null !default;\n$form-label-font-weight:                null !default;\n$form-label-color:                      null !default;\n// scss-docs-end form-label-variables\n\n// scss-docs-start form-input-variables\n$input-padding-y:                       $input-btn-padding-y !default;\n$input-padding-x:                       $input-btn-padding-x !default;\n$input-font-family:                     $input-btn-font-family !default;\n$input-font-size:                       $input-btn-font-size !default;\n$input-font-weight:                     $font-weight-base !default;\n$input-line-height:                     $input-btn-line-height !default;\n\n$input-padding-y-sm:                    $input-btn-padding-y-sm !default;\n$input-padding-x-sm:                    $input-btn-padding-x-sm !default;\n$input-font-size-sm:                    $input-btn-font-size-sm !default;\n\n$input-padding-y-lg:                    $input-btn-padding-y-lg !default;\n$input-padding-x-lg:                    $input-btn-padding-x-lg !default;\n$input-font-size-lg:                    $input-btn-font-size-lg !default;\n\n$input-bg:                              var(--#{$prefix}body-bg) !default;\n$input-disabled-color:                  null !default;\n$input-disabled-bg:                     var(--#{$prefix}secondary-bg) !default;\n$input-disabled-border-color:           null !default;\n\n$input-color:                           var(--#{$prefix}body-color) !default;\n$input-border-color:                    var(--#{$prefix}border-color) !default;\n$input-border-width:                    $input-btn-border-width !default;\n$input-box-shadow:                      var(--#{$prefix}box-shadow-inset) !default;\n\n$input-border-radius:                   var(--#{$prefix}border-radius) !default;\n$input-border-radius-sm:                var(--#{$prefix}border-radius-sm) !default;\n$input-border-radius-lg:                var(--#{$prefix}border-radius-lg) !default;\n\n$input-focus-bg:                        $input-bg !default;\n$input-focus-border-color:              tint-color($component-active-bg, 50%) !default;\n$input-focus-color:                     $input-color !default;\n$input-focus-width:                     $input-btn-focus-width !default;\n$input-focus-box-shadow:                $input-btn-focus-box-shadow !default;\n\n$input-placeholder-color:               var(--#{$prefix}secondary-color) !default;\n$input-plaintext-color:                 var(--#{$prefix}body-color) !default;\n\n$input-height-border:                   calc(#{$input-border-width} * 2) !default; // stylelint-disable-line function-disallowed-list\n\n$input-height-inner:                    add($input-line-height * 1em, $input-padding-y * 2) !default;\n$input-height-inner-half:               add($input-line-height * .5em, $input-padding-y) !default;\n$input-height-inner-quarter:            add($input-line-height * .25em, $input-padding-y * .5) !default;\n\n$input-height:                          add($input-line-height * 1em, add($input-padding-y * 2, $input-height-border, false)) !default;\n$input-height-sm:                       add($input-line-height * 1em, add($input-padding-y-sm * 2, $input-height-border, false)) !default;\n$input-height-lg:                       add($input-line-height * 1em, add($input-padding-y-lg * 2, $input-height-border, false)) !default;\n\n$input-transition:                      border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$form-color-width:                      3rem !default;\n// scss-docs-end form-input-variables\n\n// scss-docs-start form-check-variables\n$form-check-input-width:                  1em !default;\n$form-check-min-height:                   $font-size-base * $line-height-base !default;\n$form-check-padding-start:                $form-check-input-width + .5em !default;\n$form-check-margin-bottom:                .125rem !default;\n$form-check-label-color:                  null !default;\n$form-check-label-cursor:                 null !default;\n$form-check-transition:                   null !default;\n\n$form-check-input-active-filter:          brightness(90%) !default;\n\n$form-check-input-bg:                     $input-bg !default;\n$form-check-input-border:                 var(--#{$prefix}border-width) solid var(--#{$prefix}border-color) !default;\n$form-check-input-border-radius:          .25em !default;\n$form-check-radio-border-radius:          50% !default;\n$form-check-input-focus-border:           $input-focus-border-color !default;\n$form-check-input-focus-box-shadow:       $focus-ring-box-shadow !default;\n\n$form-check-input-checked-color:          $component-active-color !default;\n$form-check-input-checked-bg-color:       $component-active-bg !default;\n$form-check-input-checked-border-color:   $form-check-input-checked-bg-color !default;\n$form-check-input-checked-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'><path fill='none' stroke='#{$form-check-input-checked-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='m6 10 3 3 6-6'/></svg>\") !default;\n$form-check-radio-checked-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='2' fill='#{$form-check-input-checked-color}'/></svg>\") !default;\n\n$form-check-input-indeterminate-color:          $component-active-color !default;\n$form-check-input-indeterminate-bg-color:       $component-active-bg !default;\n$form-check-input-indeterminate-border-color:   $form-check-input-indeterminate-bg-color !default;\n$form-check-input-indeterminate-bg-image:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'><path fill='none' stroke='#{$form-check-input-indeterminate-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10h8'/></svg>\") !default;\n\n$form-check-input-disabled-opacity:        .5 !default;\n$form-check-label-disabled-opacity:        $form-check-input-disabled-opacity !default;\n$form-check-btn-check-disabled-opacity:    $btn-disabled-opacity !default;\n\n$form-check-inline-margin-end:    1rem !default;\n// scss-docs-end form-check-variables\n\n// scss-docs-start form-switch-variables\n$form-switch-color:               rgba($black, .25) !default;\n$form-switch-width:               2em !default;\n$form-switch-padding-start:       $form-switch-width + .5em !default;\n$form-switch-bg-image:            url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-color}'/></svg>\") !default;\n$form-switch-border-radius:       $form-switch-width !default;\n$form-switch-transition:          background-position .15s ease-in-out !default;\n\n$form-switch-focus-color:         $input-focus-border-color !default;\n$form-switch-focus-bg-image:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-focus-color}'/></svg>\") !default;\n\n$form-switch-checked-color:       $component-active-color !default;\n$form-switch-checked-bg-image:    url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'><circle r='3' fill='#{$form-switch-checked-color}'/></svg>\") !default;\n$form-switch-checked-bg-position: right center !default;\n// scss-docs-end form-switch-variables\n\n// scss-docs-start input-group-variables\n$input-group-addon-padding-y:           $input-padding-y !default;\n$input-group-addon-padding-x:           $input-padding-x !default;\n$input-group-addon-font-weight:         $input-font-weight !default;\n$input-group-addon-color:               $input-color !default;\n$input-group-addon-bg:                  var(--#{$prefix}tertiary-bg) !default;\n$input-group-addon-border-color:        $input-border-color !default;\n// scss-docs-end input-group-variables\n\n// scss-docs-start form-select-variables\n$form-select-padding-y:             $input-padding-y !default;\n$form-select-padding-x:             $input-padding-x !default;\n$form-select-font-family:           $input-font-family !default;\n$form-select-font-size:             $input-font-size !default;\n$form-select-indicator-padding:     $form-select-padding-x * 3 !default; // Extra padding for background-image\n$form-select-font-weight:           $input-font-weight !default;\n$form-select-line-height:           $input-line-height !default;\n$form-select-color:                 $input-color !default;\n$form-select-bg:                    $input-bg !default;\n$form-select-disabled-color:        null !default;\n$form-select-disabled-bg:           $input-disabled-bg !default;\n$form-select-disabled-border-color: $input-disabled-border-color !default;\n$form-select-bg-position:           right $form-select-padding-x center !default;\n$form-select-bg-size:               16px 12px !default; // In pixels because image dimensions\n$form-select-indicator-color:       $gray-800 !default;\n$form-select-indicator:             url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'><path fill='none' stroke='#{$form-select-indicator-color}' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='m2 5 6 6 6-6'/></svg>\") !default;\n\n$form-select-feedback-icon-padding-end: $form-select-padding-x * 2.5 + $form-select-indicator-padding !default;\n$form-select-feedback-icon-position:    center right $form-select-indicator-padding !default;\n$form-select-feedback-icon-size:        $input-height-inner-half $input-height-inner-half !default;\n\n$form-select-border-width:        $input-border-width !default;\n$form-select-border-color:        $input-border-color !default;\n$form-select-border-radius:       $input-border-radius !default;\n$form-select-box-shadow:          var(--#{$prefix}box-shadow-inset) !default;\n\n$form-select-focus-border-color:  $input-focus-border-color !default;\n$form-select-focus-width:         $input-focus-width !default;\n$form-select-focus-box-shadow:    0 0 0 $form-select-focus-width $input-btn-focus-color !default;\n\n$form-select-padding-y-sm:        $input-padding-y-sm !default;\n$form-select-padding-x-sm:        $input-padding-x-sm !default;\n$form-select-font-size-sm:        $input-font-size-sm !default;\n$form-select-border-radius-sm:    $input-border-radius-sm !default;\n\n$form-select-padding-y-lg:        $input-padding-y-lg !default;\n$form-select-padding-x-lg:        $input-padding-x-lg !default;\n$form-select-font-size-lg:        $input-font-size-lg !default;\n$form-select-border-radius-lg:    $input-border-radius-lg !default;\n\n$form-select-transition:          $input-transition !default;\n// scss-docs-end form-select-variables\n\n// scss-docs-start form-range-variables\n$form-range-track-width:          100% !default;\n$form-range-track-height:         .5rem !default;\n$form-range-track-cursor:         pointer !default;\n$form-range-track-bg:             var(--#{$prefix}secondary-bg) !default;\n$form-range-track-border-radius:  1rem !default;\n$form-range-track-box-shadow:     var(--#{$prefix}box-shadow-inset) !default;\n\n$form-range-thumb-width:                   1rem !default;\n$form-range-thumb-height:                  $form-range-thumb-width !default;\n$form-range-thumb-bg:                      $component-active-bg !default;\n$form-range-thumb-border:                  0 !default;\n$form-range-thumb-border-radius:           1rem !default;\n$form-range-thumb-box-shadow:              0 .1rem .25rem rgba($black, .1) !default;\n$form-range-thumb-focus-box-shadow:        0 0 0 1px $body-bg, $input-focus-box-shadow !default;\n$form-range-thumb-focus-box-shadow-width:  $input-focus-width !default; // For focus box shadow issue in Edge\n$form-range-thumb-active-bg:               tint-color($component-active-bg, 70%) !default;\n$form-range-thumb-disabled-bg:             var(--#{$prefix}secondary-color) !default;\n$form-range-thumb-transition:              background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n// scss-docs-end form-range-variables\n\n// scss-docs-start form-file-variables\n$form-file-button-color:          $input-color !default;\n$form-file-button-bg:             var(--#{$prefix}tertiary-bg) !default;\n$form-file-button-hover-bg:       var(--#{$prefix}secondary-bg) !default;\n// scss-docs-end form-file-variables\n\n// scss-docs-start form-floating-variables\n$form-floating-height:                  add(3.5rem, $input-height-border) !default;\n$form-floating-line-height:             1.25 !default;\n$form-floating-padding-x:               $input-padding-x !default;\n$form-floating-padding-y:               1rem !default;\n$form-floating-input-padding-t:         1.625rem !default;\n$form-floating-input-padding-b:         .625rem !default;\n$form-floating-label-height:            1.5em !default;\n$form-floating-label-opacity:           .65 !default;\n$form-floating-label-transform:         scale(.85) translateY(-.5rem) translateX(.15rem) !default;\n$form-floating-label-disabled-color:    $gray-600 !default;\n$form-floating-transition:              opacity .1s ease-in-out, transform .1s ease-in-out !default;\n// scss-docs-end form-floating-variables\n\n// Form validation\n\n// scss-docs-start form-feedback-variables\n$form-feedback-margin-top:          $form-text-margin-top !default;\n$form-feedback-font-size:           $form-text-font-size !default;\n$form-feedback-font-style:          $form-text-font-style !default;\n$form-feedback-valid-color:         $success !default;\n$form-feedback-invalid-color:       $danger !default;\n\n$form-feedback-icon-valid-color:    $form-feedback-valid-color !default;\n$form-feedback-icon-valid:          url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'><path fill='#{$form-feedback-icon-valid-color}' d='M2.3 6.73.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/></svg>\") !default;\n$form-feedback-icon-invalid-color:  $form-feedback-invalid-color !default;\n$form-feedback-icon-invalid:        url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='#{$form-feedback-icon-invalid-color}'><circle cx='6' cy='6' r='4.5'/><path stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/><circle cx='6' cy='8.2' r='.6' fill='#{$form-feedback-icon-invalid-color}' stroke='none'/></svg>\") !default;\n// scss-docs-end form-feedback-variables\n\n// scss-docs-start form-validation-colors\n$form-valid-color:                  $form-feedback-valid-color !default;\n$form-valid-border-color:           $form-feedback-valid-color !default;\n$form-invalid-color:                $form-feedback-invalid-color !default;\n$form-invalid-border-color:         $form-feedback-invalid-color !default;\n// scss-docs-end form-validation-colors\n\n// scss-docs-start form-validation-states\n$form-validation-states: (\n  \"valid\": (\n    \"color\": var(--#{$prefix}form-valid-color),\n    \"icon\": $form-feedback-icon-valid,\n    \"tooltip-color\": #fff,\n    \"tooltip-bg-color\": var(--#{$prefix}success),\n    \"focus-box-shadow\": 0 0 $input-btn-focus-blur $input-focus-width rgba(var(--#{$prefix}success-rgb), $input-btn-focus-color-opacity),\n    \"border-color\": var(--#{$prefix}form-valid-border-color),\n  ),\n  \"invalid\": (\n    \"color\": var(--#{$prefix}form-invalid-color),\n    \"icon\": $form-feedback-icon-invalid,\n    \"tooltip-color\": #fff,\n    \"tooltip-bg-color\": var(--#{$prefix}danger),\n    \"focus-box-shadow\": 0 0 $input-btn-focus-blur $input-focus-width rgba(var(--#{$prefix}danger-rgb), $input-btn-focus-color-opacity),\n    \"border-color\": var(--#{$prefix}form-invalid-border-color),\n  )\n) !default;\n// scss-docs-end form-validation-states\n\n// Z-index master list\n//\n// Warning: Avoid customizing these values. They're used for a bird's eye view\n// of components dependent on the z-axis and are designed to all work together.\n\n// scss-docs-start zindex-stack\n$zindex-dropdown:                   1000 !default;\n$zindex-sticky:                     1020 !default;\n$zindex-fixed:                      1030 !default;\n$zindex-offcanvas-backdrop:         1040 !default;\n$zindex-offcanvas:                  1045 !default;\n$zindex-modal-backdrop:             1050 !default;\n$zindex-modal:                      1055 !default;\n$zindex-popover:                    1070 !default;\n$zindex-tooltip:                    1080 !default;\n$zindex-toast:                      1090 !default;\n// scss-docs-end zindex-stack\n\n// scss-docs-start zindex-levels-map\n$zindex-levels: (\n  n1: -1,\n  0: 0,\n  1: 1,\n  2: 2,\n  3: 3\n) !default;\n// scss-docs-end zindex-levels-map\n\n\n// Navs\n\n// scss-docs-start nav-variables\n$nav-link-padding-y:                .5rem !default;\n$nav-link-padding-x:                1rem !default;\n$nav-link-font-size:                null !default;\n$nav-link-font-weight:              null !default;\n$nav-link-color:                    var(--#{$prefix}link-color) !default;\n$nav-link-hover-color:              var(--#{$prefix}link-hover-color) !default;\n$nav-link-transition:               color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out !default;\n$nav-link-disabled-color:           var(--#{$prefix}secondary-color) !default;\n$nav-link-focus-box-shadow:         $focus-ring-box-shadow !default;\n\n$nav-tabs-border-color:             var(--#{$prefix}border-color) !default;\n$nav-tabs-border-width:             var(--#{$prefix}border-width) !default;\n$nav-tabs-border-radius:            var(--#{$prefix}border-radius) !default;\n$nav-tabs-link-hover-border-color:  var(--#{$prefix}secondary-bg) var(--#{$prefix}secondary-bg) $nav-tabs-border-color !default;\n$nav-tabs-link-active-color:        var(--#{$prefix}emphasis-color) !default;\n$nav-tabs-link-active-bg:           var(--#{$prefix}body-bg) !default;\n$nav-tabs-link-active-border-color: var(--#{$prefix}border-color) var(--#{$prefix}border-color) $nav-tabs-link-active-bg !default;\n\n$nav-pills-border-radius:           var(--#{$prefix}border-radius) !default;\n$nav-pills-link-active-color:       $component-active-color !default;\n$nav-pills-link-active-bg:          $component-active-bg !default;\n\n$nav-underline-gap:                 1rem !default;\n$nav-underline-border-width:        .125rem !default;\n$nav-underline-link-active-color:   var(--#{$prefix}emphasis-color) !default;\n// scss-docs-end nav-variables\n\n\n// Navbar\n\n// scss-docs-start navbar-variables\n$navbar-padding-y:                  $spacer * .5 !default;\n$navbar-padding-x:                  null !default;\n\n$navbar-nav-link-padding-x:         .5rem !default;\n\n$navbar-brand-font-size:            $font-size-lg !default;\n// Compute the navbar-brand padding-y so the navbar-brand will have the same height as navbar-text and nav-link\n$nav-link-height:                   $font-size-base * $line-height-base + $nav-link-padding-y * 2 !default;\n$navbar-brand-height:               $navbar-brand-font-size * $line-height-base !default;\n$navbar-brand-padding-y:            ($nav-link-height - $navbar-brand-height) * .5 !default;\n$navbar-brand-margin-end:           1rem !default;\n\n$navbar-toggler-padding-y:          .25rem !default;\n$navbar-toggler-padding-x:          .75rem !default;\n$navbar-toggler-font-size:          $font-size-lg !default;\n$navbar-toggler-border-radius:      $btn-border-radius !default;\n$navbar-toggler-focus-width:        $btn-focus-width !default;\n$navbar-toggler-transition:         box-shadow .15s ease-in-out !default;\n\n$navbar-light-color:                rgba(var(--#{$prefix}emphasis-color-rgb), .65) !default;\n$navbar-light-hover-color:          rgba(var(--#{$prefix}emphasis-color-rgb), .8) !default;\n$navbar-light-active-color:         rgba(var(--#{$prefix}emphasis-color-rgb), 1) !default;\n$navbar-light-disabled-color:       rgba(var(--#{$prefix}emphasis-color-rgb), .3) !default;\n$navbar-light-icon-color:           rgba($body-color, .75) !default;\n$navbar-light-toggler-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'><path stroke='#{$navbar-light-icon-color}' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/></svg>\") !default;\n$navbar-light-toggler-border-color: rgba(var(--#{$prefix}emphasis-color-rgb), .15) !default;\n$navbar-light-brand-color:          $navbar-light-active-color !default;\n$navbar-light-brand-hover-color:    $navbar-light-active-color !default;\n// scss-docs-end navbar-variables\n\n// scss-docs-start navbar-dark-variables\n$navbar-dark-color:                 rgba($white, .55) !default;\n$navbar-dark-hover-color:           rgba($white, .75) !default;\n$navbar-dark-active-color:          $white !default;\n$navbar-dark-disabled-color:        rgba($white, .25) !default;\n$navbar-dark-icon-color:            $navbar-dark-color !default;\n$navbar-dark-toggler-icon-bg:       url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'><path stroke='#{$navbar-dark-icon-color}' stroke-linecap='round' stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/></svg>\") !default;\n$navbar-dark-toggler-border-color:  rgba($white, .1) !default;\n$navbar-dark-brand-color:           $navbar-dark-active-color !default;\n$navbar-dark-brand-hover-color:     $navbar-dark-active-color !default;\n// scss-docs-end navbar-dark-variables\n\n\n// Dropdowns\n//\n// Dropdown menu container and contents.\n\n// scss-docs-start dropdown-variables\n$dropdown-min-width:                10rem !default;\n$dropdown-padding-x:                0 !default;\n$dropdown-padding-y:                .5rem !default;\n$dropdown-spacer:                   .125rem !default;\n$dropdown-font-size:                $font-size-base !default;\n$dropdown-color:                    var(--#{$prefix}body-color) !default;\n$dropdown-bg:                       var(--#{$prefix}body-bg) !default;\n$dropdown-border-color:             var(--#{$prefix}border-color-translucent) !default;\n$dropdown-border-radius:            var(--#{$prefix}border-radius) !default;\n$dropdown-border-width:             var(--#{$prefix}border-width) !default;\n$dropdown-inner-border-radius:      calc(#{$dropdown-border-radius} - #{$dropdown-border-width}) !default; // stylelint-disable-line function-disallowed-list\n$dropdown-divider-bg:               $dropdown-border-color !default;\n$dropdown-divider-margin-y:         $spacer * .5 !default;\n$dropdown-box-shadow:               var(--#{$prefix}box-shadow) !default;\n\n$dropdown-link-color:               var(--#{$prefix}body-color) !default;\n$dropdown-link-hover-color:         $dropdown-link-color !default;\n$dropdown-link-hover-bg:            var(--#{$prefix}tertiary-bg) !default;\n\n$dropdown-link-active-color:        $component-active-color !default;\n$dropdown-link-active-bg:           $component-active-bg !default;\n\n$dropdown-link-disabled-color:      var(--#{$prefix}tertiary-color) !default;\n\n$dropdown-item-padding-y:           $spacer * .25 !default;\n$dropdown-item-padding-x:           $spacer !default;\n\n$dropdown-header-color:             $gray-600 !default;\n$dropdown-header-padding-x:         $dropdown-item-padding-x !default;\n$dropdown-header-padding-y:         $dropdown-padding-y !default;\n// fusv-disable\n$dropdown-header-padding:           $dropdown-header-padding-y $dropdown-header-padding-x !default; // Deprecated in v5.2.0\n// fusv-enable\n// scss-docs-end dropdown-variables\n\n// scss-docs-start dropdown-dark-variables\n$dropdown-dark-color:               $gray-300 !default;\n$dropdown-dark-bg:                  $gray-800 !default;\n$dropdown-dark-border-color:        $dropdown-border-color !default;\n$dropdown-dark-divider-bg:          $dropdown-divider-bg !default;\n$dropdown-dark-box-shadow:          null !default;\n$dropdown-dark-link-color:          $dropdown-dark-color !default;\n$dropdown-dark-link-hover-color:    $white !default;\n$dropdown-dark-link-hover-bg:       rgba($white, .15) !default;\n$dropdown-dark-link-active-color:   $dropdown-link-active-color !default;\n$dropdown-dark-link-active-bg:      $dropdown-link-active-bg !default;\n$dropdown-dark-link-disabled-color: $gray-500 !default;\n$dropdown-dark-header-color:        $gray-500 !default;\n// scss-docs-end dropdown-dark-variables\n\n\n// Pagination\n\n// scss-docs-start pagination-variables\n$pagination-padding-y:              .375rem !default;\n$pagination-padding-x:              .75rem !default;\n$pagination-padding-y-sm:           .25rem !default;\n$pagination-padding-x-sm:           .5rem !default;\n$pagination-padding-y-lg:           .75rem !default;\n$pagination-padding-x-lg:           1.5rem !default;\n\n$pagination-font-size:              $font-size-base !default;\n\n$pagination-color:                  var(--#{$prefix}link-color) !default;\n$pagination-bg:                     var(--#{$prefix}body-bg) !default;\n$pagination-border-radius:          var(--#{$prefix}border-radius) !default;\n$pagination-border-width:           var(--#{$prefix}border-width) !default;\n$pagination-margin-start:           calc(#{$pagination-border-width} * -1) !default; // stylelint-disable-line function-disallowed-list\n$pagination-border-color:           var(--#{$prefix}border-color) !default;\n\n$pagination-focus-color:            var(--#{$prefix}link-hover-color) !default;\n$pagination-focus-bg:               var(--#{$prefix}secondary-bg) !default;\n$pagination-focus-box-shadow:       $focus-ring-box-shadow !default;\n$pagination-focus-outline:          0 !default;\n\n$pagination-hover-color:            var(--#{$prefix}link-hover-color) !default;\n$pagination-hover-bg:               var(--#{$prefix}tertiary-bg) !default;\n$pagination-hover-border-color:     var(--#{$prefix}border-color) !default; // Todo in v6: remove this?\n\n$pagination-active-color:           $component-active-color !default;\n$pagination-active-bg:              $component-active-bg !default;\n$pagination-active-border-color:    $component-active-bg !default;\n\n$pagination-disabled-color:         var(--#{$prefix}secondary-color) !default;\n$pagination-disabled-bg:            var(--#{$prefix}secondary-bg) !default;\n$pagination-disabled-border-color:  var(--#{$prefix}border-color) !default;\n\n$pagination-transition:              color .15s ease-in-out, background-color .15s ease-in-out, border-color .15s ease-in-out, box-shadow .15s ease-in-out !default;\n\n$pagination-border-radius-sm:       var(--#{$prefix}border-radius-sm) !default;\n$pagination-border-radius-lg:       var(--#{$prefix}border-radius-lg) !default;\n// scss-docs-end pagination-variables\n\n\n// Placeholders\n\n// scss-docs-start placeholders\n$placeholder-opacity-max:           .5 !default;\n$placeholder-opacity-min:           .2 !default;\n// scss-docs-end placeholders\n\n// Cards\n\n// scss-docs-start card-variables\n$card-spacer-y:                     $spacer !default;\n$card-spacer-x:                     $spacer !default;\n$card-title-spacer-y:               $spacer * .5 !default;\n$card-title-color:                  null !default;\n$card-subtitle-color:               null !default;\n$card-border-width:                 var(--#{$prefix}border-width) !default;\n$card-border-color:                 var(--#{$prefix}border-color-translucent) !default;\n$card-border-radius:                var(--#{$prefix}border-radius) !default;\n$card-box-shadow:                   null !default;\n$card-inner-border-radius:          subtract($card-border-radius, $card-border-width) !default;\n$card-cap-padding-y:                $card-spacer-y * .5 !default;\n$card-cap-padding-x:                $card-spacer-x !default;\n$card-cap-bg:                       rgba(var(--#{$prefix}body-color-rgb), .03) !default;\n$card-cap-color:                    null !default;\n$card-height:                       null !default;\n$card-color:                        null !default;\n$card-bg:                           var(--#{$prefix}body-bg) !default;\n$card-img-overlay-padding:          $spacer !default;\n$card-group-margin:                 $grid-gutter-width * .5 !default;\n// scss-docs-end card-variables\n\n// Accordion\n\n// scss-docs-start accordion-variables\n$accordion-padding-y:                     1rem !default;\n$accordion-padding-x:                     1.25rem !default;\n$accordion-color:                         var(--#{$prefix}body-color) !default;\n$accordion-bg:                            var(--#{$prefix}body-bg) !default;\n$accordion-border-width:                  var(--#{$prefix}border-width) !default;\n$accordion-border-color:                  var(--#{$prefix}border-color) !default;\n$accordion-border-radius:                 var(--#{$prefix}border-radius) !default;\n$accordion-inner-border-radius:           subtract($accordion-border-radius, $accordion-border-width) !default;\n\n$accordion-body-padding-y:                $accordion-padding-y !default;\n$accordion-body-padding-x:                $accordion-padding-x !default;\n\n$accordion-button-padding-y:              $accordion-padding-y !default;\n$accordion-button-padding-x:              $accordion-padding-x !default;\n$accordion-button-color:                  var(--#{$prefix}body-color) !default;\n$accordion-button-bg:                     var(--#{$prefix}accordion-bg) !default;\n$accordion-transition:                    $btn-transition, border-radius .15s ease !default;\n$accordion-button-active-bg:              var(--#{$prefix}primary-bg-subtle) !default;\n$accordion-button-active-color:           var(--#{$prefix}primary-text-emphasis) !default;\n\n$accordion-button-focus-border-color:     $input-focus-border-color !default;\n$accordion-button-focus-box-shadow:       $btn-focus-box-shadow !default;\n\n$accordion-icon-width:                    1.25rem !default;\n$accordion-icon-color:                    $body-color !default;\n$accordion-icon-active-color:             $primary-text-emphasis !default;\n$accordion-icon-transition:               transform .2s ease-in-out !default;\n$accordion-icon-transform:                rotate(-180deg) !default;\n\n$accordion-button-icon:         url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$accordion-icon-color}'><path fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n$accordion-button-active-icon:  url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$accordion-icon-active-color}'><path fill-rule='evenodd' d='M1.646 4.646a.5.5 0 0 1 .708 0L8 10.293l5.646-5.647a.5.5 0 0 1 .708.708l-6 6a.5.5 0 0 1-.708 0l-6-6a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n// scss-docs-end accordion-variables\n\n// Tooltips\n\n// scss-docs-start tooltip-variables\n$tooltip-font-size:                 $font-size-sm !default;\n$tooltip-max-width:                 200px !default;\n$tooltip-color:                     var(--#{$prefix}body-bg) !default;\n$tooltip-bg:                        var(--#{$prefix}emphasis-color) !default;\n$tooltip-border-radius:             var(--#{$prefix}border-radius) !default;\n$tooltip-opacity:                   .9 !default;\n$tooltip-padding-y:                 $spacer * .25 !default;\n$tooltip-padding-x:                 $spacer * .5 !default;\n$tooltip-margin:                    null !default; // TODO: remove this in v6\n\n$tooltip-arrow-width:               .8rem !default;\n$tooltip-arrow-height:              .4rem !default;\n// fusv-disable\n$tooltip-arrow-color:               null !default; // Deprecated in Bootstrap 5.2.0 for CSS variables\n// fusv-enable\n// scss-docs-end tooltip-variables\n\n// Form tooltips must come after regular tooltips\n// scss-docs-start tooltip-feedback-variables\n$form-feedback-tooltip-padding-y:     $tooltip-padding-y !default;\n$form-feedback-tooltip-padding-x:     $tooltip-padding-x !default;\n$form-feedback-tooltip-font-size:     $tooltip-font-size !default;\n$form-feedback-tooltip-line-height:   null !default;\n$form-feedback-tooltip-opacity:       $tooltip-opacity !default;\n$form-feedback-tooltip-border-radius: $tooltip-border-radius !default;\n// scss-docs-end tooltip-feedback-variables\n\n\n// Popovers\n\n// scss-docs-start popover-variables\n$popover-font-size:                 $font-size-sm !default;\n$popover-bg:                        var(--#{$prefix}body-bg) !default;\n$popover-max-width:                 276px !default;\n$popover-border-width:              var(--#{$prefix}border-width) !default;\n$popover-border-color:              var(--#{$prefix}border-color-translucent) !default;\n$popover-border-radius:             var(--#{$prefix}border-radius-lg) !default;\n$popover-inner-border-radius:       calc(#{$popover-border-radius} - #{$popover-border-width}) !default; // stylelint-disable-line function-disallowed-list\n$popover-box-shadow:                var(--#{$prefix}box-shadow) !default;\n\n$popover-header-font-size:          $font-size-base !default;\n$popover-header-bg:                 var(--#{$prefix}secondary-bg) !default;\n$popover-header-color:              $headings-color !default;\n$popover-header-padding-y:          .5rem !default;\n$popover-header-padding-x:          $spacer !default;\n\n$popover-body-color:                var(--#{$prefix}body-color) !default;\n$popover-body-padding-y:            $spacer !default;\n$popover-body-padding-x:            $spacer !default;\n\n$popover-arrow-width:               1rem !default;\n$popover-arrow-height:              .5rem !default;\n// scss-docs-end popover-variables\n\n// fusv-disable\n// Deprecated in Bootstrap 5.2.0 for CSS variables\n$popover-arrow-color:               $popover-bg !default;\n$popover-arrow-outer-color:         var(--#{$prefix}border-color-translucent) !default;\n// fusv-enable\n\n\n// Toasts\n\n// scss-docs-start toast-variables\n$toast-max-width:                   350px !default;\n$toast-padding-x:                   .75rem !default;\n$toast-padding-y:                   .5rem !default;\n$toast-font-size:                   .875rem !default;\n$toast-color:                       null !default;\n$toast-background-color:            rgba(var(--#{$prefix}body-bg-rgb), .85) !default;\n$toast-border-width:                var(--#{$prefix}border-width) !default;\n$toast-border-color:                var(--#{$prefix}border-color-translucent) !default;\n$toast-border-radius:               var(--#{$prefix}border-radius) !default;\n$toast-box-shadow:                  var(--#{$prefix}box-shadow) !default;\n$toast-spacing:                     $container-padding-x !default;\n\n$toast-header-color:                var(--#{$prefix}secondary-color) !default;\n$toast-header-background-color:     rgba(var(--#{$prefix}body-bg-rgb), .85) !default;\n$toast-header-border-color:         $toast-border-color !default;\n// scss-docs-end toast-variables\n\n\n// Badges\n\n// scss-docs-start badge-variables\n$badge-font-size:                   .75em !default;\n$badge-font-weight:                 $font-weight-bold !default;\n$badge-color:                       $white !default;\n$badge-padding-y:                   .35em !default;\n$badge-padding-x:                   .65em !default;\n$badge-border-radius:               var(--#{$prefix}border-radius) !default;\n// scss-docs-end badge-variables\n\n\n// Modals\n\n// scss-docs-start modal-variables\n$modal-inner-padding:               $spacer !default;\n\n$modal-footer-margin-between:       .5rem !default;\n\n$modal-dialog-margin:               .5rem !default;\n$modal-dialog-margin-y-sm-up:       1.75rem !default;\n\n$modal-title-line-height:           $line-height-base !default;\n\n$modal-content-color:               null !default;\n$modal-content-bg:                  var(--#{$prefix}body-bg) !default;\n$modal-content-border-color:        var(--#{$prefix}border-color-translucent) !default;\n$modal-content-border-width:        var(--#{$prefix}border-width) !default;\n$modal-content-border-radius:       var(--#{$prefix}border-radius-lg) !default;\n$modal-content-inner-border-radius: subtract($modal-content-border-radius, $modal-content-border-width) !default;\n$modal-content-box-shadow-xs:       var(--#{$prefix}box-shadow-sm) !default;\n$modal-content-box-shadow-sm-up:    var(--#{$prefix}box-shadow) !default;\n\n$modal-backdrop-bg:                 $black !default;\n$modal-backdrop-opacity:            .5 !default;\n\n$modal-header-border-color:         var(--#{$prefix}border-color) !default;\n$modal-header-border-width:         $modal-content-border-width !default;\n$modal-header-padding-y:            $modal-inner-padding !default;\n$modal-header-padding-x:            $modal-inner-padding !default;\n$modal-header-padding:              $modal-header-padding-y $modal-header-padding-x !default; // Keep this for backwards compatibility\n\n$modal-footer-bg:                   null !default;\n$modal-footer-border-color:         $modal-header-border-color !default;\n$modal-footer-border-width:         $modal-header-border-width !default;\n\n$modal-sm:                          300px !default;\n$modal-md:                          500px !default;\n$modal-lg:                          800px !default;\n$modal-xl:                          1140px !default;\n\n$modal-fade-transform:              translate(0, -50px) !default;\n$modal-show-transform:              none !default;\n$modal-transition:                  transform .3s ease-out !default;\n$modal-scale-transform:             scale(1.02) !default;\n// scss-docs-end modal-variables\n\n\n// Alerts\n//\n// Define alert colors, border radius, and padding.\n\n// scss-docs-start alert-variables\n$alert-padding-y:               $spacer !default;\n$alert-padding-x:               $spacer !default;\n$alert-margin-bottom:           1rem !default;\n$alert-border-radius:           var(--#{$prefix}border-radius) !default;\n$alert-link-font-weight:        $font-weight-bold !default;\n$alert-border-width:            var(--#{$prefix}border-width) !default;\n$alert-dismissible-padding-r:   $alert-padding-x * 3 !default; // 3x covers width of x plus default padding on either side\n// scss-docs-end alert-variables\n\n// fusv-disable\n$alert-bg-scale:                -80% !default; // Deprecated in v5.2.0, to be removed in v6\n$alert-border-scale:            -70% !default; // Deprecated in v5.2.0, to be removed in v6\n$alert-color-scale:             40% !default; // Deprecated in v5.2.0, to be removed in v6\n// fusv-enable\n\n// Progress bars\n\n// scss-docs-start progress-variables\n$progress-height:                   1rem !default;\n$progress-font-size:                $font-size-base * .75 !default;\n$progress-bg:                       var(--#{$prefix}secondary-bg) !default;\n$progress-border-radius:            var(--#{$prefix}border-radius) !default;\n$progress-box-shadow:               var(--#{$prefix}box-shadow-inset) !default;\n$progress-bar-color:                $white !default;\n$progress-bar-bg:                   $primary !default;\n$progress-bar-animation-timing:     1s linear infinite !default;\n$progress-bar-transition:           width .6s ease !default;\n// scss-docs-end progress-variables\n\n\n// List group\n\n// scss-docs-start list-group-variables\n$list-group-color:                  var(--#{$prefix}body-color) !default;\n$list-group-bg:                     var(--#{$prefix}body-bg) !default;\n$list-group-border-color:           var(--#{$prefix}border-color) !default;\n$list-group-border-width:           var(--#{$prefix}border-width) !default;\n$list-group-border-radius:          var(--#{$prefix}border-radius) !default;\n\n$list-group-item-padding-y:         $spacer * .5 !default;\n$list-group-item-padding-x:         $spacer !default;\n// fusv-disable\n$list-group-item-bg-scale:          -80% !default; // Deprecated in v5.3.0\n$list-group-item-color-scale:       40% !default; // Deprecated in v5.3.0\n// fusv-enable\n\n$list-group-hover-bg:               var(--#{$prefix}tertiary-bg) !default;\n$list-group-active-color:           $component-active-color !default;\n$list-group-active-bg:              $component-active-bg !default;\n$list-group-active-border-color:    $list-group-active-bg !default;\n\n$list-group-disabled-color:         var(--#{$prefix}secondary-color) !default;\n$list-group-disabled-bg:            $list-group-bg !default;\n\n$list-group-action-color:           var(--#{$prefix}secondary-color) !default;\n$list-group-action-hover-color:     var(--#{$prefix}emphasis-color) !default;\n\n$list-group-action-active-color:    var(--#{$prefix}body-color) !default;\n$list-group-action-active-bg:       var(--#{$prefix}secondary-bg) !default;\n// scss-docs-end list-group-variables\n\n\n// Image thumbnails\n\n// scss-docs-start thumbnail-variables\n$thumbnail-padding:                 .25rem !default;\n$thumbnail-bg:                      var(--#{$prefix}body-bg) !default;\n$thumbnail-border-width:            var(--#{$prefix}border-width) !default;\n$thumbnail-border-color:            var(--#{$prefix}border-color) !default;\n$thumbnail-border-radius:           var(--#{$prefix}border-radius) !default;\n$thumbnail-box-shadow:              var(--#{$prefix}box-shadow-sm) !default;\n// scss-docs-end thumbnail-variables\n\n\n// Figures\n\n// scss-docs-start figure-variables\n$figure-caption-font-size:          $small-font-size !default;\n$figure-caption-color:              var(--#{$prefix}secondary-color) !default;\n// scss-docs-end figure-variables\n\n\n// Breadcrumbs\n\n// scss-docs-start breadcrumb-variables\n$breadcrumb-font-size:              null !default;\n$breadcrumb-padding-y:              0 !default;\n$breadcrumb-padding-x:              0 !default;\n$breadcrumb-item-padding-x:         .5rem !default;\n$breadcrumb-margin-bottom:          1rem !default;\n$breadcrumb-bg:                     null !default;\n$breadcrumb-divider-color:          var(--#{$prefix}secondary-color) !default;\n$breadcrumb-active-color:           var(--#{$prefix}secondary-color) !default;\n$breadcrumb-divider:                quote(\"/\") !default;\n$breadcrumb-divider-flipped:        $breadcrumb-divider !default;\n$breadcrumb-border-radius:          null !default;\n// scss-docs-end breadcrumb-variables\n\n// Carousel\n\n// scss-docs-start carousel-variables\n$carousel-control-color:             $white !default;\n$carousel-control-width:             15% !default;\n$carousel-control-opacity:           .5 !default;\n$carousel-control-hover-opacity:     .9 !default;\n$carousel-control-transition:        opacity .15s ease !default;\n\n$carousel-indicator-width:           30px !default;\n$carousel-indicator-height:          3px !default;\n$carousel-indicator-hit-area-height: 10px !default;\n$carousel-indicator-spacer:          3px !default;\n$carousel-indicator-opacity:         .5 !default;\n$carousel-indicator-active-bg:       $white !default;\n$carousel-indicator-active-opacity:  1 !default;\n$carousel-indicator-transition:      opacity .6s ease !default;\n\n$carousel-caption-width:             70% !default;\n$carousel-caption-color:             $white !default;\n$carousel-caption-padding-y:         1.25rem !default;\n$carousel-caption-spacer:            1.25rem !default;\n\n$carousel-control-icon-width:        2rem !default;\n\n$carousel-control-prev-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$carousel-control-color}'><path d='M11.354 1.646a.5.5 0 0 1 0 .708L5.707 8l5.647 5.646a.5.5 0 0 1-.708.708l-6-6a.5.5 0 0 1 0-.708l6-6a.5.5 0 0 1 .708 0z'/></svg>\") !default;\n$carousel-control-next-icon-bg:      url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$carousel-control-color}'><path d='M4.646 1.646a.5.5 0 0 1 .708 0l6 6a.5.5 0 0 1 0 .708l-6 6a.5.5 0 0 1-.708-.708L10.293 8 4.646 2.354a.5.5 0 0 1 0-.708z'/></svg>\") !default;\n\n$carousel-transition-duration:       .6s !default;\n$carousel-transition:                transform $carousel-transition-duration ease-in-out !default; // Define transform transition first if using multiple transitions (e.g., `transform 2s ease, opacity .5s ease-out`)\n// scss-docs-end carousel-variables\n\n// scss-docs-start carousel-dark-variables\n$carousel-dark-indicator-active-bg:  $black !default;\n$carousel-dark-caption-color:        $black !default;\n$carousel-dark-control-icon-filter:  invert(1) grayscale(100) !default;\n// scss-docs-end carousel-dark-variables\n\n\n// Spinners\n\n// scss-docs-start spinner-variables\n$spinner-width:           2rem !default;\n$spinner-height:          $spinner-width !default;\n$spinner-vertical-align:  -.125em !default;\n$spinner-border-width:    .25em !default;\n$spinner-animation-speed: .75s !default;\n\n$spinner-width-sm:        1rem !default;\n$spinner-height-sm:       $spinner-width-sm !default;\n$spinner-border-width-sm: .2em !default;\n// scss-docs-end spinner-variables\n\n\n// Close\n\n// scss-docs-start close-variables\n$btn-close-width:            1em !default;\n$btn-close-height:           $btn-close-width !default;\n$btn-close-padding-x:        .25em !default;\n$btn-close-padding-y:        $btn-close-padding-x !default;\n$btn-close-color:            $black !default;\n$btn-close-bg:               url(\"data:image/svg+xml,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16' fill='#{$btn-close-color}'><path d='M.293.293a1 1 0 0 1 1.414 0L8 6.586 14.293.293a1 1 0 1 1 1.414 1.414L9.414 8l6.293 6.293a1 1 0 0 1-1.414 1.414L8 9.414l-6.293 6.293a1 1 0 0 1-1.414-1.414L6.586 8 .293 1.707a1 1 0 0 1 0-1.414z'/></svg>\") !default;\n$btn-close-focus-shadow:     $focus-ring-box-shadow !default;\n$btn-close-opacity:          .5 !default;\n$btn-close-hover-opacity:    .75 !default;\n$btn-close-focus-opacity:    1 !default;\n$btn-close-disabled-opacity: .25 !default;\n$btn-close-white-filter:     invert(1) grayscale(100%) brightness(200%) !default;\n// scss-docs-end close-variables\n\n\n// Offcanvas\n\n// scss-docs-start offcanvas-variables\n$offcanvas-padding-y:               $modal-inner-padding !default;\n$offcanvas-padding-x:               $modal-inner-padding !default;\n$offcanvas-horizontal-width:        400px !default;\n$offcanvas-vertical-height:         30vh !default;\n$offcanvas-transition-duration:     .3s !default;\n$offcanvas-border-color:            $modal-content-border-color !default;\n$offcanvas-border-width:            $modal-content-border-width !default;\n$offcanvas-title-line-height:       $modal-title-line-height !default;\n$offcanvas-bg-color:                var(--#{$prefix}body-bg) !default;\n$offcanvas-color:                   var(--#{$prefix}body-color) !default;\n$offcanvas-box-shadow:              $modal-content-box-shadow-xs !default;\n$offcanvas-backdrop-bg:             $modal-backdrop-bg !default;\n$offcanvas-backdrop-opacity:        $modal-backdrop-opacity !default;\n// scss-docs-end offcanvas-variables\n\n// Code\n\n$code-font-size:                    $small-font-size !default;\n$code-color:                        $pink !default;\n\n$kbd-padding-y:                     .1875rem !default;\n$kbd-padding-x:                     .375rem !default;\n$kbd-font-size:                     $code-font-size !default;\n$kbd-color:                         var(--#{$prefix}body-bg) !default;\n$kbd-bg:                            var(--#{$prefix}body-color) !default;\n$nested-kbd-font-weight:            null !default; // Deprecated in v5.2.0, removing in v6\n\n$pre-color:                         null !default;\n","/***\n * Rules for the UX/UI of skip navigation link btn. \n *It's only visible to people\n * navigating with keyboard for accessibility purposes\n * ref: https://www.youtube.com/watch?v=VUR0I5mqq7I\n ***/\n\n.skip-link {\n  position: fixed;\n  top: 0;\n  left: 0;\n  right: 0;\n  text-align: center;\n  background-color: var(--pst-color-warning);\n  // Ensure we are using a WCAG conformant colour\n  color: var(--pst-color-warning-text) !important;\n  padding: 0.5rem;\n  z-index: $zindex-modal;\n  border-bottom: 1px solid var(--pst-color-border);\n\n  // This shows / hides the button\n  transform: translateY(-100%);\n  transition: transform 150ms ease-in-out;\n  &:focus {\n    transform: translateY(0%);\n    // ensure this is visible\n    outline: 3px solid $foundation-black;\n  }\n}\n",".bd-container {\n  flex-grow: 1;\n  display: flex;\n  justify-content: center;\n\n  .bd-container__inner {\n    display: flex;\n  }\n}\n\n.bd-page-width {\n  width: 100%;\n  @include media-breakpoint-up(lg) {\n    max-width: $breakpoint-page-width;\n  }\n}\n","// Breakpoint viewport sizes and media queries.\n//\n// Breakpoints are defined as a map of (name: minimum width), order from small to large:\n//\n//    (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px)\n//\n// The map defined in the `$grid-breakpoints` global variable is used as the `$breakpoints` argument by default.\n\n// Name of the next breakpoint, or null for the last breakpoint.\n//\n//    >> breakpoint-next(sm)\n//    md\n//    >> breakpoint-next(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    md\n//    >> breakpoint-next(sm, $breakpoint-names: (xs sm md lg xl xxl))\n//    md\n@function breakpoint-next($name, $breakpoints: $grid-breakpoints, $breakpoint-names: map-keys($breakpoints)) {\n  $n: index($breakpoint-names, $name);\n  @if not $n {\n    @error \"breakpoint `#{$name}` not found in `#{$breakpoints}`\";\n  }\n  @return if($n < length($breakpoint-names), nth($breakpoint-names, $n + 1), null);\n}\n\n// Minimum breakpoint width. Null for the smallest (first) breakpoint.\n//\n//    >> breakpoint-min(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    576px\n@function breakpoint-min($name, $breakpoints: $grid-breakpoints) {\n  $min: map-get($breakpoints, $name);\n  @return if($min != 0, $min, null);\n}\n\n// Maximum breakpoint width.\n// The maximum value is reduced by 0.02px to work around the limitations of\n// `min-` and `max-` prefixes and viewports with fractional widths.\n// See https://www.w3.org/TR/mediaqueries-4/#mq-min-max\n// Uses 0.02px rather than 0.01px to work around a current rounding bug in Safari.\n// See https://bugs.webkit.org/show_bug.cgi?id=178261\n//\n//    >> breakpoint-max(md, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    767.98px\n@function breakpoint-max($name, $breakpoints: $grid-breakpoints) {\n  $max: map-get($breakpoints, $name);\n  @return if($max and $max > 0, $max - .02, null);\n}\n\n// Returns a blank string if smallest breakpoint, otherwise returns the name with a dash in front.\n// Useful for making responsive utilities.\n//\n//    >> breakpoint-infix(xs, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    \"\"  (Returns a blank string)\n//    >> breakpoint-infix(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n//    \"-sm\"\n@function breakpoint-infix($name, $breakpoints: $grid-breakpoints) {\n  @return if(breakpoint-min($name, $breakpoints) == null, \"\", \"-#{$name}\");\n}\n\n// Media of at least the minimum breakpoint width. No query for the smallest breakpoint.\n// Makes the @content apply to the given breakpoint and wider.\n@mixin media-breakpoint-up($name, $breakpoints: $grid-breakpoints) {\n  $min: breakpoint-min($name, $breakpoints);\n  @if $min {\n    @media (min-width: $min) {\n      @content;\n    }\n  } @else {\n    @content;\n  }\n}\n\n// Media of at most the maximum breakpoint width. No query for the largest breakpoint.\n// Makes the @content apply to the given breakpoint and narrower.\n@mixin media-breakpoint-down($name, $breakpoints: $grid-breakpoints) {\n  $max: breakpoint-max($name, $breakpoints);\n  @if $max {\n    @media (max-width: $max) {\n      @content;\n    }\n  } @else {\n    @content;\n  }\n}\n\n// Media that spans multiple breakpoint widths.\n// Makes the @content apply between the min and max breakpoints\n@mixin media-breakpoint-between($lower, $upper, $breakpoints: $grid-breakpoints) {\n  $min: breakpoint-min($lower, $breakpoints);\n  $max: breakpoint-max($upper, $breakpoints);\n\n  @if $min != null and $max != null {\n    @media (min-width: $min) and (max-width: $max) {\n      @content;\n    }\n  } @else if $max == null {\n    @include media-breakpoint-up($lower, $breakpoints) {\n      @content;\n    }\n  } @else if $min == null {\n    @include media-breakpoint-down($upper, $breakpoints) {\n      @content;\n    }\n  }\n}\n\n// Media between the breakpoint's minimum and maximum widths.\n// No minimum for the smallest breakpoint, and no maximum for the largest one.\n// Makes the @content apply only to the given breakpoint, not viewports any wider or narrower.\n@mixin media-breakpoint-only($name, $breakpoints: $grid-breakpoints) {\n  $min:  breakpoint-min($name, $breakpoints);\n  $next: breakpoint-next($name, $breakpoints);\n  $max:  breakpoint-max($next, $breakpoints);\n\n  @if $min != null and $max != null {\n    @media (min-width: $min) and (max-width: $max) {\n      @content;\n    }\n  } @else if $max == null {\n    @include media-breakpoint-up($name, $breakpoints) {\n      @content;\n    }\n  } @else if $min == null {\n    @include media-breakpoint-down($next, $breakpoints) {\n      @content;\n    }\n  }\n}\n",".bd-header-version-warning,\n.bd-header-announcement {\n  min-height: 3rem;\n  width: 100%;\n  display: flex;\n  position: relative;\n  align-items: center;\n  justify-content: center;\n  text-align: center;\n  padding: 0.5rem 12.5%; // Horizontal padding so the width is 75%\n  // One breakpoint less than $breakpoint-sidebar-primary. See variables/_layout.scss for more info.\n  @include media-breakpoint-down(lg) {\n    // Announcements can take a bit more width on mobile\n    padding: 0.5rem 2%;\n  }\n\n  p {\n    font-weight: bold;\n    margin: 0;\n  }\n\n  &:after {\n    position: absolute;\n    width: 100%;\n    height: 100%;\n    left: 0;\n    top: 0;\n    content: \"\";\n    z-index: -1; // So it doesn't hover over the content\n  }\n\n  &:empty {\n    display: none;\n  }\n\n  // Ensure there is enough contrast against the background\n  a {\n    color: var(--pst-color-inline-code-links);\n  }\n}\n\n// Bg color is now defined in the theme color palette - using our secondary color\n.bd-header-announcement {\n  &:after {\n    background-color: var(--pst-color-secondary-bg);\n  }\n}\n\n.bd-header-version-warning {\n  &:after {\n    background-color: var(--pst-color-danger-bg);\n  }\n}\n","/**\n * Main content area\n */\n.bd-main {\n  flex-grow: 1;\n  flex-direction: column;\n  display: flex;\n  min-width: 0;\n\n  .bd-content {\n    display: flex;\n    justify-content: center;\n    height: 100%;\n    .bd-article-container {\n      justify-content: start;\n      display: flex;\n      flex-direction: column;\n      // Max-width is slightly more than the W3 since our docs often have images.\n      // We shoot for about 100 characters per line instead of 80.\n      // ref: https://www.w3.org/WAI/tutorials/page-structure/styling/#line-length\n      width: 100%;\n      max-width: 60em;\n      overflow-x: auto; // Prevent wide content from pushing off the secondary sidebar\n      padding: 1rem;\n      .bd-article {\n        // Give a bit more verticle spacing on wide screens\n        @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n          padding-top: 1.5rem;\n          padding-left: 2rem;\n        }\n      }\n    }\n  }\n}\n",".bd-footer {\n  width: 100%;\n  border-top: 1px solid var(--pst-color-border);\n\n  .bd-footer__inner {\n    display: flex;\n    flex-grow: 1;\n    padding: 1rem;\n    margin: auto;\n  }\n\n  .footer-items__start,\n  .footer-items__center,\n  .footer-items__end {\n    display: flex;\n    flex-direction: column;\n    gap: 0.5rem;\n    justify-content: center;\n    flex-grow: 1;\n  }\n\n  .footer-items__center {\n    text-align: center;\n  }\n\n  .footer-items__end {\n    text-align: end;\n  }\n\n  // So that paragraphs don't take up extra room\n  .footer-item p {\n    margin-bottom: 0;\n  }\n}\n",".bd-footer-article {\n  margin-top: auto;\n\n  .footer-article-items {\n    display: flex;\n    flex-direction: column;\n  }\n}\n",".bd-footer-content {\n  .footer-content-items {\n    display: flex;\n    flex-direction: column;\n    margin-top: auto;\n  }\n}\n","/**\n * Header at the top of the page\n * It includes the announcement bar and the navigation bar.\n */\n\n// Styling for the Icon links can be found in components/_icon-links.scss\n\n// If we want the shadow to only point downward in the future, set\n// box-shadow to: 0 0.125rem 0.25rem -0.125rem rgba(0, 0, 0, 0.11);\n.bd-header {\n  position: sticky;\n  top: 0;\n  z-index: $zindex-fixed;\n\n  // Overrides bootstrap\n  background: var(--pst-color-on-background) !important;\n  box-shadow: 0 0.125rem 0.25rem 0 var(--pst-color-shadow);\n\n  width: 100%;\n  padding: 0;\n  max-width: 100vw;\n  justify-content: center;\n  .bd-header__inner {\n    display: flex;\n    align-items: center;\n    height: fit-content;\n    padding-left: 1rem;\n    padding-right: 1rem;\n  }\n\n  // These items will define the height of the header\n  .navbar-item {\n    height: var(--pst-header-height);\n    max-height: var(--pst-header-height);\n    display: flex;\n    align-items: center;\n  }\n\n  // Hide the header items on mobile\n  .navbar-header-items {\n    display: none;\n    flex-shrink: 1;\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      display: flex;\n      flex-grow: 1;\n      padding: 0 0 0 0.5rem;\n    }\n  }\n\n  .navbar-header-items__end,\n  .navbar-header-items__center,\n  .navbar-header-items__start {\n    display: flex;\n    align-items: center;\n    flex-flow: wrap;\n    // In case we wrap our items to multiple rows on small screens\n    row-gap: 0;\n  }\n\n  .navbar-header-items__end,\n  .navbar-header-items__center {\n    column-gap: 1rem;\n  }\n\n  // A little smaller because this is displayed by default on mobile\n  .navbar-header-items__start {\n    flex-shrink: 0;\n    margin-right: auto;\n    gap: 0.5rem;\n  }\n\n  .navbar-header-items__end {\n    // End navbar items should snap to the right\n    justify-content: end;\n  }\n\n  // Contains the navigation links within the navbar\n  .navbar-nav {\n    display: flex;\n\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      // Center align on wide screens so the dropdown button is centered properly\n      align-items: center;\n    }\n\n    li a.nav-link {\n      @include link-style-text;\n    }\n\n    // Current page is always underlined in the navbar\n    > .current > .nav-link {\n      @include link-navbar-current;\n    }\n\n    // Dropdowns for the extra links\n    .dropdown {\n      button {\n        display: unset;\n        color: var(--pst-color-text-muted);\n        border: none;\n        @include link-style-hover;\n        @include focus-indicator;\n      }\n\n      .dropdown-menu {\n        z-index: $zindex-popover;\n        border: 1px solid var(--pst-color-border);\n        box-shadow: 0 0 0.3rem 0.1rem var(--pst-color-shadow);\n        background-color: var(--pst-color-on-background);\n        padding: 0.5rem 0;\n        margin: 0.5rem 0;\n        min-width: 20rem;\n\n        .dropdown-item {\n          // Give the items in the dropdown some breathing room but let the hit\n          // and hover area of the items extend to the edges of the menu\n          padding: 0.25rem 1.5rem;\n\n          // Override Bootstrap\n          &:focus:not(:hover):not(:active) {\n            background-color: inherit;\n          }\n        }\n\n        // Hide the menu unless show has been clicked\n        &:not(.show) {\n          display: none;\n        }\n      }\n    }\n  }\n}\n\n// inline the element in the navbar as long as they fit and use display block when collapsing\n@include media-breakpoint-up($breakpoint-sidebar-primary) {\n  .navbar-center-items .navbar-item {\n    display: inline-block;\n  }\n}\n\n.nav-link {\n  @include link-style-hover;\n\n  // Override Bootstrap\n  transition: none;\n\n  &.nav-external:after {\n    font: var(--fa-font-solid);\n    content: var(--pst-icon-external-link);\n    font-size: 0.75em;\n    margin-left: 0.3em;\n  }\n}\n\n.bd-navbar-elements li.nav-item i {\n  font-size: 0.7rem;\n  padding-left: 2px;\n  vertical-align: middle;\n}\n\n/**\n * Showing and hiding the sidebar toggle buttons and header items\n */\n\n// Hide the header items on mobile\n.bd-header {\n  // Toggle labels\n  label {\n    &.sidebar-toggle {\n      display: flex;\n      cursor: pointer;\n      font-size: var(--pst-font-size-icon);\n      align-items: center;\n      color: var(--pst-color-muted);\n      margin-bottom: 0;\n      padding-bottom: 0.25rem;\n    }\n\n    &.primary-toggle {\n      margin-right: 1rem;\n      @include media-breakpoint-up($breakpoint-sidebar-primary) {\n        display: none;\n      }\n    }\n\n    &.secondary-toggle {\n      margin-left: 1rem;\n      @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n        display: none;\n      }\n    }\n    @include icon-navbar-hover;\n    @include focus-indicator;\n  }\n\n  // Hide the navbar header items on mobile because they're in the sidebar\n  .navbar-header-items {\n    display: none;\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      display: inherit;\n    }\n  }\n}\n\n// THe elements next to the hamburger menu only show on narrow screens\n.navbar-persistent--mobile {\n  margin-left: auto;\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    display: none;\n  }\n}\n\n// The navbar-persistent content should only show on wide screens\n.navbar-persistent--container {\n  display: none;\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    display: flex;\n  }\n}\n",".header-article__inner {\n  display: flex;\n  padding: 0 0.5rem;\n\n  // The items define the height so that it disappears if there are no items\n  .header-article-item {\n    min-height: var(--pst-header-article-height);\n    height: var(--pst-header-article-height);\n  }\n\n  .header-article-items__start,\n  .header-article-items__end {\n    display: flex;\n    align-items: start;\n    gap: 0.5rem;\n  }\n\n  .header-article-items__end {\n    margin-left: auto;\n  }\n}\n","/**\n * The primary sidebar on the left.\n * e.g., between-pages navigation.\n */\n\n.bd-sidebar-primary {\n  display: flex;\n  flex-direction: column;\n  gap: 1rem;\n  max-height: calc(100vh - var(--pst-header-height));\n  position: sticky;\n  top: var(--pst-header-height);\n  @include make-col(3);\n\n  // Borders padding and whitespace\n  padding: 2rem 1rem 1rem 1rem;\n  border-right: 1px solid var(--pst-color-border);\n  background-color: var(--pst-color-background);\n  overflow-y: auto;\n\n  font-size: var(--pst-sidebar-font-size-mobile);\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    font-size: var(--pst-sidebar-font-size);\n  }\n\n  // override bootstrap when navlink are displayed in the sidebar\n  .nav-link {\n    font-size: var(--pst-sidebar-font-size-mobile);\n  }\n\n  &.no-sidebar {\n    border-right: 0;\n  }\n\n  &.hide-on-wide {\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      display: none;\n    }\n  }\n\n  // Headers shouldn't be colored in the sidebars and some extensions add headers\n  h1,\n  h2,\n  h3,\n  h4 {\n    color: var(--pst-color-text-base);\n  }\n\n  .sidebar-primary-items__start,\n  .sidebar-primary-items__end {\n    .sidebar-primary-item {\n      padding: 0.5rem 0;\n    }\n  }\n\n  // Hide the sidebar header items on widescreen since they are visible in the header\n  .sidebar-header-items {\n    display: flex;\n    flex-direction: column;\n\n    .sidebar-header-items__title {\n      font-weight: var(--pst-sidebar-header-font-weight);\n      font-size: var(--pst-sidebar-header-font-size);\n      color: var(--pst-color-text-base);\n      margin-bottom: 0.5rem;\n    }\n\n    // The dropdown toggle for extra links just shows them all instead.\n    .nav-item.dropdown {\n      // On mobile, the dropdown behaves like any other link, no hiding\n      button {\n        display: none;\n      }\n\n      .dropdown-menu {\n        display: flex;\n        flex-direction: column;\n        padding: 0;\n        margin: 0;\n        border: none;\n        background-color: inherit;\n        font-size: inherit;\n      }\n    }\n\n    // Center header items get displayed vertically, end items are displayed horizontally\n    .sidebar-header-items__center {\n      display: flex;\n      flex-direction: column;\n    }\n\n    // Positioning end items\n    .sidebar-header-items__end {\n      display: flex;\n      align-items: center;\n      gap: 0.5rem;\n    }\n\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      display: none;\n    }\n  }\n\n  .sidebar-primary-items__start {\n    // Add a border on mobile to separate it from the header sidebar area\n    border-top: 1px solid var(--pst-color-border);\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      border-top: none;\n    }\n  }\n\n  .sidebar-primary-items__end {\n    margin-top: auto;\n    margin-bottom: 1em;\n  }\n  .list-caption {\n    list-style: none;\n    padding-left: 0px;\n  }\n  li {\n    position: relative;\n    // If it has children, add a bit more padding to wrap the content to avoid\n    // overlapping with the <label>\n    &.has-children {\n      > .reference {\n        padding-right: 30px;\n      }\n    }\n  }\n  // Navigation item chevrons\n  label.toctree-toggle {\n    position: absolute;\n    top: 0;\n    right: 0;\n    height: 30px;\n    width: 30px;\n\n    cursor: pointer;\n\n    display: flex;\n    justify-content: center;\n    align-items: center;\n\n    &:hover {\n      background: var(--pst-color-surface);\n    }\n\n    i {\n      display: inline-block;\n      font-size: 0.75rem;\n      text-align: center;\n      &:hover {\n        color: var(--pst-color-primary);\n      }\n    }\n  }\n  .label-parts {\n    width: 100%;\n    height: 100%;\n    &:hover {\n      background: none;\n    }\n    i {\n      width: 30px;\n      position: absolute;\n      top: 0.3em; // aligning chevron with text\n      right: 0em; // aligning chevron to the right\n    }\n  }\n}\n\n/* Between-page links and captions */\nnav.bd-links {\n  margin-right: -1rem;\n\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    display: block;\n  }\n\n  ul {\n    list-style: none;\n\n    // Reduce padding of nested `ul` items a bit\n    ul {\n      padding: 0 0 0 1rem;\n    }\n  }\n\n  li > a {\n    display: block;\n    padding: 0.25rem 0.65rem;\n    @include link-sidebar;\n    box-shadow: none;\n\n    &.reference.external {\n      &:after {\n        font: var(--fa-font-solid);\n        content: var(--pst-icon-external-link);\n        font-size: 0.75em;\n        margin-left: 0.3em;\n      }\n    }\n  }\n\n  .current {\n    > a {\n      @include link-sidebar-current;\n      background-color: transparent;\n    }\n  }\n\n  // Title\n  p.bd-links__title {\n    font-size: var(--pst-sidebar-header-font-size);\n    font-weight: var(--pst-sidebar-header-font-weight);\n    margin-bottom: 0.5rem;\n  }\n\n  // Toctree captions\n  p.caption {\n    font-weight: var(--pst-sidebar-header-font-weight);\n    position: relative;\n    margin-top: 1.25rem;\n    margin-bottom: 0.5rem;\n    color: var(--pst-color-text-base);\n    &:first-child {\n      margin-top: 0;\n    }\n\n    font-size: var(--pst-sidebar-font-size-mobile);\n    @include media-breakpoint-up($breakpoint-sidebar-primary) {\n      font-size: var(--pst-sidebar-font-size);\n    }\n  }\n}\n","// Grid system\n//\n// Generate semantic grid columns with these mixins.\n\n@mixin make-row($gutter: $grid-gutter-width) {\n  --#{$prefix}gutter-x: #{$gutter};\n  --#{$prefix}gutter-y: 0;\n  display: flex;\n  flex-wrap: wrap;\n  // TODO: Revisit calc order after https://github.com/react-bootstrap/react-bootstrap/issues/6039 is fixed\n  margin-top: calc(-1 * var(--#{$prefix}gutter-y)); // stylelint-disable-line function-disallowed-list\n  margin-right: calc(-.5 * var(--#{$prefix}gutter-x)); // stylelint-disable-line function-disallowed-list\n  margin-left: calc(-.5 * var(--#{$prefix}gutter-x)); // stylelint-disable-line function-disallowed-list\n}\n\n@mixin make-col-ready() {\n  // Add box sizing if only the grid is loaded\n  box-sizing: if(variable-exists(include-column-box-sizing) and $include-column-box-sizing, border-box, null);\n  // Prevent columns from becoming too narrow when at smaller grid tiers by\n  // always setting `width: 100%;`. This works because we set the width\n  // later on to override this initial width.\n  flex-shrink: 0;\n  width: 100%;\n  max-width: 100%; // Prevent `.col-auto`, `.col` (& responsive variants) from breaking out the grid\n  padding-right: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  padding-left: calc(var(--#{$prefix}gutter-x) * .5); // stylelint-disable-line function-disallowed-list\n  margin-top: var(--#{$prefix}gutter-y);\n}\n\n@mixin make-col($size: false, $columns: $grid-columns) {\n  @if $size {\n    flex: 0 0 auto;\n    width: percentage(divide($size, $columns));\n\n  } @else {\n    flex: 1 1 0;\n    max-width: 100%;\n  }\n}\n\n@mixin make-col-auto() {\n  flex: 0 0 auto;\n  width: auto;\n}\n\n@mixin make-col-offset($size, $columns: $grid-columns) {\n  $num: divide($size, $columns);\n  margin-left: if($num == 0, 0, percentage($num));\n}\n\n// Row columns\n//\n// Specify on a parent element(e.g., .row) to force immediate children into NN\n// number of columns. Supports wrapping to new lines, but does not do a Masonry\n// style grid.\n@mixin row-cols($count) {\n  > * {\n    flex: 0 0 auto;\n    width: percentage(divide(1, $count));\n  }\n}\n\n// Framework grid generation\n//\n// Used only by Bootstrap to generate the correct number of grid classes given\n// any value of `$grid-columns`.\n\n@mixin make-grid-columns($columns: $grid-columns, $gutter: $grid-gutter-width, $breakpoints: $grid-breakpoints) {\n  @each $breakpoint in map-keys($breakpoints) {\n    $infix: breakpoint-infix($breakpoint, $breakpoints);\n\n    @include media-breakpoint-up($breakpoint, $breakpoints) {\n      // Provide basic `.col-{bp}` classes for equal-width flexbox columns\n      .col#{$infix} {\n        flex: 1 0 0%; // Flexbugs #4: https://github.com/philipwalton/flexbugs#flexbug-4\n      }\n\n      .row-cols#{$infix}-auto > * {\n        @include make-col-auto();\n      }\n\n      @if $grid-row-columns > 0 {\n        @for $i from 1 through $grid-row-columns {\n          .row-cols#{$infix}-#{$i} {\n            @include row-cols($i);\n          }\n        }\n      }\n\n      .col#{$infix}-auto {\n        @include make-col-auto();\n      }\n\n      @if $columns > 0 {\n        @for $i from 1 through $columns {\n          .col#{$infix}-#{$i} {\n            @include make-col($i, $columns);\n          }\n        }\n\n        // `$columns - 1` because offsetting by the width of an entire row isn't possible\n        @for $i from 0 through ($columns - 1) {\n          @if not ($infix == \"\" and $i == 0) { // Avoid emitting useless .offset-0\n            .offset#{$infix}-#{$i} {\n              @include make-col-offset($i, $columns);\n            }\n          }\n        }\n      }\n\n      // Gutters\n      //\n      // Make use of `.g-*`, `.gx-*` or `.gy-*` utilities to change spacing between the columns.\n      @each $key, $value in $gutters {\n        .g#{$infix}-#{$key},\n        .gx#{$infix}-#{$key} {\n          --#{$prefix}gutter-x: #{$value};\n        }\n\n        .g#{$infix}-#{$key},\n        .gy#{$infix}-#{$key} {\n          --#{$prefix}gutter-y: #{$value};\n        }\n      }\n    }\n  }\n}\n\n@mixin make-cssgrid($columns: $grid-columns, $breakpoints: $grid-breakpoints) {\n  @each $breakpoint in map-keys($breakpoints) {\n    $infix: breakpoint-infix($breakpoint, $breakpoints);\n\n    @include media-breakpoint-up($breakpoint, $breakpoints) {\n      @if $columns > 0 {\n        @for $i from 1 through $columns {\n          .g-col#{$infix}-#{$i} {\n            grid-column: auto / span $i;\n          }\n        }\n\n        // Start with `1` because `0` is and invalid value.\n        // Ends with `$columns - 1` because offsetting by the width of an entire row isn't possible.\n        @for $i from 1 through ($columns - 1) {\n          .g-start#{$infix}-#{$i} {\n            grid-column-start: $i;\n          }\n        }\n      }\n    }\n  }\n}\n","/**\n * Secondary sidebar on the right.\n * e.g., in-page table of contents.\n */\n.bd-sidebar-secondary {\n  display: flex;\n  order: 2;\n  flex-shrink: 0;\n  flex-direction: column;\n  position: sticky;\n  top: var(--pst-header-height);\n  max-height: calc(100vh - var(--pst-header-height));\n  padding: 2rem 1rem 1rem 1rem;\n  width: var(--pst-sidebar-secondary);\n  font-size: var(--pst-sidebar-font-size-mobile);\n  @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n    font-size: var(--pst-sidebar-font-size);\n  }\n\n  // Color and border\n  background-color: var(--pst-color-background);\n  overflow-y: auto;\n}\n\n.sidebar-secondary-item {\n  padding: 0.5rem 0.5rem;\n  @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n    border-left: 1px solid var(--pst-color-border);\n    padding-left: 1rem;\n  }\n\n  i {\n    padding-right: 0.5rem;\n  }\n}\n","/*******************************************************************************\n* Rules for the UX/UI of sidebar sliding drawers on mobile\n* Note that this sheet controls styles across many parts of the theme\n* It is aggregated into this one sheet instead of being split across\n* components in order to keep it easier to debug in one place.\n* It is broken up into major sections below.\n*/\n\n/*******************************************************************************\n* Buttons and overlays\n*/\ninput.sidebar-toggle {\n  display: none;\n}\n\n// Background overlays\nlabel.overlay {\n  background-color: black;\n  opacity: 0.5;\n  height: 0;\n  width: 0;\n  position: fixed;\n  top: 0;\n  left: 0;\n  transition: opacity $animation-time ease-out;\n  z-index: $zindex-modal-backdrop;\n}\n\ninput {\n  // Show the correct overlay when its input is checked\n  &#__primary:checked + label.overlay.overlay-primary,\n  &#__secondary:checked + label.overlay.overlay-secondary {\n    height: 100vh;\n    width: 100vw;\n  }\n\n  // Primary sidebar slides in from the left\n  &#__primary:checked ~ .bd-container .bd-sidebar-primary {\n    visibility: visible;\n    margin-left: 0;\n  }\n\n  // Secondary sidebar slides in from the right\n  &#__secondary:checked ~ .bd-container .bd-sidebar-secondary {\n    visibility: visible;\n    margin-right: 0;\n  }\n}\n\n/*******************************************************************************\n* Sidebar drawer behavior\n*/\n\n/**\n * Behavior for sliding drawer elements that will be toggled with an input\n *\n * NOTE: We use this mixin to define the toggle behavior on narrow screens,\n * And the wide-screen behavior of the sections is defined in their own section\n * .scss files.\n */\n@mixin sliding-drawer($side: \"left\") {\n  position: fixed;\n  top: 0;\n  z-index: $zindex-modal;\n  height: 100vh;\n  max-height: 100vh;\n  width: 75%;\n  flex-grow: 0.75;\n  max-width: 350px;\n  transition: visibility $animation-time ease-out,\n    margin $animation-time ease-out;\n  visibility: hidden;\n\n  @if $side == \"right\" {\n    margin-right: -75%;\n    right: 0;\n  } @else {\n    margin-left: -75%;\n    left: 0;\n  }\n}\n\n// Primary sidebar hides/shows at earlier widths\n@include media-breakpoint-up($breakpoint-sidebar-primary) {\n  label.sidebar-toggle.primary-toggle {\n    display: none;\n  }\n\n  input#__primary {\n    &:checked + label.overlay.overlay-primary {\n      height: 0;\n      width: 0;\n    }\n  }\n\n  .bd-sidebar-primary {\n    margin-left: 0;\n    visibility: visible;\n  }\n}\n\n.bd-sidebar-primary {\n  @include media-breakpoint-down($breakpoint-sidebar-primary) {\n    @include sliding-drawer(\"left\");\n  }\n}\n\n.bd-sidebar-secondary {\n  @include media-breakpoint-down($breakpoint-sidebar-secondary) {\n    @include sliding-drawer(\"right\");\n  }\n}\n","/**\n * Breadcrumbs for parent pages meant for the article header\n */\nul.bd-breadcrumbs {\n  list-style: none;\n  padding-left: 0;\n  display: flex;\n  flex-wrap: wrap;\n\n  // Font size slightly smaller to avoid cluttering up space too much\n  font-size: 0.8rem;\n\n  li.breadcrumb-item {\n    display: flex;\n    align-items: baseline;\n\n    // Style should look like heavier in-page links\n    // keeping visited in the default link colour\n    font-weight: bold;\n    a {\n      @include link-style-text;\n    }\n\n    // Items that aren't the home have a caret to the left\n    &:not(.breadcrumb-home):before {\n      font: var(--fa-font-solid);\n      font-size: 0.8rem;\n      content: var(--pst-breadcrumb-divider);\n      color: var(--pst-color-text-muted);\n      padding: 0 0.5rem;\n    }\n  }\n}\n","/**\n * Icon links in the navbar\n */\n\n.navbar-icon-links {\n  display: flex;\n  flex-direction: row;\n  column-gap: 1rem;\n  flex-wrap: wrap;\n\n  // Remove the padding so that we can define it with flexbox gap above\n  li.nav-item a.nav-link {\n    padding-left: 0;\n    padding-right: 0;\n    @include icon-navbar-hover;\n  }\n\n  // Spacing and centering\n  a span {\n    display: flex;\n    align-items: center;\n  }\n\n  // Icons styling\n  i {\n    &.fa-brands,\n    &.fa-regular,\n    &.fa-solid {\n      vertical-align: middle;\n      font-style: normal;\n      font-size: var(--pst-font-size-icon);\n    }\n\n    /* Social media buttons hard-code the brand color */\n    &.fa-square-twitter:before {\n      color: #55acee;\n    }\n\n    &.fa-square-gitlab:before {\n      color: #548;\n    }\n\n    &.fa-bitbucket:before {\n      color: #0052cc;\n    }\n  }\n\n  // Force images to be icon-sized\n  img.icon-link-image {\n    height: 1.5em;\n    border-radius: 0.2rem;\n  }\n}\n","/**\n * Logo in the navbar\n */\n\n.navbar-brand {\n  position: relative;\n  height: var(--pst-header-height);\n  max-height: var(--pst-header-height);\n  padding: 0.5rem 0;\n  width: auto;\n  margin: 0;\n  display: flex;\n  // Ensure that the logo stays the same length while other content shrinks\n  flex-shrink: 0;\n  align-items: center;\n  gap: 0.5rem;\n\n  // If there's no logo image, we use a p element w/ the site title\n  p {\n    margin-bottom: 0;\n  }\n\n  // If there's a logo, it'll be in an img block\n  img {\n    max-width: 100%;\n    height: 100%;\n    width: auto;\n  }\n\n  // remove underline from brand title on default state\n  a {\n    text-decoration: none;\n  }\n  &:hover {\n    @include link-style-hover;\n  }\n  &:visited {\n    &:hover {\n      @include link-style-hover;\n    }\n  }\n}\n","/**\n * Navigation text links in the navbar\n */\n.navbar-nav {\n  ul {\n    display: block;\n    list-style: none;\n\n    // Reduce padding of nested `ul` items a bit\n    ul {\n      padding: 0 0 0 1rem;\n    }\n  }\n\n  // Navbar links - do not have an underline by default\n  li {\n    display: flex;\n    flex-direction: column;\n\n    a {\n      display: flex;\n      align-items: center;\n      height: 100%;\n      padding-top: 0.25rem;\n      padding-bottom: 0.25rem;\n      @include link-style-text;\n    }\n  }\n\n  /**\n   * Togglable expand/collapse\n   * This is only applicable to the primary sidebar which has these checkboxes\n   */\n  .toctree-checkbox {\n    position: absolute;\n    display: none;\n  }\n\n  .toctree-checkbox {\n    ~ ul {\n      display: none;\n    }\n    ~ label i {\n      transform: rotate(0deg);\n    }\n  }\n  .toctree-checkbox:checked {\n    ~ ul {\n      display: block;\n    }\n    ~ label i {\n      transform: rotate(180deg);\n    }\n  }\n}\n\n// Don't display the `site navigation` in the header menu\n.bd-header .navbar-nav > p.sidebar-header-items__title {\n  display: none;\n}\n","/**\n * The list of in-page TOC links\n */\n.page-toc {\n  .section-nav {\n    padding-left: 0;\n    border-bottom: none;\n\n    ul {\n      padding-left: 1rem;\n    }\n  }\n\n  // override bootstrap settings\n  .nav-link {\n    font-size: var(--pst-sidebar-font-size-mobile);\n    @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n      font-size: var(--pst-sidebar-font-size);\n    }\n  }\n\n  .onthispage {\n    color: var(--pst-color-text-base);\n    font-weight: var(--pst-sidebar-header-font-weight);\n    margin-bottom: 0.5rem;\n  }\n}\n","/**\n* Previous / Next navigation buttons\n**/\n.prev-next-area {\n  width: 100%;\n\n  p {\n    margin: 0 0.3em;\n    line-height: 1.3em;\n  }\n\n  i {\n    font-size: 1.2em;\n  }\n\n  a {\n    // So that buttons align with icons\n    display: flex;\n    align-items: center;\n    border: none;\n    padding: 10px;\n    max-width: 45%;\n    overflow-x: hidden;\n    color: var(--pst-color-text-muted);\n    text-decoration: none;\n\n    p.prev-next-title {\n      @include link-style-default;\n      font-weight: var(--pst-admonition-font-weight-heading);\n      font-size: 1.1em;\n    }\n\n    &:hover p.prev-next-title {\n      @include link-style-hover;\n    }\n    // Exception here - keep visited in the default link colour\n    // it still should hover on the default link hover colour\n    &:visited p.prev-next-title {\n      color: var(--pst-color-link);\n      &:hover {\n        color: var(--pst-color-link-hover);\n      }\n    }\n\n    .prev-next-info {\n      flex-direction: column;\n      margin: 0 0.5em;\n\n      .prev-next-subtitle {\n        text-transform: capitalize;\n      }\n    }\n\n    &.left-prev {\n      float: left;\n    }\n\n    &.right-next {\n      float: right;\n\n      div.prev-next-info {\n        text-align: right;\n      }\n    }\n  }\n}\n","/**\n * Search field\n **/\n.bd-search {\n  position: relative;\n  padding-left: 0.5rem;\n  gap: 0.5rem;\n  background-color: var(--pst-color-background);\n  border-radius: $admonition-border-radius;\n  border: 1px solid var(--pst-color-border);\n  color: var(--pst-color-text-base);\n\n  // Background should always be same color regardless of active or not\n  &:active {\n    background-color: var(--pst-color-background);\n    color: var(--pst-color-text-muted);\n  }\n\n  .icon {\n    position: absolute;\n    color: var(--pst-color-border);\n    left: 25px;\n  }\n\n  .fa-solid.fa-magnifying-glass {\n    position: absolute;\n    left: calc((2.5rem - 0.7em) / 2);\n    color: var(--pst-color-text-muted);\n  }\n\n  input {\n    // Inner-text of the search bar\n    &::placeholder {\n      color: var(--pst-color-text-muted);\n    }\n\n    // Remove the little \"x\" that pops up when you start typing\n    &::-webkit-search-cancel-button,\n    &::-webkit-search-decoration {\n      -webkit-appearance: none;\n      appearance: none;\n    }\n  }\n\n  // Shows off the keyboard shortcuts for the button\n  .search-button__kbd-shortcut {\n    display: flex;\n    position: absolute;\n    right: 0.5rem;\n    color: var(--pst-color-border);\n  }\n}\n\n.form-control {\n  background-color: var(--pst-color-background);\n  color: var(--pst-color-text-base);\n\n  &:focus,\n  &:focus-visible {\n    border: none;\n    box-shadow: none;\n    outline: 3px solid var(--pst-color-accent);\n    background-color: var(--pst-color-background);\n    color: var(--pst-color-text-muted);\n  }\n}\n\n/**\n * Search button - located in the navbar\n */\n\n// Search link icon should be a bit bigger since it is separate from icon links\n.search-button {\n  display: flex;\n  align-items: center;\n  align-content: center;\n  color: var(--pst-color-text-muted);\n  // Needed to match other icons hover\n  padding: 0 0 0.25rem 0;\n  border-radius: 0;\n  @include icon-navbar-hover;\n  @include focus-indicator;\n\n  i {\n    font-size: 1.3rem;\n  }\n}\n\n// __search-container will only show up when we use the search pop-up bar\n.search-button__search-container,\n.search-button__overlay {\n  display: none;\n}\n.search-button__wrapper.show {\n  .search-button__search-container {\n    display: flex;\n    // Center in middle of screen just underneath header\n    position: fixed;\n    z-index: $zindex-modal;\n    top: 30%;\n    left: 50%;\n    transform: translate(-50%, -50%);\n    right: 1rem;\n    margin-top: 0.5rem;\n    width: 90%;\n    max-width: 800px;\n  }\n\n  .search-button__overlay {\n    display: flex;\n    position: fixed;\n    z-index: $zindex-modal-backdrop;\n    background-color: black;\n    opacity: 0.5;\n    width: 100%;\n    height: 100%;\n    top: 0px;\n    left: 0px;\n  }\n\n  form.bd-search {\n    flex-grow: 1;\n    padding-top: 0;\n    padding-bottom: 0;\n  }\n\n  // Font and input text a bit bigger\n  svg,\n  input {\n    font-size: var(--pst-font-size-icon);\n  }\n}\n\n/**\n * The search button component that looks like a field.\n * Lives at components/search-button-field.html\n */\n.search-button-field {\n  display: inline-flex;\n  align-items: center;\n  border: var(--pst-color-border) solid 1px;\n  border-radius: 1.5em;\n  color: var(--pst-color-text-muted);\n  padding: 0.5em;\n  background-color: var(--pst-color-surface);\n\n  &:hover {\n    border: 2px solid var(--pst-color-link-hover);\n  }\n  &:focus-visible {\n    border: 2px solid var(--pst-color-accent);\n  }\n\n  // The keyboard shotcut text\n  .search-button__default-text {\n    font-size: var(--bs-nav-link-font-size);\n    font-weight: var(--bs-nav-link-font-weight);\n    margin-right: 0.5em;\n    margin-left: 0.5em;\n  }\n\n  .kbd-shortcut__modifier {\n    font-size: 0.75em;\n  }\n\n  // Ensures that all the text lines up in the middle\n  > * {\n    align-items: center;\n  }\n\n  // Only the icon should be visible on narrow screens\n  > :not(svg) {\n    display: none;\n\n    @include media-breakpoint-up(lg) {\n      display: flex;\n    }\n  }\n}\n","/**\n * The 'Hide Search Matches' button.\n * This only shows up when a person lands on a page after clicking a search result.\n * Clicking it removes the highlighting of the search term from the page.\n * We want it to behave like a button.\n */\ndiv#searchbox {\n  // Leave `#searchbox` rules empty so that it doesn't show at all when it is empty\n  p.highlight-link {\n    margin: 1rem 0;\n    width: fit-content;\n\n    // A bit more margin on wide screens to mimic article behavior\n    @include media-breakpoint-up($breakpoint-sidebar-secondary) {\n      margin-left: 2rem;\n    }\n\n    // Put outer shadow on this one so that we can darken the link w/ an inner shadow\n    @include box-shadow();\n\n    // Style the button to look like a Sphinx Design button\n    a {\n      border-radius: 0.25rem;\n      font-size: 1.25rem;\n      padding: 0.75rem;\n      background-color: var(--pst-color-primary);\n      color: var(--pst-color-primary-text);\n      text-decoration: none;\n\n      // The box shadow is inset so that it darkens the button on hover\n      transition: box-shadow 0.25s ease-out;\n      &:hover {\n        box-shadow: inset 0px 0px 50px 50px rgba(0, 0, 0, 0.25);\n      }\n\n      &:before {\n        content: var(--pst-icon-search-minus);\n        color: unset;\n        font: var(--fa-font-solid);\n        margin-right: 0.5rem;\n      }\n    }\n  }\n}\n","/*********************************************\n* SASS Mixins\n*********************************************/\n\n/**\n * A consistent box shadow style we apply across elements.\n */\n@mixin box-shadow() {\n  box-shadow: 0 0.2rem 0.5rem var(--pst-color-shadow),\n    0 0 0.0625rem var(--pst-color-shadow) !important;\n}\n\n/**\n   * Set background of some cell outputs to white-ish to make sure colors work\n   * This is because many libraries make output that only looks good on white\n   */\n@mixin cell-output-background {\n  color: var(--pst-color-on-background);\n  background-color: var(--pst-color-text-base);\n  border-radius: 0.25rem;\n  padding: 0.5rem;\n}\n","/**\n * Light/dark theme switcher\n */\n\n.theme-switch-button {\n  // overide bootstrap settings\n  margin: 0 -0.5rem;\n  padding: 0; // We pad the `span` not the container\n  color: var(--pst-color-text-muted);\n  border-radius: 0;\n  @include focus-indicator;\n\n  span {\n    display: none;\n    padding: 0.5em;\n\n    @include icon-navbar-hover;\n    &:active {\n      text-decoration: none;\n      color: var(--pst-color-link-hover);\n    }\n  }\n}\n\nhtml[data-mode=\"auto\"] .theme-switch-button span[data-mode=\"auto\"] {\n  display: flex;\n}\nhtml[data-mode=\"light\"] .theme-switch-button span[data-mode=\"light\"] {\n  display: flex;\n}\nhtml[data-mode=\"dark\"] .theme-switch-button span[data-mode=\"dark\"] {\n  display: flex;\n}\n","button.btn.version-switcher__button {\n  border-color: var(--pst-color-border);\n  color: var(--pst-color-text-base);\n  // Add a margin on narrow screens to avoid feeling cramped\n  margin-bottom: 1em;\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    margin-bottom: unset;\n  }\n\n  @include link-style-hover;\n  @include focus-indicator;\n  &:active {\n    color: var(--pst-color-text-base);\n    border-color: var(--pst-color-border);\n  }\n}\n\n.version-switcher__menu {\n  border-color: var(--pst-color-border);\n  border-radius: var(--bs-dropdown-border-radius);\n\n  a.list-group-item {\n    background-color: var(--pst-color-on-background);\n    color: var(--pst-color-text-base);\n    padding: 0.75rem 1.25rem;\n\n    &:not(:last-child) {\n      border-bottom: 1px solid var(--pst-color-border);\n    }\n    @include link-style-hover;\n    &:hover {\n      background-color: var(--pst-color-surface);\n    }\n    &.active {\n      @include link-sidebar-current;\n      position: relative;\n      z-index: 1;\n\n      span:before {\n        content: \"\";\n        width: 100%;\n        height: 100%;\n        position: absolute;\n        z-index: -1;\n        left: 0;\n        top: 0;\n      }\n    }\n  }\n}\n\n// Font behavior on mobile\nbutton.version-switcher__button,\n.version-switcher__menu {\n  font-size: 1.1em; // A bit smaller than other menu font\n  z-index: $zindex-modal; // higher than the sidebars\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    font-size: unset;\n  }\n}\n","/* Collapsing of the TOC sidebar while scrolling */\n/* Nav: hide second level (shown on .active) */\n\nnav.page-toc {\n  // A little extra space before the buttons\n  margin-bottom: 1rem;\n}\n\n.bd-toc .nav,\n.list-caption {\n  .nav {\n    display: none;\n\n    // So we can manually specify a level as visible in the config\n    &.visible {\n      display: block;\n    }\n  }\n\n  > .active > ul {\n    display: block;\n  }\n}\n\n// Each entry of the in-page TOC\n.toc-entry {\n  display: block;\n  a > code {\n    color: var(--pst-color-text-muted);\n  }\n\n  a.nav-link {\n    display: block;\n    padding: 0.125rem 0;\n\n    // Padding w/ negative margin so the top TOC item highlight overlaps w/ the TOC border\n    padding-left: 1rem;\n    margin-left: -1rem;\n\n    @include link-sidebar;\n\n    &.active {\n      @include link-sidebar-current;\n      background-color: transparent;\n\n      &:hover {\n        color: var(--pst-color-link-hover);\n      }\n    }\n  }\n}\n","div.versionadded,\ndiv.versionchanged,\ndiv.deprecated {\n  vertical-align: middle;\n  margin: 1.5625em auto;\n  padding: 0 0.6rem 0 0.6rem;\n  overflow: hidden;\n  page-break-inside: avoid;\n  border-left: 0.2rem solid;\n  border-color: var(--pst-color-info);\n  border-radius: $admonition-border-radius;\n  background-color: var(--pst-color-on-background);\n  @include box-shadow();\n  position: relative;\n\n  > p {\n    margin-bottom: 0.6rem;\n    margin-top: 0.6rem;\n  }\n}\n\ndiv.versionadded {\n  border-color: var(--pst-color-success);\n  background-color: var(--pst-color-success-bg);\n}\n\ndiv.versionchanged {\n  border-color: var(--pst-color-warning);\n  background-color: var(--pst-color-warning-bg);\n}\n\ndiv.deprecated {\n  border-color: var(--pst-color-danger);\n  background-color: var(--pst-color-danger-bg);\n}\n\nspan.versionmodified {\n  font-weight: 600;\n\n  &:before {\n    margin-right: 0.6rem;\n    color: var(--pst-color-info);\n    font: var(--fa-font-solid);\n    content: var(--pst-icon-versionmodified-default);\n  }\n}\n\nspan.versionmodified.added {\n  &:before {\n    color: var(--pst-color-success);\n    content: var(--pst-icon-versionmodified-added);\n  }\n}\n\nspan.versionmodified.changed {\n  &:before {\n    color: var(--pst-color-warning);\n    content: var(--pst-icon-versionmodified-changed);\n  }\n}\n\nspan.versionmodified.deprecated {\n  &:before {\n    color: var(--pst-color-danger);\n    content: var(--pst-icon-versionmodified-deprecated);\n  }\n}\n",".sidebar-indices-items {\n  display: flex;\n  flex-direction: column;\n  border-top: 1px solid var(--pst-color-border);\n\n  @include media-breakpoint-up($breakpoint-sidebar-primary) {\n    border-top: none;\n  }\n\n  .sidebar-indices-items__title {\n    font-weight: var(--pst-sidebar-header-font-weight);\n    font-size: var(--pst-sidebar-header-font-size);\n    color: var(--pst-color-text-base);\n    margin-bottom: 0.5rem;\n  }\n\n  ul.indices-link {\n    margin-right: -1rem;\n    list-style: none;\n    padding: 0;\n\n    li > a {\n      display: block;\n      padding: 0.25rem 0;\n      color: var(--pst-color-text-muted);\n\n      &:hover {\n        color: var(--pst-color-primary);\n        text-decoration: none;\n        background-color: transparent;\n      }\n    }\n  }\n}\n",".bd-sidebar-primary div#rtd-footer-container {\n  position: sticky;\n  bottom: -1rem;\n  margin: -1rem; // ignore sidebar padding\n\n  .rst-versions.rst-badge {\n    position: unset;\n    font-size: 0.9em;\n    font-family: var(--pst-font-family-base);\n    max-width: unset;\n\n    .rst-current-version {\n      display: flex;\n      align-items: center;\n      gap: 0.2rem;\n      height: 2.5rem;\n      transition: background-color 0.2s ease-out;\n      background-color: var(--pst-color-background);\n      color: var(--pst-color-success);\n      border-top: 1px solid var(--pst-color-border);\n    }\n\n    .fa.fa-book {\n      color: var(--pst-color-text-muted);\n      margin-right: auto;\n\n      &::after {\n        color: var(--pst-color-text-base);\n        content: \"Read The Docs\";\n        font-family: var(--pst-font-family-base);\n        font-weight: var(--pst-admonition-font-weight-heading);\n      }\n    }\n    .fa.fa-caret-down {\n      color: var(--pst-color-text-muted);\n    }\n  }\n\n  .rst-versions.rst-badge.shift-up {\n    .rst-current-version {\n      border-bottom: 1px solid var(--pst-color-border);\n    }\n  }\n\n  .rst-other-versions {\n    background-color: var(--pst-color-surface);\n    color: var(--pst-color-text-base);\n\n    dl {\n      dd a {\n        color: var(--pst-color-text-muted);\n      }\n    }\n\n    hr {\n      background-color: var(--pst-color-border);\n    }\n\n    small a {\n      color: var(--pst-color-link);\n    }\n\n    input {\n      padding-left: 0.5rem;\n      border: 1px solid var(--pst-color-border);\n      background-color: var(--pst-color-surface);\n    }\n  }\n}\n","/**\n * Admonitions and blocks of styled content.\n * Admonitions CSS originally inspired by https://squidfunk.github.io/mkdocs-material/getting-started/\n */\n$admonition-border-radius: 0.25rem;\ndiv.admonition,\n.admonition {\n  margin: 1.5625em auto;\n  padding: 0 0.6rem 0.8rem 0.6rem;\n  overflow: hidden;\n  page-break-inside: avoid;\n  border-left: 0.2rem solid;\n  border-color: var(--pst-color-info);\n  border-radius: $admonition-border-radius;\n  background-color: var(--pst-color-on-background);\n  @include box-shadow();\n\n  // Last item should have no spacing since we'll control that w/ padding\n  *:last-child {\n    margin-bottom: 0;\n  }\n\n  // Items after the title should be indented\n  p.admonition-title ~ * {\n    margin-left: 1.4rem;\n    margin-right: 1.4rem;\n  }\n\n  // Lists need to have left margin so they don't spill into it\n  > ol,\n  > ul {\n    margin-left: 1em;\n  }\n\n  // Defaults for all admonitions\n  > .admonition-title {\n    margin: 0 -0.6rem;\n    padding: 0.4rem 0.6rem 0.4rem 2rem;\n    font-weight: var(--pst-admonition-font-weight-heading);\n    position: relative;\n    @include background-from-color-variable(--pst-color-info-bg);\n    // now that we use solid colors we want the title on top\n    z-index: 1;\n\n    &:after {\n      position: absolute;\n      left: 0.5rem;\n      width: 1rem;\n      height: 1rem;\n      color: var(--pst-color-info);\n      font: var(--fa-font-solid);\n      line-height: inherit;\n      content: var(--pst-icon-admonition-default);\n      opacity: 1;\n    }\n\n    // Next element after title needs some extra upper-space\n    + * {\n      margin-top: 0.4em;\n    }\n  }\n\n  &.attention {\n    border-color: var(--pst-color-attention);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-attention-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-attention);\n        content: var(--pst-icon-admonition-attention);\n      }\n    }\n  }\n\n  &.caution {\n    border-color: var(--pst-color-warning);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-warning-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-warning);\n        content: var(--pst-icon-admonition-caution);\n      }\n    }\n  }\n\n  &.warning {\n    border-color: var(--pst-color-warning);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-warning-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-warning);\n        content: var(--pst-icon-admonition-warning);\n      }\n    }\n  }\n\n  &.danger {\n    border-color: var(--pst-color-danger);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-danger-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-danger);\n        content: var(--pst-icon-admonition-danger);\n      }\n    }\n  }\n\n  &.error {\n    border-color: var(--pst-color-danger);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-danger-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-danger);\n        content: var(--pst-icon-admonition-error);\n      }\n    }\n  }\n\n  &.hint {\n    border-color: var(--pst-color-success);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-success-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-success);\n        content: var(--pst-icon-admonition-hint);\n      }\n    }\n  }\n\n  &.tip {\n    border-color: var(--pst-color-success);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-success-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-success);\n        content: var(--pst-icon-admonition-tip);\n      }\n    }\n  }\n\n  &.important {\n    border-color: var(--pst-color-attention);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-attention-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-attention);\n        content: var(--pst-icon-admonition-important);\n      }\n    }\n  }\n\n  &.note {\n    border-color: var(--pst-color-info);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-info-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-info);\n        content: var(--pst-icon-admonition-note);\n      }\n    }\n  }\n\n  &.seealso {\n    border-color: var(--pst-color-success);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-success-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-success);\n        content: var(--pst-icon-admonition-seealso);\n      }\n    }\n  }\n\n  &.admonition-todo {\n    border-color: var(--pst-color-secondary);\n    > .admonition-title {\n      &:before {\n        background-color: var(--pst-color-secondary-bg);\n      }\n\n      &:after {\n        color: var(--pst-color-secondary);\n        content: var(--pst-icon-admonition-todo);\n      }\n    }\n  }\n\n  /**\n   * Special-case for a `sidebar` class that makes the admonition float to\n   * the right like the {sidebar} directive.\n   */\n  &.sidebar {\n    max-width: 40%;\n    float: right;\n    clear: both;\n    margin-left: 0.5rem;\n    margin-top: 0;\n\n    // Undo the .sidebar directive border\n    border-width: 0 0 0 0.2rem;\n\n    // TODO: these semantic-color-names border-color rules might no longer be\n    //       needed when we drop support for Sphinx 4 / docutils 0.17\n    &.attention,\n    &.important {\n      border-color: var(--pst-color-attention);\n    }\n\n    &.caution,\n    &.warning {\n      border-color: var(--pst-color-warning);\n    }\n\n    &.danger,\n    &.error {\n      border-color: var(--pst-color-danger);\n    }\n\n    &.hint,\n    &.tip,\n    &.seealso {\n      border-color: var(--pst-color-success);\n    }\n\n    &.note,\n    &.todo {\n      border-color: var(--pst-color-info);\n    }\n\n    // No inner margin since we have less horizontal space w/ the sidebar\n    p.admonition-title ~ * {\n      margin-left: 0rem;\n      margin-right: 0rem;\n    }\n  }\n}\n\n/**************************************************************\n * Similar content blocks that are not technically admonitions.\n */\n\n/**\n * Topics and the {contents} directive\n */\n// Docutils <= 0.17\ndiv.topic,\ndiv.topic.contents,\n// Docutils >= 0.18\nnav.contents,\naside.topic {\n  display: flex;\n  flex-direction: column;\n  background-color: var(--pst-color-surface);\n  border-color: var(--pst-color-border);\n  border-radius: $admonition-border-radius;\n  padding: 1rem 1.25rem;\n  @include box-shadow();\n\n  .topic-title {\n    margin: 0 0 0.5rem 0;\n  }\n\n  // Over-ride text color to ensure enough contrast\n  p {\n    color: var(--pst-color-on-surface) !important;\n  }\n\n  // Over-ride large default padding\n  ul.simple {\n    padding-left: 1rem;\n\n    ul {\n      // So that sub-lists will have a bit less padding\n      padding-left: 2em;\n    }\n  }\n}\n\n/**\n * Sidebar directive\n */\naside.sidebar {\n  border: 1px solid var(--pst-color-border);\n  background-color: var(--pst-color-surface);\n  border-radius: $admonition-border-radius;\n  // to match the admonition-styled sidebars:\n  margin-left: 0.5rem;\n  padding: 0;\n  > *:last-child {\n    padding-bottom: 1rem;\n  }\n\n  p.sidebar-title {\n    position: relative;\n    margin-bottom: 0;\n    padding-top: 0.5rem;\n    padding-bottom: 0.5rem;\n    border-bottom: 1px solid var(--pst-color-border);\n    font-family: var(--pst-font-family-heading);\n    font-weight: var(--pst-admonition-font-weight-heading);\n  }\n\n  // Add margin to the first non-`.sidebar-title` item\n  > *:not(.sidebar-title):first-child,\n  > p.sidebar-title + * {\n    margin-top: 1rem;\n  }\n\n  > * {\n    padding-left: 1rem;\n    padding-right: 1rem;\n  }\n}\n\n/**\n * Rubrics look kind of like section headers\n */\np.rubric {\n  display: flex;\n  flex-direction: column;\n}\n\n/**\n * Seealso is kind of like a vertically-collapsed admonition\n */\n.seealso dd {\n  margin-top: 0;\n  margin-bottom: 0;\n}\n","/**\n * Miscellaneous color functions and mixins\n**/\n\n// loading the math module\n@use \"sass:math\";\n\n// Set background color from a color variable\n//\n@mixin background-from-color-variable($color-variable) {\n  &:before {\n    content: \"\";\n    width: 100%;\n    height: 100%;\n    position: absolute;\n    left: 0;\n    top: 0;\n    background-color: var(#{$color-variable});\n    z-index: -1;\n    // So that hovering over the text within background is still possible.\n    // Otherwise the background overlays the text and you cannot click or select easily.\n    // ref: https://developer.mozilla.org/en-US/docs/Web/CSS/pointer-events\n    pointer-events: none;\n  }\n}\n\n/**\n* Function to get items from nested maps\n*/\n// @param {Map} $map - Map\n// @param {Arglist} $keys - Keys to fetc\n// @return {*}\n@function map-deep-get($map, $keys...) {\n  @each $key in $keys {\n    $map: map-get($map, $key);\n  }\n  @return $map;\n}\n\n/**\n  * Function to check if the color needs converting to a \"color\" type\n  * if it is a string we cannot use other color manipulation functions\n  * It is used to create the sphinx-design colours as these are often interpolated\n  */\n// @param {String/Color} $color - Color definition from map\n// @return {Color} - Color type (in hex)\n@function check-color($color) {\n  @if type-of($color) == string {\n    $color: from-hex($color);\n  }\n  @return $color;\n}\n\n/**\n  * Function to convert the string representation of a color to a color type (hex)\n  */\n// @param {String} $string - String representation of a color\n@function from-hex($string) {\n  $string-lower: to-lower-case($string);\n  $r: \"\";\n  $g: \"\";\n  $b: \"\";\n  $hex: \"0\" \"1\" \"2\" \"3\" \"4\" \"5\" \"6\" \"7\" \"8\" \"9\" \"a\" \"b\" \"c\" \"d\" \"e\" \"f\";\n  $length: str-length($string);\n  $max: if($length == 4, 1, 2);\n\n  // Check for length accuracy\n  @if $length != 4 and $length != 7 {\n    @return $string;\n  }\n\n  // Loop from the second character (omitting #)\n  @for $i from 2 through $length {\n    $c: str-slice($string-lower, $i, $i);\n\n    // If wrong character, return\n    @if index($hex, $c) == null {\n      @return $string;\n    }\n\n    @if str-length($r) < $max {\n      $r: $r + $c;\n    } @else if str-length($g) < $max {\n      $g: $g + $c;\n    } @else if str-length($b) < $max {\n      $b: $b + $c;\n    }\n  }\n\n  @if $length == 4 {\n    $r: $r + $r;\n    $g: $g + $g;\n    $b: $b + $b;\n  }\n\n  @return rgb(_hex-to-dec($r), _hex-to-dec($g), _hex-to-dec($b));\n}\n\n@function _hex-to-dec($string) {\n  $hex: \"0\" \"1\" \"2\" \"3\" \"4\" \"5\" \"6\" \"7\" \"8\" \"9\" \"a\" \"b\" \"c\" \"d\" \"e\" \"f\";\n  $string: to-lower-case($string);\n  $length: str-length($string);\n\n  $dec: 0;\n  @for $i from 1 through $length {\n    $factor: 1 + (15 * ($length - $i));\n    $index: index($hex, str-slice($string, $i, $i));\n    $dec: $dec + $factor * ($index - 1);\n  }\n\n  @return $dec;\n}\n","// Style API docs from sphinx' autodoc / autosummary\n\n/*******************************************************************************\n* Styling for field lists\n*/\n\n/* grey highlighting of 'parameter' and 'returns' field */\ntable.field-list {\n  border-collapse: separate;\n  border-spacing: 10px;\n  margin-left: 1px;\n\n  th.field-name {\n    padding: 1px 8px 1px 5px;\n    white-space: nowrap;\n    background-color: var(--pst-color-surface);\n  }\n\n  /* italic font for parameter types */\n  td.field-body {\n    p {\n      font-style: italic;\n\n      > strong {\n        font-style: normal;\n      }\n    }\n\n    /* reduced space around parameter description */\n    blockquote {\n      border-left: none;\n      margin: 0em 0em 0.3em;\n      padding-left: 30px;\n    }\n  }\n}\n\n/*******************************************************************************\n* Styling for autosummary tables\n*/\n\n.table.autosummary {\n  // The first column (with the signature) should not wrap\n  td:first-child {\n    white-space: nowrap;\n  }\n}\n\n/* overriding basic.css to use our own monospace font */\n.sig {\n  font-family: var(--pst-font-family-monospace);\n}\n\n/* C++ specific styling - overriding the basic.css to avoid custom colors*/\n\n.sig-inline.c-texpr,\n.sig-inline.cpp-texpr {\n  font-family: unset;\n}\n\n.sig.c .k,\n.sig.c .kt,\n.sig.cpp .k,\n.sig.cpp .kt {\n  color: var(--pst-color-text-base);\n}\n\n.sig.c .m,\n.sig.cpp .m {\n  color: var(--pst-color-text-base);\n}\n\n.sig.c .s,\n.sig.c .sc,\n.sig.cpp .s,\n.sig.cpp .sc {\n  color: var(--pst-color-text-base);\n}\n\n// addition\n\n// .sig.c .sig-name .n,\n// .sig.cpp .sig-name .n {\n//   color: var(--pst-color-inline-code);\n// }\n\n.sig-name {\n  color: var(--pst-color-inline-code);\n}\n\n.sig-param .o,\n.sig-param .default_value {\n  color: var(--pst-color-text-muted);\n  font-weight: normal;\n}\n\n// change target color for dark theme\ndt:target,\nspan.highlighted {\n  background-color: var(--pst-color-target);\n}\n\n.viewcode-back {\n  font-family: var(--pst-font-family-base);\n}\n\n.viewcode-block:target {\n  border-top: 1px solid var(--pst-color-border);\n  border-bottom: 1px solid var(--pst-color-border);\n  position: relative;\n  background-color: var(--pst-color-target);\n}\n\n/*******************************************************************************\n* Styling for autosummary titles like \"parameters\" and \"returns\"\n*/\n\n// the API selector\n// from https://github.com/pradyunsg/furo/blob/main/src/furo/assets/styles/content/_api.sass#L6)\ndl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) {\n  dd {\n    margin-left: 2rem;\n\n    // Fix until this will be solved to Sphinx https://github.com/sphinx-doc/sphinx/issues/10815\n    & > dl.simple > dt {\n      display: flex;\n    }\n  }\n\n  dl.field-list {\n    display: grid;\n    grid-template-columns: unset;\n  }\n\n  dt.field-odd,\n  dt.field-even {\n    margin-top: 0.2rem;\n    margin-bottom: 0.1rem;\n    background-color: var(--pst-color-surface);\n  }\n}\n","/**\n * Code block styling\n * Note that we inherit a lot of styling from Bootstrap so not many rules here.\n */\n\n// General code block behavior\n// Unset bootstrap behavior\ndiv[class*=\"highlight-\"],\ndiv.highlight,\ndiv.literal-block-wrapper {\n  display: flex;\n  flex-direction: column;\n  width: unset;\n  border-radius: $admonition-border-radius;\n}\n\n// Code blocks with captions\n// There's a wrapper when the code block has a title\ndiv.literal-block-wrapper {\n  border: 1px solid var(--pst-color-border);\n  border-radius: $admonition-border-radius;\n\n  // This is where the title goes\n  div.code-block-caption {\n    margin: 0;\n    border-bottom: 1px solid var(--pst-color-border);\n    padding: 0.5rem;\n    font-size: 1rem;\n    font-weight: var(--pst-font-weight-caption);\n\n    a.headerlink {\n      font-size: inherit;\n    }\n  }\n\n  // Remove the upper border radius since we want it to connect with the title\n  // Remove the box shadow so the wrapper gets the shadow instead\n  div[class*=\"highlight-\"] {\n    margin: 0;\n    border-radius: 0;\n    pre {\n      border: none;\n      box-shadow: none;\n    }\n  }\n}\n\n/**\n * In-line code\n */\ncode.literal {\n  padding: 0.1rem 0.25rem;\n  background-color: var(--pst-color-surface);\n  border: 1px solid var(--pst-color-border);\n  border-radius: 0.25rem;\n}\n\na > code {\n  color: var(--pst-color-inline-code-links);\n}\n\n// Fix for Sphinx's \"highlight\" directive - this is an issue with our accessible pygments theme\n// and the colour we are using for the background of the code blocks.\nhtml[data-theme=\"light\"] .highlight .nf {\n  color: #0078a1 !important;\n}\n\n// Minimum opacity needed for linenos to be WCAG AA conformant\nspan.linenos {\n  opacity: 0.8 !important;\n}\n","figure {\n  a.headerlink {\n    // So that header link doesn't push caption to be off-center.\n    position: absolute;\n    font-size: inherit;\n  }\n  // Default headerlink hover doesn't trigger on figures\n  &:hover a.headerlink {\n    visibility: visible;\n  }\n\n  figcaption {\n    font-family: var(--pst-font-family-heading);\n    font-weight: var(--pst-font-weight-caption);\n    color: var(--pst-color-text-muted);\n    margin-left: auto;\n    margin-right: auto;\n\n    table.table {\n      width: fit-content;\n      margin-left: auto;\n      margin-right: auto;\n    }\n  }\n}\n","// For consistency, add bracket around footnotes/citations which are\n// cited more than once. E.g. [Newton](1,2) instead of Newton(1,2)\ndt.label > span.brackets:not(:only-child):before {\n  content: \"[\";\n}\n\ndt.label > span.brackets:not(:only-child):after {\n  content: \"]\";\n}\n\n// Make footnote as a superscript\na.footnote-reference {\n  vertical-align: super;\n  font-size: small;\n}\n\n// Docutils 0.18 uses an `aside.footnote` container with different internal structure\naside.footnote {\n  margin-bottom: 0.5rem;\n  &:last-child {\n    margin-bottom: 1rem;\n  }\n  span.label,\n  span.backrefs {\n    font-weight: bold;\n  }\n\n  &:target {\n    background-color: var(--pst-color-target);\n  }\n}\n","/**\n * Hacky fixes that don't fit cleanly into other sections\n */\n\n// Ensure user highlighting/selecting behaves properly\n// From https://stackoverflow.com/a/34372191\ntable.highlighttable td.linenos,\nspan.linenos,\ndiv.doctest > div.highlight span.gp {\n  /* gp: Generic.Prompt */\n  user-select: none;\n  -webkit-user-select: text; /* Safari fallback only */\n  -webkit-user-select: none; /* Chrome/Safari */\n  -moz-user-select: none; /* Firefox */\n  -ms-user-select: none; /* IE10+ */\n}\n","// Override bootstrap by restoring the basic theme default.\ndd {\n  margin-top: 3px;\n  margin-bottom: 10px;\n  margin-left: 30px;\n}\n\nol,\nul {\n  padding-inline-start: 2rem;\n  li > p:first-child {\n    margin-bottom: 0.25rem;\n    margin-top: 0.25rem;\n  }\n}\n","// GitHub blockquote style\nblockquote {\n  padding: 1em 1em;\n  color: var(--pst-color-text-muted);\n  border-left: 0.25em solid var(--pst-color-border);\n  border-radius: $admonition-border-radius;\n  position: relative;\n\n  p {\n    color: var(--pst-color-text-base);\n  }\n\n  // remove padding from included line-block to avoid duplication\n  .line-block {\n    margin: 0 0;\n  }\n\n  // remove margin bottom for the last p\n  p:last-child {\n    margin-bottom: 0;\n  }\n\n  @include background-from-color-variable(--pst-color-on-background);\n\n  //hack to make the text in the blockquote selectable\n  &:before {\n    z-index: -1;\n  }\n}\n","/**\n * Span-level styling within content\n */\n\nspan.guilabel {\n  border: 1px solid var(--pst-color-info);\n  color: var(--pst-color-info);\n  font-size: 80%;\n  font-weight: 700;\n  border-radius: 4px;\n  padding: 2.4px 6px;\n  margin: auto 2px;\n  position: relative;\n\n  @include background-from-color-variable(--pst-color-info-bg);\n}\n\na.reference.download:before {\n  content: var(--pst-icon-download);\n  font: var(--fa-font-solid);\n  font-size: 0.8em;\n  padding: 0 0.25em;\n  color: var(--pst-color-text-muted);\n}\n","/**\n * Tables\n */\n\n// ensure table will fit in the article width and make them y-scrollable\ntable {\n  display: table;\n  overflow: auto;\n\n  // default to table-center\n  margin-left: auto;\n  margin-right: auto;\n\n  &.table-right {\n    margin-right: 0;\n  }\n\n  &.table-left {\n    margin-left: 0;\n  }\n}\n\n// customize table caption from bootstrap\n// to display them on top and centered\ntable caption {\n  text-align: center;\n  caption-side: top;\n  color: var(--pst-color-text-muted);\n}\n\n// MyST Markdown tables use these classes to control alignment\nth,\ntd {\n  &.text-align\\:left {\n    text-align: left;\n  }\n\n  &.text-align\\:right {\n    text-align: right;\n  }\n\n  &.text-align\\:center {\n    text-align: center;\n  }\n}\n\n// override bootstrap background colors\n.table {\n  --bs-table-bg: transparent;\n}\n","/**\n * Style the toctree component in pages (avoid modifying the navbars)\n */\n.toctree-wrapper {\n  p.caption {\n    font-size: 1.5em;\n    margin-bottom: 0em;\n  }\n\n  & > ul {\n    padding-left: 0;\n  }\n\n  li[class^=\"toctree-l\"] {\n    list-style: none;\n    margin-bottom: 0.2em;\n\n    & > a {\n      list-style: none;\n      font-size: 1.1em;\n    }\n\n    & > ul {\n      list-style: none;\n      padding-inline-start: 1.5em;\n    }\n  }\n\n  // slightly bigger font for l1\n  .toctree-l1 > a {\n    font-size: 1.3em;\n  }\n}\n\ndiv.topic.contents,  // Docutils <= 0.17\nnav.contents  // Docutils >= 0.18\n{\n  // Style similarly to toctree\n  ul.simple {\n    list-style: none;\n    padding-left: 0;\n  }\n}\n","/**\n * Mathematics via MathJax.\n *\n * This is designed for MathJax v3\n * ref: https://www.sphinx-doc.org/en/master/usage/extensions/math.html#module-sphinx.ext.mathjax\n */\n\n// Applies to all math elements\nspan.math,\ndiv.math {\n  align-items: center;\n  display: flex;\n  max-width: 100%;\n  // This will be over-ridden for the y-direction and divs\n  overflow: hidden;\n}\n\n// Inline-only\nspan.math {\n  display: inline-flex;\n}\n\n// Block-level only\ndiv.math {\n  gap: 0.5em;\n  // So that the eqno shows up after the equation\n  flex-direction: row-reverse;\n\n  // The equation number / link\n  span.eqno a.headerlink {\n    position: relative;\n    font-size: 1em;\n  }\n\n  // The math container\n  mjx-container {\n    flex-grow: 1;\n    padding-bottom: 0.2rem;\n    overflow: auto;\n\n    // Set height to 0 so that it does not cause scrollbars to appear\n    // ref: https://github.com/mathjax/MathJax/issues/2521\n    mjx-assistive-mml {\n      height: 0;\n    }\n  }\n}\n","/**\n * ABlog\n * ref: https://ablog.readthedocs.io/\n */\n\n/**\n * Sidebar template components\n */\n.ablog-sidebar-item {\n  h2,\n  h3 {\n    font-size: var(--pst-sidebar-header-font-size);\n    // Remove unnecessary vertical whitespace\n    margin-top: 0.5rem;\n\n    // The headers are all links, but this makes them hard to parse\n    // So we change the colors to make them look like headers\n    a {\n      color: var(--pst-color-text-base);\n    }\n  }\n\n  ul {\n    // No bullet points for the primary sidebar items\n    list-style: none;\n    padding-left: 0;\n    // Otherwise a scrollbar randomly shows up\n    overflow-y: hidden;\n    // List of recent post items\n    display: flex;\n    flex-direction: column;\n    gap: 0.5em;\n    margin-bottom: 0;\n\n    // The ablog cloud should move horizontally\n    &.ablog-cloud {\n      flex-direction: row;\n      flex-flow: wrap;\n      gap: 0.5rem;\n\n      // Vertical-align tag clouds\n      li {\n        // Center the tag cloud items\n        display: flex;\n        align-items: center;\n      }\n    }\n  }\n}\n\n/**\n * Previous / next buttons at the bottom\n */\n.ablog__prev-next {\n  font-size: 1.2em;\n  display: flex;\n  padding: 1rem 0;\n\n  // The bottom previous / next arrows\n  > span {\n    // To ensure that the whole thing fits on one line even if there are long titles\n    display: flex;\n    max-width: 45%;\n\n    // Links within each span have the collection of icon + text\n    a {\n      display: flex;\n      align-items: center;\n      margin-left: auto;\n      gap: 1rem;\n      line-height: 1.5rem;\n\n      i:before {\n        color: var(--pst-color-text-base);\n      }\n    }\n  }\n\n  // The first span is for the previous page and aligns to the left\n  span.ablog__prev {\n    i.fa-arrow-circle-left:before {\n      content: var(--pst-icon-angle-left);\n    }\n  }\n\n  // The second span is just an empty space so we remove it because we're\n  // positioning with flex\n  span.ablog__spacer {\n    display: none;\n  }\n\n  // The third span is aligned to the right\n  span.ablog__next {\n    margin-left: auto;\n    text-align: right;\n\n    i.fa-arrow-circle-right:before {\n      content: var(--pst-icon-angle-right);\n    }\n  }\n}\n\n/**\n * {postlist} directive and posts page\n */\n.ablog__collection,\n.postlist {\n  padding-left: 0;\n\n  .ablog-post {\n    list-style: none;\n\n    // Post metadata tags (author, links ,etc) should be a bit smaller\n    .ablog-archive {\n      display: flex;\n      flex-direction: row;\n      flex-wrap: wrap;\n      gap: 1rem;\n      list-style: none;\n      font-size: 0.75rem;\n      padding-left: 0;\n    }\n\n    // Title line should be a bit bigger and bold to stand out\n    .ablog-post-title {\n      margin-top: 0;\n      font-size: 1.25rem;\n\n      a {\n        font-weight: bold;\n      }\n    }\n\n    // Read more button should be a bit bigger\n    .ablog-post-expand {\n      margin-bottom: 0.5rem;\n    }\n  }\n}\n","/**\n * Special cases for Bootstrap functionality\n */\n\n// Bootstrap adds margin to their general container class. However, sphinx/docutils\n// can also generate output with the container class, but in those cases we should\n// not add the margin from bootstrap. Same for max-width.\n.docutils.container {\n  padding-left: unset;\n  padding-right: unset;\n  margin-left: unset;\n  margin-right: unset;\n  max-width: unset;\n  width: unset;\n}\n","/**\n * Sphinx Copybutton\n * ref: https://sphinx-copybutton.readthedocs.io/\n */\n\ndiv.highlight button.copybtn {\n  // Nicer spacing\n  display: flex;\n  align-items: center;\n  justify-content: center;\n\n  // Removes the button background so we more naturally blend with the code cell.\n  background-color: unset;\n\n  // Don't over-ride the success color\n  &:not(.success) {\n    color: var(--pst-color-muted);\n  }\n  border: none;\n  background-color: var(--pst-color-surface);\n\n  &:hover {\n    &:not(.success) {\n      color: var(--pst-color-text);\n      background-color: var(--pst-color-shadow);\n    }\n  }\n\n  // Tooltip styling\n  &.o-tooltip--left:after {\n    color: var(--pst-color-text);\n    background-color: var(--pst-color-surface);\n  }\n}\n","// adapt ethical ad to the theme\n#ethical-ad-placement {\n  .ethical-sidebar a,\n  .ethical-sidebar a:visited,\n  .ethical-sidebar a:hover,\n  .ethical-sidebar a:active,\n  .ethical-footer a,\n  .ethical-footer a:visited,\n  .ethical-footer a:hover,\n  .ethical-footer a:active {\n    color: var(--pst-color-text-base);\n  }\n\n  .ethical-sidebar,\n  .ethical-footer {\n    background-color: var(--pst-color-background);\n    border: 1px solid var(--pst-color-border);\n    border-radius: 5px;\n    color: var(--pst-color-text-base);\n    font-size: 14px;\n    line-height: 20px;\n  }\n}\n","/**\n * Styles for various Sphinx execution libraries.\n * For now, where these define output sections, we simply revert their background\n * to be a \"light theme\" background. This ensures that inputs/outputs behave similarly,\n * because the CSS is often controlled by each package.\n * In the future, we might add dark theme support for specific packages.\n */\n\n/******************************************************************************\n * Jupyter Sphinx\n */\n\n.bd-content div.jupyter_container {\n  // We don't want borders around the whole container, just around code cells\n  border: none;\n  background-color: unset;\n  box-shadow: none;\n\n  // Code cells should have the same style as our other code objects\n  div.output,\n  div.highlight {\n    border-radius: 0.25rem;\n  }\n  div.highlight {\n    background-color: var(--pst-color-surface);\n  }\n\n  // Ensure the style is the same as our code cells. Jupyter Sphinx makes it tiny.\n  .cell_input,\n  .cell_output {\n    border-radius: 0.25rem;\n    pre {\n      padding: 1rem;\n    }\n  }\n}\n","/**\n * Special-cases for packages in the PyData ecosystem\n */\n\n// xarray output display in bootstrap\n.xr-wrap[hidden] {\n  display: block !important;\n}\n","/*******************************************************************************\n* master color map. Only the colors that actually differ between light and dark\n* themes are specified separately.\n*\n* To see the full list of colors see https://www.figma.com/file/rUrrHGhUBBIAAjQ82x6pz9/PyData-Design-system---proposal-for-implementation-(2)?node-id=1234%3A765&t=ifcFT1JtnrSshGfi-1\n*/\n\n/**\n* Function to get items from nested maps\n*/\n// @param {Map} $map - Map\n// @param {Arglist} $keys - Keys to fetch\n// @return {*}\n@function map-deep-get($map, $keys...) {\n  @each $key in $keys {\n    $map: map-get($map, $key);\n  }\n  @return $map;\n}\n\n/* Assign base colors for the PyData theme */\n$color-palette: (\n  // Primary color\n  \"teal\":\n    (\n      \"50\": #f4fbfc,\n      \"100\": #e9f6f8,\n      \"200\": #d0ecf1,\n      \"300\": #abdde6,\n      \"400\": #3fb1c5,\n      \"500\": #0a7d91,\n      \"600\": #085d6c,\n      \"700\": #064752,\n      \"800\": #042c33,\n      \"900\": #021b1f,\n    ),\n  // Secondary color\n  \"violet\":\n    (\n      \"50\": #f4eefb,\n      \"100\": #e0c7ff,\n      \"200\": #d5b4fd,\n      \"300\": #b780ff,\n      \"400\": #9c5ffd,\n      \"500\": #8045e5,\n      \"600\": #6432bd,\n      \"700\": #4b258f,\n      \"800\": #341a61,\n      \"900\": #1e0e39,\n    ),\n  // Neutrals\n  \"gray\":\n    (\n      \"50\": #f9f9fa,\n      \"100\": #f3f4f5,\n      \"200\": #e5e7ea,\n      \"300\": #d1d5da,\n      \"400\": #9ca4af,\n      \"500\": #677384,\n      \"600\": #48566b,\n      \"700\": #29313d,\n      \"800\": #222832,\n      \"900\": #14181e,\n    ),\n  // Accent color\n  \"pink\":\n    (\n      \"50\": #fcf8fd,\n      \"100\": #fcf0fa,\n      \"200\": #f8dff5,\n      \"300\": #f3c7ee,\n      \"400\": #e47fd7,\n      \"500\": #c132af,\n      \"600\": #912583,\n      \"700\": #6e1c64,\n      \"800\": #46123f,\n      \"900\": #2b0b27,\n    ),\n  \"foundation\": (\n    \"white\": #ffffff,\n    // gray-900\n    \"black\": #14181e,\n  )\n);\n\n:root {\n  // Add theme colours to the html root element\n  @each $group-color, $color in $color-palette {\n    @each $color-name, $definition in $color {\n      --pst-#{$group-color}-#{$color-name}: #{$definition};\n    }\n  }\n}\n\n// Static SCSS variables used thoroughout the theme\n// Minimum contrast ratio used for the theme.\n// Acceptable values for WCAG 2.0 are 3, 4.5 and 7.\n// See https://www.w3.org/TR/WCAG20/#visual-audio-contrast-contrast\n// 4.5 - is for text that is 14pt or less\n$min-contrast-ratio-4: 4.5;\n// 3 is for text that is 18pt or bold, or for non-text elements\n$min-contrast-ratio-3: 3;\n\n// Customize the light and dark text colors for use in our color contrast function.\n$foundation-black: #14181e;\n$foundation-white: #ffffff;\n// This is a custom - calculated  color between gray 100 and 200 - to reduce\n// the contrast ratio (avoid a jarring effect)\n$base-light-text: #ced6dd;\n// used in sphinx_design - gray 100\n$foundation-light-gray: #f3f4f5;\n// used in sphinx_design - gray 700\n$foundation-muted-gray: #29313d;\n// used in sphinx_design - gray 800\n$foundation-dark-gray: #222832;\n\n$pst-semantic-colors: (\n  \"primary\": (\n    \"light\": #{map-deep-get($color-palette, \"teal\", \"500\")},\n    \"bg-light\": #{map-deep-get($color-palette, \"teal\", \"200\")},\n    \"dark\": #{map-deep-get($color-palette, \"teal\", \"400\")},\n    \"bg-dark\": #{map-deep-get($color-palette, \"teal\", \"800\")},\n  ),\n  \"secondary\": (\n    \"light\": #{map-deep-get($color-palette, \"violet\", \"500\")},\n    \"bg-light\": #{map-deep-get($color-palette, \"violet\", \"100\")},\n    \"dark\": #{map-deep-get($color-palette, \"violet\", \"400\")},\n    \"bg-dark\": #{map-deep-get($color-palette, \"violet\", \"800\")},\n  ),\n  \"accent\": (\n    \"light\": #{map-deep-get($color-palette, \"pink\", \"500\")},\n    \"bg-light\": #{map-deep-get($color-palette, \"pink\", \"200\")},\n    \"dark\": #{map-deep-get($color-palette, \"pink\", \"400\")},\n    \"bg-dark\": #{map-deep-get($color-palette, \"pink\", \"800\")},\n  ),\n  \"info\": (\n    \"light\": #276be9,\n    \"bg-light\": #dce7fc,\n    \"dark\": #79a3f2,\n    \"bg-dark\": #06245d,\n  ),\n  \"warning\": (\n    \"light\": #f66a0a,\n    \"bg-light\": #f8e3d0,\n    \"dark\": #ff9245,\n    \"bg-dark\": #652a02,\n  ),\n  \"success\": (\n    \"light\": #00843f,\n    \"bg-light\": #d6ece1,\n    \"dark\": #5fb488,\n    \"bg-dark\": #002f17,\n  ),\n  // This is is based on the warning color\n  \"attention\":\n    (\n      \"light\": var(--pst-color-warning),\n      \"bg-light\": var(--pst-color-warning-bg),\n      \"dark\": var(--pst-color-warning),\n      \"bg-dark\": var(--pst-color-warning-bg),\n    ),\n  \"danger\": (\n    \"light\": #d72d47,\n    \"bg-light\": #f9e1e4,\n    \"dark\": #e78894,\n    \"bg-dark\": #4e111b,\n  ),\n  \"text-base\": (\n    \"light\": #{map-deep-get($color-palette, \"gray\", \"800\")},\n    \"dark\": $base-light-text,\n  ),\n  \"text-muted\": (\n    \"light\": #{map-deep-get($color-palette, \"gray\", \"600\")},\n    \"dark\": #{map-deep-get($color-palette, \"gray\", \"400\")},\n  ),\n  \"heading-color\": (\n    \"light\": #{$foundation-white},\n    \"dark\": #{$foundation-black},\n  ),\n  \"shadow\": (\n    \"light\": rgba(0, 0, 0, 0.1),\n    \"dark\": rgba(0, 0, 0, 0.2),\n  ),\n  \"border\": (\n    \"light\": #{map-deep-get($color-palette, \"gray\", \"300\")},\n    \"dark\": #{map-deep-get($color-palette, \"gray\", \"600\")},\n  ),\n  \"border-muted\": (\n    \"light\": rgba(23, 23, 26, 0.2),\n    \"dark\": #{map-deep-get($color-palette, \"gray\", \"700\")},\n  ),\n  \"inline-code\": (\n    \"light\": #{map-deep-get($color-palette, \"pink\", \"600\")},\n    \"dark\": #{map-deep-get($color-palette, \"pink\", \"300\")},\n  ),\n  \"inline-code-links\": (\n    // need to make sure there is enough contrast against the code bg\n    \"light\": #{map-deep-get($color-palette, \"teal\", \"600\")},\n    // keep primary color for dark mode\n    \"dark\": #{map-deep-get($color-palette, \"teal\", \"400\")},\n  ),\n  \"target\": (\n    \"light\": #f3cf95,\n    \"dark\": #675c04,\n  ),\n  // DEPTH COLORS - you can see the elevation colours and shades\n  // in the Figma file https://www.figma.com/file/rUrrHGhUBBIAAjQ82x6pz9/PyData-Design-system---proposal-for-implementation-(2)?node-id=1492%3A922&t=sQeQZehkOzposYEg-1\n  // background: color of the canvas / the furthest back layer\n  \"background\":\n    (\n      \"light\": #{map-deep-get($color-palette, \"foundation\", \"white\")},\n      \"dark\": #{map-deep-get($color-palette, \"foundation\", \"black\")},\n    ),\n  // on-background: provides slight contrast against background\n  // (by use of shadows in light theme)\n  \"on-background\":\n    (\n      \"light\": #{map-deep-get($color-palette, \"foundation\", \"white\")},\n      \"dark\": #{map-deep-get($color-palette, \"gray\", \"800\")},\n    ),\n  \"surface\": (\n    \"light\": #{map-deep-get($color-palette, \"gray\", \"100\")},\n    \"dark\": #{map-deep-get($color-palette, \"gray\", \"700\")},\n  ),\n  // on_surface: object on top of surface object (without shadows)\n  \"on-surface\":\n    (\n      \"light\": #{map-deep-get($color-palette, \"gray\", \"800\")},\n      \"dark\": $foundation-light-gray,\n    ),\n);\n\n/*******************************************************************************\n* write the color rules for each theme (light/dark)\n*/\n\n/* NOTE:\n * Mixins enable us to reuse the same definitions for the different modes\n * https://sass-lang.com/documentation/at-rules/mixin\n * #{something} inserts a variable into a CSS selector or property name\n * https://sass-lang.com/documentation/interpolation\n */\n@mixin theme-colors($mode) {\n  // check if this color is defined differently for light/dark\n  @each $col-name, $definition in $pst-semantic-colors {\n    @if type-of($definition) == map {\n      @each $key, $val in $definition {\n        @if str-index($key, $mode) != null {\n          // since now we define the bg colours in the semantic colours and not\n          // by changing opacity, we need to check if the key contains bg and the\n          // correct mode (light/dark)\n          @if str-index($key, \"bg\") != null {\n            --pst-color-#{$col-name}-bg: #{$val};\n          } @else {\n            --pst-color-#{$col-name}: #{$val};\n          }\n        }\n      }\n    } @else {\n      --pst-color-#{$col-name}: #{$definition};\n    }\n  }\n\n  // assign the \"duplicate\" colors (ones that just reference other variables)\n  & {\n    --pst-color-link: var(--pst-color-primary);\n    --pst-color-link-hover: var(--pst-color-secondary);\n  }\n  // adapt to light/dark-specific content\n  @if $mode == \"light\" {\n    .only-dark,\n    .only-dark ~ figcaption {\n      display: none !important;\n    }\n  } @else {\n    .only-light,\n    .only-light ~ figcaption {\n      display: none !important;\n    }\n    /* Adjust images in dark mode (unless they have class .only-dark or\n     * .dark-light, in which case assume they're already optimized for dark\n     * mode).\n     */\n    img:not(.only-dark):not(.dark-light) {\n      filter: brightness(0.8) contrast(1.2);\n    }\n    /* Give images a light background in dark mode in case they have\n    *  transparency and black text (unless they have class .only-dark or .dark-light, in\n    *  which case assume they're already optimized for dark mode).\n    */\n    .bd-content img:not(.only-dark):not(.dark-light) {\n      background: rgb(255, 255, 255);\n      border-radius: 0.25rem;\n    }\n    // MathJax SVG outputs should be filled to same color as text.\n    .MathJax_SVG * {\n      fill: var(--pst-color-text-base);\n    }\n  }\n}\n\n/* Defaults to light mode if data-theme is not set */\nhtml:not([data-theme]) {\n  @include theme-colors(\"light\");\n}\n\n/* NOTE: @each {...} is like a for-loop\n * https://sass-lang.com/documentation/at-rules/control/each\n */\n@each $mode in (light, dark) {\n  html[data-theme=\"#{$mode}\"] {\n    @include theme-colors($mode);\n    color-scheme: $mode;\n  }\n}\n\n// assign classes too, for runtime use of theme colors\n@each $col-name, $definition in $pst-semantic-colors {\n  .pst-color-#{$col-name} {\n    color: var(--pst-color-#{$col-name});\n  }\n}\n","/*******************************************************************************\n * Special-cases for the sphinx-design library, mainly to make it compatible\n * with the dark/light themes of pydata-sphinx-theme.\n *\n * NOTE: sphinx-design uses !important quite liberally, so here we must do the\n * same for our overrides to have any effect.\n */\n@use \"../variables/color\" as pst-color;\n@use \"sass:meta\";\n@use \"sass:color\";\n\n/*******************************************************************************\n  * Color and variables\n  *\n  * This is a list of the semantic color names from sphinx-design (we only\n  * need to override variables that sphinx-design has actually defined).\n  * https://github.com/executablebooks/sphinx-design/blob/9226a12a/style/_colors.scss#L31-L43\n  */\n$sd-semantic-color-names: (\n  \"primary\",\n  \"secondary\",\n  \"success\",\n  \"info\",\n  \"warning\",\n  \"danger\",\n  \"light\",\n  \"muted\",\n  \"dark\",\n  \"black\",\n  \"white\"\n);\n\n/**\n  * Here we create some extra --pst-color-* variables and use\n  * them to override the value of the corresponding sphinx-design variables.\n  * This is easier than re-writing the sphinx-design rules. Even easier would be\n  * directly assigning our values to the --sd-color-* variables, but then our\n  * downstream users couldn't override *our* colors and have it affect buttons\n  * and badges.\n  *\n  * First, define the extra keys needed to cover the full range of semantic\n  * color names used in sphinx-design, then merge them with the names we\n  * already define for our own needs.\n  * see https://sphinx-design.readthedocs.io/en/latest/css_variables.html\n  */\n$extra-semantic-colors: (\n  \"white\": $foundation-white,\n  \"light\": (\n    light: $foundation-light-gray,\n    bg-light: color.scale($foundation-light-gray, $lightness: 30%),\n    dark: $foundation-light-gray,\n    bg-dark: color.scale($foundation-light-gray, $lightness: -30%),\n  ),\n  \"muted\": (\n    light: $foundation-muted-gray,\n    bg-light: color.scale($foundation-muted-gray, $lightness: 30%),\n    dark: $foundation-light-gray,\n    bg-dark: color.scale($foundation-muted-gray, $lightness: -30%),\n  ),\n  \"dark\": $foundation-dark-gray,\n  \"black\": $foundation-black,\n);\n\n$all-colors: map-merge($pst-semantic-colors, $extra-semantic-colors);\n\n@mixin create-sd-colors($value, $name) {\n  // define the pst variables, so that downstream user overrides will work\n  --pst-color-#{$name}: #{$value};\n  // we are now using a11y-combination to calculate the text color - this is based\n  // on the WCAG color contrast guidelines\n  --pst-color-#{$name}-text: #{a11y-combination($value)};\n  //TODO: highlight seems to be used for buttons @trallard to fix on a11y follow-up work\n  --pst-color-#{$name}-highlight: #{darken($value, 15%)};\n  // override the sphinx-design variables\n  --sd-color-#{$name}: var(--pst-color-#{$name});\n  --sd-color-#{$name}-text: var(--pst-color-#{$name}-text);\n  //TODO: highlight seems to be used for buttons @trallard to fix on a11y follow-up work\n  --sd-color-#{$name}-highlight: var(--pst-color-#{$name}-highlight);\n}\n\n// Now we override the --sd-color-* variables.\n@each $mode in (light, dark) {\n  html[data-theme=\"#{$mode}\"] {\n    // check if this color is defined differently for light/dark\n    @each $name in $sd-semantic-color-names {\n      $definition: map-get($all-colors, $name);\n      @if type-of($definition) == map {\n        @each $key, $value in $definition {\n          @if str-index($key, $mode) != null {\n            // since now we define the bg colours in the semantic colours and not\n            // by changing opacity, we need to check if the key contains bg and the\n            // correct mode (light/dark)\n            @if str-index($key, \"bg\") != null {\n              --sd-color-#{$name}-bg: #{$value};\n              // create local variable\n              $bg-var: --sd-color-#{$name}-bg;\n              $value: check-color($value);\n              --sd-color-#{$name}-bg-text: #{a11y-combination($value)};\n            } @else {\n              $value: check-color($value);\n              @include create-sd-colors($value, $name);\n            }\n          }\n        }\n      } @else {\n        $value: map-get($all-colors, $name);\n        @include create-sd-colors($value, $name);\n      }\n    }\n  }\n}\n\n// Make sure the color border variables are set using our variables\n@each $mode in (light, dark) {\n  html[data-theme=\"#{$mode}\"] {\n    --sd-color-card-border: var(--pst-color-border);\n  }\n}\n\n/*******************************************************************************\n  * shadows\n  */\nhtml[data-theme=\"light\"] {\n  .sd-shadow-xs,\n  .sd-shadow-sm,\n  .sd-shadow-md,\n  .sd-shadow-lg {\n    @include box-shadow();\n  }\n}\n\n/*******************************************************************************\n  * cards\n  */\n\n.bd-content .sd-card {\n  border: 1px solid var(--pst-color-border);\n\n  // TODO - --pst-color-panel-background is not defined... where is this coming from?\n  .sd-card-header {\n    background-color: var(--pst-color-panel-background);\n    border-bottom: 1px solid var(--pst-color-border);\n  }\n  .sd-card-footer {\n    background-color: var(--pst-color-panel-background);\n    border-top: 1px solid var(--pst-color-border);\n  }\n\n  .sd-card-body {\n    background-color: var(--pst-color-panel-background);\n  }\n}\n/*******************************************************************************\n  * tabs\n  */\n\n.bd-content .sd-tab-set {\n  > input {\n    // Active tab label\n    &:checked + label {\n      border-color: transparent transparent var(--pst-color-primary); // top LR bottom\n      color: var(--pst-color-primary);\n    }\n\n    // Hover label\n    &:not(:checked) + label:hover {\n      border-color: var(--pst-color-secondary);\n      color: var(--pst-color-secondary);\n    }\n  }\n\n  // Tab label\n  > label {\n    color: var(--pst-color-text-muted);\n    border-top: 0.125rem solid transparent; // so hover isn't just color change\n    padding-top: 0.5em; // same as bottom padding, so hover overline looks OK\n    // Hovered label\n    html &:hover {\n      color: var(--pst-color-secondary);\n      border-color: var(--pst-color-secondary);\n    }\n  }\n}\n\n/*******************************************************************************\n* Dropdowns\n*/\n\ndetails.sd-dropdown {\n  // Remove all borders to over-ride SD behavior, and we'll add our own later\n  border: 0px !important;\n  summary.sd-card-header {\n    border: 0 !important;\n    & + div.sd-summary-content {\n      border: 0;\n    }\n  }\n  // Drop shadow should behave same as admonitions\n  @include box-shadow();\n\n  // Header is where the \"clickable\" box goes\n  summary.sd-card-header {\n    display: flex;\n    align-items: center;\n    position: relative; // So background color works\n    font-weight: 600;\n    padding-top: 0.5rem;\n    padding-bottom: 0.5rem;\n\n    // Set a variable that we can re-use for colors later\n    // We must set this in the current and content sibling container\n    // so that it is defined in both places\n    --pst-sd-dropdown-color: var(--pst-gray-500);\n    --pst-sd-dropdown-bg-color: var(--pst-color-surface);\n    & + div.sd-summary-content {\n      --pst-sd-dropdown-color: var(--sd-color-card-border);\n    }\n    @each $name in $sd-semantic-color-names {\n      &.sd-bg-#{$name} {\n        --pst-sd-dropdown-color: var(--sd-color-#{$name});\n        --pst-sd-dropdown-bg-color: var(--sd-color-#{$name}-bg);\n        // Otherwise it won't be defined in the sibling element\n        & + div.sd-summary-content {\n          --pst-sd-dropdown-color: var(--sd-color-#{$name});\n          --pst-sd-dropdown-bg-color: var(--sd-color-#{$name}-bg);\n        }\n      }\n      &.sd-bg-text-#{$name} {\n        // Use the WCAG conformant text color\n        color: var(--sd-color-#{$name}-bg-text) !important;\n      }\n    }\n\n    // Background color and border are grey by default\n    background-color: unset !important;\n    @include background-from-color-variable(--pst-sd-dropdown-bg-color);\n\n    // Add a left border with the same structure as our admonitions\n    border-left: 0.2rem solid var(--pst-sd-dropdown-color) !important;\n    & + div.sd-summary-content {\n      border-left: 0.2rem solid var(--pst-sd-dropdown-color) !important;\n      border-bottom-left-radius: calc(0.25rem - 1px);\n      background-color: var(--pst-color-on-background);\n    }\n    span.sd-summary-icon {\n      display: inline-flex;\n      align-items: center;\n      color: var(--pst-sd-dropdown-color) !important;\n      svg {\n        opacity: 1;\n      }\n    }\n\n    // Positioning of the caret\n    .sd-summary-up,\n    .sd-summary-down {\n      top: 0.7rem;\n    }\n  }\n}\n","/**\n * Sphinx togglebutton\n */\n\n.bd-content {\n  // Admonition toggles\n  .admonition {\n    button.toggle-button {\n      color: inherit;\n    }\n  }\n\n  // Details buttons\n  details.toggle-details {\n    // Over-ride border color to re-use our primary color\n    summary {\n      border-left: 3px solid var(--pst-color-primary);\n    }\n  }\n}\n","/**\n * Styles for various Sphinx execution libraries to display pre-executed notebooks.\n * For now, where these define output sections, we simply revert their background\n * to be a \"light theme\" background. This ensures that inputs/outputs behave similarly,\n * because the CSS is often controlled by each package.\n * In the future, we might add dark theme support for specific packages.\n */\n\n/*******************************************************************************\n * nbsphinx\n */\nhtml div.rendered_html\n// NBsphinx ipywidgets output selector\nhtml .jp-RenderedHTMLCommon {\n  table {\n    table-layout: auto;\n  }\n}\n\n// Dark theme special-cases\nhtml[data-theme=\"dark\"] .bd-content {\n  .nboutput {\n    .output_area.rendered_html {\n      @include cell-output-background;\n    }\n\n    .output_area.stderr {\n      background: var(--pst-color-danger);\n    }\n  }\n}\n\n// Add extra padding to the final item in an nbsphinx container\ndiv.nblast.container {\n  margin-bottom: 1rem;\n}\n\n/*******************************************************************************\n * myst NB\n */\n\ndiv.cell_output .output {\n  max-width: 100%;\n  overflow-x: auto;\n}\n\n// Dark theme special-cases\nhtml[data-theme=\"dark\"] .bd-content {\n  div.cell_output {\n    img,\n    .text_html {\n      @include cell-output-background;\n    }\n  }\n}\n\n// Prevent tables from scrunching together\n.bd-content {\n  div.cell_input {\n    display: flex;\n    flex-direction: column;\n    justify-content: stretch;\n  }\n\n  div.cell_input,\n  div.output {\n    border-radius: $admonition-border-radius;\n  }\n\n  div.output {\n    table {\n      table-layout: auto;\n    }\n  }\n}\n","/**\n * style for the various mapping libs based on leaflet (folium, geemap, ipyleaflet)\n * mainly ensure the good display of the maps in both themes and avoid the customization\n * of the tiles\n */\n\n/**\n * avoid border override from pydata-sphinx-theme\n * minimal selctor to get the priority\n */\nhtml[data-theme=\"dark\"] .bd-content img.leaflet-tile.leaflet-tile-loaded {\n  border-radius: 0;\n  padding: 0;\n}\n","/**\n * /search.html page special-cases\n */\n\n.bd-search-container {\n  /*******************************************\n  * Search results\n  */\n  // Whitespace\n  div#search-results {\n    > h2 {\n      font-size: var(--pst-font-size-icon);\n      margin-top: 0;\n    }\n\n    p.search-summary {\n      color: var(--pst-color-text-muted);\n    }\n  }\n\n  ul.search {\n    margin: 0;\n    list-style: none;\n\n    li {\n      background-image: none;\n      padding: 1rem 0;\n      margin: 1rem 0;\n      border-top: 1px solid var(--pst-color-text-muted);\n\n      // First link is the page title, it should be a bit bigger\n      > a {\n        font-size: 1.2em;\n      }\n\n      div.context,\n      p.context {\n        color: var(--pst-color-text-base);\n        margin: 0.5em 0 0 0;\n\n        // Add a # before page section titles to make it clear they are sections\n        a:before {\n          content: \"#\";\n          padding-right: 0.2em;\n          color: var(--pst-color-text-muted);\n        }\n      }\n    }\n  }\n}\n"],"names":[],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/_build/html/_static/styles/sphinx-book-theme.css b/docs/_build/html/_static/styles/sphinx-book-theme.css
deleted file mode 100644
index e514f24..0000000
--- a/docs/_build/html/_static/styles/sphinx-book-theme.css
+++ /dev/null
@@ -1,8 +0,0 @@
-/*! sphinx-book-theme CSS
- * BSD 3-Clause License
- * Copyright (c) 2020, EBP
- * All rights reserved.
- *
- * This follows the 7-1 pattern described here:
- * https://sass-guidelin.es/#architecture
- */html{--pst-font-size-base:none}html[data-theme=light]{--sbt-color-announcement:#616161}html[data-theme=dark],html[data-theme=light]{--pst-color-primary:#579aca}html{scroll-padding-top:4rem}.sbt-scroll-pixel-helper{position:absolute;width:0;height:0;top:0;left:0}.d-n,.onlyprint{display:none}@media print{.onlyprint{display:block!important}}@media print{.noprint{display:none!important}}.bd-article-container h1,.bd-article-container h2,.bd-article-container h3,.bd-article-container h4,.bd-article-container h5,.bd-article-container p.caption{color:var(--pst-color-muted)}.bd-article-container h1,.bd-article-container h2{font-weight:500}a.brackets:before{color:inherit;font-family:inherit;margin-right:0}table{position:relative}@media print{.bd-main .bd-content{margin-left:2rem;height:auto}.bd-main .bd-content #jb-print-docs-body{margin-left:0}.bd-main .bd-content #jb-print-docs-body h1{font-size:3em;text-align:center;margin-bottom:0}.bd-main .bd-content .bd-article{padding-top:0}.bd-main .bd-content .bd-article h1:first-of-type{display:none}.bd-main .bd-content .container{min-width:0!important}.bd-main .bd-content h1{margin-top:1em;margin-bottom:1em}.bd-main .bd-content h1,.bd-main .bd-content h2,.bd-main .bd-content h3,.bd-main .bd-content h4{break-after:avoid;color:#000}.bd-main .bd-content table{break-inside:avoid}.bd-main .bd-content pre{word-wrap:break-word}.bd-main .bd-content a.headerlink{display:none}.bd-main .bd-content aside.margin,.bd-main .bd-content aside.sidebar,.bd-main .bd-content blockquote.epigraph{border:none}.bd-main .bd-content .footer{margin-top:1em}.bd-main .bd-content #jb-print-toc{margin-bottom:1.5rem;margin-left:0}.bd-main .bd-content #jb-print-toc .section-nav{border-left:0!important;list-style-type:disc!important;margin-left:3em!important}.bd-main .bd-content #jb-print-toc .section-nav a{text-decoration:none!important}.bd-main .bd-content #jb-print-toc .section-nav li{display:list-item!important}.bd-main .bd-content #jb-print-toc .section-nav .nav{display:none}.bd-main .bd-footer-content{display:none!important}}.bd-header-announcement{background-color:var(--sbt-color-announcement);color:#fff}.bd-main{flex-grow:0}.bd-main .bd-content .bd-article-container{padding:0;overflow-x:unset;min-width:0}.bd-main .bd-content .bd-article-container .bd-article{padding-right:2rem;padding-left:2rem}@media (max-width:768px){.bd-main .bd-content .bd-article-container .bd-article{padding-right:1rem;padding-left:1rem}}.bd-main .bd-content .bd-article-container details.above-input summary,.bd-main .bd-content .bd-article-container details.below-input summary{border-left:3px solid var(--pst-color-primary)}@media (min-width:768px){label.sidebar-toggle.primary-toggle{display:inline-block}}@media (max-width:768px){label.sidebar-toggle.primary-toggle{margin-bottom:0}}@media (min-width:992px){label.sidebar-toggle.secondary-toggle{display:none}}@media (max-width:768px){label.sidebar-toggle.secondary-toggle{margin-bottom:0}}.bd-header-article{display:flex;align-items:center;position:sticky;top:0;background-color:var(--pst-color-background);transition:left .2s;font-size:.9em;padding:0 1rem;z-index:1020}@media (max-width:768px){.bd-header-article{padding:0 .5rem;height:3.5rem}}.scrolled .bd-header-article{box-shadow:0 6px 6px -6px var(--pst-color-shadow)}.bd-header-article .header-article__inner{padding:0}.bd-header-article .header-article-items{display:flex;align-items:center;height:3rem;width:100%}.bd-header-article .header-article-item{display:flex;align-items:center}.bd-header-article .article-header-buttons{display:flex}.bd-header-article .btn{font-size:1.3rem;color:var(--pst-color-text-muted);border:none;padding:0 .5rem}.bd-header-article .btn.show,.bd-header-article .btn:hover{color:var(--pst-color-text-base);border:none}.bd-header-article .btn.show+.dropdown-menu,.bd-header-article .btn:hover+.dropdown-menu{display:block}.bd-header-article .btn:focus{box-shadow:none}.bd-header-article .btn.dropdown-toggle:after{display:none}.bd-header-article .theme-switch-button{margin:0}.bd-header-article .theme-switch-button button,.bd-header-article .theme-switch-button i,.bd-header-article .theme-switch-button span{padding:0}.bd-header-article .theme-switch-button i,.bd-header-article .theme-switch-button span{transition:color .25s ease-out}.bd-header-article .theme-switch-button:active,.bd-header-article .theme-switch-button:hover{background-color:unset!important}.bd-header-article .theme-switch-button:active i,.bd-header-article .theme-switch-button:active span,.bd-header-article .theme-switch-button:hover i,.bd-header-article .theme-switch-button:hover span{color:var(--pst-color-text-base)}.bd-header-article .dropdown-menu{margin-top:0;transform:translateX(-75%);box-shadow:0 .2rem .5rem var(--pst-color-shadow),0 0 .0625rem var(--pst-color-shadow)!important;border-color:var(--pst-color-border);background-color:var(--pst-color-background);color:var(--pst-color-text-muted)}.bd-header-article .dropdown-menu:hover{display:block}.bd-header-article .dropdown-menu .dropdown-item{display:inline-flex;align-items:center;padding-left:.5em;font-size:1em}.bd-header-article .dropdown-menu .dropdown-item:hover{text-decoration:none;background-color:initial;color:var(--pst-color-text-base)}.bd-header-article .dropdown-menu .dropdown-item span img{height:1em}.bd-header-article .dropdown-menu .dropdown-item span.btn__icon-container{width:1.7em;align-items:center;display:inline-flex;justify-content:center}.bd-header{position:inherit}.bd-header label.sidebar-toggle{display:none}.bd-sidebar-primary{top:0;max-height:100vh;padding:1rem;transition:margin-left .25s ease 0s,opacity .25s ease 0s,visibility .25s ease 0s}@media (max-width:768px){.bd-sidebar-primary{z-index:1081}}.bd-sidebar-primary .sidebar-primary-items__start{border-top:none}@media (min-width:992px){.bd-sidebar-primary{flex-basis:20%}}@media (min-width:992px){input#__primary:checked~.bd-container .bd-sidebar-primary{margin-left:-20%;visibility:hidden;opacity:0}}.bd-sidebar-secondary{top:0}@media (max-width:992px){.bd-sidebar-secondary{z-index:1081}}.bd-sidebar-secondary .sidebar-secondary-items{padding:0;display:flex;gap:.5rem}.bd-sidebar-secondary .sidebar-secondary-items .sidebar-secondary-item{padding-top:0;padding-bottom:0}.bd-sidebar-secondary .onthispage{height:3rem;min-height:3rem;display:flex;align-items:center;margin:0;color:var(--pst-color-muted)}@media (min-width:992px){.bd-sidebar-secondary{background:var(--pst-color-background);height:fit-content;transition:max-height .4s ease;z-index:2;padding:0}.bd-sidebar-secondary .toc-item{border-left-color:var(--pst-color-surface);padding-top:0}.bd-sidebar-secondary .toc-item nav.page-toc{margin-bottom:0;transition:opacity .4s ease}.bd-sidebar-secondary.hide:not(:hover){max-height:3rem;overflow-y:hidden}.scrolled .bd-sidebar-secondary.hide:not(:hover){box-shadow:0 6px 6px -6px rgba(0,0,0,.3)}.bd-sidebar-secondary.hide:not(:hover) .onthispage:after{opacity:1;content:"\f107";font-family:Font Awesome\ 5 Free;font-weight:900;padding-left:.5em;transition:opacity .3s ease}.bd-sidebar-secondary.hide:not(:hover) nav.page-toc{opacity:0}}footer{font-size:var(--sbt-font-size-small-1)}footer.bd-footer-content{display:flex;flex-wrap:wrap;padding:15px;border-top:1px solid #ccc;font-size:87.5%}footer.bd-footer-content .bd-footer-content__inner{padding-left:0}footer.bd-footer-content .bd-footer-content__inner p{margin-bottom:0}.bd-footer-article{padding:0 1rem}@media (max-width:768px){.bd-footer-article{padding:0 .5rem}}.bd-sidebar-primary .navbar-icon-links{column-gap:.5rem}.bd-sidebar-primary .navbar-icon-links .nav-link i,.bd-sidebar-primary .navbar-icon-links .nav-link span{font-size:1.2rem}.bd-sidebar-primary .navbar-icon-links .nav-link img{font-size:.8rem}.navbar-brand{height:unset;max-height:unset;flex-direction:column;justify-content:center;gap:.25rem}.navbar-brand:hover{text-decoration:none}.navbar-brand .logo__title{font-size:1.25rem;white-space:normal;text-align:center}.navbar-brand .logo__image{height:unset}.bd-search-container{margin:2em}.bd-search-container #search-results h2:first-child{display:none}.search-button i{font-size:1.1rem}div#searchbox{padding-right:2rem;padding-left:2rem}@media (max-width:768px){div#searchbox{padding-right:1rem;padding-left:1rem}}@media (min-width:768px){div#searchbox p.highlight-link{margin-left:0}div#searchbox p.highlight-link a{font-size:1rem}}img{max-width:100%}img.align-center{margin-left:auto;margin-right:auto;display:block}img.align-left{clear:left;float:left;margin-right:1em}img.align-right{clear:right;float:right;margin-left:1em}div.figure{width:100%;margin-bottom:1em;text-align:center}div.figure.align-left{text-align:left}div.figure.align-left p.caption{margin-left:0}div.figure.align-right{text-align:right}div.figure.align-right p.caption{margin-right:0}div.figure p.caption{margin:.5em 10%}div.figure.margin-caption p.caption,div.figure.margin p.caption{margin:.5em 0}div.figure.margin-caption p.caption{text-align:left}div.figure span.caption-number{font-weight:700}div.figure span{font-size:.9rem}label.margin-toggle{margin-bottom:0}label.margin-toggle.marginnote-label{display:none}label.margin-toggle sup{user-select:none}@media (max-width:992px){label.margin-toggle{cursor:pointer;color:#0071bc}label.margin-toggle.marginnote-label{display:inline}label.margin-toggle.marginnote-label:after{content:"\2295"}}input.margin-toggle{display:none}@media (max-width:992px){input.margin-toggle:checked+.marginnote,input.margin-toggle:checked+.sidenote{display:block;float:left;left:1rem;clear:both;width:95%;margin:1rem 2.5%;position:relative}}span.marginnote,span.sidenote{z-index:2;position:relative;width:40%;float:right;background-color:unset;font-size:.9em;margin-left:.5rem;border-left:none}span.marginnote sup,span.sidenote sup{user-select:none}@media (min-width:992px),print{span.marginnote,span.sidenote{width:33%;margin:0 -36% 0 0;clear:right}span.marginnote p.sidebar-title,span.sidenote p.sidebar-title{margin-bottom:-1rem;border-bottom:none;padding-left:0}span.marginnote p.sidebar-title~*,span.sidenote p.sidebar-title~*{padding-left:0;padding-right:0}}@media (max-width:992px){span.marginnote,span.sidenote{display:none}}aside.sidebar .note{margin:1rem;padding:0 0 1rem}aside.sidebar .admonition-title{margin:0 -1rem 0 0}aside.sidebar.margin .sidebar-title:empty{display:none}aside.sidebar.margin .admonition{margin:.5rem;padding-left:0;padding-right:0}aside.sidebar.margin .admonition .admonition-title{margin-left:0;margin-right:0}@media (min-width:992px){aside.sidebar.margin{border:none}aside.sidebar.margin .admonition{margin:1rem 0;padding:0 0 1rem}}.cell.tag_margin,.cell.tag_popout,.margin.docutils.container,aside.margin,div.margin,figure.margin{z-index:2;position:relative;width:40%;float:right;background-color:unset;font-size:.9em;margin-left:.5rem}@media (min-width:992px),print{.cell.tag_margin,.cell.tag_popout,.margin.docutils.container,aside.margin,div.margin,figure.margin{width:33%;margin:0 -36% 0 0;clear:right}.cell.tag_margin p.sidebar-title,.cell.tag_popout p.sidebar-title,.margin.docutils.container p.sidebar-title,aside.margin p.sidebar-title,div.margin p.sidebar-title,figure.margin p.sidebar-title{margin-bottom:-1rem;border-bottom:none;padding-left:0}.cell.tag_margin p.sidebar-title~*,.cell.tag_popout p.sidebar-title~*,.margin.docutils.container p.sidebar-title~*,aside.margin p.sidebar-title~*,div.margin p.sidebar-title~*,figure.margin p.sidebar-title~*{padding-left:0;padding-right:0}}.cell.tag_margin div.cell.tag_margin .cell_output,.cell.tag_popout div.cell.tag_margin .cell_output,.margin.docutils.container div.cell.tag_margin .cell_output,aside.margin div.cell.tag_margin .cell_output,div.margin div.cell.tag_margin .cell_output,figure.margin div.cell.tag_margin .cell_output{padding-left:0}div.figure.margin-caption figcaption,div.figure.margin-caption p.caption,figure.margin-caption figcaption{z-index:2;position:relative;width:40%;float:right;background-color:unset;font-size:.9em;margin-left:.5rem}@media (min-width:992px),print{div.figure.margin-caption figcaption,div.figure.margin-caption p.caption,figure.margin-caption figcaption{width:33%;margin:0 -36% 0 0;clear:right}div.figure.margin-caption figcaption p.sidebar-title,div.figure.margin-caption p.caption p.sidebar-title,figure.margin-caption figcaption p.sidebar-title{margin-bottom:-1rem;border-bottom:none;padding-left:0}div.figure.margin-caption figcaption p.sidebar-title~*,div.figure.margin-caption p.caption p.sidebar-title~*,figure.margin-caption figcaption p.sidebar-title~*{padding-left:0;padding-right:0}}.margin-caption figcaption{text-align:left}div.cell.tag_full-width,div.cell.tag_full_width,div.full-width,div.full_width{z-index:2;position:relative}@media (min-width:992px){div.cell.tag_full-width,div.cell.tag_full_width,div.full-width,div.full_width{max-width:136%;width:136%}}blockquote.epigraph,blockquote.highlights,blockquote.pull-quote{font-size:1.25em;border-left:none;background-color:var(--pst-color-background)}blockquote div>p+p.attribution{font-style:normal;font-size:.9em;text-align:right;color:#6c757d;padding-right:2em}div[class*=highlight-],pre{clear:none}div.cell.tag_output_scroll div.cell_output,div.cell.tag_scroll-input div.cell_input,div.cell.tag_scroll-output div.cell_output{max-height:24em;overflow-y:auto}@media only print{div.utterances,hypothesis-sidebar{display:none}}.thebelab-cell{border:none!important;margin-right:.5em!important}.thebelab-cell .thebelab-input{padding-left:10px!important}.cell.docutils.container{padding-right:0!important}button.thebe-launch-button{height:2.5em;font-size:1em}
\ No newline at end of file
diff --git a/docs/_build/html/_static/styles/theme.css b/docs/_build/html/_static/styles/theme.css
deleted file mode 100644
index 4519dd9..0000000
--- a/docs/_build/html/_static/styles/theme.css
+++ /dev/null
@@ -1,2 +0,0 @@
-/* Provided by Sphinx's 'basic' theme, and included in the final set of assets */
-@import "../basic.css";
diff --git a/docs/_build/html/_static/togglebutton.css b/docs/_build/html/_static/togglebutton.css
deleted file mode 100644
index 54a6787..0000000
--- a/docs/_build/html/_static/togglebutton.css
+++ /dev/null
@@ -1,160 +0,0 @@
-/**
- * Admonition-based toggles
- */
-
-/* Visibility of the target */
-.admonition.toggle .admonition-title ~ * {
-    transition: opacity .3s, height .3s;
-}
-
-/* Toggle buttons inside admonitions so we see the title */
-.admonition.toggle {
-    position: relative;
-}
-
-/* Titles should cut off earlier to avoid overlapping w/ button */
-.admonition.toggle .admonition-title {
-    padding-right: 25%;
-    cursor: pointer;
-}
-
-/* Hovering will cause a slight shift in color to make it feel interactive */
-.admonition.toggle .admonition-title:hover {
-    box-shadow: inset 0 0 0px 20px rgb(0 0 0 / 1%);
-}
-
-/* Hovering will cause a slight shift in color to make it feel interactive */
-.admonition.toggle .admonition-title:active {
-    box-shadow: inset 0 0 0px 20px rgb(0 0 0 / 3%);
-}
-
-/* Remove extra whitespace below the admonition title when hidden */
-.admonition.toggle-hidden {
-    padding-bottom: 0;
-}
-
-.admonition.toggle-hidden .admonition-title {
-    margin-bottom: 0;
-}
-
-/* hides all the content of a page until de-toggled */
-.admonition.toggle-hidden .admonition-title ~ * {
-    height: 0;
-    margin: 0;
-    opacity: 0;
-    visibility: hidden;
-}
-
-/* General button style and position*/
-button.toggle-button {
-    /**
-     * Background and shape. By default there's no background
-     * but users can style as they wish
-     */  
-    background: none;
-    border: none;
-    outline: none;
-
-    /* Positioning just inside the admonition title */
-    position: absolute;
-    right: 0.5em;
-    padding: 0px;
-    border: none;
-    outline: none;
-}
-
-/* Display the toggle hint on wide screens */
-@media (min-width: 768px) {
-    button.toggle-button.toggle-button-hidden:before {
-        content: attr(data-toggle-hint);  /* This will be filled in by JS */
-        font-size: .8em;
-        align-self: center;
-    }
-}
-
-/* Icon behavior */
-.tb-icon {
-    transition: transform .2s ease-out;
-    height: 1.5em;
-    width: 1.5em;
-    stroke: currentColor;  /* So that we inherit the color of other text */
-}
-
-/* The icon should point right when closed, down when open. */
-/* Open */
-.admonition.toggle button .tb-icon {
-    transform: rotate(90deg);
-}
-
-/* Closed */
-.admonition.toggle button.toggle-button-hidden .tb-icon {
-    transform: rotate(0deg);
-}
-
-/* With details toggles, we don't rotate the icon so it points right */
-details.toggle-details .tb-icon {
-    height: 1.4em;
-    width: 1.4em;
-    margin-top: 0.1em;  /* To center the button vertically */
-}
-
-
-/**
- * Details-based toggles.
- * In this case, we wrap elements with `.toggle` in a details block.
- */
-
-/* Details blocks */
-details.toggle-details {
-    margin: 1em 0;
-}
-
-
-details.toggle-details summary {
-    display: flex;
-    align-items: center;
-    cursor: pointer;
-    list-style: none;
-    border-radius: .2em;
-    border-left: 3px solid #1976d2;
-    background-color: rgb(204 204 204 / 10%);
-    padding: 0.2em 0.7em 0.3em 0.5em; /* Less padding on left because the SVG has left margin */
-    font-size: 0.9em;
-}
-
-details.toggle-details summary:hover {
-    background-color: rgb(204 204 204 / 20%);
-}
-
-details.toggle-details summary:active {
-    background: rgb(204 204 204 / 28%);
-}
-
-.toggle-details__summary-text {
-    margin-left: 0.2em;
-}
-
-details.toggle-details[open] summary {
-    margin-bottom: .5em;
-}
-
-details.toggle-details[open] summary .tb-icon {
-    transform: rotate(90deg);
-}
-
-details.toggle-details[open] summary ~ * {
-    animation: toggle-fade-in .3s ease-out;
-}
-
-@keyframes toggle-fade-in {
-  from {opacity: 0%;}
-  to {opacity: 100%;}
-}
-
-/* Print rules - we hide all toggle button elements at print */
-@media print {
-    /* Always hide the summary so the button doesn't show up */
-    details.toggle-details summary {
-        display: none;
-    }
-}
\ No newline at end of file
diff --git a/docs/_build/html/_static/togglebutton.js b/docs/_build/html/_static/togglebutton.js
deleted file mode 100644
index 215a7ee..0000000
--- a/docs/_build/html/_static/togglebutton.js
+++ /dev/null
@@ -1,187 +0,0 @@
-/**
- * Add Toggle Buttons to elements
- */
-
-let toggleChevron = `
-<svg xmlns="http://www.w3.org/2000/svg" class="tb-icon toggle-chevron-right" width="44" height="44" viewBox="0 0 24 24" stroke-width="1.5" stroke="#000000" fill="none" stroke-linecap="round" stroke-linejoin="round">
-<path stroke="none" d="M0 0h24v24H0z" fill="none"/>
-<polyline points="9 6 15 12 9 18" />
-</svg>`;
-
-var initToggleItems = () => {
-  var itemsToToggle = document.querySelectorAll(togglebuttonSelector);
-  console.log(`[togglebutton]: Adding toggle buttons to ${itemsToToggle.length} items`)
-  // Add the button to each admonition and hook up a callback to toggle visibility
-  itemsToToggle.forEach((item, index) => {
-    if (item.classList.contains("admonition")) {
-      // If it's an admonition block, then we'll add a button inside
-      // Generate unique IDs for this item
-      var toggleID = `toggle-${index}`;
-      var buttonID = `button-${toggleID}`;
-
-      item.setAttribute('id', toggleID);
-      if (!item.classList.contains("toggle")){
-        item.classList.add("toggle");
-      }
-      // This is the button that will be added to each item to trigger the toggle
-      var collapseButton = `
-        <button type="button" id="${buttonID}" class="toggle-button" data-target="${toggleID}" data-button="${buttonID}" data-toggle-hint="${toggleHintShow}" aria-label="Toggle hidden content">
-            ${toggleChevron}
-        </button>`;
-
-      title = item.querySelector(".admonition-title")
-      title.insertAdjacentHTML("beforeend", collapseButton);
-      thisButton = document.getElementById(buttonID);
-
-      // Add click handlers for the button + admonition title (if admonition)
-      admonitionTitle = document.querySelector(`#${toggleID} > .admonition-title`)
-      if (admonitionTitle) {
-        // If an admonition, then make the whole title block clickable
-        admonitionTitle.addEventListener('click', toggleClickHandler);
-        admonitionTitle.dataset.target = toggleID
-        admonitionTitle.dataset.button = buttonID
-      } else {
-        // If not an admonition then we'll listen for the button click
-        thisButton.addEventListener('click', toggleClickHandler);
-      }
-
-      // Now hide the item for this toggle button unless explicitly noted to show
-      if (!item.classList.contains("toggle-shown")) {
-        toggleHidden(thisButton);
-      }
-    } else {
-      // If not an admonition, wrap the block in a <details> block
-      // Define the structure of the details block and insert it as a sibling
-      var detailsBlock = `
-        <details class="toggle-details">
-            <summary class="toggle-details__summary">
-              ${toggleChevron}
-              <span class="toggle-details__summary-text">${toggleHintShow}</span>
-            </summary>
-        </details>`;
-      item.insertAdjacentHTML("beforebegin", detailsBlock);
-
-      // Now move the toggle-able content inside of the details block
-      details = item.previousElementSibling
-      details.appendChild(item)
-      item.classList.add("toggle-details__container")
-
-      // Set up a click trigger to change the text as needed
-      details.addEventListener('click', (click) => {
-        let parent = click.target.parentElement;
-        if (parent.tagName.toLowerCase() == "details") {
-          summary = parent.querySelector("summary");
-          details = parent;
-        } else {
-          summary = parent;
-          details = parent.parentElement;
-        }
-        // Update the inner text for the proper hint
-        if (details.open) {
-          summary.querySelector("span.toggle-details__summary-text").innerText = toggleHintShow;
-        } else {
-          summary.querySelector("span.toggle-details__summary-text").innerText = toggleHintHide;
-        }
-        
-      });
-
-      // If we have a toggle-shown class, open details block should be open
-      if (item.classList.contains("toggle-shown")) {
-        details.click();
-      }
-    }
-  })
-};
-
-// This should simply add / remove the collapsed class and change the button text
-var toggleHidden = (button) => {
-  target = button.dataset['target']
-  var itemToToggle = document.getElementById(target);
-  if (itemToToggle.classList.contains("toggle-hidden")) {
-    itemToToggle.classList.remove("toggle-hidden");
-    button.classList.remove("toggle-button-hidden");
-  } else {
-    itemToToggle.classList.add("toggle-hidden");
-    button.classList.add("toggle-button-hidden");
-  }
-}
-
-var toggleClickHandler = (click) => {
-  // Be cause the admonition title is clickable and extends to the whole admonition
-  // We only look for a click event on this title to trigger the toggle.
-
-  if (click.target.classList.contains("admonition-title")) {
-    button = click.target.querySelector(".toggle-button");
-  } else if (click.target.classList.contains("tb-icon")) {
-    // We've clicked the icon and need to search up one parent for the button
-    button = click.target.parentElement;
-  } else if (click.target.tagName == "polyline") {
-    // We've clicked the SVG elements inside the button, need to up 2 layers
-    button = click.target.parentElement.parentElement;
-  } else if (click.target.classList.contains("toggle-button")) {
-    // We've clicked the button itself and so don't need to do anything
-    button = click.target;
-  } else {
-    console.log(`[togglebutton]: Couldn't find button for ${click.target}`)
-  }
-  target = document.getElementById(button.dataset['button']);
-  toggleHidden(target);
-}
-
-// If we want to blanket-add toggle classes to certain cells
-var addToggleToSelector = () => {
-  const selector = "";
-  if (selector.length > 0) {
-    document.querySelectorAll(selector).forEach((item) => {
-      item.classList.add("toggle");
-    })
-  }
-}
-
-// Helper function to run when the DOM is finished
-const sphinxToggleRunWhenDOMLoaded = cb => {
-  if (document.readyState != 'loading') {
-    cb()
-  } else if (document.addEventListener) {
-    document.addEventListener('DOMContentLoaded', cb)
-  } else {
-    document.attachEvent('onreadystatechange', function() {
-      if (document.readyState == 'complete') cb()
-    })
-  }
-}
-sphinxToggleRunWhenDOMLoaded(addToggleToSelector)
-sphinxToggleRunWhenDOMLoaded(initToggleItems)
-
-/** Toggle details blocks to be open when printing */
-if (toggleOpenOnPrint == "true") {
-  window.addEventListener("beforeprint", () => {
-    // Open the details
-    document.querySelectorAll("details.toggle-details").forEach((el) => {
-      el.dataset["togglestatus"] = el.open;
-      el.open = true;
-    });
-  
-    // Open the admonitions
-    document.querySelectorAll(".admonition.toggle.toggle-hidden").forEach((el) => {
-      console.log(el);
-      el.querySelector("button.toggle-button").click();
-      el.dataset["toggle_after_print"] = "true";
-    });
-  });
-  window.addEventListener("afterprint", () => {
-    // Re-close the details that were closed
-    document.querySelectorAll("details.toggle-details").forEach((el) => {
-      el.open = el.dataset["togglestatus"] == "true";
-      delete el.dataset["togglestatus"];
-    });
-  
-    // Re-close the admonition toggle buttons
-    document.querySelectorAll(".admonition.toggle").forEach((el) => {
-      if (el.dataset["toggle_after_print"] == "true") {
-        el.querySelector("button.toggle-button").click();
-        delete el.dataset["toggle_after_print"];
-      }
-    });
-  });
-}
diff --git a/docs/_build/html/_static/underscore-1.13.1.js b/docs/_build/html/_static/underscore-1.13.1.js
deleted file mode 100644
index ffd77af..0000000
--- a/docs/_build/html/_static/underscore-1.13.1.js
+++ /dev/null
@@ -1,2042 +0,0 @@
-(function (global, factory) {
-  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
-  typeof define === 'function' && define.amd ? define('underscore', factory) :
-  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, (function () {
-    var current = global._;
-    var exports = global._ = factory();
-    exports.noConflict = function () { global._ = current; return exports; };
-  }()));
-}(this, (function () {
-  //     Underscore.js 1.13.1
-  //     https://underscorejs.org
-  //     (c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
-  //     Underscore may be freely distributed under the MIT license.
-
-  // Current version.
-  var VERSION = '1.13.1';
-
-  // Establish the root object, `window` (`self`) in the browser, `global`
-  // on the server, or `this` in some virtual machines. We use `self`
-  // instead of `window` for `WebWorker` support.
-  var root = typeof self == 'object' && self.self === self && self ||
-            typeof global == 'object' && global.global === global && global ||
-            Function('return this')() ||
-            {};
-
-  // Save bytes in the minified (but not gzipped) version:
-  var ArrayProto = Array.prototype, ObjProto = Object.prototype;
-  var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;
-
-  // Create quick reference variables for speed access to core prototypes.
-  var push = ArrayProto.push,
-      slice = ArrayProto.slice,
-      toString = ObjProto.toString,
-      hasOwnProperty = ObjProto.hasOwnProperty;
-
-  // Modern feature detection.
-  var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined',
-      supportsDataView = typeof DataView !== 'undefined';
-
-  // All **ECMAScript 5+** native function implementations that we hope to use
-  // are declared here.
-  var nativeIsArray = Array.isArray,
-      nativeKeys = Object.keys,
-      nativeCreate = Object.create,
-      nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;
-
-  // Create references to these builtin functions because we override them.
-  var _isNaN = isNaN,
-      _isFinite = isFinite;
-
-  // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
-  var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
-  var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
-    'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
-
-  // The largest integer that can be represented exactly.
-  var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
-
-  // Some functions take a variable number of arguments, or a few expected
-  // arguments at the beginning and then a variable number of values to operate
-  // on. This helper accumulates all remaining arguments past the function’s
-  // argument length (or an explicit `startIndex`), into an array that becomes
-  // the last argument. Similar to ES6’s "rest parameter".
-  function restArguments(func, startIndex) {
-    startIndex = startIndex == null ? func.length - 1 : +startIndex;
-    return function() {
-      var length = Math.max(arguments.length - startIndex, 0),
-          rest = Array(length),
-          index = 0;
-      for (; index < length; index++) {
-        rest[index] = arguments[index + startIndex];
-      }
-      switch (startIndex) {
-        case 0: return func.call(this, rest);
-        case 1: return func.call(this, arguments[0], rest);
-        case 2: return func.call(this, arguments[0], arguments[1], rest);
-      }
-      var args = Array(startIndex + 1);
-      for (index = 0; index < startIndex; index++) {
-        args[index] = arguments[index];
-      }
-      args[startIndex] = rest;
-      return func.apply(this, args);
-    };
-  }
-
-  // Is a given variable an object?
-  function isObject(obj) {
-    var type = typeof obj;
-    return type === 'function' || type === 'object' && !!obj;
-  }
-
-  // Is a given value equal to null?
-  function isNull(obj) {
-    return obj === null;
-  }
-
-  // Is a given variable undefined?
-  function isUndefined(obj) {
-    return obj === void 0;
-  }
-
-  // Is a given value a boolean?
-  function isBoolean(obj) {
-    return obj === true || obj === false || toString.call(obj) === '[object Boolean]';
-  }
-
-  // Is a given value a DOM element?
-  function isElement(obj) {
-    return !!(obj && obj.nodeType === 1);
-  }
-
-  // Internal function for creating a `toString`-based type tester.
-  function tagTester(name) {
-    var tag = '[object ' + name + ']';
-    return function(obj) {
-      return toString.call(obj) === tag;
-    };
-  }
-
-  var isString = tagTester('String');
-
-  var isNumber = tagTester('Number');
-
-  var isDate = tagTester('Date');
-
-  var isRegExp = tagTester('RegExp');
-
-  var isError = tagTester('Error');
-
-  var isSymbol = tagTester('Symbol');
-
-  var isArrayBuffer = tagTester('ArrayBuffer');
-
-  var isFunction = tagTester('Function');
-
-  // Optimize `isFunction` if appropriate. Work around some `typeof` bugs in old
-  // v8, IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).
-  var nodelist = root.document && root.document.childNodes;
-  if (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {
-    isFunction = function(obj) {
-      return typeof obj == 'function' || false;
-    };
-  }
-
-  var isFunction$1 = isFunction;
-
-  var hasObjectTag = tagTester('Object');
-
-  // In IE 10 - Edge 13, `DataView` has string tag `'[object Object]'`.
-  // In IE 11, the most common among them, this problem also applies to
-  // `Map`, `WeakMap` and `Set`.
-  var hasStringTagBug = (
-        supportsDataView && hasObjectTag(new DataView(new ArrayBuffer(8)))
-      ),
-      isIE11 = (typeof Map !== 'undefined' && hasObjectTag(new Map));
-
-  var isDataView = tagTester('DataView');
-
-  // In IE 10 - Edge 13, we need a different heuristic
-  // to determine whether an object is a `DataView`.
-  function ie10IsDataView(obj) {
-    return obj != null && isFunction$1(obj.getInt8) && isArrayBuffer(obj.buffer);
-  }
-
-  var isDataView$1 = (hasStringTagBug ? ie10IsDataView : isDataView);
-
-  // Is a given value an array?
-  // Delegates to ECMA5's native `Array.isArray`.
-  var isArray = nativeIsArray || tagTester('Array');
-
-  // Internal function to check whether `key` is an own property name of `obj`.
-  function has$1(obj, key) {
-    return obj != null && hasOwnProperty.call(obj, key);
-  }
-
-  var isArguments = tagTester('Arguments');
-
-  // Define a fallback version of the method in browsers (ahem, IE < 9), where
-  // there isn't any inspectable "Arguments" type.
-  (function() {
-    if (!isArguments(arguments)) {
-      isArguments = function(obj) {
-        return has$1(obj, 'callee');
-      };
-    }
-  }());
-
-  var isArguments$1 = isArguments;
-
-  // Is a given object a finite number?
-  function isFinite$1(obj) {
-    return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));
-  }
-
-  // Is the given value `NaN`?
-  function isNaN$1(obj) {
-    return isNumber(obj) && _isNaN(obj);
-  }
-
-  // Predicate-generating function. Often useful outside of Underscore.
-  function constant(value) {
-    return function() {
-      return value;
-    };
-  }
-
-  // Common internal logic for `isArrayLike` and `isBufferLike`.
-  function createSizePropertyCheck(getSizeProperty) {
-    return function(collection) {
-      var sizeProperty = getSizeProperty(collection);
-      return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= MAX_ARRAY_INDEX;
-    }
-  }
-
-  // Internal helper to generate a function to obtain property `key` from `obj`.
-  function shallowProperty(key) {
-    return function(obj) {
-      return obj == null ? void 0 : obj[key];
-    };
-  }
-
-  // Internal helper to obtain the `byteLength` property of an object.
-  var getByteLength = shallowProperty('byteLength');
-
-  // Internal helper to determine whether we should spend extensive checks against
-  // `ArrayBuffer` et al.
-  var isBufferLike = createSizePropertyCheck(getByteLength);
-
-  // Is a given value a typed array?
-  var typedArrayPattern = /\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;
-  function isTypedArray(obj) {
-    // `ArrayBuffer.isView` is the most future-proof, so use it when available.
-    // Otherwise, fall back on the above regular expression.
-    return nativeIsView ? (nativeIsView(obj) && !isDataView$1(obj)) :
-                  isBufferLike(obj) && typedArrayPattern.test(toString.call(obj));
-  }
-
-  var isTypedArray$1 = supportsArrayBuffer ? isTypedArray : constant(false);
-
-  // Internal helper to obtain the `length` property of an object.
-  var getLength = shallowProperty('length');
-
-  // Internal helper to create a simple lookup structure.
-  // `collectNonEnumProps` used to depend on `_.contains`, but this led to
-  // circular imports. `emulatedSet` is a one-off solution that only works for
-  // arrays of strings.
-  function emulatedSet(keys) {
-    var hash = {};
-    for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;
-    return {
-      contains: function(key) { return hash[key]; },
-      push: function(key) {
-        hash[key] = true;
-        return keys.push(key);
-      }
-    };
-  }
-
-  // Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't
-  // be iterated by `for key in ...` and thus missed. Extends `keys` in place if
-  // needed.
-  function collectNonEnumProps(obj, keys) {
-    keys = emulatedSet(keys);
-    var nonEnumIdx = nonEnumerableProps.length;
-    var constructor = obj.constructor;
-    var proto = isFunction$1(constructor) && constructor.prototype || ObjProto;
-
-    // Constructor is a special case.
-    var prop = 'constructor';
-    if (has$1(obj, prop) && !keys.contains(prop)) keys.push(prop);
-
-    while (nonEnumIdx--) {
-      prop = nonEnumerableProps[nonEnumIdx];
-      if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {
-        keys.push(prop);
-      }
-    }
-  }
-
-  // Retrieve the names of an object's own properties.
-  // Delegates to **ECMAScript 5**'s native `Object.keys`.
-  function keys(obj) {
-    if (!isObject(obj)) return [];
-    if (nativeKeys) return nativeKeys(obj);
-    var keys = [];
-    for (var key in obj) if (has$1(obj, key)) keys.push(key);
-    // Ahem, IE < 9.
-    if (hasEnumBug) collectNonEnumProps(obj, keys);
-    return keys;
-  }
-
-  // Is a given array, string, or object empty?
-  // An "empty" object has no enumerable own-properties.
-  function isEmpty(obj) {
-    if (obj == null) return true;
-    // Skip the more expensive `toString`-based type checks if `obj` has no
-    // `.length`.
-    var length = getLength(obj);
-    if (typeof length == 'number' && (
-      isArray(obj) || isString(obj) || isArguments$1(obj)
-    )) return length === 0;
-    return getLength(keys(obj)) === 0;
-  }
-
-  // Returns whether an object has a given set of `key:value` pairs.
-  function isMatch(object, attrs) {
-    var _keys = keys(attrs), length = _keys.length;
-    if (object == null) return !length;
-    var obj = Object(object);
-    for (var i = 0; i < length; i++) {
-      var key = _keys[i];
-      if (attrs[key] !== obj[key] || !(key in obj)) return false;
-    }
-    return true;
-  }
-
-  // If Underscore is called as a function, it returns a wrapped object that can
-  // be used OO-style. This wrapper holds altered versions of all functions added
-  // through `_.mixin`. Wrapped objects may be chained.
-  function _$1(obj) {
-    if (obj instanceof _$1) return obj;
-    if (!(this instanceof _$1)) return new _$1(obj);
-    this._wrapped = obj;
-  }
-
-  _$1.VERSION = VERSION;
-
-  // Extracts the result from a wrapped and chained object.
-  _$1.prototype.value = function() {
-    return this._wrapped;
-  };
-
-  // Provide unwrapping proxies for some methods used in engine operations
-  // such as arithmetic and JSON stringification.
-  _$1.prototype.valueOf = _$1.prototype.toJSON = _$1.prototype.value;
-
-  _$1.prototype.toString = function() {
-    return String(this._wrapped);
-  };
-
-  // Internal function to wrap or shallow-copy an ArrayBuffer,
-  // typed array or DataView to a new view, reusing the buffer.
-  function toBufferView(bufferSource) {
-    return new Uint8Array(
-      bufferSource.buffer || bufferSource,
-      bufferSource.byteOffset || 0,
-      getByteLength(bufferSource)
-    );
-  }
-
-  // We use this string twice, so give it a name for minification.
-  var tagDataView = '[object DataView]';
-
-  // Internal recursive comparison function for `_.isEqual`.
-  function eq(a, b, aStack, bStack) {
-    // Identical objects are equal. `0 === -0`, but they aren't identical.
-    // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).
-    if (a === b) return a !== 0 || 1 / a === 1 / b;
-    // `null` or `undefined` only equal to itself (strict comparison).
-    if (a == null || b == null) return false;
-    // `NaN`s are equivalent, but non-reflexive.
-    if (a !== a) return b !== b;
-    // Exhaust primitive checks
-    var type = typeof a;
-    if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
-    return deepEq(a, b, aStack, bStack);
-  }
-
-  // Internal recursive comparison function for `_.isEqual`.
-  function deepEq(a, b, aStack, bStack) {
-    // Unwrap any wrapped objects.
-    if (a instanceof _$1) a = a._wrapped;
-    if (b instanceof _$1) b = b._wrapped;
-    // Compare `[[Class]]` names.
-    var className = toString.call(a);
-    if (className !== toString.call(b)) return false;
-    // Work around a bug in IE 10 - Edge 13.
-    if (hasStringTagBug && className == '[object Object]' && isDataView$1(a)) {
-      if (!isDataView$1(b)) return false;
-      className = tagDataView;
-    }
-    switch (className) {
-      // These types are compared by value.
-      case '[object RegExp]':
-        // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
-      case '[object String]':
-        // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
-        // equivalent to `new String("5")`.
-        return '' + a === '' + b;
-      case '[object Number]':
-        // `NaN`s are equivalent, but non-reflexive.
-        // Object(NaN) is equivalent to NaN.
-        if (+a !== +a) return +b !== +b;
-        // An `egal` comparison is performed for other numeric values.
-        return +a === 0 ? 1 / +a === 1 / b : +a === +b;
-      case '[object Date]':
-      case '[object Boolean]':
-        // Coerce dates and booleans to numeric primitive values. Dates are compared by their
-        // millisecond representations. Note that invalid dates with millisecond representations
-        // of `NaN` are not equivalent.
-        return +a === +b;
-      case '[object Symbol]':
-        return SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b);
-      case '[object ArrayBuffer]':
-      case tagDataView:
-        // Coerce to typed array so we can fall through.
-        return deepEq(toBufferView(a), toBufferView(b), aStack, bStack);
-    }
-
-    var areArrays = className === '[object Array]';
-    if (!areArrays && isTypedArray$1(a)) {
-        var byteLength = getByteLength(a);
-        if (byteLength !== getByteLength(b)) return false;
-        if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) return true;
-        areArrays = true;
-    }
-    if (!areArrays) {
-      if (typeof a != 'object' || typeof b != 'object') return false;
-
-      // Objects with different constructors are not equivalent, but `Object`s or `Array`s
-      // from different frames are.
-      var aCtor = a.constructor, bCtor = b.constructor;
-      if (aCtor !== bCtor && !(isFunction$1(aCtor) && aCtor instanceof aCtor &&
-                               isFunction$1(bCtor) && bCtor instanceof bCtor)
-                          && ('constructor' in a && 'constructor' in b)) {
-        return false;
-      }
-    }
-    // Assume equality for cyclic structures. The algorithm for detecting cyclic
-    // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
-
-    // Initializing stack of traversed objects.
-    // It's done here since we only need them for objects and arrays comparison.
-    aStack = aStack || [];
-    bStack = bStack || [];
-    var length = aStack.length;
-    while (length--) {
-      // Linear search. Performance is inversely proportional to the number of
-      // unique nested structures.
-      if (aStack[length] === a) return bStack[length] === b;
-    }
-
-    // Add the first object to the stack of traversed objects.
-    aStack.push(a);
-    bStack.push(b);
-
-    // Recursively compare objects and arrays.
-    if (areArrays) {
-      // Compare array lengths to determine if a deep comparison is necessary.
-      length = a.length;
-      if (length !== b.length) return false;
-      // Deep compare the contents, ignoring non-numeric properties.
-      while (length--) {
-        if (!eq(a[length], b[length], aStack, bStack)) return false;
-      }
-    } else {
-      // Deep compare objects.
-      var _keys = keys(a), key;
-      length = _keys.length;
-      // Ensure that both objects contain the same number of properties before comparing deep equality.
-      if (keys(b).length !== length) return false;
-      while (length--) {
-        // Deep compare each member
-        key = _keys[length];
-        if (!(has$1(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
-      }
-    }
-    // Remove the first object from the stack of traversed objects.
-    aStack.pop();
-    bStack.pop();
-    return true;
-  }
-
-  // Perform a deep comparison to check if two objects are equal.
-  function isEqual(a, b) {
-    return eq(a, b);
-  }
-
-  // Retrieve all the enumerable property names of an object.
-  function allKeys(obj) {
-    if (!isObject(obj)) return [];
-    var keys = [];
-    for (var key in obj) keys.push(key);
-    // Ahem, IE < 9.
-    if (hasEnumBug) collectNonEnumProps(obj, keys);
-    return keys;
-  }
-
-  // Since the regular `Object.prototype.toString` type tests don't work for
-  // some types in IE 11, we use a fingerprinting heuristic instead, based
-  // on the methods. It's not great, but it's the best we got.
-  // The fingerprint method lists are defined below.
-  function ie11fingerprint(methods) {
-    var length = getLength(methods);
-    return function(obj) {
-      if (obj == null) return false;
-      // `Map`, `WeakMap` and `Set` have no enumerable keys.
-      var keys = allKeys(obj);
-      if (getLength(keys)) return false;
-      for (var i = 0; i < length; i++) {
-        if (!isFunction$1(obj[methods[i]])) return false;
-      }
-      // If we are testing against `WeakMap`, we need to ensure that
-      // `obj` doesn't have a `forEach` method in order to distinguish
-      // it from a regular `Map`.
-      return methods !== weakMapMethods || !isFunction$1(obj[forEachName]);
-    };
-  }
-
-  // In the interest of compact minification, we write
-  // each string in the fingerprints only once.
-  var forEachName = 'forEach',
-      hasName = 'has',
-      commonInit = ['clear', 'delete'],
-      mapTail = ['get', hasName, 'set'];
-
-  // `Map`, `WeakMap` and `Set` each have slightly different
-  // combinations of the above sublists.
-  var mapMethods = commonInit.concat(forEachName, mapTail),
-      weakMapMethods = commonInit.concat(mapTail),
-      setMethods = ['add'].concat(commonInit, forEachName, hasName);
-
-  var isMap = isIE11 ? ie11fingerprint(mapMethods) : tagTester('Map');
-
-  var isWeakMap = isIE11 ? ie11fingerprint(weakMapMethods) : tagTester('WeakMap');
-
-  var isSet = isIE11 ? ie11fingerprint(setMethods) : tagTester('Set');
-
-  var isWeakSet = tagTester('WeakSet');
-
-  // Retrieve the values of an object's properties.
-  function values(obj) {
-    var _keys = keys(obj);
-    var length = _keys.length;
-    var values = Array(length);
-    for (var i = 0; i < length; i++) {
-      values[i] = obj[_keys[i]];
-    }
-    return values;
-  }
-
-  // Convert an object into a list of `[key, value]` pairs.
-  // The opposite of `_.object` with one argument.
-  function pairs(obj) {
-    var _keys = keys(obj);
-    var length = _keys.length;
-    var pairs = Array(length);
-    for (var i = 0; i < length; i++) {
-      pairs[i] = [_keys[i], obj[_keys[i]]];
-    }
-    return pairs;
-  }
-
-  // Invert the keys and values of an object. The values must be serializable.
-  function invert(obj) {
-    var result = {};
-    var _keys = keys(obj);
-    for (var i = 0, length = _keys.length; i < length; i++) {
-      result[obj[_keys[i]]] = _keys[i];
-    }
-    return result;
-  }
-
-  // Return a sorted list of the function names available on the object.
-  function functions(obj) {
-    var names = [];
-    for (var key in obj) {
-      if (isFunction$1(obj[key])) names.push(key);
-    }
-    return names.sort();
-  }
-
-  // An internal function for creating assigner functions.
-  function createAssigner(keysFunc, defaults) {
-    return function(obj) {
-      var length = arguments.length;
-      if (defaults) obj = Object(obj);
-      if (length < 2 || obj == null) return obj;
-      for (var index = 1; index < length; index++) {
-        var source = arguments[index],
-            keys = keysFunc(source),
-            l = keys.length;
-        for (var i = 0; i < l; i++) {
-          var key = keys[i];
-          if (!defaults || obj[key] === void 0) obj[key] = source[key];
-        }
-      }
-      return obj;
-    };
-  }
-
-  // Extend a given object with all the properties in passed-in object(s).
-  var extend = createAssigner(allKeys);
-
-  // Assigns a given object with all the own properties in the passed-in
-  // object(s).
-  // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)
-  var extendOwn = createAssigner(keys);
-
-  // Fill in a given object with default properties.
-  var defaults = createAssigner(allKeys, true);
-
-  // Create a naked function reference for surrogate-prototype-swapping.
-  function ctor() {
-    return function(){};
-  }
-
-  // An internal function for creating a new object that inherits from another.
-  function baseCreate(prototype) {
-    if (!isObject(prototype)) return {};
-    if (nativeCreate) return nativeCreate(prototype);
-    var Ctor = ctor();
-    Ctor.prototype = prototype;
-    var result = new Ctor;
-    Ctor.prototype = null;
-    return result;
-  }
-
-  // Creates an object that inherits from the given prototype object.
-  // If additional properties are provided then they will be added to the
-  // created object.
-  function create(prototype, props) {
-    var result = baseCreate(prototype);
-    if (props) extendOwn(result, props);
-    return result;
-  }
-
-  // Create a (shallow-cloned) duplicate of an object.
-  function clone(obj) {
-    if (!isObject(obj)) return obj;
-    return isArray(obj) ? obj.slice() : extend({}, obj);
-  }
-
-  // Invokes `interceptor` with the `obj` and then returns `obj`.
-  // The primary purpose of this method is to "tap into" a method chain, in
-  // order to perform operations on intermediate results within the chain.
-  function tap(obj, interceptor) {
-    interceptor(obj);
-    return obj;
-  }
-
-  // Normalize a (deep) property `path` to array.
-  // Like `_.iteratee`, this function can be customized.
-  function toPath$1(path) {
-    return isArray(path) ? path : [path];
-  }
-  _$1.toPath = toPath$1;
-
-  // Internal wrapper for `_.toPath` to enable minification.
-  // Similar to `cb` for `_.iteratee`.
-  function toPath(path) {
-    return _$1.toPath(path);
-  }
-
-  // Internal function to obtain a nested property in `obj` along `path`.
-  function deepGet(obj, path) {
-    var length = path.length;
-    for (var i = 0; i < length; i++) {
-      if (obj == null) return void 0;
-      obj = obj[path[i]];
-    }
-    return length ? obj : void 0;
-  }
-
-  // Get the value of the (deep) property on `path` from `object`.
-  // If any property in `path` does not exist or if the value is
-  // `undefined`, return `defaultValue` instead.
-  // The `path` is normalized through `_.toPath`.
-  function get(object, path, defaultValue) {
-    var value = deepGet(object, toPath(path));
-    return isUndefined(value) ? defaultValue : value;
-  }
-
-  // Shortcut function for checking if an object has a given property directly on
-  // itself (in other words, not on a prototype). Unlike the internal `has`
-  // function, this public version can also traverse nested properties.
-  function has(obj, path) {
-    path = toPath(path);
-    var length = path.length;
-    for (var i = 0; i < length; i++) {
-      var key = path[i];
-      if (!has$1(obj, key)) return false;
-      obj = obj[key];
-    }
-    return !!length;
-  }
-
-  // Keep the identity function around for default iteratees.
-  function identity(value) {
-    return value;
-  }
-
-  // Returns a predicate for checking whether an object has a given set of
-  // `key:value` pairs.
-  function matcher(attrs) {
-    attrs = extendOwn({}, attrs);
-    return function(obj) {
-      return isMatch(obj, attrs);
-    };
-  }
-
-  // Creates a function that, when passed an object, will traverse that object’s
-  // properties down the given `path`, specified as an array of keys or indices.
-  function property(path) {
-    path = toPath(path);
-    return function(obj) {
-      return deepGet(obj, path);
-    };
-  }
-
-  // Internal function that returns an efficient (for current engines) version
-  // of the passed-in callback, to be repeatedly applied in other Underscore
-  // functions.
-  function optimizeCb(func, context, argCount) {
-    if (context === void 0) return func;
-    switch (argCount == null ? 3 : argCount) {
-      case 1: return function(value) {
-        return func.call(context, value);
-      };
-      // The 2-argument case is omitted because we’re not using it.
-      case 3: return function(value, index, collection) {
-        return func.call(context, value, index, collection);
-      };
-      case 4: return function(accumulator, value, index, collection) {
-        return func.call(context, accumulator, value, index, collection);
-      };
-    }
-    return function() {
-      return func.apply(context, arguments);
-    };
-  }
-
-  // An internal function to generate callbacks that can be applied to each
-  // element in a collection, returning the desired result — either `_.identity`,
-  // an arbitrary callback, a property matcher, or a property accessor.
-  function baseIteratee(value, context, argCount) {
-    if (value == null) return identity;
-    if (isFunction$1(value)) return optimizeCb(value, context, argCount);
-    if (isObject(value) && !isArray(value)) return matcher(value);
-    return property(value);
-  }
-
-  // External wrapper for our callback generator. Users may customize
-  // `_.iteratee` if they want additional predicate/iteratee shorthand styles.
-  // This abstraction hides the internal-only `argCount` argument.
-  function iteratee(value, context) {
-    return baseIteratee(value, context, Infinity);
-  }
-  _$1.iteratee = iteratee;
-
-  // The function we call internally to generate a callback. It invokes
-  // `_.iteratee` if overridden, otherwise `baseIteratee`.
-  function cb(value, context, argCount) {
-    if (_$1.iteratee !== iteratee) return _$1.iteratee(value, context);
-    return baseIteratee(value, context, argCount);
-  }
-
-  // Returns the results of applying the `iteratee` to each element of `obj`.
-  // In contrast to `_.map` it returns an object.
-  function mapObject(obj, iteratee, context) {
-    iteratee = cb(iteratee, context);
-    var _keys = keys(obj),
-        length = _keys.length,
-        results = {};
-    for (var index = 0; index < length; index++) {
-      var currentKey = _keys[index];
-      results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
-    }
-    return results;
-  }
-
-  // Predicate-generating function. Often useful outside of Underscore.
-  function noop(){}
-
-  // Generates a function for a given object that returns a given property.
-  function propertyOf(obj) {
-    if (obj == null) return noop;
-    return function(path) {
-      return get(obj, path);
-    };
-  }
-
-  // Run a function **n** times.
-  function times(n, iteratee, context) {
-    var accum = Array(Math.max(0, n));
-    iteratee = optimizeCb(iteratee, context, 1);
-    for (var i = 0; i < n; i++) accum[i] = iteratee(i);
-    return accum;
-  }
-
-  // Return a random integer between `min` and `max` (inclusive).
-  function random(min, max) {
-    if (max == null) {
-      max = min;
-      min = 0;
-    }
-    return min + Math.floor(Math.random() * (max - min + 1));
-  }
-
-  // A (possibly faster) way to get the current timestamp as an integer.
-  var now = Date.now || function() {
-    return new Date().getTime();
-  };
-
-  // Internal helper to generate functions for escaping and unescaping strings
-  // to/from HTML interpolation.
-  function createEscaper(map) {
-    var escaper = function(match) {
-      return map[match];
-    };
-    // Regexes for identifying a key that needs to be escaped.
-    var source = '(?:' + keys(map).join('|') + ')';
-    var testRegexp = RegExp(source);
-    var replaceRegexp = RegExp(source, 'g');
-    return function(string) {
-      string = string == null ? '' : '' + string;
-      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
-    };
-  }
-
-  // Internal list of HTML entities for escaping.
-  var escapeMap = {
-    '&': '&amp;',
-    '<': '&lt;',
-    '>': '&gt;',
-    '"': '&quot;',
-    "'": '&#x27;',
-    '`': '&#x60;'
-  };
-
-  // Function for escaping strings to HTML interpolation.
-  var _escape = createEscaper(escapeMap);
-
-  // Internal list of HTML entities for unescaping.
-  var unescapeMap = invert(escapeMap);
-
-  // Function for unescaping strings from HTML interpolation.
-  var _unescape = createEscaper(unescapeMap);
-
-  // By default, Underscore uses ERB-style template delimiters. Change the
-  // following template settings to use alternative delimiters.
-  var templateSettings = _$1.templateSettings = {
-    evaluate: /<%([\s\S]+?)%>/g,
-    interpolate: /<%=([\s\S]+?)%>/g,
-    escape: /<%-([\s\S]+?)%>/g
-  };
-
-  // When customizing `_.templateSettings`, if you don't want to define an
-  // interpolation, evaluation or escaping regex, we need one that is
-  // guaranteed not to match.
-  var noMatch = /(.)^/;
-
-  // Certain characters need to be escaped so that they can be put into a
-  // string literal.
-  var escapes = {
-    "'": "'",
-    '\\': '\\',
-    '\r': 'r',
-    '\n': 'n',
-    '\u2028': 'u2028',
-    '\u2029': 'u2029'
-  };
-
-  var escapeRegExp = /\\|'|\r|\n|\u2028|\u2029/g;
-
-  function escapeChar(match) {
-    return '\\' + escapes[match];
-  }
-
-  // In order to prevent third-party code injection through
-  // `_.templateSettings.variable`, we test it against the following regular
-  // expression. It is intentionally a bit more liberal than just matching valid
-  // identifiers, but still prevents possible loopholes through defaults or
-  // destructuring assignment.
-  var bareIdentifier = /^\s*(\w|\$)+\s*$/;
-
-  // JavaScript micro-templating, similar to John Resig's implementation.
-  // Underscore templating handles arbitrary delimiters, preserves whitespace,
-  // and correctly escapes quotes within interpolated code.
-  // NB: `oldSettings` only exists for backwards compatibility.
-  function template(text, settings, oldSettings) {
-    if (!settings && oldSettings) settings = oldSettings;
-    settings = defaults({}, settings, _$1.templateSettings);
-
-    // Combine delimiters into one regular expression via alternation.
-    var matcher = RegExp([
-      (settings.escape || noMatch).source,
-      (settings.interpolate || noMatch).source,
-      (settings.evaluate || noMatch).source
-    ].join('|') + '|$', 'g');
-
-    // Compile the template source, escaping string literals appropriately.
-    var index = 0;
-    var source = "__p+='";
-    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
-      source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
-      index = offset + match.length;
-
-      if (escape) {
-        source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
-      } else if (interpolate) {
-        source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
-      } else if (evaluate) {
-        source += "';\n" + evaluate + "\n__p+='";
-      }
-
-      // Adobe VMs need the match returned to produce the correct offset.
-      return match;
-    });
-    source += "';\n";
-
-    var argument = settings.variable;
-    if (argument) {
-      // Insure against third-party code injection. (CVE-2021-23358)
-      if (!bareIdentifier.test(argument)) throw new Error(
-        'variable is not a bare identifier: ' + argument
-      );
-    } else {
-      // If a variable is not specified, place data values in local scope.
-      source = 'with(obj||{}){\n' + source + '}\n';
-      argument = 'obj';
-    }
-
-    source = "var __t,__p='',__j=Array.prototype.join," +
-      "print=function(){__p+=__j.call(arguments,'');};\n" +
-      source + 'return __p;\n';
-
-    var render;
-    try {
-      render = new Function(argument, '_', source);
-    } catch (e) {
-      e.source = source;
-      throw e;
-    }
-
-    var template = function(data) {
-      return render.call(this, data, _$1);
-    };
-
-    // Provide the compiled source as a convenience for precompilation.
-    template.source = 'function(' + argument + '){\n' + source + '}';
-
-    return template;
-  }
-
-  // Traverses the children of `obj` along `path`. If a child is a function, it
-  // is invoked with its parent as context. Returns the value of the final
-  // child, or `fallback` if any child is undefined.
-  function result(obj, path, fallback) {
-    path = toPath(path);
-    var length = path.length;
-    if (!length) {
-      return isFunction$1(fallback) ? fallback.call(obj) : fallback;
-    }
-    for (var i = 0; i < length; i++) {
-      var prop = obj == null ? void 0 : obj[path[i]];
-      if (prop === void 0) {
-        prop = fallback;
-        i = length; // Ensure we don't continue iterating.
-      }
-      obj = isFunction$1(prop) ? prop.call(obj) : prop;
-    }
-    return obj;
-  }
-
-  // Generate a unique integer id (unique within the entire client session).
-  // Useful for temporary DOM ids.
-  var idCounter = 0;
-  function uniqueId(prefix) {
-    var id = ++idCounter + '';
-    return prefix ? prefix + id : id;
-  }
-
-  // Start chaining a wrapped Underscore object.
-  function chain(obj) {
-    var instance = _$1(obj);
-    instance._chain = true;
-    return instance;
-  }
-
-  // Internal function to execute `sourceFunc` bound to `context` with optional
-  // `args`. Determines whether to execute a function as a constructor or as a
-  // normal function.
-  function executeBound(sourceFunc, boundFunc, context, callingContext, args) {
-    if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
-    var self = baseCreate(sourceFunc.prototype);
-    var result = sourceFunc.apply(self, args);
-    if (isObject(result)) return result;
-    return self;
-  }
-
-  // Partially apply a function by creating a version that has had some of its
-  // arguments pre-filled, without changing its dynamic `this` context. `_` acts
-  // as a placeholder by default, allowing any combination of arguments to be
-  // pre-filled. Set `_.partial.placeholder` for a custom placeholder argument.
-  var partial = restArguments(function(func, boundArgs) {
-    var placeholder = partial.placeholder;
-    var bound = function() {
-      var position = 0, length = boundArgs.length;
-      var args = Array(length);
-      for (var i = 0; i < length; i++) {
-        args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];
-      }
-      while (position < arguments.length) args.push(arguments[position++]);
-      return executeBound(func, bound, this, this, args);
-    };
-    return bound;
-  });
-
-  partial.placeholder = _$1;
-
-  // Create a function bound to a given object (assigning `this`, and arguments,
-  // optionally).
-  var bind = restArguments(function(func, context, args) {
-    if (!isFunction$1(func)) throw new TypeError('Bind must be called on a function');
-    var bound = restArguments(function(callArgs) {
-      return executeBound(func, bound, context, this, args.concat(callArgs));
-    });
-    return bound;
-  });
-
-  // Internal helper for collection methods to determine whether a collection
-  // should be iterated as an array or as an object.
-  // Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
-  // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
-  var isArrayLike = createSizePropertyCheck(getLength);
-
-  // Internal implementation of a recursive `flatten` function.
-  function flatten$1(input, depth, strict, output) {
-    output = output || [];
-    if (!depth && depth !== 0) {
-      depth = Infinity;
-    } else if (depth <= 0) {
-      return output.concat(input);
-    }
-    var idx = output.length;
-    for (var i = 0, length = getLength(input); i < length; i++) {
-      var value = input[i];
-      if (isArrayLike(value) && (isArray(value) || isArguments$1(value))) {
-        // Flatten current level of array or arguments object.
-        if (depth > 1) {
-          flatten$1(value, depth - 1, strict, output);
-          idx = output.length;
-        } else {
-          var j = 0, len = value.length;
-          while (j < len) output[idx++] = value[j++];
-        }
-      } else if (!strict) {
-        output[idx++] = value;
-      }
-    }
-    return output;
-  }
-
-  // Bind a number of an object's methods to that object. Remaining arguments
-  // are the method names to be bound. Useful for ensuring that all callbacks
-  // defined on an object belong to it.
-  var bindAll = restArguments(function(obj, keys) {
-    keys = flatten$1(keys, false, false);
-    var index = keys.length;
-    if (index < 1) throw new Error('bindAll must be passed function names');
-    while (index--) {
-      var key = keys[index];
-      obj[key] = bind(obj[key], obj);
-    }
-    return obj;
-  });
-
-  // Memoize an expensive function by storing its results.
-  function memoize(func, hasher) {
-    var memoize = function(key) {
-      var cache = memoize.cache;
-      var address = '' + (hasher ? hasher.apply(this, arguments) : key);
-      if (!has$1(cache, address)) cache[address] = func.apply(this, arguments);
-      return cache[address];
-    };
-    memoize.cache = {};
-    return memoize;
-  }
-
-  // Delays a function for the given number of milliseconds, and then calls
-  // it with the arguments supplied.
-  var delay = restArguments(function(func, wait, args) {
-    return setTimeout(function() {
-      return func.apply(null, args);
-    }, wait);
-  });
-
-  // Defers a function, scheduling it to run after the current call stack has
-  // cleared.
-  var defer = partial(delay, _$1, 1);
-
-  // Returns a function, that, when invoked, will only be triggered at most once
-  // during a given window of time. Normally, the throttled function will run
-  // as much as it can, without ever going more than once per `wait` duration;
-  // but if you'd like to disable the execution on the leading edge, pass
-  // `{leading: false}`. To disable execution on the trailing edge, ditto.
-  function throttle(func, wait, options) {
-    var timeout, context, args, result;
-    var previous = 0;
-    if (!options) options = {};
-
-    var later = function() {
-      previous = options.leading === false ? 0 : now();
-      timeout = null;
-      result = func.apply(context, args);
-      if (!timeout) context = args = null;
-    };
-
-    var throttled = function() {
-      var _now = now();
-      if (!previous && options.leading === false) previous = _now;
-      var remaining = wait - (_now - previous);
-      context = this;
-      args = arguments;
-      if (remaining <= 0 || remaining > wait) {
-        if (timeout) {
-          clearTimeout(timeout);
-          timeout = null;
-        }
-        previous = _now;
-        result = func.apply(context, args);
-        if (!timeout) context = args = null;
-      } else if (!timeout && options.trailing !== false) {
-        timeout = setTimeout(later, remaining);
-      }
-      return result;
-    };
-
-    throttled.cancel = function() {
-      clearTimeout(timeout);
-      previous = 0;
-      timeout = context = args = null;
-    };
-
-    return throttled;
-  }
-
-  // When a sequence of calls of the returned function ends, the argument
-  // function is triggered. The end of a sequence is defined by the `wait`
-  // parameter. If `immediate` is passed, the argument function will be
-  // triggered at the beginning of the sequence instead of at the end.
-  function debounce(func, wait, immediate) {
-    var timeout, previous, args, result, context;
-
-    var later = function() {
-      var passed = now() - previous;
-      if (wait > passed) {
-        timeout = setTimeout(later, wait - passed);
-      } else {
-        timeout = null;
-        if (!immediate) result = func.apply(context, args);
-        // This check is needed because `func` can recursively invoke `debounced`.
-        if (!timeout) args = context = null;
-      }
-    };
-
-    var debounced = restArguments(function(_args) {
-      context = this;
-      args = _args;
-      previous = now();
-      if (!timeout) {
-        timeout = setTimeout(later, wait);
-        if (immediate) result = func.apply(context, args);
-      }
-      return result;
-    });
-
-    debounced.cancel = function() {
-      clearTimeout(timeout);
-      timeout = args = context = null;
-    };
-
-    return debounced;
-  }
-
-  // Returns the first function passed as an argument to the second,
-  // allowing you to adjust arguments, run code before and after, and
-  // conditionally execute the original function.
-  function wrap(func, wrapper) {
-    return partial(wrapper, func);
-  }
-
-  // Returns a negated version of the passed-in predicate.
-  function negate(predicate) {
-    return function() {
-      return !predicate.apply(this, arguments);
-    };
-  }
-
-  // Returns a function that is the composition of a list of functions, each
-  // consuming the return value of the function that follows.
-  function compose() {
-    var args = arguments;
-    var start = args.length - 1;
-    return function() {
-      var i = start;
-      var result = args[start].apply(this, arguments);
-      while (i--) result = args[i].call(this, result);
-      return result;
-    };
-  }
-
-  // Returns a function that will only be executed on and after the Nth call.
-  function after(times, func) {
-    return function() {
-      if (--times < 1) {
-        return func.apply(this, arguments);
-      }
-    };
-  }
-
-  // Returns a function that will only be executed up to (but not including) the
-  // Nth call.
-  function before(times, func) {
-    var memo;
-    return function() {
-      if (--times > 0) {
-        memo = func.apply(this, arguments);
-      }
-      if (times <= 1) func = null;
-      return memo;
-    };
-  }
-
-  // Returns a function that will be executed at most one time, no matter how
-  // often you call it. Useful for lazy initialization.
-  var once = partial(before, 2);
-
-  // Returns the first key on an object that passes a truth test.
-  function findKey(obj, predicate, context) {
-    predicate = cb(predicate, context);
-    var _keys = keys(obj), key;
-    for (var i = 0, length = _keys.length; i < length; i++) {
-      key = _keys[i];
-      if (predicate(obj[key], key, obj)) return key;
-    }
-  }
-
-  // Internal function to generate `_.findIndex` and `_.findLastIndex`.
-  function createPredicateIndexFinder(dir) {
-    return function(array, predicate, context) {
-      predicate = cb(predicate, context);
-      var length = getLength(array);
-      var index = dir > 0 ? 0 : length - 1;
-      for (; index >= 0 && index < length; index += dir) {
-        if (predicate(array[index], index, array)) return index;
-      }
-      return -1;
-    };
-  }
-
-  // Returns the first index on an array-like that passes a truth test.
-  var findIndex = createPredicateIndexFinder(1);
-
-  // Returns the last index on an array-like that passes a truth test.
-  var findLastIndex = createPredicateIndexFinder(-1);
-
-  // Use a comparator function to figure out the smallest index at which
-  // an object should be inserted so as to maintain order. Uses binary search.
-  function sortedIndex(array, obj, iteratee, context) {
-    iteratee = cb(iteratee, context, 1);
-    var value = iteratee(obj);
-    var low = 0, high = getLength(array);
-    while (low < high) {
-      var mid = Math.floor((low + high) / 2);
-      if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
-    }
-    return low;
-  }
-
-  // Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.
-  function createIndexFinder(dir, predicateFind, sortedIndex) {
-    return function(array, item, idx) {
-      var i = 0, length = getLength(array);
-      if (typeof idx == 'number') {
-        if (dir > 0) {
-          i = idx >= 0 ? idx : Math.max(idx + length, i);
-        } else {
-          length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
-        }
-      } else if (sortedIndex && idx && length) {
-        idx = sortedIndex(array, item);
-        return array[idx] === item ? idx : -1;
-      }
-      if (item !== item) {
-        idx = predicateFind(slice.call(array, i, length), isNaN$1);
-        return idx >= 0 ? idx + i : -1;
-      }
-      for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
-        if (array[idx] === item) return idx;
-      }
-      return -1;
-    };
-  }
-
-  // Return the position of the first occurrence of an item in an array,
-  // or -1 if the item is not included in the array.
-  // If the array is large and already in sort order, pass `true`
-  // for **isSorted** to use binary search.
-  var indexOf = createIndexFinder(1, findIndex, sortedIndex);
-
-  // Return the position of the last occurrence of an item in an array,
-  // or -1 if the item is not included in the array.
-  var lastIndexOf = createIndexFinder(-1, findLastIndex);
-
-  // Return the first value which passes a truth test.
-  function find(obj, predicate, context) {
-    var keyFinder = isArrayLike(obj) ? findIndex : findKey;
-    var key = keyFinder(obj, predicate, context);
-    if (key !== void 0 && key !== -1) return obj[key];
-  }
-
-  // Convenience version of a common use case of `_.find`: getting the first
-  // object containing specific `key:value` pairs.
-  function findWhere(obj, attrs) {
-    return find(obj, matcher(attrs));
-  }
-
-  // The cornerstone for collection functions, an `each`
-  // implementation, aka `forEach`.
-  // Handles raw objects in addition to array-likes. Treats all
-  // sparse array-likes as if they were dense.
-  function each(obj, iteratee, context) {
-    iteratee = optimizeCb(iteratee, context);
-    var i, length;
-    if (isArrayLike(obj)) {
-      for (i = 0, length = obj.length; i < length; i++) {
-        iteratee(obj[i], i, obj);
-      }
-    } else {
-      var _keys = keys(obj);
-      for (i = 0, length = _keys.length; i < length; i++) {
-        iteratee(obj[_keys[i]], _keys[i], obj);
-      }
-    }
-    return obj;
-  }
-
-  // Return the results of applying the iteratee to each element.
-  function map(obj, iteratee, context) {
-    iteratee = cb(iteratee, context);
-    var _keys = !isArrayLike(obj) && keys(obj),
-        length = (_keys || obj).length,
-        results = Array(length);
-    for (var index = 0; index < length; index++) {
-      var currentKey = _keys ? _keys[index] : index;
-      results[index] = iteratee(obj[currentKey], currentKey, obj);
-    }
-    return results;
-  }
-
-  // Internal helper to create a reducing function, iterating left or right.
-  function createReduce(dir) {
-    // Wrap code that reassigns argument variables in a separate function than
-    // the one that accesses `arguments.length` to avoid a perf hit. (#1991)
-    var reducer = function(obj, iteratee, memo, initial) {
-      var _keys = !isArrayLike(obj) && keys(obj),
-          length = (_keys || obj).length,
-          index = dir > 0 ? 0 : length - 1;
-      if (!initial) {
-        memo = obj[_keys ? _keys[index] : index];
-        index += dir;
-      }
-      for (; index >= 0 && index < length; index += dir) {
-        var currentKey = _keys ? _keys[index] : index;
-        memo = iteratee(memo, obj[currentKey], currentKey, obj);
-      }
-      return memo;
-    };
-
-    return function(obj, iteratee, memo, context) {
-      var initial = arguments.length >= 3;
-      return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);
-    };
-  }
-
-  // **Reduce** builds up a single result from a list of values, aka `inject`,
-  // or `foldl`.
-  var reduce = createReduce(1);
-
-  // The right-associative version of reduce, also known as `foldr`.
-  var reduceRight = createReduce(-1);
-
-  // Return all the elements that pass a truth test.
-  function filter(obj, predicate, context) {
-    var results = [];
-    predicate = cb(predicate, context);
-    each(obj, function(value, index, list) {
-      if (predicate(value, index, list)) results.push(value);
-    });
-    return results;
-  }
-
-  // Return all the elements for which a truth test fails.
-  function reject(obj, predicate, context) {
-    return filter(obj, negate(cb(predicate)), context);
-  }
-
-  // Determine whether all of the elements pass a truth test.
-  function every(obj, predicate, context) {
-    predicate = cb(predicate, context);
-    var _keys = !isArrayLike(obj) && keys(obj),
-        length = (_keys || obj).length;
-    for (var index = 0; index < length; index++) {
-      var currentKey = _keys ? _keys[index] : index;
-      if (!predicate(obj[currentKey], currentKey, obj)) return false;
-    }
-    return true;
-  }
-
-  // Determine if at least one element in the object passes a truth test.
-  function some(obj, predicate, context) {
-    predicate = cb(predicate, context);
-    var _keys = !isArrayLike(obj) && keys(obj),
-        length = (_keys || obj).length;
-    for (var index = 0; index < length; index++) {
-      var currentKey = _keys ? _keys[index] : index;
-      if (predicate(obj[currentKey], currentKey, obj)) return true;
-    }
-    return false;
-  }
-
-  // Determine if the array or object contains a given item (using `===`).
-  function contains(obj, item, fromIndex, guard) {
-    if (!isArrayLike(obj)) obj = values(obj);
-    if (typeof fromIndex != 'number' || guard) fromIndex = 0;
-    return indexOf(obj, item, fromIndex) >= 0;
-  }
-
-  // Invoke a method (with arguments) on every item in a collection.
-  var invoke = restArguments(function(obj, path, args) {
-    var contextPath, func;
-    if (isFunction$1(path)) {
-      func = path;
-    } else {
-      path = toPath(path);
-      contextPath = path.slice(0, -1);
-      path = path[path.length - 1];
-    }
-    return map(obj, function(context) {
-      var method = func;
-      if (!method) {
-        if (contextPath && contextPath.length) {
-          context = deepGet(context, contextPath);
-        }
-        if (context == null) return void 0;
-        method = context[path];
-      }
-      return method == null ? method : method.apply(context, args);
-    });
-  });
-
-  // Convenience version of a common use case of `_.map`: fetching a property.
-  function pluck(obj, key) {
-    return map(obj, property(key));
-  }
-
-  // Convenience version of a common use case of `_.filter`: selecting only
-  // objects containing specific `key:value` pairs.
-  function where(obj, attrs) {
-    return filter(obj, matcher(attrs));
-  }
-
-  // Return the maximum element (or element-based computation).
-  function max(obj, iteratee, context) {
-    var result = -Infinity, lastComputed = -Infinity,
-        value, computed;
-    if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
-      obj = isArrayLike(obj) ? obj : values(obj);
-      for (var i = 0, length = obj.length; i < length; i++) {
-        value = obj[i];
-        if (value != null && value > result) {
-          result = value;
-        }
-      }
-    } else {
-      iteratee = cb(iteratee, context);
-      each(obj, function(v, index, list) {
-        computed = iteratee(v, index, list);
-        if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
-          result = v;
-          lastComputed = computed;
-        }
-      });
-    }
-    return result;
-  }
-
-  // Return the minimum element (or element-based computation).
-  function min(obj, iteratee, context) {
-    var result = Infinity, lastComputed = Infinity,
-        value, computed;
-    if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
-      obj = isArrayLike(obj) ? obj : values(obj);
-      for (var i = 0, length = obj.length; i < length; i++) {
-        value = obj[i];
-        if (value != null && value < result) {
-          result = value;
-        }
-      }
-    } else {
-      iteratee = cb(iteratee, context);
-      each(obj, function(v, index, list) {
-        computed = iteratee(v, index, list);
-        if (computed < lastComputed || computed === Infinity && result === Infinity) {
-          result = v;
-          lastComputed = computed;
-        }
-      });
-    }
-    return result;
-  }
-
-  // Sample **n** random values from a collection using the modern version of the
-  // [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
-  // If **n** is not specified, returns a single random element.
-  // The internal `guard` argument allows it to work with `_.map`.
-  function sample(obj, n, guard) {
-    if (n == null || guard) {
-      if (!isArrayLike(obj)) obj = values(obj);
-      return obj[random(obj.length - 1)];
-    }
-    var sample = isArrayLike(obj) ? clone(obj) : values(obj);
-    var length = getLength(sample);
-    n = Math.max(Math.min(n, length), 0);
-    var last = length - 1;
-    for (var index = 0; index < n; index++) {
-      var rand = random(index, last);
-      var temp = sample[index];
-      sample[index] = sample[rand];
-      sample[rand] = temp;
-    }
-    return sample.slice(0, n);
-  }
-
-  // Shuffle a collection.
-  function shuffle(obj) {
-    return sample(obj, Infinity);
-  }
-
-  // Sort the object's values by a criterion produced by an iteratee.
-  function sortBy(obj, iteratee, context) {
-    var index = 0;
-    iteratee = cb(iteratee, context);
-    return pluck(map(obj, function(value, key, list) {
-      return {
-        value: value,
-        index: index++,
-        criteria: iteratee(value, key, list)
-      };
-    }).sort(function(left, right) {
-      var a = left.criteria;
-      var b = right.criteria;
-      if (a !== b) {
-        if (a > b || a === void 0) return 1;
-        if (a < b || b === void 0) return -1;
-      }
-      return left.index - right.index;
-    }), 'value');
-  }
-
-  // An internal function used for aggregate "group by" operations.
-  function group(behavior, partition) {
-    return function(obj, iteratee, context) {
-      var result = partition ? [[], []] : {};
-      iteratee = cb(iteratee, context);
-      each(obj, function(value, index) {
-        var key = iteratee(value, index, obj);
-        behavior(result, value, key);
-      });
-      return result;
-    };
-  }
-
-  // Groups the object's values by a criterion. Pass either a string attribute
-  // to group by, or a function that returns the criterion.
-  var groupBy = group(function(result, value, key) {
-    if (has$1(result, key)) result[key].push(value); else result[key] = [value];
-  });
-
-  // Indexes the object's values by a criterion, similar to `_.groupBy`, but for
-  // when you know that your index values will be unique.
-  var indexBy = group(function(result, value, key) {
-    result[key] = value;
-  });
-
-  // Counts instances of an object that group by a certain criterion. Pass
-  // either a string attribute to count by, or a function that returns the
-  // criterion.
-  var countBy = group(function(result, value, key) {
-    if (has$1(result, key)) result[key]++; else result[key] = 1;
-  });
-
-  // Split a collection into two arrays: one whose elements all pass the given
-  // truth test, and one whose elements all do not pass the truth test.
-  var partition = group(function(result, value, pass) {
-    result[pass ? 0 : 1].push(value);
-  }, true);
-
-  // Safely create a real, live array from anything iterable.
-  var reStrSymbol = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
-  function toArray(obj) {
-    if (!obj) return [];
-    if (isArray(obj)) return slice.call(obj);
-    if (isString(obj)) {
-      // Keep surrogate pair characters together.
-      return obj.match(reStrSymbol);
-    }
-    if (isArrayLike(obj)) return map(obj, identity);
-    return values(obj);
-  }
-
-  // Return the number of elements in a collection.
-  function size(obj) {
-    if (obj == null) return 0;
-    return isArrayLike(obj) ? obj.length : keys(obj).length;
-  }
-
-  // Internal `_.pick` helper function to determine whether `key` is an enumerable
-  // property name of `obj`.
-  function keyInObj(value, key, obj) {
-    return key in obj;
-  }
-
-  // Return a copy of the object only containing the allowed properties.
-  var pick = restArguments(function(obj, keys) {
-    var result = {}, iteratee = keys[0];
-    if (obj == null) return result;
-    if (isFunction$1(iteratee)) {
-      if (keys.length > 1) iteratee = optimizeCb(iteratee, keys[1]);
-      keys = allKeys(obj);
-    } else {
-      iteratee = keyInObj;
-      keys = flatten$1(keys, false, false);
-      obj = Object(obj);
-    }
-    for (var i = 0, length = keys.length; i < length; i++) {
-      var key = keys[i];
-      var value = obj[key];
-      if (iteratee(value, key, obj)) result[key] = value;
-    }
-    return result;
-  });
-
-  // Return a copy of the object without the disallowed properties.
-  var omit = restArguments(function(obj, keys) {
-    var iteratee = keys[0], context;
-    if (isFunction$1(iteratee)) {
-      iteratee = negate(iteratee);
-      if (keys.length > 1) context = keys[1];
-    } else {
-      keys = map(flatten$1(keys, false, false), String);
-      iteratee = function(value, key) {
-        return !contains(keys, key);
-      };
-    }
-    return pick(obj, iteratee, context);
-  });
-
-  // Returns everything but the last entry of the array. Especially useful on
-  // the arguments object. Passing **n** will return all the values in
-  // the array, excluding the last N.
-  function initial(array, n, guard) {
-    return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));
-  }
-
-  // Get the first element of an array. Passing **n** will return the first N
-  // values in the array. The **guard** check allows it to work with `_.map`.
-  function first(array, n, guard) {
-    if (array == null || array.length < 1) return n == null || guard ? void 0 : [];
-    if (n == null || guard) return array[0];
-    return initial(array, array.length - n);
-  }
-
-  // Returns everything but the first entry of the `array`. Especially useful on
-  // the `arguments` object. Passing an **n** will return the rest N values in the
-  // `array`.
-  function rest(array, n, guard) {
-    return slice.call(array, n == null || guard ? 1 : n);
-  }
-
-  // Get the last element of an array. Passing **n** will return the last N
-  // values in the array.
-  function last(array, n, guard) {
-    if (array == null || array.length < 1) return n == null || guard ? void 0 : [];
-    if (n == null || guard) return array[array.length - 1];
-    return rest(array, Math.max(0, array.length - n));
-  }
-
-  // Trim out all falsy values from an array.
-  function compact(array) {
-    return filter(array, Boolean);
-  }
-
-  // Flatten out an array, either recursively (by default), or up to `depth`.
-  // Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.
-  function flatten(array, depth) {
-    return flatten$1(array, depth, false);
-  }
-
-  // Take the difference between one array and a number of other arrays.
-  // Only the elements present in just the first array will remain.
-  var difference = restArguments(function(array, rest) {
-    rest = flatten$1(rest, true, true);
-    return filter(array, function(value){
-      return !contains(rest, value);
-    });
-  });
-
-  // Return a version of the array that does not contain the specified value(s).
-  var without = restArguments(function(array, otherArrays) {
-    return difference(array, otherArrays);
-  });
-
-  // Produce a duplicate-free version of the array. If the array has already
-  // been sorted, you have the option of using a faster algorithm.
-  // The faster algorithm will not work with an iteratee if the iteratee
-  // is not a one-to-one function, so providing an iteratee will disable
-  // the faster algorithm.
-  function uniq(array, isSorted, iteratee, context) {
-    if (!isBoolean(isSorted)) {
-      context = iteratee;
-      iteratee = isSorted;
-      isSorted = false;
-    }
-    if (iteratee != null) iteratee = cb(iteratee, context);
-    var result = [];
-    var seen = [];
-    for (var i = 0, length = getLength(array); i < length; i++) {
-      var value = array[i],
-          computed = iteratee ? iteratee(value, i, array) : value;
-      if (isSorted && !iteratee) {
-        if (!i || seen !== computed) result.push(value);
-        seen = computed;
-      } else if (iteratee) {
-        if (!contains(seen, computed)) {
-          seen.push(computed);
-          result.push(value);
-        }
-      } else if (!contains(result, value)) {
-        result.push(value);
-      }
-    }
-    return result;
-  }
-
-  // Produce an array that contains the union: each distinct element from all of
-  // the passed-in arrays.
-  var union = restArguments(function(arrays) {
-    return uniq(flatten$1(arrays, true, true));
-  });
-
-  // Produce an array that contains every item shared between all the
-  // passed-in arrays.
-  function intersection(array) {
-    var result = [];
-    var argsLength = arguments.length;
-    for (var i = 0, length = getLength(array); i < length; i++) {
-      var item = array[i];
-      if (contains(result, item)) continue;
-      var j;
-      for (j = 1; j < argsLength; j++) {
-        if (!contains(arguments[j], item)) break;
-      }
-      if (j === argsLength) result.push(item);
-    }
-    return result;
-  }
-
-  // Complement of zip. Unzip accepts an array of arrays and groups
-  // each array's elements on shared indices.
-  function unzip(array) {
-    var length = array && max(array, getLength).length || 0;
-    var result = Array(length);
-
-    for (var index = 0; index < length; index++) {
-      result[index] = pluck(array, index);
-    }
-    return result;
-  }
-
-  // Zip together multiple lists into a single array -- elements that share
-  // an index go together.
-  var zip = restArguments(unzip);
-
-  // Converts lists into objects. Pass either a single array of `[key, value]`
-  // pairs, or two parallel arrays of the same length -- one of keys, and one of
-  // the corresponding values. Passing by pairs is the reverse of `_.pairs`.
-  function object(list, values) {
-    var result = {};
-    for (var i = 0, length = getLength(list); i < length; i++) {
-      if (values) {
-        result[list[i]] = values[i];
-      } else {
-        result[list[i][0]] = list[i][1];
-      }
-    }
-    return result;
-  }
-
-  // Generate an integer Array containing an arithmetic progression. A port of
-  // the native Python `range()` function. See
-  // [the Python documentation](https://docs.python.org/library/functions.html#range).
-  function range(start, stop, step) {
-    if (stop == null) {
-      stop = start || 0;
-      start = 0;
-    }
-    if (!step) {
-      step = stop < start ? -1 : 1;
-    }
-
-    var length = Math.max(Math.ceil((stop - start) / step), 0);
-    var range = Array(length);
-
-    for (var idx = 0; idx < length; idx++, start += step) {
-      range[idx] = start;
-    }
-
-    return range;
-  }
-
-  // Chunk a single array into multiple arrays, each containing `count` or fewer
-  // items.
-  function chunk(array, count) {
-    if (count == null || count < 1) return [];
-    var result = [];
-    var i = 0, length = array.length;
-    while (i < length) {
-      result.push(slice.call(array, i, i += count));
-    }
-    return result;
-  }
-
-  // Helper function to continue chaining intermediate results.
-  function chainResult(instance, obj) {
-    return instance._chain ? _$1(obj).chain() : obj;
-  }
-
-  // Add your own custom functions to the Underscore object.
-  function mixin(obj) {
-    each(functions(obj), function(name) {
-      var func = _$1[name] = obj[name];
-      _$1.prototype[name] = function() {
-        var args = [this._wrapped];
-        push.apply(args, arguments);
-        return chainResult(this, func.apply(_$1, args));
-      };
-    });
-    return _$1;
-  }
-
-  // Add all mutator `Array` functions to the wrapper.
-  each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
-    var method = ArrayProto[name];
-    _$1.prototype[name] = function() {
-      var obj = this._wrapped;
-      if (obj != null) {
-        method.apply(obj, arguments);
-        if ((name === 'shift' || name === 'splice') && obj.length === 0) {
-          delete obj[0];
-        }
-      }
-      return chainResult(this, obj);
-    };
-  });
-
-  // Add all accessor `Array` functions to the wrapper.
-  each(['concat', 'join', 'slice'], function(name) {
-    var method = ArrayProto[name];
-    _$1.prototype[name] = function() {
-      var obj = this._wrapped;
-      if (obj != null) obj = method.apply(obj, arguments);
-      return chainResult(this, obj);
-    };
-  });
-
-  // Named Exports
-
-  var allExports = {
-    __proto__: null,
-    VERSION: VERSION,
-    restArguments: restArguments,
-    isObject: isObject,
-    isNull: isNull,
-    isUndefined: isUndefined,
-    isBoolean: isBoolean,
-    isElement: isElement,
-    isString: isString,
-    isNumber: isNumber,
-    isDate: isDate,
-    isRegExp: isRegExp,
-    isError: isError,
-    isSymbol: isSymbol,
-    isArrayBuffer: isArrayBuffer,
-    isDataView: isDataView$1,
-    isArray: isArray,
-    isFunction: isFunction$1,
-    isArguments: isArguments$1,
-    isFinite: isFinite$1,
-    isNaN: isNaN$1,
-    isTypedArray: isTypedArray$1,
-    isEmpty: isEmpty,
-    isMatch: isMatch,
-    isEqual: isEqual,
-    isMap: isMap,
-    isWeakMap: isWeakMap,
-    isSet: isSet,
-    isWeakSet: isWeakSet,
-    keys: keys,
-    allKeys: allKeys,
-    values: values,
-    pairs: pairs,
-    invert: invert,
-    functions: functions,
-    methods: functions,
-    extend: extend,
-    extendOwn: extendOwn,
-    assign: extendOwn,
-    defaults: defaults,
-    create: create,
-    clone: clone,
-    tap: tap,
-    get: get,
-    has: has,
-    mapObject: mapObject,
-    identity: identity,
-    constant: constant,
-    noop: noop,
-    toPath: toPath$1,
-    property: property,
-    propertyOf: propertyOf,
-    matcher: matcher,
-    matches: matcher,
-    times: times,
-    random: random,
-    now: now,
-    escape: _escape,
-    unescape: _unescape,
-    templateSettings: templateSettings,
-    template: template,
-    result: result,
-    uniqueId: uniqueId,
-    chain: chain,
-    iteratee: iteratee,
-    partial: partial,
-    bind: bind,
-    bindAll: bindAll,
-    memoize: memoize,
-    delay: delay,
-    defer: defer,
-    throttle: throttle,
-    debounce: debounce,
-    wrap: wrap,
-    negate: negate,
-    compose: compose,
-    after: after,
-    before: before,
-    once: once,
-    findKey: findKey,
-    findIndex: findIndex,
-    findLastIndex: findLastIndex,
-    sortedIndex: sortedIndex,
-    indexOf: indexOf,
-    lastIndexOf: lastIndexOf,
-    find: find,
-    detect: find,
-    findWhere: findWhere,
-    each: each,
-    forEach: each,
-    map: map,
-    collect: map,
-    reduce: reduce,
-    foldl: reduce,
-    inject: reduce,
-    reduceRight: reduceRight,
-    foldr: reduceRight,
-    filter: filter,
-    select: filter,
-    reject: reject,
-    every: every,
-    all: every,
-    some: some,
-    any: some,
-    contains: contains,
-    includes: contains,
-    include: contains,
-    invoke: invoke,
-    pluck: pluck,
-    where: where,
-    max: max,
-    min: min,
-    shuffle: shuffle,
-    sample: sample,
-    sortBy: sortBy,
-    groupBy: groupBy,
-    indexBy: indexBy,
-    countBy: countBy,
-    partition: partition,
-    toArray: toArray,
-    size: size,
-    pick: pick,
-    omit: omit,
-    first: first,
-    head: first,
-    take: first,
-    initial: initial,
-    last: last,
-    rest: rest,
-    tail: rest,
-    drop: rest,
-    compact: compact,
-    flatten: flatten,
-    without: without,
-    uniq: uniq,
-    unique: uniq,
-    union: union,
-    intersection: intersection,
-    difference: difference,
-    unzip: unzip,
-    transpose: unzip,
-    zip: zip,
-    object: object,
-    range: range,
-    chunk: chunk,
-    mixin: mixin,
-    'default': _$1
-  };
-
-  // Default Export
-
-  // Add all of the Underscore functions to the wrapper object.
-  var _ = mixin(allExports);
-  // Legacy Node.js API.
-  _._ = _;
-
-  return _;
-
-})));
-//# sourceMappingURL=underscore-umd.js.map
diff --git a/docs/_build/html/_static/underscore.js b/docs/_build/html/_static/underscore.js
deleted file mode 100644
index cf177d4..0000000
--- a/docs/_build/html/_static/underscore.js
+++ /dev/null
@@ -1,6 +0,0 @@
-!function(n,r){"object"==typeof exports&&"undefined"!=typeof module?module.exports=r():"function"==typeof define&&define.amd?define("underscore",r):(n="undefined"!=typeof globalThis?globalThis:n||self,function(){var t=n._,e=n._=r();e.noConflict=function(){return n._=t,e}}())}(this,(function(){
-//     Underscore.js 1.13.1
-//     https://underscorejs.org
-//     (c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
-//     Underscore may be freely distributed under the MIT license.
-var n="1.13.1",r="object"==typeof self&&self.self===self&&self||"object"==typeof global&&global.global===global&&global||Function("return this")()||{},t=Array.prototype,e=Object.prototype,u="undefined"!=typeof Symbol?Symbol.prototype:null,o=t.push,i=t.slice,a=e.toString,f=e.hasOwnProperty,c="undefined"!=typeof ArrayBuffer,l="undefined"!=typeof DataView,s=Array.isArray,p=Object.keys,v=Object.create,h=c&&ArrayBuffer.isView,y=isNaN,d=isFinite,g=!{toString:null}.propertyIsEnumerable("toString"),b=["valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"],m=Math.pow(2,53)-1;function j(n,r){return r=null==r?n.length-1:+r,function(){for(var t=Math.max(arguments.length-r,0),e=Array(t),u=0;u<t;u++)e[u]=arguments[u+r];switch(r){case 0:return n.call(this,e);case 1:return n.call(this,arguments[0],e);case 2:return n.call(this,arguments[0],arguments[1],e)}var o=Array(r+1);for(u=0;u<r;u++)o[u]=arguments[u];return o[r]=e,n.apply(this,o)}}function _(n){var r=typeof n;return"function"===r||"object"===r&&!!n}function w(n){return void 0===n}function A(n){return!0===n||!1===n||"[object Boolean]"===a.call(n)}function x(n){var r="[object "+n+"]";return function(n){return a.call(n)===r}}var S=x("String"),O=x("Number"),M=x("Date"),E=x("RegExp"),B=x("Error"),N=x("Symbol"),I=x("ArrayBuffer"),T=x("Function"),k=r.document&&r.document.childNodes;"function"!=typeof/./&&"object"!=typeof Int8Array&&"function"!=typeof k&&(T=function(n){return"function"==typeof n||!1});var D=T,R=x("Object"),F=l&&R(new DataView(new ArrayBuffer(8))),V="undefined"!=typeof Map&&R(new Map),P=x("DataView");var q=F?function(n){return null!=n&&D(n.getInt8)&&I(n.buffer)}:P,U=s||x("Array");function W(n,r){return null!=n&&f.call(n,r)}var z=x("Arguments");!function(){z(arguments)||(z=function(n){return W(n,"callee")})}();var L=z;function $(n){return O(n)&&y(n)}function C(n){return function(){return n}}function K(n){return function(r){var t=n(r);return"number"==typeof t&&t>=0&&t<=m}}function J(n){return function(r){return null==r?void 0:r[n]}}var G=J("byteLength"),H=K(G),Q=/\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;var X=c?function(n){return h?h(n)&&!q(n):H(n)&&Q.test(a.call(n))}:C(!1),Y=J("length");function Z(n,r){r=function(n){for(var r={},t=n.length,e=0;e<t;++e)r[n[e]]=!0;return{contains:function(n){return r[n]},push:function(t){return r[t]=!0,n.push(t)}}}(r);var t=b.length,u=n.constructor,o=D(u)&&u.prototype||e,i="constructor";for(W(n,i)&&!r.contains(i)&&r.push(i);t--;)(i=b[t])in n&&n[i]!==o[i]&&!r.contains(i)&&r.push(i)}function nn(n){if(!_(n))return[];if(p)return p(n);var r=[];for(var t in n)W(n,t)&&r.push(t);return g&&Z(n,r),r}function rn(n,r){var t=nn(r),e=t.length;if(null==n)return!e;for(var u=Object(n),o=0;o<e;o++){var i=t[o];if(r[i]!==u[i]||!(i in u))return!1}return!0}function tn(n){return n instanceof tn?n:this instanceof tn?void(this._wrapped=n):new tn(n)}function en(n){return new Uint8Array(n.buffer||n,n.byteOffset||0,G(n))}tn.VERSION=n,tn.prototype.value=function(){return this._wrapped},tn.prototype.valueOf=tn.prototype.toJSON=tn.prototype.value,tn.prototype.toString=function(){return String(this._wrapped)};var un="[object DataView]";function on(n,r,t,e){if(n===r)return 0!==n||1/n==1/r;if(null==n||null==r)return!1;if(n!=n)return r!=r;var o=typeof n;return("function"===o||"object"===o||"object"==typeof r)&&function n(r,t,e,o){r instanceof tn&&(r=r._wrapped);t instanceof tn&&(t=t._wrapped);var i=a.call(r);if(i!==a.call(t))return!1;if(F&&"[object Object]"==i&&q(r)){if(!q(t))return!1;i=un}switch(i){case"[object RegExp]":case"[object String]":return""+r==""+t;case"[object Number]":return+r!=+r?+t!=+t:0==+r?1/+r==1/t:+r==+t;case"[object Date]":case"[object Boolean]":return+r==+t;case"[object Symbol]":return u.valueOf.call(r)===u.valueOf.call(t);case"[object ArrayBuffer]":case un:return n(en(r),en(t),e,o)}var f="[object Array]"===i;if(!f&&X(r)){if(G(r)!==G(t))return!1;if(r.buffer===t.buffer&&r.byteOffset===t.byteOffset)return!0;f=!0}if(!f){if("object"!=typeof r||"object"!=typeof t)return!1;var c=r.constructor,l=t.constructor;if(c!==l&&!(D(c)&&c instanceof c&&D(l)&&l instanceof l)&&"constructor"in r&&"constructor"in t)return!1}o=o||[];var s=(e=e||[]).length;for(;s--;)if(e[s]===r)return o[s]===t;if(e.push(r),o.push(t),f){if((s=r.length)!==t.length)return!1;for(;s--;)if(!on(r[s],t[s],e,o))return!1}else{var p,v=nn(r);if(s=v.length,nn(t).length!==s)return!1;for(;s--;)if(p=v[s],!W(t,p)||!on(r[p],t[p],e,o))return!1}return e.pop(),o.pop(),!0}(n,r,t,e)}function an(n){if(!_(n))return[];var r=[];for(var t in n)r.push(t);return g&&Z(n,r),r}function fn(n){var r=Y(n);return function(t){if(null==t)return!1;var e=an(t);if(Y(e))return!1;for(var u=0;u<r;u++)if(!D(t[n[u]]))return!1;return n!==hn||!D(t[cn])}}var cn="forEach",ln="has",sn=["clear","delete"],pn=["get",ln,"set"],vn=sn.concat(cn,pn),hn=sn.concat(pn),yn=["add"].concat(sn,cn,ln),dn=V?fn(vn):x("Map"),gn=V?fn(hn):x("WeakMap"),bn=V?fn(yn):x("Set"),mn=x("WeakSet");function jn(n){for(var r=nn(n),t=r.length,e=Array(t),u=0;u<t;u++)e[u]=n[r[u]];return e}function _n(n){for(var r={},t=nn(n),e=0,u=t.length;e<u;e++)r[n[t[e]]]=t[e];return r}function wn(n){var r=[];for(var t in n)D(n[t])&&r.push(t);return r.sort()}function An(n,r){return function(t){var e=arguments.length;if(r&&(t=Object(t)),e<2||null==t)return t;for(var u=1;u<e;u++)for(var o=arguments[u],i=n(o),a=i.length,f=0;f<a;f++){var c=i[f];r&&void 0!==t[c]||(t[c]=o[c])}return t}}var xn=An(an),Sn=An(nn),On=An(an,!0);function Mn(n){if(!_(n))return{};if(v)return v(n);var r=function(){};r.prototype=n;var t=new r;return r.prototype=null,t}function En(n){return _(n)?U(n)?n.slice():xn({},n):n}function Bn(n){return U(n)?n:[n]}function Nn(n){return tn.toPath(n)}function In(n,r){for(var t=r.length,e=0;e<t;e++){if(null==n)return;n=n[r[e]]}return t?n:void 0}function Tn(n,r,t){var e=In(n,Nn(r));return w(e)?t:e}function kn(n){return n}function Dn(n){return n=Sn({},n),function(r){return rn(r,n)}}function Rn(n){return n=Nn(n),function(r){return In(r,n)}}function Fn(n,r,t){if(void 0===r)return n;switch(null==t?3:t){case 1:return function(t){return n.call(r,t)};case 3:return function(t,e,u){return n.call(r,t,e,u)};case 4:return function(t,e,u,o){return n.call(r,t,e,u,o)}}return function(){return n.apply(r,arguments)}}function Vn(n,r,t){return null==n?kn:D(n)?Fn(n,r,t):_(n)&&!U(n)?Dn(n):Rn(n)}function Pn(n,r){return Vn(n,r,1/0)}function qn(n,r,t){return tn.iteratee!==Pn?tn.iteratee(n,r):Vn(n,r,t)}function Un(){}function Wn(n,r){return null==r&&(r=n,n=0),n+Math.floor(Math.random()*(r-n+1))}tn.toPath=Bn,tn.iteratee=Pn;var zn=Date.now||function(){return(new Date).getTime()};function Ln(n){var r=function(r){return n[r]},t="(?:"+nn(n).join("|")+")",e=RegExp(t),u=RegExp(t,"g");return function(n){return n=null==n?"":""+n,e.test(n)?n.replace(u,r):n}}var $n={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#x27;","`":"&#x60;"},Cn=Ln($n),Kn=Ln(_n($n)),Jn=tn.templateSettings={evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,escape:/<%-([\s\S]+?)%>/g},Gn=/(.)^/,Hn={"'":"'","\\":"\\","\r":"r","\n":"n","\u2028":"u2028","\u2029":"u2029"},Qn=/\\|'|\r|\n|\u2028|\u2029/g;function Xn(n){return"\\"+Hn[n]}var Yn=/^\s*(\w|\$)+\s*$/;var Zn=0;function nr(n,r,t,e,u){if(!(e instanceof r))return n.apply(t,u);var o=Mn(n.prototype),i=n.apply(o,u);return _(i)?i:o}var rr=j((function(n,r){var t=rr.placeholder,e=function(){for(var u=0,o=r.length,i=Array(o),a=0;a<o;a++)i[a]=r[a]===t?arguments[u++]:r[a];for(;u<arguments.length;)i.push(arguments[u++]);return nr(n,e,this,this,i)};return e}));rr.placeholder=tn;var tr=j((function(n,r,t){if(!D(n))throw new TypeError("Bind must be called on a function");var e=j((function(u){return nr(n,e,r,this,t.concat(u))}));return e})),er=K(Y);function ur(n,r,t,e){if(e=e||[],r||0===r){if(r<=0)return e.concat(n)}else r=1/0;for(var u=e.length,o=0,i=Y(n);o<i;o++){var a=n[o];if(er(a)&&(U(a)||L(a)))if(r>1)ur(a,r-1,t,e),u=e.length;else for(var f=0,c=a.length;f<c;)e[u++]=a[f++];else t||(e[u++]=a)}return e}var or=j((function(n,r){var t=(r=ur(r,!1,!1)).length;if(t<1)throw new Error("bindAll must be passed function names");for(;t--;){var e=r[t];n[e]=tr(n[e],n)}return n}));var ir=j((function(n,r,t){return setTimeout((function(){return n.apply(null,t)}),r)})),ar=rr(ir,tn,1);function fr(n){return function(){return!n.apply(this,arguments)}}function cr(n,r){var t;return function(){return--n>0&&(t=r.apply(this,arguments)),n<=1&&(r=null),t}}var lr=rr(cr,2);function sr(n,r,t){r=qn(r,t);for(var e,u=nn(n),o=0,i=u.length;o<i;o++)if(r(n[e=u[o]],e,n))return e}function pr(n){return function(r,t,e){t=qn(t,e);for(var u=Y(r),o=n>0?0:u-1;o>=0&&o<u;o+=n)if(t(r[o],o,r))return o;return-1}}var vr=pr(1),hr=pr(-1);function yr(n,r,t,e){for(var u=(t=qn(t,e,1))(r),o=0,i=Y(n);o<i;){var a=Math.floor((o+i)/2);t(n[a])<u?o=a+1:i=a}return o}function dr(n,r,t){return function(e,u,o){var a=0,f=Y(e);if("number"==typeof o)n>0?a=o>=0?o:Math.max(o+f,a):f=o>=0?Math.min(o+1,f):o+f+1;else if(t&&o&&f)return e[o=t(e,u)]===u?o:-1;if(u!=u)return(o=r(i.call(e,a,f),$))>=0?o+a:-1;for(o=n>0?a:f-1;o>=0&&o<f;o+=n)if(e[o]===u)return o;return-1}}var gr=dr(1,vr,yr),br=dr(-1,hr);function mr(n,r,t){var e=(er(n)?vr:sr)(n,r,t);if(void 0!==e&&-1!==e)return n[e]}function jr(n,r,t){var e,u;if(r=Fn(r,t),er(n))for(e=0,u=n.length;e<u;e++)r(n[e],e,n);else{var o=nn(n);for(e=0,u=o.length;e<u;e++)r(n[o[e]],o[e],n)}return n}function _r(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=Array(u),i=0;i<u;i++){var a=e?e[i]:i;o[i]=r(n[a],a,n)}return o}function wr(n){var r=function(r,t,e,u){var o=!er(r)&&nn(r),i=(o||r).length,a=n>0?0:i-1;for(u||(e=r[o?o[a]:a],a+=n);a>=0&&a<i;a+=n){var f=o?o[a]:a;e=t(e,r[f],f,r)}return e};return function(n,t,e,u){var o=arguments.length>=3;return r(n,Fn(t,u,4),e,o)}}var Ar=wr(1),xr=wr(-1);function Sr(n,r,t){var e=[];return r=qn(r,t),jr(n,(function(n,t,u){r(n,t,u)&&e.push(n)})),e}function Or(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=0;o<u;o++){var i=e?e[o]:o;if(!r(n[i],i,n))return!1}return!0}function Mr(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=0;o<u;o++){var i=e?e[o]:o;if(r(n[i],i,n))return!0}return!1}function Er(n,r,t,e){return er(n)||(n=jn(n)),("number"!=typeof t||e)&&(t=0),gr(n,r,t)>=0}var Br=j((function(n,r,t){var e,u;return D(r)?u=r:(r=Nn(r),e=r.slice(0,-1),r=r[r.length-1]),_r(n,(function(n){var o=u;if(!o){if(e&&e.length&&(n=In(n,e)),null==n)return;o=n[r]}return null==o?o:o.apply(n,t)}))}));function Nr(n,r){return _r(n,Rn(r))}function Ir(n,r,t){var e,u,o=-1/0,i=-1/0;if(null==r||"number"==typeof r&&"object"!=typeof n[0]&&null!=n)for(var a=0,f=(n=er(n)?n:jn(n)).length;a<f;a++)null!=(e=n[a])&&e>o&&(o=e);else r=qn(r,t),jr(n,(function(n,t,e){((u=r(n,t,e))>i||u===-1/0&&o===-1/0)&&(o=n,i=u)}));return o}function Tr(n,r,t){if(null==r||t)return er(n)||(n=jn(n)),n[Wn(n.length-1)];var e=er(n)?En(n):jn(n),u=Y(e);r=Math.max(Math.min(r,u),0);for(var o=u-1,i=0;i<r;i++){var a=Wn(i,o),f=e[i];e[i]=e[a],e[a]=f}return e.slice(0,r)}function kr(n,r){return function(t,e,u){var o=r?[[],[]]:{};return e=qn(e,u),jr(t,(function(r,u){var i=e(r,u,t);n(o,r,i)})),o}}var Dr=kr((function(n,r,t){W(n,t)?n[t].push(r):n[t]=[r]})),Rr=kr((function(n,r,t){n[t]=r})),Fr=kr((function(n,r,t){W(n,t)?n[t]++:n[t]=1})),Vr=kr((function(n,r,t){n[t?0:1].push(r)}),!0),Pr=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function qr(n,r,t){return r in t}var Ur=j((function(n,r){var t={},e=r[0];if(null==n)return t;D(e)?(r.length>1&&(e=Fn(e,r[1])),r=an(n)):(e=qr,r=ur(r,!1,!1),n=Object(n));for(var u=0,o=r.length;u<o;u++){var i=r[u],a=n[i];e(a,i,n)&&(t[i]=a)}return t})),Wr=j((function(n,r){var t,e=r[0];return D(e)?(e=fr(e),r.length>1&&(t=r[1])):(r=_r(ur(r,!1,!1),String),e=function(n,t){return!Er(r,t)}),Ur(n,e,t)}));function zr(n,r,t){return i.call(n,0,Math.max(0,n.length-(null==r||t?1:r)))}function Lr(n,r,t){return null==n||n.length<1?null==r||t?void 0:[]:null==r||t?n[0]:zr(n,n.length-r)}function $r(n,r,t){return i.call(n,null==r||t?1:r)}var Cr=j((function(n,r){return r=ur(r,!0,!0),Sr(n,(function(n){return!Er(r,n)}))})),Kr=j((function(n,r){return Cr(n,r)}));function Jr(n,r,t,e){A(r)||(e=t,t=r,r=!1),null!=t&&(t=qn(t,e));for(var u=[],o=[],i=0,a=Y(n);i<a;i++){var f=n[i],c=t?t(f,i,n):f;r&&!t?(i&&o===c||u.push(f),o=c):t?Er(o,c)||(o.push(c),u.push(f)):Er(u,f)||u.push(f)}return u}var Gr=j((function(n){return Jr(ur(n,!0,!0))}));function Hr(n){for(var r=n&&Ir(n,Y).length||0,t=Array(r),e=0;e<r;e++)t[e]=Nr(n,e);return t}var Qr=j(Hr);function Xr(n,r){return n._chain?tn(r).chain():r}function Yr(n){return jr(wn(n),(function(r){var t=tn[r]=n[r];tn.prototype[r]=function(){var n=[this._wrapped];return o.apply(n,arguments),Xr(this,t.apply(tn,n))}})),tn}jr(["pop","push","reverse","shift","sort","splice","unshift"],(function(n){var r=t[n];tn.prototype[n]=function(){var t=this._wrapped;return null!=t&&(r.apply(t,arguments),"shift"!==n&&"splice"!==n||0!==t.length||delete t[0]),Xr(this,t)}})),jr(["concat","join","slice"],(function(n){var r=t[n];tn.prototype[n]=function(){var n=this._wrapped;return null!=n&&(n=r.apply(n,arguments)),Xr(this,n)}}));var Zr=Yr({__proto__:null,VERSION:n,restArguments:j,isObject:_,isNull:function(n){return null===n},isUndefined:w,isBoolean:A,isElement:function(n){return!(!n||1!==n.nodeType)},isString:S,isNumber:O,isDate:M,isRegExp:E,isError:B,isSymbol:N,isArrayBuffer:I,isDataView:q,isArray:U,isFunction:D,isArguments:L,isFinite:function(n){return!N(n)&&d(n)&&!isNaN(parseFloat(n))},isNaN:$,isTypedArray:X,isEmpty:function(n){if(null==n)return!0;var r=Y(n);return"number"==typeof r&&(U(n)||S(n)||L(n))?0===r:0===Y(nn(n))},isMatch:rn,isEqual:function(n,r){return on(n,r)},isMap:dn,isWeakMap:gn,isSet:bn,isWeakSet:mn,keys:nn,allKeys:an,values:jn,pairs:function(n){for(var r=nn(n),t=r.length,e=Array(t),u=0;u<t;u++)e[u]=[r[u],n[r[u]]];return e},invert:_n,functions:wn,methods:wn,extend:xn,extendOwn:Sn,assign:Sn,defaults:On,create:function(n,r){var t=Mn(n);return r&&Sn(t,r),t},clone:En,tap:function(n,r){return r(n),n},get:Tn,has:function(n,r){for(var t=(r=Nn(r)).length,e=0;e<t;e++){var u=r[e];if(!W(n,u))return!1;n=n[u]}return!!t},mapObject:function(n,r,t){r=qn(r,t);for(var e=nn(n),u=e.length,o={},i=0;i<u;i++){var a=e[i];o[a]=r(n[a],a,n)}return o},identity:kn,constant:C,noop:Un,toPath:Bn,property:Rn,propertyOf:function(n){return null==n?Un:function(r){return Tn(n,r)}},matcher:Dn,matches:Dn,times:function(n,r,t){var e=Array(Math.max(0,n));r=Fn(r,t,1);for(var u=0;u<n;u++)e[u]=r(u);return e},random:Wn,now:zn,escape:Cn,unescape:Kn,templateSettings:Jn,template:function(n,r,t){!r&&t&&(r=t),r=On({},r,tn.templateSettings);var e=RegExp([(r.escape||Gn).source,(r.interpolate||Gn).source,(r.evaluate||Gn).source].join("|")+"|$","g"),u=0,o="__p+='";n.replace(e,(function(r,t,e,i,a){return o+=n.slice(u,a).replace(Qn,Xn),u=a+r.length,t?o+="'+\n((__t=("+t+"))==null?'':_.escape(__t))+\n'":e?o+="'+\n((__t=("+e+"))==null?'':__t)+\n'":i&&(o+="';\n"+i+"\n__p+='"),r})),o+="';\n";var i,a=r.variable;if(a){if(!Yn.test(a))throw new Error("variable is not a bare identifier: "+a)}else o="with(obj||{}){\n"+o+"}\n",a="obj";o="var __t,__p='',__j=Array.prototype.join,"+"print=function(){__p+=__j.call(arguments,'');};\n"+o+"return __p;\n";try{i=new Function(a,"_",o)}catch(n){throw n.source=o,n}var f=function(n){return i.call(this,n,tn)};return f.source="function("+a+"){\n"+o+"}",f},result:function(n,r,t){var e=(r=Nn(r)).length;if(!e)return D(t)?t.call(n):t;for(var u=0;u<e;u++){var o=null==n?void 0:n[r[u]];void 0===o&&(o=t,u=e),n=D(o)?o.call(n):o}return n},uniqueId:function(n){var r=++Zn+"";return n?n+r:r},chain:function(n){var r=tn(n);return r._chain=!0,r},iteratee:Pn,partial:rr,bind:tr,bindAll:or,memoize:function(n,r){var t=function(e){var u=t.cache,o=""+(r?r.apply(this,arguments):e);return W(u,o)||(u[o]=n.apply(this,arguments)),u[o]};return t.cache={},t},delay:ir,defer:ar,throttle:function(n,r,t){var e,u,o,i,a=0;t||(t={});var f=function(){a=!1===t.leading?0:zn(),e=null,i=n.apply(u,o),e||(u=o=null)},c=function(){var c=zn();a||!1!==t.leading||(a=c);var l=r-(c-a);return u=this,o=arguments,l<=0||l>r?(e&&(clearTimeout(e),e=null),a=c,i=n.apply(u,o),e||(u=o=null)):e||!1===t.trailing||(e=setTimeout(f,l)),i};return c.cancel=function(){clearTimeout(e),a=0,e=u=o=null},c},debounce:function(n,r,t){var e,u,o,i,a,f=function(){var c=zn()-u;r>c?e=setTimeout(f,r-c):(e=null,t||(i=n.apply(a,o)),e||(o=a=null))},c=j((function(c){return a=this,o=c,u=zn(),e||(e=setTimeout(f,r),t&&(i=n.apply(a,o))),i}));return c.cancel=function(){clearTimeout(e),e=o=a=null},c},wrap:function(n,r){return rr(r,n)},negate:fr,compose:function(){var n=arguments,r=n.length-1;return function(){for(var t=r,e=n[r].apply(this,arguments);t--;)e=n[t].call(this,e);return e}},after:function(n,r){return function(){if(--n<1)return r.apply(this,arguments)}},before:cr,once:lr,findKey:sr,findIndex:vr,findLastIndex:hr,sortedIndex:yr,indexOf:gr,lastIndexOf:br,find:mr,detect:mr,findWhere:function(n,r){return mr(n,Dn(r))},each:jr,forEach:jr,map:_r,collect:_r,reduce:Ar,foldl:Ar,inject:Ar,reduceRight:xr,foldr:xr,filter:Sr,select:Sr,reject:function(n,r,t){return Sr(n,fr(qn(r)),t)},every:Or,all:Or,some:Mr,any:Mr,contains:Er,includes:Er,include:Er,invoke:Br,pluck:Nr,where:function(n,r){return Sr(n,Dn(r))},max:Ir,min:function(n,r,t){var e,u,o=1/0,i=1/0;if(null==r||"number"==typeof r&&"object"!=typeof n[0]&&null!=n)for(var a=0,f=(n=er(n)?n:jn(n)).length;a<f;a++)null!=(e=n[a])&&e<o&&(o=e);else r=qn(r,t),jr(n,(function(n,t,e){((u=r(n,t,e))<i||u===1/0&&o===1/0)&&(o=n,i=u)}));return o},shuffle:function(n){return Tr(n,1/0)},sample:Tr,sortBy:function(n,r,t){var e=0;return r=qn(r,t),Nr(_r(n,(function(n,t,u){return{value:n,index:e++,criteria:r(n,t,u)}})).sort((function(n,r){var t=n.criteria,e=r.criteria;if(t!==e){if(t>e||void 0===t)return 1;if(t<e||void 0===e)return-1}return n.index-r.index})),"value")},groupBy:Dr,indexBy:Rr,countBy:Fr,partition:Vr,toArray:function(n){return n?U(n)?i.call(n):S(n)?n.match(Pr):er(n)?_r(n,kn):jn(n):[]},size:function(n){return null==n?0:er(n)?n.length:nn(n).length},pick:Ur,omit:Wr,first:Lr,head:Lr,take:Lr,initial:zr,last:function(n,r,t){return null==n||n.length<1?null==r||t?void 0:[]:null==r||t?n[n.length-1]:$r(n,Math.max(0,n.length-r))},rest:$r,tail:$r,drop:$r,compact:function(n){return Sr(n,Boolean)},flatten:function(n,r){return ur(n,r,!1)},without:Kr,uniq:Jr,unique:Jr,union:Gr,intersection:function(n){for(var r=[],t=arguments.length,e=0,u=Y(n);e<u;e++){var o=n[e];if(!Er(r,o)){var i;for(i=1;i<t&&Er(arguments[i],o);i++);i===t&&r.push(o)}}return r},difference:Cr,unzip:Hr,transpose:Hr,zip:Qr,object:function(n,r){for(var t={},e=0,u=Y(n);e<u;e++)r?t[n[e]]=r[e]:t[n[e][0]]=n[e][1];return t},range:function(n,r,t){null==r&&(r=n||0,n=0),t||(t=r<n?-1:1);for(var e=Math.max(Math.ceil((r-n)/t),0),u=Array(e),o=0;o<e;o++,n+=t)u[o]=n;return u},chunk:function(n,r){if(null==r||r<1)return[];for(var t=[],e=0,u=n.length;e<u;)t.push(i.call(n,e,e+=r));return t},mixin:Yr,default:tn});return Zr._=Zr,Zr}));
\ No newline at end of file
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/LICENSE.txt b/docs/_build/html/_static/vendor/fontawesome/6.1.2/LICENSE.txt
deleted file mode 100644
index cc557ec..0000000
--- a/docs/_build/html/_static/vendor/fontawesome/6.1.2/LICENSE.txt
+++ /dev/null
@@ -1,165 +0,0 @@
-Fonticons, Inc. (https://fontawesome.com)
-
---------------------------------------------------------------------------------
-
-Font Awesome Free License
-
-Font Awesome Free is free, open source, and GPL friendly. You can use it for
-commercial projects, open source projects, or really almost whatever you want.
-Full Font Awesome Free license: https://fontawesome.com/license/free.
-
---------------------------------------------------------------------------------
-
-# Icons: CC BY 4.0 License (https://creativecommons.org/licenses/by/4.0/)
-
-The Font Awesome Free download is licensed under a Creative Commons
-Attribution 4.0 International License and applies to all icons packaged
-as SVG and JS file types.
-
---------------------------------------------------------------------------------
-
-# Fonts: SIL OFL 1.1 License
-
-In the Font Awesome Free download, the SIL OFL license applies to all icons
-packaged as web and desktop font files.
-
-Copyright (c) 2022 Fonticons, Inc. (https://fontawesome.com)
-with Reserved Font Name: "Font Awesome".
-
-This Font Software is licensed under the SIL Open Font License, Version 1.1.
-This license is copied below, and is also available with a FAQ at:
-http://scripts.sil.org/OFL
-
-SIL OPEN FONT LICENSE
-Version 1.1 - 26 February 2007
-
-PREAMBLE
-The goals of the Open Font License (OFL) are to stimulate worldwide
-development of collaborative font projects, to support the font creation
-efforts of academic and linguistic communities, and to provide a free and
-open framework in which fonts may be shared and improved in partnership
-with others.
-
-The OFL allows the licensed fonts to be used, studied, modified and
-redistributed freely as long as they are not sold by themselves. The
-fonts, including any derivative works, can be bundled, embedded,
-redistributed and/or sold with any software provided that any reserved
-names are not used by derivative works. The fonts and derivatives,
-however, cannot be released under any other type of license. The
-requirement for fonts to remain under this license does not apply
-to any document created using the fonts or their derivatives.
-
-DEFINITIONS
-"Font Software" refers to the set of files released by the Copyright
-Holder(s) under this license and clearly marked as such. This may
-include source files, build scripts and documentation.
-
-"Reserved Font Name" refers to any names specified as such after the
-copyright statement(s).
-
-"Original Version" refers to the collection of Font Software components as
-distributed by the Copyright Holder(s).
-
-"Modified Version" refers to any derivative made by adding to, deleting,
-or substituting — in part or in whole — any of the components of the
-Original Version, by changing formats or by porting the Font Software to a
-new environment.
-
-"Author" refers to any designer, engineer, programmer, technical
-writer or other person who contributed to the Font Software.
-
-PERMISSION & CONDITIONS
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of the Font Software, to use, study, copy, merge, embed, modify,
-redistribute, and sell modified and unmodified copies of the Font
-Software, subject to the following conditions:
-
-1) Neither the Font Software nor any of its individual components,
-in Original or Modified Versions, may be sold by itself.
-
-2) Original or Modified Versions of the Font Software may be bundled,
-redistributed and/or sold with any software, provided that each copy
-contains the above copyright notice and this license. These can be
-included either as stand-alone text files, human-readable headers or
-in the appropriate machine-readable metadata fields within text or
-binary files as long as those fields can be easily viewed by the user.
-
-3) No Modified Version of the Font Software may use the Reserved Font
-Name(s) unless explicit written permission is granted by the corresponding
-Copyright Holder. This restriction only applies to the primary font name as
-presented to the users.
-
-4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
-Software shall not be used to promote, endorse or advertise any
-Modified Version, except to acknowledge the contribution(s) of the
-Copyright Holder(s) and the Author(s) or with their explicit written
-permission.
-
-5) The Font Software, modified or unmodified, in part or in whole,
-must be distributed entirely under this license, and must not be
-distributed under any other license. The requirement for fonts to
-remain under this license does not apply to any document created
-using the Font Software.
-
-TERMINATION
-This license becomes null and void if any of the above conditions are
-not met.
-
-DISCLAIMER
-THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
-OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
-COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
-INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
-DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
-OTHER DEALINGS IN THE FONT SOFTWARE.
-
---------------------------------------------------------------------------------
-
-# Code: MIT License (https://opensource.org/licenses/MIT)
-
-In the Font Awesome Free download, the MIT license applies to all non-font and
-non-icon files.
-
-Copyright 2022 Fonticons, Inc.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in the
-Software without restriction, including without limitation the rights to use, copy,
-modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
-and to permit persons to whom the Software is furnished to do so, subject to the
-following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
-INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
-PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
-HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
---------------------------------------------------------------------------------
-
-# Attribution
-
-Attribution is required by MIT, SIL OFL, and CC BY licenses. Downloaded Font
-Awesome Free files already contain embedded comments with sufficient
-attribution, so you shouldn't need to do anything additional when using these
-files normally.
-
-We've kept attribution comments terse, so we ask that you do not actively work
-to remove them from files, especially code. They're a great way for folks to
-learn about Font Awesome.
-
---------------------------------------------------------------------------------
-
-# Brand Icons
-
-All brand icons are trademarks of their respective owners. The use of these
-trademarks does not indicate endorsement of the trademark holder by Font
-Awesome, nor vice versa. **Please do not use brand logos for any purpose except
-to represent the company, product, or service to which they refer.**
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/css/all.min.css b/docs/_build/html/_static/vendor/fontawesome/6.1.2/css/all.min.css
deleted file mode 100644
index aad4b1d..0000000
--- a/docs/_build/html/_static/vendor/fontawesome/6.1.2/css/all.min.css
+++ /dev/null
@@ -1,5 +0,0 @@
-/*!
- * Font Awesome Free 6.1.2 by @fontawesome - https://fontawesome.com
- * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
- * Copyright 2022 Fonticons, Inc.
- */.fa{font-family:var(--fa-style-family,"Font Awesome 6 Free");font-weight:var(--fa-style,900)}.fa,.fa-brands,.fa-duotone,.fa-light,.fa-regular,.fa-solid,.fa-thin,.fab,.fad,.fal,.far,.fas,.fat{-moz-osx-font-smoothing:grayscale;-webkit-font-smoothing:antialiased;display:var(--fa-display,inline-block);font-style:normal;font-variant:normal;line-height:1;text-rendering:auto}.fa-1x{font-size:1em}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-6x{font-size:6em}.fa-7x{font-size:7em}.fa-8x{font-size:8em}.fa-9x{font-size:9em}.fa-10x{font-size:10em}.fa-2xs{font-size:.625em;line-height:.1em;vertical-align:.225em}.fa-xs{font-size:.75em;line-height:.08333em;vertical-align:.125em}.fa-sm{font-size:.875em;line-height:.07143em;vertical-align:.05357em}.fa-lg{font-size:1.25em;line-height:.05em;vertical-align:-.075em}.fa-xl{font-size:1.5em;line-height:.04167em;vertical-align:-.125em}.fa-2xl{font-size:2em;line-height:.03125em;vertical-align:-.1875em}.fa-fw{text-align:center;width:1.25em}.fa-ul{list-style-type:none;margin-left:var(--fa-li-margin,2.5em);padding-left:0}.fa-ul>li{position:relative}.fa-li{left:calc(var(--fa-li-width, 2em)*-1);line-height:inherit;position:absolute;text-align:center;width:var(--fa-li-width,2em)}.fa-border{border:var(--fa-border-width,.08em) var(--fa-border-style,solid) var(--fa-border-color,#eee);border-radius:var(--fa-border-radius,.1em);padding:var(--fa-border-padding,.2em .25em .15em)}.fa-pull-left{float:left;margin-right:var(--fa-pull-margin,.3em)}.fa-pull-right{float:right;margin-left:var(--fa-pull-margin,.3em)}.fa-beat{-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-beat;animation-name:fa-beat;-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-bounce{-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-bounce;animation-name:fa-bounce;-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1))}.fa-fade{-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-fade;animation-name:fa-fade;-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-beat-fade,.fa-fade{-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s)}.fa-beat-fade{-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-beat-fade;animation-name:fa-beat-fade;-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-flip{-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-flip;animation-name:fa-flip;-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-shake{-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-shake;animation-name:fa-shake;-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-shake,.fa-spin{-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal)}.fa-spin{-webkit-animation-duration:var(--fa-animation-duration,2s);animation-duration:var(--fa-animation-duration,2s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-spin-reverse{--fa-animation-direction:reverse}.fa-pulse,.fa-spin-pulse{-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-timing-function:var(--fa-animation-timing,steps(8));animation-timing-function:var(--fa-animation-timing,steps(8))}@media (prefers-reduced-motion:reduce){.fa-beat,.fa-beat-fade,.fa-bounce,.fa-fade,.fa-flip,.fa-pulse,.fa-shake,.fa-spin,.fa-spin-pulse{-webkit-animation-delay:-1ms;animation-delay:-1ms;-webkit-animation-duration:1ms;animation-duration:1ms;-webkit-animation-iteration-count:1;animation-iteration-count:1;transition-delay:0s;transition-duration:0s}}@-webkit-keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@-webkit-keyframes fa-bounce{0%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}to{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}}@keyframes fa-bounce{0%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}to{-webkit-transform:scale(1) translateY(0);transform:scale(1) translateY(0)}}@-webkit-keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@-webkit-keyframes fa-beat-fade{0%,to{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@keyframes fa-beat-fade{0%,to{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@-webkit-keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@-webkit-keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}24%,8%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}40%,to{-webkit-transform:rotate(0deg);transform:rotate(0deg)}}@keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}24%,8%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}40%,to{-webkit-transform:rotate(0deg);transform:rotate(0deg)}}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);transform:rotate(1turn)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(1turn);transform:rotate(1turn)}}.fa-rotate-90{-webkit-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-webkit-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-webkit-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-webkit-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-webkit-transform:scaleY(-1);transform:scaleY(-1)}.fa-flip-both,.fa-flip-horizontal.fa-flip-vertical{-webkit-transform:scale(-1);transform:scale(-1)}.fa-rotate-by{-webkit-transform:rotate(var(--fa-rotate-angle,none));transform:rotate(var(--fa-rotate-angle,none))}.fa-stack{display:inline-block;height:2em;line-height:2em;position:relative;vertical-align:middle;width:2.5em}.fa-stack-1x,.fa-stack-2x{left:0;position:absolute;text-align:center;width:100%;z-index:var(--fa-stack-z-index,auto)}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:var(--fa-inverse,#fff)}.fa-0:before{content:"\30"}.fa-1:before{content:"\31"}.fa-2:before{content:"\32"}.fa-3:before{content:"\33"}.fa-4:before{content:"\34"}.fa-5:before{content:"\35"}.fa-6:before{content:"\36"}.fa-7:before{content:"\37"}.fa-8:before{content:"\38"}.fa-9:before{content:"\39"}.fa-a:before{content:"\41"}.fa-address-book:before,.fa-contact-book:before{content:"\f2b9"}.fa-address-card:before,.fa-contact-card:before,.fa-vcard:before{content:"\f2bb"}.fa-align-center:before{content:"\f037"}.fa-align-justify:before{content:"\f039"}.fa-align-left:before{content:"\f036"}.fa-align-right:before{content:"\f038"}.fa-anchor:before{content:"\f13d"}.fa-anchor-circle-check:before{content:"\e4aa"}.fa-anchor-circle-exclamation:before{content:"\e4ab"}.fa-anchor-circle-xmark:before{content:"\e4ac"}.fa-anchor-lock:before{content:"\e4ad"}.fa-angle-down:before{content:"\f107"}.fa-angle-left:before{content:"\f104"}.fa-angle-right:before{content:"\f105"}.fa-angle-up:before{content:"\f106"}.fa-angle-double-down:before,.fa-angles-down:before{content:"\f103"}.fa-angle-double-left:before,.fa-angles-left:before{content:"\f100"}.fa-angle-double-right:before,.fa-angles-right:before{content:"\f101"}.fa-angle-double-up:before,.fa-angles-up:before{content:"\f102"}.fa-ankh:before{content:"\f644"}.fa-apple-alt:before,.fa-apple-whole:before{content:"\f5d1"}.fa-archway:before{content:"\f557"}.fa-arrow-down:before{content:"\f063"}.fa-arrow-down-1-9:before,.fa-sort-numeric-asc:before,.fa-sort-numeric-down:before{content:"\f162"}.fa-arrow-down-9-1:before,.fa-sort-numeric-desc:before,.fa-sort-numeric-down-alt:before{content:"\f886"}.fa-arrow-down-a-z:before,.fa-sort-alpha-asc:before,.fa-sort-alpha-down:before{content:"\f15d"}.fa-arrow-down-long:before,.fa-long-arrow-down:before{content:"\f175"}.fa-arrow-down-short-wide:before,.fa-sort-amount-desc:before,.fa-sort-amount-down-alt:before{content:"\f884"}.fa-arrow-down-up-across-line:before{content:"\e4af"}.fa-arrow-down-up-lock:before{content:"\e4b0"}.fa-arrow-down-wide-short:before,.fa-sort-amount-asc:before,.fa-sort-amount-down:before{content:"\f160"}.fa-arrow-down-z-a:before,.fa-sort-alpha-desc:before,.fa-sort-alpha-down-alt:before{content:"\f881"}.fa-arrow-left:before{content:"\f060"}.fa-arrow-left-long:before,.fa-long-arrow-left:before{content:"\f177"}.fa-arrow-pointer:before,.fa-mouse-pointer:before{content:"\f245"}.fa-arrow-right:before{content:"\f061"}.fa-arrow-right-arrow-left:before,.fa-exchange:before{content:"\f0ec"}.fa-arrow-right-from-bracket:before,.fa-sign-out:before{content:"\f08b"}.fa-arrow-right-long:before,.fa-long-arrow-right:before{content:"\f178"}.fa-arrow-right-to-bracket:before,.fa-sign-in:before{content:"\f090"}.fa-arrow-right-to-city:before{content:"\e4b3"}.fa-arrow-left-rotate:before,.fa-arrow-rotate-back:before,.fa-arrow-rotate-backward:before,.fa-arrow-rotate-left:before,.fa-undo:before{content:"\f0e2"}.fa-arrow-right-rotate:before,.fa-arrow-rotate-forward:before,.fa-arrow-rotate-right:before,.fa-redo:before{content:"\f01e"}.fa-arrow-trend-down:before{content:"\e097"}.fa-arrow-trend-up:before{content:"\e098"}.fa-arrow-turn-down:before,.fa-level-down:before{content:"\f149"}.fa-arrow-turn-up:before,.fa-level-up:before{content:"\f148"}.fa-arrow-up:before{content:"\f062"}.fa-arrow-up-1-9:before,.fa-sort-numeric-up:before{content:"\f163"}.fa-arrow-up-9-1:before,.fa-sort-numeric-up-alt:before{content:"\f887"}.fa-arrow-up-a-z:before,.fa-sort-alpha-up:before{content:"\f15e"}.fa-arrow-up-from-bracket:before{content:"\e09a"}.fa-arrow-up-from-ground-water:before{content:"\e4b5"}.fa-arrow-up-from-water-pump:before{content:"\e4b6"}.fa-arrow-up-long:before,.fa-long-arrow-up:before{content:"\f176"}.fa-arrow-up-right-dots:before{content:"\e4b7"}.fa-arrow-up-right-from-square:before,.fa-external-link:before{content:"\f08e"}.fa-arrow-up-short-wide:before,.fa-sort-amount-up-alt:before{content:"\f885"}.fa-arrow-up-wide-short:before,.fa-sort-amount-up:before{content:"\f161"}.fa-arrow-up-z-a:before,.fa-sort-alpha-up-alt:before{content:"\f882"}.fa-arrows-down-to-line:before{content:"\e4b8"}.fa-arrows-down-to-people:before{content:"\e4b9"}.fa-arrows-h:before,.fa-arrows-left-right:before{content:"\f07e"}.fa-arrows-left-right-to-line:before{content:"\e4ba"}.fa-arrows-rotate:before,.fa-refresh:before,.fa-sync:before{content:"\f021"}.fa-arrows-spin:before{content:"\e4bb"}.fa-arrows-split-up-and-left:before{content:"\e4bc"}.fa-arrows-to-circle:before{content:"\e4bd"}.fa-arrows-to-dot:before{content:"\e4be"}.fa-arrows-to-eye:before{content:"\e4bf"}.fa-arrows-turn-right:before{content:"\e4c0"}.fa-arrows-turn-to-dots:before{content:"\e4c1"}.fa-arrows-up-down:before,.fa-arrows-v:before{content:"\f07d"}.fa-arrows-up-down-left-right:before,.fa-arrows:before{content:"\f047"}.fa-arrows-up-to-line:before{content:"\e4c2"}.fa-asterisk:before{content:"\2a"}.fa-at:before{content:"\40"}.fa-atom:before{content:"\f5d2"}.fa-audio-description:before{content:"\f29e"}.fa-austral-sign:before{content:"\e0a9"}.fa-award:before{content:"\f559"}.fa-b:before{content:"\42"}.fa-baby:before{content:"\f77c"}.fa-baby-carriage:before,.fa-carriage-baby:before{content:"\f77d"}.fa-backward:before{content:"\f04a"}.fa-backward-fast:before,.fa-fast-backward:before{content:"\f049"}.fa-backward-step:before,.fa-step-backward:before{content:"\f048"}.fa-bacon:before{content:"\f7e5"}.fa-bacteria:before{content:"\e059"}.fa-bacterium:before{content:"\e05a"}.fa-bag-shopping:before,.fa-shopping-bag:before{content:"\f290"}.fa-bahai:before,.fa-haykal:before{content:"\f666"}.fa-baht-sign:before{content:"\e0ac"}.fa-ban:before,.fa-cancel:before{content:"\f05e"}.fa-ban-smoking:before,.fa-smoking-ban:before{content:"\f54d"}.fa-band-aid:before,.fa-bandage:before{content:"\f462"}.fa-barcode:before{content:"\f02a"}.fa-bars:before,.fa-navicon:before{content:"\f0c9"}.fa-bars-progress:before,.fa-tasks-alt:before{content:"\f828"}.fa-bars-staggered:before,.fa-reorder:before,.fa-stream:before{content:"\f550"}.fa-baseball-ball:before,.fa-baseball:before{content:"\f433"}.fa-baseball-bat-ball:before{content:"\f432"}.fa-basket-shopping:before,.fa-shopping-basket:before{content:"\f291"}.fa-basketball-ball:before,.fa-basketball:before{content:"\f434"}.fa-bath:before,.fa-bathtub:before{content:"\f2cd"}.fa-battery-0:before,.fa-battery-empty:before{content:"\f244"}.fa-battery-5:before,.fa-battery-full:before,.fa-battery:before{content:"\f240"}.fa-battery-3:before,.fa-battery-half:before{content:"\f242"}.fa-battery-2:before,.fa-battery-quarter:before{content:"\f243"}.fa-battery-4:before,.fa-battery-three-quarters:before{content:"\f241"}.fa-bed:before{content:"\f236"}.fa-bed-pulse:before,.fa-procedures:before{content:"\f487"}.fa-beer-mug-empty:before,.fa-beer:before{content:"\f0fc"}.fa-bell:before{content:"\f0f3"}.fa-bell-concierge:before,.fa-concierge-bell:before{content:"\f562"}.fa-bell-slash:before{content:"\f1f6"}.fa-bezier-curve:before{content:"\f55b"}.fa-bicycle:before{content:"\f206"}.fa-binoculars:before{content:"\f1e5"}.fa-biohazard:before{content:"\f780"}.fa-bitcoin-sign:before{content:"\e0b4"}.fa-blender:before{content:"\f517"}.fa-blender-phone:before{content:"\f6b6"}.fa-blog:before{content:"\f781"}.fa-bold:before{content:"\f032"}.fa-bolt:before,.fa-zap:before{content:"\f0e7"}.fa-bolt-lightning:before{content:"\e0b7"}.fa-bomb:before{content:"\f1e2"}.fa-bone:before{content:"\f5d7"}.fa-bong:before{content:"\f55c"}.fa-book:before{content:"\f02d"}.fa-atlas:before,.fa-book-atlas:before{content:"\f558"}.fa-bible:before,.fa-book-bible:before{content:"\f647"}.fa-book-bookmark:before{content:"\e0bb"}.fa-book-journal-whills:before,.fa-journal-whills:before{content:"\f66a"}.fa-book-medical:before{content:"\f7e6"}.fa-book-open:before{content:"\f518"}.fa-book-open-reader:before,.fa-book-reader:before{content:"\f5da"}.fa-book-quran:before,.fa-quran:before{content:"\f687"}.fa-book-dead:before,.fa-book-skull:before{content:"\f6b7"}.fa-book-tanakh:before,.fa-tanakh:before{content:"\f827"}.fa-bookmark:before{content:"\f02e"}.fa-border-all:before{content:"\f84c"}.fa-border-none:before{content:"\f850"}.fa-border-style:before,.fa-border-top-left:before{content:"\f853"}.fa-bore-hole:before{content:"\e4c3"}.fa-bottle-droplet:before{content:"\e4c4"}.fa-bottle-water:before{content:"\e4c5"}.fa-bowl-food:before{content:"\e4c6"}.fa-bowl-rice:before{content:"\e2eb"}.fa-bowling-ball:before{content:"\f436"}.fa-box:before{content:"\f466"}.fa-archive:before,.fa-box-archive:before{content:"\f187"}.fa-box-open:before{content:"\f49e"}.fa-box-tissue:before{content:"\e05b"}.fa-boxes-packing:before{content:"\e4c7"}.fa-boxes-alt:before,.fa-boxes-stacked:before,.fa-boxes:before{content:"\f468"}.fa-braille:before{content:"\f2a1"}.fa-brain:before{content:"\f5dc"}.fa-brazilian-real-sign:before{content:"\e46c"}.fa-bread-slice:before{content:"\f7ec"}.fa-bridge:before{content:"\e4c8"}.fa-bridge-circle-check:before{content:"\e4c9"}.fa-bridge-circle-exclamation:before{content:"\e4ca"}.fa-bridge-circle-xmark:before{content:"\e4cb"}.fa-bridge-lock:before{content:"\e4cc"}.fa-bridge-water:before{content:"\e4ce"}.fa-briefcase:before{content:"\f0b1"}.fa-briefcase-medical:before{content:"\f469"}.fa-broom:before{content:"\f51a"}.fa-broom-ball:before,.fa-quidditch-broom-ball:before,.fa-quidditch:before{content:"\f458"}.fa-brush:before{content:"\f55d"}.fa-bucket:before{content:"\e4cf"}.fa-bug:before{content:"\f188"}.fa-bug-slash:before{content:"\e490"}.fa-bugs:before{content:"\e4d0"}.fa-building:before{content:"\f1ad"}.fa-building-circle-arrow-right:before{content:"\e4d1"}.fa-building-circle-check:before{content:"\e4d2"}.fa-building-circle-exclamation:before{content:"\e4d3"}.fa-building-circle-xmark:before{content:"\e4d4"}.fa-bank:before,.fa-building-columns:before,.fa-institution:before,.fa-museum:before,.fa-university:before{content:"\f19c"}.fa-building-flag:before{content:"\e4d5"}.fa-building-lock:before{content:"\e4d6"}.fa-building-ngo:before{content:"\e4d7"}.fa-building-shield:before{content:"\e4d8"}.fa-building-un:before{content:"\e4d9"}.fa-building-user:before{content:"\e4da"}.fa-building-wheat:before{content:"\e4db"}.fa-bullhorn:before{content:"\f0a1"}.fa-bullseye:before{content:"\f140"}.fa-burger:before,.fa-hamburger:before{content:"\f805"}.fa-burst:before{content:"\e4dc"}.fa-bus:before{content:"\f207"}.fa-bus-alt:before,.fa-bus-simple:before{content:"\f55e"}.fa-briefcase-clock:before,.fa-business-time:before{content:"\f64a"}.fa-c:before{content:"\43"}.fa-cable-car:before,.fa-tram:before{content:"\f7da"}.fa-birthday-cake:before,.fa-cake-candles:before,.fa-cake:before{content:"\f1fd"}.fa-calculator:before{content:"\f1ec"}.fa-calendar:before{content:"\f133"}.fa-calendar-check:before{content:"\f274"}.fa-calendar-day:before{content:"\f783"}.fa-calendar-alt:before,.fa-calendar-days:before{content:"\f073"}.fa-calendar-minus:before{content:"\f272"}.fa-calendar-plus:before{content:"\f271"}.fa-calendar-week:before{content:"\f784"}.fa-calendar-times:before,.fa-calendar-xmark:before{content:"\f273"}.fa-camera-alt:before,.fa-camera:before{content:"\f030"}.fa-camera-retro:before{content:"\f083"}.fa-camera-rotate:before{content:"\e0d8"}.fa-campground:before{content:"\f6bb"}.fa-candy-cane:before{content:"\f786"}.fa-cannabis:before{content:"\f55f"}.fa-capsules:before{content:"\f46b"}.fa-automobile:before,.fa-car:before{content:"\f1b9"}.fa-battery-car:before,.fa-car-battery:before{content:"\f5df"}.fa-car-burst:before,.fa-car-crash:before{content:"\f5e1"}.fa-car-on:before{content:"\e4dd"}.fa-car-alt:before,.fa-car-rear:before{content:"\f5de"}.fa-car-side:before{content:"\f5e4"}.fa-car-tunnel:before{content:"\e4de"}.fa-caravan:before{content:"\f8ff"}.fa-caret-down:before{content:"\f0d7"}.fa-caret-left:before{content:"\f0d9"}.fa-caret-right:before{content:"\f0da"}.fa-caret-up:before{content:"\f0d8"}.fa-carrot:before{content:"\f787"}.fa-cart-arrow-down:before{content:"\f218"}.fa-cart-flatbed:before,.fa-dolly-flatbed:before{content:"\f474"}.fa-cart-flatbed-suitcase:before,.fa-luggage-cart:before{content:"\f59d"}.fa-cart-plus:before{content:"\f217"}.fa-cart-shopping:before,.fa-shopping-cart:before{content:"\f07a"}.fa-cash-register:before{content:"\f788"}.fa-cat:before{content:"\f6be"}.fa-cedi-sign:before{content:"\e0df"}.fa-cent-sign:before{content:"\e3f5"}.fa-certificate:before{content:"\f0a3"}.fa-chair:before{content:"\f6c0"}.fa-blackboard:before,.fa-chalkboard:before{content:"\f51b"}.fa-chalkboard-teacher:before,.fa-chalkboard-user:before{content:"\f51c"}.fa-champagne-glasses:before,.fa-glass-cheers:before{content:"\f79f"}.fa-charging-station:before{content:"\f5e7"}.fa-area-chart:before,.fa-chart-area:before{content:"\f1fe"}.fa-bar-chart:before,.fa-chart-bar:before{content:"\f080"}.fa-chart-column:before{content:"\e0e3"}.fa-chart-gantt:before{content:"\e0e4"}.fa-chart-line:before,.fa-line-chart:before{content:"\f201"}.fa-chart-pie:before,.fa-pie-chart:before{content:"\f200"}.fa-chart-simple:before{content:"\e473"}.fa-check:before{content:"\f00c"}.fa-check-double:before{content:"\f560"}.fa-check-to-slot:before,.fa-vote-yea:before{content:"\f772"}.fa-cheese:before{content:"\f7ef"}.fa-chess:before{content:"\f439"}.fa-chess-bishop:before{content:"\f43a"}.fa-chess-board:before{content:"\f43c"}.fa-chess-king:before{content:"\f43f"}.fa-chess-knight:before{content:"\f441"}.fa-chess-pawn:before{content:"\f443"}.fa-chess-queen:before{content:"\f445"}.fa-chess-rook:before{content:"\f447"}.fa-chevron-down:before{content:"\f078"}.fa-chevron-left:before{content:"\f053"}.fa-chevron-right:before{content:"\f054"}.fa-chevron-up:before{content:"\f077"}.fa-child:before{content:"\f1ae"}.fa-child-dress:before{content:"\e59c"}.fa-child-reaching:before{content:"\e59d"}.fa-child-rifle:before{content:"\e4e0"}.fa-children:before{content:"\e4e1"}.fa-church:before{content:"\f51d"}.fa-circle:before{content:"\f111"}.fa-arrow-circle-down:before,.fa-circle-arrow-down:before{content:"\f0ab"}.fa-arrow-circle-left:before,.fa-circle-arrow-left:before{content:"\f0a8"}.fa-arrow-circle-right:before,.fa-circle-arrow-right:before{content:"\f0a9"}.fa-arrow-circle-up:before,.fa-circle-arrow-up:before{content:"\f0aa"}.fa-check-circle:before,.fa-circle-check:before{content:"\f058"}.fa-chevron-circle-down:before,.fa-circle-chevron-down:before{content:"\f13a"}.fa-chevron-circle-left:before,.fa-circle-chevron-left:before{content:"\f137"}.fa-chevron-circle-right:before,.fa-circle-chevron-right:before{content:"\f138"}.fa-chevron-circle-up:before,.fa-circle-chevron-up:before{content:"\f139"}.fa-circle-dollar-to-slot:before,.fa-donate:before{content:"\f4b9"}.fa-circle-dot:before,.fa-dot-circle:before{content:"\f192"}.fa-arrow-alt-circle-down:before,.fa-circle-down:before{content:"\f358"}.fa-circle-exclamation:before,.fa-exclamation-circle:before{content:"\f06a"}.fa-circle-h:before,.fa-hospital-symbol:before{content:"\f47e"}.fa-adjust:before,.fa-circle-half-stroke:before{content:"\f042"}.fa-circle-info:before,.fa-info-circle:before{content:"\f05a"}.fa-arrow-alt-circle-left:before,.fa-circle-left:before{content:"\f359"}.fa-circle-minus:before,.fa-minus-circle:before{content:"\f056"}.fa-circle-nodes:before{content:"\e4e2"}.fa-circle-notch:before{content:"\f1ce"}.fa-circle-pause:before,.fa-pause-circle:before{content:"\f28b"}.fa-circle-play:before,.fa-play-circle:before{content:"\f144"}.fa-circle-plus:before,.fa-plus-circle:before{content:"\f055"}.fa-circle-question:before,.fa-question-circle:before{content:"\f059"}.fa-circle-radiation:before,.fa-radiation-alt:before{content:"\f7ba"}.fa-arrow-alt-circle-right:before,.fa-circle-right:before{content:"\f35a"}.fa-circle-stop:before,.fa-stop-circle:before{content:"\f28d"}.fa-arrow-alt-circle-up:before,.fa-circle-up:before{content:"\f35b"}.fa-circle-user:before,.fa-user-circle:before{content:"\f2bd"}.fa-circle-xmark:before,.fa-times-circle:before,.fa-xmark-circle:before{content:"\f057"}.fa-city:before{content:"\f64f"}.fa-clapperboard:before{content:"\e131"}.fa-clipboard:before{content:"\f328"}.fa-clipboard-check:before{content:"\f46c"}.fa-clipboard-list:before{content:"\f46d"}.fa-clipboard-question:before{content:"\e4e3"}.fa-clipboard-user:before{content:"\f7f3"}.fa-clock-four:before,.fa-clock:before{content:"\f017"}.fa-clock-rotate-left:before,.fa-history:before{content:"\f1da"}.fa-clone:before{content:"\f24d"}.fa-closed-captioning:before{content:"\f20a"}.fa-cloud:before{content:"\f0c2"}.fa-cloud-arrow-down:before,.fa-cloud-download-alt:before,.fa-cloud-download:before{content:"\f0ed"}.fa-cloud-arrow-up:before,.fa-cloud-upload-alt:before,.fa-cloud-upload:before{content:"\f0ee"}.fa-cloud-bolt:before,.fa-thunderstorm:before{content:"\f76c"}.fa-cloud-meatball:before{content:"\f73b"}.fa-cloud-moon:before{content:"\f6c3"}.fa-cloud-moon-rain:before{content:"\f73c"}.fa-cloud-rain:before{content:"\f73d"}.fa-cloud-showers-heavy:before{content:"\f740"}.fa-cloud-showers-water:before{content:"\e4e4"}.fa-cloud-sun:before{content:"\f6c4"}.fa-cloud-sun-rain:before{content:"\f743"}.fa-clover:before{content:"\e139"}.fa-code:before{content:"\f121"}.fa-code-branch:before{content:"\f126"}.fa-code-commit:before{content:"\f386"}.fa-code-compare:before{content:"\e13a"}.fa-code-fork:before{content:"\e13b"}.fa-code-merge:before{content:"\f387"}.fa-code-pull-request:before{content:"\e13c"}.fa-coins:before{content:"\f51e"}.fa-colon-sign:before{content:"\e140"}.fa-comment:before{content:"\f075"}.fa-comment-dollar:before{content:"\f651"}.fa-comment-dots:before,.fa-commenting:before{content:"\f4ad"}.fa-comment-medical:before{content:"\f7f5"}.fa-comment-slash:before{content:"\f4b3"}.fa-comment-sms:before,.fa-sms:before{content:"\f7cd"}.fa-comments:before{content:"\f086"}.fa-comments-dollar:before{content:"\f653"}.fa-compact-disc:before{content:"\f51f"}.fa-compass:before{content:"\f14e"}.fa-compass-drafting:before,.fa-drafting-compass:before{content:"\f568"}.fa-compress:before{content:"\f066"}.fa-computer:before{content:"\e4e5"}.fa-computer-mouse:before,.fa-mouse:before{content:"\f8cc"}.fa-cookie:before{content:"\f563"}.fa-cookie-bite:before{content:"\f564"}.fa-copy:before{content:"\f0c5"}.fa-copyright:before{content:"\f1f9"}.fa-couch:before{content:"\f4b8"}.fa-cow:before{content:"\f6c8"}.fa-credit-card-alt:before,.fa-credit-card:before{content:"\f09d"}.fa-crop:before{content:"\f125"}.fa-crop-alt:before,.fa-crop-simple:before{content:"\f565"}.fa-cross:before{content:"\f654"}.fa-crosshairs:before{content:"\f05b"}.fa-crow:before{content:"\f520"}.fa-crown:before{content:"\f521"}.fa-crutch:before{content:"\f7f7"}.fa-cruzeiro-sign:before{content:"\e152"}.fa-cube:before{content:"\f1b2"}.fa-cubes:before{content:"\f1b3"}.fa-cubes-stacked:before{content:"\e4e6"}.fa-d:before{content:"\44"}.fa-database:before{content:"\f1c0"}.fa-backspace:before,.fa-delete-left:before{content:"\f55a"}.fa-democrat:before{content:"\f747"}.fa-desktop-alt:before,.fa-desktop:before{content:"\f390"}.fa-dharmachakra:before{content:"\f655"}.fa-diagram-next:before{content:"\e476"}.fa-diagram-predecessor:before{content:"\e477"}.fa-diagram-project:before,.fa-project-diagram:before{content:"\f542"}.fa-diagram-successor:before{content:"\e47a"}.fa-diamond:before{content:"\f219"}.fa-diamond-turn-right:before,.fa-directions:before{content:"\f5eb"}.fa-dice:before{content:"\f522"}.fa-dice-d20:before{content:"\f6cf"}.fa-dice-d6:before{content:"\f6d1"}.fa-dice-five:before{content:"\f523"}.fa-dice-four:before{content:"\f524"}.fa-dice-one:before{content:"\f525"}.fa-dice-six:before{content:"\f526"}.fa-dice-three:before{content:"\f527"}.fa-dice-two:before{content:"\f528"}.fa-disease:before{content:"\f7fa"}.fa-display:before{content:"\e163"}.fa-divide:before{content:"\f529"}.fa-dna:before{content:"\f471"}.fa-dog:before{content:"\f6d3"}.fa-dollar-sign:before,.fa-dollar:before,.fa-usd:before{content:"\24"}.fa-dolly-box:before,.fa-dolly:before{content:"\f472"}.fa-dong-sign:before{content:"\e169"}.fa-door-closed:before{content:"\f52a"}.fa-door-open:before{content:"\f52b"}.fa-dove:before{content:"\f4ba"}.fa-compress-alt:before,.fa-down-left-and-up-right-to-center:before{content:"\f422"}.fa-down-long:before,.fa-long-arrow-alt-down:before{content:"\f309"}.fa-download:before{content:"\f019"}.fa-dragon:before{content:"\f6d5"}.fa-draw-polygon:before{content:"\f5ee"}.fa-droplet:before,.fa-tint:before{content:"\f043"}.fa-droplet-slash:before,.fa-tint-slash:before{content:"\f5c7"}.fa-drum:before{content:"\f569"}.fa-drum-steelpan:before{content:"\f56a"}.fa-drumstick-bite:before{content:"\f6d7"}.fa-dumbbell:before{content:"\f44b"}.fa-dumpster:before{content:"\f793"}.fa-dumpster-fire:before{content:"\f794"}.fa-dungeon:before{content:"\f6d9"}.fa-e:before{content:"\45"}.fa-deaf:before,.fa-deafness:before,.fa-ear-deaf:before,.fa-hard-of-hearing:before{content:"\f2a4"}.fa-assistive-listening-systems:before,.fa-ear-listen:before{content:"\f2a2"}.fa-earth-africa:before,.fa-globe-africa:before{content:"\f57c"}.fa-earth-america:before,.fa-earth-americas:before,.fa-earth:before,.fa-globe-americas:before{content:"\f57d"}.fa-earth-asia:before,.fa-globe-asia:before{content:"\f57e"}.fa-earth-europe:before,.fa-globe-europe:before{content:"\f7a2"}.fa-earth-oceania:before,.fa-globe-oceania:before{content:"\e47b"}.fa-egg:before{content:"\f7fb"}.fa-eject:before{content:"\f052"}.fa-elevator:before{content:"\e16d"}.fa-ellipsis-h:before,.fa-ellipsis:before{content:"\f141"}.fa-ellipsis-v:before,.fa-ellipsis-vertical:before{content:"\f142"}.fa-envelope:before{content:"\f0e0"}.fa-envelope-circle-check:before{content:"\e4e8"}.fa-envelope-open:before{content:"\f2b6"}.fa-envelope-open-text:before{content:"\f658"}.fa-envelopes-bulk:before,.fa-mail-bulk:before{content:"\f674"}.fa-equals:before{content:"\3d"}.fa-eraser:before{content:"\f12d"}.fa-ethernet:before{content:"\f796"}.fa-eur:before,.fa-euro-sign:before,.fa-euro:before{content:"\f153"}.fa-exclamation:before{content:"\21"}.fa-expand:before{content:"\f065"}.fa-explosion:before{content:"\e4e9"}.fa-eye:before{content:"\f06e"}.fa-eye-dropper-empty:before,.fa-eye-dropper:before,.fa-eyedropper:before{content:"\f1fb"}.fa-eye-low-vision:before,.fa-low-vision:before{content:"\f2a8"}.fa-eye-slash:before{content:"\f070"}.fa-f:before{content:"\46"}.fa-angry:before,.fa-face-angry:before{content:"\f556"}.fa-dizzy:before,.fa-face-dizzy:before{content:"\f567"}.fa-face-flushed:before,.fa-flushed:before{content:"\f579"}.fa-face-frown:before,.fa-frown:before{content:"\f119"}.fa-face-frown-open:before,.fa-frown-open:before{content:"\f57a"}.fa-face-grimace:before,.fa-grimace:before{content:"\f57f"}.fa-face-grin:before,.fa-grin:before{content:"\f580"}.fa-face-grin-beam:before,.fa-grin-beam:before{content:"\f582"}.fa-face-grin-beam-sweat:before,.fa-grin-beam-sweat:before{content:"\f583"}.fa-face-grin-hearts:before,.fa-grin-hearts:before{content:"\f584"}.fa-face-grin-squint:before,.fa-grin-squint:before{content:"\f585"}.fa-face-grin-squint-tears:before,.fa-grin-squint-tears:before{content:"\f586"}.fa-face-grin-stars:before,.fa-grin-stars:before{content:"\f587"}.fa-face-grin-tears:before,.fa-grin-tears:before{content:"\f588"}.fa-face-grin-tongue:before,.fa-grin-tongue:before{content:"\f589"}.fa-face-grin-tongue-squint:before,.fa-grin-tongue-squint:before{content:"\f58a"}.fa-face-grin-tongue-wink:before,.fa-grin-tongue-wink:before{content:"\f58b"}.fa-face-grin-wide:before,.fa-grin-alt:before{content:"\f581"}.fa-face-grin-wink:before,.fa-grin-wink:before{content:"\f58c"}.fa-face-kiss:before,.fa-kiss:before{content:"\f596"}.fa-face-kiss-beam:before,.fa-kiss-beam:before{content:"\f597"}.fa-face-kiss-wink-heart:before,.fa-kiss-wink-heart:before{content:"\f598"}.fa-face-laugh:before,.fa-laugh:before{content:"\f599"}.fa-face-laugh-beam:before,.fa-laugh-beam:before{content:"\f59a"}.fa-face-laugh-squint:before,.fa-laugh-squint:before{content:"\f59b"}.fa-face-laugh-wink:before,.fa-laugh-wink:before{content:"\f59c"}.fa-face-meh:before,.fa-meh:before{content:"\f11a"}.fa-face-meh-blank:before,.fa-meh-blank:before{content:"\f5a4"}.fa-face-rolling-eyes:before,.fa-meh-rolling-eyes:before{content:"\f5a5"}.fa-face-sad-cry:before,.fa-sad-cry:before{content:"\f5b3"}.fa-face-sad-tear:before,.fa-sad-tear:before{content:"\f5b4"}.fa-face-smile:before,.fa-smile:before{content:"\f118"}.fa-face-smile-beam:before,.fa-smile-beam:before{content:"\f5b8"}.fa-face-smile-wink:before,.fa-smile-wink:before{content:"\f4da"}.fa-face-surprise:before,.fa-surprise:before{content:"\f5c2"}.fa-face-tired:before,.fa-tired:before{content:"\f5c8"}.fa-fan:before{content:"\f863"}.fa-faucet:before{content:"\e005"}.fa-faucet-drip:before{content:"\e006"}.fa-fax:before{content:"\f1ac"}.fa-feather:before{content:"\f52d"}.fa-feather-alt:before,.fa-feather-pointed:before{content:"\f56b"}.fa-ferry:before{content:"\e4ea"}.fa-file:before{content:"\f15b"}.fa-file-arrow-down:before,.fa-file-download:before{content:"\f56d"}.fa-file-arrow-up:before,.fa-file-upload:before{content:"\f574"}.fa-file-audio:before{content:"\f1c7"}.fa-file-circle-check:before{content:"\e5a0"}.fa-file-circle-exclamation:before{content:"\e4eb"}.fa-file-circle-minus:before{content:"\e4ed"}.fa-file-circle-plus:before{content:"\e494"}.fa-file-circle-question:before{content:"\e4ef"}.fa-file-circle-xmark:before{content:"\e5a1"}.fa-file-code:before{content:"\f1c9"}.fa-file-contract:before{content:"\f56c"}.fa-file-csv:before{content:"\f6dd"}.fa-file-excel:before{content:"\f1c3"}.fa-arrow-right-from-file:before,.fa-file-export:before{content:"\f56e"}.fa-file-image:before{content:"\f1c5"}.fa-arrow-right-to-file:before,.fa-file-import:before{content:"\f56f"}.fa-file-invoice:before{content:"\f570"}.fa-file-invoice-dollar:before{content:"\f571"}.fa-file-alt:before,.fa-file-lines:before,.fa-file-text:before{content:"\f15c"}.fa-file-medical:before{content:"\f477"}.fa-file-pdf:before{content:"\f1c1"}.fa-file-edit:before,.fa-file-pen:before{content:"\f31c"}.fa-file-powerpoint:before{content:"\f1c4"}.fa-file-prescription:before{content:"\f572"}.fa-file-shield:before{content:"\e4f0"}.fa-file-signature:before{content:"\f573"}.fa-file-video:before{content:"\f1c8"}.fa-file-medical-alt:before,.fa-file-waveform:before{content:"\f478"}.fa-file-word:before{content:"\f1c2"}.fa-file-archive:before,.fa-file-zipper:before{content:"\f1c6"}.fa-fill:before{content:"\f575"}.fa-fill-drip:before{content:"\f576"}.fa-film:before{content:"\f008"}.fa-filter:before{content:"\f0b0"}.fa-filter-circle-dollar:before,.fa-funnel-dollar:before{content:"\f662"}.fa-filter-circle-xmark:before{content:"\e17b"}.fa-fingerprint:before{content:"\f577"}.fa-fire:before{content:"\f06d"}.fa-fire-burner:before{content:"\e4f1"}.fa-fire-extinguisher:before{content:"\f134"}.fa-fire-alt:before,.fa-fire-flame-curved:before{content:"\f7e4"}.fa-burn:before,.fa-fire-flame-simple:before{content:"\f46a"}.fa-fish:before{content:"\f578"}.fa-fish-fins:before{content:"\e4f2"}.fa-flag:before{content:"\f024"}.fa-flag-checkered:before{content:"\f11e"}.fa-flag-usa:before{content:"\f74d"}.fa-flask:before{content:"\f0c3"}.fa-flask-vial:before{content:"\e4f3"}.fa-floppy-disk:before,.fa-save:before{content:"\f0c7"}.fa-florin-sign:before{content:"\e184"}.fa-folder-blank:before,.fa-folder:before{content:"\f07b"}.fa-folder-closed:before{content:"\e185"}.fa-folder-minus:before{content:"\f65d"}.fa-folder-open:before{content:"\f07c"}.fa-folder-plus:before{content:"\f65e"}.fa-folder-tree:before{content:"\f802"}.fa-font:before{content:"\f031"}.fa-football-ball:before,.fa-football:before{content:"\f44e"}.fa-forward:before{content:"\f04e"}.fa-fast-forward:before,.fa-forward-fast:before{content:"\f050"}.fa-forward-step:before,.fa-step-forward:before{content:"\f051"}.fa-franc-sign:before{content:"\e18f"}.fa-frog:before{content:"\f52e"}.fa-futbol-ball:before,.fa-futbol:before,.fa-soccer-ball:before{content:"\f1e3"}.fa-g:before{content:"\47"}.fa-gamepad:before{content:"\f11b"}.fa-gas-pump:before{content:"\f52f"}.fa-dashboard:before,.fa-gauge-med:before,.fa-gauge:before,.fa-tachometer-alt-average:before{content:"\f624"}.fa-gauge-high:before,.fa-tachometer-alt-fast:before,.fa-tachometer-alt:before{content:"\f625"}.fa-gauge-simple-med:before,.fa-gauge-simple:before,.fa-tachometer-average:before{content:"\f629"}.fa-gauge-simple-high:before,.fa-tachometer-fast:before,.fa-tachometer:before{content:"\f62a"}.fa-gavel:before,.fa-legal:before{content:"\f0e3"}.fa-cog:before,.fa-gear:before{content:"\f013"}.fa-cogs:before,.fa-gears:before{content:"\f085"}.fa-gem:before{content:"\f3a5"}.fa-genderless:before{content:"\f22d"}.fa-ghost:before{content:"\f6e2"}.fa-gift:before{content:"\f06b"}.fa-gifts:before{content:"\f79c"}.fa-glass-water:before{content:"\e4f4"}.fa-glass-water-droplet:before{content:"\e4f5"}.fa-glasses:before{content:"\f530"}.fa-globe:before{content:"\f0ac"}.fa-golf-ball-tee:before,.fa-golf-ball:before{content:"\f450"}.fa-gopuram:before{content:"\f664"}.fa-graduation-cap:before,.fa-mortar-board:before{content:"\f19d"}.fa-greater-than:before{content:"\3e"}.fa-greater-than-equal:before{content:"\f532"}.fa-grip-horizontal:before,.fa-grip:before{content:"\f58d"}.fa-grip-lines:before{content:"\f7a4"}.fa-grip-lines-vertical:before{content:"\f7a5"}.fa-grip-vertical:before{content:"\f58e"}.fa-group-arrows-rotate:before{content:"\e4f6"}.fa-guarani-sign:before{content:"\e19a"}.fa-guitar:before{content:"\f7a6"}.fa-gun:before{content:"\e19b"}.fa-h:before{content:"\48"}.fa-hammer:before{content:"\f6e3"}.fa-hamsa:before{content:"\f665"}.fa-hand-paper:before,.fa-hand:before{content:"\f256"}.fa-hand-back-fist:before,.fa-hand-rock:before{content:"\f255"}.fa-allergies:before,.fa-hand-dots:before{content:"\f461"}.fa-fist-raised:before,.fa-hand-fist:before{content:"\f6de"}.fa-hand-holding:before{content:"\f4bd"}.fa-hand-holding-dollar:before,.fa-hand-holding-usd:before{content:"\f4c0"}.fa-hand-holding-droplet:before,.fa-hand-holding-water:before{content:"\f4c1"}.fa-hand-holding-hand:before{content:"\e4f7"}.fa-hand-holding-heart:before{content:"\f4be"}.fa-hand-holding-medical:before{content:"\e05c"}.fa-hand-lizard:before{content:"\f258"}.fa-hand-middle-finger:before{content:"\f806"}.fa-hand-peace:before{content:"\f25b"}.fa-hand-point-down:before{content:"\f0a7"}.fa-hand-point-left:before{content:"\f0a5"}.fa-hand-point-right:before{content:"\f0a4"}.fa-hand-point-up:before{content:"\f0a6"}.fa-hand-pointer:before{content:"\f25a"}.fa-hand-scissors:before{content:"\f257"}.fa-hand-sparkles:before{content:"\e05d"}.fa-hand-spock:before{content:"\f259"}.fa-handcuffs:before{content:"\e4f8"}.fa-hands:before,.fa-sign-language:before,.fa-signing:before{content:"\f2a7"}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before,.fa-hands-american-sign-language-interpreting:before,.fa-hands-asl-interpreting:before{content:"\f2a3"}.fa-hands-bound:before{content:"\e4f9"}.fa-hands-bubbles:before,.fa-hands-wash:before{content:"\e05e"}.fa-hands-clapping:before{content:"\e1a8"}.fa-hands-holding:before{content:"\f4c2"}.fa-hands-holding-child:before{content:"\e4fa"}.fa-hands-holding-circle:before{content:"\e4fb"}.fa-hands-praying:before,.fa-praying-hands:before{content:"\f684"}.fa-handshake:before{content:"\f2b5"}.fa-hands-helping:before,.fa-handshake-angle:before{content:"\f4c4"}.fa-handshake-alt:before,.fa-handshake-simple:before{content:"\f4c6"}.fa-handshake-alt-slash:before,.fa-handshake-simple-slash:before{content:"\e05f"}.fa-handshake-slash:before{content:"\e060"}.fa-hanukiah:before{content:"\f6e6"}.fa-hard-drive:before,.fa-hdd:before{content:"\f0a0"}.fa-hashtag:before{content:"\23"}.fa-hat-cowboy:before{content:"\f8c0"}.fa-hat-cowboy-side:before{content:"\f8c1"}.fa-hat-wizard:before{content:"\f6e8"}.fa-head-side-cough:before{content:"\e061"}.fa-head-side-cough-slash:before{content:"\e062"}.fa-head-side-mask:before{content:"\e063"}.fa-head-side-virus:before{content:"\e064"}.fa-header:before,.fa-heading:before{content:"\f1dc"}.fa-headphones:before{content:"\f025"}.fa-headphones-alt:before,.fa-headphones-simple:before{content:"\f58f"}.fa-headset:before{content:"\f590"}.fa-heart:before{content:"\f004"}.fa-heart-circle-bolt:before{content:"\e4fc"}.fa-heart-circle-check:before{content:"\e4fd"}.fa-heart-circle-exclamation:before{content:"\e4fe"}.fa-heart-circle-minus:before{content:"\e4ff"}.fa-heart-circle-plus:before{content:"\e500"}.fa-heart-circle-xmark:before{content:"\e501"}.fa-heart-broken:before,.fa-heart-crack:before{content:"\f7a9"}.fa-heart-pulse:before,.fa-heartbeat:before{content:"\f21e"}.fa-helicopter:before{content:"\f533"}.fa-helicopter-symbol:before{content:"\e502"}.fa-hard-hat:before,.fa-hat-hard:before,.fa-helmet-safety:before{content:"\f807"}.fa-helmet-un:before{content:"\e503"}.fa-highlighter:before{content:"\f591"}.fa-hill-avalanche:before{content:"\e507"}.fa-hill-rockslide:before{content:"\e508"}.fa-hippo:before{content:"\f6ed"}.fa-hockey-puck:before{content:"\f453"}.fa-holly-berry:before{content:"\f7aa"}.fa-horse:before{content:"\f6f0"}.fa-horse-head:before{content:"\f7ab"}.fa-hospital-alt:before,.fa-hospital-wide:before,.fa-hospital:before{content:"\f0f8"}.fa-hospital-user:before{content:"\f80d"}.fa-hot-tub-person:before,.fa-hot-tub:before{content:"\f593"}.fa-hotdog:before{content:"\f80f"}.fa-hotel:before{content:"\f594"}.fa-hourglass-empty:before,.fa-hourglass:before{content:"\f254"}.fa-hourglass-3:before,.fa-hourglass-end:before{content:"\f253"}.fa-hourglass-2:before,.fa-hourglass-half:before{content:"\f252"}.fa-hourglass-1:before,.fa-hourglass-start:before{content:"\f251"}.fa-home-alt:before,.fa-home-lg-alt:before,.fa-home:before,.fa-house:before{content:"\f015"}.fa-home-lg:before,.fa-house-chimney:before{content:"\e3af"}.fa-house-chimney-crack:before,.fa-house-damage:before{content:"\f6f1"}.fa-clinic-medical:before,.fa-house-chimney-medical:before{content:"\f7f2"}.fa-house-chimney-user:before{content:"\e065"}.fa-house-chimney-window:before{content:"\e00d"}.fa-house-circle-check:before{content:"\e509"}.fa-house-circle-exclamation:before{content:"\e50a"}.fa-house-circle-xmark:before{content:"\e50b"}.fa-house-crack:before{content:"\e3b1"}.fa-house-fire:before{content:"\e50c"}.fa-house-flag:before{content:"\e50d"}.fa-house-flood-water:before{content:"\e50e"}.fa-house-flood-water-circle-arrow-right:before{content:"\e50f"}.fa-house-laptop:before,.fa-laptop-house:before{content:"\e066"}.fa-house-lock:before{content:"\e510"}.fa-house-medical:before{content:"\e3b2"}.fa-house-medical-circle-check:before{content:"\e511"}.fa-house-medical-circle-exclamation:before{content:"\e512"}.fa-house-medical-circle-xmark:before{content:"\e513"}.fa-house-medical-flag:before{content:"\e514"}.fa-house-signal:before{content:"\e012"}.fa-house-tsunami:before{content:"\e515"}.fa-home-user:before,.fa-house-user:before{content:"\e1b0"}.fa-hryvnia-sign:before,.fa-hryvnia:before{content:"\f6f2"}.fa-hurricane:before{content:"\f751"}.fa-i:before{content:"\49"}.fa-i-cursor:before{content:"\f246"}.fa-ice-cream:before{content:"\f810"}.fa-icicles:before{content:"\f7ad"}.fa-heart-music-camera-bolt:before,.fa-icons:before{content:"\f86d"}.fa-id-badge:before{content:"\f2c1"}.fa-drivers-license:before,.fa-id-card:before{content:"\f2c2"}.fa-id-card-alt:before,.fa-id-card-clip:before{content:"\f47f"}.fa-igloo:before{content:"\f7ae"}.fa-image:before{content:"\f03e"}.fa-image-portrait:before,.fa-portrait:before{content:"\f3e0"}.fa-images:before{content:"\f302"}.fa-inbox:before{content:"\f01c"}.fa-indent:before{content:"\f03c"}.fa-indian-rupee-sign:before,.fa-indian-rupee:before,.fa-inr:before{content:"\e1bc"}.fa-industry:before{content:"\f275"}.fa-infinity:before{content:"\f534"}.fa-info:before{content:"\f129"}.fa-italic:before{content:"\f033"}.fa-j:before{content:"\4a"}.fa-jar:before{content:"\e516"}.fa-jar-wheat:before{content:"\e517"}.fa-jedi:before{content:"\f669"}.fa-fighter-jet:before,.fa-jet-fighter:before{content:"\f0fb"}.fa-jet-fighter-up:before{content:"\e518"}.fa-joint:before{content:"\f595"}.fa-jug-detergent:before{content:"\e519"}.fa-k:before{content:"\4b"}.fa-kaaba:before{content:"\f66b"}.fa-key:before{content:"\f084"}.fa-keyboard:before{content:"\f11c"}.fa-khanda:before{content:"\f66d"}.fa-kip-sign:before{content:"\e1c4"}.fa-first-aid:before,.fa-kit-medical:before{content:"\f479"}.fa-kitchen-set:before{content:"\e51a"}.fa-kiwi-bird:before{content:"\f535"}.fa-l:before{content:"\4c"}.fa-land-mine-on:before{content:"\e51b"}.fa-landmark:before{content:"\f66f"}.fa-landmark-alt:before,.fa-landmark-dome:before{content:"\f752"}.fa-landmark-flag:before{content:"\e51c"}.fa-language:before{content:"\f1ab"}.fa-laptop:before{content:"\f109"}.fa-laptop-code:before{content:"\f5fc"}.fa-laptop-file:before{content:"\e51d"}.fa-laptop-medical:before{content:"\f812"}.fa-lari-sign:before{content:"\e1c8"}.fa-layer-group:before{content:"\f5fd"}.fa-leaf:before{content:"\f06c"}.fa-left-long:before,.fa-long-arrow-alt-left:before{content:"\f30a"}.fa-arrows-alt-h:before,.fa-left-right:before{content:"\f337"}.fa-lemon:before{content:"\f094"}.fa-less-than:before{content:"\3c"}.fa-less-than-equal:before{content:"\f537"}.fa-life-ring:before{content:"\f1cd"}.fa-lightbulb:before{content:"\f0eb"}.fa-lines-leaning:before{content:"\e51e"}.fa-chain:before,.fa-link:before{content:"\f0c1"}.fa-chain-broken:before,.fa-chain-slash:before,.fa-link-slash:before,.fa-unlink:before{content:"\f127"}.fa-lira-sign:before{content:"\f195"}.fa-list-squares:before,.fa-list:before{content:"\f03a"}.fa-list-check:before,.fa-tasks:before{content:"\f0ae"}.fa-list-1-2:before,.fa-list-numeric:before,.fa-list-ol:before{content:"\f0cb"}.fa-list-dots:before,.fa-list-ul:before{content:"\f0ca"}.fa-litecoin-sign:before{content:"\e1d3"}.fa-location-arrow:before{content:"\f124"}.fa-location-crosshairs:before,.fa-location:before{content:"\f601"}.fa-location-dot:before,.fa-map-marker-alt:before{content:"\f3c5"}.fa-location-pin:before,.fa-map-marker:before{content:"\f041"}.fa-location-pin-lock:before{content:"\e51f"}.fa-lock:before{content:"\f023"}.fa-lock-open:before{content:"\f3c1"}.fa-locust:before{content:"\e520"}.fa-lungs:before{content:"\f604"}.fa-lungs-virus:before{content:"\e067"}.fa-m:before{content:"\4d"}.fa-magnet:before{content:"\f076"}.fa-magnifying-glass:before,.fa-search:before{content:"\f002"}.fa-magnifying-glass-arrow-right:before{content:"\e521"}.fa-magnifying-glass-chart:before{content:"\e522"}.fa-magnifying-glass-dollar:before,.fa-search-dollar:before{content:"\f688"}.fa-magnifying-glass-location:before,.fa-search-location:before{content:"\f689"}.fa-magnifying-glass-minus:before,.fa-search-minus:before{content:"\f010"}.fa-magnifying-glass-plus:before,.fa-search-plus:before{content:"\f00e"}.fa-manat-sign:before{content:"\e1d5"}.fa-map:before{content:"\f279"}.fa-map-location:before,.fa-map-marked:before{content:"\f59f"}.fa-map-location-dot:before,.fa-map-marked-alt:before{content:"\f5a0"}.fa-map-pin:before{content:"\f276"}.fa-marker:before{content:"\f5a1"}.fa-mars:before{content:"\f222"}.fa-mars-and-venus:before{content:"\f224"}.fa-mars-and-venus-burst:before{content:"\e523"}.fa-mars-double:before{content:"\f227"}.fa-mars-stroke:before{content:"\f229"}.fa-mars-stroke-h:before,.fa-mars-stroke-right:before{content:"\f22b"}.fa-mars-stroke-up:before,.fa-mars-stroke-v:before{content:"\f22a"}.fa-glass-martini-alt:before,.fa-martini-glass:before{content:"\f57b"}.fa-cocktail:before,.fa-martini-glass-citrus:before{content:"\f561"}.fa-glass-martini:before,.fa-martini-glass-empty:before{content:"\f000"}.fa-mask:before{content:"\f6fa"}.fa-mask-face:before{content:"\e1d7"}.fa-mask-ventilator:before{content:"\e524"}.fa-masks-theater:before,.fa-theater-masks:before{content:"\f630"}.fa-mattress-pillow:before{content:"\e525"}.fa-expand-arrows-alt:before,.fa-maximize:before{content:"\f31e"}.fa-medal:before{content:"\f5a2"}.fa-memory:before{content:"\f538"}.fa-menorah:before{content:"\f676"}.fa-mercury:before{content:"\f223"}.fa-comment-alt:before,.fa-message:before{content:"\f27a"}.fa-meteor:before{content:"\f753"}.fa-microchip:before{content:"\f2db"}.fa-microphone:before{content:"\f130"}.fa-microphone-alt:before,.fa-microphone-lines:before{content:"\f3c9"}.fa-microphone-alt-slash:before,.fa-microphone-lines-slash:before{content:"\f539"}.fa-microphone-slash:before{content:"\f131"}.fa-microscope:before{content:"\f610"}.fa-mill-sign:before{content:"\e1ed"}.fa-compress-arrows-alt:before,.fa-minimize:before{content:"\f78c"}.fa-minus:before,.fa-subtract:before{content:"\f068"}.fa-mitten:before{content:"\f7b5"}.fa-mobile-android:before,.fa-mobile-phone:before,.fa-mobile:before{content:"\f3ce"}.fa-mobile-button:before{content:"\f10b"}.fa-mobile-retro:before{content:"\e527"}.fa-mobile-android-alt:before,.fa-mobile-screen:before{content:"\f3cf"}.fa-mobile-alt:before,.fa-mobile-screen-button:before{content:"\f3cd"}.fa-money-bill:before{content:"\f0d6"}.fa-money-bill-1:before,.fa-money-bill-alt:before{content:"\f3d1"}.fa-money-bill-1-wave:before,.fa-money-bill-wave-alt:before{content:"\f53b"}.fa-money-bill-transfer:before{content:"\e528"}.fa-money-bill-trend-up:before{content:"\e529"}.fa-money-bill-wave:before{content:"\f53a"}.fa-money-bill-wheat:before{content:"\e52a"}.fa-money-bills:before{content:"\e1f3"}.fa-money-check:before{content:"\f53c"}.fa-money-check-alt:before,.fa-money-check-dollar:before{content:"\f53d"}.fa-monument:before{content:"\f5a6"}.fa-moon:before{content:"\f186"}.fa-mortar-pestle:before{content:"\f5a7"}.fa-mosque:before{content:"\f678"}.fa-mosquito:before{content:"\e52b"}.fa-mosquito-net:before{content:"\e52c"}.fa-motorcycle:before{content:"\f21c"}.fa-mound:before{content:"\e52d"}.fa-mountain:before{content:"\f6fc"}.fa-mountain-city:before{content:"\e52e"}.fa-mountain-sun:before{content:"\e52f"}.fa-mug-hot:before{content:"\f7b6"}.fa-coffee:before,.fa-mug-saucer:before{content:"\f0f4"}.fa-music:before{content:"\f001"}.fa-n:before{content:"\4e"}.fa-naira-sign:before{content:"\e1f6"}.fa-network-wired:before{content:"\f6ff"}.fa-neuter:before{content:"\f22c"}.fa-newspaper:before{content:"\f1ea"}.fa-not-equal:before{content:"\f53e"}.fa-notdef:before{content:"\e1fe"}.fa-note-sticky:before,.fa-sticky-note:before{content:"\f249"}.fa-notes-medical:before{content:"\f481"}.fa-o:before{content:"\4f"}.fa-object-group:before{content:"\f247"}.fa-object-ungroup:before{content:"\f248"}.fa-oil-can:before{content:"\f613"}.fa-oil-well:before{content:"\e532"}.fa-om:before{content:"\f679"}.fa-otter:before{content:"\f700"}.fa-dedent:before,.fa-outdent:before{content:"\f03b"}.fa-p:before{content:"\50"}.fa-pager:before{content:"\f815"}.fa-paint-roller:before{content:"\f5aa"}.fa-paint-brush:before,.fa-paintbrush:before{content:"\f1fc"}.fa-palette:before{content:"\f53f"}.fa-pallet:before{content:"\f482"}.fa-panorama:before{content:"\e209"}.fa-paper-plane:before{content:"\f1d8"}.fa-paperclip:before{content:"\f0c6"}.fa-parachute-box:before{content:"\f4cd"}.fa-paragraph:before{content:"\f1dd"}.fa-passport:before{content:"\f5ab"}.fa-file-clipboard:before,.fa-paste:before{content:"\f0ea"}.fa-pause:before{content:"\f04c"}.fa-paw:before{content:"\f1b0"}.fa-peace:before{content:"\f67c"}.fa-pen:before{content:"\f304"}.fa-pen-alt:before,.fa-pen-clip:before{content:"\f305"}.fa-pen-fancy:before{content:"\f5ac"}.fa-pen-nib:before{content:"\f5ad"}.fa-pen-ruler:before,.fa-pencil-ruler:before{content:"\f5ae"}.fa-edit:before,.fa-pen-to-square:before{content:"\f044"}.fa-pencil-alt:before,.fa-pencil:before{content:"\f303"}.fa-people-arrows-left-right:before,.fa-people-arrows:before{content:"\e068"}.fa-people-carry-box:before,.fa-people-carry:before{content:"\f4ce"}.fa-people-group:before{content:"\e533"}.fa-people-line:before{content:"\e534"}.fa-people-pulling:before{content:"\e535"}.fa-people-robbery:before{content:"\e536"}.fa-people-roof:before{content:"\e537"}.fa-pepper-hot:before{content:"\f816"}.fa-percent:before,.fa-percentage:before{content:"\25"}.fa-male:before,.fa-person:before{content:"\f183"}.fa-person-arrow-down-to-line:before{content:"\e538"}.fa-person-arrow-up-from-line:before{content:"\e539"}.fa-biking:before,.fa-person-biking:before{content:"\f84a"}.fa-person-booth:before{content:"\f756"}.fa-person-breastfeeding:before{content:"\e53a"}.fa-person-burst:before{content:"\e53b"}.fa-person-cane:before{content:"\e53c"}.fa-person-chalkboard:before{content:"\e53d"}.fa-person-circle-check:before{content:"\e53e"}.fa-person-circle-exclamation:before{content:"\e53f"}.fa-person-circle-minus:before{content:"\e540"}.fa-person-circle-plus:before{content:"\e541"}.fa-person-circle-question:before{content:"\e542"}.fa-person-circle-xmark:before{content:"\e543"}.fa-digging:before,.fa-person-digging:before{content:"\f85e"}.fa-diagnoses:before,.fa-person-dots-from-line:before{content:"\f470"}.fa-female:before,.fa-person-dress:before{content:"\f182"}.fa-person-dress-burst:before{content:"\e544"}.fa-person-drowning:before{content:"\e545"}.fa-person-falling:before{content:"\e546"}.fa-person-falling-burst:before{content:"\e547"}.fa-person-half-dress:before{content:"\e548"}.fa-person-harassing:before{content:"\e549"}.fa-hiking:before,.fa-person-hiking:before{content:"\f6ec"}.fa-person-military-pointing:before{content:"\e54a"}.fa-person-military-rifle:before{content:"\e54b"}.fa-person-military-to-person:before{content:"\e54c"}.fa-person-praying:before,.fa-pray:before{content:"\f683"}.fa-person-pregnant:before{content:"\e31e"}.fa-person-rays:before{content:"\e54d"}.fa-person-rifle:before{content:"\e54e"}.fa-person-running:before,.fa-running:before{content:"\f70c"}.fa-person-shelter:before{content:"\e54f"}.fa-person-skating:before,.fa-skating:before{content:"\f7c5"}.fa-person-skiing:before,.fa-skiing:before{content:"\f7c9"}.fa-person-skiing-nordic:before,.fa-skiing-nordic:before{content:"\f7ca"}.fa-person-snowboarding:before,.fa-snowboarding:before{content:"\f7ce"}.fa-person-swimming:before,.fa-swimmer:before{content:"\f5c4"}.fa-person-through-window:before{content:"\e5a9"}.fa-person-walking:before,.fa-walking:before{content:"\f554"}.fa-person-walking-arrow-loop-left:before{content:"\e551"}.fa-person-walking-arrow-right:before{content:"\e552"}.fa-person-walking-dashed-line-arrow-right:before{content:"\e553"}.fa-person-walking-luggage:before{content:"\e554"}.fa-blind:before,.fa-person-walking-with-cane:before{content:"\f29d"}.fa-peseta-sign:before{content:"\e221"}.fa-peso-sign:before{content:"\e222"}.fa-phone:before{content:"\f095"}.fa-phone-alt:before,.fa-phone-flip:before{content:"\f879"}.fa-phone-slash:before{content:"\f3dd"}.fa-phone-volume:before,.fa-volume-control-phone:before{content:"\f2a0"}.fa-photo-film:before,.fa-photo-video:before{content:"\f87c"}.fa-piggy-bank:before{content:"\f4d3"}.fa-pills:before{content:"\f484"}.fa-pizza-slice:before{content:"\f818"}.fa-place-of-worship:before{content:"\f67f"}.fa-plane:before{content:"\f072"}.fa-plane-arrival:before{content:"\f5af"}.fa-plane-circle-check:before{content:"\e555"}.fa-plane-circle-exclamation:before{content:"\e556"}.fa-plane-circle-xmark:before{content:"\e557"}.fa-plane-departure:before{content:"\f5b0"}.fa-plane-lock:before{content:"\e558"}.fa-plane-slash:before{content:"\e069"}.fa-plane-up:before{content:"\e22d"}.fa-plant-wilt:before{content:"\e5aa"}.fa-plate-wheat:before{content:"\e55a"}.fa-play:before{content:"\f04b"}.fa-plug:before{content:"\f1e6"}.fa-plug-circle-bolt:before{content:"\e55b"}.fa-plug-circle-check:before{content:"\e55c"}.fa-plug-circle-exclamation:before{content:"\e55d"}.fa-plug-circle-minus:before{content:"\e55e"}.fa-plug-circle-plus:before{content:"\e55f"}.fa-plug-circle-xmark:before{content:"\e560"}.fa-add:before,.fa-plus:before{content:"\2b"}.fa-plus-minus:before{content:"\e43c"}.fa-podcast:before{content:"\f2ce"}.fa-poo:before{content:"\f2fe"}.fa-poo-bolt:before,.fa-poo-storm:before{content:"\f75a"}.fa-poop:before{content:"\f619"}.fa-power-off:before{content:"\f011"}.fa-prescription:before{content:"\f5b1"}.fa-prescription-bottle:before{content:"\f485"}.fa-prescription-bottle-alt:before,.fa-prescription-bottle-medical:before{content:"\f486"}.fa-print:before{content:"\f02f"}.fa-pump-medical:before{content:"\e06a"}.fa-pump-soap:before{content:"\e06b"}.fa-puzzle-piece:before{content:"\f12e"}.fa-q:before{content:"\51"}.fa-qrcode:before{content:"\f029"}.fa-question:before{content:"\3f"}.fa-quote-left-alt:before,.fa-quote-left:before{content:"\f10d"}.fa-quote-right-alt:before,.fa-quote-right:before{content:"\f10e"}.fa-r:before{content:"\52"}.fa-radiation:before{content:"\f7b9"}.fa-radio:before{content:"\f8d7"}.fa-rainbow:before{content:"\f75b"}.fa-ranking-star:before{content:"\e561"}.fa-receipt:before{content:"\f543"}.fa-record-vinyl:before{content:"\f8d9"}.fa-ad:before,.fa-rectangle-ad:before{content:"\f641"}.fa-list-alt:before,.fa-rectangle-list:before{content:"\f022"}.fa-rectangle-times:before,.fa-rectangle-xmark:before,.fa-times-rectangle:before,.fa-window-close:before{content:"\f410"}.fa-recycle:before{content:"\f1b8"}.fa-registered:before{content:"\f25d"}.fa-repeat:before{content:"\f363"}.fa-mail-reply:before,.fa-reply:before{content:"\f3e5"}.fa-mail-reply-all:before,.fa-reply-all:before{content:"\f122"}.fa-republican:before{content:"\f75e"}.fa-restroom:before{content:"\f7bd"}.fa-retweet:before{content:"\f079"}.fa-ribbon:before{content:"\f4d6"}.fa-right-from-bracket:before,.fa-sign-out-alt:before{content:"\f2f5"}.fa-exchange-alt:before,.fa-right-left:before{content:"\f362"}.fa-long-arrow-alt-right:before,.fa-right-long:before{content:"\f30b"}.fa-right-to-bracket:before,.fa-sign-in-alt:before{content:"\f2f6"}.fa-ring:before{content:"\f70b"}.fa-road:before{content:"\f018"}.fa-road-barrier:before{content:"\e562"}.fa-road-bridge:before{content:"\e563"}.fa-road-circle-check:before{content:"\e564"}.fa-road-circle-exclamation:before{content:"\e565"}.fa-road-circle-xmark:before{content:"\e566"}.fa-road-lock:before{content:"\e567"}.fa-road-spikes:before{content:"\e568"}.fa-robot:before{content:"\f544"}.fa-rocket:before{content:"\f135"}.fa-rotate:before,.fa-sync-alt:before{content:"\f2f1"}.fa-rotate-back:before,.fa-rotate-backward:before,.fa-rotate-left:before,.fa-undo-alt:before{content:"\f2ea"}.fa-redo-alt:before,.fa-rotate-forward:before,.fa-rotate-right:before{content:"\f2f9"}.fa-route:before{content:"\f4d7"}.fa-feed:before,.fa-rss:before{content:"\f09e"}.fa-rouble:before,.fa-rub:before,.fa-ruble-sign:before,.fa-ruble:before{content:"\f158"}.fa-rug:before{content:"\e569"}.fa-ruler:before{content:"\f545"}.fa-ruler-combined:before{content:"\f546"}.fa-ruler-horizontal:before{content:"\f547"}.fa-ruler-vertical:before{content:"\f548"}.fa-rupee-sign:before,.fa-rupee:before{content:"\f156"}.fa-rupiah-sign:before{content:"\e23d"}.fa-s:before{content:"\53"}.fa-sack-dollar:before{content:"\f81d"}.fa-sack-xmark:before{content:"\e56a"}.fa-sailboat:before{content:"\e445"}.fa-satellite:before{content:"\f7bf"}.fa-satellite-dish:before{content:"\f7c0"}.fa-balance-scale:before,.fa-scale-balanced:before{content:"\f24e"}.fa-balance-scale-left:before,.fa-scale-unbalanced:before{content:"\f515"}.fa-balance-scale-right:before,.fa-scale-unbalanced-flip:before{content:"\f516"}.fa-school:before{content:"\f549"}.fa-school-circle-check:before{content:"\e56b"}.fa-school-circle-exclamation:before{content:"\e56c"}.fa-school-circle-xmark:before{content:"\e56d"}.fa-school-flag:before{content:"\e56e"}.fa-school-lock:before{content:"\e56f"}.fa-cut:before,.fa-scissors:before{content:"\f0c4"}.fa-screwdriver:before{content:"\f54a"}.fa-screwdriver-wrench:before,.fa-tools:before{content:"\f7d9"}.fa-scroll:before{content:"\f70e"}.fa-scroll-torah:before,.fa-torah:before{content:"\f6a0"}.fa-sd-card:before{content:"\f7c2"}.fa-section:before{content:"\e447"}.fa-seedling:before,.fa-sprout:before{content:"\f4d8"}.fa-server:before{content:"\f233"}.fa-shapes:before,.fa-triangle-circle-square:before{content:"\f61f"}.fa-arrow-turn-right:before,.fa-mail-forward:before,.fa-share:before{content:"\f064"}.fa-share-from-square:before,.fa-share-square:before{content:"\f14d"}.fa-share-alt:before,.fa-share-nodes:before{content:"\f1e0"}.fa-sheet-plastic:before{content:"\e571"}.fa-ils:before,.fa-shekel-sign:before,.fa-shekel:before,.fa-sheqel-sign:before,.fa-sheqel:before{content:"\f20b"}.fa-shield-blank:before,.fa-shield:before{content:"\f132"}.fa-shield-cat:before{content:"\e572"}.fa-shield-dog:before{content:"\e573"}.fa-shield-alt:before,.fa-shield-halved:before{content:"\f3ed"}.fa-shield-heart:before{content:"\e574"}.fa-shield-virus:before{content:"\e06c"}.fa-ship:before{content:"\f21a"}.fa-shirt:before,.fa-t-shirt:before,.fa-tshirt:before{content:"\f553"}.fa-shoe-prints:before{content:"\f54b"}.fa-shop:before,.fa-store-alt:before{content:"\f54f"}.fa-shop-lock:before{content:"\e4a5"}.fa-shop-slash:before,.fa-store-alt-slash:before{content:"\e070"}.fa-shower:before{content:"\f2cc"}.fa-shrimp:before{content:"\e448"}.fa-random:before,.fa-shuffle:before{content:"\f074"}.fa-shuttle-space:before,.fa-space-shuttle:before{content:"\f197"}.fa-sign-hanging:before,.fa-sign:before{content:"\f4d9"}.fa-signal-5:before,.fa-signal-perfect:before,.fa-signal:before{content:"\f012"}.fa-signature:before{content:"\f5b7"}.fa-map-signs:before,.fa-signs-post:before{content:"\f277"}.fa-sim-card:before{content:"\f7c4"}.fa-sink:before{content:"\e06d"}.fa-sitemap:before{content:"\f0e8"}.fa-skull:before{content:"\f54c"}.fa-skull-crossbones:before{content:"\f714"}.fa-slash:before{content:"\f715"}.fa-sleigh:before{content:"\f7cc"}.fa-sliders-h:before,.fa-sliders:before{content:"\f1de"}.fa-smog:before{content:"\f75f"}.fa-smoking:before{content:"\f48d"}.fa-snowflake:before{content:"\f2dc"}.fa-snowman:before{content:"\f7d0"}.fa-snowplow:before{content:"\f7d2"}.fa-soap:before{content:"\e06e"}.fa-socks:before{content:"\f696"}.fa-solar-panel:before{content:"\f5ba"}.fa-sort:before,.fa-unsorted:before{content:"\f0dc"}.fa-sort-desc:before,.fa-sort-down:before{content:"\f0dd"}.fa-sort-asc:before,.fa-sort-up:before{content:"\f0de"}.fa-spa:before{content:"\f5bb"}.fa-pastafarianism:before,.fa-spaghetti-monster-flying:before{content:"\f67b"}.fa-spell-check:before{content:"\f891"}.fa-spider:before{content:"\f717"}.fa-spinner:before{content:"\f110"}.fa-splotch:before{content:"\f5bc"}.fa-spoon:before,.fa-utensil-spoon:before{content:"\f2e5"}.fa-spray-can:before{content:"\f5bd"}.fa-air-freshener:before,.fa-spray-can-sparkles:before{content:"\f5d0"}.fa-square:before{content:"\f0c8"}.fa-external-link-square:before,.fa-square-arrow-up-right:before{content:"\f14c"}.fa-caret-square-down:before,.fa-square-caret-down:before{content:"\f150"}.fa-caret-square-left:before,.fa-square-caret-left:before{content:"\f191"}.fa-caret-square-right:before,.fa-square-caret-right:before{content:"\f152"}.fa-caret-square-up:before,.fa-square-caret-up:before{content:"\f151"}.fa-check-square:before,.fa-square-check:before{content:"\f14a"}.fa-envelope-square:before,.fa-square-envelope:before{content:"\f199"}.fa-square-full:before{content:"\f45c"}.fa-h-square:before,.fa-square-h:before{content:"\f0fd"}.fa-minus-square:before,.fa-square-minus:before{content:"\f146"}.fa-square-nfi:before{content:"\e576"}.fa-parking:before,.fa-square-parking:before{content:"\f540"}.fa-pen-square:before,.fa-pencil-square:before,.fa-square-pen:before{content:"\f14b"}.fa-square-person-confined:before{content:"\e577"}.fa-phone-square:before,.fa-square-phone:before{content:"\f098"}.fa-phone-square-alt:before,.fa-square-phone-flip:before{content:"\f87b"}.fa-plus-square:before,.fa-square-plus:before{content:"\f0fe"}.fa-poll-h:before,.fa-square-poll-horizontal:before{content:"\f682"}.fa-poll:before,.fa-square-poll-vertical:before{content:"\f681"}.fa-square-root-alt:before,.fa-square-root-variable:before{content:"\f698"}.fa-rss-square:before,.fa-square-rss:before{content:"\f143"}.fa-share-alt-square:before,.fa-square-share-nodes:before{content:"\f1e1"}.fa-external-link-square-alt:before,.fa-square-up-right:before{content:"\f360"}.fa-square-virus:before{content:"\e578"}.fa-square-xmark:before,.fa-times-square:before,.fa-xmark-square:before{content:"\f2d3"}.fa-rod-asclepius:before,.fa-rod-snake:before,.fa-staff-aesculapius:before,.fa-staff-snake:before{content:"\e579"}.fa-stairs:before{content:"\e289"}.fa-stamp:before{content:"\f5bf"}.fa-stapler:before{content:"\e5af"}.fa-star:before{content:"\f005"}.fa-star-and-crescent:before{content:"\f699"}.fa-star-half:before{content:"\f089"}.fa-star-half-alt:before,.fa-star-half-stroke:before{content:"\f5c0"}.fa-star-of-david:before{content:"\f69a"}.fa-star-of-life:before{content:"\f621"}.fa-gbp:before,.fa-pound-sign:before,.fa-sterling-sign:before{content:"\f154"}.fa-stethoscope:before{content:"\f0f1"}.fa-stop:before{content:"\f04d"}.fa-stopwatch:before{content:"\f2f2"}.fa-stopwatch-20:before{content:"\e06f"}.fa-store:before{content:"\f54e"}.fa-store-slash:before{content:"\e071"}.fa-street-view:before{content:"\f21d"}.fa-strikethrough:before{content:"\f0cc"}.fa-stroopwafel:before{content:"\f551"}.fa-subscript:before{content:"\f12c"}.fa-suitcase:before{content:"\f0f2"}.fa-medkit:before,.fa-suitcase-medical:before{content:"\f0fa"}.fa-suitcase-rolling:before{content:"\f5c1"}.fa-sun:before{content:"\f185"}.fa-sun-plant-wilt:before{content:"\e57a"}.fa-superscript:before{content:"\f12b"}.fa-swatchbook:before{content:"\f5c3"}.fa-synagogue:before{content:"\f69b"}.fa-syringe:before{content:"\f48e"}.fa-t:before{content:"\54"}.fa-table:before{content:"\f0ce"}.fa-table-cells:before,.fa-th:before{content:"\f00a"}.fa-table-cells-large:before,.fa-th-large:before{content:"\f009"}.fa-columns:before,.fa-table-columns:before{content:"\f0db"}.fa-table-list:before,.fa-th-list:before{content:"\f00b"}.fa-ping-pong-paddle-ball:before,.fa-table-tennis-paddle-ball:before,.fa-table-tennis:before{content:"\f45d"}.fa-tablet-android:before,.fa-tablet:before{content:"\f3fb"}.fa-tablet-button:before{content:"\f10a"}.fa-tablet-alt:before,.fa-tablet-screen-button:before{content:"\f3fa"}.fa-tablets:before{content:"\f490"}.fa-digital-tachograph:before,.fa-tachograph-digital:before{content:"\f566"}.fa-tag:before{content:"\f02b"}.fa-tags:before{content:"\f02c"}.fa-tape:before{content:"\f4db"}.fa-tarp:before{content:"\e57b"}.fa-tarp-droplet:before{content:"\e57c"}.fa-cab:before,.fa-taxi:before{content:"\f1ba"}.fa-teeth:before{content:"\f62e"}.fa-teeth-open:before{content:"\f62f"}.fa-temperature-arrow-down:before,.fa-temperature-down:before{content:"\e03f"}.fa-temperature-arrow-up:before,.fa-temperature-up:before{content:"\e040"}.fa-temperature-0:before,.fa-temperature-empty:before,.fa-thermometer-0:before,.fa-thermometer-empty:before{content:"\f2cb"}.fa-temperature-4:before,.fa-temperature-full:before,.fa-thermometer-4:before,.fa-thermometer-full:before{content:"\f2c7"}.fa-temperature-2:before,.fa-temperature-half:before,.fa-thermometer-2:before,.fa-thermometer-half:before{content:"\f2c9"}.fa-temperature-high:before{content:"\f769"}.fa-temperature-low:before{content:"\f76b"}.fa-temperature-1:before,.fa-temperature-quarter:before,.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:"\f2ca"}.fa-temperature-3:before,.fa-temperature-three-quarters:before,.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:"\f2c8"}.fa-tenge-sign:before,.fa-tenge:before{content:"\f7d7"}.fa-tent:before{content:"\e57d"}.fa-tent-arrow-down-to-line:before{content:"\e57e"}.fa-tent-arrow-left-right:before{content:"\e57f"}.fa-tent-arrow-turn-left:before{content:"\e580"}.fa-tent-arrows-down:before{content:"\e581"}.fa-tents:before{content:"\e582"}.fa-terminal:before{content:"\f120"}.fa-text-height:before{content:"\f034"}.fa-remove-format:before,.fa-text-slash:before{content:"\f87d"}.fa-text-width:before{content:"\f035"}.fa-thermometer:before{content:"\f491"}.fa-thumbs-down:before{content:"\f165"}.fa-thumbs-up:before{content:"\f164"}.fa-thumb-tack:before,.fa-thumbtack:before{content:"\f08d"}.fa-ticket:before{content:"\f145"}.fa-ticket-alt:before,.fa-ticket-simple:before{content:"\f3ff"}.fa-timeline:before{content:"\e29c"}.fa-toggle-off:before{content:"\f204"}.fa-toggle-on:before{content:"\f205"}.fa-toilet:before{content:"\f7d8"}.fa-toilet-paper:before{content:"\f71e"}.fa-toilet-paper-slash:before{content:"\e072"}.fa-toilet-portable:before{content:"\e583"}.fa-toilets-portable:before{content:"\e584"}.fa-toolbox:before{content:"\f552"}.fa-tooth:before{content:"\f5c9"}.fa-torii-gate:before{content:"\f6a1"}.fa-tornado:before{content:"\f76f"}.fa-broadcast-tower:before,.fa-tower-broadcast:before{content:"\f519"}.fa-tower-cell:before{content:"\e585"}.fa-tower-observation:before{content:"\e586"}.fa-tractor:before{content:"\f722"}.fa-trademark:before{content:"\f25c"}.fa-traffic-light:before{content:"\f637"}.fa-trailer:before{content:"\e041"}.fa-train:before{content:"\f238"}.fa-subway:before,.fa-train-subway:before{content:"\f239"}.fa-train-tram:before{content:"\e5b4"}.fa-transgender-alt:before,.fa-transgender:before{content:"\f225"}.fa-trash:before{content:"\f1f8"}.fa-trash-arrow-up:before,.fa-trash-restore:before{content:"\f829"}.fa-trash-alt:before,.fa-trash-can:before{content:"\f2ed"}.fa-trash-can-arrow-up:before,.fa-trash-restore-alt:before{content:"\f82a"}.fa-tree:before{content:"\f1bb"}.fa-tree-city:before{content:"\e587"}.fa-exclamation-triangle:before,.fa-triangle-exclamation:before,.fa-warning:before{content:"\f071"}.fa-trophy:before{content:"\f091"}.fa-trowel:before{content:"\e589"}.fa-trowel-bricks:before{content:"\e58a"}.fa-truck:before{content:"\f0d1"}.fa-truck-arrow-right:before{content:"\e58b"}.fa-truck-droplet:before{content:"\e58c"}.fa-shipping-fast:before,.fa-truck-fast:before{content:"\f48b"}.fa-truck-field:before{content:"\e58d"}.fa-truck-field-un:before{content:"\e58e"}.fa-truck-front:before{content:"\e2b7"}.fa-ambulance:before,.fa-truck-medical:before{content:"\f0f9"}.fa-truck-monster:before{content:"\f63b"}.fa-truck-moving:before{content:"\f4df"}.fa-truck-pickup:before{content:"\f63c"}.fa-truck-plane:before{content:"\e58f"}.fa-truck-loading:before,.fa-truck-ramp-box:before{content:"\f4de"}.fa-teletype:before,.fa-tty:before{content:"\f1e4"}.fa-try:before,.fa-turkish-lira-sign:before,.fa-turkish-lira:before{content:"\e2bb"}.fa-level-down-alt:before,.fa-turn-down:before{content:"\f3be"}.fa-level-up-alt:before,.fa-turn-up:before{content:"\f3bf"}.fa-television:before,.fa-tv-alt:before,.fa-tv:before{content:"\f26c"}.fa-u:before{content:"\55"}.fa-umbrella:before{content:"\f0e9"}.fa-umbrella-beach:before{content:"\f5ca"}.fa-underline:before{content:"\f0cd"}.fa-universal-access:before{content:"\f29a"}.fa-unlock:before{content:"\f09c"}.fa-unlock-alt:before,.fa-unlock-keyhole:before{content:"\f13e"}.fa-arrows-alt-v:before,.fa-up-down:before{content:"\f338"}.fa-arrows-alt:before,.fa-up-down-left-right:before{content:"\f0b2"}.fa-long-arrow-alt-up:before,.fa-up-long:before{content:"\f30c"}.fa-expand-alt:before,.fa-up-right-and-down-left-from-center:before{content:"\f424"}.fa-external-link-alt:before,.fa-up-right-from-square:before{content:"\f35d"}.fa-upload:before{content:"\f093"}.fa-user:before{content:"\f007"}.fa-user-astronaut:before{content:"\f4fb"}.fa-user-check:before{content:"\f4fc"}.fa-user-clock:before{content:"\f4fd"}.fa-user-doctor:before,.fa-user-md:before{content:"\f0f0"}.fa-user-cog:before,.fa-user-gear:before{content:"\f4fe"}.fa-user-graduate:before{content:"\f501"}.fa-user-friends:before,.fa-user-group:before{content:"\f500"}.fa-user-injured:before{content:"\f728"}.fa-user-alt:before,.fa-user-large:before{content:"\f406"}.fa-user-alt-slash:before,.fa-user-large-slash:before{content:"\f4fa"}.fa-user-lock:before{content:"\f502"}.fa-user-minus:before{content:"\f503"}.fa-user-ninja:before{content:"\f504"}.fa-user-nurse:before{content:"\f82f"}.fa-user-edit:before,.fa-user-pen:before{content:"\f4ff"}.fa-user-plus:before{content:"\f234"}.fa-user-secret:before{content:"\f21b"}.fa-user-shield:before{content:"\f505"}.fa-user-slash:before{content:"\f506"}.fa-user-tag:before{content:"\f507"}.fa-user-tie:before{content:"\f508"}.fa-user-times:before,.fa-user-xmark:before{content:"\f235"}.fa-users:before{content:"\f0c0"}.fa-users-between-lines:before{content:"\e591"}.fa-users-cog:before,.fa-users-gear:before{content:"\f509"}.fa-users-line:before{content:"\e592"}.fa-users-rays:before{content:"\e593"}.fa-users-rectangle:before{content:"\e594"}.fa-users-slash:before{content:"\e073"}.fa-users-viewfinder:before{content:"\e595"}.fa-cutlery:before,.fa-utensils:before{content:"\f2e7"}.fa-v:before{content:"\56"}.fa-shuttle-van:before,.fa-van-shuttle:before{content:"\f5b6"}.fa-vault:before{content:"\e2c5"}.fa-vector-square:before{content:"\f5cb"}.fa-venus:before{content:"\f221"}.fa-venus-double:before{content:"\f226"}.fa-venus-mars:before{content:"\f228"}.fa-vest:before{content:"\e085"}.fa-vest-patches:before{content:"\e086"}.fa-vial:before{content:"\f492"}.fa-vial-circle-check:before{content:"\e596"}.fa-vial-virus:before{content:"\e597"}.fa-vials:before{content:"\f493"}.fa-video-camera:before,.fa-video:before{content:"\f03d"}.fa-video-slash:before{content:"\f4e2"}.fa-vihara:before{content:"\f6a7"}.fa-virus:before{content:"\e074"}.fa-virus-covid:before{content:"\e4a8"}.fa-virus-covid-slash:before{content:"\e4a9"}.fa-virus-slash:before{content:"\e075"}.fa-viruses:before{content:"\e076"}.fa-voicemail:before{content:"\f897"}.fa-volcano:before{content:"\f770"}.fa-volleyball-ball:before,.fa-volleyball:before{content:"\f45f"}.fa-volume-high:before,.fa-volume-up:before{content:"\f028"}.fa-volume-down:before,.fa-volume-low:before{content:"\f027"}.fa-volume-off:before{content:"\f026"}.fa-volume-mute:before,.fa-volume-times:before,.fa-volume-xmark:before{content:"\f6a9"}.fa-vr-cardboard:before{content:"\f729"}.fa-w:before{content:"\57"}.fa-walkie-talkie:before{content:"\f8ef"}.fa-wallet:before{content:"\f555"}.fa-magic:before,.fa-wand-magic:before{content:"\f0d0"}.fa-magic-wand-sparkles:before,.fa-wand-magic-sparkles:before{content:"\e2ca"}.fa-wand-sparkles:before{content:"\f72b"}.fa-warehouse:before{content:"\f494"}.fa-water:before{content:"\f773"}.fa-ladder-water:before,.fa-swimming-pool:before,.fa-water-ladder:before{content:"\f5c5"}.fa-wave-square:before{content:"\f83e"}.fa-weight-hanging:before{content:"\f5cd"}.fa-weight-scale:before,.fa-weight:before{content:"\f496"}.fa-wheat-alt:before,.fa-wheat-awn:before{content:"\e2cd"}.fa-wheat-awn-circle-exclamation:before{content:"\e598"}.fa-wheelchair:before{content:"\f193"}.fa-wheelchair-alt:before,.fa-wheelchair-move:before{content:"\e2ce"}.fa-glass-whiskey:before,.fa-whiskey-glass:before{content:"\f7a0"}.fa-wifi-3:before,.fa-wifi-strong:before,.fa-wifi:before{content:"\f1eb"}.fa-wind:before{content:"\f72e"}.fa-window-maximize:before{content:"\f2d0"}.fa-window-minimize:before{content:"\f2d1"}.fa-window-restore:before{content:"\f2d2"}.fa-wine-bottle:before{content:"\f72f"}.fa-wine-glass:before{content:"\f4e3"}.fa-wine-glass-alt:before,.fa-wine-glass-empty:before{content:"\f5ce"}.fa-krw:before,.fa-won-sign:before,.fa-won:before{content:"\f159"}.fa-worm:before{content:"\e599"}.fa-wrench:before{content:"\f0ad"}.fa-x:before{content:"\58"}.fa-x-ray:before{content:"\f497"}.fa-close:before,.fa-multiply:before,.fa-remove:before,.fa-times:before,.fa-xmark:before{content:"\f00d"}.fa-xmarks-lines:before{content:"\e59a"}.fa-y:before{content:"\59"}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen-sign:before,.fa-yen:before{content:"\f157"}.fa-yin-yang:before{content:"\f6ad"}.fa-z:before{content:"\5a"}.fa-sr-only,.fa-sr-only-focusable:not(:focus),.sr-only,.sr-only-focusable:not(:focus){clip:rect(0,0,0,0);border-width:0;height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;white-space:nowrap;width:1px}:host,:root{--fa-font-brands:normal 400 1em/1 "Font Awesome 6 Brands"}@font-face{font-display:block;font-family:Font Awesome\ 6 Brands;font-style:normal;font-weight:400;src:url(../webfonts/fa-brands-400.woff2) format("woff2"),url(../webfonts/fa-brands-400.ttf) format("truetype")}.fa-brands,.fab{font-family:Font Awesome\ 6 Brands;font-weight:400}.fa-42-group:before,.fa-innosoft:before{content:"\e080"}.fa-500px:before{content:"\f26e"}.fa-accessible-icon:before{content:"\f368"}.fa-accusoft:before{content:"\f369"}.fa-adn:before{content:"\f170"}.fa-adversal:before{content:"\f36a"}.fa-affiliatetheme:before{content:"\f36b"}.fa-airbnb:before{content:"\f834"}.fa-algolia:before{content:"\f36c"}.fa-alipay:before{content:"\f642"}.fa-amazon:before{content:"\f270"}.fa-amazon-pay:before{content:"\f42c"}.fa-amilia:before{content:"\f36d"}.fa-android:before{content:"\f17b"}.fa-angellist:before{content:"\f209"}.fa-angrycreative:before{content:"\f36e"}.fa-angular:before{content:"\f420"}.fa-app-store:before{content:"\f36f"}.fa-app-store-ios:before{content:"\f370"}.fa-apper:before{content:"\f371"}.fa-apple:before{content:"\f179"}.fa-apple-pay:before{content:"\f415"}.fa-artstation:before{content:"\f77a"}.fa-asymmetrik:before{content:"\f372"}.fa-atlassian:before{content:"\f77b"}.fa-audible:before{content:"\f373"}.fa-autoprefixer:before{content:"\f41c"}.fa-avianex:before{content:"\f374"}.fa-aviato:before{content:"\f421"}.fa-aws:before{content:"\f375"}.fa-bandcamp:before{content:"\f2d5"}.fa-battle-net:before{content:"\f835"}.fa-behance:before{content:"\f1b4"}.fa-bilibili:before{content:"\e3d9"}.fa-bimobject:before{content:"\f378"}.fa-bitbucket:before{content:"\f171"}.fa-bitcoin:before{content:"\f379"}.fa-bity:before{content:"\f37a"}.fa-black-tie:before{content:"\f27e"}.fa-blackberry:before{content:"\f37b"}.fa-blogger:before{content:"\f37c"}.fa-blogger-b:before{content:"\f37d"}.fa-bluetooth:before{content:"\f293"}.fa-bluetooth-b:before{content:"\f294"}.fa-bootstrap:before{content:"\f836"}.fa-bots:before{content:"\e340"}.fa-btc:before{content:"\f15a"}.fa-buffer:before{content:"\f837"}.fa-buromobelexperte:before{content:"\f37f"}.fa-buy-n-large:before{content:"\f8a6"}.fa-buysellads:before{content:"\f20d"}.fa-canadian-maple-leaf:before{content:"\f785"}.fa-cc-amazon-pay:before{content:"\f42d"}.fa-cc-amex:before{content:"\f1f3"}.fa-cc-apple-pay:before{content:"\f416"}.fa-cc-diners-club:before{content:"\f24c"}.fa-cc-discover:before{content:"\f1f2"}.fa-cc-jcb:before{content:"\f24b"}.fa-cc-mastercard:before{content:"\f1f1"}.fa-cc-paypal:before{content:"\f1f4"}.fa-cc-stripe:before{content:"\f1f5"}.fa-cc-visa:before{content:"\f1f0"}.fa-centercode:before{content:"\f380"}.fa-centos:before{content:"\f789"}.fa-chrome:before{content:"\f268"}.fa-chromecast:before{content:"\f838"}.fa-cloudflare:before{content:"\e07d"}.fa-cloudscale:before{content:"\f383"}.fa-cloudsmith:before{content:"\f384"}.fa-cloudversify:before{content:"\f385"}.fa-cmplid:before{content:"\e360"}.fa-codepen:before{content:"\f1cb"}.fa-codiepie:before{content:"\f284"}.fa-confluence:before{content:"\f78d"}.fa-connectdevelop:before{content:"\f20e"}.fa-contao:before{content:"\f26d"}.fa-cotton-bureau:before{content:"\f89e"}.fa-cpanel:before{content:"\f388"}.fa-creative-commons:before{content:"\f25e"}.fa-creative-commons-by:before{content:"\f4e7"}.fa-creative-commons-nc:before{content:"\f4e8"}.fa-creative-commons-nc-eu:before{content:"\f4e9"}.fa-creative-commons-nc-jp:before{content:"\f4ea"}.fa-creative-commons-nd:before{content:"\f4eb"}.fa-creative-commons-pd:before{content:"\f4ec"}.fa-creative-commons-pd-alt:before{content:"\f4ed"}.fa-creative-commons-remix:before{content:"\f4ee"}.fa-creative-commons-sa:before{content:"\f4ef"}.fa-creative-commons-sampling:before{content:"\f4f0"}.fa-creative-commons-sampling-plus:before{content:"\f4f1"}.fa-creative-commons-share:before{content:"\f4f2"}.fa-creative-commons-zero:before{content:"\f4f3"}.fa-critical-role:before{content:"\f6c9"}.fa-css3:before{content:"\f13c"}.fa-css3-alt:before{content:"\f38b"}.fa-cuttlefish:before{content:"\f38c"}.fa-d-and-d:before{content:"\f38d"}.fa-d-and-d-beyond:before{content:"\f6ca"}.fa-dailymotion:before{content:"\e052"}.fa-dashcube:before{content:"\f210"}.fa-deezer:before{content:"\e077"}.fa-delicious:before{content:"\f1a5"}.fa-deploydog:before{content:"\f38e"}.fa-deskpro:before{content:"\f38f"}.fa-dev:before{content:"\f6cc"}.fa-deviantart:before{content:"\f1bd"}.fa-dhl:before{content:"\f790"}.fa-diaspora:before{content:"\f791"}.fa-digg:before{content:"\f1a6"}.fa-digital-ocean:before{content:"\f391"}.fa-discord:before{content:"\f392"}.fa-discourse:before{content:"\f393"}.fa-dochub:before{content:"\f394"}.fa-docker:before{content:"\f395"}.fa-draft2digital:before{content:"\f396"}.fa-dribbble:before{content:"\f17d"}.fa-dropbox:before{content:"\f16b"}.fa-drupal:before{content:"\f1a9"}.fa-dyalog:before{content:"\f399"}.fa-earlybirds:before{content:"\f39a"}.fa-ebay:before{content:"\f4f4"}.fa-edge:before{content:"\f282"}.fa-edge-legacy:before{content:"\e078"}.fa-elementor:before{content:"\f430"}.fa-ello:before{content:"\f5f1"}.fa-ember:before{content:"\f423"}.fa-empire:before{content:"\f1d1"}.fa-envira:before{content:"\f299"}.fa-erlang:before{content:"\f39d"}.fa-ethereum:before{content:"\f42e"}.fa-etsy:before{content:"\f2d7"}.fa-evernote:before{content:"\f839"}.fa-expeditedssl:before{content:"\f23e"}.fa-facebook:before{content:"\f09a"}.fa-facebook-f:before{content:"\f39e"}.fa-facebook-messenger:before{content:"\f39f"}.fa-fantasy-flight-games:before{content:"\f6dc"}.fa-fedex:before{content:"\f797"}.fa-fedora:before{content:"\f798"}.fa-figma:before{content:"\f799"}.fa-firefox:before{content:"\f269"}.fa-firefox-browser:before{content:"\e007"}.fa-first-order:before{content:"\f2b0"}.fa-first-order-alt:before{content:"\f50a"}.fa-firstdraft:before{content:"\f3a1"}.fa-flickr:before{content:"\f16e"}.fa-flipboard:before{content:"\f44d"}.fa-fly:before{content:"\f417"}.fa-font-awesome-flag:before,.fa-font-awesome-logo-full:before,.fa-font-awesome:before{content:"\f2b4"}.fa-fonticons:before{content:"\f280"}.fa-fonticons-fi:before{content:"\f3a2"}.fa-fort-awesome:before{content:"\f286"}.fa-fort-awesome-alt:before{content:"\f3a3"}.fa-forumbee:before{content:"\f211"}.fa-foursquare:before{content:"\f180"}.fa-free-code-camp:before{content:"\f2c5"}.fa-freebsd:before{content:"\f3a4"}.fa-fulcrum:before{content:"\f50b"}.fa-galactic-republic:before{content:"\f50c"}.fa-galactic-senate:before{content:"\f50d"}.fa-get-pocket:before{content:"\f265"}.fa-gg:before{content:"\f260"}.fa-gg-circle:before{content:"\f261"}.fa-git:before{content:"\f1d3"}.fa-git-alt:before{content:"\f841"}.fa-github:before{content:"\f09b"}.fa-github-alt:before{content:"\f113"}.fa-gitkraken:before{content:"\f3a6"}.fa-gitlab:before{content:"\f296"}.fa-gitter:before{content:"\f426"}.fa-glide:before{content:"\f2a5"}.fa-glide-g:before{content:"\f2a6"}.fa-gofore:before{content:"\f3a7"}.fa-golang:before{content:"\e40f"}.fa-goodreads:before{content:"\f3a8"}.fa-goodreads-g:before{content:"\f3a9"}.fa-google:before{content:"\f1a0"}.fa-google-drive:before{content:"\f3aa"}.fa-google-pay:before{content:"\e079"}.fa-google-play:before{content:"\f3ab"}.fa-google-plus:before{content:"\f2b3"}.fa-google-plus-g:before{content:"\f0d5"}.fa-google-wallet:before{content:"\f1ee"}.fa-gratipay:before{content:"\f184"}.fa-grav:before{content:"\f2d6"}.fa-gripfire:before{content:"\f3ac"}.fa-grunt:before{content:"\f3ad"}.fa-guilded:before{content:"\e07e"}.fa-gulp:before{content:"\f3ae"}.fa-hacker-news:before{content:"\f1d4"}.fa-hackerrank:before{content:"\f5f7"}.fa-hashnode:before{content:"\e499"}.fa-hips:before{content:"\f452"}.fa-hire-a-helper:before{content:"\f3b0"}.fa-hive:before{content:"\e07f"}.fa-hooli:before{content:"\f427"}.fa-hornbill:before{content:"\f592"}.fa-hotjar:before{content:"\f3b1"}.fa-houzz:before{content:"\f27c"}.fa-html5:before{content:"\f13b"}.fa-hubspot:before{content:"\f3b2"}.fa-ideal:before{content:"\e013"}.fa-imdb:before{content:"\f2d8"}.fa-instagram:before{content:"\f16d"}.fa-instalod:before{content:"\e081"}.fa-intercom:before{content:"\f7af"}.fa-internet-explorer:before{content:"\f26b"}.fa-invision:before{content:"\f7b0"}.fa-ioxhost:before{content:"\f208"}.fa-itch-io:before{content:"\f83a"}.fa-itunes:before{content:"\f3b4"}.fa-itunes-note:before{content:"\f3b5"}.fa-java:before{content:"\f4e4"}.fa-jedi-order:before{content:"\f50e"}.fa-jenkins:before{content:"\f3b6"}.fa-jira:before{content:"\f7b1"}.fa-joget:before{content:"\f3b7"}.fa-joomla:before{content:"\f1aa"}.fa-js:before{content:"\f3b8"}.fa-jsfiddle:before{content:"\f1cc"}.fa-kaggle:before{content:"\f5fa"}.fa-keybase:before{content:"\f4f5"}.fa-keycdn:before{content:"\f3ba"}.fa-kickstarter:before{content:"\f3bb"}.fa-kickstarter-k:before{content:"\f3bc"}.fa-korvue:before{content:"\f42f"}.fa-laravel:before{content:"\f3bd"}.fa-lastfm:before{content:"\f202"}.fa-leanpub:before{content:"\f212"}.fa-less:before{content:"\f41d"}.fa-line:before{content:"\f3c0"}.fa-linkedin:before{content:"\f08c"}.fa-linkedin-in:before{content:"\f0e1"}.fa-linode:before{content:"\f2b8"}.fa-linux:before{content:"\f17c"}.fa-lyft:before{content:"\f3c3"}.fa-magento:before{content:"\f3c4"}.fa-mailchimp:before{content:"\f59e"}.fa-mandalorian:before{content:"\f50f"}.fa-markdown:before{content:"\f60f"}.fa-mastodon:before{content:"\f4f6"}.fa-maxcdn:before{content:"\f136"}.fa-mdb:before{content:"\f8ca"}.fa-medapps:before{content:"\f3c6"}.fa-medium-m:before,.fa-medium:before{content:"\f23a"}.fa-medrt:before{content:"\f3c8"}.fa-meetup:before{content:"\f2e0"}.fa-megaport:before{content:"\f5a3"}.fa-mendeley:before{content:"\f7b3"}.fa-meta:before{content:"\e49b"}.fa-microblog:before{content:"\e01a"}.fa-microsoft:before{content:"\f3ca"}.fa-mix:before{content:"\f3cb"}.fa-mixcloud:before{content:"\f289"}.fa-mixer:before{content:"\e056"}.fa-mizuni:before{content:"\f3cc"}.fa-modx:before{content:"\f285"}.fa-monero:before{content:"\f3d0"}.fa-napster:before{content:"\f3d2"}.fa-neos:before{content:"\f612"}.fa-nfc-directional:before{content:"\e530"}.fa-nfc-symbol:before{content:"\e531"}.fa-nimblr:before{content:"\f5a8"}.fa-node:before{content:"\f419"}.fa-node-js:before{content:"\f3d3"}.fa-npm:before{content:"\f3d4"}.fa-ns8:before{content:"\f3d5"}.fa-nutritionix:before{content:"\f3d6"}.fa-octopus-deploy:before{content:"\e082"}.fa-odnoklassniki:before{content:"\f263"}.fa-old-republic:before{content:"\f510"}.fa-opencart:before{content:"\f23d"}.fa-openid:before{content:"\f19b"}.fa-opera:before{content:"\f26a"}.fa-optin-monster:before{content:"\f23c"}.fa-orcid:before{content:"\f8d2"}.fa-osi:before{content:"\f41a"}.fa-padlet:before{content:"\e4a0"}.fa-page4:before{content:"\f3d7"}.fa-pagelines:before{content:"\f18c"}.fa-palfed:before{content:"\f3d8"}.fa-patreon:before{content:"\f3d9"}.fa-paypal:before{content:"\f1ed"}.fa-perbyte:before{content:"\e083"}.fa-periscope:before{content:"\f3da"}.fa-phabricator:before{content:"\f3db"}.fa-phoenix-framework:before{content:"\f3dc"}.fa-phoenix-squadron:before{content:"\f511"}.fa-php:before{content:"\f457"}.fa-pied-piper:before{content:"\f2ae"}.fa-pied-piper-alt:before{content:"\f1a8"}.fa-pied-piper-hat:before{content:"\f4e5"}.fa-pied-piper-pp:before{content:"\f1a7"}.fa-pinterest:before{content:"\f0d2"}.fa-pinterest-p:before{content:"\f231"}.fa-pix:before{content:"\e43a"}.fa-playstation:before{content:"\f3df"}.fa-product-hunt:before{content:"\f288"}.fa-pushed:before{content:"\f3e1"}.fa-python:before{content:"\f3e2"}.fa-qq:before{content:"\f1d6"}.fa-quinscape:before{content:"\f459"}.fa-quora:before{content:"\f2c4"}.fa-r-project:before{content:"\f4f7"}.fa-raspberry-pi:before{content:"\f7bb"}.fa-ravelry:before{content:"\f2d9"}.fa-react:before{content:"\f41b"}.fa-reacteurope:before{content:"\f75d"}.fa-readme:before{content:"\f4d5"}.fa-rebel:before{content:"\f1d0"}.fa-red-river:before{content:"\f3e3"}.fa-reddit:before{content:"\f1a1"}.fa-reddit-alien:before{content:"\f281"}.fa-redhat:before{content:"\f7bc"}.fa-renren:before{content:"\f18b"}.fa-replyd:before{content:"\f3e6"}.fa-researchgate:before{content:"\f4f8"}.fa-resolving:before{content:"\f3e7"}.fa-rev:before{content:"\f5b2"}.fa-rocketchat:before{content:"\f3e8"}.fa-rockrms:before{content:"\f3e9"}.fa-rust:before{content:"\e07a"}.fa-safari:before{content:"\f267"}.fa-salesforce:before{content:"\f83b"}.fa-sass:before{content:"\f41e"}.fa-schlix:before{content:"\f3ea"}.fa-screenpal:before{content:"\e570"}.fa-scribd:before{content:"\f28a"}.fa-searchengin:before{content:"\f3eb"}.fa-sellcast:before{content:"\f2da"}.fa-sellsy:before{content:"\f213"}.fa-servicestack:before{content:"\f3ec"}.fa-shirtsinbulk:before{content:"\f214"}.fa-shopify:before{content:"\e057"}.fa-shopware:before{content:"\f5b5"}.fa-simplybuilt:before{content:"\f215"}.fa-sistrix:before{content:"\f3ee"}.fa-sith:before{content:"\f512"}.fa-sitrox:before{content:"\e44a"}.fa-sketch:before{content:"\f7c6"}.fa-skyatlas:before{content:"\f216"}.fa-skype:before{content:"\f17e"}.fa-slack-hash:before,.fa-slack:before{content:"\f198"}.fa-slideshare:before{content:"\f1e7"}.fa-snapchat-ghost:before,.fa-snapchat:before{content:"\f2ab"}.fa-soundcloud:before{content:"\f1be"}.fa-sourcetree:before{content:"\f7d3"}.fa-space-awesome:before{content:"\e5ac"}.fa-speakap:before{content:"\f3f3"}.fa-speaker-deck:before{content:"\f83c"}.fa-spotify:before{content:"\f1bc"}.fa-behance-square:before,.fa-square-behance:before{content:"\f1b5"}.fa-dribbble-square:before,.fa-square-dribbble:before{content:"\f397"}.fa-facebook-square:before,.fa-square-facebook:before{content:"\f082"}.fa-square-font-awesome:before{content:"\e5ad"}.fa-font-awesome-alt:before,.fa-square-font-awesome-stroke:before{content:"\f35c"}.fa-git-square:before,.fa-square-git:before{content:"\f1d2"}.fa-github-square:before,.fa-square-github:before{content:"\f092"}.fa-gitlab-square:before,.fa-square-gitlab:before{content:"\e5ae"}.fa-google-plus-square:before,.fa-square-google-plus:before{content:"\f0d4"}.fa-hacker-news-square:before,.fa-square-hacker-news:before{content:"\f3af"}.fa-instagram-square:before,.fa-square-instagram:before{content:"\e055"}.fa-js-square:before,.fa-square-js:before{content:"\f3b9"}.fa-lastfm-square:before,.fa-square-lastfm:before{content:"\f203"}.fa-odnoklassniki-square:before,.fa-square-odnoklassniki:before{content:"\f264"}.fa-pied-piper-square:before,.fa-square-pied-piper:before{content:"\e01e"}.fa-pinterest-square:before,.fa-square-pinterest:before{content:"\f0d3"}.fa-reddit-square:before,.fa-square-reddit:before{content:"\f1a2"}.fa-snapchat-square:before,.fa-square-snapchat:before{content:"\f2ad"}.fa-square-steam:before,.fa-steam-square:before{content:"\f1b7"}.fa-square-tumblr:before,.fa-tumblr-square:before{content:"\f174"}.fa-square-twitter:before,.fa-twitter-square:before{content:"\f081"}.fa-square-viadeo:before,.fa-viadeo-square:before{content:"\f2aa"}.fa-square-vimeo:before,.fa-vimeo-square:before{content:"\f194"}.fa-square-whatsapp:before,.fa-whatsapp-square:before{content:"\f40c"}.fa-square-xing:before,.fa-xing-square:before{content:"\f169"}.fa-square-youtube:before,.fa-youtube-square:before{content:"\f431"}.fa-squarespace:before{content:"\f5be"}.fa-stack-exchange:before{content:"\f18d"}.fa-stack-overflow:before{content:"\f16c"}.fa-stackpath:before{content:"\f842"}.fa-staylinked:before{content:"\f3f5"}.fa-steam:before{content:"\f1b6"}.fa-steam-symbol:before{content:"\f3f6"}.fa-sticker-mule:before{content:"\f3f7"}.fa-strava:before{content:"\f428"}.fa-stripe:before{content:"\f429"}.fa-stripe-s:before{content:"\f42a"}.fa-studiovinari:before{content:"\f3f8"}.fa-stumbleupon:before{content:"\f1a4"}.fa-stumbleupon-circle:before{content:"\f1a3"}.fa-superpowers:before{content:"\f2dd"}.fa-supple:before{content:"\f3f9"}.fa-suse:before{content:"\f7d6"}.fa-swift:before{content:"\f8e1"}.fa-symfony:before{content:"\f83d"}.fa-teamspeak:before{content:"\f4f9"}.fa-telegram-plane:before,.fa-telegram:before{content:"\f2c6"}.fa-tencent-weibo:before{content:"\f1d5"}.fa-the-red-yeti:before{content:"\f69d"}.fa-themeco:before{content:"\f5c6"}.fa-themeisle:before{content:"\f2b2"}.fa-think-peaks:before{content:"\f731"}.fa-tiktok:before{content:"\e07b"}.fa-trade-federation:before{content:"\f513"}.fa-trello:before{content:"\f181"}.fa-tumblr:before{content:"\f173"}.fa-twitch:before{content:"\f1e8"}.fa-twitter:before{content:"\f099"}.fa-typo3:before{content:"\f42b"}.fa-uber:before{content:"\f402"}.fa-ubuntu:before{content:"\f7df"}.fa-uikit:before{content:"\f403"}.fa-umbraco:before{content:"\f8e8"}.fa-uncharted:before{content:"\e084"}.fa-uniregistry:before{content:"\f404"}.fa-unity:before{content:"\e049"}.fa-unsplash:before{content:"\e07c"}.fa-untappd:before{content:"\f405"}.fa-ups:before{content:"\f7e0"}.fa-usb:before{content:"\f287"}.fa-usps:before{content:"\f7e1"}.fa-ussunnah:before{content:"\f407"}.fa-vaadin:before{content:"\f408"}.fa-viacoin:before{content:"\f237"}.fa-viadeo:before{content:"\f2a9"}.fa-viber:before{content:"\f409"}.fa-vimeo:before{content:"\f40a"}.fa-vimeo-v:before{content:"\f27d"}.fa-vine:before{content:"\f1ca"}.fa-vk:before{content:"\f189"}.fa-vnv:before{content:"\f40b"}.fa-vuejs:before{content:"\f41f"}.fa-watchman-monitoring:before{content:"\e087"}.fa-waze:before{content:"\f83f"}.fa-weebly:before{content:"\f5cc"}.fa-weibo:before{content:"\f18a"}.fa-weixin:before{content:"\f1d7"}.fa-whatsapp:before{content:"\f232"}.fa-whmcs:before{content:"\f40d"}.fa-wikipedia-w:before{content:"\f266"}.fa-windows:before{content:"\f17a"}.fa-wirsindhandwerk:before,.fa-wsh:before{content:"\e2d0"}.fa-wix:before{content:"\f5cf"}.fa-wizards-of-the-coast:before{content:"\f730"}.fa-wodu:before{content:"\e088"}.fa-wolf-pack-battalion:before{content:"\f514"}.fa-wordpress:before{content:"\f19a"}.fa-wordpress-simple:before{content:"\f411"}.fa-wpbeginner:before{content:"\f297"}.fa-wpexplorer:before{content:"\f2de"}.fa-wpforms:before{content:"\f298"}.fa-rendact:before,.fa-wpressr:before{content:"\f3e4"}.fa-xbox:before{content:"\f412"}.fa-xing:before{content:"\f168"}.fa-y-combinator:before{content:"\f23b"}.fa-yahoo:before{content:"\f19e"}.fa-yammer:before{content:"\f840"}.fa-yandex:before{content:"\f413"}.fa-yandex-international:before{content:"\f414"}.fa-yarn:before{content:"\f7e3"}.fa-yelp:before{content:"\f1e9"}.fa-yoast:before{content:"\f2b1"}.fa-youtube:before{content:"\f167"}.fa-zhihu:before{content:"\f63f"}:host,:root{--fa-font-regular:normal 400 1em/1 "Font Awesome 6 Free"}@font-face{font-display:block;font-family:Font Awesome\ 6 Free;font-style:normal;font-weight:400;src:url(../webfonts/fa-regular-400.woff2) format("woff2"),url(../webfonts/fa-regular-400.ttf) format("truetype")}.fa-regular,.far{font-family:Font Awesome\ 6 Free;font-weight:400}:host,:root{--fa-font-solid:normal 900 1em/1 "Font Awesome 6 Free"}@font-face{font-display:block;font-family:Font Awesome\ 6 Free;font-style:normal;font-weight:900;src:url(../webfonts/fa-solid-900.woff2) format("woff2"),url(../webfonts/fa-solid-900.ttf) format("truetype")}.fa-solid,.fas{font-family:Font Awesome\ 6 Free;font-weight:900}@font-face{font-display:block;font-family:Font Awesome\ 5 Brands;font-weight:400;src:url(../webfonts/fa-brands-400.woff2) format("woff2"),url(../webfonts/fa-brands-400.ttf) format("truetype")}@font-face{font-display:block;font-family:Font Awesome\ 5 Free;font-weight:900;src:url(../webfonts/fa-solid-900.woff2) format("woff2"),url(../webfonts/fa-solid-900.ttf) format("truetype")}@font-face{font-display:block;font-family:Font Awesome\ 5 Free;font-weight:400;src:url(../webfonts/fa-regular-400.woff2) format("woff2"),url(../webfonts/fa-regular-400.ttf) format("truetype")}@font-face{font-display:block;font-family:FontAwesome;src:url(../webfonts/fa-solid-900.woff2) format("woff2"),url(../webfonts/fa-solid-900.ttf) format("truetype")}@font-face{font-display:block;font-family:FontAwesome;src:url(../webfonts/fa-brands-400.woff2) format("woff2"),url(../webfonts/fa-brands-400.ttf) format("truetype")}@font-face{font-display:block;font-family:FontAwesome;src:url(../webfonts/fa-regular-400.woff2) format("woff2"),url(../webfonts/fa-regular-400.ttf) format("truetype");unicode-range:u+f003,u+f006,u+f014,u+f016-f017,u+f01a-f01b,u+f01d,u+f022,u+f03e,u+f044,u+f046,u+f05c-f05d,u+f06e,u+f070,u+f087-f088,u+f08a,u+f094,u+f096-f097,u+f09d,u+f0a0,u+f0a2,u+f0a4-f0a7,u+f0c5,u+f0c7,u+f0e5-f0e6,u+f0eb,u+f0f6-f0f8,u+f10c,u+f114-f115,u+f118-f11a,u+f11c-f11d,u+f133,u+f147,u+f14e,u+f150-f152,u+f185-f186,u+f18e,u+f190-f192,u+f196,u+f1c1-f1c9,u+f1d9,u+f1db,u+f1e3,u+f1ea,u+f1f7,u+f1f9,u+f20a,u+f247-f248,u+f24a,u+f24d,u+f255-f25b,u+f25d,u+f271-f274,u+f278,u+f27b,u+f28c,u+f28e,u+f29c,u+f2b5,u+f2b7,u+f2ba,u+f2bc,u+f2be,u+f2c0-f2c1,u+f2c3,u+f2d0,u+f2d2,u+f2d4,u+f2dc}@font-face{font-display:block;font-family:FontAwesome;src:url(../webfonts/fa-v4compatibility.woff2) format("woff2"),url(../webfonts/fa-v4compatibility.ttf) format("truetype");unicode-range:u+f041,u+f047,u+f065-f066,u+f07d-f07e,u+f080,u+f08b,u+f08e,u+f090,u+f09a,u+f0ac,u+f0ae,u+f0b2,u+f0d0,u+f0d6,u+f0e4,u+f0ec,u+f10a-f10b,u+f123,u+f13e,u+f148-f149,u+f14c,u+f156,u+f15e,u+f160-f161,u+f163,u+f175-f178,u+f195,u+f1f8,u+f219,u+f27a}
\ No newline at end of file
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js b/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js
deleted file mode 100644
index f504685..0000000
--- a/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/*! For license information please see all.min.js.LICENSE.txt */
-!function(){"use strict";var C={},c={};try{"undefined"!=typeof window&&(C=window),"undefined"!=typeof document&&(c=document)}catch(C){}var z=void 0===(s=(C.navigator||{}).userAgent)?"":s,l=C,e=c;function a(C,c){var z,l=Object.keys(C);return Object.getOwnPropertySymbols&&(z=Object.getOwnPropertySymbols(C),c&&(z=z.filter((function(c){return Object.getOwnPropertyDescriptor(C,c).enumerable}))),l.push.apply(l,z)),l}function M(C){for(var c=1;c<arguments.length;c++){var z=null!=arguments[c]?arguments[c]:{};c%2?a(Object(z),!0).forEach((function(c){var l,e;l=C,c=z[e=c],e in l?Object.defineProperty(l,e,{value:c,enumerable:!0,configurable:!0,writable:!0}):l[e]=c})):Object.getOwnPropertyDescriptors?Object.defineProperties(C,Object.getOwnPropertyDescriptors(z)):a(Object(z)).forEach((function(c){Object.defineProperty(C,c,Object.getOwnPropertyDescriptor(z,c))}))}return C}function L(C,c){(null==c||c>C.length)&&(c=C.length);for(var z=0,l=new Array(c);z<c;z++)l[z]=C[z];return l}l.document,e.documentElement&&e.head&&"function"==typeof e.addEventListener&&e.createElement,~z.indexOf("MSIE")||z.indexOf("Trident/");var V="___FONT_AWESOME___",H=function(){try{return!0}catch(C){return!1}}(),t=[1,2,3,4,5,6,7,8,9,10],r=t.concat([11,12,13,14,15,16,17,18,19,20]),s="duotone-group";C="swap-opacity",c="primary",e="secondary",[].concat(function(C){if(Array.isArray(C))return L(C)}(z=Object.keys({solid:"fas",regular:"far",light:"fal",thin:"fat",duotone:"fad",brands:"fab",kit:"fak"}))||function(C){if("undefined"!=typeof Symbol&&null!=C[Symbol.iterator]||null!=C["@@iterator"])return Array.from(C)}(z)||function(C,c){if(C){if("string"==typeof C)return L(C,c);var z=Object.prototype.toString.call(C).slice(8,-1);return"Map"===(z="Object"===z&&C.constructor?C.constructor.name:z)||"Set"===z?Array.from(C):"Arguments"===z||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(z)?L(C,c):void 0}}(z)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}(),["2xs","xs","sm","lg","xl","2xl","beat","border","fade","beat-fade","bounce","flip-both","flip-horizontal","flip-vertical","flip","fw","inverse","layers-counter","layers-text","layers","li","pull-left","pull-right","pulse","rotate-180","rotate-270","rotate-90","rotate-by","shake","spin-pulse","spin-reverse","spin","stack-1x","stack-2x","stack","ul",s,C,c,e]).concat(t.map((function(C){return"".concat(C,"x")}))).concat(r.map((function(C){return"w-".concat(C)}))),(l=l||{})[V]||(l[V]={}),l[V].styles||(l[V].styles={}),l[V].hooks||(l[V].hooks={}),l[V].shims||(l[V].shims=[]);var h=l[V];function n(C){return Object.keys(C).reduce((function(c,z){var l=C[z];return l.icon?c[l.iconName]=l.icon:c[z]=l,c}),{})}function i(C,c,z){z=void 0!==(l=(2<arguments.length&&void 0!==z?z:{}).skipHooks)&&l;var l=n(c);"function"!=typeof h.hooks.addPack||z?h.styles[C]=M(M({},h.styles[C]||{}),l):h.hooks.addPack(C,n(c)),"fas"===C&&i("fa",c)}var o={"42-group":[640,512,["innosoft"],"e080","M320 96V416C341 416 361.8 411.9 381.2 403.8C400.6 395.8 418.3 383.1 433.1 369.1C447.1 354.3 459.8 336.6 467.8 317.2C475.9 297.8 480 277 480 256C480 234.1 475.9 214.2 467.8 194.8C459.8 175.4 447.1 157.7 433.1 142.9C418.3 128 400.6 116.2 381.2 108.2C361.8 100.1 341 96 320 96zM0 256L160 416L320 256L160 96L0 256zM480 256C480 277 484.1 297.8 492.2 317.2C500.2 336.6 512 354.3 526.9 369.1C541.7 383.1 559.4 395.8 578.8 403.8C598.2 411.9 618.1 416 640 416V96C597.6 96 556.9 112.9 526.9 142.9C496.9 172.9 480 213.6 480 256z"],"500px":[448,512,[],"f26e","M103.3 344.3c-6.5-14.2-6.9-18.3 7.4-23.1 25.6-8 8 9.2 43.2 49.2h.3v-93.9c1.2-50.2 44-92.2 97.7-92.2 53.9 0 97.7 43.5 97.7 96.8 0 63.4-60.8 113.2-128.5 93.3-10.5-4.2-2.1-31.7 8.5-28.6 53 0 89.4-10.1 89.4-64.4 0-61-77.1-89.6-116.9-44.6-23.5 26.4-17.6 42.1-17.6 157.6 50.7 31 118.3 22 160.4-20.1 24.8-24.8 38.5-58 38.5-93 0-35.2-13.8-68.2-38.8-93.3-24.8-24.8-57.8-38.5-93.3-38.5s-68.8 13.8-93.5 38.5c-.3 .3-16 16.5-21.2 23.9l-.5 .6c-3.3 4.7-6.3 9.1-20.1 6.1-6.9-1.7-14.3-5.8-14.3-11.8V20c0-5 3.9-10.5 10.5-10.5h241.3c8.3 0 8.3 11.6 8.3 15.1 0 3.9 0 15.1-8.3 15.1H130.3v132.9h.3c104.2-109.8 282.8-36 282.8 108.9 0 178.1-244.8 220.3-310.1 62.8zm63.3-260.8c-.5 4.2 4.6 24.5 14.6 20.6C306 56.6 384 144.5 390.6 144.5c4.8 0 22.8-15.3 14.3-22.8-93.2-89-234.5-57-238.3-38.2zM393 414.7C283 524.6 94 475.5 61 310.5c0-12.2-30.4-7.4-28.9 3.3 24 173.4 246 256.9 381.6 121.3 6.9-7.8-12.6-28.4-20.7-20.4zM213.6 306.6c0 4 4.3 7.3 5.5 8.5 3 3 6.1 4.4 8.5 4.4 3.8 0 2.6 .2 22.3-19.5 19.6 19.3 19.1 19.5 22.3 19.5 5.4 0 18.5-10.4 10.7-18.2L265.6 284l18.2-18.2c6.3-6.8-10.1-21.8-16.2-15.7L249.7 268c-18.6-18.8-18.4-19.5-21.5-19.5-5 0-18 11.7-12.4 17.3L234 284c-18.1 17.9-20.4 19.2-20.4 22.6z"],"accessible-icon":[448,512,[62107],"f368","M423.9 255.8L411 413.1c-3.3 40.7-63.9 35.1-60.6-4.9l10-122.5-41.1 2.3c10.1 20.7 15.8 43.9 15.8 68.5 0 41.2-16.1 78.7-42.3 106.5l-39.3-39.3c57.9-63.7 13.1-167.2-74-167.2-25.9 0-49.5 9.9-67.2 26L73 243.2c22-20.7 50.1-35.1 81.4-40.2l75.3-85.7-42.6-24.8-51.6 46c-30 26.8-70.6-18.5-40.5-45.4l68-60.7c9.8-8.8 24.1-10.2 35.5-3.6 0 0 139.3 80.9 139.5 81.1 16.2 10.1 20.7 36 6.1 52.6L285.7 229l106.1-5.9c18.5-1.1 33.6 14.4 32.1 32.7zm-64.9-154c28.1 0 50.9-22.8 50.9-50.9C409.9 22.8 387.1 0 359 0c-28.1 0-50.9 22.8-50.9 50.9 0 28.1 22.8 50.9 50.9 50.9zM179.6 456.5c-80.6 0-127.4-90.6-82.7-156.1l-39.7-39.7C36.4 287 24 320.3 24 356.4c0 130.7 150.7 201.4 251.4 122.5l-39.7-39.7c-16 10.9-35.3 17.3-56.1 17.3z"],accusoft:[640,512,[],"f369","M322.1 252v-1l-51.2-65.8s-12 1.6-25 15.1c-9 9.3-242.1 239.1-243.4 240.9-7 10 1.6 6.8 15.7 1.7 .8 0 114.5-36.6 114.5-36.6 .5-.6-.1-.1 .6-.6-.4-5.1-.8-26.2-1-27.7-.6-5.2 2.2-6.9 7-8.9l92.6-33.8c.6-.8 88.5-81.7 90.2-83.3zm160.1 120.1c13.3 16.1 20.7 13.3 30.8 9.3 3.2-1.2 115.4-47.6 117.8-48.9 8-4.3-1.7-16.7-7.2-23.4-2.1-2.5-205.1-245.6-207.2-248.3-9.7-12.2-14.3-12.9-38.4-12.8-10.2 0-106.8 .5-116.5 .6-19.2 .1-32.9-.3-19.2 16.9C250 75 476.5 365.2 482.2 372.1zm152.7 1.6c-2.3-.3-24.6-4.7-38-7.2 0 0-115 50.4-117.5 51.6-16 7.3-26.9-3.2-36.7-14.6l-57.1-74c-5.4-.9-60.4-9.6-65.3-9.3-3.1 .2-9.6 .8-14.4 2.9-4.9 2.1-145.2 52.8-150.2 54.7-5.1 2-11.4 3.6-11.1 7.6 .2 2.5 2 2.6 4.6 3.5 2.7 .8 300.9 67.6 308 69.1 15.6 3.3 38.5 10.5 53.6 1.7 2.1-1.2 123.8-76.4 125.8-77.8 5.4-4 4.3-6.8-1.7-8.2z"],adn:[496,512,[],"f170","M248 167.5l64.9 98.8H183.1l64.9-98.8zM496 256c0 136.9-111.1 248-248 248S0 392.9 0 256 111.1 8 248 8s248 111.1 248 248zm-99.8 82.7L248 115.5 99.8 338.7h30.4l33.6-51.7h168.6l33.6 51.7h30.2z"],adversal:[512,512,[],"f36a","M482.1 32H28.7C5.8 32 0 37.9 0 60.9v390.2C0 474.4 5.8 480 28.7 480h453.4c24.4 0 29.9-5.2 29.9-29.7V62.2c0-24.6-5.4-30.2-29.9-30.2zM178.4 220.3c-27.5-20.2-72.1-8.7-84.2 23.4-4.3 11.1-9.3 9.5-17.5 8.3-9.7-1.5-17.2-3.2-22.5-5.5-28.8-11.4 8.6-55.3 24.9-64.3 41.1-21.4 83.4-22.2 125.3-4.8 40.9 16.8 34.5 59.2 34.5 128.5 2.7 25.8-4.3 58.3 9.3 88.8 1.9 4.4 .4 7.9-2.7 10.7-8.4 6.7-39.3 2.2-46.6-7.4-1.9-2.2-1.8-3.6-3.9-6.2-3.6-3.9-7.3-2.2-11.9 1-57.4 36.4-140.3 21.4-147-43.3-3.1-29.3 12.4-57.1 39.6-71 38.2-19.5 112.2-11.8 114-30.9 1.1-10.2-1.9-20.1-11.3-27.3zm286.7 222c0 15.1-11.1 9.9-17.8 9.9H52.4c-7.4 0-18.2 4.8-17.8-10.7 .4-13.9 10.5-9.1 17.1-9.1 132.3-.4 264.5-.4 396.8 0 6.8 0 16.6-4.4 16.6 9.9zm3.8-340.5v291c0 5.7-.7 13.9-8.1 13.9-12.4-.4-27.5 7.1-36.1-5.6-5.8-8.7-7.8-4-12.4-1.2-53.4 29.7-128.1 7.1-144.4-85.2-6.1-33.4-.7-67.1 15.7-100 11.8-23.9 56.9-76.1 136.1-30.5v-71c0-26.2-.1-26.2 26-26.2 3.1 0 6.6 .4 9.7 0 10.1-.8 13.6 4.4 13.6 14.3-.1 .2-.1 .3-.1 .5zm-51.5 232.3c-19.5 47.6-72.9 43.3-90 5.2-15.1-33.3-15.5-68.2 .4-101.5 16.3-34.1 59.7-35.7 81.5-4.8 20.6 28.8 14.9 84.6 8.1 101.1zm-294.8 35.3c-7.5-1.3-33-3.3-33.7-27.8-.4-13.9 7.8-23 19.8-25.8 24.4-5.9 49.3-9.9 73.7-14.7 8.9-2 7.4 4.4 7.8 9.5 1.4 33-26.1 59.2-67.6 58.8z"],affiliatetheme:[512,512,[],"f36b","M159.7 237.4C108.4 308.3 43.1 348.2 14 326.6-15.2 304.9 2.8 230 54.2 159.1c51.3-70.9 116.6-110.8 145.7-89.2 29.1 21.6 11.1 96.6-40.2 167.5zm351.2-57.3C437.1 303.5 319 367.8 246.4 323.7c-25-15.2-41.3-41.2-49-73.8-33.6 64.8-92.8 113.8-164.1 133.2 49.8 59.3 124.1 96.9 207 96.9 150 0 271.6-123.1 271.6-274.9 .1-8.5-.3-16.8-1-25z"],airbnb:[448,512,[],"f834","M224 373.1c-25.24-31.67-40.08-59.43-45-83.18-22.55-88 112.6-88 90.06 0-5.45 24.25-20.29 52-45 83.18zm138.1 73.23c-42.06 18.31-83.67-10.88-119.3-50.47 103.9-130.1 46.11-200-18.85-200-54.92 0-85.16 46.51-73.28 100.5 6.93 29.19 25.23 62.39 54.43 99.5-32.53 36.05-60.55 52.69-85.15 54.92-50 7.43-89.11-41.06-71.3-91.09 15.1-39.16 111.7-231.2 115.9-241.6 15.75-30.07 25.56-57.4 59.38-57.4 32.34 0 43.4 25.94 60.37 59.87 36 70.62 89.35 177.5 114.8 239.1 13.17 33.07-1.37 71.29-37.01 86.64zm47-136.1C280.3 35.93 273.1 32 224 32c-45.52 0-64.87 31.67-84.66 72.79C33.18 317.1 22.89 347.2 22 349.8-3.22 419.1 48.74 480 111.6 480c21.71 0 60.61-6.06 112.4-62.4 58.68 63.78 101.3 62.4 112.4 62.4 62.89 .05 114.8-60.86 89.61-130.2 .02-3.89-16.82-38.9-16.82-39.58z"],algolia:[448,512,[],"f36c","M229.3 182.6c-49.3 0-89.2 39.9-89.2 89.2 0 49.3 39.9 89.2 89.2 89.2s89.2-39.9 89.2-89.2c0-49.3-40-89.2-89.2-89.2zm62.7 56.6l-58.9 30.6c-1.8 .9-3.8-.4-3.8-2.3V201c0-1.5 1.3-2.7 2.7-2.6 26.2 1 48.9 15.7 61.1 37.1 .7 1.3 .2 3-1.1 3.7zM389.1 32H58.9C26.4 32 0 58.4 0 90.9V421c0 32.6 26.4 59 58.9 59H389c32.6 0 58.9-26.4 58.9-58.9V90.9C448 58.4 421.6 32 389.1 32zm-202.6 84.7c0-10.8 8.7-19.5 19.5-19.5h45.3c10.8 0 19.5 8.7 19.5 19.5v15.4c0 1.8-1.7 3-3.3 2.5-12.3-3.4-25.1-5.1-38.1-5.1-13.5 0-26.7 1.8-39.4 5.5-1.7 .5-3.4-.8-3.4-2.5v-15.8zm-84.4 37l9.2-9.2c7.6-7.6 19.9-7.6 27.5 0l7.7 7.7c1.1 1.1 1 3-.3 4-6.2 4.5-12.1 9.4-17.6 14.9-5.4 5.4-10.4 11.3-14.8 17.4-1 1.3-2.9 1.5-4 .3l-7.7-7.7c-7.6-7.5-7.6-19.8 0-27.4zm127.2 244.8c-70 0-126.6-56.7-126.6-126.6s56.7-126.6 126.6-126.6c70 0 126.6 56.6 126.6 126.6 0 69.8-56.7 126.6-126.6 126.6z"],alipay:[448,512,[],"f642","M377.7 32H70.26C31.41 32 0 63.41 0 102.3v307.5C0 448.6 31.41 480 70.26 480h307.5c38.52 0 69.76-31.08 70.26-69.6-45.96-25.62-110.6-60.34-171.6-88.44-32.07 43.97-84.14 81-148.6 81-70.59 0-93.73-45.3-97.04-76.37-3.97-39.01 14.88-81.5 99.52-81.5 35.38 0 79.35 10.25 127.1 24.96 16.53-30.09 26.45-60.34 26.45-60.34h-178.2v-16.7h92.08v-31.24H88.28v-19.01h109.4V92.34h50.92v50.42h109.4v19.01H248.6v31.24h88.77s-15.21 46.62-38.35 90.92c48.93 16.7 100 36.04 148.6 52.74V102.3C447.8 63.57 416.4 32 377.7 32zM47.28 322.1c.99 20.17 10.25 53.73 69.93 53.73 52.07 0 92.58-39.68 117.9-72.9-44.63-18.68-84.48-31.41-109.4-31.41-67.45 0-79.35 33.06-78.36 50.58z"],amazon:[448,512,[],"f270","M257.2 162.7c-48.7 1.8-169.5 15.5-169.5 117.5 0 109.5 138.3 114 183.5 43.2 6.5 10.2 35.4 37.5 45.3 46.8l56.8-56S341 288.9 341 261.4V114.3C341 89 316.5 32 228.7 32 140.7 32 94 87 94 136.3l73.5 6.8c16.3-49.5 54.2-49.5 54.2-49.5 40.7-.1 35.5 29.8 35.5 69.1zm0 86.8c0 80-84.2 68-84.2 17.2 0-47.2 50.5-56.7 84.2-57.8v40.6zm136 163.5c-7.7 10-70 67-174.5 67S34.2 408.5 9.7 379c-6.8-7.7 1-11.3 5.5-8.3C88.5 415.2 203 488.5 387.7 401c7.5-3.7 13.3 2 5.5 12zm39.8 2.2c-6.5 15.8-16 26.8-21.2 31-5.5 4.5-9.5 2.7-6.5-3.8s19.3-46.5 12.7-55c-6.5-8.3-37-4.3-48-3.2-10.8 1-13 2-14-.3-2.3-5.7 21.7-15.5 37.5-17.5 15.7-1.8 41-.8 46 5.7 3.7 5.1 0 27.1-6.5 43.1z"],"amazon-pay":[640,512,[],"f42c","M14 325.3c2.3-4.2 5.2-4.9 9.7-2.5 10.4 5.6 20.6 11.4 31.2 16.7a595.9 595.9 0 0 0 127.4 46.3 616.6 616.6 0 0 0 63.2 11.8 603.3 603.3 0 0 0 95 5.2c17.4-.4 34.8-1.8 52.1-3.8a603.7 603.7 0 0 0 163.3-42.8c2.9-1.2 5.9-2 9.1-1.2 6.7 1.8 9 9 4.1 13.9a70 70 0 0 1 -9.6 7.4c-30.7 21.1-64.2 36.4-99.6 47.9a473.3 473.3 0 0 1 -75.1 17.6 431 431 0 0 1 -53.2 4.8 21.3 21.3 0 0 0 -2.5 .3H308a21.3 21.3 0 0 0 -2.5-.3c-3.6-.2-7.2-.3-10.7-.4a426.3 426.3 0 0 1 -50.4-5.3A448.4 448.4 0 0 1 164 420a443.3 443.3 0 0 1 -145.6-87c-1.8-1.6-3-3.8-4.4-5.7zM172 65.1l-4.3 .6a80.92 80.92 0 0 0 -38 15.1c-2.4 1.7-4.6 3.5-7.1 5.4a4.29 4.29 0 0 1 -.4-1.4c-.4-2.7-.8-5.5-1.3-8.2-.7-4.6-3-6.6-7.6-6.6h-11.5c-6.9 0-8.2 1.3-8.2 8.2v209.3c0 1 0 2 .1 3 .2 3 2 4.9 4.9 5 7 .1 14.1 .1 21.1 0 2.9 0 4.7-2 5-5 .1-1 .1-2 .1-3v-72.4c1.1 .9 1.7 1.4 2.2 1.9 17.9 14.9 38.5 19.8 61 15.4 20.4-4 34.6-16.5 43.8-34.9 7-13.9 9.9-28.7 10.3-44.1 .5-17.1-1.2-33.9-8.1-49.8-8.5-19.6-22.6-32.5-43.9-36.9-3.2-.7-6.5-1-9.8-1.5-2.8-.1-5.5-.1-8.3-.1zM124.6 107a3.48 3.48 0 0 1 1.7-3.3c13.7-9.5 28.8-14.5 45.6-13.2 14.9 1.1 27.1 8.4 33.5 25.9 3.9 10.7 4.9 21.8 4.9 33 0 10.4-.8 20.6-4 30.6-6.8 21.3-22.4 29.4-42.6 28.5-14-.6-26.2-6-37.4-13.9a3.57 3.57 0 0 1 -1.7-3.3c.1-14.1 0-28.1 0-42.2s.1-28 0-42.1zm205.7-41.9c-1 .1-2 .3-2.9 .4a148 148 0 0 0 -28.9 4.1c-6.1 1.6-12 3.8-17.9 5.8-3.6 1.2-5.4 3.8-5.3 7.7 .1 3.3-.1 6.6 0 9.9 .1 4.8 2.1 6.1 6.8 4.9 7.8-2 15.6-4.2 23.5-5.7 12.3-2.3 24.7-3.3 37.2-1.4 6.5 1 12.6 2.9 16.8 8.4 3.7 4.8 5.1 10.5 5.3 16.4 .3 8.3 .2 16.6 .3 24.9a7.84 7.84 0 0 1 -.2 1.4c-.5-.1-.9 0-1.3-.1a180.6 180.6 0 0 0 -32-4.9c-11.3-.6-22.5 .1-33.3 3.9-12.9 4.5-23.3 12.3-29.4 24.9-4.7 9.8-5.4 20.2-3.9 30.7 2 14 9 24.8 21.4 31.7 11.9 6.6 24.8 7.4 37.9 5.4 15.1-2.3 28.5-8.7 40.3-18.4a7.36 7.36 0 0 1 1.6-1.1c.6 3.8 1.1 7.4 1.8 11 .6 3.1 2.5 5.1 5.4 5.2 5.4 .1 10.9 .1 16.3 0a4.84 4.84 0 0 0 4.8-4.7 26.2 26.2 0 0 0 .1-2.8v-106a80 80 0 0 0 -.9-12.9c-1.9-12.9-7.4-23.5-19-30.4-6.7-4-14.1-6-21.8-7.1-3.6-.5-7.2-.8-10.8-1.3-3.9 .1-7.9 .1-11.9 .1zm35 127.7a3.33 3.33 0 0 1 -1.5 3c-11.2 8.1-23.5 13.5-37.4 14.9-5.7 .6-11.4 .4-16.8-1.8a20.08 20.08 0 0 1 -12.4-13.3 32.9 32.9 0 0 1 -.1-19.4c2.5-8.3 8.4-13 16.4-15.6a61.33 61.33 0 0 1 24.8-2.2c8.4 .7 16.6 2.3 25 3.4 1.6 .2 2.1 1 2.1 2.6-.1 4.8 0 9.5 0 14.3s-.2 9.4-.1 14.1zm259.9 129.4c-1-5-4.8-6.9-9.1-8.3a88.42 88.42 0 0 0 -21-3.9 147.3 147.3 0 0 0 -39.2 1.9c-14.3 2.7-27.9 7.3-40 15.6a13.75 13.75 0 0 0 -3.7 3.5 5.11 5.11 0 0 0 -.5 4c.4 1.5 2.1 1.9 3.6 1.8a16.2 16.2 0 0 0 2.2-.1c7.8-.8 15.5-1.7 23.3-2.5 11.4-1.1 22.9-1.8 34.3-.9a71.64 71.64 0 0 1 14.4 2.7c5.1 1.4 7.4 5.2 7.6 10.4 .4 8-1.4 15.7-3.5 23.3-4.1 15.4-10 30.3-15.8 45.1a17.6 17.6 0 0 0 -1 3c-.5 2.9 1.2 4.8 4.1 4.1a10.56 10.56 0 0 0 4.8-2.5 145.9 145.9 0 0 0 12.7-13.4c12.8-16.4 20.3-35.3 24.7-55.6 .8-3.6 1.4-7.3 2.1-10.9v-17.3zM493.1 199q-19.35-53.55-38.7-107.2c-2-5.7-4.2-11.3-6.3-16.9-1.1-2.9-3.2-4.8-6.4-4.8-7.6-.1-15.2-.2-22.9-.1-2.5 0-3.7 2-3.2 4.5a43.1 43.1 0 0 0 1.9 6.1q29.4 72.75 59.1 145.5c1.7 4.1 2.1 7.6 .2 11.8-3.3 7.3-5.9 15-9.3 22.3-3 6.5-8 11.4-15.2 13.3a42.13 42.13 0 0 1 -15.4 1.1c-2.5-.2-5-.8-7.5-1-3.4-.2-5.1 1.3-5.2 4.8q-.15 5 0 9.9c.1 5.5 2 8 7.4 8.9a108.2 108.2 0 0 0 16.9 2c17.1 .4 30.7-6.5 39.5-21.4a131.6 131.6 0 0 0 9.2-18.4q35.55-89.7 70.6-179.6a26.62 26.62 0 0 0 1.6-5.5c.4-2.8-.9-4.4-3.7-4.4-6.6-.1-13.3 0-19.9 0a7.54 7.54 0 0 0 -7.7 5.2c-.5 1.4-1.1 2.7-1.6 4.1l-34.8 100c-2.5 7.2-5.1 14.5-7.7 22.2-.4-1.1-.6-1.7-.9-2.4z"],amilia:[448,512,[],"f36d","M240.1 32c-61.9 0-131.5 16.9-184.2 55.4-5.1 3.1-9.1 9.2-7.2 19.4 1.1 5.1 5.1 27.4 10.2 39.6 4.1 10.2 14.2 10.2 20.3 6.1 32.5-22.3 96.5-47.7 152.3-47.7 57.9 0 58.9 28.4 58.9 73.1v38.5C203 227.7 78.2 251 46.7 264.2 11.2 280.5 16.3 357.7 16.3 376s15.2 104 124.9 104c47.8 0 113.7-20.7 153.3-42.1v25.4c0 3 2.1 8.2 6.1 9.1 3.1 1 50.7 2 59.9 2s62.5 .3 66.5-.7c4.1-1 5.1-6.1 5.1-9.1V168c-.1-80.3-57.9-136-192-136zm50.2 348c-21.4 13.2-48.7 24.4-79.1 24.4-52.8 0-58.9-33.5-59-44.7 0-12.2-3-42.7 18.3-52.9 24.3-13.2 75.1-29.4 119.8-33.5z"],android:[576,512,[],"f17b","M420.5 301.9a24 24 0 1 1 24-24 24 24 0 0 1 -24 24m-265.1 0a24 24 0 1 1 24-24 24 24 0 0 1 -24 24m273.7-144.5 47.94-83a10 10 0 1 0 -17.27-10h0l-48.54 84.07a301.3 301.3 0 0 0 -246.6 0L116.2 64.45a10 10 0 1 0 -17.27 10h0l47.94 83C64.53 202.2 8.24 285.5 0 384H576c-8.24-98.45-64.54-181.8-146.9-226.6"],angellist:[448,512,[],"f209","M347.1 215.4c11.7-32.6 45.4-126.9 45.4-157.1 0-26.6-15.7-48.9-43.7-48.9-44.6 0-84.6 131.7-97.1 163.1C242 144 196.6 0 156.6 0c-31.1 0-45.7 22.9-45.7 51.7 0 35.3 34.2 126.8 46.6 162-6.3-2.3-13.1-4.3-20-4.3-23.4 0-48.3 29.1-48.3 52.6 0 8.9 4.9 21.4 8 29.7-36.9 10-51.1 34.6-51.1 71.7C46 435.6 114.4 512 210.6 512c118 0 191.4-88.6 191.4-202.9 0-43.1-6.9-82-54.9-93.7zM311.7 108c4-12.3 21.1-64.3 37.1-64.3 8.6 0 10.9 8.9 10.9 16 0 19.1-38.6 124.6-47.1 148l-34-6 33.1-93.7zM142.3 48.3c0-11.9 14.5-45.7 46.3 47.1l34.6 100.3c-15.6-1.3-27.7-3-35.4 1.4-10.9-28.8-45.5-119.7-45.5-148.8zM140 244c29.3 0 67.1 94.6 67.1 107.4 0 5.1-4.9 11.4-10.6 11.4-20.9 0-76.9-76.9-76.9-97.7 .1-7.7 12.7-21.1 20.4-21.1zm184.3 186.3c-29.1 32-66.3 48.6-109.7 48.6-59.4 0-106.3-32.6-128.9-88.3-17.1-43.4 3.8-68.3 20.6-68.3 11.4 0 54.3 60.3 54.3 73.1 0 4.9-7.7 8.3-11.7 8.3-16.1 0-22.4-15.5-51.1-51.4-29.7 29.7 20.5 86.9 58.3 86.9 26.1 0 43.1-24.2 38-42 3.7 0 8.3 .3 11.7-.6 1.1 27.1 9.1 59.4 41.7 61.7 0-.9 2-7.1 2-7.4 0-17.4-10.6-32.6-10.6-50.3 0-28.3 21.7-55.7 43.7-71.7 8-6 17.7-9.7 27.1-13.1 9.7-3.7 20-8 27.4-15.4-1.1-11.2-5.7-21.1-16.9-21.1-27.7 0-120.6 4-120.6-39.7 0-6.7 .1-13.1 17.4-13.1 32.3 0 114.3 8 138.3 29.1 18.1 16.1 24.3 113.2-31 174.7zm-98.6-126c9.7 3.1 19.7 4 29.7 6-7.4 5.4-14 12-20.3 19.1-2.8-8.5-6.2-16.8-9.4-25.1z"],angrycreative:[640,512,[],"f36e","M640 238.2l-3.2 28.2-34.5 2.3-2 18.1 34.5-2.3-3.2 28.2-34.4 2.2-2.3 20.1 34.4-2.2-3 26.1-64.7 4.1 12.7-113.2L527 365.2l-31.9 2-23.8-117.8 30.3-2 13.6 79.4 31.7-82.4 93.1-6.2zM426.8 371.5l28.3-1.8L468 249.6l-28.4 1.9-12.8 120zM162 388.1l-19.4-36-3.5 37.4-28.2 1.7 2.7-29.1c-11 18-32 34.3-56.9 35.8C23.9 399.9-3 377 .3 339.7c2.6-29.3 26.7-62.8 67.5-65.4 37.7-2.4 47.6 23.2 51.3 28.8l2.8-30.8 38.9-2.5c20.1-1.3 38.7 3.7 42.5 23.7l2.6-26.6 64.8-4.2-2.7 27.9-36.4 2.4-1.7 17.9 36.4-2.3-2.7 27.9-36.4 2.3-1.9 19.9 36.3-2.3-2.1 20.8 55-117.2 23.8-1.6L370.4 369l8.9-85.6-22.3 1.4 2.9-27.9 75-4.9-3 28-24.3 1.6-9.7 91.9-58 3.7-4.3-15.6-39.4 2.5-8 16.3-126.2 7.7zm-44.3-70.2l-26.4 1.7C84.6 307.2 76.9 303 65 303.8c-19 1.2-33.3 17.5-34.6 33.3-1.4 16 7.3 32.5 28.7 31.2 12.8-.8 21.3-8.6 28.9-18.9l27-1.7 2.7-29.8zm56.1-7.7c1.2-12.9-7.6-13.6-26.1-12.4l-2.7 28.5c14.2-.9 27.5-2.1 28.8-16.1zm21.1 70.8l5.8-60c-5 13.5-14.7 21.1-27.9 26.6l22.1 33.4zm135.4-45l-7.9-37.8-15.8 39.3 23.7-1.5zm-170.1-74.6l-4.3-17.5-39.6 2.6-8.1 18.2-31.9 2.1 57-121.9 23.9-1.6 30.7 102 9.9-104.7 27-1.8 37.8 63.6 6.5-66.6 28.5-1.9-4 41.2c7.4-13.5 22.9-44.7 63.6-47.5 40.5-2.8 52.4 29.3 53.4 30.3l3.3-32 39.3-2.7c12.7-.9 27.8 .3 36.3 9.7l-4.4-11.9 32.2-2.2 12.9 43.2 23-45.7 31-2.2-43.6 78.4-4.8 44.3-28.4 1.9 4.8-44.3-15.8-43c1 22.3-9.2 40.1-32 49.6l25.2 38.8-36.4 2.4-19.2-36.8-4 38.3-28.4 1.9 3.3-31.5c-6.7 9.3-19.7 35.4-59.6 38-26.2 1.7-45.6-10.3-55.4-39.2l-4 40.3-25 1.6-37.6-63.3-6.3 66.2-56.8 3.7zm276.6-82.1c10.2-.7 17.5-2.1 21.6-4.3 4.5-2.4 7-6.4 7.6-12.1 .6-5.3-.6-8.8-3.4-10.4-3.6-2.1-10.6-2.8-22.9-2l-2.9 28.8zM327.7 214c5.6 5.9 12.7 8.5 21.3 7.9 4.7-.3 9.1-1.8 13.3-4.1 5.5-3 10.6-8 15.1-14.3l-34.2 2.3 2.4-23.9 63.1-4.3 1.2-12-31.2 2.1c-4.1-3.7-7.8-6.6-11.1-8.1-4-1.7-8.1-2.8-12.2-2.5-8 .5-15.3 3.6-22 9.2-7.7 6.4-12 14.5-12.9 24.4-1.1 9.6 1.4 17.3 7.2 23.3zm-201.3 8.2l23.8-1.6-8.3-37.6-15.5 39.2z"],angular:[448,512,[],"f420","M185.7 268.1h76.2l-38.1-91.6-38.1 91.6zM223.8 32L16 106.4l31.8 275.7 176 97.9 176-97.9 31.8-275.7zM354 373.8h-48.6l-26.2-65.4H168.6l-26.2 65.4H93.7L223.8 81.5z"],"app-store":[512,512,[],"f36f","M255.9 120.9l9.1-15.7c5.6-9.8 18.1-13.1 27.9-7.5 9.8 5.6 13.1 18.1 7.5 27.9l-87.5 151.5h63.3c20.5 0 32 24.1 23.1 40.8H113.8c-11.3 0-20.4-9.1-20.4-20.4 0-11.3 9.1-20.4 20.4-20.4h52l66.6-115.4-20.8-36.1c-5.6-9.8-2.3-22.2 7.5-27.9 9.8-5.6 22.2-2.3 27.9 7.5l8.9 15.7zm-78.7 218l-19.6 34c-5.6 9.8-18.1 13.1-27.9 7.5-9.8-5.6-13.1-18.1-7.5-27.9l14.6-25.2c16.4-5.1 29.8-1.2 40.4 11.6zm168.9-61.7h53.1c11.3 0 20.4 9.1 20.4 20.4 0 11.3-9.1 20.4-20.4 20.4h-29.5l19.9 34.5c5.6 9.8 2.3 22.2-7.5 27.9-9.8 5.6-22.2 2.3-27.9-7.5-33.5-58.1-58.7-101.6-75.4-130.6-17.1-29.5-4.9-59.1 7.2-69.1 13.4 23 33.4 57.7 60.1 104zM256 8C119 8 8 119 8 256s111 248 248 248 248-111 248-248S393 8 256 8zm216 248c0 118.7-96.1 216-216 216-118.7 0-216-96.1-216-216 0-118.7 96.1-216 216-216 118.7 0 216 96.1 216 216z"],"app-store-ios":[448,512,[],"f370","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM127 384.5c-5.5 9.6-17.8 12.8-27.3 7.3-9.6-5.5-12.8-17.8-7.3-27.3l14.3-24.7c16.1-4.9 29.3-1.1 39.6 11.4L127 384.5zm138.9-53.9H84c-11 0-20-9-20-20s9-20 20-20h51l65.4-113.2-20.5-35.4c-5.5-9.6-2.2-21.8 7.3-27.3 9.6-5.5 21.8-2.2 27.3 7.3l8.9 15.4 8.9-15.4c5.5-9.6 17.8-12.8 27.3-7.3 9.6 5.5 12.8 17.8 7.3 27.3l-85.8 148.6h62.1c20.2 0 31.5 23.7 22.7 40zm98.1 0h-29l19.6 33.9c5.5 9.6 2.2 21.8-7.3 27.3-9.6 5.5-21.8 2.2-27.3-7.3-32.9-56.9-57.5-99.7-74-128.1-16.7-29-4.8-58 7.1-67.8 13.1 22.7 32.7 56.7 58.9 102h52c11 0 20 9 20 20 0 11.1-9 20-20 20z"],apper:[640,512,[],"f371","M42.1 239.1c22.2 0 29 2.8 33.5 14.6h.8v-22.9c0-11.3-4.8-15.4-17.9-15.4-11.3 0-14.4 2.5-15.1 12.8H4.8c.3-13.9 1.5-19.1 5.8-24.4C17.9 195 29.5 192 56.7 192c33 0 47.1 5 53.9 18.9 2 4.3 4 15.6 4 23.7v76.3H76.3l1.3-19.1h-1c-5.3 15.6-13.6 20.4-35.5 20.4-30.3 0-41.1-10.1-41.1-37.3 0-25.2 12.3-35.8 42.1-35.8zm17.1 48.1c13.1 0 16.9-3 16.9-13.4 0-9.1-4.3-11.6-19.6-11.6-13.1 0-17.9 3-17.9 12.1-.1 10.4 3.7 12.9 20.6 12.9zm77.8-94.9h38.3l-1.5 20.6h.8c9.1-17.1 15.9-20.9 37.5-20.9 14.4 0 24.7 3 31.5 9.1 9.8 8.6 12.8 20.4 12.8 48.1 0 30-3 43.1-12.1 52.9-6.8 7.3-16.4 10.1-33.2 10.1-20.4 0-29.2-5.5-33.8-21.2h-.8v70.3H137v-169zm80.9 60.7c0-27.5-3.3-32.5-20.7-32.5-16.9 0-20.7 5-20.7 28.7 0 28 3.5 33.5 21.2 33.5 16.4 0 20.2-5.6 20.2-29.7zm57.9-60.7h38.3l-1.5 20.6h.8c9.1-17.1 15.9-20.9 37.5-20.9 14.4 0 24.7 3 31.5 9.1 9.8 8.6 12.8 20.4 12.8 48.1 0 30-3 43.1-12.1 52.9-6.8 7.3-16.4 10.1-33.3 10.1-20.4 0-29.2-5.5-33.8-21.2h-.8v70.3h-39.5v-169zm80.9 60.7c0-27.5-3.3-32.5-20.7-32.5-16.9 0-20.7 5-20.7 28.7 0 28 3.5 33.5 21.2 33.5 16.4 0 20.2-5.6 20.2-29.7zm53.8-3.8c0-25.4 3.3-37.8 12.3-45.8 8.8-8.1 22.2-11.3 45.1-11.3 42.8 0 55.7 12.8 55.7 55.7v11.1h-75.3c-.3 2-.3 4-.3 4.8 0 16.9 4.5 21.9 20.1 21.9 13.9 0 17.9-3 17.9-13.9h37.5v2.3c0 9.8-2.5 18.9-6.8 24.7-7.3 9.8-19.6 13.6-44.3 13.6-27.5 0-41.6-3.3-50.6-12.3-8.5-8.5-11.3-21.3-11.3-50.8zm76.4-11.6c-.3-1.8-.3-3.3-.3-3.8 0-12.3-3.3-14.6-19.6-14.6-14.4 0-17.1 3-18.1 15.1l-.3 3.3h38.3zm55.6-45.3h38.3l-1.8 19.9h.7c6.8-14.9 14.4-20.2 29.7-20.2 10.8 0 19.1 3.3 23.4 9.3 5.3 7.3 6.8 14.4 6.8 34 0 1.5 0 5 .2 9.3h-35c.3-1.8 .3-3.3 .3-4 0-15.4-2-19.4-10.3-19.4-6.3 0-10.8 3.3-13.1 9.3-1 3-1 4.3-1 12.3v68h-38.3V192.3z"],apple:[384,512,[],"f179","M318.7 268.7c-.2-36.7 16.4-64.4 50-84.8-18.8-26.9-47.2-41.7-84.7-44.6-35.5-2.8-74.3 20.7-88.5 20.7-15 0-49.4-19.7-76.4-19.7C63.3 141.2 4 184.8 4 273.5q0 39.3 14.4 81.2c12.8 36.7 59 126.7 107.2 125.2 25.2-.6 43-17.9 75.8-17.9 31.8 0 48.3 17.9 76.4 17.9 48.6-.7 90.4-82.5 102.6-119.3-65.2-30.7-61.7-90-61.7-91.9zm-56.6-164.2c27.3-32.4 24.8-61.9 24-72.5-24.1 1.4-52 16.4-67.9 34.9-17.5 19.8-27.8 44.3-25.6 71.9 26.1 2 49.9-11.4 69.5-34.3z"],"apple-pay":[640,512,[],"f415","M116.9 158.5c-7.5 8.9-19.5 15.9-31.5 14.9-1.5-12 4.4-24.8 11.3-32.6 7.5-9.1 20.6-15.6 31.3-16.1 1.2 12.4-3.7 24.7-11.1 33.8m10.9 17.2c-17.4-1-32.3 9.9-40.5 9.9-8.4 0-21-9.4-34.8-9.1-17.9 .3-34.5 10.4-43.6 26.5-18.8 32.3-4.9 80 13.3 106.3 8.9 13 19.5 27.3 33.5 26.8 13.3-.5 18.5-8.6 34.5-8.6 16.1 0 20.8 8.6 34.8 8.4 14.5-.3 23.6-13 32.5-26 10.1-14.8 14.3-29.1 14.5-29.9-.3-.3-28-10.9-28.3-42.9-.3-26.8 21.9-39.5 22.9-40.3-12.5-18.6-32-20.6-38.8-21.1m100.4-36.2v194.9h30.3v-66.6h41.9c38.3 0 65.1-26.3 65.1-64.3s-26.4-64-64.1-64h-73.2zm30.3 25.5h34.9c26.3 0 41.3 14 41.3 38.6s-15 38.8-41.4 38.8h-34.8V165zm162.2 170.9c19 0 36.6-9.6 44.6-24.9h.6v23.4h28v-97c0-28.1-22.5-46.3-57.1-46.3-32.1 0-55.9 18.4-56.8 43.6h27.3c2.3-12 13.4-19.9 28.6-19.9 18.5 0 28.9 8.6 28.9 24.5v10.8l-37.8 2.3c-35.1 2.1-54.1 16.5-54.1 41.5 .1 25.2 19.7 42 47.8 42zm8.2-23.1c-16.1 0-26.4-7.8-26.4-19.6 0-12.3 9.9-19.4 28.8-20.5l33.6-2.1v11c0 18.2-15.5 31.2-36 31.2zm102.5 74.6c29.5 0 43.4-11.3 55.5-45.4L640 193h-30.8l-35.6 115.1h-.6L537.4 193h-31.6L557 334.9l-2.8 8.6c-4.6 14.6-12.1 20.3-25.5 20.3-2.4 0-7-.3-8.9-.5v23.4c1.8 .4 9.3 .7 11.6 .7z"],artstation:[512,512,[],"f77a","M2 377.4l43 74.3A51.35 51.35 0 0 0 90.9 480h285.4l-59.2-102.6zM501.8 350L335.6 59.3A51.38 51.38 0 0 0 290.2 32h-88.4l257.3 447.6 40.7-70.5c1.9-3.2 21-29.7 2-59.1zM275 304.5l-115.5-200L44 304.5z"],asymmetrik:[576,512,[],"f372","M517.5 309.2c38.8-40 58.1-80 58.5-116.1 .8-65.5-59.4-118.2-169.4-135C277.9 38.4 118.1 73.6 0 140.5 52 114 110.6 92.3 170.7 82.3c74.5-20.5 153-25.4 221.3-14.8C544.5 91.3 588.8 195 490.8 299.2c-10.2 10.8-22 21.1-35 30.6L304.9 103.4 114.7 388.9c-65.6-29.4-76.5-90.2-19.1-151.2 20.8-22.2 48.3-41.9 79.5-58.1 20-12.2 39.7-22.6 62-30.7-65.1 20.3-122.7 52.9-161.6 92.9-27.7 28.6-41.4 57.1-41.7 82.9-.5 35.1 23.4 65.1 68.4 83l-34.5 51.7h101.6l22-34.4c22.2 1 45.3 0 68.6-2.7l-22.8 37.1h135.5L340 406.3c18.6-5.3 36.9-11.5 54.5-18.7l45.9 71.8H542L468.6 349c18.5-12.1 35-25.5 48.9-39.8zm-187.6 80.5l-25-40.6-32.7 53.3c-23.4 3.5-46.7 5.1-69.2 4.4l101.9-159.3 78.7 123c-17.2 7.4-35.3 13.9-53.7 19.2z"],atlassian:[512,512,[],"f77b","M152.2 236.4c-7.7-8.2-19.7-7.7-24.8 2.8L1.6 490.2c-5 10 2.4 21.7 13.4 21.7h175c5.8 .1 11-3.2 13.4-8.4 37.9-77.8 15.1-196.3-51.2-267.1zM244.4 8.1c-122.3 193.4-8.5 348.6 65 495.5 2.5 5.1 7.7 8.4 13.4 8.4H497c11.2 0 18.4-11.8 13.4-21.7 0 0-234.5-470.6-240.4-482.3-5.3-10.6-18.8-10.8-25.6 .1z"],audible:[640,512,[],"f373","M640 199.9v54l-320 200L0 254v-54l320 200 320-200.1zm-194.5 72l47.1-29.4c-37.2-55.8-100.7-92.6-172.7-92.6-72 0-135.5 36.7-172.6 92.4h.3c2.5-2.3 5.1-4.5 7.7-6.7 89.7-74.4 219.4-58.1 290.2 36.3zm-220.1 18.8c16.9-11.9 36.5-18.7 57.4-18.7 34.4 0 65.2 18.4 86.4 47.6l45.4-28.4c-20.9-29.9-55.6-49.5-94.8-49.5-38.9 0-73.4 19.4-94.4 49zM103.6 161.1c131.8-104.3 318.2-76.4 417.5 62.1l.7 1 48.8-30.4C517.1 112.1 424.8 58.1 319.9 58.1c-103.5 0-196.6 53.5-250.5 135.6 9.9-10.5 22.7-23.5 34.2-32.6zm467 32.7z"],autoprefixer:[640,512,[],"f41c","M318.4 16l-161 480h77.5l25.4-81.4h119.5L405 496h77.5L318.4 16zm-40.3 341.9l41.2-130.4h1.5l40.9 130.4h-83.6zM640 405l-10-31.4L462.1 358l19.4 56.5L640 405zm-462.1-47L10 373.7 0 405l158.5 9.4 19.4-56.4z"],avianex:[512,512,[],"f374","M453.1 32h-312c-38.9 0-76.2 31.2-83.3 69.7L1.2 410.3C-5.9 448.8 19.9 480 58.9 480h312c38.9 0 76.2-31.2 83.3-69.7l56.7-308.5c7-38.6-18.8-69.8-57.8-69.8zm-58.2 347.3l-32 13.5-115.4-110c-14.7 10-29.2 19.5-41.7 27.1l22.1 64.2-17.9 12.7-40.6-61-52.4-48.1 15.7-15.4 58 31.1c9.3-10.5 20.8-22.6 32.8-34.9L203 228.9l-68.8-99.8 18.8-28.9 8.9-4.8L265 207.8l4.9 4.5c19.4-18.8 33.8-32.4 33.8-32.4 7.7-6.5 21.5-2.9 30.7 7.9 9 10.5 10.6 24.7 2.7 31.3-1.8 1.3-15.5 11.4-35.3 25.6l4.5 7.3 94.9 119.4-6.3 7.9z"],aviato:[640,512,[],"f421","M107.2 283.5l-19-41.8H36.1l-19 41.8H0l62.2-131.4 62.2 131.4h-17.2zm-45-98.1l-19.6 42.5h39.2l-19.6-42.5zm112.7 102.4l-62.2-131.4h17.1l45.1 96 45.1-96h17l-62.1 131.4zm80.6-4.3V156.4H271v127.1h-15.5zm209.1-115.6v115.6h-17.3V167.9h-41.2v-11.5h99.6v11.5h-41.1zM640 218.8c0 9.2-1.7 17.8-5.1 25.8-3.4 8-8.2 15.1-14.2 21.1-6 6-13.1 10.8-21.1 14.2-8 3.4-16.6 5.1-25.8 5.1s-17.8-1.7-25.8-5.1c-8-3.4-15.1-8.2-21.1-14.2-6-6-10.8-13-14.2-21.1-3.4-8-5.1-16.6-5.1-25.8s1.7-17.8 5.1-25.8c3.4-8 8.2-15.1 14.2-21.1 6-6 13-8.4 21.1-11.9 8-3.4 16.6-5.1 25.8-5.1s17.8 1.7 25.8 5.1c8 3.4 15.1 5.8 21.1 11.9 6 6 10.7 13.1 14.2 21.1 3.4 8 5.1 16.6 5.1 25.8zm-15.5 0c0-7.3-1.3-14-3.9-20.3-2.6-6.3-6.2-11.7-10.8-16.3-4.6-4.6-10-8.2-16.2-10.9-6.2-2.7-12.8-4-19.8-4s-13.6 1.3-19.8 4c-6.2 2.7-11.6 6.3-16.2 10.9-4.6 4.6-8.2 10-10.8 16.3-2.6 6.3-3.9 13.1-3.9 20.3 0 7.3 1.3 14 3.9 20.3 2.6 6.3 6.2 11.7 10.8 16.3 4.6 4.6 10 8.2 16.2 10.9 6.2 2.7 12.8 4 19.8 4s13.6-1.3 19.8-4c6.2-2.7 11.6-6.3 16.2-10.9 4.6-4.6 8.2-10 10.8-16.3 2.6-6.3 3.9-13.1 3.9-20.3zm-94.8 96.7v-6.3l88.9-10-242.9 13.4c.6-2.2 1.1-4.6 1.4-7.2 .3-2 .5-4.2 .6-6.5l64.8-8.1-64.9 1.9c0-.4-.1-.7-.1-1.1-2.8-17.2-25.5-23.7-25.5-23.7l-1.1-26.3h23.8l19 41.8h17.1L348.6 152l-62.2 131.4h17.1l19-41.8h23.6L345 268s-22.7 6.5-25.5 23.7c-.1 .3-.1 .7-.1 1.1l-64.9-1.9 64.8 8.1c.1 2.3 .3 4.4 .6 6.5 .3 2.6 .8 5 1.4 7.2L78.4 299.2l88.9 10v6.3c-5.9 .9-10.5 6-10.5 12.2 0 6.8 5.6 12.4 12.4 12.4 6.8 0 12.4-5.6 12.4-12.4 0-6.2-4.6-11.3-10.5-12.2v-5.8l80.3 9v5.4c-5.7 1.1-9.9 6.2-9.9 12.1 0 6.8 5.6 10.2 12.4 10.2 6.8 0 12.4-3.4 12.4-10.2 0-6-4.3-11-9.9-12.1v-4.9l28.4 3.2v23.7h-5.9V360h5.9v-6.6h5v6.6h5.9v-13.8h-5.9V323l38.3 4.3c8.1 11.4 19 13.6 19 13.6l-.1 6.7-5.1 .2-.1 12.1h4.1l.1-5h5.2l.1 5h4.1l-.1-12.1-5.1-.2-.1-6.7s10.9-2.1 19-13.6l38.3-4.3v23.2h-5.9V360h5.9v-6.6h5v6.6h5.9v-13.8h-5.9v-23.7l28.4-3.2v4.9c-5.7 1.1-9.9 6.2-9.9 12.1 0 6.8 5.6 10.2 12.4 10.2 6.8 0 12.4-3.4 12.4-10.2 0-6-4.3-11-9.9-12.1v-5.4l80.3-9v5.8c-5.9 .9-10.5 6-10.5 12.2 0 6.8 5.6 12.4 12.4 12.4 6.8 0 12.4-5.6 12.4-12.4-.2-6.3-4.7-11.4-10.7-12.3zm-200.8-87.6l19.6-42.5 19.6 42.5h-17.9l-1.7-40.3-1.7 40.3h-17.9z"],aws:[640,512,[],"f375","M180.4 203c-.72 22.65 10.6 32.68 10.88 39.05a8.164 8.164 0 0 1 -4.1 6.27l-12.8 8.96a10.66 10.66 0 0 1 -5.63 1.92c-.43-.02-8.19 1.83-20.48-25.61a78.61 78.61 0 0 1 -62.61 29.45c-16.28 .89-60.4-9.24-58.13-56.21-1.59-38.28 34.06-62.06 70.93-60.05 7.1 .02 21.6 .37 46.99 6.27v-15.62c2.69-26.46-14.7-46.99-44.81-43.91-2.4 .01-19.4-.5-45.84 10.11-7.36 3.38-8.3 2.82-10.75 2.82-7.41 0-4.36-21.48-2.94-24.2 5.21-6.4 35.86-18.35 65.94-18.18a76.86 76.86 0 0 1 55.69 17.28 70.29 70.29 0 0 1 17.67 52.36l-.01 69.29zM93.99 235.4c32.43-.47 46.16-19.97 49.29-30.47 2.46-10.05 2.05-16.41 2.05-27.4-9.67-2.32-23.59-4.85-39.56-4.87-15.15-1.14-42.82 5.63-41.74 32.26-1.24 16.79 11.12 31.4 29.96 30.48zm170.9 23.05c-7.86 .72-11.52-4.86-12.68-10.37l-49.8-164.6c-.97-2.78-1.61-5.65-1.92-8.58a4.61 4.61 0 0 1 3.86-5.25c.24-.04-2.13 0 22.25 0 8.78-.88 11.64 6.03 12.55 10.37l35.72 140.8 33.16-140.8c.53-3.22 2.94-11.07 12.8-10.24h17.16c2.17-.18 11.11-.5 12.68 10.37l33.42 142.6L420.1 80.1c.48-2.18 2.72-11.37 12.68-10.37h19.72c.85-.13 6.15-.81 5.25 8.58-.43 1.85 3.41-10.66-52.75 169.9-1.15 5.51-4.82 11.09-12.68 10.37h-18.69c-10.94 1.15-12.51-9.66-12.68-10.75L328.7 110.7l-32.78 136.1c-.16 1.09-1.73 11.9-12.68 10.75h-18.3zm273.5 5.63c-5.88 .01-33.92-.3-57.36-12.29a12.8 12.8 0 0 1 -7.81-11.91v-10.75c0-8.45 6.2-6.9 8.83-5.89 10.04 4.06 16.48 7.14 28.81 9.6 36.65 7.53 52.77-2.3 56.72-4.48 13.15-7.81 14.19-25.68 5.25-34.95-10.48-8.79-15.48-9.12-53.13-21-4.64-1.29-43.7-13.61-43.79-52.36-.61-28.24 25.05-56.18 69.52-55.95 12.67-.01 46.43 4.13 55.57 15.62 1.35 2.09 2.02 4.55 1.92 7.04v10.11c0 4.44-1.62 6.66-4.87 6.66-7.71-.86-21.39-11.17-49.16-10.75-6.89-.36-39.89 .91-38.41 24.97-.43 18.96 26.61 26.07 29.7 26.89 36.46 10.97 48.65 12.79 63.12 29.58 17.14 22.25 7.9 48.3 4.35 55.44-19.08 37.49-68.42 34.44-69.26 34.42zm40.2 104.9c-70.03 51.72-171.7 79.25-258.5 79.25A469.1 469.1 0 0 1 2.83 327.5c-6.53-5.89-.77-13.96 7.17-9.47a637.4 637.4 0 0 0 316.9 84.12 630.2 630.2 0 0 0 241.6-49.55c11.78-5 21.77 7.8 10.12 16.38zm29.19-33.29c-8.96-11.52-59.28-5.38-81.81-2.69-6.79 .77-7.94-5.12-1.79-9.47 40.07-28.17 105.9-20.1 113.4-10.63 7.55 9.47-2.05 75.41-39.56 106.9-5.76 4.87-11.27 2.3-8.71-4.1 8.44-21.25 27.39-68.49 18.43-80.02z"],bandcamp:[512,512,[],"f2d5","M256 8C119 8 8 119 8 256S119 504 256 504 504 393 504 256 393 8 256 8zm48.2 326.1h-181L207.9 178h181z"],"battle-net":[512,512,[],"f835","M448.6 225.6c26.87 .18 35.57-7.43 38.92-12.37 12.47-16.32-7.06-47.6-52.85-71.33 17.76-33.58 30.11-63.68 36.34-85.3 3.38-11.83 1.09-19 .45-20.25-1.72 10.52-15.85 48.46-48.2 100.1-25-11.22-56.52-20.1-93.77-23.8-8.94-16.94-34.88-63.86-60.48-88.93C252.2 7.14 238.7 1.07 228.2 .22h-.05c-13.83-1.55-22.67 5.85-27.4 11-17.2 18.53-24.33 48.87-25 84.07-7.24-12.35-17.17-24.63-28.5-25.93h-.18c-20.66-3.48-38.39 29.22-36 81.29-38.36 1.38-71 5.75-93 11.23-9.9 2.45-16.22 7.27-17.76 9.72 1-.38 22.4-9.22 111.6-9.22 5.22 53 29.75 101.8 26 93.19-9.73 15.4-38.24 62.36-47.31 97.7-5.87 22.88-4.37 37.61 .15 47.14 5.57 12.75 16.41 16.72 23.2 18.26 25 5.71 55.38-3.63 86.7-21.14-7.53 12.84-13.9 28.51-9.06 39.34 7.31 19.65 44.49 18.66 88.44-9.45 20.18 32.18 40.07 57.94 55.7 74.12a39.79 39.79 0 0 0 8.75 7.09c5.14 3.21 8.58 3.37 8.58 3.37-8.24-6.75-34-38-62.54-91.78 22.22-16 45.65-38.87 67.47-69.27 122.8 4.6 143.3-24.76 148-31.64 14.67-19.88 3.43-57.44-57.32-93.69zm-77.85 106.2c23.81-37.71 30.34-67.77 29.45-92.33 27.86 17.57 47.18 37.58 49.06 58.83 1.14 12.93-8.1 29.12-78.51 33.5zM216.9 387.7c9.76-6.23 19.53-13.12 29.2-20.49 6.68 13.33 13.6 26.1 20.6 38.19-40.6 21.86-68.84 12.76-49.8-17.7zm215-171.4c-10.29-5.34-21.16-10.34-32.38-15.05a722.5 722.5 0 0 0 22.74-36.9c39.06 24.1 45.9 53.18 9.64 51.95zM279.2 398c-5.51-11.35-11-23.5-16.5-36.44 43.25 1.27 62.42-18.73 63.28-20.41 0 .07-25 15.64-62.53 12.25a718.8 718.8 0 0 0 85.06-84q13.06-15.31 24.93-31.11c-.36-.29-1.54-3-16.51-12-51.7 60.27-102.3 98-132.8 115.9-20.59-11.18-40.84-31.78-55.71-61.49-20-39.92-30-82.39-31.57-116.1 12.3 .91 25.27 2.17 38.85 3.88-22.29 36.8-14.39 63-13.47 64.23 0-.07-.95-29.17 20.14-59.57a695.2 695.2 0 0 0 44.67 152.8c.93-.38 1.84 .88 18.67-8.25-26.33-74.47-33.76-138.2-34-173.4 20-12.42 48.18-19.8 81.63-17.81 44.57 2.67 86.36 15.25 116.3 30.71q-10.69 15.66-23.33 32.47C365.6 152 339.1 145.8 337.5 146c.11 0 25.9 14.07 41.52 47.22a717.6 717.6 0 0 0 -115.3-31.71 646.6 646.6 0 0 0 -39.39-6.05c-.07 .45-1.81 1.85-2.16 20.33C300 190.3 358.8 215.7 389.4 233c.74 23.55-6.95 51.61-25.41 79.57-24.6 37.31-56.39 67.23-84.77 85.43zm27.4-287c-44.56-1.66-73.58 7.43-94.69 20.67 2-52.3 21.31-76.38 38.21-75.28C267 52.15 305 108.6 306.6 111zm-130.6 3.1c.48 12.11 1.59 24.62 3.21 37.28-14.55-.85-28.74-1.25-42.4-1.26-.08 3.24-.12-51 24.67-49.59h.09c5.76 1.09 10.63 6.88 14.43 13.57zm-28.06 162c20.76 39.7 43.3 60.57 65.25 72.31-46.79 24.76-77.53 20-84.92 4.51-.2-.21-11.13-15.3 19.67-76.81zm210.1 74.8"],behance:[576,512,[],"f1b4","M232 237.2c31.8-15.2 48.4-38.2 48.4-74 0-70.6-52.6-87.8-113.3-87.8H0v354.4h171.8c64.4 0 124.9-30.9 124.9-102.9 0-44.5-21.1-77.4-64.7-89.7zM77.9 135.9H151c28.1 0 53.4 7.9 53.4 40.5 0 30.1-19.7 42.2-47.5 42.2h-79v-82.7zm83.3 233.7H77.9V272h84.9c34.3 0 56 14.3 56 50.6 0 35.8-25.9 47-57.6 47zm358.5-240.7H376V94h143.7v34.9zM576 305.2c0-75.9-44.4-139.2-124.9-139.2-78.2 0-131.3 58.8-131.3 135.8 0 79.9 50.3 134.7 131.3 134.7 61.3 0 101-27.6 120.1-86.3H509c-6.7 21.9-34.3 33.5-55.7 33.5-41.3 0-63-24.2-63-65.3h185.1c.3-4.2 .6-8.7 .6-13.2zM390.4 274c2.3-33.7 24.7-54.8 58.5-54.8 35.4 0 53.2 20.8 56.2 54.8H390.4z"],bilibili:[512,512,[],"e3d9","M488.6 104.1C505.3 122.2 513 143.8 511.9 169.8V372.2C511.5 398.6 502.7 420.3 485.4 437.3C468.2 454.3 446.3 463.2 419.9 464H92.02C65.57 463.2 43.81 454.2 26.74 436.8C9.682 419.4 .7667 396.5 0 368.2V169.8C.7667 143.8 9.682 122.2 26.74 104.1C43.81 87.75 65.57 78.77 92.02 78H121.4L96.05 52.19C90.3 46.46 87.42 39.19 87.42 30.4C87.42 21.6 90.3 14.34 96.05 8.603C101.8 2.868 109.1 0 117.9 0C126.7 0 134 2.868 139.8 8.603L213.1 78H301.1L375.6 8.603C381.7 2.868 389.2 0 398 0C406.8 0 414.1 2.868 419.9 8.603C425.6 14.34 428.5 21.6 428.5 30.4C428.5 39.19 425.6 46.46 419.9 52.19L394.6 78L423.9 78C450.3 78.77 471.9 87.75 488.6 104.1H488.6zM449.8 173.8C449.4 164.2 446.1 156.4 439.1 150.3C433.9 144.2 425.1 140.9 416.4 140.5H96.05C86.46 140.9 78.6 144.2 72.47 150.3C66.33 156.4 63.07 164.2 62.69 173.8V368.2C62.69 377.4 65.95 385.2 72.47 391.7C78.99 398.2 86.85 401.5 96.05 401.5H416.4C425.6 401.5 433.4 398.2 439.7 391.7C446 385.2 449.4 377.4 449.8 368.2L449.8 173.8zM185.5 216.5C191.8 222.8 195.2 230.6 195.6 239.7V273C195.2 282.2 191.9 289.9 185.8 296.2C179.6 302.5 171.8 305.7 162.2 305.7C152.6 305.7 144.7 302.5 138.6 296.2C132.5 289.9 129.2 282.2 128.8 273V239.7C129.2 230.6 132.6 222.8 138.9 216.5C145.2 210.2 152.1 206.9 162.2 206.5C171.4 206.9 179.2 210.2 185.5 216.5H185.5zM377 216.5C383.3 222.8 386.7 230.6 387.1 239.7V273C386.7 282.2 383.4 289.9 377.3 296.2C371.2 302.5 363.3 305.7 353.7 305.7C344.1 305.7 336.3 302.5 330.1 296.2C323.1 289.9 320.7 282.2 320.4 273V239.7C320.7 230.6 324.1 222.8 330.4 216.5C336.7 210.2 344.5 206.9 353.7 206.5C362.9 206.9 370.7 210.2 377 216.5H377z"],bimobject:[448,512,[],"f378","M416 32H32C14.4 32 0 46.4 0 64v384c0 17.6 14.4 32 32 32h384c17.6 0 32-14.4 32-32V64c0-17.6-14.4-32-32-32zm-64 257.4c0 49.4-11.4 82.6-103.8 82.6h-16.9c-44.1 0-62.4-14.9-70.4-38.8h-.9V368H96V136h64v74.7h1.1c4.6-30.5 39.7-38.8 69.7-38.8h17.3c92.4 0 103.8 33.1 103.8 82.5v35zm-64-28.9v22.9c0 21.7-3.4 33.8-38.4 33.8h-45.3c-28.9 0-44.1-6.5-44.1-35.7v-19c0-29.3 15.2-35.7 44.1-35.7h45.3c35-.2 38.4 12 38.4 33.7z"],bitbucket:[512,512,[61810],"f171","M22.2 32A16 16 0 0 0 6 47.8a26.35 26.35 0 0 0 .2 2.8l67.9 412.1a21.77 21.77 0 0 0 21.3 18.2h325.7a16 16 0 0 0 16-13.4L505 50.7a16 16 0 0 0 -13.2-18.3 24.58 24.58 0 0 0 -2.8-.2L22.2 32zm285.9 297.8h-104l-28.1-147h157.3l-25.2 147z"],bitcoin:[512,512,[],"f379","M504 256c0 136.1-111 248-248 248S8 392.1 8 256 119 8 256 8s248 111 248 248zm-141.7-35.33c4.937-32.1-20.19-50.74-54.55-62.57l11.15-44.7-27.21-6.781-10.85 43.52c-7.154-1.783-14.5-3.464-21.8-5.13l10.93-43.81-27.2-6.781-11.15 44.69c-5.922-1.349-11.73-2.682-17.38-4.084l.031-.14-37.53-9.37-7.239 29.06s20.19 4.627 19.76 4.913c11.02 2.751 13.01 10.04 12.68 15.82l-12.7 50.92c.76 .194 1.744 .473 2.829 .907-.907-.225-1.876-.473-2.876-.713l-17.8 71.34c-1.349 3.348-4.767 8.37-12.47 6.464 .271 .395-19.78-4.937-19.78-4.937l-13.51 31.15 35.41 8.827c6.588 1.651 13.05 3.379 19.4 5.006l-11.26 45.21 27.18 6.781 11.15-44.73a1038 1038 0 0 0 21.69 5.627l-11.11 44.52 27.21 6.781 11.26-45.13c46.4 8.781 81.3 5.239 95.99-36.73 11.84-33.79-.589-53.28-25-65.99 17.78-4.098 31.17-15.79 34.75-39.95zm-62.18 87.18c-8.41 33.79-65.31 15.52-83.75 10.94l14.94-59.9c18.45 4.603 77.6 13.72 68.81 48.96zm8.417-87.67c-7.673 30.74-55.03 15.12-70.39 11.29l13.55-54.33c15.36 3.828 64.84 10.97 56.85 43.03z"],bity:[496,512,[],"f37a","M78.4 67.2C173.8-22 324.5-24 421.5 71c14.3 14.1-6.4 37.1-22.4 21.5-84.8-82.4-215.8-80.3-298.9-3.2-16.3 15.1-36.5-8.3-21.8-22.1zm98.9 418.6c19.3 5.7 29.3-23.6 7.9-30C73 421.9 9.4 306.1 37.7 194.8c5-19.6-24.9-28.1-30.2-7.1-32.1 127.4 41.1 259.8 169.8 298.1zm148.1-2c121.9-40.2 192.9-166.9 164.4-291-4.5-19.7-34.9-13.8-30 7.9 24.2 107.7-37.1 217.9-143.2 253.4-21.2 7-10.4 36 8.8 29.7zm-62.9-79l.2-71.8c0-8.2-6.6-14.8-14.8-14.8-8.2 0-14.8 6.7-14.8 14.8l-.2 71.8c0 8.2 6.6 14.8 14.8 14.8s14.8-6.6 14.8-14.8zm71-269c2.1 90.9 4.7 131.9-85.5 132.5-92.5-.7-86.9-44.3-85.5-132.5 0-21.8-32.5-19.6-32.5 0v71.6c0 69.3 60.7 90.9 118 90.1 57.3 .8 118-20.8 118-90.1v-71.6c0-19.6-32.5-21.8-32.5 0z"],"black-tie":[448,512,[],"f27e","M0 32v448h448V32H0zm316.5 325.2L224 445.9l-92.5-88.7 64.5-184-64.5-86.6h184.9L252 173.2l64.5 184z"],blackberry:[512,512,[],"f37b","M166 116.9c0 23.4-16.4 49.1-72.5 49.1H23.4l21-88.8h67.8c42.1 0 53.8 23.3 53.8 39.7zm126.2-39.7h-67.8L205.7 166h70.1c53.8 0 70.1-25.7 70.1-49.1 .1-16.4-11.6-39.7-53.7-39.7zM88.8 208.1H21L0 296.9h70.1c56.1 0 72.5-23.4 72.5-49.1 0-16.3-11.7-39.7-53.8-39.7zm180.1 0h-67.8l-18.7 88.8h70.1c53.8 0 70.1-23.4 70.1-49.1 0-16.3-11.7-39.7-53.7-39.7zm189.3-53.8h-67.8l-18.7 88.8h70.1c53.8 0 70.1-23.4 70.1-49.1 .1-16.3-11.6-39.7-53.7-39.7zm-28 137.9h-67.8L343.7 381h70.1c56.1 0 70.1-23.4 70.1-49.1 0-16.3-11.6-39.7-53.7-39.7zM240.8 346H173l-18.7 88.8h70.1c56.1 0 70.1-25.7 70.1-49.1 .1-16.3-11.6-39.7-53.7-39.7z"],blogger:[448,512,[],"f37c","M162.4 196c4.8-4.9 6.2-5.1 36.4-5.1 27.2 0 28.1 .1 32.1 2.1 5.8 2.9 8.3 7 8.3 13.6 0 5.9-2.4 10-7.6 13.4-2.8 1.8-4.5 1.9-31.1 2.1-16.4 .1-29.5-.2-31.5-.8-10.3-2.9-14.1-17.7-6.6-25.3zm61.4 94.5c-53.9 0-55.8 .2-60.2 4.1-3.5 3.1-5.7 9.4-5.1 13.9 .7 4.7 4.8 10.1 9.2 12 2.2 1 14.1 1.7 56.3 1.2l47.9-.6 9.2-1.5c9-5.1 10.5-17.4 3.1-24.4-5.3-4.7-5-4.7-60.4-4.7zm223.4 130.1c-3.5 28.4-23 50.4-51.1 57.5-7.2 1.8-9.7 1.9-172.9 1.8-157.8 0-165.9-.1-172-1.8-8.4-2.2-15.6-5.5-22.3-10-5.6-3.8-13.9-11.8-17-16.4-3.8-5.6-8.2-15.3-10-22C.1 423 0 420.3 0 256.3 0 93.2 0 89.7 1.8 82.6 8.1 57.9 27.7 39 53 33.4c7.3-1.6 332.1-1.9 340-.3 21.2 4.3 37.9 17.1 47.6 36.4 7.7 15.3 7-1.5 7.3 180.6 .2 115.8 0 164.5-.7 170.5zm-85.4-185.2c-1.1-5-4.2-9.6-7.7-11.5-1.1-.6-8-1.3-15.5-1.7-12.4-.6-13.8-.8-17.8-3.1-6.2-3.6-7.9-7.6-8-18.3 0-20.4-8.5-39.4-25.3-56.5-12-12.2-25.3-20.5-40.6-25.1-3.6-1.1-11.8-1.5-39.2-1.8-42.9-.5-52.5 .4-67.1 6.2-27 10.7-46.3 33.4-53.4 62.4-1.3 5.4-1.6 14.2-1.9 64.3-.4 62.8 0 72.1 4 84.5 9.7 30.7 37.1 53.4 64.6 58.4 9.2 1.7 122.2 2.1 133.7 .5 20.1-2.7 35.9-10.8 50.7-25.9 10.7-10.9 17.4-22.8 21.8-38.5 3.2-10.9 2.9-88.4 1.7-93.9z"],"blogger-b":[448,512,[],"f37d","M446.6 222.7c-1.8-8-6.8-15.4-12.5-18.5-1.8-1-13-2.2-25-2.7-20.1-.9-22.3-1.3-28.7-5-10.1-5.9-12.8-12.3-12.9-29.5-.1-33-13.8-63.7-40.9-91.3-19.3-19.7-40.9-33-65.5-40.5-5.9-1.8-19.1-2.4-63.3-2.9-69.4-.8-84.8 .6-108.4 10C45.9 59.5 14.7 96.1 3.3 142.9 1.2 151.7 .7 165.8 .2 246.8c-.6 101.5 .1 116.4 6.4 136.5 15.6 49.6 59.9 86.3 104.4 94.3 14.8 2.7 197.3 3.3 216 .8 32.5-4.4 58-17.5 81.9-41.9 17.3-17.7 28.1-36.8 35.2-62.1 4.9-17.6 4.5-142.8 2.5-151.7zm-322.1-63.6c7.8-7.9 10-8.2 58.8-8.2 43.9 0 45.4 .1 51.8 3.4 9.3 4.7 13.4 11.3 13.4 21.9 0 9.5-3.8 16.2-12.3 21.6-4.6 2.9-7.3 3.1-50.3 3.3-26.5 .2-47.7-.4-50.8-1.2-16.6-4.7-22.8-28.5-10.6-40.8zm191.8 199.8l-14.9 2.4-77.5 .9c-68.1 .8-87.3-.4-90.9-2-7.1-3.1-13.8-11.7-14.9-19.4-1.1-7.3 2.6-17.3 8.2-22.4 7.1-6.4 10.2-6.6 97.3-6.7 89.6-.1 89.1-.1 97.6 7.8 12.1 11.3 9.5 31.2-4.9 39.4z"],bluetooth:[448,512,[],"f293","M292.6 171.1L249.7 214l-.3-86 43.2 43.1m-43.2 219.8l43.1-43.1-42.9-42.9-.2 86zM416 259.4C416 465 344.1 512 230.9 512S32 465 32 259.4 115.4 0 228.6 0 416 53.9 416 259.4zm-158.5 0l79.4-88.6L211.8 36.5v176.9L138 139.6l-27 26.9 92.7 93-92.7 93 26.9 26.9 73.8-73.8 2.3 170 127.4-127.5-83.9-88.7z"],"bluetooth-b":[320,512,[],"f294","M196.5 260l92.63-103.3L143.1 0v206.3l-86.11-86.11-31.41 31.41 108.1 108.4L25.61 368.4l31.41 31.41 86.11-86.11L145.8 512l148.6-148.6-97.91-103.3zm40.86-102.1l-49.98 49.98-.338-100.3 50.31 50.32zM187.4 313l49.98 49.98-50.31 50.32 .338-100.3z"],bootstrap:[576,512,[],"f836","M333.5 201.4c0-22.1-15.6-34.3-43-34.3h-50.4v71.2h42.5C315.4 238.2 333.5 225 333.5 201.4zM517 188.6c-9.5-30.9-10.9-68.8-9.8-98.1c1.1-30.5-22.7-58.5-54.7-58.5H123.7c-32.1 0-55.8 28.1-54.7 58.5c1 29.3-.3 67.2-9.8 98.1c-9.6 31-25.7 50.6-52.2 53.1v28.5c26.4 2.5 42.6 22.1 52.2 53.1c9.5 30.9 10.9 68.8 9.8 98.1c-1.1 30.5 22.7 58.5 54.7 58.5h328.7c32.1 0 55.8-28.1 54.7-58.5c-1-29.3 .3-67.2 9.8-98.1c9.6-31 25.7-50.6 52.1-53.1v-28.5C542.7 239.2 526.5 219.6 517 188.6zM300.2 375.1h-97.9V136.8h97.4c43.3 0 71.7 23.4 71.7 59.4c0 25.3-19.1 47.9-43.5 51.8v1.3c33.2 3.6 55.5 26.6 55.5 58.3C383.4 349.7 352.1 375.1 300.2 375.1zM290.2 266.4h-50.1v78.4h52.3c34.2 0 52.3-13.7 52.3-39.5C344.7 279.6 326.1 266.4 290.2 266.4z"],bots:[640,512,[],"e340","M86.34 197.8a51.77 51.77 0 0 0 -41.57 20.06V156a8.19 8.19 0 0 0 -8.19-8.19H8.19A8.19 8.19 0 0 0 0 156V333.6a8.189 8.189 0 0 0 8.19 8.189H36.58a8.189 8.189 0 0 0 8.19-8.189v-8.088c11.63 13.37 25.87 19.77 41.57 19.77 34.6 0 61.92-26.16 61.92-73.84C148.3 225.5 121.2 197.8 86.34 197.8zM71.52 305.7c-9.593 0-21.22-4.942-26.75-12.5V250.2c5.528-7.558 17.15-12.79 26.75-12.79 17.73 0 31.11 13.08 31.11 34.01C102.6 292.6 89.25 305.7 71.52 305.7zm156.4-59.03a17.4 17.4 0 1 0 17.4 17.4A17.4 17.4 0 0 0 227.9 246.7zM273.1 156.7V112a13.31 13.31 0 1 0 -10.24 0V156.7a107.5 107.5 0 1 0 10.24 0zm85.99 107.4c0 30.53-40.79 55.28-91.11 55.28s-91.11-24.75-91.11-55.28 40.79-55.28 91.11-55.28S359.9 233.5 359.9 264.1zm-50.16 17.4a17.4 17.4 0 1 0 -17.4-17.4h0A17.4 17.4 0 0 0 309.8 281.5zM580.7 250.5c-14.83-2.617-22.39-3.78-22.39-9.885 0-5.523 7.268-9.884 17.74-9.884a65.56 65.56 0 0 1 34.48 10.1 8.171 8.171 0 0 0 11.29-2.468c.07-.11 .138-.221 .2-.333l8.611-14.89a8.2 8.2 0 0 0 -2.867-11.12 99.86 99.86 0 0 0 -52.01-14.14c-38.96 0-60.18 21.51-60.18 46.22 0 36.34 33.72 41.86 57.56 45.64 13.37 2.326 24.13 4.361 24.13 11.05 0 6.4-5.523 10.76-18.9 10.76-13.55 0-30.99-6.222-42.62-13.58a8.206 8.206 0 0 0 -11.34 2.491c-.035 .054-.069 .108-.1 .164l-10.2 16.89a8.222 8.222 0 0 0 2.491 11.07c15.22 10.3 37.66 16.69 59.44 16.69 40.41 0 63.96-19.77 63.96-46.51C640 260.6 604.5 254.8 580.7 250.5zm-95.93 60.79a8.211 8.211 0 0 0 -9.521-5.938 23.17 23.17 0 0 1 -4.155 .387c-7.849 0-12.5-6.106-12.5-14.24V240.3h20.35a8.143 8.143 0 0 0 8.141-8.143V209.5a8.143 8.143 0 0 0 -8.141-8.143H458.6V171.1a8.143 8.143 0 0 0 -8.143-8.143H422.3a8.143 8.143 0 0 0 -8.143 8.143h0v30.23H399a8.143 8.143 0 0 0 -8.143 8.143h0v22.67A8.143 8.143 0 0 0 399 240.3h15.11v63.67c0 27.04 15.41 41.28 43.9 41.28 12.18 0 21.38-2.2 27.6-5.446a8.161 8.161 0 0 0 4.145-9.278z"],btc:[384,512,[],"f15a","M310.2 242.6c27.73-14.18 45.38-39.39 41.28-81.3-5.358-57.35-52.46-76.57-114.8-81.93V0h-48.53v77.2c-12.6 0-25.52 .315-38.44 .63V0h-48.53v79.41c-17.84 .539-38.62 .276-97.37 0v51.68c38.31-.678 58.42-3.14 63.02 21.43v217.4c-2.925 19.49-18.52 16.68-53.26 16.07L3.765 443.7c88.48 0 97.37 .315 97.37 .315V512h48.53v-67.06c13.23 .315 26.15 .315 38.44 .315V512h48.53v-68c81.3-4.412 135.6-24.89 142.9-101.5 5.671-61.45-23.32-88.86-69.33-99.89zM150.6 134.6c27.42 0 113.1-8.507 113.1 48.53 0 54.51-85.71 48.21-113.1 48.21v-96.74zm0 251.8V279.8c32.77 0 133.1-9.138 133.1 53.26-.001 60.19-100.4 53.25-133.1 53.25z"],buffer:[448,512,[],"f837","M427.8 380.7l-196.5 97.82a18.6 18.6 0 0 1 -14.67 0L20.16 380.7c-4-2-4-5.28 0-7.29L67.22 350a18.65 18.65 0 0 1 14.69 0l134.8 67a18.51 18.51 0 0 0 14.67 0l134.8-67a18.62 18.62 0 0 1 14.68 0l47.06 23.43c4.05 1.96 4.05 5.24 0 7.24zm0-136.5l-47.06-23.43a18.62 18.62 0 0 0 -14.68 0l-134.8 67.08a18.68 18.68 0 0 1 -14.67 0L81.91 220.7a18.65 18.65 0 0 0 -14.69 0l-47.06 23.43c-4 2-4 5.29 0 7.31l196.5 97.8a18.6 18.6 0 0 0 14.67 0l196.5-97.8c4.05-2.02 4.05-5.3 0-7.31zM20.16 130.4l196.5 90.29a20.08 20.08 0 0 0 14.67 0l196.5-90.29c4-1.86 4-4.89 0-6.74L231.3 33.4a19.88 19.88 0 0 0 -14.67 0l-196.5 90.28c-4.05 1.85-4.05 4.88 0 6.74z"],buromobelexperte:[448,512,[],"f37f","M0 32v128h128V32H0zm120 120H8V40h112v112zm40-120v128h128V32H160zm120 120H168V40h112v112zm40-120v128h128V32H320zm120 120H328V40h112v112zM0 192v128h128V192H0zm120 120H8V200h112v112zm40-120v128h128V192H160zm120 120H168V200h112v112zm40-120v128h128V192H320zm120 120H328V200h112v112zM0 352v128h128V352H0zm120 120H8V360h112v112zm40-120v128h128V352H160zm120 120H168V360h112v112zm40-120v128h128V352H320z"],"buy-n-large":[576,512,[],"f8a6","M288 32C133.3 32 7.79 132.3 7.79 256S133.3 480 288 480s280.2-100.3 280.2-224S442.7 32 288 32zm-85.39 357.2L64.1 390.5l77.25-290.7h133.4c63.15 0 84.93 28.65 78 72.84a60.24 60.24 0 0 1 -1.5 6.85 77.39 77.39 0 0 0 -17.21-1.93c-42.35 0-76.69 33.88-76.69 75.65 0 37.14 27.14 68 62.93 74.45-18.24 37.16-56.16 60.92-117.7 61.52zM358 207.1h32l-22.16 90.31h-35.41l-11.19-35.63-7.83 35.63h-37.83l26.63-90.31h31.34l15 36.75zm145.9 182.1H306.8L322.6 328a78.8 78.8 0 0 0 11.47 .83c42.34 0 76.69-33.87 76.69-75.65 0-32.65-21-60.46-50.38-71.06l21.33-82.35h92.5l-53.05 205.4h103.9zM211.7 269.4H187l-13.8 56.47h24.7c16.14 0 32.11-3.18 37.94-26.65 5.56-22.31-7.99-29.82-24.14-29.82zM233 170h-21.34L200 217.7h21.37c18 0 35.38-14.64 39.21-30.14C265.2 168.7 251.1 170 233 170z"],buysellads:[448,512,[],"f20d","M224 150.7l42.9 160.7h-85.8L224 150.7zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-65.3 325.3l-94.5-298.7H159.8L65.3 405.3H156l111.7-91.6 24.2 91.6h90.8z"],"canadian-maple-leaf":[512,512,[],"f785","M383.8 351.7c2.5-2.5 105.2-92.4 105.2-92.4l-17.5-7.5c-10-4.9-7.4-11.5-5-17.4 2.4-7.6 20.1-67.3 20.1-67.3s-47.7 10-57.7 12.5c-7.5 2.4-10-2.5-12.5-7.5s-15-32.4-15-32.4-52.6 59.9-55.1 62.3c-10 7.5-20.1 0-17.6-10 0-10 27.6-129.6 27.6-129.6s-30.1 17.4-40.1 22.4c-7.5 5-12.6 5-17.6-5C293.5 72.3 255.9 0 255.9 0s-37.5 72.3-42.5 79.8c-5 10-10 10-17.6 5-10-5-40.1-22.4-40.1-22.4S183.3 182 183.3 192c2.5 10-7.5 17.5-17.6 10-2.5-2.5-55.1-62.3-55.1-62.3S98.1 167 95.6 172s-5 9.9-12.5 7.5C73 177 25.4 167 25.4 167s17.6 59.7 20.1 67.3c2.4 6 5 12.5-5 17.4L23 259.3s102.6 89.9 105.2 92.4c5.1 5 10 7.5 5.1 22.5-5.1 15-10.1 35.1-10.1 35.1s95.2-20.1 105.3-22.6c8.7-.9 18.3 2.5 18.3 12.5S241 512 241 512h30s-5.8-102.7-5.8-112.8 9.5-13.4 18.4-12.5c10 2.5 105.2 22.6 105.2 22.6s-5-20.1-10-35.1 0-17.5 5-22.5z"],"cc-amazon-pay":[576,512,[],"f42d","M124.7 201.8c.1-11.8 0-23.5 0-35.3v-35.3c0-1.3 .4-2 1.4-2.7 11.5-8 24.1-12.1 38.2-11.1 12.5 .9 22.7 7 28.1 21.7 3.3 8.9 4.1 18.2 4.1 27.7 0 8.7-.7 17.3-3.4 25.6-5.7 17.8-18.7 24.7-35.7 23.9-11.7-.5-21.9-5-31.4-11.7-.9-.8-1.4-1.6-1.3-2.8zm154.9 14.6c4.6 1.8 9.3 2 14.1 1.5 11.6-1.2 21.9-5.7 31.3-12.5 .9-.6 1.3-1.3 1.3-2.5-.1-3.9 0-7.9 0-11.8 0-4-.1-8 0-12 0-1.4-.4-2-1.8-2.2-7-.9-13.9-2.2-20.9-2.9-7-.6-14-.3-20.8 1.9-6.7 2.2-11.7 6.2-13.7 13.1-1.6 5.4-1.6 10.8 .1 16.2 1.6 5.5 5.2 9.2 10.4 11.2zM576 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zm-207.5 23.9c.4 1.7 .9 3.4 1.6 5.1 16.5 40.6 32.9 81.3 49.5 121.9 1.4 3.5 1.7 6.4 .2 9.9-2.8 6.2-4.9 12.6-7.8 18.7-2.6 5.5-6.7 9.5-12.7 11.2-4.2 1.1-8.5 1.3-12.9 .9-2.1-.2-4.2-.7-6.3-.8-2.8-.2-4.2 1.1-4.3 4-.1 2.8-.1 5.6 0 8.3 .1 4.6 1.6 6.7 6.2 7.5 4.7 .8 9.4 1.6 14.2 1.7 14.3 .3 25.7-5.4 33.1-17.9 2.9-4.9 5.6-10.1 7.7-15.4 19.8-50.1 39.5-100.3 59.2-150.5 .6-1.5 1.1-3 1.3-4.6 .4-2.4-.7-3.6-3.1-3.7-5.6-.1-11.1 0-16.7 0-3.1 0-5.3 1.4-6.4 4.3-.4 1.1-.9 2.3-1.3 3.4l-29.1 83.7c-2.1 6.1-4.2 12.1-6.5 18.6-.4-.9-.6-1.4-.8-1.9-10.8-29.9-21.6-59.9-32.4-89.8-1.7-4.7-3.5-9.5-5.3-14.2-.9-2.5-2.7-4-5.4-4-6.4-.1-12.8-.2-19.2-.1-2.2 0-3.3 1.6-2.8 3.7zM242.4 206c1.7 11.7 7.6 20.8 18 26.6 9.9 5.5 20.7 6.2 31.7 4.6 12.7-1.9 23.9-7.3 33.8-15.5 .4-.3 .8-.6 1.4-1 .5 3.2 .9 6.2 1.5 9.2 .5 2.6 2.1 4.3 4.5 4.4 4.6 .1 9.1 .1 13.7 0 2.3-.1 3.8-1.6 4-3.9 .1-.8 .1-1.6 .1-2.3v-88.8c0-3.6-.2-7.2-.7-10.8-1.6-10.8-6.2-19.7-15.9-25.4-5.6-3.3-11.8-5-18.2-5.9-3-.4-6-.7-9.1-1.1h-10c-.8 .1-1.6 .3-2.5 .3-8.2 .4-16.3 1.4-24.2 3.5-5.1 1.3-10 3.2-15 4.9-3 1-4.5 3.2-4.4 6.5 .1 2.8-.1 5.6 0 8.3 .1 4.1 1.8 5.2 5.7 4.1 6.5-1.7 13.1-3.5 19.7-4.8 10.3-1.9 20.7-2.7 31.1-1.2 5.4 .8 10.5 2.4 14.1 7 3.1 4 4.2 8.8 4.4 13.7 .3 6.9 .2 13.9 .3 20.8 0 .4-.1 .7-.2 1.2-.4 0-.8 0-1.1-.1-8.8-2.1-17.7-3.6-26.8-4.1-9.5-.5-18.9 .1-27.9 3.2-10.8 3.8-19.5 10.3-24.6 20.8-4.1 8.3-4.6 17-3.4 25.8zM98.7 106.9v175.3c0 .8 0 1.7 .1 2.5 .2 2.5 1.7 4.1 4.1 4.2 5.9 .1 11.8 .1 17.7 0 2.5 0 4-1.7 4.1-4.1 .1-.8 .1-1.7 .1-2.5v-60.7c.9 .7 1.4 1.2 1.9 1.6 15 12.5 32.2 16.6 51.1 12.9 17.1-3.4 28.9-13.9 36.7-29.2 5.8-11.6 8.3-24.1 8.7-37 .5-14.3-1-28.4-6.8-41.7-7.1-16.4-18.9-27.3-36.7-30.9-2.7-.6-5.5-.8-8.2-1.2h-7c-1.2 .2-2.4 .3-3.6 .5-11.7 1.4-22.3 5.8-31.8 12.7-2 1.4-3.9 3-5.9 4.5-.1-.5-.3-.8-.4-1.2-.4-2.3-.7-4.6-1.1-6.9-.6-3.9-2.5-5.5-6.4-5.6h-9.7c-5.9-.1-6.9 1-6.9 6.8zM493.6 339c-2.7-.7-5.1 0-7.6 1-43.9 18.4-89.5 30.2-136.8 35.8-14.5 1.7-29.1 2.8-43.7 3.2-26.6 .7-53.2-.8-79.6-4.3-17.8-2.4-35.5-5.7-53-9.9-37-8.9-72.7-21.7-106.7-38.8-8.8-4.4-17.4-9.3-26.1-14-3.8-2.1-6.2-1.5-8.2 2.1v1.7c1.2 1.6 2.2 3.4 3.7 4.8 36 32.2 76.6 56.5 122 72.9 21.9 7.9 44.4 13.7 67.3 17.5 14 2.3 28 3.8 42.2 4.5 3 .1 6 .2 9 .4 .7 0 1.4 .2 2.1 .3h17.7c.7-.1 1.4-.3 2.1-.3 14.9-.4 29.8-1.8 44.6-4 21.4-3.2 42.4-8.1 62.9-14.7 29.6-9.6 57.7-22.4 83.4-40.1 2.8-1.9 5.7-3.8 8-6.2 4.3-4.4 2.3-10.4-3.3-11.9zm50.4-27.7c-.8-4.2-4-5.8-7.6-7-5.7-1.9-11.6-2.8-17.6-3.3-11-.9-22-.4-32.8 1.6-12 2.2-23.4 6.1-33.5 13.1-1.2 .8-2.4 1.8-3.1 3-.6 .9-.7 2.3-.5 3.4 .3 1.3 1.7 1.6 3 1.5 .6 0 1.2 0 1.8-.1l19.5-2.1c9.6-.9 19.2-1.5 28.8-.8 4.1 .3 8.1 1.2 12 2.2 4.3 1.1 6.2 4.4 6.4 8.7 .3 6.7-1.2 13.1-2.9 19.5-3.5 12.9-8.3 25.4-13.3 37.8-.3 .8-.7 1.7-.8 2.5-.4 2.5 1 4 3.4 3.5 1.4-.3 3-1.1 4-2.1 3.7-3.6 7.5-7.2 10.6-11.2 10.7-13.8 17-29.6 20.7-46.6 .7-3 1.2-6.1 1.7-9.1 .2-4.7 .2-9.6 .2-14.5z"],"cc-amex":[576,512,[],"f1f3","M48 480C21.49 480 0 458.5 0 432V80C0 53.49 21.49 32 48 32H528C554.5 32 576 53.49 576 80V82.43H500.5L483.5 130L466.6 82.43H369.4V145.6L341.3 82.43H262.7L181 267.1H246.8V430.9H450.5L482.4 395.8L514.3 430.9H576V432C576 458.5 554.5 480 528 480H48zM482.6 364L440.4 410.3H390.5L458 338.6L390.5 266.1H441.9L483.4 312.8L525.4 266.1H576L508 338.2L576 410.3H524.6L482.6 364zM576 296.9V380.2L536.7 338.3L576 296.9zM307.6 377.1H390.6V410.3H268.6V267.1H390.6V300.2H307.6V322.6H388.5V354.9H307.6V377.2V377.1zM537.3 145.7L500.4 246.3H466L429.2 146V246.3H390.5V103H451.7L483.6 192.3L515.8 103H576V246.3H537.3V145.7zM334.5 217.6H268.6L256.7 246.3H213.7L276.1 103H327.3L390.6 246.3H346.5L334.5 217.6zM301.5 138.5L282 185.4H320.9L301.5 138.5z"],"cc-apple-pay":[576,512,[],"f416","M302.2 218.4c0 17.2-10.5 27.1-29 27.1h-24.3v-54.2h24.4c18.4 0 28.9 9.8 28.9 27.1zm47.5 62.6c0 8.3 7.2 13.7 18.5 13.7 14.4 0 25.2-9.1 25.2-21.9v-7.7l-23.5 1.5c-13.3 .9-20.2 5.8-20.2 14.4zM576 79v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V79c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zM127.8 197.2c8.4 .7 16.8-4.2 22.1-10.4 5.2-6.4 8.6-15 7.7-23.7-7.4 .3-16.6 4.9-21.9 11.3-4.8 5.5-8.9 14.4-7.9 22.8zm60.6 74.5c-.2-.2-19.6-7.6-19.8-30-.2-18.7 15.3-27.7 16-28.2-8.8-13-22.4-14.4-27.1-14.7-12.2-.7-22.6 6.9-28.4 6.9-5.9 0-14.7-6.6-24.3-6.4-12.5 .2-24.2 7.3-30.5 18.6-13.1 22.6-3.4 56 9.3 74.4 6.2 9.1 13.7 19.1 23.5 18.7 9.3-.4 13-6 24.2-6 11.3 0 14.5 6 24.3 5.9 10.2-.2 16.5-9.1 22.8-18.2 6.9-10.4 9.8-20.4 10-21zm135.4-53.4c0-26.6-18.5-44.8-44.9-44.8h-51.2v136.4h21.2v-46.6h29.3c26.8 0 45.6-18.4 45.6-45zm90 23.7c0-19.7-15.8-32.4-40-32.4-22.5 0-39.1 12.9-39.7 30.5h19.1c1.6-8.4 9.4-13.9 20-13.9 13 0 20.2 6 20.2 17.2v7.5l-26.4 1.6c-24.6 1.5-37.9 11.6-37.9 29.1 0 17.7 13.7 29.4 33.4 29.4 13.3 0 25.6-6.7 31.2-17.4h.4V310h19.6v-68zM516 210.9h-21.5l-24.9 80.6h-.4l-24.9-80.6H422l35.9 99.3-1.9 6c-3.2 10.2-8.5 14.2-17.9 14.2-1.7 0-4.9-.2-6.2-.3v16.4c1.2 .4 6.5 .5 8.1 .5 20.7 0 30.4-7.9 38.9-31.8L516 210.9z"],"cc-diners-club":[576,512,[],"f24c","M239.7 79.9c-96.9 0-175.8 78.6-175.8 175.8 0 96.9 78.9 175.8 175.8 175.8 97.2 0 175.8-78.9 175.8-175.8 0-97.2-78.6-175.8-175.8-175.8zm-39.9 279.6c-41.7-15.9-71.4-56.4-71.4-103.8s29.7-87.9 71.4-104.1v207.9zm79.8 .3V151.6c41.7 16.2 71.4 56.7 71.4 104.1s-29.7 87.9-71.4 104.1zM528 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h480c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM329.7 448h-90.3c-106.2 0-193.8-85.5-193.8-190.2C45.6 143.2 133.2 64 239.4 64h90.3c105 0 200.7 79.2 200.7 193.8 0 104.7-95.7 190.2-200.7 190.2z"],"cc-discover":[576,512,[],"f1f2","M520.4 196.1c0-7.9-5.5-12.1-15.6-12.1h-4.9v24.9h4.7c10.3 0 15.8-4.4 15.8-12.8zM528 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h480c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-44.1 138.9c22.6 0 52.9-4.1 52.9 24.4 0 12.6-6.6 20.7-18.7 23.2l25.8 34.4h-19.6l-22.2-32.8h-2.2v32.8h-16zm-55.9 .1h45.3v14H444v18.2h28.3V217H444v22.2h29.3V253H428zm-68.7 0l21.9 55.2 22.2-55.2h17.5l-35.5 84.2h-8.6l-35-84.2zm-55.9-3c24.7 0 44.6 20 44.6 44.6 0 24.7-20 44.6-44.6 44.6-24.7 0-44.6-20-44.6-44.6 0-24.7 20-44.6 44.6-44.6zm-49.3 6.1v19c-20.1-20.1-46.8-4.7-46.8 19 0 25 27.5 38.5 46.8 19.2v19c-29.7 14.3-63.3-5.7-63.3-38.2 0-31.2 33.1-53 63.3-38zm-97.2 66.3c11.4 0 22.4-15.3-3.3-24.4-15-5.5-20.2-11.4-20.2-22.7 0-23.2 30.6-31.4 49.7-14.3l-8.4 10.8c-10.4-11.6-24.9-6.2-24.9 2.5 0 4.4 2.7 6.9 12.3 10.3 18.2 6.6 23.6 12.5 23.6 25.6 0 29.5-38.8 37.4-56.6 11.3l10.3-9.9c3.7 7.1 9.9 10.8 17.5 10.8zM55.4 253H32v-82h23.4c26.1 0 44.1 17 44.1 41.1 0 18.5-13.2 40.9-44.1 40.9zm67.5 0h-16v-82h16zM544 433c0 8.2-6.8 15-15 15H128c189.6-35.6 382.7-139.2 416-160zM74.1 191.6c-5.2-4.9-11.6-6.6-21.9-6.6H48v54.2h4.2c10.3 0 17-2 21.9-6.4 5.7-5.2 8.9-12.8 8.9-20.7s-3.2-15.5-8.9-20.5z"],"cc-jcb":[576,512,[],"f24b","M431.5 244.3V212c41.2 0 38.5 .2 38.5 .2 7.3 1.3 13.3 7.3 13.3 16 0 8.8-6 14.5-13.3 15.8-1.2 .4-3.3 .3-38.5 .3zm42.8 20.2c-2.8-.7-3.3-.5-42.8-.5v35c39.6 0 40 .2 42.8-.5 7.5-1.5 13.5-8 13.5-17 0-8.7-6-15.5-13.5-17zM576 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zM182 192.3h-57c0 67.1 10.7 109.7-35.8 109.7-19.5 0-38.8-5.7-57.2-14.8v28c30 8.3 68 8.3 68 8.3 97.9 0 82-47.7 82-131.2zm178.5 4.5c-63.4-16-165-14.9-165 59.3 0 77.1 108.2 73.6 165 59.2V287C312.9 311.7 253 309 253 256s59.8-55.6 107.5-31.2v-28zM544 286.5c0-18.5-16.5-30.5-38-32v-.8c19.5-2.7 30.3-15.5 30.3-30.2 0-19-15.7-30-37-31 0 0 6.3-.3-120.3-.3v127.5h122.7c24.3 .1 42.3-12.9 42.3-33.2z"],"cc-mastercard":[576,512,[],"f1f1","M482.9 410.3c0 6.8-4.6 11.7-11.2 11.7-6.8 0-11.2-5.2-11.2-11.7 0-6.5 4.4-11.7 11.2-11.7 6.6 0 11.2 5.2 11.2 11.7zm-310.8-11.7c-7.1 0-11.2 5.2-11.2 11.7 0 6.5 4.1 11.7 11.2 11.7 6.5 0 10.9-4.9 10.9-11.7-.1-6.5-4.4-11.7-10.9-11.7zm117.5-.3c-5.4 0-8.7 3.5-9.5 8.7h19.1c-.9-5.7-4.4-8.7-9.6-8.7zm107.8 .3c-6.8 0-10.9 5.2-10.9 11.7 0 6.5 4.1 11.7 10.9 11.7 6.8 0 11.2-4.9 11.2-11.7 0-6.5-4.4-11.7-11.2-11.7zm105.9 26.1c0 .3 .3 .5 .3 1.1 0 .3-.3 .5-.3 1.1-.3 .3-.3 .5-.5 .8-.3 .3-.5 .5-1.1 .5-.3 .3-.5 .3-1.1 .3-.3 0-.5 0-1.1-.3-.3 0-.5-.3-.8-.5-.3-.3-.5-.5-.5-.8-.3-.5-.3-.8-.3-1.1 0-.5 0-.8 .3-1.1 0-.5 .3-.8 .5-1.1 .3-.3 .5-.3 .8-.5 .5-.3 .8-.3 1.1-.3 .5 0 .8 0 1.1 .3 .5 .3 .8 .3 1.1 .5s.2 .6 .5 1.1zm-2.2 1.4c.5 0 .5-.3 .8-.3 .3-.3 .3-.5 .3-.8 0-.3 0-.5-.3-.8-.3 0-.5-.3-1.1-.3h-1.6v3.5h.8V426h.3l1.1 1.4h.8l-1.1-1.3zM576 81v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V81c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zM64 220.6c0 76.5 62.1 138.5 138.5 138.5 27.2 0 53.9-8.2 76.5-23.1-72.9-59.3-72.4-171.2 0-230.5-22.6-15-49.3-23.1-76.5-23.1-76.4-.1-138.5 62-138.5 138.2zm224 108.8c70.5-55 70.2-162.2 0-217.5-70.2 55.3-70.5 162.6 0 217.5zm-142.3 76.3c0-8.7-5.7-14.4-14.7-14.7-4.6 0-9.5 1.4-12.8 6.5-2.4-4.1-6.5-6.5-12.2-6.5-3.8 0-7.6 1.4-10.6 5.4V392h-8.2v36.7h8.2c0-18.9-2.5-30.2 9-30.2 10.2 0 8.2 10.2 8.2 30.2h7.9c0-18.3-2.5-30.2 9-30.2 10.2 0 8.2 10 8.2 30.2h8.2v-23zm44.9-13.7h-7.9v4.4c-2.7-3.3-6.5-5.4-11.7-5.4-10.3 0-18.2 8.2-18.2 19.3 0 11.2 7.9 19.3 18.2 19.3 5.2 0 9-1.9 11.7-5.4v4.6h7.9V392zm40.5 25.6c0-15-22.9-8.2-22.9-15.2 0-5.7 11.9-4.8 18.5-1.1l3.3-6.5c-9.4-6.1-30.2-6-30.2 8.2 0 14.3 22.9 8.3 22.9 15 0 6.3-13.5 5.8-20.7 .8l-3.5 6.3c11.2 7.6 32.6 6 32.6-7.5zm35.4 9.3l-2.2-6.8c-3.8 2.1-12.2 4.4-12.2-4.1v-16.6h13.1V392h-13.1v-11.2h-8.2V392h-7.6v7.3h7.6V416c0 17.6 17.3 14.4 22.6 10.9zm13.3-13.4h27.5c0-16.2-7.4-22.6-17.4-22.6-10.6 0-18.2 7.9-18.2 19.3 0 20.5 22.6 23.9 33.8 14.2l-3.8-6c-7.8 6.4-19.6 5.8-21.9-4.9zm59.1-21.5c-4.6-2-11.6-1.8-15.2 4.4V392h-8.2v36.7h8.2V408c0-11.6 9.5-10.1 12.8-8.4l2.4-7.6zm10.6 18.3c0-11.4 11.6-15.1 20.7-8.4l3.8-6.5c-11.6-9.1-32.7-4.1-32.7 15 0 19.8 22.4 23.8 32.7 15l-3.8-6.5c-9.2 6.5-20.7 2.6-20.7-8.6zm66.7-18.3H408v4.4c-8.3-11-29.9-4.8-29.9 13.9 0 19.2 22.4 24.7 29.9 13.9v4.6h8.2V392zm33.7 0c-2.4-1.2-11-2.9-15.2 4.4V392h-7.9v36.7h7.9V408c0-11 9-10.3 12.8-8.4l2.4-7.6zm40.3-14.9h-7.9v19.3c-8.2-10.9-29.9-5.1-29.9 13.9 0 19.4 22.5 24.6 29.9 13.9v4.6h7.9v-51.7zm7.6-75.1v4.6h.8V302h1.9v-.8h-4.6v.8h1.9zm6.6 123.8c0-.5 0-1.1-.3-1.6-.3-.3-.5-.8-.8-1.1-.3-.3-.8-.5-1.1-.8-.5 0-1.1-.3-1.6-.3-.3 0-.8 .3-1.4 .3-.5 .3-.8 .5-1.1 .8-.5 .3-.8 .8-.8 1.1-.3 .5-.3 1.1-.3 1.6 0 .3 0 .8 .3 1.4 0 .3 .3 .8 .8 1.1 .3 .3 .5 .5 1.1 .8 .5 .3 1.1 .3 1.4 .3 .5 0 1.1 0 1.6-.3 .3-.3 .8-.5 1.1-.8 .3-.3 .5-.8 .8-1.1 .3-.6 .3-1.1 .3-1.4zm3.2-124.7h-1.4l-1.6 3.5-1.6-3.5h-1.4v5.4h.8v-4.1l1.6 3.5h1.1l1.4-3.5v4.1h1.1v-5.4zm4.4-80.5c0-76.2-62.1-138.3-138.5-138.3-27.2 0-53.9 8.2-76.5 23.1 72.1 59.3 73.2 171.5 0 230.5 22.6 15 49.5 23.1 76.5 23.1 76.4 .1 138.5-61.9 138.5-138.4z"],"cc-paypal":[576,512,[],"f1f4","M186.3 258.2c0 12.2-9.7 21.5-22 21.5-9.2 0-16-5.2-16-15 0-12.2 9.5-22 21.7-22 9.3 0 16.3 5.7 16.3 15.5zM80.5 209.7h-4.7c-1.5 0-3 1-3.2 2.7l-4.3 26.7 8.2-.3c11 0 19.5-1.5 21.5-14.2 2.3-13.4-6.2-14.9-17.5-14.9zm284 0H360c-1.8 0-3 1-3.2 2.7l-4.2 26.7 8-.3c13 0 22-3 22-18-.1-10.6-9.6-11.1-18.1-11.1zM576 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zM128.3 215.4c0-21-16.2-28-34.7-28h-40c-2.5 0-5 2-5.2 4.7L32 294.2c-.3 2 1.2 4 3.2 4h19c2.7 0 5.2-2.9 5.5-5.7l4.5-26.6c1-7.2 13.2-4.7 18-4.7 28.6 0 46.1-17 46.1-45.8zm84.2 8.8h-19c-3.8 0-4 5.5-4.2 8.2-5.8-8.5-14.2-10-23.7-10-24.5 0-43.2 21.5-43.2 45.2 0 19.5 12.2 32.2 31.7 32.2 9 0 20.2-4.9 26.5-11.9-.5 1.5-1 4.7-1 6.2 0 2.3 1 4 3.2 4H200c2.7 0 5-2.9 5.5-5.7l10.2-64.3c.3-1.9-1.2-3.9-3.2-3.9zm40.5 97.9l63.7-92.6c.5-.5 .5-1 .5-1.7 0-1.7-1.5-3.5-3.2-3.5h-19.2c-1.7 0-3.5 1-4.5 2.5l-26.5 39-11-37.5c-.8-2.2-3-4-5.5-4h-18.7c-1.7 0-3.2 1.8-3.2 3.5 0 1.2 19.5 56.8 21.2 62.1-2.7 3.8-20.5 28.6-20.5 31.6 0 1.8 1.5 3.2 3.2 3.2h19.2c1.8-.1 3.5-1.1 4.5-2.6zm159.3-106.7c0-21-16.2-28-34.7-28h-39.7c-2.7 0-5.2 2-5.5 4.7l-16.2 102c-.2 2 1.3 4 3.2 4h20.5c2 0 3.5-1.5 4-3.2l4.5-29c1-7.2 13.2-4.7 18-4.7 28.4 0 45.9-17 45.9-45.8zm84.2 8.8h-19c-3.8 0-4 5.5-4.3 8.2-5.5-8.5-14-10-23.7-10-24.5 0-43.2 21.5-43.2 45.2 0 19.5 12.2 32.2 31.7 32.2 9.3 0 20.5-4.9 26.5-11.9-.3 1.5-1 4.7-1 6.2 0 2.3 1 4 3.2 4H484c2.7 0 5-2.9 5.5-5.7l10.2-64.3c.3-1.9-1.2-3.9-3.2-3.9zm47.5-33.3c0-2-1.5-3.5-3.2-3.5h-18.5c-1.5 0-3 1.2-3.2 2.7l-16.2 104-.3 .5c0 1.8 1.5 3.5 3.5 3.5h16.5c2.5 0 5-2.9 5.2-5.7L544 191.2v-.3zm-90 51.8c-12.2 0-21.7 9.7-21.7 22 0 9.7 7 15 16.2 15 12 0 21.7-9.2 21.7-21.5 .1-9.8-6.9-15.5-16.2-15.5z"],"cc-stripe":[576,512,[],"f1f5","M492.4 220.8c-8.9 0-18.7 6.7-18.7 22.7h36.7c0-16-9.3-22.7-18-22.7zM375 223.4c-8.2 0-13.3 2.9-17 7l.2 52.8c3.5 3.7 8.5 6.7 16.8 6.7 13.1 0 21.9-14.3 21.9-33.4 0-18.6-9-33.2-21.9-33.1zM528 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h480c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM122.2 281.1c0 25.6-20.3 40.1-49.9 40.3-12.2 0-25.6-2.4-38.8-8.1v-33.9c12 6.4 27.1 11.3 38.9 11.3 7.9 0 13.6-2.1 13.6-8.7 0-17-54-10.6-54-49.9 0-25.2 19.2-40.2 48-40.2 11.8 0 23.5 1.8 35.3 6.5v33.4c-10.8-5.8-24.5-9.1-35.3-9.1-7.5 0-12.1 2.2-12.1 7.7 0 16 54.3 8.4 54.3 50.7zm68.8-56.6h-27V275c0 20.9 22.5 14.4 27 12.6v28.9c-4.7 2.6-13.3 4.7-24.9 4.7-21.1 0-36.9-15.5-36.9-36.5l.2-113.9 34.7-7.4v30.8H191zm74 2.4c-4.5-1.5-18.7-3.6-27.1 7.4v84.4h-35.5V194.2h30.7l2.2 10.5c8.3-15.3 24.9-12.2 29.6-10.5h.1zm44.1 91.8h-35.7V194.2h35.7zm0-142.9l-35.7 7.6v-28.9l35.7-7.6zm74.1 145.5c-12.4 0-20-5.3-25.1-9l-.1 40.2-35.5 7.5V194.2h31.3l1.8 8.8c4.9-4.5 13.9-11.1 27.8-11.1 24.9 0 48.4 22.5 48.4 63.8 0 45.1-23.2 65.5-48.6 65.6zm160.4-51.5h-69.5c1.6 16.6 13.8 21.5 27.6 21.5 14.1 0 25.2-3 34.9-7.9V312c-9.7 5.3-22.4 9.2-39.4 9.2-34.6 0-58.8-21.7-58.8-64.5 0-36.2 20.5-64.9 54.3-64.9 33.7 0 51.3 28.7 51.3 65.1 0 3.5-.3 10.9-.4 12.9z"],"cc-visa":[576,512,[],"f1f0","M470.1 231.3s7.6 37.2 9.3 45H446c3.3-8.9 16-43.5 16-43.5-.2 .3 3.3-9.1 5.3-14.9l2.8 13.4zM576 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h480c26.5 0 48 21.5 48 48zM152.5 331.2L215.7 176h-42.5l-39.3 106-4.3-21.5-14-71.4c-2.3-9.9-9.4-12.7-18.2-13.1H32.7l-.7 3.1c15.8 4 29.9 9.8 42.2 17.1l35.8 135h42.5zm94.4 .2L272.1 176h-40.2l-25.1 155.4h40.1zm139.9-50.8c.2-17.7-10.6-31.2-33.7-42.3-14.1-7.1-22.7-11.9-22.7-19.2 .2-6.6 7.3-13.4 23.1-13.4 13.1-.3 22.7 2.8 29.9 5.9l3.6 1.7 5.5-33.6c-7.9-3.1-20.5-6.6-36-6.6-39.7 0-67.6 21.2-67.8 51.4-.3 22.3 20 34.7 35.2 42.2 15.5 7.6 20.8 12.6 20.8 19.3-.2 10.4-12.6 15.2-24.1 15.2-16 0-24.6-2.5-37.7-8.3l-5.3-2.5-5.6 34.9c9.4 4.3 26.8 8.1 44.8 8.3 42.2 .1 69.7-20.8 70-53zM528 331.4L495.6 176h-31.1c-9.6 0-16.9 2.8-21 12.9l-59.7 142.5H426s6.9-19.2 8.4-23.3H486c1.2 5.5 4.8 23.3 4.8 23.3H528z"],centercode:[512,512,[],"f380","M329.2 268.6c-3.8 35.2-35.4 60.6-70.6 56.8-35.2-3.8-60.6-35.4-56.8-70.6 3.8-35.2 35.4-60.6 70.6-56.8 35.1 3.8 60.6 35.4 56.8 70.6zm-85.8 235.1C96.7 496-8.2 365.5 10.1 224.3c11.2-86.6 65.8-156.9 139.1-192 161-77.1 349.7 37.4 354.7 216.6 4.1 147-118.4 262.2-260.5 254.8zm179.9-180c27.9-118-160.5-205.9-237.2-234.2-57.5 56.3-69.1 188.6-33.8 344.4 68.8 15.8 169.1-26.4 271-110.2z"],centos:[448,512,[],"f789","M289.6 97.5l31.6 31.7-76.3 76.5V97.5zm-162.4 31.7l76.3 76.5V97.5h-44.7zm41.5-41.6h44.7v127.9l10.8 10.8 10.8-10.8V87.6h44.7L224.2 32zm26.2 168.1l-10.8-10.8H55.5v-44.8L0 255.7l55.5 55.6v-44.8h128.6l10.8-10.8zm79.3-20.7h107.9v-44.8l-31.6-31.7zm173.3 20.7L392 200.1v44.8H264.3l-10.8 10.8 10.8 10.8H392v44.8l55.5-55.6zM65.4 176.2l32.5-31.7 90.3 90.5h15.3v-15.3l-90.3-90.5 31.6-31.7H65.4zm316.7-78.7h-78.5l31.6 31.7-90.3 90.5V235h15.3l90.3-90.5 31.6 31.7zM203.5 413.9V305.8l-76.3 76.5 31.6 31.7h44.7zM65.4 235h108.8l-76.3-76.5-32.5 31.7zm316.7 100.2l-31.6 31.7-90.3-90.5h-15.3v15.3l90.3 90.5-31.6 31.7h78.5zm0-58.8H274.2l76.3 76.5 31.6-31.7zm-60.9 105.8l-76.3-76.5v108.1h44.7zM97.9 352.9l76.3-76.5H65.4v44.8zm181.8 70.9H235V295.9l-10.8-10.8-10.8 10.8v127.9h-44.7l55.5 55.6zm-166.5-41.6l90.3-90.5v-15.3h-15.3l-90.3 90.5-32.5-31.7v78.7h79.4z"],chrome:[512,512,[],"f268","M0 256C0 209.4 12.47 165.6 34.27 127.1L144.1 318.3C166 357.5 207.9 384 256 384C270.3 384 283.1 381.7 296.8 377.4L220.5 509.6C95.9 492.3 0 385.3 0 256zM365.1 321.6C377.4 302.4 384 279.1 384 256C384 217.8 367.2 183.5 340.7 160H493.4C505.4 189.6 512 222.1 512 256C512 397.4 397.4 511.1 256 512L365.1 321.6zM477.8 128H256C193.1 128 142.3 172.1 130.5 230.7L54.19 98.47C101 38.53 174 0 256 0C350.8 0 433.5 51.48 477.8 128V128zM168 256C168 207.4 207.4 168 256 168C304.6 168 344 207.4 344 256C344 304.6 304.6 344 256 344C207.4 344 168 304.6 168 256z"],chromecast:[512,512,[],"f838","M447.8 64H64c-23.6 0-42.7 19.1-42.7 42.7v63.9H64v-63.9h383.8v298.6H298.6V448H448c23.6 0 42.7-19.1 42.7-42.7V106.7C490.7 83.1 471.4 64 447.8 64zM21.3 383.6L21.3 383.6l0 63.9h63.9C85.2 412.2 56.6 383.6 21.3 383.6L21.3 383.6zM21.3 298.6V341c58.9 0 106.6 48.1 106.6 107h42.7C170.7 365.6 103.7 298.7 21.3 298.6zM213.4 448h42.7c-.5-129.5-105.3-234.3-234.8-234.6l0 42.4C127.3 255.6 213.3 342 213.4 448z"],cloudflare:[640,512,[],"e07d","M407.9 319.9l-230.8-2.928a4.58 4.58 0 0 1 -3.632-1.926 4.648 4.648 0 0 1 -.494-4.147 6.143 6.143 0 0 1 5.361-4.076L411.3 303.9c27.63-1.26 57.55-23.57 68.02-50.78l13.29-34.54a7.944 7.944 0 0 0 .524-2.936 7.735 7.735 0 0 0 -.164-1.631A151.9 151.9 0 0 0 201.3 198.4 68.12 68.12 0 0 0 94.2 269.6C41.92 271.1 0 313.7 0 366.1a96.05 96.05 0 0 0 1.029 13.96 4.508 4.508 0 0 0 4.445 3.871l426.1 .051c.043 0 .08-.019 .122-.02a5.606 5.606 0 0 0 5.271-4l3.273-11.27c3.9-13.4 2.448-25.8-4.1-34.9C430.1 325.4 420.1 320.5 407.9 319.9zM513.9 221.1c-2.141 0-4.271 .062-6.391 .164a3.771 3.771 0 0 0 -3.324 2.653l-9.077 31.19c-3.9 13.4-2.449 25.79 4.1 34.89 6.02 8.4 16.05 13.32 28.24 13.9l49.2 2.939a4.491 4.491 0 0 1 3.51 1.894 4.64 4.64 0 0 1 .514 4.169 6.153 6.153 0 0 1 -5.351 4.075l-51.13 2.939c-27.75 1.27-57.67 23.57-68.14 50.78l-3.695 9.606a2.716 2.716 0 0 0 2.427 3.68c.046 0 .088 .017 .136 .017h175.9a4.69 4.69 0 0 0 4.539-3.37 124.8 124.8 0 0 0 4.682-34C640 277.3 583.5 221.1 513.9 221.1z"],cloudscale:[448,512,[],"f383","M318.1 154l-9.4 7.6c-22.5-19.3-51.5-33.6-83.3-33.6C153.8 128 96 188.8 96 260.3c0 6.6 .4 13.1 1.4 19.4-2-56 41.8-97.4 92.6-97.4 24.2 0 46.2 9.4 62.6 24.7l-25.2 20.4c-8.3-.9-16.8 1.8-23.1 8.1-11.1 11-11.1 28.9 0 40 11.1 11 28.9 11 40 0 6.3-6.3 9-14.9 8.1-23.1l75.2-88.8c6.3-6.5-3.3-15.9-9.5-9.6zm-83.8 111.5c-5.6 5.5-14.6 5.5-20.2 0-5.6-5.6-5.6-14.6 0-20.2s14.6-5.6 20.2 0 5.6 14.7 0 20.2zM224 32C100.5 32 0 132.5 0 256s100.5 224 224 224 224-100.5 224-224S347.5 32 224 32zm0 384c-88.2 0-160-71.8-160-160S135.8 96 224 96s160 71.8 160 160-71.8 160-160 160z"],cloudsmith:[332,512,[],"f384","M332.5 419.9c0 46.4-37.6 84.1-84 84.1s-84-37.7-84-84.1 37.6-84 84-84 84 37.6 84 84zm-84-243.9c46.4 0 80-37.6 80-84s-33.6-84-80-84-88 37.6-88 84-29.6 76-76 76-84 41.6-84 88 37.6 80 84 80 84-33.6 84-80 33.6-80 80-80z"],cloudversify:[616,512,[],"f385","M148.6 304c8.2 68.5 67.4 115.5 146 111.3 51.2 43.3 136.8 45.8 186.4-5.6 69.2 1.1 118.5-44.6 131.5-99.5 14.8-62.5-18.2-132.5-92.1-155.1-33-88.1-131.4-101.5-186.5-85-57.3 17.3-84.3 53.2-99.3 109.7-7.8 2.7-26.5 8.9-45 24.1 11.7 0 15.2 8.9 15.2 19.5v20.4c0 10.7-8.7 19.5-19.5 19.5h-20.2c-10.7 0-19.5-6-19.5-16.7V240H98.8C95 240 88 244.3 88 251.9v40.4c0 6.4 5.3 11.8 11.7 11.8h48.9zm227.4 8c-10.7 46.3 21.7 72.4 55.3 86.8C324.1 432.6 259.7 348 296 288c-33.2 21.6-33.7 71.2-29.2 92.9-17.9-12.4-53.8-32.4-57.4-79.8-3-39.9 21.5-75.7 57-93.9C297 191.4 369.9 198.7 400 248c-14.1-48-53.8-70.1-101.8-74.8 30.9-30.7 64.4-50.3 114.2-43.7 69.8 9.3 133.2 82.8 67.7 150.5 35-16.3 48.7-54.4 47.5-76.9l10.5 19.6c11.8 22 15.2 47.6 9.4 72-9.2 39-40.6 68.8-79.7 76.5-32.1 6.3-83.1-5.1-91.8-59.2zM128 208H88.2c-8.9 0-16.2-7.3-16.2-16.2v-39.6c0-8.9 7.3-16.2 16.2-16.2H128c8.9 0 16.2 7.3 16.2 16.2v39.6c0 8.9-7.3 16.2-16.2 16.2zM10.1 168C4.5 168 0 163.5 0 157.9v-27.8c0-5.6 4.5-10.1 10.1-10.1h27.7c5.5 0 10.1 4.5 10.1 10.1v27.8c0 5.6-4.5 10.1-10.1 10.1H10.1zM168 142.7v-21.4c0-5.1 4.2-9.3 9.3-9.3h21.4c5.1 0 9.3 4.2 9.3 9.3v21.4c0 5.1-4.2 9.3-9.3 9.3h-21.4c-5.1 0-9.3-4.2-9.3-9.3zM56 235.5v25c0 6.3-5.1 11.5-11.4 11.5H19.4C13.1 272 8 266.8 8 260.5v-25c0-6.3 5.1-11.5 11.4-11.5h25.1c6.4 0 11.5 5.2 11.5 11.5z"],cmplid:[640,512,[],"e360","M226.1 388.2a3.816 3.816 0 0 0 -2.294-3.5 3.946 3.946 0 0 0 -1.629-.385L72.6 384.3a19.24 19.24 0 0 1 -17.92-26.02L81.58 255.7a35.72 35.72 0 0 1 32.37-26H262.5a7.07 7.07 0 0 0 6.392-5.194l10.77-41.13a3.849 3.849 0 0 0 -2.237-4.937 3.755 3.755 0 0 0 -1.377-.261c-.063 0-.126 0-.189 .005H127.4a106.8 106.8 0 0 0 -96.99 77.1L3.483 358.8A57.47 57.47 0 0 0 57.31 436q1.43 0 2.86-.072H208.7a7.131 7.131 0 0 0 6.391-5.193L225.8 389.6A3.82 3.82 0 0 0 226.1 388.2zM306.7 81.2a3.861 3.861 0 0 0 .251-1.367A3.813 3.813 0 0 0 303.1 76c-.064 0-.128 0-.192 0h-41A7.034 7.034 0 0 0 255.5 81.2l-21.35 80.92h51.13zM180.4 368.2H231.5L263.5 245.7H212.3zM511.9 79.72a3.809 3.809 0 0 0 -3.8-3.661c-.058 0-.137 0-.23 .007h-41a7.1 7.1 0 0 0 -6.584 5.129L368.9 430.6a3.54 3.54 0 0 0 -.262 1.335 3.873 3.873 0 0 0 3.864 3.863c.056 0 .112 0 .169 0h41a7.068 7.068 0 0 0 6.392-5.193L511.5 81.2A3.624 3.624 0 0 0 511.9 79.72zM324.6 384.5h-41a7.2 7.2 0 0 0 -6.392 5.194L266.5 430.8a3.662 3.662 0 0 0 -.268 1.374A3.783 3.783 0 0 0 270 436c.06 0 .166 0 .3-.012h40.9a7.036 7.036 0 0 0 6.391-5.193l10.77-41.13a3.75 3.75 0 0 0 -3.445-5.208c-.108 0-.217 0-.326 .014zm311.3-308.4h-41a7.066 7.066 0 0 0 -6.392 5.129l-91.46 349.4a4.073 4.073 0 0 0 -.229 1.347 3.872 3.872 0 0 0 3.863 3.851c.056 0 .112 0 .169 0h40.97a7.1 7.1 0 0 0 6.392-5.193L639.7 81.2a3.624 3.624 0 0 0 .32-1.475 3.841 3.841 0 0 0 -3.821-3.564c-.068 0-.137 0-.206 .006zM371.6 225.2l10.8-41.1a4.369 4.369 0 0 0 .227-1.388 3.869 3.869 0 0 0 -3.861-3.842c-.057 0-.113 0-.169 0h-41.1a7.292 7.292 0 0 0 -6.391 5.226l-10.83 41.1a4.417 4.417 0 0 0 -.26 1.493c0 .069 0 .138 0 .206a3.776 3.776 0 0 0 3.757 3.507c.076 0 .18 0 .3-.012h41.13A7.034 7.034 0 0 0 371.6 225.2z"],codepen:[512,512,[],"f1cb","M502.3 159.7l-234-156c-7.987-4.915-16.51-4.96-24.57 0l-234 156C3.714 163.7 0 170.8 0 177.1v155.1c0 7.143 3.714 14.29 9.715 18.29l234 156c7.987 4.915 16.51 4.96 24.57 0l234-156c6-3.999 9.715-11.14 9.715-18.29V177.1c-.001-7.142-3.715-14.29-9.716-18.28zM278 63.13l172.3 114.9-76.86 51.43L278 165.7V63.13zm-44 0v102.6l-95.43 63.72-76.86-51.43L234 63.13zM44 219.1l55.14 36.86L44 292.8v-73.71zm190 229.7L61.71 333.1l76.86-51.43L234 346.3v102.6zm22-140.9l-77.71-52 77.71-52 77.71 52-77.71 52zm22 140.9V346.3l95.43-63.72 76.86 51.43L278 448.8zm190-156l-55.14-36.86L468 219.1v73.71z"],codiepie:[472,512,[],"f284","M422.5 202.9c30.7 0 33.5 53.1-.3 53.1h-10.8v44.3h-26.6v-97.4h37.7zM472 352.6C429.9 444.5 350.4 504 248 504 111 504 0 393 0 256S111 8 248 8c97.4 0 172.8 53.7 218.2 138.4l-186 108.8L472 352.6zm-38.5 12.5l-60.3-30.7c-27.1 44.3-70.4 71.4-122.4 71.4-82.5 0-149.2-66.7-149.2-148.9 0-82.5 66.7-149.2 149.2-149.2 48.4 0 88.9 23.5 116.9 63.4l59.5-34.6c-40.7-62.6-104.7-100-179.2-100-121.2 0-219.5 98.3-219.5 219.5S126.8 475.5 248 475.5c78.6 0 146.5-42.1 185.5-110.4z"],confluence:[512,512,[],"f78d","M2.3 412.2c-4.5 7.6-2.1 17.5 5.5 22.2l105.9 65.2c7.7 4.7 17.7 2.4 22.4-5.3 0-.1 .1-.2 .1-.2 67.1-112.2 80.5-95.9 280.9-.7 8.1 3.9 17.8 .4 21.7-7.7 .1-.1 .1-.3 .2-.4l50.4-114.1c3.6-8.1-.1-17.6-8.1-21.3-22.2-10.4-66.2-31.2-105.9-50.3C127.5 179 44.6 345.3 2.3 412.2zm507.4-312.1c4.5-7.6 2.1-17.5-5.5-22.2L398.4 12.8c-7.5-5-17.6-3.1-22.6 4.4-.2 .3-.4 .6-.6 1-67.3 112.6-81.1 95.6-280.6 .9-8.1-3.9-17.8-.4-21.7 7.7-.1 .1-.1 .3-.2 .4L22.2 141.3c-3.6 8.1 .1 17.6 8.1 21.3 22.2 10.4 66.3 31.2 106 50.4 248 120 330.8-45.4 373.4-112.9z"],connectdevelop:[576,512,[],"f20e","M550.5 241l-50.09-86.79c1.071-2.142 1.875-4.553 1.875-7.232 0-8.036-6.696-14.73-14.73-15l-55.45-95.89c.536-1.607 1.071-3.214 1.071-4.821 0-8.571-6.964-15.27-15.27-15.27-4.821 0-8.839 2.143-11.79 5.625H299.5C296.8 18.14 292.8 16 288 16s-8.839 2.143-11.52 5.625H170.4C167.5 18.14 163.4 16 158.6 16c-8.303 0-15.27 6.696-15.27 15.27 0 1.607 .536 3.482 1.072 4.821l-55.98 97.23c-5.356 2.41-9.107 7.5-9.107 13.66 0 .535 .268 1.071 .268 1.607l-53.3 92.14c-7.232 1.339-12.59 7.5-12.59 15 0 7.232 5.089 13.39 12.05 15l55.18 95.36c-.536 1.607-.804 2.946-.804 4.821 0 7.232 5.089 13.39 12.05 14.73l51.7 89.73c-.536 1.607-1.071 3.482-1.071 5.357 0 8.571 6.964 15.27 15.27 15.27 4.821 0 8.839-2.143 11.52-5.357h106.9C279.2 493.9 283.4 496 288 496s8.839-2.143 11.52-5.357h107.1c2.678 2.946 6.696 4.821 10.98 4.821 8.571 0 15.27-6.964 15.27-15.27 0-1.607-.267-2.946-.803-4.285l51.7-90.27c6.964-1.339 12.05-7.5 12.05-14.73 0-1.607-.268-3.214-.804-4.821l54.91-95.36c6.964-1.339 12.32-7.5 12.32-15-.002-7.232-5.092-13.39-11.79-14.73zM153.5 450.7l-43.66-75.8h43.66v75.8zm0-83.84h-43.66c-.268-1.071-.804-2.142-1.339-3.214l44.1-47.41v50.62zm0-62.41l-50.36 53.3c-1.339-.536-2.679-1.34-4.018-1.607L43.45 259.8c.535-1.339 .535-2.679 .535-4.018s0-2.41-.268-3.482l51.97-90c2.679-.268 5.357-1.072 7.768-2.679l50.09 51.97v92.95zm0-102.3l-45.8-47.41c1.339-2.143 2.143-4.821 2.143-7.767 0-.268-.268-.804-.268-1.072l43.93-15.8v72.05zm0-80.63l-43.66 15.8 43.66-75.54v59.73zm326.5 39.11l.804 1.339L445.5 329.1l-63.75-67.23 98.04-101.5 .268 .268zM291.8 355.1l11.52 11.79H280.5l11.25-11.79zm-.268-11.25l-83.3-85.45 79.55-84.38 83.04 87.59-79.29 82.23zm5.357 5.893l79.29-82.23 67.5 71.25-5.892 28.13H313.7l-16.88-17.14zM410.4 44.39c1.071 .536 2.142 1.072 3.482 1.34l57.86 100.7v.536c0 2.946 .803 5.624 2.143 7.767L376.4 256l-83.04-87.59L410.4 44.39zm-9.107-2.143L287.7 162.5l-57.05-60.27 166.3-60h4.287zm-123.5 0c2.678 2.678 6.16 4.285 10.18 4.285s7.5-1.607 10.18-4.285h75L224.8 95.82 173.9 42.25h103.9zm-116.2 5.625l1.071-2.142a33.83 33.83 0 0 0 2.679-.804l51.16 53.84-54.91 19.82V47.88zm0 79.29l60.8-21.96 59.73 63.21-79.55 84.11-40.98-42.05v-83.3zm0 92.68L198 257.6l-36.43 38.3v-76.07zm0 87.86l42.05-44.46 82.77 85.98-17.14 17.68H161.6v-59.2zm6.964 162.1c-1.607-1.607-3.482-2.678-5.893-3.482l-1.071-1.607v-89.73h99.91l-91.61 94.82h-1.339zm129.9 0c-2.679-2.41-6.428-4.285-10.45-4.285s-7.767 1.875-10.45 4.285h-96.43l91.61-94.82h38.3l91.61 94.82H298.4zm120-11.79l-4.286 7.5c-1.339 .268-2.41 .803-3.482 1.339l-89.2-91.88h114.4l-17.41 83.04zm12.86-22.23l12.86-60.8h21.96l-34.82 60.8zm34.82-68.84h-20.36l4.553-21.16 17.14 18.21c-.535 .803-1.071 1.874-1.339 2.946zm66.16-107.4l-55.45 96.7c-1.339 .535-2.679 1.071-4.018 1.874l-20.63-21.96 34.55-163.9 45.8 79.29c-.267 1.339-.803 2.678-.803 4.285 0 1.339 .268 2.411 .536 3.75z"],contao:[512,512,[],"f26d","M45.4 305c14.4 67.1 26.4 129 68.2 175H34c-18.7 0-34-15.2-34-34V66c0-18.7 15.2-34 34-34h57.7C77.9 44.6 65.6 59.2 54.8 75.6c-45.4 70-27 146.8-9.4 229.4zM478 32h-90.2c21.4 21.4 39.2 49.5 52.7 84.1l-137.1 29.3c-14.9-29-37.8-53.3-82.6-43.9-24.6 5.3-41 19.3-48.3 34.6-8.8 18.7-13.2 39.8 8.2 140.3 21.1 100.2 33.7 117.7 49.5 131.2 12.9 11.1 33.4 17 58.3 11.7 44.5-9.4 55.7-40.7 57.4-73.2l137.4-29.6c3.2 71.5-18.7 125.2-57.4 163.6H478c18.7 0 34-15.2 34-34V66c0-18.8-15.2-34-34-34z"],"cotton-bureau":[512,512,[],"f89e","M474.3 330.4c-23.66 91.85-94.23 144.6-201.9 148.4V429.6c0-48 26.41-74.39 74.39-74.39 62 0 99.2-37.2 99.2-99.21 0-61.37-36.53-98.28-97.38-99.06-33-69.32-146.5-64.65-177.2 0C110.5 157.7 74 194.6 74 256c0 62.13 37.27 99.41 99.4 99.41 48 0 74.55 26.23 74.55 74.39V479c-134.4-5-211.1-85.07-211.1-223 0-141.8 81.35-223.2 223.2-223.2 114.8 0 189.8 53.2 214.7 148.8H500C473.9 71.51 388.2 8 259.8 8 105 8 12 101.2 12 255.8 12 411.1 105.2 504.3 259.8 504c128.3 0 213.9-63.81 239.7-173.6zM357 182.3c41.37 3.45 64.2 29 64.2 73.67 0 48-26.43 74.41-74.4 74.41-28.61 0-49.33-9.59-61.59-27.33 83.06-16.55 75.59-99.67 71.79-120.8zm-81.68 97.36c-2.46-10.34-16.33-87 56.23-97 2.27 10.09 16.52 87.11-56.26 97zM260 132c28.61 0 49 9.67 61.44 27.61-28.36 5.48-49.36 20.59-61.59 43.45-12.23-22.86-33.23-38-61.6-43.45 12.41-17.69 33.27-27.35 61.57-27.35zm-71.52 50.72c73.17 10.57 58.91 86.81 56.49 97-72.41-9.84-59-86.95-56.25-97zM173.2 330.4c-48 0-74.4-26.4-74.4-74.41 0-44.36 22.86-70 64.22-73.67-6.75 37.2-1.38 106.5 71.65 120.8-12.14 17.63-32.84 27.3-61.14 27.3zm53.21 12.39A80.8 80.8 0 0 0 260 309.3c7.77 14.49 19.33 25.54 33.82 33.55a80.28 80.28 0 0 0 -33.58 33.83c-8-14.5-19.07-26.23-33.56-33.83z"],cpanel:[640,512,[],"f388","M210.3 220.2c-5.6-24.8-26.9-41.2-51-41.2h-37c-7.1 0-12.5 4.5-14.3 10.9L73.1 320l24.7-.1c6.8 0 12.3-4.5 14.2-10.7l25.8-95.7h19.8c8.4 0 16.2 5.6 18.3 14.8 2.5 10.9-5.9 22.6-18.3 22.6h-10.3c-7 0-12.5 4.6-14.3 10.8l-6.4 23.8h32c37.2 0 58.3-36.2 51.7-65.3zm-156.5 28h18.6c6.9 0 12.4-4.4 14.3-10.9l6.2-23.6h-40C30 213.7 9 227.8 1.7 254.8-7 288.6 18.5 320 52 320h12.4l7.1-26.1c1.2-4.4-2.2-8.3-6.4-8.3H53.8c-24.7 0-24.9-37.4 0-37.4zm247.5-34.8h-77.9l-3.5 13.4c-2.4 9.6 4.5 18.5 14.2 18.5h57.5c4 0 2.4 4.3 2.1 5.3l-8.6 31.8c-.4 1.4-.9 5.3-5.5 5.3h-34.9c-5.3 0-5.3-7.9 0-7.9h21.6c6.8 0 12.3-4.6 14.2-10.8l3.5-13.2h-48.4c-39.2 0-43.6 63.8-.7 63.8l57.5 .2c11.2 0 20.6-7.2 23.4-17.8l14-51.8c4.8-19.2-9.7-36.8-28.5-36.8zM633.1 179h-18.9c-4.9 0-9.2 3.2-10.4 7.9L568.2 320c20.7 0 39.8-13.8 44.9-34.5l26.5-98.2c1.2-4.3-2-8.3-6.5-8.3zm-236.3 34.7v.1h-48.3l-26.2 98c-1.2 4.4 2.2 8.3 6.4 8.3h18.9c4.8 0 9.2-3 10.4-7.8l17.2-64H395c12.5 0 21.4 11.8 18.1 23.4l-10.6 40c-1.2 4.3 1.9 8.3 6.4 8.3H428c4.6 0 9.1-2.9 10.3-7.8l8.8-33.1c9-33.1-15.9-65.4-50.3-65.4zm98.3 74.6c-3.6 0-6-3.4-5.1-6.7l8-30c.9-3.9 3.7-6 7.8-6h32.9c2.6 0 4.6 2.4 3.9 5.1l-.7 2.6c-.6 2-1.9 3-3.9 3h-21.6c-7 0-12.6 4.6-14.2 10.8l-3.5 13h53.4c10.5 0 20.3-6.6 23.2-17.6l3.2-12c4.9-19.1-9.3-36.8-28.3-36.8h-47.3c-17.9 0-33.8 12-38.6 29.6l-10.8 40c-5 17.7 8.3 36.7 28.3 36.7h66.7c6.8 0 12.3-4.5 14.2-10.7l5.7-21z"],"creative-commons":[496,512,[],"f25e","M245.8 214.9l-33.22 17.28c-9.43-19.58-25.24-19.93-27.46-19.93-22.13 0-33.22 14.61-33.22 43.84 0 23.57 9.21 43.84 33.22 43.84 14.47 0 24.65-7.09 30.57-21.26l30.55 15.5c-6.17 11.51-25.69 38.98-65.1 38.98-22.6 0-73.96-10.32-73.96-77.05 0-58.69 43-77.06 72.63-77.06 30.72-.01 52.7 11.95 65.99 35.86zm143.1 0l-32.78 17.28c-9.5-19.77-25.72-19.93-27.9-19.93-22.14 0-33.22 14.61-33.22 43.84 0 23.55 9.23 43.84 33.22 43.84 14.45 0 24.65-7.09 30.54-21.26l31 15.5c-2.1 3.75-21.39 38.98-65.09 38.98-22.69 0-73.96-9.87-73.96-77.05 0-58.67 42.97-77.06 72.63-77.06 30.71-.01 52.58 11.95 65.56 35.86zM247.6 8.05C104.7 8.05 0 123.1 0 256c0 138.5 113.6 248 247.6 248 129.9 0 248.4-100.9 248.4-248 0-137.9-106.6-248-248.4-248zm.87 450.8c-112.5 0-203.7-93.04-203.7-202.8 0-105.4 85.43-203.3 203.7-203.3 112.5 0 202.8 89.46 202.8 203.3-.01 121.7-99.68 202.8-202.8 202.8z"],"creative-commons-by":[496,512,[],"f4e7","M314.9 194.4v101.4h-28.3v120.5h-77.1V295.9h-28.3V194.4c0-4.4 1.6-8.2 4.6-11.3 3.1-3.1 6.9-4.7 11.3-4.7H299c4.1 0 7.8 1.6 11.1 4.7 3.1 3.2 4.8 6.9 4.8 11.3zm-101.5-63.7c0-23.3 11.5-35 34.5-35s34.5 11.7 34.5 35c0 23-11.5 34.5-34.5 34.5s-34.5-11.5-34.5-34.5zM247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3z"],"creative-commons-nc":[496,512,[],"f4e8","M247.6 8C387.4 8 496 115.9 496 256c0 147.2-118.5 248-248.4 248C113.1 504 0 393.2 0 256 0 123.1 104.7 8 247.6 8zM55.8 189.1c-7.4 20.4-11.1 42.7-11.1 66.9 0 110.9 92.1 202.4 203.7 202.4 122.4 0 177.2-101.8 178.5-104.1l-93.4-41.6c-7.7 37.1-41.2 53-68.2 55.4v38.1h-28.8V368c-27.5-.3-52.6-10.2-75.3-29.7l34.1-34.5c31.7 29.4 86.4 31.8 86.4-2.2 0-6.2-2.2-11.2-6.6-15.1-14.2-6-1.8-.1-219.3-97.4zM248.4 52.3c-38.4 0-112.4 8.7-170.5 93l94.8 42.5c10-31.3 40.4-42.9 63.8-44.3v-38.1h28.8v38.1c22.7 1.2 43.4 8.9 62 23L295 199.7c-42.7-29.9-83.5-8-70 11.1 53.4 24.1 43.8 19.8 93 41.6l127.1 56.7c4.1-17.4 6.2-35.1 6.2-53.1 0-57-19.8-105-59.3-143.9-39.3-39.9-87.2-59.8-143.6-59.8z"],"creative-commons-nc-eu":[496,512,[],"f4e9","M247.7 8C103.6 8 0 124.8 0 256c0 136.3 111.7 248 247.7 248C377.9 504 496 403.1 496 256 496 117 388.4 8 247.7 8zm.6 450.7c-112 0-203.6-92.5-203.6-202.7 0-23.2 3.7-45.2 10.9-66l65.7 29.1h-4.7v29.5h23.3c0 6.2-.4 3.2-.4 19.5h-22.8v29.5h27c11.4 67 67.2 101.3 124.6 101.3 26.6 0 50.6-7.9 64.8-15.8l-10-46.1c-8.7 4.6-28.2 10.8-47.3 10.8-28.2 0-58.1-10.9-67.3-50.2h90.3l128.3 56.8c-1.5 2.1-56.2 104.3-178.8 104.3zm-16.7-190.6l-.5-.4 .9 .4h-.4zm77.2-19.5h3.7v-29.5h-70.3l-28.6-12.6c2.5-5.5 5.4-10.5 8.8-14.3 12.9-15.8 31.1-22.4 51.1-22.4 18.3 0 35.3 5.4 46.1 10l11.6-47.3c-15-6.6-37-12.4-62.3-12.4-39 0-72.2 15.8-95.9 42.3-5.3 6.1-9.8 12.9-13.9 20.1l-81.6-36.1c64.6-96.8 157.7-93.6 170.7-93.6 113 0 203 90.2 203 203.4 0 18.7-2.1 36.3-6.3 52.9l-136.1-60.5z"],"creative-commons-nc-jp":[496,512,[],"f4ea","M247.7 8C103.6 8 0 124.8 0 256c0 136.4 111.8 248 247.7 248C377.9 504 496 403.2 496 256 496 117.2 388.5 8 247.7 8zm.6 450.7c-112 0-203.6-92.5-203.6-202.7 0-21.1 3-41.2 9-60.3l127 56.5h-27.9v38.6h58.1l5.7 11.8v18.7h-63.8V360h63.8v56h61.7v-56h64.2v-35.7l81 36.1c-1.5 2.2-57.1 98.3-175.2 98.3zm87.6-137.3h-57.6v-18.7l2.9-5.6 54.7 24.3zm6.5-51.4v-17.8h-38.6l63-116H301l-43.4 96-23-10.2-39.6-85.7h-65.8l27.3 51-81.9-36.5c27.8-44.1 82.6-98.1 173.7-98.1 112.8 0 203 90 203 203.4 0 21-2.7 40.6-7.9 59l-101-45.1z"],"creative-commons-nd":[496,512,[],"f4eb","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm94 144.3v42.5H162.1V197h180.3zm0 79.8v42.5H162.1v-42.5h180.3z"],"creative-commons-pd":[496,512,[],"f4ec","M248 8C111 8 0 119.1 0 256c0 137 111 248 248 248s248-111 248-248C496 119.1 385 8 248 8zm0 449.5c-139.2 0-235.8-138-190.2-267.9l78.8 35.1c-2.1 10.5-3.3 21.5-3.3 32.9 0 99 73.9 126.9 120.4 126.9 22.9 0 53.5-6.7 79.4-29.5L297 311.1c-5.5 6.3-17.6 16.7-36.3 16.7-37.8 0-53.7-39.9-53.9-71.9 230.4 102.6 216.5 96.5 217.9 96.8-34.3 62.4-100.6 104.8-176.7 104.8zm194.2-150l-224-100c18.8-34 54.9-30.7 74.7-11l40.4-41.6c-27.1-23.3-58-27.5-78.1-27.5-47.4 0-80.9 20.5-100.7 51.6l-74.9-33.4c36.1-54.9 98.1-91.2 168.5-91.2 111.1 0 201.5 90.4 201.5 201.5 0 18-2.4 35.4-6.8 52-.3-.1-.4-.2-.6-.4z"],"creative-commons-pd-alt":[496,512,[],"f4ed","M247.6 8C104.7 8 0 123.1 0 256c0 138.5 113.6 248 247.6 248C377.5 504 496 403.1 496 256 496 118.1 389.4 8 247.6 8zm.8 450.8c-112.5 0-203.7-93-203.7-202.8 0-105.4 85.5-203.3 203.7-203.3 112.6 0 202.9 89.5 202.8 203.3 0 121.7-99.6 202.8-202.8 202.8zM316.7 186h-53.2v137.2h53.2c21.4 0 70-5.1 70-68.6 0-63.4-48.6-68.6-70-68.6zm.8 108.5h-19.9v-79.7l19.4-.1c3.8 0 35-2.1 35 39.9 0 24.6-10.5 39.9-34.5 39.9zM203.7 186h-68.2v137.3h34.6V279h27c54.1 0 57.1-37.5 57.1-46.5 0-31-16.8-46.5-50.5-46.5zm-4.9 67.3h-29.2v-41.6h28.3c30.9 0 28.8 41.6 .9 41.6z"],"creative-commons-remix":[496,512,[],"f4ee","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm161.7 207.7l4.9 2.2v70c-7.2 3.6-63.4 27.5-67.3 28.8-6.5-1.8-113.7-46.8-137.3-56.2l-64.2 26.6-63.3-27.5v-63.8l59.3-24.8c-.7-.7-.4 5-.4-70.4l67.3-29.7L361 178.5v61.6l49.1 20.3zm-70.4 81.5v-43.8h-.4v-1.8l-113.8-46.5V295l113.8 46.9v-.4l.4 .4zm7.5-57.6l39.9-16.4-36.8-15.5-39 16.4 35.9 15.5zm52.3 38.1v-43L355.2 298v43.4l44.3-19z"],"creative-commons-sa":[496,512,[],"f4ef","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zM137.7 221c13-83.9 80.5-95.7 108.9-95.7 99.8 0 127.5 82.5 127.5 134.2 0 63.6-41 132.9-128.9 132.9-38.9 0-99.1-20-109.4-97h62.5c1.5 30.1 19.6 45.2 54.5 45.2 23.3 0 58-18.2 58-82.8 0-82.5-49.1-80.6-56.7-80.6-33.1 0-51.7 14.6-55.8 43.8h18.2l-49.2 49.2-49-49.2h19.4z"],"creative-commons-sampling":[496,512,[],"f4f0","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm3.6 53.2c2.8-.3 11.5 1 11.5 11.5l6.6 107.2 4.9-59.3c0-6 4.7-10.6 10.6-10.6 5.9 0 10.6 4.7 10.6 10.6 0 2.5-.5-5.7 5.7 81.5l5.8-64.2c.3-2.9 2.9-9.3 10.2-9.3 3.8 0 9.9 2.3 10.6 8.9l11.5 96.5 5.3-12.8c1.8-4.4 5.2-6.6 10.2-6.6h58v21.3h-50.9l-18.2 44.3c-3.9 9.9-19.5 9.1-20.8-3.1l-4-31.9-7.5 92.6c-.3 3-3 9.3-10.2 9.3-3 0-9.8-2.1-10.6-9.3 0-1.9 .6 5.8-6.2-77.9l-5.3 72.2c-1.1 4.8-4.8 9.3-10.6 9.3-2.9 0-9.8-2-10.6-9.3 0-1.9 .5 6.7-5.8-87.7l-5.8 94.8c0 6.3-3.6 12.4-10.6 12.4-5.2 0-10.6-4.1-10.6-12l-5.8-87.7c-5.8 92.5-5.3 84-5.3 85.9-1.1 4.8-4.8 9.3-10.6 9.3-3 0-9.8-2.1-10.6-9.3 0-.7-.4-1.1-.4-2.6l-6.2-88.6L182 348c-.7 6.5-6.7 9.3-10.6 9.3-5.8 0-9.6-4.1-10.6-8.9L149.7 272c-2 4-3.5 8.4-11.1 8.4H87.2v-21.3H132l13.7-27.9c4.4-9.9 18.2-7.2 19.9 2.7l3.1 20.4 8.4-97.9c0-6 4.8-10.6 10.6-10.6 .5 0 10.6-.2 10.6 12.4l4.9 69.1 6.6-92.6c0-10.1 9.5-10.6 10.2-10.6 .6 0 10.6 .7 10.6 10.6l5.3 80.6 6.2-97.9c.1-1.1-.6-10.3 9.9-11.5z"],"creative-commons-sampling-plus":[496,512,[],"f4f1","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm107 205.6c-4.7 0-9 2.8-10.7 7.2l-4 9.5-11-92.8c-1.7-13.9-22-13.4-23.1 .4l-4.3 51.4-5.2-68.8c-1.1-14.3-22.1-14.2-23.2 0l-3.5 44.9-5.9-94.3c-.9-14.5-22.3-14.4-23.2 0l-5.1 83.7-4.3-66.3c-.9-14.4-22.2-14.4-23.2 0l-5.3 80.2-4.1-57c-1.1-14.3-22-14.3-23.2-.2l-7.7 89.8-1.8-12.2c-1.7-11.4-17.1-13.6-22-3.3l-13.2 27.7H87.5v23.2h51.3c4.4 0 8.4-2.5 10.4-6.4l10.7 73.1c2 13.5 21.9 13 23.1-.7l3.8-43.6 5.7 78.3c1.1 14.4 22.3 14.2 23.2-.1l4.6-70.4 4.8 73.3c.9 14.4 22.3 14.4 23.2-.1l4.9-80.5 4.5 71.8c.9 14.3 22.1 14.5 23.2 .2l4.6-58.6 4.9 64.4c1.1 14.3 22 14.2 23.1 .1l6.8-83 2.7 22.3c1.4 11.8 17.7 14.1 22.3 3.1l18-43.4h50.5V258l-58.4 .3zm-78 5.2h-21.9v21.9c0 4.1-3.3 7.5-7.5 7.5-4.1 0-7.5-3.3-7.5-7.5v-21.9h-21.9c-4.1 0-7.5-3.3-7.5-7.5 0-4.1 3.4-7.5 7.5-7.5h21.9v-21.9c0-4.1 3.4-7.5 7.5-7.5s7.5 3.3 7.5 7.5v21.9h21.9c4.1 0 7.5 3.3 7.5 7.5 0 4.1-3.4 7.5-7.5 7.5z"],"creative-commons-share":[496,512,[],"f4f2","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm101 132.4c7.8 0 13.7 6.1 13.7 13.7v182.5c0 7.7-6.1 13.7-13.7 13.7H214.3c-7.7 0-13.7-6-13.7-13.7v-54h-54c-7.8 0-13.7-6-13.7-13.7V131.1c0-8.2 6.6-12.7 12.4-13.7h136.4c7.7 0 13.7 6 13.7 13.7v54h54zM159.9 300.3h40.7V198.9c0-7.4 5.8-12.6 12-13.7h55.8v-40.3H159.9v155.4zm176.2-88.1H227.6v155.4h108.5V212.2z"],"creative-commons-zero":[496,512,[],"f4f3","M247.6 8C389.4 8 496 118.1 496 256c0 147.1-118.5 248-248.4 248C113.6 504 0 394.5 0 256 0 123.1 104.7 8 247.6 8zm.8 44.7C130.2 52.7 44.7 150.6 44.7 256c0 109.8 91.2 202.8 203.7 202.8 103.2 0 202.8-81.1 202.8-202.8 .1-113.8-90.2-203.3-202.8-203.3zm-.4 60.5c-81.9 0-102.5 77.3-102.5 142.8 0 65.5 20.6 142.8 102.5 142.8S350.5 321.5 350.5 256c0-65.5-20.6-142.8-102.5-142.8zm0 53.9c3.3 0 6.4 .5 9.2 1.2 5.9 5.1 8.8 12.1 3.1 21.9l-54.5 100.2c-1.7-12.7-1.9-25.1-1.9-34.4 0-28.8 2-88.9 44.1-88.9zm40.8 46.2c2.9 15.4 3.3 31.4 3.3 42.7 0 28.9-2 88.9-44.1 88.9-13.5 0-32.6-7.7-20.1-26.4l60.9-105.2z"],"critical-role":[448,512,[],"f6c9","M225.8 0c.26 .15 216.6 124.5 217.1 124.7 3 1.18 3.7 3.46 3.7 6.56q-.11 125.2 0 250.4a5.88 5.88 0 0 1 -3.38 5.78c-21.37 12-207.9 118.3-218.9 124.6h-3C142 466.3 3.08 386.6 2.93 386.5a3.29 3.29 0 0 1 -1.88-3.24c0-.87 0-225.9-.05-253.1a5 5 0 0 1 2.93-4.93C27.19 112.1 213.2 6 224.1 0zM215.4 20.42l-.22-.16Q118.1 75.55 21 130.9c0 .12 .08 .23 .13 .35l30.86 11.64c-7.71 6-8.32 6-10.65 5.13-.1 0-24.17-9.28-26.8-10v230.4c.88-1.41 64.07-110.9 64.13-111 1.62-2.82 3-1.92 9.12-1.52 1.4 .09 1.48 .22 .78 1.42-41.19 71.33-36.4 63-67.48 116.9-.81 1.4-.61 1.13 1.25 1.13h186.5c1.44 0 1.69-.23 1.7-1.64v-8.88c0-1.34 2.36-.81-18.37-1-7.46-.07-14.14-3.22-21.38-12.7-7.38-9.66-14.62-19.43-21.85-29.21-2.28-3.08-3.45-2.38-16.76-2.38-1.75 0-1.78 0-1.76 1.82 .29 26.21 .15 25.27 1 32.66 .52 4.37 2.16 4.2 9.69 4.81 3.14 .26 3.88 4.08 .52 4.92-1.57 .39-31.6 .51-33.67-.1a2.42 2.42 0 0 1 .3-4.73c3.29-.76 6.16 .81 6.66-4.44 1.3-13.66 1.17-9 1.1-79.42 0-10.82-.35-12.58-5.36-13.55-1.22-.24-3.54-.16-4.69-.55-2.88-1-2-4.84 1.77-4.85 33.67 0 46.08-1.07 56.06 4.86 7.74 4.61 12 11.48 12.51 20.4 .88 14.59-6.51 22.35-15 32.59a1.46 1.46 0 0 0 0 2.22c2.6 3.25 5 6.63 7.71 9.83 27.56 33.23 24.11 30.54 41.28 33.06 .89 .13 1-.42 1-1.15v-11c0-1 .32-1.43 1.41-1.26a72.37 72.37 0 0 0 23.58-.3c1.08-.15 1.5 .2 1.48 1.33 0 .11 .88 26.69 .87 26.8-.05 1.52 .67 1.62 1.89 1.62h186.7Q386.5 304.6 346 234.3c2.26-.66-.4 0 6.69-1.39 2-.39 2.05-.41 3.11 1.44 7.31 12.64 77.31 134 77.37 134.1V138c-1.72 .5-103.3 38.72-105.8 39.68-1.08 .42-1.55 .2-1.91-.88-.63-1.9-1.34-3.76-2.09-5.62-.32-.79-.09-1.13 .65-1.39 .1 0 95.53-35.85 103-38.77-65.42-37.57-130.6-75-196-112.6l86.82 150.4-.28 .33c-9.57-.9-10.46-1.6-11.8-3.94-1-1.69-73.5-127.7-82-142.2-9.1 14.67-83.56 146.2-85.37 146.3-2.93 .17-5.88 .08-9.25 .08q43.25-74.74 86.18-149zm51.93 129.9a37.68 37.68 0 0 0 5.54-.85c1.69-.3 2.53 .2 2.6 1.92 0 .11 .07 19.06-.86 20.45s-1.88 1.22-2.6-.19c-5-9.69 6.22-9.66-39.12-12-.7 0-1 .23-1 .93 0 .13 3.72 122 3.73 122.1 0 .89 .52 1.2 1.21 1.51a83.92 83.92 0 0 1 8.7 4.05c7.31 4.33 11.38 10.84 12.41 19.31 1.44 11.8-2.77 35.77-32.21 37.14-2.75 .13-28.26 1.08-34.14-23.25-4.66-19.26 8.26-32.7 19.89-36.4a2.45 2.45 0 0 0 2-2.66c.1-5.63 3-107.1 3.71-121.3 .05-1.08-.62-1.16-1.35-1.15-32.35 .52-36.75-.34-40.22 8.52-2.42 6.18-4.14 1.32-3.95 .23q1.59-9 3.31-18c.4-2.11 1.43-2.61 3.43-1.86 5.59 2.11 6.72 1.7 37.25 1.92 1.73 0 1.78-.08 1.82-1.85 .68-27.49 .58-22.59 1-29.55a2.69 2.69 0 0 0 -1.63-2.8c-5.6-2.91-8.75-7.55-8.9-13.87-.35-14.81 17.72-21.67 27.38-11.51 6.84 7.19 5.8 18.91-2.45 24.15a4.35 4.35 0 0 0 -2.22 4.34c0 .59-.11-4.31 1 30.05 0 .9 .43 1.12 1.24 1.11 .1 0 23-.09 34.47-.37zM68.27 141.7c19.84-4.51 32.68-.56 52.49 1.69 2.76 .31 3.74 1.22 3.62 4-.21 5-1.16 22.33-1.24 23.15a2.65 2.65 0 0 1 -1.63 2.34c-4.06 1.7-3.61-4.45-4-7.29-3.13-22.43-73.87-32.7-74.63 25.4-.31 23.92 17 53.63 54.08 50.88 27.24-2 19-20.19 24.84-20.47a2.72 2.72 0 0 1 3 3.36c-1.83 10.85-3.42 18.95-3.45 19.15-1.54 9.17-86.7 22.09-93.35-42.06-2.71-25.85 10.44-53.37 40.27-60.15zm80 87.67h-19.49a2.57 2.57 0 0 1 -2.66-1.79c2.38-3.75 5.89 .92 5.86-6.14-.08-25.75 .21-38 .23-40.1 0-3.42-.53-4.65-3.32-4.94-7-.72-3.11-3.37-1.11-3.38 11.84-.1 22.62-.18 30.05 .72 8.77 1.07 16.71 12.63 7.93 22.62-2 2.25-4 4.42-6.14 6.73 .95 1.15 6.9 8.82 17.28 19.68 2.66 2.78 6.15 3.51 9.88 3.13a2.21 2.21 0 0 0 2.23-2.12c.3-3.42 .26 4.73 .45-40.58 0-5.65-.34-6.58-3.23-6.83-3.95-.35-4-2.26-.69-3.37l19.09-.09c.32 0 4.49 .53 1 3.38 0 .05-.16 0-.24 0-3.61 .26-3.94 1-4 4.62-.27 43.93 .07 40.23 .41 42.82 .11 .84 .27 2.23 5.1 2.14 2.49 0 3.86 3.37 0 3.4-10.37 .08-20.74 0-31.11 .07-10.67 0-13.47-6.2-24.21-20.82-1.6-2.18-8.31-2.36-8.2-.37 .88 16.47 0 17.78 4 17.67 4.75-.1 4.73 3.57 .83 3.55zm275-10.15c-1.21 7.13 .17 10.38-5.3 10.34-61.55-.42-47.82-.22-50.72-.31a18.4 18.4 0 0 1 -3.63-.73c-2.53-.6 1.48-1.23-.38-5.6-1.43-3.37-2.78-6.78-4.11-10.19a1.94 1.94 0 0 0 -2-1.44 138 138 0 0 0 -14.58 .07 2.23 2.23 0 0 0 -1.62 1.06c-1.58 3.62-3.07 7.29-4.51 11-1.27 3.23 7.86 1.32 12.19 2.16 3 .57 4.53 3.72 .66 3.73H322.9c-2.92 0-3.09-3.15-.74-3.21a6.3 6.3 0 0 0 5.92-3.47c1.5-3 2.8-6 4.11-9.09 18.18-42.14 17.06-40.17 18.42-41.61a1.83 1.83 0 0 1 3 0c2.93 3.34 18.4 44.71 23.62 51.92 2 2.7 5.74 2 6.36 2 3.61 .13 4-1.11 4.13-4.29 .09-1.87 .08 1.17 .07-41.24 0-4.46-2.36-3.74-5.55-4.27-.26 0-2.56-.63-.08-3.06 .21-.2-.89-.24 21.7-.15 2.32 0 5.32 2.75-1.21 3.45a2.56 2.56 0 0 0 -2.66 2.83c-.07 1.63-.19 38.89 .29 41.21a3.06 3.06 0 0 0 3.23 2.43c13.25 .43 14.92 .44 16-3.41 1.67-5.78 4.13-2.52 3.73-.19zm-104.7 64.37c-4.24 0-4.42-3.39-.61-3.41 35.91-.16 28.11 .38 37.19-.65 1.68-.19 2.38 .24 2.25 1.89-.26 3.39-.64 6.78-1 10.16-.25 2.16-3.2 2.61-3.4-.15-.38-5.31-2.15-4.45-15.63-5.08-1.58-.07-1.64 0-1.64 1.52V304c0 1.65 0 1.6 1.62 1.47 3.12-.25 10.31 .34 15.69-1.52 .47-.16 3.3-1.79 3.07 1.76 0 .21-.76 10.35-1.18 11.39-.53 1.29-1.88 1.51-2.58 .32-1.17-2 0-5.08-3.71-5.3-15.42-.9-12.91-2.55-12.91 6 0 12.25-.76 16.11 3.89 16.24 16.64 .48 14.4 0 16.43-5.71 .84-2.37 3.5-1.77 3.18 .58-.44 3.21-.85 6.43-1.23 9.64 0 .36-.16 2.4-4.66 2.39-37.16-.08-34.54-.19-35.21-.31-2.72-.51-2.2-3 .22-3.45 1.1-.19 4 .54 4.16-2.56 2.44-56.22-.07-51.34-3.91-51.33zm-.41-109.5c2.46 .61 3.13 1.76 2.95 4.65-.33 5.3-.34 9-.55 9.69-.66 2.23-3.15 2.12-3.34-.27-.38-4.81-3.05-7.82-7.57-9.15-26.28-7.73-32.81 15.46-27.17 30.22 5.88 15.41 22 15.92 28.86 13.78 5.92-1.85 5.88-6.5 6.91-7.58 1.23-1.3 2.25-1.84 3.12 1.1 0 .1 .57 11.89-6 12.75-1.6 .21-19.38 3.69-32.68-3.39-21-11.19-16.74-35.47-6.88-45.33 14-14.06 39.91-7.06 42.32-6.47zM289.8 280.1c3.28 0 3.66 3 .16 3.43-2.61 .32-5-.42-5 5.46 0 2-.19 29.05 .4 41.45 .11 2.29 1.15 3.52 3.44 3.65 22 1.21 14.95-1.65 18.79-6.34 1.83-2.24 2.76 .84 2.76 1.08 .35 13.62-4 12.39-5.19 12.4l-38.16-.19c-1.93-.23-2.06-3-.42-3.38 2-.48 4.94 .4 5.13-2.8 1-15.87 .57-44.65 .34-47.81-.27-3.77-2.8-3.27-5.68-3.71-2.47-.38-2-3.22 .34-3.22 1.45-.02 17.97-.03 23.09-.02zm-31.63-57.79c.07 4.08 2.86 3.46 6 3.58 2.61 .1 2.53 3.41-.07 3.43-6.48 0-13.7 0-21.61-.06-3.84 0-3.38-3.35 0-3.37 4.49 0 3.24 1.61 3.41-45.54 0-5.08-3.27-3.54-4.72-4.23-2.58-1.23-1.36-3.09 .41-3.15 1.29 0 20.19-.41 21.17 .21s1.87 1.65-.42 2.86c-1 .52-3.86-.28-4.15 2.47 0 .21-.82 1.63-.07 43.8zm-36.91 274.3a2.93 2.93 0 0 0 3.26 0c17-9.79 182-103.6 197.4-112.5-.14-.43 11.26-.18-181.5-.27-1.22 0-1.57 .37-1.53 1.56 0 .1 1.25 44.51 1.22 50.38a28.33 28.33 0 0 1 -1.36 7.71c-.55 1.83 .38-.5-13.5 32.23-.73 1.72-1 2.21-2-.08-4.19-10.34-8.28-20.72-12.57-31a23.6 23.6 0 0 1 -2-10.79c.16-2.46 .8-16.12 1.51-48 0-1.95 0-2-2-2h-183c2.58 1.63 178.3 102.6 196 112.8zm-90.9-188.8c0 2.4 .36 2.79 2.76 3 11.54 1.17 21 3.74 25.64-7.32 6-14.46 2.66-34.41-12.48-38.84-2-.59-16-2.76-15.94 1.51 .05 8.04 .01 11.61 .02 41.65zm105.8-15.05c0 2.13 1.07 38.68 1.09 39.13 .34 9.94-25.58 5.77-25.23-2.59 .08-2 1.37-37.42 1.1-39.43-14.1 7.44-14.42 40.21 6.44 48.8a17.9 17.9 0 0 0 22.39-7.07c4.91-7.76 6.84-29.47-5.43-39a2.53 2.53 0 0 1 -.36 .12zm-12.28-198c-9.83 0-9.73 14.75-.07 14.87s10.1-14.88 .07-14.91zm-80.15 103.8c0 1.8 .41 2.4 2.17 2.58 13.62 1.39 12.51-11 12.16-13.36-1.69-11.22-14.38-10.2-14.35-7.81 .05 4.5-.03 13.68 .02 18.59zm212.3 6.4l-6.1-15.84c-2.16 5.48-4.16 10.57-6.23 15.84z"],css3:[512,512,[],"f13c","M480 32l-64 368-223.3 80L0 400l19.6-94.8h82l-8 40.6L210 390.2l134.1-44.4 18.8-97.1H29.5l16-82h333.7l10.5-52.7H56.3l16.3-82H480z"],"css3-alt":[384,512,[],"f38b","M0 32l34.9 395.8L192 480l157.1-52.2L384 32H0zm313.1 80l-4.8 47.3L193 208.6l-.3 .1h111.5l-12.8 146.6-98.2 28.7-98.8-29.2-6.4-73.9h48.9l3.2 38.3 52.6 13.3 54.7-15.4 3.7-61.6-166.3-.5v-.1l-.2 .1-3.6-46.3L193.1 162l6.5-2.7H76.7L70.9 112h242.2z"],cuttlefish:[440,512,[],"f38c","M344 305.5c-17.5 31.6-57.4 54.5-96 54.5-56.6 0-104-47.4-104-104s47.4-104 104-104c38.6 0 78.5 22.9 96 54.5 13.7-50.9 41.7-93.3 87-117.8C385.7 39.1 320.5 8 248 8 111 8 0 119 0 256s111 248 248 248c72.5 0 137.7-31.1 183-80.7-45.3-24.5-73.3-66.9-87-117.8z"],"d-and-d":[576,512,[],"f38d","M82.5 98.9c-.6-17.2 2-33.8 12.7-48.2 .3 7.4 1.2 14.5 4.2 21.6 5.9-27.5 19.7-49.3 42.3-65.5-1.9 5.9-3.5 11.8-3 17.7 8.7-7.4 18.8-17.8 44.4-22.7 14.7-2.8 29.7-2 42.1 1 38.5 9.3 61 34.3 69.7 72.3 5.3 23.1 .7 45-8.3 66.4-5.2 12.4-12 24.4-20.7 35.1-2-1.9-3.9-3.8-5.8-5.6-42.8-40.8-26.8-25.2-37.4-37.4-1.1-1.2-1-2.2-.1-3.6 8.3-13.5 11.8-28.2 10-44-1.1-9.8-4.3-18.9-11.3-26.2-14.5-15.3-39.2-15-53.5 .6-11.4 12.5-14.1 27.4-10.9 43.6 .2 1.3 .4 2.7 0 3.9-3.4 13.7-4.6 27.6-2.5 41.6 .1 .5 .1 1.1 .1 1.6 0 .3-.1 .5-.2 1.1-21.8-11-36-28.3-43.2-52.2-8.3 17.8-11.1 35.5-6.6 54.1-15.6-15.2-21.3-34.3-22-55.2zm469.6 123.2c-11.6-11.6-25-20.4-40.1-26.6-12.8-5.2-26-7.9-39.9-7.1-10 .6-19.6 3.1-29 6.4-2.5 .9-5.1 1.6-7.7 2.2-4.9 1.2-7.3-3.1-4.7-6.8 3.2-4.6 3.4-4.2 15-12 .6-.4 1.2-.8 2.2-1.5h-2.5c-.6 0-1.2 .2-1.9 .3-19.3 3.3-30.7 15.5-48.9 29.6-10.4 8.1-13.8 3.8-12-.5 1.4-3.5 3.3-6.7 5.1-10 1-1.8 2.3-3.4 3.5-5.1-.2-.2-.5-.3-.7-.5-27 18.3-46.7 42.4-57.7 73.3 .3 .3 .7 .6 1 .9 .3-.6 .5-1.2 .9-1.7 10.4-12.1 22.8-21.8 36.6-29.8 18.2-10.6 37.5-18.3 58.7-20.2 4.3-.4 8.7-.1 13.1-.1-1.8 .7-3.5 .9-5.3 1.1-18.5 2.4-35.5 9-51.5 18.5-30.2 17.9-54.5 42.2-75.1 70.4-.3 .4-.4 .9-.7 1.3 14.5 5.3 24 17.3 36.1 25.6 .2-.1 .3-.2 .4-.4l1.2-2.7c12.2-26.9 27-52.3 46.7-74.5 16.7-18.8 38-25.3 62.5-20 5.9 1.3 11.4 4.4 17.2 6.8 2.3-1.4 5.1-3.2 8-4.7 8.4-4.3 17.4-7 26.7-9 14.7-3.1 29.5-4.9 44.5-1.3v-.5c-.5-.4-1.2-.8-1.7-1.4zM316.7 397.6c-39.4-33-22.8-19.5-42.7-35.6-.8 .9 0-.2-1.9 3-11.2 19.1-25.5 35.3-44 47.6-10.3 6.8-21.5 11.8-34.1 11.8-21.6 0-38.2-9.5-49.4-27.8-12-19.5-13.3-40.7-8.2-62.6 7.8-33.8 30.1-55.2 38.6-64.3-18.7-6.2-33 1.7-46.4 13.9 .8-13.9 4.3-26.2 11.8-37.3-24.3 10.6-45.9 25-64.8 43.9-.3-5.8 5.4-43.7 5.6-44.7 .3-2.7-.6-5.3-3-7.4-24.2 24.7-44.5 51.8-56.1 84.6 7.4-5.9 14.9-11.4 23.6-16.2-8.3 22.3-19.6 52.8-7.8 101.1 4.6 19 11.9 36.8 24.1 52.3 2.9 3.7 6.3 6.9 9.5 10.3 .2-.2 .4-.3 .6-.5-1.4-7-2.2-14.1-1.5-21.9 2.2 3.2 3.9 6 5.9 8.6 12.6 16 28.7 27.4 47.2 35.6 25 11.3 51.1 13.3 77.9 8.6 54.9-9.7 90.7-48.6 116-98.8 1-1.8 .6-2.9-.9-4.2zm172-46.4c-9.5-3.1-22.2-4.2-28.7-2.9 9.9 4 14.1 6.6 18.8 12 12.6 14.4 10.4 34.7-5.4 45.6-11.7 8.1-24.9 10.5-38.9 9.1-1.2-.1-2.3-.4-3-.6 2.8-3.7 6-7 8.1-10.8 9.4-16.8 5.4-42.1-8.7-56.1-2.1-2.1-4.6-3.9-7-5.9-.3 1.3-.1 2.1 .1 2.8 4.2 16.6-8.1 32.4-24.8 31.8-7.6-.3-13.9-3.8-19.6-8.5-19.5-16.1-39.1-32.1-58.5-48.3-5.9-4.9-12.5-8.1-20.1-8.7-4.6-.4-9.3-.6-13.9-.9-5.9-.4-8.8-2.8-10.4-8.4-.9-3.4-1.5-6.8-2.2-10.2-1.5-8.1-6.2-13-14.3-14.2-4.4-.7-8.9-1-13.3-1.5-13-1.4-19.8-7.4-22.6-20.3-5 11-1.6 22.4 7.3 29.9 4.5 3.8 9.3 7.3 13.8 11.2 4.6 3.8 7.4 8.7 7.9 14.8 .4 4.7 .8 9.5 1.8 14.1 2.2 10.6 8.9 18.4 17 25.1 16.5 13.7 33 27.3 49.5 41.1 17.9 15 13.9 32.8 13 56-.9 22.9 12.2 42.9 33.5 51.2 1 .4 2 .6 3.6 1.1-15.7-18.2-10.1-44.1 .7-52.3 .3 2.2 .4 4.3 .9 6.4 9.4 44.1 45.4 64.2 85 56.9 16-2.9 30.6-8.9 42.9-19.8 2-1.8 3.7-4.1 5.9-6.5-19.3 4.6-35.8 .1-50.9-10.6 .7-.3 1.3-.3 1.9-.3 21.3 1.8 40.6-3.4 57-17.4 19.5-16.6 26.6-42.9 17.4-66-8.3-20.1-23.6-32.3-43.8-38.9zM99.4 179.3c-5.3-9.2-13.2-15.6-22.1-21.3 13.7-.5 26.6 .2 39.6 3.7-7-12.2-8.5-24.7-5-38.7 5.3 11.9 13.7 20.1 23.6 26.8 19.7 13.2 35.7 19.6 46.7 30.2 3.4 3.3 6.3 7.1 9.6 10.9-.8-2.1-1.4-4.1-2.2-6-5-10.6-13-18.6-22.6-25-1.8-1.2-2.8-2.5-3.4-4.5-3.3-12.5-3-25.1-.7-37.6 1-5.5 2.8-10.9 4.5-16.3 .8-2.4 2.3-4.6 4-6.6 .6 6.9 0 25.5 19.6 46 10.8 11.3 22.4 21.9 33.9 32.7 9 8.5 18.3 16.7 25.5 26.8 1.1 1.6 2.2 3.3 3.8 4.7-5-13-14.2-24.1-24.2-33.8-9.6-9.3-19.4-18.4-29.2-27.4-3.3-3-4.6-6.7-5.1-10.9-1.2-10.4 0-20.6 4.3-30.2 .5-1 1.1-2 1.9-3.3 .5 4.2 .6 7.9 1.4 11.6 4.8 23.1 20.4 36.3 49.3 63.5 10 9.4 19.3 19.2 25.6 31.6 4.8 9.3 7.3 19 5.7 29.6-.1 .6 .5 1.7 1.1 2 6.2 2.6 10 6.9 9.7 14.3 7.7-2.6 12.5-8 16.4-14.5 4.2 20.2-9.1 50.3-27.2 58.7 .4-4.5 5-23.4-16.5-27.7-6.8-1.3-12.8-1.3-22.9-2.1 4.7-9 10.4-20.6 .5-22.4-24.9-4.6-52.8 1.9-57.8 4.6 8.2 .4 16.3 1 23.5 3.3-2 6.5-4 12.7-5.8 18.9-1.9 6.5 2.1 14.6 9.3 9.6 1.2-.9 2.3-1.9 3.3-2.7-3.1 17.9-2.9 15.9-2.8 18.3 .3 10.2 9.5 7.8 15.7 7.3-2.5 11.8-29.5 27.3-45.4 25.8 7-4.7 12.7-10.3 15.9-17.9-6.5 .8-12.9 1.6-19.2 2.4l-.3-.9c4.7-3.4 8-7.8 10.2-13.1 8.7-21.1-3.6-38-25-39.9-9.1-.8-17.8 .8-25.9 5.5 6.2-15.6 17.2-26.6 32.6-34.5-15.2-4.3-8.9-2.7-24.6-6.3 14.6-9.3 30.2-13.2 46.5-14.6-5.2-3.2-48.1-3.6-70.2 20.9 7.9 1.4 15.5 2.8 23.2 4.2-23.8 7-44 19.7-62.4 35.6 1.1-4.8 2.7-9.5 3.3-14.3 .6-4.5 .8-9.2 .1-13.6-1.5-9.4-8.9-15.1-19.7-16.3-7.9-.9-15.6 .1-23.3 1.3-.9 .1-1.7 .3-2.9 0 15.8-14.8 36-21.7 53.1-33.5 6-4.5 6.8-8.2 3-14.9zm128.4 26.8c3.3 16 12.6 25.5 23.8 24.3-4.6-11.3-12.1-19.5-23.8-24.3z"],"d-and-d-beyond":[640,512,[],"f6ca","M313.8 241.5c13.8 0 21-10.1 24.8-17.9-1-1.1-5-4.2-7.4-6.6-2.4 4.3-8.2 10.7-13.9 10.7-10.2 0-15.4-14.7-3.2-26.6-.5-.2-4.3-1.8-8 2.4 0-3 1-5.1 2.1-6.6-3.5 1.3-9.8 5.6-11.4 7.9 .2-5.8 1.6-7.5 .6-9l-.2-.2s-8.5 5.6-9.3 14.7c0 0 1.1-1.6 2.1-1.9 .6-.3 1.3 0 .6 1.9-.2 .6-5.8 15.7 5.1 26-.6-1.6-1.9-7.6 2.4-1.9-.3 .1 5.8 7.1 15.7 7.1zm52.4-21.1c0-4-4.9-4.4-5.6-4.5 2 3.9 .9 7.5 .2 9 2.5-.4 5.4-1.6 5.4-4.5zm10.3 5.2c0-6.4-6.2-11.4-13.5-10.7 8 1.3 5.6 13.8-5 11.4 3.7-2.6 3.2-9.9-1.3-12.5 1.4 4.2-3 8.2-7.4 4.6-2.4-1.9-8-6.6-10.6-8.6-2.4-2.1-5.5-1-6.6-1.8-1.3-1.1-.5-3.8-2.2-5-1.6-.8-3-.3-4.8-1-1.6-.6-2.7-1.9-2.6-3.5-2.5 4.4 3.4 6.3 4.5 8.5 1 1.9-.8 4.8 4 8.5 14.8 11.6 9.1 8 10.4 18.1 .6 4.3 4.2 6.7 6.4 7.4-2.1-1.9-2.9-6.4 0-9.3 0 13.9 19.2 13.3 23.1 6.4-2.4 1.1-7-.2-9-1.9 7.7 1 14.2-4.1 14.6-10.6zm-39.4-18.4c2 .8 1.6 .7 6.4 4.5 10.2-24.5 21.7-15.7 22-15.5 2.2-1.9 9.8-3.8 13.8-2.7-2.4-2.7-7.5-6.2-13.3-6.2-4.7 0-7.4 2.2-8 1.3-.8-1.4 3.2-3.4 3.2-3.4-5.4 .2-9.6 6.7-11.2 5.9-1.1-.5 1.4-3.7 1.4-3.7-5.1 2.9-9.3 9.1-10.2 13 4.6-5.8 13.8-9.8 19.7-9-10.5 .5-19.5 9.7-23.8 15.8zm242.5 51.9c-20.7 0-40 1.3-50.3 2.1l7.4 8.2v77.2l-7.4 8.2c10.4 .8 30.9 2.1 51.6 2.1 42.1 0 59.1-20.7 59.1-48.9 0-29.3-23.2-48.9-60.4-48.9zm-15.1 75.6v-53.3c30.1-3.3 46.8 3.8 46.8 26.3 0 25.6-21.4 30.2-46.8 27zM301.6 181c-1-3.4-.2-6.9 1.1-9.4 1 3 2.6 6.4 7.5 9-.5-2.4-.2-5.6 .5-8-1.4-5.4 2.1-9.9 6.4-9.9 6.9 0 8.5 8.8 4.7 14.4 2.1 3.2 5.5 5.6 7.7 7.8 3.2-3.7 5.5-9.5 5.5-13.8 0-8.2-5.5-15.9-16.7-16.5-20-.9-20.2 16.6-20 18.9 .5 5.2 3.4 7.8 3.3 7.5zm-.4 6c-.5 1.8-7 3.7-10.2 6.9 4.8-1 7-.2 7.8 1.8 .5 1.4-.2 3.4-.5 5.6 1.6-1.8 7-5.5 11-6.2-1-.3-3.4-.8-4.3-.8 2.9-3.4 9.3-4.5 12.8-3.7-2.2-.2-6.7 1.1-8.5 2.6 1.6 .3 3 .6 4.3 1.1-2.1 .8-4.8 3.4-5.8 6.1 7-5 13.1 5.2 7 8.2 .8 .2 2.7 0 3.5-.5-.3 1.1-1.9 3-3 3.4 2.9 0 7-1.9 8.2-4.6 0 0-1.8 .6-2.6-.2s.3-4.3 .3-4.3c-2.3 2.9-3.4-1.3-1.3-4.2-1-.3-3.5-.6-4.6-.5 3.2-1.1 10.4-1.8 11.2-.3 .6 1.1-1 3.4-1 3.4 4-.5 8.3 1.1 6.7 5.1 2.9-1.4 5.5-5.9 4.8-10.4-.3 1-1.6 2.4-2.9 2.7 .2-1.4-1-2.2-1.9-2.6 1.7-9.6-14.6-14.2-14.1-23.9-1 1.3-1.8 5-.8 7.1 2.7 3.2 8.7 6.7 10.1 12.2-2.6-6.4-15.1-11.4-14.6-20.2-1.6 1.6-2.6 7.8-1.3 11 2.4 1.4 4.5 3.8 4.8 6.1-2.2-5.1-11.4-6.1-13.9-12.2-.6 2.2-.3 5 1 6.7 0 0-2.2-.8-7-.6 1.7 .6 5.1 3.5 4.8 5.2zm25.9 7.4c-2.7 0-3.5-2.1-4.2-4.3 3.3 1.3 4.2 4.3 4.2 4.3zm38.9 3.7l-1-.6c-1.1-1-2.9-1.4-4.7-1.4-2.9 0-5.8 1.3-7.5 3.4-.8 .8-1.4 1.8-2.1 2.6v15.7c3.5 2.6 7.1-2.9 3-7.2 1.5 .3 4.6 2.7 5.1 3.2 0 0 2.6-.5 5-.5 2.1 0 3.9 .3 5.6 1.1V196c-1.1 .5-2.2 1-2.7 1.4zM79.9 305.9c17.2-4.6 16.2-18 16.2-19.9 0-20.6-24.1-25-37-25H3l8.3 8.6v29.5H0l11.4 14.6V346L3 354.6c61.7 0 73.8 1.5 86.4-5.9 6.7-4 9.9-9.8 9.9-17.6 0-5.1 2.6-18.8-19.4-25.2zm-41.3-27.5c20 0 29.6-.8 29.6 9.1v3c0 12.1-19 8.8-29.6 8.8zm0 59.2V315c12.2 0 32.7-2.3 32.7 8.8v4.5h.2c0 11.2-12.5 9.3-32.9 9.3zm101.2-19.3l23.1 .2v-.2l14.1-21.2h-37.2v-14.9h52.4l-14.1-21v-.2l-73.5 .2 7.4 8.2v77.1l-7.4 8.2h81.2l14.1-21.2-60.1 .2zm214.7-60.1c-73.9 0-77.5 99.3-.3 99.3 77.9 0 74.1-99.3 .3-99.3zm-.3 77.5c-37.4 0-36.9-55.3 .2-55.3 36.8 .1 38.8 55.3-.2 55.3zm-91.3-8.3l44.1-66.2h-41.7l6.1 7.2-20.5 37.2h-.3l-21-37.2 6.4-7.2h-44.9l44.1 65.8 .2 19.4-7.7 8.2h42.6l-7.2-8.2zm-28.4-151.3c1.6 1.3 2.9 2.4 2.9 6.6v38.8c0 4.2-.8 5.3-2.7 6.4-.1 .1-7.5 4.5-7.9 4.6h35.1c10 0 17.4-1.5 26-8.6-.6-5 .2-9.5 .8-12 0-.2-1.8 1.4-2.7 3.5 0-5.7 1.6-15.4 9.6-20.5-.1 0-3.7-.8-9 1.1 2-3.1 10-7.9 10.4-7.9-8.2-26-38-22.9-32.2-22.9-30.9 0-32.6 .3-39.9-4 .1 .8 .5 8.2 9.6 14.9zm21.5 5.5c4.6 0 23.1-3.3 23.1 17.3 0 20.7-18.4 17.3-23.1 17.3zm228.9 79.6l7 8.3V312h-.3c-5.4-14.4-42.3-41.5-45.2-50.9h-31.6l7.4 8.5v76.9l-7.2 8.3h39l-7.4-8.2v-47.4h.3c3.7 10.6 44.5 42.9 48.5 55.6h21.3v-85.2l7.4-8.3zm-106.7-96.1c-32.2 0-32.8 .2-39.9-4 .1 .7 .5 8.3 9.6 14.9 3.1 2 2.9 4.3 2.9 9.5 1.8-1.1 3.8-2.2 6.1-3-1.1 1.1-2.7 2.7-3.5 4.5 1-1.1 7.5-5.1 14.6-3.5-1.6 .3-4 1.1-6.1 2.9 .1 0 2.1-1.1 7.5-.3v-4.3c4.7 0 23.1-3.4 23.1 17.3 0 20.5-18.5 17.3-19.7 17.3 5.7 4.4 5.8 12 2.2 16.3h.3c33.4 0 36.7-27.3 36.7-34 0-3.8-1.1-32-33.8-33.6z"],dailymotion:[448,512,[],"e052","M298.9 267a48.4 48.4 0 0 0 -24.36-6.21q-19.83 0-33.44 13.27t-13.61 33.42q0 21.16 13.28 34.6t33.43 13.44q20.5 0 34.11-13.78T322 307.5A47.13 47.13 0 0 0 315.9 284 44.13 44.13 0 0 0 298.9 267zM0 32V480H448V32zM374.7 405.3h-53.1V381.4h-.67q-15.79 26.2-55.78 26.2-27.56 0-48.89-13.1a88.29 88.29 0 0 1 -32.94-35.77q-11.6-22.68-11.59-50.89 0-27.56 11.76-50.22a89.9 89.9 0 0 1 32.93-35.78q21.18-13.09 47.72-13.1a80.87 80.87 0 0 1 29.74 5.21q13.28 5.21 25 17V153l55.79-12.09z"],dashcube:[448,512,[],"f210","M326.6 104H110.4c-51.1 0-91.2 43.3-91.2 93.5V427c0 50.5 40.1 85 91.2 85h227.2c51.1 0 91.2-34.5 91.2-85V0L326.6 104zM153.9 416.5c-17.7 0-32.4-15.1-32.4-32.8V240.8c0-17.7 14.7-32.5 32.4-32.5h140.7c17.7 0 32 14.8 32 32.5v123.5l51.1 52.3H153.9z"],deezer:[576,512,[],"e077","M451.5 244.7H576V172H451.5zm0-173.9v72.67H576V70.82zm0 275.1H576V273.2H451.5zM0 447.1H124.5V374.4H0zm150.5 0H275V374.4H150.5zm150.5 0H425.5V374.4H301zm150.5 0H576V374.4H451.5zM301 345.9H425.5V273.2H301zm-150.5 0H275V273.2H150.5zm0-101.2H275V172H150.5z"],delicious:[448,512,[],"f1a5","M446.5 68c-.4-1.5-.9-3-1.4-4.5-.9-2.5-2-4.8-3.3-7.1-1.4-2.4-3-4.8-4.7-6.9-2.1-2.5-4.4-4.8-6.9-6.8-1.1-.9-2.2-1.7-3.3-2.5-1.3-.9-2.6-1.7-4-2.4-1.8-1-3.6-1.8-5.5-2.5-1.7-.7-3.5-1.3-5.4-1.7-3.8-1-7.9-1.5-12-1.5H48C21.5 32 0 53.5 0 80v352c0 4.1 .5 8.2 1.5 12 2 7.7 5.8 14.6 11 20.3 1 1.1 2.1 2.2 3.3 3.3 5.7 5.2 12.6 9 20.3 11 3.8 1 7.9 1.5 12 1.5h352c26.5 0 48-21.5 48-48V80c-.1-4.1-.6-8.2-1.6-12zM416 432c0 8.8-7.2 16-16 16H224V256H32V80c0-8.8 7.2-16 16-16h176v192h192z"],deploydog:[512,512,[],"f38e","M382.2 136h51.7v239.6h-51.7v-20.7c-19.8 24.8-52.8 24.1-73.8 14.7-26.2-11.7-44.3-38.1-44.3-71.8 0-29.8 14.8-57.9 43.3-70.8 20.2-9.1 52.7-10.6 74.8 12.9V136zm-64.7 161.8c0 18.2 13.6 33.5 33.2 33.5 19.8 0 33.2-16.4 33.2-32.9 0-17.1-13.7-33.2-33.2-33.2-19.6 0-33.2 16.4-33.2 32.6zM188.5 136h51.7v239.6h-51.7v-20.7c-19.8 24.8-52.8 24.1-73.8 14.7-26.2-11.7-44.3-38.1-44.3-71.8 0-29.8 14.8-57.9 43.3-70.8 20.2-9.1 52.7-10.6 74.8 12.9V136zm-64.7 161.8c0 18.2 13.6 33.5 33.2 33.5 19.8 0 33.2-16.4 33.2-32.9 0-17.1-13.7-33.2-33.2-33.2-19.7 0-33.2 16.4-33.2 32.6zM448 96c17.5 0 32 14.4 32 32v256c0 17.5-14.4 32-32 32H64c-17.5 0-32-14.4-32-32V128c0-17.5 14.4-32 32-32h384m0-32H64C28.8 64 0 92.8 0 128v256c0 35.2 28.8 64 64 64h384c35.2 0 64-28.8 64-64V128c0-35.2-28.8-64-64-64z"],deskpro:[480,512,[],"f38f","M205.9 512l31.1-38.4c12.3-.2 25.6-1.4 36.5-6.6 38.9-18.6 38.4-61.9 38.3-63.8-.1-5-.8-4.4-28.9-37.4H362c-.2 50.1-7.3 68.5-10.2 75.7-9.4 23.7-43.9 62.8-95.2 69.4-8.7 1.1-32.8 1.2-50.7 1.1zm200.4-167.7c38.6 0 58.5-13.6 73.7-30.9l-175.5-.3-17.4 31.3 119.2-.1zm-43.6-223.9v168.3h-73.5l-32.7 55.5H250c-52.3 0-58.1-56.5-58.3-58.9-1.2-13.2-21.3-11.6-20.1 1.8 1.4 15.8 8.8 40 26.4 57.1h-91c-25.5 0-110.8-26.8-107-114V16.9C0 .9 9.7 .3 15 .1h82c.2 0 .3 .1 .5 .1 4.3-.4 50.1-2.1 50.1 43.7 0 13.3 20.2 13.4 20.2 0 0-18.2-5.5-32.8-15.8-43.7h84.2c108.7-.4 126.5 79.4 126.5 120.2zm-132.5 56l64 29.3c13.3-45.5-42.2-71.7-64-29.3z"],dev:[448,512,[],"f6cc","M120.1 208.3c-3.88-2.9-7.77-4.35-11.65-4.35H91.03v104.5h17.45c3.88 0 7.77-1.45 11.65-4.35 3.88-2.9 5.82-7.25 5.82-13.06v-69.65c-.01-5.8-1.96-10.16-5.83-13.06zM404.1 32H43.9C19.7 32 .06 51.59 0 75.8v360.4C.06 460.4 19.7 480 43.9 480h360.2c24.21 0 43.84-19.59 43.9-43.8V75.8c-.06-24.21-19.7-43.8-43.9-43.8zM154.2 291.2c0 18.81-11.61 47.31-48.36 47.25h-46.4V172.1h47.38c35.44 0 47.36 28.46 47.37 47.28l.01 70.93zm100.7-88.66H201.6v38.42h32.57v29.57H201.6v38.41h53.29v29.57h-62.18c-11.16 .29-20.44-8.53-20.72-19.69V193.7c-.27-11.15 8.56-20.41 19.71-20.69h63.19l-.01 29.52zm103.6 115.3c-13.2 30.75-36.85 24.63-47.44 0l-38.53-144.8h32.57l29.71 113.7 29.57-113.7h32.58l-38.46 144.8z"],deviantart:[320,512,[],"f1bd","M320 93.2l-98.2 179.1 7.4 9.5H320v127.7H159.1l-13.5 9.2-43.7 84c-.3 0-8.6 8.6-9.2 9.2H0v-93.2l93.2-179.4-7.4-9.2H0V102.5h156l13.5-9.2 43.7-84c.3 0 8.6-8.6 9.2-9.2H320v93.1z"],dhl:[640,512,[],"f790","M238 301.2h58.7L319 271h-58.7L238 301.2zM0 282.9v6.4h81.8l4.7-6.4H0zM172.9 271c-8.7 0-6-3.6-4.6-5.5 2.8-3.8 7.6-10.4 10.4-14.1 2.8-3.7 2.8-5.9-2.8-5.9h-51l-41.1 55.8h100.1c33.1 0 51.5-22.5 57.2-30.3h-68.2zm317.5-6.9l39.3-53.4h-62.2l-39.3 53.4h62.2zM95.3 271H0v6.4h90.6l4.7-6.4zm111-26.6c-2.8 3.8-7.5 10.4-10.3 14.2-1.4 2-4.1 5.5 4.6 5.5h45.6s7.3-10 13.5-18.4c8.4-11.4 .7-35-29.2-35H112.6l-20.4 27.8h111.4c5.6 0 5.5 2.2 2.7 5.9zM0 301.2h73.1l4.7-6.4H0v6.4zm323 0h58.7L404 271h-58.7c-.1 0-22.3 30.2-22.3 30.2zm222 .1h95v-6.4h-90.3l-4.7 6.4zm22.3-30.3l-4.7 6.4H640V271h-72.7zm-13.5 18.3H640v-6.4h-81.5l-4.7 6.4zm-164.2-78.6l-22.5 30.6h-26.2l22.5-30.6h-58.7l-39.3 53.4H409l39.3-53.4h-58.7zm33.5 60.3s-4.3 5.9-6.4 8.7c-7.4 10-.9 21.6 23.2 21.6h94.3l22.3-30.3H423.1z"],diaspora:[512,512,[],"f791","M251.6 354.5c-1.4 0-88 119.9-88.7 119.9S76.34 414 76 413.3s86.6-125.7 86.6-127.4c0-2.2-129.6-44-137.6-47.1-1.3-.5 31.4-101.8 31.7-102.1 .6-.7 144.4 47 145.5 47 .4 0 .9-.6 1-1.3 .4-2 1-148.6 1.7-149.6 .8-1.2 104.5-.7 105.1-.3 1.5 1 3.5 156.1 6.1 156.1 1.4 0 138.7-47 139.3-46.3 .8 .9 31.9 102.2 31.5 102.6-.9 .9-140.2 47.1-140.6 48.8-.3 1.4 82.8 122.1 82.5 122.9s-85.5 63.5-86.3 63.5c-1-.2-89-125.5-90.9-125.5z"],digg:[512,512,[],"f1a6","M81.7 172.3H0v174.4h132.7V96h-51v76.3zm0 133.4H50.9v-92.3h30.8v92.3zm297.2-133.4v174.4h81.8v28.5h-81.8V416H512V172.3H378.9zm81.8 133.4h-30.8v-92.3h30.8v92.3zm-235.6 41h82.1v28.5h-82.1V416h133.3V172.3H225.1v174.4zm51.2-133.3h30.8v92.3h-30.8v-92.3zM153.3 96h51.3v51h-51.3V96zm0 76.3h51.3v174.4h-51.3V172.3z"],"digital-ocean":[512,512,[],"f391","M87 481.8h73.7v-73.6H87zM25.4 346.6v61.6H87v-61.6zm466.2-169.7c-23-74.2-82.4-133.3-156.6-156.6C164.9-32.8 8 93.7 8 255.9h95.8c0-101.8 101-180.5 208.1-141.7 39.7 14.3 71.5 46.1 85.8 85.7 39.1 107-39.7 207.8-141.4 208v.3h-.3V504c162.6 0 288.8-156.8 235.6-327.1zm-235.3 231v-95.3h-95.6v95.6H256v-.3z"],discord:[640,512,[],"f392","M524.5 69.84a1.5 1.5 0 0 0 -.764-.7A485.1 485.1 0 0 0 404.1 32.03a1.816 1.816 0 0 0 -1.923 .91 337.5 337.5 0 0 0 -14.9 30.6 447.8 447.8 0 0 0 -134.4 0 309.5 309.5 0 0 0 -15.14-30.6 1.89 1.89 0 0 0 -1.924-.91A483.7 483.7 0 0 0 116.1 69.14a1.712 1.712 0 0 0 -.788 .676C39.07 183.7 18.19 294.7 28.43 404.4a2.016 2.016 0 0 0 .765 1.375A487.7 487.7 0 0 0 176 479.9a1.9 1.9 0 0 0 2.063-.676A348.2 348.2 0 0 0 208.1 430.4a1.86 1.86 0 0 0 -1.019-2.588 321.2 321.2 0 0 1 -45.87-21.85 1.885 1.885 0 0 1 -.185-3.126c3.082-2.309 6.166-4.711 9.109-7.137a1.819 1.819 0 0 1 1.9-.256c96.23 43.92 200.4 43.92 295.5 0a1.812 1.812 0 0 1 1.924 .233c2.944 2.426 6.027 4.851 9.132 7.16a1.884 1.884 0 0 1 -.162 3.126 301.4 301.4 0 0 1 -45.89 21.83 1.875 1.875 0 0 0 -1 2.611 391.1 391.1 0 0 0 30.01 48.81 1.864 1.864 0 0 0 2.063 .7A486 486 0 0 0 610.7 405.7a1.882 1.882 0 0 0 .765-1.352C623.7 277.6 590.9 167.5 524.5 69.84zM222.5 337.6c-28.97 0-52.84-26.59-52.84-59.24S193.1 219.1 222.5 219.1c29.67 0 53.31 26.82 52.84 59.24C275.3 310.1 251.9 337.6 222.5 337.6zm195.4 0c-28.97 0-52.84-26.59-52.84-59.24S388.4 219.1 417.9 219.1c29.67 0 53.31 26.82 52.84 59.24C470.7 310.1 447.5 337.6 417.9 337.6z"],discourse:[448,512,[],"f393","M225.9 32C103.3 32 0 130.5 0 252.1 0 256 .1 480 .1 480l225.8-.2c122.7 0 222.1-102.3 222.1-223.9C448 134.3 348.6 32 225.9 32zM224 384c-19.4 0-37.9-4.3-54.4-12.1L88.5 392l22.9-75c-9.8-18.1-15.4-38.9-15.4-61 0-70.7 57.3-128 128-128s128 57.3 128 128-57.3 128-128 128z"],dochub:[416,512,[],"f394","M397.9 160H256V19.6L397.9 160zM304 192v130c0 66.8-36.5 100.1-113.3 100.1H96V84.8h94.7c12 0 23.1 .8 33.1 2.5v-84C212.9 1.1 201.4 0 189.2 0H0v512h189.2C329.7 512 400 447.4 400 318.1V192h-96z"],docker:[640,512,[],"f395","M349.9 236.3h-66.1v-59.4h66.1v59.4zm0-204.3h-66.1v60.7h66.1V32zm78.2 144.8H362v59.4h66.1v-59.4zm-156.3-72.1h-66.1v60.1h66.1v-60.1zm78.1 0h-66.1v60.1h66.1v-60.1zm276.8 100c-14.4-9.7-47.6-13.2-73.1-8.4-3.3-24-16.7-44.9-41.1-63.7l-14-9.3-9.3 14c-18.4 27.8-23.4 73.6-3.7 103.8-8.7 4.7-25.8 11.1-48.4 10.7H2.4c-8.7 50.8 5.8 116.8 44 162.1 37.1 43.9 92.7 66.2 165.4 66.2 157.4 0 273.9-72.5 328.4-204.2 21.4 .4 67.6 .1 91.3-45.2 1.5-2.5 6.6-13.2 8.5-17.1l-13.3-8.9zm-511.1-27.9h-66v59.4h66.1v-59.4zm78.1 0h-66.1v59.4h66.1v-59.4zm78.1 0h-66.1v59.4h66.1v-59.4zm-78.1-72.1h-66.1v60.1h66.1v-60.1z"],draft2digital:[480,512,[],"f396","M480 398.1l-144-82.2v64.7h-91.3c30.8-35 81.8-95.9 111.8-149.3 35.2-62.6 16.1-123.4-12.8-153.3-4.4-4.6-62.2-62.9-166-41.2-59.1 12.4-89.4 43.4-104.3 67.3-13.1 20.9-17 39.8-18.2 47.7-5.5 33 19.4 67.1 56.7 67.1 31.7 0 57.3-25.7 57.3-57.4 0-27.1-19.7-52.1-48-56.8 1.8-7.3 17.7-21.1 26.3-24.7 41.1-17.3 78 5.2 83.3 33.5 8.3 44.3-37.1 90.4-69.7 127.6C84.5 328.1 18.3 396.8 0 415.9l336-.1V480zM369.9 371l47.1 27.2-47.1 27.2zM134.2 161.4c0 12.4-10 22.4-22.4 22.4s-22.4-10-22.4-22.4 10-22.4 22.4-22.4 22.4 10.1 22.4 22.4zM82.5 380.5c25.6-27.4 97.7-104.7 150.8-169.9 35.1-43.1 40.3-82.4 28.4-112.7-7.4-18.8-17.5-30.2-24.3-35.7 45.3 2.1 68 23.4 82.2 38.3 0 0 42.4 48.2 5.8 113.3-37 65.9-110.9 147.5-128.5 166.7z"],dribbble:[512,512,[],"f17d","M256 8C119.3 8 8 119.3 8 256s111.3 248 248 248 248-111.3 248-248S392.7 8 256 8zm163.1 114.4c29.5 36.05 47.37 81.96 47.83 131.1-6.984-1.477-77.02-15.68-147.5-6.818-5.752-14.04-11.18-26.39-18.62-41.61 78.32-31.98 113.8-77.48 118.3-83.52zM396.4 97.87c-3.81 5.427-35.7 48.29-111 76.52-34.71-63.78-73.18-116.2-79.04-124 67.18-16.19 137.1 1.27 190.1 47.49zm-230.5-33.25c5.585 7.659 43.44 60.12 78.54 122.5-99.09 26.31-186.4 25.93-195.8 25.81C62.38 147.2 106.7 92.57 165.9 64.62zM44.17 256.3c0-2.166 .043-4.322 .108-6.473 9.268 .19 111.9 1.513 217.7-30.15 6.064 11.87 11.86 23.92 17.17 35.95-76.6 21.58-146.2 83.53-180.5 142.3C64.79 360.4 44.17 310.7 44.17 256.3zm81.81 167.1c22.13-45.23 82.18-103.6 167.6-132.8 29.74 77.28 42.04 142.1 45.19 160.6-68.11 29.01-150 21.05-212.8-27.88zm248.4 8.489c-2.171-12.89-13.45-74.9-41.15-151 66.38-10.63 124.7 6.768 131.9 9.055-9.442 58.94-43.27 109.8-90.79 141.1z"],dropbox:[528,512,[],"f16b","M264.4 116.3l-132 84.3 132 84.3-132 84.3L0 284.1l132.3-84.3L0 116.3 132.3 32l132.1 84.3zM131.6 395.7l132-84.3 132 84.3-132 84.3-132-84.3zm132.8-111.6l132-84.3-132-83.6L395.7 32 528 116.3l-132.3 84.3L528 284.8l-132.3 84.3-131.3-85z"],drupal:[448,512,[],"f1a9","M303.1 108.1C268.2 72.46 234.2 38.35 224 0c-9.957 38.35-44.25 72.46-80.02 108.1C90.47 161.7 29.72 222.4 29.72 313.4c-2.337 107.3 82.75 196.2 190.1 198.5S415.9 429.2 418.3 321.9q.091-4.231 0-8.464C418.3 222.4 357.5 161.7 303.1 108.1zm-174.3 223a130.3 130.3 0 0 0 -15.21 24.15 4.978 4.978 0 0 1 -3.319 2.766h-1.659c-4.333 0-9.219-8.481-9.219-8.481h0c-1.29-2.028-2.489-4.149-3.687-6.361l-.83-1.752c-11.25-25.72-1.475-62.32-1.475-62.32h0a160.6 160.6 0 0 1 23.23-49.87A290.8 290.8 0 0 1 138.5 201.6l9.219 9.219 43.51 44.43a4.979 4.979 0 0 1 0 6.638L145.8 312.3h0zm96.61 127.3a67.2 67.2 0 0 1 -49.78-111.9c14.2-16.87 31.53-33.46 50.33-55.31 22.31 23.78 36.88 40.1 51.16 57.99a28.41 28.41 0 0 1 2.95 4.425 65.9 65.9 0 0 1 11.98 37.98 66.65 66.65 0 0 1 -66.47 66.84zM352.4 351.6h0a7.743 7.743 0 0 1 -6.176 5.347H344.9a11.25 11.25 0 0 1 -6.269-5.07h0a348.2 348.2 0 0 0 -39.46-48.95L281.4 284.5 222.3 223.2a497.9 497.9 0 0 1 -35.4-36.32 12.03 12.03 0 0 0 -.922-1.382 35.4 35.4 0 0 1 -4.7-9.219V174.5a31.35 31.35 0 0 1 9.218-27.66c11.43-11.43 22.95-22.95 33.83-34.94 11.98 13.27 24.8 26 37.43 38.63h0a530.1 530.1 0 0 1 69.6 79.1 147.5 147.5 0 0 1 27.01 83.8A134.1 134.1 0 0 1 352.4 351.6z"],dyalog:[416,512,[],"f399","M0 32v119.2h64V96h107.2C284.6 96 352 176.2 352 255.9 352 332 293.4 416 171.2 416H0v64h171.2C331.9 480 416 367.3 416 255.9c0-58.7-22.1-113.4-62.3-154.3C308.9 56 245.7 32 171.2 32H0z"],earlybirds:[480,512,[],"f39a","M313.2 47.5c1.2-13 21.3-14 36.6-8.7 .9 .3 26.2 9.7 19 15.2-27.9-7.4-56.4 18.2-55.6-6.5zm-201 6.9c30.7-8.1 62 20 61.1-7.1-1.3-14.2-23.4-15.3-40.2-9.6-1 .3-28.7 10.5-20.9 16.7zM319.4 160c-8.8 0-16 7.2-16 16s7.2 16 16 16 16-7.2 16-16-7.2-16-16-16zm-159.7 0c-8.8 0-16 7.2-16 16s7.2 16 16 16 16-7.2 16-16-7.2-16-16-16zm318.5 163.2c-9.9 24-40.7 11-63.9-1.2-13.5 69.1-58.1 111.4-126.3 124.2 .3 .9-2-.1 24 1 33.6 1.4 63.8-3.1 97.4-8-19.8-13.8-11.4-37.1-9.8-38.1 1.4-.9 14.7 1.7 21.6 11.5 8.6-12.5 28.4-14.8 30.2-13.6 1.6 1.1 6.6 20.9-6.9 34.6 4.7-.9 8.2-1.6 9.8-2.1 2.6-.8 17.7 11.3 3.1 13.3-14.3 2.3-22.6 5.1-47.1 10.8-45.9 10.7-85.9 11.8-117.7 12.8l1 11.6c3.8 18.1-23.4 24.3-27.6 6.2 .8 17.9-27.1 21.8-28.4-1l-.5 5.3c-.7 18.4-28.4 17.9-28.3-.6-7.5 13.5-28.1 6.8-26.4-8.5l1.2-12.4c-36.7 .9-59.7 3.1-61.8 3.1-20.9 0-20.9-31.6 0-31.6 2.4 0 27.7 1.3 63.2 2.8-61.1-15.5-103.7-55-114.9-118.2-25 12.8-57.5 26.8-68.2 .8-10.5-25.4 21.5-42.6 66.8-73.4 .7-6.6 1.6-13.3 2.7-19.8-14.4-19.6-11.6-36.3-16.1-60.4-16.8 2.4-23.2-9.1-23.6-23.1 .3-7.3 2.1-14.9 2.4-15.4 1.1-1.8 10.1-2 12.7-2.6 6-31.7 50.6-33.2 90.9-34.5 19.7-21.8 45.2-41.5 80.9-48.3C203.3 29 215.2 8.5 216.2 8c1.7-.8 21.2 4.3 26.3 23.2 5.2-8.8 18.3-11.4 19.6-10.7 1.1 .6 6.4 15-4.9 25.9 40.3 3.5 72.2 24.7 96 50.7 36.1 1.5 71.8 5.9 77.1 34 2.7 .6 11.6 .8 12.7 2.6 .3 .5 2.1 8.1 2.4 15.4-.5 13.9-6.8 25.4-23.6 23.1-3.2 17.3-2.7 32.9-8.7 47.7 2.4 11.7 4 23.8 4.8 36.4 37 25.4 70.3 42.5 60.3 66.9zM207.4 159.9c.9-44-37.9-42.2-78.6-40.3-21.7 1-38.9 1.9-45.5 13.9-11.4 20.9 5.9 92.9 23.2 101.2 9.8 4.7 73.4 7.9 86.3-7.1 8.2-9.4 15-49.4 14.6-67.7zm52 58.3c-4.3-12.4-6-30.1-15.3-32.7-2-.5-9-.5-11 0-10 2.8-10.8 22.1-17 37.2 15.4 0 19.3 9.7 23.7 9.7 4.3 0 6.3-11.3 19.6-14.2zm135.7-84.7c-6.6-12.1-24.8-12.9-46.5-13.9-40.2-1.9-78.2-3.8-77.3 40.3-.5 18.3 5 58.3 13.2 67.8 13 14.9 76.6 11.8 86.3 7.1 15.8-7.6 36.5-78.9 24.3-101.3z"],ebay:[640,512,[],"f4f4","M606 189.5l-54.8 109.9-54.9-109.9h-37.5l10.9 20.6c-11.5-19-35.9-26-63.3-26-31.8 0-67.9 8.7-71.5 43.1h33.7c1.4-13.8 15.7-21.8 35-21.8 26 0 41 9.6 41 33v3.4c-12.7 0-28 .1-41.7 .4-42.4 .9-69.6 10-76.7 34.4 1-5.2 1.5-10.6 1.5-16.2 0-52.1-39.7-76.2-75.4-76.2-21.3 0-43 5.5-58.7 24.2v-80.6h-32.1v169.5c0 10.3-.6 22.9-1.1 33.1h31.5c.7-6.3 1.1-12.9 1.1-19.5 13.6 16.6 35.4 24.9 58.7 24.9 36.9 0 64.9-21.9 73.3-54.2-.5 2.8-.7 5.8-.7 9 0 24.1 21.1 45 60.6 45 26.6 0 45.8-5.7 61.9-25.5 0 6.6 .3 13.3 1.1 20.2h29.8c-.7-8.2-1-17.5-1-26.8v-65.6c0-9.3-1.7-17.2-4.8-23.8l61.5 116.1-28.5 54.1h35.9L640 189.5zM243.7 313.8c-29.6 0-50.2-21.5-50.2-53.8 0-32.4 20.6-53.8 50.2-53.8 29.8 0 50.2 21.4 50.2 53.8 0 32.3-20.4 53.8-50.2 53.8zm200.9-47.3c0 30-17.9 48.4-51.6 48.4-25.1 0-35-13.4-35-25.8 0-19.1 18.1-24.4 47.2-25.3 13.1-.5 27.6-.6 39.4-.6zm-411.9 1.6h128.8v-8.5c0-51.7-33.1-75.4-78.4-75.4-56.8 0-83 30.8-83 77.6 0 42.5 25.3 74 82.5 74 31.4 0 68-11.7 74.4-46.1h-33.1c-12 35.8-87.7 36.7-91.2-21.6zm95-21.4H33.3c6.9-56.6 92.1-54.7 94.4 0z"],edge:[512,512,[],"f282","M120.1 37.44C161.1 12.23 207.7-.7753 255 .0016C423 .0016 512 123.8 512 219.5C511.9 252.2 499 283.4 476.1 306.7C453.2 329.9 422.1 343.2 389.4 343.7C314.2 343.7 297.9 320.6 297.9 311.7C297.9 307.9 299.1 305.5 302.7 302.3L303.7 301.1L304.1 299.5C314.6 288 320 273.3 320 257.9C320 179.2 237.8 115.2 136 115.2C98.46 114.9 61.46 124.1 28.48 142.1C55.48 84.58 111.2 44.5 119.8 38.28C120.6 37.73 120.1 37.44 120.1 37.44V37.44zM135.7 355.5C134.3 385.5 140.3 415.5 152.1 442.7C165.7 469.1 184.8 493.7 208.6 512C149.1 500.5 97.11 468.1 59.2 422.7C21.12 376.3 0 318.4 0 257.9C0 206.7 62.4 163.5 136 163.5C172.6 162.9 208.4 174.4 237.8 196.2L234.2 197.4C182.7 215 135.7 288.1 135.7 355.5V355.5zM469.8 400L469.1 400.1C457.3 418.9 443.2 435.2 426.9 449.6C396.1 477.6 358.8 495.1 318.1 499.5C299.5 499.8 281.3 496.3 264.3 488.1C238.7 477.8 217.2 458.1 202.7 435.1C188.3 411.2 181.6 383.4 183.7 355.5C183.1 335.4 189.1 315.2 198.7 297.3C212.6 330.4 236.2 358.6 266.3 378.1C296.4 397.6 331.8 407.6 367.7 406.7C398.7 407 429.8 400 457.9 386.2L459.8 385.3C463.7 383 467.5 381.4 471.4 385.3C475.9 390.2 473.2 394.5 470.2 399.3C470 399.5 469.9 399.8 469.8 400V400z"],"edge-legacy":[512,512,[],"e078","M25.71 228.2l.35-.48c0 .16 0 .32-.07 .48zm460.6 15.51c0-44-7.76-84.46-28.81-122.4C416.5 47.88 343.9 8 258.9 8 119 7.72 40.62 113.2 26.06 227.7c42.42-61.31 117.1-121.4 220.4-125 0 0 109.7 0 99.42 105H170c6.37-37.39 18.55-59 34.34-78.93-75.05 34.9-121.8 96.1-120.8 188.3 .83 71.45 50.13 144.8 120.8 172 83.35 31.84 192.8 7.2 240.1-21.33V363.3C363.6 419.8 173.6 424.2 172.2 295.7H486.3V243.7z"],elementor:[512,512,[],"f430","M.361 256C.361 397 114 511 255 511C397 511 511 397 511 256C511 116 397 2.05 255 2.05C114 2.05 .361 116 .361 256zM192 150V363H149V150H192zM234 150H362V193H234V150zM362 235V278H234V235H362zM234 320H362V363H234V320z"],ello:[496,512,[],"f5f1","M248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S384.1 8 248 8zm143.8 285.2C375.3 358.5 315.8 404.8 248 404.8s-127.3-46.29-143.8-111.6c-1.65-7.44 2.48-15.71 9.92-17.36 7.44-1.65 15.71 2.48 17.36 9.92 14.05 52.91 62 90.11 116.6 90.11s102.5-37.2 116.6-90.11c1.65-7.44 9.92-12.4 17.36-9.92 7.44 1.65 12.4 9.92 9.92 17.36z"],ember:[640,512,[],"f423","M639.9 254.6c-1.1-10.7-10.7-6.8-10.7-6.8s-15.6 12.1-29.3 10.7c-13.7-1.3-9.4-32-9.4-32s3-28.1-5.1-30.4c-8.1-2.4-18 7.3-18 7.3s-12.4 13.7-18.3 31.2l-1.6 .5s1.9-30.6-.3-37.6c-1.6-3.5-16.4-3.2-18.8 3s-14.2 49.2-15 67.2c0 0-23.1 19.6-43.3 22.8s-25-9.4-25-9.4 54.8-15.3 52.9-59.1-44.2-27.6-49-24c-4.6 3.5-29.4 18.4-36.6 59.7-.2 1.4-.7 7.5-.7 7.5s-21.2 14.2-33 18c0 0 33-55.6-7.3-80.9-11.4-6.8-21.3-.5-27.2 5.3 13.6-17.3 46.4-64.2 36.9-105.2-5.8-24.4-18-27.1-29.2-23.1-17 6.7-23.5 16.7-23.5 16.7s-22 32-27.1 79.5-12.6 105.1-12.6 105.1-10.5 10.2-20.2 10.7-5.4-28.7-5.4-28.7 7.5-44.6 7-52.1-1.1-11.6-9.9-14.2c-8.9-2.7-18.5 8.6-18.5 8.6s-25.5 38.7-27.7 44.6l-1.3 2.4-1.3-1.6s18-52.7 .8-53.5-28.5 18.8-28.5 18.8-19.6 32.8-20.4 36.5l-1.3-1.6s8.1-38.2 6.4-47.6c-1.6-9.4-10.5-7.5-10.5-7.5s-11.3-1.3-14.2 5.9-13.7 55.3-15 70.7c0 0-28.2 20.2-46.8 20.4-18.5 .3-16.7-11.8-16.7-11.8s68-23.3 49.4-69.2c-8.3-11.8-18-15.5-31.7-15.3-13.7 .3-30.3 8.6-41.3 33.3-5.3 11.8-6.8 23-7.8 31.5 0 0-12.3 2.4-18.8-2.9s-10 0-10 0-11.2 14-.1 18.3 28.1 6.1 28.1 6.1c1.6 7.5 6.2 19.5 19.6 29.7 20.2 15.3 58.8-1.3 58.8-1.3l15.9-8.8s.5 14.6 12.1 16.7 16.4 1 36.5-47.9c11.8-25 12.6-23.6 12.6-23.6l1.3-.3s-9.1 46.8-5.6 59.7C187.7 319.4 203 318 203 318s8.3 2.4 15-21.2 19.6-49.9 19.6-49.9h1.6s-5.6 48.1 3 63.7 30.9 5.3 30.9 5.3 15.6-7.8 18-10.2c0 0 18.5 15.8 44.6 12.9 58.3-11.5 79.1-25.9 79.1-25.9s10 24.4 41.1 26.7c35.5 2.7 54.8-18.6 54.8-18.6s-.3 13.5 12.1 18.6 20.7-22.8 20.7-22.8l20.7-57.2h1.9s1.1 37.3 21.5 43.2 47-13.7 47-13.7 6.4-3.5 5.3-14.3zm-578 5.3c.8-32 21.8-45.9 29-39 7.3 7 4.6 22-9.1 31.4-13.7 9.5-19.9 7.6-19.9 7.6zm272.8-123.8s19.1-49.7 23.6-25.5-40 96.2-40 96.2c.5-16.2 16.4-70.7 16.4-70.7zm22.8 138.4c-12.6 33-43.3 19.6-43.3 19.6s-3.5-11.8 6.4-44.9 33.3-20.2 33.3-20.2 16.2 12.4 3.6 45.5zm84.6-14.6s-3-10.5 8.1-30.6c11-20.2 19.6-9.1 19.6-9.1s9.4 10.2-1.3 25.5-26.4 14.2-26.4 14.2z"],empire:[496,512,[],"f1d1","M287.6 54.2c-10.8-2.2-22.1-3.3-33.5-3.6V32.4c78.1 2.2 146.1 44 184.6 106.6l-15.8 9.1c-6.1-9.7-12.7-18.8-20.2-27.1l-18 15.5c-26-29.6-61.4-50.7-101.9-58.4l4.8-23.9zM53.4 322.4l23-7.7c-6.4-18.3-10-38.2-10-58.7s3.3-40.4 9.7-58.7l-22.7-7.7c3.6-10.8 8.3-21.3 13.6-31l-15.8-9.1C34 181 24.1 217.5 24.1 256s10 75 27.1 106.6l15.8-9.1c-5.3-10-9.7-20.3-13.6-31.1zM213.1 434c-40.4-8-75.8-29.1-101.9-58.7l-18 15.8c-7.5-8.6-14.4-17.7-20.2-27.4l-16 9.4c38.5 62.3 106.8 104.3 184.9 106.6v-18.3c-11.3-.3-22.7-1.7-33.5-3.6l4.7-23.8zM93.3 120.9l18 15.5c26-29.6 61.4-50.7 101.9-58.4l-4.7-23.8c10.8-2.2 22.1-3.3 33.5-3.6V32.4C163.9 34.6 95.9 76.4 57.4 139l15.8 9.1c6-9.7 12.6-18.9 20.1-27.2zm309.4 270.2l-18-15.8c-26 29.6-61.4 50.7-101.9 58.7l4.7 23.8c-10.8 1.9-22.1 3.3-33.5 3.6v18.3c78.1-2.2 146.4-44.3 184.9-106.6l-16.1-9.4c-5.7 9.7-12.6 18.8-20.1 27.4zM496 256c0 137-111 248-248 248S0 393 0 256 111 8 248 8s248 111 248 248zm-12.2 0c0-130.1-105.7-235.8-235.8-235.8S12.2 125.9 12.2 256 117.9 491.8 248 491.8 483.8 386.1 483.8 256zm-39-106.6l-15.8 9.1c5.3 9.7 10 20.2 13.6 31l-22.7 7.7c6.4 18.3 9.7 38.2 9.7 58.7s-3.6 40.4-10 58.7l23 7.7c-3.9 10.8-8.3 21-13.6 31l15.8 9.1C462 331 471.9 294.5 471.9 256s-9.9-75-27.1-106.6zm-183 177.7c16.3-3.3 30.4-11.6 40.7-23.5l51.2 44.8c11.9-13.6 21.3-29.3 27.1-46.8l-64.2-22.1c2.5-7.5 3.9-15.2 3.9-23.5s-1.4-16.1-3.9-23.5l64.5-22.1c-6.1-17.4-15.5-33.2-27.4-46.8l-51.2 44.8c-10.2-11.9-24.4-20.5-40.7-23.8l13.3-66.4c-8.6-1.9-17.7-2.8-27.1-2.8-9.4 0-18.5 .8-27.1 2.8l13.3 66.4c-16.3 3.3-30.4 11.9-40.7 23.8l-51.2-44.8c-11.9 13.6-21.3 29.3-27.4 46.8l64.5 22.1c-2.5 7.5-3.9 15.2-3.9 23.5s1.4 16.1 3.9 23.5l-64.2 22.1c5.8 17.4 15.2 33.2 27.1 46.8l51.2-44.8c10.2 11.9 24.4 20.2 40.7 23.5l-13.3 66.7c8.6 1.7 17.7 2.8 27.1 2.8 9.4 0 18.5-1.1 27.1-2.8l-13.3-66.7z"],envira:[448,512,[],"f299","M0 32c477.6 0 366.6 317.3 367.1 366.3L448 480h-26l-70.4-71.2c-39 4.2-124.4 34.5-214.4-37C47 300.3 52 214.7 0 32zm79.7 46c-49.7-23.5-5.2 9.2-5.2 9.2 45.2 31.2 66 73.7 90.2 119.9 31.5 60.2 79 139.7 144.2 167.7 65 28 34.2 12.5 6-8.5-28.2-21.2-68.2-87-91-130.2-31.7-60-61-118.6-144.2-158.1z"],erlang:[640,512,[],"f39d","M87.2 53.5H0v405h100.4c-49.7-52.6-78.8-125.3-78.7-212.1-.1-76.7 24-142.7 65.5-192.9zm238.2 9.7c-45.9 .1-85.1 33.5-89.2 83.2h169.9c-1.1-49.7-34.5-83.1-80.7-83.2zm230.7-9.6h.3l-.1-.1zm.3 0c31.4 42.7 48.7 97.5 46.2 162.7 .5 6 .5 11.7 0 24.1H230.2c-.2 109.7 38.9 194.9 138.6 195.3 68.5-.3 118-51 151.9-106.1l96.4 48.2c-17.4 30.9-36.5 57.8-57.9 80.8H640v-405z"],ethereum:[320,512,[],"f42e","M311.9 260.8L160 353.6 8 260.8 160 0l151.9 260.8zM160 383.4L8 290.6 160 512l152-221.4-152 92.8z"],etsy:[384,512,[],"f2d7","M384 348c-1.75 10.75-13.75 110-15.5 132-117.9-4.299-219.9-4.743-368.5 0v-25.5c45.46-8.948 60.63-8.019 61-35.25 1.793-72.32 3.524-244.1 0-322-1.029-28.46-12.13-26.76-61-36v-25.5c73.89 2.358 255.9 8.551 362.1-3.75-3.5 38.25-7.75 126.5-7.75 126.5H332C320.9 115.7 313.2 68 277.3 68h-137c-10.25 0-10.75 3.5-10.75 9.75V241.5c58 .5 88.5-2.5 88.5-2.5 29.77-.951 27.56-8.502 40.75-65.25h25.75c-4.407 101.4-3.91 61.83-1.75 160.3H257c-9.155-40.09-9.065-61.04-39.5-61.5 0 0-21.5-2-88-2v139c0 26 14.25 38.25 44.25 38.25H263c63.64 0 66.56-24.1 98.75-99.75H384z"],evernote:[384,512,[],"f839","M120.8 132.2c1.6 22.31-17.55 21.59-21.61 21.59-68.93 0-73.64-1-83.58 3.34-.56 .22-.74 0-.37-.37L123.8 46.45c.38-.37 .6-.22 .38 .37-4.35 9.99-3.35 15.09-3.35 85.39zm79 308c-14.68-37.08 13-76.93 52.52-76.62 17.49 0 22.6 23.21 7.95 31.42-6.19 3.3-24.95 1.74-25.14 19.2-.05 17.09 19.67 25 31.2 24.89A45.64 45.64 0 0 0 312 393.5v-.08c0-11.63-7.79-47.22-47.54-55.34-7.72-1.54-65-6.35-68.35-50.52-3.74 16.93-17.4 63.49-43.11 69.09-8.74 1.94-69.68 7.64-112.9-36.77 0 0-18.57-15.23-28.23-57.95-3.38-15.75-9.28-39.7-11.14-62 0-18 11.14-30.45 25.07-32.2 81 0 90 2.32 101-7.8 9.82-9.24 7.8-15.5 7.8-102.8 1-8.3 7.79-30.81 53.41-24.14 6 .86 31.91 4.18 37.48 30.64l64.26 11.15c20.43 3.71 70.94 7 80.6 57.94 22.66 121.1 8.91 238.5 7.8 238.5C362.1 485.5 267.1 480 267.1 480c-18.95-.23-54.25-9.4-67.27-39.83zm80.94-204.8c-1 1.92-2.2 6 .85 7 14.09 4.93 39.75 6.84 45.88 5.53 3.11-.25 3.05-4.43 2.48-6.65-3.53-21.85-40.83-26.5-49.24-5.92z"],expeditedssl:[496,512,[],"f23e","M248 43.4C130.6 43.4 35.4 138.6 35.4 256S130.6 468.6 248 468.6 460.6 373.4 460.6 256 365.4 43.4 248 43.4zm-97.4 132.9c0-53.7 43.7-97.4 97.4-97.4s97.4 43.7 97.4 97.4v26.6c0 5-3.9 8.9-8.9 8.9h-17.7c-5 0-8.9-3.9-8.9-8.9v-26.6c0-82.1-124-82.1-124 0v26.6c0 5-3.9 8.9-8.9 8.9h-17.7c-5 0-8.9-3.9-8.9-8.9v-26.6zM389.7 380c0 9.7-8 17.7-17.7 17.7H124c-9.7 0-17.7-8-17.7-17.7V238.3c0-9.7 8-17.7 17.7-17.7h248c9.7 0 17.7 8 17.7 17.7V380zm-248-137.3v132.9c0 2.5-1.9 4.4-4.4 4.4h-8.9c-2.5 0-4.4-1.9-4.4-4.4V242.7c0-2.5 1.9-4.4 4.4-4.4h8.9c2.5 0 4.4 1.9 4.4 4.4zm141.7 48.7c0 13-7.2 24.4-17.7 30.4v31.6c0 5-3.9 8.9-8.9 8.9h-17.7c-5 0-8.9-3.9-8.9-8.9v-31.6c-10.5-6.1-17.7-17.4-17.7-30.4 0-19.7 15.8-35.4 35.4-35.4s35.5 15.8 35.5 35.4zM248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S385 8 248 8zm0 478.3C121 486.3 17.7 383 17.7 256S121 25.7 248 25.7 478.3 129 478.3 256 375 486.3 248 486.3z"],facebook:[512,512,[62e3],"f09a","M504 256C504 119 393 8 256 8S8 119 8 256c0 123.8 90.69 226.4 209.3 245V327.7h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.28c-30.8 0-40.41 19.12-40.41 38.73V256h68.78l-11 71.69h-57.78V501C413.3 482.4 504 379.8 504 256z"],"facebook-f":[320,512,[],"f39e","M279.1 288l14.22-92.66h-88.91v-60.13c0-25.35 12.42-50.06 52.24-50.06h40.42V6.26S260.4 0 225.4 0c-73.22 0-121.1 44.38-121.1 124.7v70.62H22.89V288h81.39v224h100.2V288z"],"facebook-messenger":[512,512,[],"f39f","M256.5 8C116.5 8 8 110.3 8 248.6c0 72.3 29.71 134.8 78.07 177.9 8.35 7.51 6.63 11.86 8.05 58.23A19.92 19.92 0 0 0 122 502.3c52.91-23.3 53.59-25.14 62.56-22.7C337.9 521.8 504 423.7 504 248.6 504 110.3 396.6 8 256.5 8zm149.2 185.1l-73 115.6a37.37 37.37 0 0 1 -53.91 9.93l-58.08-43.47a15 15 0 0 0 -18 0l-78.37 59.44c-10.46 7.93-24.16-4.6-17.11-15.67l73-115.6a37.36 37.36 0 0 1 53.91-9.93l58.06 43.46a15 15 0 0 0 18 0l78.41-59.38c10.44-7.98 24.14 4.54 17.09 15.62z"],"fantasy-flight-games":[512,512,[],"f6dc","M256 32.86L32.86 256 256 479.1 479.1 256 256 32.86zM88.34 255.8c1.96-2 11.92-12.3 96.49-97.48 41.45-41.75 86.19-43.77 119.8-18.69 24.63 18.4 62.06 58.9 62.15 59 .68 .74 1.07 2.86 .58 3.38-11.27 11.84-22.68 23.54-33.5 34.69-34.21-32.31-40.52-38.24-48.51-43.95-17.77-12.69-41.4-10.13-56.98 5.1-2.17 2.13-1.79 3.43 .12 5.35 2.94 2.95 28.1 28.33 35.09 35.78-11.95 11.6-23.66 22.97-35.69 34.66-12.02-12.54-24.48-25.53-36.54-38.11-21.39 21.09-41.69 41.11-61.85 60.99zm234.8 101.6c-35.49 35.43-78.09 38.14-106.1 20.47-22.08-13.5-39.38-32.08-72.93-66.84 12.05-12.37 23.79-24.42 35.37-36.31 33.02 31.91 37.06 36.01 44.68 42.09 18.48 14.74 42.52 13.67 59.32-1.8 3.68-3.39 3.69-3.64 .14-7.24-10.59-10.73-21.19-21.44-31.77-32.18-1.32-1.34-3.03-2.48-.8-4.69 10.79-10.71 21.48-21.52 32.21-32.29 .26-.26 .65-.38 1.91-1.07 12.37 12.87 24.92 25.92 37.25 38.75 21.01-20.73 41.24-40.68 61.25-60.42 13.68 13.4 27.13 26.58 40.86 40.03-20.17 20.86-81.68 82.71-100.5 101.5zM256 0L0 256l256 256 256-256L256 0zM16 256L256 16l240 240-240 240L16 256z"],fedex:[640,512,[],"f797","M586 284.5l53.3-59.9h-62.4l-21.7 24.8-22.5-24.8H414v-16h56.1v-48.1H318.9V236h-.5c-9.6-11-21.5-14.8-35.4-14.8-28.4 0-49.8 19.4-57.3 44.9-18-59.4-97.4-57.6-121.9-14v-24.2H49v-26.2h60v-41.1H0V345h49v-77.5h48.9c-1.5 5.7-2.3 11.8-2.3 18.2 0 73.1 102.6 91.4 130.2 23.7h-42c-14.7 20.9-45.8 8.9-45.8-14.6h85.5c3.7 30.5 27.4 56.9 60.1 56.9 14.1 0 27-6.9 34.9-18.6h.5V345h212.2l22.1-25 22.3 25H640l-54-60.5zm-446.7-16.6c6.1-26.3 41.7-25.6 46.5 0h-46.5zm153.4 48.9c-34.6 0-34-62.8 0-62.8 32.6 0 34.5 62.8 0 62.8zm167.8 19.1h-94.4V169.4h95v30.2H405v33.9h55.5v28.1h-56.1v44.7h56.1v29.6zm-45.9-39.8v-24.4h56.1v-44l50.7 57-50.7 57v-45.6h-56.1zm138.6 10.3l-26.1 29.5H489l45.6-51.2-45.6-51.2h39.7l26.6 29.3 25.6-29.3h38.5l-45.4 51 46 51.4h-40.5l-26.3-29.5z"],fedora:[448,512,[],"f798","M.0413 255.8C.1219 132.2 100.3 32 224 32C347.7 32 448 132.3 448 256C448 379.7 347.8 479.9 224.1 480H50.93C22.84 480 .0832 457.3 .0416 429.2H0V255.8H.0413zM342.6 192.7C342.6 153 307 124.2 269.4 124.2C234.5 124.2 203.6 150.5 199.3 184.1C199.1 187.9 198.9 189.1 198.9 192.6C198.8 213.7 198.9 235.4 198.1 257C199 283.1 199.1 309.1 198.1 333.6C198.1 360.7 178.7 379.1 153.4 379.1C128.1 379.1 107.6 358.9 107.6 333.6C108.1 305.9 130.2 288.3 156.1 287.5H156.3L182.6 287.3V250L156.3 250.2C109.2 249.8 71.72 286.7 70.36 333.6C70.36 379.2 107.9 416.5 153.4 416.5C196.4 416.5 232.1 382.9 236 340.9L236.2 287.4L268.8 287.1C294.1 287.3 293.8 249.3 268.6 249.8L236.2 250.1C236.2 243.7 236.3 237.3 236.3 230.9C236.4 218.2 236.4 205.5 236.2 192.7C236.3 176.2 252 161.5 269.4 161.5C286.9 161.5 305.3 170.2 305.3 192.7C305.3 195.9 305.2 197.8 305 199C303.1 209.5 310.2 219.4 320.7 220.9C331.3 222.4 340.9 214.8 341.9 204.3C342.5 200.1 342.6 196.4 342.6 192.7H342.6z"],figma:[384,512,[],"f799","M14 95.79C14 42.89 56.89 0 109.8 0H274.2C327.1 0 369.1 42.89 369.1 95.79C369.1 129.3 352.8 158.8 326.7 175.9C352.8 193 369.1 222.5 369.1 256C369.1 308.9 327.1 351.8 274.2 351.8H272.1C247.3 351.8 224.7 342.4 207.7 326.9V415.2C207.7 468.8 163.7 512 110.3 512C57.54 512 14 469.2 14 416.2C14 382.7 31.19 353.2 57.24 336.1C31.19 318.1 14 289.5 14 256C14 222.5 31.2 193 57.24 175.9C31.2 158.8 14 129.3 14 95.79zM176.3 191.6H109.8C74.22 191.6 45.38 220.4 45.38 256C45.38 291.4 73.99 320.2 109.4 320.4C109.5 320.4 109.7 320.4 109.8 320.4H176.3V191.6zM207.7 256C207.7 291.6 236.5 320.4 272.1 320.4H274.2C309.7 320.4 338.6 291.6 338.6 256C338.6 220.4 309.7 191.6 274.2 191.6H272.1C236.5 191.6 207.7 220.4 207.7 256zM109.8 351.8C109.7 351.8 109.5 351.8 109.4 351.8C73.99 352 45.38 380.8 45.38 416.2C45.38 451.7 74.6 480.6 110.3 480.6C146.6 480.6 176.3 451.2 176.3 415.2V351.8H109.8zM109.8 31.38C74.22 31.38 45.38 60.22 45.38 95.79C45.38 131.4 74.22 160.2 109.8 160.2H176.3V31.38H109.8zM207.7 160.2H274.2C309.7 160.2 338.6 131.4 338.6 95.79C338.6 60.22 309.7 31.38 274.2 31.38H207.7V160.2z"],firefox:[512,512,[],"f269","M503.5 241.5c-.12-1.56-.24-3.12-.24-4.68v-.12l-.36-4.68v-.12a245.9 245.9 0 0 0 -7.32-41.15c0-.12 0-.12-.12-.24l-1.08-4c-.12-.24-.12-.48-.24-.6-.36-1.2-.72-2.52-1.08-3.72-.12-.24-.12-.6-.24-.84-.36-1.2-.72-2.4-1.08-3.48-.12-.36-.24-.6-.36-1-.36-1.2-.72-2.28-1.2-3.48l-.36-1.08c-.36-1.08-.84-2.28-1.2-3.36a8.27 8.27 0 0 0 -.36-1c-.48-1.08-.84-2.28-1.32-3.36-.12-.24-.24-.6-.36-.84-.48-1.2-1-2.28-1.44-3.48 0-.12-.12-.24-.12-.36-1.56-3.84-3.24-7.68-5-11.4l-.36-.72c-.48-1-.84-1.8-1.32-2.64-.24-.48-.48-1.08-.72-1.56-.36-.84-.84-1.56-1.2-2.4-.36-.6-.6-1.2-1-1.8s-.84-1.44-1.2-2.28c-.36-.6-.72-1.32-1.08-1.92s-.84-1.44-1.2-2.16a18.07 18.07 0 0 0 -1.2-2c-.36-.72-.84-1.32-1.2-2s-.84-1.32-1.2-2-.84-1.32-1.2-1.92-.84-1.44-1.32-2.16a15.63 15.63 0 0 0 -1.2-1.8L463.2 119a15.63 15.63 0 0 0 -1.2-1.8c-.48-.72-1.08-1.56-1.56-2.28-.36-.48-.72-1.08-1.08-1.56l-1.8-2.52c-.36-.48-.6-.84-1-1.32-1-1.32-1.8-2.52-2.76-3.72a248.8 248.8 0 0 0 -23.51-26.64A186.8 186.8 0 0 0 412 62.46c-4-3.48-8.16-6.72-12.48-9.84a162.5 162.5 0 0 0 -24.6-15.12c-2.4-1.32-4.8-2.52-7.2-3.72a254 254 0 0 0 -55.43-19.56c-1.92-.36-3.84-.84-5.64-1.2h-.12c-1-.12-1.8-.36-2.76-.48a236.4 236.4 0 0 0 -38-4H255.1a234.6 234.6 0 0 0 -45.48 5c-33.59 7.08-63.23 21.24-82.91 39-1.08 1-1.92 1.68-2.4 2.16l-.48 .48H124l-.12 .12 .12-.12a.12 .12 0 0 0 .12-.12l-.12 .12a.42 .42 0 0 1 .24-.12c14.64-8.76 34.92-16 49.44-19.56l5.88-1.44c.36-.12 .84-.12 1.2-.24 1.68-.36 3.36-.72 5.16-1.08 .24 0 .6-.12 .84-.12C250.9 20.94 319.3 40.14 367 85.61a171.5 171.5 0 0 1 26.88 32.76c30.36 49.2 27.48 111.1 3.84 147.6-34.44 53-111.3 71.27-159 24.84a84.19 84.19 0 0 1 -25.56-59 74.05 74.05 0 0 1 6.24-31c1.68-3.84 13.08-25.67 18.24-24.59-13.08-2.76-37.55 2.64-54.71 28.19-15.36 22.92-14.52 58.2-5 83.28a132.9 132.9 0 0 1 -12.12-39.24c-12.24-82.55 43.31-153 94.31-170.5-27.48-24-96.47-22.31-147.7 15.36-29.88 22-51.23 53.16-62.51 90.36 1.68-20.88 9.6-52.08 25.8-83.88-17.16 8.88-39 37-49.8 62.88-15.6 37.43-21 82.19-16.08 124.8 .36 3.24 .72 6.36 1.08 9.6 19.92 117.1 122 206.4 244.8 206.4C392.8 503.4 504 392.2 504 255 503.9 250.5 503.8 245.9 503.5 241.5z"],"firefox-browser":[512,512,[],"e007","M130.2 127.5C130.4 127.6 130.3 127.6 130.2 127.5V127.5zM481.6 172.9C471 147.4 449.6 119.9 432.7 111.2C446.4 138.1 454.4 165 457.4 185.2C457.4 185.3 457.4 185.4 457.5 185.6C429.9 116.8 383.1 89.11 344.9 28.75C329.9 5.058 333.1 3.518 331.8 4.088L331.7 4.158C284.1 30.11 256.4 82.53 249.1 126.9C232.5 127.8 216.2 131.9 201.2 139C199.8 139.6 198.7 140.7 198.1 142C197.4 143.4 197.2 144.9 197.5 146.3C197.7 147.2 198.1 147.1 198.6 148.6C199.1 149.3 199.8 149.9 200.5 150.3C201.3 150.7 202.1 150.1 202.1 151.1C203.8 151.1 204.7 151 205.5 150.8L206 150.6C221.5 143.3 238.4 139.4 255.5 139.2C318.4 138.7 352.7 183.3 363.2 201.5C350.2 192.4 326.8 183.3 304.3 187.2C392.1 231.1 368.5 381.8 246.1 376.4C187.5 373.8 149.9 325.5 146.4 285.6C146.4 285.6 157.7 243.7 227 243.7C234.5 243.7 255.1 222.8 256.4 216.7C256.3 214.7 213.8 197.8 197.3 181.5C188.4 172.8 184.2 168.6 180.5 165.5C178.5 163.8 176.4 162.2 174.2 160.7C168.6 141.2 168.4 120.6 173.5 101.1C148.4 112.5 128.1 130.5 114.8 146.4H114.7C105 134.2 105.7 93.78 106.3 85.35C106.1 84.82 99.02 89.02 98.1 89.66C89.53 95.71 81.55 102.6 74.26 110.1C57.97 126.7 30.13 160.2 18.76 211.3C14.22 231.7 12 255.7 12 263.6C12 398.3 121.2 507.5 255.9 507.5C376.6 507.5 478.9 420.3 496.4 304.9C507.9 228.2 481.6 173.8 481.6 172.9z"],"first-order":[448,512,[],"f2b0","M12.9 229.2c.1-.1 .2-.3 .3-.4 0 .1 0 .3-.1 .4h-.2zM224 96.6c-7.1 0-14.6 .6-21.4 1.7l3.7 67.4-22-64c-14.3 3.7-27.7 9.4-40 16.6l29.4 61.4-45.1-50.9c-11.4 8.9-21.7 19.1-30.6 30.9l50.6 45.4-61.1-29.7c-7.1 12.3-12.9 25.7-16.6 40l64.3 22.6-68-4c-.9 7.1-1.4 14.6-1.4 22s.6 14.6 1.4 21.7l67.7-4-64 22.6c3.7 14.3 9.4 27.7 16.6 40.3l61.1-29.7L97.7 352c8.9 11.7 19.1 22.3 30.9 30.9l44.9-50.9-29.5 61.4c12.3 7.4 25.7 13.1 40 16.9l22.3-64.6-4 68c7.1 1.1 14.6 1.7 21.7 1.7 7.4 0 14.6-.6 21.7-1.7l-4-68.6 22.6 65.1c14.3-4 27.7-9.4 40-16.9L274.9 332l44.9 50.9c11.7-8.9 22-19.1 30.6-30.9l-50.6-45.1 61.1 29.4c7.1-12.3 12.9-25.7 16.6-40.3l-64-22.3 67.4 4c1.1-7.1 1.4-14.3 1.4-21.7s-.3-14.9-1.4-22l-67.7 4 64-22.3c-3.7-14.3-9.1-28-16.6-40.3l-60.9 29.7 50.6-45.4c-8.9-11.7-19.1-22-30.6-30.9l-45.1 50.9 29.4-61.1c-12.3-7.4-25.7-13.1-40-16.9L241.7 166l4-67.7c-7.1-1.2-14.3-1.7-21.7-1.7zM443.4 128v256L224 512 4.6 384V128L224 0l219.4 128zm-17.1 10.3L224 20.9 21.7 138.3v235.1L224 491.1l202.3-117.7V138.3zM224 37.1l187.7 109.4v218.9L224 474.9 36.3 365.4V146.6L224 37.1zm0 50.9c-92.3 0-166.9 75.1-166.9 168 0 92.6 74.6 167.7 166.9 167.7 92 0 166.9-75.1 166.9-167.7 0-92.9-74.9-168-166.9-168z"],"first-order-alt":[496,512,[],"f50a","M248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S384.1 8 248 8zm0 488.2C115.3 496.2 7.79 388.7 7.79 256S115.3 15.79 248 15.79 488.2 123.3 488.2 256 380.7 496.2 248 496.2zm0-459.9C126.7 36.29 28.29 134.7 28.29 256S126.7 475.7 248 475.7 467.7 377.3 467.7 256 369.3 36.29 248 36.29zm0 431.2c-116.8 0-211.5-94.69-211.5-211.5S131.2 44.49 248 44.49 459.5 139.2 459.5 256 364.8 467.5 248 467.5zm186.2-162.1a191.6 191.6 0 0 1 -20.13 48.69l-74.13-35.88 61.48 54.82a193.5 193.5 0 0 1 -37.2 37.29l-54.8-61.57 35.88 74.27a190.9 190.9 0 0 1 -48.63 20.23l-27.29-78.47 4.79 82.93c-8.61 1.18-17.4 1.8-26.33 1.8s-17.72-.62-26.33-1.8l4.76-82.46-27.15 78.03a191.4 191.4 0 0 1 -48.65-20.2l35.93-74.34-54.87 61.64a193.9 193.9 0 0 1 -37.22-37.28l61.59-54.9-74.26 35.93a191.6 191.6 0 0 1 -20.14-48.69l77.84-27.11-82.23 4.76c-1.16-8.57-1.78-17.32-1.78-26.21 0-9 .63-17.84 1.82-26.51l82.38 4.77-77.94-27.16a191.7 191.7 0 0 1 20.23-48.67l74.22 35.92-61.52-54.86a193.9 193.9 0 0 1 37.28-37.22l54.76 61.53-35.83-74.17a191.5 191.5 0 0 1 48.65-20.13l26.87 77.25-4.71-81.61c8.61-1.18 17.39-1.8 26.32-1.8s17.71 .62 26.32 1.8l-4.74 82.16 27.05-77.76c17.27 4.5 33.6 11.35 48.63 20.17l-35.82 74.12 54.72-61.47a193.1 193.1 0 0 1 37.24 37.23l-61.45 54.77 74.12-35.86a191.5 191.5 0 0 1 20.2 48.65l-77.81 27.1 82.24-4.75c1.19 8.66 1.82 17.5 1.82 26.49 0 8.88-.61 17.63-1.78 26.19l-82.12-4.75 77.72 27.09z"],firstdraft:[384,512,[],"f3a1","M384 192h-64v128H192v128H0v-25.6h166.4v-128h128v-128H384V192zm-25.6 38.4v128h-128v128H64V512h192V384h128V230.4h-25.6zm25.6 192h-89.6V512H320v-64h64v-25.6zM0 0v384h128V256h128V128h128V0H0z"],flickr:[448,512,[],"f16e","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM144.5 319c-35.1 0-63.5-28.4-63.5-63.5s28.4-63.5 63.5-63.5 63.5 28.4 63.5 63.5-28.4 63.5-63.5 63.5zm159 0c-35.1 0-63.5-28.4-63.5-63.5s28.4-63.5 63.5-63.5 63.5 28.4 63.5 63.5-28.4 63.5-63.5 63.5z"],flipboard:[448,512,[],"f44d","M0 32v448h448V32H0zm358.4 179.2h-89.6v89.6h-89.6v89.6H89.6V121.6h268.8v89.6z"],fly:[384,512,[],"f417","M197.8 427.8c12.9 11.7 33.7 33.3 33.2 50.7 0 .8-.1 1.6-.1 2.5-1.8 19.8-18.8 31.1-39.1 31-25-.1-39.9-16.8-38.7-35.8 1-16.2 20.5-36.7 32.4-47.6 2.3-2.1 2.7-2.7 5.6-3.6 3.4 0 3.9 .3 6.7 2.8zM331.9 67.3c-16.3-25.7-38.6-40.6-63.3-52.1C243.1 4.5 214-.2 192 0c-44.1 0-71.2 13.2-81.1 17.3C57.3 45.2 26.5 87.2 28 158.6c7.1 82.2 97 176 155.8 233.8 1.7 1.6 4.5 4.5 6.2 5.1l3.3 .1c2.1-.7 1.8-.5 3.5-2.1 52.3-49.2 140.7-145.8 155.9-215.7 7-39.2 3.1-72.5-20.8-112.5zM186.8 351.9c-28-51.1-65.2-130.7-69.3-189-3.4-47.5 11.4-131.2 69.3-136.7v325.7zM328.7 180c-16.4 56.8-77.3 128-118.9 170.3C237.6 298.4 275 217 277 158.4c1.6-45.9-9.8-105.8-48-131.4 88.8 18.3 115.5 98.1 99.7 153z"],"font-awesome":[448,512,[62694,62501,"font-awesome-flag","font-awesome-logo-full"],"f2b4","M448 48V384C385 407 366 416 329 416C266 416 242 384 179 384C159 384 143 388 128 392V328C143 324 159 320 179 320C242 320 266 352 329 352C349 352 364 349 384 343V135C364 141 349 144 329 144C266 144 242 112 179 112C128 112 104 133 64 141V448C64 466 50 480 32 480S0 466 0 448V64C0 46 14 32 32 32S64 46 64 64V77C104 69 128 48 179 48C242 48 266 80 329 80C366 80 385 71 448 48z"],fonticons:[448,512,[],"f280","M0 32v448h448V32zm187 140.9c-18.4 0-19 9.9-19 27.4v23.3c0 2.4-3.5 4.4-.6 4.4h67.4l-11.1 37.3H168v112.9c0 5.8-2 6.7 3.2 7.3l43.5 4.1v25.1H84V389l21.3-2c5.2-.6 6.7-2.3 6.7-7.9V267.7c0-2.3-2.9-2.3-5.8-2.3H84V228h28v-21c0-49.6 26.5-70 77.3-70 34.1 0 64.7 8.2 64.7 52.8l-50.7 6.1c.3-18.7-4.4-23-16.3-23zm74.3 241.8v-25.1l20.4-2.6c5.2-.6 7.6-1.7 7.6-7.3V271.8c0-4.1-2.9-6.7-6.7-7.9l-24.2-6.4 6.7-29.5h80.2v151.7c0 5.8-2.6 6.4 2.9 7.3l15.7 2.6v25.1zm80.8-255.5l9 33.2-7.3 7.3-31.2-16.6-31.2 16.6-7.3-7.3 9-33.2-21.8-24.2 3.5-9.6h27.7l15.5-28h9.3l15.5 28h27.7l3.5 9.6z"],"fonticons-fi":[384,512,[],"f3a2","M114.4 224h92.4l-15.2 51.2h-76.4V433c0 8-2.8 9.2 4.4 10l59.6 5.6V483H0v-35.2l29.2-2.8c7.2-.8 9.2-3.2 9.2-10.8V278.4c0-3.2-4-3.2-8-3.2H0V224h38.4v-28.8c0-68 36.4-96 106-96 46.8 0 88.8 11.2 88.8 72.4l-69.6 8.4c.4-25.6-6-31.6-22.4-31.6-25.2 0-26 13.6-26 37.6v32c0 3.2-4.8 6-.8 6zM384 483H243.2v-34.4l28-3.6c7.2-.8 10.4-2.4 10.4-10V287c0-5.6-4-9.2-9.2-10.8l-33.2-8.8 9.2-40.4h110v208c0 8-3.6 8.8 4 10l21.6 3.6V483zm-30-347.2l12.4 45.6-10 10-42.8-22.8-42.8 22.8-10-10 12.4-45.6-30-36.4 4.8-10h38L307.2 51H320l21.2 38.4h38l4.8 13.2-30 33.2z"],"fort-awesome":[512,512,[],"f286","M489.2 287.9h-27.4c-2.6 0-4.6 2-4.6 4.6v32h-36.6V146.2c0-2.6-2-4.6-4.6-4.6h-27.4c-2.6 0-4.6 2-4.6 4.6v32h-36.6v-32c0-2.6-2-4.6-4.6-4.6h-27.4c-2.6 0-4.6 2-4.6 4.6v32h-36.6v-32c0-6-8-4.6-11.7-4.6v-38c8.3-2 17.1-3.4 25.7-3.4 10.9 0 20.9 4.3 31.4 4.3 4.6 0 27.7-1.1 27.7-8v-60c0-2.6-2-4.6-4.6-4.6-5.1 0-15.1 4.3-24 4.3-9.7 0-20.9-4.3-32.6-4.3-8 0-16 1.1-23.7 2.9v-4.9c5.4-2.6 9.1-8.3 9.1-14.3 0-20.7-31.4-20.8-31.4 0 0 6 3.7 11.7 9.1 14.3v111.7c-3.7 0-11.7-1.4-11.7 4.6v32h-36.6v-32c0-2.6-2-4.6-4.6-4.6h-27.4c-2.6 0-4.6 2-4.6 4.6v32H128v-32c0-2.6-2-4.6-4.6-4.6H96c-2.6 0-4.6 2-4.6 4.6v178.3H54.8v-32c0-2.6-2-4.6-4.6-4.6H22.8c-2.6 0-4.6 2-4.6 4.6V512h182.9v-96c0-72.6 109.7-72.6 109.7 0v96h182.9V292.5c.1-2.6-1.9-4.6-4.5-4.6zm-288.1-4.5c0 2.6-2 4.6-4.6 4.6h-27.4c-2.6 0-4.6-2-4.6-4.6v-64c0-2.6 2-4.6 4.6-4.6h27.4c2.6 0 4.6 2 4.6 4.6v64zm146.4 0c0 2.6-2 4.6-4.6 4.6h-27.4c-2.6 0-4.6-2-4.6-4.6v-64c0-2.6 2-4.6 4.6-4.6h27.4c2.6 0 4.6 2 4.6 4.6v64z"],"fort-awesome-alt":[512,512,[],"f3a3","M208 237.4h-22.2c-2.1 0-3.7 1.6-3.7 3.7v51.7c0 2.1 1.6 3.7 3.7 3.7H208c2.1 0 3.7-1.6 3.7-3.7v-51.7c0-2.1-1.6-3.7-3.7-3.7zm118.2 0H304c-2.1 0-3.7 1.6-3.7 3.7v51.7c0 2.1 1.6 3.7 3.7 3.7h22.2c2.1 0 3.7-1.6 3.7-3.7v-51.7c-.1-2.1-1.7-3.7-3.7-3.7zm132-125.1c-2.3-3.2-4.6-6.4-7.1-9.5-9.8-12.5-20.8-24-32.8-34.4-4.5-3.9-9.1-7.6-13.9-11.2-1.6-1.2-3.2-2.3-4.8-3.5C372 34.1 340.3 20 306 13c-16.2-3.3-32.9-5-50-5s-33.9 1.7-50 5c-34.3 7.1-66 21.2-93.3 40.8-1.6 1.1-3.2 2.3-4.8 3.5-4.8 3.6-9.4 7.3-13.9 11.2-3 2.6-5.9 5.3-8.8 8s-5.7 5.5-8.4 8.4c-5.5 5.7-10.7 11.8-15.6 18-2.4 3.1-4.8 6.3-7.1 9.5C25.2 153 8.3 202.5 8.3 256c0 2 .1 4 .1 6 .1 .7 .1 1.3 .1 2 .1 1.3 .1 2.7 .2 4 0 .8 .1 1.5 .1 2.3 0 1.3 .1 2.5 .2 3.7 .1 .8 .1 1.6 .2 2.4 .1 1.1 .2 2.3 .3 3.5 0 .8 .1 1.6 .2 2.4 .1 1.2 .3 2.4 .4 3.6 .1 .8 .2 1.5 .3 2.3 .1 1.3 .3 2.6 .5 3.9 .1 .6 .2 1.3 .3 1.9l.9 5.7c.1 .6 .2 1.1 .3 1.7 .3 1.3 .5 2.7 .8 4 .2 .8 .3 1.6 .5 2.4 .2 1 .5 2.1 .7 3.2 .2 .9 .4 1.7 .6 2.6 .2 1 .4 2 .7 3 .2 .9 .5 1.8 .7 2.7 .3 1 .5 1.9 .8 2.9 .3 .9 .5 1.8 .8 2.7 .2 .9 .5 1.9 .8 2.8s.5 1.8 .8 2.7c.3 1 .6 1.9 .9 2.8 .6 1.6 1.1 3.3 1.7 4.9 .4 1 .7 1.9 1 2.8 .3 1 .7 2 1.1 3 .3 .8 .6 1.5 .9 2.3l1.2 3c.3 .7 .6 1.5 .9 2.2 .4 1 .9 2 1.3 3l.9 2.1c.5 1 .9 2 1.4 3 .3 .7 .6 1.3 .9 2 .5 1 1 2.1 1.5 3.1 .2 .6 .5 1.1 .8 1.7 .6 1.1 1.1 2.2 1.7 3.3 .1 .2 .2 .3 .3 .5 2.2 4.1 4.4 8.2 6.8 12.2 .2 .4 .5 .8 .7 1.2 .7 1.1 1.3 2.2 2 3.3 .3 .5 .6 .9 .9 1.4 .6 1.1 1.3 2.1 2 3.2 .3 .5 .6 .9 .9 1.4 .7 1.1 1.4 2.1 2.1 3.2 .2 .4 .5 .8 .8 1.2 .7 1.1 1.5 2.2 2.3 3.3 .2 .2 .3 .5 .5 .7 37.5 51.7 94.4 88.5 160 99.4 .9 .1 1.7 .3 2.6 .4 1 .2 2.1 .4 3.1 .5s1.9 .3 2.8 .4c1 .2 2 .3 3 .4 .9 .1 1.9 .2 2.9 .3s1.9 .2 2.9 .3 2.1 .2 3.1 .3c.9 .1 1.8 .1 2.7 .2 1.1 .1 2.3 .1 3.4 .2 .8 0 1.7 .1 2.5 .1 1.3 0 2.6 .1 3.9 .1 .7 .1 1.4 .1 2.1 .1 2 .1 4 .1 6 .1s4-.1 6-.1c.7 0 1.4-.1 2.1-.1 1.3 0 2.6 0 3.9-.1 .8 0 1.7-.1 2.5-.1 1.1-.1 2.3-.1 3.4-.2 .9 0 1.8-.1 2.7-.2 1-.1 2.1-.2 3.1-.3s1.9-.2 2.9-.3c.9-.1 1.9-.2 2.9-.3s2-.3 3-.4 1.9-.3 2.8-.4c1-.2 2.1-.3 3.1-.5 .9-.1 1.7-.3 2.6-.4 65.6-11 122.5-47.7 160.1-102.4 .2-.2 .3-.5 .5-.7 .8-1.1 1.5-2.2 2.3-3.3 .2-.4 .5-.8 .8-1.2 .7-1.1 1.4-2.1 2.1-3.2 .3-.5 .6-.9 .9-1.4 .6-1.1 1.3-2.1 2-3.2 .3-.5 .6-.9 .9-1.4 .7-1.1 1.3-2.2 2-3.3 .2-.4 .5-.8 .7-1.2 2.4-4 4.6-8.1 6.8-12.2 .1-.2 .2-.3 .3-.5 .6-1.1 1.1-2.2 1.7-3.3 .2-.6 .5-1.1 .8-1.7 .5-1 1-2.1 1.5-3.1 .3-.7 .6-1.3 .9-2 .5-1 1-2 1.4-3l.9-2.1c.5-1 .9-2 1.3-3 .3-.7 .6-1.5 .9-2.2l1.2-3c.3-.8 .6-1.5 .9-2.3 .4-1 .7-2 1.1-3s.7-1.9 1-2.8c.6-1.6 1.2-3.3 1.7-4.9 .3-1 .6-1.9 .9-2.8s.5-1.8 .8-2.7c.2-.9 .5-1.9 .8-2.8s.6-1.8 .8-2.7c.3-1 .5-1.9 .8-2.9 .2-.9 .5-1.8 .7-2.7 .2-1 .5-2 .7-3 .2-.9 .4-1.7 .6-2.6 .2-1 .5-2.1 .7-3.2 .2-.8 .3-1.6 .5-2.4 .3-1.3 .6-2.7 .8-4 .1-.6 .2-1.1 .3-1.7l.9-5.7c.1-.6 .2-1.3 .3-1.9 .1-1.3 .3-2.6 .5-3.9 .1-.8 .2-1.5 .3-2.3 .1-1.2 .3-2.4 .4-3.6 0-.8 .1-1.6 .2-2.4 .1-1.1 .2-2.3 .3-3.5 .1-.8 .1-1.6 .2-2.4 .1 1.7 .1 .5 .2-.7 0-.8 .1-1.5 .1-2.3 .1-1.3 .2-2.7 .2-4 .1-.7 .1-1.3 .1-2 .1-2 .1-4 .1-6 0-53.5-16.9-103-45.8-143.7zM448 371.5c-9.4 15.5-20.6 29.9-33.6 42.9-20.6 20.6-44.5 36.7-71.2 48-13.9 5.8-28.2 10.3-42.9 13.2v-75.8c0-58.6-88.6-58.6-88.6 0v75.8c-14.7-2.9-29-7.3-42.9-13.2-26.7-11.3-50.6-27.4-71.2-48-13-13-24.2-27.4-33.6-42.9v-71.3c0-2.1 1.6-3.7 3.7-3.7h22.1c2.1 0 3.7 1.6 3.7 3.7V326h29.6V182c0-2.1 1.6-3.7 3.7-3.7h22.1c2.1 0 3.7 1.6 3.7 3.7v25.9h29.5V182c0-2.1 1.6-3.7 3.7-3.7H208c2.1 0 3.7 1.6 3.7 3.7v25.9h29.5V182c0-4.8 6.5-3.7 9.5-3.7V88.1c-4.4-2-7.4-6.7-7.4-11.5 0-16.8 25.4-16.8 25.4 0 0 4.8-3 9.4-7.4 11.5V92c6.3-1.4 12.7-2.3 19.2-2.3 9.4 0 18.4 3.5 26.3 3.5 7.2 0 15.2-3.5 19.4-3.5 2.1 0 3.7 1.6 3.7 3.7v48.4c0 5.6-18.7 6.5-22.4 6.5-8.6 0-16.6-3.5-25.4-3.5-7 0-14.1 1.2-20.8 2.8v30.7c3 0 9.5-1.1 9.5 3.7v25.9h29.5V182c0-2.1 1.6-3.7 3.7-3.7h22.2c2.1 0 3.7 1.6 3.7 3.7v25.9h29.5V182c0-2.1 1.6-3.7 3.7-3.7h22.1c2.1 0 3.7 1.6 3.7 3.7v144h29.5v-25.8c0-2.1 1.6-3.7 3.7-3.7h22.2c2.1 0 3.7 1.6 3.7 3.7z"],forumbee:[448,512,[],"f211","M5.8 309.7C2 292.7 0 275.5 0 258.3 0 135 99.8 35 223.1 35c16.6 0 33.3 2 49.3 5.5C149 87.5 51.9 186 5.8 309.7zm392.9-189.2C385 103 369 87.8 350.9 75.2c-149.6 44.3-266.3 162.1-309.7 312 12.5 18.1 28 35.6 45.2 49 43.1-151.3 161.2-271.7 312.3-315.7zm15.8 252.7c15.2-25.1 25.4-53.7 29.5-82.8-79.4 42.9-145 110.6-187.6 190.3 30-4.4 58.9-15.3 84.6-31.3 35 13.1 70.9 24.3 107 33.6-9.3-36.5-20.4-74.5-33.5-109.8zm29.7-145.5c-2.6-19.5-7.9-38.7-15.8-56.8C290.5 216.7 182 327.5 137.1 466c18.1 7.6 37 12.5 56.6 15.2C240 367.1 330.5 274.4 444.2 227.7z"],foursquare:[368,512,[],"f180","M323.1 3H49.9C12.4 3 0 31.3 0 49.1v433.8c0 20.3 12.1 27.7 18.2 30.1 6.2 2.5 22.8 4.6 32.9-7.1C180 356.5 182.2 354 182.2 354c3.1-3.4 3.4-3.1 6.8-3.1h83.4c35.1 0 40.6-25.2 44.3-39.7l48.6-243C373.8 25.8 363.1 3 323.1 3zm-16.3 73.8l-11.4 59.7c-1.2 6.5-9.5 13.2-16.9 13.2H172.1c-12 0-20.6 8.3-20.6 20.3v13c0 12 8.6 20.6 20.6 20.6h90.4c8.3 0 16.6 9.2 14.8 18.2-1.8 8.9-10.5 53.8-11.4 58.8-.9 4.9-6.8 13.5-16.9 13.5h-73.5c-13.5 0-17.2 1.8-26.5 12.6 0 0-8.9 11.4-89.5 108.3-.9 .9-1.8 .6-1.8-.3V75.9c0-7.7 6.8-16.6 16.6-16.6h219c8.2 0 15.6 7.7 13.5 17.5z"],"free-code-camp":[576,512,[],"f2c5","M97.22 96.21c10.36-10.65 16-17.12 16-21.9 0-2.76-1.92-5.51-3.83-7.42A14.81 14.81 0 0 0 101 64.05c-8.48 0-20.92 8.79-35.84 25.69C23.68 137 2.51 182.8 3.37 250.3s17.47 117 54.06 161.9C76.22 435.9 90.62 448 100.9 448a13.55 13.55 0 0 0 8.37-3.84c1.91-2.76 3.81-5.63 3.81-8.38 0-5.63-3.86-12.2-13.2-20.55-44.45-42.33-67.32-97-67.48-165C32.25 188.8 54 137.8 97.22 96.21zM239.5 420.1c.58 .37 .91 .55 .91 .55zm93.79 .55 .17-.13C333.2 420.6 333.2 420.7 333.3 420.6zm3.13-158.2c-16.24-4.15 50.41-82.89-68.05-177.2 0 0 15.54 49.38-62.83 159.6-74.27 104.3 23.46 168.7 34 175.2-6.73-4.35-47.4-35.7 9.55-128.6 11-18.3 25.53-34.87 43.5-72.16 0 0 15.91 22.45 7.6 71.13C287.7 364 354 342.9 355 343.9c22.75 26.78-17.72 73.51-21.58 76.55 5.49-3.65 117.7-78 33-188.1C360.4 238.4 352.6 266.6 336.4 262.4zM510.9 89.69C496 72.79 483.5 64 475 64a14.81 14.81 0 0 0 -8.39 2.84c-1.91 1.91-3.83 4.66-3.83 7.42 0 4.78 5.6 11.26 16 21.9 43.23 41.61 65 92.59 64.82 154.1-.16 68-23 122.6-67.48 165-9.34 8.35-13.18 14.92-13.2 20.55 0 2.75 1.9 5.62 3.81 8.38A13.61 13.61 0 0 0 475.1 448c10.28 0 24.68-12.13 43.47-35.79 36.59-44.85 53.14-94.38 54.06-161.9S552.3 137 510.9 89.69z"],freebsd:[448,512,[],"f3a4","M303.7 96.2c11.1-11.1 115.5-77 139.2-53.2 23.7 23.7-42.1 128.1-53.2 139.2-11.1 11.1-39.4 .9-63.1-22.9-23.8-23.7-34.1-52-22.9-63.1zM109.9 68.1C73.6 47.5 22 24.6 5.6 41.1c-16.6 16.6 7.1 69.4 27.9 105.7 18.5-32.2 44.8-59.3 76.4-78.7zM406.7 174c3.3 11.3 2.7 20.7-2.7 26.1-20.3 20.3-87.5-27-109.3-70.1-18-32.3-11.1-53.4 14.9-48.7 5.7-3.6 12.3-7.6 19.6-11.6-29.8-15.5-63.6-24.3-99.5-24.3-119.1 0-215.6 96.5-215.6 215.6 0 119 96.5 215.6 215.6 215.6S445.3 380.1 445.3 261c0-38.4-10.1-74.5-27.7-105.8-3.9 7-7.6 13.3-10.9 18.8z"],fulcrum:[320,512,[],"f50b","M95.75 164.1l-35.38 43.55L25 164.1l35.38-43.55zM144.2 0l-20.54 198.2L72.72 256l51 57.82L144.2 512V300.9L103.2 256l41.08-44.89zm79.67 164.1l35.38 43.55 35.38-43.55-35.38-43.55zm-48.48 47L216.5 256l-41.08 44.89V512L196 313.8 247 256l-51-57.82L175.4 0z"],"galactic-republic":[496,512,[],"f50c","M248 504C111.3 504 0 392.8 0 256S111.3 8 248 8s248 111.3 248 248-111.3 248-248 248zm0-479.5C120.4 24.53 16.53 128.4 16.53 256S120.4 487.5 248 487.5 479.5 383.6 479.5 256 375.6 24.53 248 24.53zm27.62 21.81v24.62a185.9 185.9 0 0 1 83.57 34.54l17.39-17.36c-28.75-22.06-63.3-36.89-100.1-41.8zm-55.37 .07c-37.64 4.94-72.16 19.8-100.9 41.85l17.28 17.36h.08c24.07-17.84 52.55-30.06 83.52-34.67V46.41zm12.25 50.17v82.87c-10.04 2.03-19.42 5.94-27.67 11.42l-58.62-58.59-21.93 21.93 58.67 58.67c-5.47 8.23-9.45 17.59-11.47 27.62h-82.9v31h82.9c2.02 10.02 6.01 19.31 11.47 27.54l-58.67 58.69 21.93 21.93 58.62-58.62a77.87 77.87 0 0 0 27.67 11.47v82.9h31v-82.9c10.05-2.03 19.37-6.06 27.62-11.55l58.67 58.69 21.93-21.93-58.67-58.69c5.46-8.23 9.47-17.52 11.5-27.54h82.87v-31h-82.87c-2.02-10.02-6.03-19.38-11.5-27.62l58.67-58.67-21.93-21.93-58.67 58.67c-8.25-5.49-17.57-9.47-27.62-11.5V96.58h-31zm183.2 30.72l-17.36 17.36a186.3 186.3 0 0 1 34.67 83.67h24.62c-4.95-37.69-19.83-72.29-41.93-101zm-335.5 .13c-22.06 28.72-36.91 63.26-41.85 100.9h24.65c4.6-30.96 16.76-59.45 34.59-83.52l-17.39-17.39zM38.34 283.7c4.92 37.64 19.75 72.18 41.8 100.9l17.36-17.39c-17.81-24.07-29.92-52.57-34.51-83.52H38.34zm394.7 0c-4.61 30.99-16.8 59.5-34.67 83.6l17.36 17.36c22.08-28.74 36.98-63.29 41.93-100.1h-24.62zM136.7 406.4l-17.36 17.36c28.73 22.09 63.3 36.98 100.1 41.93v-24.64c-30.99-4.63-59.53-16.79-83.6-34.65zm222.5 .05c-24.09 17.84-52.58 30.08-83.57 34.67v24.57c37.67-4.92 72.21-19.79 100.1-41.85l-17.31-17.39h-.08z"],"galactic-senate":[512,512,[],"f50d","M249.9 33.48v26.07C236.3 80.17 226 168.1 225.4 274.9c11.74-15.62 19.13-33.33 19.13-48.24v-16.88c-.03-5.32 .75-10.53 2.19-15.65 .65-2.14 1.39-4.08 2.62-5.82 1.23-1.75 3.43-3.79 6.68-3.79 3.24 0 5.45 2.05 6.68 3.79 1.23 1.75 1.97 3.68 2.62 5.82 1.44 5.12 2.22 10.33 2.19 15.65v16.88c0 14.91 7.39 32.62 19.13 48.24-.63-106.8-10.91-194.7-24.49-215.4V33.48h-12.28zm-26.34 147.8c-9.52 2.15-18.7 5.19-27.46 9.08 8.9 16.12 9.76 32.64 1.71 37.29-8 4.62-21.85-4.23-31.36-19.82-11.58 8.79-21.88 19.32-30.56 31.09 14.73 9.62 22.89 22.92 18.32 30.66-4.54 7.7-20.03 7.14-35.47-.96-5.78 13.25-9.75 27.51-11.65 42.42 9.68 .18 18.67 2.38 26.18 6.04 17.78-.3 32.77-1.96 40.49-4.22 5.55-26.35 23.02-48.23 46.32-59.51 .73-25.55 1.88-49.67 3.48-72.07zm64.96 0c1.59 22.4 2.75 46.52 3.47 72.07 23.29 11.28 40.77 33.16 46.32 59.51 7.72 2.26 22.71 3.92 40.49 4.22 7.51-3.66 16.5-5.85 26.18-6.04-1.9-14.91-5.86-29.17-11.65-42.42-15.44 8.1-30.93 8.66-35.47 .96-4.57-7.74 3.6-21.05 18.32-30.66-8.68-11.77-18.98-22.3-30.56-31.09-9.51 15.59-23.36 24.44-31.36 19.82-8.05-4.65-7.19-21.16 1.71-37.29a147.5 147.5 0 0 0 -27.45-9.08zm-32.48 8.6c-3.23 0-5.86 8.81-6.09 19.93h-.05v16.88c0 41.42-49.01 95.04-93.49 95.04-52 0-122.8-1.45-156.4 29.17v2.51c9.42 17.12 20.58 33.17 33.18 47.97C45.7 380.3 84.77 360.4 141.2 360c45.68 1.02 79.03 20.33 90.76 40.87 .01 .01-.01 .04 0 .05 7.67 2.14 15.85 3.23 24.04 3.21 8.19 .02 16.37-1.07 24.04-3.21 .01-.01-.01-.04 0-.05 11.74-20.54 45.08-39.85 90.76-40.87 56.43 .39 95.49 20.26 108 41.35 12.6-14.8 23.76-30.86 33.18-47.97v-2.51c-33.61-30.62-104.4-29.17-156.4-29.17-44.48 0-93.49-53.62-93.49-95.04v-16.88h-.05c-.23-11.12-2.86-19.93-6.09-19.93zm0 96.59c22.42 0 40.6 18.18 40.6 40.6s-18.18 40.65-40.6 40.65-40.6-18.23-40.6-40.65c0-22.42 18.18-40.6 40.6-40.6zm0 7.64c-18.19 0-32.96 14.77-32.96 32.96S237.8 360 256 360s32.96-14.77 32.96-32.96-14.77-32.96-32.96-32.96zm0 6.14c14.81 0 26.82 12.01 26.82 26.82s-12.01 26.82-26.82 26.82-26.82-12.01-26.82-26.82 12.01-26.82 26.82-26.82zm-114.8 66.67c-10.19 .07-21.6 .36-30.5 1.66 .43 4.42 1.51 18.63 7.11 29.76 9.11-2.56 18.36-3.9 27.62-3.9 41.28 .94 71.48 34.35 78.26 74.47l.11 4.7c10.4 1.91 21.19 2.94 32.21 2.94 11.03 0 21.81-1.02 32.21-2.94l.11-4.7c6.78-40.12 36.98-73.53 78.26-74.47 9.26 0 18.51 1.34 27.62 3.9 5.6-11.13 6.68-25.34 7.11-29.76-8.9-1.3-20.32-1.58-30.5-1.66-18.76 .42-35.19 4.17-48.61 9.67-12.54 16.03-29.16 30.03-49.58 33.07-.09 .02-.17 .04-.27 .05-.05 .01-.11 .04-.16 .05-5.24 1.07-10.63 1.6-16.19 1.6-5.55 0-10.95-.53-16.19-1.6-.05-.01-.11-.04-.16-.05-.1-.02-.17-.04-.27-.05-20.42-3.03-37.03-17.04-49.58-33.07-13.42-5.49-29.86-9.25-48.61-9.67z"],"get-pocket":[448,512,[],"f265","M407.6 64h-367C18.5 64 0 82.5 0 104.6v135.2C0 364.5 99.7 464 224.2 464c124 0 223.8-99.5 223.8-224.2V104.6c0-22.4-17.7-40.6-40.4-40.6zm-162 268.5c-12.4 11.8-31.4 11.1-42.4 0C89.5 223.6 88.3 227.4 88.3 209.3c0-16.9 13.8-30.7 30.7-30.7 17 0 16.1 3.8 105.2 89.3 90.6-86.9 88.6-89.3 105.5-89.3 16.9 0 30.7 13.8 30.7 30.7 0 17.8-2.9 15.7-114.8 123.2z"],gg:[512,512,[],"f260","M179.2 230.4l102.4 102.4-102.4 102.4L0 256 179.2 76.8l44.8 44.8-25.6 25.6-19.2-19.2-128 128 128 128 51.5-51.5-77.1-76.5 25.6-25.6zM332.8 76.8L230.4 179.2l102.4 102.4 25.6-25.6-77.1-76.5 51.5-51.5 128 128-128 128-19.2-19.2-25.6 25.6 44.8 44.8L512 256 332.8 76.8z"],"gg-circle":[512,512,[],"f261","M257 8C120 8 9 119 9 256s111 248 248 248 248-111 248-248S394 8 257 8zm-49.5 374.8L81.8 257.1l125.7-125.7 35.2 35.4-24.2 24.2-11.1-11.1-77.2 77.2 77.2 77.2 26.6-26.6-53.1-52.9 24.4-24.4 77.2 77.2-75 75.2zm99-2.2l-35.2-35.2 24.1-24.4 11.1 11.1 77.2-77.2-77.2-77.2-26.5 26.5 53.1 52.9-24.4 24.4-77.2-77.2 75-75L432.2 255 306.5 380.6z"],git:[512,512,[],"f1d3","M216.3 158.4H137C97 147.9 6.51 150.6 6.51 233.2c0 30.09 15 51.23 35 61-25.1 23-37 33.85-37 49.21 0 11 4.47 21.14 17.89 26.81C8.13 383.6 0 393.4 0 411.6c0 32.11 28.05 50.82 101.6 50.82 70.75 0 111.8-26.42 111.8-73.18 0-58.66-45.16-56.5-151.6-63l13.43-21.55c27.27 7.58 118.7 10 118.7-67.89 0-18.7-7.73-31.71-15-41.07l37.41-2.84zm-63.42 241.9c0 32.06-104.9 32.1-104.9 2.43 0-8.14 5.27-15 10.57-21.54 77.71 5.3 94.32 3.37 94.32 19.11zm-50.81-134.6c-52.8 0-50.46-71.16 1.2-71.16 49.54 0 50.82 71.16-1.2 71.16zm133.3 100.5v-32.1c26.75-3.66 27.24-2 27.24-11V203.6c0-8.5-2.05-7.38-27.24-16.26l4.47-32.92H324v168.7c0 6.51 .4 7.32 6.51 8.14l20.73 2.84v32.1zm52.45-244.3c-23.17 0-36.59-13.43-36.59-36.61s13.42-35.77 36.59-35.77c23.58 0 37 12.62 37 35.77s-13.42 36.61-37 36.61zM512 350.5c-17.49 8.53-43.1 16.26-66.28 16.26-48.38 0-66.67-19.5-66.67-65.46V194.8c0-5.42 1.05-4.06-31.71-4.06V154.5c35.78-4.07 50-22 54.47-66.27h38.63c0 65.83-1.34 61.81 3.26 61.81H501v40.65h-60.56v97.15c0 6.92-4.92 51.41 60.57 26.84z"],"git-alt":[448,512,[],"f841","M439.5 236.1L244 40.45a28.87 28.87 0 0 0 -40.81 0l-40.66 40.63 51.52 51.52c27.06-9.14 52.68 16.77 43.39 43.68l49.66 49.66c34.23-11.8 61.18 31 35.47 56.69-26.49 26.49-70.21-2.87-56-37.34L240.2 199v121.8c25.3 12.54 22.26 41.85 9.08 55a34.34 34.34 0 0 1 -48.55 0c-17.57-17.6-11.07-46.91 11.25-56v-123c-20.8-8.51-24.6-30.74-18.64-45L142.6 101 8.45 235.1a28.86 28.86 0 0 0 0 40.81l195.6 195.6a28.86 28.86 0 0 0 40.8 0l194.7-194.7a28.86 28.86 0 0 0 0-40.81z"],github:[496,512,[],"f09b","M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3 .3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5 .3-6.2 2.3zm44.2-1.7c-2.9 .7-4.9 2.6-4.6 4.9 .3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3 .7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3 .3 2.9 2.3 3.9 1.6 1 3.6 .7 4.3-.7 .7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3 .7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3 .7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"],"github-alt":[480,512,[],"f113","M186.1 328.7c0 20.9-10.9 55.1-36.7 55.1s-36.7-34.2-36.7-55.1 10.9-55.1 36.7-55.1 36.7 34.2 36.7 55.1zM480 278.2c0 31.9-3.2 65.7-17.5 95-37.9 76.6-142.1 74.8-216.7 74.8-75.8 0-186.2 2.7-225.6-74.8-14.6-29-20.2-63.1-20.2-95 0-41.9 13.9-81.5 41.5-113.6-5.2-15.8-7.7-32.4-7.7-48.8 0-21.5 4.9-32.3 14.6-51.8 45.3 0 74.3 9 108.8 36 29-6.9 58.8-10 88.7-10 27 0 54.2 2.9 80.4 9.2 34-26.7 63-35.2 107.8-35.2 9.8 19.5 14.6 30.3 14.6 51.8 0 16.4-2.6 32.7-7.7 48.2 27.5 32.4 39 72.3 39 114.2zm-64.3 50.5c0-43.9-26.7-82.6-73.5-82.6-18.9 0-37 3.4-56 6-14.9 2.3-29.8 3.2-45.1 3.2-15.2 0-30.1-.9-45.1-3.2-18.7-2.6-37-6-56-6-46.8 0-73.5 38.7-73.5 82.6 0 87.8 80.4 101.3 150.4 101.3h48.2c70.3 0 150.6-13.4 150.6-101.3zm-82.6-55.1c-25.8 0-36.7 34.2-36.7 55.1s10.9 55.1 36.7 55.1 36.7-34.2 36.7-55.1-10.9-55.1-36.7-55.1z"],gitkraken:[592,512,[],"f3a6","M565.7 118.1c-2.3-6.1-9.3-9.2-15.3-6.6-5.7 2.4-8.5 8.9-6.3 14.6 10.9 29 16.9 60.5 16.9 93.3 0 134.6-100.3 245.7-230.2 262.7V358.4c7.9-1.5 15.5-3.6 23-6.2v104c106.7-25.9 185.9-122.1 185.9-236.8 0-91.8-50.8-171.8-125.8-213.3-5.7-3.2-13-.9-15.9 5-2.7 5.5-.6 12.2 4.7 15.1 67.9 37.6 113.9 110 113.9 193.2 0 93.3-57.9 173.1-139.8 205.4v-92.2c14.2-4.5 24.9-17.7 24.9-33.5 0-13.1-6.8-24.4-17.3-30.5 8.3-79.5 44.5-58.6 44.5-83.9V170c0-38-87.9-161.8-129-164.7-2.5-.2-5-.2-7.6 0C251.1 8.3 163.2 132 163.2 170v14.8c0 25.3 36.3 4.3 44.5 83.9-10.6 6.1-17.3 17.4-17.3 30.5 0 15.8 10.6 29 24.8 33.5v92.2c-81.9-32.2-139.8-112-139.8-205.4 0-83.1 46-155.5 113.9-193.2 5.4-3 7.4-9.6 4.7-15.1-2.9-5.9-10.1-8.2-15.9-5-75 41.5-125.8 121.5-125.8 213.3 0 114.7 79.2 210.8 185.9 236.8v-104c7.6 2.5 15.1 4.6 23 6.2v123.7C131.4 465.2 31 354.1 31 219.5c0-32.8 6-64.3 16.9-93.3 2.2-5.8-.6-12.2-6.3-14.6-6-2.6-13 .4-15.3 6.6C14.5 149.7 8 183.8 8 219.5c0 155.1 122.6 281.6 276.3 287.8V361.4c6.8 .4 15 .5 23.4 0v145.8C461.4 501.1 584 374.6 584 219.5c0-35.7-6.5-69.8-18.3-101.4zM365.9 275.5c13 0 23.7 10.5 23.7 23.7 0 13.1-10.6 23.7-23.7 23.7-13 0-23.7-10.5-23.7-23.7 0-13.1 10.6-23.7 23.7-23.7zm-139.8 47.3c-13.2 0-23.7-10.7-23.7-23.7s10.5-23.7 23.7-23.7c13.1 0 23.7 10.6 23.7 23.7 0 13-10.5 23.7-23.7 23.7z"],gitlab:[512,512,[],"f296","M503.5 204.6L502.8 202.8L433.1 21.02C431.7 17.45 429.2 14.43 425.9 12.38C423.5 10.83 420.8 9.865 417.9 9.57C415 9.275 412.2 9.653 409.5 10.68C406.8 11.7 404.4 13.34 402.4 15.46C400.5 17.58 399.1 20.13 398.3 22.9L351.3 166.9H160.8L113.7 22.9C112.9 20.13 111.5 17.59 109.6 15.47C107.6 13.35 105.2 11.72 102.5 10.7C99.86 9.675 96.98 9.295 94.12 9.587C91.26 9.878 88.51 10.83 86.08 12.38C82.84 14.43 80.33 17.45 78.92 21.02L9.267 202.8L8.543 204.6C-1.484 230.8-2.72 259.6 5.023 286.6C12.77 313.5 29.07 337.3 51.47 354.2L51.74 354.4L52.33 354.8L158.3 434.3L210.9 474L242.9 498.2C246.6 500.1 251.2 502.5 255.9 502.5C260.6 502.5 265.2 500.1 268.9 498.2L300.9 474L353.5 434.3L460.2 354.4L460.5 354.1C482.9 337.2 499.2 313.5 506.1 286.6C514.7 259.6 513.5 230.8 503.5 204.6z"],gitter:[384,512,[],"f426","M66.4 322.5H16V0h50.4v322.5zM166.9 76.1h-50.4V512h50.4V76.1zm100.6 0h-50.4V512h50.4V76.1zM368 76h-50.4v247H368V76z"],glide:[448,512,[],"f2a5","M252.8 148.6c0 8.8-1.6 17.7-3.4 26.4-5.8 27.8-11.6 55.8-17.3 83.6-1.4 6.3-8.3 4.9-13.7 4.9-23.8 0-30.5-26-30.5-45.5 0-29.3 11.2-68.1 38.5-83.1 4.3-2.5 9.2-4.2 14.1-4.2 11.4 0 12.3 8.3 12.3 17.9zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-64 187c0-5.1-20.8-37.7-25.5-39.5-2.2-.9-7.2-2.3-9.6-2.3-23.1 0-38.7 10.5-58.2 21.5l-.5-.5c4.3-29.4 14.6-57.2 14.6-87.4 0-44.6-23.8-62.7-67.5-62.7-71.7 0-108 70.8-108 123.5 0 54.7 32 85 86.3 85 7.5 0 6.9-.6 6.9 2.3-10.5 80.3-56.5 82.9-56.5 58.9 0-24.4 28-36.5 28.3-38-.2-7.6-29.3-17.2-36.7-17.2-21.1 0-32.7 33-32.7 50.6 0 32.3 20.4 54.7 53.3 54.7 48.2 0 83.4-49.7 94.3-91.7 9.4-37.7 7-39.4 12.3-42.1 20-10.1 35.8-16.8 58.4-16.8 11.1 0 19 2.3 36.7 5.2 1.8 .1 4.1-1.7 4.1-3.5z"],"glide-g":[448,512,[],"f2a6","M407.1 211.2c-3.5-1.4-11.6-3.8-15.4-3.8-37.1 0-62.2 16.8-93.5 34.5l-.9-.9c7-47.3 23.5-91.9 23.5-140.4C320.8 29.1 282.6 0 212.4 0 97.3 0 39 113.7 39 198.4 39 286.3 90.3 335 177.6 335c12 0 11-1 11 3.8-16.9 128.9-90.8 133.1-90.8 94.6 0-39.2 45-58.6 45.5-61-.3-12.2-47-27.6-58.9-27.6-33.9 .1-52.4 51.2-52.4 79.3C32 476 64.8 512 117.5 512c77.4 0 134-77.8 151.4-145.4 15.1-60.5 11.2-63.3 19.7-67.6 32.2-16.2 57.5-27 93.8-27 17.8 0 30.5 3.7 58.9 8.4 2.9 0 6.7-2.9 6.7-5.8 0-8-33.4-60.5-40.9-63.4zm-175.3-84.4c-9.3 44.7-18.6 89.6-27.8 134.3-2.3 10.2-13.3 7.8-22 7.8-38.3 0-49-41.8-49-73.1 0-47 18-109.3 61.8-133.4 7-4.1 14.8-6.7 22.6-6.7 18.6 0 20 13.3 20 28.7-.1 14.3-2.7 28.5-5.6 42.4z"],gofore:[400,512,[],"f3a7","M324 319.8h-13.2v34.7c-24.5 23.1-56.3 35.8-89.9 35.8-73.2 0-132.4-60.2-132.4-134.4 0-74.1 59.2-134.4 132.4-134.4 35.3 0 68.6 14 93.6 39.4l62.3-63.3C335 55.3 279.7 32 220.7 32 98 32 0 132.6 0 256c0 122.5 97 224 220.7 224 63.2 0 124.5-26.2 171-82.5-2-27.6-13.4-77.7-67.7-77.7zm-12.1-112.5H205.6v89H324c33.5 0 60.5 15.1 76 41.8v-30.6c0-65.2-40.4-100.2-88.1-100.2z"],golang:[640,512,[],"e40f","M400.1 194.8C389.2 197.6 380.2 199.1 371 202.4C363.7 204.3 356.3 206.3 347.8 208.5L347.2 208.6C343 209.8 342.6 209.9 338.7 205.4C334 200.1 330.6 196.7 324.1 193.5C304.4 183.9 285.4 186.7 267.7 198.2C246.5 211.9 235.6 232.2 235.9 257.4C236.2 282.4 253.3 302.9 277.1 306.3C299.1 309.1 316.9 301.7 330.9 285.8C333 283.2 334.9 280.5 337 277.5V277.5L337 277.5C337.8 276.5 338.5 275.4 339.3 274.2H279.2C272.7 274.2 271.1 270.2 273.3 264.9C277.3 255.2 284.8 239 289.2 230.9C290.1 229.1 292.3 225.1 296.1 225.1H397.2C401.7 211.7 409 198.2 418.8 185.4C441.5 155.5 468.1 139.9 506 133.4C537.8 127.8 567.7 130.9 594.9 149.3C619.5 166.1 634.7 188.9 638.8 218.8C644.1 260.9 631.9 295.1 602.1 324.4C582.4 345.3 557.2 358.4 528.2 364.3C522.6 365.3 517.1 365.8 511.7 366.3C508.8 366.5 506 366.8 503.2 367.1C474.9 366.5 449 358.4 427.2 339.7C411.9 326.4 401.3 310.1 396.1 291.2C392.4 298.5 388.1 305.6 382.1 312.3C360.5 341.9 331.2 360.3 294.2 365.2C263.6 369.3 235.3 363.4 210.3 344.7C187.3 327.2 174.2 304.2 170.8 275.5C166.7 241.5 176.7 210.1 197.2 184.2C219.4 155.2 248.7 136.8 284.5 130.3C313.8 124.1 341.8 128.4 367.1 145.6C383.6 156.5 395.4 171.4 403.2 189.5C405.1 192.3 403.8 193.9 400.1 194.8zM48.3 200.4C47.05 200.4 46.74 199.8 47.36 198.8L53.91 190.4C54.53 189.5 56.09 188.9 57.34 188.9H168.6C169.8 188.9 170.1 189.8 169.5 190.7L164.2 198.8C163.6 199.8 162 200.7 161.1 200.7L48.3 200.4zM1.246 229.1C0 229.1-.3116 228.4 .3116 227.5L6.855 219.1C7.479 218.2 9.037 217.5 10.28 217.5H152.4C153.6 217.5 154.2 218.5 153.9 219.4L151.4 226.9C151.1 228.1 149.9 228.8 148.6 228.8L1.246 229.1zM75.72 255.9C75.1 256.8 75.41 257.7 76.65 257.7L144.6 258C145.5 258 146.8 257.1 146.8 255.9L147.4 248.4C147.4 247.1 146.8 246.2 145.5 246.2H83.2C81.95 246.2 80.71 247.1 80.08 248.1L75.72 255.9zM577.2 237.9C577 235.3 576.9 233.1 576.5 230.9C570.9 200.1 542.5 182.6 512.9 189.5C483.9 196 465.2 214.4 458.4 243.7C452.8 268 464.6 292.6 487 302.6C504.2 310.1 521.3 309.2 537.8 300.7C562.4 287.1 575.8 268 577.4 241.2C577.3 240 577.3 238.9 577.2 237.9z"],goodreads:[448,512,[],"f3a8","M299.9 191.2c5.1 37.3-4.7 79-35.9 100.7-22.3 15.5-52.8 14.1-70.8 5.7-37.1-17.3-49.5-58.6-46.8-97.2 4.3-60.9 40.9-87.9 75.3-87.5 46.9-.2 71.8 31.8 78.2 78.3zM448 88v336c0 30.9-25.1 56-56 56H56c-30.9 0-56-25.1-56-56V88c0-30.9 25.1-56 56-56h336c30.9 0 56 25.1 56 56zM330 313.2s-.1-34-.1-217.3h-29v40.3c-.8 .3-1.2-.5-1.6-1.2-9.6-20.7-35.9-46.3-76-46-51.9 .4-87.2 31.2-100.6 77.8-4.3 14.9-5.8 30.1-5.5 45.6 1.7 77.9 45.1 117.8 112.4 115.2 28.9-1.1 54.5-17 69-45.2 .5-1 1.1-1.9 1.7-2.9 .2 .1 .4 .1 .6 .2 .3 3.8 .2 30.7 .1 34.5-.2 14.8-2 29.5-7.2 43.5-7.8 21-22.3 34.7-44.5 39.5-17.8 3.9-35.6 3.8-53.2-1.2-21.5-6.1-36.5-19-41.1-41.8-.3-1.6-1.3-1.3-2.3-1.3h-26.8c.8 10.6 3.2 20.3 8.5 29.2 24.2 40.5 82.7 48.5 128.2 37.4 49.9-12.3 67.3-54.9 67.4-106.3z"],"goodreads-g":[384,512,[],"f3a9","M42.6 403.3h2.8c12.7 0 25.5 0 38.2 .1 1.6 0 3.1-.4 3.6 2.1 7.1 34.9 30 54.6 62.9 63.9 26.9 7.6 54.1 7.8 81.3 1.8 33.8-7.4 56-28.3 68-60.4 8-21.5 10.7-43.8 11-66.5 .1-5.8 .3-47-.2-52.8l-.9-.3c-.8 1.5-1.7 2.9-2.5 4.4-22.1 43.1-61.3 67.4-105.4 69.1-103 4-169.4-57-172-176.2-.5-23.7 1.8-46.9 8.3-69.7C58.3 47.7 112.3 .6 191.6 0c61.3-.4 101.5 38.7 116.2 70.3 .5 1.1 1.3 2.3 2.4 1.9V10.6h44.3c0 280.3 .1 332.2 .1 332.2-.1 78.5-26.7 143.7-103 162.2-69.5 16.9-159 4.8-196-57.2-8-13.5-11.8-28.3-13-44.5zM188.9 36.5c-52.5-.5-108.5 40.7-115 133.8-4.1 59 14.8 122.2 71.5 148.6 27.6 12.9 74.3 15 108.3-8.7 47.6-33.2 62.7-97 54.8-154-9.7-71.1-47.8-120-119.6-119.7z"],google:[488,512,[],"f1a0","M488 261.8C488 403.3 391.1 504 248 504 110.8 504 0 393.2 0 256S110.8 8 248 8c66.8 0 123 24.5 166.3 64.9l-67.5 64.9C258.5 52.6 94.3 116.6 94.3 256c0 86.5 69.1 156.6 153.7 156.6 98.2 0 135-70.4 140.8-106.9H248v-85.3h236.1c2.3 12.7 3.9 24.9 3.9 41.4z"],"google-drive":[512,512,[],"f3aa","M339 314.9L175.4 32h161.2l163.6 282.9H339zm-137.5 23.6L120.9 480h310.5L512 338.5H201.5zM154.1 67.4L0 338.5 80.6 480 237 208.8 154.1 67.4z"],"google-pay":[640,512,[],"e079","M105.7 215v41.25h57.1a49.66 49.66 0 0 1 -21.14 32.6c-9.54 6.55-21.72 10.28-36 10.28-27.6 0-50.93-18.91-59.3-44.22a65.61 65.61 0 0 1 0-41l0 0c8.37-25.46 31.7-44.37 59.3-44.37a56.43 56.43 0 0 1 40.51 16.08L176.5 155a101.2 101.2 0 0 0 -70.75-27.84 105.6 105.6 0 0 0 -94.38 59.11 107.6 107.6 0 0 0 0 96.18v.15a105.4 105.4 0 0 0 94.38 59c28.47 0 52.55-9.53 70-25.91 20-18.61 31.41-46.15 31.41-78.91A133.8 133.8 0 0 0 205.4 215zm389.4-4c-10.13-9.38-23.93-14.14-41.39-14.14-22.46 0-39.34 8.34-50.5 24.86l20.85 13.26q11.45-17 31.26-17a34.05 34.05 0 0 1 22.75 8.79A28.14 28.14 0 0 1 487.8 248v5.51c-9.1-5.07-20.55-7.75-34.64-7.75-16.44 0-29.65 3.88-39.49 11.77s-14.82 18.31-14.82 31.56a39.74 39.74 0 0 0 13.94 31.27c9.25 8.34 21 12.51 34.79 12.51 16.29 0 29.21-7.3 39-21.89h1v17.72h22.61V250C510.3 233.4 505.3 220.3 495.1 211zM475.9 300.3a37.32 37.32 0 0 1 -26.57 11.16A28.61 28.61 0 0 1 431 305.2a19.41 19.41 0 0 1 -7.77-15.63c0-7 3.22-12.81 9.54-17.42s14.53-7 24.07-7C470 265 480.3 268 487.6 273.9 487.6 284.1 483.7 292.9 475.9 300.3zm-93.65-142A55.71 55.71 0 0 0 341.7 142H279.1V328.7H302.7V253.1h39c16 0 29.5-5.36 40.51-15.93 .88-.89 1.76-1.79 2.65-2.68A54.45 54.45 0 0 0 382.3 158.3zm-16.58 62.23a30.65 30.65 0 0 1 -23.34 9.68H302.7V165h39.63a32 32 0 0 1 22.6 9.23A33.18 33.18 0 0 1 365.7 220.5zM614.3 201 577.8 292.7h-.45L539.9 201H514.2L566 320.5l-29.35 64.32H561L640 201z"],"google-play":[512,512,[],"f3ab","M325.3 234.3L104.6 13l280.8 161.2-60.1 60.1zM47 0C34 6.8 25.3 19.2 25.3 35.3v441.3c0 16.1 8.7 28.5 21.7 35.3l256.6-256L47 0zm425.2 225.6l-58.9-34.1-65.7 64.5 65.7 64.5 60.1-34.1c18-14.3 18-46.5-1.2-60.8zM104.6 499l280.8-161.2-60.1-60.1L104.6 499z"],"google-plus":[512,512,[],"f2b3","M256 8C119.1 8 8 119.1 8 256S119.1 504 256 504 504 392.9 504 256 392.9 8 256 8zM185.3 380a124 124 0 0 1 0-248c31.3 0 60.1 11 83 32.3l-33.6 32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9 0-77.2 35.5-77.2 78.1S142.3 334 185.3 334c32.6 0 64.9-19.1 70.1-53.3H185.3V238.1H302.2a109.2 109.2 0 0 1 1.9 20.7c0 70.8-47.5 121.2-118.8 121.2zM415.5 273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5z"],"google-plus-g":[640,512,[],"f0d5","M386.1 228.5c1.834 9.692 3.143 19.38 3.143 31.96C389.2 370.2 315.6 448 204.8 448c-106.1 0-192-85.92-192-192s85.92-192 192-192c51.86 0 95.08 18.86 128.6 50.29l-52.13 50.03c-14.15-13.62-39.03-29.6-76.49-29.6-65.48 0-118.9 54.22-118.9 121.3 0 67.06 53.44 121.3 118.9 121.3 75.96 0 104.5-54.74 108.1-82.77H204.8v-66.01h181.3zm185.4 6.437V179.2h-56v55.73h-55.73v56h55.73v55.73h56v-55.73H627.2v-56h-55.73z"],"google-wallet":[448,512,[],"f1ee","M156.8 126.8c37.6 60.6 64.2 113.1 84.3 162.5-8.3 33.8-18.8 66.5-31.3 98.3-13.2-52.3-26.5-101.3-56-148.5 6.5-36.4 2.3-73.6 3-112.3zM109.3 200H16.1c-6.5 0-10.5 7.5-6.5 12.7C51.8 267 81.3 330.5 101.3 400h103.5c-16.2-69.7-38.7-133.7-82.5-193.5-3-4-8-6.5-13-6.5zm47.8-88c68.5 108 130 234.5 138.2 368H409c-12-138-68.4-265-143.2-368H157.1zm251.8-68.5c-1.8-6.8-8.2-11.5-15.2-11.5h-88.3c-5.3 0-9 5-7.8 10.3 13.2 46.5 22.3 95.5 26.5 146 48.2 86.2 79.7 178.3 90.6 270.8 15.8-60.5 25.3-133.5 25.3-203 0-73.6-12.1-145.1-31.1-212.6z"],gratipay:[496,512,[],"f184","M248 8C111.1 8 0 119.1 0 256s111.1 248 248 248 248-111.1 248-248S384.9 8 248 8zm114.6 226.4l-113 152.7-112.7-152.7c-8.7-11.9-19.1-50.4 13.6-72 28.1-18.1 54.6-4.2 68.5 11.9 15.9 17.9 46.6 16.9 61.7 0 13.9-16.1 40.4-30 68.1-11.9 32.9 21.6 22.6 60 13.8 72z"],grav:[512,512,[],"f2d6","M301.1 212c4.4 4.4 4.4 11.9 0 16.3l-9.7 9.7c-4.4 4.7-11.9 4.7-16.6 0l-10.5-10.5c-4.4-4.7-4.4-11.9 0-16.6l9.7-9.7c4.4-4.4 11.9-4.4 16.6 0l10.5 10.8zm-30.2-19.7c3-3 3-7.8 0-10.5-2.8-3-7.5-3-10.5 0-2.8 2.8-2.8 7.5 0 10.5 3.1 2.8 7.8 2.8 10.5 0zm-26 5.3c-3 2.8-3 7.5 0 10.2 2.8 3 7.5 3 10.5 0 2.8-2.8 2.8-7.5 0-10.2-3-3-7.7-3-10.5 0zm72.5-13.3c-19.9-14.4-33.8-43.2-11.9-68.1 21.6-24.9 40.7-17.2 59.8 .8 11.9 11.3 29.3 24.9 17.2 48.2-12.5 23.5-45.1 33.2-65.1 19.1zm47.7-44.5c-8.9-10-23.3 6.9-15.5 16.1 7.4 9 32.1 2.4 15.5-16.1zM504 256c0 137-111 248-248 248S8 393 8 256 119 8 256 8s248 111 248 248zm-66.2 42.6c2.5-16.1-20.2-16.6-25.2-25.7-13.6-24.1-27.7-36.8-54.5-30.4 11.6-8 23.5-6.1 23.5-6.1 .3-6.4 0-13-9.4-24.9 3.9-12.5 .3-22.4 .3-22.4 15.5-8.6 26.8-24.4 29.1-43.2 3.6-31-18.8-59.2-49.8-62.8-22.1-2.5-43.7 7.7-54.3 25.7-23.2 40.1 1.4 70.9 22.4 81.4-14.4-1.4-34.3-11.9-40.1-34.3-6.6-25.7 2.8-49.8 8.9-61.4 0 0-4.4-5.8-8-8.9 0 0-13.8 0-24.6 5.3 11.9-15.2 25.2-14.4 25.2-14.4 0-6.4-.6-14.9-3.6-21.6-5.4-11-23.8-12.9-31.7 2.8 .1-.2 .3-.4 .4-.5-5 11.9-1.1 55.9 16.9 87.2-2.5 1.4-9.1 6.1-13 10-21.6 9.7-56.2 60.3-56.2 60.3-28.2 10.8-77.2 50.9-70.6 79.7 .3 3 1.4 5.5 3 7.5-2.8 2.2-5.5 5-8.3 8.3-11.9 13.8-5.3 35.2 17.7 24.4 15.8-7.2 29.6-20.2 36.3-30.4 0 0-5.5-5-16.3-4.4 27.7-6.6 34.3-9.4 46.2-9.1 8 3.9 8-34.3 8-34.3 0-14.7-2.2-31-11.1-41.5 12.5 12.2 29.1 32.7 28 60.6-.8 18.3-15.2 23-15.2 23-9.1 16.6-43.2 65.9-30.4 106 0 0-9.7-14.9-10.2-22.1-17.4 19.4-46.5 52.3-24.6 64.5 26.6 14.7 108.8-88.6 126.2-142.3 34.6-20.8 55.4-47.3 63.9-65 22 43.5 95.3 94.5 101.1 59z"],gripfire:[384,512,[],"f3ac","M112.5 301.4c0-73.8 105.1-122.5 105.1-203 0-47.1-34-88-39.1-90.4 .4 3.3 .6 6.7 .6 10C179.1 110.1 32 171.9 32 286.6c0 49.8 32.2 79.2 66.5 108.3 65.1 46.7 78.1 71.4 78.1 86.6 0 10.1-4.8 17-4.8 22.3 13.1-16.7 17.4-31.9 17.5-46.4 0-29.6-21.7-56.3-44.2-86.5-16-22.3-32.6-42.6-32.6-69.5zm205.3-39c-12.1-66.8-78-124.4-94.7-130.9l4 7.2c2.4 5.1 3.4 10.9 3.4 17.1 0 44.7-54.2 111.2-56.6 116.7-2.2 5.1-3.2 10.5-3.2 15.8 0 20.1 15.2 42.1 17.9 42.1 2.4 0 56.6-55.4 58.1-87.7 6.4 11.7 9.1 22.6 9.1 33.4 0 41.2-41.8 96.9-41.8 96.9 0 11.6 31.9 53.2 35.5 53.2 1 0 2.2-1.4 3.2-2.4 37.9-39.3 67.3-85 67.3-136.8 0-8-.7-16.2-2.2-24.6z"],grunt:[384,512,[],"f3ad","M61.3 189.3c-1.1 10 5.2 19.1 5.2 19.1 .7-7.5 2.2-12.8 4-16.6 .4 10.3 3.2 23.5 12.8 34.1 6.9 7.6 35.6 23.3 54.9 6.1 1 2.4 2.1 5.3 3 8.5 2.9 10.3-2.7 25.3-2.7 25.3s15.1-17.1 13.9-32.5c10.8-.5 21.4-8.4 21.1-19.5 0 0-18.9 10.4-35.5-8.8-9.7-11.2-40.9-42-83.1-31.8 4.3 1 8.9 2.4 13.5 4.1h-.1c-4.2 2-6.5 7.1-7 12zm28.3-1.8c19.5 11 37.4 25.7 44.9 37-5.7 3.3-21.7 10.4-38-1.7-10.3-7.6-9.8-26.2-6.9-35.3zm142.1 45.8c-1.2 15.5 13.9 32.5 13.9 32.5s-5.6-15-2.7-25.3c.9-3.2 2-6 3-8.5 19.3 17.3 48 1.5 54.8-6.1 9.6-10.6 12.3-23.8 12.8-34.1 1.8 3.8 3.4 9.1 4 16.6 0 0 6.4-9.1 5.2-19.1-.6-5-2.9-10-7-11.8h-.1c4.6-1.8 9.2-3.2 13.5-4.1-42.3-10.2-73.4 20.6-83.1 31.8-16.7 19.2-35.5 8.8-35.5 8.8-.2 10.9 10.4 18.9 21.2 19.3zm62.7-45.8c3 9.1 3.4 27.7-7 35.4-16.3 12.1-32.2 5-37.9 1.6 7.5-11.4 25.4-26 44.9-37zM160 418.5h-29.4c-5.5 0-8.2 1.6-9.5 2.9-1.9 2-2.2 4.7-.9 8.1 3.5 9.1 11.4 16.5 13.7 18.6 3.1 2.7 7.5 4.3 11.8 4.3 4.4 0 8.3-1.7 11-4.6 7.5-8.2 11.9-17.1 13-19.8 .6-1.5 1.3-4.5-.9-6.8-1.8-1.8-4.7-2.7-8.8-2.7zm189.2-101.2c-2.4 17.9-13 33.8-24.6 43.7-3.1-22.7-3.7-55.5-3.7-62.4 0-14.7 9.5-24.5 12.2-26.1 2.5-1.5 5.4-3 8.3-4.6 18-9.6 40.4-21.6 40.4-43.7 0-16.2-9.3-23.2-15.4-27.8-.8-.6-1.5-1.1-2.2-1.7-2.1-1.7-3.7-3-4.3-4.4-4.4-9.8-3.6-34.2-1.7-37.6 .6-.6 16.7-20.9 11.8-39.2-2-7.4-6.9-13.3-14.1-17-5.3-2.7-11.9-4.2-19.5-4.5-.1-2-.5-3.9-.9-5.9-.6-2.6-1.1-5.3-.9-8.1 .4-4.7 .8-9 2.2-11.3 8.4-13.3 28.8-17.6 29-17.6l12.3-2.4-8.1-9.5c-.1-.2-17.3-17.5-46.3-17.5-7.9 0-16 1.3-24.1 3.9-24.2 7.8-42.9 30.5-49.4 39.3-3.1-1-6.3-1.9-9.6-2.7-4.2-15.8 9-38.5 9-38.5s-13.6-3-33.7 15.2c-2.6-6.5-8.1-20.5-1.8-37.2C184.6 10.1 177.2 26 175 40.4c-7.6-5.4-6.7-23.1-7.2-27.6-7.5 .9-29.2 21.9-28.2 48.3-2 .5-3.9 1.1-5.9 1.7-6.5-8.8-25.1-31.5-49.4-39.3-7.9-2.2-16-3.5-23.9-3.5-29 0-46.1 17.3-46.3 17.5L6 46.9l12.3 2.4c.2 0 20.6 4.3 29 17.6 1.4 2.2 1.8 6.6 2.2 11.3 .2 2.8-.4 5.5-.9 8.1-.4 1.9-.8 3.9-.9 5.9-7.7 .3-14.2 1.8-19.5 4.5-7.2 3.7-12.1 9.6-14.1 17-5 18.2 11.2 38.5 11.8 39.2 1.9 3.4 2.7 27.8-1.7 37.6-.6 1.4-2.2 2.7-4.3 4.4-.7 .5-1.4 1.1-2.2 1.7-6.1 4.6-15.4 11.7-15.4 27.8 0 22.1 22.4 34.1 40.4 43.7 3 1.6 5.8 3.1 8.3 4.6 2.7 1.6 12.2 11.4 12.2 26.1 0 6.9-.6 39.7-3.7 62.4-11.6-9.9-22.2-25.9-24.6-43.8 0 0-29.2 22.6-20.6 70.8 5.2 29.5 23.2 46.1 47 54.7 8.8 19.1 29.4 45.7 67.3 49.6C143 504.3 163 512 192.2 512h.2c29.1 0 49.1-7.7 63.6-19.5 37.9-3.9 58.5-30.5 67.3-49.6 23.8-8.7 41.7-25.2 47-54.7 8.2-48.4-21.1-70.9-21.1-70.9zM305.7 37.7c5.6-1.8 11.6-2.7 17.7-2.7 11 0 19.9 3 24.7 5-3.1 1.4-6.4 3.2-9.7 5.3-2.4-.4-5.6-.8-9.2-.8-10.5 0-20.5 3.1-28.7 8.9-12.3 8.7-18 16.9-20.7 22.4-2.2-1.3-4.5-2.5-7.1-3.7-1.6-.8-3.1-1.5-4.7-2.2 6.1-9.1 19.9-26.5 37.7-32.2zm21 18.2c-.8 1-1.6 2.1-2.3 3.2-3.3 5.2-3.9 11.6-4.4 17.8-.5 6.4-1.1 12.5-4.4 17-4.2 .8-8.1 1.7-11.5 2.7-2.3-3.1-5.6-7-10.5-11.2 1.4-4.8 5.5-16.1 13.5-22.5 5.6-4.3 12.2-6.7 19.6-7zM45.6 45.3c-3.3-2.2-6.6-4-9.7-5.3 4.8-2 13.7-5 24.7-5 6.1 0 12 .9 17.7 2.7 17.8 5.8 31.6 23.2 37.7 32.1-1.6 .7-3.2 1.4-4.8 2.2-2.5 1.2-4.9 2.5-7.1 3.7-2.6-5.4-8.3-13.7-20.7-22.4-8.3-5.8-18.2-8.9-28.8-8.9-3.4 .1-6.6 .5-9 .9zm44.7 40.1c-4.9 4.2-8.3 8-10.5 11.2-3.4-.9-7.3-1.9-11.5-2.7C65 89.5 64.5 83.4 64 77c-.5-6.2-1.1-12.6-4.4-17.8-.7-1.1-1.5-2.2-2.3-3.2 7.4 .3 14 2.6 19.5 7 8 6.3 12.1 17.6 13.5 22.4zM58.1 259.9c-2.7-1.6-5.6-3.1-8.4-4.6-14.9-8-30.2-16.3-30.2-30.5 0-11.1 4.3-14.6 8.9-18.2l.5-.4c.7-.6 1.4-1.2 2.2-1.8-.9 7.2-1.9 13.3-2.7 14.9 0 0 12.1-15 15.7-44.3 1.4-11.5-1.1-34.3-5.1-43 .2 4.9 0 9.8-.3 14.4-.4-.8-.8-1.6-1.3-2.2-3.2-4-11.8-17.5-9.4-26.6 .9-3.5 3.1-6 6.7-7.8 3.8-1.9 8.8-2.9 15.1-2.9 12.3 0 25.9 3.7 32.9 6 25.1 8 55.4 30.9 64.1 37.7 .2 .2 .4 .3 .4 .3l5.6 3.9-3.5-5.8c-.2-.3-19.1-31.4-53.2-46.5 2-2.9 7.4-8.1 21.6-15.1 21.4-10.5 46.5-15.8 74.3-15.8 27.9 0 52.9 5.3 74.3 15.8 14.2 6.9 19.6 12.2 21.6 15.1-34 15.1-52.9 46.2-53.1 46.5l-3.5 5.8 5.6-3.9s.2-.1 .4-.3c8.7-6.8 39-29.8 64.1-37.7 7-2.2 20.6-6 32.9-6 6.3 0 11.3 1 15.1 2.9 3.5 1.8 5.7 4.4 6.7 7.8 2.5 9.1-6.1 22.6-9.4 26.6-.5 .6-.9 1.3-1.3 2.2-.3-4.6-.5-9.5-.3-14.4-4 8.8-6.5 31.5-5.1 43 3.6 29.3 15.7 44.3 15.7 44.3-.8-1.6-1.8-7.7-2.7-14.9 .7 .6 1.5 1.2 2.2 1.8l.5 .4c4.6 3.7 8.9 7.1 8.9 18.2 0 14.2-15.4 22.5-30.2 30.5-2.9 1.5-5.7 3.1-8.4 4.6-8.7 5-18 16.7-19.1 34.2-.9 14.6 .9 49.9 3.4 75.9-12.4 4.8-26.7 6.4-39.7 6.8-2-4.1-3.9-8.5-5.5-13.1-.7-2-19.6-51.1-26.4-62.2 5.5 39 17.5 73.7 23.5 89.6-3.5-.5-7.3-.7-11.7-.7h-117c-4.4 0-8.3 .3-11.7 .7 6-15.9 18.1-50.6 23.5-89.6-6.8 11.2-25.7 60.3-26.4 62.2-1.6 4.6-3.5 9-5.5 13.1-13-.4-27.2-2-39.7-6.8 2.5-26 4.3-61.2 3.4-75.9-.9-17.4-10.3-29.2-19-34.2zM34.8 404.6c-12.1-20-8.7-54.1-3.7-59.1 10.9 34.4 47.2 44.3 74.4 45.4-2.7 4.2-5.2 7.6-7 10l-1.4 1.4c-7.2 7.8-8.6 18.5-4.1 31.8-22.7-.1-46.3-9.8-58.2-29.5zm45.7 43.5c6 1.1 12.2 1.9 18.6 2.4 3.5 8 7.4 15.9 12.3 23.1-14.4-5.9-24.4-16-30.9-25.5zM192 498.2c-60.6-.1-78.3-45.8-84.9-64.7-3.7-10.5-3.4-18.2 .9-23.1 2.9-3.3 9.5-7.2 24.6-7.2h118.8c15.1 0 21.8 3.9 24.6 7.2 4.2 4.8 4.5 12.6 .9 23.1-6.6 18.8-24.3 64.6-84.9 64.7zm80.6-24.6c4.9-7.2 8.8-15.1 12.3-23.1 6.4-.5 12.6-1.3 18.6-2.4-6.5 9.5-16.5 19.6-30.9 25.5zm76.6-69c-12 19.7-35.6 29.3-58.1 29.7 4.5-13.3 3.1-24.1-4.1-31.8-.4-.5-.9-1-1.4-1.5-1.8-2.4-4.3-5.8-7-10 27.2-1.2 63.5-11 74.4-45.4 5 5 8.4 39.1-3.8 59zM191.9 187.7h.2c12.7-.1 27.2-17.8 27.2-17.8-9.9 6-18.8 8.1-27.3 8.3-8.5-.2-17.4-2.3-27.3-8.3 0 0 14.5 17.6 27.2 17.8zm61.7 230.7h-29.4c-4.2 0-7.2 .9-8.9 2.7-2.2 2.3-1.5 5.2-.9 6.7 1 2.6 5.5 11.3 13 19.3 2.7 2.9 6.6 4.5 11 4.5s8.7-1.6 11.8-4.2c2.3-2 10.2-9.2 13.7-18.1 1.3-3.3 1-6-.9-7.9-1.3-1.3-4-2.9-9.4-3z"],guilded:[448,512,[],"e07e","M443.4 64H4.571c0 103.3 22.19 180.1 43.42 222.4C112 414.1 224 448 225.3 448a312.8 312.8 0 0 0 140.6-103.5c25.91-33.92 53.1-87.19 65.92-145.8H171.8c4.14 36.43 22.18 67.95 45.1 86.94h88.59c-17.01 28.21-48.19 54.4-80.46 69.48-31.23-13.26-69.09-46.54-96.55-98.36-26.73-53.83-27.09-105.9-27.09-105.9H437.6A625.9 625.9 0 0 0 443.4 64z"],gulp:[256,512,[],"f3ae","M209.8 391.1l-14.1 24.6-4.6 80.2c0 8.9-28.3 16.1-63.1 16.1s-63.1-7.2-63.1-16.1l-5.8-79.4-14.9-25.4c41.2 17.3 126 16.7 165.6 0zm-196-253.3l13.6 125.5c5.9-20 20.8-47 40-55.2 6.3-2.7 12.7-2.7 18.7 .9 5.2 3 9.6 9.3 10.1 11.8 1.2 6.5-2 9.1-4.5 9.1-3 0-5.3-4.6-6.8-7.3-4.1-7.3-10.3-7.6-16.9-2.8-6.9 5-12.9 13.4-17.1 20.7-5.1 8.8-9.4 18.5-12 28.2-1.5 5.6-2.9 14.6-.6 19.9 1 2.2 2.5 3.6 4.9 3.6 5 0 12.3-6.6 15.8-10.1 4.5-4.5 10.3-11.5 12.5-16l5.2-15.5c2.6-6.8 9.9-5.6 9.9 0 0 10.2-3.7 13.6-10 34.7-5.8 19.5-7.6 25.8-7.6 25.8-.7 2.8-3.4 7.5-6.3 7.5-1.2 0-2.1-.4-2.6-1.2-1-1.4-.9-5.3-.8-6.3 .2-3.2 6.3-22.2 7.3-25.2-2 2.2-4.1 4.4-6.4 6.6-5.4 5.1-14.1 11.8-21.5 11.8-3.4 0-5.6-.9-7.7-2.4l7.6 79.6c2 5 39.2 17.1 88.2 17.1 49.1 0 86.3-12.2 88.2-17.1l10.9-94.6c-5.7 5.2-12.3 11.6-19.6 14.8-5.4 2.3-17.4 3.8-17.4-5.7 0-5.2 9.1-14.8 14.4-21.5 1.4-1.7 4.7-5.9 4.7-8.1 0-2.9-6-2.2-11.7 2.5-3.2 2.7-6.2 6.3-8.7 9.7-4.3 6-6.6 11.2-8.5 15.5-6.2 14.2-4.1 8.6-9.1 22-5 13.3-4.2 11.8-5.2 14-.9 1.9-2.2 3.5-4 4.5-1.9 1-4.5 .9-6.1-.3-.9-.6-1.3-1.9-1.3-3.7 0-.9 .1-1.8 .3-2.7 1.5-6.1 7.8-18.1 15-34.3 1.6-3.7 1-2.6 .8-2.3-6.2 6-10.9 8.9-14.4 10.5-5.8 2.6-13 2.6-14.5-4.1-.1-.4-.1-.8-.2-1.2-11.8 9.2-24.3 11.7-20-8.1-4.6 8.2-12.6 14.9-22.4 14.9-4.1 0-7.1-1.4-8.6-5.1-2.3-5.5 1.3-14.9 4.6-23.8 1.7-4.5 4-9.9 7.1-16.2 1.6-3.4 4.2-5.4 7.6-4.5 .6 .2 1.1 .4 1.6 .7 2.6 1.8 1.6 4.5 .3 7.2-3.8 7.5-7.1 13-9.3 20.8-.9 3.3-2 9 1.5 9 2.4 0 4.7-.8 6.9-2.4 4.6-3.4 8.3-8.5 11.1-13.5 2-3.6 4.4-8.3 5.6-12.3 .5-1.7 1.1-3.3 1.8-4.8 1.1-2.5 2.6-5.1 5.2-5.1 1.3 0 2.4 .5 3.2 1.5 1.7 2.2 1.3 4.5 .4 6.9-2 5.6-4.7 10.6-6.9 16.7-1.3 3.5-2.7 8-2.7 11.7 0 3.4 3.7 2.6 6.8 1.2 2.4-1.1 4.8-2.8 6.8-4.5 1.2-4.9 .9-3.8 26.4-68.2 1.3-3.3 3.7-4.7 6.1-4.7 1.2 0 2.2 .4 3.2 1.1 1.7 1.3 1.7 4.1 1 6.2-.7 1.9-.6 1.3-4.5 10.5-5.2 12.1-8.6 20.8-13.2 31.9-1.9 4.6-7.7 18.9-8.7 22.3-.6 2.2-1.3 5.8 1 5.8 5.4 0 19.3-13.1 23.1-17 .2-.3 .5-.4 .9-.6 .6-1.9 1.2-3.7 1.7-5.5 1.4-3.8 2.7-8.2 5.3-11.3 .8-1 1.7-1.6 2.7-1.6 2.8 0 4.2 1.2 4.2 4 0 1.1-.7 5.1-1.1 6.2 1.4-1.5 2.9-3 4.5-4.5 15-13.9 25.7-6.8 25.7 .2 0 7.4-8.9 17.7-13.8 23.4-1.6 1.9-4.9 5.4-5 6.4 0 1.3 .9 1.8 2.2 1.8 2 0 6.4-3.5 8-4.7 5-3.9 11.8-9.9 16.6-14.1l14.8-136.8c-30.5 17.1-197.6 17.2-228.3 .2zm229.7-8.5c0 21-231.2 21-231.2 0 0-8.8 51.8-15.9 115.6-15.9 9 0 17.8 .1 26.3 .4l12.6-48.7L228.1 .6c1.4-1.4 5.8-.2 9.9 3.5s6.6 7.9 5.3 9.3l-.1 .1L185.9 74l-10 40.7c39.9 2.6 67.6 8.1 67.6 14.6zm-69.4 4.6c0-.8-.9-1.5-2.5-2.1l-.2 .8c0 1.3-5 2.4-11.1 2.4s-11.1-1.1-11.1-2.4c0-.1 0-.2 .1-.3l.2-.7c-1.8 .6-3 1.4-3 2.3 0 2.1 6.2 3.7 13.7 3.7 7.7 .1 13.9-1.6 13.9-3.7z"],"hacker-news":[448,512,[],"f1d4","M0 32v448h448V32H0zm21.2 197.2H21c.1-.1 .2-.3 .3-.4 0 .1 0 .3-.1 .4zm218 53.9V384h-31.4V281.3L128 128h37.3c52.5 98.3 49.2 101.2 59.3 125.6 12.3-27 5.8-24.4 60.6-125.6H320l-80.8 155.1z"],hackerrank:[512,512,[],"f5f7","M477.5 128C463 103.1 285.1 0 256.2 0S49.25 102.8 34.84 128s-14.49 230.8 0 256 192.4 128 221.3 128S463 409.1 477.5 384s14.51-231 .01-256zM316.1 414.2c-4 0-40.91-35.77-38-38.69 .87-.87 6.26-1.48 17.55-1.83 0-26.23 .59-68.59 .94-86.32 0-2-.44-3.43-.44-5.85h-79.93c0 7.1-.46 36.2 1.37 72.88 .23 4.54-1.58 6-5.74 5.94-10.13 0-20.27-.11-30.41-.08-4.1 0-5.87-1.53-5.74-6.11 .92-33.44 3-84-.15-212.7v-3.17c-9.67-.35-16.38-1-17.26-1.84-2.92-2.92 34.54-38.69 38.49-38.69s41.17 35.78 38.27 38.69c-.87 .87-7.9 1.49-16.77 1.84v3.16c-2.42 25.75-2 79.59-2.63 105.4h80.26c0-4.55 .39-34.74-1.2-83.64-.1-3.39 .95-5.17 4.21-5.2 11.07-.08 22.15-.13 33.23-.06 3.46 0 4.57 1.72 4.5 5.38C333 354.6 336 341.3 336 373.7c8.87 .35 16.82 1 17.69 1.84 2.88 2.91-33.62 38.69-37.58 38.69z"],hashnode:[512,512,[],"e499","M35.19 171.1C-11.72 217.1-11.72 294 35.19 340.9L171.1 476.8C217.1 523.7 294 523.7 340.9 476.8L476.8 340.9C523.7 294 523.7 217.1 476.8 171.1L340.9 35.19C294-11.72 217.1-11.72 171.1 35.19L35.19 171.1zM315.5 315.5C282.6 348.3 229.4 348.3 196.6 315.5C163.7 282.6 163.7 229.4 196.6 196.6C229.4 163.7 282.6 163.7 315.5 196.6C348.3 229.4 348.3 282.6 315.5 315.5z"],hips:[640,512,[],"f452","M251.6 157.6c0-1.9-.9-2.8-2.8-2.8h-40.9c-1.6 0-2.7 1.4-2.7 2.8v201.8c0 1.4 1.1 2.8 2.7 2.8h40.9c1.9 0 2.8-.9 2.8-2.8zM156.5 168c-16.1-11.8-36.3-17.9-60.3-18-18.1-.1-34.6 3.7-49.8 11.4V80.2c0-1.8-.9-2.7-2.8-2.7H2.7c-1.8 0-2.7 .9-2.7 2.7v279.2c0 1.9 .9 2.8 2.7 2.8h41c1.9 0 2.8-.9 2.8-2.8V223.3c0-.8-2.8-27 45.8-27 48.5 0 45.8 26.1 45.8 27v122.6c0 9 7.3 16.3 16.4 16.3h27.3c1.8 0 2.7-.9 2.7-2.8V223.3c0-23.4-9.3-41.8-28-55.3zm478.4 110.1c-6.8-15.7-18.4-27-34.9-34.1l-57.6-25.3c-8.6-3.6-9.2-11.2-2.6-16.1 7.4-5.5 44.3-13.9 84 6.8 1.7 1 4-.3 4-2.4v-44.7c0-1.3-.6-2.1-1.9-2.6-17.7-6.6-36.1-9.9-55.1-9.9-26.5 0-45.3 5.8-58.5 15.4-.5 .4-28.4 20-22.7 53.7 3.4 19.6 15.8 34.2 37.2 43.6l53.6 23.5c11.6 5.1 15.2 13.3 12.2 21.2-3.7 9.1-13.2 13.6-36.5 13.6-24.3 0-44.7-8.9-58.4-19.1-2.1-1.4-4.4 .2-4.4 2.3v34.4c0 10.4 4.9 17.3 14.6 20.7 15.6 5.5 31.6 8.2 48.2 8.2 12.7 0 25.8-1.2 36.3-4.3 .7-.3 36-8.9 45.6-45.8 3.5-13.5 2.4-26.5-3.1-39.1zM376.2 149.8c-31.7 0-104.2 20.1-104.2 103.5v183.5c0 .8 .6 2.7 2.7 2.7h40.9c1.9 0 2.8-.9 2.8-2.7V348c16.5 12.7 35.8 19.1 57.7 19.1 60.5 0 108.7-48.5 108.7-108.7 .1-60.3-48.2-108.6-108.6-108.6zm0 170.9c-17.2 0-31.9-6.1-44-18.2-12.2-12.2-18.2-26.8-18.2-44 0-34.5 27.6-62.2 62.2-62.2 34.5 0 62.2 27.6 62.2 62.2 .1 34.3-27.3 62.2-62.2 62.2zM228.3 72.5c-15.9 0-28.8 12.9-28.9 28.9 0 15.6 12.7 28.9 28.9 28.9s28.9-13.1 28.9-28.9c0-16.2-13-28.9-28.9-28.9z"],"hire-a-helper":[512,512,[],"f3b0","M443.1 0H71.9C67.9 37.3 37.4 67.8 0 71.7v371.5c37.4 4.9 66 32.4 71.9 68.8h372.2c3-36.4 32.5-65.8 67.9-69.8V71.7c-36.4-5.9-65-35.3-68.9-71.7zm-37 404.9c-36.3 0-18.8-2-55.1-2-35.8 0-21 2-56.1 2-5.9 0-4.9-8.2 0-9.8 22.8-7.6 22.9-10.2 24.6-12.8 10.4-15.6 5.9-83 5.9-113 0-5.3-6.4-12.8-13.8-12.8H200.4c-7.4 0-13.8 7.5-13.8 12.8 0 30-4.5 97.4 5.9 113 1.7 2.5 1.8 5.2 24.6 12.8 4.9 1.6 6 9.8 0 9.8-35.1 0-20.3-2-56.1-2-36.3 0-18.8 2-55.1 2-7.9 0-5.8-10.8 0-10.8 10.2-3.4 13.5-3.5 21.7-13.8 7.7-12.9 7.9-44.4 7.9-127.8V151.3c0-22.2-12.2-28.3-28.6-32.4-8.8-2.2-4-11.8 1-11.8 36.5 0 20.6 2 57.1 2 32.7 0 16.5-2 49.2-2 3.3 0 8.5 8.3 1 10.8-4.9 1.6-27.6 3.7-27.6 39.3 0 45.6-.2 55.8 1 68.8 0 1.3 2.3 12.8 12.8 12.8h109.2c10.5 0 12.8-11.5 12.8-12.8 1.2-13 1-23.2 1-68.8 0-35.6-22.7-37.7-27.6-39.3-7.5-2.5-2.3-10.8 1-10.8 32.7 0 16.5 2 49.2 2 36.5 0 20.6-2 57.1-2 4.9 0 9.9 9.6 1 11.8-16.4 4.1-28.6 10.3-28.6 32.4v101.2c0 83.4 .1 114.9 7.9 127.8 8.2 10.2 11.4 10.4 21.7 13.8 5.8 0 7.8 10.8 0 10.8z"],hive:[512,512,[],"e07f","M260.4 254.9 131.5 33.1a2.208 2.208 0 0 0 -3.829 .009L.3 254.9A2.234 2.234 0 0 0 .3 257.1L129.1 478.9a2.208 2.208 0 0 0 3.83-.009L260.4 257.1A2.239 2.239 0 0 0 260.4 254.9zm39.08-25.71a2.19 2.19 0 0 0 1.9 1.111h66.51a2.226 2.226 0 0 0 1.9-3.341L259.1 33.11a2.187 2.187 0 0 0 -1.9-1.111H190.7a2.226 2.226 0 0 0 -1.9 3.341zM511.7 254.9 384.9 33.11A2.2 2.2 0 0 0 382.1 32h-66.6a2.226 2.226 0 0 0 -1.906 3.34L440.7 256 314.5 476.7a2.226 2.226 0 0 0 1.906 3.34h66.6a2.2 2.2 0 0 0 1.906-1.112L511.7 257.1A2.243 2.243 0 0 0 511.7 254.9zM366 284.9H299.5a2.187 2.187 0 0 0 -1.9 1.111l-108.8 190.6a2.226 2.226 0 0 0 1.9 3.341h66.51a2.187 2.187 0 0 0 1.9-1.111l108.8-190.6A2.226 2.226 0 0 0 366 284.9z"],hooli:[640,512,[],"f427","M144.5 352l38.3 .8c-13.2-4.6-26-10.2-38.3-16.8zm57.7-5.3v5.3l-19.4 .8c36.5 12.5 69.9 14.2 94.7 7.2-19.9 .2-45.8-2.6-75.3-13.3zm408.9-115.2c15.9 0 28.9-12.9 28.9-28.9s-12.9-24.5-28.9-24.5c-15.9 0-28.9 8.6-28.9 24.5s12.9 28.9 28.9 28.9zm-29 120.5H640V241.5h-57.9zm-73.7 0h57.9V156.7L508.4 184zm-31-119.4c-18.2-18.2-50.4-17.1-50.4-17.1s-32.3-1.1-50.4 17.1c-18.2 18.2-16.8 33.9-16.8 52.6s-1.4 34.3 16.8 52.5 50.4 17.1 50.4 17.1 32.3 1.1 50.4-17.1c18.2-18.2 16.8-33.8 16.8-52.5-.1-18.8 1.3-34.5-16.8-52.6zm-39.8 71.9c0 3.6-1.8 12.5-10.7 12.5s-10.7-8.9-10.7-12.5v-40.4c0-8.7 7.3-10.9 10.7-10.9s10.7 2.1 10.7 10.9zm-106.2-71.9c-18.2-18.2-50.4-17.1-50.4-17.1s-32.2-1.1-50.4 17.1c-1.9 1.9-3.7 3.9-5.3 6-38.2-29.6-72.5-46.5-102.1-61.1v-20.7l-22.5 10.6c-54.4-22.1-89-18.2-97.3 .1 0 0-24.9 32.8 61.8 110.8V352h57.9v-28.6c-6.5-4.2-13-8.7-19.4-13.6-14.8-11.2-27.4-21.6-38.4-31.4v-31c13.1 14.7 30.5 31.4 53.4 50.3l4.5 3.6v-29.8c0-6.9 1.7-18.2 10.8-18.2s10.6 6.9 10.6 15V317c18 12.2 37.3 22.1 57.7 29.6v-93.9c0-18.7-13.4-37.4-40.6-37.4-15.8-.1-30.5 8.2-38.5 21.9v-54.3c41.9 20.9 83.9 46.5 99.9 58.3-10.2 14.6-9.3 28.1-9.3 43.7 0 18.7-1.4 34.3 16.8 52.5s50.4 17.1 50.4 17.1 32.3 1.1 50.4-17.1c18.2-18.2 16.7-33.8 16.7-52.5 0-18.5 1.5-34.2-16.7-52.3zM65.2 184v63.3c-48.7-54.5-38.9-76-35.2-79.1 13.5-11.4 37.5-8 64.4 2.1zm226.5 120.5c0 3.6-1.8 12.5-10.7 12.5s-10.7-8.9-10.7-12.5v-40.4c0-8.7 7.3-10.9 10.7-10.9s10.7 2.1 10.7 10.9z"],hornbill:[512,512,[],"f592","M76.38 370.3a37.8 37.8 0 1 1 -32.07-32.42c-78.28-111.3 52-190.5 52-190.5-5.86 43-8.24 91.16-8.24 91.16-67.31 41.49 .93 64.06 39.81 72.87a140.4 140.4 0 0 0 131.7 91.94c1.92 0 3.77-.21 5.67-.28l.11 18.86c-99.22 1.39-158.7-29.14-188.9-51.6zm108-327.7A37.57 37.57 0 0 0 181 21.45a37.95 37.95 0 1 0 -31.17 54.22c-22.55 29.91-53.83 89.57-52.42 190l21.84-.15c0-.9-.14-1.77-.14-2.68A140.4 140.4 0 0 1 207 132.7c8-37.71 30.7-114.3 73.8-44.29 0 0 48.14 2.38 91.18 8.24 0 0-77.84-128-187.6-54.06zm304.2 134.2a37.94 37.94 0 1 0 -53.84-28.7C403 126.1 344.9 99 251.3 100.3l.14 22.5c2.7-.15 5.39-.41 8.14-.41a140.4 140.4 0 0 1 130.5 88.76c39.1 9 105.1 31.58 38.46 72.54 0 0-2.34 48.13-8.21 91.16 0 0 133.4-81.16 49-194.6a37.45 37.45 0 0 0 19.31-3.5zM374.1 436.2c21.43-32.46 46.42-89.69 45.14-179.7l-19.52 .14c.08 2.06 .3 4.07 .3 6.15a140.3 140.3 0 0 1 -91.39 131.4c-8.85 38.95-31.44 106.7-72.77 39.49 0 0-48.12-2.34-91.19-8.22 0 0 79.92 131.3 191.9 51a37.5 37.5 0 0 0 3.64 14 37.93 37.93 0 1 0 33.89-54.29z"],hotjar:[448,512,[],"f3b1","M414.9 161.5C340.2 29 121.1 0 121.1 0S222.2 110.4 93 197.7C11.3 252.8-21 324.4 14 402.6c26.8 59.9 83.5 84.3 144.6 93.4-29.2-55.1-6.6-122.4-4.1-129.6 57.1 86.4 165 0 110.8-93.9 71 15.4 81.6 138.6 27.1 215.5 80.5-25.3 134.1-88.9 148.8-145.6 15.5-59.3 3.7-127.9-26.3-180.9z"],houzz:[448,512,[],"f27c","M275.9 330.7H171.3V480H17V32h109.5v104.5l305.1 85.6V480H275.9z"],html5:[384,512,[],"f13b","M0 32l34.9 395.8L191.5 480l157.6-52.2L384 32H0zm308.2 127.9H124.4l4.1 49.4h175.6l-13.6 148.4-97.9 27v.3h-1.1l-98.7-27.3-6-75.8h47.7L138 320l53.5 14.5 53.7-14.5 6-62.2H84.3L71.5 112.2h241.1l-4.4 47.7z"],hubspot:[512,512,[],"f3b2","M267.4 211.6c-25.1 23.7-40.8 57.3-40.8 94.6 0 29.3 9.7 56.3 26 78L203.1 434c-4.4-1.6-9.1-2.5-14-2.5-10.8 0-20.9 4.2-28.5 11.8-7.6 7.6-11.8 17.8-11.8 28.6s4.2 20.9 11.8 28.5c7.6 7.6 17.8 11.6 28.5 11.6 10.8 0 20.9-3.9 28.6-11.6 7.6-7.6 11.8-17.8 11.8-28.5 0-4.2-.6-8.2-1.9-12.1l50-50.2c22 16.9 49.4 26.9 79.3 26.9 71.9 0 130-58.3 130-130.2 0-65.2-47.7-119.2-110.2-128.7V116c17.5-7.4 28.2-23.8 28.2-42.9 0-26.1-20.9-47.9-47-47.9S311.2 47 311.2 73.1c0 19.1 10.7 35.5 28.2 42.9v61.2c-15.2 2.1-29.6 6.7-42.7 13.6-27.6-20.9-117.5-85.7-168.9-124.8 1.2-4.4 2-9 2-13.8C129.8 23.4 106.3 0 77.4 0 48.6 0 25.2 23.4 25.2 52.2c0 28.9 23.4 52.3 52.2 52.3 9.8 0 18.9-2.9 26.8-7.6l163.2 114.7zm89.5 163.6c-38.1 0-69-30.9-69-69s30.9-69 69-69 69 30.9 69 69-30.9 69-69 69z"],ideal:[576,512,[],"e013","M125.6 165.5a49.07 49.07 0 1 0 49.06 49.06A49.08 49.08 0 0 0 125.6 165.5zM86.15 425.8h78.94V285.3H86.15zm151.5-211.6c0-20-10-22.53-18.74-22.53H204.8V237.5h14.05C228.6 237.5 237.6 234.7 237.6 214.2zm201.7 46V168.9h22.75V237.5h33.69C486.5 113.1 388.6 86.19 299.7 86.19H204.8V169h14c25.6 0 41.5 17.35 41.5 45.26 0 28.81-15.52 46-41.5 46h-14V425.9h94.83c144.6 0 194.9-67.16 196.7-165.6zm-109.8 0H273.3V169h54.43v22.73H296v10.58h30V225H296V237.5h33.51zm74.66 0-5.16-17.67H369.3l-5.18 17.67H340.5L368 168.9h32.35l27.53 91.34zM299.6 32H32V480H299.6c161.9 0 251-79.73 251-224.5C550.6 172 518 32 299.6 32zm0 426.9H53.07V53.07H299.6c142.1 0 229.9 64.61 229.9 202.4C529.5 389.6 448.5 458.9 299.6 458.9zm83.86-264.9L376 219.9H392.4l-7.52-25.81z"],imdb:[448,512,[],"f2d8","M89.5 323.6H53.93V186.2H89.5V323.6zM156.1 250.5L165.2 186.2H211.5V323.6H180.5V230.9L167.1 323.6H145.8L132.8 232.9L132.7 323.6H101.5V186.2H147.6C148.1 194.5 150.4 204.3 151.9 215.6L156.1 250.5zM223.7 323.6V186.2H250.3C267.3 186.2 277.3 187.1 283.3 188.6C289.4 190.3 294 192.8 297.2 196.5C300.3 199.8 302.3 203.1 303 208.5C303.9 212.9 304.4 221.6 304.4 234.7V282.9C304.4 295.2 303.7 303.4 302.5 307.6C301.4 311.7 299.4 315 296.5 317.3C293.7 319.7 290.1 321.4 285.8 322.3C281.6 323.1 275.2 323.6 266.7 323.6H223.7zM259.2 209.7V299.1C264.3 299.1 267.5 298.1 268.6 296.8C269.7 294.8 270.4 289.2 270.4 280.1V226.8C270.4 220.6 270.3 216.6 269.7 214.8C269.4 213 268.5 211.8 267.1 210.1C265.7 210.1 263 209.7 259.2 209.7V209.7zM316.5 323.6V186.2H350.6V230.1C353.5 227.7 356.7 225.2 360.1 223.5C363.7 222 368.9 221.1 372.9 221.1C377.7 221.1 381.8 221.9 385.2 223.3C388.6 224.8 391.2 226.8 393.2 229.5C394.9 232.1 395.9 234.8 396.3 237.3C396.7 239.9 396.1 245.3 396.1 253.5V292.1C396.1 300.3 396.3 306.4 395.3 310.5C394.2 314.5 391.5 318.1 387.5 320.1C383.4 324 378.6 325.4 372.9 325.4C368.9 325.4 363.7 324.5 360.2 322.9C356.7 321.1 353.5 318.4 350.6 314.9L348.5 323.6L316.5 323.6zM361.6 302.9C362.3 301.1 362.6 296.9 362.6 290.4V255C362.6 249.4 362.3 245.5 361.5 243.8C360.8 241.9 357.8 241.1 355.7 241.1C353.7 241.1 352.3 241.9 351.6 243.4C351 244.9 350.6 248.8 350.6 255V291.4C350.6 297.5 351 301.4 351.8 303C352.4 304.7 353.9 305.5 355.9 305.5C358.1 305.5 360.1 304.7 361.6 302.9L361.6 302.9zM418.4 32.04C434.1 33.27 447.1 47.28 447.1 63.92V448.1C447.1 464.5 435.2 478.5 418.9 479.1C418.6 479.1 418.4 480 418.1 480H29.88C29.6 480 29.32 479.1 29.04 479.9C13.31 478.5 1.093 466.1 0 449.7L.0186 61.78C1.081 45.88 13.82 33.09 30.26 31.1H417.7C417.9 31.1 418.2 32.01 418.4 32.04L418.4 32.04zM30.27 41.26C19 42.01 10.02 51.01 9.257 62.4V449.7C9.63 455.1 11.91 460.2 15.7 464C19.48 467.9 24.51 470.3 29.89 470.7H418.1C429.6 469.7 438.7 459.1 438.7 448.1V63.91C438.7 58.17 436.6 52.65 432.7 48.45C428.8 44.24 423.4 41.67 417.7 41.26L30.27 41.26z"],instagram:[448,512,[],"f16d","M224.1 141c-63.6 0-114.9 51.3-114.9 114.9s51.3 114.9 114.9 114.9S339 319.5 339 255.9 287.7 141 224.1 141zm0 189.6c-41.1 0-74.7-33.5-74.7-74.7s33.5-74.7 74.7-74.7 74.7 33.5 74.7 74.7-33.6 74.7-74.7 74.7zm146.4-194.3c0 14.9-12 26.8-26.8 26.8-14.9 0-26.8-12-26.8-26.8s12-26.8 26.8-26.8 26.8 12 26.8 26.8zm76.1 27.2c-1.7-35.9-9.9-67.7-36.2-93.9-26.2-26.2-58-34.4-93.9-36.2-37-2.1-147.9-2.1-184.9 0-35.8 1.7-67.6 9.9-93.9 36.1s-34.4 58-36.2 93.9c-2.1 37-2.1 147.9 0 184.9 1.7 35.9 9.9 67.7 36.2 93.9s58 34.4 93.9 36.2c37 2.1 147.9 2.1 184.9 0 35.9-1.7 67.7-9.9 93.9-36.2 26.2-26.2 34.4-58 36.2-93.9 2.1-37 2.1-147.8 0-184.8zM398.8 388c-7.8 19.6-22.9 34.7-42.6 42.6-29.5 11.7-99.5 9-132.1 9s-102.7 2.6-132.1-9c-19.6-7.8-34.7-22.9-42.6-42.6-11.7-29.5-9-99.5-9-132.1s-2.6-102.7 9-132.1c7.8-19.6 22.9-34.7 42.6-42.6 29.5-11.7 99.5-9 132.1-9s102.7-2.6 132.1 9c19.6 7.8 34.7 22.9 42.6 42.6 11.7 29.5 9 99.5 9 132.1s2.7 102.7-9 132.1z"],instalod:[512,512,[],"e081","M153.4 480H387.1L502.6 275.8 204.2 333.2zM504.7 240.1 387.1 32H155.7L360.2 267.9zM124.4 48.81 7.274 256 123.2 461.2 225.6 165.6z"],intercom:[448,512,[],"f7af","M392 32H56C25.1 32 0 57.1 0 88v336c0 30.9 25.1 56 56 56h336c30.9 0 56-25.1 56-56V88c0-30.9-25.1-56-56-56zm-108.3 82.1c0-19.8 29.9-19.8 29.9 0v199.5c0 19.8-29.9 19.8-29.9 0V114.1zm-74.6-7.5c0-19.8 29.9-19.8 29.9 0v216.5c0 19.8-29.9 19.8-29.9 0V106.6zm-74.7 7.5c0-19.8 29.9-19.8 29.9 0v199.5c0 19.8-29.9 19.8-29.9 0V114.1zM59.7 144c0-19.8 29.9-19.8 29.9 0v134.3c0 19.8-29.9 19.8-29.9 0V144zm323.4 227.8c-72.8 63-241.7 65.4-318.1 0-15-12.8 4.4-35.5 19.4-22.7 65.9 55.3 216.1 53.9 279.3 0 14.9-12.9 34.3 9.8 19.4 22.7zm5.2-93.5c0 19.8-29.9 19.8-29.9 0V144c0-19.8 29.9-19.8 29.9 0v134.3z"],"internet-explorer":[512,512,[],"f26b","M483 159.7c10.85-24.58 21.42-60.44 21.42-87.87 0-72.72-79.64-98.37-209.7-38.58-107.6-7.181-211.2 73.67-237.1 186.5 30.85-34.86 78.27-82.3 121.1-101.2C125.4 166.9 79.13 228 43.99 291.7 23.25 329.7 0 390.9 0 436.7c0 98.57 92.85 86.5 180.3 42.01 31.42 15.43 66.56 15.57 101.7 15.57 97.12 0 184.2-54.29 216.8-146H377.9c-52.51 88.59-196.8 52.1-196.8-47.44H509.9c6.407-43.58-1.655-95.71-26.85-141.2zM64.56 346.9c17.71 51.15 53.7 95.87 100.3 123.3-88.74 48.94-173.3 29.1-100.3-123.3zm115.1-108.9c2-55.15 50.28-94.87 103.1-94.87 53.42 0 101.1 39.72 103.1 94.87H180.5zm184.5-187.6c21.42-10.29 48.56-22 72.56-22 31.42 0 54.27 21.72 54.27 53.72 0 20-7.427 49.01-14.57 67.87-26.28-42.29-65.99-81.58-112.3-99.59z"],invision:[448,512,[],"f7b0","M407.4 32H40.6C18.2 32 0 50.2 0 72.6v366.8C0 461.8 18.2 480 40.6 480h366.8c22.4 0 40.6-18.2 40.6-40.6V72.6c0-22.4-18.2-40.6-40.6-40.6zM176.1 145.6c.4 23.4-22.4 27.3-26.6 27.4-14.9 0-27.1-12-27.1-27 .1-35.2 53.1-35.5 53.7-.4zM332.8 377c-65.6 0-34.1-74-25-106.6 14.1-46.4-45.2-59-59.9 .7l-25.8 103.3H177l8.1-32.5c-31.5 51.8-94.6 44.4-94.6-4.3 .1-14.3 .9-14 23-104.1H81.7l9.7-35.6h76.4c-33.6 133.7-32.6 126.9-32.9 138.2 0 20.9 40.9 13.5 57.4-23.2l19.8-79.4h-32.3l9.7-35.6h68.8l-8.9 40.5c40.5-75.5 127.9-47.8 101.8 38-14.2 51.1-14.6 50.7-14.9 58.8 0 15.5 17.5 22.6 31.8-16.9L386 325c-10.5 36.7-29.4 52-53.2 52z"],ioxhost:[640,512,[],"f208","M616 160h-67.3C511.2 70.7 422.9 8 320 8 183 8 72 119 72 256c0 16.4 1.6 32.5 4.7 48H24c-13.3 0-24 10.8-24 24 0 13.3 10.7 24 24 24h67.3c37.5 89.3 125.8 152 228.7 152 137 0 248-111 248-248 0-16.4-1.6-32.5-4.7-48H616c13.3 0 24-10.8 24-24 0-13.3-10.7-24-24-24zm-96 96c0 110.5-89.5 200-200 200-75.7 0-141.6-42-175.5-104H424c13.3 0 24-10.8 24-24 0-13.3-10.7-24-24-24H125.8c-3.8-15.4-5.8-31.4-5.8-48 0-110.5 89.5-200 200-200 75.7 0 141.6 42 175.5 104H216c-13.3 0-24 10.8-24 24 0 13.3 10.7 24 24 24h298.2c3.8 15.4 5.8 31.4 5.8 48zm-304-24h208c13.3 0 24 10.7 24 24 0 13.2-10.7 24-24 24H216c-13.3 0-24-10.7-24-24 0-13.2 10.7-24 24-24z"],"itch-io":[512,512,[],"f83a","M71.92 34.77C50.2 47.67 7.4 96.84 7 109.7v21.34c0 27.06 25.29 50.84 48.25 50.84 27.57 0 50.54-22.85 50.54-50 0 27.12 22.18 50 49.76 50s49-22.85 49-50c0 27.12 23.59 50 51.16 50h.5c27.57 0 51.16-22.85 51.16-50 0 27.12 21.47 50 49 50s49.76-22.85 49.76-50c0 27.12 23 50 50.54 50 23 0 48.25-23.78 48.25-50.84v-21.34c-.4-12.9-43.2-62.07-64.92-75C372.6 32.4 325.8 32 256 32S91.14 33.1 71.92 34.77zm132.3 134.4c-22 38.4-77.9 38.71-99.85 .25-13.17 23.14-43.17 32.07-56 27.66-3.87 40.15-13.67 237.1 17.73 269.1 80 18.67 302.1 18.12 379.8 0 31.65-32.27 21.32-232 17.75-269.1-12.92 4.44-42.88-4.6-56-27.66-22 38.52-77.85 38.1-99.85-.24-7.1 12.49-23.05 28.94-51.76 28.94a57.54 57.54 0 0 1 -51.75-28.94zm-41.58 53.77c16.47 0 31.09 0 49.22 19.78a436.9 436.9 0 0 1 88.18 0C318.2 223 332.9 223 349.3 223c52.33 0 65.22 77.53 83.87 144.4 17.26 62.15-5.52 63.67-33.95 63.73-42.15-1.57-65.49-32.18-65.49-62.79-39.25 6.43-101.9 8.79-155.6 0 0 30.61-23.34 61.22-65.49 62.79-28.42-.06-51.2-1.58-33.94-63.73 18.67-67 31.56-144.4 83.88-144.4zM256 270.8s-44.38 40.77-52.35 55.21l29-1.17v25.32c0 1.55 21.34 .16 23.33 .16 11.65 .54 23.31 1 23.31-.16v-25.28l29 1.17c-8-14.48-52.35-55.24-52.35-55.24z"],itunes:[448,512,[],"f3b4","M223.6 80.3C129 80.3 52.5 157 52.5 251.5S129 422.8 223.6 422.8s171.2-76.7 171.2-171.2c0-94.6-76.7-171.3-171.2-171.3zm79.4 240c-3.2 13.6-13.5 21.2-27.3 23.8-12.1 2.2-22.2 2.8-31.9-5-11.8-10-12-26.4-1.4-36.8 8.4-8 20.3-9.6 38-12.8 3-.5 5.6-1.2 7.7-3.7 3.2-3.6 2.2-2 2.2-80.8 0-5.6-2.7-7.1-8.4-6.1-4 .7-91.9 17.1-91.9 17.1-5 1.1-6.7 2.6-6.7 8.3 0 116.1 .5 110.8-1.2 118.5-2.1 9-7.6 15.8-14.9 19.6-8.3 4.6-23.4 6.6-31.4 5.2-21.4-4-28.9-28.7-14.4-42.9 8.4-8 20.3-9.6 38-12.8 3-.5 5.6-1.2 7.7-3.7 5-5.7 .9-127 2.6-133.7 .4-2.6 1.5-4.8 3.5-6.4 2.1-1.7 5.8-2.7 6.7-2.7 101-19 113.3-21.4 115.1-21.4 5.7-.4 9 3 9 8.7-.1 170.6 .4 161.4-1 167.6zM345.2 32H102.8C45.9 32 0 77.9 0 134.8v242.4C0 434.1 45.9 480 102.8 480h242.4c57 0 102.8-45.9 102.8-102.8V134.8C448 77.9 402.1 32 345.2 32zM223.6 444c-106.3 0-192.5-86.2-192.5-192.5S117.3 59 223.6 59s192.5 86.2 192.5 192.5S329.9 444 223.6 444z"],"itunes-note":[384,512,[],"f3b5","M381.9 388.2c-6.4 27.4-27.2 42.8-55.1 48-24.5 4.5-44.9 5.6-64.5-10.2-23.9-20.1-24.2-53.4-2.7-74.4 17-16.2 40.9-19.5 76.8-25.8 6-1.1 11.2-2.5 15.6-7.4 6.4-7.2 4.4-4.1 4.4-163.2 0-11.2-5.5-14.3-17-12.3-8.2 1.4-185.7 34.6-185.7 34.6-10.2 2.2-13.4 5.2-13.4 16.7 0 234.7 1.1 223.9-2.5 239.5-4.2 18.2-15.4 31.9-30.2 39.5-16.8 9.3-47.2 13.4-63.4 10.4-43.2-8.1-58.4-58-29.1-86.6 17-16.2 40.9-19.5 76.8-25.8 6-1.1 11.2-2.5 15.6-7.4 10.1-11.5 1.8-256.6 5.2-270.2 .8-5.2 3-9.6 7.1-12.9 4.2-3.5 11.8-5.5 13.4-5.5 204-38.2 228.9-43.1 232.4-43.1 11.5-.8 18.1 6 18.1 17.6 .2 344.5 1.1 326-1.8 338.5z"],java:[384,512,[],"f4e4","M277.7 312.9c9.8-6.7 23.4-12.5 23.4-12.5s-38.7 7-77.2 10.2c-47.1 3.9-97.7 4.7-123.1 1.3-60.1-8 33-30.1 33-30.1s-36.1-2.4-80.6 19c-52.5 25.4 130 37 224.5 12.1zm-85.4-32.1c-19-42.7-83.1-80.2 0-145.8C296 53.2 242.8 0 242.8 0c21.5 84.5-75.6 110.1-110.7 162.6-23.9 35.9 11.7 74.4 60.2 118.2zm114.6-176.2c.1 0-175.2 43.8-91.5 140.2 24.7 28.4-6.5 54-6.5 54s62.7-32.4 33.9-72.9c-26.9-37.8-47.5-56.6 64.1-121.3zm-6.1 270.5a12.19 12.19 0 0 1 -2 2.6c128.3-33.7 81.1-118.9 19.8-97.3a17.33 17.33 0 0 0 -8.2 6.3 70.45 70.45 0 0 1 11-3c31-6.5 75.5 41.5-20.6 91.4zM348 437.4s14.5 11.9-15.9 21.2c-57.9 17.5-240.8 22.8-291.6 .7-18.3-7.9 16-19 26.8-21.3 11.2-2.4 17.7-2 17.7-2-20.3-14.3-131.3 28.1-56.4 40.2C232.8 509.4 401 461.3 348 437.4zM124.4 396c-78.7 22 47.9 67.4 148.1 24.5a185.9 185.9 0 0 1 -28.2-13.8c-44.7 8.5-65.4 9.1-106 4.5-33.5-3.8-13.9-15.2-13.9-15.2zm179.8 97.2c-78.7 14.8-175.8 13.1-233.3 3.6 0-.1 11.8 9.7 72.4 13.6 92.2 5.9 233.8-3.3 237.1-46.9 0 0-6.4 16.5-76.2 29.7zM260.6 353c-59.2 11.4-93.5 11.1-136.8 6.6-33.5-3.5-11.6-19.7-11.6-19.7-86.8 28.8 48.2 61.4 169.5 25.9a60.37 60.37 0 0 1 -21.1-12.8z"],"jedi-order":[448,512,[],"f50e","M398.5 373.6c95.9-122.1 17.2-233.1 17.2-233.1 45.4 85.8-41.4 170.5-41.4 170.5 105-171.5-60.5-271.5-60.5-271.5 96.9 72.7-10.1 190.7-10.1 190.7 85.8 158.4-68.6 230.1-68.6 230.1s-.4-16.9-2.2-85.7c4.3 4.5 34.5 36.2 34.5 36.2l-24.2-47.4 62.6-9.1-62.6-9.1 20.2-55.5-31.4 45.9c-2.2-87.7-7.8-305.1-7.9-306.9v-2.4 1-1 2.4c0 1-5.6 219-7.9 306.9l-31.4-45.9 20.2 55.5-62.6 9.1 62.6 9.1-24.2 47.4 34.5-36.2c-1.8 68.8-2.2 85.7-2.2 85.7s-154.4-71.7-68.6-230.1c0 0-107-118.1-10.1-190.7 0 0-165.5 99.9-60.5 271.5 0 0-86.8-84.8-41.4-170.5 0 0-78.7 111 17.2 233.1 0 0-26.2-16.1-49.4-77.7 0 0 16.9 183.3 222 185.7h4.1c205-2.4 222-185.7 222-185.7-23.6 61.5-49.9 77.7-49.9 77.7z"],jenkins:[512,512,[],"f3b6","M487.1 425c-1.4-11.2-19-23.1-28.2-31.9-5.1-5-29-23.1-30.4-29.9-1.4-6.6 9.7-21.5 13.3-28.9 5.1-10.7 8.8-23.7 11.3-32.6 18.8-66.1 20.7-156.9-6.2-211.2-10.2-20.6-38.6-49-56.4-62.5-42-31.7-119.6-35.3-170.1-16.6-14.1 5.2-27.8 9.8-40.1 17.1-33.1 19.4-68.3 32.5-78.1 71.6-24.2 10.8-31.5 41.8-30.3 77.8 .2 7 4.1 15.8 2.7 22.4-.7 3.3-5.2 7.6-6.1 9.8-11.6 27.7-2.3 64 11.1 83.7 8.1 11.9 21.5 22.4 39.2 25.2 .7 10.6 3.3 19.7 8.2 30.4 3.1 6.8 14.7 19 10.4 27.7-2.2 4.4-21 13.8-27.3 17.6C89 407.2 73.7 415 54.2 429c-12.6 9-32.3 10.2-29.2 31.1 2.1 14.1 10.1 31.6 14.7 45.8 .7 2 1.4 4.1 2.1 6h422c4.9-15.3 9.7-30.9 14.6-47.2 3.4-11.4 10.2-27.8 8.7-39.7zM205.9 33.7c1.8-.5 3.4 .7 4.9 2.4-.2 5.2-5.4 5.1-8.9 6.8-5.4 6.7-13.4 9.8-20 17.2-6.8 7.5-14.4 27.7-23.4 30-4.5 1.1-9.7-.8-13.6-.5-10.4 .7-17.7 6-28.3 7.5 13.6-29.9 56.1-54 89.3-63.4zm-104.8 93.6c13.5-14.9 32.1-24.1 54.8-25.9 11.7 29.7-8.4 65-.9 97.6 2.3 9.9 10.2 25.4-2.4 25.7 .3-28.3-34.8-46.3-61.3-29.6-1.8-21.5-4.9-51.7 9.8-67.8zm36.7 200.2c-1-4.1-2.7-12.9-2.3-15.1 1.6-8.7 17.1-12.5 11-24.7-11.3-.1-13.8 10.2-24.1 11.3-26.7 2.6-45.6-35.4-44.4-58.4 1-19.5 17.6-38.2 40.1-35.8 16 1.8 21.4 19.2 24.5 34.7 9.2 .5 22.5-.4 26.9-7.6-.6-17.5-8.8-31.6-8.2-47.7 1-30.3 17.5-57.6 4.8-87.4 13.6-30.9 53.5-55.3 83.1-70 36.6-18.3 94.9-3.7 129.3 15.8 19.7 11.1 34.4 32.7 48.3 50.7-19.5-5.8-36.1 4.2-33.1 20.3 16.3-14.9 44.2-.2 52.5 16.4 7.9 15.8 7.8 39.3 9 62.8 2.9 57-10.4 115.9-39.1 157.1-7.7 11-14.1 23-24.9 30.6-26 18.2-65.4 34.7-99.2 23.4-44.7-15-65-44.8-89.5-78.8 .7 18.7 13.8 34.1 26.8 48.4 11.3 12.5 25 26.6 39.7 32.4-12.3-2.9-31.1-3.8-36.2 7.2-28.6-1.9-55.1-4.8-68.7-24.2-10.6-15.4-21.4-41.4-26.3-61.4zm222 124.1c4.1-3 11.1-2.9 17.4-3.6-5.4-2.7-13-3.7-19.3-2.2-.1-4.2-2-6.8-3.2-10.2 10.6-3.8 35.5-28.5 49.6-20.3 6.7 3.9 9.5 26.2 10.1 37 .4 9-.8 18-4.5 22.8-18.8-.6-35.8-2.8-50.7-7 .9-6.1-1-12.1 .6-16.5zm-17.2-20c-16.8 .8-26-1.2-38.3-10.8 .2-.8 1.4-.5 1.5-1.4 18 8 40.8-3.3 59-4.9-7.9 5.1-14.6 11.6-22.2 17.1zm-12.1 33.2c-1.6-9.4-3.5-12-2.8-20.2 25-16.6 29.7 28.6 2.8 20.2zM226 438.6c-11.6-.7-48.1-14-38.5-23.7 9.4 6.5 27.5 4.9 41.3 7.3 .8 4.4-2.8 10.2-2.8 16.4zM57.7 497.1c-4.3-12.7-9.2-25.1-14.8-36.9 30.8-23.8 65.3-48.9 102.2-63.5 2.8-1.1 23.2 25.4 26.2 27.6 16.5 11.7 37 21 56.2 30.2 1.2 8.8 3.9 20.2 8.7 35.5 .7 2.3 1.4 4.7 2.2 7.2H57.7zm240.6 5.7h-.8c.3-.2 .5-.4 .8-.5v.5zm7.5-5.7c2.1-1.4 4.3-2.8 6.4-4.3 1.1 1.4 2.2 2.8 3.2 4.3h-9.6zm15.1-24.7c-10.8 7.3-20.6 18.3-33.3 25.2-6 3.3-27 11.7-33.4 10.2-3.6-.8-3.9-5.3-5.4-9.5-3.1-9-10.1-23.4-10.8-37-.8-17.2-2.5-46 16-42.4 14.9 2.9 32.3 9.7 43.9 16.1 7.1 3.9 11.1 8.6 21.9 9.5-.1 1.4-.1 2.8-.2 4.3-5.9 3.9-15.3 3.8-21.8 7.1 9.5 .4 17 2.7 23.5 5.9-.1 3.4-.3 7-.4 10.6zm53.4 24.7h-14c-.1-3.2-2.8-5.8-6.1-5.8s-5.9 2.6-6.1 5.8h-17.4c-2.8-4.4-5.7-8.6-8.9-12.5 2.1-2.2 4-4.7 6-6.9 9 3.7 14.8-4.9 21.7-4.2 7.9 .8 14.2 11.7 25.4 11l-.6 12.6zm8.7 0c.2-4 .4-7.8 .6-11.5 15.6-7.3 29 1.3 35.7 11.5H383zm83.4-37c-2.3 11.2-5.8 24-9.9 37.1-.2-.1-.4-.1-.6-.1H428c.6-1.1 1.2-2.2 1.9-3.3-2.6-6.1-9-8.7-10.9-15.5 12.1-22.7 6.5-93.4-24.2-78.5 4.3-6.3 15.6-11.5 20.8-19.3 13 10.4 20.8 20.3 33.2 31.4 6.8 6 20 13.3 21.4 23.1 .8 5.5-2.6 18.9-3.8 25.1zM222.2 130.5c5.4-14.9 27.2-34.7 45-32 7.7 1.2 18 8.2 12.2 17.7-30.2-7-45.2 12.6-54.4 33.1-8.1-2-4.9-13.1-2.8-18.8zm184.1 63.1c8.2-3.6 22.4-.7 29.6-5.3-4.2-11.5-10.3-21.4-9.3-37.7 .5 0 1 0 1.4 .1 6.8 14.2 12.7 29.2 21.4 41.7-5.7 13.5-43.6 25.4-43.1 1.2zm20.4-43zm-117.2 45.7c-6.8-10.9-19-32.5-14.5-45.3 6.5 11.9 8.6 24.4 17.8 33.3 4.1 4 12.2 9 8.2 20.2-.9 2.7-7.8 8.6-11.7 9.7-14.4 4.3-47.9 .9-36.6-17.1 11.9 .7 27.9 7.8 36.8-.8zm27.3 70c3.8 6.6 1.4 18.7 12.1 20.6 20.2 3.4 43.6-12.3 58.1-17.8 9-15.2-.8-20.7-8.9-30.5-16.6-20-38.8-44.8-38-74.7 6.7-4.9 7.3 7.4 8.2 9.7 8.7 20.3 30.4 46.2 46.3 63.5 3.9 4.3 10.3 8.4 11 11.2 2.1 8.2-5.4 18-4.5 23.5-21.7 13.9-45.8 29.1-81.4 25.6-7.4-6.7-10.3-21.4-2.9-31.1zm-201.3-9.2c-6.8-3.9-8.4-21-16.4-21.4-11.4-.7-9.3 22.2-9.3 35.5-7.8-7.1-9.2-29.1-3.5-40.3-6.6-3.2-9.5 3.6-13.1 5.9 4.7-34.1 49.8-15.8 42.3 20.3zm299.6 28.8c-10.1 19.2-24.4 40.4-54 41-.6-6.2-1.1-15.6 0-19.4 22.7-2.2 36.6-13.7 54-21.6zm-141.9 12.4c18.9 9.9 53.6 11 79.3 10.2 1.4 5.6 1.3 12.6 1.4 19.4-33 1.8-72-6.4-80.7-29.6zm92.2 46.7c-1.7 4.3-5.3 9.3-9.8 11.1-12.1 4.9-45.6 8.7-62.4-.3-10.7-5.7-17.5-18.5-23.4-26-2.8-3.6-16.9-12.9-.2-12.9 13.1 32.7 58 29 95.8 28.1z"],jira:[496,512,[],"f7b1","M490 241.7C417.1 169 320.6 71.8 248.5 0 83 164.9 6 241.7 6 241.7c-7.9 7.9-7.9 20.7 0 28.7C138.8 402.7 67.8 331.9 248.5 512c379.4-378 15.7-16.7 241.5-241.7 8-7.9 8-20.7 0-28.6zm-241.5 90l-76-75.7 76-75.7 76 75.7-76 75.7z"],joget:[496,512,[],"f3b7","M378.1 45C337.6 19.9 292.6 8 248.2 8 165 8 83.8 49.9 36.9 125.9c-71.9 116.6-35.6 269.3 81 341.2s269.3 35.6 341.2-80.9c71.9-116.6 35.6-269.4-81-341.2zm51.8 323.2c-40.4 65.5-110.4 101.5-182 101.5-6.8 0-13.6-.4-20.4-1-9-13.6-19.9-33.3-23.7-42.4-5.7-13.7-27.2-45.6 31.2-67.1 51.7-19.1 176.7-16.5 208.8-17.6-4 9-8.6 17.9-13.9 26.6zm-200.8-86.3c-55.5-1.4-81.7-20.8-58.5-48.2s51.1-40.7 68.9-51.2c17.9-10.5 27.3-33.7-23.6-29.7C87.3 161.5 48.6 252.1 37.6 293c-8.8-49.7-.1-102.7 28.5-149.1C128 43.4 259.6 12.2 360.1 74.1c74.8 46.1 111.2 130.9 99.3 212.7-24.9-.5-179.3-3.6-230.3-4.9zm183.8-54.8c-22.7-6-57 11.3-86.7 27.2-29.7 15.8-31.1 8.2-31.1 8.2s40.2-28.1 50.7-34.5 31.9-14 13.4-24.6c-3.2-1.8-6.7-2.7-10.4-2.7-17.8 0-41.5 18.7-67.5 35.6-31.5 20.5-65.3 31.3-65.3 31.3l169.5-1.6 46.5-23.4s3.6-9.5-19.1-15.5z"],joomla:[448,512,[],"f1aa","M.6 92.1C.6 58.8 27.4 32 60.4 32c30 0 54.5 21.9 59.2 50.2 32.6-7.6 67.1 .6 96.5 30l-44.3 44.3c-20.5-20.5-42.6-16.3-55.4-3.5-14.3 14.3-14.3 37.9 0 52.2l99.5 99.5-44 44.3c-87.7-87.2-49.7-49.7-99.8-99.7-26.8-26.5-35-64.8-24.8-98.9C20.4 144.6 .6 120.7 .6 92.1zm129.5 116.4l44.3 44.3c10-10 89.7-89.7 99.7-99.8 14.3-14.3 37.6-14.3 51.9 0 12.8 12.8 17 35-3.5 55.4l44 44.3c31.2-31.2 38.5-67.6 28.9-101.2 29.2-4.1 51.9-29.2 51.9-59.5 0-33.2-26.8-60.1-59.8-60.1-30.3 0-55.4 22.5-59.5 51.6-33.8-9.9-71.7-1.5-98.3 25.1-18.3 19.1-71.1 71.5-99.6 99.9zm266.3 152.2c8.2-32.7-.9-68.5-26.3-93.9-11.8-12.2 5 4.7-99.5-99.7l-44.3 44.3 99.7 99.7c14.3 14.3 14.3 37.6 0 51.9-12.8 12.8-35 17-55.4-3.5l-44 44.3c27.6 30.2 68 38.8 102.7 28 5.5 27.4 29.7 48.1 58.9 48.1 33 0 59.8-26.8 59.8-60.1 0-30.2-22.5-55-51.6-59.1zm-84.3-53.1l-44-44.3c-87 86.4-50.4 50.4-99.7 99.8-14.3 14.3-37.6 14.3-51.9 0-13.1-13.4-16.9-35.3 3.2-55.4l-44-44.3c-30.2 30.2-38 65.2-29.5 98.3-26.7 6-46.2 29.9-46.2 58.2C0 453.2 26.8 480 59.8 480c28.6 0 52.5-19.8 58.6-46.7 32.7 8.2 68.5-.6 94.2-26 32.1-32 12.2-12.4 99.5-99.7z"],js:[448,512,[],"f3b8","M0 32v448h448V32H0zm243.8 349.4c0 43.6-25.6 63.5-62.9 63.5-33.7 0-53.2-17.4-63.2-38.5l34.3-20.7c6.6 11.7 12.6 21.6 27.1 21.6 13.8 0 22.6-5.4 22.6-26.5V237.7h42.1v143.7zm99.6 63.5c-39.1 0-64.4-18.6-76.7-43l34.3-19.8c9 14.7 20.8 25.6 41.5 25.6 17.4 0 28.6-8.7 28.6-20.8 0-14.4-11.4-19.5-30.7-28l-10.5-4.5c-30.4-12.9-50.5-29.2-50.5-63.5 0-31.6 24.1-55.6 61.6-55.6 26.8 0 46 9.3 59.8 33.7L368 290c-7.2-12.9-15-18-27.1-18-12.3 0-20.1 7.8-20.1 18 0 12.6 7.8 17.7 25.9 25.6l10.5 4.5c35.8 15.3 55.9 31 55.9 66.2 0 37.8-29.8 58.6-69.7 58.6z"],jsfiddle:[576,512,[],"f1cc","M510.6 237.5c-4.727-2.621-5.664-5.748-6.381-10.78-2.352-16.49-3.539-33.62-9.097-49.1-35.9-99.96-153.1-143.4-246.8-91.65-27.37 15.25-48.97 36.37-65.49 63.9-3.184-1.508-5.458-2.71-7.824-3.686-30.1-12.42-59.05-10.12-85.33 9.167-25.53 18.74-36.42 44.55-32.68 76.41 .355 3.025-1.967 7.621-4.514 9.545-39.71 29.99-56.03 78.07-41.9 124.6 13.83 45.57 57.51 79.8 105.6 81.43 30.29 1.031 60.64 .546 90.96 .539 84.04-.021 168.1 .531 252.1-.48 52.66-.634 96.11-36.87 108.2-87.29 11.54-48.07-11.14-97.3-56.83-122.6zm21.11 156.9c-18.23 22.43-42.34 35.25-71.28 35.65-56.87 .781-113.8 .23-170.7 .23 0 .7-163 .159-163.7 .154-43.86-.332-76.74-19.77-95.18-59.99-18.9-41.24-4.004-90.85 34.19-116.1 9.182-6.073 12.51-11.57 10.1-23.14-5.49-26.36 4.453-47.96 26.42-62.98 22.99-15.72 47.42-16.15 72.03-3.083 10.27 5.45 14.61 11.56 22.2-2.527 14.22-26.4 34.56-46.73 60.67-61.29 97.46-54.37 228.4 7.568 230.2 132.7 .122 8.15 2.412 12.43 9.848 15.89 57.56 26.83 74.46 96.12 35.14 144.5zm-87.79-80.5c-5.848 31.16-34.62 55.1-66.67 55.1-16.95-.001-32.06-6.545-44.08-17.7-27.7-25.71-71.14-74.98-95.94-93.39-20.06-14.89-41.99-12.33-60.27 3.782-49.1 44.07 15.86 121.8 67.06 77.19 4.548-3.96 7.84-9.543 12.74-12.84 8.184-5.509 20.77-.884 13.17 10.62-17.36 26.28-49.33 38.2-78.86 29.3-28.9-8.704-48.84-35.97-48.63-70.18 1.225-22.49 12.36-43.06 35.41-55.97 22.58-12.64 46.37-13.15 66.99 2.474C295.7 280.7 320.5 323.1 352.2 343.5c24.56 15.1 54.25 7.363 68.82-17.51 28.83-49.21-34.59-105-78.87-63.46-3.989 3.744-6.917 8.932-11.41 11.72-10.98 6.811-17.33-4.113-12.81-10.35 20.7-28.55 50.46-40.44 83.27-28.21 31.43 11.71 49.11 44.37 42.76 78.19z"],kaggle:[320,512,[],"f5fa","M304.2 501.5L158.4 320.3 298.2 185c2.6-2.7 1.7-10.5-5.3-10.5h-69.2c-3.5 0-7 1.8-10.5 5.3L80.9 313.5V7.5q0-7.5-7.5-7.5H21.5Q14 0 14 7.5v497q0 7.5 7.5 7.5h51.9q7.5 0 7.5-7.5v-109l30.8-29.3 110.5 140.6c3 3.5 6.5 5.3 10.5 5.3h66.9q5.25 0 6-3z"],keybase:[448,512,[],"f4f5","M286.2 419a18 18 0 1 0 18 18 18 18 0 0 0 -18-18zm111.9-147.6c-9.5-14.62-39.37-52.45-87.26-73.71q-9.1-4.06-18.38-7.27a78.43 78.43 0 0 0 -47.88-104.1c-12.41-4.1-23.33-6-32.41-5.77-.6-2-1.89-11 9.4-35L198.7 32l-5.48 7.56c-8.69 12.06-16.92 23.55-24.34 34.89a51 51 0 0 0 -8.29-1.25c-41.53-2.45-39-2.33-41.06-2.33-50.61 0-50.75 52.12-50.75 45.88l-2.36 36.68c-1.61 27 19.75 50.21 47.63 51.85l8.93 .54a214 214 0 0 0 -46.29 35.54C14 304.7 14 374 14 429.8v33.64l23.32-29.8a148.6 148.6 0 0 0 14.56 37.56c5.78 10.13 14.87 9.45 19.64 7.33 4.21-1.87 10-6.92 3.75-20.11a178.3 178.3 0 0 1 -15.76-53.13l46.82-59.83-24.66 74.11c58.23-42.4 157.4-61.76 236.3-38.59 34.2 10.05 67.45 .69 84.74-23.84 .72-1 1.2-2.16 1.85-3.22a156.1 156.1 0 0 1 2.8 28.43c0 23.3-3.69 52.93-14.88 81.64-2.52 6.46 1.76 14.5 8.6 15.74 7.42 1.57 15.33-3.1 18.37-11.15C429 443 434 414 434 382.3c0-38.58-13-77.46-35.91-110.9zM142.4 128.6l-15.7-.93-1.39 21.79 13.13 .78a93 93 0 0 0 .32 19.57l-22.38-1.34a12.28 12.28 0 0 1 -11.76-12.79L107 119c1-12.17 13.87-11.27 13.26-11.32l29.11 1.73a144.4 144.4 0 0 0 -7 19.17zm148.4 172.2a10.51 10.51 0 0 1 -14.35-1.39l-9.68-11.49-34.42 27a8.09 8.09 0 0 1 -11.13-1.08l-15.78-18.64a7.38 7.38 0 0 1 1.34-10.34l34.57-27.18-14.14-16.74-17.09 13.45a7.75 7.75 0 0 1 -10.59-1s-3.72-4.42-3.8-4.53a7.38 7.38 0 0 1 1.37-10.34L214 225.2s-18.51-22-18.6-22.14a9.56 9.56 0 0 1 1.74-13.42 10.38 10.38 0 0 1 14.3 1.37l81.09 96.32a9.58 9.58 0 0 1 -1.74 13.44zM187.4 419a18 18 0 1 0 18 18 18 18 0 0 0 -18-18z"],keycdn:[512,512,[],"f3ba","M63.8 409.3l60.5-59c32.1 42.8 71.1 66 126.6 67.4 30.5 .7 60.3-7 86.4-22.4 5.1 5.3 18.5 19.5 20.9 22-32.2 20.7-69.6 31.1-108.1 30.2-43.3-1.1-84.6-16.7-117.7-44.4 .3-.6-38.2 37.5-38.6 37.9 9.5 29.8-13.1 62.4-46.3 62.4C20.7 503.3 0 481.7 0 454.9c0-34.3 33.1-56.6 63.8-45.6zm354.9-252.4c19.1 31.3 29.6 67.4 28.7 104-1.1 44.8-19 87.5-48.6 121 .3 .3 23.8 25.2 24.1 25.5 9.6-1.3 19.2 2 25.9 9.1 11.3 12 10.9 30.9-1.1 42.4-12 11.3-30.9 10.9-42.4-1.1-6.7-7-9.4-16.8-7.6-26.3-24.9-26.6-44.4-47.2-44.4-47.2 42.7-34.1 63.3-79.6 64.4-124.2 .7-28.9-7.2-57.2-21.1-82.2l22.1-21zM104 53.1c6.7 7 9.4 16.8 7.6 26.3l45.9 48.1c-4.7 3.8-13.3 10.4-22.8 21.3-25.4 28.5-39.6 64.8-40.7 102.9-.7 28.9 6.1 57.2 20 82.4l-22 21.5C72.7 324 63.1 287.9 64.2 250.9c1-44.6 18.3-87.6 47.5-121.1l-25.3-26.4c-9.6 1.3-19.2-2-25.9-9.1-11.3-12-10.9-30.9 1.1-42.4C73.5 40.7 92.2 41 104 53.1zM464.9 8c26 0 47.1 22.4 47.1 48.3S490.9 104 464.9 104c-6.3 .1-14-1.1-15.9-1.8l-62.9 59.7c-32.7-43.6-76.7-65.9-126.9-67.2-30.5-.7-60.3 6.8-86.2 22.4l-21.1-22C184.1 74.3 221.5 64 260 64.9c43.3 1.1 84.6 16.7 117.7 44.6l41.1-38.6c-1.5-4.7-2.2-9.6-2.2-14.5C416.5 29.7 438.9 8 464.9 8zM256.7 113.4c5.5 0 10.9 .4 16.4 1.1 78.1 9.8 133.4 81.1 123.8 159.1-9.8 78.1-81.1 133.4-159.1 123.8-78.1-9.8-133.4-81.1-123.8-159.2 9.3-72.4 70.1-124.6 142.7-124.8zm-59 119.4c.6 22.7 12.2 41.8 32.4 52.2l-11 51.7h73.7l-11-51.7c20.1-10.9 32.1-29 32.4-52.2-.4-32.8-25.8-57.5-58.3-58.3-32.1 .8-57.3 24.8-58.2 58.3zM256 160"],kickstarter:[448,512,[],"f3bb","M400 480H48c-26.4 0-48-21.6-48-48V80c0-26.4 21.6-48 48-48h352c26.4 0 48 21.6 48 48v352c0 26.4-21.6 48-48 48zM199.6 178.5c0-30.7-17.6-45.1-39.7-45.1-25.8 0-40 19.8-40 44.5v154.8c0 25.8 13.7 45.6 40.5 45.6 21.5 0 39.2-14 39.2-45.6v-41.8l60.6 75.7c12.3 14.9 39 16.8 55.8 0 14.6-15.1 14.8-36.8 4-50.4l-49.1-62.8 40.5-58.7c9.4-13.5 9.5-34.5-5.6-49.1-16.4-15.9-44.6-17.3-61.4 7l-44.8 64.7v-38.8z"],"kickstarter-k":[384,512,[],"f3bc","M147.3 114.4c0-56.2-32.5-82.4-73.4-82.4C26.2 32 0 68.2 0 113.4v283c0 47.3 25.3 83.4 74.9 83.4 39.8 0 72.4-25.6 72.4-83.4v-76.5l112.1 138.3c22.7 27.2 72.1 30.7 103.2 0 27-27.6 27.3-67.4 7.4-92.2l-90.8-114.8 74.9-107.4c17.4-24.7 17.5-63.1-10.4-89.8-30.3-29-82.4-31.6-113.6 12.8L147.3 185v-70.6z"],korvue:[446,512,[],"f42f","M386.5 34h-327C26.8 34 0 60.8 0 93.5v327.1C0 453.2 26.8 480 59.5 480h327.1c33 0 59.5-26.8 59.5-59.5v-327C446 60.8 419.2 34 386.5 34zM87.1 120.8h96v116l61.8-116h110.9l-81.2 132H87.1v-132zm161.8 272.1l-65.7-113.6v113.6h-96V262.1h191.5l88.6 130.8H248.9z"],laravel:[512,512,[],"f3bd","M504.4 115.8a5.72 5.72 0 0 0 -.28-.68 8.52 8.52 0 0 0 -.53-1.25 6 6 0 0 0 -.54-.71 9.36 9.36 0 0 0 -.72-.94c-.23-.22-.52-.4-.77-.6a8.84 8.84 0 0 0 -.9-.68L404.4 55.55a8 8 0 0 0 -8 0L300.1 111h0a8.07 8.07 0 0 0 -.88 .69 7.68 7.68 0 0 0 -.78 .6 8.23 8.23 0 0 0 -.72 .93c-.17 .24-.39 .45-.54 .71a9.7 9.7 0 0 0 -.52 1.25c-.08 .23-.21 .44-.28 .68a8.08 8.08 0 0 0 -.28 2.08V223.2l-80.22 46.19V63.44a7.8 7.8 0 0 0 -.28-2.09c-.06-.24-.2-.45-.28-.68a8.35 8.35 0 0 0 -.52-1.24c-.14-.26-.37-.47-.54-.72a9.36 9.36 0 0 0 -.72-.94 9.46 9.46 0 0 0 -.78-.6 9.8 9.8 0 0 0 -.88-.68h0L115.6 1.07a8 8 0 0 0 -8 0L11.34 56.49h0a6.52 6.52 0 0 0 -.88 .69 7.81 7.81 0 0 0 -.79 .6 8.15 8.15 0 0 0 -.71 .93c-.18 .25-.4 .46-.55 .72a7.88 7.88 0 0 0 -.51 1.24 6.46 6.46 0 0 0 -.29 .67 8.18 8.18 0 0 0 -.28 2.1v329.7a8 8 0 0 0 4 6.95l192.5 110.8a8.83 8.83 0 0 0 1.33 .54c.21 .08 .41 .2 .63 .26a7.92 7.92 0 0 0 4.1 0c.2-.05 .37-.16 .55-.22a8.6 8.6 0 0 0 1.4-.58L404.4 400.1a8 8 0 0 0 4-6.95V287.9l92.24-53.11a8 8 0 0 0 4-7V117.9A8.63 8.63 0 0 0 504.4 115.8zM111.6 17.28h0l80.19 46.15-80.2 46.18L31.41 63.44zm88.25 60V278.6l-46.53 26.79-33.69 19.4V123.5l46.53-26.79zm0 412.8L23.37 388.5V77.32L57.06 96.7l46.52 26.8V338.7a6.94 6.94 0 0 0 .12 .9 8 8 0 0 0 .16 1.18h0a5.92 5.92 0 0 0 .38 .9 6.38 6.38 0 0 0 .42 1v0a8.54 8.54 0 0 0 .6 .78 7.62 7.62 0 0 0 .66 .84l0 0c.23 .22 .52 .38 .77 .58a8.93 8.93 0 0 0 .86 .66l0 0 0 0 92.19 52.18zm8-106.2-80.06-45.32 84.09-48.41 92.26-53.11 80.13 46.13-58.8 33.56zm184.5 4.57L215.9 490.1V397.8L346.6 323.2l45.77-26.15zm0-119.1L358.7 250l-46.53-26.79V131.8l33.69 19.4L392.4 178zm8-105.3-80.2-46.17 80.2-46.16 80.18 46.15zm8 105.3V178L455 151.2l33.68-19.4v91.39h0z"],lastfm:[512,512,[],"f202","M225.8 367.1l-18.8-51s-30.5 34-76.2 34c-40.5 0-69.2-35.2-69.2-91.5 0-72.1 36.4-97.9 72.1-97.9 66.5 0 74.8 53.3 100.9 134.9 18.8 56.9 54 102.6 155.4 102.6 72.7 0 122-22.3 122-80.9 0-72.9-62.7-80.6-115-92.1-25.8-5.9-33.4-16.4-33.4-34 0-19.9 15.8-31.7 41.6-31.7 28.2 0 43.4 10.6 45.7 35.8l58.6-7c-4.7-52.8-41.1-74.5-100.9-74.5-52.8 0-104.4 19.9-104.4 83.9 0 39.9 19.4 65.1 68 76.8 44.9 10.6 79.8 13.8 79.8 45.7 0 21.7-21.1 30.5-61 30.5-59.2 0-83.9-31.1-97.9-73.9-32-96.8-43.6-163-161.3-163C45.7 113.8 0 168.3 0 261c0 89.1 45.7 137.2 127.9 137.2 66.2 0 97.9-31.1 97.9-31.1z"],leanpub:[576,512,[],"f212","M386.5 111.5l15.1 248.1-10.98-.275c-36.23-.824-71.64 8.783-102.7 27.1-31.02-19.21-66.42-27.1-102.7-27.1-45.56 0-82.07 10.7-123.5 27.72L93.12 129.6c28.55-11.8 61.48-18.11 92.23-18.11 41.17 0 73.84 13.18 102.7 42.54 27.72-28.27 59.01-41.72 98.54-42.54zM569.1 448c-25.53 0-47.49-5.215-70.54-15.65-34.31-15.65-69.99-24.98-107.9-24.98-38.98 0-74.93 12.9-102.7 40.62-27.72-27.72-63.68-40.62-102.7-40.62-37.88 0-73.56 9.333-107.9 24.98C55.24 442.2 32.73 448 8.303 448H6.93L49.47 98.86C88.73 76.63 136.5 64 181.8 64 218.8 64 256.1 71.68 288 93.1 319 71.68 357.2 64 394.2 64c45.29 0 93.05 12.63 132.3 34.86L569.1 448zm-43.37-44.74l-34.04-280.2c-30.74-13.1-67.25-21.41-101-21.41-38.43 0-74.39 12.08-102.7 38.7-28.27-26.63-64.23-38.7-102.7-38.7-33.76 0-70.27 7.411-101 21.41L50.3 403.3c47.21-19.49 82.89-33.49 135-33.49 37.6 0 70.82 9.606 102.7 29.64 31.84-20.04 65.05-29.64 102.7-29.64 52.15 0 87.83 13.1 135 33.49z"],less:[640,512,[],"f41d","M612.7 219c0-20.5 3.2-32.6 3.2-54.6 0-34.2-12.6-45.2-40.5-45.2h-20.5v24.2h6.3c14.2 0 17.3 4.7 17.3 22.1 0 16.3-1.6 32.6-1.6 51.5 0 24.2 7.9 33.6 23.6 37.3v1.6c-15.8 3.7-23.6 13.1-23.6 37.3 0 18.9 1.6 34.2 1.6 51.5 0 17.9-3.7 22.6-17.3 22.6v.5h-6.3V393h20.5c27.8 0 40.5-11 40.5-45.2 0-22.6-3.2-34.2-3.2-54.6 0-11 6.8-22.6 27.3-23.6v-27.3c-20.5-.7-27.3-12.3-27.3-23.3zm-105.6 32c-15.8-6.3-30.5-10-30.5-20.5 0-7.9 6.3-12.6 17.9-12.6s22.1 4.7 33.6 13.1l21-27.8c-13.1-10-31-20.5-55.2-20.5-35.7 0-59.9 20.5-59.9 49.4 0 25.7 22.6 38.9 41.5 46.2 16.3 6.3 32.1 11.6 32.1 22.1 0 7.9-6.3 13.1-20.5 13.1-13.1 0-26.3-5.3-40.5-16.3l-21 30.5c15.8 13.1 39.9 22.1 59.9 22.1 42 0 64.6-22.1 64.6-51s-22.5-41-43-47.8zm-358.9 59.4c-3.7 0-8.4-3.2-8.4-13.1V119.1H65.2c-28.4 0-41 11-41 45.2 0 22.6 3.2 35.2 3.2 54.6 0 11-6.8 22.6-27.3 23.6v27.3c20.5 .5 27.3 12.1 27.3 23.1 0 19.4-3.2 31-3.2 53.6 0 34.2 12.6 45.2 40.5 45.2h20.5v-24.2h-6.3c-13.1 0-17.3-5.3-17.3-22.6s1.6-32.1 1.6-51.5c0-24.2-7.9-33.6-23.6-37.3v-1.6c15.8-3.7 23.6-13.1 23.6-37.3 0-18.9-1.6-34.2-1.6-51.5s3.7-22.1 17.3-22.1H93v150.8c0 32.1 11 53.1 43.1 53.1 10 0 17.9-1.6 23.6-3.7l-5.3-34.2c-3.1 .8-4.6 .8-6.2 .8zM379.9 251c-16.3-6.3-31-10-31-20.5 0-7.9 6.3-12.6 17.9-12.6 11.6 0 22.1 4.7 33.6 13.1l21-27.8c-13.1-10-31-20.5-55.2-20.5-35.7 0-59.9 20.5-59.9 49.4 0 25.7 22.6 38.9 41.5 46.2 16.3 6.3 32.1 11.6 32.1 22.1 0 7.9-6.3 13.1-20.5 13.1-13.1 0-26.3-5.3-40.5-16.3l-20.5 30.5c15.8 13.1 39.9 22.1 59.9 22.1 42 0 64.6-22.1 64.6-51 .1-28.9-22.5-41-43-47.8zm-155-68.8c-38.4 0-75.1 32.1-74.1 82.5 0 52 34.2 82.5 79.3 82.5 18.9 0 39.9-6.8 56.2-17.9l-15.8-27.8c-11.6 6.8-22.6 10-34.2 10-21 0-37.3-10-41.5-34.2H290c.5-3.7 1.6-11 1.6-19.4 .6-42.6-22.6-75.7-66.7-75.7zm-30 66.2c3.2-21 15.8-31 30.5-31 18.9 0 26.3 13.1 26.3 31h-56.8z"],line:[448,512,[],"f3c0","M272.1 204.2v71.1c0 1.8-1.4 3.2-3.2 3.2h-11.4c-1.1 0-2.1-.6-2.6-1.3l-32.6-44v42.2c0 1.8-1.4 3.2-3.2 3.2h-11.4c-1.8 0-3.2-1.4-3.2-3.2v-71.1c0-1.8 1.4-3.2 3.2-3.2H219c1 0 2.1 .5 2.6 1.4l32.6 44v-42.2c0-1.8 1.4-3.2 3.2-3.2h11.4c1.8-.1 3.3 1.4 3.3 3.1zm-82-3.2h-11.4c-1.8 0-3.2 1.4-3.2 3.2v71.1c0 1.8 1.4 3.2 3.2 3.2h11.4c1.8 0 3.2-1.4 3.2-3.2v-71.1c0-1.7-1.4-3.2-3.2-3.2zm-27.5 59.6h-31.1v-56.4c0-1.8-1.4-3.2-3.2-3.2h-11.4c-1.8 0-3.2 1.4-3.2 3.2v71.1c0 .9 .3 1.6 .9 2.2 .6 .5 1.3 .9 2.2 .9h45.7c1.8 0 3.2-1.4 3.2-3.2v-11.4c0-1.7-1.4-3.2-3.1-3.2zM332.1 201h-45.7c-1.7 0-3.2 1.4-3.2 3.2v71.1c0 1.7 1.4 3.2 3.2 3.2h45.7c1.8 0 3.2-1.4 3.2-3.2v-11.4c0-1.8-1.4-3.2-3.2-3.2H301v-12h31.1c1.8 0 3.2-1.4 3.2-3.2V234c0-1.8-1.4-3.2-3.2-3.2H301v-12h31.1c1.8 0 3.2-1.4 3.2-3.2v-11.4c-.1-1.7-1.5-3.2-3.2-3.2zM448 113.7V399c-.1 44.8-36.8 81.1-81.7 81H81c-44.8-.1-81.1-36.9-81-81.7V113c.1-44.8 36.9-81.1 81.7-81H367c44.8 .1 81.1 36.8 81 81.7zm-61.6 122.6c0-73-73.2-132.4-163.1-132.4-89.9 0-163.1 59.4-163.1 132.4 0 65.4 58 120.2 136.4 130.6 19.1 4.1 16.9 11.1 12.6 36.8-.7 4.1-3.3 16.1 14.1 8.8 17.4-7.3 93.9-55.3 128.2-94.7 23.6-26 34.9-52.3 34.9-81.5z"],linkedin:[448,512,[],"f08c","M416 32H31.9C14.3 32 0 46.5 0 64.3v383.4C0 465.5 14.3 480 31.9 480H416c17.6 0 32-14.5 32-32.3V64.3c0-17.8-14.4-32.3-32-32.3zM135.4 416H69V202.2h66.5V416zm-33.2-243c-21.3 0-38.5-17.3-38.5-38.5S80.9 96 102.2 96c21.2 0 38.5 17.3 38.5 38.5 0 21.3-17.2 38.5-38.5 38.5zm282.1 243h-66.4V312c0-24.8-.5-56.7-34.5-56.7-34.6 0-39.9 27-39.9 54.9V416h-66.4V202.2h63.7v29.2h.9c8.9-16.8 30.6-34.5 62.9-34.5 67.2 0 79.7 44.3 79.7 101.9V416z"],"linkedin-in":[448,512,[],"f0e1","M100.3 448H7.4V148.9h92.88zM53.79 108.1C24.09 108.1 0 83.5 0 53.8a53.79 53.79 0 0 1 107.6 0c0 29.7-24.1 54.3-53.79 54.3zM447.9 448h-92.68V302.4c0-34.7-.7-79.2-48.29-79.2-48.29 0-55.69 37.7-55.69 76.7V448h-92.78V148.9h89.08v40.8h1.3c12.4-23.5 42.69-48.3 87.88-48.3 94 0 111.3 61.9 111.3 142.3V448z"],linode:[448,512,[],"f2b8","M366 186.9l-59.5 36.87-.838 36.87-29.33-19.27-39.38 24.3c2.238 55.21 2.483 59.27 2.51 59.5l-97.2 65.36L127.2 285.7l108.1-62.01L195.1 197.8l-75.42 38.55L98.72 93.01 227.8 43.57 136.4 0 10.74 39.38 38.39 174.3l41.9 32.68L48.44 222.1 69.39 323.5 98.72 351.1 77.77 363.7l16.76 78.77L160.7 512c-10.8-74.84-11.66-78.64-11.73-78.77l77.93-55.3c16.76-12.57 15.08-10.89 15.08-10.89l.838 24.3 33.52 28.49-.838-77.09 46.93-33.52 26.82-18.43-2.514 36.03 25.14 17.6 6.7-74.58 58.66-43.58z"],linux:[448,512,[],"f17c","M220.8 123.3c1 .5 1.8 1.7 3 1.7 1.1 0 2.8-.4 2.9-1.5 .2-1.4-1.9-2.3-3.2-2.9-1.7-.7-3.9-1-5.5-.1-.4 .2-.8 .7-.6 1.1 .3 1.3 2.3 1.1 3.4 1.7zm-21.9 1.7c1.2 0 2-1.2 3-1.7 1.1-.6 3.1-.4 3.5-1.6 .2-.4-.2-.9-.6-1.1-1.6-.9-3.8-.6-5.5 .1-1.3 .6-3.4 1.5-3.2 2.9 .1 1 1.8 1.5 2.8 1.4zM420 403.8c-3.6-4-5.3-11.6-7.2-19.7-1.8-8.1-3.9-16.8-10.5-22.4-1.3-1.1-2.6-2.1-4-2.9-1.3-.8-2.7-1.5-4.1-2 9.2-27.3 5.6-54.5-3.7-79.1-11.4-30.1-31.3-56.4-46.5-74.4-17.1-21.5-33.7-41.9-33.4-72C311.1 85.4 315.7 .1 234.8 0 132.4-.2 158 103.4 156.9 135.2c-1.7 23.4-6.4 41.8-22.5 64.7-18.9 22.5-45.5 58.8-58.1 96.7-6 17.9-8.8 36.1-6.2 53.3-6.5 5.8-11.4 14.7-16.6 20.2-4.2 4.3-10.3 5.9-17 8.3s-14 6-18.5 14.5c-2.1 3.9-2.8 8.1-2.8 12.4 0 3.9 .6 7.9 1.2 11.8 1.2 8.1 2.5 15.7 .8 20.8-5.2 14.4-5.9 24.4-2.2 31.7 3.8 7.3 11.4 10.5 20.1 12.3 17.3 3.6 40.8 2.7 59.3 12.5 19.8 10.4 39.9 14.1 55.9 10.4 11.6-2.6 21.1-9.6 25.9-20.2 12.5-.1 26.3-5.4 48.3-6.6 14.9-1.2 33.6 5.3 55.1 4.1 .6 2.3 1.4 4.6 2.5 6.7v.1c8.3 16.7 23.8 24.3 40.3 23 16.6-1.3 34.1-11 48.3-27.9 13.6-16.4 36-23.2 50.9-32.2 7.4-4.5 13.4-10.1 13.9-18.3 .4-8.2-4.4-17.3-15.5-29.7zM223.7 87.3c9.8-22.2 34.2-21.8 44-.4 6.5 14.2 3.6 30.9-4.3 40.4-1.6-.8-5.9-2.6-12.6-4.9 1.1-1.2 3.1-2.7 3.9-4.6 4.8-11.8-.2-27-9.1-27.3-7.3-.5-13.9 10.8-11.8 23-4.1-2-9.4-3.5-13-4.4-1-6.9-.3-14.6 2.9-21.8zM183 75.8c10.1 0 20.8 14.2 19.1 33.5-3.5 1-7.1 2.5-10.2 4.6 1.2-8.9-3.3-20.1-9.6-19.6-8.4 .7-9.8 21.2-1.8 28.1 1 .8 1.9-.2-5.9 5.5-15.6-14.6-10.5-52.1 8.4-52.1zm-13.6 60.7c6.2-4.6 13.6-10 14.1-10.5 4.7-4.4 13.5-14.2 27.9-14.2 7.1 0 15.6 2.3 25.9 8.9 6.3 4.1 11.3 4.4 22.6 9.3 8.4 3.5 13.7 9.7 10.5 18.2-2.6 7.1-11 14.4-22.7 18.1-11.1 3.6-19.8 16-38.2 14.9-3.9-.2-7-1-9.6-2.1-8-3.5-12.2-10.4-20-15-8.6-4.8-13.2-10.4-14.7-15.3-1.4-4.9 0-9 4.2-12.3zm3.3 334c-2.7 35.1-43.9 34.4-75.3 18-29.9-15.8-68.6-6.5-76.5-21.9-2.4-4.7-2.4-12.7 2.6-26.4v-.2c2.4-7.6 .6-16-.6-23.9-1.2-7.8-1.8-15 .9-20 3.5-6.7 8.5-9.1 14.8-11.3 10.3-3.7 11.8-3.4 19.6-9.9 5.5-5.7 9.5-12.9 14.3-18 5.1-5.5 10-8.1 17.7-6.9 8.1 1.2 15.1 6.8 21.9 16l19.6 35.6c9.5 19.9 43.1 48.4 41 68.9zm-1.4-25.9c-4.1-6.6-9.6-13.6-14.4-19.6 7.1 0 14.2-2.2 16.7-8.9 2.3-6.2 0-14.9-7.4-24.9-13.5-18.2-38.3-32.5-38.3-32.5-13.5-8.4-21.1-18.7-24.6-29.9s-3-23.3-.3-35.2c5.2-22.9 18.6-45.2 27.2-59.2 2.3-1.7 .8 3.2-8.7 20.8-8.5 16.1-24.4 53.3-2.6 82.4 .6-20.7 5.5-41.8 13.8-61.5 12-27.4 37.3-74.9 39.3-112.7 1.1 .8 4.6 3.2 6.2 4.1 4.6 2.7 8.1 6.7 12.6 10.3 12.4 10 28.5 9.2 42.4 1.2 6.2-3.5 11.2-7.5 15.9-9 9.9-3.1 17.8-8.6 22.3-15 7.7 30.4 25.7 74.3 37.2 95.7 6.1 11.4 18.3 35.5 23.6 64.6 3.3-.1 7 .4 10.9 1.4 13.8-35.7-11.7-74.2-23.3-84.9-4.7-4.6-4.9-6.6-2.6-6.5 12.6 11.2 29.2 33.7 35.2 59 2.8 11.6 3.3 23.7 .4 35.7 16.4 6.8 35.9 17.9 30.7 34.8-2.2-.1-3.2 0-4.2 0 3.2-10.1-3.9-17.6-22.8-26.1-19.6-8.6-36-8.6-38.3 12.5-12.1 4.2-18.3 14.7-21.4 27.3-2.8 11.2-3.6 24.7-4.4 39.9-.5 7.7-3.6 18-6.8 29-32.1 22.9-76.7 32.9-114.3 7.2zm257.4-11.5c-.9 16.8-41.2 19.9-63.2 46.5-13.2 15.7-29.4 24.4-43.6 25.5s-26.5-4.8-33.7-19.3c-4.7-11.1-2.4-23.1 1.1-36.3 3.7-14.2 9.2-28.8 9.9-40.6 .8-15.2 1.7-28.5 4.2-38.7 2.6-10.3 6.6-17.2 13.7-21.1 .3-.2 .7-.3 1-.5 .8 13.2 7.3 26.6 18.8 29.5 12.6 3.3 30.7-7.5 38.4-16.3 9-.3 15.7-.9 22.6 5.1 9.9 8.5 7.1 30.3 17.1 41.6 10.6 11.6 14 19.5 13.7 24.6zM173.3 148.7c2 1.9 4.7 4.5 8 7.1 6.6 5.2 15.8 10.6 27.3 10.6 11.6 0 22.5-5.9 31.8-10.8 4.9-2.6 10.9-7 14.8-10.4s5.9-6.3 3.1-6.6-2.6 2.6-6 5.1c-4.4 3.2-9.7 7.4-13.9 9.8-7.4 4.2-19.5 10.2-29.9 10.2s-18.7-4.8-24.9-9.7c-3.1-2.5-5.7-5-7.7-6.9-1.5-1.4-1.9-4.6-4.3-4.9-1.4-.1-1.8 3.7 1.7 6.5z"],lyft:[512,512,[],"f3c3","M0 81.1h77.8v208.7c0 33.1 15 52.8 27.2 61-12.7 11.1-51.2 20.9-80.2-2.8C7.8 334 0 310.7 0 289V81.1zm485.9 173.5v-22h23.8v-76.8h-26.1c-10.1-46.3-51.2-80.7-100.3-80.7-56.6 0-102.7 46-102.7 102.7V357c16 2.3 35.4-.3 51.7-14 17.1-14 24.8-37.2 24.8-59v-6.7h38.8v-76.8h-38.8v-23.3c0-34.6 52.2-34.6 52.2 0v77.1c0 56.6 46 102.7 102.7 102.7v-76.5c-14.5 0-26.1-11.7-26.1-25.9zm-294.3-99v113c0 15.4-23.8 15.4-23.8 0v-113H91v132.7c0 23.8 8 54 45 63.9 37 9.8 58.2-10.6 58.2-10.6-2.1 13.4-14.5 23.3-34.9 25.3-15.5 1.6-35.2-3.6-45-7.8v70.3c25.1 7.5 51.5 9.8 77.6 4.7 47.1-9.1 76.8-48.4 76.8-100.8V155.1h-77.1v.5z"],magento:[448,512,[],"f3c4","M445.7 127.9V384l-63.4 36.5V164.7L223.8 73.1 65.2 164.7l.4 255.9L2.3 384V128.1L224.2 0l221.5 127.9zM255.6 420.5L224 438.9l-31.8-18.2v-256l-63.3 36.6 .1 255.9 94.9 54.9 95.1-54.9v-256l-63.4-36.6v255.9z"],mailchimp:[448,512,[],"f59e","M330.6 243.5a36.15 36.15 0 0 1 9.3 0c1.66-3.83 1.95-10.43 .45-17.61-2.23-10.67-5.25-17.14-11.48-16.13s-6.47 8.74-4.24 19.42c1.26 6 3.49 11.14 6 14.32zM277 252c4.47 2 7.2 3.26 8.28 2.13 1.89-1.94-3.48-9.39-12.12-13.09a31.44 31.44 0 0 0 -30.61 3.68c-3 2.18-5.81 5.22-5.41 7.06 .85 3.74 10-2.71 22.6-3.48 7-.44 12.8 1.75 17.26 3.71zm-9 5.13c-9.07 1.42-15 6.53-13.47 10.1 .9 .34 1.17 .81 5.21-.81a37 37 0 0 1 18.72-1.95c2.92 .34 4.31 .52 4.94-.49 1.46-2.22-5.71-8-15.39-6.85zm54.17 17.1c3.38-6.87-10.9-13.93-14.3-7s10.92 13.88 14.32 6.97zm15.66-20.47c-7.66-.13-7.95 15.8-.26 15.93s7.98-15.81 .28-15.96zm-218.8 78.9c-1.32 .31-6 1.45-8.47-2.35-5.2-8 11.11-20.38 3-35.77-9.1-17.47-27.82-13.54-35.05-5.54-8.71 9.6-8.72 23.54-5 24.08 4.27 .57 4.08-6.47 7.38-11.63a12.83 12.83 0 0 1 17.85-3.72c11.59 7.59 1.37 17.76 2.28 28.62 1.39 16.68 18.42 16.37 21.58 9a2.08 2.08 0 0 0 -.2-2.33c.03 .89 .68-1.3-3.35-.39zm299.7-17.07c-3.35-11.73-2.57-9.22-6.78-20.52 2.45-3.67 15.29-24-3.07-43.25-10.4-10.92-33.9-16.54-41.1-18.54-1.5-11.39 4.65-58.7-21.52-83 20.79-21.55 33.76-45.29 33.73-65.65-.06-39.16-48.15-51-107.4-26.47l-12.55 5.33c-.06-.05-22.71-22.27-23.05-22.57C169.5-18-41.77 216.8 25.78 273.9l14.76 12.51a72.49 72.49 0 0 0 -4.1 33.5c3.36 33.4 36 60.42 67.53 60.38 57.73 133.1 267.9 133.3 322.3 3 1.74-4.47 9.11-24.61 9.11-42.38s-10.09-25.27-16.53-25.27zm-316 48.16c-22.82-.61-47.46-21.15-49.91-45.51-6.17-61.31 74.26-75.27 84-12.33 4.54 29.64-4.67 58.49-34.12 57.81zM84.3 249.6C69.14 252.5 55.78 261.1 47.6 273c-4.88-4.07-14-12-15.59-15-13.01-24.85 14.24-73 33.3-100.2C112.4 90.56 186.2 39.68 220.4 48.91c5.55 1.57 23.94 22.89 23.94 22.89s-34.15 18.94-65.8 45.35c-42.66 32.85-74.89 80.59-94.2 132.4zM323.2 350.7s-35.74 5.3-69.51-7.07c6.21-20.16 27 6.1 96.4-13.81 15.29-4.38 35.37-13 51-25.35a102.8 102.8 0 0 1 7.12 24.28c3.66-.66 14.25-.52 11.44 18.1-3.29 19.87-11.73 36-25.93 50.84A106.9 106.9 0 0 1 362.5 421a132.4 132.4 0 0 1 -20.34 8.58c-53.51 17.48-108.3-1.74-126-43a66.33 66.33 0 0 1 -3.55-9.74c-7.53-27.2-1.14-59.83 18.84-80.37 1.23-1.31 2.48-2.85 2.48-4.79a8.45 8.45 0 0 0 -1.92-4.54c-7-10.13-31.19-27.4-26.33-60.83 3.5-24 24.49-40.91 44.07-39.91l5 .29c8.48 .5 15.89 1.59 22.88 1.88 11.69 .5 22.2-1.19 34.64-11.56 4.2-3.5 7.57-6.54 13.26-7.51a17.45 17.45 0 0 1 13.6 2.24c10 6.64 11.4 22.73 11.92 34.49 .29 6.72 1.1 23 1.38 27.63 .63 10.67 3.43 12.17 9.11 14 3.19 1.05 6.15 1.83 10.51 3.06 13.21 3.71 21 7.48 26 12.31a16.38 16.38 0 0 1 4.74 9.29c1.56 11.37-8.82 25.4-36.31 38.16-46.71 21.68-93.68 14.45-100.5 13.68-20.15-2.71-31.63 23.32-19.55 41.15 22.64 33.41 122.4 20 151.4-21.35 .69-1 .12-1.59-.73-1-41.77 28.58-97.06 38.21-128.5 26-4.77-1.85-14.73-6.44-15.94-16.67 43.6 13.49 71 .74 71 .74s2.03-2.79-.56-2.53zm-68.47-5.7zm-83.4-187.5c16.74-19.35 37.36-36.18 55.83-45.63a.73 .73 0 0 1 1 1c-1.46 2.66-4.29 8.34-5.19 12.65a.75 .75 0 0 0 1.16 .79c11.49-7.83 31.48-16.22 49-17.3a.77 .77 0 0 1 .52 1.38 41.86 41.86 0 0 0 -7.71 7.74 .75 .75 0 0 0 .59 1.19c12.31 .09 29.66 4.4 41 10.74 .76 .43 .22 1.91-.64 1.72-69.55-15.94-123.1 18.53-134.5 26.83a.76 .76 0 0 1 -1-1.12z"],mandalorian:[448,512,[],"f50f","M232.3 511.9c-1-3.26-1.69-15.83-1.39-24.58 .55-15.89 1-24.72 1.4-28.76 .64-6.2 2.87-20.72 3.28-21.38 .6-1 .4-27.87-.24-33.13-.31-2.58-.63-11.9-.69-20.73-.13-16.47-.53-20.12-2.73-24.76-1.1-2.32-1.23-3.84-1-11.43a92.38 92.38 0 0 0 -.34-12.71c-2-13-3.46-27.7-3.25-33.9s.43-7.15 2.06-9.67c3.05-4.71 6.51-14 8.62-23.27 2.26-9.86 3.88-17.18 4.59-20.74a109.5 109.5 0 0 1 4.42-15.05c2.27-6.25 2.49-15.39 .37-15.39-.3 0-1.38 1.22-2.41 2.71s-4.76 4.8-8.29 7.36c-8.37 6.08-11.7 9.39-12.66 12.58s-1 7.23-.16 7.76c.34 .21 1.29 2.4 2.11 4.88a28.83 28.83 0 0 1 .72 15.36c-.39 1.77-1 5.47-1.46 8.23s-1 6.46-1.25 8.22a9.85 9.85 0 0 1 -1.55 4.26c-1 1-1.14 .91-2.05-.53a14.87 14.87 0 0 1 -1.44-4.75c-.25-1.74-1.63-7.11-3.08-11.93-3.28-10.9-3.52-16.15-1-21a14.24 14.24 0 0 0 1.67-4.61c0-2.39-2.2-5.32-7.41-9.89-7-6.18-8.63-7.92-10.23-11.3-1.71-3.6-3.06-4.06-4.54-1.54-1.78 3-2.6 9.11-3 22l-.34 12.19 2 2.25c3.21 3.7 12.07 16.45 13.78 19.83 3.41 6.74 4.34 11.69 4.41 23.56s.95 22.75 2 24.71c.36 .66 .51 1.35 .34 1.52s.41 2.09 1.29 4.27a38.14 38.14 0 0 1 2.06 9 91 91 0 0 0 1.71 10.37c2.23 9.56 2.77 14.08 2.39 20.14-.2 3.27-.53 11.07-.73 17.32-1.31 41.76-1.85 58-2 61.21-.12 2-.39 11.51-.6 21.07-.36 16.3-1.3 27.37-2.42 28.65-.64 .73-8.07-4.91-12.52-9.49-3.75-3.87-4-4.79-2.83-9.95 .7-3 2.26-18.29 3.33-32.62 .36-4.78 .81-10.5 1-12.71 .83-9.37 1.66-20.35 2.61-34.78 .56-8.46 1.33-16.44 1.72-17.73s.89-9.89 1.13-19.11l.43-16.77-2.26-4.3c-1.72-3.28-4.87-6.94-13.22-15.34-6-6.07-11.84-12.3-12.91-13.85l-1.95-2.81 .75-10.9c1.09-15.71 1.1-48.57 0-59.06l-.89-8.7-3.28-4.52c-5.86-8.08-5.8-7.75-6.22-33.27-.1-6.07-.38-11.5-.63-12.06-.83-1.87-3.05-2.66-8.54-3.05-8.86-.62-11-1.9-23.85-14.55-6.15-6-12.34-12-13.75-13.19-2.81-2.42-2.79-2-.56-9.63l1.35-4.65-1.69-3a32.22 32.22 0 0 0 -2.59-4.07c-1.33-1.51-5.5-10.89-6-13.49a4.24 4.24 0 0 1 .87-3.9c2.23-2.86 3.4-5.68 4.45-10.73 2.33-11.19 7.74-26.09 10.6-29.22 3.18-3.47 7.7-1 9.41 5 1.34 4.79 1.37 9.79 .1 18.55a101.2 101.2 0 0 0 -1 11.11c0 4 .19 4.69 2.25 7.39 3.33 4.37 7.73 7.41 15.2 10.52a18.67 18.67 0 0 1 4.72 2.85c11.17 10.72 18.62 16.18 22.95 16.85 5.18 .8 8 4.54 10 13.39 1.31 5.65 4 11.14 5.46 11.14a9.38 9.38 0 0 0 3.33-1.39c2-1.22 2.25-1.73 2.25-4.18a132.9 132.9 0 0 0 -2-17.84c-.37-1.66-.78-4.06-.93-5.35s-.61-3.85-1-5.69c-2.55-11.16-3.65-15.46-4.1-16-1.55-2-4.08-10.2-4.93-15.92-1.64-11.11-4-14.23-12.91-17.39A43.15 43.15 0 0 1 165.2 78c-1.15-1-4-3.22-6.35-5.06s-4.41-3.53-4.6-3.76a22.7 22.7 0 0 0 -2.69-2c-6.24-4.22-8.84-7-11.26-12l-2.44-5-.22-13-.22-13 6.91-6.55c3.95-3.75 8.48-7.35 10.59-8.43 3.31-1.69 4.45-1.89 11.37-2 8.53-.19 10.12 0 11.66 1.56s1.36 6.4-.29 8.5a6.66 6.66 0 0 0 -1.34 2.32c0 .58-2.61 4.91-5.42 9a30.39 30.39 0 0 0 -2.37 6.82c20.44 13.39 21.55 3.77 14.07 29L194 66.92c3.11-8.66 6.47-17.26 8.61-26.22 .29-7.63-12-4.19-15.4-8.68-2.33-5.93 3.13-14.18 6.06-19.2 1.6-2.34 6.62-4.7 8.82-4.15 .88 .22 4.16-.35 7.37-1.28a45.3 45.3 0 0 1 7.55-1.68 29.57 29.57 0 0 0 6-1.29c3.65-1.11 4.5-1.17 6.35-.4a29.54 29.54 0 0 0 5.82 1.36 18.18 18.18 0 0 1 6 1.91 22.67 22.67 0 0 0 5 2.17c2.51 .68 3 .57 7.05-1.67l4.35-2.4L268.3 5c10.44-.4 10.81-.47 15.26-2.68L288.2 0l2.46 1.43c1.76 1 3.14 2.73 4.85 6 2.36 4.51 2.38 4.58 1.37 7.37-.88 2.44-.89 3.3-.1 6.39a35.76 35.76 0 0 0 2.1 5.91 13.55 13.55 0 0 1 1.31 4c.31 4.33 0 5.3-2.41 6.92-2.17 1.47-7 7.91-7 9.34a14.77 14.77 0 0 1 -1.07 3c-5 11.51-6.76 13.56-14.26 17-9.2 4.2-12.3 5.19-16.21 5.19-3.1 0-4 .25-4.54 1.26a18.33 18.33 0 0 1 -4.09 3.71 13.62 13.62 0 0 0 -4.38 4.78 5.89 5.89 0 0 1 -2.49 2.91 6.88 6.88 0 0 0 -2.45 1.71 67.62 67.62 0 0 1 -7 5.38c-3.33 2.34-6.87 5-7.87 6A7.27 7.27 0 0 1 224 100a5.76 5.76 0 0 0 -2.13 1.65c-1.31 1.39-1.49 2.11-1.14 4.6a36.45 36.45 0 0 0 1.42 5.88c1.32 3.8 1.31 7.86 0 10.57s-.89 6.65 1.35 9.59c2 2.63 2.16 4.56 .71 8.84a33.45 33.45 0 0 0 -1.06 8.91c0 4.88 .22 6.28 1.46 8.38s1.82 2.48 3.24 2.32c2-.23 2.3-1.05 4.71-12.12 2.18-10 3.71-11.92 13.76-17.08 2.94-1.51 7.46-4 10-5.44s6.79-3.69 9.37-4.91a40.09 40.09 0 0 0 15.22-11.67c7.11-8.79 10-16.22 12.85-33.3a18.37 18.37 0 0 1 2.86-7.73 20.39 20.39 0 0 0 2.89-7.31c1-5.3 2.85-9.08 5.58-11.51 4.7-4.18 6-1.09 4.59 10.87-.46 3.86-1.1 10.33-1.44 14.38l-.61 7.36 4.45 4.09 4.45 4.09 .11 8.42c.06 4.63 .47 9.53 .92 10.89l.82 2.47-6.43 6.28c-8.54 8.33-12.88 13.93-16.76 21.61-1.77 3.49-3.74 7.11-4.38 8-2.18 3.11-6.46 13-8.76 20.26l-2.29 7.22-7 6.49c-3.83 3.57-8 7.25-9.17 8.17-3.05 2.32-4.26 5.15-4.26 10a14.62 14.62 0 0 0 1.59 7.26 42 42 0 0 1 2.09 4.83 9.28 9.28 0 0 0 1.57 2.89c1.4 1.59 1.92 16.12 .83 23.22-.68 4.48-3.63 12-4.7 12-1.79 0-4.06 9.27-5.07 20.74-.18 2-.62 5.94-1 8.7s-1 10-1.35 16.05c-.77 12.22-.19 18.77 2 23.15 3.41 6.69 .52 12.69-11 22.84l-4 3.49 .07 5.19a40.81 40.81 0 0 0 1.14 8.87c4.61 16 4.73 16.92 4.38 37.13-.46 26.4-.26 40.27 .63 44.15a61.31 61.31 0 0 1 1.08 7c.17 2 .66 5.33 1.08 7.36 .47 2.26 .78 11 .79 22.74v19.06l-1.81 2.63c-2.71 3.91-15.11 13.54-15.49 12.29zm29.53-45.11c-.18-.3-.33-6.87-.33-14.59 0-14.06-.89-27.54-2.26-34.45-.4-2-.81-9.7-.9-17.06-.15-11.93-1.4-24.37-2.64-26.38-.66-1.07-3-17.66-3-21.3 0-4.23 1-6 5.28-9.13s4.86-3.14 5.48-.72c.28 1.1 1.45 5.62 2.6 10 3.93 15.12 4.14 16.27 4.05 21.74-.1 5.78-.13 6.13-1.74 17.73-1 7.07-1.17 12.39-1 28.43 .17 19.4-.64 35.73-2 41.27-.71 2.78-2.8 5.48-3.43 4.43zm-71-37.58a101 101 0 0 1 -1.73-10.79 100.5 100.5 0 0 0 -1.73-10.79 37.53 37.53 0 0 1 -1-6.49c-.31-3.19-.91-7.46-1.33-9.48-1-4.79-3.35-19.35-3.42-21.07 0-.74-.34-4.05-.7-7.36-.67-6.21-.84-27.67-.22-28.29 1-1 6.63 2.76 11.33 7.43l5.28 5.25-.45 6.47c-.25 3.56-.6 10.23-.78 14.83s-.49 9.87-.67 11.71-.61 9.36-.94 16.72c-.79 17.41-1.94 31.29-2.65 32a.62 .62 0 0 1 -1-.14zm-87.18-266.6c21.07 12.79 17.84 14.15 28.49 17.66 13 4.29 18.87 7.13 23.15 16.87C111.6 233.3 86.25 255 78.55 268c-31 52-6 101.6 62.75 87.21-14.18 29.23-78 28.63-98.68-4.9-24.68-39.95-22.09-118.3 61-187.7zm210.8 179c56.66 6.88 82.32-37.74 46.54-89.23 0 0-26.87-29.34-64.28-68 3-15.45 9.49-32.12 30.57-53.82 89.2 63.51 92 141.6 92.46 149.4 4.3 70.64-78.7 91.18-105.3 61.71z"],markdown:[640,512,[],"f60f","M593.8 59.1H46.2C20.7 59.1 0 79.8 0 105.2v301.5c0 25.5 20.7 46.2 46.2 46.2h547.7c25.5 0 46.2-20.7 46.1-46.1V105.2c0-25.4-20.7-46.1-46.2-46.1zM338.5 360.6H277v-120l-61.5 76.9-61.5-76.9v120H92.3V151.4h61.5l61.5 76.9 61.5-76.9h61.5v209.2zm135.3 3.1L381.5 256H443V151.4h61.5V256H566z"],mastodon:[448,512,[],"f4f6","M433 179.1c0-97.2-63.71-125.7-63.71-125.7-62.52-28.7-228.6-28.4-290.5 0 0 0-63.72 28.5-63.72 125.7 0 115.7-6.6 259.4 105.6 289.1 40.51 10.7 75.32 13 103.3 11.4 50.81-2.8 79.32-18.1 79.32-18.1l-1.7-36.9s-36.31 11.4-77.12 10.1c-40.41-1.4-83-4.4-89.63-54a102.5 102.5 0 0 1 -.9-13.9c85.63 20.9 158.6 9.1 178.8 6.7 56.12-6.7 105-41.3 111.2-72.9 9.8-49.8 9-121.5 9-121.5zm-75.12 125.2h-46.63v-114.2c0-49.7-64-51.6-64 6.9v62.5h-46.33V197c0-58.5-64-56.6-64-6.9v114.2H90.19c0-122.1-5.2-147.9 18.41-175 25.9-28.9 79.82-30.8 103.8 6.1l11.6 19.5 11.6-19.5c24.11-37.1 78.12-34.8 103.8-6.1 23.71 27.3 18.4 53 18.4 175z"],maxcdn:[512,512,[],"f136","M461.1 442.7h-97.4L415.6 200c2.3-10.2 .9-19.5-4.4-25.7-5-6.1-13.7-9.6-24.2-9.6h-49.3l-59.5 278h-97.4l59.5-278h-83.4l-59.5 278H0l59.5-278-44.6-95.4H387c39.4 0 75.3 16.3 98.3 44.9 23.3 28.6 31.8 67.4 23.6 105.9l-47.8 222.6z"],mdb:[576,512,[],"f8ca","M17.37 160.4L7 352h43.91l5.59-79.83L84.43 352h44.71l25.54-77.43 4.79 77.43H205l-12.79-191.6H146.7L106 277.7 63.67 160.4zm281 0h-47.9V352h47.9s95 .8 94.2-95.79c-.78-94.21-94.18-95.78-94.18-95.78zm-1.2 146.5V204.8s46 4.27 46.8 50.57-46.78 51.54-46.78 51.54zm238.3-74.24a56.16 56.16 0 0 0 8-38.31c-5.34-35.76-55.08-34.32-55.08-34.32h-51.9v191.6H482s87 4.79 87-63.85c0-43.14-33.52-55.08-33.52-55.08zm-51.9-31.94s13.57-1.59 16 9.59c1.43 6.66-4 12-4 12h-12v-21.57zm-.1 109.5l.1-24.92V267h.08s41.58-4.73 41.19 22.43c-.33 25.65-41.35 20.74-41.35 20.74z"],medapps:[320,512,[],"f3c6","M118.3 238.4c3.5-12.5 6.9-33.6 13.2-33.6 8.3 1.8 9.6 23.4 18.6 36.6 4.6-23.5 5.3-85.1 14.1-86.7 9-.7 19.7 66.5 22 77.5 9.9 4.1 48.9 6.6 48.9 6.6 1.9 7.3-24 7.6-40 7.8-4.6 14.8-5.4 27.7-11.4 28-4.7 .2-8.2-28.8-17.5-49.6l-9.4 65.5c-4.4 13-15.5-22.5-21.9-39.3-3.3-.1-62.4-1.6-47.6-7.8l31-5zM228 448c21.2 0 21.2-32 0-32H92c-21.2 0-21.2 32 0 32h136zm-24 64c21.2 0 21.2-32 0-32h-88c-21.2 0-21.2 32 0 32h88zm34.2-141.5c3.2-18.9 5.2-36.4 11.9-48.8 7.9-14.7 16.1-28.1 24-41 24.6-40.4 45.9-75.2 45.9-125.5C320 69.6 248.2 0 160 0S0 69.6 0 155.2c0 50.2 21.3 85.1 45.9 125.5 7.9 12.9 16 26.3 24 41 6.7 12.5 8.7 29.8 11.9 48.9 3.5 21 36.1 15.7 32.6-5.1-3.6-21.7-5.6-40.7-15.3-58.6C66.5 246.5 33 211.3 33 155.2 33 87.3 90 32 160 32s127 55.3 127 123.2c0 56.1-33.5 91.3-66.1 151.6-9.7 18-11.7 37.4-15.3 58.6-3.4 20.6 29 26.4 32.6 5.1z"],medium:[640,512,[62407,"medium-m"],"f23a","M180.5 74.26C80.81 74.26 0 155.6 0 256S80.82 437.7 180.5 437.7 361 356.4 361 256 280.2 74.26 180.5 74.26zm288.3 10.65c-49.85 0-90.25 76.62-90.25 171.1s40.41 171.1 90.25 171.1 90.25-76.62 90.25-171.1H559C559 161.5 518.6 84.91 468.8 84.91zm139.5 17.82c-17.53 0-31.74 68.63-31.74 153.3s14.2 153.3 31.74 153.3S640 340.6 640 256C640 171.4 625.8 102.7 608.3 102.7z"],medrt:[544,512,[],"f3c8","M113.7 256c0 121.8 83.9 222.8 193.5 241.1-18.7 4.5-38.2 6.9-58.2 6.9C111.4 504 0 393 0 256S111.4 8 248.9 8c20.1 0 39.6 2.4 58.2 6.9C197.5 33.2 113.7 134.2 113.7 256m297.4 100.3c-77.7 55.4-179.6 47.5-240.4-14.6 5.5 14.1 12.7 27.7 21.7 40.5 61.6 88.2 182.4 109.3 269.7 47 87.3-62.3 108.1-184.3 46.5-272.6-9-12.9-19.3-24.3-30.5-34.2 37.4 78.8 10.7 178.5-67 233.9m-218.8-244c-1.4 1-2.7 2.1-4 3.1 64.3-17.8 135.9 4 178.9 60.5 35.7 47 42.9 106.6 24.4 158 56.7-56.2 67.6-142.1 22.3-201.8-50-65.5-149.1-74.4-221.6-19.8M296 224c-4.4 0-8-3.6-8-8v-40c0-4.4-3.6-8-8-8h-48c-4.4 0-8 3.6-8 8v40c0 4.4-3.6 8-8 8h-40c-4.4 0-8 3.6-8 8v48c0 4.4 3.6 8 8 8h40c4.4 0 8 3.6 8 8v40c0 4.4 3.6 8 8 8h48c4.4 0 8-3.6 8-8v-40c0-4.4 3.6-8 8-8h40c4.4 0 8-3.6 8-8v-48c0-4.4-3.6-8-8-8h-40z"],meetup:[512,512,[],"f2e0","M99 414.3c1.1 5.7-2.3 11.1-8 12.3-5.4 1.1-10.9-2.3-12-8-1.1-5.4 2.3-11.1 7.7-12.3 5.4-1.2 11.1 2.3 12.3 8zm143.1 71.4c-6.3 4.6-8 13.4-3.7 20 4.6 6.6 13.4 8.3 20 3.7 6.3-4.6 8-13.4 3.4-20-4.2-6.5-13.1-8.3-19.7-3.7zm-86-462.3c6.3-1.4 10.3-7.7 8.9-14-1.1-6.6-7.4-10.6-13.7-9.1-6.3 1.4-10.3 7.7-9.1 14 1.4 6.6 7.6 10.6 13.9 9.1zM34.4 226.3c-10-6.9-23.7-4.3-30.6 6-6.9 10-4.3 24 5.7 30.9 10 7.1 23.7 4.6 30.6-5.7 6.9-10.4 4.3-24.1-5.7-31.2zm272-170.9c10.6-6.3 13.7-20 7.7-30.3-6.3-10.6-19.7-14-30-7.7s-13.7 20-7.4 30.6c6 10.3 19.4 13.7 29.7 7.4zm-191.1 58c7.7-5.4 9.4-16 4.3-23.7s-15.7-9.4-23.1-4.3c-7.7 5.4-9.4 16-4.3 23.7 5.1 7.8 15.6 9.5 23.1 4.3zm372.3 156c-7.4 1.7-12.3 9.1-10.6 16.9 1.4 7.4 8.9 12.3 16.3 10.6 7.4-1.4 12.3-8.9 10.6-16.6-1.5-7.4-8.9-12.3-16.3-10.9zm39.7-56.8c-1.1-5.7-6.6-9.1-12-8-5.7 1.1-9.1 6.9-8 12.6 1.1 5.4 6.6 9.1 12.3 8 5.4-1.5 9.1-6.9 7.7-12.6zM447 138.9c-8.6 6-10.6 17.7-4.9 26.3 5.7 8.6 17.4 10.6 26 4.9 8.3-6 10.3-17.7 4.6-26.3-5.7-8.7-17.4-10.9-25.7-4.9zm-6.3 139.4c26.3 43.1 15.1 100-26.3 129.1-17.4 12.3-37.1 17.7-56.9 17.1-12 47.1-69.4 64.6-105.1 32.6-1.1 .9-2.6 1.7-3.7 2.9-39.1 27.1-92.3 17.4-119.4-22.3-9.7-14.3-14.6-30.6-15.1-46.9-65.4-10.9-90-94-41.1-139.7-28.3-46.9 .6-107.4 53.4-114.9C151.6 70 234.1 38.6 290.1 82c67.4-22.3 136.3 29.4 130.9 101.1 41.1 12.6 52.8 66.9 19.7 95.2zm-70 74.3c-3.1-20.6-40.9-4.6-43.1-27.1-3.1-32 43.7-101.1 40-128-3.4-24-19.4-29.1-33.4-29.4-13.4-.3-16.9 2-21.4 4.6-2.9 1.7-6.6 4.9-11.7-.3-6.3-6-11.1-11.7-19.4-12.9-12.3-2-17.7 2-26.6 9.7-3.4 2.9-12 12.9-20 9.1-3.4-1.7-15.4-7.7-24-11.4-16.3-7.1-40 4.6-48.6 20-12.9 22.9-38 113.1-41.7 125.1-8.6 26.6 10.9 48.6 36.9 47.1 11.1-.6 18.3-4.6 25.4-17.4 4-7.4 41.7-107.7 44.6-112.6 2-3.4 8.9-8 14.6-5.1 5.7 3.1 6.9 9.4 6 15.1-1.1 9.7-28 70.9-28.9 77.7-3.4 22.9 26.9 26.6 38.6 4 3.7-7.1 45.7-92.6 49.4-98.3 4.3-6.3 7.4-8.3 11.7-8 3.1 0 8.3 .9 7.1 10.9-1.4 9.4-35.1 72.3-38.9 87.7-4.6 20.6 6.6 41.4 24.9 50.6 11.4 5.7 62.5 15.7 58.5-11.1zm5.7 92.3c-10.3 7.4-12.9 22-5.7 32.6 7.1 10.6 21.4 13.1 32 6 10.6-7.4 13.1-22 6-32.6-7.4-10.6-21.7-13.5-32.3-6z"],megaport:[496,512,[],"f5a3","M214.5 209.6v66.2l33.5 33.5 33.3-33.3v-66.4l-33.4-33.4zM248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S385 8 248 8zm145.1 414.4L367 441.6l-26-19.2v-65.5l-33.4-33.4-33.4 33.4v65.5L248 441.6l-26.1-19.2v-65.5l-33.4-33.4-33.5 33.4v65.5l-26.1 19.2-26.1-19.2v-87l59.5-59.5V188l59.5-59.5V52.9l26.1-19.2L274 52.9v75.6l59.5 59.5v87.6l59.7 59.7v87.1z"],mendeley:[640,512,[],"f7b3","M624.6 325.2c-12.3-12.4-29.7-19.2-48.4-17.2-43.3-1-49.7-34.9-37.5-98.8 22.8-57.5-14.9-131.5-87.4-130.8-77.4 .7-81.7 82-130.9 82-48.1 0-54-81.3-130.9-82-72.9-.8-110.1 73.3-87.4 130.8 12.2 63.9 5.8 97.8-37.5 98.8-21.2-2.3-37 6.5-53 22.5-19.9 19.7-19.3 94.8 42.6 102.6 47.1 5.9 81.6-42.9 61.2-87.8-47.3-103.7 185.9-106.1 146.5-8.2-.1 .1-.2 .2-.3 .4-26.8 42.8 6.8 97.4 58.8 95.2 52.1 2.1 85.4-52.6 58.8-95.2-.1-.2-.2-.3-.3-.4-39.4-97.9 193.8-95.5 146.5 8.2-4.6 10-6.7 21.3-5.7 33 4.9 53.4 68.7 74.1 104.9 35.2 17.8-14.8 23.1-65.6 0-88.3zm-303.9-19.1h-.6c-43.4 0-62.8-37.5-62.8-62.8 0-34.7 28.2-62.8 62.8-62.8h.6c34.7 0 62.8 28.1 62.8 62.8 0 25-19.2 62.8-62.8 62.8z"],meta:[640,512,[],"e49b","M640 317.9C640 409.2 600.6 466.4 529.7 466.4C467.1 466.4 433.9 431.8 372.8 329.8L341.4 277.2C333.1 264.7 326.9 253 320.2 242.2C300.1 276 273.1 325.2 273.1 325.2C206.1 441.8 168.5 466.4 116.2 466.4C43.42 466.4 0 409.1 0 320.5C0 177.5 79.78 42.4 183.9 42.4C234.1 42.4 277.7 67.08 328.7 131.9C365.8 81.8 406.8 42.4 459.3 42.4C558.4 42.4 640 168.1 640 317.9H640zM287.4 192.2C244.5 130.1 216.5 111.7 183 111.7C121.1 111.7 69.22 217.8 69.22 321.7C69.22 370.2 87.7 397.4 118.8 397.4C149 397.4 167.8 378.4 222 293.6C222 293.6 246.7 254.5 287.4 192.2V192.2zM531.2 397.4C563.4 397.4 578.1 369.9 578.1 322.5C578.1 198.3 523.8 97.08 454.9 97.08C421.7 97.08 393.8 123 360 175.1C369.4 188.9 379.1 204.1 389.3 220.5L426.8 282.9C485.5 377 500.3 397.4 531.2 397.4L531.2 397.4z"],microblog:[448,512,[],"e01a","M399.4 362.2c29.49-34.69 47.1-78.34 47.1-125.8C446.5 123.5 346.9 32 224 32S1.54 123.5 1.54 236.4 101.1 440.9 224 440.9a239.3 239.3 0 0 0 79.44-13.44 7.18 7.18 0 0 1 8.12 2.56c18.58 25.09 47.61 42.74 79.89 49.92a4.42 4.42 0 0 0 5.22-3.43 4.37 4.37 0 0 0 -.85-3.62 87 87 0 0 1 3.69-110.7zM329.5 212.4l-57.3 43.49L293 324.8a6.5 6.5 0 0 1 -9.94 7.22L224 290.9 164.9 332a6.51 6.51 0 0 1 -9.95-7.22l20.79-68.86-57.3-43.49a6.5 6.5 0 0 1 3.8-11.68l71.88-1.51 23.66-67.92a6.5 6.5 0 0 1 12.28 0l23.66 67.92 71.88 1.51a6.5 6.5 0 0 1 3.88 11.68z"],microsoft:[448,512,[],"f3ca","M0 32h214.6v214.6H0V32zm233.4 0H448v214.6H233.4V32zM0 265.4h214.6V480H0V265.4zm233.4 0H448V480H233.4V265.4z"],mix:[448,512,[],"f3cb","M0 64v348.9c0 56.2 88 58.1 88 0V174.3c7.9-52.9 88-50.4 88 6.5v175.3c0 57.9 96 58 96 0V240c5.3-54.7 88-52.5 88 4.3v23.8c0 59.9 88 56.6 88 0V64H0z"],mixcloud:[640,512,[],"f289","M212.1 346.6H179.8V195.1L185.1 173.5H175.3L137.1 346.6H76.11L37.73 173.5H27.28L33.19 195.1V346.6H0V165H65.65L102.2 338.1H110.7L147.3 165H212.1L212.1 346.6zM544.5 283.6L458.4 345.7V307.5L531.3 255.8L458.4 204V165.9L544.5 228.2H553.7L640 165.9V204L566.9 255.8L640 307.5V345.7L553.7 283.6H544.5zM430.2 272.3H248.1V239.3H430.2V272.3z"],mixer:[512,512,[],"e056","M114.6 76.07a45.71 45.71 0 0 0 -67.51-6.41c-17.58 16.18-19 43.52-4.75 62.77l91.78 123L41.76 379.6c-14.23 19.25-13.11 46.59 4.74 62.77A45.71 45.71 0 0 0 114 435.9L242.9 262.7a12.14 12.14 0 0 0 0-14.23zM470.2 379.6 377.9 255.4l91.78-123c14.22-19.25 12.83-46.59-4.75-62.77a45.71 45.71 0 0 0 -67.51 6.41l-128 172.1a12.14 12.14 0 0 0 0 14.23L398 435.9a45.71 45.71 0 0 0 67.51 6.41C483.4 426.2 484.5 398.8 470.2 379.6z"],mizuni:[496,512,[],"f3cc","M248 8C111 8 0 119.1 0 256c0 137 111 248 248 248s248-111 248-248C496 119.1 385 8 248 8zm-80 351.9c-31.4 10.6-58.8 27.3-80 48.2V136c0-22.1 17.9-40 40-40s40 17.9 40 40v223.9zm120-9.9c-12.9-2-26.2-3.1-39.8-3.1-13.8 0-27.2 1.1-40.2 3.1V136c0-22.1 17.9-40 40-40s40 17.9 40 40v214zm120 57.7c-21.2-20.8-48.6-37.4-80-48V136c0-22.1 17.9-40 40-40s40 17.9 40 40v271.7z"],modx:[448,512,[],"f285","M356 241.8l36.7 23.7V480l-133-83.8L356 241.8zM440 75H226.3l-23 37.8 153.5 96.5L440 75zm-89 142.8L55.2 32v214.5l46 29L351 217.8zM97 294.2L8 437h213.7l125-200.5L97 294.2z"],monero:[496,512,[],"f3d0","M352 384h108.4C417 455.9 338.1 504 248 504S79 455.9 35.6 384H144V256.2L248 361l104-105v128zM88 336V128l159.4 159.4L408 128v208h74.8c8.5-25.1 13.2-52 13.2-80C496 119 385 8 248 8S0 119 0 256c0 28 4.6 54.9 13.2 80H88z"],napster:[496,512,[],"f3d2","M298.3 373.6c-14.2 13.6-31.3 24.1-50.4 30.5-19-6.4-36.2-16.9-50.3-30.5h100.7zm44-199.6c20-16.9 43.6-29.2 69.6-36.2V299c0 219.4-328 217.6-328 .3V137.7c25.9 6.9 49.6 19.6 69.5 36.4 56.8-40 132.5-39.9 188.9-.1zm-208.8-58.5c64.4-60 164.3-60.1 228.9-.2-7.1 3.5-13.9 7.3-20.6 11.5-58.7-30.5-129.2-30.4-187.9 .1-6.3-4-13.9-8.2-20.4-11.4zM43.8 93.2v69.3c-58.4 36.5-58.4 121.1 .1 158.3 26.4 245.1 381.7 240.3 407.6 1.5l.3-1.7c58.7-36.3 58.9-121.7 .2-158.2V93.2c-17.3 .5-34 3-50.1 7.4-82-91.5-225.5-91.5-307.5 .1-16.3-4.4-33.1-7-50.6-7.5zM259.2 352s36-.3 61.3-1.5c10.2-.5 21.1-4 25.5-6.5 26.3-15.1 25.4-39.2 26.2-47.4-79.5-.6-99.9-3.9-113 55.4zm-135.5-55.3c.8 8.2-.1 32.3 26.2 47.4 4.4 2.5 15.2 6 25.5 6.5 25.3 1.1 61.3 1.5 61.3 1.5-13.2-59.4-33.7-56.1-113-55.4zm169.1 123.4c-3.2-5.3-6.9-7.3-6.9-7.3-24.8 7.3-52.2 6.9-75.9 0 0 0-2.9 1.5-6.4 6.6-2.8 4.1-3.7 9.6-3.7 9.6 29.1 17.6 67.1 17.6 96.2 0-.1-.1-.3-4-3.3-8.9z"],neos:[512,512,[],"f612","M415.4 512h-95.11L212.1 357.5v91.1L125.7 512H28V29.82L68.47 0h108.1l123.7 176.1V63.45L386.7 0h97.69v461.5zM38.77 35.27V496l72-52.88V194l215.5 307.6h84.79l52.35-38.17h-78.27L69 13zm82.54 466.6l80-58.78v-101l-79.76-114.4v220.9L49 501.9h72.34zM80.63 10.77l310.6 442.6h82.37V10.77h-79.75v317.6L170.9 10.77zM311 191.6l72 102.8V15.93l-72 53v122.7z"],"nfc-directional":[512,512,[],"e530","M211.8 488.6C213.4 491.1 213.9 494.2 213.2 497.1C212.6 500 210.8 502.6 208.3 504.2C205.7 505.8 202.7 506.3 199.7 505.7C138.3 491.8 84.1 455.8 47.53 404.5C10.97 353.2-5.395 290.3 1.57 227.7C8.536 165 38.34 107.2 85.29 65.21C132.2 23.2 193-.0131 256 0C257.5 0 258.1 .2931 260.3 .8627C261.7 1.432 262.1 2.267 264 3.319C265.1 4.371 265.9 5.619 266.5 6.993C267 8.367 267.3 9.839 267.3 11.32V112.3L291.8 86.39C292.8 85.31 294 84.44 295.4 83.84C296.7 83.23 298.2 82.9 299.7 82.86C301.2 82.81 302.6 83.06 304 83.59C305.4 84.12 306.7 84.92 307.8 85.94C308.8 86.96 309.7 88.18 310.3 89.54C310.9 90.89 311.3 92.35 311.3 93.84C311.3 95.32 311.1 96.8 310.6 98.18C310 99.57 309.2 100.8 308.2 101.9L264.2 148.5C263.1 149.6 261.9 150.5 260.5 151.1C259 151.7 257.5 152 255.1 152C254.5 152 252.9 151.7 251.5 151.1C250.1 150.5 248.8 149.6 247.8 148.5L203.7 101.9C201.7 99.74 200.6 96.83 200.7 93.84C200.7 90.84 202 87.1 204.2 85.94C206.4 83.88 209.3 82.77 212.3 82.86C215.3 82.94 218.1 84.21 220.2 86.39L244.7 112.4V22.89C188.3 25.64 134.9 48.73 94.23 87.87C53.58 127 28.49 179.6 23.61 235.8C18.73 292 34.38 348.1 67.68 393.7C100.1 439.2 149.7 471.2 204.7 483.6C207.6 484.3 210.2 486.1 211.8 488.6L211.8 488.6zM171.4 126.1C170.6 127.4 169.5 128.5 168.3 129.3C147.8 143.2 131.1 161.9 119.5 183.8C107.9 205.7 101.8 230.1 101.8 254.9C101.8 279.7 107.9 304.1 119.5 325.1C131.1 347.9 147.8 366.6 168.3 380.5C170.8 382.2 172.5 384.8 173 387.8C173.6 390.7 172.1 393.8 171.3 396.2C169.6 398.7 166.1 400.4 164 400.1C161.1 401.5 158 400.9 155.6 399.2C132 383.2 112.8 361.7 99.46 336.5C86.15 311.4 79.19 283.4 79.19 254.9C79.19 226.5 86.15 198.4 99.46 173.3C112.8 148.1 132 126.6 155.6 110.6C156.8 109.8 158.2 109.2 159.6 108.8C161.1 108.5 162.6 108.5 164.1 108.8C165.5 109 166.9 109.6 168.2 110.4C169.5 111.2 170.5 112.3 171.4 113.5C172.2 114.7 172.8 116.1 173.1 117.6C173.4 119.1 173.4 120.6 173.1 122C172.8 123.5 172.3 124.9 171.4 126.1H171.4zM340.9 383.5C341.7 382.3 342.8 381.2 343.1 380.4V380.3C364.4 366.3 381.1 347.6 392.7 325.7C404.2 303.9 410.2 279.5 410.2 254.8C410.2 230.1 404.2 205.7 392.7 183.8C381.1 161.1 364.4 143.3 343.1 129.3C342.8 128.5 341.7 127.4 340.9 126.2C340.1 124.9 339.5 123.5 339.3 122.1C338.1 120.6 339 119.1 339.3 117.7C339.6 116.2 340.2 114.8 341 113.6C341.9 112.4 342.1 111.3 344.2 110.5C345.4 109.7 346.8 109.2 348.3 108.9C349.8 108.6 351.2 108.6 352.7 108.9C354.2 109.2 355.5 109.8 356.8 110.7C380.2 126.7 399.5 148.2 412.7 173.3C426 198.4 432.1 226.4 432.1 254.8C432.1 283.3 426 311.3 412.7 336.4C399.5 361.5 380.2 383 356.8 399C355.5 399.9 354.2 400.5 352.7 400.8C351.2 401.1 349.8 401.1 348.3 400.8C346.8 400.5 345.4 399.1 344.2 399.2C342.1 398.4 341.9 397.3 341 396.1C340.2 394.9 339.6 393.5 339.3 392C339 390.6 338.1 389.1 339.3 387.6C339.5 386.2 340.1 384.8 340.9 383.5V383.5zM312.3 6.307C368.5 19.04 418.7 50.28 455 95.01C485.4 132.6 504.6 178 510.3 226C515.9 274 507.9 322.7 487.1 366.3C466.2 409.9 433.5 446.8 392.6 472.6C351.7 498.3 304.4 512 256 512C254.5 512 253.1 511.7 251.7 511.1C250.3 510.6 249.1 509.7 248 508.7C246.1 507.6 246.1 506.4 245.6 505C245 503.6 244.7 502.2 244.7 500.7V401.5L220.2 427.5C218.1 429.7 215.3 430.1 212.3 431.1C209.3 431.2 206.4 430 204.2 427.1C202 425.9 200.7 423.1 200.7 420.1C200.6 417.1 201.7 414.2 203.7 412L247.8 365.4C249.1 363.2 252.9 362 255.1 362C259.1 362 262 363.2 264.2 365.4L308.2 412C310.3 414.2 311.4 417.1 311.3 420.1C311.2 423.1 309.9 425.9 307.8 427.1C305.6 430 302.7 431.2 299.7 431.1C296.7 430.1 293.8 429.7 291.8 427.5L267.3 401.6V489.1C323.7 486.3 377.1 463.3 417.8 424.1C458.5 384.1 483.6 332.4 488.5 276.2C493.3 219.1 477.7 163.9 444.4 118.3C411.1 72.75 362.4 40.79 307.4 28.36C305.9 28.03 304.6 27.42 303.3 26.57C302.1 25.71 301.1 24.63 300.3 23.37C299.5 22.12 298.1 20.72 298.7 19.26C298.5 17.8 298.5 16.3 298.8 14.85C299.2 13.41 299.8 12.04 300.6 10.82C301.5 9.61 302.6 8.577 303.8 7.784C305.1 6.99 306.5 6.451 307.9 6.198C309.4 5.945 310.9 5.982 312.3 6.307L312.3 6.307zM353.1 256.1C353.1 287.5 335.6 317.2 303.8 339.6C301.7 341.1 299 341.9 296.4 341.6C293.7 341.4 291.2 340.3 289.4 338.4L219.3 268.6C217.1 266.5 215.1 263.6 215.9 260.6C215.9 257.6 217.1 254.7 219.2 252.6C221.4 250.5 224.2 249.3 227.2 249.3C230.2 249.3 233.1 250.5 235.2 252.6L298.3 315.4C319.1 298.3 330.5 277.5 330.5 256.1C330.5 232.2 316.4 209.1 290.8 191C288.3 189.3 286.7 186.7 286.2 183.7C285.7 180.8 286.3 177.7 288.1 175.3C289.8 172.8 292.4 171.2 295.4 170.7C298.3 170.2 301.4 170.8 303.8 172.6C335.6 195 353.1 224.7 353.1 256.1V256.1zM216.7 341.5C213.7 342 210.7 341.3 208.2 339.6C176.5 317.2 158.1 287.5 158.1 256.1C158.1 224.7 176.5 195 208.2 172.6C210.4 171 213.1 170.3 215.7 170.5C218.4 170.8 220.8 171.9 222.7 173.8L292.8 243.6C294.9 245.7 296.1 248.6 296.1 251.6C296.1 254.6 294.1 257.4 292.8 259.6C290.7 261.7 287.8 262.9 284.9 262.9C281.9 262.9 278.1 261.7 276.9 259.6L213.8 196.7C192.9 214 181.6 234.7 181.6 256.1C181.6 279.1 195.7 303.1 221.3 321.1C223.7 322.9 225.4 325.5 225.9 328.5C226.4 331.4 225.7 334.4 224 336.9C222.3 339.3 219.6 341 216.7 341.5L216.7 341.5z"],"nfc-symbol":[576,512,[],"e531","M392.9 32.43C400.6 31.1 408.6 32.89 414.1 37.41C498.2 96.14 544 173.7 544 255.1C544 338.2 498.2 415.9 414.1 474.6C409.3 478.6 402.4 480.5 395.5 479.9C388.5 479.3 382 476.3 377.1 471.4L193.7 288.7C188.1 283.2 185 275.7 184.1 267.8C184.1 260 188.1 252.5 193.6 246.9C199.2 241.4 206.7 238.2 214.5 238.2C222.4 238.2 229.9 241.3 235.4 246.8L400.5 411.2C455.1 366.5 484.8 312 484.8 255.1C484.8 193.5 447.9 132.9 380.9 85.76C374.5 81.24 370.1 74.35 368.8 66.62C367.4 58.89 369.2 50.94 373.8 44.53C378.3 38.12 385.2 33.77 392.9 32.43V32.43zM186.9 479.6C179.2 480.9 171.3 479.1 164.8 474.6C81.67 415.9 35.84 338.2 35.84 255.1C35.84 173.7 81.67 96.14 164.8 37.41C170.5 33.4 177.4 31.53 184.4 32.12C191.3 32.71 197.8 35.72 202.7 40.63L386.1 223.3C391.7 228.8 394.8 236.3 394.8 244.2C394.9 251.1 391.8 259.5 386.2 265.1C380.7 270.6 373.2 273.8 365.3 273.8C357.5 273.8 349.1 270.7 344.4 265.2L179.3 100.7C124.7 145.9 95.03 199.9 95.03 255.1C95.03 318.5 131.9 379.1 198.1 426.2C205.4 430.8 209.7 437.6 211.1 445.4C212.4 453.1 210.6 461.1 206.1 467.5C201.6 473.9 194.7 478.2 186.9 479.6V479.6z"],nimblr:[384,512,[],"f5a8","M246.6 299.3c15.57 0 27.15 11.46 27.15 27s-11.62 27-27.15 27c-15.7 0-27.15-11.57-27.15-27s11.55-27 27.15-27zM113 326.3c0-15.61 11.68-27 27.15-27s27.15 11.46 27.15 27-11.47 27-27.15 27c-15.44 0-27.15-11.31-27.15-27M191.8 159C157 159 89.45 178.8 59.25 227L14 0v335.5C14 433.1 93.61 512 191.8 512s177.8-78.95 177.8-176.5S290.1 159 191.8 159zm0 308.1c-73.27 0-132.5-58.9-132.5-131.6s59.24-131.6 132.5-131.6 132.5 58.86 132.5 131.5S265 467.1 191.8 467.1z"],node:[640,512,[],"f419","M316.3 452c-2.1 0-4.2-.6-6.1-1.6L291 439c-2.9-1.6-1.5-2.2-.5-2.5 3.8-1.3 4.6-1.6 8.7-4 .4-.2 1-.1 1.4 .1l14.8 8.8c.5 .3 1.3 .3 1.8 0L375 408c.5-.3 .9-.9 .9-1.6v-66.7c0-.7-.3-1.3-.9-1.6l-57.8-33.3c-.5-.3-1.2-.3-1.8 0l-57.8 33.3c-.6 .3-.9 1-.9 1.6v66.7c0 .6 .4 1.2 .9 1.5l15.8 9.1c8.6 4.3 13.9-.8 13.9-5.8v-65.9c0-.9 .7-1.7 1.7-1.7h7.3c.9 0 1.7 .7 1.7 1.7v65.9c0 11.5-6.2 18-17.1 18-3.3 0-6 0-13.3-3.6l-15.2-8.7c-3.7-2.2-6.1-6.2-6.1-10.5v-66.7c0-4.3 2.3-8.4 6.1-10.5l57.8-33.4c3.7-2.1 8.5-2.1 12.1 0l57.8 33.4c3.7 2.2 6.1 6.2 6.1 10.5v66.7c0 4.3-2.3 8.4-6.1 10.5l-57.8 33.4c-1.7 1.1-3.8 1.7-6 1.7zm46.7-65.8c0-12.5-8.4-15.8-26.2-18.2-18-2.4-19.8-3.6-19.8-7.8 0-3.5 1.5-8.1 14.8-8.1 11.9 0 16.3 2.6 18.1 10.6 .2 .8 .8 1.3 1.6 1.3h7.5c.5 0 .9-.2 1.2-.5 .3-.4 .5-.8 .4-1.3-1.2-13.8-10.3-20.2-28.8-20.2-16.5 0-26.3 7-26.3 18.6 0 12.7 9.8 16.1 25.6 17.7 18.9 1.9 20.4 4.6 20.4 8.3 0 6.5-5.2 9.2-17.4 9.2-15.3 0-18.7-3.8-19.8-11.4-.1-.8-.8-1.4-1.7-1.4h-7.5c-.9 0-1.7 .7-1.7 1.7 0 9.7 5.3 21.3 30.6 21.3 18.5 0 29-7.2 29-19.8zm54.5-50.1c0 6.1-5 11.1-11.1 11.1s-11.1-5-11.1-11.1c0-6.3 5.2-11.1 11.1-11.1 6-.1 11.1 4.8 11.1 11.1zm-1.8 0c0-5.2-4.2-9.3-9.4-9.3-5.1 0-9.3 4.1-9.3 9.3 0 5.2 4.2 9.4 9.3 9.4 5.2-.1 9.4-4.3 9.4-9.4zm-4.5 6.2h-2.6c-.1-.6-.5-3.8-.5-3.9-.2-.7-.4-1.1-1.3-1.1h-2.2v5h-2.4v-12.5h4.3c1.5 0 4.4 0 4.4 3.3 0 2.3-1.5 2.8-2.4 3.1 1.7 .1 1.8 1.2 2.1 2.8 .1 1 .3 2.7 .6 3.3zm-2.8-8.8c0-1.7-1.2-1.7-1.8-1.7h-2v3.5h1.9c1.6 0 1.9-1.1 1.9-1.8zM137.3 191c0-2.7-1.4-5.1-3.7-6.4l-61.3-35.3c-1-.6-2.2-.9-3.4-1h-.6c-1.2 0-2.3 .4-3.4 1L3.7 184.6C1.4 185.9 0 188.4 0 191l.1 95c0 1.3 .7 2.5 1.8 3.2 1.1 .7 2.5 .7 3.7 0L42 268.3c2.3-1.4 3.7-3.8 3.7-6.4v-44.4c0-2.6 1.4-5.1 3.7-6.4l15.5-8.9c1.2-.7 2.4-1 3.7-1 1.3 0 2.6 .3 3.7 1l15.5 8.9c2.3 1.3 3.7 3.8 3.7 6.4v44.4c0 2.6 1.4 5.1 3.7 6.4l36.4 20.9c1.1 .7 2.6 .7 3.7 0 1.1-.6 1.8-1.9 1.8-3.2l.2-95zM472.5 87.3v176.4c0 2.6-1.4 5.1-3.7 6.4l-61.3 35.4c-2.3 1.3-5.1 1.3-7.4 0l-61.3-35.4c-2.3-1.3-3.7-3.8-3.7-6.4v-70.8c0-2.6 1.4-5.1 3.7-6.4l61.3-35.4c2.3-1.3 5.1-1.3 7.4 0l15.3 8.8c1.7 1 3.9-.3 3.9-2.2v-94c0-2.8 3-4.6 5.5-3.2l36.5 20.4c2.3 1.2 3.8 3.7 3.8 6.4zm-46 128.9c0-.7-.4-1.3-.9-1.6l-21-12.2c-.6-.3-1.3-.3-1.9 0l-21 12.2c-.6 .3-.9 .9-.9 1.6v24.3c0 .7 .4 1.3 .9 1.6l21 12.1c.6 .3 1.3 .3 1.8 0l21-12.1c.6-.3 .9-.9 .9-1.6v-24.3zm209.8-.7c2.3-1.3 3.7-3.8 3.7-6.4V192c0-2.6-1.4-5.1-3.7-6.4l-60.9-35.4c-2.3-1.3-5.1-1.3-7.4 0l-61.3 35.4c-2.3 1.3-3.7 3.8-3.7 6.4v70.8c0 2.7 1.4 5.1 3.7 6.4l60.9 34.7c2.2 1.3 5 1.3 7.3 0l36.8-20.5c2.5-1.4 2.5-5 0-6.4L550 241.6c-1.2-.7-1.9-1.9-1.9-3.2v-22.2c0-1.3 .7-2.5 1.9-3.2l19.2-11.1c1.1-.7 2.6-.7 3.7 0l19.2 11.1c1.1 .7 1.9 1.9 1.9 3.2v17.4c0 2.8 3.1 4.6 5.6 3.2l36.7-21.3zM559 219c-.4 .3-.7 .7-.7 1.2v13.6c0 .5 .3 1 .7 1.2l11.8 6.8c.4 .3 1 .3 1.4 0L584 235c.4-.3 .7-.7 .7-1.2v-13.6c0-.5-.3-1-.7-1.2l-11.8-6.8c-.4-.3-1-.3-1.4 0L559 219zm-254.2 43.5v-70.4c0-2.6-1.6-5.1-3.9-6.4l-61.1-35.2c-2.1-1.2-5-1.4-7.4 0l-61.1 35.2c-2.3 1.3-3.9 3.7-3.9 6.4v70.4c0 2.8 1.9 5.2 4 6.4l61.2 35.2c2.4 1.4 5.2 1.3 7.4 0l61-35.2c1.8-1 3.1-2.7 3.6-4.7 .1-.5 .2-1.1 .2-1.7zm-74.3-124.9l-.8 .5h1.1l-.3-.5zm76.2 130.2l-.4-.7v.9l.4-.2z"],"node-js":[448,512,[],"f3d3","M224 508c-6.7 0-13.5-1.8-19.4-5.2l-61.7-36.5c-9.2-5.2-4.7-7-1.7-8 12.3-4.3 14.8-5.2 27.9-12.7 1.4-.8 3.2-.5 4.6 .4l47.4 28.1c1.7 1 4.1 1 5.7 0l184.7-106.6c1.7-1 2.8-3 2.8-5V149.3c0-2.1-1.1-4-2.9-5.1L226.8 37.7c-1.7-1-4-1-5.7 0L36.6 144.3c-1.8 1-2.9 3-2.9 5.1v213.1c0 2 1.1 4 2.9 4.9l50.6 29.2c27.5 13.7 44.3-2.4 44.3-18.7V167.5c0-3 2.4-5.3 5.4-5.3h23.4c2.9 0 5.4 2.3 5.4 5.3V378c0 36.6-20 57.6-54.7 57.6-10.7 0-19.1 0-42.5-11.6l-48.4-27.9C8.1 389.2 .7 376.3 .7 362.4V149.3c0-13.8 7.4-26.8 19.4-33.7L204.6 9c11.7-6.6 27.2-6.6 38.8 0l184.7 106.7c12 6.9 19.4 19.8 19.4 33.7v213.1c0 13.8-7.4 26.7-19.4 33.7L243.4 502.8c-5.9 3.4-12.6 5.2-19.4 5.2zm149.1-210.1c0-39.9-27-50.5-83.7-58-57.4-7.6-63.2-11.5-63.2-24.9 0-11.1 4.9-25.9 47.4-25.9 37.9 0 51.9 8.2 57.7 33.8 .5 2.4 2.7 4.2 5.2 4.2h24c1.5 0 2.9-.6 3.9-1.7s1.5-2.6 1.4-4.1c-3.7-44.1-33-64.6-92.2-64.6-52.7 0-84.1 22.2-84.1 59.5 0 40.4 31.3 51.6 81.8 56.6 60.5 5.9 65.2 14.8 65.2 26.7 0 20.6-16.6 29.4-55.5 29.4-48.9 0-59.6-12.3-63.2-36.6-.4-2.6-2.6-4.5-5.3-4.5h-23.9c-3 0-5.3 2.4-5.3 5.3 0 31.1 16.9 68.2 97.8 68.2 58.4-.1 92-23.2 92-63.4z"],npm:[576,512,[],"f3d4","M288 288h-32v-64h32v64zm288-128v192H288v32H160v-32H0V160h576zm-416 32H32v128h64v-96h32v96h32V192zm160 0H192v160h64v-32h64V192zm224 0H352v128h64v-96h32v96h32v-96h32v96h32V192z"],ns8:[640,512,[],"f3d5","M104.3 269.2h26.07V242.1H104.3zm52.47-26.18-.055-26.18v-.941a39.33 39.33 0 0 0 -78.64 .941v.166h26.4v-.166a12.98 12.98 0 0 1 25.96 0v26.18zm52.36 25.85a91.1 91.1 0 0 1 -91.1 91.1h-.609a91.1 91.1 0 0 1 -91.1-91.1H0v.166A117.3 117.3 0 0 0 117.4 386.3h.775A117.3 117.3 0 0 0 235.5 268.8V242.8H209.1zm-157.2 0a65.36 65.36 0 0 0 130.7 0H156.3a39.02 39.02 0 0 1 -78.04 0V242.9H51.97v-26.62A65.42 65.42 0 0 1 182.8 217.5v25.29h26.34V217.5a91.76 91.76 0 0 0 -183.5 0v25.4H51.91zm418.4-71.17c13.67 0 24.57 6.642 30.05 18.26l.719 1.549 23.25-11.51-.609-1.439c-8.025-19.26-28.5-31.27-53.41-31.27-23.13 0-43.61 11.4-50.97 28.45-.123 26.88-.158 23.9 0 24.85 4.7 11.01 14.56 19.37 28.67 24.24a102 102 0 0 0 19.81 3.984c5.479 .72 10.63 1.384 15.83 3.1 6.364 2.1 10.46 5.257 12.84 9.851v9.851c-3.708 7.527-13.78 12.34-25.79 12.34-14.33 0-25.96-6.918-31.93-19.04l-.72-1.494L415 280.9l.553 1.439c7.915 19.43 29.61 32.04 55.29 32.04 23.63 0 44.61-11.4 52.3-28.45l.166-25.9-.166-.664c-4.87-11.01-15.22-19.65-28.94-24.24-7.693-2.712-14.34-3.6-20.7-4.427a83.78 83.78 0 0 1 -14.83-2.878c-6.31-1.937-10.4-5.092-12.62-9.63v-8.412C449.5 202.4 458.1 197.7 470.3 197.7zM287.6 311.3h26.07v-68.4H287.6zm352.3-53.3c-2.933-6.254-8.3-12.01-15.44-16.71A37.99 37.99 0 0 0 637.4 226l.166-25.35-.166-.664C630 184 610.7 173.3 589.3 173.3S548.5 184 541.1 199.1l-.166 25.35 .166 .664a39.64 39.64 0 0 0 13.01 15.33c-7.2 4.7-12.51 10.46-15.44 16.71l-.166 28.89 .166 .72c7.582 15.99 27.89 26.73 50.58 26.73s43.06-10.74 50.58-26.73l.166-28.89zm-73.22-50.81c3.6-6.31 12.56-10.52 22.58-10.52s19.04 4.206 22.64 10.52v13.73c-3.542 6.2-12.56 10.35-22.64 10.35s-19.09-4.15-22.58-10.35zm47.32 72.17c-3.764 6.641-13.34 10.9-24.68 10.9-11.13 0-20.98-4.372-24.68-10.9V263.3c3.708-6.309 13.5-10.52 24.68-10.52 11.35 0 20.92 4.15 24.68 10.52zM376.4 265.1l-59.83-89.71h-29v40.62h26.51v.387l62.54 94.08H402.3V176.2H376.4z"],nutritionix:[400,512,[],"f3d6","M88 8.1S221.4-.1 209 112.5c0 0 19.1-74.9 103-40.6 0 0-17.7 74-88 56 0 0 14.6-54.6 66.1-56.6 0 0-39.9-10.3-82.1 48.8 0 0-19.8-94.5-93.6-99.7 0 0 75.2 19.4 77.6 107.5 0 .1-106.4 7-104-119.8zm312 315.6c0 48.5-9.7 95.3-32 132.3-42.2 30.9-105 48-168 48-62.9 0-125.8-17.1-168-48C9.7 419 0 372.2 0 323.7 0 275.3 17.7 229 40 192c42.2-30.9 97.1-48.6 160-48.6 63 0 117.8 17.6 160 48.6 22.3 37 40 83.3 40 131.7zM120 428c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zM192 428c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zM264 428c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zM336 428c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm0-66.2c0-15.5-12.5-28-28-28s-28 12.5-28 28 12.5 28 28 28 28-12.5 28-28zm24-39.6c-4.8-22.3-7.4-36.9-16-56-38.8-19.9-90.5-32-144-32S94.8 180.1 56 200c-8.8 19.5-11.2 33.9-16 56 42.2-7.9 98.7-14.8 160-14.8s117.8 6.9 160 14.8z"],"octopus-deploy":[512,512,[],"e082","M455.6 349.2c-45.89-39.09-36.67-77.88-16.09-128.1C475.2 134 415.1 34.14 329.9 8.3 237-19.6 134.3 24.34 99.68 117.1a180.9 180.9 0 0 0 -10.99 73.54c1.733 29.54 14.72 52.97 24.09 80.3 17.2 50.16-28.1 92.74-66.66 117.6-46.81 30.2-36.32 39.86-8.428 41.86 23.38 1.68 44.48-4.548 65.26-15.05 9.2-4.647 40.69-18.93 45.13-28.59C135.9 413.4 111.1 459.5 126.6 488.9c19.1 36.23 67.11-31.77 76.71-45.81 8.591-12.57 42.96-81.28 63.63-46.93 18.86 31.36 8.6 76.39 35.74 104.6 32.85 34.2 51.15-18.31 51.41-44.22 .163-16.41-6.1-95.85 29.9-59.94C405.4 418 436.9 467.8 472.6 463.6c38.74-4.516-22.12-67.97-28.26-78.69 5.393 4.279 53.67 34.13 53.82 9.52C498.2 375.7 468 359.8 455.6 349.2z"],odnoklassniki:[320,512,[],"f263","M275.1 334c-27.4 17.4-65.1 24.3-90 26.9l20.9 20.6 76.3 76.3c27.9 28.6-17.5 73.3-45.7 45.7-19.1-19.4-47.1-47.4-76.3-76.6L84 503.4c-28.2 27.5-73.6-17.6-45.4-45.7 19.4-19.4 47.1-47.4 76.3-76.3l20.6-20.6c-24.6-2.6-62.9-9.1-90.6-26.9-32.6-21-46.9-33.3-34.3-59 7.4-14.6 27.7-26.9 54.6-5.7 0 0 36.3 28.9 94.9 28.9s94.9-28.9 94.9-28.9c26.9-21.1 47.1-8.9 54.6 5.7 12.4 25.7-1.9 38-34.5 59.1zM30.3 129.7C30.3 58 88.6 0 160 0s129.7 58 129.7 129.7c0 71.4-58.3 129.4-129.7 129.4s-129.7-58-129.7-129.4zm66 0c0 35.1 28.6 63.7 63.7 63.7s63.7-28.6 63.7-63.7c0-35.4-28.6-64-63.7-64s-63.7 28.6-63.7 64z"],"old-republic":[496,512,[],"f510","M235.8 10.23c7.5-.31 15-.28 22.5-.09 3.61 .14 7.2 .4 10.79 .73 4.92 .27 9.79 1.03 14.67 1.62 2.93 .43 5.83 .98 8.75 1.46 7.9 1.33 15.67 3.28 23.39 5.4 12.24 3.47 24.19 7.92 35.76 13.21 26.56 12.24 50.94 29.21 71.63 49.88 20.03 20.09 36.72 43.55 48.89 69.19 1.13 2.59 2.44 5.1 3.47 7.74 2.81 6.43 5.39 12.97 7.58 19.63 4.14 12.33 7.34 24.99 9.42 37.83 .57 3.14 1.04 6.3 1.4 9.47 .55 3.83 .94 7.69 1.18 11.56 .83 8.34 .84 16.73 .77 25.1-.07 4.97-.26 9.94-.75 14.89-.24 3.38-.51 6.76-.98 10.12-.39 2.72-.63 5.46-1.11 8.17-.9 5.15-1.7 10.31-2.87 15.41-4.1 18.5-10.3 36.55-18.51 53.63-15.77 32.83-38.83 62.17-67.12 85.12a246.5 246.5 0 0 1 -56.91 34.86c-6.21 2.68-12.46 5.25-18.87 7.41-3.51 1.16-7.01 2.38-10.57 3.39-6.62 1.88-13.29 3.64-20.04 5-4.66 .91-9.34 1.73-14.03 2.48-5.25 .66-10.5 1.44-15.79 1.74-6.69 .66-13.41 .84-20.12 .81-6.82 .03-13.65-.12-20.45-.79-3.29-.23-6.57-.5-9.83-.95-2.72-.39-5.46-.63-8.17-1.11-4.12-.72-8.25-1.37-12.35-2.22-4.25-.94-8.49-1.89-12.69-3.02-8.63-2.17-17.08-5.01-25.41-8.13-10.49-4.12-20.79-8.75-30.64-14.25-2.14-1.15-4.28-2.29-6.35-3.57-11.22-6.58-21.86-14.1-31.92-22.34-34.68-28.41-61.41-66.43-76.35-108.7-3.09-8.74-5.71-17.65-7.8-26.68-1.48-6.16-2.52-12.42-3.58-18.66-.4-2.35-.61-4.73-.95-7.09-.6-3.96-.75-7.96-1.17-11.94-.8-9.47-.71-18.99-.51-28.49 .14-3.51 .34-7.01 .7-10.51 .31-3.17 .46-6.37 .92-9.52 .41-2.81 .65-5.65 1.16-8.44 .7-3.94 1.3-7.9 2.12-11.82 3.43-16.52 8.47-32.73 15.26-48.18 1.15-2.92 2.59-5.72 3.86-8.59 8.05-16.71 17.9-32.56 29.49-47.06 20-25.38 45.1-46.68 73.27-62.47 7.5-4.15 15.16-8.05 23.07-11.37 15.82-6.88 32.41-11.95 49.31-15.38 3.51-.67 7.04-1.24 10.56-1.85 2.62-.47 5.28-.7 7.91-1.08 3.53-.53 7.1-.68 10.65-1.04 2.46-.24 4.91-.36 7.36-.51m8.64 24.41c-9.23 .1-18.43 .99-27.57 2.23-7.3 1.08-14.53 2.6-21.71 4.3-13.91 3.5-27.48 8.34-40.46 14.42-10.46 4.99-20.59 10.7-30.18 17.22-4.18 2.92-8.4 5.8-12.34 9.03-5.08 3.97-9.98 8.17-14.68 12.59-2.51 2.24-4.81 4.7-7.22 7.06-28.22 28.79-48.44 65.39-57.5 104.7-2.04 8.44-3.54 17.02-4.44 25.65-1.1 8.89-1.44 17.85-1.41 26.8 .11 7.14 .38 14.28 1.22 21.37 .62 7.12 1.87 14.16 3.2 21.18 1.07 4.65 2.03 9.32 3.33 13.91 6.29 23.38 16.5 45.7 30.07 65.75 8.64 12.98 18.78 24.93 29.98 35.77 16.28 15.82 35.05 29.04 55.34 39.22 7.28 3.52 14.66 6.87 22.27 9.63 5.04 1.76 10.06 3.57 15.22 4.98 11.26 3.23 22.77 5.6 34.39 7.06 2.91 .29 5.81 .61 8.72 .9 13.82 1.08 27.74 1 41.54-.43 4.45-.6 8.92-.99 13.35-1.78 3.63-.67 7.28-1.25 10.87-2.1 4.13-.98 8.28-1.91 12.36-3.07 26.5-7.34 51.58-19.71 73.58-36.2 15.78-11.82 29.96-25.76 42.12-41.28 3.26-4.02 6.17-8.31 9.13-12.55 3.39-5.06 6.58-10.25 9.6-15.54 2.4-4.44 4.74-8.91 6.95-13.45 5.69-12.05 10.28-24.62 13.75-37.49 2.59-10.01 4.75-20.16 5.9-30.45 1.77-13.47 1.94-27.1 1.29-40.65-.29-3.89-.67-7.77-1-11.66-2.23-19.08-6.79-37.91-13.82-55.8-5.95-15.13-13.53-29.63-22.61-43.13-12.69-18.8-28.24-35.68-45.97-49.83-25.05-20-54.47-34.55-85.65-42.08-7.78-1.93-15.69-3.34-23.63-4.45-3.91-.59-7.85-.82-11.77-1.24-7.39-.57-14.81-.72-22.22-.58zM139.3 83.53c13.3-8.89 28.08-15.38 43.3-20.18-3.17 1.77-6.44 3.38-9.53 5.29-11.21 6.68-21.52 14.9-30.38 24.49-6.8 7.43-12.76 15.73-17.01 24.89-3.29 6.86-5.64 14.19-6.86 21.71-.93 4.85-1.3 9.81-1.17 14.75 .13 13.66 4.44 27.08 11.29 38.82 5.92 10.22 13.63 19.33 22.36 27.26 4.85 4.36 10.24 8.09 14.95 12.6 2.26 2.19 4.49 4.42 6.43 6.91 2.62 3.31 4.89 6.99 5.99 11.1 .9 3.02 .66 6.2 .69 9.31 .02 4.1-.04 8.2 .03 12.3 .14 3.54-.02 7.09 .11 10.63 .08 2.38 .02 4.76 .05 7.14 .16 5.77 .06 11.53 .15 17.3 .11 2.91 .02 5.82 .13 8.74 .03 1.63 .13 3.28-.03 4.91-.91 .12-1.82 .18-2.73 .16-10.99 0-21.88-2.63-31.95-6.93-6-2.7-11.81-5.89-17.09-9.83-5.75-4.19-11.09-8.96-15.79-14.31-6.53-7.24-11.98-15.39-16.62-23.95-1.07-2.03-2.24-4.02-3.18-6.12-1.16-2.64-2.62-5.14-3.67-7.82-4.05-9.68-6.57-19.94-8.08-30.31-.49-4.44-1.09-8.88-1.2-13.35-.7-15.73 .84-31.55 4.67-46.82 2.12-8.15 4.77-16.18 8.31-23.83 6.32-14.2 15.34-27.18 26.3-38.19 6.28-6.2 13.13-11.84 20.53-16.67zm175.4-20.12c2.74 .74 5.41 1.74 8.09 2.68 6.36 2.33 12.68 4.84 18.71 7.96 13.11 6.44 25.31 14.81 35.82 24.97 10.2 9.95 18.74 21.6 25.14 34.34 1.28 2.75 2.64 5.46 3.81 8.26 6.31 15.1 10 31.26 11.23 47.57 .41 4.54 .44 9.09 .45 13.64 .07 11.64-1.49 23.25-4.3 34.53-1.97 7.27-4.35 14.49-7.86 21.18-3.18 6.64-6.68 13.16-10.84 19.24-6.94 10.47-15.6 19.87-25.82 27.22-10.48 7.64-22.64 13.02-35.4 15.38-3.51 .69-7.08 1.08-10.66 1.21-1.85 .06-3.72 .16-5.56-.1-.28-2.15 0-4.31-.01-6.46-.03-3.73 .14-7.45 .1-11.17 .19-7.02 .02-14.05 .21-21.07 .03-2.38-.03-4.76 .03-7.14 .17-5.07-.04-10.14 .14-15.21 .1-2.99-.24-6.04 .51-8.96 .66-2.5 1.78-4.86 3.09-7.08 4.46-7.31 11.06-12.96 17.68-18.26 5.38-4.18 10.47-8.77 15.02-13.84 7.68-8.37 14.17-17.88 18.78-28.27 2.5-5.93 4.52-12.1 5.55-18.46 .86-4.37 1.06-8.83 1.01-13.27-.02-7.85-1.4-15.65-3.64-23.17-1.75-5.73-4.27-11.18-7.09-16.45-3.87-6.93-8.65-13.31-13.96-19.2-9.94-10.85-21.75-19.94-34.6-27.1-1.85-1.02-3.84-1.82-5.63-2.97zm-100.8 58.45c.98-1.18 1.99-2.33 3.12-3.38-.61 .93-1.27 1.81-1.95 2.68-3.1 3.88-5.54 8.31-7.03 13.06-.87 3.27-1.68 6.6-1.73 10-.07 2.52-.08 5.07 .32 7.57 1.13 7.63 4.33 14.85 8.77 21.12 2 2.7 4.25 5.27 6.92 7.33 1.62 1.27 3.53 2.09 5.34 3.05 3.11 1.68 6.32 3.23 9.07 5.48 2.67 2.09 4.55 5.33 4.4 8.79-.01 73.67 0 147.3-.01 221 0 1.35-.08 2.7 .04 4.04 .13 1.48 .82 2.83 1.47 4.15 .86 1.66 1.78 3.34 3.18 4.62 .85 .77 1.97 1.4 3.15 1.24 1.5-.2 2.66-1.35 3.45-2.57 .96-1.51 1.68-3.16 2.28-4.85 .76-2.13 .44-4.42 .54-6.63 .14-4.03-.02-8.06 .14-12.09 .03-5.89 .03-11.77 .06-17.66 .14-3.62 .03-7.24 .11-10.86 .15-4.03-.02-8.06 .14-12.09 .03-5.99 .03-11.98 .07-17.97 .14-3.62 .02-7.24 .11-10.86 .14-3.93-.02-7.86 .14-11.78 .03-5.99 .03-11.98 .06-17.97 .16-3.94-.01-7.88 .19-11.82 .29 1.44 .13 2.92 .22 4.38 .19 3.61 .42 7.23 .76 10.84 .32 3.44 .44 6.89 .86 10.32 .37 3.1 .51 6.22 .95 9.31 .57 4.09 .87 8.21 1.54 12.29 1.46 9.04 2.83 18.11 5.09 26.99 1.13 4.82 2.4 9.61 4 14.3 2.54 7.9 5.72 15.67 10.31 22.62 1.73 2.64 3.87 4.98 6.1 7.21 .27 .25 .55 .51 .88 .71 .6 .25 1.31-.07 1.7-.57 .71-.88 1.17-1.94 1.7-2.93 4.05-7.8 8.18-15.56 12.34-23.31 .7-1.31 1.44-2.62 2.56-3.61 1.75-1.57 3.84-2.69 5.98-3.63 2.88-1.22 5.9-2.19 9.03-2.42 6.58-.62 13.11 .75 19.56 1.85 3.69 .58 7.4 1.17 11.13 1.41 3.74 .1 7.48 .05 11.21-.28 8.55-.92 16.99-2.96 24.94-6.25 5.3-2.24 10.46-4.83 15.31-7.93 11.46-7.21 21.46-16.57 30.04-27.01 1.17-1.42 2.25-2.9 3.46-4.28-1.2 3.24-2.67 6.37-4.16 9.48-1.25 2.9-2.84 5.61-4.27 8.42-5.16 9.63-11.02 18.91-17.75 27.52-4.03 5.21-8.53 10.05-13.33 14.57-6.64 6.05-14.07 11.37-22.43 14.76-8.21 3.37-17.31 4.63-26.09 3.29-3.56-.58-7.01-1.69-10.41-2.88-2.79-.97-5.39-2.38-8.03-3.69-3.43-1.71-6.64-3.81-9.71-6.08 2.71 3.06 5.69 5.86 8.7 8.61 4.27 3.76 8.74 7.31 13.63 10.23 3.98 2.45 8.29 4.4 12.84 5.51 1.46 .37 2.96 .46 4.45 .6-1.25 1.1-2.63 2.04-3.99 2.98-9.61 6.54-20.01 11.86-30.69 16.43-20.86 8.7-43.17 13.97-65.74 15.34-4.66 .24-9.32 .36-13.98 .36-4.98-.11-9.97-.13-14.92-.65-11.2-.76-22.29-2.73-33.17-5.43-10.35-2.71-20.55-6.12-30.3-10.55-8.71-3.86-17.12-8.42-24.99-13.79-1.83-1.31-3.74-2.53-5.37-4.08 6.6-1.19 13.03-3.39 18.99-6.48 5.74-2.86 10.99-6.66 15.63-11.07 2.24-2.19 4.29-4.59 6.19-7.09-3.43 2.13-6.93 4.15-10.62 5.78-4.41 2.16-9.07 3.77-13.81 5.02-5.73 1.52-11.74 1.73-17.61 1.14-8.13-.95-15.86-4.27-22.51-8.98-4.32-2.94-8.22-6.43-11.96-10.06-9.93-10.16-18.2-21.81-25.66-33.86-3.94-6.27-7.53-12.75-11.12-19.22-1.05-2.04-2.15-4.05-3.18-6.1 2.85 2.92 5.57 5.97 8.43 8.88 8.99 8.97 18.56 17.44 29.16 24.48 7.55 4.9 15.67 9.23 24.56 11.03 3.11 .73 6.32 .47 9.47 .81 2.77 .28 5.56 .2 8.34 .3 5.05 .06 10.11 .04 15.16-.16 3.65-.16 7.27-.66 10.89-1.09 2.07-.25 4.11-.71 6.14-1.2 3.88-.95 8.11-.96 11.83 .61 4.76 1.85 8.44 5.64 11.38 9.71 2.16 3.02 4.06 6.22 5.66 9.58 1.16 2.43 2.46 4.79 3.55 7.26 1 2.24 2.15 4.42 3.42 6.52 .67 1.02 1.4 2.15 2.62 2.55 1.06-.75 1.71-1.91 2.28-3.03 2.1-4.16 3.42-8.65 4.89-13.05 2.02-6.59 3.78-13.27 5.19-20.02 2.21-9.25 3.25-18.72 4.54-28.13 .56-3.98 .83-7.99 1.31-11.97 .87-10.64 1.9-21.27 2.24-31.94 .08-1.86 .24-3.71 .25-5.57 .01-4.35 .25-8.69 .22-13.03-.01-2.38-.01-4.76 0-7.13 .05-5.07-.2-10.14-.22-15.21-.2-6.61-.71-13.2-1.29-19.78-.73-5.88-1.55-11.78-3.12-17.51-2.05-7.75-5.59-15.03-9.8-21.82-3.16-5.07-6.79-9.88-11.09-14.03-3.88-3.86-8.58-7.08-13.94-8.45-1.5-.41-3.06-.45-4.59-.64 .07-2.99 .7-5.93 1.26-8.85 1.59-7.71 3.8-15.3 6.76-22.6 1.52-4.03 3.41-7.9 5.39-11.72 3.45-6.56 7.62-12.79 12.46-18.46zm31.27 1.7c.35-.06 .71-.12 1.07-.19 .19 1.79 .09 3.58 .1 5.37v38.13c-.01 1.74 .13 3.49-.15 5.22-.36-.03-.71-.05-1.06-.05-.95-3.75-1.72-7.55-2.62-11.31-.38-1.53-.58-3.09-1.07-4.59-1.7-.24-3.43-.17-5.15-.2-5.06-.01-10.13 0-15.19-.01-1.66-.01-3.32 .09-4.98-.03-.03-.39-.26-.91 .16-1.18 1.28-.65 2.72-.88 4.06-1.35 3.43-1.14 6.88-2.16 10.31-3.31 1.39-.48 2.9-.72 4.16-1.54 .04-.56 .02-1.13-.05-1.68-1.23-.55-2.53-.87-3.81-1.28-3.13-1.03-6.29-1.96-9.41-3.02-1.79-.62-3.67-1-5.41-1.79-.03-.37-.07-.73-.11-1.09 5.09-.19 10.2 .06 15.3-.12 3.36-.13 6.73 .08 10.09-.07 .12-.39 .26-.77 .37-1.16 1.08-4.94 2.33-9.83 3.39-14.75zm5.97-.2c.36 .05 .72 .12 1.08 .2 .98 3.85 1.73 7.76 2.71 11.61 .36 1.42 .56 2.88 1.03 4.27 2.53 .18 5.07-.01 7.61 .05 5.16 .12 10.33 .12 15.49 .07 .76-.01 1.52 .03 2.28 .08-.04 .36-.07 .72-.1 1.08-1.82 .83-3.78 1.25-5.67 1.89-3.73 1.23-7.48 2.39-11.22 3.57-.57 .17-1.12 .42-1.67 .64-.15 .55-.18 1.12-.12 1.69 .87 .48 1.82 .81 2.77 1.09 4.88 1.52 9.73 3.14 14.63 4.6 .38 .13 .78 .27 1.13 .49 .4 .27 .23 .79 .15 1.18-1.66 .13-3.31 .03-4.97 .04-5.17 .01-10.33-.01-15.5 .01-1.61 .03-3.22-.02-4.82 .21-.52 1.67-.72 3.42-1.17 5.11-.94 3.57-1.52 7.24-2.54 10.78-.36 .01-.71 .02-1.06 .06-.29-1.73-.15-3.48-.15-5.22v-38.13c.02-1.78-.08-3.58 .11-5.37zM65.05 168.3c1.12-2.15 2.08-4.4 3.37-6.46-1.82 7.56-2.91 15.27-3.62 23-.8 7.71-.85 15.49-.54 23.23 1.05 19.94 5.54 39.83 14.23 57.88 2.99 5.99 6.35 11.83 10.5 17.11 6.12 7.47 12.53 14.76 19.84 21.09 4.8 4.1 9.99 7.78 15.54 10.8 3.27 1.65 6.51 3.39 9.94 4.68 5.01 2.03 10.19 3.61 15.42 4.94 3.83 .96 7.78 1.41 11.52 2.71 5 1.57 9.47 4.61 13.03 8.43 4.93 5.23 8.09 11.87 10.2 18.67 .99 2.9 1.59 5.91 2.17 8.92 .15 .75 .22 1.52 .16 2.29-6.5 2.78-13.26 5.06-20.26 6.18-4.11 .78-8.29 .99-12.46 1.08-10.25 .24-20.47-1.76-30.12-5.12-3.74-1.42-7.49-2.85-11.03-4.72-8.06-3.84-15.64-8.7-22.46-14.46-2.92-2.55-5.83-5.13-8.4-8.03-9.16-9.83-16.3-21.41-21.79-33.65-2.39-5.55-4.61-11.18-6.37-16.96-1.17-3.94-2.36-7.89-3.26-11.91-.75-2.94-1.22-5.95-1.87-8.92-.46-2.14-.69-4.32-1.03-6.48-.85-5.43-1.28-10.93-1.33-16.43 .11-6.18 .25-12.37 1.07-18.5 .4-2.86 .67-5.74 1.15-8.6 .98-5.7 2.14-11.37 3.71-16.93 3.09-11.65 7.48-22.95 12.69-33.84zm363.7-6.44c1.1 1.66 1.91 3.48 2.78 5.26 2.1 4.45 4.24 8.9 6.02 13.49 7.61 18.76 12.3 38.79 13.04 59.05 .02 1.76 .07 3.52 .11 5.29 .13 9.57-1.27 19.09-3.18 28.45-.73 3.59-1.54 7.17-2.58 10.69-4.04 14.72-10 29-18.41 41.78-8.21 12.57-19.01 23.55-31.84 31.41-5.73 3.59-11.79 6.64-18.05 9.19-5.78 2.19-11.71 4.03-17.8 5.11-6.4 1.05-12.91 1.52-19.4 1.23-7.92-.48-15.78-2.07-23.21-4.85-1.94-.8-3.94-1.46-5.84-2.33-.21-1.51 .25-2.99 .53-4.46 1.16-5.74 3.03-11.36 5.7-16.58 2.37-4.51 5.52-8.65 9.46-11.9 2.43-2.05 5.24-3.61 8.16-4.83 3.58-1.5 7.47-1.97 11.24-2.83 7.23-1.71 14.37-3.93 21.15-7 10.35-4.65 19.71-11.38 27.65-19.46 1.59-1.61 3.23-3.18 4.74-4.87 3.37-3.76 6.71-7.57 9.85-11.53 7.48-10.07 12.82-21.59 16.71-33.48 1.58-5.3 3.21-10.6 4.21-16.05 .63-2.87 1.04-5.78 1.52-8.68 .87-6.09 1.59-12.22 1.68-18.38 .12-6.65 .14-13.32-.53-19.94-.73-7.99-1.87-15.96-3.71-23.78z"],opencart:[640,512,[],"f23d","M423.3 440.7c0 25.3-20.3 45.6-45.6 45.6s-45.8-20.3-45.8-45.6 20.6-45.8 45.8-45.8c25.4 0 45.6 20.5 45.6 45.8zm-253.9-45.8c-25.3 0-45.6 20.6-45.6 45.8s20.3 45.6 45.6 45.6 45.8-20.3 45.8-45.6-20.5-45.8-45.8-45.8zm291.7-270C158.9 124.9 81.9 112.1 0 25.7c34.4 51.7 53.3 148.9 373.1 144.2 333.3-5 130 86.1 70.8 188.9 186.7-166.7 319.4-233.9 17.2-233.9z"],openid:[448,512,[],"f19b","M271.5 432l-68 32C88.5 453.7 0 392.5 0 318.2c0-71.5 82.5-131 191.7-144.3v43c-71.5 12.5-124 53-124 101.3 0 51 58.5 93.3 135.7 103v-340l68-33.2v384zM448 291l-131.3-28.5 36.8-20.7c-19.5-11.5-43.5-20-70-24.8v-43c46.2 5.5 87.7 19.5 120.3 39.3l35-19.8L448 291z"],opera:[496,512,[],"f26a","M313.9 32.7c-170.2 0-252.6 223.8-147.5 355.1 36.5 45.4 88.6 75.6 147.5 75.6 36.3 0 70.3-11.1 99.4-30.4-43.8 39.2-101.9 63-165.3 63-3.9 0-8 0-11.9-.3C104.6 489.6 0 381.1 0 248 0 111 111 0 248 0h.8c63.1 .3 120.7 24.1 164.4 63.1-29-19.4-63.1-30.4-99.3-30.4zm101.8 397.7c-40.9 24.7-90.7 23.6-132-5.8 56.2-20.5 97.7-91.6 97.7-176.6 0-84.7-41.2-155.8-97.4-176.6 41.8-29.2 91.2-30.3 132.9-5 105.9 98.7 105.5 265.7-1.2 364z"],"optin-monster":[576,512,[],"f23c","M572.6 421.4c5.6-9.5 4.7-15.2-5.4-11.6-3-4.9-7-9.5-11.1-13.8 2.9-9.7-.7-14.2-10.8-9.2-4.6-3.2-10.3-6.5-15.9-9.2 0-15.1-11.6-11.6-17.6-5.7-10.4-1.5-18.7-.3-26.8 5.7 .3-6.5 .3-13 .3-19.7 12.6 0 40.2-11 45.9-36.2 1.4-6.8 1.6-13.8-.3-21.9-3-13.5-14.3-21.3-25.1-25.7-.8-5.9-7.6-14.3-14.9-15.9s-12.4 4.9-14.1 10.3c-8.5 0-19.2 2.8-21.1 8.4-5.4-.5-11.1-1.4-16.8-1.9 2.7-1.9 5.4-3.5 8.4-4.6 5.4-9.2 14.6-11.4 25.7-11.6V256c19.5-.5 43-5.9 53.8-18.1 12.7-13.8 14.6-37.3 12.4-55.1-2.4-17.3-9.7-37.6-24.6-48.1-8.4-5.9-21.6-.8-22.7 9.5-2.2 19.6 1.2 30-38.6 25.1-10.3-23.8-24.6-44.6-42.7-60C341 49.6 242.9 55.5 166.4 71.7c19.7 4.6 41.1 8.6 59.7 16.5-26.2 2.4-52.7 11.3-76.2 23.2-32.8 17-44 29.9-56.7 42.4 14.9-2.2 28.9-5.1 43.8-3.8-9.7 5.4-18.4 12.2-26.5 20-25.8 .9-23.8-5.3-26.2-25.9-1.1-10.5-14.3-15.4-22.7-9.7-28.1 19.9-33.5 79.9-12.2 103.5 10.8 12.2 35.1 17.3 54.9 17.8-.3 1.1-.3 1.9-.3 2.7 10.8 .5 19.5 2.7 24.6 11.6 3 1.1 5.7 2.7 8.1 4.6-5.4 .5-11.1 1.4-16.5 1.9-3.3-6.6-13.7-8.1-21.1-8.1-1.6-5.7-6.5-12.2-14.1-10.3-6.8 1.9-14.1 10-14.9 15.9-22.5 9.5-30.1 26.8-25.1 47.6 5.3 24.8 33 36.2 45.9 36.2v19.7c-6.6-5-14.3-7.5-26.8-5.7-5.5-5.5-17.3-10.1-17.3 5.7-5.9 2.7-11.4 5.9-15.9 9.2-9.8-4.9-13.6-1.7-11.1 9.2-4.1 4.3-7.8 8.6-11.1 13.8-10.2-3.7-11 2.2-5.4 11.6-1.1 3.5-1.6 7-1.9 10.8-.5 31.6 44.6 64 73.5 65.1 17.3 .5 34.6-8.4 43-23.5 113.2 4.9 226.7 4.1 340.2 0 8.1 15.1 25.4 24.3 42.7 23.5 29.2-1.1 74.3-33.5 73.5-65.1 .2-3.7-.7-7.2-1.7-10.7zm-73.8-254c1.1-3 2.4-8.4 2.4-14.6 0-5.9 6.8-8.1 14.1-.8 11.1 11.6 14.9 40.5 13.8 51.1-4.1-13.6-13-29-30.3-35.7zm-4.6 6.7c19.5 6.2 28.6 27.6 29.7 48.9-1.1 2.7-3 5.4-4.9 7.6-5.7 5.9-15.4 10-26.2 12.2 4.3-21.3 .3-47.3-12.7-63 4.9-.8 10.9-2.4 14.1-5.7zm-24.1 6.8c13.8 11.9 20 39.2 14.1 63.5-4.1 .5-8.1 .8-11.6 .8-1.9-21.9-6.8-44-14.3-64.6 3.7 .3 8.1 .3 11.8 .3zM47.5 203c-1.1-10.5 2.4-39.5 13.8-51.1 7-7.3 14.1-5.1 14.1 .8 0 6.2 1.4 11.6 2.4 14.6-17.3 6.8-26.2 22.2-30.3 35.7zm9.7 27.6c-1.9-2.2-3.5-4.9-4.9-7.6 1.4-21.3 10.3-42.7 29.7-48.9 3.2 3.2 9.2 4.9 14.1 5.7-13 15.7-17 41.6-12.7 63-10.8-2.2-20.5-6-26.2-12.2zm47.9 14.6c-4.1 0-8.1-.3-12.7-.8-4.6-18.6-1.9-38.9 5.4-53v.3l12.2-5.1c4.9-1.9 9.7-3.8 14.9-4.9-10.7 19.7-17.4 41.3-19.8 63.5zm184-162.7c41.9 0 76.2 34 76.2 75.9 0 42.2-34.3 76.2-76.2 76.2s-76.2-34-76.2-76.2c0-41.8 34.3-75.9 76.2-75.9zm115.6 174.3c-.3 17.8-7 48.9-23 57-13.2 6.6-6.5-7.5-16.5-58.1 13.3 .3 26.6 .3 39.5 1.1zm-54-1.6c.8 4.9 3.8 40.3-1.6 41.9-11.6 3.5-40 4.3-51.1-1.1-4.1-3-4.6-35.9-4.3-41.1v.3c18.9-.3 38.1-.3 57 0zM278.3 309c-13 3.5-41.6 4.1-54.6-1.6-6.5-2.7-3.8-42.4-1.9-51.6 19.2-.5 38.4-.5 57.8-.8v.3c1.1 8.3 3.3 51.2-1.3 53.7zm-106.5-51.1c12.2-.8 24.6-1.4 36.8-1.6-2.4 15.4-3 43.5-4.9 52.2-1.1 6.8-4.3 6.8-9.7 4.3-21.9-9.8-27.6-35.2-22.2-54.9zm-35.4 31.3c7.8-1.1 15.7-1.9 23.5-2.7 1.6 6.2 3.8 11.9 7 17.6 10 17 44 35.7 45.1 7 6.2 14.9 40.8 12.2 54.9 10.8 15.7-1.4 23.8-1.4 26.8-14.3 12.4 4.3 30.8 4.1 44 3 11.3-.8 20.8-.5 24.6-8.9 1.1 5.1 1.9 11.6 4.6 16.8 10.8 21.3 37.3 1.4 46.8-31.6 8.6 .8 17.6 1.9 26.5 2.7-.4 1.3-3.8 7.3 7.3 11.6-47.6 47-95.7 87.8-163.2 107-63.2-20.8-112.1-59.5-155.9-106.5 9.6-3.4 10.4-8.8 8-12.5zm-21.6 172.5c-3.8 17.8-21.9 29.7-39.7 28.9-19.2-.8-46.5-17-59.2-36.5-2.7-31.1 43.8-61.3 66.2-54.6 14.9 4.3 27.8 30.8 33.5 54 0 3-.3 5.7-.8 8.2zm-8.7-66c-.5-13.5-.5-27-.3-40.5h.3c2.7-1.6 5.7-3.8 7.8-6.5 6.5-1.6 13-5.1 15.1-9.2 3.3-7.1-7-7.5-5.4-12.4 2.7-1.1 5.7-2.2 7.8-3.5 29.2 29.2 58.6 56.5 97.3 77-36.8 11.3-72.4 27.6-105.9 47-1.2-18.6-7.7-35.9-16.7-51.9zm337.6 64.6c-103 3.5-206.2 4.1-309.4 0 0 .3 0 .3-.3 .3v-.3h.3c35.1-21.6 72.2-39.2 112.4-50.8 11.6 5.1 23 9.5 34.9 13.2 2.2 .8 2.2 .8 4.3 0 14.3-4.1 28.4-9.2 42.2-15.4 41.5 11.7 78.8 31.7 115.6 53zm10.5-12.4c-35.9-19.5-73-35.9-111.9-47.6 38.1-20 71.9-47.3 103.5-76.7 2.2 1.4 4.6 2.4 7.6 3.2 0 .8 .3 1.9 .5 2.4-4.6 2.7-7.8 6.2-5.9 10.3 2.2 3.8 8.6 7.6 15.1 8.9 2.4 2.7 5.1 5.1 8.1 6.8 0 13.8-.3 27.6-.8 41.3l.3-.3c-9.3 15.9-15.5 37-16.5 51.7zm105.9 6.2c-12.7 19.5-40 35.7-59.2 36.5-19.3 .9-40.5-13.2-40.5-37 5.7-23.2 18.9-49.7 33.5-54 22.7-6.9 69.2 23.4 66.2 54.5zM372.9 75.2c-3.8-72.1-100.8-79.7-126-23.5 44.6-24.3 90.3-15.7 126 23.5zM74.8 407.1c-15.7 1.6-49.5 25.4-49.5 43.2 0 11.6 15.7 19.5 32.2 14.9 12.2-3.2 31.1-17.6 35.9-27.3 6-11.6-3.7-32.7-18.6-30.8zm215.9-176.2c28.6 0 51.9-21.6 51.9-48.4 0-36.1-40.5-58.1-72.2-44.3 9.5 3 16.5 11.6 16.5 21.6 0 23.3-33.3 32-46.5 11.3-7.3 34.1 19.4 59.8 50.3 59.8zM68 474.1c.5 6.5 12.2 12.7 21.6 9.5 6.8-2.7 14.6-10.5 17.3-16.2 3-7-1.1-20-9.7-18.4-8.9 1.6-29.7 16.7-29.2 25.1zm433.2-67c-14.9-1.9-24.6 19.2-18.9 30.8 4.9 9.7 24.1 24.1 36.2 27.3 16.5 4.6 32.2-3.2 32.2-14.9 0-17.8-33.8-41.6-49.5-43.2zM478.8 449c-8.4-1.6-12.4 11.3-9.5 18.4 2.4 5.7 10.3 13.5 17.3 16.2 9.2 3.2 21.1-3 21.3-9.5 .9-8.4-20.2-23.5-29.1-25.1z"],orcid:[512,512,[],"f8d2","M294.8 188.2h-45.92V342h47.47c67.62 0 83.12-51.34 83.12-76.91 0-41.64-26.54-76.9-84.67-76.9zM256 8C119 8 8 119 8 256s111 248 248 248 248-111 248-248S393 8 256 8zm-80.79 360.8h-29.84v-207.5h29.84zm-14.92-231.1a19.57 19.57 0 1 1 19.57-19.57 19.64 19.64 0 0 1 -19.57 19.57zM300 369h-81V161.3h80.6c76.73 0 110.4 54.83 110.4 103.8C410 318.4 368.4 369 300 369z"],osi:[512,512,[],"f41a","M8 266.4C10.3 130.6 105.4 34 221.8 18.34c138.8-18.6 255.6 75.8 278 201.1 21.3 118.8-44 230-151.6 274-9.3 3.8-14.4 1.7-18-7.7q-26.7-69.45-53.4-139c-3.1-8.1-1-13.2 7-16.8 24.2-11 39.3-29.4 43.3-55.8a71.47 71.47 0 0 0 -64.5-82.2c-39-3.4-71.8 23.7-77.5 59.7-5.2 33 11.1 63.7 41.9 77.7 9.6 4.4 11.5 8.6 7.8 18.4q-26.85 69.9-53.7 139.9c-2.6 6.9-8.3 9.3-15.5 6.5-52.6-20.3-101.4-61-130.8-119-24.9-49.2-25.2-87.7-26.8-108.7zm20.9-1.9c.4 6.6 .6 14.3 1.3 22.1 6.3 71.9 49.6 143.5 131 183.1 3.2 1.5 4.4 .8 5.6-2.3q22.35-58.65 45-117.3c1.3-3.3 .6-4.8-2.4-6.7-31.6-19.9-47.3-48.5-45.6-86 1-21.6 9.3-40.5 23.8-56.3 30-32.7 77-39.8 115.5-17.6a91.64 91.64 0 0 1 45.2 90.4c-3.6 30.6-19.3 53.9-45.7 69.8-2.7 1.6-3.5 2.9-2.3 6q22.8 58.8 45.2 117.7c1.2 3.1 2.4 3.8 5.6 2.3 35.5-16.6 65.2-40.3 88.1-72 34.8-48.2 49.1-101.9 42.3-161-13.7-117.5-119.4-214.8-255.5-198-106.1 13-195.3 102.5-197.1 225.8z"],padlet:[640,512,[],"e4a0","M297.9 0L298 .001C305.6 .1078 312.4 4.72 315.5 11.78L447.5 320.3L447.8 320.2L448 320.6L445.2 330.6L402.3 488.6C398.6 504.8 382.6 514.9 366.5 511.2L298.1 495.6L229.6 511.2C213.5 514.9 197.5 504.8 193.8 488.6L150.9 330.6L148.2 320.6L148.3 320.2L280.4 11.78C283.4 4.797 290.3 .1837 297.9 .0006L297.9 0zM160.1 322.1L291.1 361.2L298 483.7L305.9 362.2L436.5 322.9L436.7 322.8L305.7 347.9L297.1 27.72L291.9 347.9L160.1 322.1zM426 222.6L520.4 181.6H594.2L437.2 429.2L468.8 320.2L426 222.6zM597.5 181.4L638.9 257.6C642.9 265.1 635 273.5 627.3 269.8L579.7 247.1L597.5 181.4zM127.3 318.5L158.7 430L1.61 154.5C-4.292 144.1 7.128 132.5 17.55 138.3L169.4 222.5L127.3 318.5z"],page4:[496,512,[],"f3d7","M248 504C111 504 0 393 0 256S111 8 248 8c20.9 0 41.3 2.6 60.7 7.5L42.3 392H248v112zm0-143.6V146.8L98.6 360.4H248zm96 31.6v92.7c45.7-19.2 84.5-51.7 111.4-92.7H344zm57.4-138.2l-21.2 8.4 21.2 8.3v-16.7zm-20.3 54.5c-6.7 0-8 6.3-8 12.9v7.7h16.2v-10c0-5.9-2.3-10.6-8.2-10.6zM496 256c0 37.3-8.2 72.7-23 104.4H344V27.3C433.3 64.8 496 153.1 496 256zM360.4 143.6h68.2V96h-13.9v32.6h-13.9V99h-13.9v29.6h-12.7V96h-13.9v47.6zm68.1 185.3H402v-11c0-15.4-5.6-25.2-20.9-25.2-15.4 0-20.7 10.6-20.7 25.9v25.3h68.2v-15zm0-103l-68.2 29.7V268l68.2 29.5v-16.6l-14.4-5.7v-26.5l14.4-5.9v-16.9zm-4.8-68.5h-35.6V184H402v-12.2h11c8.6 15.8 1.3 35.3-18.6 35.3-22.5 0-28.3-25.3-15.5-37.7l-11.6-10.6c-16.2 17.5-12.2 63.9 27.1 63.9 34 0 44.7-35.9 29.3-65.3z"],pagelines:[384,512,[],"f18c","M384 312.7c-55.1 136.7-187.1 54-187.1 54-40.5 81.8-107.4 134.4-184.6 134.7-16.1 0-16.6-24.4 0-24.4 64.4-.3 120.5-42.7 157.2-110.1-41.1 15.9-118.6 27.9-161.6-82.2 109-44.9 159.1 11.2 178.3 45.5 9.9-24.4 17-50.9 21.6-79.7 0 0-139.7 21.9-149.5-98.1 119.1-47.9 152.6 76.7 152.6 76.7 1.6-16.7 3.3-52.6 3.3-53.4 0 0-106.3-73.7-38.1-165.2 124.6 43 61.4 162.4 61.4 162.4 .5 1.6 .5 23.8 0 33.4 0 0 45.2-89 136.4-57.5-4.2 134-141.9 106.4-141.9 106.4-4.4 27.4-11.2 53.4-20 77.5 0 0 83-91.8 172-20z"],palfed:[576,512,[],"f3d8","M384.9 193.9c0-47.4-55.2-44.2-95.4-29.8-1.3 39.4-2.5 80.7-3 119.8 .7 2.8 2.6 6.2 15.1 6.2 36.8 0 83.4-42.8 83.3-96.2zm-194.5 72.2c.2 0 6.5-2.7 11.2-2.7 26.6 0 20.7 44.1-14.4 44.1-21.5 0-37.1-18.1-37.1-43 0-42 42.9-95.6 100.7-126.5 1-12.4 3-22 10.5-28.2 11.2-9 26.6-3.5 29.5 11.1 72.2-22.2 135.2 1 135.2 72 0 77.9-79.3 152.6-140.1 138.2-.1 39.4 .9 74.4 2.7 100v.2c.2 3.4 .6 12.5-5.3 19.1-9.6 10.6-33.4 10-36.4-22.3-4.1-44.4 .2-206.1 1.4-242.5-21.5 15-58.5 50.3-58.5 75.9 .2 2.5 .4 4 .6 4.6zM8 181.1s-.1 37.4 38.4 37.4h30l22.4 217.2s0 44.3 44.7 44.3h288.9s44.7-.4 44.7-44.3l22.4-217.2h30s38.4 1.2 38.4-37.4c0 0 .1-37.4-38.4-37.4h-30.1c-7.3-25.6-30.2-74.3-119.4-74.3h-28V50.3s-2.7-18.4-21.1-18.4h-85.8s-21.1 0-21.1 18.4v19.1h-28.1s-105 4.2-120.5 74.3h-29S8 142.5 8 181.1z"],patreon:[512,512,[],"f3d9","M512 194.8c0 101.3-82.4 183.8-183.8 183.8-101.7 0-184.4-82.4-184.4-183.8 0-101.6 82.7-184.3 184.4-184.3C429.6 10.5 512 93.2 512 194.8zM0 501.5h90v-491H0v491z"],paypal:[384,512,[],"f1ed","M111.4 295.9c-3.5 19.2-17.4 108.7-21.5 134-.3 1.8-1 2.5-3 2.5H12.3c-7.6 0-13.1-6.6-12.1-13.9L58.8 46.6c1.5-9.6 10.1-16.9 20-16.9 152.3 0 165.1-3.7 204 11.4 60.1 23.3 65.6 79.5 44 140.3-21.5 62.6-72.5 89.5-140.1 90.3-43.4 .7-69.5-7-75.3 24.2zM357.1 152c-1.8-1.3-2.5-1.8-3 1.3-2 11.4-5.1 22.5-8.8 33.6-39.9 113.8-150.5 103.9-204.5 103.9-6.1 0-10.1 3.3-10.9 9.4-22.6 140.4-27.1 169.7-27.1 169.7-1 7.1 3.5 12.9 10.6 12.9h63.5c8.6 0 15.7-6.3 17.4-14.9 .7-5.4-1.1 6.1 14.4-91.3 4.6-22 14.3-19.7 29.3-19.7 71 0 126.4-28.8 142.9-112.3 6.5-34.8 4.6-71.4-23.8-92.6z"],perbyte:[448,512,[],"e083","M305.3 284.6H246.6V383.3h58.71q24.42 0 38.19-13.77t13.77-36.11q0-21.83-14.03-35.33T305.3 284.6zM149.4 128.7H90.72v98.72h58.71q24.42 0 38.19-13.77t13.77-36.11q0-21.83-14.03-35.34T149.4 128.7zM366.6 32H81.35A81.44 81.44 0 0 0 0 113.4V398.6A81.44 81.44 0 0 0 81.35 480H366.6A81.44 81.44 0 0 0 448 398.6V113.4A81.44 81.44 0 0 0 366.6 32zm63.63 366.6a63.71 63.71 0 0 1 -63.63 63.63H81.35a63.71 63.71 0 0 1 -63.63-63.63V113.4A63.71 63.71 0 0 1 81.35 49.72H366.6a63.71 63.71 0 0 1 63.63 63.63zM305.3 128.7H246.6v98.72h58.71q24.42 0 38.19-13.77t13.77-36.11q0-21.83-14.03-35.34T305.3 128.7z"],periscope:[448,512,[],"f3da","M370 63.6C331.4 22.6 280.5 0 226.6 0 111.9 0 18.5 96.2 18.5 214.4c0 75.1 57.8 159.8 82.7 192.7C137.8 455.5 192.6 512 226.6 512c41.6 0 112.9-94.2 120.9-105 24.6-33.1 82-118.3 82-192.6 0-56.5-21.1-110.1-59.5-150.8zM226.6 493.9c-42.5 0-190-167.3-190-279.4 0-107.4 83.9-196.3 190-196.3 100.8 0 184.7 89 184.7 196.3 .1 112.1-147.4 279.4-184.7 279.4zM338 206.8c0 59.1-51.1 109.7-110.8 109.7-100.6 0-150.7-108.2-92.9-181.8v.4c0 24.5 20.1 44.4 44.8 44.4 24.7 0 44.8-19.9 44.8-44.4 0-18.2-11.1-33.8-26.9-40.7 76.6-19.2 141 39.3 141 112.4z"],phabricator:[496,512,[],"f3db","M323 262.1l-.1-13s21.7-19.8 21.1-21.2l-9.5-20c-.6-1.4-29.5-.5-29.5-.5l-9.4-9.3s.2-28.5-1.2-29.1l-20.1-9.2c-1.4-.6-20.7 21-20.7 21l-13.1-.2s-20.5-21.4-21.9-20.8l-20 8.3c-1.4 .5 .2 28.9 .2 28.9l-9.1 9.1s-29.2-.9-29.7 .4l-8.1 19.8c-.6 1.4 21 21 21 21l.1 12.9s-21.7 19.8-21.1 21.2l9.5 20c.6 1.4 29.5 .5 29.5 .5l9.4 9.3s-.2 31.8 1.2 32.3l20.1 8.3c1.4 .6 20.7-23.5 20.7-23.5l13.1 .2s20.5 23.8 21.8 23.3l20-7.5c1.4-.6-.2-32.1-.2-32.1l9.1-9.1s29.2 .9 29.7-.5l8.1-19.8c.7-1.1-20.9-20.7-20.9-20.7zm-44.9-8.7c.7 17.1-12.8 31.6-30.1 32.4-17.3 .8-32.1-12.5-32.8-29.6-.7-17.1 12.8-31.6 30.1-32.3 17.3-.8 32.1 12.5 32.8 29.5zm201.2-37.9l-97-97-.1 .1c-75.1-73.3-195.4-72.8-269.8 1.6-50.9 51-27.8 27.9-95.7 95.3-22.3 22.3-22.3 58.7 0 81 69.9 69.4 46.4 46 97.4 97l.1-.1c75.1 73.3 195.4 72.9 269.8-1.6 51-50.9 27.9-27.9 95.3-95.3 22.3-22.3 22.3-58.7 0-81zM140.4 363.8c-59.6-59.5-59.6-156 0-215.5 59.5-59.6 156-59.5 215.6 0 59.5 59.5 59.6 156 0 215.6-59.6 59.5-156 59.4-215.6-.1z"],"phoenix-framework":[640,512,[],"f3dc","M212.9 344.3c3.8-.1 22.8-1.4 25.6-2.2-2.4-2.6-43.6-1-68-49.6-4.3-8.6-7.5-17.6-6.4-27.6 2.9-25.5 32.9-30 52-18.5 36 21.6 63.3 91.3 113.7 97.5 37 4.5 84.6-17 108.2-45.4-.6-.1-.8-.2-1-.1-.4 .1-.8 .2-1.1 .3-33.3 12.1-94.3 9.7-134.7-14.8-37.6-22.8-53.1-58.7-51.8-74.6 1.8-21.3 22.9-23.2 35.9-19.6 14.4 3.9 24.4 17.6 38.9 27.4 15.6 10.4 32.9 13.7 51.3 10.3 14.9-2.7 34.4-12.3 36.5-14.5-1.1-.1-1.8-.1-2.5-.2-6.2-.6-12.4-.8-18.5-1.7C279.8 194.5 262.1 47.4 138.5 37.9 94.2 34.5 39.1 46 2.2 72.9c-.8 .6-1.5 1.2-2.2 1.8 .1 .2 .1 .3 .2 .5 .8 0 1.6-.1 2.4-.2 6.3-1 12.5-.8 18.7 .3 23.8 4.3 47.7 23.1 55.9 76.5 5.3 34.3-.7 50.8 8 86.1 19 77.1 91 107.6 127.7 106.4zM75.3 64.9c-.9-1-.9-1.2-1.3-2 12.1-2.6 24.2-4.1 36.6-4.8-1.1 14.7-22.2 21.3-35.3 6.8zm196.9 350.5c-42.8 1.2-92-26.7-123.5-61.4-4.6-5-16.8-20.2-18.6-23.4l.4-.4c6.6 4.1 25.7 18.6 54.8 27 24.2 7 48.1 6.3 71.6-3.3 22.7-9.3 41-.5 43.1 2.9-18.5 3.8-20.1 4.4-24 7.9-5.1 4.4-4.6 11.7 7 17.2 26.2 12.4 63-2.8 97.2 25.4 2.4 2 8.1 7.8 10.1 10.7-.1 .2-.3 .3-.4 .5-4.8-1.5-16.4-7.5-40.2-9.3-24.7-2-46.3 5.3-77.5 6.2zm174.8-252c16.4-5.2 41.3-13.4 66.5-3.3 16.1 6.5 26.2 18.7 32.1 34.6 3.5 9.4 5.1 19.7 5.1 28.7-.2 0-.4 0-.6 .1-.2-.4-.4-.9-.5-1.3-5-22-29.9-43.8-67.6-29.9-50.2 18.6-130.4 9.7-176.9-48-.7-.9-2.4-1.7-1.3-3.2 .1-.2 2.1 .6 3 1.3 18.1 13.4 38.3 21.9 60.3 26.2 30.5 6.1 54.6 2.9 79.9-5.2zm102.7 117.5c-32.4 .2-33.8 50.1-103.6 64.4-18.2 3.7-38.7 4.6-44.9 4.2v-.4c2.8-1.5 14.7-2.6 29.7-16.6 7.9-7.3 15.3-15.1 22.8-22.9 19.5-20.2 41.4-42.2 81.9-39 23.1 1.8 29.3 8.2 36.1 12.7 .3 .2 .4 .5 .7 .9-.5 0-.7 .1-.9 0-7-2.7-14.3-3.3-21.8-3.3zm-12.3-24.1c-.1 .2-.1 .4-.2 .6-28.9-4.4-48-7.9-68.5 4-17 9.9-31.4 20.5-62 24.4-27.1 3.4-45.1 2.4-66.1-8-.3-.2-.6-.4-1-.6 0-.2 .1-.3 .1-.5 24.9 3.8 36.4 5.1 55.5-5.8 22.3-12.9 40.1-26.6 71.3-31 29.6-4.1 51.3 2.5 70.9 16.9zM268.6 97.3c-.6-.6-1.1-1.2-2.1-2.3 7.6 0 29.7-1.2 53.4 8.4 19.7 8 32.2 21 50.2 32.9 11.1 7.3 23.4 9.3 36.4 8.1 4.3-.4 8.5-1.2 12.8-1.7 .4-.1 .9 0 1.5 .3-.6 .4-1.2 .9-1.8 1.2-8.1 4-16.7 6.3-25.6 7.1-26.1 2.6-50.3-3.7-73.4-15.4-19.3-9.9-36.4-22.9-51.4-38.6zM640 335.7c-3.5 3.1-22.7 11.6-42.7 5.3-12.3-3.9-19.5-14.9-31.6-24.1-10-7.6-20.9-7.9-28.1-8.4 .6-.8 .9-1.2 1.2-1.4 14.8-9.2 30.5-12.2 47.3-6.5 12.5 4.2 19.2 13.5 30.4 24.2 10.8 10.4 21 9.9 23.1 10.5 .1-.1 .2 0 .4 .4zm-212.5 137c2.2 1.2 1.6 1.5 1.5 2-18.5-1.4-33.9-7.6-46.8-22.2-21.8-24.7-41.7-27.9-48.6-29.7 .5-.2 .8-.4 1.1-.4 13.1 .1 26.1 .7 38.9 3.9 25.3 6.4 35 25.4 41.6 35.3 3.2 4.8 7.3 8.3 12.3 11.1z"],"phoenix-squadron":[512,512,[],"f511","M96 63.38C142.5 27.25 201.6 7.31 260.5 8.81c29.58-.38 59.11 5.37 86.91 15.33-24.13-4.63-49-6.34-73.38-2.45C231.2 27 191 48.84 162.2 80.87c5.67-1 10.78-3.67 16-5.86 18.14-7.87 37.49-13.26 57.23-14.83 19.74-2.13 39.64-.43 59.28 1.92-14.42 2.79-29.12 4.57-43 9.59-34.43 11.07-65.27 33.16-86.3 62.63-13.8 19.71-23.63 42.86-24.67 67.13-.35 16.49 5.22 34.81 19.83 44a53.27 53.27 0 0 0 37.52 6.74c15.45-2.46 30.07-8.64 43.6-16.33 11.52-6.82 22.67-14.55 32-24.25 3.79-3.22 2.53-8.45 2.62-12.79-2.12-.34-4.38-1.11-6.3 .3a203 203 0 0 1 -35.82 15.37c-20 6.17-42.16 8.46-62.1 .78 12.79 1.73 26.06 .31 37.74-5.44 20.23-9.72 36.81-25.2 54.44-38.77a526.6 526.6 0 0 1 88.9-55.31c25.71-12 52.94-22.78 81.57-24.12-15.63 13.72-32.15 26.52-46.78 41.38-14.51 14-27.46 29.5-40.11 45.18-3.52 4.6-8.95 6.94-13.58 10.16a150.7 150.7 0 0 0 -51.89 60.1c-9.33 19.68-14.5 41.85-11.77 63.65 1.94 13.69 8.71 27.59 20.9 34.91 12.9 8 29.05 8.07 43.48 5.1 32.8-7.45 61.43-28.89 81-55.84 20.44-27.52 30.52-62.2 29.16-96.35-.52-7.5-1.57-15-1.66-22.49 8 19.48 14.82 39.71 16.65 60.83 2 14.28 .75 28.76-1.62 42.9-1.91 11-5.67 21.51-7.78 32.43a165 165 0 0 0 39.34-81.07 183.6 183.6 0 0 0 -14.21-104.6c20.78 32 32.34 69.58 35.71 107.5 .49 12.73 .49 25.51 0 38.23A243.2 243.2 0 0 1 482 371.3c-26.12 47.34-68 85.63-117.2 108-78.29 36.23-174.7 31.32-248-14.68A248.3 248.3 0 0 1 25.36 366 238.3 238.3 0 0 1 0 273.1v-31.34C3.93 172 40.87 105.8 96 63.38m222 80.33a79.13 79.13 0 0 0 16-4.48c5-1.77 9.24-5.94 10.32-11.22-8.96 4.99-17.98 9.92-26.32 15.7z"],php:[640,512,[],"f457","M320 104.5c171.4 0 303.2 72.2 303.2 151.5S491.3 407.5 320 407.5c-171.4 0-303.2-72.2-303.2-151.5S148.7 104.5 320 104.5m0-16.8C143.3 87.7 0 163 0 256s143.3 168.3 320 168.3S640 349 640 256 496.7 87.7 320 87.7zM218.2 242.5c-7.9 40.5-35.8 36.3-70.1 36.3l13.7-70.6c38 0 63.8-4.1 56.4 34.3zM97.4 350.3h36.7l8.7-44.8c41.1 0 66.6 3 90.2-19.1 26.1-24 32.9-66.7 14.3-88.1-9.7-11.2-25.3-16.7-46.5-16.7h-70.7L97.4 350.3zm185.7-213.6h36.5l-8.7 44.8c31.5 0 60.7-2.3 74.8 10.7 14.8 13.6 7.7 31-8.3 113.1h-37c15.4-79.4 18.3-86 12.7-92-5.4-5.8-17.7-4.6-47.4-4.6l-18.8 96.6h-36.5l32.7-168.6zM505 242.5c-8 41.1-36.7 36.3-70.1 36.3l13.7-70.6c38.2 0 63.8-4.1 56.4 34.3zM384.2 350.3H421l8.7-44.8c43.2 0 67.1 2.5 90.2-19.1 26.1-24 32.9-66.7 14.3-88.1-9.7-11.2-25.3-16.7-46.5-16.7H417l-32.8 168.7z"],"pied-piper":[480,512,[],"f2ae","M455.9 23.2C429.2 30 387.8 51.69 341.4 90.66A206 206 0 0 0 240 64C125.1 64 32 157.1 32 272s93.13 208 208 208 208-93.13 208-208a207.3 207.3 0 0 0 -58.75-144.8 155.4 155.4 0 0 0 -17 27.4A176.2 176.2 0 0 1 417.1 272c0 97.66-79.44 177.1-177.1 177.1a175.8 175.8 0 0 1 -87.63-23.4c82.94-107.3 150.8-37.77 184.3-226.6 5.79-32.62 28-94.26 126.2-160.2C471 33.45 465.4 20.8 455.9 23.2zM125 406.4A176.7 176.7 0 0 1 62.9 272C62.9 174.3 142.4 94.9 240 94.9a174 174 0 0 1 76.63 17.75C250.6 174.8 189.8 265.5 125 406.4z"],"pied-piper-alt":[576,512,[],"f1a8","M244 246c-3.2-2-6.3-2.9-10.1-2.9-6.6 0-12.6 3.2-19.3 3.7l1.7 4.9zm135.9 197.9c-19 0-64.1 9.5-79.9 19.8l6.9 45.1c35.7 6.1 70.1 3.6 106-9.8-4.8-10-23.5-55.1-33-55.1zM340.8 177c6.6 2.8 11.5 9.2 22.7 22.1 2-1.4 7.5-5.2 7.5-8.6 0-4.9-11.8-13.2-13.2-23 11.2-5.7 25.2-6 37.6-8.9 68.1-16.4 116.3-52.9 146.8-116.7C548.3 29.3 554 16.1 554.6 2l-2 2.6c-28.4 50-33 63.2-81.3 100-31.9 24.4-69.2 40.2-106.6 54.6l-6.3-.3v-21.8c-19.6 1.6-19.7-14.6-31.6-23-18.7 20.6-31.6 40.8-58.9 51.1-12.7 4.8-19.6 10-25.9 21.8 34.9-16.4 91.2-13.5 98.8-10zM555.5 0l-.6 1.1-.3 .9 .6-.6zm-59.2 382.1c-33.9-56.9-75.3-118.4-150-115.5l-.3-6c-1.1-13.5 32.8 3.2 35.1-31l-14.4 7.2c-19.8-45.7-8.6-54.3-65.5-54.3-14.7 0-26.7 1.7-41.4 4.6 2.9 18.6 2.2 36.7-10.9 50.3l19.5 5.5c-1.7 3.2-2.9 6.3-2.9 9.8 0 21 42.8 2.9 42.8 33.6 0 18.4-36.8 60.1-54.9 60.1-8 0-53.7-50-53.4-60.1l.3-4.6 52.3-11.5c13-2.6 12.3-22.7-2.9-22.7-3.7 0-43.1 9.2-49.4 10.6-2-5.2-7.5-14.1-13.8-14.1-3.2 0-6.3 3.2-9.5 4-9.2 2.6-31 2.9-21.5 20.1L15.9 298.5c-5.5 1.1-8.9 6.3-8.9 11.8 0 6 5.5 10.9 11.5 10.9 8 0 131.3-28.4 147.4-32.2 2.6 3.2 4.6 6.3 7.8 8.6 20.1 14.4 59.8 85.9 76.4 85.9 24.1 0 58-22.4 71.3-41.9 3.2-4.3 6.9-7.5 12.4-6.9 .6 13.8-31.6 34.2-33 43.7-1.4 10.2-1 35.2-.3 41.1 26.7 8.1 52-3.6 77.9-2.9 4.3-21 10.6-41.9 9.8-63.5l-.3-9.5c-1.4-34.2-10.9-38.5-34.8-58.6-1.1-1.1-2.6-2.6-3.7-4 2.2-1.4 1.1-1 4.6-1.7 88.5 0 56.3 183.6 111.5 229.9 33.1-15 72.5-27.9 103.5-47.2-29-25.6-52.6-45.7-72.7-79.9zm-196.2 46.1v27.2l11.8-3.4-2.9-23.8zm-68.7-150.4l24.1 61.2 21-13.8-31.3-50.9zm84.4 154.9l2 12.4c9-1.5 58.4-6.6 58.4-14.1 0-1.4-.6-3.2-.9-4.6-26.8 0-36.9 3.8-59.5 6.3z"],"pied-piper-hat":[640,512,[],"f4e5","M640 24.9c-80.8 53.6-89.4 92.5-96.4 104.4-6.7 12.2-11.7 60.3-23.3 83.6-11.7 23.6-54.2 42.2-66.1 50-11.7 7.8-28.3 38.1-41.9 64.2-108.1-4.4-167.4 38.8-259.2 93.6 29.4-9.7 43.3-16.7 43.3-16.7 94.2-36 139.3-68.3 281.1-49.2 1.1 0 1.9 .6 2.8 .8 3.9 2.2 5.3 6.9 3.1 10.8l-53.9 95.8c-2.5 4.7-7.8 7.2-13.1 6.1-126.8-23.8-226.9 17.3-318.9 18.6C24.1 488 0 453.4 0 451.8c0-1.1 .6-1.7 1.7-1.7 0 0 38.3 0 103.1-15.3C178.4 294.5 244 245.4 315.4 245.4c0 0 71.7 0 90.6 61.9 22.8-39.7 28.3-49.2 28.3-49.2 5.3-9.4 35-77.2 86.4-141.4 51.5-64 90.4-79.9 119.3-91.8z"],"pied-piper-pp":[448,512,[],"f1a7","M205.3 174.6c0 21.1-14.2 38.1-31.7 38.1-7.1 0-12.8-1.2-17.2-3.7v-68c4.4-2.7 10.1-4.2 17.2-4.2 17.5 0 31.7 16.9 31.7 37.8zm52.6 67c-7.1 0-12.8 1.5-17.2 4.2v68c4.4 2.5 10.1 3.7 17.2 3.7 17.4 0 31.7-16.9 31.7-37.8 0-21.1-14.3-38.1-31.7-38.1zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zM185 255.1c41 0 74.2-35.6 74.2-79.6 0-44-33.2-79.6-74.2-79.6-12 0-24.1 3.2-34.6 8.8h-45.7V311l51.8-10.1v-50.6c8.6 3.1 18.1 4.8 28.5 4.8zm158.4 25.3c0-44-33.2-79.6-73.9-79.6-3.2 0-6.4 .2-9.6 .7-3.7 12.5-10.1 23.8-19.2 33.4-13.8 15-32.2 23.8-51.8 24.8V416l51.8-10.1v-50.6c8.6 3.2 18.2 4.7 28.7 4.7 40.8 0 74-35.6 74-79.6z"],pinterest:[496,512,[],"f0d2","M496 256c0 137-111 248-248 248-25.6 0-50.2-3.9-73.4-11.1 10.1-16.5 25.2-43.5 30.8-65 3-11.6 15.4-59 15.4-59 8.1 15.4 31.7 28.5 56.8 28.5 74.8 0 128.7-68.8 128.7-154.3 0-81.9-66.9-143.2-152.9-143.2-107 0-163.9 71.8-163.9 150.1 0 36.4 19.4 81.7 50.3 96.1 4.7 2.2 7.2 1.2 8.3-3.3 .8-3.4 5-20.3 6.9-28.1 .6-2.5 .3-4.7-1.7-7.1-10.1-12.5-18.3-35.3-18.3-56.6 0-54.7 41.4-107.6 112-107.6 60.9 0 103.6 41.5 103.6 100.9 0 67.1-33.9 113.6-78 113.6-24.3 0-42.6-20.1-36.7-44.8 7-29.5 20.5-61.3 20.5-82.6 0-19-10.2-34.9-31.4-34.9-24.9 0-44.9 25.7-44.9 60.2 0 22 7.4 36.8 7.4 36.8s-24.5 103.8-29 123.2c-5 21.4-3 51.6-.9 71.2C65.4 450.9 0 361.1 0 256 0 119 111 8 248 8s248 111 248 248z"],"pinterest-p":[384,512,[],"f231","M204 6.5C101.4 6.5 0 74.9 0 185.6 0 256 39.6 296 63.6 296c9.9 0 15.6-27.6 15.6-35.4 0-9.3-23.7-29.1-23.7-67.8 0-80.4 61.2-137.4 140.4-137.4 68.1 0 118.5 38.7 118.5 109.8 0 53.1-21.3 152.7-90.3 152.7-24.9 0-46.2-18-46.2-43.8 0-37.8 26.4-74.4 26.4-113.4 0-66.2-93.9-54.2-93.9 25.8 0 16.8 2.1 35.4 9.6 50.7-13.8 59.4-42 147.9-42 209.1 0 18.9 2.7 37.5 4.5 56.4 3.4 3.8 1.7 3.4 6.9 1.5 50.4-69 48.6-82.5 71.4-172.8 12.3 23.4 44.1 36 69.3 36 106.2 0 153.9-103.5 153.9-196.8C384 71.3 298.2 6.5 204 6.5z"],pix:[512,512,[],"e43a","M242.4 292.5C247.8 287.1 257.1 287.1 262.5 292.5L339.5 369.5C353.7 383.7 372.6 391.5 392.6 391.5H407.7L310.6 488.6C280.3 518.1 231.1 518.1 200.8 488.6L103.3 391.2H112.6C132.6 391.2 151.5 383.4 165.7 369.2L242.4 292.5zM262.5 218.9C256.1 224.4 247.9 224.5 242.4 218.9L165.7 142.2C151.5 127.1 132.6 120.2 112.6 120.2H103.3L200.7 22.76C231.1-7.586 280.3-7.586 310.6 22.76L407.8 119.9H392.6C372.6 119.9 353.7 127.7 339.5 141.9L262.5 218.9zM112.6 142.7C126.4 142.7 139.1 148.3 149.7 158.1L226.4 234.8C233.6 241.1 243 245.6 252.5 245.6C261.9 245.6 271.3 241.1 278.5 234.8L355.5 157.8C365.3 148.1 378.8 142.5 392.6 142.5H430.3L488.6 200.8C518.9 231.1 518.9 280.3 488.6 310.6L430.3 368.9H392.6C378.8 368.9 365.3 363.3 355.5 353.5L278.5 276.5C264.6 262.6 240.3 262.6 226.4 276.6L149.7 353.2C139.1 363 126.4 368.6 112.6 368.6H80.78L22.76 310.6C-7.586 280.3-7.586 231.1 22.76 200.8L80.78 142.7H112.6z"],playstation:[576,512,[],"f3df","M570.9 372.3c-11.3 14.2-38.8 24.3-38.8 24.3L327 470.2v-54.3l150.9-53.8c17.1-6.1 19.8-14.8 5.8-19.4-13.9-4.6-39.1-3.3-56.2 2.9L327 381.1v-56.4c23.2-7.8 47.1-13.6 75.7-16.8 40.9-4.5 90.9 .6 130.2 15.5 44.2 14 49.2 34.7 38 48.9zm-224.4-92.5v-139c0-16.3-3-31.3-18.3-35.6-11.7-3.8-19 7.1-19 23.4v347.9l-93.8-29.8V32c39.9 7.4 98 24.9 129.2 35.4C424.1 94.7 451 128.7 451 205.2c0 74.5-46 102.8-104.5 74.6zM43.2 410.2c-45.4-12.8-53-39.5-32.3-54.8 19.1-14.2 51.7-24.9 51.7-24.9l134.5-47.8v54.5l-96.8 34.6c-17.1 6.1-19.7 14.8-5.8 19.4 13.9 4.6 39.1 3.3 56.2-2.9l46.4-16.9v48.8c-51.6 9.3-101.4 7.3-153.9-10z"],"product-hunt":[512,512,[],"f288","M326.3 218.8c0 20.5-16.7 37.2-37.2 37.2h-70.3v-74.4h70.3c20.5 0 37.2 16.7 37.2 37.2zM504 256c0 137-111 248-248 248S8 393 8 256 119 8 256 8s248 111 248 248zm-128.1-37.2c0-47.9-38.9-86.8-86.8-86.8H169.2v248h49.6v-74.4h70.3c47.9 0 86.8-38.9 86.8-86.8z"],pushed:[432,512,[],"f3e1","M407 111.9l-98.5-9 14-33.4c10.4-23.5-10.8-40.4-28.7-37L22.5 76.9c-15.1 2.7-26 18.3-21.4 36.6l105.1 348.3c6.5 21.3 36.7 24.2 47.7 7l35.3-80.8 235.2-231.3c16.4-16.8 4.3-42.9-17.4-44.8zM297.6 53.6c5.1-.7 7.5 2.5 5.2 7.4L286 100.9 108.6 84.6l189-31zM22.7 107.9c-3.1-5.1 1-10 6.1-9.1l248.7 22.7-96.9 230.7L22.7 107.9zM136 456.4c-2.6 4-7.9 3.1-9.4-1.2L43.5 179.7l127.7 197.6c-7 15-35.2 79.1-35.2 79.1zm272.8-314.5L210.1 337.3l89.7-213.7 106.4 9.7c4 1.1 5.7 5.3 2.6 8.6z"],python:[448,512,[],"f3e2","M439.8 200.5c-7.7-30.9-22.3-54.2-53.4-54.2h-40.1v47.4c0 36.8-31.2 67.8-66.8 67.8H172.7c-29.2 0-53.4 25-53.4 54.3v101.8c0 29 25.2 46 53.4 54.3 33.8 9.9 66.3 11.7 106.8 0 26.9-7.8 53.4-23.5 53.4-54.3v-40.7H226.2v-13.6h160.2c31.1 0 42.6-21.7 53.4-54.2 11.2-33.5 10.7-65.7 0-108.6zM286.2 404c11.1 0 20.1 9.1 20.1 20.3 0 11.3-9 20.4-20.1 20.4-11 0-20.1-9.2-20.1-20.4 .1-11.3 9.1-20.3 20.1-20.3zM167.8 248.1h106.8c29.7 0 53.4-24.5 53.4-54.3V91.9c0-29-24.4-50.7-53.4-55.6-35.8-5.9-74.7-5.6-106.8 .1-45.2 8-53.4 24.7-53.4 55.6v40.7h106.9v13.6h-147c-31.1 0-58.3 18.7-66.8 54.2-9.8 40.7-10.2 66.1 0 108.6 7.6 31.6 25.7 54.2 56.8 54.2H101v-48.8c0-35.3 30.5-66.4 66.8-66.4zm-6.7-142.6c-11.1 0-20.1-9.1-20.1-20.3 .1-11.3 9-20.4 20.1-20.4 11 0 20.1 9.2 20.1 20.4s-9 20.3-20.1 20.3z"],qq:[448,512,[],"f1d6","M433.8 420.4c-11.53 1.393-44.86-52.74-44.86-52.74 0 31.34-16.14 72.25-51.05 101.8 16.84 5.192 54.84 19.17 45.8 34.42-7.316 12.34-125.5 7.881-159.6 4.037-34.12 3.844-152.3 8.306-159.6-4.037-9.045-15.25 28.92-29.21 45.78-34.42-34.92-29.54-51.06-70.44-51.06-101.8 0 0-33.33 54.13-44.86 52.74-5.37-.65-12.42-29.64 9.347-99.7 10.26-33.02 21.1-60.48 40.14-105.8C60.68 98.06 108.1 .006 224 0c113.7 .006 163.2 96.13 160.3 214.1 18.12 45.22 29.91 72.85 40.14 105.8 21.77 70.06 14.72 99.05 9.346 99.7z"],quinscape:[512,512,[],"f459","M313.6 474.6h-1a158.1 158.1 0 0 1 0-316.2c94.9 0 168.2 83.1 157 176.6 4 5.1 8.2 9.6 11.2 15.3 13.4-30.3 20.3-62.4 20.3-97.7C501.1 117.5 391.6 8 256.5 8S12 117.5 12 252.6s109.5 244.6 244.5 244.6a237.4 237.4 0 0 0 70.4-10.1c-5.2-3.5-8.9-8.1-13.3-12.5zm-.1-.1l.4 .1zm78.4-168.9a99.2 99.2 0 1 0 99.2 99.2 99.18 99.18 0 0 0 -99.2-99.2z"],quora:[448,512,[],"f2c4","M440.5 386.7h-29.3c-1.5 13.5-10.5 30.8-33 30.8-20.5 0-35.3-14.2-49.5-35.8 44.2-34.2 74.7-87.5 74.7-153C403.5 111.2 306.8 32 205 32 105.3 32 7.3 111.7 7.3 228.7c0 134.1 131.3 221.6 249 189C276 451.3 302 480 351.5 480c81.8 0 90.8-75.3 89-93.3zM297 329.2C277.5 300 253.3 277 205.5 277c-30.5 0-54.3 10-69 22.8l12.2 24.3c6.2-3 13-4 19.8-4 35.5 0 53.7 30.8 69.2 61.3-10 3-20.7 4.2-32.7 4.2-75 0-107.5-53-107.5-156.7C97.5 124.5 130 71 205 71c76.2 0 108.7 53.5 108.7 157.7 .1 41.8-5.4 75.6-16.7 100.5z"],"r-project":[581,512,[],"f4f7","M581 226.6C581 119.1 450.9 32 290.5 32S0 119.1 0 226.6C0 322.4 103.3 402 239.4 418.1V480h99.1v-61.5c24.3-2.7 47.6-7.4 69.4-13.9L448 480h112l-67.4-113.7c54.5-35.4 88.4-84.9 88.4-139.7zm-466.8 14.5c0-73.5 98.9-133 220.8-133s211.9 40.7 211.9 133c0 50.1-26.5 85-70.3 106.4-2.4-1.6-4.7-2.9-6.4-3.7-10.2-5.2-27.8-10.5-27.8-10.5s86.6-6.4 86.6-92.7-90.6-87.9-90.6-87.9h-199V361c-74.1-21.5-125.2-67.1-125.2-119.9zm225.1 38.3v-55.6c57.8 0 87.8-6.8 87.8 27.3 0 36.5-38.2 28.3-87.8 28.3zm-.9 72.5H365c10.8 0 18.9 11.7 24 19.2-16.1 1.9-33 2.8-50.6 2.9v-22.1z"],"raspberry-pi":[407,512,[],"f7bb","M372 232.5l-3.7-6.5c.1-46.4-21.4-65.3-46.5-79.7 7.6-2 15.4-3.6 17.6-13.2 13.1-3.3 15.8-9.4 17.1-15.8 3.4-2.3 14.8-8.7 13.6-19.7 6.4-4.4 10-10.1 8.1-18.1 6.9-7.5 8.7-13.7 5.8-19.4 8.3-10.3 4.6-15.6 1.1-20.9 6.2-11.2 .7-23.2-16.6-21.2-6.9-10.1-21.9-7.8-24.2-7.8-2.6-3.2-6-6-16.5-4.7-6.8-6.1-14.4-5-22.3-2.1-9.3-7.3-15.5-1.4-22.6 .8C271.6 .6 269 5.5 263.5 7.6c-12.3-2.6-16.1 3-22 8.9l-6.9-.1c-18.6 10.8-27.8 32.8-31.1 44.1-3.3-11.3-12.5-33.3-31.1-44.1l-6.9 .1c-5.9-5.9-9.7-11.5-22-8.9-5.6-2-8.1-7-19.4-3.4-4.6-1.4-8.9-4.4-13.9-4.3-2.6 .1-5.5 1-8.7 3.5-7.9-3-15.5-4-22.3 2.1-10.5-1.3-14 1.4-16.5 4.7-2.3 0-17.3-2.3-24.2 7.8C21.2 16 15.8 28 22 39.2c-3.5 5.4-7.2 10.7 1.1 20.9-2.9 5.7-1.1 11.9 5.8 19.4-1.8 8 1.8 13.7 8.1 18.1-1.2 11 10.2 17.4 13.6 19.7 1.3 6.4 4 12.4 17.1 15.8 2.2 9.5 10 11.2 17.6 13.2-25.1 14.4-46.6 33.3-46.5 79.7l-3.7 6.5c-28.8 17.2-54.7 72.7-14.2 117.7 2.6 14.1 7.1 24.2 11 35.4 5.9 45.2 44.5 66.3 54.6 68.8 14.9 11.2 30.8 21.8 52.2 29.2C159 504.2 181 512 203 512h1c22.1 0 44-7.8 64.2-28.4 21.5-7.4 37.3-18 52.2-29.2 10.2-2.5 48.7-23.6 54.6-68.8 3.9-11.2 8.4-21.3 11-35.4 40.6-45.1 14.7-100.5-14-117.7zm-22.2-8c-1.5 18.7-98.9-65.1-82.1-67.9 45.7-7.5 83.6 19.2 82.1 67.9zm-43 93.1c-24.5 15.8-59.8 5.6-78.8-22.8s-14.6-64.2 9.9-80c24.5-15.8 59.8-5.6 78.8 22.8s14.6 64.2-9.9 80zM238.9 29.3c.8 4.2 1.8 6.8 2.9 7.6 5.4-5.8 9.8-11.7 16.8-17.3 0 3.3-1.7 6.8 2.5 9.4 3.7-5 8.8-9.5 15.5-13.3-3.2 5.6-.6 7.3 1.2 9.6 5.1-4.4 10-8.8 19.4-12.3-2.6 3.1-6.2 6.2-2.4 9.8 5.3-3.3 10.6-6.6 23.1-8.9-2.8 3.1-8.7 6.3-5.1 9.4 6.6-2.5 14-4.4 22.1-5.4-3.9 3.2-7.1 6.3-3.9 8.8 7.1-2.2 16.9-5.1 26.4-2.6l-6 6.1c-.7 .8 14.1 .6 23.9 .8-3.6 5-7.2 9.7-9.3 18.2 1 1 5.8 .4 10.4 0-4.7 9.9-12.8 12.3-14.7 16.6 2.9 2.2 6.8 1.6 11.2 .1-3.4 6.9-10.4 11.7-16 17.3 1.4 1 3.9 1.6 9.7 .9-5.2 5.5-11.4 10.5-18.8 15 1.3 1.5 5.8 1.5 10 1.6-6.7 6.5-15.3 9.9-23.4 14.2 4 2.7 6.9 2.1 10 2.1-5.7 4.7-15.4 7.1-24.4 10 1.7 2.7 3.4 3.4 7.1 4.1-9.5 5.3-23.2 2.9-27 5.6 .9 2.7 3.6 4.4 6.7 5.8-15.4 .9-57.3-.6-65.4-32.3 15.7-17.3 44.4-37.5 93.7-62.6-38.4 12.8-73 30-102 53.5-34.3-15.9-10.8-55.9 5.8-71.8zm-34.4 114.6c24.2-.3 54.1 17.8 54 34.7-.1 15-21 27.1-53.8 26.9-32.1-.4-53.7-15.2-53.6-29.8 0-11.9 26.2-32.5 53.4-31.8zm-123-12.8c3.7-.7 5.4-1.5 7.1-4.1-9-2.8-18.7-5.3-24.4-10 3.1 0 6 .7 10-2.1-8.1-4.3-16.7-7.7-23.4-14.2 4.2-.1 8.7 0 10-1.6-7.4-4.5-13.6-9.5-18.8-15 5.8 .7 8.3 .1 9.7-.9-5.6-5.6-12.7-10.4-16-17.3 4.3 1.5 8.3 2 11.2-.1-1.9-4.2-10-6.7-14.7-16.6 4.6 .4 9.4 1 10.4 0-2.1-8.5-5.8-13.3-9.3-18.2 9.8-.1 24.6 0 23.9-.8l-6-6.1c9.5-2.5 19.3 .4 26.4 2.6 3.2-2.5-.1-5.6-3.9-8.8 8.1 1.1 15.4 2.9 22.1 5.4 3.5-3.1-2.3-6.3-5.1-9.4 12.5 2.3 17.8 5.6 23.1 8.9 3.8-3.6 .2-6.7-2.4-9.8 9.4 3.4 14.3 7.9 19.4 12.3 1.7-2.3 4.4-4 1.2-9.6 6.7 3.8 11.8 8.3 15.5 13.3 4.1-2.6 2.5-6.2 2.5-9.4 7 5.6 11.4 11.5 16.8 17.3 1.1-.8 2-3.4 2.9-7.6 16.6 15.9 40.1 55.9 6 71.8-29-23.5-63.6-40.7-102-53.5 49.3 25 78 45.3 93.7 62.6-8 31.8-50 33.2-65.4 32.3 3.1-1.4 5.8-3.2 6.7-5.8-4-2.8-17.6-.4-27.2-5.6zm60.1 24.1c16.8 2.8-80.6 86.5-82.1 67.9-1.5-48.7 36.5-75.5 82.1-67.9zM38.2 342c-23.7-18.8-31.3-73.7 12.6-98.3 26.5-7 9 107.8-12.6 98.3zm91 98.2c-13.3 7.9-45.8 4.7-68.8-27.9-15.5-27.4-13.5-55.2-2.6-63.4 16.3-9.8 41.5 3.4 60.9 25.6 16.9 20 24.6 55.3 10.5 65.7zm-26.4-119.7c-24.5-15.8-28.9-51.6-9.9-80s54.3-38.6 78.8-22.8 28.9 51.6 9.9 80c-19.1 28.4-54.4 38.6-78.8 22.8zM205 496c-29.4 1.2-58.2-23.7-57.8-32.3-.4-12.7 35.8-22.6 59.3-22 23.7-1 55.6 7.5 55.7 18.9 .5 11-28.8 35.9-57.2 35.4zm58.9-124.9c.2 29.7-26.2 53.8-58.8 54-32.6 .2-59.2-23.8-59.4-53.4v-.6c-.2-29.7 26.2-53.8 58.8-54 32.6-.2 59.2 23.8 59.4 53.4v.6zm82.2 42.7c-25.3 34.6-59.6 35.9-72.3 26.3-13.3-12.4-3.2-50.9 15.1-72 20.9-23.3 43.3-38.5 58.9-26.6 10.5 10.3 16.7 49.1-1.7 72.3zm22.9-73.2c-21.5 9.4-39-105.3-12.6-98.3 43.9 24.7 36.3 79.6 12.6 98.3z"],ravelry:[512,512,[],"f2d9","M498.3 234.2c-1.208-10.34-1.7-20.83-3.746-31a310.3 310.3 0 0 0 -9.622-36.6 184.1 184.1 0 0 0 -30.87-57.5 251.2 251.2 0 0 0 -18.82-21.69 237.4 237.4 0 0 0 -47.11-36.12A240.8 240.8 0 0 0 331.4 26.65c-11.02-3.1-22.27-5.431-33.51-7.615-6.78-1.314-13.75-1.667-20.63-2.482-.316-.036-.6-.358-.9-.553q-16.14 .009-32.29 .006c-2.41 .389-4.808 .925-7.236 1.15a179.3 179.3 0 0 0 -34.26 7.1 221.5 221.5 0 0 0 -39.77 16.35 281.4 281.4 0 0 0 -38.08 24.16c-6.167 4.61-12.27 9.36-17.97 14.52C96.54 88.49 86.34 97.72 76.79 107.6a243.9 243.9 0 0 0 -33.65 43.95 206.5 206.5 0 0 0 -20.49 44.6 198.2 198.2 0 0 0 -7.691 34.76A201.1 201.1 0 0 0 13.4 266.4a299.7 299.7 0 0 0 4.425 40.24 226.9 226.9 0 0 0 16.73 53.3 210.5 210.5 0 0 0 24 39.53 213.6 213.6 0 0 0 26.36 28.42A251.3 251.3 0 0 0 126.7 458.5a287.8 287.8 0 0 0 55.9 25.28 269.5 269.5 0 0 0 40.64 9.835c6.071 1.01 12.27 1.253 18.41 1.873a4.149 4.149 0 0 1 1.19 .56h32.29c2.507-.389 5-.937 7.527-1.143 16.34-1.332 32.11-5.335 47.49-10.72A219.1 219.1 0 0 0 379.1 460.3c9.749-6.447 19.4-13.08 28.74-20.1 5.785-4.348 10.99-9.5 16.3-14.46 3.964-3.7 7.764-7.578 11.51-11.5a232.2 232.2 0 0 0 31.43-41.64c9.542-16.05 17.35-32.9 22.3-50.93 2.859-10.41 4.947-21.05 7.017-31.65 1.032-5.279 1.251-10.72 1.87-16.09 .036-.317 .358-.6 .552-.9V236A9.757 9.757 0 0 1 498.3 234.2zm-161.1-1.15s-16.57-2.98-28.47-2.98c-27.2 0-33.57 14.9-33.57 37.04V360.8H201.6V170.1H275.1v31.93c8.924-26.82 26.77-36.19 62.04-36.19z"],react:[512,512,[],"f41b","M418.2 177.2c-5.4-1.8-10.8-3.5-16.2-5.1 .9-3.7 1.7-7.4 2.5-11.1 12.3-59.6 4.2-107.5-23.1-123.3-26.3-15.1-69.2 .6-112.6 38.4-4.3 3.7-8.5 7.6-12.5 11.5-2.7-2.6-5.5-5.2-8.3-7.7-45.5-40.4-91.1-57.4-118.4-41.5-26.2 15.2-34 60.3-23 116.7 1.1 5.6 2.3 11.1 3.7 16.7-6.4 1.8-12.7 3.8-18.6 5.9C38.3 196.2 0 225.4 0 255.6c0 31.2 40.8 62.5 96.3 81.5 4.5 1.5 9 3 13.6 4.3-1.5 6-2.8 11.9-4 18-10.5 55.5-2.3 99.5 23.9 114.6 27 15.6 72.4-.4 116.6-39.1 3.5-3.1 7-6.3 10.5-9.7 4.4 4.3 9 8.4 13.6 12.4 42.8 36.8 85.1 51.7 111.2 36.6 27-15.6 35.8-62.9 24.4-120.5-.9-4.4-1.9-8.9-3-13.5 3.2-.9 6.3-1.9 9.4-2.9 57.7-19.1 99.5-50 99.5-81.7 0-30.3-39.4-59.7-93.8-78.4zM282.9 92.3c37.2-32.4 71.9-45.1 87.7-36 16.9 9.7 23.4 48.9 12.8 100.4-.7 3.4-1.4 6.7-2.3 10-22.2-5-44.7-8.6-67.3-10.6-13-18.6-27.2-36.4-42.6-53.1 3.9-3.7 7.7-7.2 11.7-10.7zM167.2 307.5c5.1 8.7 10.3 17.4 15.8 25.9-15.6-1.7-31.1-4.2-46.4-7.5 4.4-14.4 9.9-29.3 16.3-44.5 4.6 8.8 9.3 17.5 14.3 26.1zm-30.3-120.3c14.4-3.2 29.7-5.8 45.6-7.8-5.3 8.3-10.5 16.8-15.4 25.4-4.9 8.5-9.7 17.2-14.2 26-6.3-14.9-11.6-29.5-16-43.6zm27.4 68.9c6.6-13.8 13.8-27.3 21.4-40.6s15.8-26.2 24.4-38.9c15-1.1 30.3-1.7 45.9-1.7s31 .6 45.9 1.7c8.5 12.6 16.6 25.5 24.3 38.7s14.9 26.7 21.7 40.4c-6.7 13.8-13.9 27.4-21.6 40.8-7.6 13.3-15.7 26.2-24.2 39-14.9 1.1-30.4 1.6-46.1 1.6s-30.9-.5-45.6-1.4c-8.7-12.7-16.9-25.7-24.6-39s-14.8-26.8-21.5-40.6zm180.6 51.2c5.1-8.8 9.9-17.7 14.6-26.7 6.4 14.5 12 29.2 16.9 44.3-15.5 3.5-31.2 6.2-47 8 5.4-8.4 10.5-17 15.5-25.6zm14.4-76.5c-4.7-8.8-9.5-17.6-14.5-26.2-4.9-8.5-10-16.9-15.3-25.2 16.1 2 31.5 4.7 45.9 8-4.6 14.8-10 29.2-16.1 43.4zM256.2 118.3c10.5 11.4 20.4 23.4 29.6 35.8-19.8-.9-39.7-.9-59.5 0 9.8-12.9 19.9-24.9 29.9-35.8zM140.2 57c16.8-9.8 54.1 4.2 93.4 39 2.5 2.2 5 4.6 7.6 7-15.5 16.7-29.8 34.5-42.9 53.1-22.6 2-45 5.5-67.2 10.4-1.3-5.1-2.4-10.3-3.5-15.5-9.4-48.4-3.2-84.9 12.6-94zm-24.5 263.6c-4.2-1.2-8.3-2.5-12.4-3.9-21.3-6.7-45.5-17.3-63-31.2-10.1-7-16.9-17.8-18.8-29.9 0-18.3 31.6-41.7 77.2-57.6 5.7-2 11.5-3.8 17.3-5.5 6.8 21.7 15 43 24.5 63.6-9.6 20.9-17.9 42.5-24.8 64.5zm116.6 98c-16.5 15.1-35.6 27.1-56.4 35.3-11.1 5.3-23.9 5.8-35.3 1.3-15.9-9.2-22.5-44.5-13.5-92 1.1-5.6 2.3-11.2 3.7-16.7 22.4 4.8 45 8.1 67.9 9.8 13.2 18.7 27.7 36.6 43.2 53.4-3.2 3.1-6.4 6.1-9.6 8.9zm24.5-24.3c-10.2-11-20.4-23.2-30.3-36.3 9.6 .4 19.5 .6 29.5 .6 10.3 0 20.4-.2 30.4-.7-9.2 12.7-19.1 24.8-29.6 36.4zm130.7 30c-.9 12.2-6.9 23.6-16.5 31.3-15.9 9.2-49.8-2.8-86.4-34.2-4.2-3.6-8.4-7.5-12.7-11.5 15.3-16.9 29.4-34.8 42.2-53.6 22.9-1.9 45.7-5.4 68.2-10.5 1 4.1 1.9 8.2 2.7 12.2 4.9 21.6 5.7 44.1 2.5 66.3zm18.2-107.5c-2.8 .9-5.6 1.8-8.5 2.6-7-21.8-15.6-43.1-25.5-63.8 9.6-20.4 17.7-41.4 24.5-62.9 5.2 1.5 10.2 3.1 15 4.7 46.6 16 79.3 39.8 79.3 58 0 19.6-34.9 44.9-84.8 61.4zm-149.7-15c25.3 0 45.8-20.5 45.8-45.8s-20.5-45.8-45.8-45.8c-25.3 0-45.8 20.5-45.8 45.8s20.5 45.8 45.8 45.8z"],reacteurope:[576,512,[],"f75d","M250.6 211.7l5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3-7.1-.1-2.3-6.8-2.3 6.8-7.2 .1 5.7 4.3zm63.7 0l5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3-7.2-.1-2.3-6.8-2.3 6.8-7.2 .1 5.7 4.3zm-91.3 50.5h-3.4c-4.8 0-3.8 4-3.8 12.1 0 4.7-2.3 6.1-5.8 6.1s-5.8-1.4-5.8-6.1v-36.6c0-4.7 2.3-6.1 5.8-6.1s5.8 1.4 5.8 6.1c0 7.2-.7 10.5 3.8 10.5h3.4c4.7-.1 3.8-3.9 3.8-12.3 0-9.9-6.7-14.1-16.8-14.1h-.2c-10.1 0-16.8 4.2-16.8 14.1V276c0 10.4 6.7 14.1 16.8 14.1h.2c10.1 0 16.8-3.8 16.8-14.1 0-9.86 1.1-13.76-3.8-13.76zm-80.7 17.4h-14.7v-19.3H139c2.5 0 3.8-1.3 3.8-3.8v-2.1c0-2.5-1.3-3.8-3.8-3.8h-11.4v-18.3H142c2.5 0 3.8-1.3 3.8-3.8v-2.1c0-2.5-1.3-3.8-3.8-3.8h-21.7c-2.4-.1-3.7 1.3-3.7 3.8v59.1c0 2.5 1.3 3.8 3.8 3.8h21.9c2.5 0 3.8-1.3 3.8-3.8v-2.1c0-2.5-1.3-3.8-3.8-3.8zm-42-18.5c4.6-2 7.3-6 7.3-12.4v-11.9c0-10.1-6.7-14.1-16.8-14.1H77.4c-2.5 0-3.8 1.3-3.8 3.8v59.1c0 2.5 1.3 3.8 3.8 3.8h3.4c2.5 0 3.8-1.3 3.8-3.8v-22.9h5.6l7.4 23.5a4.1 4.1 0 0 0 4.3 3.2h3.3c2.8 0 4-1.8 3.2-4.4zm-3.8-14c0 4.8-2.5 6.1-6.1 6.1h-5.8v-20.9h5.8c3.6 0 6.1 1.3 6.1 6.1zM176 226a3.82 3.82 0 0 0 -4.2-3.4h-6.9a3.68 3.68 0 0 0 -4 3.4l-11 59.2c-.5 2.7 .9 4.1 3.4 4.1h3a3.74 3.74 0 0 0 4.1-3.5l1.8-11.3h12.2l1.8 11.3a3.74 3.74 0 0 0 4.1 3.5h3.5c2.6 0 3.9-1.4 3.4-4.1zm-12.3 39.3l4.7-29.7 4.7 29.7zm89.3 20.2v-53.2h7.5c2.5 0 3.8-1.3 3.8-3.8v-2.1c0-2.5-1.3-3.8-3.8-3.8h-25.8c-2.5 0-3.8 1.3-3.8 3.8v2.1c0 2.5 1.3 3.8 3.8 3.8h7.3v53.2c0 2.5 1.3 3.8 3.8 3.8h3.4c2.5 .04 3.8-1.3 3.8-3.76zm248-.8h-19.4V258h16.1a1.89 1.89 0 0 0 2-2v-.8a1.89 1.89 0 0 0 -2-2h-16.1v-25.8h19.1a1.89 1.89 0 0 0 2-2v-.8a1.77 1.77 0 0 0 -2-1.9h-22.2a1.62 1.62 0 0 0 -2 1.8v63a1.81 1.81 0 0 0 2 1.9H501a1.81 1.81 0 0 0 2-1.9v-.8a1.84 1.84 0 0 0 -2-1.96zm-93.1-62.9h-.8c-10.1 0-15.3 4.7-15.3 14.1V276c0 9.3 5.2 14.1 15.3 14.1h.8c10.1 0 15.3-4.8 15.3-14.1v-40.1c0-9.36-5.2-14.06-15.3-14.06zm10.2 52.4c-.1 8-3 11.1-10.5 11.1s-10.5-3.1-10.5-11.1v-36.6c0-7.9 3-11.1 10.5-11.1s10.5 3.2 10.5 11.1zm-46.5-14.5c6.1-1.6 9.2-6.1 9.2-13.3v-9.7c0-9.4-5.2-14.1-15.3-14.1h-13.7a1.81 1.81 0 0 0 -2 1.9v63a1.81 1.81 0 0 0 2 1.9h1.2a1.74 1.74 0 0 0 1.9-1.9v-26.9h11.6l10.4 27.2a2.32 2.32 0 0 0 2.3 1.5h1.5c1.4 0 2-1 1.5-2.3zm-6.4-3.9H355v-28.5h10.2c7.5 0 10.5 3.1 10.5 11.1v6.4c0 7.84-3 11.04-10.5 11.04zm85.9-33.1h-13.7a1.62 1.62 0 0 0 -2 1.8v63a1.81 1.81 0 0 0 2 1.9h1.2a1.74 1.74 0 0 0 1.9-1.9v-26.1h10.6c10.1 0 15.3-4.8 15.3-14.1v-10.5c0-9.4-5.2-14.1-15.3-14.1zm10.2 22.8c0 7.9-3 11.1-10.5 11.1h-10.2v-29.2h10.2c7.5-.1 10.5 3.1 10.5 11zM259.5 308l-2.3-6.8-2.3 6.8-7.1 .1 5.7 4.3-2.1 6.8 5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3zm227.6-136.1a364.4 364.4 0 0 0 -35.6-11.3c19.6-78 11.6-134.7-22.3-153.9C394.7-12.66 343.3 11 291 61.94q5.1 4.95 10.2 10.2c82.5-80 119.6-53.5 120.9-52.8 22.4 12.7 36 55.8 15.5 137.8a587.8 587.8 0 0 0 -84.6-13C281.1 43.64 212.4 2 170.8 2 140 2 127 23 123.2 29.74c-18.1 32-13.3 84.2 .1 133.8-70.5 20.3-120.7 54.1-120.3 95 .5 59.6 103.2 87.8 122.1 92.8-20.5 81.9-10.1 135.6 22.3 153.9 28 15.8 75.1 6 138.2-55.2q-5.1-4.95-10.2-10.2c-82.5 80-119.7 53.5-120.9 52.8-22.3-12.6-36-55.6-15.5-137.9 12.4 2.9 41.8 9.5 84.6 13 71.9 100.4 140.6 142 182.1 142 30.8 0 43.8-21 47.6-27.7 18-31.9 13.3-84.1-.1-133.8 152.3-43.8 156.2-130.2 33.9-176.3zM135.9 36.84c2.9-5.1 11.9-20.3 34.9-20.3 36.8 0 98.8 39.6 163.3 126.2a714 714 0 0 0 -93.9 .9 547.8 547.8 0 0 1 42.2-52.4Q277.3 86 272.2 81a598.3 598.3 0 0 0 -50.7 64.2 569.7 569.7 0 0 0 -84.4 14.6c-.2-1.4-24.3-82.2-1.2-123zm304.8 438.3c-2.9 5.1-11.8 20.3-34.9 20.3-36.7 0-98.7-39.4-163.3-126.2a695.4 695.4 0 0 0 93.9-.9 547.8 547.8 0 0 1 -42.2 52.4q5.1 5.25 10.2 10.2a588.5 588.5 0 0 0 50.7-64.2c47.3-4.7 80.3-13.5 84.4-14.6 22.7 84.4 4.5 117 1.2 123zm9.1-138.6c-3.6-11.9-7.7-24.1-12.4-36.4a12.67 12.67 0 0 1 -10.7-5.7l-.1 .1a19.61 19.61 0 0 1 -5.4 3.6c5.7 14.3 10.6 28.4 14.7 42.2a535.3 535.3 0 0 1 -72 13c3.5-5.3 17.2-26.2 32.2-54.2a24.6 24.6 0 0 1 -6-3.2c-1.1 1.2-3.6 4.2-10.9 4.2-6.2 11.2-17.4 30.9-33.9 55.2a711.9 711.9 0 0 1 -112.4 1c-7.9-11.2-21.5-31.1-36.8-57.8a21 21 0 0 1 -3-1.5c-1.9 1.6-3.9 3.2-12.6 3.2 6.3 11.2 17.5 30.7 33.8 54.6a548.8 548.8 0 0 1 -72.2-11.7q5.85-21 14.1-42.9c-3.2 0-5.4 .2-8.4-1a17.58 17.58 0 0 1 -6.9 1c-4.9 13.4-9.1 26.5-12.7 39.4C-31.7 297-12.1 216 126.7 175.6c3.6 11.9 7.7 24.1 12.4 36.4 10.4 0 12.9 3.4 14.4 5.3a12 12 0 0 1 2.3-2.2c-5.8-14.7-10.9-29.2-15.2-43.3 7-1.8 32.4-8.4 72-13-15.9 24.3-26.7 43.9-32.8 55.3a14.22 14.22 0 0 1 6.4 8 23.42 23.42 0 0 1 10.2-8.4c6.5-11.7 17.9-31.9 34.8-56.9a711.7 711.7 0 0 1 112.4-1c31.5 44.6 28.9 48.1 42.5 64.5a21.42 21.42 0 0 1 10.4-7.4c-6.4-11.4-17.6-31-34.3-55.5 40.4 4.1 65 10 72.2 11.7-4 14.4-8.9 29.2-14.6 44.2a20.74 20.74 0 0 1 6.8 4.3l.1 .1a12.72 12.72 0 0 1 8.9-5.6c4.9-13.4 9.2-26.6 12.8-39.5a359.7 359.7 0 0 1 34.5 11c106.1 39.9 74 87.9 72.6 90.4-19.8 35.1-80.1 55.2-105.7 62.5zm-114.4-114h-1.2a1.74 1.74 0 0 0 -1.9 1.9v49.8c0 7.9-2.6 11.1-10.1 11.1s-10.1-3.1-10.1-11.1v-49.8a1.69 1.69 0 0 0 -1.9-1.9H309a1.81 1.81 0 0 0 -2 1.9v51.5c0 9.6 5 14.1 15.1 14.1h.4c10.1 0 15.1-4.6 15.1-14.1v-51.5a2 2 0 0 0 -2.2-1.9zM321.7 308l-2.3-6.8-2.3 6.8-7.1 .1 5.7 4.3-2.1 6.8 5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3zm-31.1 7.4l-2.3-6.8-2.3 6.8-7.1 .1 5.7 4.3-2.1 6.8 5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3zm5.1-30.8h-19.4v-26.7h16.1a1.89 1.89 0 0 0 2-2v-.8a1.89 1.89 0 0 0 -2-2h-16.1v-25.8h19.1a1.89 1.89 0 0 0 2-2v-.8a1.77 1.77 0 0 0 -2-1.9h-22.2a1.81 1.81 0 0 0 -2 1.9v63a1.81 1.81 0 0 0 2 1.9h22.5a1.77 1.77 0 0 0 2-1.9v-.8a1.83 1.83 0 0 0 -2-2.06zm-7.4-99.4L286 192l-7.1 .1 5.7 4.3-2.1 6.8 5.8-4.1 5.8 4.1-2.1-6.8 5.7-4.3-7.1-.1z"],readme:[576,512,[],"f4d5","M528.3 46.5H388.5c-48.1 0-89.9 33.3-100.4 80.3-10.6-47-52.3-80.3-100.4-80.3H48c-26.5 0-48 21.5-48 48v245.8c0 26.5 21.5 48 48 48h89.7c102.2 0 132.7 24.4 147.3 75 .7 2.8 5.2 2.8 6 0 14.7-50.6 45.2-75 147.3-75H528c26.5 0 48-21.5 48-48V94.6c0-26.4-21.3-47.9-47.7-48.1zM242 311.9c0 1.9-1.5 3.5-3.5 3.5H78.2c-1.9 0-3.5-1.5-3.5-3.5V289c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5v22.9zm0-60.9c0 1.9-1.5 3.5-3.5 3.5H78.2c-1.9 0-3.5-1.5-3.5-3.5v-22.9c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5V251zm0-60.9c0 1.9-1.5 3.5-3.5 3.5H78.2c-1.9 0-3.5-1.5-3.5-3.5v-22.9c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5v22.9zm259.3 121.7c0 1.9-1.5 3.5-3.5 3.5H337.5c-1.9 0-3.5-1.5-3.5-3.5v-22.9c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5v22.9zm0-60.9c0 1.9-1.5 3.5-3.5 3.5H337.5c-1.9 0-3.5-1.5-3.5-3.5V228c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5v22.9zm0-60.9c0 1.9-1.5 3.5-3.5 3.5H337.5c-1.9 0-3.5-1.5-3.5-3.5v-22.8c0-1.9 1.5-3.5 3.5-3.5h160.4c1.9 0 3.5 1.5 3.5 3.5V190z"],rebel:[512,512,[],"f1d0","M256.5 504C117.2 504 9 387.8 13.2 249.9 16 170.7 56.4 97.7 129.7 49.5c.3 0 1.9-.6 1.1 .8-5.8 5.5-111.3 129.8-14.1 226.4 49.8 49.5 90 2.5 90 2.5 38.5-50.1-.6-125.9-.6-125.9-10-24.9-45.7-40.1-45.7-40.1l28.8-31.8c24.4 10.5 43.2 38.7 43.2 38.7 .8-29.6-21.9-61.4-21.9-61.4L255.1 8l44.3 50.1c-20.5 28.8-21.9 62.6-21.9 62.6 13.8-23 43.5-39.3 43.5-39.3l28.5 31.8c-27.4 8.9-45.4 39.9-45.4 39.9-15.8 28.5-27.1 89.4 .6 127.3 32.4 44.6 87.7-2.8 87.7-2.8 102.7-91.9-10.5-225-10.5-225-6.1-5.5 .8-2.8 .8-2.8 50.1 36.5 114.6 84.4 116.2 204.8C500.9 400.2 399 504 256.5 504z"],"red-river":[448,512,[],"f3e3","M353.2 32H94.8C42.4 32 0 74.4 0 126.8v258.4C0 437.6 42.4 480 94.8 480h258.4c52.4 0 94.8-42.4 94.8-94.8V126.8c0-52.4-42.4-94.8-94.8-94.8zM144.9 200.9v56.3c0 27-21.9 48.9-48.9 48.9V151.9c0-13.2 10.7-23.9 23.9-23.9h154.2c0 27-21.9 48.9-48.9 48.9h-56.3c-12.3-.6-24.6 11.6-24 24zm176.3 72h-56.3c-12.3-.6-24.6 11.6-24 24v56.3c0 27-21.9 48.9-48.9 48.9V247.9c0-13.2 10.7-23.9 23.9-23.9h154.2c0 27-21.9 48.9-48.9 48.9z"],reddit:[512,512,[],"f1a1","M201.5 305.5c-13.8 0-24.9-11.1-24.9-24.6 0-13.8 11.1-24.9 24.9-24.9 13.6 0 24.6 11.1 24.6 24.9 0 13.6-11.1 24.6-24.6 24.6zM504 256c0 137-111 248-248 248S8 393 8 256 119 8 256 8s248 111 248 248zm-132.3-41.2c-9.4 0-17.7 3.9-23.8 10-22.4-15.5-52.6-25.5-86.1-26.6l17.4-78.3 55.4 12.5c0 13.6 11.1 24.6 24.6 24.6 13.8 0 24.9-11.3 24.9-24.9s-11.1-24.9-24.9-24.9c-9.7 0-18 5.8-22.1 13.8l-61.2-13.6c-3-.8-6.1 1.4-6.9 4.4l-19.1 86.4c-33.2 1.4-63.1 11.3-85.5 26.8-6.1-6.4-14.7-10.2-24.1-10.2-34.9 0-46.3 46.9-14.4 62.8-1.1 5-1.7 10.2-1.7 15.5 0 52.6 59.2 95.2 132 95.2 73.1 0 132.3-42.6 132.3-95.2 0-5.3-.6-10.8-1.9-15.8 31.3-16 19.8-62.5-14.9-62.5zM302.8 331c-18.2 18.2-76.1 17.9-93.6 0-2.2-2.2-6.1-2.2-8.3 0-2.5 2.5-2.5 6.4 0 8.6 22.8 22.8 87.3 22.8 110.2 0 2.5-2.2 2.5-6.1 0-8.6-2.2-2.2-6.1-2.2-8.3 0zm7.7-75c-13.6 0-24.6 11.1-24.6 24.9 0 13.6 11.1 24.6 24.6 24.6 13.8 0 24.9-11.1 24.9-24.6 0-13.8-11-24.9-24.9-24.9z"],"reddit-alien":[512,512,[],"f281","M440.3 203.5c-15 0-28.2 6.2-37.9 15.9-35.7-24.7-83.8-40.6-137.1-42.3L293 52.3l88.2 19.8c0 21.6 17.6 39.2 39.2 39.2 22 0 39.7-18.1 39.7-39.7s-17.6-39.7-39.7-39.7c-15.4 0-28.7 9.3-35.3 22l-97.4-21.6c-4.9-1.3-9.7 2.2-11 7.1L246.3 177c-52.9 2.2-100.5 18.1-136.3 42.8-9.7-10.1-23.4-16.3-38.4-16.3-55.6 0-73.8 74.6-22.9 100.1-1.8 7.9-2.6 16.3-2.6 24.7 0 83.8 94.4 151.7 210.3 151.7 116.4 0 210.8-67.9 210.8-151.7 0-8.4-.9-17.2-3.1-25.1 49.9-25.6 31.5-99.7-23.8-99.7zM129.4 308.9c0-22 17.6-39.7 39.7-39.7 21.6 0 39.2 17.6 39.2 39.7 0 21.6-17.6 39.2-39.2 39.2-22 .1-39.7-17.6-39.7-39.2zm214.3 93.5c-36.4 36.4-139.1 36.4-175.5 0-4-3.5-4-9.7 0-13.7 3.5-3.5 9.7-3.5 13.2 0 27.8 28.5 120 29 149 0 3.5-3.5 9.7-3.5 13.2 0 4.1 4 4.1 10.2 .1 13.7zm-.8-54.2c-21.6 0-39.2-17.6-39.2-39.2 0-22 17.6-39.7 39.2-39.7 22 0 39.7 17.6 39.7 39.7-.1 21.5-17.7 39.2-39.7 39.2z"],redhat:[512,512,[],"f7bc","M341.5 285.6c33.65 0 82.34-6.94 82.34-47 .22-6.74 .86-1.82-20.88-96.24-4.62-19.15-8.68-27.84-42.31-44.65-26.09-13.34-82.92-35.37-99.73-35.37-15.66 0-20.2 20.17-38.87 20.17-18 0-31.31-15.06-48.12-15.06-16.14 0-26.66 11-34.78 33.62-27.5 77.55-26.28 74.27-26.12 78.27 0 24.8 97.64 106.1 228.5 106.1M429 254.8c4.65 22 4.65 24.35 4.65 27.25 0 37.66-42.33 58.56-98 58.56-125.7 .08-235.9-73.65-235.9-122.3a49.55 49.55 0 0 1 4.06-19.72C58.56 200.9 0 208.9 0 260.6c0 84.67 200.6 189 359.5 189 121.8 0 152.5-55.08 152.5-98.58 0-34.21-29.59-73.05-82.93-96.24"],renren:[512,512,[],"f18b","M214 169.1c0 110.4-61 205.4-147.6 247.4C30 373.2 8 317.7 8 256.6 8 133.9 97.1 32.2 214 12.5v156.6zM255 504c-42.9 0-83.3-11-118.5-30.4C193.7 437.5 239.9 382.9 255 319c15.5 63.9 61.7 118.5 118.8 154.7C338.7 493 298.3 504 255 504zm190.6-87.5C359 374.5 298 279.6 298 169.1V12.5c116.9 19.7 206 121.4 206 244.1 0 61.1-22 116.6-58.4 159.9z"],replyd:[448,512,[],"f3e6","M320 480H128C57.6 480 0 422.4 0 352V160C0 89.6 57.6 32 128 32h192c70.4 0 128 57.6 128 128v192c0 70.4-57.6 128-128 128zM193.4 273.2c-6.1-2-11.6-3.1-16.4-3.1-7.2 0-13.5 1.9-18.9 5.6-5.4 3.7-9.6 9-12.8 15.8h-1.1l-4.2-18.3h-28v138.9h36.1v-89.7c1.5-5.4 4.4-9.8 8.7-13.2 4.3-3.4 9.8-5.1 16.2-5.1 4.6 0 9.8 1 15.6 3.1l4.8-34zm115.2 103.4c-3.2 2.4-7.7 4.8-13.7 7.1-6 2.3-12.8 3.5-20.4 3.5-12.2 0-21.1-3-26.5-8.9-5.5-5.9-8.5-14.7-9-26.4h83.3c.9-4.8 1.6-9.4 2.1-13.9 .5-4.4 .7-8.6 .7-12.5 0-10.7-1.6-19.7-4.7-26.9-3.2-7.2-7.3-13-12.5-17.2-5.2-4.3-11.1-7.3-17.8-9.2-6.7-1.8-13.5-2.8-20.6-2.8-21.1 0-37.5 6.1-49.2 18.3s-17.5 30.5-17.5 55c0 22.8 5.2 40.7 15.6 53.7 10.4 13.1 26.8 19.6 49.2 19.6 10.7 0 20.9-1.5 30.4-4.6 9.5-3.1 17.1-6.8 22.6-11.2l-12-23.6zm-21.8-70.3c3.8 5.4 5.3 13.1 4.6 23.1h-51.7c.9-9.4 3.7-17 8.2-22.6 4.5-5.6 11.5-8.5 21-8.5 8.2-.1 14.1 2.6 17.9 8zm79.9 2.5c4.1 3.9 9.4 5.8 16.1 5.8 7 0 12.6-1.9 16.7-5.8s6.1-9.1 6.1-15.6-2-11.6-6.1-15.4c-4.1-3.8-9.6-5.7-16.7-5.7-6.7 0-12 1.9-16.1 5.7-4.1 3.8-6.1 8.9-6.1 15.4s2 11.7 6.1 15.6zm0 100.5c4.1 3.9 9.4 5.8 16.1 5.8 7 0 12.6-1.9 16.7-5.8s6.1-9.1 6.1-15.6-2-11.6-6.1-15.4c-4.1-3.8-9.6-5.7-16.7-5.7-6.7 0-12 1.9-16.1 5.7-4.1 3.8-6.1 8.9-6.1 15.4 0 6.6 2 11.7 6.1 15.6z"],researchgate:[448,512,[],"f4f8","M0 32v448h448V32H0zm262.2 334.4c-6.6 3-33.2 6-50-14.2-9.2-10.6-25.3-33.3-42.2-63.6-8.9 0-14.7 0-21.4-.6v46.4c0 23.5 6 21.2 25.8 23.9v8.1c-6.9-.3-23.1-.8-35.6-.8-13.1 0-26.1 .6-33.6 .8v-8.1c15.5-2.9 22-1.3 22-23.9V225c0-22.6-6.4-21-22-23.9V193c25.8 1 53.1-.6 70.9-.6 31.7 0 55.9 14.4 55.9 45.6 0 21.1-16.7 42.2-39.2 47.5 13.6 24.2 30 45.6 42.2 58.9 7.2 7.8 17.2 14.7 27.2 14.7v7.3zm22.9-135c-23.3 0-32.2-15.7-32.2-32.2V167c0-12.2 8.8-30.4 34-30.4s30.4 17.9 30.4 17.9l-10.7 7.2s-5.5-12.5-19.7-12.5c-7.9 0-19.7 7.3-19.7 19.7v26.8c0 13.4 6.6 23.3 17.9 23.3 14.1 0 21.5-10.9 21.5-26.8h-17.9v-10.7h30.4c0 20.5 4.7 49.9-34 49.9zm-116.5 44.7c-9.4 0-13.6-.3-20-.8v-69.7c6.4-.6 15-.6 22.5-.6 23.3 0 37.2 12.2 37.2 34.5 0 21.9-15 36.6-39.7 36.6z"],resolving:[496,512,[],"f3e7","M281.2 278.2c46-13.3 49.6-23.5 44-43.4L314 195.5c-6.1-20.9-18.4-28.1-71.1-12.8L54.7 236.8l28.6 98.6 197.9-57.2zM248.5 8C131.4 8 33.2 88.7 7.2 197.5l221.9-63.9c34.8-10.2 54.2-11.7 79.3-8.2 36.3 6.1 52.7 25 61.4 55.2l10.7 37.8c8.2 28.1 1 50.6-23.5 73.6-19.4 17.4-31.2 24.5-61.4 33.2L203 351.8l220.4 27.1 9.7 34.2-48.1 13.3-286.8-37.3 23 80.2c36.8 22 80.3 34.7 126.3 34.7 137 0 248.5-111.4 248.5-248.3C497 119.4 385.5 8 248.5 8zM38.3 388.6L0 256.8c0 48.5 14.3 93.4 38.3 131.8z"],rev:[448,512,[],"f5b2","M289.7 274.9a65.57 65.57 0 1 1 -65.56-65.56 65.64 65.64 0 0 1 65.56 65.56zm139.6-5.05h-.13a204.7 204.7 0 0 0 -74.32-153l-45.38 26.2a157.1 157.1 0 0 1 71.81 131.8C381.2 361.5 310.7 432 224.1 432S67 361.5 67 274.9c0-81.88 63-149.3 143-156.4v39.12l108.8-62.79L210 32v38.32c-106.7 7.25-191 96-191 204.6 0 111.6 89.12 202.3 200.1 205v.11h210.2V269.8z"],rocketchat:[576,512,[],"f3e8","M284 224.8a34.11 34.11 0 1 0 34.32 34.11A34.22 34.22 0 0 0 284 224.8zm-110.4 0a34.11 34.11 0 1 0 34.32 34.11A34.22 34.22 0 0 0 173.6 224.8zm220.9 0a34.11 34.11 0 1 0 34.32 34.11A34.22 34.22 0 0 0 394.5 224.8zm153.8-55.32c-15.53-24.17-37.31-45.57-64.68-63.62-52.89-34.82-122.4-54-195.7-54a405.1 405.1 0 0 0 -72.03 6.357 238.5 238.5 0 0 0 -49.51-36.59C99.68-11.7 40.86 .711 11.14 11.42A14.29 14.29 0 0 0 5.58 34.78C26.54 56.46 61.22 99.3 52.7 138.3c-33.14 33.9-51.11 74.78-51.11 117.3 0 43.37 17.97 84.25 51.11 118.1 8.526 38.96-26.15 81.82-47.12 103.5a14.28 14.28 0 0 0 5.555 23.34c29.72 10.71 88.55 23.15 155.3-10.2a238.7 238.7 0 0 0 49.51-36.59A405.1 405.1 0 0 0 288 460.1c73.31 0 142.8-19.16 195.7-53.97 27.37-18.05 49.15-39.43 64.68-63.62 17.31-26.92 26.07-55.92 26.07-86.13C574.4 225.4 565.6 196.4 548.3 169.5zM284.1 409.9a345.6 345.6 0 0 1 -89.45-11.5l-20.13 19.39a184.4 184.4 0 0 1 -37.14 27.58 145.8 145.8 0 0 1 -52.52 14.87c.983-1.771 1.881-3.563 2.842-5.356q30.26-55.68 16.33-100.1c-32.99-25.96-52.78-59.2-52.78-95.4 0-83.1 104.3-150.5 232.8-150.5s232.9 67.37 232.9 150.5C517.9 342.5 413.6 409.9 284.1 409.9z"],rockrms:[496,512,[],"f3e9","M248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S385 8 248 8zm157.4 419.5h-90l-112-131.3c-17.9-20.4-3.9-56.1 26.6-56.1h75.3l-84.6-99.3-84.3 98.9h-90L193.5 67.2c14.4-18.4 41.3-17.3 54.5 0l157.7 185.1c19 22.8 2 57.2-27.6 56.1-.6 0-74.2 .2-74.2 .2l101.5 118.9z"],rust:[512,512,[],"e07a","M508.5 249.8 486.7 236.2c-.17-2-.34-3.93-.55-5.88l18.72-17.5a7.35 7.35 0 0 0 -2.44-12.25l-24-9c-.54-1.88-1.08-3.78-1.67-5.64l15-20.83a7.35 7.35 0 0 0 -4.79-11.54l-25.42-4.15c-.9-1.73-1.79-3.45-2.73-5.15l10.68-23.42a7.35 7.35 0 0 0 -6.95-10.39l-25.82 .91q-1.79-2.22-3.61-4.4L439 81.84A7.36 7.36 0 0 0 430.2 73L405 78.93q-2.17-1.83-4.4-3.61l.91-25.82a7.35 7.35 0 0 0 -10.39-7L367.7 53.23c-1.7-.94-3.43-1.84-5.15-2.73L358.4 25.08a7.35 7.35 0 0 0 -11.54-4.79L326 35.26c-1.86-.59-3.75-1.13-5.64-1.67l-9-24a7.35 7.35 0 0 0 -12.25-2.44l-17.5 18.72c-1.95-.21-3.91-.38-5.88-.55L262.3 3.48a7.35 7.35 0 0 0 -12.5 0L236.2 25.3c-2 .17-3.93 .34-5.88 .55L212.9 7.13a7.35 7.35 0 0 0 -12.25 2.44l-9 24c-1.89 .55-3.79 1.08-5.66 1.68l-20.82-15a7.35 7.35 0 0 0 -11.54 4.79l-4.15 25.41c-1.73 .9-3.45 1.79-5.16 2.73L120.9 42.55a7.35 7.35 0 0 0 -10.39 7l.92 25.81c-1.49 1.19-3 2.39-4.42 3.61L81.84 73A7.36 7.36 0 0 0 73 81.84L78.93 107c-1.23 1.45-2.43 2.93-3.62 4.41l-25.81-.91a7.42 7.42 0 0 0 -6.37 3.26 7.35 7.35 0 0 0 -.57 7.13l10.66 23.41c-.94 1.7-1.83 3.43-2.73 5.16L25.08 153.6a7.35 7.35 0 0 0 -4.79 11.54l15 20.82c-.59 1.87-1.13 3.77-1.68 5.66l-24 9a7.35 7.35 0 0 0 -2.44 12.25l18.72 17.5c-.21 1.95-.38 3.91-.55 5.88L3.48 249.8a7.35 7.35 0 0 0 0 12.5L25.3 275.8c.17 2 .34 3.92 .55 5.87L7.13 299.1a7.35 7.35 0 0 0 2.44 12.25l24 9c.55 1.89 1.08 3.78 1.68 5.65l-15 20.83a7.35 7.35 0 0 0 4.79 11.54l25.42 4.15c.9 1.72 1.79 3.45 2.73 5.14L42.56 391.1a7.35 7.35 0 0 0 .57 7.13 7.13 7.13 0 0 0 6.37 3.26l25.83-.91q1.77 2.22 3.6 4.4L73 430.2A7.36 7.36 0 0 0 81.84 439L107 433.1q2.18 1.83 4.41 3.61l-.92 25.82a7.35 7.35 0 0 0 10.39 6.95l23.43-10.68c1.69 .94 3.42 1.83 5.14 2.73l4.15 25.42a7.34 7.34 0 0 0 11.54 4.78l20.83-15c1.86 .6 3.76 1.13 5.65 1.68l9 24a7.36 7.36 0 0 0 12.25 2.44l17.5-18.72c1.95 .21 3.92 .38 5.88 .55l13.51 21.82a7.35 7.35 0 0 0 12.5 0l13.51-21.82c2-.17 3.93-.34 5.88-.56l17.5 18.73a7.36 7.36 0 0 0 12.25-2.44l9-24c1.89-.55 3.78-1.08 5.65-1.68l20.82 15a7.34 7.34 0 0 0 11.54-4.78l4.15-25.42c1.72-.9 3.45-1.79 5.15-2.73l23.42 10.68a7.35 7.35 0 0 0 10.39-6.95l-.91-25.82q2.22-1.79 4.4-3.61L430.2 439a7.36 7.36 0 0 0 8.84-8.84L433.1 405q1.83-2.17 3.61-4.4l25.82 .91a7.23 7.23 0 0 0 6.37-3.26 7.35 7.35 0 0 0 .58-7.13L458.8 367.7c.94-1.7 1.83-3.43 2.73-5.15l25.42-4.15a7.35 7.35 0 0 0 4.79-11.54l-15-20.83c.59-1.87 1.13-3.76 1.67-5.65l24-9a7.35 7.35 0 0 0 2.44-12.25l-18.72-17.5c.21-1.95 .38-3.91 .55-5.87l21.82-13.51a7.35 7.35 0 0 0 0-12.5zm-151 129.1A13.91 13.91 0 0 0 341 389.5l-7.64 35.67A187.5 187.5 0 0 1 177 424.4l-7.64-35.66a13.87 13.87 0 0 0 -16.46-10.68l-31.51 6.76a187.4 187.4 0 0 1 -16.26-19.21H258.3c1.72 0 2.89-.29 2.89-1.91V309.5c0-1.57-1.17-1.91-2.89-1.91H213.5l.05-34.35H262c4.41 0 23.66 1.28 29.79 25.87 1.91 7.55 6.17 32.14 9.06 40 2.89 8.82 14.6 26.46 27.1 26.46H407a187.3 187.3 0 0 1 -17.34 20.09zm25.77 34.49A15.24 15.24 0 1 1 368 398.1h.44A15.23 15.23 0 0 1 383.2 413.3zm-225.6-.68a15.24 15.24 0 1 1 -15.25-15.25h.45A15.25 15.25 0 0 1 157.6 412.6zM69.57 234.1l32.83-14.6a13.88 13.88 0 0 0 7.06-18.33L102.7 186h26.56V305.7H75.65A187.6 187.6 0 0 1 69.57 234.1zM58.31 198.1a15.24 15.24 0 0 1 15.23-15.25H74a15.24 15.24 0 1 1 -15.67 15.24zm155.2 24.49 .05-35.32h63.26c3.28 0 23.07 3.77 23.07 18.62 0 12.29-15.19 16.7-27.68 16.7zM399 306.7c-9.8 1.13-20.63-4.12-22-10.09-5.78-32.49-15.39-39.4-30.57-51.4 18.86-11.95 38.46-29.64 38.46-53.26 0-25.52-17.49-41.59-29.4-49.48-16.76-11-35.28-13.23-40.27-13.23H116.3A187.5 187.5 0 0 1 221.2 70.06l23.47 24.6a13.82 13.82 0 0 0 19.6 .44l26.26-25a187.5 187.5 0 0 1 128.4 91.43l-18 40.57A14 14 0 0 0 408 220.4l34.59 15.33a187.1 187.1 0 0 1 .4 32.54H423.7c-1.91 0-2.69 1.27-2.69 3.13v8.82C421 301 409.3 305.6 399 306.7zM240 60.21A15.24 15.24 0 0 1 255.2 45h.45A15.24 15.24 0 1 1 240 60.21zM436.8 214a15.24 15.24 0 1 1 0-30.48h.44a15.24 15.24 0 0 1 -.44 30.48z"],safari:[512,512,[],"f267","M274.7 274.7l-37.38-37.38L166 346zM256 8C119 8 8 119 8 256S119 504 256 504 504 393 504 256 393 8 256 8zM411.9 182.8l14.78-6.13A8 8 0 0 1 437.1 181h0a8 8 0 0 1 -4.33 10.46L418 197.6a8 8 0 0 1 -10.45-4.33h0A8 8 0 0 1 411.9 182.8zM314.4 94l6.12-14.78A8 8 0 0 1 331 74.92h0a8 8 0 0 1 4.33 10.45l-6.13 14.78a8 8 0 0 1 -10.45 4.33h0A8 8 0 0 1 314.4 94zM256 60h0a8 8 0 0 1 8 8V84a8 8 0 0 1 -8 8h0a8 8 0 0 1 -8-8V68A8 8 0 0 1 256 60zM181 74.92a8 8 0 0 1 10.46 4.33L197.6 94a8 8 0 1 1 -14.78 6.12l-6.13-14.78A8 8 0 0 1 181 74.92zm-63.58 42.49h0a8 8 0 0 1 11.31 0L140 128.7A8 8 0 0 1 140 140h0a8 8 0 0 1 -11.31 0l-11.31-11.31A8 8 0 0 1 117.4 117.4zM60 256h0a8 8 0 0 1 8-8H84a8 8 0 0 1 8 8h0a8 8 0 0 1 -8 8H68A8 8 0 0 1 60 256zm40.15 73.21-14.78 6.13A8 8 0 0 1 74.92 331h0a8 8 0 0 1 4.33-10.46L94 314.4a8 8 0 0 1 10.45 4.33h0A8 8 0 0 1 100.2 329.2zm4.33-136h0A8 8 0 0 1 94 197.6l-14.78-6.12A8 8 0 0 1 74.92 181h0a8 8 0 0 1 10.45-4.33l14.78 6.13A8 8 0 0 1 104.5 193.2zM197.6 418l-6.12 14.78a8 8 0 0 1 -14.79-6.12l6.13-14.78A8 8 0 1 1 197.6 418zM264 444a8 8 0 0 1 -8 8h0a8 8 0 0 1 -8-8V428a8 8 0 0 1 8-8h0a8 8 0 0 1 8 8zm67-6.92h0a8 8 0 0 1 -10.46-4.33L314.4 418a8 8 0 0 1 4.33-10.45h0a8 8 0 0 1 10.45 4.33l6.13 14.78A8 8 0 0 1 331 437.1zm63.58-42.49h0a8 8 0 0 1 -11.31 0L372 383.3A8 8 0 0 1 372 372h0a8 8 0 0 1 11.31 0l11.31 11.31A8 8 0 0 1 394.6 394.6zM286.3 286.3 110.3 401.7 225.8 225.8 401.7 110.3zM437.1 331h0a8 8 0 0 1 -10.45 4.33l-14.78-6.13a8 8 0 0 1 -4.33-10.45h0A8 8 0 0 1 418 314.4l14.78 6.12A8 8 0 0 1 437.1 331zM444 264H428a8 8 0 0 1 -8-8h0a8 8 0 0 1 8-8h16a8 8 0 0 1 8 8h0A8 8 0 0 1 444 264z"],salesforce:[640,512,[],"f83b","M248.9 245.6h-26.35c.69-5.16 3.32-14.12 13.64-14.12 6.75 0 11.97 3.82 12.71 14.12zm136.7-13.88c-.47 0-14.11-1.77-14.11 20s13.63 20 14.11 20c13 0 14.11-13.54 14.11-20 0-21.76-13.66-20-14.11-20zm-243.2 23.76a8.63 8.63 0 0 0 -3.29 7.29c0 4.78 2.08 6.05 3.29 7.05 4.7 3.7 15.07 2.12 20.93 .95v-16.94c-5.32-1.07-16.73-1.96-20.93 1.65zM640 232c0 87.58-80 154.4-165.4 136.4-18.37 33-70.73 70.75-132.2 41.63-41.16 96.05-177.9 92.18-213.8-5.17C8.91 428.8-50.19 266.5 53.36 205.6 18.61 126.2 76 32 167.7 32a124.2 124.2 0 0 1 98.56 48.7c20.7-21.4 49.4-34.81 81.15-34.81 42.34 0 79 23.52 98.8 58.57C539 63.78 640 132.7 640 232zm-519.5 31.8c0-11.76-11.69-15.17-17.87-17.17-5.27-2.11-13.41-3.51-13.41-8.94 0-9.46 17-6.66 25.17-2.12 0 0 1.17 .71 1.64-.47 .24-.7 2.36-6.58 2.59-7.29a1.13 1.13 0 0 0 -.7-1.41c-12.33-7.63-40.7-8.51-40.7 12.7 0 12.46 11.49 15.44 17.88 17.17 4.72 1.58 13.17 3 13.17 8.7 0 4-3.53 7.06-9.17 7.06a31.76 31.76 0 0 1 -19-6.35c-.47-.23-1.42-.71-1.65 .71l-2.4 7.47c-.47 .94 .23 1.18 .23 1.41 1.75 1.4 10.3 6.59 22.82 6.59 13.17 0 21.4-7.06 21.4-18.11zm32-42.58c-10.13 0-18.66 3.17-21.4 5.18a1 1 0 0 0 -.24 1.41l2.59 7.06a1 1 0 0 0 1.18 .7c.65 0 6.8-4 16.93-4 4 0 7.06 .71 9.18 2.36 3.6 2.8 3.06 8.29 3.06 10.58-4.79-.3-19.11-3.44-29.41 3.76a16.92 16.92 0 0 0 -7.34 14.54c0 5.9 1.51 10.4 6.59 14.35 12.24 8.16 36.28 2 38.1 1.41 1.58-.32 3.53-.66 3.53-1.88v-33.88c.04-4.61 .32-21.64-22.78-21.64zM199 200.2a1.11 1.11 0 0 0 -1.18-1.18H188a1.11 1.11 0 0 0 -1.17 1.18v79a1.11 1.11 0 0 0 1.17 1.18h9.88a1.11 1.11 0 0 0 1.18-1.18zm55.75 28.93c-2.1-2.31-6.79-7.53-17.65-7.53-3.51 0-14.16 .23-20.7 8.94-6.35 7.63-6.58 18.11-6.58 21.41 0 3.12 .15 14.26 7.06 21.17 2.64 2.91 9.06 8.23 22.81 8.23 10.82 0 16.47-2.35 18.58-3.76 .47-.24 .71-.71 .24-1.88l-2.35-6.83a1.26 1.26 0 0 0 -1.41-.7c-2.59 .94-6.35 2.82-15.29 2.82-17.42 0-16.85-14.74-16.94-16.7h37.17a1.23 1.23 0 0 0 1.17-.94c-.29 0 2.07-14.7-6.09-24.23zm36.69 52.69c13.17 0 21.41-7.06 21.41-18.11 0-11.76-11.7-15.17-17.88-17.17-4.14-1.66-13.41-3.38-13.41-8.94 0-3.76 3.29-6.35 8.47-6.35a38.11 38.11 0 0 1 16.7 4.23s1.18 .71 1.65-.47c.23-.7 2.35-6.58 2.58-7.29a1.13 1.13 0 0 0 -.7-1.41c-7.91-4.9-16.74-4.94-20.23-4.94-12 0-20.46 7.29-20.46 17.64 0 12.46 11.48 15.44 17.87 17.17 6.11 2 13.17 3.26 13.17 8.7 0 4-3.52 7.06-9.17 7.06a31.8 31.8 0 0 1 -19-6.35 1 1 0 0 0 -1.65 .71l-2.35 7.52c-.47 .94 .23 1.18 .23 1.41 1.72 1.4 10.33 6.59 22.79 6.59zM357.1 224c0-.71-.24-1.18-1.18-1.18h-11.76c0-.14 .94-8.94 4.47-12.47 4.16-4.15 11.76-1.64 12-1.64 1.17 .47 1.41 0 1.64-.47l2.83-7.77c.7-.94 0-1.17-.24-1.41-5.09-2-17.35-2.87-24.46 4.24-5.48 5.48-7 13.92-8 19.52h-8.47a1.28 1.28 0 0 0 -1.17 1.18l-1.42 7.76c0 .7 .24 1.17 1.18 1.17h8.23c-8.51 47.9-8.75 50.21-10.35 55.52-1.08 3.62-3.29 6.9-5.88 7.76-.09 0-3.88 1.68-9.64-.24 0 0-.94-.47-1.41 .71-.24 .71-2.59 6.82-2.83 7.53s0 1.41 .47 1.41c5.11 2 13 1.77 17.88 0 6.28-2.28 9.72-7.89 11.53-12.94 2.75-7.71 2.81-9.79 11.76-59.74h12.23a1.29 1.29 0 0 0 1.18-1.18zm53.39 16c-.56-1.68-5.1-18.11-25.17-18.11-15.25 0-23 10-25.16 18.11-1 3-3.18 14 0 23.52 .09 .3 4.41 18.12 25.16 18.12 14.95 0 22.9-9.61 25.17-18.12 3.21-9.61 1.01-20.52 0-23.52zm45.4-16.7c-5-1.65-16.62-1.9-22.11 5.41v-4.47a1.11 1.11 0 0 0 -1.18-1.17h-9.4a1.11 1.11 0 0 0 -1.18 1.17v55.28a1.12 1.12 0 0 0 1.18 1.18h9.64a1.12 1.12 0 0 0 1.18-1.18v-27.77c0-2.91 .05-11.37 4.46-15.05 4.9-4.9 12-3.36 13.41-3.06a1.57 1.57 0 0 0 1.41-.94 74 74 0 0 0 3.06-8 1.16 1.16 0 0 0 -.47-1.41zm46.81 54.1l-2.12-7.29c-.47-1.18-1.41-.71-1.41-.71-4.23 1.82-10.15 1.89-11.29 1.89-4.64 0-17.17-1.13-17.17-19.76 0-6.23 1.85-19.76 16.47-19.76a34.85 34.85 0 0 1 11.52 1.65s.94 .47 1.18-.71c.94-2.59 1.64-4.47 2.59-7.53 .23-.94-.47-1.17-.71-1.17-11.59-3.87-22.34-2.53-27.76 0-1.59 .74-16.23 6.49-16.23 27.52 0 2.9-.58 30.11 28.94 30.11a44.45 44.45 0 0 0 15.52-2.83 1.3 1.3 0 0 0 .47-1.42zm53.87-39.52c-.8-3-5.37-16.23-22.35-16.23-16 0-23.52 10.11-25.64 18.59a38.58 38.58 0 0 0 -1.65 11.76c0 25.87 18.84 29.4 29.88 29.4 10.82 0 16.46-2.35 18.58-3.76 .47-.24 .71-.71 .24-1.88l-2.36-6.83a1.26 1.26 0 0 0 -1.41-.7c-2.59 .94-6.35 2.82-15.29 2.82-17.42 0-16.85-14.74-16.93-16.7h37.16a1.25 1.25 0 0 0 1.18-.94c-.24-.01 .94-7.07-1.41-15.54zm-23.29-6.35c-10.33 0-13 9-13.64 14.12H546c-.88-11.92-7.62-14.13-12.73-14.13z"],sass:[640,512,[],"f41e","M301.8 378.9c-.3 .6-.6 1.08 0 0zm249.1-87a131.2 131.2 0 0 0 -58 13.5c-5.9-11.9-12-22.3-13-30.1-1.2-9.1-2.5-14.5-1.1-25.3s7.7-26.1 7.6-27.2-1.4-6.6-14.3-6.7-24 2.5-25.29 5.9a122.8 122.8 0 0 0 -5.3 19.1c-2.3 11.7-25.79 53.5-39.09 75.3-4.4-8.5-8.1-16-8.9-22-1.2-9.1-2.5-14.5-1.1-25.3s7.7-26.1 7.6-27.2-1.4-6.6-14.29-6.7-24 2.5-25.3 5.9-2.7 11.4-5.3 19.1-33.89 77.3-42.08 95.4c-4.2 9.2-7.8 16.6-10.4 21.6-.4 .8-.7 1.3-.9 1.7 .3-.5 .5-1 .5-.8-2.2 4.3-3.5 6.7-3.5 6.7v.1c-1.7 3.2-3.6 6.1-4.5 6.1-.6 0-1.9-8.4 .3-19.9 4.7-24.2 15.8-61.8 15.7-63.1-.1-.7 2.1-7.2-7.3-10.7-9.1-3.3-12.4 2.2-13.2 2.2s-1.4 2-1.4 2 10.1-42.4-19.39-42.4c-18.4 0-44 20.2-56.58 38.5-7.9 4.3-25 13.6-43 23.5-6.9 3.8-14 7.7-20.7 11.4-.5-.5-.9-1-1.4-1.5-35.79-38.2-101.9-65.2-99.07-116.5 1-18.7 7.5-67.8 127.1-127.4 98-48.8 176.4-35.4 189.8-5.6 19.4 42.5-41.89 121.6-143.7 133-38.79 4.3-59.18-10.7-64.28-16.3-5.3-5.9-6.1-6.2-8.1-5.1-3.3 1.8-1.2 7 0 10.1 3 7.9 15.5 21.9 36.79 28.9 18.7 6.1 64.18 9.5 119.2-11.8 61.78-23.8 109.9-90.1 95.77-145.6C386.5 18.32 293-.18 204.6 31.22c-52.69 18.7-109.7 48.1-150.7 86.4-48.69 45.6-56.48 85.3-53.28 101.9 11.39 58.9 92.57 97.3 125.1 125.7-1.6 .9-3.1 1.7-4.5 2.5-16.29 8.1-78.18 40.5-93.67 74.7-17.5 38.8 2.9 66.6 16.29 70.4 41.79 11.6 84.58-9.3 107.6-43.6s20.2-79.1 9.6-99.5c-.1-.3-.3-.5-.4-.8 4.2-2.5 8.5-5 12.8-7.5 8.29-4.9 16.39-9.4 23.49-13.3-4 10.8-6.9 23.8-8.4 42.6-1.8 22 7.3 50.5 19.1 61.7 5.2 4.9 11.49 5 15.39 5 13.8 0 20-11.4 26.89-25 8.5-16.6 16-35.9 16-35.9s-9.4 52.2 16.3 52.2c9.39 0 18.79-12.1 23-18.3v.1s.2-.4 .7-1.2c1-1.5 1.5-2.4 1.5-2.4v-.3c3.8-6.5 12.1-21.4 24.59-46 16.2-31.8 31.69-71.5 31.69-71.5a201.2 201.2 0 0 0 6.2 25.8c2.8 9.5 8.7 19.9 13.4 30-3.8 5.2-6.1 8.2-6.1 8.2a.31 .31 0 0 0 .1 .2c-3 4-6.4 8.3-9.9 12.5-12.79 15.2-28 32.6-30 37.6-2.4 5.9-1.8 10.3 2.8 13.7 3.4 2.6 9.4 3 15.69 2.5 11.5-.8 19.6-3.6 23.5-5.4a82.2 82.2 0 0 0 20.19-10.6c12.5-9.2 20.1-22.4 19.4-39.8-.4-9.6-3.5-19.2-7.3-28.2 1.1-1.6 2.3-3.3 3.4-5C434.8 301.7 450.1 270 450.1 270a201.2 201.2 0 0 0 6.2 25.8c2.4 8.1 7.09 17 11.39 25.7-18.59 15.1-30.09 32.6-34.09 44.1-7.4 21.3-1.6 30.9 9.3 33.1 4.9 1 11.9-1.3 17.1-3.5a79.46 79.46 0 0 0 21.59-11.1c12.5-9.2 24.59-22.1 23.79-39.6-.3-7.9-2.5-15.8-5.4-23.4 15.7-6.6 36.09-10.2 62.09-7.2 55.68 6.5 66.58 41.3 64.48 55.8s-13.8 22.6-17.7 25-5.1 3.3-4.8 5.1c.5 2.6 2.3 2.5 5.6 1.9 4.6-.8 29.19-11.8 30.29-38.7 1.6-34-31.09-71.4-89-71.1zm-429.2 144.7c-18.39 20.1-44.19 27.7-55.28 21.3C54.61 451 59.31 421.4 82 400c13.8-13 31.59-25 43.39-32.4 2.7-1.6 6.6-4 11.4-6.9 .8-.5 1.2-.7 1.2-.7 .9-.6 1.9-1.1 2.9-1.7 8.29 30.4 .3 57.2-19.1 78.3zm134.4-91.4c-6.4 15.7-19.89 55.7-28.09 53.6-7-1.8-11.3-32.3-1.4-62.3 5-15.1 15.6-33.1 21.9-40.1 10.09-11.3 21.19-14.9 23.79-10.4 3.5 5.9-12.2 49.4-16.2 59.2zm111 53c-2.7 1.4-5.2 2.3-6.4 1.6-.9-.5 1.1-2.4 1.1-2.4s13.9-14.9 19.4-21.7c3.2-4 6.9-8.7 10.89-13.9 0 .5 .1 1 .1 1.6-.13 17.9-17.32 30-25.12 34.8zm85.58-19.5c-2-1.4-1.7-6.1 5-20.7 2.6-5.7 8.59-15.3 19-24.5a36.18 36.18 0 0 1 1.9 10.8c-.1 22.5-16.2 30.9-25.89 34.4z"],schlix:[448,512,[],"f3ea","M350.5 157.7l-54.2-46.1 73.4-39 78.3 44.2-97.5 40.9zM192 122.1l45.7-28.2 34.7 34.6-55.4 29-25-35.4zm-65.1 6.6l31.9-22.1L176 135l-36.7 22.5-12.4-28.8zm-23.3 88.2l-8.8-34.8 29.6-18.3 13.1 35.3-33.9 17.8zm-21.2-83.7l23.9-18.1 8.9 24-26.7 18.3-6.1-24.2zM59 206.5l-3.6-28.4 22.3-15.5 6.1 28.7L59 206.5zm-30.6 16.6l20.8-12.8 3.3 33.4-22.9 12-1.2-32.6zM1.4 268l19.2-10.2 .4 38.2-21 8.8L1.4 268zm59.1 59.3l-28.3 8.3-1.6-46.8 25.1-10.7 4.8 49.2zM99 263.2l-31.1 13-5.2-40.8L90.1 221l8.9 42.2zM123.2 377l-41.6 5.9-8.1-63.5 35.2-10.8 14.5 68.4zm28.5-139.9l21.2 57.1-46.2 13.6-13.7-54.1 38.7-16.6zm85.7 230.5l-70.9-3.3-24.3-95.8 55.2-8.6 40 107.7zm-84.9-279.7l42.2-22.4 28 45.9-50.8 21.3-19.4-44.8zm41 94.9l61.3-18.7 52.8 86.6-79.8 11.3-34.3-79.2zm51.4-85.6l67.3-28.8 65.5 65.4-88.6 26.2-44.2-62.8z"],screenpal:[512,512,[],"e570","M233.5 22.49C233.5 10.07 243.6 0 256 0C268.4 0 278.5 10.07 278.5 22.49C278.5 34.91 268.4 44.98 256 44.98C243.6 44.98 233.5 34.91 233.5 22.49zM313.4 259C313.4 290.7 287.7 316.4 256 316.4C224.3 316.4 198.6 290.7 198.6 259C198.6 227.3 224.3 201.6 256 201.6C287.7 201.6 313.4 227.3 313.4 259zM337.2 350C359.5 330.1 373.7 302.7 377.1 273H496.6C493.1 334.4 466.2 392.2 421.4 434.4C376.7 476.6 317.5 500.2 256 500.2C194.5 500.2 135.3 476.6 90.56 434.4C45.83 392.2 18.94 334.4 15.39 273H135.1C138.5 302.7 152.7 330.1 175 350C197.3 369.9 226.2 380.9 256.1 380.9C285.1 380.9 314.8 369.9 337.2 350zM73.14 140.3C73.54 152.7 63.81 163.1 51.39 163.5C38.97 163.9 28.59 154.2 28.18 141.8C27.78 129.3 37.52 118.9 49.94 118.5C62.35 118.1 72.74 127.9 73.14 140.3zM438.9 141C438.9 128.6 448.9 118.5 461.4 118.5C473.8 118.5 483.8 128.6 483.8 141C483.8 153.5 473.8 163.5 461.4 163.5C448.9 163.5 438.9 153.5 438.9 141zM317.9 95.27C300.6 109.1 278.7 118.1 256 118.1C233.3 118.1 211.4 109.1 194.1 95.27C176.8 80.55 165.3 60.18 161.7 37.78C176.8 31.37 192.5 26.52 208.6 23.31C208.6 35.88 213.6 47.93 222.5 56.82C231.4 65.7 243.4 70.7 256 70.7C268.6 70.7 280.6 65.7 289.5 56.82C298.4 47.93 303.4 35.88 303.4 23.31C319.5 26.52 335.2 31.37 350.3 37.78C346.7 60.18 335.2 80.55 317.9 95.27H317.9zM82.78 231C61.42 238.6 38.06 238.4 16.86 230.4C18.82 214.1 22.46 198.1 27.71 182.5C33.1 185.6 39.05 187.6 45.22 188.5C51.39 189.3 57.67 188.9 63.68 187.3C69.69 185.6 75.33 182.9 80.27 179.1C85.21 175.3 89.36 170.6 92.47 165.2C95.58 159.8 97.61 153.8 98.42 147.7C99.23 141.5 98.83 135.2 97.22 129.2C95.61 123.2 92.83 117.6 89.04 112.6C85.25 107.7 80.53 103.5 75.14 100.4C85.96 88.11 98.01 76.94 111.1 67.07C128.7 81.42 140.6 101.6 144.7 123.9C148.8 146.2 144.8 169.3 133.5 188.9C122.1 208.5 104.1 223.4 82.78 231V231zM429.2 231.1C407.9 223.5 389.9 208.5 378.5 188.9C367.2 169.3 363.3 146.2 367.4 123.9C371.5 101.7 383.4 81.54 400.9 67.19C414 77.04 426.1 88.21 436.9 100.5C426.2 106.9 418.5 117.2 415.4 129.3C412.2 141.3 413.1 154.1 420.2 164.9C426.4 175.7 436.6 183.6 448.6 186.9C460.6 190.2 473.5 188.6 484.3 182.6C489.6 198.1 493.2 214.2 495.2 230.4C473.1 238.5 450.6 238.7 429.2 231.1L429.2 231.1z"],scribd:[384,512,[],"f28a","M42.3 252.7c-16.1-19-24.7-45.9-24.8-79.9 0-100.4 75.2-153.1 167.2-153.1 98.6-1.6 156.8 49 184.3 70.6l-50.5 72.1-37.3-24.6 26.9-38.6c-36.5-24-79.4-36.5-123-35.8-50.7-.8-111.7 27.2-111.7 76.2 0 18.7 11.2 20.7 28.6 15.6 23.3-5.3 41.9 .6 55.8 14 26.4 24.3 23.2 67.6-.7 91.9-29.2 29.5-85.2 27.3-114.8-8.4zm317.7 5.9c-15.5-18.8-38.9-29.4-63.2-28.6-38.1-2-71.1 28-70.5 67.2-.7 16.8 6 33 18.4 44.3 14.1 13.9 33 19.7 56.3 14.4 17.4-5.1 28.6-3.1 28.6 15.6 0 4.3-.5 8.5-1.4 12.7-16.7 40.9-59.5 64.4-121.4 64.4-51.9 .2-102.4-16.4-144.1-47.3l33.7-39.4-35.6-27.4L0 406.3l15.4 13.8c52.5 46.8 120.4 72.5 190.7 72.2 51.4 0 94.4-10.5 133.6-44.1 57.1-51.4 54.2-149.2 20.3-189.6z"],searchengin:[460,512,[],"f3eb","M220.6 130.3l-67.2 28.2V43.2L98.7 233.5l54.7-24.2v130.3l67.2-209.3zm-83.2-96.7l-1.3 4.7-15.2 52.9C80.6 106.7 52 145.8 52 191.5c0 52.3 34.3 95.9 83.4 105.5v53.6C57.5 340.1 0 272.4 0 191.6c0-80.5 59.8-147.2 137.4-158zm311.4 447.2c-11.2 11.2-23.1 12.3-28.6 10.5-5.4-1.8-27.1-19.9-60.4-44.4-33.3-24.6-33.6-35.7-43-56.7-9.4-20.9-30.4-42.6-57.5-52.4l-9.7-14.7c-24.7 16.9-53 26.9-81.3 28.7l2.1-6.6 15.9-49.5c46.5-11.9 80.9-54 80.9-104.2 0-54.5-38.4-102.1-96-107.1V32.3C254.4 37.4 320 106.8 320 191.6c0 33.6-11.2 64.7-29 90.4l14.6 9.6c9.8 27.1 31.5 48 52.4 57.4s32.2 9.7 56.8 43c24.6 33.2 42.7 54.9 44.5 60.3s.7 17.3-10.5 28.5zm-9.9-17.9c0-4.4-3.6-8-8-8s-8 3.6-8 8 3.6 8 8 8 8-3.6 8-8z"],sellcast:[448,512,[],"f2da","M353.4 32H94.7C42.6 32 0 74.6 0 126.6v258.7C0 437.4 42.6 480 94.7 480h258.7c52.1 0 94.7-42.6 94.7-94.6V126.6c0-52-42.6-94.6-94.7-94.6zm-50 316.4c-27.9 48.2-89.9 64.9-138.2 37.2-22.9 39.8-54.9 8.6-42.3-13.2l15.7-27.2c5.9-10.3 19.2-13.9 29.5-7.9 18.6 10.8-.1-.1 18.5 10.7 27.6 15.9 63.4 6.3 79.4-21.3 15.9-27.6 6.3-63.4-21.3-79.4-17.8-10.2-.6-.4-18.6-10.6-24.6-14.2-3.4-51.9 21.6-37.5 18.6 10.8-.1-.1 18.5 10.7 48.4 28 65.1 90.3 37.2 138.5zm21.8-208.8c-17 29.5-16.3 28.8-19 31.5-6.5 6.5-16.3 8.7-26.5 3.6-18.6-10.8 .1 .1-18.5-10.7-27.6-15.9-63.4-6.3-79.4 21.3s-6.3 63.4 21.3 79.4c0 0 18.5 10.6 18.6 10.6 24.6 14.2 3.4 51.9-21.6 37.5-18.6-10.8 .1 .1-18.5-10.7-48.2-27.8-64.9-90.1-37.1-138.4 27.9-48.2 89.9-64.9 138.2-37.2l4.8-8.4c14.3-24.9 52-3.3 37.7 21.5z"],sellsy:[640,512,[],"f213","M539.7 237.3c3.064-12.26 4.29-24.82 4.29-37.38C544 107.4 468.6 32 376.1 32c-77.22 0-144.6 53.01-163 127.8-15.32-13.18-34.93-20.53-55.16-20.53-46.27 0-83.96 37.69-83.96 83.96 0 7.354 .92 15.02 3.065 22.37-42.9 20.23-70.79 63.74-70.79 111.2C6.216 424.8 61.68 480 129.4 480h381.2c67.72 0 123.2-55.16 123.2-123.2 .001-56.38-38.92-106-94.07-119.5zM199.9 401.6c0 8.274-7.048 15.32-15.32 15.32H153.6c-8.274 0-15.32-7.048-15.32-15.32V290.6c0-8.273 7.048-15.32 15.32-15.32h30.95c8.274 0 15.32 7.048 15.32 15.32v110.9zm89.48 0c0 8.274-7.048 15.32-15.32 15.32h-30.95c-8.274 0-15.32-7.048-15.32-15.32V270.1c0-8.274 7.048-15.32 15.32-15.32h30.95c8.274 0 15.32 7.048 15.32 15.32v131.5zm89.48 0c0 8.274-7.047 15.32-15.32 15.32h-30.95c-8.274 0-15.32-7.048-15.32-15.32V238.8c0-8.274 7.048-15.32 15.32-15.32h30.95c8.274 0 15.32 7.048 15.32 15.32v162.7zm87.03 0c0 8.274-7.048 15.32-15.32 15.32h-28.5c-8.274 0-15.32-7.048-15.32-15.32V176.9c0-8.579 7.047-15.63 15.32-15.63h28.5c8.274 0 15.32 7.048 15.32 15.63v224.6z"],servicestack:[496,512,[],"f3ec","M88 216c81.7 10.2 273.7 102.3 304 232H0c99.5-8.1 184.5-137 88-232zm32-152c32.3 35.6 47.7 83.9 46.4 133.6C249.3 231.3 373.7 321.3 400 448h96C455.3 231.9 222.8 79.5 120 64z"],shirtsinbulk:[448,512,[],"f214","M100 410.3l30.6 13.4 4.4-9.9-30.6-13.4zm39.4 17.5l30.6 13.4 4.4-9.9-30.6-13.4zm172.1-14l4.4 9.9 30.6-13.4-4.4-9.9zM179.1 445l30.3 13.7 4.4-9.9-30.3-13.4zM60.4 392.8L91 406.2l4.4-9.6-30.6-13.7zm211.4 38.5l4.4 9.9 30.6-13.4-4.4-9.9zm-39.3 17.5l4.4 9.9 30.6-13.7-4.4-9.6zm118.4-52.2l4.4 9.6 30.6-13.4-4.4-9.9zM170 46.6h-33.5v10.5H170zm-47.2 0H89.2v10.5h33.5zm-47.3 0H42.3v10.5h33.3zm141.5 0h-33.2v10.5H217zm94.5 0H278v10.5h33.5zm47.3 0h-33.5v10.5h33.5zm-94.6 0H231v10.5h33.2zm141.5 0h-33.3v10.5h33.3zM52.8 351.1H42v33.5h10.8zm70-215.9H89.2v10.5h33.5zm-70 10.6h22.8v-10.5H42v33.5h10.8zm168.9 228.6c50.5 0 91.3-40.8 91.3-91.3 0-50.2-40.8-91.3-91.3-91.3-50.2 0-91.3 41.1-91.3 91.3 0 50.5 41.1 91.3 91.3 91.3zm-48.2-111.1c0-25.4 29.5-31.8 49.6-31.8 16.9 0 29.2 5.8 44.3 12l-8.8 16.9h-.9c-6.4-9.9-24.8-13.1-35.6-13.1-9 0-29.8 1.8-29.8 14.9 0 21.6 78.5-10.2 78.5 37.9 0 25.4-31.5 31.2-51 31.2-18.1 0-32.4-2.9-47.2-12.2l9-18.4h.9c6.1 12.2 23.6 14.9 35.9 14.9 8.7 0 32.7-1.2 32.7-14.3 0-26.1-77.6 6.3-77.6-38zM52.8 178.4H42V212h10.8zm342.4 206.2H406v-33.5h-10.8zM52.8 307.9H42v33.5h10.8zM0 3.7v406l221.7 98.6L448 409.7V3.7zm418.8 387.1L222 476.5 29.2 390.8V120.7h389.7v270.1zm0-299.3H29.2V32.9h389.7v58.6zm-366 130.1H42v33.5h10.8zm0 43.2H42v33.5h10.8zM170 135.2h-33.5v10.5H170zm225.2 163.1H406v-33.5h-10.8zm0-43.2H406v-33.5h-10.8zM217 135.2h-33.2v10.5H217zM395.2 212H406v-33.5h-10.8zm0 129.5H406V308h-10.8zm-131-206.3H231v10.5h33.2zm47.3 0H278v10.5h33.5zm83.7 33.6H406v-33.5h-33.5v10.5h22.8zm-36.4-33.6h-33.5v10.5h33.5z"],shopify:[448,512,[],"e057","M388.3 104.1a4.66 4.66 0 0 0 -4.4-4c-2 0-37.23-.8-37.23-.8s-21.61-20.82-29.62-28.83V503.2L442.8 472S388.7 106.5 388.3 104.1zM288.6 70.47a116.7 116.7 0 0 0 -7.21-17.61C271 32.85 255.4 22 237 22a15 15 0 0 0 -4 .4c-.4-.8-1.2-1.2-1.6-2C223.4 11.63 213 7.63 200.6 8c-24 .8-48 18-67.25 48.83-13.61 21.62-24 48.84-26.82 70.06-27.62 8.4-46.83 14.41-47.23 14.81-14 4.4-14.41 4.8-16 18-1.2 10-38 291.8-38 291.8L307.9 504V65.67a41.66 41.66 0 0 0 -4.4 .4S297.9 67.67 288.6 70.47zM233.4 87.69c-16 4.8-33.63 10.4-50.84 15.61 4.8-18.82 14.41-37.63 25.62-50 4.4-4.4 10.41-9.61 17.21-12.81C232.2 54.86 233.8 74.48 233.4 87.69zM200.6 24.44A27.49 27.49 0 0 1 215 28c-6.4 3.2-12.81 8.41-18.81 14.41-15.21 16.42-26.82 42-31.62 66.45-14.42 4.41-28.83 8.81-42 12.81C131.3 83.28 163.8 25.24 200.6 24.44zM154.1 244.6c1.6 25.61 69.25 31.22 73.25 91.66 2.8 47.64-25.22 80.06-65.65 82.47-48.83 3.2-75.65-25.62-75.65-25.62l10.4-44s26.82 20.42 48.44 18.82c14-.8 19.22-12.41 18.81-20.42-2-33.62-57.24-31.62-60.84-86.86-3.2-46.44 27.22-93.27 94.47-97.68 26-1.6 39.23 4.81 39.23 4.81L221.4 225.4s-17.21-8-37.63-6.4C154.1 221 153.8 239.8 154.1 244.6zM249.4 82.88c0-12-1.6-29.22-7.21-43.63 18.42 3.6 27.22 24 31.23 36.43Q262.6 78.68 249.4 82.88z"],shopware:[512,512,[],"f5b5","M403.5 455.4A246.2 246.2 0 0 1 256 504C118.8 504 8 393 8 256 8 118.8 119 8 256 8a247.4 247.4 0 0 1 165.7 63.5 3.57 3.57 0 0 1 -2.86 6.18A418.6 418.6 0 0 0 362.1 74c-129.4 0-222.4 53.47-222.4 155.4 0 109 92.13 145.9 176.8 178.7 33.64 13 65.4 25.36 87 41.59a3.58 3.58 0 0 1 0 5.72zM503 233.1a3.64 3.64 0 0 0 -1.27-2.44c-51.76-43-93.62-60.48-144.5-60.48-84.13 0-80.25 52.17-80.25 53.63 0 42.6 52.06 62 112.3 84.49 31.07 11.59 63.19 23.57 92.68 39.93a3.57 3.57 0 0 0 5-1.82A249 249 0 0 0 503 233.1z"],simplybuilt:[512,512,[],"f215","M481.2 64h-106c-14.5 0-26.6 11.8-26.6 26.3v39.6H163.3V90.3c0-14.5-12-26.3-26.6-26.3h-106C16.1 64 4.3 75.8 4.3 90.3v331.4c0 14.5 11.8 26.3 26.6 26.3h450.4c14.8 0 26.6-11.8 26.6-26.3V90.3c-.2-14.5-12-26.3-26.7-26.3zM149.8 355.8c-36.6 0-66.4-29.7-66.4-66.4 0-36.9 29.7-66.6 66.4-66.6 36.9 0 66.6 29.7 66.6 66.6 0 36.7-29.7 66.4-66.6 66.4zm212.4 0c-36.9 0-66.6-29.7-66.6-66.6 0-36.6 29.7-66.4 66.6-66.4 36.6 0 66.4 29.7 66.4 66.4 0 36.9-29.8 66.6-66.4 66.6z"],sistrix:[448,512,[],"f3ee","M448 449L301.2 300.2c20-27.9 31.9-62.2 31.9-99.2 0-93.1-74.7-168.9-166.5-168.9C74.7 32 0 107.8 0 200.9s74.7 168.9 166.5 168.9c39.8 0 76.3-14.2 105-37.9l146 148.1 30.5-31zM166.5 330.8c-70.6 0-128.1-58.3-128.1-129.9S95.9 71 166.5 71s128.1 58.3 128.1 129.9-57.4 129.9-128.1 129.9z"],sith:[448,512,[],"f512","M0 32l69.71 118.8-58.86-11.52 69.84 91.03a146.7 146.7 0 0 0 0 51.45l-69.84 91.03 58.86-11.52L0 480l118.8-69.71-11.52 58.86 91.03-69.84c17.02 3.04 34.47 3.04 51.48 0l91.03 69.84-11.52-58.86L448 480l-69.71-118.8 58.86 11.52-69.84-91.03c3.03-17.01 3.04-34.44 0-51.45l69.84-91.03-58.86 11.52L448 32l-118.8 69.71 11.52-58.9-91.06 69.87c-8.5-1.52-17.1-2.29-25.71-2.29s-17.21 .78-25.71 2.29l-91.06-69.87 11.52 58.9L0 32zm224 99.78c31.8 0 63.6 12.12 87.85 36.37 48.5 48.5 48.49 127.2 0 175.7s-127.2 48.46-175.7-.03c-48.5-48.5-48.49-127.2 0-175.7 24.24-24.25 56.05-36.34 87.85-36.34zm0 36.66c-22.42 0-44.83 8.52-61.92 25.61-34.18 34.18-34.19 89.68 0 123.9s89.65 34.18 123.8 0c34.18-34.18 34.19-89.68 0-123.9-17.09-17.09-39.5-25.61-61.92-25.61z"],sitrox:[448,512,[],"e44a","M212.4 .0085V0H448V128H64C64 57.6 141.8 .4753 212.4 .0085zM237.3 192V192C307.1 192.5 384 249.6 384 320H210.8V319.1C140.9 319.6 64 262.4 64 192H237.3zM235.6 511.1C306.3 511.5 384 454.4 384 384H0V512H235.6V511.1z"],sketch:[512,512,[],"f7c6","M27.5 162.2L9 187.1h90.5l6.9-130.7-78.9 105.8zM396.3 45.7L267.7 32l135.7 147.2-7.1-133.5zM112.2 218.3l-11.2-22H9.9L234.8 458zm2-31.2h284l-81.5-88.5L256.3 33zm297.3 9.1L277.6 458l224.8-261.7h-90.9zM415.4 69L406 56.4l.9 17.3 6.1 113.4h90.3zM113.5 93.5l-4.6 85.6L244.7 32 116.1 45.7zm287.7 102.7h-290l42.4 82.9L256.3 480l144.9-283.8z"],skyatlas:[640,512,[],"f216","M640 329.3c0 65.9-52.5 114.4-117.5 114.4-165.9 0-196.6-249.7-359.7-249.7-146.9 0-147.1 212.2 5.6 212.2 42.5 0 90.9-17.8 125.3-42.5 5.6-4.1 16.9-16.3 22.8-16.3s10.9 5 10.9 10.9c0 7.8-13.1 19.1-18.7 24.1-40.9 35.6-100.3 61.2-154.7 61.2-83.4 .1-154-59-154-144.9s67.5-149.1 152.8-149.1c185.3 0 222.5 245.9 361.9 245.9 99.9 0 94.8-139.7 3.4-139.7-17.5 0-35 11.6-46.9 11.6-8.4 0-15.9-7.2-15.9-15.6 0-11.6 5.3-23.7 5.3-36.3 0-66.6-50.9-114.7-116.9-114.7-53.1 0-80 36.9-88.8 36.9-6.2 0-11.2-5-11.2-11.2 0-5.6 4.1-10.3 7.8-14.4 25.3-28.8 64.7-43.7 102.8-43.7 79.4 0 139.1 58.4 139.1 137.8 0 6.9-.3 13.7-1.2 20.6 11.9-3.1 24.1-4.7 35.9-4.7 60.7 0 111.9 45.3 111.9 107.2z"],skype:[448,512,[],"f17e","M424.7 299.8c2.9-14 4.7-28.9 4.7-43.8 0-113.5-91.9-205.3-205.3-205.3-14.9 0-29.7 1.7-43.8 4.7C161.3 40.7 137.7 32 112 32 50.2 32 0 82.2 0 144c0 25.7 8.7 49.3 23.3 68.2-2.9 14-4.7 28.9-4.7 43.8 0 113.5 91.9 205.3 205.3 205.3 14.9 0 29.7-1.7 43.8-4.7 19 14.6 42.6 23.3 68.2 23.3 61.8 0 112-50.2 112-112 .1-25.6-8.6-49.2-23.2-68.1zm-194.6 91.5c-65.6 0-120.5-29.2-120.5-65 0-16 9-30.6 29.5-30.6 31.2 0 34.1 44.9 88.1 44.9 25.7 0 42.3-11.4 42.3-26.3 0-18.7-16-21.6-42-28-62.5-15.4-117.8-22-117.8-87.2 0-59.2 58.6-81.1 109.1-81.1 55.1 0 110.8 21.9 110.8 55.4 0 16.9-11.4 31.8-30.3 31.8-28.3 0-29.2-33.5-75-33.5-25.7 0-42 7-42 22.5 0 19.8 20.8 21.8 69.1 33 41.4 9.3 90.7 26.8 90.7 77.6 0 59.1-57.1 86.5-112 86.5z"],slack:[448,512,[62447,"slack-hash"],"f198","M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.8c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.1c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.1 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.1 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.9c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.8c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"],slideshare:[512,512,[],"f1e7","M187.7 153.7c-34 0-61.7 25.7-61.7 57.7 0 31.7 27.7 57.7 61.7 57.7s61.7-26 61.7-57.7c0-32-27.7-57.7-61.7-57.7zm143.4 0c-34 0-61.7 25.7-61.7 57.7 0 31.7 27.7 57.7 61.7 57.7 34.3 0 61.7-26 61.7-57.7 .1-32-27.4-57.7-61.7-57.7zm156.6 90l-6 4.3V49.7c0-27.4-20.6-49.7-46-49.7H76.6c-25.4 0-46 22.3-46 49.7V248c-2-1.4-4.3-2.9-6.3-4.3-15.1-10.6-25.1 4-16 17.7 18.3 22.6 53.1 50.3 106.3 72C58.3 525.1 252 555.7 248.9 457.5c0-.7 .3-56.6 .3-96.6 5.1 1.1 9.4 2.3 13.7 3.1 0 39.7 .3 92.8 .3 93.5-3.1 98.3 190.6 67.7 134.3-124 53.1-21.7 88-49.4 106.3-72 9.1-13.8-.9-28.3-16.1-17.8zm-30.5 19.2c-68.9 37.4-128.3 31.1-160.6 29.7-23.7-.9-32.6 9.1-33.7 24.9-10.3-7.7-18.6-15.5-20.3-17.1-5.1-5.4-13.7-8-27.1-7.7-31.7 1.1-89.7 7.4-157.4-28V72.3c0-34.9 8.9-45.7 40.6-45.7h317.7c30.3 0 40.9 12.9 40.9 45.7v190.6z"],snapchat:[512,512,[62124,"snapchat-ghost"],"f2ab","M496.9 366.6c-3.373-9.176-9.8-14.09-17.11-18.15-1.376-.806-2.641-1.451-3.72-1.947-2.182-1.128-4.414-2.22-6.634-3.373-22.8-12.09-40.61-27.34-52.96-45.42a102.9 102.9 0 0 1 -9.089-16.12c-1.054-3.013-1-4.724-.248-6.287a10.22 10.22 0 0 1 2.914-3.038c3.918-2.591 7.96-5.22 10.7-6.993 4.885-3.162 8.754-5.667 11.25-7.44 9.362-6.547 15.91-13.5 20-21.28a42.37 42.37 0 0 0 2.1-35.19c-6.2-16.32-21.61-26.45-40.29-26.45a55.54 55.54 0 0 0 -11.72 1.24c-1.029 .224-2.059 .459-3.063 .72 .174-11.16-.074-22.94-1.066-34.53-3.522-40.76-17.79-62.12-32.67-79.16A130.2 130.2 0 0 0 332.1 36.44C309.5 23.55 283.9 17 256 17S202.6 23.55 180 36.44a129.7 129.7 0 0 0 -33.28 26.78c-14.88 17.04-29.15 38.44-32.67 79.16-.992 11.59-1.24 23.43-1.079 34.53-1-.26-2.021-.5-3.051-.719a55.46 55.46 0 0 0 -11.72-1.24c-18.69 0-34.13 10.13-40.3 26.45a42.42 42.42 0 0 0 2.046 35.23c4.105 7.774 10.65 14.73 20.01 21.28 2.48 1.736 6.361 4.24 11.25 7.44 2.641 1.711 6.5 4.216 10.28 6.72a11.05 11.05 0 0 1 3.3 3.311c.794 1.624 .818 3.373-.36 6.6a102 102 0 0 1 -8.94 15.78c-12.08 17.67-29.36 32.65-51.43 44.64C32.35 348.6 20.2 352.8 15.07 366.7c-3.868 10.53-1.339 22.51 8.494 32.6a49.14 49.14 0 0 0 12.4 9.387 134.3 134.3 0 0 0 30.34 12.14 20.02 20.02 0 0 1 6.126 2.741c3.583 3.137 3.075 7.861 7.849 14.78a34.47 34.47 0 0 0 8.977 9.127c10.02 6.919 21.28 7.353 33.21 7.811 10.78 .41 22.99 .881 36.94 5.481 5.778 1.91 11.78 5.605 18.74 9.92C194.8 480.1 217.7 495 255.1 495s61.29-14.12 78.12-24.43c6.907-4.24 12.87-7.9 18.49-9.758 13.95-4.613 26.16-5.072 36.94-5.481 11.93-.459 23.19-.893 33.21-7.812a34.58 34.58 0 0 0 10.22-11.16c3.434-5.84 3.348-9.919 6.572-12.77a18.97 18.97 0 0 1 5.753-2.629A134.9 134.9 0 0 0 476 408.7a48.34 48.34 0 0 0 13.02-10.19l.124-.149C498.4 388.5 500.7 376.9 496.9 366.6zm-34.01 18.28c-20.75 11.46-34.53 10.23-45.26 17.14-9.114 5.865-3.72 18.51-10.34 23.08-8.134 5.617-32.18-.4-63.24 9.858-25.62 8.469-41.96 32.82-88.04 32.82s-62.04-24.3-88.08-32.88c-31-10.26-55.09-4.241-63.24-9.858-6.609-4.563-1.24-17.21-10.34-23.08-10.74-6.907-24.53-5.679-45.26-17.08-13.21-7.291-5.716-11.8-1.314-13.94 75.14-36.38 87.13-92.55 87.67-96.72 .645-5.046 1.364-9.014-4.191-14.15-5.369-4.96-29.19-19.7-35.8-24.32-10.94-7.638-15.75-15.26-12.2-24.64 2.48-6.485 8.531-8.928 14.88-8.928a27.64 27.64 0 0 1 5.965 .67c12 2.6 23.66 8.617 30.39 10.24a10.75 10.75 0 0 0 2.48 .335c3.6 0 4.86-1.811 4.612-5.927-.768-13.13-2.628-38.72-.558-62.64 2.84-32.91 13.44-49.22 26.04-63.64 6.051-6.932 34.48-36.98 88.86-36.98s82.88 29.92 88.93 36.83c12.61 14.42 23.23 30.73 26.04 63.64 2.071 23.92 .285 49.53-.558 62.64-.285 4.327 1.017 5.927 4.613 5.927a10.65 10.65 0 0 0 2.48-.335c6.745-1.624 18.4-7.638 30.4-10.24a27.64 27.64 0 0 1 5.964-.67c6.386 0 12.4 2.48 14.88 8.928 3.546 9.374-1.24 17-12.19 24.64-6.609 4.612-30.43 19.34-35.8 24.32-5.568 5.134-4.836 9.1-4.191 14.15 .533 4.228 12.51 60.4 87.67 96.72C468.6 373 476.1 377.5 462.9 384.9z"],soundcloud:[640,512,[],"f1be","M111.4 256.3l5.8 65-5.8 68.3c-.3 2.5-2.2 4.4-4.4 4.4s-4.2-1.9-4.2-4.4l-5.6-68.3 5.6-65c0-2.2 1.9-4.2 4.2-4.2 2.2 0 4.1 2 4.4 4.2zm21.4-45.6c-2.8 0-4.7 2.2-5 5l-5 105.6 5 68.3c.3 2.8 2.2 5 5 5 2.5 0 4.7-2.2 4.7-5l5.8-68.3-5.8-105.6c0-2.8-2.2-5-4.7-5zm25.5-24.1c-3.1 0-5.3 2.2-5.6 5.3l-4.4 130 4.4 67.8c.3 3.1 2.5 5.3 5.6 5.3 2.8 0 5.3-2.2 5.3-5.3l5.3-67.8-5.3-130c0-3.1-2.5-5.3-5.3-5.3zM7.2 283.2c-1.4 0-2.2 1.1-2.5 2.5L0 321.3l4.7 35c.3 1.4 1.1 2.5 2.5 2.5s2.2-1.1 2.5-2.5l5.6-35-5.6-35.6c-.3-1.4-1.1-2.5-2.5-2.5zm23.6-21.9c-1.4 0-2.5 1.1-2.5 2.5l-6.4 57.5 6.4 56.1c0 1.7 1.1 2.8 2.5 2.8s2.5-1.1 2.8-2.5l7.2-56.4-7.2-57.5c-.3-1.4-1.4-2.5-2.8-2.5zm25.3-11.4c-1.7 0-3.1 1.4-3.3 3.3L47 321.3l5.8 65.8c.3 1.7 1.7 3.1 3.3 3.1 1.7 0 3.1-1.4 3.1-3.1l6.9-65.8-6.9-68.1c0-1.9-1.4-3.3-3.1-3.3zm25.3-2.2c-1.9 0-3.6 1.4-3.6 3.6l-5.8 70 5.8 67.8c0 2.2 1.7 3.6 3.6 3.6s3.6-1.4 3.9-3.6l6.4-67.8-6.4-70c-.3-2.2-2-3.6-3.9-3.6zm241.4-110.9c-1.1-.8-2.8-1.4-4.2-1.4-2.2 0-4.2 .8-5.6 1.9-1.9 1.7-3.1 4.2-3.3 6.7v.8l-3.3 176.7 1.7 32.5 1.7 31.7c.3 4.7 4.2 8.6 8.9 8.6s8.6-3.9 8.6-8.6l3.9-64.2-3.9-177.5c-.4-3-2-5.8-4.5-7.2zm-26.7 15.3c-1.4-.8-2.8-1.4-4.4-1.4s-3.1 .6-4.4 1.4c-2.2 1.4-3.6 3.9-3.6 6.7l-.3 1.7-2.8 160.8s0 .3 3.1 65.6v.3c0 1.7 .6 3.3 1.7 4.7 1.7 1.9 3.9 3.1 6.4 3.1 2.2 0 4.2-1.1 5.6-2.5 1.7-1.4 2.5-3.3 2.5-5.6l.3-6.7 3.1-58.6-3.3-162.8c-.3-2.8-1.7-5.3-3.9-6.7zm-111.4 22.5c-3.1 0-5.8 2.8-5.8 6.1l-4.4 140.6 4.4 67.2c.3 3.3 2.8 5.8 5.8 5.8 3.3 0 5.8-2.5 6.1-5.8l5-67.2-5-140.6c-.2-3.3-2.7-6.1-6.1-6.1zm376.7 62.8c-10.8 0-21.1 2.2-30.6 6.1-6.4-70.8-65.8-126.4-138.3-126.4-17.8 0-35 3.3-50.3 9.4-6.1 2.2-7.8 4.4-7.8 9.2v249.7c0 5 3.9 8.6 8.6 9.2h218.3c43.3 0 78.6-35 78.6-78.3 .1-43.6-35.2-78.9-78.5-78.9zm-296.7-60.3c-4.2 0-7.5 3.3-7.8 7.8l-3.3 136.7 3.3 65.6c.3 4.2 3.6 7.5 7.8 7.5 4.2 0 7.5-3.3 7.5-7.5l3.9-65.6-3.9-136.7c-.3-4.5-3.3-7.8-7.5-7.8zm-53.6-7.8c-3.3 0-6.4 3.1-6.4 6.7l-3.9 145.3 3.9 66.9c.3 3.6 3.1 6.4 6.4 6.4 3.6 0 6.4-2.8 6.7-6.4l4.4-66.9-4.4-145.3c-.3-3.6-3.1-6.7-6.7-6.7zm26.7 3.4c-3.9 0-6.9 3.1-6.9 6.9L227 321.3l3.9 66.4c.3 3.9 3.1 6.9 6.9 6.9s6.9-3.1 6.9-6.9l4.2-66.4-4.2-141.7c0-3.9-3-6.9-6.9-6.9z"],sourcetree:[448,512,[],"f7d3","M427.2 203c0-112.1-90.9-203-203-203C112.1-.2 21.2 90.6 21 202.6A202.9 202.9 0 0 0 161.5 396v101.7a14.3 14.3 0 0 0 14.3 14.3h96.4a14.3 14.3 0 0 0 14.3-14.3V396.1A203.2 203.2 0 0 0 427.2 203zm-271.6 0c0-90.8 137.3-90.8 137.3 0-.1 89.9-137.3 91-137.3 0z"],"space-awesome":[512,512,[],"e5ac","M96 256H128V512H0V352H32V320H64V288H96V256zM512 352V512H384V256H416V288H448V320H480V352H512zM320 64H352V448H320V416H192V448H160V64H192V32H224V0H288V32H320V64zM288 128H224V192H288V128z"],speakap:[448,512,[],"f3f3","M64 391.8C-15.41 303.6-8 167.4 80.64 87.64s224.8-73 304.2 15.24 72 224.4-16.64 304.1c-18.74 16.87 64 43.09 42 52.26-82.06 34.21-253.9 35-346.2-67.5zm213.3-211.6l38.5-40.86c-9.61-8.89-32-26.83-76.17-27.6-52.33-.91-95.86 28.3-96.77 80-.2 11.33 .29 36.72 29.42 54.83 34.46 21.42 86.52 21.51 86 52.26-.37 21.28-26.42 25.81-38.59 25.6-3-.05-30.23-.46-47.61-24.62l-40 42.61c28.16 27 59 32.62 83.49 33.05 10.23 .18 96.42 .33 97.84-81 .28-15.81-2.07-39.72-28.86-56.59-34.36-21.64-85-19.45-84.43-49.75 .41-23.25 31-25.37 37.53-25.26 .43 0 26.62 .26 39.62 17.37z"],"speaker-deck":[512,512,[],"f83c","M213.9 296H100a100 100 0 0 1 0-200h132.8a40 40 0 0 1 0 80H98c-26.47 0-26.45 40 0 40h113.8a100 100 0 0 1 0 200H40a40 40 0 0 1 0-80h173.9c26.48 0 26.46-40 0-40zM298 416a120.2 120.2 0 0 0 51.11-80h64.55a19.83 19.83 0 0 0 19.66-20V196a19.83 19.83 0 0 0 -19.66-20H296.4a60.77 60.77 0 0 0 0-80h136.9c43.44 0 78.65 35.82 78.65 80v160c0 44.18-35.21 80-78.65 80z"],spotify:[496,512,[],"f1bc","M248 8C111.1 8 0 119.1 0 256s111.1 248 248 248 248-111.1 248-248S384.9 8 248 8zm100.7 364.9c-4.2 0-6.8-1.3-10.7-3.6-62.4-37.6-135-39.2-206.7-24.5-3.9 1-9 2.6-11.9 2.6-9.7 0-15.8-7.7-15.8-15.8 0-10.3 6.1-15.2 13.6-16.8 81.9-18.1 165.6-16.5 237 26.2 6.1 3.9 9.7 7.4 9.7 16.5s-7.1 15.4-15.2 15.4zm26.9-65.6c-5.2 0-8.7-2.3-12.3-4.2-62.5-37-155.7-51.9-238.6-29.4-4.8 1.3-7.4 2.6-11.9 2.6-10.7 0-19.4-8.7-19.4-19.4s5.2-17.8 15.5-20.7c27.8-7.8 56.2-13.6 97.8-13.6 64.9 0 127.6 16.1 177 45.5 8.1 4.8 11.3 11 11.3 19.7-.1 10.8-8.5 19.5-19.4 19.5zm31-76.2c-5.2 0-8.4-1.3-12.9-3.9-71.2-42.5-198.5-52.7-280.9-29.7-3.6 1-8.1 2.6-12.9 2.6-13.2 0-23.3-10.3-23.3-23.6 0-13.6 8.4-21.3 17.4-23.9 35.2-10.3 74.6-15.2 117.5-15.2 73 0 149.5 15.2 205.4 47.8 7.8 4.5 12.9 10.7 12.9 22.6 0 13.6-11 23.3-23.2 23.3z"],"square-behance":[448,512,["behance-square"],"f1b5","M186.5 293c0 19.3-14 25.4-31.2 25.4h-45.1v-52.9h46c18.6 .1 30.3 7.8 30.3 27.5zm-7.7-82.3c0-17.7-13.7-21.9-28.9-21.9h-39.6v44.8H153c15.1 0 25.8-6.6 25.8-22.9zm132.3 23.2c-18.3 0-30.5 11.4-31.7 29.7h62.2c-1.7-18.5-11.3-29.7-30.5-29.7zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zM271.7 185h77.8v-18.9h-77.8V185zm-43 110.3c0-24.1-11.4-44.9-35-51.6 17.2-8.2 26.2-17.7 26.2-37 0-38.2-28.5-47.5-61.4-47.5H68v192h93.1c34.9-.2 67.6-16.9 67.6-55.9zM380 280.5c0-41.1-24.1-75.4-67.6-75.4-42.4 0-71.1 31.8-71.1 73.6 0 43.3 27.3 73 71.1 73 33.2 0 54.7-14.9 65.1-46.8h-33.7c-3.7 11.9-18.6 18.1-30.2 18.1-22.4 0-34.1-13.1-34.1-35.3h100.2c.1-2.3 .3-4.8 .3-7.2z"],"square-dribbble":[448,512,["dribbble-square"],"f397","M90.2 228.2c8.9-42.4 37.4-77.7 75.7-95.7 3.6 4.9 28 38.8 50.7 79-64 17-120.3 16.8-126.4 16.7zM314.6 154c-33.6-29.8-79.3-41.1-122.6-30.6 3.8 5.1 28.6 38.9 51 80 48.6-18.3 69.1-45.9 71.6-49.4zM140.1 364c40.5 31.6 93.3 36.7 137.3 18-2-12-10-53.8-29.2-103.6-55.1 18.8-93.8 56.4-108.1 85.6zm98.8-108.2c-3.4-7.8-7.2-15.5-11.1-23.2C159.6 253 93.4 252.2 87.4 252c0 1.4-.1 2.8-.1 4.2 0 35.1 13.3 67.1 35.1 91.4 22.2-37.9 67.1-77.9 116.5-91.8zm34.9 16.3c17.9 49.1 25.1 89.1 26.5 97.4 30.7-20.7 52.5-53.6 58.6-91.6-4.6-1.5-42.3-12.7-85.1-5.8zm-20.3-48.4c4.8 9.8 8.3 17.8 12 26.8 45.5-5.7 90.7 3.4 95.2 4.4-.3-32.3-11.8-61.9-30.9-85.1-2.9 3.9-25.8 33.2-76.3 53.9zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-64 176c0-88.2-71.8-160-160-160S64 167.8 64 256s71.8 160 160 160 160-71.8 160-160z"],"square-facebook":[448,512,["facebook-square"],"f082","M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.3V327.7h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0 -48-48z"],"square-font-awesome":[448,512,[],"e5ad","M384.5 32.5h-320c-35.3 0-64 28.7-64 64v320c0 35.3 28.7 64 64 64h320c35.3 0 64-28.7 64-64v-320C448.5 61.2 419.8 32.5 384.5 32.5zM336.5 312.5c-31.6 11.2-41.2 16-59.8 16c-31.4 0-43.2-16-74.6-16c-10.2 0-18.2 1.6-25.6 4v-32c7.4-2.2 15.4-4 25.6-4c31.2 0 43.2 16 74.6 16c10.2 0 17.8-1.4 27.8-4.6v-96c-10 3.2-17.6 4.6-27.8 4.6c-31.4 0-43.2-16-74.6-16c-25.4 0-37.4 10.4-57.6 14.4v153.6c0 8.8-7.2 16-16 16c-8.8 0-16-7.2-16-16v-192c0-8.8 7.2-16 16-16c8.8 0 16 7.2 16 16v6.4c20.2-4 32.2-14.4 57.6-14.4c31.2 0 43.2 16 74.6 16c18.6 0 28.2-4.8 59.8-16V312.5z"],"square-font-awesome-stroke":[448,512,["font-awesome-alt"],"f35c","M201.6 152c-25.4 0-37.4 10.4-57.6 14.4V160c0-8.8-7.2-16-16-16s-16 7.2-16 16v192c0 .8 .1 1.6 .2 2.4c.1 .4 .1 .8 .2 1.2c1.6 7.1 8 12.4 15.6 12.4s14-5.3 15.6-12.4c.1-.4 .2-.8 .2-1.2c.1-.8 .2-1.6 .2-2.4V198.4c4-.8 7.7-1.8 11.2-3c14.3-4.7 26-11.4 46.4-11.4c31.4 0 43.2 16 74.6 16c8.9 0 15.9-1.1 24.2-3.5c1.2-.3 2.4-.7 3.6-1.1v96c-10 3.2-17.6 4.6-27.8 4.6c-31.4 0-43.4-16-74.6-16c-10.2 0-18.2 1.8-25.6 4v32c7.4-2.4 15.4-4 25.6-4c31.4 0 43.2 16 74.6 16c18.6 0 28.2-4.8 59.8-16V152c-31.6 11.2-41.2 16-59.8 16C244.8 168 232.8 152 201.6 152zM384 32H64C28.7 32 0 60.7 0 96v320c0 35.3 28.7 64 64 64h320c35.3 0 64-28.7 64-64V96C448 60.7 419.3 32 384 32zM416 416c0 17.6-14.4 32-32 32H64c-17.6 0-32-14.4-32-32V96c0-17.6 14.4-32 32-32h320c17.6 0 32 14.4 32 32V416z"],"square-git":[448,512,["git-square"],"f1d2","M100.6 334.2c48.57 3.31 58.95 2.11 58.95 11.94 0 20-65.55 20.06-65.55 1.52 .01-5.09 3.29-9.4 6.6-13.46zm27.95-116.6c-32.29 0-33.75 44.47-.75 44.47 32.51 0 31.71-44.47 .75-44.47zM448 80v352a48 48 0 0 1 -48 48H48a48 48 0 0 1 -48-48V80a48 48 0 0 1 48-48h352a48 48 0 0 1 48 48zm-227 69.31c0 14.49 8.38 22.88 22.86 22.88 14.74 0 23.13-8.39 23.13-22.88S258.6 127 243.9 127c-14.48 0-22.88 7.84-22.88 22.31zM199.2 195h-49.55c-25-6.55-81.56-4.85-81.56 46.75 0 18.8 9.4 32 21.85 38.11C74.23 294.2 66.8 301 66.8 310.6c0 6.87 2.79 13.22 11.18 16.76-8.9 8.4-14 14.48-14 25.92C64 373.4 81.53 385 127.5 385c44.22 0 69.87-16.51 69.87-45.73 0-36.67-28.23-35.32-94.77-39.38l8.38-13.43c17 4.74 74.19 6.23 74.19-42.43 0-11.69-4.83-19.82-9.4-25.67l23.38-1.78zm84.34 109.8l-13-1.78c-3.82-.51-4.07-1-4.07-5.09V192.5h-52.6l-2.79 20.57c15.75 5.55 17 4.86 17 10.17V298c0 5.62-.31 4.58-17 6.87v20.06h72.42zM384 315l-6.87-22.37c-40.93 15.37-37.85-12.41-37.85-16.73v-60.72h37.85v-25.41h-35.82c-2.87 0-2 2.52-2-38.63h-24.18c-2.79 27.7-11.68 38.88-34 41.42v22.62c20.47 0 19.82-.85 19.82 2.54v66.57c0 28.72 11.43 40.91 41.67 40.91 14.45 0 30.45-4.83 41.38-10.2z"],"square-github":[448,512,["github-square"],"f092","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM277.3 415.7c-8.4 1.5-11.5-3.7-11.5-8 0-5.4 .2-33 .2-55.3 0-15.6-5.2-25.5-11.3-30.7 37-4.1 76-9.2 76-73.1 0-18.2-6.5-27.3-17.1-39 1.7-4.3 7.4-22-1.7-45-13.9-4.3-45.7 17.9-45.7 17.9-13.2-3.7-27.5-5.6-41.6-5.6-14.1 0-28.4 1.9-41.6 5.6 0 0-31.8-22.2-45.7-17.9-9.1 22.9-3.5 40.6-1.7 45-10.6 11.7-15.6 20.8-15.6 39 0 63.6 37.3 69 74.3 73.1-4.8 4.3-9.1 11.7-10.6 22.3-9.5 4.3-33.8 11.7-48.3-13.9-9.1-15.8-25.5-17.1-25.5-17.1-16.2-.2-1.1 10.2-1.1 10.2 10.8 5 18.4 24.2 18.4 24.2 9.7 29.7 56.1 19.7 56.1 19.7 0 13.9 .2 36.5 .2 40.6 0 4.3-3 9.5-11.5 8-66-22.1-112.2-84.9-112.2-158.3 0-91.8 70.2-161.5 162-161.5S388 165.6 388 257.4c.1 73.4-44.7 136.3-110.7 158.3zm-98.1-61.1c-1.9 .4-3.7-.4-3.9-1.7-.2-1.5 1.1-2.8 3-3.2 1.9-.2 3.7 .6 3.9 1.9 .3 1.3-1 2.6-3 3zm-9.5-.9c0 1.3-1.5 2.4-3.5 2.4-2.2 .2-3.7-.9-3.7-2.4 0-1.3 1.5-2.4 3.5-2.4 1.9-.2 3.7 .9 3.7 2.4zm-13.7-1.1c-.4 1.3-2.4 1.9-4.1 1.3-1.9-.4-3.2-1.9-2.8-3.2 .4-1.3 2.4-1.9 4.1-1.5 2 .6 3.3 2.1 2.8 3.4zm-12.3-5.4c-.9 1.1-2.8 .9-4.3-.6-1.5-1.3-1.9-3.2-.9-4.1 .9-1.1 2.8-.9 4.3 .6 1.3 1.3 1.8 3.3 .9 4.1zm-9.1-9.1c-.9 .6-2.6 0-3.7-1.5s-1.1-3.2 0-3.9c1.1-.9 2.8-.2 3.7 1.3 1.1 1.5 1.1 3.3 0 4.1zm-6.5-9.7c-.9 .9-2.4 .4-3.5-.6-1.1-1.3-1.3-2.8-.4-3.5 .9-.9 2.4-.4 3.5 .6 1.1 1.3 1.3 2.8 .4 3.5zm-6.7-7.4c-.4 .9-1.7 1.1-2.8 .4-1.3-.6-1.9-1.7-1.5-2.6 .4-.6 1.5-.9 2.8-.4 1.3 .7 1.9 1.8 1.5 2.6z"],"square-gitlab":[448,512,["gitlab-square"],"e5ae","M48 32H400C426.5 32 448 53.5 448 80V432C448 458.5 426.5 480 400 480H48C21.5 480 0 458.5 0 432V80C0 53.5 21.5 32 48 32zM382.1 224.9L337.5 108.5C336.6 106.2 334.9 104.2 332.9 102.9C331.3 101.9 329.5 101.3 327.7 101.1C325.9 100.9 324 101.2 322.3 101.8C320.6 102.5 319 103.5 317.8 104.9C316.6 106.3 315.7 107.9 315.2 109.7L285 201.9H162.1L132.9 109.7C132.4 107.9 131.4 106.3 130.2 104.9C128.1 103.6 127.4 102.5 125.7 101.9C123.1 101.2 122.1 100.1 120.3 101.1C118.5 101.3 116.7 101.9 115.1 102.9C113.1 104.2 111.5 106.2 110.6 108.5L65.94 224.9L65.47 226.1C59.05 242.9 58.26 261.3 63.22 278.6C68.18 295.9 78.62 311.1 92.97 321.9L93.14 322L93.52 322.3L161.4 373.2L215.6 414.1C217.1 415.1 220.9 416.9 223.9 416.9C226.9 416.9 229.9 415.1 232.3 414.1L286.4 373.2L354.8 322L355 321.9C369.4 311 379.8 295.8 384.8 278.6C389.7 261.3 388.1 242.9 382.5 226.1L382.1 224.9z"],"square-google-plus":[448,512,["google-plus-square"],"f0d4","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM164 356c-55.3 0-100-44.7-100-100s44.7-100 100-100c27 0 49.5 9.8 67 26.2l-27.1 26.1c-7.4-7.1-20.3-15.4-39.8-15.4-34.1 0-61.9 28.2-61.9 63.2 0 34.9 27.8 63.2 61.9 63.2 39.6 0 54.4-28.5 56.8-43.1H164v-34.4h94.4c1 5 1.6 10.1 1.6 16.6 0 57.1-38.3 97.6-96 97.6zm220-81.8h-29v29h-29.2v-29h-29V245h29v-29H355v29h29v29.2z"],"square-hacker-news":[448,512,["hacker-news-square"],"f3af","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM21.2 229.2H21c.1-.1 .2-.3 .3-.4 0 .1 0 .3-.1 .4zm218 53.9V384h-31.4V281.3L128 128h37.3c52.5 98.3 49.2 101.2 59.3 125.6 12.3-27 5.8-24.4 60.6-125.6H320l-80.8 155.1z"],"square-instagram":[448,512,["instagram-square"],"e055","M224 202.7A53.34 53.34 0 1 0 277.4 256 53.38 53.38 0 0 0 224 202.7zm124.7-41a54 54 0 0 0 -30.41-30.41c-21-8.29-71-6.43-94.3-6.43s-73.25-1.93-94.31 6.43a54 54 0 0 0 -30.41 30.41c-8.28 21-6.43 71.05-6.43 94.33S91 329.3 99.32 350.3a54 54 0 0 0 30.41 30.41c21 8.29 71 6.43 94.31 6.43s73.24 1.93 94.3-6.43a54 54 0 0 0 30.41-30.41c8.35-21 6.43-71.05 6.43-94.33S357.1 182.7 348.8 161.7zM224 338a82 82 0 1 1 82-82A81.9 81.9 0 0 1 224 338zm85.38-148.3a19.14 19.14 0 1 1 19.13-19.14A19.1 19.1 0 0 1 309.4 189.7zM400 32H48A48 48 0 0 0 0 80V432a48 48 0 0 0 48 48H400a48 48 0 0 0 48-48V80A48 48 0 0 0 400 32zM382.9 322c-1.29 25.63-7.14 48.34-25.85 67s-41.4 24.63-67 25.85c-26.41 1.49-105.6 1.49-132 0-25.63-1.29-48.26-7.15-67-25.85s-24.63-41.42-25.85-67c-1.49-26.42-1.49-105.6 0-132 1.29-25.63 7.07-48.34 25.85-67s41.47-24.56 67-25.78c26.41-1.49 105.6-1.49 132 0 25.63 1.29 48.33 7.15 67 25.85s24.63 41.42 25.85 67.05C384.4 216.4 384.4 295.6 382.9 322z"],"square-js":[448,512,["js-square"],"f3b9","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM243.8 381.4c0 43.6-25.6 63.5-62.9 63.5-33.7 0-53.2-17.4-63.2-38.5l34.3-20.7c6.6 11.7 12.6 21.6 27.1 21.6 13.8 0 22.6-5.4 22.6-26.5V237.7h42.1v143.7zm99.6 63.5c-39.1 0-64.4-18.6-76.7-43l34.3-19.8c9 14.7 20.8 25.6 41.5 25.6 17.4 0 28.6-8.7 28.6-20.8 0-14.4-11.4-19.5-30.7-28l-10.5-4.5c-30.4-12.9-50.5-29.2-50.5-63.5 0-31.6 24.1-55.6 61.6-55.6 26.8 0 46 9.3 59.8 33.7L368 290c-7.2-12.9-15-18-27.1-18-12.3 0-20.1 7.8-20.1 18 0 12.6 7.8 17.7 25.9 25.6l10.5 4.5c35.8 15.3 55.9 31 55.9 66.2 0 37.8-29.8 58.6-69.7 58.6z"],"square-lastfm":[448,512,["lastfm-square"],"f203","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-92.2 312.9c-63.4 0-85.4-28.6-97.1-64.1-16.3-51-21.5-84.3-63-84.3-22.4 0-45.1 16.1-45.1 61.2 0 35.2 18 57.2 43.3 57.2 28.6 0 47.6-21.3 47.6-21.3l11.7 31.9s-19.8 19.4-61.2 19.4c-51.3 0-79.9-30.1-79.9-85.8 0-57.9 28.6-92 82.5-92 73.5 0 80.8 41.4 100.8 101.9 8.8 26.8 24.2 46.2 61.2 46.2 24.9 0 38.1-5.5 38.1-19.1 0-19.9-21.8-22-49.9-28.6-30.4-7.3-42.5-23.1-42.5-48 0-40 32.3-52.4 65.2-52.4 37.4 0 60.1 13.6 63 46.6l-36.7 4.4c-1.5-15.8-11-22.4-28.6-22.4-16.1 0-26 7.3-26 19.8 0 11 4.8 17.6 20.9 21.3 32.7 7.1 71.8 12 71.8 57.5 .1 36.7-30.7 50.6-76.1 50.6z"],"square-odnoklassniki":[448,512,["odnoklassniki-square"],"f264","M184.2 177.1c0-22.1 17.9-40 39.8-40s39.8 17.9 39.8 40c0 22-17.9 39.8-39.8 39.8s-39.8-17.9-39.8-39.8zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-305.1 97.1c0 44.6 36.4 80.9 81.1 80.9s81.1-36.2 81.1-80.9c0-44.8-36.4-81.1-81.1-81.1s-81.1 36.2-81.1 81.1zm174.5 90.7c-4.6-9.1-17.3-16.8-34.1-3.6 0 0-22.7 18-59.3 18s-59.3-18-59.3-18c-16.8-13.2-29.5-5.5-34.1 3.6-7.9 16.1 1.1 23.7 21.4 37 17.3 11.1 41.2 15.2 56.6 16.8l-12.9 12.9c-18.2 18-35.5 35.5-47.7 47.7-17.6 17.6 10.7 45.8 28.4 28.6l47.7-47.9c18.2 18.2 35.7 35.7 47.7 47.9 17.6 17.2 46-10.7 28.6-28.6l-47.7-47.7-13-12.9c15.5-1.6 39.1-5.9 56.2-16.8 20.4-13.3 29.3-21 21.5-37z"],"square-pied-piper":[448,512,["pied-piper-square"],"e01e","M32 419L0 479.2l.8-328C.8 85.3 54 32 120 32h327.2c-93 28.9-189.9 94.2-253.9 168.6C122.7 282 82.6 338 32 419M448 32S305.2 98.8 261.6 199.1c-23.2 53.6-28.9 118.1-71 158.6-28.9 27.8-69.8 38.2-105.3 56.3-23.2 12-66.4 40.5-84.9 66h328.4c66 0 119.3-53.3 119.3-119.2-.1 0-.1-328.8-.1-328.8z"],"square-pinterest":[448,512,["pinterest-square"],"f0d3","M448 80v352c0 26.5-21.5 48-48 48H154.4c9.8-16.4 22.4-40 27.4-59.3 3-11.5 15.3-58.4 15.3-58.4 8 15.3 31.4 28.2 56.3 28.2 74.1 0 127.4-68.1 127.4-152.7 0-81.1-66.2-141.8-151.4-141.8-106 0-162.2 71.1-162.2 148.6 0 36 19.2 80.8 49.8 95.1 4.7 2.2 7.1 1.2 8.2-3.3 .8-3.4 5-20.1 6.8-27.8 .6-2.5 .3-4.6-1.7-7-10.1-12.3-18.3-34.9-18.3-56 0-54.2 41-106.6 110.9-106.6 60.3 0 102.6 41.1 102.6 99.9 0 66.4-33.5 112.4-77.2 112.4-24.1 0-42.1-19.9-36.4-44.4 6.9-29.2 20.3-60.7 20.3-81.8 0-53-75.5-45.7-75.5 25 0 21.7 7.3 36.5 7.3 36.5-31.4 132.8-36.1 134.5-29.6 192.6l2.2 .8H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48z"],"square-reddit":[448,512,["reddit-square"],"f1a2","M283.2 345.5c2.7 2.7 2.7 6.8 0 9.2-24.5 24.5-93.8 24.6-118.4 0-2.7-2.4-2.7-6.5 0-9.2 2.4-2.4 6.5-2.4 8.9 0 18.7 19.2 81 19.6 100.5 0 2.4-2.3 6.6-2.3 9 0zm-91.3-53.8c0-14.9-11.9-26.8-26.5-26.8-14.9 0-26.8 11.9-26.8 26.8 0 14.6 11.9 26.5 26.8 26.5 14.6 0 26.5-11.9 26.5-26.5zm90.7-26.8c-14.6 0-26.5 11.9-26.5 26.8 0 14.6 11.9 26.5 26.5 26.5 14.9 0 26.8-11.9 26.8-26.5 0-14.9-11.9-26.8-26.8-26.8zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-99.7 140.6c-10.1 0-19 4.2-25.6 10.7-24.1-16.7-56.5-27.4-92.5-28.6l18.7-84.2 59.5 13.4c0 14.6 11.9 26.5 26.5 26.5 14.9 0 26.8-12.2 26.8-26.8 0-14.6-11.9-26.8-26.8-26.8-10.4 0-19.3 6.2-23.8 14.9l-65.7-14.6c-3.3-.9-6.5 1.5-7.4 4.8l-20.5 92.8c-35.7 1.5-67.8 12.2-91.9 28.9-6.5-6.8-15.8-11-25.9-11-37.5 0-49.8 50.4-15.5 67.5-1.2 5.4-1.8 11-1.8 16.7 0 56.5 63.7 102.3 141.9 102.3 78.5 0 142.2-45.8 142.2-102.3 0-5.7-.6-11.6-2.1-17 33.6-17.2 21.2-67.2-16.1-67.2z"],"square-snapchat":[448,512,["snapchat-square"],"f2ad","M384 32H64A64 64 0 0 0 0 96V416a64 64 0 0 0 64 64H384a64 64 0 0 0 64-64V96A64 64 0 0 0 384 32zm-3.907 319.3-.083 .1a32.36 32.36 0 0 1 -8.717 6.823 90.26 90.26 0 0 1 -20.59 8.2 12.69 12.69 0 0 0 -3.852 1.76c-2.158 1.909-2.1 4.64-4.4 8.55a23.14 23.14 0 0 1 -6.84 7.471c-6.707 4.632-14.24 4.923-22.23 5.23-7.214 .274-15.39 .581-24.73 3.669-3.761 1.245-7.753 3.694-12.38 6.533-11.27 6.9-26.68 16.35-52.3 16.35s-40.92-9.4-52.11-16.28c-4.657-2.888-8.675-5.362-12.54-6.64-9.339-3.08-17.52-3.4-24.73-3.67-7.986-.307-15.52-.6-22.23-5.229a23.08 23.08 0 0 1 -6.01-6.11c-3.2-4.632-2.855-7.8-5.254-9.895a13.43 13.43 0 0 0 -4.1-1.834 89.99 89.99 0 0 1 -20.31-8.127 32.9 32.9 0 0 1 -8.3-6.284c-6.583-6.757-8.276-14.78-5.686-21.82 3.436-9.338 11.57-12.11 19.4-16.26 14.78-8.027 26.35-18.06 34.43-29.88a68.24 68.24 0 0 0 5.985-10.57c.789-2.158 .772-3.329 .241-4.416a7.386 7.386 0 0 0 -2.208-2.217c-2.532-1.676-5.113-3.353-6.882-4.5-3.27-2.141-5.868-3.818-7.529-4.98-6.267-4.383-10.65-9.04-13.4-14.24a28.4 28.4 0 0 1 -1.369-23.58c4.134-10.92 14.47-17.71 26.98-17.71a37.14 37.14 0 0 1 7.845 .83c.689 .15 1.37 .307 2.042 .482-.108-7.43 .058-15.36 .722-23.12 2.358-27.26 11.91-41.59 21.87-52.99a86.84 86.84 0 0 1 22.28-17.93C188.3 100.4 205.3 96 224 96s35.83 4.383 50.94 13.02a87.17 87.17 0 0 1 22.24 17.9c9.961 11.41 19.52 25.71 21.87 52.99a231.2 231.2 0 0 1 .713 23.12c.673-.174 1.362-.332 2.051-.481a37.13 37.13 0 0 1 7.844-.83c12.5 0 22.82 6.782 26.97 17.71a28.37 28.37 0 0 1 -1.4 23.56c-2.74 5.2-7.123 9.861-13.39 14.24-1.668 1.187-4.258 2.864-7.529 4.981-1.835 1.187-4.541 2.947-7.164 4.682a6.856 6.856 0 0 0 -1.951 2.034c-.506 1.046-.539 2.191 .166 4.208a69.01 69.01 0 0 0 6.085 10.79c8.268 12.1 20.19 22.31 35.45 30.41 1.486 .772 2.98 1.5 4.441 2.258 .722 .332 1.569 .763 2.491 1.3 4.9 2.723 9.2 6.01 11.45 12.15C387.8 336.9 386.3 344.7 380.1 351.3zm-16.72-18.46c-50.31-24.31-58.33-61.92-58.69-64.75-.431-3.379-.921-6.035 2.806-9.472 3.594-3.328 19.54-13.19 23.97-16.28 7.33-5.114 10.53-10.22 8.16-16.5-1.66-4.316-5.686-5.976-9.961-5.976a18.5 18.5 0 0 0 -3.993 .448c-8.035 1.743-15.84 5.769-20.35 6.857a7.1 7.1 0 0 1 -1.66 .224c-2.408 0-3.279-1.071-3.088-3.968 .564-8.783 1.759-25.92 .373-41.94-1.884-22.03-8.99-32.95-17.43-42.6-4.051-4.624-23.14-24.65-59.54-24.65S168.5 134.4 164.5 139c-8.434 9.654-15.53 20.57-17.43 42.6-1.386 16.01-.141 33.15 .373 41.94 .166 2.756-.68 3.968-3.088 3.968a7.1 7.1 0 0 1 -1.66-.224c-4.507-1.087-12.31-5.113-20.35-6.856a18.49 18.49 0 0 0 -3.993-.449c-4.25 0-8.3 1.636-9.961 5.977-2.374 6.276 .847 11.38 8.168 16.49 4.425 3.088 20.37 12.96 23.97 16.28 3.719 3.437 3.237 6.093 2.805 9.471-.356 2.79-8.384 40.39-58.69 64.75-2.946 1.428-7.96 4.45 .88 9.331 13.88 7.628 23.11 6.807 30.3 11.43 6.093 3.927 2.5 12.39 6.923 15.45 5.454 3.76 21.58-.266 42.33 6.6 17.43 5.744 28.12 22.01 58.96 22.01s41.79-16.3 58.94-21.97c20.8-6.865 36.89-2.839 42.34-6.6 4.433-3.055 .822-11.52 6.923-15.45 7.181-4.624 16.41-3.8 30.3-11.47C371.4 337.4 366.3 334.3 363.4 332.8z"],"square-steam":[448,512,["steam-square"],"f1b7","M185.2 356.5c7.7-18.5-1-39.7-19.6-47.4l-29.5-12.2c11.4-4.3 24.3-4.5 36.4 .5 12.2 5.1 21.6 14.6 26.7 26.7 5 12.2 5 25.6-.1 37.7-10.5 25.1-39.4 37-64.6 26.5-11.6-4.8-20.4-13.6-25.4-24.2l28.5 11.8c18.6 7.8 39.9-.9 47.6-19.4zM400 32H48C21.5 32 0 53.5 0 80v160.7l116.6 48.1c12-8.2 26.2-12.1 40.7-11.3l55.4-80.2v-1.1c0-48.2 39.3-87.5 87.6-87.5s87.6 39.3 87.6 87.5c0 49.2-40.9 88.7-89.6 87.5l-79 56.3c1.6 38.5-29.1 68.8-65.7 68.8-31.8 0-58.5-22.7-64.5-52.7L0 319.2V432c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-99.7 222.5c-32.2 0-58.4-26.1-58.4-58.3s26.2-58.3 58.4-58.3 58.4 26.2 58.4 58.3-26.2 58.3-58.4 58.3zm.1-14.6c24.2 0 43.9-19.6 43.9-43.8 0-24.2-19.6-43.8-43.9-43.8-24.2 0-43.9 19.6-43.9 43.8 0 24.2 19.7 43.8 43.9 43.8z"],"square-tumblr":[448,512,["tumblr-square"],"f174","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-82.3 364.2c-8.5 9.1-31.2 19.8-60.9 19.8-75.5 0-91.9-55.5-91.9-87.9v-90h-29.7c-3.4 0-6.2-2.8-6.2-6.2v-42.5c0-4.5 2.8-8.5 7.1-10 38.8-13.7 50.9-47.5 52.7-73.2 .5-6.9 4.1-10.2 10-10.2h44.3c3.4 0 6.2 2.8 6.2 6.2v72h51.9c3.4 0 6.2 2.8 6.2 6.2v51.1c0 3.4-2.8 6.2-6.2 6.2h-52.1V321c0 21.4 14.8 33.5 42.5 22.4 3-1.2 5.6-2 8-1.4 2.2 .5 3.6 2.1 4.6 4.9l13.8 40.2c1 3.2 2 6.7-.3 9.1z"],"square-twitter":[448,512,["twitter-square"],"f081","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-48.9 158.8c.2 2.8 .2 5.7 .2 8.5 0 86.7-66 186.6-186.6 186.6-37.2 0-71.7-10.8-100.7-29.4 5.3 .6 10.4 .8 15.8 .8 30.7 0 58.9-10.4 81.4-28-28.8-.6-53-19.5-61.3-45.5 10.1 1.5 19.2 1.5 29.6-1.2-30-6.1-52.5-32.5-52.5-64.4v-.8c8.7 4.9 18.9 7.9 29.6 8.3a65.45 65.45 0 0 1 -29.2-54.6c0-12.2 3.2-23.4 8.9-33.1 32.3 39.8 80.8 65.8 135.2 68.6-9.3-44.5 24-80.6 64-80.6 18.9 0 35.9 7.9 47.9 20.7 14.8-2.8 29-8.3 41.6-15.8-4.9 15.2-15.2 28-28.8 36.1 13.2-1.4 26-5.1 37.8-10.2-8.9 13.1-20.1 24.7-32.9 34z"],"square-viadeo":[448,512,["viadeo-square"],"f2aa","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM280.7 381.2c-42.4 46.2-120 46.6-162.4 0-68-73.6-19.8-196.1 81.2-196.1 13.3 0 26.6 2.1 39.1 6.7-4.3 8.4-7.3 17.6-8.4 27.1-9.7-4.1-20.2-6-30.7-6-48.8 0-84.6 41.7-84.6 88.9 0 43 28.5 78.7 69.5 85.9 61.5-24 72.9-117.6 72.9-175 0-7.3 0-14.8-.6-22.1-11.2-32.9-26.6-64.6-44.2-94.5 27.1 18.3 41.9 62.5 44.2 94.1v.4c7.7 22.5 11.8 46.2 11.8 70 0 54.1-21.9 99-68.3 128.2l-2.4 .2c50 1 86.2-38.6 86.2-87.2 0-12.2-2.1-24.3-6.9-35.7 9.5-1.9 18.5-5.6 26.4-10.5 15.3 36.6 12.6 87.3-22.8 125.6zM309 233.7c-13.3 0-25.1-7.1-34.4-16.1 21.9-12 49.6-30.7 62.3-53 1.5-3 4.1-8.6 4.5-12-12.5 27.9-44.2 49.8-73.9 56.7-4.7-7.3-7.5-15.5-7.5-24.3 0-10.3 5.2-24.1 12.9-31.6 21.6-20.5 53-8.5 72.4-50 32.5 46.2 13.1 130.3-36.3 130.3z"],"square-vimeo":[448,512,["vimeo-square"],"f194","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zm-16.2 149.6c-1.4 31.1-23.2 73.8-65.3 127.9-43.5 56.5-80.3 84.8-110.4 84.8-18.7 0-34.4-17.2-47.3-51.6-25.2-92.3-35.9-146.4-56.7-146.4-2.4 0-10.8 5-25.1 15.1L64 192c36.9-32.4 72.1-68.4 94.1-70.4 24.9-2.4 40.2 14.6 46 51.1 20.5 129.6 29.6 149.2 66.8 90.5 13.4-21.2 20.6-37.2 21.5-48.3 3.4-32.8-25.6-30.6-45.2-22.2 15.7-51.5 45.8-76.5 90.1-75.1 32.9 1 48.4 22.4 46.5 64z"],"square-whatsapp":[448,512,["whatsapp-square"],"f40c","M224 122.8c-72.7 0-131.8 59.1-131.9 131.8 0 24.9 7 49.2 20.2 70.1l3.1 5-13.3 48.6 49.9-13.1 4.8 2.9c20.2 12 43.4 18.4 67.1 18.4h.1c72.6 0 133.3-59.1 133.3-131.8 0-35.2-15.2-68.3-40.1-93.2-25-25-58-38.7-93.2-38.7zm77.5 188.4c-3.3 9.3-19.1 17.7-26.7 18.8-12.6 1.9-22.4 .9-47.5-9.9-39.7-17.2-65.7-57.2-67.7-59.8-2-2.6-16.2-21.5-16.2-41s10.2-29.1 13.9-33.1c3.6-4 7.9-5 10.6-5 2.6 0 5.3 0 7.6 .1 2.4 .1 5.7-.9 8.9 6.8 3.3 7.9 11.2 27.4 12.2 29.4s1.7 4.3 .3 6.9c-7.6 15.2-15.7 14.6-11.6 21.6 15.3 26.3 30.6 35.4 53.9 47.1 4 2 6.3 1.7 8.6-1 2.3-2.6 9.9-11.6 12.5-15.5 2.6-4 5.3-3.3 8.9-2 3.6 1.3 23.1 10.9 27.1 12.9s6.6 3 7.6 4.6c.9 1.9 .9 9.9-2.4 19.1zM400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM223.9 413.2c-26.6 0-52.7-6.7-75.8-19.3L64 416l22.5-82.2c-13.9-24-21.2-51.3-21.2-79.3C65.4 167.1 136.5 96 223.9 96c42.4 0 82.2 16.5 112.2 46.5 29.9 30 47.9 69.8 47.9 112.2 0 87.4-72.7 158.5-160.1 158.5z"],"square-xing":[448,512,["xing-square"],"f169","M400 32H48C21.5 32 0 53.5 0 80v352c0 26.5 21.5 48 48 48h352c26.5 0 48-21.5 48-48V80c0-26.5-21.5-48-48-48zM140.4 320.2H93.8c-5.5 0-8.7-5.3-6-10.3l49.3-86.7c.1 0 .1-.1 0-.2l-31.4-54c-3-5.6 .2-10.1 6-10.1h46.6c5.2 0 9.5 2.9 12.9 8.7l31.9 55.3c-1.3 2.3-18 31.7-50.1 88.2-3.5 6.2-7.7 9.1-12.6 9.1zm219.7-214.1L257.3 286.8v.2l65.5 119c2.8 5.1 .1 10.1-6 10.1h-46.6c-5.5 0-9.7-2.9-12.9-8.7l-66-120.3c2.3-4.1 36.8-64.9 103.4-182.3 3.3-5.8 7.4-8.7 12.5-8.7h46.9c5.7-.1 8.8 4.7 6 10z"],"square-youtube":[448,512,[61798,"youtube-square"],"f431","M186.8 202.1l95.2 54.1-95.2 54.1V202.1zM448 80v352c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V80c0-26.5 21.5-48 48-48h352c26.5 0 48 21.5 48 48zm-42 176.3s0-59.6-7.6-88.2c-4.2-15.8-16.5-28.2-32.2-32.4C337.9 128 224 128 224 128s-113.9 0-142.2 7.7c-15.7 4.2-28 16.6-32.2 32.4-7.6 28.5-7.6 88.2-7.6 88.2s0 59.6 7.6 88.2c4.2 15.8 16.5 27.7 32.2 31.9C110.1 384 224 384 224 384s113.9 0 142.2-7.7c15.7-4.2 28-16.1 32.2-31.9 7.6-28.5 7.6-88.1 7.6-88.1z"],squarespace:[512,512,[],"f5be","M186.1 343.3c-9.65 9.65-9.65 25.29 0 34.94 9.65 9.65 25.29 9.65 34.94 0L378.2 221.1c19.29-19.29 50.57-19.29 69.86 0s19.29 50.57 0 69.86L293.1 445.1c19.27 19.29 50.53 19.31 69.82 .04l.04-.04 119.3-119.2c38.59-38.59 38.59-101.1 0-139.7-38.59-38.59-101.2-38.59-139.7 0l-157.2 157.2zm244.5-104.8c-9.65-9.65-25.29-9.65-34.93 0l-157.2 157.2c-19.27 19.29-50.53 19.31-69.82 .05l-.05-.05c-9.64-9.64-25.27-9.65-34.92-.01l-.01 .01c-9.65 9.64-9.66 25.28-.02 34.93l.02 .02c38.58 38.57 101.1 38.57 139.7 0l157.2-157.2c9.65-9.65 9.65-25.29 .01-34.93zm-261.1 87.33l157.2-157.2c9.64-9.65 9.64-25.29 0-34.94-9.64-9.64-25.27-9.64-34.91 0L133.7 290.9c-19.28 19.29-50.56 19.3-69.85 .01l-.01-.01c-19.29-19.28-19.31-50.54-.03-69.84l.03-.03L218 66.89c-19.28-19.29-50.55-19.3-69.85-.02l-.02 .02L28.93 186.1c-38.58 38.59-38.58 101.1 0 139.7 38.6 38.59 101.1 38.59 139.7 .01zm-87.33-52.4c9.64 9.64 25.27 9.64 34.91 0l157.2-157.2c19.28-19.29 50.55-19.3 69.84-.02l.02 .02c9.65 9.65 25.29 9.65 34.93 0 9.65-9.65 9.65-25.29 0-34.93-38.59-38.59-101.1-38.59-139.7 0L81.33 238.5c-9.65 9.64-9.65 25.28-.01 34.93h.01z"],"stack-exchange":[448,512,[],"f18d","M17.7 332.3h412.7v22c0 37.7-29.3 68-65.3 68h-19L259.3 512v-89.7H83c-36 0-65.3-30.3-65.3-68v-22zm0-23.6h412.7v-85H17.7v85zm0-109.4h412.7v-85H17.7v85zM365 0H83C47 0 17.7 30.3 17.7 67.7V90h412.7V67.7C430.3 30.3 401 0 365 0z"],"stack-overflow":[384,512,[],"f16c","M290.7 311L95 269.7 86.8 309l195.7 41zm51-87L188.2 95.7l-25.5 30.8 153.5 128.3zm-31.2 39.7L129.2 179l-16.7 36.5L293.7 300zM262 32l-32 24 119.3 160.3 32-24zm20.5 328h-200v39.7h200zm39.7 80H42.7V320h-40v160h359.5V320h-40z"],stackpath:[448,512,[],"f842","M244.6 232.4c0 8.5-4.26 20.49-21.34 20.49h-19.61v-41.47h19.61c17.13 0 21.34 12.36 21.34 20.98zM448 32v448H0V32zM151.3 287.8c0-21.24-12.12-34.54-46.72-44.85-20.57-7.41-26-10.91-26-18.63s7-14.61 20.41-14.61c14.09 0 20.79 8.45 20.79 18.35h30.7l.19-.57c.5-19.57-15.06-41.65-51.12-41.65-23.37 0-52.55 10.75-52.55 38.29 0 19.4 9.25 31.29 50.74 44.37 17.26 6.15 21.91 10.4 21.91 19.48 0 15.2-19.13 14.23-19.47 14.23-20.4 0-25.65-9.1-25.65-21.9h-30.8l-.18 .56c-.68 31.32 28.38 45.22 56.63 45.22 29.98 0 51.12-13.55 51.12-38.29zm125.4-55.63c0-25.3-18.43-45.46-53.42-45.46h-51.78v138.2h32.17v-47.36h19.61c30.25 0 53.42-15.95 53.42-45.36zM297.9 325L347 186.8h-31.09L268 325zm106.5-138.2h-31.09L325.5 325h29.94z"],staylinked:[440,512,[],"f3f5","M382.7 292.5l2.7 2.7-170-167.3c-3.5-3.5-9.7-3.7-13.8-.5L144.3 171c-4.2 3.2-4.6 8.7-1.1 12.2l68.1 64.3c3.6 3.5 9.9 3.7 14 .5l.1-.1c4.1-3.2 10.4-3 14 .5l84 81.3c3.6 3.5 3.2 9-.9 12.2l-93.2 74c-4.2 3.3-10.5 3.1-14.2-.4L63.2 268c-3.5-3.5-9.7-3.7-13.9-.5L3.5 302.4c-4.2 3.2-4.7 8.7-1.2 12.2L211 510.7s7.4 6.8 17.3-.8l198-163.9c4-3.2 4.4-8.7 .7-12.2zm54.5-83.4L226.7 2.5c-1.5-1.2-8-5.5-16.3 1.1L3.6 165.7c-4.2 3.2-4.8 8.7-1.2 12.2l42.3 41.7 171.7 165.1c3.7 3.5 10.1 3.7 14.3 .4l50.2-38.8-.3-.3 7.7-6c4.2-3.2 4.6-8.7 .9-12.2l-57.1-54.4c-3.6-3.5-10-3.7-14.2-.5l-.1 .1c-4.2 3.2-10.5 3.1-14.2-.4L109 180.8c-3.6-3.5-3.1-8.9 1.1-12.2l92.2-71.5c4.1-3.2 10.3-3 13.9 .5l160.4 159c3.7 3.5 10 3.7 14.1 .5l45.8-35.8c4.1-3.2 4.4-8.7 .7-12.2z"],steam:[496,512,[],"f1b6","M496 256c0 137-111.2 248-248.4 248-113.8 0-209.6-76.3-239-180.4l95.2 39.3c6.4 32.1 34.9 56.4 68.9 56.4 39.2 0 71.9-32.4 70.2-73.5l84.5-60.2c52.1 1.3 95.8-40.9 95.8-93.5 0-51.6-42-93.5-93.7-93.5s-93.7 42-93.7 93.5v1.2L176.6 279c-15.5-.9-30.7 3.4-43.5 12.1L0 236.1C10.2 108.4 117.1 8 247.6 8 384.8 8 496 119 496 256zM155.7 384.3l-30.5-12.6a52.79 52.79 0 0 0 27.2 25.8c26.9 11.2 57.8-1.6 69-28.4 5.4-13 5.5-27.3 .1-40.3-5.4-13-15.5-23.2-28.5-28.6-12.9-5.4-26.7-5.2-38.9-.6l31.5 13c19.8 8.2 29.2 30.9 20.9 50.7-8.3 19.9-31 29.2-50.8 21zm173.8-129.9c-34.4 0-62.4-28-62.4-62.3s28-62.3 62.4-62.3 62.4 28 62.4 62.3-27.9 62.3-62.4 62.3zm.1-15.6c25.9 0 46.9-21 46.9-46.8 0-25.9-21-46.8-46.9-46.8s-46.9 21-46.9 46.8c.1 25.8 21.1 46.8 46.9 46.8z"],"steam-symbol":[448,512,[],"f3f6","M395.5 177.5c0 33.8-27.5 61-61 61-33.8 0-61-27.3-61-61s27.3-61 61-61c33.5 0 61 27.2 61 61zm52.5 .2c0 63-51 113.8-113.7 113.8L225 371.3c-4 43-40.5 76.8-84.5 76.8-40.5 0-74.7-28.8-83-67L0 358V250.7L97.2 290c15.1-9.2 32.2-13.3 52-11.5l71-101.7c.5-62.3 51.5-112.8 114-112.8C397 64 448 115 448 177.7zM203 363c0-34.7-27.8-62.5-62.5-62.5-4.5 0-9 .5-13.5 1.5l26 10.5c25.5 10.2 38 39 27.7 64.5-10.2 25.5-39.2 38-64.7 27.5-10.2-4-20.5-8.3-30.7-12.2 10.5 19.7 31.2 33.2 55.2 33.2 34.7 0 62.5-27.8 62.5-62.5zm207.5-185.3c0-42-34.3-76.2-76.2-76.2-42.3 0-76.5 34.2-76.5 76.2 0 42.2 34.3 76.2 76.5 76.2 41.9 .1 76.2-33.9 76.2-76.2z"],"sticker-mule":[576,512,[],"f3f7","M561.7 199.6c-1.3 .3 .3 0 0 0zm-6.2-77.4c-7.7-22.3-5.1-7.2-13.4-36.9-1.6-6.5-3.6-14.5-6.2-20-4.4-8.7-4.6-7.5-4.6-9.5 0-5.3 30.7-45.3 19-46.9-5.7-.6-12.2 11.6-20.6 17-8.6 4.2-8 5-10.3 5-2.6 0-5.7-3-6.2-5-2-5.7 1.9-25.9-3.6-25.9-3.6 0-12.3 24.8-17 25.8-5.2 1.3-27.9-11.4-75.1 18-25.3 13.2-86.9 65.2-87 65.3-6.7 4.7-20 4.7-35.5 16-44.4 30.1-109.6 9.4-110.7 9-110.6-26.8-128-15.2-159 11.5-20.8 17.9-23.7 36.5-24.2 38.9-4.2 20.4 5.2 48.3 6.7 64.3 1.8 19.3-2.7 17.7 7.7 98.3 .5 1 4.1 0 5.1 1.5 0 8.4-3.8 12.1-4.1 13-1.5 4.5-1.5 10.5 0 16 2.3 8.2 8.2 37.2 8.2 46.9 0 41.8 .4 44 2.6 49.4 3.9 10 12.5 9.1 17 12 3.1 3.5-.5 8.5 1 12.5 .5 2 3.6 4 6.2 5 9.2 3.6 27 .3 29.9-2.5 1.6-1.5 .5-4.5 3.1-5 5.1 0 10.8-.5 14.4-2.5 5.1-2.5 4.1-6 1.5-10.5-.4-.8-7-13.3-9.8-16-2.1-2-5.1-3-7.2-4.5-5.8-4.9-10.3-19.4-10.3-19.5-4.6-19.4-10.3-46.3-4.1-66.8 4.6-17.2 39.5-87.7 39.6-87.8 4.1-6.5 17-11.5 27.3-7 6 1.9 19.3 22 65.4 30.9 47.9 8.7 97.4-2 112.2-2 2.8 2-1.9 13-.5 38.9 0 26.4-.4 13.7-4.1 29.9-2.2 9.7 3.4 23.2-1.5 46.9-1.4 9.8-9.9 32.7-8.2 43.4 .5 1 1 2 1.5 3.5 .5 4.5 1.5 8.5 4.6 10 7.3 3.6 12-3.5 9.8 11.5-.7 3.1-2.6 12 1.5 15 4.4 3.7 30.6 3.4 36.5 .5 2.6-1.5 1.6-4.5 6.4-7.4 1.9-.9 11.3-.4 11.3-6.5 .3-1.8-9.2-19.9-9.3-20-2.6-3.5-9.2-4.5-11.3-8-6.9-10.1-1.7-52.6 .5-59.4 3-11 5.6-22.4 8.7-32.4 11-42.5 10.3-50.6 16.5-68.3 .8-1.8 6.4-23.1 10.3-29.9 9.3-17 21.7-32.4 33.5-47.4 18-22.9 34-46.9 52-69.8 6.1-7 8.2-13.7 18-8 10.8 5.7 21.6 7 31.9 17 14.6 12.8 10.2 18.2 11.8 22.9 1.5 5 7.7 10.5 14.9 9.5 10.4-2 13-2.5 13.4-2.5 2.6-.5 5.7-5 7.2-8 3.1-5.5 7.2-9 7.2-16.5 0-7.7-.4-2.8-20.6-52.9z"],strava:[384,512,[],"f428","M158.4 0L7 292h89.2l62.2-116.1L220.1 292h88.5zm150.2 292l-43.9 88.2-44.6-88.2h-67.6l112.2 220 111.5-220z"],stripe:[640,512,[],"f429","M165 144.7l-43.3 9.2-.2 142.4c0 26.3 19.8 43.3 46.1 43.3 14.6 0 25.3-2.7 31.2-5.9v-33.8c-5.7 2.3-33.7 10.5-33.7-15.7V221h33.7v-37.8h-33.7zm89.1 51.6l-2.7-13.1H213v153.2h44.3V233.3c10.5-13.8 28.2-11.1 33.9-9.3v-40.8c-6-2.1-26.7-6-37.1 13.1zm92.3-72.3l-44.6 9.5v36.2l44.6-9.5zM44.9 228.3c0-6.9 5.8-9.6 15.1-9.7 13.5 0 30.7 4.1 44.2 11.4v-41.8c-14.7-5.8-29.4-8.1-44.1-8.1-36 0-60 18.8-60 50.2 0 49.2 67.5 41.2 67.5 62.4 0 8.2-7.1 10.9-17 10.9-14.7 0-33.7-6.1-48.6-14.2v40c16.5 7.1 33.2 10.1 48.5 10.1 36.9 0 62.3-15.8 62.3-47.8 0-52.9-67.9-43.4-67.9-63.4zM640 261.6c0-45.5-22-81.4-64.2-81.4s-67.9 35.9-67.9 81.1c0 53.5 30.3 78.2 73.5 78.2 21.2 0 37.1-4.8 49.2-11.5v-33.4c-12.1 6.1-26 9.8-43.6 9.8-17.3 0-32.5-6.1-34.5-26.9h86.9c.2-2.3 .6-11.6 .6-15.9zm-87.9-16.8c0-20 12.3-28.4 23.4-28.4 10.9 0 22.5 8.4 22.5 28.4zm-112.9-64.6c-17.4 0-28.6 8.2-34.8 13.9l-2.3-11H363v204.8l44.4-9.4 .1-50.2c6.4 4.7 15.9 11.2 31.4 11.2 31.8 0 60.8-23.2 60.8-79.6 .1-51.6-29.3-79.7-60.5-79.7zm-10.6 122.5c-10.4 0-16.6-3.8-20.9-8.4l-.3-66c4.6-5.1 11-8.8 21.2-8.8 16.2 0 27.4 18.2 27.4 41.4 .1 23.9-10.9 41.8-27.4 41.8zm-126.7 33.7h44.6V183.2h-44.6z"],"stripe-s":[384,512,[],"f42a","M155.3 154.6c0-22.3 18.6-30.9 48.4-30.9 43.4 0 98.5 13.3 141.9 36.7V26.1C298.3 7.2 251.1 0 203.8 0 88.1 0 11 60.4 11 161.4c0 157.9 216.8 132.3 216.8 200.4 0 26.4-22.9 34.9-54.7 34.9-47.2 0-108.2-19.5-156.1-45.5v128.5a396.1 396.1 0 0 0 156 32.4c118.6 0 200.3-51 200.3-153.6 0-170.2-218-139.7-218-203.9z"],studiovinari:[512,512,[],"f3f8","M480.3 187.7l4.2 28v28l-25.1 44.1-39.8 78.4-56.1 67.5-79.1 37.8-17.7 24.5-7.7 12-9.6 4s17.3-63.6 19.4-63.6c2.1 0 20.3 .7 20.3 .7l66.7-38.6-92.5 26.1-55.9 36.8-22.8 28-6.6 1.4 20.8-73.6 6.9-5.5 20.7 12.9 88.3-45.2 56.8-51.5 14.8-68.4-125.4 23.3 15.2-18.2-173.4-53.3 81.9-10.5-166-122.9L133.5 108 32.2 0l252.9 126.6-31.5-38L378 163 234.7 64l18.7 38.4-49.6-18.1L158.3 0l194.6 122L310 66.2l108 96.4 12-8.9-21-16.4 4.2-37.8L451 89.1l29.2 24.7 11.5 4.2-7 6.2 8.5 12-13.1 7.4-10.3 20.2 10.5 23.9z"],stumbleupon:[512,512,[],"f1a4","M502.9 266v69.7c0 62.1-50.3 112.4-112.4 112.4-61.8 0-112.4-49.8-112.4-111.3v-70.2l34.3 16 51.1-15.2V338c0 14.7 12 26.5 26.7 26.5S417 352.7 417 338v-72h85.9zm-224.7-58.2l34.3 16 51.1-15.2V173c0-60.5-51.1-109-112.1-109-60.8 0-112.1 48.2-112.1 108.2v162.4c0 14.9-12 26.7-26.7 26.7S86 349.5 86 334.6V266H0v69.7C0 397.7 50.3 448 112.4 448c61.6 0 112.4-49.5 112.4-110.8V176.9c0-14.7 12-26.7 26.7-26.7s26.7 12 26.7 26.7v30.9z"],"stumbleupon-circle":[496,512,[],"f1a3","M256 8C119 8 8 119 8 256s111 248 248 248 248-111 248-248S393 8 256 8zm0 177.5c-9.8 0-17.8 8-17.8 17.8v106.9c0 40.9-33.9 73.9-74.9 73.9-41.4 0-74.9-33.5-74.9-74.9v-46.5h57.3v45.8c0 10 8 17.8 17.8 17.8s17.8-7.9 17.8-17.8V200.1c0-40 34.2-72.1 74.7-72.1 40.7 0 74.7 32.3 74.7 72.6v23.7l-34.1 10.1-22.9-10.7v-20.6c.1-9.6-7.9-17.6-17.7-17.6zm167.6 123.6c0 41.4-33.5 74.9-74.9 74.9-41.2 0-74.9-33.2-74.9-74.2V263l22.9 10.7 34.1-10.1v47.1c0 9.8 8 17.6 17.8 17.6s17.8-7.9 17.8-17.6v-48h57.3c-.1 45.9-.1 46.4-.1 46.4z"],superpowers:[448,512,[],"f2dd","M448 32c-83.3 11-166.8 22-250 33-92 12.5-163.3 86.7-169 180-3.3 55.5 18 109.5 57.8 148.2L0 480c83.3-11 166.5-22 249.8-33 91.8-12.5 163.3-86.8 168.7-179.8 3.5-55.5-18-109.5-57.7-148.2L448 32zm-79.7 232.3c-4.2 79.5-74 139.2-152.8 134.5-79.5-4.7-140.7-71-136.3-151 4.5-79.2 74.3-139.3 153-134.5 79.3 4.7 140.5 71 136.1 151z"],supple:[640,512,[],"f3f9","M640 262.5c0 64.1-109 116.1-243.5 116.1-24.8 0-48.6-1.8-71.1-5 7.7 .4 15.5 .6 23.4 .6 134.5 0 243.5-56.9 243.5-127.1 0-29.4-19.1-56.4-51.2-78 60 21.1 98.9 55.1 98.9 93.4zM47.7 227.9c-.1-70.2 108.8-127.3 243.3-127.6 7.9 0 15.6 .2 23.3 .5-22.5-3.2-46.3-4.9-71-4.9C108.8 96.3-.1 148.5 0 212.6c.1 38.3 39.1 72.3 99.3 93.3-32.3-21.5-51.5-48.6-51.6-78zm60.2 39.9s10.5 13.2 29.3 13.2c17.9 0 28.4-11.5 28.4-25.1 0-28-40.2-25.1-40.2-39.7 0-5.4 5.3-9.1 12.5-9.1 5.7 0 11.3 2.6 11.3 6.6v3.9h14.2v-7.9c0-12.1-15.4-16.8-25.4-16.8-16.5 0-28.5 10.2-28.5 24.1 0 26.6 40.2 25.4 40.2 39.9 0 6.6-5.8 10.1-12.3 10.1-11.9 0-20.7-10.1-20.7-10.1l-8.8 10.9zm120.8-73.6v54.4c0 11.3-7.1 17.8-17.8 17.8-10.7 0-17.8-6.5-17.8-17.7v-54.5h-15.8v55c0 18.9 13.4 31.9 33.7 31.9 20.1 0 33.4-13 33.4-31.9v-55h-15.7zm34.4 85.4h15.8v-29.5h15.5c16 0 27.2-11.5 27.2-28.1s-11.2-27.8-27.2-27.8h-39.1v13.4h7.8v72zm15.8-43v-29.1h12.9c8.7 0 13.7 5.7 13.7 14.4 0 8.9-5.1 14.7-14 14.7h-12.6zm57 43h15.8v-29.5h15.5c16 0 27.2-11.5 27.2-28.1s-11.2-27.8-27.2-27.8h-39.1v13.4h7.8v72zm15.7-43v-29.1h12.9c8.7 0 13.7 5.7 13.7 14.4 0 8.9-5 14.7-14 14.7h-12.6zm57.1 34.8c0 5.8 2.4 8.2 8.2 8.2h37.6c5.8 0 8.2-2.4 8.2-8.2v-13h-14.3v5.2c0 1.7-1 2.6-2.6 2.6h-18.6c-1.7 0-2.6-1-2.6-2.6v-61.2c0-5.7-2.4-8.2-8.2-8.2H401v13.4h5.2c1.7 0 2.6 1 2.6 2.6v61.2zm63.4 0c0 5.8 2.4 8.2 8.2 8.2H519c5.7 0 8.2-2.4 8.2-8.2v-13h-14.3v5.2c0 1.7-1 2.6-2.6 2.6h-19.7c-1.7 0-2.6-1-2.6-2.6v-20.3h27.7v-13.4H488v-22.4h19.2c1.7 0 2.6 1 2.6 2.6v5.2H524v-13c0-5.7-2.5-8.2-8.2-8.2h-51.6v13.4h7.8v63.9zm58.9-76v5.9h1.6v-5.9h2.7v-1.2h-7v1.2h2.7zm5.7-1.2v7.1h1.5v-5.7l2.3 5.7h1.3l2.3-5.7v5.7h1.5v-7.1h-2.3l-2.1 5.1-2.1-5.1h-2.4z"],suse:[640,512,[],"f7d6","M471.1 102.7s-.3 18.3-.3 20.3c-9.1-3-74.4-24.1-135.7-26.3-51.9-1.8-122.8-4.3-223 57.3-19.4 12.4-73.9 46.1-99.6 109.7C7 277-.12 307 7 335.1a111 111 0 0 0 16.5 35.7c17.4 25 46.6 41.6 78.1 44.4 44.4 3.9 78.1-16 90-53.3 8.2-25.8 0-63.6-31.5-82.9-25.6-15.7-53.3-12.1-69.2-1.6-13.9 9.2-21.8 23.5-21.6 39.2 .3 27.8 24.3 42.6 41.5 42.6a49 49 0 0 0 15.8-2.7c6.5-1.8 13.3-6.5 13.3-14.9 0-12.1-11.6-14.8-16.8-13.9-2.9 .5-4.5 2-11.8 2.4-2-.2-12-3.1-12-14V316c.2-12.3 13.2-18 25.5-16.9 32.3 2.8 47.7 40.7 28.5 65.7-18.3 23.7-76.6 23.2-99.7-20.4-26-49.2 12.7-111.2 87-98.4 33.2 5.7 83.6 35.5 102.4 104.3h45.9c-5.7-17.6-8.9-68.3 42.7-68.3 56.7 0 63.9 39.9 79.8 68.3H460c-12.8-18.3-21.7-38.7-18.9-55.8 5.6-33.8 39.7-18.4 82.4-17.4 66.5 .4 102.1-27 103.1-28 3.7-3.1 6.5-15.8 7-17.7 1.3-5.1-3.2-2.4-3.2-2.4-8.7 5.2-30.5 15.2-50.9 15.6-25.3 .5-76.2-25.4-81.6-28.2-.3-.4 .1 1.2-11-25.5 88.4 58.3 118.3 40.5 145.2 21.7 .8-.6 4.3-2.9 3.6-5.7-13.8-48.1-22.4-62.7-34.5-69.6-37-21.6-125-34.7-129.2-35.3 .1-.1-.9-.3-.9 .7zm60.4 72.8a37.54 37.54 0 0 1 38.9-36.3c33.4 1.2 48.8 42.3 24.4 65.2-24.2 22.7-64.4 4.6-63.3-28.9zm38.6-25.3a26.27 26.27 0 1 0 25.4 27.2 26.19 26.19 0 0 0 -25.4-27.2zm4.3 28.8c-15.4 0-15.4-15.6 0-15.6s15.4 15.64 0 15.64z"],swift:[448,512,[],"f8e1","M448 156.1c0-4.51-.08-9-.2-13.52a196.3 196.3 0 0 0 -2.58-29.42 99.62 99.62 0 0 0 -9.22-28A94.08 94.08 0 0 0 394.8 44a99.17 99.17 0 0 0 -28-9.22 195 195 0 0 0 -29.43-2.59c-4.51-.12-9-.17-13.52-.2H124.1c-4.51 0-9 .08-13.52 .2-2.45 .07-4.91 .15-7.37 .27a171.7 171.7 0 0 0 -22.06 2.32 103.1 103.1 0 0 0 -21.21 6.1q-3.46 1.45-6.81 3.12a94.66 94.66 0 0 0 -18.39 12.32c-1.88 1.61-3.69 3.28-5.43 5A93.86 93.86 0 0 0 12 85.17a99.45 99.45 0 0 0 -9.22 28 196.3 196.3 0 0 0 -2.54 29.4c-.13 4.51-.18 9-.21 13.52v199.8c0 4.51 .08 9 .21 13.51a196.1 196.1 0 0 0 2.58 29.42 99.3 99.3 0 0 0 9.22 28A94.31 94.31 0 0 0 53.17 468a99.47 99.47 0 0 0 28 9.21 195 195 0 0 0 29.43 2.59c4.5 .12 9 .17 13.52 .2H323.9c4.51 0 9-.08 13.52-.2a196.6 196.6 0 0 0 29.44-2.59 99.57 99.57 0 0 0 28-9.21A94.22 94.22 0 0 0 436 426.8a99.3 99.3 0 0 0 9.22-28 194.8 194.8 0 0 0 2.59-29.42c.12-4.5 .17-9 .2-13.51V172.1c-.01-5.35-.01-10.7-.01-16.05zm-69.88 241c-20-38.93-57.23-29.27-76.31-19.47-1.72 1-3.48 2-5.25 3l-.42 .25c-39.5 21-92.53 22.54-145.9-.38A234.6 234.6 0 0 1 45 290.1a230.6 230.6 0 0 0 39.17 23.37c56.36 26.4 113 24.49 153 0-57-43.85-104.6-101-141.1-147.2a197.1 197.1 0 0 1 -18.78-25.9c43.7 40 112.7 90.22 137.5 104.1-52.57-55.49-98.89-123.9-96.72-121.7 82.79 83.42 159.2 130.6 159.2 130.6 2.88 1.58 5 2.85 6.73 4a127.4 127.4 0 0 0 4.16-12.47c13.22-48.33-1.66-103.6-35.31-149.2C329.6 141.8 375 229.3 356.4 303.4c-.44 1.73-.95 3.4-1.44 5.09 38.52 47.4 28.04 98.17 23.13 88.59z"],symfony:[512,512,[],"f83d","M256 8C119 8 8 119 8 256s111 248 248 248 248-111 248-248S393 8 256 8zm133.7 143.5c-11.47 .41-19.4-6.45-19.77-16.87-.27-9.18 6.68-13.44 6.53-18.85-.23-6.55-10.16-6.82-12.87-6.67-39.78 1.29-48.59 57-58.89 113.8 21.43 3.15 36.65-.72 45.14-6.22 12-7.75-3.34-15.72-1.42-24.56 4-18.16 32.55-19 32 5.3-.36 17.86-25.92 41.81-77.6 35.7-10.76 59.52-18.35 115-58.2 161.7-29 34.46-58.4 39.82-71.58 40.26-24.65 .85-41-12.31-41.58-29.84-.56-17 14.45-26.26 24.31-26.59 21.89-.75 30.12 25.67 14.88 34-12.09 9.71 .11 12.61 2.05 12.55 10.42-.36 17.34-5.51 22.18-9 24-20 33.24-54.86 45.35-118.3 8.19-49.66 17-78 18.23-82-16.93-12.75-27.08-28.55-49.85-34.72-15.61-4.23-25.12-.63-31.81 7.83-7.92 10-5.29 23 2.37 30.7l12.63 14c15.51 17.93 24 31.87 20.8 50.62-5.06 29.93-40.72 52.9-82.88 39.94-36-11.11-42.7-36.56-38.38-50.62 7.51-24.15 42.36-11.72 34.62 13.6-2.79 8.6-4.92 8.68-6.28 13.07-4.56 14.77 41.85 28.4 51-1.39 4.47-14.52-5.3-21.71-22.25-39.85-28.47-31.75-16-65.49 2.95-79.67C204.2 140.1 251.9 197 262 205.3c37.17-109 100.5-105.5 102.4-105.5 25.16-.81 44.19 10.59 44.83 28.65 .25 7.69-4.17 22.59-19.52 23.13z"],teamspeak:[512,512,[],"f4f9","M244.2 346.8c2.4-12.3-12-30-32.4-48.7-20.9-19.2-48.2-39.1-63.4-46.6-21.7-12-41.7-1.8-46.3 22.7-5 26.2 0 51.4 14.5 73.9 10.2 15.5 25.4 22.7 43.4 24 11.6 .6 52.5 2.2 61.7-1 11.9-4.3 20.1-11.8 22.5-24.3zm205 20.8a5.22 5.22 0 0 0 -8.3 2.4c-8 25.4-44.7 112.5-172.1 121.5-149.7 10.5 80.3 43.6 145.4-6.4 22.7-17.4 47.6-35 46.6-85.4-.4-10.1-4.9-26.69-11.6-32.1zm62-122.4c-.3-18.9-8.6-33.4-26-42.2-2.9-1.3-5-2.7-5.9-6.4A222.6 222.6 0 0 0 438.9 103c-1.1-1.5-3.5-3.2-2.2-5 8.5-11.5-.3-18-7-24.4Q321.4-31.11 177.4 13.09c-40.1 12.3-73.9 35.6-102 67.4-4 4.3-6.7 9.1-3 14.5 3 4 1.3 6.2-1 9.3C51.6 132 38.2 162.6 32.1 196c-.7 4.3-2.9 6-6.4 7.8-14.2 7-22.5 18.5-24.9 34L0 264.3v20.9c0 30.8 21 50.4 51.8 49 7.7-.3 11.7-4.3 12-11.5 2-77.5-2.4-95.4 3.7-125.8C92.1 72.39 234.3 5 345.3 65.39 411.4 102 445.7 159 447.6 234.8c.8 28.2 0 56.5 0 84.6 0 7 2.2 12.5 9.4 14.2 24.1 5 49.2-12 53.2-36.7 2.9-17.1 1-34.5 1-51.7zm-159.6 131.5c36.5 2.8 59.3-28.5 58.4-60.5-2.1-45.2-66.2-16.5-87.8-8-73.2 28.1-45 54.9-22.2 60.8z"],telegram:[496,512,[62462,"telegram-plane"],"f2c6","M248 8C111 8 0 119 0 256S111 504 248 504 496 392.1 496 256 384.1 8 248 8zM362.1 176.7c-3.732 39.22-19.88 134.4-28.1 178.3-3.476 18.58-10.32 24.82-16.95 25.42-14.4 1.326-25.34-9.517-39.29-18.66-21.83-14.31-34.16-23.22-55.35-37.18-24.49-16.14-8.612-25 5.342-39.5 3.652-3.793 67.11-61.51 68.33-66.75 .153-.655 .3-3.1-1.154-4.384s-3.59-.849-5.135-.5q-3.283 .746-104.6 69.14-14.85 10.19-26.89 9.934c-8.855-.191-25.89-5.006-38.55-9.123-15.53-5.048-27.88-7.717-26.8-16.29q.84-6.7 18.45-13.7 108.4-47.25 144.6-62.3c68.87-28.65 83.18-33.62 92.51-33.79 2.052-.034 6.639 .474 9.61 2.885a10.45 10.45 0 0 1 3.53 6.716A43.76 43.76 0 0 1 362.1 176.7z"],"tencent-weibo":[384,512,[],"f1d5","M72.3 495.8c1.4 19.9-27.6 22.2-29.7 2.9C31 368.8 73.7 259.2 144 185.5c-15.6-34 9.2-77.1 50.6-77.1 30.3 0 55.1 24.6 55.1 55.1 0 44-49.5 70.8-86.9 45.1-65.7 71.3-101.4 169.8-90.5 287.2zM192 .1C66.1 .1-12.3 134.3 43.7 242.4 52.4 259.8 79 246.9 70 229 23.7 136.4 91 29.8 192 29.8c75.4 0 136.9 61.4 136.9 136.9 0 90.8-86.9 153.9-167.7 133.1-19.1-4.1-25.6 24.4-6.6 29.1 110.7 23.2 204-60 204-162.3C358.6 74.7 284 .1 192 .1z"],"the-red-yeti":[512,512,[],"f69d","M488.2 241.7l20.7 7.1c-9.6-23.9-23.9-37-31.7-44.8l7.1-18.2c.2 0 12.3-27.8-2.5-30.7-.6-11.3-6.6-27-18.4-27-7.6-10.6-17.7-12.3-30.7-5.9a122.2 122.2 0 0 0 -25.3 16.5c-5.3-6.4-3 .4-3-29.8-37.1-24.3-45.4-11.7-74.8 3l.5 .5a239.4 239.4 0 0 0 -68.4-13.3c-5.5-8.7-18.6-19.1-25.1-25.1l24.8 7.1c-5.5-5.5-26.8-12.9-34.2-15.2 18.2-4.1 29.8-20.8 42.5-33-34.9-10.1-67.9-5.9-97.9 11.8l12-44.2L182 0c-31.6 24.2-33 41.9-33.7 45.5-.9-2.4-6.3-19.6-15.2-27a35.12 35.12 0 0 0 -.5 25.3c3 8.4 5.9 14.8 8.4 18.9-16-3.3-28.3-4.9-49.2 0h-3.7l33 14.3a194.3 194.3 0 0 0 -46.7 67.4l-1.7 8.4 1.7 1.7 7.6-4.7c-3.3 11.6-5.3 19.4-6.6 25.8a200.2 200.2 0 0 0 -27.8 40.3c-15 1-31.8 10.8-40.3 14.3l3 3.4 28.8 1c-.5 1-.7 2.2-1.2 3.2-7.3 6.4-39.8 37.7-33 80.7l20.2-22.4c.5 1.7 .7 3.4 1.2 5.2 0 25.5 .4 89.6 64.9 150.5 43.6 40 96 60.2 157.5 60.2 121.7 0 223-87.3 223-211.5 6.8-9.7-1.2 3 16.7-25.1l13 14.3 2.5-.5A181.8 181.8 0 0 0 495 255a44.74 44.74 0 0 0 -6.8-13.3zM398 111.2l-.5 21.9c5.5 18.1 16.9 17.2 22.4 17.2l-3.4-4.7 22.4-5.4a242.4 242.4 0 0 1 -27 0c12.8-2.1 33.3-29 43-11.3 3.4 7.6 6.4 17.2 9.3 27.8l1.7-5.9a56.38 56.38 0 0 1 -1.7-15.2c5.4 .5 8.8 3.4 9.3 10.1 .5 6.4 1.7 14.8 3.4 25.3l4.7-11.3c4.6 0 4.5-3.6-2.5 20.7-20.9-8.7-35.1-8.4-46.5-8.4l18.2-16c-25.3 8.2-33 10.8-54.8 20.9-1.1-5.4-5-13.5-16-19.9-3.2 3.8-2.8 .9-.7 14.8h-2.5a62.32 62.32 0 0 0 -8.4-23.1l4.2-3.4c8.4-7.1 11.8-14.3 10.6-21.9-.5-6.4-5.4-13.5-13.5-20.7 5.6-3.4 15.2-.4 28.3 8.5zm-39.6-10.1c2.7 1.9 11.4 5.4 18.9 17.2 4.2 8.4 4 9.8 3.4 11.1-.5 2.4-.5 4.3-3 7.1-1.7 2.5-5.4 4.7-11.8 7.6-7.6-13-16.5-23.6-27.8-31.2zM91 143.1l1.2-1.7c1.2-2.9 4.2-7.6 9.3-15.2l2.5-3.4-13 12.3 5.4-4.7-10.1 9.3-4.2 1.2c12.3-24.1 23.1-41.3 32.5-50.2 9.3-9.3 16-16 20.2-19.4l-6.4 1.2c-11.3-4.2-19.4-7.1-24.8-8.4 2.5-.5 3.7-.5 3.2-.5 10.3 0 17.5 .5 20.9 1.2a52.35 52.35 0 0 0 16 2.5l.5-1.7-8.4-35.8 13.5 29a42.89 42.89 0 0 0 5.9-14.3c1.7-6.4 5.4-13 10.1-19.4s7.6-10.6 9.3-11.3a234.7 234.7 0 0 0 -6.4 25.3l-1.7 7.1-.5 4.7 2.5 2.5C190.4 39.9 214 34 239.8 34.5l21.1 .5c-11.8 13.5-27.8 21.9-48.5 24.8a201.3 201.3 0 0 1 -23.4 2.9l-.2-.5-2.5-1.2a20.75 20.75 0 0 0 -14 2c-2.5-.2-4.9-.5-7.1-.7l-2.5 1.7 .5 1.2c2 .2 3.9 .5 6.2 .7l-2 3.4 3.4-.5-10.6 11.3c-4.2 3-5.4 6.4-4.2 9.3l5.4-3.4h1.2a39.4 39.4 0 0 1 25.3-15.2v-3c6.4 .5 13 1 19.4 1.2 6.4 0 8.4 .5 5.4 1.2a189.6 189.6 0 0 1 20.7 13.5c13.5 10.1 23.6 21.9 30 35.4 8.8 18.2 13.5 37.1 13.5 56.6a141.1 141.1 0 0 1 -3 28.3 209.9 209.9 0 0 1 -16 46l2.5 .5c18.2-19.7 41.9-16 49.2-16l-6.4 5.9 22.4 17.7-1.7 30.7c-5.4-12.3-16.5-21.1-33-27.8 16.5 14.8 23.6 21.1 21.9 20.2-4.8-2.8-3.5-1.9-10.8-3.7 4.1 4.1 17.5 18.8 18.2 20.7l.2 .2-.2 .2c0 1.8 1.6-1.2-14 22.9-75.2-15.3-106.3-42.7-141.2-63.2l11.8 1.2c-11.8-18.5-15.6-17.7-38.4-26.1L149 225c-8.8-3-18.2-3-28.3 .5l7.6-10.6-1.2-1.7c-14.9 4.3-19.8 9.2-22.6 11.3-1.1-5.5-2.8-12.4-12.3-28.8l-1.2 27-13.2-5c1.5-25.2 5.4-50.5 13.2-74.6zm276.5 330c-49.9 25-56.1 22.4-59 23.9-29.8-11.8-50.9-31.7-63.5-58.8l30 16.5c-9.8-9.3-18.3-16.5-38.4-44.3l11.8 23.1-17.7-7.6c14.2 21.1 23.5 51.7 66.6 73.5-120.8 24.2-199-72.1-200.9-74.3a262.6 262.6 0 0 0 35.4 24.8c3.4 1.7 7.1 2.5 10.1 1.2l-16-20.7c9.2 4.2 9.5 4.5 69.1 29-42.5-20.7-73.8-40.8-93.2-60.2-.5 6.4-1.2 10.1-1.2 10.1a80.25 80.25 0 0 1 20.7 26.6c-39-18.9-57.6-47.6-71.3-82.6 49.9 55.1 118.9 37.5 120.5 37.1 34.8 16.4 69.9 23.6 113.9 10.6 3.3 0 20.3 17 25.3 39.1l4.2-3-2.5-23.6c9 9 24.9 22.6 34.4 13-15.6-5.3-23.5-9.5-29.5-31.7 4.6 4.2 7.6 9 27.8 15l1.2-1.2-10.5-14.2c11.7-4.8-3.5 1 32-10.8 4.3 34.3 9 49.2 .7 89.5zm115.3-214.4l-2.5 .5 3 9.3c-3.5 5.9-23.7 44.3-71.6 79.7-39.5 29.8-76.6 39.1-80.9 40.3l-7.6-7.1-1.2 3 14.3 16-7.1-4.7 3.4 4.2h-1.2l-21.9-13.5 9.3 26.6-19-27.9-1.2 2.5 7.6 29c-6.1-8.2-21-32.6-56.8-39.6l32.5 21.2a214.8 214.8 0 0 1 -93.2-6.4c-4.2-1.2-8.9-2.5-13.5-4.2l1.2-3-44.8-22.4 26.1 22.4c-57.7 9.1-113-25.4-126.4-83.4l-2.5-16.4-22.27 22.3c19.5-57.5 25.6-57.9 51.4-70.1-9.1-5.3-1.6-3.3-38.4-9.3 15.8-5.8 33-15.4 73 5.2a18.5 18.5 0 0 1 3.7-1.7c.6-3.2 .4-.8 1-11.8 3.9 10 3.6 8.7 3 9.3l1.7 .5c12.7-6.5 8.9-4.5 17-8.9l-5.4 13.5 22.3-5.8-8.4 8.4 2.5 2.5c4.5-1.8 30.3 3.4 40.8 16l-23.6-2.5c39.4 23 51.5 54 55.8 69.6l1.7-1.2c-2.8-22.3-12.4-33.9-16-40.1 4.2 5 39.2 34.6 110.4 46-11.3-.5-23.1 5.4-34.9 18.9l46.7-20.2-9.3 21.9c7.6-10.1 14.8-23.6 21.2-39.6v-.5l1.2-3-1.2 16c13.5-41.8 25.3-78.5 35.4-109.7l13.5-27.8v-2l-5.4-4.2h10.1l5.9 4.2 2.5-1.2-3.4-16 12.3 18.9 41.8-20.2-14.8 13 .5 2.9 17.7-.5a184 184 0 0 1 33 4.2l-23.6 2.5-1.2 3 26.6 23.1a254.2 254.2 0 0 1 27 32c-11.2-3.3-10.3-3.4-21.2-3.4l12.3 32.5zm-6.1-71.3l-3.9 13-14.3-11.8zm-254.8 7.1c1.7 10.6 4.7 17.7 8.8 21.9-9.3 6.6-27.5 13.9-46.5 16l.5 1.2a50.22 50.22 0 0 0 24.8-2.5l-7.1 13c4.2-1.7 10.1-7.1 17.7-14.8 11.9-5.5 12.7-5.1 20.2-16-12.7-6.4-15.7-13.7-18.4-18.8zm3.7-102.3c-6.4-3.4-10.6 3-12.3 18.9s2.5 29.5 11.8 39.6 18.2 10.6 26.1 3 3.4-23.6-11.3-47.7a39.57 39.57 0 0 0 -14.27-13.8zm-4.7 46.3c5.4 2.2 10.5 1.9 12.3-10.6v-4.7l-1.2 .5c-4.3-3.1-2.5-4.5-1.7-6.2l.5-.5c-.9-1.2-5-8.1-12.5 4.7-.5-13.5 .5-21.9 3-24.8 1.2-2.5 4.7-1.2 11.3 4.2 6.4 5.4 11.3 16 15.2 32.5 6.5 28-19.8 26.2-26.9 4.9zm-45-5.5c1.6 .3 9.3-1.1 9.3-14.8h-.5c-5.4-1.1-2.2-5.5-.7-5.9-1.7-3-3.4-4.2-5.4-4.7-8.1 0-11.6 12.7-8.1 21.2a7.51 7.51 0 0 0 5.43 4.2zM216 82.9l-2.5 .5 .5 3a48.94 48.94 0 0 1 26.1 5.9c-2.5-5.5-10-14.3-28.3-14.3l.5 2.5zm-71.8 49.4c21.7 16.8 16.5 21.4 46.5 23.6l-2.9-4.7a42.67 42.67 0 0 0 14.8-28.3c1.7-16-1.2-29.5-8.8-41.3l13-7.6a2.26 2.26 0 0 0 -.5-1.7 14.21 14.21 0 0 0 -13.5 1.7c-12.7 6.7-28 20.9-29 22.4-1.7 1.7-3.4 5.9-5.4 13.5a99.61 99.61 0 0 0 -2.9 23.6c-4.7-8-10.5-6.4-19.9-5.9l7.1 7.6c-16.5 0-23.3 15.4-23.6 16 6.8 0 4.6-7.6 30-12.3-4.3-6.3-3.3-5-4.9-6.6zm18.7-18.7c1.2-7.6 3.4-13 6.4-17.2 5.4-6.4 10.6-10.1 16-11.8 4.2-1.7 7.1 1.2 10.1 9.3a72.14 72.14 0 0 1 3 25.3c-.5 9.3-3.4 17.2-8.4 23.1-2.9 3.4-5.4 5.9-6.4 7.6a39.21 39.21 0 0 1 -11.3-.5l-7.1-3.4-5.4-6.4c.8-10 1.3-18.8 3.1-26zm42 56.1c-34.8 14.4-34.7 14-36.1 14.3-20.8 4.7-19-24.4-18.9-24.8l5.9-1.2-.5-2.5c-20.2-2.6-31 4.2-32.5 4.9 .5 .5 3 3.4 5.9 9.3 4.2-6.4 8.8-10.1 15.2-10.6a83.47 83.47 0 0 0 1.7 33.7c.1 .5 2.6 17.4 27.5 24.1 11.3 3 27 1.2 48.9-5.4l-9.2 .5c-4.2-14.8-6.4-24.8-5.9-29.5 11.3-8.8 21.9-11.3 30.7-7.6h2.5l-11.8-7.6-7.1 .5c-5.9 1.2-12.3 4.2-19.4 8.4z"],themeco:[448,512,[],"f5c6","M202.9 8.43c9.9-5.73 26-5.82 35.95-.21L430 115.8c10 5.6 18 19.44 18 30.86V364c0 11.44-8.06 25.29-18 31L238.8 503.7c-9.93 5.66-26 5.57-35.85-.21L17.86 395.1C8 389.3 0 375.4 0 364V146.7c0-11.44 8-25.36 17.91-31.08zm-77.4 199.8c-15.94 0-31.89 .14-47.83 .14v101.4H96.8V280h28.7c49.71 0 49.56-71.74 0-71.74zm140.1 100.3l-30.73-34.64c37-7.51 34.8-65.23-10.87-65.51-16.09 0-32.17-.14-48.26-.14v101.6h19.13v-33.91h18.41l29.56 33.91h22.76zm-41.59-82.32c23.34 0 23.26 32.46 0 32.46h-29.13v-32.46zm-95.56-1.6c21.18 0 21.11 38.85 0 38.85H96.18v-38.84zm192.6-18.25c-68.46 0-71 105.8 0 105.8 69.48-.01 69.41-105.8 0-105.8zm0 17.39c44.12 0 44.8 70.86 0 70.86s-44.43-70.86 0-70.86z"],themeisle:[512,512,[],"f2b2","M208 88.29c0-10 6.286-21.71 17.72-21.71 11.14 0 17.71 11.71 17.71 21.71 0 10.28-6.572 21.71-17.71 21.71C214.3 110 208 98.57 208 88.29zm304 160c0 36-11.43 102.3-36.29 129.7-22.86 24.86-87.43 61.14-120.9 70.57l-1.143 .286v32.57c0 16.29-12.57 30.57-29.14 30.57-10 0-19.43-5.714-24.57-14.29-5.427 8.572-14.86 14.29-24.86 14.29-10 0-19.43-5.714-24.86-14.29-5.142 8.572-14.57 14.29-24.57 14.29-10.29 0-19.43-5.714-24.86-14.29-5.143 8.572-14.57 14.29-24.57 14.29-18.86 0-29.43-15.71-29.43-32.86-16.29 12.28-35.72 19.43-56.57 19.43-22 0-43.43-8.285-60.29-22.86 10.28-.286 20.57-2.286 30.28-5.714-20.86-5.714-39.43-18.86-52-36.29 21.37 4.645 46.21 1.673 67.14-11.14-22-22-56.57-58.86-68.57-87.43C1.143 321.7 0 303.7 0 289.4c0-49.71 20.29-160 86.29-160 10.57 0 18.86 4.858 23.14 14.86a158.8 158.8 0 0 1 12-15.43c2-2.572 5.714-5.429 7.143-8.286 7.999-12.57 11.71-21.14 21.71-34C182.6 45.43 232 17.14 285.1 17.14c6 0 12 .285 17.71 1.143C313.7 6.571 328.9 0 344.6 0c14.57 0 29.71 6 40 16.29 .857 .858 1.428 2.286 1.428 3.428 0 3.714-10.28 13.43-12.86 16.29 4.286 1.429 15.71 6.858 15.71 12 0 2.857-2.857 5.143-4.571 7.143 31.43 27.71 49.43 67.14 56.29 108 4.286-5.143 10.28-8.572 17.14-8.572 10.57 0 20.86 7.144 28.57 14C507.1 187.1 512 221.7 512 248.3zM188 89.43c0 18.29 12.57 37.14 32.29 37.14 19.71 0 32.28-18.86 32.28-37.14 0-18-12.57-36.86-32.28-36.86-19.72 0-32.29 18.86-32.29 36.86zM237.7 194c0-19.71 3.714-39.14 8.571-58.29-52.04 79.53-13.53 184.6 68.86 184.6 21.43 0 42.57-7.714 60-20 2-7.429 3.714-14.86 3.714-22.57 0-14.29-6.286-21.43-20.57-21.43-4.571 0-9.143 .857-13.43 1.714-63.34 12.67-107.1 3.669-107.1-63.1zm-41.14 254.9c0-11.14-8.858-20.86-20.29-20.86-11.43 0-20 9.715-20 20.86v32.57c0 11.14 8.571 21.14 20 21.14 11.43 0 20.29-9.715 20.29-21.14v-32.57zm49.14 0c0-11.14-8.572-20.86-20-20.86-11.43 0-20.29 9.715-20.29 20.86v32.57c0 11.14 8.857 21.14 20.29 21.14 11.43 0 20-10 20-21.14v-32.57zm49.71 0c0-11.14-8.857-20.86-20.28-20.86-11.43 0-20.29 9.715-20.29 20.86v32.57c0 11.14 8.857 21.14 20.29 21.14 11.43 0 20.28-9.715 20.28-21.14v-32.57zm49.72 0c0-11.14-8.857-20.86-20.29-20.86-11.43 0-20.29 9.715-20.29 20.86v32.57c0 11.14 8.858 21.14 20.29 21.14 11.43 0 20.29-10 20.29-21.14v-32.57zM421.7 286c-30.86 59.14-90.29 102.6-158.6 102.6-96.57 0-160.6-84.57-160.6-176.6 0-16.86 2-33.43 6-49.71-20 33.72-29.71 72.57-29.71 111.4 0 60.29 24.86 121.7 71.43 160.9 5.143-9.714 14.86-16.29 26-16.29 10 0 19.43 5.714 24.57 14.29 5.429-8.571 14.57-14.29 24.86-14.29 10 0 19.43 5.714 24.57 14.29 5.429-8.571 14.86-14.29 24.86-14.29 10 0 19.43 5.714 24.86 14.29 5.143-8.571 14.57-14.29 24.57-14.29 10.86 0 20.86 6.572 25.71 16 43.43-36.29 68.57-92 71.43-148.3zm10.57-99.71c0-53.71-34.57-105.7-92.57-105.7-30.28 0-58.57 15.14-78.86 36.86C240.9 183.8 233.4 254 302.3 254c28.81 0 97.36-28.54 84.29 36.86 28.86-26 45.71-65.71 45.71-104.6z"],"think-peaks":[576,512,[],"f731","M465.4 409.4l87.1-150.2-32-.3-55.1 95L259.2 0 23 407.4l32 .3L259.2 55.6zm-355.3-44.1h32.1l117.4-202.5L463 511.9l32.5 .1-235.8-404.6z"],tiktok:[448,512,[],"e07b","M448 209.9a210.1 210.1 0 0 1 -122.8-39.25V349.4A162.6 162.6 0 1 1 185 188.3V278.2a74.62 74.62 0 1 0 52.23 71.18V0l88 0a121.2 121.2 0 0 0 1.86 22.17h0A122.2 122.2 0 0 0 381 102.4a121.4 121.4 0 0 0 67 20.14z"],"trade-federation":[496,512,[],"f513","M248 8.8c-137 0-248 111-248 248s111 248 248 248 248-111 248-248-111-248-248-248zm0 482.8c-129.7 0-234.8-105.1-234.8-234.8S118.3 22 248 22s234.8 105.1 234.8 234.8S377.7 491.6 248 491.6zm155.1-328.5v-46.8H209.3V198H54.2l36.7 46h117.7v196.8h48.8V245h83.3v-47h-83.3v-34.8h145.7zm-73.3 45.1v23.9h-82.9v197.4h-26.8V232.1H96.3l-20.1-23.9h143.9v-80.6h171.8V152h-145v56.2zm-161.3-69l-12.4-20.7 2.1 23.8-23.5 5.4 23.3 5.4-2.1 24 12.3-20.5 22.2 9.5-15.7-18.1 15.8-18.1zm-29.6-19.7l9.3-11.5-12.7 5.9-8-12.4 1.7 13.9-14.3 3.8 13.7 2.7-.8 14.7 6.8-12.2 13.8 5.3zm165.4 145.2l-13.1 5.6-7.3-12.2 1.3 14.2-13.9 3.2 13.9 3.2-1.2 14.2 7.3-12.2 13.1 5.5-9.4-10.7zm106.9-77.2l-20.9 9.1-12-19.6 2.2 22.7-22.3 5.4 22.2 4.9-1.8 22.9 11.5-19.6 21.2 8.8-15.1-17zM248 29.9c-125.3 0-226.9 101.6-226.9 226.9S122.7 483.7 248 483.7s226.9-101.6 226.9-226.9S373.3 29.9 248 29.9zM342.6 196v51h-83.3v195.7h-52.7V245.9H89.9l-40-49.9h157.4v-81.6h197.8v50.7H259.4V196zM248 43.2c60.3 0 114.8 25 153.6 65.2H202.5V190H45.1C73.1 104.8 153.4 43.2 248 43.2zm0 427.1c-117.9 0-213.6-95.6-213.6-213.5 0-21.2 3.1-41.8 8.9-61.1L87.1 252h114.7v196.8h64.6V253h83.3v-62.7h-83.2v-19.2h145.6v-50.8c30.8 37 49.3 84.6 49.3 136.5 .1 117.9-95.5 213.5-213.4 213.5zM178.8 275l-11-21.4 1.7 24.5-23.7 3.9 23.8 5.9-3.7 23.8 13-20.9 21.5 10.8-15.8-18.8 16.9-17.1z"],trello:[448,512,[],"f181","M392.3 32H56.1C25.1 32 0 57.1 0 88c-.1 0 0-4 0 336 0 30.9 25.1 56 56 56h336.2c30.8-.2 55.7-25.2 55.7-56V88c.1-30.8-24.8-55.8-55.6-56zM197 371.3c-.2 14.7-12.1 26.6-26.9 26.6H87.4c-14.8 .1-26.9-11.8-27-26.6V117.1c0-14.8 12-26.9 26.9-26.9h82.9c14.8 0 26.9 12 26.9 26.9v254.2zm193.1-112c0 14.8-12 26.9-26.9 26.9h-81c-14.8 0-26.9-12-26.9-26.9V117.2c0-14.8 12-26.9 26.8-26.9h81.1c14.8 0 26.9 12 26.9 26.9v142.1z"],tumblr:[320,512,[],"f173","M309.8 480.3c-13.6 14.5-50 31.7-97.4 31.7-120.8 0-147-88.8-147-140.6v-144H17.9c-5.5 0-10-4.5-10-10v-68c0-7.2 4.5-13.6 11.3-16 62-21.8 81.5-76 84.3-117.1 .8-11 6.5-16.3 16.1-16.3h70.9c5.5 0 10 4.5 10 10v115.2h83c5.5 0 10 4.4 10 9.9v81.7c0 5.5-4.5 10-10 10h-83.4V360c0 34.2 23.7 53.6 68 35.8 4.8-1.9 9-3.2 12.7-2.2 3.5 .9 5.8 3.4 7.4 7.9l22 64.3c1.8 5 3.3 10.6-.4 14.5z"],twitch:[512,512,[],"f1e8","M391.2 103.5H352.5v109.7h38.63zM285 103H246.4V212.8H285zM120.8 0 24.31 91.42V420.6H140.1V512l96.53-91.42h77.25L487.7 256V0zM449.1 237.8l-77.22 73.12H294.6l-67.6 64v-64H140.1V36.58H449.1z"],twitter:[512,512,[],"f099","M459.4 151.7c.325 4.548 .325 9.097 .325 13.65 0 138.7-105.6 298.6-298.6 298.6-59.45 0-114.7-17.22-161.1-47.11 8.447 .974 16.57 1.299 25.34 1.299 49.06 0 94.21-16.57 130.3-44.83-46.13-.975-84.79-31.19-98.11-72.77 6.498 .974 12.99 1.624 19.82 1.624 9.421 0 18.84-1.3 27.61-3.573-48.08-9.747-84.14-51.98-84.14-102.1v-1.299c13.97 7.797 30.21 12.67 47.43 13.32-28.26-18.84-46.78-51.01-46.78-87.39 0-19.49 5.197-37.36 14.29-52.95 51.65 63.67 129.3 105.3 216.4 109.8-1.624-7.797-2.599-15.92-2.599-24.04 0-57.83 46.78-104.9 104.9-104.9 30.21 0 57.5 12.67 76.67 33.14 23.72-4.548 46.46-13.32 66.6-25.34-7.798 24.37-24.37 44.83-46.13 57.83 21.12-2.273 41.58-8.122 60.43-16.24-14.29 20.79-32.16 39.31-52.63 54.25z"],typo3:[448,512,[],"f42b","M178.7 78.4c0-24.7 5.4-32.4 13.9-39.4-69.5 8.5-149.3 34-176.3 66.4-5.4 7.7-9.3 20.8-9.3 37.1C7 246 113.8 480 191.1 480c36.3 0 97.3-59.5 146.7-139-7 2.3-11.6 2.3-18.5 2.3-57.2 0-140.6-198.5-140.6-264.9zM301.5 32c-30.1 0-41.7 5.4-41.7 36.3 0 66.4 53.8 198.5 101.7 198.5 26.3 0 78.8-99.7 78.8-182.3 0-40.9-67-52.5-138.8-52.5z"],uber:[448,512,[],"f402","M414.1 32H33.9C15.2 32 0 47.2 0 65.9V446c0 18.8 15.2 34 33.9 34H414c18.7 0 33.9-15.2 33.9-33.9V65.9C448 47.2 432.8 32 414.1 32zM237.6 391.1C163 398.6 96.4 344.2 88.9 269.6h94.4V290c0 3.7 3 6.8 6.8 6.8H258c3.7 0 6.8-3 6.8-6.8v-67.9c0-3.7-3-6.8-6.8-6.8h-67.9c-3.7 0-6.8 3-6.8 6.8v20.4H88.9c7-69.4 65.4-122.2 135.1-122.2 69.7 0 128.1 52.8 135.1 122.2 7.5 74.5-46.9 141.1-121.5 148.6z"],ubuntu:[496,512,[],"f7df","M248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S385 8 248 8zm52.7 93c8.8-15.2 28.3-20.5 43.5-11.7 15.3 8.8 20.5 28.3 11.7 43.6-8.8 15.2-28.3 20.5-43.5 11.7-15.3-8.9-20.5-28.4-11.7-43.6zM87.4 287.9c-17.6 0-31.9-14.3-31.9-31.9 0-17.6 14.3-31.9 31.9-31.9 17.6 0 31.9 14.3 31.9 31.9 0 17.6-14.3 31.9-31.9 31.9zm28.1 3.1c22.3-17.9 22.4-51.9 0-69.9 8.6-32.8 29.1-60.7 56.5-79.1l23.7 39.6c-51.5 36.3-51.5 112.5 0 148.8L172 370c-27.4-18.3-47.8-46.3-56.5-79zm228.7 131.7c-15.3 8.8-34.7 3.6-43.5-11.7-8.8-15.3-3.6-34.8 11.7-43.6 15.2-8.8 34.7-3.6 43.5 11.7 8.8 15.3 3.6 34.8-11.7 43.6zm.3-69.5c-26.7-10.3-56.1 6.6-60.5 35-5.2 1.4-48.9 14.3-96.7-9.4l22.5-40.3c57 26.5 123.4-11.7 128.9-74.4l46.1 .7c-2.3 34.5-17.3 65.5-40.3 88.4zm-5.9-105.3c-5.4-62-71.3-101.2-128.9-74.4l-22.5-40.3c47.9-23.7 91.5-10.8 96.7-9.4 4.4 28.3 33.8 45.3 60.5 35 23.1 22.9 38 53.9 40.2 88.5l-46 .6z"],uikit:[448,512,[],"f403","M443.9 128v256L218 512 0 384V169.7l87.6 45.1v117l133.5 75.5 135.8-75.5v-151l-101.1-57.6 87.6-53.1L443.9 128zM308.6 49.1L223.8 0l-88.6 54.8 86 47.3 87.4-53z"],umbraco:[510,512,[],"f8e8","M255.4 8C118.4 7.83 7.14 118.7 7 255.7c-.07 137 111 248.2 248 248.3 136.9 0 247.8-110.7 248-247.7S392.3 8.17 255.4 8zm145 266q-1.14 40.68-14 65t-43.51 35q-30.61 10.7-85.45 10.47h-4.6q-54.78 .22-85.44-10.47t-43.52-35q-12.85-24.36-14-65a224.8 224.8 0 0 1 0-30.71 418.4 418.4 0 0 1 3.6-43.88c1.88-13.39 3.57-22.58 5.4-32 1-4.88 1.28-6.42 1.82-8.45a5.09 5.09 0 0 1 4.9-3.89h.69l32 5a5.07 5.07 0 0 1 4.16 5 5 5 0 0 1 0 .77l-1.7 8.78q-2.41 13.25-4.84 33.68a380.6 380.6 0 0 0 -2.64 42.15q-.28 40.43 8.13 59.83a43.87 43.87 0 0 0 31.31 25.18A243 243 0 0 0 250 340.6h10.25a242.6 242.6 0 0 0 57.27-5.16 43.86 43.86 0 0 0 31.15-25.23q8.53-19.42 8.13-59.78a388 388 0 0 0 -2.6-42.15q-2.48-20.38-4.89-33.68l-1.69-8.78a5 5 0 0 1 0-.77 5 5 0 0 1 4.2-5l32-5h.82a5 5 0 0 1 4.9 3.89c.55 2.05 .81 3.57 1.83 8.45 1.82 9.62 3.52 18.78 5.39 32a415.7 415.7 0 0 1 3.61 43.88 228.1 228.1 0 0 1 -.04 30.73z"],uncharted:[448,512,[],"e084","M171.7 232.8A5.381 5.381 0 0 0 176.7 229.5 48.08 48.08 0 0 1 191.6 204.2c1.243-.828 1.657-2.484 1.657-4.141a4.22 4.22 0 0 0 -2.071-3.312L74.43 128.5 148.1 85a9.941 9.941 0 0 0 4.968-8.281 9.108 9.108 0 0 0 -4.968-8.281L126.6 55.6a9.748 9.748 0 0 0 -9.523 0l-100.2 57.97a9.943 9.943 0 0 0 -4.969 8.281V236.1a9.109 9.109 0 0 0 4.969 8.281L39.24 258.1a8.829 8.829 0 0 0 4.968 1.242 9.4 9.4 0 0 0 6.625-2.484 10.8 10.8 0 0 0 2.9-7.039V164.5L169.7 232.4A4.5 4.5 0 0 0 171.7 232.8zM323.3 377.7a12.48 12.48 0 0 0 -4.969 1.242l-74.53 43.06V287.9c0-2.9-2.9-5.8-6.211-4.555a53.04 53.04 0 0 1 -28.98 .414 4.86 4.86 0 0 0 -6.21 4.555V421.6l-74.53-43.06a8.83 8.83 0 0 0 -4.969-1.242 9.631 9.631 0 0 0 -9.523 9.523v26.08a9.107 9.107 0 0 0 4.969 8.281l100.2 57.55A8.829 8.829 0 0 0 223.5 480a11.03 11.03 0 0 0 4.969-1.242l100.2-57.55a9.941 9.941 0 0 0 4.968-8.281V386.8C332.8 382.3 328.2 377.7 323.3 377.7zM286 78a23 23 0 1 0 -23-23A23 23 0 0 0 286 78zm63.63-10.09a23 23 0 1 0 23 23A23 23 0 0 0 349.6 67.91zM412.8 151.6a23 23 0 1 0 -23-23A23 23 0 0 0 412.8 151.6zm-63.18-9.2a23 23 0 1 0 23 23A23 23 0 0 0 349.6 142.4zm-63.63 83.24a23 23 0 1 0 -23-23A23 23 0 0 0 286 225.6zm-62.07 36.36a23 23 0 1 0 -23-23A23 23 0 0 0 223.9 262zm188.9-82.36a23 23 0 1 0 23 23A23 23 0 0 0 412.8 179.6zm0 72.27a23 23 0 1 0 23 23A23 23 0 0 0 412.8 251.9z"],uniregistry:[384,512,[],"f404","M192 480c39.5 0 76.2-11.8 106.8-32.2H85.3C115.8 468.2 152.5 480 192 480zm-89.1-193.1v-12.4H0v12.4c0 2.5 0 5 .1 7.4h103.1c-.2-2.4-.3-4.9-.3-7.4zm20.5 57H8.5c2.6 8.5 5.8 16.8 9.6 24.8h138.3c-12.9-5.7-24.1-14.2-33-24.8zm-17.7-34.7H1.3c.9 7.6 2.2 15 3.9 22.3h109.7c-4-6.9-7.2-14.4-9.2-22.3zm-2.8-69.3H0v17.3h102.9zm0-173.2H0v4.9h102.9zm0-34.7H0v2.5h102.9zm0 69.3H0v7.4h102.9zm0 104H0v14.8h102.9zm0-69.3H0v9.9h102.9zm0 34.6H0V183h102.9zm166.2 160.9h109.7c1.8-7.3 3.1-14.7 3.9-22.3H278.3c-2.1 7.9-5.2 15.4-9.2 22.3zm12-185.7H384V136H281.1zm0 37.2H384v-12.4H281.1zm0-74.3H384v-7.4H281.1zm0-76.7v2.5H384V32zm-203 410.9h227.7c11.8-8.7 22.7-18.6 32.2-29.7H44.9c9.6 11 21.4 21 33.2 29.7zm203-371.3H384v-4.9H281.1zm0 148.5H384v-14.8H281.1zM38.8 405.7h305.3c6.7-8.5 12.6-17.6 17.8-27.2H23c5.2 9.6 9.2 18.7 15.8 27.2zm188.8-37.1H367c3.7-8 5.8-16.2 8.5-24.8h-115c-8.8 10.7-20.1 19.2-32.9 24.8zm53.5-81.7c0 2.5-.1 5-.4 7.4h103.1c.1-2.5 .2-4.9 .2-7.4v-12.4H281.1zm0-29.7H384v-17.3H281.1z"],unity:[448,512,[],"e049","M243.6 91.6L323.7 138.4C326.6 140 326.7 144.6 323.7 146.2L228.5 201.9C225.6 203.6 222.2 203.4 219.5 201.9L124.4 146.2C121.4 144.6 121.4 139.1 124.4 138.4L204.4 91.6V0L0 119.4V358.3L78.38 312.5V218.9C78.33 215.6 82.21 213.2 85.09 214.1L180.3 270.6C183.2 272.3 184.8 275.3 184.8 278.5V389.7C184.8 393 180.1 395.4 178.1 393.6L97.97 346.8L19.58 392.6L224 512L428.4 392.6L350 346.8L269.9 393.6C267.1 395.3 263.1 393.1 263.2 389.7V278.5C263.2 275.1 265.1 272.2 267.7 270.6L362.9 214.1C365.7 213.2 369.7 215.5 369.6 218.9V312.5L448 358.3V119.4L243.6 0V91.6z"],unsplash:[448,512,[],"e07c","M448 230.2V480H0V230.2H141.1V355.1H306.9V230.2zM306.9 32H141.1V156.9H306.9z"],untappd:[640,512,[],"f405","M401.3 49.9c-79.8 160.1-84.6 152.5-87.9 173.2l-5.2 32.8c-1.9 12-6.6 23.5-13.7 33.4L145.6 497.1c-7.6 10.6-20.4 16.2-33.4 14.6-40.3-5-77.8-32.2-95.3-68.5-5.7-11.8-4.5-25.8 3.1-36.4l148.9-207.9c7.1-9.9 16.4-18 27.2-23.7l29.3-15.5c18.5-9.8 9.7-11.9 135.6-138.9 1-4.8 1-7.3 3.6-8 3-.7 6.6-1 6.3-4.6l-.4-4.6c-.2-1.9 1.3-3.6 3.2-3.6 4.5-.1 13.2 1.2 25.6 10 12.3 8.9 16.4 16.8 17.7 21.1 .6 1.8-.6 3.7-2.4 4.2l-4.5 1.1c-3.4 .9-2.5 4.4-2.3 7.4 .1 2.8-2.3 3.6-6.5 6.1zM230.1 36.4c3.4 .9 2.5 4.4 2.3 7.4-.2 2.7 2.1 3.5 6.4 6 7.9 15.9 15.3 30.5 22.2 44 .7 1.3 2.3 1.5 3.3 .5 11.2-12 24.6-26.2 40.5-42.6 1.3-1.4 1.4-3.5 .1-4.9-8-8.2-16.5-16.9-25.6-26.1-1-4.7-1-7.3-3.6-8-3-.8-6.6-1-6.3-4.6 .3-3.3 1.4-8.1-2.8-8.2-4.5-.1-13.2 1.1-25.6 10-12.3 8.9-16.4 16.8-17.7 21.1-1.4 4.2 3.6 4.6 6.8 5.4zM620 406.7L471.2 198.8c-13.2-18.5-26.6-23.4-56.4-39.1-11.2-5.9-14.2-10.9-30.5-28.9-1-1.1-2.9-.9-3.6 .5-46.3 88.8-47.1 82.8-49 94.8-1.7 10.7-1.3 20 .3 29.8 1.9 12 6.6 23.5 13.7 33.4l148.9 207.9c7.6 10.6 20.2 16.2 33.1 14.7 40.3-4.9 78-32 95.7-68.6 5.4-11.9 4.3-25.9-3.4-36.6z"],ups:[384,512,[],"f7e0","M103.2 303c-5.2 3.6-32.6 13.1-32.6-19V180H37.9v102.6c0 74.9 80.2 51.1 97.9 39V180h-32.6zM4 74.82v220.9c0 103.7 74.9 135.2 187.7 184.1 112.4-48.9 187.7-80.2 187.7-184.1V74.82c-116.3-61.6-281.8-49.6-375.4 0zm358.1 220.9c0 86.6-53.2 113.6-170.4 165.3-117.5-51.8-170.5-78.7-170.5-165.3v-126.4c102.3-93.8 231.6-100 340.9-89.8zm-209.6-107.4v212.8h32.7v-68.7c24.4 7.3 71.7-2.6 71.7-78.5 0-97.4-80.7-80.92-104.4-65.6zm32.7 117.3v-100.3c8.4-4.2 38.4-12.7 38.4 49.3 0 67.9-36.4 51.8-38.4 51zm79.1-86.4c.1 47.3 51.6 42.5 52.2 70.4 .6 23.5-30.4 23-50.8 4.9v30.1c36.2 21.5 81.9 8.1 83.2-33.5 1.7-51.5-54.1-46.6-53.4-73.2 .6-20.3 30.6-20.5 48.5-2.2v-28.4c-28.5-22-79.9-9.2-79.7 31.9z"],usb:[640,512,[],"f287","M641.5 256c0 3.1-1.7 6.1-4.5 7.5L547.9 317c-1.4 .8-2.8 1.4-4.5 1.4-1.4 0-3.1-.3-4.5-1.1-2.8-1.7-4.5-4.5-4.5-7.8v-35.6H295.7c25.3 39.6 40.5 106.9 69.6 106.9H392V354c0-5 3.9-8.9 8.9-8.9H490c5 0 8.9 3.9 8.9 8.9v89.1c0 5-3.9 8.9-8.9 8.9h-89.1c-5 0-8.9-3.9-8.9-8.9v-26.7h-26.7c-75.4 0-81.1-142.5-124.7-142.5H140.3c-8.1 30.6-35.9 53.5-69 53.5C32 327.3 0 295.3 0 256s32-71.3 71.3-71.3c33.1 0 61 22.8 69 53.5 39.1 0 43.9 9.5 74.6-60.4C255 88.7 273 95.7 323.8 95.7c7.5-20.9 27-35.6 50.4-35.6 29.5 0 53.5 23.9 53.5 53.5s-23.9 53.5-53.5 53.5c-23.4 0-42.9-14.8-50.4-35.6H294c-29.1 0-44.3 67.4-69.6 106.9h310.1v-35.6c0-3.3 1.7-6.1 4.5-7.8 2.8-1.7 6.4-1.4 8.9 .3l89.1 53.5c2.8 1.1 4.5 4.1 4.5 7.2z"],usps:[576,512,[],"f7e1","M460.3 241.7c25.8-41.3 15.2-48.8-11.7-48.8h-27c-.1 0-1.5-1.4-10.9 8-11.2 5.6-37.9 6.3-37.9 8.7 0 4.5 70.3-3.1 88.1 0 9.5 1.5-1.5 20.4-4.4 32-.5 4.5 2.4 2.3 3.8 .1zm-112.1 22.6c64-21.3 97.3-23.9 102-26.2 4.4-2.9-4.4-6.6-26.2-5.8-51.7 2.2-137.6 37.1-172.6 53.9l-30.7-93.3h196.6c-2.7-28.2-152.9-22.6-337.9-22.6L27 415.8c196.4-97.3 258.9-130.3 321.2-151.5zM94.7 96c253.3 53.7 330 65.7 332.1 85.2 36.4 0 45.9 0 52.4 6.6 21.1 19.7-14.6 67.7-14.6 67.7-4.4 2.9-406.4 160.2-406.4 160.2h423.1L549 96z"],ussunnah:[512,512,[],"f407","M156.8 285.1l5.7 14.4h-8.2c-1.3-3.2-3.1-7.7-3.8-9.5-2.5-6.3-1.1-8.4 0-10 1.9-2.7 3.2-4.4 3.6-5.2 0 2.2 .8 5.7 2.7 10.3zm297.3 18.8c-2.1 13.8-5.7 27.1-10.5 39.7l43 23.4-44.8-18.8c-5.3 13.2-12 25.6-19.9 37.2l34.2 30.2-36.8-26.4c-8.4 11.8-18 22.6-28.7 32.3l24.9 34.7-28.1-31.8c-11 9.6-23.1 18-36.1 25.1l15.7 37.2-19.3-35.3c-13.1 6.8-27 12.1-41.6 15.9l6.7 38.4-10.5-37.4c-14.3 3.4-29.2 5.3-44.5 5.4L256 512l-1.9-38.4c-15.3-.1-30.2-2-44.5-5.3L199 505.6l6.7-38.2c-14.6-3.7-28.6-9.1-41.7-15.8l-19.2 35.1 15.6-37c-13-7-25.2-15.4-36.2-25.1l-27.9 31.6 24.7-34.4c-10.7-9.7-20.4-20.5-28.8-32.3l-36.5 26.2 33.9-29.9c-7.9-11.6-14.6-24.1-20-37.3l-44.4 18.7L67.8 344c-4.8-12.7-8.4-26.1-10.5-39.9l-51 9 50.3-14.2c-1.1-8.5-1.7-17.1-1.7-25.9 0-4.7 .2-9.4 .5-14.1L0 256l56-2.8c1.3-13.1 3.8-25.8 7.5-38.1L6.4 199l58.9 10.4c4-12 9.1-23.5 15.2-34.4l-55.1-30 58.3 24.6C90 159 97.2 149.2 105.3 140L55.8 96.4l53.9 38.7c8.1-8.6 17-16.5 26.6-23.6l-40-55.6 45.6 51.6c9.5-6.6 19.7-12.3 30.3-17.2l-27.3-64.9 33.8 62.1c10.5-4.4 21.4-7.9 32.7-10.4L199 6.4l19.5 69.2c11-2.1 22.3-3.2 33.8-3.4L256 0l3.6 72.2c11.5 .2 22.8 1.4 33.8 3.5L313 6.4l-12.4 70.7c11.3 2.6 22.2 6.1 32.6 10.5l33.9-62.2-27.4 65.1c10.6 4.9 20.7 10.7 30.2 17.2l45.8-51.8-40.1 55.9c9.5 7.1 18.4 15 26.5 23.6l54.2-38.9-49.7 43.9c8 9.1 15.2 18.9 21.5 29.4l58.7-24.7-55.5 30.2c6.1 10.9 11.1 22.3 15.1 34.3l59.3-10.4-57.5 16.2c3.7 12.2 6.2 24.9 7.5 37.9L512 256l-56 2.8c.3 4.6 .5 9.3 .5 14.1 0 8.7-.6 17.3-1.6 25.8l50.7 14.3-51.5-9.1zm-21.8-31c0-97.5-79-176.5-176.5-176.5s-176.5 79-176.5 176.5 79 176.5 176.5 176.5 176.5-79 176.5-176.5zm-24 0c0 84.3-68.3 152.6-152.6 152.6s-152.6-68.3-152.6-152.6 68.3-152.6 152.6-152.6 152.6 68.3 152.6 152.6zM195 241c0 2.1 1.3 3.8 3.6 5.1 3.3 1.9 6.2 4.6 8.2 8.2 2.8-5.7 4.3-9.5 4.3-11.2 0-2.2-1.1-4.4-3.2-7-2.1-2.5-3.2-5.2-3.3-7.7-6.5 6.8-9.6 10.9-9.6 12.6zm-40.7-19c0 2.1 1.3 3.8 3.6 5.1 3.5 1.9 6.2 4.6 8.2 8.2 2.8-5.7 4.3-9.5 4.3-11.2 0-2.2-1.1-4.4-3.2-7-2.1-2.5-3.2-5.2-3.3-7.7-6.5 6.8-9.6 10.9-9.6 12.6zm-19 0c0 2.1 1.3 3.8 3.6 5.1 3.3 1.9 6.2 4.6 8.2 8.2 2.8-5.7 4.3-9.5 4.3-11.2 0-2.2-1.1-4.4-3.2-7-2.1-2.5-3.2-5.2-3.3-7.7-6.4 6.8-9.6 10.9-9.6 12.6zm204.9 87.9c-8.4-3-8.7-6.8-8.7-15.6V182c-8.2 12.5-14.2 18.6-18 18.6 6.3 14.4 9.5 23.9 9.5 28.3v64.3c0 2.2-2.2 6.5-4.7 6.5h-18c-2.8-7.5-10.2-26.9-15.3-40.3-2 2.5-7.2 9.2-10.7 13.7 2.4 1.6 4.1 3.6 5.2 6.3 2.6 6.7 6.4 16.5 7.9 20.2h-9.2c-3.9-10.4-9.6-25.4-11.8-31.1-2 2.5-7.2 9.2-10.7 13.7 2.4 1.6 4.1 3.6 5.2 6.3 .8 2 2.8 7.3 4.3 10.9H256c-1.5-4.1-5.6-14.6-8.4-22-2 2.5-7.2 9.2-10.7 13.7 2.5 1.6 4.3 3.6 5.2 6.3 .2 .6 .5 1.4 .6 1.7H225c-4.6-13.9-11.4-27.7-11.4-34.1 0-2.2 .3-5.1 1.1-8.2-8.8 10.8-14 15.9-14 25 0 7.5 10.4 28.3 10.4 33.3 0 1.7-.5 3.3-1.4 4.9-9.6-12.7-15.5-20.7-18.8-20.7h-12l-11.2-28c-3.8-9.6-5.7-16-5.7-18.8 0-3.8 .5-7.7 1.7-12.2-1 1.3-3.7 4.7-5.5 7.1-.8-2.1-3.1-7.7-4.6-11.5-2.1 2.5-7.5 9.1-11.2 13.6 .9 2.3 3.3 8.1 4.9 12.2-2.5 3.3-9.1 11.8-13.6 17.7-4 5.3-5.8 13.3-2.7 21.8 2.5 6.7 2 7.9-1.7 14.1H191c5.5 0 14.3 14 15.5 22 13.2-16 15.4-19.6 16.8-21.6h107c3.9 0 7.2-1.9 9.9-5.8zm20.1-26.6V181.7c-9 12.5-15.9 18.6-20.7 18.6 7.1 14.4 10.7 23.9 10.7 28.3v66.3c0 17.5 8.6 20.4 24 20.4 8.1 0 12.5-.8 13.7-2.7-4.3-1.6-7.6-2.5-9.9-3.3-8.1-3.2-17.8-7.4-17.8-26z"],vaadin:[448,512,[],"f408","M224.5 140.7c1.5-17.6 4.9-52.7 49.8-52.7h98.6c20.7 0 32.1-7.8 32.1-21.6V54.1c0-12.2 9.3-22.1 21.5-22.1S448 41.9 448 54.1v36.5c0 42.9-21.5 62-66.8 62H280.7c-30.1 0-33 14.7-33 27.1 0 1.3-.1 2.5-.2 3.7-.7 12.3-10.9 22.2-23.4 22.2s-22.7-9.8-23.4-22.2c-.1-1.2-.2-2.4-.2-3.7 0-12.3-3-27.1-33-27.1H66.8c-45.3 0-66.8-19.1-66.8-62V54.1C0 41.9 9.4 32 21.6 32s21.5 9.9 21.5 22.1v12.3C43.1 80.2 54.5 88 75.2 88h98.6c44.8 0 48.3 35.1 49.8 52.7h.9zM224 456c11.5 0 21.4-7 25.7-16.3 1.1-1.8 97.1-169.6 98.2-171.4 11.9-19.6-3.2-44.3-27.2-44.3-13.9 0-23.3 6.4-29.8 20.3L224 362l-66.9-117.7c-6.4-13.9-15.9-20.3-29.8-20.3-24 0-39.1 24.6-27.2 44.3 1.1 1.9 97.1 169.6 98.2 171.4 4.3 9.3 14.2 16.3 25.7 16.3z"],viacoin:[384,512,[],"f237","M384 32h-64l-80.7 192h-94.5L64 32H0l48 112H0v48h68.5l13.8 32H0v48h102.8L192 480l89.2-208H384v-48h-82.3l13.8-32H384v-48h-48l48-112zM192 336l-27-64h54l-27 64z"],viadeo:[448,512,[],"f2a9","M276.2 150.5v.7C258.3 98.6 233.6 47.8 205.4 0c43.3 29.2 67 100 70.8 150.5zm32.7 121.7c7.6 18.2 11 37.5 11 57 0 77.7-57.8 141-137.8 139.4l3.8-.3c74.2-46.7 109.3-118.6 109.3-205.1 0-38.1-6.5-75.9-18.9-112 1 11.7 1 23.7 1 35.4 0 91.8-18.1 241.6-116.6 280C95 455.2 49.4 398 49.4 329.2c0-75.6 57.4-142.3 135.4-142.3 16.8 0 33.7 3.1 49.1 9.6 1.7-15.1 6.5-29.9 13.4-43.3-19.9-7.2-41.2-10.7-62.5-10.7-161.5 0-238.7 195.9-129.9 313.7 67.9 74.6 192 73.9 259.8 0 56.6-61.3 60.9-142.4 36.4-201-12.7 8-27.1 13.9-42.2 17zM418.1 11.7c-31 66.5-81.3 47.2-115.8 80.1-12.4 12-20.6 34-20.6 50.5 0 14.1 4.5 27.1 12 38.8 47.4-11 98.3-46 118.2-90.7-.7 5.5-4.8 14.4-7.2 19.2-20.3 35.7-64.6 65.6-99.7 84.9 14.8 14.4 33.7 25.8 55 25.8 79 0 110.1-134.6 58.1-208.6z"],viber:[512,512,[],"f409","M444 49.9C431.3 38.2 379.9 .9 265.3 .4c0 0-135.1-8.1-200.9 52.3C27.8 89.3 14.9 143 13.5 209.5c-1.4 66.5-3.1 191.1 117 224.9h.1l-.1 51.6s-.8 20.9 13 25.1c16.6 5.2 26.4-10.7 42.3-27.8 8.7-9.4 20.7-23.2 29.8-33.7 82.2 6.9 145.3-8.9 152.5-11.2 16.6-5.4 110.5-17.4 125.7-142 15.8-128.6-7.6-209.8-49.8-246.5zM457.9 287c-12.9 104-89 110.6-103 115.1-6 1.9-61.5 15.7-131.2 11.2 0 0-52 62.7-68.2 79-5.3 5.3-11.1 4.8-11-5.7 0-6.9 .4-85.7 .4-85.7-.1 0-.1 0 0 0-101.8-28.2-95.8-134.3-94.7-189.8 1.1-55.5 11.6-101 42.6-131.6 55.7-50.5 170.4-43 170.4-43 96.9 .4 143.3 29.6 154.1 39.4 35.7 30.6 53.9 103.8 40.6 211.1zm-139-80.8c.4 8.6-12.5 9.2-12.9 .6-1.1-22-11.4-32.7-32.6-33.9-8.6-.5-7.8-13.4 .7-12.9 27.9 1.5 43.4 17.5 44.8 46.2zm20.3 11.3c1-42.4-25.5-75.6-75.8-79.3-8.5-.6-7.6-13.5 .9-12.9 58 4.2 88.9 44.1 87.8 92.5-.1 8.6-13.1 8.2-12.9-.3zm47 13.4c.1 8.6-12.9 8.7-12.9 .1-.6-81.5-54.9-125.9-120.8-126.4-8.5-.1-8.5-12.9 0-12.9 73.7 .5 133 51.4 133.7 139.2zM374.9 329v.2c-10.8 19-31 40-51.8 33.3l-.2-.3c-21.1-5.9-70.8-31.5-102.2-56.5-16.2-12.8-31-27.9-42.4-42.4-10.3-12.9-20.7-28.2-30.8-46.6-21.3-38.5-26-55.7-26-55.7-6.7-20.8 14.2-41 33.3-51.8h.2c9.2-4.8 18-3.2 23.9 3.9 0 0 12.4 14.8 17.7 22.1 5 6.8 11.7 17.7 15.2 23.8 6.1 10.9 2.3 22-3.7 26.6l-12 9.6c-6.1 4.9-5.3 14-5.3 14s17.8 67.3 84.3 84.3c0 0 9.1 .8 14-5.3l9.6-12c4.6-6 15.7-9.8 26.6-3.7 14.7 8.3 33.4 21.2 45.8 32.9 7 5.7 8.6 14.4 3.8 23.6z"],vimeo:[448,512,[],"f40a","M403.2 32H44.8C20.1 32 0 52.1 0 76.8v358.4C0 459.9 20.1 480 44.8 480h358.4c24.7 0 44.8-20.1 44.8-44.8V76.8c0-24.7-20.1-44.8-44.8-44.8zM377 180.8c-1.4 31.5-23.4 74.7-66 129.4-44 57.2-81.3 85.8-111.7 85.8-18.9 0-34.8-17.4-47.9-52.3-25.5-93.3-36.4-148-57.4-148-2.4 0-10.9 5.1-25.4 15.2l-15.2-19.6c37.3-32.8 72.9-69.2 95.2-71.2 25.2-2.4 40.7 14.8 46.5 51.7 20.7 131.2 29.9 151 67.6 91.6 13.5-21.4 20.8-37.7 21.8-48.9 3.5-33.2-25.9-30.9-45.8-22.4 15.9-52.1 46.3-77.4 91.2-76 33.3 .9 49 22.5 47.1 64.7z"],"vimeo-v":[448,512,[],"f27d","M447.8 153.6c-2 43.6-32.4 103.3-91.4 179.1-60.9 79.2-112.4 118.8-154.6 118.8-26.1 0-48.2-24.1-66.3-72.3C100.3 250 85.3 174.3 56.2 174.3c-3.4 0-15.1 7.1-35.2 21.1L0 168.2c51.6-45.3 100.9-95.7 131.8-98.5 34.9-3.4 56.3 20.5 64.4 71.5 28.7 181.5 41.4 208.9 93.6 126.7 18.7-29.6 28.8-52.1 30.2-67.6 4.8-45.9-35.8-42.8-63.3-31 22-72.1 64.1-107.1 126.2-105.1 45.8 1.2 67.5 31.1 64.9 89.4z"],vine:[384,512,[],"f1ca","M384 254.7v52.1c-18.4 4.2-36.9 6.1-52.1 6.1-36.9 77.4-103 143.8-125.1 156.2-14 7.9-27.1 8.4-42.7-.8C137 452 34.2 367.7 0 102.7h74.5C93.2 261.8 139 343.4 189.3 404.5c27.9-27.9 54.8-65.1 75.6-106.9-49.8-25.3-80.1-80.9-80.1-145.6 0-65.6 37.7-115.1 102.2-115.1 114.9 0 106.2 127.9 81.6 181.5 0 0-46.4 9.2-63.5-20.5 3.4-11.3 8.2-30.8 8.2-48.5 0-31.3-11.3-46.6-28.4-46.6-18.2 0-30.8 17.1-30.8 50 .1 79.2 59.4 118.7 129.9 101.9z"],vk:[448,512,[],"f189","M31.49 63.49C0 94.98 0 145.7 0 247V264.1C0 366.3 0 417 31.49 448.5C62.98 480 113.7 480 215 480H232.1C334.3 480 385 480 416.5 448.5C448 417 448 366.3 448 264.1V247C448 145.7 448 94.98 416.5 63.49C385 32 334.3 32 232.1 32H215C113.7 32 62.98 32 31.49 63.49zM75.6 168.3H126.7C128.4 253.8 166.1 289.1 196 297.4V168.3H244.2V242C273.7 238.8 304.6 205.2 315.1 168.3H363.3C359.3 187.4 351.5 205.6 340.2 221.6C328.9 237.6 314.5 251.1 297.7 261.2C316.4 270.5 332.9 283.6 346.1 299.8C359.4 315.9 369 334.6 374.5 354.7H321.4C316.6 337.3 306.6 321.6 292.9 309.8C279.1 297.9 262.2 290.4 244.2 288.1V354.7H238.4C136.3 354.7 78.03 284.7 75.6 168.3z"],vnv:[640,512,[],"f40b","M104.9 352c-34.1 0-46.4-30.4-46.4-30.4L2.6 210.1S-7.8 192 13 192h32.8c10.4 0 13.2 8.7 18.8 18.1l36.7 74.5s5.2 13.1 21.1 13.1 21.1-13.1 21.1-13.1l36.7-74.5c5.6-9.5 8.4-18.1 18.8-18.1h32.8c20.8 0 10.4 18.1 10.4 18.1l-55.8 111.5S174.2 352 140 352h-35.1zm395 0c-34.1 0-46.4-30.4-46.4-30.4l-55.9-111.5S387.2 192 408 192h32.8c10.4 0 13.2 8.7 18.8 18.1l36.7 74.5s5.2 13.1 21.1 13.1 21.1-13.1 21.1-13.1l36.8-74.5c5.6-9.5 8.4-18.1 18.8-18.1H627c20.8 0 10.4 18.1 10.4 18.1l-55.9 111.5S569.3 352 535.1 352h-35.2zM337.6 192c34.1 0 46.4 30.4 46.4 30.4l55.9 111.5s10.4 18.1-10.4 18.1h-32.8c-10.4 0-13.2-8.7-18.8-18.1l-36.7-74.5s-5.2-13.1-21.1-13.1c-15.9 0-21.1 13.1-21.1 13.1l-36.7 74.5c-5.6 9.4-8.4 18.1-18.8 18.1h-32.9c-20.8 0-10.4-18.1-10.4-18.1l55.9-111.5s12.2-30.4 46.4-30.4h35.1z"],vuejs:[448,512,[],"f41f","M356.9 64.3H280l-56 88.6-48-88.6H0L224 448 448 64.3h-91.1zm-301.2 32h53.8L224 294.5 338.4 96.3h53.8L224 384.5 55.7 96.3z"],"watchman-monitoring":[512,512,[],"e087","M256 16C123.5 16 16 123.5 16 256S123.5 496 256 496 496 388.5 496 256 388.5 16 256 16zM121.7 429.1C70.06 388.1 36.74 326.3 36.74 256a218.5 218.5 0 0 1 9.587-64.12l102.9-17.9-.121 10.97-13.94 2.013s-.144 12.5-.144 19.55a12.78 12.78 0 0 0 4.887 10.35l9.468 7.4zm105.7-283.3 8.48-7.618s6.934-5.38-.143-9.344c-7.188-4.024-39.53-34.5-39.53-34.5-5.348-5.477-8.257-7.347-15.46 0 0 0-32.34 30.47-39.53 34.5-7.078 3.964-.144 9.344-.144 9.344l8.481 7.618-.048 4.369L75.98 131c39.64-56.94 105.5-94.3 180-94.3A218.8 218.8 0 0 1 420.9 111.8l-193.5 37.7zm34.06 329.3-33.9-250.9 9.467-7.4a12.78 12.78 0 0 0 4.888-10.35c0-7.044-.144-19.55-.144-19.55l-13.94-2.013-.116-10.47 241.7 31.39A218.9 218.9 0 0 1 475.3 256C475.3 375.1 379.8 472.2 261.4 475.1z"],waze:[512,512,[],"f83f","M502.2 201.7C516.7 287.5 471.2 369.6 389 409.8c13 34.1-12.4 70.2-48.32 70.2a51.68 51.68 0 0 1 -51.57-49c-6.44 .19-64.2 0-76.33-.64A51.69 51.69 0 0 1 159 479.9c-33.86-1.36-57.95-34.84-47-67.92-37.21-13.11-72.54-34.87-99.62-70.8-13-17.28-.48-41.8 20.84-41.8 46.31 0 32.22-54.17 43.15-110.3C94.8 95.2 193.1 32 288.1 32c102.5 0 197.1 70.67 214.1 169.7zM373.5 388.3c42-19.18 81.33-56.71 96.29-102.1 40.48-123.1-64.15-228-181.7-228-83.45 0-170.3 55.42-186.1 136-9.53 48.91 5 131.4-68.75 131.4C58.21 358.6 91.6 378.1 127 389.5c24.66-21.8 63.87-15.47 79.83 14.34 14.22 1 79.19 1.18 87.9 .82a51.69 51.69 0 0 1 78.78-16.42zM205.1 187.1c0-34.74 50.84-34.75 50.84 0s-50.84 34.74-50.84 0zm116.6 0c0-34.74 50.86-34.75 50.86 0s-50.86 34.75-50.86 0zm-122.6 70.69c-3.44-16.94 22.18-22.18 25.62-5.21l.06 .28c4.14 21.42 29.85 44 64.12 43.07 35.68-.94 59.25-22.21 64.11-42.77 4.46-16.05 28.6-10.36 25.47 6-5.23 22.18-31.21 62-91.46 62.9-42.55 0-80.88-27.84-87.9-64.25z"],weebly:[512,512,[],"f5cc","M425.1 65.83c-39.88 0-73.28 25.73-83.66 64.33-18.16-58.06-65.5-64.33-84.95-64.33-19.78 0-66.8 6.28-85.28 64.33-10.38-38.6-43.45-64.33-83.66-64.33C38.59 65.83 0 99.72 0 143c0 28.96 4.18 33.27 77.17 233.5 22.37 60.57 67.77 69.35 92.74 69.35 39.23 0 70.04-19.46 85.93-53.98 15.89 34.83 46.69 54.29 85.93 54.29 24.97 0 70.36-9.1 92.74-69.67 76.55-208.6 77.5-205.6 77.5-227.2 .63-48.32-36.01-83.47-86.92-83.47zm26.34 114.8l-65.57 176.4c-7.92 21.49-21.22 37.22-46.24 37.22-23.44 0-37.38-12.41-44.03-33.9l-39.28-117.4h-.95L216.1 360.4c-6.96 21.5-20.9 33.6-44.02 33.6-25.02 0-38.33-15.74-46.24-37.22L60.88 181.6c-5.38-14.83-7.92-23.91-7.92-34.5 0-16.34 15.84-29.36 38.33-29.36 18.69 0 31.99 11.8 36.11 29.05l44.03 139.8h.95l44.66-136.8c6.02-19.67 16.47-32.08 38.96-32.08s32.94 12.11 38.96 32.08l44.66 136.8h.95l44.03-139.8c4.12-17.25 17.42-29.05 36.11-29.05 22.17 0 38.33 13.32 38.33 35.71-.32 7.87-4.12 16.04-7.61 27.24z"],weibo:[512,512,[],"f18a","M407 177.6c7.6-24-13.4-46.8-37.4-41.7-22 4.8-28.8-28.1-7.1-32.8 50.1-10.9 92.3 37.1 76.5 84.8-6.8 21.2-38.8 10.8-32-10.3zM214.8 446.7C108.5 446.7 0 395.3 0 310.4c0-44.3 28-95.4 76.3-143.7C176 67 279.5 65.8 249.9 161c-4 13.1 12.3 5.7 12.3 6 79.5-33.6 140.5-16.8 114 51.4-3.7 9.4 1.1 10.9 8.3 13.1 135.7 42.3 34.8 215.2-169.7 215.2zm143.7-146.3c-5.4-55.7-78.5-94-163.4-85.7-84.8 8.6-148.8 60.3-143.4 116s78.5 94 163.4 85.7c84.8-8.6 148.8-60.3 143.4-116zM347.9 35.1c-25.9 5.6-16.8 43.7 8.3 38.3 72.3-15.2 134.8 52.8 111.7 124-7.4 24.2 29.1 37 37.4 12 31.9-99.8-55.1-195.9-157.4-174.3zm-78.5 311c-17.1 38.8-66.8 60-109.1 46.3-40.8-13.1-58-53.4-40.3-89.7 17.7-35.4 63.1-55.4 103.4-45.1 42 10.8 63.1 50.2 46 88.5zm-86.3-30c-12.9-5.4-30 .3-38 12.9-8.3 12.9-4.3 28 8.6 34 13.1 6 30.8 .3 39.1-12.9 8-13.1 3.7-28.3-9.7-34zm32.6-13.4c-5.1-1.7-11.4 .6-14.3 5.4-2.9 5.1-1.4 10.6 3.7 12.9 5.1 2 11.7-.3 14.6-5.4 2.8-5.2 1.1-10.9-4-12.9z"],weixin:[576,512,[],"f1d7","M385.2 167.6c6.4 0 12.6 .3 18.8 1.1C387.4 90.3 303.3 32 207.7 32 100.5 32 13 104.8 13 197.4c0 53.4 29.3 97.5 77.9 131.6l-19.3 58.6 68-34.1c24.4 4.8 43.8 9.7 68.2 9.7 6.2 0 12.1-.3 18.3-.8-4-12.9-6.2-26.6-6.2-40.8-.1-84.9 72.9-154 165.3-154zm-104.5-52.9c14.5 0 24.2 9.7 24.2 24.4 0 14.5-9.7 24.2-24.2 24.2-14.8 0-29.3-9.7-29.3-24.2 .1-14.7 14.6-24.4 29.3-24.4zm-136.4 48.6c-14.5 0-29.3-9.7-29.3-24.2 0-14.8 14.8-24.4 29.3-24.4 14.8 0 24.4 9.7 24.4 24.4 0 14.6-9.6 24.2-24.4 24.2zM563 319.4c0-77.9-77.9-141.3-165.4-141.3-92.7 0-165.4 63.4-165.4 141.3S305 460.7 397.6 460.7c19.3 0 38.9-5.1 58.6-9.9l53.4 29.3-14.8-48.6C534 402.1 563 363.2 563 319.4zm-219.1-24.5c-9.7 0-19.3-9.7-19.3-19.6 0-9.7 9.7-19.3 19.3-19.3 14.8 0 24.4 9.7 24.4 19.3 0 10-9.7 19.6-24.4 19.6zm107.1 0c-9.7 0-19.3-9.7-19.3-19.6 0-9.7 9.7-19.3 19.3-19.3 14.5 0 24.4 9.7 24.4 19.3 .1 10-9.9 19.6-24.4 19.6z"],whatsapp:[448,512,[],"f232","M380.9 97.1C339 55.1 283.2 32 223.9 32c-122.4 0-222 99.6-222 222 0 39.1 10.2 77.3 29.6 111L0 480l117.7-30.9c32.4 17.7 68.9 27 106.1 27h.1c122.3 0 224.1-99.6 224.1-222 0-59.3-25.2-115-67.1-157zm-157 341.6c-33.2 0-65.7-8.9-94-25.7l-6.7-4-69.8 18.3L72 359.2l-4.4-7c-18.5-29.4-28.2-63.3-28.2-98.2 0-101.7 82.8-184.5 184.6-184.5 49.3 0 95.6 19.2 130.4 54.1 34.8 34.9 56.2 81.2 56.1 130.5 0 101.8-84.9 184.6-186.6 184.6zm101.2-138.2c-5.5-2.8-32.8-16.2-37.9-18-5.1-1.9-8.8-2.8-12.5 2.8-3.7 5.6-14.3 18-17.6 21.8-3.2 3.7-6.5 4.2-12 1.4-32.6-16.3-54-29.1-75.5-66-5.7-9.8 5.7-9.1 16.3-30.3 1.8-3.7 .9-6.9-.5-9.7-1.4-2.8-12.5-30.1-17.1-41.2-4.5-10.8-9.1-9.3-12.5-9.5-3.2-.2-6.9-.2-10.6-.2-3.7 0-9.7 1.4-14.8 6.9-5.1 5.6-19.4 19-19.4 46.3 0 27.3 19.9 53.7 22.6 57.4 2.8 3.7 39.1 59.7 94.8 83.8 35.2 15.2 49 16.5 66.6 13.9 10.7-1.6 32.8-13.4 37.4-26.4 4.6-13 4.6-24.1 3.2-26.4-1.3-2.5-5-3.9-10.5-6.6z"],whmcs:[448,512,[],"f40d","M448 161v-21.3l-28.5-8.8-2.2-10.4 20.1-20.7L427 80.4l-29 7.5-7.2-7.5 7.5-28.2-19.1-11.6-21.3 21-10.7-3.2-7-26.4h-22.6l-6.2 26.4-12.1 3.2-19.7-21-19.4 11 8.1 27.7-8.1 8.4-28.5-7.5-11 19.1 20.7 21-2.9 10.4-28.5 7.8-.3 21.7 28.8 7.5 2.4 12.1-20.1 19.9 10.4 18.5 29.6-7.5 7.2 8.6-8.1 26.9 19.9 11.6 19.4-20.4 11.6 2.9 6.7 28.5 22.6 .3 6.7-28.8 11.6-3.5 20.7 21.6 20.4-12.1-8.8-28 7.8-8.1 28.8 8.8 10.3-20.1-20.9-18.8 2.2-12.1 29.1-7zm-119.2 45.2c-31.3 0-56.8-25.4-56.8-56.8s25.4-56.8 56.8-56.8 56.8 25.4 56.8 56.8c0 31.5-25.4 56.8-56.8 56.8zm72.3 16.4l46.9 14.5V277l-55.1 13.4-4.1 22.7 38.9 35.3-19.2 37.9-54-16.7-14.6 15.2 16.7 52.5-38.3 22.7-38.9-40.5-21.7 6.6-12.6 54-42.4-.5-12.6-53.6-21.7-5.6-36.4 38.4-37.4-21.7 15.2-50.5-13.7-16.1-55.5 14.1-19.7-34.8 37.9-37.4-4.8-22.8-54-14.1 .5-40.9L54 219.9l5.7-19.7-38.9-39.4L41.5 125l53.6 14.1 15.2-15.7-15.2-52 36.4-20.7 36.8 39.4L191 84l11.6-52H245l11.6 45.9L234 72l-6.3-1.7-3.3 5.7-11 19.1-3.3 5.6 4.6 4.6 17.2 17.4-.3 1-23.8 6.5-6.2 1.7-.1 6.4-.2 12.9C153.8 161.6 118 204 118 254.7c0 58.3 47.3 105.7 105.7 105.7 50.5 0 92.7-35.4 103.2-82.8l13.2 .2 6.9 .1 1.6-6.7 5.6-24 1.9-.6 17.1 17.8 4.7 4.9 5.8-3.4 20.4-12.1 5.8-3.5-2-6.5-6.8-21.2z"],"wikipedia-w":[640,512,[],"f266","M640 51.2l-.3 12.2c-28.1 .8-45 15.8-55.8 40.3-25 57.8-103.3 240-155.3 358.6H415l-81.9-193.1c-32.5 63.6-68.3 130-99.2 193.1-.3 .3-15 0-15-.3C172 352.3 122.8 243.4 75.8 133.4 64.4 106.7 26.4 63.4 .2 63.7c0-3.1-.3-10-.3-14.2h161.9v13.9c-19.2 1.1-52.8 13.3-43.3 34.2 21.9 49.7 103.6 240.3 125.6 288.6 15-29.7 57.8-109.2 75.3-142.8-13.9-28.3-58.6-133.9-72.8-160-9.7-17.8-36.1-19.4-55.8-19.7V49.8l142.5 .3v13.1c-19.4 .6-38.1 7.8-29.4 26.1 18.9 40 30.6 68.1 48.1 104.7 5.6-10.8 34.7-69.4 48.1-100.8 8.9-20.6-3.9-28.6-38.6-29.4 .3-3.6 0-10.3 .3-13.6 44.4-.3 111.1-.3 123.1-.6v13.6c-22.5 .8-45.8 12.8-58.1 31.7l-59.2 122.8c6.4 16.1 63.3 142.8 69.2 156.7L559.2 91.8c-8.6-23.1-36.4-28.1-47.2-28.3V49.6l127.8 1.1 .2 .5z"],windows:[448,512,[],"f17a","M0 93.7l183.6-25.3v177.4H0V93.7zm0 324.6l183.6 25.3V268.4H0v149.9zm203.8 28L448 480V268.4H203.8v177.9zm0-380.6v180.1H448V32L203.8 65.7z"],wirsindhandwerk:[512,512,["wsh"],"e2d0","M50.77 479.8h83.36V367.8l-83.36 47.01zm329 0h82.35V414.9l-82.35-47.01zm.0057-448V251.6L256.2 179.2 134.5 251.6V31.81H50.77V392.6L256.2 270.3 462.2 392.6V31.81z"],wix:[640,512,[],"f5cf","M393.4 131.7c0 13.03 2.08 32.69-28.68 43.83-9.52 3.45-15.95 9.66-15.95 9.66 0-31 4.72-42.22 17.4-48.86 9.75-5.11 27.23-4.63 27.23-4.63zm-115.8 35.54l-34.24 132.7-28.48-108.6c-7.69-31.99-20.81-48.53-48.43-48.53-27.37 0-40.66 16.18-48.43 48.53L89.52 299.9 55.28 167.2C49.73 140.5 23.86 128.1 0 131.1l65.57 247.9s21.63 1.56 32.46-3.96c14.22-7.25 20.98-12.84 29.59-46.57 7.67-30.07 29.11-118.4 31.12-124.7 4.76-14.94 11.09-13.81 15.4 0 1.97 6.3 23.45 94.63 31.12 124.7 8.6 33.73 15.37 39.32 29.59 46.57 10.82 5.52 32.46 3.96 32.46 3.96l65.57-247.9c-24.42-3.07-49.82 8.93-55.3 35.27zm115.8 5.21s-4.1 6.34-13.46 11.57c-6.01 3.36-11.78 5.64-17.97 8.61-15.14 7.26-13.18 13.95-13.18 35.2v152.1s16.55 2.09 27.37-3.43c13.93-7.1 17.13-13.95 17.26-44.78V181.4l-.02 .01v-8.98zm163.4 84.08L640 132.8s-35.11-5.98-52.5 9.85c-13.3 12.1-24.41 29.55-54.18 72.47-.47 .73-6.25 10.54-13.07 0-29.29-42.23-40.8-60.29-54.18-72.47-17.39-15.83-52.5-9.85-52.5-9.85l83.2 123.7-82.97 123.4s36.57 4.62 53.95-11.21c11.49-10.46 17.58-20.37 52.51-70.72 6.81-10.52 12.57-.77 13.07 0 29.4 42.38 39.23 58.06 53.14 70.72 17.39 15.83 53.32 11.21 53.32 11.21L556.8 256.5z"],"wizards-of-the-coast":[640,512,[],"f730","M219.2 345.7c-1.9 1.38-11.07 8.44-.26 23.57 4.64 6.42 14.11 12.79 21.73 6.55 6.5-4.88 7.35-12.92 .26-23.04-5.47-7.76-14.28-12.88-21.73-7.08zm336.8 75.94c-.34 1.7-.55 1.67 .79 0 2.09-4.19 4.19-10.21 4.98-19.9 3.14-38.49-40.33-71.49-101.3-78.03-54.73-6.02-124.4 9.17-188.8 60.49l-.26 1.57c2.62 4.98 4.98 10.74 3.4 21.21l.79 .26c63.89-58.4 131.2-77.25 184.4-73.85 58.4 3.67 100 34.04 100 68.08-.01 9.96-2.63 15.72-3.94 20.17zM392.3 240.4c.79 7.07 4.19 10.21 9.17 10.47 5.5 .26 9.43-2.62 10.47-6.55 .79-3.4 2.09-29.85 2.09-29.85s-11.26 6.55-14.93 10.47c-3.66 3.68-7.33 8.39-6.8 15.46zm-50.02-151.1C137.8 89.32 13.1 226.8 .79 241.2c-1.05 .52-1.31 .79 .79 1.31 60.49 16.5 155.8 81.18 196.1 202.2l1.05 .26c55.25-69.92 140.9-128.1 236.1-128.1 80.92 0 130.1 42.16 130.1 80.39 0 18.33-6.55 33.52-22.26 46.35 0 .96-.2 .79 .79 .79 14.66-10.74 27.5-28.8 27.5-48.18 0-22.78-12.05-38.23-12.05-38.23 7.07 7.07 10.74 16.24 10.74 16.24 5.76-40.85 26.97-62.32 26.97-62.32-2.36-9.69-6.81-17.81-6.81-17.81 7.59 8.12 14.4 27.5 14.4 41.37 0 10.47-3.4 22.78-12.57 31.95l.26 .52c8.12-4.98 16.5-16.76 16.5-37.97 0-15.71-4.71-25.92-4.71-25.92 5.76-5.24 11.26-9.17 15.97-11.78 .79 3.4 2.09 9.69 2.36 14.93 0 1.05 .79 1.83 1.05 0 .79-5.76-.26-16.24-.26-16.5 6.02-3.14 9.69-4.45 9.69-4.45C617.7 176 489.4 89.32 342.3 89.32zm-99.24 289.6c-11.06 8.99-24.2 4.08-30.64-4.19-7.45-9.58-6.76-24.09 4.19-32.47 14.85-11.35 27.08-.49 31.16 5.5 .28 .39 12.13 16.57-4.71 31.16zm2.09-136.4l9.43-17.81 11.78 70.96-12.57 6.02-24.62-28.8 14.14-26.71 3.67 4.45-1.83-8.11zm18.59 117.6l-.26-.26c2.05-4.1-2.5-6.61-17.54-31.69-1.31-2.36-3.14-2.88-4.45-2.62l-.26-.52c7.86-5.76 15.45-10.21 25.4-15.71l.52 .26c1.31 1.83 2.09 2.88 3.4 4.71l-.26 .52c-1.05-.26-2.36-.79-5.24 .26-2.09 .79-7.86 3.67-12.31 7.59v1.31c1.57 2.36 3.93 6.55 5.76 9.69h.26c10.05-6.28 7.56-4.55 11.52-7.86h.26c.52 1.83 .52 1.83 1.83 5.5l-.26 .26c-3.06 .61-4.65 .34-11.52 5.5v.26c9.46 17.02 11.01 16.75 12.57 15.97l.26 .26c-2.34 1.59-6.27 4.21-9.68 6.57zm55.26-32.47c-3.14 1.57-6.02 2.88-9.95 4.98l-.26-.26c1.29-2.59 1.16-2.71-11.78-32.47l-.26-.26c-.15 0-8.9 3.65-9.95 7.33h-.52l-1.05-5.76 .26-.52c7.29-4.56 25.53-11.64 27.76-12.57l.52 .26 3.14 4.98-.26 .52c-3.53-1.76-7.35 .76-12.31 2.62v.26c12.31 32.01 12.67 30.64 14.66 30.64v.25zm44.77-16.5c-4.19 1.05-5.24 1.31-9.69 2.88l-.26-.26 .52-4.45c-1.05-3.4-3.14-11.52-3.67-13.62l-.26-.26c-3.4 .79-8.9 2.62-12.83 3.93l-.26 .26c.79 2.62 3.14 9.95 4.19 13.88 .79 2.36 1.83 2.88 2.88 3.14v.52c-3.67 1.05-7.07 2.62-10.21 3.93l-.26-.26c1.05-1.31 1.05-2.88 .26-4.98-1.05-3.14-8.12-23.83-9.17-27.23-.52-1.83-1.57-3.14-2.62-3.14v-.52c3.14-1.05 6.02-2.09 10.74-3.4l.26 .26-.26 4.71c1.31 3.93 2.36 7.59 3.14 9.69h.26c3.93-1.31 9.43-2.88 12.83-3.93l.26-.26-2.62-9.43c-.52-1.83-1.05-3.4-2.62-3.93v-.26c4.45-1.05 7.33-1.83 10.74-2.36l.26 .26c-1.05 1.31-1.05 2.88-.52 4.45 1.57 6.28 4.71 20.43 6.28 26.45 .54 2.62 1.85 3.41 2.63 3.93zm32.21-6.81l-.26 .26c-4.71 .52-14.14 2.36-22.52 4.19l-.26-.26 .79-4.19c-1.57-7.86-3.4-18.59-4.98-26.19-.26-1.83-.79-2.88-2.62-3.67l.79-.52c9.17-1.57 20.16-2.36 24.88-2.62l.26 .26c.52 2.36 .79 3.14 1.57 5.5l-.26 .26c-1.14-1.14-3.34-3.2-16.24-.79l-.26 .26c.26 1.57 1.05 6.55 1.57 9.95l.26 .26c9.52-1.68 4.76-.06 10.74-2.36h.26c0 1.57-.26 1.83-.26 5.24h-.26c-4.81-1.03-2.15-.9-10.21 0l-.26 .26c.26 2.09 1.57 9.43 2.09 12.57l.26 .26c1.15 .38 14.21-.65 16.24-4.71h.26c-.53 2.38-1.05 4.21-1.58 6.04zm10.74-44.51c-4.45 2.36-8.12 2.88-11 2.88-.25 .02-11.41 1.09-17.54-9.95-6.74-10.79-.98-25.2 5.5-31.69 8.8-8.12 23.35-10.1 28.54-17.02 8.03-10.33-13.04-22.31-29.59-5.76l-2.62-2.88 5.24-16.24c25.59-1.57 45.2-3.04 50.02 16.24 .79 3.14 0 9.43-.26 12.05 0 2.62-1.83 18.85-2.09 23.04-.52 4.19-.79 18.33-.79 20.69 .26 2.36 .52 4.19 1.57 5.5 1.57 1.83 5.76 1.83 5.76 1.83l-.79 4.71c-11.82-1.07-10.28-.59-20.43-1.05-3.22-5.15-2.23-3.28-4.19-7.86 0 .01-4.19 3.94-7.33 5.51zm37.18 21.21c-6.35-10.58-19.82-7.16-21.73 5.5-2.63 17.08 14.3 19.79 20.69 10.21l.26 .26c-.52 1.83-1.83 6.02-1.83 6.28l-.52 .52c-10.3 6.87-28.5-2.5-25.66-18.59 1.94-10.87 14.44-18.93 28.8-9.95l.26 .52c0 1.06-.27 3.41-.27 5.25zm5.77-87.73v-6.55c.69 0 19.65 3.28 27.76 7.33l-1.57 17.54s10.21-9.43 15.45-10.74c5.24-1.57 14.93 7.33 14.93 7.33l-11.26 11.26c-12.07-6.35-19.59-.08-20.69 .79-5.29 38.72-8.6 42.17 4.45 46.09l-.52 4.71c-17.55-4.29-18.53-4.5-36.92-7.33l.79-4.71c7.25 0 7.48-5.32 7.59-6.81 0 0 4.98-53.16 4.98-55.25-.02-2.87-4.99-3.66-4.99-3.66zm10.99 114.4c-8.12-2.09-14.14-11-10.74-20.69 3.14-9.43 12.31-12.31 18.85-10.21 9.17 2.62 12.83 11.78 10.74 19.38-2.61 8.9-9.42 13.87-18.85 11.52zm42.16 9.69c-2.36-.52-7.07-2.36-8.64-2.88v-.26l1.57-1.83c.59-8.24 .59-7.27 .26-7.59-4.82-1.81-6.66-2.36-7.07-2.36-1.31 1.83-2.88 4.45-3.67 5.5l-.79 3.4v.26c-1.31-.26-3.93-1.31-6.02-1.57v-.26l2.62-1.83c3.4-4.71 9.95-14.14 13.88-20.16v-2.09l.52-.26c2.09 .79 5.5 2.09 7.59 2.88 .48 .48 .18-1.87-1.05 25.14-.24 1.81 .02 2.6 .8 3.91zm-4.71-89.82c11.25-18.27 30.76-16.19 34.04-3.4L539.7 198c2.34-6.25-2.82-9.9-4.45-11.26l1.83-3.67c12.22 10.37 16.38 13.97 22.52 20.43-25.91 73.07-30.76 80.81-24.62 84.32l-1.83 4.45c-6.37-3.35-8.9-4.42-17.81-8.64l2.09-6.81c-.26-.26-3.93 3.93-9.69 3.67-19.06-1.3-22.89-31.75-9.67-52.9zm29.33 79.34c0-5.71-6.34-7.89-7.86-5.24-1.31 2.09 1.05 4.98 2.88 8.38 1.57 2.62 2.62 6.28 1.05 9.43-2.64 6.34-12.4 5.31-15.45-.79 0-.7-.27 .09 1.83-4.71l.79-.26c-.57 5.66 6.06 9.61 8.38 4.98 1.05-2.09-.52-5.5-2.09-8.38-1.57-2.62-3.67-6.28-1.83-9.69 2.72-5.06 11.25-4.47 14.66 2.36v.52l-2.36 3.4zm21.21 13.36c-1.96-3.27-.91-2.14-4.45-4.71h-.26c-2.36 4.19-5.76 10.47-8.64 16.24-1.31 2.36-1.05 3.4-.79 3.93l-.26 .26-5.76-4.45 .26-.26 2.09-1.31c3.14-5.76 6.55-12.05 9.17-17.02v-.26c-2.64-1.98-1.22-1.51-6.02-1.83v-.26l3.14-3.4h.26c3.67 2.36 9.95 6.81 12.31 8.9l.26 .26-1.31 3.91zm27.23-44.26l-2.88-2.88c.79-2.36 1.83-4.98 2.09-7.59 .75-9.74-11.52-11.84-11.52-4.98 0 4.98 7.86 19.38 7.86 27.76 0 10.21-5.76 15.71-13.88 16.5-8.38 .79-20.16-10.47-20.16-10.47l4.98-14.4 2.88 2.09c-2.97 17.8 17.68 20.37 13.35 5.24-1.06-4.02-18.75-34.2 2.09-38.23 13.62-2.36 23.04 16.5 23.04 16.5l-7.85 10.46zm35.62-10.21c-11-30.38-60.49-127.5-191.9-129.6-53.42-1.05-94.27 15.45-132.8 37.97l85.63-9.17-91.39 20.69 25.14 19.64-3.93-16.5c7.5-1.71 39.15-8.45 66.77-8.9l-22.26 80.39c13.61-.7 18.97-8.98 19.64-22.78l4.98-1.05 .26 26.71c-22.46 3.21-37.3 6.69-49.49 9.95l13.09-43.21-61.54-36.66 2.36 8.12 10.21 4.98c6.28 18.59 19.38 56.56 20.43 58.66 1.95 4.28 3.16 5.78 12.05 4.45l1.05 4.98c-16.08 4.86-23.66 7.61-39.02 14.4l-2.36-4.71c4.4-2.94 8.73-3.94 5.5-12.83-23.7-62.5-21.48-58.14-22.78-59.44l2.36-4.45 33.52 67.3c-3.84-11.87 1.68 1.69-32.99-78.82l-41.9 88.51 4.71-13.88-35.88-42.16 27.76 93.48-11.78 8.38C95 228.6 101.1 231.9 93.23 231.5c-5.5-.26-13.62 5.5-13.62 5.5L74.63 231c30.56-23.53 31.62-24.33 58.4-42.68l4.19 7.07s-5.76 4.19-7.86 7.07c-5.9 9.28 1.67 13.28 61.8 75.68l-18.85-58.92 39.8-10.21 25.66 30.64 4.45-12.31-4.98-24.62 13.09-3.4 .52 3.14 3.67-10.47-94.27 29.33 11.26-4.98-13.62-42.42 17.28-9.17 30.11 36.14 28.54-13.09c-1.41-7.47-2.47-14.5-4.71-19.64l17.28 13.88 4.71-2.09-59.18-42.68 23.08 11.5c18.98-6.07 25.23-7.47 32.21-9.69l2.62 11c-12.55 12.55 1.43 16.82 6.55 19.38l-13.62-61.01 12.05 28.28c4.19-1.31 7.33-2.09 7.33-2.09l2.62 8.64s-3.14 1.05-6.28 2.09l8.9 20.95 33.78-65.73-20.69 61.01c42.42-24.09 81.44-36.66 131.1-35.88 67.04 1.05 167.3 40.85 199.8 139.8 .78 2.1-.01 2.63-.79 .27zM203.5 152.4s1.83-.52 4.19-1.31l9.43 7.59c-.4 0-3.44-.25-11.26 2.36l-2.36-8.64zm143.8 38.5c-1.57-.6-26.46-4.81-33.26 20.69l21.73 17.02 11.53-37.71zM318.4 67.07c-58.4 0-106.1 12.05-114.1 14.4v.79c8.38 2.09 14.4 4.19 21.21 11.78l1.57 .26c6.55-1.83 48.97-13.88 110.2-13.88 180.2 0 301.7 116.8 301.7 223.4v9.95c0 1.31 .79 2.62 1.05 .52 .52-2.09 .79-8.64 .79-19.64 .26-83.79-96.63-227.6-321.6-227.6zm211.1 169.7c1.31-5.76 0-12.31-7.33-13.09-9.62-1.13-16.14 23.79-17.02 33.52-.79 5.5-1.31 14.93 6.02 14.93 4.68-.01 9.72-.91 18.33-35.36zm-61.53 42.95c-2.62-.79-9.43-.79-12.57 10.47-1.83 6.81 .52 13.35 6.02 14.66 3.67 1.05 8.9 .52 11.78-10.74 2.62-9.94-1.83-13.61-5.23-14.39zM491 300.6c1.83 .52 3.14 1.05 5.76 1.83 0-1.83 .52-8.38 .79-12.05-1.05 1.31-5.5 8.12-6.55 9.95v.27z"],wodu:[640,512,[],"e088","M178.4 339.7H141.1L112.2 223.5h-.478L83.23 339.7H45.2L0 168.9H37.55L64.57 285.2h.478L94.71 168.9h35.16l29.18 117.7h.479L187.5 168.9h36.83zM271.4 212.7c38.98 0 64.1 25.83 64.1 65.29 0 39.22-25.11 65.05-64.1 65.05-38.74 0-63.85-25.83-63.85-65.05C207.5 238.5 232.7 212.7 271.4 212.7zm0 104.8c23.2 0 30.13-19.85 30.13-39.46 0-19.85-6.934-39.7-30.13-39.7-27.7 0-29.89 19.85-29.89 39.7C241.5 297.6 248.4 317.5 271.4 317.5zM435.1 323.9h-.478c-7.893 13.39-21.76 19.13-37.55 19.13-37.31 0-55.49-32.04-55.49-66.25 0-33.24 18.42-64.1 54.77-64.1 14.59 0 28.94 6.218 36.83 18.42h.24V168.9h33.96v170.8H435.1zM405.4 238.3c-22.24 0-29.89 19.13-29.89 39.46 0 19.37 8.848 39.7 29.89 39.7 22.48 0 29.18-19.61 29.18-39.94C434.6 257.4 427.4 238.3 405.4 238.3zM592.1 339.7H560.7V322.5h-.718c-8.609 13.87-23.44 20.57-37.79 20.57-36.11 0-45.2-20.33-45.2-50.94V216.1h33.96V285.9c0 20.33 5.979 30.37 21.76 30.37 18.42 0 26.31-10.28 26.31-35.39V216.1H592.1zM602.5 302.9H640v36.83H602.5z"],"wolf-pack-battalion":[512,512,[],"f514","M267.7 471.5l10.56 15.84 5.28-12.32 5.28 7V512c21.06-7.92 21.11-66.86 25.51-97.21 4.62-31.89-.88-92.81 81.37-149.1-8.88-23.61-12-49.43-2.64-80.05C421 189 447 196.2 456.4 239.7l-30.35 8.36c11.15 23 17 46.76 13.2 72.14L412 313.2l-6.16 33.43-18.47-7-8.8 33.39-19.35-7 26.39 21.11 8.8-28.15L419 364.2l7-35.63 26.39 14.52c.25-20 7-58.06-8.8-84.45l26.39 5.28c4-22.07-2.38-39.21-7.92-56.74l22.43 9.68c-.44-25.07-29.94-56.79-61.58-58.5-20.22-1.09-56.74-25.17-54.1-51.9 2-19.87 17.45-42.62 43.11-49.7-44 36.51-9.68 67.3 5.28 73.46 4.4-11.44 17.54-69.08 0-130.2-40.39 22.87-89.65 65.1-93.2 147.8l-58 38.71-3.52 93.25L369.8 220l7 7-17.59 3.52-44 38.71-15.84-5.28-28.1 49.25-3.52 119.6 21.11 15.84-32.55 15.84-32.55-15.84 21.11-15.84-3.52-119.6-28.15-49.26-15.84 5.28-44-38.71-17.58-3.51 7-7 107.3 59.82-3.52-93.25-58.06-38.71C185 65.1 135.8 22.87 95.3 0c-17.54 61.12-4.4 118.8 0 130.2 15-6.16 49.26-36.95 5.28-73.46 25.66 7.08 41.15 29.83 43.11 49.7 2.63 26.74-33.88 50.81-54.1 51.9-31.65 1.72-61.15 33.44-61.59 58.51l22.43-9.68c-5.54 17.53-11.91 34.67-7.92 56.74l26.39-5.28c-15.76 26.39-9.05 64.43-8.8 84.45l26.39-14.52 7 35.63 24.63-5.28 8.8 28.15L153.4 366 134 373l-8.8-33.43-18.47 7-6.16-33.43-27.27 7c-3.82-25.38 2-49.1 13.2-72.14l-30.35-8.36c9.4-43.52 35.47-50.77 63.34-54.1 9.36 30.62 6.24 56.45-2.64 80.05 82.25 56.3 76.75 117.2 81.37 149.1 4.4 30.35 4.45 89.29 25.51 97.21v-29.83l5.28-7 5.28 12.32 10.56-15.84 11.44 21.11 11.43-21.1zm79.17-95L331.1 366c7.47-4.36 13.76-8.42 19.35-12.32-.6 7.22-.27 13.84-3.51 22.84zm28.15-49.26c-.4 10.94-.9 21.66-1.76 31.67-7.85-1.86-15.57-3.8-21.11-7 8.24-7.94 15.55-16.32 22.87-24.68zm24.63 5.28c0-13.43-2.05-24.21-5.28-33.43a235 235 0 0 1 -18.47 27.27zm3.52-80.94c19.44 12.81 27.8 33.66 29.91 56.3-12.32-4.53-24.63-9.31-36.95-10.56 5.06-12 6.65-28.14 7-45.74zm-1.76-45.74c.81 14.3 1.84 28.82 1.76 42.23 19.22-8.11 29.78-9.72 44-14.08-10.61-18.96-27.2-25.53-45.76-28.16zM165.7 376.5L181.5 366c-7.47-4.36-13.76-8.42-19.35-12.32 .6 7.26 .27 13.88 3.51 22.88zm-28.15-49.26c.4 10.94 .9 21.66 1.76 31.67 7.85-1.86 15.57-3.8 21.11-7-8.24-7.93-15.55-16.31-22.87-24.67zm-24.64 5.28c0-13.43 2-24.21 5.28-33.43a235 235 0 0 0 18.47 27.27zm-3.52-80.94c-19.44 12.81-27.8 33.66-29.91 56.3 12.32-4.53 24.63-9.31 37-10.56-5-12-6.65-28.14-7-45.74zm1.76-45.74c-.81 14.3-1.84 28.82-1.76 42.23-19.22-8.11-29.78-9.72-44-14.08 10.63-18.95 27.23-25.52 45.76-28.15z"],wordpress:[512,512,[],"f19a","M61.7 169.4l101.5 278C92.2 413 43.3 340.2 43.3 256c0-30.9 6.6-60.1 18.4-86.6zm337.9 75.9c0-26.3-9.4-44.5-17.5-58.7-10.8-17.5-20.9-32.4-20.9-49.9 0-19.6 14.8-37.8 35.7-37.8 .9 0 1.8 .1 2.8 .2-37.9-34.7-88.3-55.9-143.7-55.9-74.3 0-139.7 38.1-177.8 95.9 5 .2 9.7 .3 13.7 .3 22.2 0 56.7-2.7 56.7-2.7 11.5-.7 12.8 16.2 1.4 17.5 0 0-11.5 1.3-24.3 2l77.5 230.4L249.8 247l-33.1-90.8c-11.5-.7-22.3-2-22.3-2-11.5-.7-10.1-18.2 1.3-17.5 0 0 35.1 2.7 56 2.7 22.2 0 56.7-2.7 56.7-2.7 11.5-.7 12.8 16.2 1.4 17.5 0 0-11.5 1.3-24.3 2l76.9 228.7 21.2-70.9c9-29.4 16-50.5 16-68.7zm-139.9 29.3l-63.8 185.5c19.1 5.6 39.2 8.7 60.1 8.7 24.8 0 48.5-4.3 70.6-12.1-.6-.9-1.1-1.9-1.5-2.9l-65.4-179.2zm183-120.7c.9 6.8 1.4 14 1.4 21.9 0 21.6-4 45.8-16.2 76.2l-65 187.9C426.2 403 468.7 334.5 468.7 256c0-37-9.4-71.8-26-102.1zM504 256c0 136.8-111.3 248-248 248C119.2 504 8 392.7 8 256 8 119.2 119.2 8 256 8c136.7 0 248 111.2 248 248zm-11.4 0c0-130.5-106.2-236.6-236.6-236.6C125.5 19.4 19.4 125.5 19.4 256S125.6 492.6 256 492.6c130.5 0 236.6-106.1 236.6-236.6z"],"wordpress-simple":[512,512,[],"f411","M256 8C119.3 8 8 119.2 8 256c0 136.7 111.3 248 248 248s248-111.3 248-248C504 119.2 392.7 8 256 8zM33 256c0-32.3 6.9-63 19.3-90.7l106.4 291.4C84.3 420.5 33 344.2 33 256zm223 223c-21.9 0-43-3.2-63-9.1l66.9-194.4 68.5 187.8c.5 1.1 1 2.1 1.6 3.1-23.1 8.1-48 12.6-74 12.6zm30.7-327.5c13.4-.7 25.5-2.1 25.5-2.1 12-1.4 10.6-19.1-1.4-18.4 0 0-36.1 2.8-59.4 2.8-21.9 0-58.7-2.8-58.7-2.8-12-.7-13.4 17.7-1.4 18.4 0 0 11.4 1.4 23.4 2.1l34.7 95.2L200.6 393l-81.2-241.5c13.4-.7 25.5-2.1 25.5-2.1 12-1.4 10.6-19.1-1.4-18.4 0 0-36.1 2.8-59.4 2.8-4.2 0-9.1-.1-14.4-.3C109.6 73 178.1 33 256 33c58 0 110.9 22.2 150.6 58.5-1-.1-1.9-.2-2.9-.2-21.9 0-37.4 19.1-37.4 39.6 0 18.4 10.6 33.9 21.9 52.3 8.5 14.8 18.4 33.9 18.4 61.5 0 19.1-7.3 41.2-17 72.1l-22.2 74.3-80.7-239.6zm81.4 297.2l68.1-196.9c12.7-31.8 17-57.2 17-79.9 0-8.2-.5-15.8-1.5-22.9 17.4 31.8 27.3 68.2 27.3 107 0 82.3-44.6 154.1-110.9 192.7z"],wpbeginner:[512,512,[],"f297","M462.8 322.4C519 386.7 466.1 480 370.9 480c-39.6 0-78.82-17.69-100.1-50.04-6.887 .356-22.7 .356-29.59 0C219.8 462.4 180.6 480 141.1 480c-95.49 0-148.3-92.1-91.86-157.6C-29.92 190.5 80.48 32 256 32c175.6 0 285.9 158.6 206.8 290.4zm-339.6-82.97h41.53v-58.08h-41.53v58.08zm217.2 86.07v-23.84c-60.51 20.92-132.4 9.198-187.6-33.97l.246 24.9c51.1 46.37 131.7 57.88 187.3 32.91zm-150.8-86.07h166.1v-58.08H189.6v58.08z"],wpexplorer:[512,512,[],"f2de","M512 256c0 141.2-114.7 256-256 256C114.8 512 0 397.3 0 256S114.7 0 256 0s256 114.7 256 256zm-32 0c0-123.2-100.3-224-224-224C132.5 32 32 132.5 32 256s100.5 224 224 224 224-100.5 224-224zM160.9 124.6l86.9 37.1-37.1 86.9-86.9-37.1 37.1-86.9zm110 169.1l46.6 94h-14.6l-50-100-48.9 100h-14l51.1-106.9-22.3-9.4 6-14 68.6 29.1-6 14.3-16.5-7.1zm-11.8-116.3l68.6 29.4-29.4 68.3L230 246l29.1-68.6zm80.3 42.9l54.6 23.1-23.4 54.3-54.3-23.1 23.1-54.3z"],wpforms:[448,512,[],"f298","M448 75.2v361.7c0 24.3-19 43.2-43.2 43.2H43.2C19.3 480 0 461.4 0 436.8V75.2C0 51.1 18.8 32 43.2 32h361.7c24 0 43.1 18.8 43.1 43.2zm-37.3 361.6V75.2c0-3-2.6-5.8-5.8-5.8h-9.3L285.3 144 224 94.1 162.8 144 52.5 69.3h-9.3c-3.2 0-5.8 2.8-5.8 5.8v361.7c0 3 2.6 5.8 5.8 5.8h361.7c3.2 .1 5.8-2.7 5.8-5.8zM150.2 186v37H76.7v-37h73.5zm0 74.4v37.3H76.7v-37.3h73.5zm11.1-147.3l54-43.7H96.8l64.5 43.7zm210 72.9v37h-196v-37h196zm0 74.4v37.3h-196v-37.3h196zm-84.6-147.3l64.5-43.7H232.8l53.9 43.7zM371.3 335v37.3h-99.4V335h99.4z"],wpressr:[496,512,["rendact"],"f3e4","M248 8C111 8 0 119 0 256s111 248 248 248 248-111 248-248S384.1 8 248 8zm171.3 158.6c-15.18 34.51-30.37 69.02-45.63 103.5-2.44 5.51-6.89 8.24-12.97 8.24-23.02-.01-46.03 .06-69.05-.05-5.12-.03-8.25 1.89-10.34 6.72-10.19 23.56-20.63 47-30.95 70.5-1.54 3.51-4.06 5.29-7.92 5.29-45.94-.01-91.87-.02-137.8 0-3.13 0-5.63-1.15-7.72-3.45-11.21-12.33-22.46-24.63-33.68-36.94-2.69-2.95-2.79-6.18-1.21-9.73 8.66-19.54 17.27-39.1 25.89-58.66 12.93-29.35 25.89-58.69 38.75-88.08 1.7-3.88 4.28-5.68 8.54-5.65 14.24 .1 28.48 .02 42.72 .05 6.24 .01 9.2 4.84 6.66 10.59-13.6 30.77-27.17 61.55-40.74 92.33-5.72 12.99-11.42 25.99-17.09 39-3.91 8.95 7.08 11.97 10.95 5.6 .23-.37-1.42 4.18 30.01-67.69 1.36-3.1 3.41-4.4 6.77-4.39 15.21 .08 30.43 .02 45.64 .04 5.56 .01 7.91 3.64 5.66 8.75-8.33 18.96-16.71 37.9-24.98 56.89-4.98 11.43 8.08 12.49 11.28 5.33 .04-.08 27.89-63.33 32.19-73.16 2.02-4.61 5.44-6.51 10.35-6.5 26.43 .05 52.86 0 79.29 .05 12.44 .02 13.93-13.65 3.9-13.64-25.26 .03-50.52 .02-75.78 .02-6.27 0-7.84-2.47-5.27-8.27 5.78-13.06 11.59-26.11 17.3-39.21 1.73-3.96 4.52-5.79 8.84-5.78 23.09 .06 25.98 .02 130.8 .03 6.08-.01 8.03 2.79 5.62 8.27z"],xbox:[512,512,[],"f412","M369.9 318.2c44.3 54.3 64.7 98.8 54.4 118.7-7.9 15.1-56.7 44.6-92.6 55.9-29.6 9.3-68.4 13.3-100.4 10.2-38.2-3.7-76.9-17.4-110.1-39C93.3 445.8 87 438.3 87 423.4c0-29.9 32.9-82.3 89.2-142.1 32-33.9 76.5-73.7 81.4-72.6 9.4 2.1 84.3 75.1 112.3 109.5zM188.6 143.8c-29.7-26.9-58.1-53.9-86.4-63.4-15.2-5.1-16.3-4.8-28.7 8.1-29.2 30.4-53.5 79.7-60.3 122.4-5.4 34.2-6.1 43.8-4.2 60.5 5.6 50.5 17.3 85.4 40.5 120.9 9.5 14.6 12.1 17.3 9.3 9.9-4.2-11-.3-37.5 9.5-64 14.3-39 53.9-112.9 120.3-194.4zm311.6 63.5C483.3 127.3 432.7 77 425.6 77c-7.3 0-24.2 6.5-36 13.9-23.3 14.5-41 31.4-64.3 52.8C367.7 197 427.5 283.1 448.2 346c6.8 20.7 9.7 41.1 7.4 52.3-1.7 8.5-1.7 8.5 1.4 4.6 6.1-7.7 19.9-31.3 25.4-43.5 7.4-16.2 15-40.2 18.6-58.7 4.3-22.5 3.9-70.8-.8-93.4zM141.3 43C189 40.5 251 77.5 255.6 78.4c.7 .1 10.4-4.2 21.6-9.7 63.9-31.1 94-25.8 107.4-25.2-63.9-39.3-152.7-50-233.9-11.7-23.4 11.1-24 11.9-9.4 11.2z"],xing:[384,512,[],"f168","M162.7 210c-1.8 3.3-25.2 44.4-70.1 123.5-4.9 8.3-10.8 12.5-17.7 12.5H9.8c-7.7 0-12.1-7.5-8.5-14.4l69-121.3c.2 0 .2-.1 0-.3l-43.9-75.6c-4.3-7.8 .3-14.1 8.5-14.1H100c7.3 0 13.3 4.1 18 12.2l44.7 77.5zM382.6 46.1l-144 253v.3L330.2 466c3.9 7.1 .2 14.1-8.5 14.1h-65.2c-7.6 0-13.6-4-18-12.2l-92.4-168.5c3.3-5.8 51.5-90.8 144.8-255.2 4.6-8.1 10.4-12.2 17.5-12.2h65.7c8 0 12.3 6.7 8.5 14.1z"],"y-combinator":[448,512,[],"f23b","M448 32v448H0V32h448zM236 287.5L313.5 142h-32.7L235 233c-4.7 9.3-9 18.3-12.8 26.8L210 233l-45.2-91h-35l76.7 143.8v94.5H236v-92.8z"],yahoo:[512,512,[],"f19e","M223.7 141.1 167 284.2 111 141.1H14.93L120.8 390.2 82.19 480h94.17L317.3 141.1zm105.4 135.8a58.22 58.22 0 1 0 58.22 58.22A58.22 58.22 0 0 0 329.1 276.9zM394.6 32l-93 223.5H406.4L499.1 32z"],yammer:[512,512,[],"f840","M500.7 159.5a12.78 12.78 0 0 0 -6.4-8.282 13.95 13.95 0 0 0 -10.08-1.125L457.8 156.7l-.043-.2-22.3 5.785-1.243 .333-.608-2.17A369 369 0 0 0 347.5 4.289a14.1 14.1 0 0 0 -19.78-.463l-102.9 102.7H24.95A24.9 24.9 0 0 0 0 131.4V380.4a24.96 24.96 0 0 0 24.92 24.9H224.1L328.1 508a13.67 13.67 0 0 0 19.33 0c.126-.126 .249-.255 .37-.385a368 368 0 0 0 69.58-107.4 403.5 403.5 0 0 0 17.3-50.8v-.028l20.41 5.336 .029-.073L483.3 362a20.25 20.25 0 0 0 2.619 .5 13.36 13.36 0 0 0 4.139-.072 13.5 13.5 0 0 0 10.52-9.924 415.9 415.9 0 0 0 .058-193zM337.1 24.65l.013 .014h-.013zm-110.2 165.2L174.3 281.1a11.34 11.34 0 0 0 -1.489 5.655v46.19a22.04 22.04 0 0 1 -22.04 22h-3.4A22.07 22.07 0 0 1 125.3 332.1V287.3a11.53 11.53 0 0 0 -1.388-5.51l-51.6-92.2a21.99 21.99 0 0 1 19.26-32.73h3.268a22.06 22.06 0 0 1 19.61 11.92l36.36 70.28 37.51-70.51a22.07 22.07 0 0 1 38.56-.695 21.7 21.7 0 0 1 0 21.97zM337.1 24.67a348.1 348.1 0 0 1 75.8 141.3l.564 1.952-114.1 29.6V131.4a25.01 25.01 0 0 0 -24.95-24.9H255.1zm60.5 367.3v-.043l-.014 .014a347.2 347.2 0 0 1 -60.18 95.23l-82.2-81.89h19.18a24.98 24.98 0 0 0 24.95-24.9v-66.2l114.6 29.86A385.2 385.2 0 0 1 397.6 391.1zm84-52.45 .015 .014-50.62-13.13L299.4 292.1V219.6l119.7-30.99 4.468-1.157 39.54-10.25 18.51-4.816A393 393 0 0 1 481.6 339.5z"],yandex:[256,512,[],"f413","M153.1 315.8L65.7 512H2l96-209.8c-45.1-22.9-75.2-64.4-75.2-141.1C22.7 53.7 90.8 0 171.7 0H254v512h-55.1V315.8h-45.8zm45.8-269.3h-29.4c-44.4 0-87.4 29.4-87.4 114.6 0 82.3 39.4 108.8 87.4 108.8h29.4V46.5z"],"yandex-international":[320,512,[],"f414","M129.5 512V345.9L18.5 48h55.8l81.8 229.7L250.2 0h51.3L180.8 347.8V512h-51.3z"],yarn:[496,512,[],"f7e3","M393.9 345.2c-39 9.3-48.4 32.1-104 47.4 0 0-2.7 4-10.4 5.8-13.4 3.3-63.9 6-68.5 6.1-12.4 .1-19.9-3.2-22-8.2-6.4-15.3 9.2-22 9.2-22-8.1-5-9-9.9-9.8-8.1-2.4 5.8-3.6 20.1-10.1 26.5-8.8 8.9-25.5 5.9-35.3 .8-10.8-5.7 .8-19.2 .8-19.2s-5.8 3.4-10.5-3.6c-6-9.3-17.1-37.3 11.5-62-1.3-10.1-4.6-53.7 40.6-85.6 0 0-20.6-22.8-12.9-43.3 5-13.4 7-13.3 8.6-13.9 5.7-2.2 11.3-4.6 15.4-9.1 20.6-22.2 46.8-18 46.8-18s12.4-37.8 23.9-30.4c3.5 2.3 16.3 30.6 16.3 30.6s13.6-7.9 15.1-5c8.2 16 9.2 46.5 5.6 65.1-6.1 30.6-21.4 47.1-27.6 57.5-1.4 2.4 16.5 10 27.8 41.3 10.4 28.6 1.1 52.7 2.8 55.3 .8 1.4 13.7 .8 36.4-13.2 12.8-7.9 28.1-16.9 45.4-17 16.7-.5 17.6 19.2 4.9 22.2zM496 256c0 136.9-111.1 248-248 248S0 392.9 0 256 111.1 8 248 8s248 111.1 248 248zm-79.3 75.2c-1.7-13.6-13.2-23-28-22.8-22 .3-40.5 11.7-52.8 19.2-4.8 3-8.9 5.2-12.4 6.8 3.1-44.5-22.5-73.1-28.7-79.4 7.8-11.3 18.4-27.8 23.4-53.2 4.3-21.7 3-55.5-6.9-74.5-1.6-3.1-7.4-11.2-21-7.4-9.7-20-13-22.1-15.6-23.8-1.1-.7-23.6-16.4-41.4 28-12.2 .9-31.3 5.3-47.5 22.8-2 2.2-5.9 3.8-10.1 5.4h.1c-8.4 3-12.3 9.9-16.9 22.3-6.5 17.4 .2 34.6 6.8 45.7-17.8 15.9-37 39.8-35.7 82.5-34 36-11.8 73-5.6 79.6-1.6 11.1 3.7 19.4 12 23.8 12.6 6.7 30.3 9.6 43.9 2.8 4.9 5.2 13.8 10.1 30 10.1 6.8 0 58-2.9 72.6-6.5 6.8-1.6 11.5-4.5 14.6-7.1 9.8-3.1 36.8-12.3 62.2-28.7 18-11.7 24.2-14.2 37.6-17.4 12.9-3.2 21-15.1 19.4-28.2z"],yelp:[384,512,[],"f1e9","M42.9 240.3l99.62 48.61c19.2 9.4 16.2 37.51-4.5 42.71L30.5 358.5a22.79 22.79 0 0 1 -28.21-19.6 197.2 197.2 0 0 1 9-85.32 22.8 22.8 0 0 1 31.61-13.21zm44 239.3a199.4 199.4 0 0 0 79.42 32.11A22.78 22.78 0 0 0 192.9 490l3.9-110.8c.7-21.3-25.5-31.91-39.81-16.1l-74.21 82.4a22.82 22.82 0 0 0 4.09 34.09zm145.3-109.9l58.81 94a22.93 22.93 0 0 0 34 5.5 198.4 198.4 0 0 0 52.71-67.61A23 23 0 0 0 364.2 370l-105.4-34.26c-20.31-6.5-37.81 15.8-26.51 33.91zm148.3-132.2a197.4 197.4 0 0 0 -50.41-69.31 22.85 22.85 0 0 0 -34 4.4l-62 91.92c-11.9 17.7 4.7 40.61 25.2 34.71L366 268.6a23 23 0 0 0 14.61-31.21zM62.11 30.18a22.86 22.86 0 0 0 -9.9 32l104.1 180.4c11.7 20.2 42.61 11.9 42.61-11.4V22.88a22.67 22.67 0 0 0 -24.5-22.8 320.4 320.4 0 0 0 -112.3 30.1z"],yoast:[448,512,[],"f2b1","M91.3 76h186l-7 18.9h-179c-39.7 0-71.9 31.6-71.9 70.3v205.4c0 35.4 24.9 70.3 84 70.3V460H91.3C41.2 460 0 419.8 0 370.5V165.2C0 115.9 40.7 76 91.3 76zm229.1-56h66.5C243.1 398.1 241.2 418.9 202.2 459.3c-20.8 21.6-49.3 31.7-78.3 32.7v-51.1c49.2-7.7 64.6-49.9 64.6-75.3 0-20.1 .6-12.6-82.1-223.2h61.4L218.2 299 320.4 20zM448 161.5V460H234c6.6-9.6 10.7-16.3 12.1-19.4h182.5V161.5c0-32.5-17.1-51.9-48.2-62.9l6.7-17.6c41.7 13.6 60.9 43.1 60.9 80.5z"],youtube:[576,512,[61802],"f167","M549.7 124.1c-6.281-23.65-24.79-42.28-48.28-48.6C458.8 64 288 64 288 64S117.2 64 74.63 75.49c-23.5 6.322-42 24.95-48.28 48.6-11.41 42.87-11.41 132.3-11.41 132.3s0 89.44 11.41 132.3c6.281 23.65 24.79 41.5 48.28 47.82C117.2 448 288 448 288 448s170.8 0 213.4-11.49c23.5-6.321 42-24.17 48.28-47.82 11.41-42.87 11.41-132.3 11.41-132.3s0-89.44-11.41-132.3zm-317.5 213.5V175.2l142.7 81.21-142.7 81.2z"],zhihu:[640,512,[],"f63f","M170.5 148.1v217.5l23.43 .01 7.71 26.37 42.01-26.37h49.53V148.1H170.5zm97.75 193.9h-27.94l-27.9 17.51-5.08-17.47-11.9-.04V171.8h72.82v170.3zm-118.5-94.39H97.5c1.74-27.1 2.2-51.59 2.2-73.46h51.16s1.97-22.56-8.58-22.31h-88.5c3.49-13.12 7.87-26.66 13.12-40.67 0 0-24.07 0-32.27 21.57-3.39 8.9-13.21 43.14-30.7 78.12 5.89-.64 25.37-1.18 36.84-22.21 2.11-5.89 2.51-6.66 5.14-14.53h28.87c0 10.5-1.2 66.88-1.68 73.44H20.83c-11.74 0-15.56 23.62-15.56 23.62h65.58C66.45 321.1 42.83 363.1 0 396.3c20.49 5.85 40.91-.93 51-9.9 0 0 22.98-20.9 35.59-69.25l53.96 64.94s7.91-26.89-1.24-39.99c-7.58-8.92-28.06-33.06-36.79-41.81L87.9 311.1c4.36-13.98 6.99-27.55 7.87-40.67h61.65s-.09-23.62-7.59-23.62v.01zm412-1.6c20.83-25.64 44.98-58.57 44.98-58.57s-18.65-14.8-27.38-4.06c-6 8.15-36.83 48.2-36.83 48.2l19.23 14.43zm-150.1-59.09c-9.01-8.25-25.91 2.13-25.91 2.13s39.52 55.04 41.12 57.45l19.46-13.73s-25.67-37.61-34.66-45.86h-.01zM640 258.4c-19.78 0-130.9 .93-131.1 .93v-101c4.81 0 12.42-.4 22.85-1.2 40.88-2.41 70.13-4 87.77-4.81 0 0 12.22-27.19-.59-33.44-3.07-1.18-23.17 4.58-23.17 4.58s-165.2 16.49-232.4 18.05c1.6 8.82 7.62 17.08 15.78 19.55 13.31 3.48 22.69 1.7 49.15 .89 24.83-1.6 43.68-2.43 56.51-2.43v99.81H351.4s2.82 22.31 25.51 22.85h107.9v70.92c0 13.97-11.19 21.99-24.48 21.12-14.08 .11-26.08-1.15-41.69-1.81 1.99 3.97 6.33 14.39 19.31 21.84 9.88 4.81 16.17 6.57 26.02 6.57 29.56 0 45.67-17.28 44.89-45.31v-73.32h122.4c9.68 0 8.7-23.78 8.7-23.78l.03-.01z"]};!function(C){try{for(var c=arguments.length,z=new Array(1<c?c-1:0),l=1;l<c;l++)z[l-1]=arguments[l];C.apply(void 0,z)}catch(C){if(!H)throw C}}((function(){i("fab",o),i("fa-brands",o)}))}(),function(){"use strict";var C={},c={};try{"undefined"!=typeof window&&(C=window),"undefined"!=typeof document&&(c=document)}catch(C){}var z=void 0===(s=(C.navigator||{}).userAgent)?"":s,l=C,e=c;function a(C,c){var z,l=Object.keys(C);return Object.getOwnPropertySymbols&&(z=Object.getOwnPropertySymbols(C),c&&(z=z.filter((function(c){return Object.getOwnPropertyDescriptor(C,c).enumerable}))),l.push.apply(l,z)),l}function M(C){for(var c=1;c<arguments.length;c++){var z=null!=arguments[c]?arguments[c]:{};c%2?a(Object(z),!0).forEach((function(c){var l,e;l=C,c=z[e=c],e in l?Object.defineProperty(l,e,{value:c,enumerable:!0,configurable:!0,writable:!0}):l[e]=c})):Object.getOwnPropertyDescriptors?Object.defineProperties(C,Object.getOwnPropertyDescriptors(z)):a(Object(z)).forEach((function(c){Object.defineProperty(C,c,Object.getOwnPropertyDescriptor(z,c))}))}return C}function L(C,c){(null==c||c>C.length)&&(c=C.length);for(var z=0,l=new Array(c);z<c;z++)l[z]=C[z];return l}l.document,e.documentElement&&e.head&&"function"==typeof e.addEventListener&&e.createElement,~z.indexOf("MSIE")||z.indexOf("Trident/");var V="___FONT_AWESOME___",H=function(){try{return!0}catch(C){return!1}}(),t=[1,2,3,4,5,6,7,8,9,10],r=t.concat([11,12,13,14,15,16,17,18,19,20]),s="duotone-group";C="swap-opacity",c="primary",e="secondary",[].concat(function(C){if(Array.isArray(C))return L(C)}(z=Object.keys({solid:"fas",regular:"far",light:"fal",thin:"fat",duotone:"fad",brands:"fab",kit:"fak"}))||function(C){if("undefined"!=typeof Symbol&&null!=C[Symbol.iterator]||null!=C["@@iterator"])return Array.from(C)}(z)||function(C,c){if(C){if("string"==typeof C)return L(C,c);var z=Object.prototype.toString.call(C).slice(8,-1);return"Map"===(z="Object"===z&&C.constructor?C.constructor.name:z)||"Set"===z?Array.from(C):"Arguments"===z||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(z)?L(C,c):void 0}}(z)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}(),["2xs","xs","sm","lg","xl","2xl","beat","border","fade","beat-fade","bounce","flip-both","flip-horizontal","flip-vertical","flip","fw","inverse","layers-counter","layers-text","layers","li","pull-left","pull-right","pulse","rotate-180","rotate-270","rotate-90","rotate-by","shake","spin-pulse","spin-reverse","spin","stack-1x","stack-2x","stack","ul",s,C,c,e]).concat(t.map((function(C){return"".concat(C,"x")}))).concat(r.map((function(C){return"w-".concat(C)}))),(l=l||{})[V]||(l[V]={}),l[V].styles||(l[V].styles={}),l[V].hooks||(l[V].hooks={}),l[V].shims||(l[V].shims=[]);var h=l[V];function n(C){return Object.keys(C).reduce((function(c,z){var l=C[z];return l.icon?c[l.iconName]=l.icon:c[z]=l,c}),{})}function i(C,c,z){z=void 0!==(l=(2<arguments.length&&void 0!==z?z:{}).skipHooks)&&l;var l=n(c);"function"!=typeof h.hooks.addPack||z?h.styles[C]=M(M({},h.styles[C]||{}),l):h.hooks.addPack(C,n(c)),"fas"===C&&i("fa",c)}var o={"address-book":[512,512,[62138,"contact-book"],"f2b9","M272 288h-64C163.8 288 128 323.8 128 368C128 376.8 135.2 384 144 384h192c8.836 0 16-7.164 16-16C352 323.8 316.2 288 272 288zM240 256c35.35 0 64-28.65 64-64s-28.65-64-64-64c-35.34 0-64 28.65-64 64S204.7 256 240 256zM496 320H480v96h16c8.836 0 16-7.164 16-16v-64C512 327.2 504.8 320 496 320zM496 64H480v96h16C504.8 160 512 152.8 512 144v-64C512 71.16 504.8 64 496 64zM496 192H480v96h16C504.8 288 512 280.8 512 272v-64C512 199.2 504.8 192 496 192zM384 0H96C60.65 0 32 28.65 32 64v384c0 35.35 28.65 64 64 64h288c35.35 0 64-28.65 64-64V64C448 28.65 419.3 0 384 0zM400 448c0 8.836-7.164 16-16 16H96c-8.836 0-16-7.164-16-16V64c0-8.838 7.164-16 16-16h288c8.836 0 16 7.162 16 16V448z"],"address-card":[576,512,[62140,"contact-card","vcard"],"f2bb","M208 256c35.35 0 64-28.65 64-64c0-35.35-28.65-64-64-64s-64 28.65-64 64C144 227.3 172.7 256 208 256zM464 232h-96c-13.25 0-24 10.75-24 24s10.75 24 24 24h96c13.25 0 24-10.75 24-24S477.3 232 464 232zM240 288h-64C131.8 288 96 323.8 96 368C96 376.8 103.2 384 112 384h192c8.836 0 16-7.164 16-16C320 323.8 284.2 288 240 288zM464 152h-96c-13.25 0-24 10.75-24 24s10.75 24 24 24h96c13.25 0 24-10.75 24-24S477.3 152 464 152zM512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM528 416c0 8.822-7.178 16-16 16H64c-8.822 0-16-7.178-16-16V96c0-8.822 7.178-16 16-16h448c8.822 0 16 7.178 16 16V416z"],bell:[448,512,[61602,128276],"f0f3","M256 32V49.88C328.5 61.39 384 124.2 384 200V233.4C384 278.8 399.5 322.9 427.8 358.4L442.7 377C448.5 384.2 449.6 394.1 445.6 402.4C441.6 410.7 433.2 416 424 416H24C14.77 416 6.365 410.7 2.369 402.4C-1.628 394.1-.504 384.2 5.26 377L20.17 358.4C48.54 322.9 64 278.8 64 233.4V200C64 124.2 119.5 61.39 192 49.88V32C192 14.33 206.3 0 224 0C241.7 0 256 14.33 256 32V32zM216 96C158.6 96 112 142.6 112 200V233.4C112 281.3 98.12 328 72.31 368H375.7C349.9 328 336 281.3 336 233.4V200C336 142.6 289.4 96 232 96H216zM288 448C288 464.1 281.3 481.3 269.3 493.3C257.3 505.3 240.1 512 224 512C207 512 190.7 505.3 178.7 493.3C166.7 481.3 160 464.1 160 448H288z"],"bell-slash":[640,512,[61943,128277],"f1f6","M183.6 118.6C206.5 82.58 244.1 56.84 288 49.88V32C288 14.33 302.3 .0003 320 .0003C337.7 .0003 352 14.33 352 32V49.88C424.5 61.39 480 124.2 480 200V233.4C480 278.8 495.5 322.9 523.8 358.4L538.7 377C543.1 383.5 545.4 392.2 542.6 400L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L183.6 118.6zM221.7 148.4L450.7 327.1C438.4 298.2 432 266.1 432 233.4V200C432 142.6 385.4 96 328 96H312C273.3 96 239.6 117.1 221.7 148.4V148.4zM160 233.4V222.1L206.7 258.9C202.7 297.7 189.5 335.2 168.3 368H345.2L406.2 416H120C110.8 416 102.4 410.7 98.37 402.4C94.37 394.1 95.5 384.2 101.3 377L116.2 358.4C144.5 322.9 160 278.8 160 233.4V233.4zM384 448C384 464.1 377.3 481.3 365.3 493.3C353.3 505.3 336.1 512 320 512C303 512 286.7 505.3 274.7 493.3C262.7 481.3 256 464.1 256 448H384z"],bookmark:[384,512,[61591,128278],"f02e","M336 0h-288C21.49 0 0 21.49 0 48v431.9c0 24.7 26.79 40.08 48.12 27.64L192 423.6l143.9 83.93C357.2 519.1 384 504.6 384 479.9V48C384 21.49 362.5 0 336 0zM336 452L192 368l-144 84V54C48 50.63 50.63 48 53.1 48h276C333.4 48 336 50.63 336 54V452z"],building:[384,512,[61687,127970],"f1ad","M88 104C88 95.16 95.16 88 104 88H152C160.8 88 168 95.16 168 104V152C168 160.8 160.8 168 152 168H104C95.16 168 88 160.8 88 152V104zM280 88C288.8 88 296 95.16 296 104V152C296 160.8 288.8 168 280 168H232C223.2 168 216 160.8 216 152V104C216 95.16 223.2 88 232 88H280zM88 232C88 223.2 95.16 216 104 216H152C160.8 216 168 223.2 168 232V280C168 288.8 160.8 296 152 296H104C95.16 296 88 288.8 88 280V232zM280 216C288.8 216 296 223.2 296 232V280C296 288.8 288.8 296 280 296H232C223.2 296 216 288.8 216 280V232C216 223.2 223.2 216 232 216H280zM0 64C0 28.65 28.65 0 64 0H320C355.3 0 384 28.65 384 64V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM48 64V448C48 456.8 55.16 464 64 464H144V400C144 373.5 165.5 352 192 352C218.5 352 240 373.5 240 400V464H320C328.8 464 336 456.8 336 448V64C336 55.16 328.8 48 320 48H64C55.16 48 48 55.16 48 64z"],calendar:[448,512,[128198,128197],"f133","M152 64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0C141.3 0 152 10.75 152 24V64zM48 448C48 456.8 55.16 464 64 464H384C392.8 464 400 456.8 400 448V192H48V448z"],"calendar-check":[448,512,[],"f274","M216.1 408.1C207.6 418.3 192.4 418.3 183 408.1L119 344.1C109.7 335.6 109.7 320.4 119 311C128.4 301.7 143.6 301.7 152.1 311L200 358.1L295 263C304.4 253.7 319.6 253.7 328.1 263C338.3 272.4 338.3 287.6 328.1 296.1L216.1 408.1zM128 0C141.3 0 152 10.75 152 24V64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0zM400 192H48V448C48 456.8 55.16 464 64 464H384C392.8 464 400 456.8 400 448V192z"],"calendar-days":[448,512,["calendar-alt"],"f073","M152 64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0C141.3 0 152 10.75 152 24V64zM48 248H128V192H48V248zM48 296V360H128V296H48zM176 296V360H272V296H176zM320 296V360H400V296H320zM400 192H320V248H400V192zM400 408H320V464H384C392.8 464 400 456.8 400 448V408zM272 408H176V464H272V408zM128 408H48V448C48 456.8 55.16 464 64 464H128V408zM272 192H176V248H272V192z"],"calendar-minus":[448,512,[],"f272","M152 352C138.7 352 128 341.3 128 328C128 314.7 138.7 304 152 304H296C309.3 304 320 314.7 320 328C320 341.3 309.3 352 296 352H152zM128 0C141.3 0 152 10.75 152 24V64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0zM400 192H48V448C48 456.8 55.16 464 64 464H384C392.8 464 400 456.8 400 448V192z"],"calendar-plus":[448,512,[],"f271","M224 232C237.3 232 248 242.7 248 256V304H296C309.3 304 320 314.7 320 328C320 341.3 309.3 352 296 352H248V400C248 413.3 237.3 424 224 424C210.7 424 200 413.3 200 400V352H152C138.7 352 128 341.3 128 328C128 314.7 138.7 304 152 304H200V256C200 242.7 210.7 232 224 232zM152 64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0C141.3 0 152 10.75 152 24V64zM48 448C48 456.8 55.16 464 64 464H384C392.8 464 400 456.8 400 448V192H48V448z"],"calendar-xmark":[448,512,["calendar-times"],"f273","M257.9 328L304.1 375C314.3 384.4 314.3 399.6 304.1 408.1C295.6 418.3 280.4 418.3 271 408.1L224 361.9L176.1 408.1C167.6 418.3 152.4 418.3 143 408.1C133.7 399.6 133.7 384.4 143 375L190.1 328L143 280.1C133.7 271.6 133.7 256.4 143 247C152.4 237.7 167.6 237.7 176.1 247L224 294.1L271 247C280.4 237.7 295.6 237.7 304.1 247C314.3 256.4 314.3 271.6 304.1 280.1L257.9 328zM128 0C141.3 0 152 10.75 152 24V64H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V64H384C419.3 64 448 92.65 448 128V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H104V24C104 10.75 114.7 0 128 0zM400 192H48V448C48 456.8 55.16 464 64 464H384C392.8 464 400 456.8 400 448V192z"],"chart-bar":[512,512,["bar-chart"],"f080","M24 32C37.25 32 48 42.75 48 56V408C48 421.3 58.75 432 72 432H488C501.3 432 512 442.7 512 456C512 469.3 501.3 480 488 480H72C32.24 480 0 447.8 0 408V56C0 42.75 10.75 32 24 32zM128 136C128 122.7 138.7 112 152 112H360C373.3 112 384 122.7 384 136C384 149.3 373.3 160 360 160H152C138.7 160 128 149.3 128 136zM296 208C309.3 208 320 218.7 320 232C320 245.3 309.3 256 296 256H152C138.7 256 128 245.3 128 232C128 218.7 138.7 208 152 208H296zM424 304C437.3 304 448 314.7 448 328C448 341.3 437.3 352 424 352H152C138.7 352 128 341.3 128 328C128 314.7 138.7 304 152 304H424z"],"chess-bishop":[320,512,[9821],"f43a","M296 464H23.1C10.75 464 0 474.7 0 487.1S10.75 512 23.1 512h272C309.3 512 320 501.3 320 488S309.3 464 296 464zM0 304c0 51.63 30.12 85.25 64 96v32h48v-67.13l-33.5-10.63C63.75 349.5 48 333.9 48 304c0-84.1 93.2-206.5 112.6-206.5c19.63 0 60.01 67.18 70.28 85.8l-66.13 66.13c-3.125 3.125-4.688 7.219-4.688 11.31S161.6 268.9 164.8 272L176 283.2c3.125 3.125 7.219 4.688 11.31 4.688s8.188-1.562 11.31-4.688L253 229C264.4 256.8 272 283.5 272 304c0 29.88-15.75 45.5-30.5 50.25L208 364.9V432H256v-32c33.88-10.75 64-44.38 64-96c0-73.38-67.75-197.2-120.6-241.5C213.4 59.12 224 47 224 32c0-17.62-14.38-32-32-32H128C110.4 0 96 14.38 96 32c0 15 10.62 27.12 24.62 30.5C67.75 106.8 0 230.6 0 304z"],"chess-king":[448,512,[9818],"f43f","M391.9 464H55.95c-13.25 0-23.1 10.75-23.1 23.1S42.7 512 55.95 512h335.1c13.25 0 23.1-10.75 23.1-23.1S405.2 464 391.9 464zM448 216c0-11.82-3.783-23.51-11.08-33.17c-10.3-14.39-27-22.88-44.73-22.88L247.9 160V104h31.1c13.2 0 24.06-10.8 24.06-24S293.1 56 279.9 56h-31.1V23.1C247.9 10.8 237.2 0 223.1 0S199.9 10.8 199.9 23.1V56H167.9c-13.2 0-23.97 10.8-23.97 24S154.7 104 167.9 104h31.1V160H55.95C24.72 160 0 185.3 0 215.9C0 221.6 .8893 227.4 2.704 233L68.45 432h50.5L48.33 218.4C48.09 217.6 47.98 216.9 47.98 216.1C47.98 212.3 50.93 208 55.95 208h335.9c6.076 0 8.115 5.494 8.115 8.113c0 .6341-.078 1.269-.2405 1.887L328.8 432h50.62l65.1-199.2C447.2 227.3 448 221.7 448 216z"],"chess-knight":[384,512,[9822],"f441","M44 320.6l14.5 6.5c-17.01 20.24-26.44 45.91-26.44 72.35C32.06 399.7 32.12 432 32.12 432h48v-32c0-24.75 14-47.5 36.13-58.63l38.13-23.37c13.25-6.625 21.75-20.25 21.75-35.13v-58.75l-15.37 9C155.6 235.8 151.9 240.4 150.5 245.9L143 271c-2.25 7.625-8 13.88-15.38 16.75L117.1 292C114 293.3 110.7 293.9 107.4 293.9c-3.626 0-7.263-.7514-10.66-2.254L63.5 276.9C54.12 272.6 48 263.2 48 252.9V140.5c0-5.125 2.125-10.12 5.75-13.88l7.375-7.375L49.5 96C48.5 94.12 48 92 48 89.88C48 84.38 52.38 80 57.88 80h105c86.75 0 156.1 70.38 156.1 157.1V432h48.06l-.0625-194.9C367.9 124 276 32 162.9 32H57.88C25.88 32 0 57.88 0 89.88c0 8.5 1.75 16.88 5.125 24.62C1.75 122.8 0 131.6 0 140.5v112.4C0 282.2 17.25 308.8 44 320.6zM80.12 164c0 11 8.875 20 20 20c11 0 20-9 20-20s-9-20-20-20C89 144 80.12 153 80.12 164zM360 464H23.1C10.75 464 0 474.7 0 487.1S10.75 512 23.1 512H360C373.3 512 384 501.3 384 488S373.3 464 360 464z"],"chess-pawn":[320,512,[9823],"f443","M296 463.1H23.1c-13.25 0-23.1 10.75-23.1 24s10.75 24 23.1 24h272c13.25 0 23.1-10.75 23.1-23.1S309.3 463.1 296 463.1zM55.1 287.1L80 287.1v29.5c0 40.25-3.5 81.25-23.38 114.5h53.5C125.1 394.1 128 354.6 128 317.5v-29.5h64v29.5c0 37.13 2.875 77.5 17.88 114.5h53.5C243.5 398.7 240 357.7 240 317.5V287.1l24-.0001C277.3 287.1 288 277.3 288 263.1c0-13.25-10.75-24-23.1-24H241c23.75-21.88 38.1-53.12 38.1-87.1c0-9.393-1.106-19.05-3.451-28.86C272.3 105.4 244.9 32 159.1 32C93.75 32 40 85.75 40 151.1c0 34.88 15.12 66.12 39 88H55.1C42.75 239.1 32 250.7 32 263.1C32 277.3 42.75 287.1 55.1 287.1zM160 79.1c39.75 0 72 32.25 72 72S199.8 223.1 160 223.1S88 191.7 88 151.1S120.2 79.1 160 79.1z"],"chess-queen":[512,512,[9819],"f445","M256 112c30.88 0 56-25.12 56-56S286.9 0 256 0S199.1 25.12 199.1 56S225.1 112 256 112zM511.1 197.4c0-5.178-2.509-10.2-7.096-13.26L476.4 168.2c-2.5-1.75-5.497-2.62-8.497-2.62c-5.501 .125-10.63 2.87-13.75 7.245c-9.001 12-23.16 19.13-38.16 19.13c-3.125 0-6.089-.2528-9.089-.8778c-23.13-4.25-38.88-26.25-38.88-49.75C367.1 134 361.1 128 354.6 128h-38.75c-6.001 0-11.63 4-12.88 9.875C298.2 160.1 278.7 176 255.1 176c-22.75 0-42.25-15.88-47-38.12C207.7 132 202.2 128 196.1 128h-38.75C149.1 128 143.1 134 143.1 141.4c0 18.49-13.66 50.62-47.95 50.62c-15.13 0-29.3-7.118-38.3-19.24C54.6 168.4 49.66 165.7 44.15 165.6c-3 0-5.931 .8951-8.432 2.645l-28.63 16C2.509 187.2 0 192.3 0 197.4c0 2.438 .5583 4.901 1.72 7.185L109.9 432h53.13L69.85 236.4C78.35 238.8 87.11 240 95.98 240c2.432 0 56.83 1.503 84.76-52.5C198.1 210.5 226.6 224 255.9 224c29.38 0 57.01-13.38 75.26-36.25C336.1 197.6 360.6 240 416 240c8.751 0 17.5-1.125 26-3.5L349 432h53.13l108.1-227.4C511.4 202.3 511.1 199.8 511.1 197.4zM424 464H87.98c-13.26 0-24 10.75-24 23.1S74.72 512 87.98 512h336c13.26 0 24-10.75 24-23.1S437.3 464 424 464z"],"chess-rook":[384,512,[9820],"f447","M360 464H23.1C10.75 464 0 474.7 0 487.1S10.75 512 23.1 512H360C373.3 512 384 501.3 384 488S373.3 464 360 464zM345.1 32h-308C17 32 0 49 0 70v139.4C0 218.8 4 227.5 11 233.6L48 265.8c0 8.885 .0504 17.64 .0504 26.46c0 39.32-1.001 79.96-11.93 139.8h49C94.95 374.3 96.11 333.3 96.11 285.5C96.11 270.7 96 255.1 96 238.2L48 196.5V80h64V128H160V80h64V128h48V80h64v116.5L288 238.2c0 16.77-.1124 32.25-.1124 47.1c0 47.79 1.164 89.15 10.99 146.7h49c-10.92-59.83-11.93-100.6-11.93-139.9C335.9 283.3 336 274.6 336 265.8l37-32.13C380 227.5 384 218.8 384 209.4V70C384 49 367 32 345.1 32zM192 224C174.4 224 160 238.4 160 256v64h64V256C224 238.4 209.6 224 192 224z"],circle:[512,512,[128308,128309,128992,128993,128994,128995,128996,9898,9899,11044,61708,61915,9679],"f111","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"circle-check":[512,512,[61533,"check-circle"],"f058","M243.8 339.8C232.9 350.7 215.1 350.7 204.2 339.8L140.2 275.8C129.3 264.9 129.3 247.1 140.2 236.2C151.1 225.3 168.9 225.3 179.8 236.2L224 280.4L332.2 172.2C343.1 161.3 360.9 161.3 371.8 172.2C382.7 183.1 382.7 200.9 371.8 211.8L243.8 339.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"circle-dot":[512,512,[128280,"dot-circle"],"f192","M160 256C160 202.1 202.1 160 256 160C309 160 352 202.1 352 256C352 309 309 352 256 352C202.1 352 160 309 160 256zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"circle-down":[512,512,[61466,"arrow-alt-circle-down"],"f358","M344 240h-56L287.1 152c0-13.25-10.75-24-24-24h-16C234.7 128 223.1 138.8 223.1 152L224 240h-56c-9.531 0-18.16 5.656-22 14.38C142.2 263.1 143.9 273.3 150.4 280.3l88.75 96C243.7 381.2 250.1 384 256.8 384c7.781-.3125 13.25-2.875 17.75-7.844l87.25-96c6.406-7.031 8.031-17.19 4.188-25.88S353.5 240 344 240zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-left":[512,512,[61840,"arrow-alt-circle-left"],"f359","M360 224L272 224v-56c0-9.531-5.656-18.16-14.38-22C248.9 142.2 238.7 143.9 231.7 150.4l-96 88.75C130.8 243.7 128 250.1 128 256.8c.3125 7.781 2.875 13.25 7.844 17.75l96 87.25c7.031 6.406 17.19 8.031 25.88 4.188s14.28-12.44 14.28-21.94l-.002-56L360 288C373.3 288 384 277.3 384 264v-16C384 234.8 373.3 224 360 224zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-pause":[512,512,[62092,"pause-circle"],"f28b","M200 160C186.8 160 176 170.8 176 184v144C176 341.3 186.8 352 200 352S224 341.3 224 328v-144C224 170.8 213.3 160 200 160zM312 160C298.8 160 288 170.8 288 184v144c0 13.25 10.75 24 24 24s24-10.75 24-24v-144C336 170.8 325.3 160 312 160zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-play":[512,512,[61469,"play-circle"],"f144","M188.3 147.1C195.8 142.8 205.1 142.1 212.5 147.5L356.5 235.5C363.6 239.9 368 247.6 368 256C368 264.4 363.6 272.1 356.5 276.5L212.5 364.5C205.1 369 195.8 369.2 188.3 364.9C180.7 360.7 176 352.7 176 344V167.1C176 159.3 180.7 151.3 188.3 147.1V147.1zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"circle-question":[512,512,[62108,"question-circle"],"f059","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464zM256 336c-18 0-32 14-32 32s13.1 32 32 32c17.1 0 32-14 32-32S273.1 336 256 336zM289.1 128h-51.1C199 128 168 159 168 198c0 13 11 24 24 24s24-11 24-24C216 186 225.1 176 237.1 176h51.1C301.1 176 312 186 312 198c0 8-4 14.1-11 18.1L244 251C236 256 232 264 232 272V288c0 13 11 24 24 24S280 301 280 288V286l45.1-28c21-13 34-36 34-60C360 159 329 128 289.1 128z"],"circle-right":[512,512,[61838,"arrow-alt-circle-right"],"f35a","M280.2 150.2C273.1 143.8 262.1 142.2 254.3 146.1S239.1 158.5 239.1 167.1l.002 56L152 224C138.8 224 128 234.8 128 248v16C128 277.3 138.8 288 152 288L240 287.1v56c0 9.531 5.656 18.16 14.38 22c8.75 3.812 18.91 2.094 25.91-4.375l96-88.75C381.2 268.3 384 261.9 384 255.2c-.3125-7.781-2.875-13.25-7.844-17.75L280.2 150.2zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-stop":[512,512,[62094,"stop-circle"],"f28d","M328 160h-144C170.8 160 160 170.8 160 184v144C160 341.2 170.8 352 184 352h144c13.2 0 24-10.8 24-24v-144C352 170.8 341.2 160 328 160zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-up":[512,512,[61467,"arrow-alt-circle-up"],"f35b","M272.9 135.7C268.3 130.8 261.9 128 255.2 128C247.5 128.3 241.1 130.9 237.5 135.8l-87.25 96C143.8 238.9 142.2 249 146.1 257.7C149.9 266.4 158.5 272 167.1 272h56L224 360c0 13.25 10.75 24 24 24h16c13.25 0 23.1-10.75 23.1-24L287.1 272h56c9.531 0 18.16-5.656 22-14.38c3.811-8.75 2.092-18.91-4.377-25.91L272.9 135.7zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464z"],"circle-user":[512,512,[62142,"user-circle"],"f2bd","M256 112c-48.6 0-88 39.4-88 88C168 248.6 207.4 288 256 288s88-39.4 88-88C344 151.4 304.6 112 256 112zM256 240c-22.06 0-40-17.95-40-40C216 177.9 233.9 160 256 160s40 17.94 40 40C296 222.1 278.1 240 256 240zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-46.73 0-89.76-15.68-124.5-41.79C148.8 389 182.4 368 220.2 368h71.69c37.75 0 71.31 21.01 88.68 54.21C345.8 448.3 302.7 464 256 464zM416.2 388.5C389.2 346.3 343.2 320 291.8 320H220.2c-51.36 0-97.35 26.25-124.4 68.48C65.96 352.5 48 306.3 48 256c0-114.7 93.31-208 208-208s208 93.31 208 208C464 306.3 446 352.5 416.2 388.5z"],"circle-xmark":[512,512,[61532,"times-circle","xmark-circle"],"f057","M175 175C184.4 165.7 199.6 165.7 208.1 175L255.1 222.1L303 175C312.4 165.7 327.6 165.7 336.1 175C346.3 184.4 346.3 199.6 336.1 208.1L289.9 255.1L336.1 303C346.3 312.4 346.3 327.6 336.1 336.1C327.6 346.3 312.4 346.3 303 336.1L255.1 289.9L208.1 336.1C199.6 346.3 184.4 346.3 175 336.1C165.7 327.6 165.7 312.4 175 303L222.1 255.1L175 208.1C165.7 199.6 165.7 184.4 175 175V175zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],clipboard:[384,512,[128203],"f328","M320 64h-49.61C262.1 27.48 230.7 0 192 0S121 27.48 113.6 64H64C28.65 64 0 92.66 0 128v320c0 35.34 28.65 64 64 64h256c35.35 0 64-28.66 64-64V128C384 92.66 355.3 64 320 64zM192 48c13.23 0 24 10.77 24 24S205.2 96 192 96S168 85.23 168 72S178.8 48 192 48zM336 448c0 8.82-7.178 16-16 16H64c-8.822 0-16-7.18-16-16V128c0-8.82 7.178-16 16-16h18.26C80.93 117.1 80 122.4 80 128v16C80 152.8 87.16 160 96 160h192c8.836 0 16-7.164 16-16V128c0-5.559-.9316-10.86-2.264-16H320c8.822 0 16 7.18 16 16V448z"],clock:[512,512,[128339,"clock-four"],"f017","M232 120C232 106.7 242.7 96 256 96C269.3 96 280 106.7 280 120V243.2L365.3 300C376.3 307.4 379.3 322.3 371.1 333.3C364.6 344.3 349.7 347.3 338.7 339.1L242.7 275.1C236 271.5 232 264 232 255.1L232 120zM256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0zM48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256z"],clone:[512,512,[],"f24d","M64 464H288C296.8 464 304 456.8 304 448V384H352V448C352 483.3 323.3 512 288 512H64C28.65 512 0 483.3 0 448V224C0 188.7 28.65 160 64 160H128V208H64C55.16 208 48 215.2 48 224V448C48 456.8 55.16 464 64 464zM160 64C160 28.65 188.7 0 224 0H448C483.3 0 512 28.65 512 64V288C512 323.3 483.3 352 448 352H224C188.7 352 160 323.3 160 288V64zM224 304H448C456.8 304 464 296.8 464 288V64C464 55.16 456.8 48 448 48H224C215.2 48 208 55.16 208 64V288C208 296.8 215.2 304 224 304z"],"closed-captioning":[576,512,[],"f20a","M512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM528 416c0 8.822-7.178 16-16 16H64c-8.822 0-16-7.178-16-16V96c0-8.822 7.178-16 16-16h448c8.822 0 16 7.178 16 16V416zM236.5 222.1c9.375 9.375 24.56 9.375 33.94 0c9.375-9.375 9.375-24.56 0-33.94c-37.44-37.44-98.31-37.44-135.7 0C116.5 206.2 106.5 230.4 106.5 256s9.1 49.75 28.12 67.88c18.72 18.72 43.28 28.08 67.87 28.08s49.16-9.359 67.87-28.08c9.375-9.375 9.375-24.56 0-33.94c-9.375-9.375-24.56-9.375-33.94 0c-18.69 18.72-49.19 18.72-67.87 0C159.5 280.9 154.5 268.8 154.5 256s5-24.88 14.06-33.94C187.3 203.3 217.8 203.3 236.5 222.1zM428.5 222.1c9.375 9.375 24.56 9.375 33.94 0c9.375-9.375 9.375-24.56 0-33.94c-37.44-37.44-98.31-37.44-135.7 0C308.5 206.2 298.5 230.4 298.5 256s9.1 49.75 28.12 67.88c18.72 18.72 43.28 28.08 67.87 28.08s49.16-9.359 67.87-28.08c9.375-9.375 9.375-24.56 0-33.94c-9.375-9.375-24.56-9.375-33.94 0c-18.69 18.72-49.19 18.72-67.87 0C351.5 280.9 346.5 268.8 346.5 256s5-24.88 14.06-33.94C379.3 203.3 409.8 203.3 428.5 222.1z"],comment:[512,512,[61669,128489],"f075","M256 32C114.6 32 .0272 125.1 .0272 240c0 47.63 19.91 91.25 52.91 126.2c-14.88 39.5-45.87 72.88-46.37 73.25c-6.625 7-8.375 17.25-4.625 26C5.818 474.2 14.38 480 24 480c61.5 0 109.1-25.75 139.1-46.25C191.1 442.8 223.3 448 256 448c141.4 0 255.1-93.13 255.1-208S397.4 32 256 32zM256.1 400c-26.75 0-53.12-4.125-78.38-12.12l-22.75-7.125l-19.5 13.75c-14.25 10.12-33.88 21.38-57.5 29c7.375-12.12 14.37-25.75 19.88-40.25l10.62-28l-20.62-21.87C69.82 314.1 48.07 282.2 48.07 240c0-88.25 93.25-160 208-160s208 71.75 208 160S370.8 400 256.1 400z"],"comment-dots":[512,512,[62075,128172,"commenting"],"f4ad","M144 208C126.3 208 112 222.2 112 239.1C112 257.7 126.3 272 144 272s31.1-14.25 31.1-32S161.8 208 144 208zM256 207.1c-17.75 0-31.1 14.25-31.1 32s14.25 31.1 31.1 31.1s31.1-14.25 31.1-31.1S273.8 207.1 256 207.1zM368 208c-17.75 0-31.1 14.25-31.1 32s14.25 32 31.1 32c17.75 0 31.99-14.25 31.99-32C400 222.2 385.8 208 368 208zM256 31.1c-141.4 0-255.1 93.12-255.1 208c0 47.62 19.91 91.25 52.91 126.3c-14.87 39.5-45.87 72.88-46.37 73.25c-6.624 7-8.373 17.25-4.624 26C5.818 474.2 14.38 480 24 480c61.49 0 109.1-25.75 139.1-46.25c28.87 9 60.16 14.25 92.9 14.25c141.4 0 255.1-93.13 255.1-207.1S397.4 31.1 256 31.1zM256 400c-26.75 0-53.12-4.125-78.36-12.12l-22.75-7.125L135.4 394.5c-14.25 10.12-33.87 21.38-57.49 29c7.374-12.12 14.37-25.75 19.87-40.25l10.62-28l-20.62-21.87C69.81 314.1 48.06 282.2 48.06 240c0-88.25 93.24-160 207.1-160s207.1 71.75 207.1 160S370.8 400 256 400z"],comments:[640,512,[61670,128490],"f086","M208 0C322.9 0 416 78.8 416 176C416 273.2 322.9 352 208 352C189.3 352 171.2 349.7 153.9 345.8C123.3 364.8 79.13 384 24.95 384C14.97 384 5.93 378.1 2.018 368.9C-1.896 359.7-.0074 349.1 6.739 341.9C7.26 341.5 29.38 317.4 45.73 285.9C17.18 255.8 0 217.6 0 176C0 78.8 93.13 0 208 0zM164.6 298.1C179.2 302.3 193.8 304 208 304C296.2 304 368 246.6 368 176C368 105.4 296.2 48 208 48C119.8 48 48 105.4 48 176C48 211.2 65.71 237.2 80.57 252.9L104.1 277.8L88.31 308.1C84.74 314.1 80.73 321.9 76.55 328.5C94.26 323.4 111.7 315.5 128.7 304.1L145.4 294.6L164.6 298.1zM441.6 128.2C552 132.4 640 209.5 640 304C640 345.6 622.8 383.8 594.3 413.9C610.6 445.4 632.7 469.5 633.3 469.9C640 477.1 641.9 487.7 637.1 496.9C634.1 506.1 625 512 615 512C560.9 512 516.7 492.8 486.1 473.8C468.8 477.7 450.7 480 432 480C350 480 279.1 439.8 245.2 381.5C262.5 379.2 279.1 375.3 294.9 369.9C322.9 407.1 373.9 432 432 432C446.2 432 460.8 430.3 475.4 426.1L494.6 422.6L511.3 432.1C528.3 443.5 545.7 451.4 563.5 456.5C559.3 449.9 555.3 442.1 551.7 436.1L535.9 405.8L559.4 380.9C574.3 365.3 592 339.2 592 304C592 237.7 528.7 183.1 447.1 176.6L448 176C448 159.5 445.8 143.5 441.6 128.2H441.6z"],compass:[512,512,[129517],"f14e","M306.7 325.1L162.4 380.6C142.1 388.1 123.9 369 131.4 349.6L186.9 205.3C190.1 196.8 196.8 190.1 205.3 186.9L349.6 131.4C369 123.9 388.1 142.1 380.6 162.4L325.1 306.7C321.9 315.2 315.2 321.9 306.7 325.1V325.1zM255.1 224C238.3 224 223.1 238.3 223.1 256C223.1 273.7 238.3 288 255.1 288C273.7 288 288 273.7 288 256C288 238.3 273.7 224 255.1 224V224zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],copy:[512,512,[],"f0c5","M502.6 70.63l-61.25-61.25C435.4 3.371 427.2 0 418.7 0H255.1c-35.35 0-64 28.66-64 64l.0195 256C192 355.4 220.7 384 256 384h192c35.2 0 64-28.8 64-64V93.25C512 84.77 508.6 76.63 502.6 70.63zM464 320c0 8.836-7.164 16-16 16H255.1c-8.838 0-16-7.164-16-16L239.1 64.13c0-8.836 7.164-16 16-16h128L384 96c0 17.67 14.33 32 32 32h47.1V320zM272 448c0 8.836-7.164 16-16 16H63.1c-8.838 0-16-7.164-16-16L47.98 192.1c0-8.836 7.164-16 16-16H160V128H63.99c-35.35 0-64 28.65-64 64l.0098 256C.002 483.3 28.66 512 64 512h192c35.2 0 64-28.8 64-64v-32h-47.1L272 448z"],copyright:[512,512,[169],"f1f9","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464zM255.1 176C255.1 176 255.1 176 255.1 176c21.06 0 40.92 8.312 55.83 23.38c9.375 9.344 24.53 9.5 33.97 .1562c9.406-9.344 9.469-24.53 .1562-33.97c-24-24.22-55.95-37.56-89.95-37.56c0 0 .0313 0 0 0c-33.97 0-65.95 13.34-89.95 37.56c-49.44 49.88-49.44 131 0 180.9c24 24.22 55.98 37.56 89.95 37.56c.0313 0 0 0 0 0c34 0 65.95-13.34 89.95-37.56c9.312-9.438 9.25-24.62-.1562-33.97c-9.438-9.312-24.59-9.219-33.97 .1562c-14.91 15.06-34.77 23.38-55.83 23.38c0 0 .0313 0 0 0c-21.09 0-40.95-8.312-55.89-23.38c-30.94-31.22-30.94-82.03 0-113.3C214.2 184.3 234 176 255.1 176z"],"credit-card":[576,512,[62083,128179,"credit-card-alt"],"f09d","M168 336C181.3 336 192 346.7 192 360C192 373.3 181.3 384 168 384H120C106.7 384 96 373.3 96 360C96 346.7 106.7 336 120 336H168zM360 336C373.3 336 384 346.7 384 360C384 373.3 373.3 384 360 384H248C234.7 384 224 373.3 224 360C224 346.7 234.7 336 248 336H360zM512 32C547.3 32 576 60.65 576 96V416C576 451.3 547.3 480 512 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H512zM512 80H64C55.16 80 48 87.16 48 96V128H528V96C528 87.16 520.8 80 512 80zM528 224H48V416C48 424.8 55.16 432 64 432H512C520.8 432 528 424.8 528 416V224z"],envelope:[512,512,[128386,61443,9993],"f0e0","M0 128C0 92.65 28.65 64 64 64H448C483.3 64 512 92.65 512 128V384C512 419.3 483.3 448 448 448H64C28.65 448 0 419.3 0 384V128zM48 128V150.1L220.5 291.7C241.1 308.7 270.9 308.7 291.5 291.7L464 150.1V127.1C464 119.2 456.8 111.1 448 111.1H64C55.16 111.1 48 119.2 48 127.1L48 128zM48 212.2V384C48 392.8 55.16 400 64 400H448C456.8 400 464 392.8 464 384V212.2L322 328.8C283.6 360.3 228.4 360.3 189.1 328.8L48 212.2z"],"envelope-open":[512,512,[62135],"f2b6","M493.6 163c-24.88-19.62-45.5-35.37-164.3-121.6C312.7 29.21 279.7 0 256.4 0H255.6C232.3 0 199.3 29.21 182.6 41.38C63.88 127.6 43.25 143.4 18.38 163C6.75 172 0 186 0 200.8v247.2C0 483.3 28.65 512 64 512h384c35.35 0 64-28.67 64-64.01V200.8C512 186 505.3 172 493.6 163zM464 448c0 8.822-7.178 16-16 16H64c-8.822 0-16-7.178-16-16V276.7l136.1 113.4C204.3 406.8 229.8 416 256 416s51.75-9.211 71.97-26.01L464 276.7V448zM464 214.2l-166.8 138.1c-23.19 19.28-59.34 19.27-82.47 .0156L48 214.2l.1055-13.48c23.24-18.33 42.25-32.97 162.9-120.6c3.082-2.254 6.674-5.027 10.63-8.094C229.4 65.99 246.7 52.59 256 48.62c9.312 3.973 26.62 17.37 34.41 23.41c3.959 3.066 7.553 5.84 10.76 8.186C421.6 167.7 440.7 182.4 464 200.8V214.2z"],eye:[576,512,[128065],"f06e","M160 256C160 185.3 217.3 128 288 128C358.7 128 416 185.3 416 256C416 326.7 358.7 384 288 384C217.3 384 160 326.7 160 256zM288 336C332.2 336 368 300.2 368 256C368 211.8 332.2 176 288 176C287.3 176 286.7 176 285.1 176C287.3 181.1 288 186.5 288 192C288 227.3 259.3 256 224 256C218.5 256 213.1 255.3 208 253.1C208 254.7 208 255.3 208 255.1C208 300.2 243.8 336 288 336L288 336zM95.42 112.6C142.5 68.84 207.2 32 288 32C368.8 32 433.5 68.84 480.6 112.6C527.4 156 558.7 207.1 573.5 243.7C576.8 251.6 576.8 260.4 573.5 268.3C558.7 304 527.4 355.1 480.6 399.4C433.5 443.2 368.8 480 288 480C207.2 480 142.5 443.2 95.42 399.4C48.62 355.1 17.34 304 2.461 268.3C-.8205 260.4-.8205 251.6 2.461 243.7C17.34 207.1 48.62 156 95.42 112.6V112.6zM288 80C222.8 80 169.2 109.6 128.1 147.7C89.6 183.5 63.02 225.1 49.44 256C63.02 286 89.6 328.5 128.1 364.3C169.2 402.4 222.8 432 288 432C353.2 432 406.8 402.4 447.9 364.3C486.4 328.5 512.1 286 526.6 256C512.1 225.1 486.4 183.5 447.9 147.7C406.8 109.6 353.2 80 288 80V80z"],"eye-slash":[640,512,[],"f070","M150.7 92.77C195 58.27 251.8 32 320 32C400.8 32 465.5 68.84 512.6 112.6C559.4 156 590.7 207.1 605.5 243.7C608.8 251.6 608.8 260.4 605.5 268.3C592.1 300.6 565.2 346.1 525.6 386.7L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L150.7 92.77zM189.8 123.5L235.8 159.5C258.3 139.9 287.8 128 320 128C390.7 128 448 185.3 448 256C448 277.2 442.9 297.1 433.8 314.7L487.6 356.9C521.1 322.8 545.9 283.1 558.6 256C544.1 225.1 518.4 183.5 479.9 147.7C438.8 109.6 385.2 79.1 320 79.1C269.5 79.1 225.1 97.73 189.8 123.5L189.8 123.5zM394.9 284.2C398.2 275.4 400 265.9 400 255.1C400 211.8 364.2 175.1 320 175.1C319.3 175.1 318.7 176 317.1 176C319.3 181.1 320 186.5 320 191.1C320 202.2 317.6 211.8 313.4 220.3L394.9 284.2zM404.3 414.5L446.2 447.5C409.9 467.1 367.8 480 320 480C239.2 480 174.5 443.2 127.4 399.4C80.62 355.1 49.34 304 34.46 268.3C31.18 260.4 31.18 251.6 34.46 243.7C44 220.8 60.29 191.2 83.09 161.5L120.8 191.2C102.1 214.5 89.76 237.6 81.45 255.1C95.02 286 121.6 328.5 160.1 364.3C201.2 402.4 254.8 432 320 432C350.7 432 378.8 425.4 404.3 414.5H404.3zM192 255.1C192 253.1 192.1 250.3 192.3 247.5L248.4 291.7C258.9 312.8 278.5 328.6 302 333.1L358.2 378.2C346.1 381.1 333.3 384 319.1 384C249.3 384 191.1 326.7 191.1 255.1H192z"],"face-angry":[512,512,[128544,"angry"],"f556","M328.4 393.5C318.7 402.6 303.5 402.1 294.5 392.4C287.1 384.5 274.4 376 256 376C237.6 376 224.9 384.5 217.5 392.4C208.5 402.1 193.3 402.6 183.6 393.5C173.9 384.5 173.4 369.3 182.5 359.6C196.7 344.3 221.4 328 256 328C290.6 328 315.3 344.3 329.5 359.6C338.6 369.3 338.1 384.5 328.4 393.5zM144.4 240C144.4 231.2 147.9 223.2 153.7 217.4L122.9 207.2C114.6 204.4 110 195.3 112.8 186.9C115.6 178.6 124.7 174 133.1 176.8L229.1 208.8C237.4 211.6 241.1 220.7 239.2 229.1C236.4 237.4 227.3 241.1 218.9 239.2L208.1 235.6C208.3 237 208.4 238.5 208.4 240C208.4 257.7 194 272 176.4 272C158.7 272 144.4 257.7 144.4 240V240zM368.4 240C368.4 257.7 354 272 336.4 272C318.7 272 304.4 257.7 304.4 240C304.4 238.4 304.5 236.8 304.7 235.3L293.1 239.2C284.7 241.1 275.6 237.4 272.8 229.1C270 220.7 274.6 211.6 282.9 208.8L378.9 176.8C387.3 174 396.4 178.6 399.2 186.9C401.1 195.3 397.4 204.4 389.1 207.2L358.9 217.2C364.7 223 368.4 231.1 368.4 240H368.4zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464z"],"face-dizzy":[512,512,["dizzy"],"f567","M192 352C192 316.7 220.7 288 256 288C291.3 288 320 316.7 320 352C320 387.3 291.3 416 256 416C220.7 416 192 387.3 192 352zM103 135C112.4 125.7 127.6 125.7 136.1 135L160 158.1L183 135C192.4 125.7 207.6 125.7 216.1 135C226.3 144.4 226.3 159.6 216.1 168.1L193.9 192L216.1 215C226.3 224.4 226.3 239.6 216.1 248.1C207.6 258.3 192.4 258.3 183 248.1L160 225.9L136.1 248.1C127.6 258.3 112.4 258.3 103 248.1C93.66 239.6 93.66 224.4 103 215L126.1 192L103 168.1C93.66 159.6 93.66 144.4 103 135V135zM295 135C304.4 125.7 319.6 125.7 328.1 135L352 158.1L375 135C384.4 125.7 399.6 125.7 408.1 135C418.3 144.4 418.3 159.6 408.1 168.1L385.9 192L408.1 215C418.3 224.4 418.3 239.6 408.1 248.1C399.6 258.3 384.4 258.3 375 248.1L352 225.9L328.1 248.1C319.6 258.3 304.4 258.3 295 248.1C285.7 239.6 285.7 224.4 295 215L318.1 192L295 168.1C285.7 159.6 285.7 144.4 295 135V135zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-flushed":[512,512,[128563,"flushed"],"f579","M320 336C333.3 336 344 346.7 344 360C344 373.3 333.3 384 320 384H192C178.7 384 168 373.3 168 360C168 346.7 178.7 336 192 336H320zM136.4 224C136.4 210.7 147.1 200 160.4 200C173.6 200 184.4 210.7 184.4 224C184.4 237.3 173.6 248 160.4 248C147.1 248 136.4 237.3 136.4 224zM80 224C80 179.8 115.8 144 160 144C204.2 144 240 179.8 240 224C240 268.2 204.2 304 160 304C115.8 304 80 268.2 80 224zM160 272C186.5 272 208 250.5 208 224C208 197.5 186.5 176 160 176C133.5 176 112 197.5 112 224C112 250.5 133.5 272 160 272zM376.4 224C376.4 237.3 365.6 248 352.4 248C339.1 248 328.4 237.3 328.4 224C328.4 210.7 339.1 200 352.4 200C365.6 200 376.4 210.7 376.4 224zM432 224C432 268.2 396.2 304 352 304C307.8 304 272 268.2 272 224C272 179.8 307.8 144 352 144C396.2 144 432 179.8 432 224zM352 176C325.5 176 304 197.5 304 224C304 250.5 325.5 272 352 272C378.5 272 400 250.5 400 224C400 197.5 378.5 176 352 176zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464z"],"face-frown":[512,512,[9785,"frown"],"f119","M143.9 398.6C131.4 394.1 124.9 380.3 129.4 367.9C146.9 319.4 198.9 288 256 288C313.1 288 365.1 319.4 382.6 367.9C387.1 380.3 380.6 394.1 368.1 398.6C355.7 403.1 341.9 396.6 337.4 384.1C328.2 358.5 297.2 336 256 336C214.8 336 183.8 358.5 174.6 384.1C170.1 396.6 156.3 403.1 143.9 398.6V398.6zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-frown-open":[512,512,[128550,"frown-open"],"f57a","M179.3 369.3C166.1 374.5 153.1 365.1 158.4 352.9C175.1 314.7 214.3 287.8 259.9 287.8C305.6 287.8 344.8 314.7 361.4 352.1C366.7 365.2 352.9 374.5 340.6 369.3C316.2 359 288.8 353.2 259.9 353.2C231 353.2 203.7 358.1 179.3 369.3L179.3 369.3zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grimace":[512,512,[128556,"grimace"],"f57f","M344 288C374.9 288 400 313.1 400 344C400 374.9 374.9 400 344 400H168C137.1 400 112 374.9 112 344C112 313.1 137.1 288 168 288H344zM168 320C154.7 320 144 330.7 144 344C144 357.3 154.7 368 168 368H176V320H168zM208 368H240V320H208V368zM304 320H272V368H304V320zM336 368H344C357.3 368 368 357.3 368 344C368 330.7 357.3 320 344 320H336V368zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin":[512,512,[128512,"grin"],"f580","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin-beam":[512,512,[128516,"grin-beam"],"f582","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM217.6 228.8L217.6 228.8L217.4 228.5C217.2 228.3 217 228 216.7 227.6C216 226.8 215.1 225.7 213.9 224.3C211.4 221.4 207.9 217.7 203.7 213.1C194.9 206.2 184.8 200 176 200C167.2 200 157.1 206.2 148.3 213.1C144.1 217.7 140.6 221.4 138.1 224.3C136.9 225.7 135.1 226.8 135.3 227.6C134.1 228 134.8 228.3 134.6 228.5L134.4 228.8L134.4 228.8C132.3 231.6 128.7 232.7 125.5 231.6C122.2 230.5 120 227.4 120 224C120 206.1 126.7 188.4 136.6 175.2C146.4 162.2 160.5 152 176 152C191.5 152 205.6 162.2 215.4 175.2C225.3 188.4 232 206.1 232 224C232 227.4 229.8 230.5 226.5 231.6C223.3 232.7 219.7 231.6 217.6 228.8V228.8zM377.6 228.8L377.4 228.5C377.2 228.3 377 228 376.7 227.6C376 226.8 375.1 225.7 373.9 224.3C371.4 221.4 367.9 217.7 363.7 213.1C354.9 206.2 344.8 200 336 200C327.2 200 317.1 206.2 308.3 213.1C304.1 217.7 300.6 221.4 298.1 224.3C296.9 225.7 295.1 226.8 295.3 227.6C294.1 228 294.8 228.3 294.6 228.5L294.4 228.8L294.4 228.8C292.3 231.6 288.7 232.7 285.5 231.6C282.2 230.5 280 227.4 280 224C280 206.1 286.7 188.4 296.6 175.2C306.4 162.2 320.5 152 336 152C351.5 152 365.6 162.2 375.4 175.2C385.3 188.4 392 206.1 392 224C392 227.4 389.8 230.5 386.5 231.6C383.3 232.7 379.7 231.6 377.6 228.8L377.6 228.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin-beam-sweat":[512,512,[128517,"grin-beam-sweat"],"f583","M464 128C437.5 128 416 107 416 81.01C416 76.01 417.8 69.74 420.6 62.87C420.9 62.17 421.2 61.46 421.6 60.74C430.5 40.51 448.1 15.86 457.6 3.281C460.8-1.094 467.2-1.094 470.4 3.281C483.4 20.65 512 61.02 512 81.01C512 102.7 497.1 120.8 476.8 126.3C472.7 127.4 468.4 128 464 128L464 128zM391.1 50.53C387.8 58.57 384 69.57 384 81.01C384 84.1 384.3 88.91 384.9 92.72C349.4 64.71 304.7 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 219.7 454.7 185.5 438.3 155.8C446.4 158.5 455.1 160 464 160C473.6 160 482.8 158.3 491.4 155.2C504.7 186.2 512 220.2 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 .0002 256 .0002C307.4 .0002 355.3 15.15 395.4 41.23C393.9 44.32 392.4 47.43 391.1 50.53V50.53zM255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.9 255.9 318.9C289 318.9 320.6 315.1 349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1zM217.6 228.8L217.4 228.5C217.2 228.3 217 228 216.7 227.6C216 226.8 215.1 225.7 213.9 224.3C211.4 221.4 207.9 217.7 203.7 213.1C194.9 206.2 184.8 200 176 200C167.2 200 157.1 206.2 148.3 213.1C144.1 217.7 140.6 221.4 138.1 224.3C136.9 225.7 135.1 226.8 135.3 227.6C134.1 228 134.8 228.3 134.6 228.5L134.4 228.8L134.4 228.8C132.3 231.6 128.7 232.7 125.5 231.6C122.2 230.5 119.1 227.4 119.1 224C119.1 206.1 126.7 188.4 136.6 175.2C146.4 162.2 160.5 152 175.1 152C191.5 152 205.6 162.2 215.4 175.2C225.3 188.4 231.1 206.1 231.1 224C231.1 227.4 229.8 230.5 226.5 231.6C223.3 232.7 219.7 231.6 217.6 228.8L217.6 228.8zM377.6 228.8L377.6 228.8L377.4 228.5C377.2 228.3 377 228 376.7 227.6C376 226.8 375.1 225.7 373.9 224.3C371.4 221.4 367.9 217.7 363.7 213.1C354.9 206.2 344.8 200 336 200C327.2 200 317.1 206.2 308.3 213.1C304.1 217.7 300.6 221.4 298.1 224.3C296.9 225.7 295.1 226.8 295.3 227.6C294.1 228 294.8 228.3 294.6 228.5L294.4 228.8L294.4 228.8C292.3 231.6 288.7 232.7 285.5 231.6C282.2 230.5 280 227.4 280 224C280 206.1 286.7 188.4 296.6 175.2C306.4 162.2 320.5 152 336 152C351.5 152 365.6 162.2 375.4 175.2C385.3 188.4 392 206.1 392 224C392 227.4 389.8 230.5 386.5 231.6C383.3 232.7 379.7 231.6 377.6 228.8V228.8z"],"face-grin-hearts":[512,512,[128525,"grin-hearts"],"f584","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM238.9 177.1L221.4 243C219.1 251.6 210.4 256.6 201.8 254.3L136.7 236.9C118.9 232.1 108.4 213.8 113.1 196.1C117.9 178.3 136.2 167.7 153.1 172.5L170.1 176.8L174.4 160.7C179.2 142.9 197.5 132.4 215.3 137.1C233.1 141.9 243.6 160.2 238.9 177.1H238.9zM341.9 176.8L358 172.5C375.8 167.7 394.1 178.3 398.9 196.1C403.6 213.8 393.1 232.1 375.3 236.9L310.2 254.3C301.6 256.6 292.9 251.6 290.6 243L273.1 177.1C268.4 160.2 278.9 141.9 296.7 137.1C314.5 132.4 332.8 142.9 337.6 160.7L341.9 176.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin-squint":[512,512,[128518,"grin-squint"],"f585","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM223.4 194.6C234.1 200.3 234.1 215.7 223.4 221.4L133.5 269.3C125.6 273.6 116 267.8 116 258.9C116 256.1 116.1 253.4 118.8 251.2L154.8 208L118.8 164.8C116.1 162.6 116 159.9 116 157.1C116 148.2 125.6 142.4 133.5 146.7L223.4 194.6zM393.2 164.8L357.2 208L393.2 251.2C395 253.4 396 256.1 396 258.9C396 267.8 386.4 273.6 378.5 269.3L288.6 221.4C277.9 215.7 277.9 200.3 288.6 194.6L378.5 146.7C386.4 142.4 396 148.2 396 157.1C396 159.9 395 162.6 393.2 164.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin-squint-tears":[512,512,[129315,"grin-squint-tears"],"f586","M426.8 14.18C446-5.046 477.5-4.646 497.1 14.92C516.6 34.49 517 65.95 497.8 85.18C483 99.97 432.2 108.8 409.6 111.9C403.1 112.8 399.2 108 400.1 102.4C403.3 79.94 412 28.97 426.8 14.18H426.8zM74.98 74.98C158.2-8.253 284.5-22.19 382.2 33.17C380.6 37.96 379.3 42.81 378.1 47.52C375 59.67 372.6 72.08 370.8 82.52C290.1 28.93 180.1 37.74 108.9 108.9C37.75 180.1 28.94 290 82.49 370.8C72.01 372.6 59.6 374.1 47.46 378.1C42.76 379.3 37.93 380.6 33.15 382.1C-22.19 284.5-8.245 158.2 74.98 74.98V74.98zM478.8 129.9C534.2 227.5 520.2 353.8 437 437C353.8 520.3 227.5 534.2 129.8 478.8C131.3 474 132.7 469.2 133.9 464.5C136.1 452.3 139.4 439.9 141.2 429.5C221.9 483.1 331.9 474.3 403.1 403.1C474.3 331.9 483.1 221.1 429.5 141.2C439.1 139.4 452.4 137 464.5 133.9C469.2 132.7 474.1 131.4 478.8 129.9L478.8 129.9zM359.2 226.9C369.3 210.6 393 210 397 228.8C406.6 273.1 393.4 322.3 357.8 357.9C322.2 393.5 273 406.7 228.6 397.1C209.9 393.1 210.5 369.4 226.8 359.3C252 343.6 276.1 323.9 300.4 300.5C323.8 277.1 343.5 252.1 359.2 226.9L359.2 226.9zM189.5 235.7C201.1 232.1 211.1 242.1 208.5 254.6L178.8 352.1C176.2 360.7 165.4 363.4 159 357C157.1 355 155.8 352.5 155.6 349.7L150.5 293.6L94.43 288.5C91.66 288.3 89.07 287.1 87.1 285.1C80.76 278.7 83.46 267.9 92.05 265.3L189.5 235.7zM288.5 94.43L293.6 150.5L349.7 155.6C352.5 155.8 355 157.1 357 159C363.4 165.4 360.7 176.2 352.1 178.8L254.6 208.5C242.1 211.1 232.1 201.1 235.7 189.5L265.3 92.05C267.9 83.46 278.7 80.76 285.1 87.1C287.1 89.07 288.3 91.66 288.5 94.43V94.43zM14.18 426.8C28.97 412 79.85 403.2 102.4 400.1C108 399.2 112.8 403.1 111.9 409.6C108.7 432.1 99.97 483 85.18 497.8C65.95 517 34.5 516.6 14.93 497.1C-4.645 477.5-5.046 446 14.18 426.8H14.18z"],"face-grin-stars":[512,512,[129321,"grin-stars"],"f587","M199.8 167.3L237.9 172.3C240.1 172.7 243.5 174.8 244.5 177.8C245.4 180.7 244.6 183.9 242.4 186L214.5 212.5L221.5 250.3C222 253.4 220.8 256.4 218.3 258.2C215.8 260.1 212.5 260.3 209.8 258.8L175.1 240.5L142.2 258.8C139.5 260.3 136.2 260.1 133.7 258.2C131.2 256.4 129.1 253.4 130.5 250.3L137.5 212.5L109.6 186C107.4 183.9 106.6 180.7 107.5 177.8C108.5 174.8 111 172.7 114.1 172.3L152.2 167.3L168.8 132.6C170.1 129.8 172.9 128 175.1 128C179.1 128 181.9 129.8 183.2 132.6L199.8 167.3zM359.8 167.3L397.9 172.3C400.1 172.7 403.5 174.8 404.5 177.8C405.4 180.7 404.6 183.9 402.4 186L374.5 212.5L381.5 250.3C382 253.4 380.8 256.4 378.3 258.2C375.8 260.1 372.5 260.3 369.8 258.8L336 240.5L302.2 258.8C299.5 260.3 296.2 260.1 293.7 258.2C291.2 256.4 289.1 253.4 290.5 250.3L297.5 212.5L269.6 186C267.4 183.9 266.6 180.7 267.5 177.8C268.5 174.8 271 172.7 274.1 172.3L312.2 167.3L328.8 132.6C330.1 129.8 332.9 128 336 128C339.1 128 341.9 129.8 343.2 132.6L359.8 167.3zM349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464z"],"face-grin-tears":[640,512,[128514,"grin-tears"],"f588","M519.4 334.4C522.7 342.5 527.8 352.1 535.9 361.1C539.9 365 544.1 368.4 548.6 371.4C506.4 454.8 419.9 512 319.1 512C220.1 512 133.6 454.8 91.4 371.4C95.87 368.4 100.1 365 104.1 361.1C112.2 352.1 117.3 342.5 120.6 334.4C121.8 331.5 122.9 328.6 123.9 325.5C152.5 406.2 229.5 464 319.1 464C410.5 464 487.5 406.2 516.1 325.5C517.1 328.6 518.2 331.5 519.4 334.4V334.4zM319.1 47.1C218.6 47.1 134.2 120.5 115.7 216.5C109.1 213.4 101.4 212.2 93.4 213.3C86.59 214.3 77.18 215.7 66.84 217.7C85.31 94.5 191.6 0 319.1 0C448.4 0 554.7 94.5 573.2 217.7C562.8 215.7 553.4 214.3 546.6 213.3C538.6 212.2 530.9 213.4 524.2 216.5C505.8 120.5 421.4 48 319.1 48V47.1zM78.5 341.1C59.98 356.7 32.01 355.5 14.27 337.7C-4.442 319-4.825 288.9 13.55 270.6C22.19 261.9 43.69 255.4 64.05 250.1C77.02 248.2 89.53 246.2 97.94 245C103.3 244.2 107.8 248.7 106.1 254.1C103.9 275.6 95.58 324.3 81.43 338.4C80.49 339.4 79.51 340.3 78.5 341.1V341.1zM561.5 341.1C560.7 340.5 559.1 339.8 559.2 339.1C559 338.9 558.8 338.7 558.6 338.4C544.4 324.3 536.1 275.6 533 254.1C532.2 248.7 536.7 244.2 542.1 245C543.1 245.2 544.2 245.3 545.4 245.5C553.6 246.7 564.6 248.5 575.1 250.1C596.3 255.4 617.8 261.9 626.4 270.6C644.8 288.9 644.4 319 625.7 337.7C607.1 355.5 580 356.7 561.5 341.1L561.5 341.1zM319.9 399.1C269.6 399.1 225.5 374.6 200.9 336.5C190.5 320.4 207.7 303.1 226.3 308.4C255.3 315.1 286.8 318.8 319.9 318.8C353 318.8 384.6 315.1 413.5 308.4C432.2 303.1 449.4 320.4 438.1 336.5C414.4 374.6 370.3 399.1 319.9 399.1zM281.6 228.8L281.4 228.5C281.2 228.3 281 228 280.7 227.6C280 226.8 279.1 225.7 277.9 224.3C275.4 221.4 271.9 217.7 267.7 213.1C258.9 206.2 248.8 200 239.1 200C231.2 200 221.1 206.2 212.3 213.1C208.1 217.7 204.6 221.4 202.1 224.3C200.9 225.7 199.1 226.8 199.3 227.6C198.1 228 198.8 228.3 198.6 228.5L198.4 228.8L198.4 228.8C196.3 231.6 192.7 232.7 189.5 231.6C186.2 230.5 183.1 227.4 183.1 224C183.1 206.1 190.7 188.4 200.6 175.2C210.4 162.2 224.5 152 239.1 152C255.5 152 269.6 162.2 279.4 175.2C289.3 188.4 295.1 206.1 295.1 224C295.1 227.4 293.8 230.5 290.5 231.6C287.3 232.7 283.7 231.6 281.6 228.8L281.6 228.8zM441.6 228.8L441.6 228.8L441.4 228.5C441.2 228.3 441 228 440.7 227.6C440 226.8 439.1 225.7 437.9 224.3C435.4 221.4 431.9 217.7 427.7 213.1C418.9 206.2 408.8 200 400 200C391.2 200 381.1 206.2 372.3 213.1C368.1 217.7 364.6 221.4 362.1 224.3C360.9 225.7 359.1 226.8 359.3 227.6C358.1 228 358.8 228.3 358.6 228.5L358.4 228.8L358.4 228.8C356.3 231.6 352.7 232.7 349.5 231.6C346.2 230.5 344 227.4 344 223.1C344 206.1 350.7 188.4 360.6 175.2C370.4 162.2 384.5 151.1 400 151.1C415.5 151.1 429.6 162.2 439.4 175.2C449.3 188.4 456 206.1 456 223.1C456 227.4 453.8 230.5 450.5 231.6C447.3 232.7 443.7 231.6 441.6 228.8V228.8z"],"face-grin-tongue":[512,512,[128539,"grin-tongue"],"f589","M144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208zM368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 337.7 95.13 408.4 163.7 442.4C161.3 434 160 425.2 160 416V363.6C151.1 355.6 143.3 346.5 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C368.6 346.4 360.8 355.5 352 363.5V416C352 425.2 350.7 434 348.3 442.4C416.9 408.4 464 337.7 464 256C464 141.1 370.9 48 255.1 48H256zM320 416V378.6C320 363.9 308.1 352 293.4 352H291.4C280.1 352 270.3 359.9 267.8 370.9C264.1 383.5 247 383.5 244.2 370.9C241.7 359.9 231.9 352 220.6 352H218.6C203.9 352 192 363.9 192 378.6V416C192 451.3 220.7 480 256 480C291.3 480 320 451.3 320 416z"],"face-grin-tongue-squint":[512,512,[128541,"grin-tongue-squint"],"f58a","M116 157.1C116 148.2 125.6 142.4 133.5 146.7L223.4 194.6C234.1 200.3 234.1 215.7 223.4 221.4L133.5 269.3C125.6 273.6 116 267.8 116 258.9C116 256.1 116.1 253.4 118.8 251.2L154.8 208L118.8 164.8C116.1 162.6 116 159.9 116 157.1V157.1zM378.5 146.7C386.4 142.4 396 148.2 396 157.1C396 159.9 395 162.6 393.2 164.8L357.2 208L393.2 251.2C395 253.4 396 256.1 396 258.9C396 267.8 386.4 273.6 378.5 269.3L288.6 221.4C277.9 215.7 277.9 200.3 288.6 194.6L378.5 146.7zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 337.7 95.13 408.4 163.7 442.4C161.3 434 160 425.2 160 416V392.7C135.1 375.1 116.9 351.3 105.2 323.5C100.2 311.7 112.2 301 124.5 304.8C164.1 316.9 208.9 323.8 256.3 323.8C303.7 323.8 348.4 316.9 388.1 304.8C400.4 301 412.4 311.7 407.4 323.5C395.6 351.5 376.3 375.5 352 393.1V416C352 425.2 350.7 434 348.3 442.4C416.9 408.4 464 337.7 464 255.1C464 141.1 370.9 47.1 256 47.1L256 48zM320 416V378.6C320 363.9 308.1 352 293.4 352H291.4C280.1 352 270.3 359.9 267.8 370.9C264.1 383.5 247 383.5 244.2 370.9C241.7 359.9 231.9 352 220.6 352H218.6C203.9 352 192 363.9 192 378.6V416C192 451.3 220.7 480 256 480C291.3 480 320 451.3 320 416z"],"face-grin-tongue-wink":[512,512,[128540,"grin-tongue-wink"],"f58b","M159.6 220C148.1 220 139.7 223.8 134.2 229.7C126.7 237.7 114 238.1 105.9 230.6C97.89 223 97.48 210.4 105 202.3C119.6 186.8 140.3 180 159.6 180C178.1 180 199.7 186.8 214.2 202.3C221.8 210.4 221.4 223 213.3 230.6C205.2 238.1 192.6 237.7 185 229.7C179.6 223.8 170.3 220 159.6 220zM312.4 208C312.4 194.7 323.1 184 336.4 184C349.6 184 360.4 194.7 360.4 208C360.4 221.3 349.6 232 336.4 232C323.1 232 312.4 221.3 312.4 208zM256 208C256 163.8 291.8 128 336 128C380.2 128 416 163.8 416 208C416 252.2 380.2 288 336 288C291.8 288 256 252.2 256 208zM336 256C362.5 256 384 234.5 384 208C384 181.5 362.5 160 336 160C309.5 160 288 181.5 288 208C288 234.5 309.5 256 336 256zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM348.3 442.4C416.9 408.4 464 337.7 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 337.7 95.13 408.4 163.7 442.4C161.3 434 160 425.2 160 416V363.6C151.1 355.6 143.3 346.5 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C368.6 346.4 360.8 355.5 352 363.5V416C352 425.2 350.7 434 348.3 442.4H348.3zM320 416V378.6C320 363.9 308.1 352 293.4 352H291.4C280.1 352 270.3 359.9 267.8 370.9C264.1 383.5 247 383.5 244.2 370.9C241.7 359.9 231.9 352 220.6 352H218.6C203.9 352 192 363.9 192 378.6V416C192 451.3 220.7 480 256 480C291.3 480 320 451.3 320 416z"],"face-grin-wide":[512,512,[128515,"grin-alt"],"f581","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM224 192C224 227.3 209.7 256 192 256C174.3 256 160 227.3 160 192C160 156.7 174.3 128 192 128C209.7 128 224 156.7 224 192zM288 192C288 156.7 302.3 128 320 128C337.7 128 352 156.7 352 192C352 227.3 337.7 256 320 256C302.3 256 288 227.3 288 192zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-grin-wink":[512,512,["grin-wink"],"f58c","M349.5 308.4C368.2 303.1 385.4 320.4 374.1 336.5C350.4 374.6 306.3 399.1 255.9 399.1C205.6 399.1 161.5 374.6 136.9 336.5C126.5 320.4 143.7 303.1 162.3 308.4C191.3 315.1 222.8 318.8 255.9 318.8C289 318.8 320.6 315.1 349.5 308.4zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM281.9 230.6C273.9 223 273.5 210.4 281 202.3C295.6 186.8 316.3 180 335.6 180C354.1 180 375.7 186.8 390.2 202.3C397.8 210.4 397.4 223 389.3 230.6C381.2 238.1 368.6 237.7 361 229.7C355.6 223.8 346.3 220 335.6 220C324.1 220 315.7 223.8 310.2 229.7C302.7 237.7 290 238.1 281.9 230.6zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-kiss":[512,512,[128535,"kiss"],"f596","M304.7 281.7C308.9 286.8 312 293.1 312 300C312 306.9 308.9 313.2 304.7 318.3C300.4 323.5 294.5 328 287.9 331.7C285.2 333.3 282.3 334.7 279.2 336C282.3 337.3 285.2 338.7 287.9 340.3C294.5 343.1 300.4 348.5 304.7 353.7C308.9 358.8 312 365.1 312 372C312 378.9 308.9 385.2 304.7 390.3C300.4 395.5 294.5 400 287.9 403.7C274.7 411.1 257.4 416 240 416C236.4 416 233.2 413.5 232.3 410C231.3 406.5 232.9 402.8 236.1 401L236.1 401L236.3 400.9C236.5 400.8 236.8 400.6 237.2 400.3C238 399.9 239.2 399.1 240.6 398.2C243.4 396.4 247.2 393.7 250.8 390.6C254.6 387.5 258 384 260.5 380.6C262.1 377 264 374.2 264 372C264 369.8 262.1 366.1 260.5 363.4C258 359.1 254.6 356.5 250.8 353.4C247.2 350.3 243.4 347.6 240.6 345.8C239.2 344.9 238 344.1 237.2 343.7L236.5 343.2L236.3 343.1L236.1 342.1L236.1 342.1C233.6 341.6 232 338.9 232 336C232 333.1 233.6 330.4 236.1 329L236.1 329L236.3 328.9C236.5 328.8 236.8 328.6 237.2 328.3C238 327.9 239.2 327.1 240.6 326.2C243.4 324.4 247.2 321.7 250.8 318.6C254.6 315.5 258 312.1 260.5 308.6C262.1 305 264 302.2 264 300C264 297.8 262.1 294.1 260.5 291.4C258 287.1 254.6 284.5 250.8 281.4C247.2 278.3 243.4 275.6 240.6 273.8C239.2 272.9 238 272.1 237.2 271.7C236.8 271.4 236.5 271.2 236.3 271.1L236.1 270.1L236.1 270.1C232.9 269.2 231.3 265.5 232.3 261.1C233.2 258.5 236.4 256 240 256C257.4 256 274.7 260.9 287.9 268.3C294.5 271.1 300.4 276.5 304.7 281.7V281.7zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-kiss-beam":[512,512,[128537,"kiss-beam"],"f597","M304.7 297.7C308.9 302.8 312 309.1 312 316C312 322.9 308.9 329.2 304.7 334.3C300.4 339.5 294.5 344 287.9 347.7C285.2 349.3 282.3 350.7 279.2 352C282.3 353.3 285.2 354.7 287.9 356.3C294.5 359.1 300.4 364.5 304.7 369.7C308.9 374.8 312 381.1 312 388C312 394.9 308.9 401.2 304.7 406.3C300.4 411.5 294.5 416 287.9 419.7C274.7 427.1 257.4 432 240 432C236.4 432 233.2 429.5 232.3 426C231.3 422.5 232.9 418.8 236.1 417L236.1 417L236.3 416.9C236.5 416.8 236.8 416.6 237.2 416.3C238 415.9 239.2 415.1 240.6 414.2C243.4 412.4 247.2 409.7 250.8 406.6C254.6 403.5 258 400 260.5 396.6C262.1 393 264 390.2 264 388C264 385.8 262.1 382.1 260.5 379.4C258 375.1 254.6 372.5 250.8 369.4C247.2 366.3 243.4 363.6 240.6 361.8C239.2 360.9 238 360.1 237.2 359.7C236.8 359.4 236.5 359.2 236.3 359.1L236.1 358.1L236.1 358.1C233.6 357.6 232 354.9 232 352C232 349.1 233.6 346.4 236.1 345L236.1 345L236.3 344.9C236.5 344.8 236.8 344.6 237.2 344.3C238 343.9 239.2 343.1 240.6 342.2C243.4 340.4 247.2 337.7 250.8 334.6C254.6 331.5 258 328.1 260.5 324.6C262.1 321 264 318.2 264 316C264 313.8 262.1 310.1 260.5 307.4C258 303.1 254.6 300.5 250.8 297.4C247.2 294.3 243.4 291.6 240.6 289.8C239.2 288.9 238 288.1 237.2 287.7C236.8 287.4 236.5 287.2 236.3 287.1L236.1 286.1L236.1 286.1C232.9 285.2 231.3 281.5 232.3 277.1C233.2 274.5 236.4 272 240 272C257.4 272 274.7 276.9 287.9 284.3C294.5 287.1 300.4 292.5 304.7 297.7L304.7 297.7zM217.6 228.8L217.6 228.8L217.4 228.5C217.2 228.3 217 228 216.7 227.6C216 226.8 215.1 225.7 213.9 224.3C211.4 221.4 207.9 217.7 203.7 213.1C194.9 206.2 184.8 200 176 200C167.2 200 157.1 206.2 148.3 213.1C144.1 217.7 140.6 221.4 138.1 224.3C136.9 225.7 135.1 226.8 135.3 227.6C134.1 228 134.8 228.3 134.6 228.5L134.4 228.8L134.4 228.8C132.3 231.6 128.7 232.7 125.5 231.6C122.2 230.5 120 227.4 120 224C120 206.1 126.7 188.4 136.6 175.2C146.4 162.2 160.5 152 176 152C191.5 152 205.6 162.2 215.4 175.2C225.3 188.4 232 206.1 232 224C232 227.4 229.8 230.5 226.5 231.6C223.3 232.7 219.7 231.6 217.6 228.8V228.8zM377.6 228.8L377.4 228.5C377.2 228.3 377 228 376.7 227.6C376 226.8 375.1 225.7 373.9 224.3C371.4 221.4 367.9 217.7 363.7 213.1C354.9 206.2 344.8 200 336 200C327.2 200 317.1 206.2 308.3 213.1C304.1 217.7 300.6 221.4 298.1 224.3C296.9 225.7 295.1 226.8 295.3 227.6C294.1 228 294.8 228.3 294.6 228.5L294.4 228.8L294.4 228.8C292.3 231.6 288.7 232.7 285.5 231.6C282.2 230.5 280 227.4 280 224C280 206.1 286.7 188.4 296.6 175.2C306.4 162.2 320.5 152 336 152C351.5 152 365.6 162.2 375.4 175.2C385.3 188.4 392 206.1 392 224C392 227.4 389.8 230.5 386.5 231.6C383.3 232.7 379.7 231.6 377.6 228.8L377.6 228.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-kiss-wink-heart":[512,512,[128536,"kiss-wink-heart"],"f598","M345.3 472.1C347.3 479.7 350.9 486.4 355.7 491.8C325.1 504.8 291.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 285.3 507.1 313.4 498 339.7C486.9 334.1 474.5 333.1 461.8 334.6C459.7 329.4 457 324.6 453.9 320.1C460.5 299.9 464 278.4 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C285.4 464 313.5 457.9 338.9 446.8L345.3 472.1zM288.7 334.3C284.4 339.5 278.5 344 271.9 347.7C269.2 349.3 266.3 350.7 263.2 352C266.3 353.3 269.2 354.7 271.9 356.3C278.5 359.1 284.4 364.5 288.7 369.7C292.9 374.8 296 381.1 296 388C296 394.9 292.9 401.2 288.7 406.3C284.4 411.5 278.5 416 271.9 419.7C258.7 427.1 241.4 432 224 432C220.4 432 217.2 429.5 216.3 426C215.3 422.5 216.9 418.8 220.1 417L220.1 417L220.3 416.9C220.5 416.8 220.8 416.6 221.2 416.3C222 415.9 223.2 415.1 224.6 414.2C227.4 412.4 231.2 409.7 234.8 406.6C238.6 403.5 242 400 244.5 396.6C246.1 393 248 390.2 248 388C248 385.8 246.1 382.1 244.5 379.4C242 375.1 238.6 372.5 234.8 369.4C231.2 366.3 227.4 363.6 224.6 361.8C223.2 360.9 222 360.1 221.2 359.7C220.8 359.4 220.5 359.2 220.3 359.1L220.1 358.1L220.1 358.1C217.6 357.6 216 354.9 216 352C216 349.1 217.6 346.4 220.1 345L220.1 345L220.3 344.9C220.5 344.8 220.8 344.6 221.2 344.3C222 343.9 223.2 343.1 224.6 342.2C227.4 340.4 231.2 337.7 234.8 334.6C238.6 331.5 242 328.1 244.5 324.6C246.1 321 248 318.2 248 316C248 313.8 246.1 310.1 244.5 307.4C242 303.1 238.6 300.5 234.8 297.4C231.2 294.3 227.4 291.6 224.6 289.8C223.2 288.9 222 288.1 221.2 287.7C220.8 287.4 220.5 287.2 220.3 287.1L220.1 286.1L220.1 286.1C216.9 285.2 215.3 281.5 216.3 277.1C217.2 274.5 220.4 272 224 272C241.4 272 258.7 276.9 271.9 284.3C278.5 287.1 284.4 292.5 288.7 297.7C292.9 302.8 296 309.1 296 316C296 322.9 292.9 329.2 288.7 334.3V334.3zM144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208zM335.6 220C324.1 220 315.7 223.8 310.2 229.7C302.7 237.7 290 238.1 281.9 230.6C273.9 223 273.5 210.4 281 202.3C295.6 186.8 316.3 180 335.6 180C354.1 180 375.7 186.8 390.2 202.3C397.8 210.4 397.4 223 389.3 230.6C381.2 238.1 368.6 237.7 361 229.7C355.6 223.8 346.3 220 335.6 220zM439.4 373.3L459.5 367.6C481.7 361.4 504.6 375.2 510.6 398.4C516.5 421.7 503.3 445.6 481.1 451.8L396.1 475.6C387.5 478 378.6 472.9 376.3 464.2L353.4 374.9C347.5 351.6 360.7 327.7 382.9 321.5C405.2 315.3 428 329.1 433.1 352.3L439.4 373.3z"],"face-laugh":[512,512,["laugh"],"f599","M130.7 313.9C126.5 300.4 137.8 288 151.1 288H364.5C378.7 288 389.9 300.4 385.8 313.9C368.1 368.4 318.2 408 258.2 408C198.2 408 147.5 368.4 130.7 313.9V313.9zM208.4 192C208.4 209.7 194 224 176.4 224C158.7 224 144.4 209.7 144.4 192C144.4 174.3 158.7 160 176.4 160C194 160 208.4 174.3 208.4 192zM304.4 192C304.4 174.3 318.7 160 336.4 160C354 160 368.4 174.3 368.4 192C368.4 209.7 354 224 336.4 224C318.7 224 304.4 209.7 304.4 192zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-laugh-beam":[512,512,[128513,"laugh-beam"],"f59a","M130.7 313.9C126.5 300.4 137.8 288 151.1 288H364.5C378.7 288 389.9 300.4 385.8 313.9C368.1 368.4 318.2 408 258.2 408C198.2 408 147.5 368.4 130.7 313.9V313.9zM217.6 228.8L217.6 228.8L217.4 228.5C217.2 228.3 217 228 216.7 227.6C216 226.8 215.1 225.7 213.9 224.3C211.4 221.4 207.9 217.7 203.7 213.1C194.9 206.2 184.8 200 176 200C167.2 200 157.1 206.2 148.3 213.1C144.1 217.7 140.6 221.4 138.1 224.3C136.9 225.7 135.1 226.8 135.3 227.6C134.1 228 134.8 228.3 134.6 228.5L134.4 228.8L134.4 228.8C132.3 231.6 128.7 232.7 125.5 231.6C122.2 230.5 120 227.4 120 224C120 206.1 126.7 188.4 136.6 175.2C146.4 162.2 160.5 152 176 152C191.5 152 205.6 162.2 215.4 175.2C225.3 188.4 232 206.1 232 224C232 227.4 229.8 230.5 226.5 231.6C223.3 232.7 219.7 231.6 217.6 228.8V228.8zM377.6 228.8L377.4 228.5C377.2 228.3 377 228 376.7 227.6C376 226.8 375.1 225.7 373.9 224.3C371.4 221.4 367.9 217.7 363.7 213.1C354.9 206.2 344.8 200 336 200C327.2 200 317.1 206.2 308.3 213.1C304.1 217.7 300.6 221.4 298.1 224.3C296.9 225.7 295.1 226.8 295.3 227.6C294.1 228 294.8 228.3 294.6 228.5L294.4 228.8L294.4 228.8C292.3 231.6 288.7 232.7 285.5 231.6C282.2 230.5 280 227.4 280 224C280 206.1 286.7 188.4 296.6 175.2C306.4 162.2 320.5 152 336 152C351.5 152 365.6 162.2 375.4 175.2C385.3 188.4 392 206.1 392 224C392 227.4 389.8 230.5 386.5 231.6C383.3 232.7 379.7 231.6 377.6 228.8L377.6 228.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-laugh-squint":[512,512,["laugh-squint"],"f59b","M130.7 313.9C126.5 300.4 137.8 288 151.1 288H364.5C378.7 288 389.9 300.4 385.8 313.9C368.1 368.4 318.2 408 258.2 408C198.2 408 147.5 368.4 130.7 313.9V313.9zM223.4 178.6C234.1 184.3 234.1 199.7 223.4 205.4L133.5 253.3C125.6 257.6 116 251.8 116 242.9C116 240.1 116.1 237.4 118.8 235.2L154.8 192L118.8 148.8C116.1 146.6 116 143.9 116 141.1C116 132.2 125.6 126.4 133.5 130.7L223.4 178.6zM393.2 148.8L357.2 192L393.2 235.2C395 237.4 396 240.1 396 242.9C396 251.8 386.4 257.6 378.5 253.3L288.6 205.4C277.9 199.7 277.9 184.3 288.6 178.6L378.5 130.7C386.4 126.4 396 132.2 396 141.1C396 143.9 395 146.6 393.2 148.8V148.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-laugh-wink":[512,512,["laugh-wink"],"f59c","M130.7 313.9C126.5 300.4 137.8 288 151.1 288H364.5C378.7 288 389.9 300.4 385.8 313.9C368.1 368.4 318.2 408 258.2 408C198.2 408 147.5 368.4 130.7 313.9V313.9zM208.4 192C208.4 209.7 194 224 176.4 224C158.7 224 144.4 209.7 144.4 192C144.4 174.3 158.7 160 176.4 160C194 160 208.4 174.3 208.4 192zM281.9 214.6C273.9 207 273.5 194.4 281 186.3C295.6 170.8 316.3 164 335.6 164C354.1 164 375.7 170.8 390.2 186.3C397.8 194.4 397.4 207 389.3 214.6C381.2 222.1 368.6 221.7 361 213.7C355.6 207.8 346.3 204 335.6 204C324.1 204 315.7 207.8 310.2 213.7C302.7 221.7 290 222.1 281.9 214.6zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-meh":[512,512,[128528,"meh"],"f11a","M144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208zM368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208zM328 328C341.3 328 352 338.7 352 352C352 365.3 341.3 376 328 376H184C170.7 376 160 365.3 160 352C160 338.7 170.7 328 184 328H328zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464z"],"face-meh-blank":[512,512,[128566,"meh-blank"],"f5a4","M208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-rolling-eyes":[512,512,[128580,"meh-rolling-eyes"],"f5a5","M168 376C168 362.7 178.7 352 192 352H320C333.3 352 344 362.7 344 376C344 389.3 333.3 400 320 400H192C178.7 400 168 389.3 168 376zM80 224C80 179.8 115.8 144 160 144C204.2 144 240 179.8 240 224C240 268.2 204.2 304 160 304C115.8 304 80 268.2 80 224zM160 272C186.5 272 208 250.5 208 224C208 209.7 201.7 196.8 191.8 188C191.9 189.3 192 190.6 192 192C192 209.7 177.7 224 160 224C142.3 224 128 209.7 128 192C128 190.6 128.1 189.3 128.2 188C118.3 196.8 112 209.7 112 224C112 250.5 133.5 272 160 272V272zM272 224C272 179.8 307.8 144 352 144C396.2 144 432 179.8 432 224C432 268.2 396.2 304 352 304C307.8 304 272 268.2 272 224zM352 272C378.5 272 400 250.5 400 224C400 209.7 393.7 196.8 383.8 188C383.9 189.3 384 190.6 384 192C384 209.7 369.7 224 352 224C334.3 224 320 209.7 320 192C320 190.6 320.1 189.3 320.2 188C310.3 196.8 304 209.7 304 224C304 250.5 325.5 272 352 272zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464z"],"face-sad-cry":[512,512,[128557,"sad-cry"],"f5b3","M159.6 220C148.1 220 139.7 223.8 134.2 229.7C126.7 237.7 114 238.1 105.1 230.6C97.89 223 97.48 210.4 105 202.3C119.6 186.8 140.3 180 159.6 180C178.1 180 199.7 186.8 214.2 202.3C221.8 210.4 221.4 223 213.3 230.6C205.2 238.1 192.6 237.7 185 229.7C179.6 223.8 170.3 220 159.6 220zM297.9 230.6C289.9 223 289.5 210.4 297 202.3C311.6 186.8 332.3 180 351.6 180C370.1 180 391.7 186.8 406.2 202.3C413.8 210.4 413.4 223 405.3 230.6C397.2 238.1 384.6 237.7 377 229.7C371.6 223.8 362.3 220 351.6 220C340.1 220 331.7 223.8 326.2 229.7C318.7 237.7 306 238.1 297.9 230.6zM208 320C208 293.5 229.5 272 256 272C282.5 272 304 293.5 304 320V352C304 378.5 282.5 400 256 400C229.5 400 208 378.5 208 352V320zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM400 406.1C439.4 368.2 464 314.1 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 314.1 72.55 368.2 112 406.1V288C112 274.7 122.7 264 136 264C149.3 264 160 274.7 160 288V440.6C188.7 455.5 221.4 464 256 464C290.6 464 323.3 455.5 352 440.6V288C352 274.7 362.7 264 376 264C389.3 264 400 274.7 400 288V406.1z"],"face-sad-tear":[512,512,[128546,"sad-tear"],"f5b4","M169.6 291.3C172.8 286.9 179.2 286.9 182.4 291.3C195.6 308.6 223.1 349 223.1 369C223.1 395 202.5 416 175.1 416C149.5 416 127.1 395 127.1 369C127.1 349 156.6 308.6 169.6 291.3H169.6zM368 346.8C377.9 355.6 378.7 370.8 369.9 380.7C361 390.6 345.9 391.4 335.1 382.6C314.7 363.5 286.7 352 256 352C242.7 352 232 341.3 232 328C232 314.7 242.7 304 256 304C299 304 338.3 320.2 368 346.8L368 346.8zM335.6 176C353.3 176 367.6 190.3 367.6 208C367.6 225.7 353.3 240 335.6 240C317.1 240 303.6 225.7 303.6 208C303.6 190.3 317.1 176 335.6 176zM175.6 240C157.1 240 143.6 225.7 143.6 208C143.6 190.3 157.1 176 175.6 176C193.3 176 207.6 190.3 207.6 208C207.6 225.7 193.3 240 175.6 240zM256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0zM175.9 448C200.5 458.3 227.6 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48C141.1 48 48 141.1 48 256C48 308.7 67.59 356.8 99.88 393.4C110.4 425.4 140.9 447.9 175.9 448V448z"],"face-smile":[512,512,[128578,"smile"],"f118","M256 352C293.2 352 319.2 334.5 334.4 318.1C343.3 308.4 358.5 307.7 368.3 316.7C378 325.7 378.6 340.9 369.6 350.6C347.7 374.5 309.7 400 256 400C202.3 400 164.3 374.5 142.4 350.6C133.4 340.9 133.1 325.7 143.7 316.7C153.5 307.7 168.7 308.4 177.6 318.1C192.8 334.5 218.8 352 256 352zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-smile-beam":[512,512,[128522,"smile-beam"],"f5b8","M256 352C293.2 352 319.2 334.5 334.4 318.1C343.3 308.4 358.5 307.7 368.3 316.7C378 325.7 378.6 340.9 369.6 350.6C347.7 374.5 309.7 400 256 400C202.3 400 164.3 374.5 142.4 350.6C133.4 340.9 133.1 325.7 143.7 316.7C153.5 307.7 168.7 308.4 177.6 318.1C192.8 334.5 218.8 352 256 352zM217.6 228.8L217.6 228.8L217.4 228.5C217.2 228.3 217 228 216.7 227.6C216 226.8 215.1 225.7 213.9 224.3C211.4 221.4 207.9 217.7 203.7 213.1C194.9 206.2 184.8 200 176 200C167.2 200 157.1 206.2 148.3 213.1C144.1 217.7 140.6 221.4 138.1 224.3C136.9 225.7 135.1 226.8 135.3 227.6C134.1 228 134.8 228.3 134.6 228.5L134.4 228.8L134.4 228.8C132.3 231.6 128.7 232.7 125.5 231.6C122.2 230.5 120 227.4 120 224C120 206.1 126.7 188.4 136.6 175.2C146.4 162.2 160.5 152 176 152C191.5 152 205.6 162.2 215.4 175.2C225.3 188.4 232 206.1 232 224C232 227.4 229.8 230.5 226.5 231.6C223.3 232.7 219.7 231.6 217.6 228.8V228.8zM377.6 228.8L377.4 228.5C377.2 228.3 377 228 376.7 227.6C376 226.8 375.1 225.7 373.9 224.3C371.4 221.4 367.9 217.7 363.7 213.1C354.9 206.2 344.8 200 336 200C327.2 200 317.1 206.2 308.3 213.1C304.1 217.7 300.6 221.4 298.1 224.3C296.9 225.7 295.1 226.8 295.3 227.6C294.1 228 294.8 228.3 294.6 228.5L294.4 228.8L294.4 228.8C292.3 231.6 288.7 232.7 285.5 231.6C282.2 230.5 280 227.4 280 224C280 206.1 286.7 188.4 296.6 175.2C306.4 162.2 320.5 152 336 152C351.5 152 365.6 162.2 375.4 175.2C385.3 188.4 392 206.1 392 224C392 227.4 389.8 230.5 386.5 231.6C383.3 232.7 379.7 231.6 377.6 228.8L377.6 228.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-smile-wink":[512,512,[128521,"smile-wink"],"f4da","M256 352C293.2 352 319.2 334.5 334.4 318.1C343.3 308.4 358.5 307.7 368.3 316.7C378 325.7 378.6 340.9 369.6 350.6C347.7 374.5 309.7 400 256 400C202.3 400 164.3 374.5 142.4 350.6C133.4 340.9 133.1 325.7 143.7 316.7C153.5 307.7 168.7 308.4 177.6 318.1C192.8 334.5 218.8 352 256 352zM208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208zM281.9 230.6C273.9 223 273.5 210.4 281 202.3C295.6 186.8 316.3 180 335.6 180C354.1 180 375.7 186.8 390.2 202.3C397.8 210.4 397.4 223 389.3 230.6C381.2 238.1 368.6 237.7 361 229.7C355.6 223.8 346.3 220 335.6 220C324.1 220 315.7 223.8 310.2 229.7C302.7 237.7 290 238.1 281.9 230.6zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-surprise":[512,512,[128558,"surprise"],"f5c2","M144.4 208C144.4 190.3 158.7 176 176.4 176C194 176 208.4 190.3 208.4 208C208.4 225.7 194 240 176.4 240C158.7 240 144.4 225.7 144.4 208zM368.4 208C368.4 225.7 354 240 336.4 240C318.7 240 304.4 225.7 304.4 208C304.4 190.3 318.7 176 336.4 176C354 176 368.4 190.3 368.4 208zM192 352C192 316.7 220.7 288 256 288C291.3 288 320 316.7 320 352C320 387.3 291.3 416 256 416C220.7 416 192 387.3 192 352zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],"face-tired":[512,512,[128555,"tired"],"f5c8","M176.5 320.3C196.1 302.1 223.8 288 256 288C288.2 288 315.9 302.1 335.5 320.3C354.5 338.1 368 362 368 384C368 389.4 365.3 394.4 360.8 397.4C356.2 400.3 350.5 400.8 345.6 398.7L328.4 391.1C305.6 381.2 280.9 376 256 376C231.1 376 206.4 381.2 183.6 391.1L166.4 398.7C161.5 400.8 155.8 400.3 151.2 397.4C146.7 394.4 144 389.4 144 384C144 362 157.5 338.1 176.5 320.3zM223.4 194.6C234.1 200.3 234.1 215.7 223.4 221.4L133.5 269.3C125.6 273.6 116 267.8 116 258.9C116 256.1 116.1 253.4 118.8 251.2L154.8 208L118.8 164.8C116.1 162.6 116 159.9 116 157.1C116 148.2 125.6 142.4 133.5 146.7L223.4 194.6zM393.2 164.8L357.2 208L393.2 251.2C395 253.4 396 256.1 396 258.9C396 267.8 386.4 273.6 378.5 269.3L288.6 221.4C277.9 215.7 277.9 200.3 288.6 194.6L378.5 146.7C386.4 142.4 396 148.2 396 157.1C396 159.9 395 162.6 393.2 164.8zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 48C141.1 48 48 141.1 48 256C48 370.9 141.1 464 256 464C370.9 464 464 370.9 464 256C464 141.1 370.9 48 256 48z"],file:[384,512,[128459,61462,128196],"f15b","M0 64C0 28.65 28.65 0 64 0H229.5C246.5 0 262.7 6.743 274.7 18.75L365.3 109.3C377.3 121.3 384 137.5 384 154.5V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM336 448V160H256C238.3 160 224 145.7 224 128V48H64C55.16 48 48 55.16 48 64V448C48 456.8 55.16 464 64 464H320C328.8 464 336 456.8 336 448z"],"file-audio":[384,512,[],"f1c7","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0L64-.0001c-35.35 0-64 28.65-64 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM171.5 259.5L136 296H92C85.38 296 80 301.4 80 308v56C80 370.7 85.38 376 92 376H136l35.5 36.5C179.1 420 192 414.8 192 404v-136C192 257.3 179.1 251.9 171.5 259.5zM235.1 260.7c-6.25 6.25-6.25 16.38 0 22.62C235.3 283.5 256 305.1 256 336c0 30.94-20.77 52.53-20.91 52.69c-6.25 6.25-6.25 16.38 0 22.62C238.2 414.4 242.3 416 246.4 416s8.188-1.562 11.31-4.688C258.1 410.1 288 380.5 288 336s-29.05-74.06-30.28-75.31C251.5 254.4 241.3 254.4 235.1 260.7z"],"file-code":[384,512,[],"f1c9","M162.1 257.8c-7.812-7.812-20.47-7.812-28.28 0l-48 48c-7.812 7.812-7.812 20.5 0 28.31l48 48C137.8 386.1 142.9 388 148 388s10.23-1.938 14.14-5.844c7.812-7.812 7.812-20.5 0-28.31L128.3 320l33.86-33.84C169.1 278.3 169.1 265.7 162.1 257.8zM365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM221.9 257.8c-7.812 7.812-7.812 20.5 0 28.31L255.7 320l-33.86 33.84c-7.812 7.812-7.812 20.5 0 28.31C225.8 386.1 230.9 388 236 388s10.23-1.938 14.14-5.844l48-48c7.812-7.812 7.812-20.5 0-28.31l-48-48C242.3 250 229.7 250 221.9 257.8z"],"file-excel":[384,512,[],"f1c3","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM229.1 233.3L192 280.9L154.9 233.3C146.8 222.8 131.8 220.9 121.3 229.1C110.8 237.2 108.9 252.3 117.1 262.8L161.6 320l-44.53 57.25c-8.156 10.47-6.25 25.56 4.188 33.69C125.7 414.3 130.8 416 135.1 416c7.156 0 14.25-3.188 18.97-9.25L192 359.1l37.06 47.65C233.8 412.8 240.9 416 248 416c5.125 0 10.31-1.656 14.72-5.062c10.44-8.125 12.34-23.22 4.188-33.69L222.4 320l44.53-57.25c8.156-10.47 6.25-25.56-4.188-33.69C252.2 220.9 237.2 222.8 229.1 233.3z"],"file-image":[384,512,[128443],"f1c5","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM215.3 292c-4.68 0-9.051 2.34-11.65 6.234L164 357.8l-11.68-17.53C149.7 336.3 145.3 334 140.7 334c-4.682 0-9.053 2.34-11.65 6.234l-46.67 70c-2.865 4.297-3.131 9.82-.6953 14.37C84.09 429.2 88.84 432 93.1 432h196c5.163 0 9.907-2.844 12.34-7.395c2.436-4.551 2.17-10.07-.6953-14.37l-74.67-112C224.4 294.3 220 292 215.3 292zM128 288c17.67 0 32-14.33 32-32S145.7 224 128 224S96 238.3 96 256S110.3 288 128 288z"],"file-lines":[384,512,[128462,61686,128441,"file-alt","file-text"],"f15c","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0L64-.0001c-35.35 0-64 28.65-64 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM96 280C96 293.3 106.8 304 120 304h144C277.3 304 288 293.3 288 280S277.3 256 264 256h-144C106.8 256 96 266.8 96 280zM264 352h-144C106.8 352 96 362.8 96 376s10.75 24 24 24h144c13.25 0 24-10.75 24-24S277.3 352 264 352z"],"file-pdf":[384,512,[],"f1c1","M320 464C328.8 464 336 456.8 336 448V416H384V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V416H48V448C48 456.8 55.16 464 64 464H320zM256 160C238.3 160 224 145.7 224 128V48H64C55.16 48 48 55.16 48 64V192H0V64C0 28.65 28.65 0 64 0H229.5C246.5 0 262.7 6.743 274.7 18.75L365.3 109.3C377.3 121.3 384 137.5 384 154.5V192H336V160H256zM88 224C118.9 224 144 249.1 144 280C144 310.9 118.9 336 88 336H80V368C80 376.8 72.84 384 64 384C55.16 384 48 376.8 48 368V240C48 231.2 55.16 224 64 224H88zM112 280C112 266.7 101.3 256 88 256H80V304H88C101.3 304 112 293.3 112 280zM160 240C160 231.2 167.2 224 176 224H200C226.5 224 248 245.5 248 272V336C248 362.5 226.5 384 200 384H176C167.2 384 160 376.8 160 368V240zM192 352H200C208.8 352 216 344.8 216 336V272C216 263.2 208.8 256 200 256H192V352zM336 224C344.8 224 352 231.2 352 240C352 248.8 344.8 256 336 256H304V288H336C344.8 288 352 295.2 352 304C352 312.8 344.8 320 336 320H304V368C304 376.8 296.8 384 288 384C279.2 384 272 376.8 272 368V240C272 231.2 279.2 224 288 224H336z"],"file-powerpoint":[384,512,[],"f1c4","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM200 224H128C119.2 224 112 231.2 112 240v168c0 13.25 10.75 24 24 24S160 421.3 160 408v-32h44c44.21 0 79.73-37.95 75.69-82.98C276.1 253.2 240 224 200 224zM204 328H160V272h44c15.44 0 28 12.56 28 28S219.4 328 204 328z"],"file-video":[384,512,[],"f1c8","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM240 288c0-17.67-14.33-32-32-32h-96c-17.67 0-32 14.33-32 32v96c0 17.67 14.33 32 32 32h96c17.67 0 32-14.33 32-32v-16.52l43.84 30.2C292.3 403.5 304 397.6 304 387.4V284.6c0-10.16-11.64-16.16-20.16-10.32L240 304.5V288z"],"file-word":[384,512,[],"f1c2","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0H64C28.65 0 0 28.65 0 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h160L224 128c0 17.67 14.33 32 32 32h79.1V448zM214.6 248C211.3 238.4 202.2 232 192 232s-19.25 6.406-22.62 16L144.7 318.1l-25.89-77.66C114.6 227.8 101 221.2 88.41 225.2C75.83 229.4 69.05 243 73.23 255.6l48 144C124.5 409.3 133.5 415.9 143.8 416c10.17 0 19.45-6.406 22.83-16L192 328.1L217.4 400C220.8 409.6 229.8 416 240 416c10.27-.0938 19.53-6.688 22.77-16.41l48-144c4.188-12.59-2.594-26.16-15.17-30.38c-12.61-4.125-26.2 2.594-30.36 15.19l-25.89 77.66L214.6 248z"],"file-zipper":[384,512,["file-archive"],"f1c6","M365.3 93.38l-74.63-74.64C278.6 6.742 262.3 0 245.4 0L64-.0001c-35.35 0-64 28.65-64 64l.0065 384c0 35.34 28.65 64 64 64H320c35.2 0 64-28.8 64-64V138.6C384 121.7 377.3 105.4 365.3 93.38zM336 448c0 8.836-7.164 16-16 16H64.02c-8.838 0-16-7.164-16-16L48 64.13c0-8.836 7.164-16 16-16h48V64h64V48.13h48.01L224 128c0 17.67 14.33 32 32 32h79.1V448zM176 96h-64v32h64V96zM176 160h-64v32h64V160zM176 224h-64l-30.56 116.5C73.51 379.5 103.7 416 144.3 416c40.26 0 70.45-36.3 62.68-75.15L176 224zM160 368H128c-8.836 0-16-7.164-16-16s7.164-16 16-16h32c8.836 0 16 7.164 16 16S168.8 368 160 368z"],flag:[512,512,[61725,127988],"f024","M476.3 0c-6.365 0-13.01 1.35-19.34 4.233c-45.69 20.86-79.56 27.94-107.8 27.94c-59.96 0-94.81-31.86-163.9-31.87c-34.63 0-77.87 8.003-137.2 32.05V24C48 10.75 37.25 0 24 0S0 10.75 0 24v464C0 501.3 10.75 512 24 512s24-10.75 24-24v-104c53.59-23.86 96.02-31.81 132.8-31.81c73.63 0 124.9 31.78 198.6 31.78c31.91 0 68.02-5.971 111.1-23.09C504.1 355.9 512 344.4 512 332.1V30.73C512 11.1 495.3 0 476.3 0zM464 319.8c-30.31 10.82-58.08 16.1-84.6 16.1c-30.8 0-58.31-7-87.44-14.41c-32.01-8.141-68.29-17.37-111.1-17.37c-42.35 0-85.99 9.09-132.8 27.73V84.14l18.03-7.301c47.39-19.2 86.38-28.54 119.2-28.54c28.24 .0039 49.12 6.711 73.31 14.48c25.38 8.148 54.13 17.39 90.58 17.39c35.43 0 72.24-8.496 114.9-26.61V319.8z"],"floppy-disk":[448,512,[128426,128190,"save"],"f0c7","M224 256c-35.2 0-64 28.8-64 64c0 35.2 28.8 64 64 64c35.2 0 64-28.8 64-64C288 284.8 259.2 256 224 256zM433.1 129.1l-83.9-83.9C341.1 37.06 328.8 32 316.1 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V163.9C448 151.2 442.9 138.9 433.1 129.1zM128 80h144V160H128V80zM400 416c0 8.836-7.164 16-16 16H64c-8.836 0-16-7.164-16-16V96c0-8.838 7.164-16 16-16h16v104c0 13.25 10.75 24 24 24h192C309.3 208 320 197.3 320 184V83.88l78.25 78.25C399.4 163.2 400 164.8 400 166.3V416z"],folder:[512,512,[128447,61716,128193,"folder-blank"],"f07b","M447.1 96h-172.1L226.7 50.75C214.7 38.74 198.5 32 181.5 32H63.1c-35.35 0-64 28.66-64 64v320c0 35.34 28.65 64 64 64h384c35.35 0 64-28.66 64-64V160C511.1 124.7 483.3 96 447.1 96zM463.1 416c0 8.824-7.178 16-16 16h-384c-8.822 0-16-7.176-16-16V96c0-8.824 7.178-16 16-16h117.5c4.273 0 8.293 1.664 11.31 4.688L255.1 144h192c8.822 0 16 7.176 16 16V416z"],"folder-closed":[512,512,[],"e185","M448 96h-172.1L226.7 50.75C214.7 38.74 198.5 32 181.5 32H64C28.65 32 0 60.66 0 96v320c0 35.34 28.65 64 64 64h384c35.35 0 64-28.66 64-64V160C512 124.7 483.3 96 448 96zM64 80h117.5c4.273 0 8.293 1.664 11.31 4.688L256 144h192c8.822 0 16 7.176 16 16v32h-416V96C48 87.18 55.18 80 64 80zM448 432H64c-8.822 0-16-7.176-16-16V240h416V416C464 424.8 456.8 432 448 432z"],"folder-open":[576,512,[128449,61717,128194],"f07c","M572.6 270.3l-96 192C471.2 473.2 460.1 480 447.1 480H64c-35.35 0-64-28.66-64-64V96c0-35.34 28.65-64 64-64h117.5c16.97 0 33.25 6.742 45.26 18.75L275.9 96H416c35.35 0 64 28.66 64 64v32h-48V160c0-8.824-7.178-16-16-16H256L192.8 84.69C189.8 81.66 185.8 80 181.5 80H64C55.18 80 48 87.18 48 96v288l71.16-142.3C124.6 230.8 135.7 224 147.8 224h396.2C567.7 224 583.2 249 572.6 270.3z"],"font-awesome":[448,512,[62694,62501,"font-awesome-flag","font-awesome-logo-full"],"f2b4","M448 48V384c-63.09 22.54-82.34 32-119.5 32c-62.82 0-86.6-32-149.3-32c-21.69 0-38.48 3.791-53.74 8.766C110.1 397.5 96 386.1 96 371.7v-.7461c0-9.275 5.734-17.6 14.42-20.86C129.1 342.8 150.2 336 179.2 336c62.73 0 86.51 32 149.3 32c25.5 0 42.85-4.604 71.47-14.7v-240C379.2 120.6 357.7 128 328.5 128c-.0039 0 .0039 0 0 0c-62.81 0-86.61-32-149.3-32C122.1 96 98.8 122.1 48 126.1V456C48 469.3 37.25 480 24 480S0 469.3 0 456V56C0 42.74 10.75 32 24 32S48 42.74 48 56v22.99C98.8 74.14 122.1 48 179.2 48c62.77 0 86.45 32 149.3 32C366.1 80 386.8 69.85 448 48z"],futbol:[512,512,[9917,"futbol-ball","soccer-ball"],"f1e3","M177.1 228.6L207.9 320h96.5l29.62-91.38L256 172.1L177.1 228.6zM255.1 0C114.6 0 .0001 114.6 .0001 256S114.6 512 256 512s255.1-114.6 255.1-255.1S397.4 0 255.1 0zM435.2 361.1l-103.9-1.578l-30.67 99.52C286.2 462.2 271.3 464 256 464s-30.19-1.773-44.56-4.93L180.8 359.6L76.83 361.1c-14.93-25.35-24.79-54.01-27.8-84.72L134.3 216.4L100.7 118.1c19.85-22.34 44.32-40.45 72.04-52.62L256 128l83.29-62.47c27.72 12.17 52.19 30.27 72.04 52.62L377.7 216.4l85.23 59.97C459.1 307.1 450.1 335.8 435.2 361.1z"],gem:[512,512,[128142],"f3a5","M507.9 196.4l-104-153.8C399.4 35.95 391.1 32 384 32H127.1C120 32 112.6 35.95 108.1 42.56l-103.1 153.8c-6.312 9.297-5.281 21.72 2.406 29.89l231.1 246.2C243.1 477.3 249.4 480 256 480s12.94-2.734 17.47-7.547l232-246.2C513.2 218.1 514.2 205.7 507.9 196.4zM382.5 96.59L446.1 192h-140.1L382.5 96.59zM256 178.9L177.6 80h156.7L256 178.9zM129.5 96.59L205.1 192H65.04L129.5 96.59zM256 421L85.42 240h341.2L256 421z"],hand:[512,512,[129306,9995,"hand-paper"],"f256","M408 80c-3.994 0-7.91 .3262-11.73 .9551c-9.586-28.51-36.57-49.11-68.27-49.11c-6.457 0-12.72 .8555-18.68 2.457C296.6 13.73 273.9 0 248 0C222.1 0 199.3 13.79 186.6 34.44C180.7 32.85 174.5 32 168.1 32C128.4 32 96.01 64.3 96.01 104v121.6C90.77 224.6 85.41 224 80.01 224c-.0026 0 .0026 0 0 0C36.43 224 0 259.2 0 304.1c0 20.29 7.558 39.52 21.46 54.45l81.25 87.24C141.9 487.9 197.4 512 254.9 512h33.08C393.9 512 480 425.9 480 320V152C480 112.3 447.7 80 408 80zM432 320c0 79.41-64.59 144-143.1 144H254.9c-44.41 0-86.83-18.46-117.1-50.96l-79.76-85.63c-6.202-6.659-9.406-15.4-9.406-23.1c0-22.16 18.53-31.4 31.35-31.4c8.56 0 17.1 3.416 23.42 10.18l26.72 28.69C131.8 312.7 133.9 313.4 135.9 313.4c4.106 0 8.064-3.172 8.064-8.016V104c0-13.25 10.75-24 23.1-24c13.25 0 23.1 10.75 23.1 24v152C192 264.8 199.2 272 208 272s15.1-7.163 15.1-15.1L224 72c0-13.25 10.75-24 23.1-24c13.25 0 23.1 10.75 23.1 24v184C272 264.8 279.2 272 288 272s15.99-7.164 15.99-15.1l.0077-152.2c0-13.25 10.75-24 23.1-24c13.25 0 23.1 10.75 23.1 24v152.2C352 264.8 359.2 272 368 272s15.1-7.163 15.1-15.1V152c0-13.25 10.75-24 23.1-24c13.25 0 23.1 10.75 23.1 24V320z"],"hand-back-fist":[448,512,["hand-rock"],"f255","M377.1 68.05C364.4 50.65 343.7 40 321.2 40h-13.53c-3.518 0-7.039 .2754-10.53 .8184C284.8 31.33 269.6 26 253.5 26H240c-3.977 0-7.904 .3691-11.75 1.084C216.7 10.71 197.6 0 176 0H160C124.7 0 96 28.65 96 64v49.71L63.04 143.3C43.3 160 32 184.6 32 210.9v78.97c0 32.1 17.11 61.65 44.65 77.12L112 386.9v101.1C112 501.3 122.7 512 135.1 512S160 501.3 160 488v-129.9c-1.316-.6543-2.775-.9199-4.062-1.639l-55.78-31.34C87.72 318.2 80 304.6 80 289.9V210.9c0-12.31 5.281-23.77 14.5-31.39L112 163.8V208C112 216.8 119.2 224 128 224s16-7.156 16-16V64c0-8.828 7.188-16 16-16h16C184.8 48 192 55.17 192 64v16c0 9.578 7.942 16.04 16.15 16.04c6.432 0 12.31-4.018 14.73-10.17C223.3 84.84 228.3 74 240 74h13.53c20.97 0 17.92 19.58 34.27 19.58c8.177 0 9.9-5.584 19.88-5.584h13.53c25.54 0 18.27 28.23 38.66 28.23c.1562 0 .3125-.002 .4668-.0078L375.4 116C388.1 116 400 127.7 400 142V272c0 36.15-19.54 67.32-48 83.69v132.3C352 501.3 362.7 512 375.1 512S400 501.3 400 488v-108.1C430.1 352.8 448 313.6 448 272V142C448 102.1 416.8 69.44 377.1 68.05z"],"hand-lizard":[512,512,[],"f258","M512 331.8V424c0 13.25-10.75 24-24 24c-13.25 0-24-10.75-24-24v-92.17c0-10.09-3.031-19.8-8.766-28.08l-118.6-170.5C327.4 119.1 312.2 112 295.1 112H53.32c-2.5 0-5.25 2.453-5.313 4.172c-.2969 9.5 3.156 18.47 9.75 25.28C64.36 148.3 73.2 152 82.67 152h161.8c17.09 0 33.4 8.281 43.4 22.14c9.984 13.88 12.73 31.83 7.328 48.05l-9.781 29.34C278.2 273.3 257.8 288 234.9 288H138.7C129.2 288 120.4 291.8 113.8 298.5c-6.594 6.812-10.05 15.78-9.75 25.28C104.1 325.5 106.8 328 109.3 328h156.6c5.188 0 10.14 1.688 14.3 4.797l78.22 58.67c6.031 4.531 9.594 11.66 9.594 19.2L367.1 424c0 13.25-10.75 24-24 24s-24-10.75-24-24v-1.328L257.8 376H109.3c-28.48 0-52.39-22.72-53.28-50.64c-.7187-22.61 7.531-43.98 23.23-60.2C94.1 248.9 116.1 240 138.7 240h96.19c2.297 0 4.328-1.469 5.063-3.656l9.781-29.33c.7031-2.141-.0156-3.797-.7344-4.797C248.2 201.2 246.9 200 244.6 200H82.67c-22.58 0-43.67-8.938-59.39-25.16C7.575 158.6-.6755 137.3 .0433 114.6C.9339 86.72 24.84 64 53.32 64h242.7c31.94 0 61.86 15.67 80.05 41.92l118.6 170.5C506 292.8 512 311.9 512 331.8z"],"hand-peace":[512,512,[9996],"f25b","M412 160c-8.326 0-16.3 1.51-23.68 4.27C375.1 151.8 358.9 144 340 144c-11.64 0-22.44 3.223-32.03 8.418l11.12-68.95c.6228-3.874 .9243-7.725 .9243-11.53c0-36.08-28.91-71.95-72.09-71.95c-34.68 0-65.31 25.16-71.03 60.54L173.4 82.22L168.9 72.77c-12.4-25.75-38.07-40.78-64.89-40.78c-40.8 0-72.01 33.28-72.01 72.07c0 10.48 2.296 21.11 7.144 31.18L89.05 238.9C64.64 250.4 48 275.7 48 303.1v80c0 22.06 10.4 43.32 27.83 56.86l45.95 35.74c29.35 22.83 65.98 35.41 103.2 35.41l78.81 .0352C400.9 512 480 432.1 480 335.8v-107.5C480 189.6 447.9 160 412 160zM320 212.3C320 201.1 328.1 192 340 192c11.02 0 20 9.078 20 20.25v55.5C360 278.9 351 288 340 288C328.1 288 320 278.9 320 267.8V212.3zM247.9 47.98c12.05 0 24.13 9.511 24.13 23.98c0 1.277-.1022 2.57-.3134 3.871L248.4 220.5C240.7 217.6 232.4 215.1 223.9 215.1c0 0 .002 0 0 0c-4.475 0-8.967 .4199-13.38 1.254l-10.55 1.627l24.32-150.7C226.2 56.42 236.4 47.98 247.9 47.98zM79.1 104c0-13.27 10.79-24.04 24.02-24.04c8.937 0 17.5 5.023 21.61 13.61l61.29 127.3L137.3 228.5L82.38 114.4C80.76 111.1 79.1 107.5 79.1 104zM303.8 464l-78.81-.0352c-26.56 0-52.72-8.984-73.69-25.3l-45.97-35.75C99.47 398.4 96 391.3 96 383.1v-80c0-11.23 7.969-21.11 17.59-23.22l105.3-16.23C220.6 264.2 222.3 263.1 223.9 263.1c11.91 0 24.09 9.521 24.09 24.06c0 11.04-7.513 20.95-17.17 23.09L172.8 319c-12.03 1.633-20.78 11.92-20.78 23.75c0 20.21 18.82 24.08 23.7 24.08c2.645 0 64.61-8.619 65.54-8.826c23.55-5.227 41.51-22.23 49.73-43.64C303.3 327.5 320.6 336 340 336c8.326 0 16.31-1.51 23.69-4.27C376 344.2 393.1 352 412 352c.1992 0 10.08-.4453 18.65-2.92C423.9 413.5 369.9 464 303.8 464zM432 283.8C432 294.9 423 304 412 304c-11.02 0-20-9.078-20-20.25v-55.5C392 217.1 400.1 208 412 208c11.02 0 20 9.078 20 20.25V283.8z"],"hand-point-down":[448,512,[],"f0a7","M448 248V144C448 64.6 385.1 0 307.7 0H199.8C176.4 0 153.1 6.104 132.5 17.65L76.63 49C49.1 64.47 32 94.02 32 126.1V176c0 27.23 12.51 51.53 32 67.69V440C64 479.7 96.3 512 136 512s72-32.3 72-72v-56.44C210.6 383.9 213.3 384 216 384c25.95 0 48.73-13.79 61.4-34.43C283.3 351.2 289.6 352 296 352c25.95 0 48.73-13.79 61.4-34.43C363.3 319.2 369.6 320 376 320C415.7 320 448 287.7 448 248zM272 232c0-13.23 10.78-24 24-24S320 218.9 320 232.1V280c0 13.23-10.78 24-24 24S272 293.2 272 280V232zM192 264h12c12.39 0 23.93-3.264 34.27-8.545C239.3 258.1 240 260.1 240 264v48c0 13.23-10.78 24-24 24S192 325.2 192 312V264zM112 264c0-.2813 .1504-.5137 .1602-.793C114.8 263.4 117.3 264 120 264H160v176c0 13.23-10.78 24-24 24S112 453.2 112 440V264zM397.9 123.8C390.9 121.6 383.7 120 376 120c-29.04 0-53.96 17.37-65.34 42.18C305.8 161.2 301 160 296 160c-7.139 0-13.96 1.273-20.46 3.355C265.2 133.6 237.2 112 204 112H152C138.8 112 128 122.8 128 136S138.8 160 152 160h52c15.44 0 28 12.56 28 28S219.4 216 204 216H120C97.94 216 80 198.1 80 176V126.1c0-14.77 7.719-28.28 20.16-35.27l55.78-31.34C169.4 51.98 184.6 48 199.8 48h107.9C351.9 48 388.9 80.56 397.9 123.8zM400 248c0 13.23-10.78 24-24 24S352 261.2 352 248V192c0-13.23 10.78-24 24-24S400 178.8 400 192V248z"],"hand-point-left":[512,512,[],"f0a5","M264 480h104c79.4 0 144-62.95 144-140.3V231.8c0-23.44-6.104-46.73-17.65-67.35L462.1 108.6C447.5 81.1 417.1 64 385.9 64H336c-27.23 0-51.53 12.51-67.69 32H72C32.3 96 0 128.3 0 168S32.3 240 72 240h56.44C128.1 242.6 128 245.3 128 248c0 25.95 13.79 48.73 34.43 61.4C160.8 315.3 160 321.6 160 328c0 25.95 13.79 48.73 34.43 61.4C192.8 395.3 192 401.6 192 408C192 447.7 224.3 480 264 480zM280 304c13.23 0 24 10.78 24 24S293.1 352 279.9 352H232c-13.23 0-24-10.78-24-24S218.8 304 232 304H280zM248 224v12c0 12.39 3.264 23.93 8.545 34.27C253.9 271.3 251 272 248 272h-48C186.8 272 176 261.2 176 248S186.8 224 200 224H248zM248 144c.2813 0 .5137 .1504 .793 .1602C248.6 146.8 248 149.3 248 152V192h-176C58.77 192 48 181.2 48 168S58.77 144 72 144H248zM388.2 429.9C390.4 422.9 392 415.7 392 408c0-29.04-17.37-53.96-42.18-65.34C350.8 337.8 352 333 352 328c0-7.139-1.273-13.96-3.355-20.46C378.4 297.2 400 269.2 400 236V184C400 170.8 389.3 160 376 160S352 170.8 352 184v52c0 15.44-12.56 28-28 28S296 251.4 296 236V152c0-22.06 17.94-40 40-40h49.88c14.77 0 28.28 7.719 35.27 20.16l31.34 55.78C460 201.4 464 216.6 464 231.8v107.9C464 383.9 431.4 420.9 388.2 429.9zM264 432c-13.23 0-24-10.78-24-24S250.8 384 264 384H320c13.23 0 24 10.78 24 24S333.2 432 320 432H264z"],"hand-point-right":[512,512,[],"f0a4","M320 408c0-6.428-.8457-12.66-2.434-18.6C338.2 376.7 352 353.9 352 328c0-6.428-.8457-12.66-2.434-18.6C370.2 296.7 384 273.9 384 248c0-2.705-.1484-5.373-.4414-8H440C479.7 240 512 207.7 512 168S479.7 96 440 96H243.7C227.5 76.51 203.2 64 176 64H126.1C94.02 64 64.47 81.1 49 108.6L17.65 164.5C6.104 185.1 0 208.4 0 231.8v107.9C0 417.1 64.6 480 144 480h104C287.7 480 320 447.7 320 408zM280 304c13.23 0 24 10.78 24 24S293.2 352 280 352H232.1C218.9 352 208 341.2 208 328S218.8 304 232 304H280zM312 224c13.23 0 24 10.78 24 24S325.2 272 312 272h-48c-3.029 0-5.875-.7012-8.545-1.73C260.7 259.9 264 248.4 264 236V224H312zM440 144c13.23 0 24 10.78 24 24S453.2 192 440 192h-176V152c0-2.686-.5566-5.217-.793-7.84C263.5 144.2 263.7 144 264 144H440zM48 339.7V231.8c0-15.25 3.984-30.41 11.52-43.88l31.34-55.78C97.84 119.7 111.4 112 126.1 112H176c22.06 0 40 17.94 40 40v84c0 15.44-12.56 28-28 28S160 251.4 160 236V184C160 170.8 149.3 160 136 160S112 170.8 112 184v52c0 33.23 21.58 61.25 51.36 71.54C161.3 314 160 320.9 160 328c0 5.041 1.166 9.836 2.178 14.66C137.4 354 120 378.1 120 408c0 7.684 1.557 14.94 3.836 21.87C80.56 420.9 48 383.9 48 339.7zM192 432c-13.23 0-24-10.78-24-24S178.8 384 192 384h56c13.23 0 24 10.78 24 24s-10.77 24-24 24H192z"],"hand-point-up":[448,512,[9757],"f0a6","M376 192c-6.428 0-12.66 .8457-18.6 2.434C344.7 173.8 321.9 160 296 160c-6.428 0-12.66 .8457-18.6 2.434C264.7 141.8 241.9 128 216 128C213.3 128 210.6 128.1 208 128.4V72C208 32.3 175.7 0 136 0S64 32.3 64 72v196.3C44.51 284.5 32 308.8 32 336v49.88c0 32.1 17.1 61.65 44.63 77.12l55.83 31.35C153.1 505.9 176.4 512 199.8 512h107.9C385.1 512 448 447.4 448 368V264C448 224.3 415.7 192 376 192zM272 232c0-13.23 10.78-24 24-24S320 218.8 320 232v47.91C320 293.1 309.2 304 296 304S272 293.2 272 280V232zM192 200C192 186.8 202.8 176 216 176s24 10.77 24 24v48c0 3.029-.7012 5.875-1.73 8.545C227.9 251.3 216.4 248 204 248H192V200zM112 72c0-13.23 10.78-24 24-24S160 58.77 160 72v176H120c-2.686 0-5.217 .5566-7.84 .793C112.2 248.5 112 248.3 112 248V72zM307.7 464H199.8c-15.25 0-30.41-3.984-43.88-11.52l-55.78-31.34C87.72 414.2 80 400.6 80 385.9V336c0-22.06 17.94-40 40-40h84c15.44 0 28 12.56 28 28S219.4 352 204 352H152C138.8 352 128 362.8 128 376s10.75 24 24 24h52c33.23 0 61.25-21.58 71.54-51.36C282 350.7 288.9 352 296 352c5.041 0 9.836-1.166 14.66-2.178C322 374.6 346.1 392 376 392c7.684 0 14.94-1.557 21.87-3.836C388.9 431.4 351.9 464 307.7 464zM400 320c0 13.23-10.78 24-24 24S352 333.2 352 320V264c0-13.23 10.78-24 24-24s24 10.77 24 24V320z"],"hand-pointer":[448,512,[],"f25a","M208 288C199.2 288 192 295.2 192 304v96C192 408.8 199.2 416 208 416s16-7.164 16-16v-96C224 295.2 216.8 288 208 288zM272 288C263.2 288 256 295.2 256 304v96c0 8.836 7.162 16 15.1 16S288 408.8 288 400l-.0013-96C287.1 295.2 280.8 288 272 288zM376.9 201.2c-13.74-17.12-34.8-27.45-56.92-27.45h-13.72c-3.713 0-7.412 .291-11.07 .8652C282.7 165.1 267.4 160 251.4 160h-11.44V72c0-39.7-32.31-72-72.01-72c-39.7 0-71.98 32.3-71.98 72v168.5C84.85 235.1 75.19 235.4 69.83 235.4c-44.35 0-69.83 37.23-69.83 69.85c0 14.99 4.821 29.51 13.99 41.69l78.14 104.2C120.7 489.3 166.2 512 213.7 512h109.7c6.309 0 12.83-.957 18.14-2.645c28.59-5.447 53.87-19.41 73.17-40.44C436.1 446.3 448 416.2 448 384.2V274.3C448 234.6 416.3 202.3 376.9 201.2zM400 384.2c0 19.62-7.219 38.06-20.44 52.06c-12.53 13.66-29.03 22.67-49.69 26.56C327.4 463.6 325.3 464 323.4 464H213.7c-32.56 0-63.65-15.55-83.18-41.59L52.36 318.2C49.52 314.4 48.02 309.8 48.02 305.2c0-16.32 14.5-21.75 21.72-21.75c4.454 0 12.01 1.55 17.34 8.703l28.12 37.5c3.093 4.105 7.865 6.419 12.8 6.419c11.94 0 16.01-10.7 16.01-16.01V72c0-13.23 10.78-24 23.1-24c13.22 0 24 10.77 24 24v130.7c0 6.938 5.451 16.01 16.03 16.01C219.5 218.7 220.1 208 237.7 208h13.72c21.5 0 18.56 19.21 34.7 19.21c8.063 0 9.805-5.487 20.15-5.487h13.72c26.96 0 17.37 27.43 40.77 27.43l14.07-.0037c13.88 0 25.16 11.28 25.16 25.14V384.2zM336 288C327.2 288 320 295.2 320 304v96c0 8.836 7.164 16 16 16s16-7.164 16-16v-96C352 295.2 344.8 288 336 288z"],"hand-scissors":[512,512,[],"f257","M270.1 480h97.92C447.4 480 512 417.1 512 339.7V231.8c0-23.45-6.106-46.73-17.66-67.33l-31.35-55.85C447.5 81.1 417.1 64 385.9 64h-46.97c-26.63 0-51.56 11.63-68.4 31.93l-15.46 18.71L127.3 68.44C119 65.46 110.5 64.05 102.1 64.05c-30.02 0-58.37 18.06-69.41 47.09C15.06 156.8 46.19 194 76.75 204.9l2.146 .7637L68.79 206.4C30.21 209 0 241.2 0 279.3c0 39.7 33.27 72.09 73.92 72.09c1.745 0 3.501-.0605 5.268-.1833l88.79-6.135v8.141c0 22.11 10.55 43.11 28.05 56.74C197.4 448.8 230.2 480 270.1 480zM269.1 432c-14.34 0-26-11.03-26-24.62c0 0 .0403-14.31 .0403-14.71c0-6.894-4.102-14.2-10.67-16.39c-10.39-3.5-17.38-12.78-17.38-23.06v-13.53c0-16.98 13.7-16.4 13.7-29.89c0-9.083-7.392-15.96-15.96-15.96c-.3646 0-.7311 .0125-1.099 .0377c0 0-138.1 9.505-138.7 9.505c-14.32 0-25.93-11.04-25.93-24.49c0-13.28 10.7-23.74 24.1-24.64l163.2-11.28c2.674-.1882 14.92-2.907 14.92-16.18c0-6.675-4.284-12.58-10.65-14.85L92.84 159.7C85.39 156.1 75.97 149.4 75.97 136.7c0-11.14 9.249-24.66 25.97-24.66c3.043 0 6.141 .5115 9.166 1.59l234.1 85.03c1.801 .6581 3.644 .9701 5.456 .9701c8.96 0 16-7.376 16-15.1c0-6.514-4.068-12.69-10.59-15.04l-64.81-23.47l15.34-18.56C315.2 117.3 326.6 112 338.9 112h46.97c14.77 0 28.28 7.719 35.27 20.16L452.5 188c7.531 13.41 11.52 28.56 11.52 43.81v107.9c0 50.91-43.06 92.31-96 92.31H269.1z"],"hand-spock":[576,512,[128406],"f259","M234.9 48.02c10.43 0 20.72 5.834 24.13 19.17l47.33 184.1c2.142 8.456 9.174 12.62 16.21 12.62c7.326 0 14.66-4.505 16.51-13.37l31.72-155.1c2.921-14.09 13.76-20.57 24.67-20.57c13.01 0 26.14 9.19 26.14 25.62c0 2.19-.2333 4.508-.7313 6.951l-28.48 139.2c-.2389 1.156-.3514 2.265-.3514 3.323c0 8.644 7.504 13.9 14.86 13.9c5.869 0 11.65-3.341 13.46-10.98l24.73-104.2c.2347-.9802 4.12-19.76 24.28-19.76c13.21 0 26.64 9.4 26.64 24.79c0 2.168-.2665 4.455-.8378 6.852l-48.06 204.7c-13.59 57.85-65.15 98.74-124.5 98.74l-48.79-.0234c-40.7-.0196-79.86-15.58-109.5-43.51l-75.93-71.55c-5.938-5.584-8.419-11.1-8.419-18.2c0-13.88 12.45-26.69 26.38-26.69c5.756 0 11.76 2.182 17.26 7.376l51.08 48.14c1.682 1.569 3.599 2.249 5.448 2.249c4.192 0 8.04-3.49 8.04-8.001c0-23.76-3.372-47.39-10.12-70.28L142 161.1C141.2 159.1 140.8 156.3 140.8 153.7c0-15.23 13.48-24.82 26.75-24.82c10.11 0 20.1 5.559 23.94 18.42l31.22 105.8c2.231 7.546 8.029 10.8 13.9 10.8c7.752 0 15.64-5.659 15.64-14.57c0-1.339-.1783-2.752-.562-4.23L209.3 80.06C208.7 77.45 208.3 74.97 208.3 72.62C208.3 57.33 221.7 48.02 234.9 48.02zM234.9 0C201.5 0 160.4 25.24 160.4 72.72c0 2.807 .1579 5.632 .4761 8.463C129.9 83.9 92.84 108.9 92.84 153.8c0 7.175 1.038 14.47 3.148 21.68l24.33 81.94C115.8 256.5 111.1 256 106.4 256C65.74 256 32 290.6 32 330.8c0 19.59 8.162 38.58 23.6 53.1l75.89 71.51c38.68 36.45 89.23 56.53 142.3 56.56L322.6 512c82.1 0 152.5-55.83 171.3-135.8l48.06-204.7C543.3 165.7 544 159.7 544 153.9c0-54.55-49.55-72.95-74.59-72.95c-.7689 0-1.534 .0117-2.297 .0352c-10.49-39.43-46.46-54.11-71.62-54.11c-34.1 0-64.45 24.19-71.63 58.83L319.2 108.5l-13.7-53.29C297.1 22.22 268.7 0 234.9 0z"],handshake:[640,512,[],"f2b5","M506.1 127.1c-17.97-20.17-61.46-61.65-122.7-71.1c-22.5-3.354-45.39 3.606-63.41 18.21C302 60.47 279.1 53.42 256.5 56.86C176.8 69.17 126.7 136.2 124.6 139.1c-7.844 10.69-5.531 25.72 5.125 33.57c4.281 3.157 9.281 4.657 14.19 4.657c7.406 0 14.69-3.375 19.38-9.782c.4062-.5626 40.19-53.91 100.5-63.23c7.457-.9611 14.98 .67 21.56 4.483L227.2 168.2C214.8 180.5 207.1 196.1 207.1 214.5c0 17.5 6.812 33.94 19.16 46.29C239.5 273.2 255.9 279.1 273.4 279.1s33.94-6.813 46.31-19.19l11.35-11.35l124.2 100.9c2.312 1.875 2.656 5.251 .5 7.97l-27.69 35.75c-1.844 2.25-5.25 2.594-7.156 1.063l-22.22-18.69l-26.19 27.75c-2.344 2.875-5.344 3.563-6.906 3.719c-1.656 .1562-4.562 .125-6.812-1.719l-32.41-27.66L310.7 392.3l-2.812 2.938c-5.844 7.157-14.09 11.66-23.28 12.6c-9.469 .8126-18.25-1.75-24.5-6.782L170.3 319.8H96V128.3L0 128.3v255.6l64 .0404c11.74 0 21.57-6.706 27.14-16.14h60.64l77.06 69.66C243.7 449.6 261.9 456 280.8 456c2.875 0 5.781-.125 8.656-.4376c13.62-1.406 26.41-6.063 37.47-13.5l.9062 .8126c12.03 9.876 27.28 14.41 42.69 12.78c13.19-1.375 25.28-7.032 33.91-15.35c21.09 8.188 46.09 2.344 61.25-16.47l27.69-35.75c18.47-22.82 14.97-56.48-7.844-75.01l-120.3-97.76l8.381-8.382c9.375-9.376 9.375-24.57 0-33.94c-9.375-9.376-24.56-9.376-33.94 0L285.8 226.8C279.2 233.5 267.7 233.5 261.1 226.8c-3.312-3.282-5.125-7.657-5.125-12.31c0-4.688 1.812-9.064 5.281-12.53l85.91-87.64c7.812-7.845 18.53-11.75 28.94-10.03c59.75 9.22 100.2 62.73 100.6 63.29c3.088 4.155 7.264 6.946 11.84 8.376H544v175.1c0 17.67 14.33 32.05 31.1 32.05L640 384V128.1L506.1 127.1zM48 352c-8.75 0-16-7.245-16-15.99c0-8.876 7.25-15.99 16-15.99S64 327.2 64 336.1C64 344.8 56.75 352 48 352zM592 352c-8.75 0-16-7.245-16-15.99c0-8.876 7.25-15.99 16-15.99s16 7.117 16 15.99C608 344.8 600.8 352 592 352z"],"hard-drive":[512,512,[128436,"hdd"],"f0a0","M304 344c-13.25 0-24 10.74-24 24c0 13.25 10.75 24 24 24c13.26 0 24-10.75 24-24C328 354.7 317.3 344 304 344zM448 32h-384c-35.35 0-64 28.65-64 64v320c0 35.35 28.65 64 64 64h384c35.35 0 64-28.65 64-64V96C512 60.65 483.3 32 448 32zM464 416c0 8.822-7.178 16-16 16H64c-8.822 0-16-7.178-16-16v-96c0-8.822 7.178-16 16-16h384C456.8 304 464 311.2 464 320V416zM464 258.3C458.9 256.9 453.6 256 448 256H64C58.44 256 53.14 256.9 48 258.3V96c0-8.822 7.178-16 16-16h384c8.822 0 16 7.178 16 16V258.3zM400 344c-13.25 0-24 10.74-24 24c0 13.25 10.75 24 24 24c13.26 0 24-10.75 24-24C424 354.7 413.3 344 400 344z"],heart:[512,512,[128153,128154,128155,128156,128420,129293,129294,129505,10084,61578,9829],"f004","M244 84L255.1 96L267.1 84.02C300.6 51.37 347 36.51 392.6 44.1C461.5 55.58 512 115.2 512 185.1V190.9C512 232.4 494.8 272.1 464.4 300.4L283.7 469.1C276.2 476.1 266.3 480 256 480C245.7 480 235.8 476.1 228.3 469.1L47.59 300.4C17.23 272.1 0 232.4 0 190.9V185.1C0 115.2 50.52 55.58 119.4 44.1C164.1 36.51 211.4 51.37 244 84C243.1 84 244 84.01 244 84L244 84zM255.1 163.9L210.1 117.1C188.4 96.28 157.6 86.4 127.3 91.44C81.55 99.07 48 138.7 48 185.1V190.9C48 219.1 59.71 246.1 80.34 265.3L256 429.3L431.7 265.3C452.3 246.1 464 219.1 464 190.9V185.1C464 138.7 430.4 99.07 384.7 91.44C354.4 86.4 323.6 96.28 301.9 117.1L255.1 163.9z"],hospital:[640,512,[127973,62589,"hospital-alt","hospital-wide"],"f0f8","M296 96C296 87.16 303.2 80 312 80H328C336.8 80 344 87.16 344 96V120H368C376.8 120 384 127.2 384 136V152C384 160.8 376.8 168 368 168H344V192C344 200.8 336.8 208 328 208H312C303.2 208 296 200.8 296 192V168H272C263.2 168 256 160.8 256 152V136C256 127.2 263.2 120 272 120H296V96zM408 0C447.8 0 480 32.24 480 72V80H568C607.8 80 640 112.2 640 152V440C640 479.8 607.8 512 568 512H71.98C32.19 512 0 479.8 0 440V152C0 112.2 32.24 80 72 80H160V72C160 32.24 192.2 0 232 0L408 0zM480 128V464H568C581.3 464 592 453.3 592 440V336H536C522.7 336 512 325.3 512 312C512 298.7 522.7 288 536 288H592V240H536C522.7 240 512 229.3 512 216C512 202.7 522.7 192 536 192H592V152C592 138.7 581.3 128 568 128H480zM48 152V192H104C117.3 192 128 202.7 128 216C128 229.3 117.3 240 104 240H48V288H104C117.3 288 128 298.7 128 312C128 325.3 117.3 336 104 336H48V440C48 453.3 58.74 464 71.98 464H160V128H72C58.75 128 48 138.7 48 152V152zM208 464H272V400C272 373.5 293.5 352 320 352C346.5 352 368 373.5 368 400V464H432V72C432 58.75 421.3 48 408 48H232C218.7 48 208 58.75 208 72V464z"],hourglass:[384,512,[62032,9203,"hourglass-empty"],"f254","M360 0C373.3 0 384 10.75 384 24C384 37.25 373.3 48 360 48H352V66.98C352 107.3 335.1 145.1 307.5 174.5L225.9 256L307.5 337.5C335.1 366 352 404.7 352 445V464H360C373.3 464 384 474.7 384 488C384 501.3 373.3 512 360 512H24C10.75 512 0 501.3 0 488C0 474.7 10.75 464 24 464H32V445C32 404.7 48.01 366 76.52 337.5L158.1 256L76.52 174.5C48.01 145.1 32 107.3 32 66.98V48H24C10.75 48 0 37.25 0 24C0 10.75 10.75 0 24 0L360 0zM192 289.9L110.5 371.5C90.96 390.1 80 417.4 80 445V464H304V445C304 417.4 293 390.1 273.5 371.5L192 289.9zM192 222.1L273.5 140.5C293 121 304 94.56 304 66.98V47.1H80V66.98C80 94.56 90.96 121 110.5 140.5L192 222.1z"],"hourglass-half":[384,512,["hourglass-2"],"f252","M0 24C0 10.75 10.75 0 24 0H360C373.3 0 384 10.75 384 24C384 37.25 373.3 48 360 48H352V66.98C352 107.3 335.1 145.1 307.5 174.5L225.9 256L307.5 337.5C335.1 366 352 404.7 352 445V464H360C373.3 464 384 474.7 384 488C384 501.3 373.3 512 360 512H24C10.75 512 0 501.3 0 488C0 474.7 10.75 464 24 464H32V445C32 404.7 48.01 366 76.52 337.5L158.1 256L76.52 174.5C48.01 145.1 32 107.3 32 66.98V48H24C10.75 48 0 37.25 0 24V24zM99.78 384H284.2C281 379.6 277.4 375.4 273.5 371.5L192 289.9L110.5 371.5C106.6 375.4 102.1 379.6 99.78 384H99.78zM284.2 128C296.1 110.4 304 89.03 304 66.98V48H80V66.98C80 89.03 87 110.4 99.78 128H284.2z"],"id-badge":[384,512,[],"f2c1","M320 0H64C28.65 0 0 28.65 0 64v384c0 35.35 28.65 64 64 64h256c35.35 0 64-28.65 64-64V64C384 28.65 355.3 0 320 0zM336 448c0 8.836-7.164 16-16 16H64c-8.836 0-16-7.164-16-16V64c0-8.838 7.164-16 16-16h64V64c0 17.67 14.33 32 32 32h64c17.67 0 32-14.33 32-32V48h64c8.836 0 16 7.162 16 16V448zM192 288c35.35 0 64-28.65 64-64s-28.65-64-64-64C156.7 160 128 188.7 128 224S156.7 288 192 288zM224 320H160c-44.18 0-80 35.82-80 80C80 408.8 87.16 416 96 416h192c8.836 0 16-7.164 16-16C304 355.8 268.2 320 224 320z"],"id-card":[576,512,[62147,"drivers-license"],"f2c2","M368 344h96c13.25 0 24-10.75 24-24s-10.75-24-24-24h-96c-13.25 0-24 10.75-24 24S354.8 344 368 344zM208 320c35.35 0 64-28.65 64-64c0-35.35-28.65-64-64-64s-64 28.65-64 64C144 291.3 172.7 320 208 320zM512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM528 416c0 8.822-7.178 16-16 16h-192c0-44.18-35.82-80-80-80h-64C131.8 352 96 387.8 96 432H64c-8.822 0-16-7.178-16-16V160h480V416zM368 264h96c13.25 0 24-10.75 24-24s-10.75-24-24-24h-96c-13.25 0-24 10.75-24 24S354.8 264 368 264z"],image:[512,512,[],"f03e","M152 120c-26.51 0-48 21.49-48 48s21.49 48 48 48s48-21.49 48-48S178.5 120 152 120zM447.1 32h-384C28.65 32-.0091 60.65-.0091 96v320c0 35.35 28.65 64 63.1 64h384c35.35 0 64-28.65 64-64V96C511.1 60.65 483.3 32 447.1 32zM463.1 409.3l-136.8-185.9C323.8 218.8 318.1 216 312 216c-6.113 0-11.82 2.768-15.21 7.379l-106.6 144.1l-37.09-46.1c-3.441-4.279-8.934-6.809-14.77-6.809c-5.842 0-11.33 2.529-14.78 6.809l-75.52 93.81c0-.0293 0 .0293 0 0L47.99 96c0-8.822 7.178-16 16-16h384c8.822 0 16 7.178 16 16V409.3z"],images:[576,512,[],"f302","M512 32H160c-35.35 0-64 28.65-64 64v224c0 35.35 28.65 64 64 64H512c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM528 320c0 8.822-7.178 16-16 16h-16l-109.3-160.9C383.7 170.7 378.7 168 373.3 168c-5.352 0-10.35 2.672-13.31 7.125l-62.74 94.11L274.9 238.6C271.9 234.4 267.1 232 262 232c-5.109 0-9.914 2.441-12.93 6.574L176 336H160c-8.822 0-16-7.178-16-16V96c0-8.822 7.178-16 16-16H512c8.822 0 16 7.178 16 16V320zM224 112c-17.67 0-32 14.33-32 32s14.33 32 32 32c17.68 0 32-14.33 32-32S241.7 112 224 112zM456 480H120C53.83 480 0 426.2 0 360v-240C0 106.8 10.75 96 24 96S48 106.8 48 120v240c0 39.7 32.3 72 72 72h336c13.25 0 24 10.75 24 24S469.3 480 456 480z"],keyboard:[576,512,[9e3],"f11c","M512 64H64C28.65 64 0 92.65 0 128v256c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V128C576 92.65 547.3 64 512 64zM528 384c0 8.822-7.178 16-16 16H64c-8.822 0-16-7.178-16-16V128c0-8.822 7.178-16 16-16h448c8.822 0 16 7.178 16 16V384zM140 152h-24c-6.656 0-12 5.344-12 12v24c0 6.656 5.344 12 12 12h24c6.656 0 12-5.344 12-12v-24C152 157.3 146.7 152 140 152zM196 200h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C184 194.7 189.3 200 196 200zM276 200h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C264 194.7 269.3 200 276 200zM356 200h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C344 194.7 349.3 200 356 200zM460 152h-24c-6.656 0-12 5.344-12 12v24c0 6.656 5.344 12 12 12h24c6.656 0 12-5.344 12-12v-24C472 157.3 466.7 152 460 152zM140 232h-24c-6.656 0-12 5.344-12 12v24c0 6.656 5.344 12 12 12h24c6.656 0 12-5.344 12-12v-24C152 237.3 146.7 232 140 232zM196 280h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C184 274.7 189.3 280 196 280zM276 280h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C264 274.7 269.3 280 276 280zM356 280h24c6.656 0 12-5.344 12-12v-24c0-6.656-5.344-12-12-12h-24c-6.656 0-12 5.344-12 12v24C344 274.7 349.3 280 356 280zM460 232h-24c-6.656 0-12 5.344-12 12v24c0 6.656 5.344 12 12 12h24c6.656 0 12-5.344 12-12v-24C472 237.3 466.7 232 460 232zM400 320h-224C167.1 320 160 327.1 160 336V352c0 8.875 7.125 16 16 16h224c8.875 0 16-7.125 16-16v-16C416 327.1 408.9 320 400 320z"],lemon:[448,512,[127819],"f094","M439.9 144.6c15.34-26.38 8.372-62.41-16.96-87.62c-25.21-25.32-61.22-32.26-87.61-16.95c-9.044 5.218-27.15 3.702-48.08 1.968c-50.78-4.327-127.4-10.73-207.6 69.56C-.6501 191.9 5.801 268.5 10.07 319.3c1.749 20.96 3.28 39.07-1.984 48.08c-15.35 26.4-8.357 62.45 16.92 87.57c16.26 16.37 37.05 25.09 56.83 25.09c10.89 0 21.46-2.64 30.83-8.092c9.013-5.249 27.12-3.718 48.08-1.968c50.69 4.233 127.4 10.7 207.6-69.56c80.27-80.28 73.82-156.9 69.56-207.7C436.2 171.8 434.7 153.7 439.9 144.6zM398.4 120.5c-12.87 22.09-10.67 48.41-8.326 76.25c4.155 49.3 8.841 105.2-55.67 169.7c-64.53 64.49-120.5 59.78-169.7 55.68c-27.85-2.328-54.12-4.53-76.26 8.311c-6.139 3.64-19.17 1.031-29.58-9.451c-10.39-10.33-12.95-23.35-9.372-29.49c12.87-22.09 10.67-48.41 8.326-76.25C53.72 265.1 49.04 210.1 113.5 145.5c48.27-48.27 91.71-57.8 131.2-57.8c13.28 0 26.12 1.078 38.52 2.125c27.9 2.359 54.17 4.561 76.26-8.311c6.123-3.577 19.18-1.031 29.49 9.357C399.4 101.2 402 114.4 398.4 120.5zM239.5 124.1c2.156 8.561-3.062 17.25-11.62 19.43C183.6 154.7 122.7 215.6 111.6 259.9C109.7 267.1 103.2 271.1 96.05 271.1c-1.281 0-2.593-.1562-3.905-.4687C83.58 269.3 78.4 260.6 80.52 252.1C94.67 195.8 163.8 126.7 220.1 112.5C228.8 110.4 237.3 115.5 239.5 124.1z"],"life-ring":[512,512,[],"f1cd","M464.1 431C474.3 440.4 474.3 455.6 464.1 464.1C455.6 474.3 440.4 474.3 431 464.1L419.3 453.2C374.9 489.9 318.1 512 256 512C193.9 512 137.1 489.9 92.74 453.2L80.97 464.1C71.6 474.3 56.4 474.3 47.03 464.1C37.66 455.6 37.66 440.4 47.03 431L58.8 419.3C22.08 374.9 0 318.1 0 256C0 193.9 22.08 137.1 58.8 92.74L47.03 80.97C37.66 71.6 37.66 56.4 47.03 47.03C56.4 37.66 71.6 37.66 80.97 47.03L92.74 58.8C137.1 22.08 193.9 0 256 0C318.1 0 374.9 22.08 419.3 58.8L431 47.03C440.4 37.66 455.6 37.66 464.1 47.03C474.3 56.4 474.3 71.6 464.1 80.97L453.2 92.74C489.9 137.1 512 193.9 512 256C512 318.1 489.9 374.9 453.2 419.3L464.1 431zM304.8 338.7C290.5 347.2 273.8 352 256 352C238.2 352 221.5 347.2 207.2 338.7L126.9 419.1C162.3 447.2 207.2 464 256 464C304.8 464 349.7 447.2 385.1 419.1L304.8 338.7zM464 256C464 207.2 447.2 162.3 419.1 126.9L338.7 207.2C347.2 221.5 352 238.2 352 256C352 273.8 347.2 290.5 338.7 304.8L419.1 385.1C447.2 349.7 464 304.8 464 256V256zM256 48C207.2 48 162.3 64.8 126.9 92.93L207.2 173.3C221.5 164.8 238.2 160 256 160C273.8 160 290.5 164.8 304.8 173.3L385.1 92.93C349.7 64.8 304.8 48 256 48V48zM173.3 304.8C164.8 290.5 160 273.8 160 256C160 238.2 164.8 221.5 173.3 207.2L92.93 126.9C64.8 162.3 48 207.2 48 256C48 304.8 64.8 349.7 92.93 385.1L173.3 304.8zM256 208C229.5 208 208 229.5 208 256C208 282.5 229.5 304 256 304C282.5 304 304 282.5 304 256C304 229.5 282.5 208 256 208z"],lightbulb:[384,512,[128161],"f0eb","M112.1 454.3c0 6.297 1.816 12.44 5.284 17.69l17.14 25.69c5.25 7.875 17.17 14.28 26.64 14.28h61.67c9.438 0 21.36-6.401 26.61-14.28l17.08-25.68c2.938-4.438 5.348-12.37 5.348-17.7L272 415.1h-160L112.1 454.3zM192 0C90.02 .3203 16 82.97 16 175.1c0 44.38 16.44 84.84 43.56 115.8c16.53 18.84 42.34 58.23 52.22 91.45c.0313 .25 .0938 .5166 .125 .7823h160.2c.0313-.2656 .0938-.5166 .125-.7823c9.875-33.22 35.69-72.61 52.22-91.45C351.6 260.8 368 220.4 368 175.1C368 78.8 289.2 .0039 192 0zM288.4 260.1c-15.66 17.85-35.04 46.3-49.05 75.89h-94.61c-14.01-29.59-33.39-58.04-49.04-75.88C75.24 236.8 64 206.1 64 175.1C64 113.3 112.1 48.25 191.1 48C262.6 48 320 105.4 320 175.1C320 206.1 308.8 236.8 288.4 260.1zM176 80C131.9 80 96 115.9 96 160c0 8.844 7.156 16 16 16S128 168.8 128 160c0-26.47 21.53-48 48-48c8.844 0 16-7.148 16-15.99S184.8 80 176 80z"],map:[576,512,[62072,128506],"f279","M565.6 36.24C572.1 40.72 576 48.11 576 56V392C576 401.1 569.8 410.9 560.5 414.4L392.5 478.4C387.4 480.4 381.7 480.5 376.4 478.8L192.5 417.5L32.54 478.4C25.17 481.2 16.88 480.2 10.38 475.8C3.882 471.3 0 463.9 0 456V120C0 110 6.15 101.1 15.46 97.57L183.5 33.57C188.6 31.6 194.3 31.48 199.6 33.23L383.5 94.52L543.5 33.57C550.8 30.76 559.1 31.76 565.6 36.24H565.6zM48 421.2L168 375.5V90.83L48 136.5V421.2zM360 137.3L216 89.3V374.7L360 422.7V137.3zM408 421.2L528 375.5V90.83L408 136.5V421.2z"],message:[512,512,["comment-alt"],"f27a","M447.1 0h-384c-35.25 0-64 28.75-64 63.1v287.1c0 35.25 28.75 63.1 64 63.1h96v83.98c0 9.836 11.02 15.55 19.12 9.7l124.9-93.68h144c35.25 0 64-28.75 64-63.1V63.1C511.1 28.75 483.2 0 447.1 0zM464 352c0 8.75-7.25 16-16 16h-160l-80 60v-60H64c-8.75 0-16-7.25-16-16V64c0-8.75 7.25-16 16-16h384c8.75 0 16 7.25 16 16V352z"],"money-bill-1":[576,512,["money-bill-alt"],"f3d1","M400 256C400 317.9 349.9 368 288 368C226.1 368 176 317.9 176 256C176 194.1 226.1 144 288 144C349.9 144 400 194.1 400 256zM272 224V288H264C255.2 288 248 295.2 248 304C248 312.8 255.2 320 264 320H312C320.8 320 328 312.8 328 304C328 295.2 320.8 288 312 288H304V208C304 199.2 296.8 192 288 192H272C263.2 192 256 199.2 256 208C256 216.8 263.2 224 272 224zM0 128C0 92.65 28.65 64 64 64H512C547.3 64 576 92.65 576 128V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V128zM48 176V336C83.35 336 112 364.7 112 400H464C464 364.7 492.7 336 528 336V176C492.7 176 464 147.3 464 112H112C112 147.3 83.35 176 48 176z"],moon:[512,512,[127769,9214],"f186","M421.6 379.9c-.6641 0-1.35 .0625-2.049 .1953c-11.24 2.143-22.37 3.17-33.32 3.17c-94.81 0-174.1-77.14-174.1-175.5c0-63.19 33.79-121.3 88.73-152.6c8.467-4.812 6.339-17.66-3.279-19.44c-11.2-2.078-29.53-3.746-40.9-3.746C132.3 31.1 32 132.2 32 256c0 123.6 100.1 224 223.8 224c69.04 0 132.1-31.45 173.8-82.93C435.3 389.1 429.1 379.9 421.6 379.9zM255.8 432C158.9 432 80 353 80 256c0-76.32 48.77-141.4 116.7-165.8C175.2 125 163.2 165.6 163.2 207.8c0 99.44 65.13 183.9 154.9 212.8C298.5 428.1 277.4 432 255.8 432z"],newspaper:[512,512,[128240],"f1ea","M456 32h-304C121.1 32 96 57.13 96 88v320c0 13.22-10.77 24-24 24S48 421.2 48 408V112c0-13.25-10.75-24-24-24S0 98.75 0 112v296C0 447.7 32.3 480 72 480h352c48.53 0 88-39.47 88-88v-304C512 57.13 486.9 32 456 32zM464 392c0 22.06-17.94 40-40 40H139.9C142.5 424.5 144 416.4 144 408v-320c0-4.406 3.594-8 8-8h304c4.406 0 8 3.594 8 8V392zM264 272h-64C186.8 272 176 282.8 176 296S186.8 320 200 320h64C277.3 320 288 309.3 288 296S277.3 272 264 272zM408 272h-64C330.8 272 320 282.8 320 296S330.8 320 344 320h64c13.25 0 24-10.75 24-24S421.3 272 408 272zM264 352h-64c-13.25 0-24 10.75-24 24s10.75 24 24 24h64c13.25 0 24-10.75 24-24S277.3 352 264 352zM408 352h-64C330.8 352 320 362.8 320 376s10.75 24 24 24h64c13.25 0 24-10.75 24-24S421.3 352 408 352zM400 112h-192c-17.67 0-32 14.33-32 32v64c0 17.67 14.33 32 32 32h192c17.67 0 32-14.33 32-32v-64C432 126.3 417.7 112 400 112z"],notdef:[384,512,[],"e1fe","M336 0h-288C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48v-416C384 21.49 362.5 0 336 0zM336 90.16V421.8L221.2 256L336 90.16zM192 213.8L77.19 48h229.6L192 213.8zM162.8 256L48 421.8V90.16L162.8 256zM192 298.2L306.8 464H77.19L192 298.2z"],"note-sticky":[448,512,[62026,"sticky-note"],"f249","M384 32H64.01C28.66 32 .0085 60.65 .0065 96L0 415.1C-.002 451.3 28.65 480 64 480h232.1c25.46 0 49.88-10.12 67.89-28.12l55.88-55.89C437.9 377.1 448 353.6 448 328.1V96C448 60.8 419.2 32 384 32zM52.69 427.3C50.94 425.6 48 421.8 48 416l.0195-319.1C48.02 87.18 55.2 80 64.02 80H384c8.674 0 16 7.328 16 16v192h-88C281.1 288 256 313.1 256 344v88H64C58.23 432 54.44 429.1 52.69 427.3zM330.1 417.9C322.9 425.1 313.8 429.6 304 431.2V344c0-4.406 3.594-8 8-8h87.23c-1.617 9.812-6.115 18.88-13.29 26.05L330.1 417.9z"],"object-group":[576,512,[],"f247","M128 160C128 142.3 142.3 128 160 128H288C305.7 128 320 142.3 320 160V256C320 273.7 305.7 288 288 288H160C142.3 288 128 273.7 128 256V160zM288 320C323.3 320 352 291.3 352 256V224H416C433.7 224 448 238.3 448 256V352C448 369.7 433.7 384 416 384H288C270.3 384 256 369.7 256 352V320H288zM48 115.8C38.18 106.1 32 94.22 32 80C32 53.49 53.49 32 80 32C94.22 32 106.1 38.18 115.8 48H460.2C469 38.18 481.8 32 496 32C522.5 32 544 53.49 544 80C544 94.22 537.8 106.1 528 115.8V396.2C537.8 405 544 417.8 544 432C544 458.5 522.5 480 496 480C481.8 480 469 473.8 460.2 464H115.8C106.1 473.8 94.22 480 80 480C53.49 480 32 458.5 32 432C32 417.8 38.18 405 48 396.2V115.8zM96 125.3V386.7C109.6 391.6 120.4 402.4 125.3 416H450.7C455.6 402.4 466.4 391.6 480 386.7V125.3C466.4 120.4 455.6 109.6 450.7 96H125.3C120.4 109.6 109.6 120.4 96 125.3z"],"object-ungroup":[640,512,[],"f248","M64 0C90.86 0 113.9 16.55 123.3 40H324.7C334.1 16.55 357.1 0 384 0C419.3 0 448 28.65 448 64C448 90.86 431.5 113.9 408 123.3V228.7C431.5 238.1 448 261.1 448 288C448 323.3 419.3 352 384 352C357.1 352 334.1 335.5 324.7 312H123.3C113.9 335.5 90.86 352 64 352C28.65 352 0 323.3 0 288C0 261.1 16.55 238.1 40 228.7V123.3C16.55 113.9 0 90.86 0 64C0 28.65 28.65 0 64 0V0zM64 80C72.84 80 80 72.84 80 64C80 56.1 74.28 49.54 66.75 48.24C65.86 48.08 64.94 48 64 48C55.16 48 48 55.16 48 64C48 64.07 48 64.14 48 64.21C48.01 65.07 48.09 65.92 48.24 66.75C49.54 74.28 56.1 80 64 80zM384 48C383.1 48 382.1 48.08 381.2 48.24C373.7 49.54 368 56.1 368 64C368 72.84 375.2 80 384 80C391.9 80 398.5 74.28 399.8 66.75C399.9 65.86 400 64.94 400 64C400 55.16 392.8 48 384 48V48zM324.7 88H123.3C116.9 104 104 116.9 88 123.3V228.7C104 235.1 116.9 247.1 123.3 264H324.7C331.1 247.1 343.1 235.1 360 228.7V123.3C343.1 116.9 331.1 104 324.7 88zM400 288C400 287.1 399.9 286.1 399.8 285.2C398.5 277.7 391.9 272 384 272C375.2 272 368 279.2 368 288C368 295.9 373.7 302.5 381.2 303.8C382.1 303.9 383.1 304 384 304C392.8 304 400 296.8 400 288zM64 272C56.1 272 49.54 277.7 48.24 285.2C48.08 286.1 48 287.1 48 288C48 296.8 55.16 304 64 304L64.22 303.1C65.08 303.1 65.93 303.9 66.75 303.8C74.28 302.5 80 295.9 80 288C80 279.2 72.84 272 64 272zM471.3 248C465.8 235.9 457.8 225.2 448 216.4V200H516.7C526.1 176.5 549.1 160 576 160C611.3 160 640 188.7 640 224C640 250.9 623.5 273.9 600 283.3V388.7C623.5 398.1 640 421.1 640 448C640 483.3 611.3 512 576 512C549.1 512 526.1 495.5 516.7 472H315.3C305.9 495.5 282.9 512 256 512C220.7 512 192 483.3 192 448C192 421.1 208.5 398.1 232 388.7V352H280V388.7C296 395.1 308.9 407.1 315.3 424H516.7C523.1 407.1 535.1 395.1 552 388.7V283.3C535.1 276.9 523.1 264 516.7 248H471.3zM592 224C592 215.2 584.8 208 576 208C575.1 208 574.1 208.1 573.2 208.2C565.7 209.5 560 216.1 560 224C560 232.8 567.2 240 576 240C583.9 240 590.5 234.3 591.8 226.8C591.9 225.9 592 224.9 592 224zM240 448C240 456.8 247.2 464 256 464C256.9 464 257.9 463.9 258.8 463.8C266.3 462.5 272 455.9 272 448C272 439.2 264.8 432 256 432C248.1 432 241.5 437.7 240.2 445.2C240.1 446.1 240 447.1 240 448zM573.2 463.8C574.1 463.9 575.1 464 576 464C584.8 464 592 456.8 592 448C592 447.1 591.9 446.2 591.8 445.3L591.8 445.2C590.5 437.7 583.9 432 576 432C567.2 432 560 439.2 560 448C560 455.9 565.7 462.5 573.2 463.8V463.8z"],"paper-plane":[512,512,[61913],"f1d8","M501.6 4.186c-7.594-5.156-17.41-5.594-25.44-1.063L12.12 267.1C4.184 271.7-.5037 280.3 .0431 289.4c.5469 9.125 6.234 17.16 14.66 20.69l153.3 64.38v113.5c0 8.781 4.797 16.84 12.5 21.06C184.1 511 188 512 191.1 512c4.516 0 9.038-1.281 12.99-3.812l111.2-71.46l98.56 41.4c2.984 1.25 6.141 1.875 9.297 1.875c4.078 0 8.141-1.031 11.78-3.094c6.453-3.625 10.88-10.06 11.95-17.38l64-432C513.1 18.44 509.1 9.373 501.6 4.186zM369.3 119.2l-187.1 208.9L78.23 284.7L369.3 119.2zM215.1 444v-49.36l46.45 19.51L215.1 444zM404.8 421.9l-176.6-74.19l224.6-249.5L404.8 421.9z"],paste:[512,512,["file-clipboard"],"f0ea","M502.6 198.6l-61.25-61.25C435.4 131.4 427.3 128 418.8 128H256C220.7 128 191.1 156.7 192 192l.0065 255.1C192 483.3 220.7 512 256 512h192c35.2 0 64-28.8 64-64l.0098-226.7C512 212.8 508.6 204.6 502.6 198.6zM464 448c0 8.836-7.164 16-16 16h-192c-8.838 0-16-7.164-16-16L240 192.1c0-8.836 7.164-16 16-16h128L384 224c0 17.67 14.33 32 32 32h48.01V448zM317.7 96C310.6 68.45 285.8 48 256 48H215.2C211.3 20.93 188.1 0 160 0C131.9 0 108.7 20.93 104.8 48H64c-35.35 0-64 28.65-64 64V384c0 35.34 28.65 64 64 64h96v-48H64c-8.836 0-16-7.164-16-16V112C48 103.2 55.18 96 64 96h16v16c0 17.67 14.33 32 32 32h61.35C190 115.4 220.6 96 256 96H317.7zM160 72c-8.822 0-16-7.176-16-16s7.178-16 16-16s16 7.176 16 16S168.8 72 160 72z"],"pen-to-square":[512,512,["edit"],"f044","M373.1 24.97C401.2-3.147 446.8-3.147 474.9 24.97L487 37.09C515.1 65.21 515.1 110.8 487 138.9L289.8 336.2C281.1 344.8 270.4 351.1 258.6 354.5L158.6 383.1C150.2 385.5 141.2 383.1 135 376.1C128.9 370.8 126.5 361.8 128.9 353.4L157.5 253.4C160.9 241.6 167.2 230.9 175.8 222.2L373.1 24.97zM440.1 58.91C431.6 49.54 416.4 49.54 407 58.91L377.9 88L424 134.1L453.1 104.1C462.5 95.6 462.5 80.4 453.1 71.03L440.1 58.91zM203.7 266.6L186.9 325.1L245.4 308.3C249.4 307.2 252.9 305.1 255.8 302.2L390.1 168L344 121.9L209.8 256.2C206.9 259.1 204.8 262.6 203.7 266.6zM200 64C213.3 64 224 74.75 224 88C224 101.3 213.3 112 200 112H88C65.91 112 48 129.9 48 152V424C48 446.1 65.91 464 88 464H360C382.1 464 400 446.1 400 424V312C400 298.7 410.7 288 424 288C437.3 288 448 298.7 448 312V424C448 472.6 408.6 512 360 512H88C39.4 512 0 472.6 0 424V152C0 103.4 39.4 64 88 64H200z"],"rectangle-list":[576,512,["list-alt"],"f022","M128 192C110.3 192 96 177.7 96 160C96 142.3 110.3 128 128 128C145.7 128 160 142.3 160 160C160 177.7 145.7 192 128 192zM200 160C200 146.7 210.7 136 224 136H448C461.3 136 472 146.7 472 160C472 173.3 461.3 184 448 184H224C210.7 184 200 173.3 200 160zM200 256C200 242.7 210.7 232 224 232H448C461.3 232 472 242.7 472 256C472 269.3 461.3 280 448 280H224C210.7 280 200 269.3 200 256zM200 352C200 338.7 210.7 328 224 328H448C461.3 328 472 338.7 472 352C472 365.3 461.3 376 448 376H224C210.7 376 200 365.3 200 352zM128 224C145.7 224 160 238.3 160 256C160 273.7 145.7 288 128 288C110.3 288 96 273.7 96 256C96 238.3 110.3 224 128 224zM128 384C110.3 384 96 369.7 96 352C96 334.3 110.3 320 128 320C145.7 320 160 334.3 160 352C160 369.7 145.7 384 128 384zM0 96C0 60.65 28.65 32 64 32H512C547.3 32 576 60.65 576 96V416C576 451.3 547.3 480 512 480H64C28.65 480 0 451.3 0 416V96zM48 96V416C48 424.8 55.16 432 64 432H512C520.8 432 528 424.8 528 416V96C528 87.16 520.8 80 512 80H64C55.16 80 48 87.16 48 96z"],"rectangle-xmark":[512,512,[62164,"rectangle-times","times-rectangle","window-close"],"f410","M175 175C184.4 165.7 199.6 165.7 208.1 175L255.1 222.1L303 175C312.4 165.7 327.6 165.7 336.1 175C346.3 184.4 346.3 199.6 336.1 208.1L289.9 255.1L336.1 303C346.3 312.4 346.3 327.6 336.1 336.1C327.6 346.3 312.4 346.3 303 336.1L255.1 289.9L208.1 336.1C199.6 346.3 184.4 346.3 175 336.1C165.7 327.6 165.7 312.4 175 303L222.1 255.1L175 208.1C165.7 199.6 165.7 184.4 175 175V175zM0 96C0 60.65 28.65 32 64 32H448C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96zM48 96V416C48 424.8 55.16 432 64 432H448C456.8 432 464 424.8 464 416V96C464 87.16 456.8 80 448 80H64C55.16 80 48 87.16 48 96z"],registered:[512,512,[174],"f25d","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 464c-114.7 0-208-93.31-208-208S141.3 48 256 48s208 93.31 208 208S370.7 464 256 464zM352 208c0-44.13-35.88-80-80-80L184 128c-13.25 0-24 10.75-24 24v208c0 13.25 10.75 24 24 24s24-10.75 24-24v-72h59.79l38.46 82.19C310.3 378.9 319 384 328 384c3.438 0 6.875-.7187 10.19-2.25c12-5.625 17.16-19.91 11.56-31.94l-34.87-74.5C337.1 261.1 352 236.3 352 208zM272 240h-64v-64h64c17.66 0 32 14.34 32 32S289.7 240 272 240z"],"share-from-square":[576,512,[61509,"share-square"],"f14d","M568.5 142.6l-144-135.1c-9.625-9.156-24.81-8.656-33.91 .9687c-9.125 9.625-8.688 24.81 .9687 33.91l100.1 94.56h-163.4C287.5 134.2 249.7 151 221 179.4C192 208.2 176 246.7 176 288v87.1c0 13.25 10.75 23.1 24 23.1S224 389.3 224 376V288c0-28.37 10.94-54.84 30.78-74.5C274.3 194.2 298.9 183 328 184h163.6l-100.1 94.56c-9.656 9.094-10.09 24.28-.9687 33.91c4.719 4.1 11.06 7.531 17.44 7.531c5.906 0 11.84-2.156 16.47-6.562l144-135.1C573.3 172.9 576 166.6 576 160S573.3 147.1 568.5 142.6zM360 384c-13.25 0-24 10.75-24 23.1v47.1c0 4.406-3.594 7.1-8 7.1h-272c-4.406 0-8-3.594-8-7.1V184c0-4.406 3.594-7.1 8-7.1H112c13.25 0 24-10.75 24-23.1s-10.75-23.1-24-23.1H56c-30.88 0-56 25.12-56 55.1v271.1C0 486.9 25.13 512 56 512h272c30.88 0 56-25.12 56-55.1v-47.1C384 394.8 373.3 384 360 384z"],snowflake:[512,512,[10054,10052],"f2dc","M484.4 294.4c1.715 6.402 .6758 12.89-2.395 18.21s-8.172 9.463-14.57 11.18l-31.46 8.43l32.96 19.03C480.4 357.8 484.4 372.5 477.8 384s-21.38 15.41-32.86 8.783l-32.96-19.03l8.43 31.46c3.432 12.81-4.162 25.96-16.97 29.39s-25.96-4.162-29.39-16.97l-20.85-77.82L280 297.6v84.49l56.97 56.97c9.375 9.375 9.375 24.56 0 33.94C332.3 477.7 326.1 480 320 480s-12.28-2.344-16.97-7.031L280 449.9V488c0 13.25-10.75 24-24 24s-24-10.75-24-24v-38.06l-23.03 23.03c-9.375 9.375-24.56 9.375-33.94 0s-9.375-24.56 0-33.94L232 382.1V297.6l-73.17 42.25l-20.85 77.82c-3.432 12.81-16.58 20.4-29.39 16.97s-20.4-16.58-16.97-29.39l8.43-31.46l-32.96 19.03C55.61 399.4 40.85 395.5 34.22 384s-2.615-26.16 8.859-32.79l32.96-19.03l-31.46-8.43c-12.81-3.432-20.4-16.58-16.97-29.39s16.58-20.4 29.39-16.97l77.82 20.85L208 255.1L134.8 213.8L57.01 234.6C44.2 238 31.05 230.4 27.62 217.6s4.162-25.96 16.97-29.39l31.46-8.432L43.08 160.8C31.61 154.2 27.6 139.5 34.22 128s21.38-15.41 32.86-8.785l32.96 19.03L91.62 106.8C88.18 93.98 95.78 80.83 108.6 77.39s25.96 4.162 29.39 16.97l20.85 77.82L232 214.4V129.9L175 72.97c-9.375-9.375-9.375-24.56 0-33.94s24.56-9.375 33.94 0L232 62.06V24C232 10.75 242.8 0 256 0s24 10.75 24 24v38.06l23.03-23.03c9.375-9.375 24.56-9.375 33.94 0s9.375 24.56 0 33.94L280 129.9v84.49l73.17-42.25l20.85-77.82c3.432-12.81 16.58-20.4 29.39-16.97c6.402 1.715 11.5 5.861 14.57 11.18s4.109 11.81 2.395 18.21l-8.43 31.46l32.96-19.03C456.4 112.6 471.2 116.5 477.8 128s2.615 26.16-8.859 32.78l-32.96 19.03l31.46 8.432c12.81 3.432 20.4 16.58 16.97 29.39s-16.58 20.4-29.39 16.97l-77.82-20.85L304 255.1l73.17 42.25l77.82-20.85C467.8 273.1 480.1 281.6 484.4 294.4z"],square:[448,512,[9723,9724,61590,9632],"f0c8","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM384 80H64C55.16 80 48 87.16 48 96V416C48 424.8 55.16 432 64 432H384C392.8 432 400 424.8 400 416V96C400 87.16 392.8 80 384 80z"],"square-caret-down":[448,512,["caret-square-down"],"f150","M320 192H128C118.5 192 109.8 197.7 105.1 206.4C102.2 215.1 103.9 225.3 110.4 232.3l96 104C210.9 341.2 217.3 344 224 344s13.09-2.812 17.62-7.719l96-104c6.469-7 8.188-17.19 4.375-25.91C338.2 197.7 329.5 192 320 192zM384 32H64C28.65 32 0 60.66 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM400 416c0 8.82-7.178 16-16 16H64c-8.822 0-16-7.18-16-16V96c0-8.82 7.178-16 16-16h320c8.822 0 16 7.18 16 16V416z"],"square-caret-left":[448,512,["caret-square-left"],"f191","M384 32H64C28.66 32 0 60.66 0 96v320c0 35.34 28.66 64 64 64h320c35.34 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM400 416c0 8.82-7.18 16-16 16H64c-8.82 0-16-7.18-16-16V96c0-8.82 7.18-16 16-16h320c8.82 0 16 7.18 16 16V416zM273.6 138c-8.719-3.812-18.91-2.094-25.91 4.375l-104 96C138.8 242.9 136 249.3 136 256s2.812 13.09 7.719 17.62l104 96c7 6.469 17.19 8.188 25.91 4.375C282.3 370.2 288 361.5 288 352V160C288 150.5 282.3 141.8 273.6 138z"],"square-caret-right":[448,512,["caret-square-right"],"f152","M200.3 142.4C193.3 135.9 183.1 134.2 174.4 138C165.7 141.8 160 150.5 160 159.1v192C160 361.5 165.7 370.2 174.4 374c8.719 3.812 18.91 2.094 25.91-4.375l104-96C309.2 269.1 312 262.7 312 256s-2.812-13.09-7.719-17.62L200.3 142.4zM384 32H64C28.66 32 0 60.66 0 96v320c0 35.34 28.66 64 64 64h320c35.34 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM400 416c0 8.82-7.18 16-16 16H64c-8.82 0-16-7.18-16-16V96c0-8.82 7.18-16 16-16h320c8.82 0 16 7.18 16 16V416z"],"square-caret-up":[448,512,["caret-square-up"],"f151","M241.6 175.7C237.1 170.8 230.7 168 224 168S210.9 170.8 206.4 175.7l-96 104c-6.469 7-8.188 17.19-4.375 25.91C109.8 314.3 118.5 320 127.1 320h192c9.531 0 18.16-5.656 22-14.38c3.813-8.719 2.094-18.91-4.375-25.91L241.6 175.7zM384 32H64C28.65 32 0 60.66 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM400 416c0 8.82-7.178 16-16 16H64c-8.822 0-16-7.18-16-16V96c0-8.82 7.178-16 16-16h320c8.822 0 16 7.18 16 16V416z"],"square-check":[448,512,[9989,61510,9745,"check-square"],"f14a","M211.8 339.8C200.9 350.7 183.1 350.7 172.2 339.8L108.2 275.8C97.27 264.9 97.27 247.1 108.2 236.2C119.1 225.3 136.9 225.3 147.8 236.2L192 280.4L300.2 172.2C311.1 161.3 328.9 161.3 339.8 172.2C350.7 183.1 350.7 200.9 339.8 211.8L211.8 339.8zM0 96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96zM48 96V416C48 424.8 55.16 432 64 432H384C392.8 432 400 424.8 400 416V96C400 87.16 392.8 80 384 80H64C55.16 80 48 87.16 48 96z"],"square-full":[512,512,[128997,128998,128999,129e3,129001,129002,129003,11036,11035],"f45c","M512 0V512H0V0H512zM464 48H48V464H464V48z"],"square-minus":[448,512,[61767,"minus-square"],"f146","M312 232C325.3 232 336 242.7 336 256C336 269.3 325.3 280 312 280H136C122.7 280 112 269.3 112 256C112 242.7 122.7 232 136 232H312zM0 96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96zM48 96V416C48 424.8 55.16 432 64 432H384C392.8 432 400 424.8 400 416V96C400 87.16 392.8 80 384 80H64C55.16 80 48 87.16 48 96z"],"square-plus":[448,512,[61846,"plus-square"],"f0fe","M200 344V280H136C122.7 280 112 269.3 112 256C112 242.7 122.7 232 136 232H200V168C200 154.7 210.7 144 224 144C237.3 144 248 154.7 248 168V232H312C325.3 232 336 242.7 336 256C336 269.3 325.3 280 312 280H248V344C248 357.3 237.3 368 224 368C210.7 368 200 357.3 200 344zM0 96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96zM48 96V416C48 424.8 55.16 432 64 432H384C392.8 432 400 424.8 400 416V96C400 87.16 392.8 80 384 80H64C55.16 80 48 87.16 48 96z"],star:[576,512,[61446,11088],"f005","M287.9 0C297.1 0 305.5 5.25 309.5 13.52L378.1 154.8L531.4 177.5C540.4 178.8 547.8 185.1 550.7 193.7C553.5 202.4 551.2 211.9 544.8 218.2L433.6 328.4L459.9 483.9C461.4 492.9 457.7 502.1 450.2 507.4C442.8 512.7 432.1 513.4 424.9 509.1L287.9 435.9L150.1 509.1C142.9 513.4 133.1 512.7 125.6 507.4C118.2 502.1 114.5 492.9 115.1 483.9L142.2 328.4L31.11 218.2C24.65 211.9 22.36 202.4 25.2 193.7C28.03 185.1 35.5 178.8 44.49 177.5L197.7 154.8L266.3 13.52C270.4 5.249 278.7 0 287.9 0L287.9 0zM287.9 78.95L235.4 187.2C231.9 194.3 225.1 199.3 217.3 200.5L98.98 217.9L184.9 303C190.4 308.5 192.9 316.4 191.6 324.1L171.4 443.7L276.6 387.5C283.7 383.7 292.2 383.7 299.2 387.5L404.4 443.7L384.2 324.1C382.9 316.4 385.5 308.5 391 303L476.9 217.9L358.6 200.5C350.7 199.3 343.9 194.3 340.5 187.2L287.9 78.95z"],"star-half":[576,512,[61731],"f089","M293.3 .6123C304.2 3.118 311.9 12.82 311.9 24V408.7C311.9 417.5 307.1 425.7 299.2 429.8L150.1 509.1C142.9 513.4 133.1 512.7 125.6 507.4C118.2 502.1 114.5 492.1 115.1 483.9L142.2 328.4L31.11 218.3C24.65 211.9 22.36 202.4 25.2 193.7C28.03 185.1 35.5 178.8 44.49 177.5L197.7 154.8L266.3 13.52C271.2 3.46 282.4-1.893 293.3 .6127L293.3 .6123zM263.9 128.4L235.4 187.2C231.9 194.3 225.1 199.3 217.3 200.5L98.98 217.9L184.9 303C190.4 308.5 192.9 316.4 191.6 324.1L171.4 443.7L263.9 394.3L263.9 128.4z"],"star-half-stroke":[576,512,["star-half-alt"],"f5c0","M378.1 154.8L531.4 177.5C540.4 178.8 547.8 185.1 550.7 193.7C553.5 202.4 551.2 211.9 544.8 218.2L433.6 328.4L459.9 483.9C461.4 492.9 457.7 502.1 450.2 507.4C442.8 512.7 432.1 513.4 424.9 509.1L287.9 435.9L150.1 509.1C142.9 513.4 133.1 512.7 125.6 507.4C118.2 502.1 114.5 492.9 115.1 483.9L142.2 328.4L31.11 218.2C24.65 211.9 22.36 202.4 25.2 193.7C28.03 185.1 35.5 178.8 44.49 177.5L197.7 154.8L266.3 13.52C270.4 5.249 278.7 0 287.9 0C297.1 0 305.5 5.25 309.5 13.52L378.1 154.8zM287.1 384.7C291.9 384.7 295.7 385.6 299.2 387.5L404.4 443.7L384.2 324.1C382.9 316.4 385.5 308.5 391 303L476.9 217.9L358.6 200.5C350.7 199.3 343.9 194.3 340.5 187.2L287.1 79.09L287.1 384.7z"],sun:[512,512,[9728],"f185","M505.2 324.8l-47.73-68.78l47.75-68.81c7.359-10.62 8.797-24.12 3.844-36.06c-4.969-11.94-15.52-20.44-28.22-22.72l-82.39-14.88l-14.89-82.41c-2.281-12.72-10.76-23.25-22.69-28.22c-11.97-4.936-25.42-3.498-36.12 3.844L256 54.49L187.2 6.709C176.5-.6016 163.1-2.039 151.1 2.896c-11.92 4.971-20.4 15.5-22.7 28.19l-14.89 82.44L31.15 128.4C18.42 130.7 7.854 139.2 2.9 151.2C-2.051 163.1-.5996 176.6 6.775 187.2l47.73 68.78l-47.75 68.81c-7.359 10.62-8.795 24.12-3.844 36.06c4.969 11.94 15.52 20.44 28.22 22.72l82.39 14.88l14.89 82.41c2.297 12.72 10.78 23.25 22.7 28.22c11.95 4.906 25.44 3.531 36.09-3.844L256 457.5l68.83 47.78C331.3 509.7 338.8 512 346.3 512c4.906 0 9.859-.9687 14.56-2.906c11.92-4.969 20.4-15.5 22.7-28.19l14.89-82.44l82.37-14.88c12.73-2.281 23.3-10.78 28.25-22.75C514.1 348.9 512.6 335.4 505.2 324.8zM456.8 339.2l-99.61 18l-18 99.63L256 399.1L172.8 456.8l-18-99.63l-99.61-18L112.9 255.1L55.23 172.8l99.61-18l18-99.63L256 112.9l83.15-57.75l18.02 99.66l99.61 18L399.1 255.1L456.8 339.2zM256 143.1c-61.85 0-111.1 50.14-111.1 111.1c0 61.85 50.15 111.1 111.1 111.1s111.1-50.14 111.1-111.1C367.1 194.1 317.8 143.1 256 143.1zM256 319.1c-35.28 0-63.99-28.71-63.99-63.99S220.7 192 256 192s63.99 28.71 63.99 63.1S291.3 319.1 256 319.1z"],"thumbs-down":[512,512,[61576,128078],"f165","M128 288V64.03c0-17.67-14.33-31.1-32-31.1H32c-17.67 0-32 14.33-32 31.1v223.1c0 17.67 14.33 31.1 32 31.1h64C113.7 320 128 305.7 128 288zM481.5 229.1c1.234-5.092 1.875-10.32 1.875-15.64c0-22.7-11.44-43.13-29.28-55.28c.4219-3.015 .6406-6.076 .6406-9.122c0-22.32-11.06-42.6-28.83-54.83c-2.438-34.71-31.47-62.2-66.8-62.2h-52.53c-35.94 0-71.55 11.87-100.3 33.41L169.6 92.93c-6.285 4.71-9.596 11.85-9.596 19.13c0 12.76 10.29 24.04 24.03 24.04c5.013 0 10.07-1.565 14.38-4.811l36.66-27.51c20.48-15.34 45.88-23.81 71.5-23.81h52.53c10.45 0 18.97 8.497 18.97 18.95c0 3.5-1.11 4.94-1.11 9.456c0 26.97 29.77 17.91 29.77 40.64c0 9.254-6.392 10.96-6.392 22.25c0 13.97 10.85 21.95 19.58 23.59c8.953 1.671 15.45 9.481 15.45 18.56c0 13.04-11.39 13.37-11.39 28.91c0 12.54 9.702 23.08 22.36 23.94C456.2 266.1 464 275.2 464 284.1c0 10.43-8.516 18.93-18.97 18.93H307.4c-12.44 0-24 10.02-24 23.1c0 4.038 1.02 8.078 3.066 11.72C304.4 371.7 312 403.8 312 411.2c0 8.044-5.984 20.79-22.06 20.79c-12.53 0-14.27-.9059-24.94-28.07c-24.75-62.91-61.74-99.9-80.98-99.9c-13.8 0-24.02 11.27-24.02 23.99c0 7.041 3.083 14.02 9.016 18.76C238.1 402 211.4 480 289.9 480C333.8 480 360 445 360 411.2c0-12.7-5.328-35.21-14.83-59.33h99.86C481.1 351.9 512 321.9 512 284.1C512 261.8 499.9 241 481.5 229.1z"],"thumbs-up":[512,512,[61575,128077],"f164","M96 191.1H32c-17.67 0-32 14.33-32 31.1v223.1c0 17.67 14.33 31.1 32 31.1h64c17.67 0 32-14.33 32-31.1V223.1C128 206.3 113.7 191.1 96 191.1zM512 227c0-36.89-30.05-66.92-66.97-66.92h-99.86C354.7 135.1 360 113.5 360 100.8c0-33.8-26.2-68.78-70.06-68.78c-46.61 0-59.36 32.44-69.61 58.5c-31.66 80.5-60.33 66.39-60.33 93.47c0 12.84 10.36 23.99 24.02 23.99c5.256 0 10.55-1.721 14.97-5.26c76.76-61.37 57.97-122.7 90.95-122.7c16.08 0 22.06 12.75 22.06 20.79c0 7.404-7.594 39.55-25.55 71.59c-2.046 3.646-3.066 7.686-3.066 11.72c0 13.92 11.43 23.1 24 23.1h137.6C455.5 208.1 464 216.6 464 227c0 9.809-7.766 18.03-17.67 18.71c-12.66 .8593-22.36 11.4-22.36 23.94c0 15.47 11.39 15.95 11.39 28.91c0 25.37-35.03 12.34-35.03 42.15c0 11.22 6.392 13.03 6.392 22.25c0 22.66-29.77 13.76-29.77 40.64c0 4.515 1.11 5.961 1.11 9.456c0 10.45-8.516 18.95-18.97 18.95h-52.53c-25.62 0-51.02-8.466-71.5-23.81l-36.66-27.51c-4.315-3.245-9.37-4.811-14.38-4.811c-13.85 0-24.03 11.38-24.03 24.04c0 7.287 3.312 14.42 9.596 19.13l36.67 27.52C235 468.1 270.6 480 306.6 480h52.53c35.33 0 64.36-27.49 66.8-62.2c17.77-12.23 28.83-32.51 28.83-54.83c0-3.046-.2187-6.107-.6406-9.122c17.84-12.15 29.28-32.58 29.28-55.28c0-5.311-.6406-10.54-1.875-15.64C499.9 270.1 512 250.2 512 227z"],"trash-can":[448,512,[61460,"trash-alt"],"f2ed","M160 400C160 408.8 152.8 416 144 416C135.2 416 128 408.8 128 400V192C128 183.2 135.2 176 144 176C152.8 176 160 183.2 160 192V400zM240 400C240 408.8 232.8 416 224 416C215.2 416 208 408.8 208 400V192C208 183.2 215.2 176 224 176C232.8 176 240 183.2 240 192V400zM320 400C320 408.8 312.8 416 304 416C295.2 416 288 408.8 288 400V192C288 183.2 295.2 176 304 176C312.8 176 320 183.2 320 192V400zM317.5 24.94L354.2 80H424C437.3 80 448 90.75 448 104C448 117.3 437.3 128 424 128H416V432C416 476.2 380.2 512 336 512H112C67.82 512 32 476.2 32 432V128H24C10.75 128 0 117.3 0 104C0 90.75 10.75 80 24 80H93.82L130.5 24.94C140.9 9.357 158.4 0 177.1 0H270.9C289.6 0 307.1 9.358 317.5 24.94H317.5zM151.5 80H296.5L277.5 51.56C276 49.34 273.5 48 270.9 48H177.1C174.5 48 171.1 49.34 170.5 51.56L151.5 80zM80 432C80 449.7 94.33 464 112 464H336C353.7 464 368 449.7 368 432V128H80V432z"],user:[448,512,[62144,128100],"f007","M272 304h-96C78.8 304 0 382.8 0 480c0 17.67 14.33 32 32 32h384c17.67 0 32-14.33 32-32C448 382.8 369.2 304 272 304zM48.99 464C56.89 400.9 110.8 352 176 352h96c65.16 0 119.1 48.95 127 112H48.99zM224 256c70.69 0 128-57.31 128-128c0-70.69-57.31-128-128-128S96 57.31 96 128C96 198.7 153.3 256 224 256zM224 48c44.11 0 80 35.89 80 80c0 44.11-35.89 80-80 80S144 172.1 144 128C144 83.89 179.9 48 224 48z"],"window-maximize":[512,512,[128470],"f2d0","M7.724 65.49C13.36 55.11 21.79 46.47 32 40.56C39.63 36.15 48.25 33.26 57.46 32.33C59.61 32.11 61.79 32 64 32H448C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 93.79 .112 91.61 .3306 89.46C1.204 80.85 3.784 72.75 7.724 65.49V65.49zM48 416C48 424.8 55.16 432 64 432H448C456.8 432 464 424.8 464 416V224H48V416z"],"window-minimize":[512,512,[128469],"f2d1","M0 456C0 442.7 10.75 432 24 432H488C501.3 432 512 442.7 512 456C512 469.3 501.3 480 488 480H24C10.75 480 0 469.3 0 456z"],"window-restore":[512,512,[],"f2d2","M432 48H208C190.3 48 176 62.33 176 80V96H128V80C128 35.82 163.8 0 208 0H432C476.2 0 512 35.82 512 80V304C512 348.2 476.2 384 432 384H416V336H432C449.7 336 464 321.7 464 304V80C464 62.33 449.7 48 432 48zM320 128C355.3 128 384 156.7 384 192V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V192C0 156.7 28.65 128 64 128H320zM64 464H320C328.8 464 336 456.8 336 448V256H48V448C48 456.8 55.16 464 64 464z"]};!function(C){try{for(var c=arguments.length,z=new Array(1<c?c-1:0),l=1;l<c;l++)z[l-1]=arguments[l];C.apply(void 0,z)}catch(C){if(!H)throw C}}((function(){i("far",o),i("fa-regular",o)}))}(),function(){"use strict";var C={},c={};try{"undefined"!=typeof window&&(C=window),"undefined"!=typeof document&&(c=document)}catch(C){}var z=void 0===(s=(C.navigator||{}).userAgent)?"":s,l=C,e=c;function a(C,c){var z,l=Object.keys(C);return Object.getOwnPropertySymbols&&(z=Object.getOwnPropertySymbols(C),c&&(z=z.filter((function(c){return Object.getOwnPropertyDescriptor(C,c).enumerable}))),l.push.apply(l,z)),l}function M(C){for(var c=1;c<arguments.length;c++){var z=null!=arguments[c]?arguments[c]:{};c%2?a(Object(z),!0).forEach((function(c){var l,e;l=C,c=z[e=c],e in l?Object.defineProperty(l,e,{value:c,enumerable:!0,configurable:!0,writable:!0}):l[e]=c})):Object.getOwnPropertyDescriptors?Object.defineProperties(C,Object.getOwnPropertyDescriptors(z)):a(Object(z)).forEach((function(c){Object.defineProperty(C,c,Object.getOwnPropertyDescriptor(z,c))}))}return C}function L(C,c){(null==c||c>C.length)&&(c=C.length);for(var z=0,l=new Array(c);z<c;z++)l[z]=C[z];return l}l.document,e.documentElement&&e.head&&"function"==typeof e.addEventListener&&e.createElement,~z.indexOf("MSIE")||z.indexOf("Trident/");var V="___FONT_AWESOME___",H=function(){try{return!0}catch(C){return!1}}(),t=[1,2,3,4,5,6,7,8,9,10],r=t.concat([11,12,13,14,15,16,17,18,19,20]),s="duotone-group";C="swap-opacity",c="primary",e="secondary",[].concat(function(C){if(Array.isArray(C))return L(C)}(z=Object.keys({solid:"fas",regular:"far",light:"fal",thin:"fat",duotone:"fad",brands:"fab",kit:"fak"}))||function(C){if("undefined"!=typeof Symbol&&null!=C[Symbol.iterator]||null!=C["@@iterator"])return Array.from(C)}(z)||function(C,c){if(C){if("string"==typeof C)return L(C,c);var z=Object.prototype.toString.call(C).slice(8,-1);return"Map"===(z="Object"===z&&C.constructor?C.constructor.name:z)||"Set"===z?Array.from(C):"Arguments"===z||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(z)?L(C,c):void 0}}(z)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}(),["2xs","xs","sm","lg","xl","2xl","beat","border","fade","beat-fade","bounce","flip-both","flip-horizontal","flip-vertical","flip","fw","inverse","layers-counter","layers-text","layers","li","pull-left","pull-right","pulse","rotate-180","rotate-270","rotate-90","rotate-by","shake","spin-pulse","spin-reverse","spin","stack-1x","stack-2x","stack","ul",s,C,c,e]).concat(t.map((function(C){return"".concat(C,"x")}))).concat(r.map((function(C){return"w-".concat(C)}))),(l=l||{})[V]||(l[V]={}),l[V].styles||(l[V].styles={}),l[V].hooks||(l[V].hooks={}),l[V].shims||(l[V].shims=[]);var h=l[V];function n(C){return Object.keys(C).reduce((function(c,z){var l=C[z];return l.icon?c[l.iconName]=l.icon:c[z]=l,c}),{})}function i(C,c,z){z=void 0!==(l=(2<arguments.length&&void 0!==z?z:{}).skipHooks)&&l;var l=n(c);"function"!=typeof h.hooks.addPack||z?h.styles[C]=M(M({},h.styles[C]||{}),l):h.hooks.addPack(C,n(c)),"fas"===C&&i("fa",c)}var o={0:[320,512,[],"30","M160 32.01c-88.37 0-160 71.63-160 160v127.1c0 88.37 71.63 160 160 160s160-71.63 160-160V192C320 103.6 248.4 32.01 160 32.01zM256 320c0 52.93-43.06 96-96 96c-52.93 0-96-43.07-96-96V192c0-52.94 43.07-96 96-96c52.94 0 96 43.06 96 96V320z"],1:[256,512,[],"31","M256 448c0 17.67-14.33 32-32 32H32c-17.67 0-32-14.33-32-32s14.33-32 32-32h64V123.8L49.75 154.6C35.02 164.5 15.19 160.4 5.375 145.8C-4.422 131.1-.4531 111.2 14.25 101.4l96-64c9.828-6.547 22.45-7.187 32.84-1.594C153.5 41.37 160 52.22 160 64.01v352h64C241.7 416 256 430.3 256 448z"],2:[320,512,[],"32","M320 448c0 17.67-14.33 32-32 32H32c-13.08 0-24.83-7.953-29.7-20.09c-4.859-12.12-1.859-26 7.594-35.03l193.6-185.1c31.36-30.17 33.95-80 5.812-113.4c-14.91-17.69-35.86-28.12-58.97-29.38C127.4 95.83 105.3 103.9 88.53 119.9L53.52 151.7c-13.08 11.91-33.33 10.89-45.2-2.172C-3.563 136.5-2.594 116.2 10.48 104.3l34.45-31.3c28.67-27.34 68.39-42.11 108.9-39.88c40.33 2.188 78.39 21.16 104.4 52.03c49.8 59.05 45.2 147.3-10.45 200.8l-136 130H288C305.7 416 320 430.3 320 448z"],3:[320,512,[],"33","M320 344c0 74.98-61.02 136-136 136H103.6c-46.34 0-87.31-29.53-101.1-73.48c-5.594-16.77 3.484-34.88 20.25-40.47c16.75-5.609 34.89 3.484 40.47 20.25c5.922 17.77 22.48 29.7 41.23 29.7H184c39.7 0 72-32.3 72-72s-32.3-72-72-72H80c-13.2 0-25.05-8.094-29.83-20.41C45.39 239.3 48.66 225.3 58.38 216.4l131.4-120.4H32c-17.67 0-32-14.33-32-32s14.33-32 32-32h240c13.2 0 25.05 8.094 29.83 20.41c4.781 12.3 1.516 26.27-8.203 35.19l-131.4 120.4H184C258.1 208 320 269 320 344z"],4:[384,512,[],"34","M384 334.2c0 17.67-14.33 32-32 32h-32v81.78c0 17.67-14.33 32-32 32s-32-14.33-32-32v-81.78H32c-10.97 0-21.17-5.625-27.05-14.89c-5.859-9.266-6.562-20.89-1.875-30.81l128-270.2C138.6 34.33 157.8 27.56 173.7 35.09c15.97 7.562 22.78 26.66 15.22 42.63L82.56 302.2H256V160c0-17.67 14.33-32 32-32s32 14.33 32 32v142.2h32C369.7 302.2 384 316.6 384 334.2z"],5:[320,512,[],"35","M320 344.6c0 74.66-60.73 135.4-135.4 135.4H104.7c-46.81 0-88.22-29.83-103-74.23c-5.594-16.77 3.469-34.89 20.23-40.48c16.83-5.625 34.91 3.469 40.48 20.23c6.078 18.23 23.08 30.48 42.3 30.48h79.95c39.36 0 71.39-32.03 71.39-71.39s-32.03-71.38-71.39-71.38H32c-9.484 0-18.47-4.203-24.56-11.48C1.359 254.5-1.172 244.9 .5156 235.6l32-177.2C35.27 43.09 48.52 32.01 64 32.01l192 .0049c17.67 0 32 14.33 32 32s-14.33 32-32 32H90.73L70.3 209.2h114.3C259.3 209.2 320 269.1 320 344.6z"],6:[320,512,[],"36","M167.7 160.8l64.65-76.06c11.47-13.45 9.812-33.66-3.656-45.09C222.7 34.51 215.3 32.01 208 32.01c-9.062 0-18.06 3.833-24.38 11.29C38.07 214.5 0 245.5 0 320c0 88.22 71.78 160 160 160s160-71.78 160-160C320 234.4 252.3 164.9 167.7 160.8zM160 416c-52.94 0-96-43.06-96-96s43.06-95.1 96-95.1s96 43.06 96 95.1S212.9 416 160 416z"],7:[320,512,[],"37","M315.6 80.14l-224 384c-5.953 10.19-16.66 15.88-27.67 15.88c-5.469 0-11.02-1.406-16.09-4.359c-15.27-8.906-20.42-28.5-11.52-43.77l195.9-335.9H32c-17.67 0-32-14.33-32-32s14.33-32 32-32h256c11.45 0 22.05 6.125 27.75 16.06S321.4 70.23 315.6 80.14z"],8:[320,512,[],"38","M267.5 249.2C290 226.1 304 194.7 304 160c0-70.58-57.42-128-128-128h-32c-70.58 0-128 57.42-128 128c0 34.7 13.99 66.12 36.48 89.19C20.83 272.5 0 309.8 0 352c0 70.58 57.42 128 128 128h64c70.58 0 128-57.42 128-128C320 309.8 299.2 272.5 267.5 249.2zM144 96.01h32c35.3 0 64 28.7 64 64s-28.7 64-64 64h-32c-35.3 0-64-28.7-64-64S108.7 96.01 144 96.01zM192 416H128c-35.3 0-64-28.7-64-64s28.7-64 64-64h64c35.3 0 64 28.7 64 64S227.3 416 192 416z"],9:[320,512,[],"39","M160 32.01c-88.22 0-160 71.78-160 160c0 85.57 67.71 155.1 152.3 159.2l-64.65 76.06c-11.47 13.45-9.812 33.66 3.656 45.09c6 5.125 13.38 7.62 20.72 7.62c9.062 0 18.06-3.823 24.38-11.28C281.9 297.5 320 266.6 320 192C320 103.8 248.2 32.01 160 32.01zM160 288c-52.94 0-96-43.06-96-95.1s43.06-96 96-96s96 43.06 96 96S212.9 288 160 288z"],a:[384,512,[97],"41","M381.5 435.7l-160-384C216.6 39.78 204.9 32.01 192 32.01S167.4 39.78 162.5 51.7l-160 384c-6.797 16.31 .9062 35.05 17.22 41.84c16.38 6.828 35.08-.9219 41.84-17.22l31.8-76.31h197.3l31.8 76.31c5.109 12.28 17.02 19.7 29.55 19.7c4.094 0 8.266-.7969 12.3-2.484C380.6 470.7 388.3 452 381.5 435.7zM119.1 320L192 147.2l72 172.8H119.1z"],"address-book":[512,512,[62138,"contact-book"],"f2b9","M384 0H96C60.65 0 32 28.65 32 64v384c0 35.35 28.65 64 64 64h288c35.35 0 64-28.65 64-64V64C448 28.65 419.3 0 384 0zM240 128c35.35 0 64 28.65 64 64s-28.65 64-64 64c-35.34 0-64-28.65-64-64S204.7 128 240 128zM336 384h-192C135.2 384 128 376.8 128 368C128 323.8 163.8 288 208 288h64c44.18 0 80 35.82 80 80C352 376.8 344.8 384 336 384zM496 64H480v96h16C504.8 160 512 152.8 512 144v-64C512 71.16 504.8 64 496 64zM496 192H480v96h16C504.8 288 512 280.8 512 272v-64C512 199.2 504.8 192 496 192zM496 320H480v96h16c8.836 0 16-7.164 16-16v-64C512 327.2 504.8 320 496 320z"],"address-card":[576,512,[62140,"contact-card","vcard"],"f2bb","M512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM176 128c35.35 0 64 28.65 64 64s-28.65 64-64 64s-64-28.65-64-64S140.7 128 176 128zM272 384h-192C71.16 384 64 376.8 64 368C64 323.8 99.82 288 144 288h64c44.18 0 80 35.82 80 80C288 376.8 280.8 384 272 384zM496 320h-128C359.2 320 352 312.8 352 304S359.2 288 368 288h128C504.8 288 512 295.2 512 304S504.8 320 496 320zM496 256h-128C359.2 256 352 248.8 352 240S359.2 224 368 224h128C504.8 224 512 231.2 512 240S504.8 256 496 256zM496 192h-128C359.2 192 352 184.8 352 176S359.2 160 368 160h128C504.8 160 512 167.2 512 176S504.8 192 496 192z"],"align-center":[448,512,[],"f037","M320 96H128C110.3 96 96 81.67 96 64C96 46.33 110.3 32 128 32H320C337.7 32 352 46.33 352 64C352 81.67 337.7 96 320 96zM416 224H32C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H416C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224zM0 448C0 430.3 14.33 416 32 416H416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480H32C14.33 480 0 465.7 0 448zM320 352H128C110.3 352 96 337.7 96 320C96 302.3 110.3 288 128 288H320C337.7 288 352 302.3 352 320C352 337.7 337.7 352 320 352z"],"align-justify":[448,512,[],"f039","M416 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96zM416 352H32C14.33 352 0 337.7 0 320C0 302.3 14.33 288 32 288H416C433.7 288 448 302.3 448 320C448 337.7 433.7 352 416 352zM0 192C0 174.3 14.33 160 32 160H416C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224H32C14.33 224 0 209.7 0 192zM416 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480z"],"align-left":[448,512,[],"f036","M256 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H256C273.7 32 288 46.33 288 64C288 81.67 273.7 96 256 96zM256 352H32C14.33 352 0 337.7 0 320C0 302.3 14.33 288 32 288H256C273.7 288 288 302.3 288 320C288 337.7 273.7 352 256 352zM0 192C0 174.3 14.33 160 32 160H416C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224H32C14.33 224 0 209.7 0 192zM416 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480z"],"align-right":[448,512,[],"f038","M416 96H192C174.3 96 160 81.67 160 64C160 46.33 174.3 32 192 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96zM416 352H192C174.3 352 160 337.7 160 320C160 302.3 174.3 288 192 288H416C433.7 288 448 302.3 448 320C448 337.7 433.7 352 416 352zM0 192C0 174.3 14.33 160 32 160H416C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224H32C14.33 224 0 209.7 0 192zM416 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480z"],anchor:[576,512,[9875],"f13d","M352 176C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H320V448H368C421 448 464 405 464 352V345.9L456.1 352.1C447.6 362.3 432.4 362.3 423 352.1C413.7 343.6 413.7 328.4 423 319L479 263C488.4 253.7 503.6 253.7 512.1 263L568.1 319C578.3 328.4 578.3 343.6 568.1 352.1C559.6 362.3 544.4 362.3 535 352.1L528 345.9V352C528 440.4 456.4 512 368 512H208C119.6 512 48 440.4 48 352V345.9L40.97 352.1C31.6 362.3 16.4 362.3 7.029 352.1C-2.343 343.6-2.343 328.4 7.029 319L63.03 263C72.4 253.7 87.6 253.7 96.97 263L152.1 319C162.3 328.4 162.3 343.6 152.1 352.1C143.6 362.3 128.4 362.3 119 352.1L112 345.9V352C112 405 154.1 448 208 448H256V240H224C206.3 240 192 225.7 192 208C192 190.3 206.3 176 224 176H234.9C209 158.8 192 129.4 192 96C192 42.98 234.1 0 288 0C341 0 384 42.98 384 96C384 129.4 366.1 158.8 341.1 176H352zM288 128C305.7 128 320 113.7 320 96C320 78.33 305.7 64 288 64C270.3 64 256 78.33 256 96C256 113.7 270.3 128 288 128z"],"anchor-circle-check":[640,512,[],"e4aa","M352 176C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H319.1V448H339.2C351.8 472.7 370 493.1 392.2 510.2C384.3 511.4 376.2 512 368 512H208C119.6 512 48 440.4 48 352V345.9L40.97 352.1C31.6 362.3 16.4 362.3 7.029 352.1C-2.343 343.6-2.343 328.4 7.029 319L63.03 263C72.4 253.7 87.6 253.7 96.97 263L152.1 319C162.3 328.4 162.3 343.6 152.1 352.1C143.6 362.3 128.4 362.3 119 352.1L112 345.9V352C112 405 154.1 448 208 448H256V240H224C206.3 240 192 225.7 192 208C192 190.3 206.3 176 224 176H234.9C209 158.8 192 129.4 192 96C192 42.98 234.1 0 288 0C341 0 384 42.98 384 96C384 129.4 366.1 158.8 341.1 176H352zM287.1 128C305.7 128 319.1 113.7 319.1 96C319.1 78.33 305.7 64 287.1 64C270.3 64 255.1 78.33 255.1 96C255.1 113.7 270.3 128 287.1 128zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"anchor-circle-exclamation":[640,512,[],"e4ab","M352 176C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H319.1V448H339.2C351.8 472.7 370 493.1 392.2 510.2C384.3 511.4 376.2 512 368 512H208C119.6 512 48 440.4 48 352V345.9L40.97 352.1C31.6 362.3 16.4 362.3 7.029 352.1C-2.343 343.6-2.343 328.4 7.029 319L63.03 263C72.4 253.7 87.6 253.7 96.97 263L152.1 319C162.3 328.4 162.3 343.6 152.1 352.1C143.6 362.3 128.4 362.3 119 352.1L112 345.9V352C112 405 154.1 448 208 448H256V240H224C206.3 240 192 225.7 192 208C192 190.3 206.3 176 224 176H234.9C209 158.8 192 129.4 192 96C192 42.98 234.1 0 288 0C341 0 384 42.98 384 96C384 129.4 366.1 158.8 341.1 176H352zM287.1 128C305.7 128 319.1 113.7 319.1 96C319.1 78.33 305.7 64 287.1 64C270.3 64 255.1 78.33 255.1 96C255.1 113.7 270.3 128 287.1 128zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"anchor-circle-xmark":[640,512,[],"e4ac","M352 176C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H319.1V448H339.2C351.8 472.7 370 493.1 392.2 510.2C384.3 511.4 376.2 512 368 512H208C119.6 512 48 440.4 48 352V345.9L40.97 352.1C31.6 362.3 16.4 362.3 7.029 352.1C-2.343 343.6-2.343 328.4 7.029 319L63.03 263C72.4 253.7 87.6 253.7 96.97 263L152.1 319C162.3 328.4 162.3 343.6 152.1 352.1C143.6 362.3 128.4 362.3 119 352.1L112 345.9V352C112 405 154.1 448 208 448H256V240H224C206.3 240 192 225.7 192 208C192 190.3 206.3 176 224 176H234.9C209 158.8 192 129.4 192 96C192 42.98 234.1 0 288 0C341 0 384 42.98 384 96C384 129.4 366.1 158.8 341.1 176H352zM287.1 128C305.7 128 319.1 113.7 319.1 96C319.1 78.33 305.7 64 287.1 64C270.3 64 255.1 78.33 255.1 96C255.1 113.7 270.3 128 287.1 128zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"anchor-lock":[640,512,[],"e4ad","M352 176C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H319.1V448H368C373.4 448 378.8 447.5 384 446.7V480C384 490.1 386.7 501.3 391.6 510.3C383.9 511.4 376 512 368 512H208C119.6 512 48 440.4 48 352V345.9L40.97 352.1C31.6 362.3 16.4 362.3 7.029 352.1C-2.343 343.6-2.343 328.4 7.029 319L63.03 263C72.4 253.7 87.6 253.7 96.97 263L152.1 319C162.3 328.4 162.3 343.6 152.1 352.1C143.6 362.3 128.4 362.3 119 352.1L112 345.9V352C112 405 154.1 448 208 448H256V240H224C206.3 240 192 225.7 192 208C192 190.3 206.3 176 224 176H234.9C209 158.8 192 129.4 192 96C192 42.98 234.1 0 288 0C341 0 384 42.98 384 96C384 129.4 366.1 158.8 341.1 176H352zM287.1 128C305.7 128 319.1 113.7 319.1 96C319.1 78.33 305.7 64 287.1 64C270.3 64 255.1 78.33 255.1 96C255.1 113.7 270.3 128 287.1 128zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"angle-down":[384,512,[8964],"f107","M192 384c-8.188 0-16.38-3.125-22.62-9.375l-160-160c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L192 306.8l137.4-137.4c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25l-160 160C208.4 380.9 200.2 384 192 384z"],"angle-left":[256,512,[8249],"f104","M192 448c-8.188 0-16.38-3.125-22.62-9.375l-160-160c-12.5-12.5-12.5-32.75 0-45.25l160-160c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L77.25 256l137.4 137.4c12.5 12.5 12.5 32.75 0 45.25C208.4 444.9 200.2 448 192 448z"],"angle-right":[256,512,[8250],"f105","M64 448c-8.188 0-16.38-3.125-22.62-9.375c-12.5-12.5-12.5-32.75 0-45.25L178.8 256L41.38 118.6c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l160 160c12.5 12.5 12.5 32.75 0 45.25l-160 160C80.38 444.9 72.19 448 64 448z"],"angle-up":[384,512,[8963],"f106","M352 352c-8.188 0-16.38-3.125-22.62-9.375L192 205.3l-137.4 137.4c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l160-160c12.5-12.5 32.75-12.5 45.25 0l160 160c12.5 12.5 12.5 32.75 0 45.25C368.4 348.9 360.2 352 352 352z"],"angles-down":[384,512,["angle-double-down"],"f103","M169.4 278.6C175.6 284.9 183.8 288 192 288s16.38-3.125 22.62-9.375l160-160c12.5-12.5 12.5-32.75 0-45.25s-32.75-12.5-45.25 0L192 210.8L54.63 73.38c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25L169.4 278.6zM329.4 265.4L192 402.8L54.63 265.4c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25l160 160C175.6 476.9 183.8 480 192 480s16.38-3.125 22.62-9.375l160-160c12.5-12.5 12.5-32.75 0-45.25S341.9 252.9 329.4 265.4z"],"angles-left":[448,512,[171,"angle-double-left"],"f100","M77.25 256l137.4-137.4c12.5-12.5 12.5-32.75 0-45.25s-32.75-12.5-45.25 0l-160 160c-12.5 12.5-12.5 32.75 0 45.25l160 160C175.6 444.9 183.8 448 192 448s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25L77.25 256zM269.3 256l137.4-137.4c12.5-12.5 12.5-32.75 0-45.25s-32.75-12.5-45.25 0l-160 160c-12.5 12.5-12.5 32.75 0 45.25l160 160C367.6 444.9 375.8 448 384 448s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25L269.3 256z"],"angles-right":[448,512,[187,"angle-double-right"],"f101","M246.6 233.4l-160-160c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25L178.8 256l-137.4 137.4c-12.5 12.5-12.5 32.75 0 45.25C47.63 444.9 55.81 448 64 448s16.38-3.125 22.62-9.375l160-160C259.1 266.1 259.1 245.9 246.6 233.4zM438.6 233.4l-160-160c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25L370.8 256l-137.4 137.4c-12.5 12.5-12.5 32.75 0 45.25C239.6 444.9 247.8 448 256 448s16.38-3.125 22.62-9.375l160-160C451.1 266.1 451.1 245.9 438.6 233.4z"],"angles-up":[384,512,["angle-double-up"],"f102","M54.63 246.6L192 109.3l137.4 137.4C335.6 252.9 343.8 256 352 256s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25l-160-160c-12.5-12.5-32.75-12.5-45.25 0l-160 160c-12.5 12.5-12.5 32.75 0 45.25S42.13 259.1 54.63 246.6zM214.6 233.4c-12.5-12.5-32.75-12.5-45.25 0l-160 160c-12.5 12.5-12.5 32.75 0 45.25s32.75 12.5 45.25 0L192 301.3l137.4 137.4C335.6 444.9 343.8 448 352 448s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25L214.6 233.4z"],ankh:[320,512,[9765],"f644","M296 256h-44.63C272.5 222 288 181.6 288 144C288 55.62 230.8 0 160 0S32 55.62 32 144C32 181.6 47.5 222 68.63 256H24C10.75 256 0 266.8 0 280v32c0 13.25 10.75 24 24 24h96v152C120 501.2 130.8 512 144 512h32c13.25 0 24-10.75 24-24V336h96c13.25 0 24-10.75 24-24v-32C320 266.8 309.2 256 296 256zM160 80c29.62 0 48 24.5 48 64c0 34.62-27.12 78.12-48 100.9C139.1 222.1 112 178.6 112 144C112 104.5 130.4 80 160 80z"],"apple-whole":[448,512,[127823,127822,"apple-alt"],"f5d1","M336 128c-32 0-80.02 16.03-112 32.03c-32.01-16-79.1-32.02-111.1-32.03C32 128 .4134 210.5 .0033 288c-.5313 99.97 63.99 224 159.1 224c32 0 48-16 64-16c16 0 32 16 64 16c96 0 160.4-122.8 159.1-224C447.7 211.6 416 128 336 128zM320 32V0h-32C243.8 0 208 35.82 208 80v32h32C284.2 112 320 76.18 320 32z"],archway:[512,512,[],"f557","M480 32C497.7 32 512 46.33 512 64C512 81.67 497.7 96 480 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H480zM32 128H480V416C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H352V352C352 298.1 309 256 256 256C202.1 256 160 298.1 160 352V480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416V128z"],"arrow-down":[384,512,[8595],"f063","M374.6 310.6l-160 160C208.4 476.9 200.2 480 192 480s-16.38-3.125-22.62-9.375l-160-160c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L160 370.8V64c0-17.69 14.33-31.1 31.1-31.1S224 46.31 224 64v306.8l105.4-105.4c12.5-12.5 32.75-12.5 45.25 0S387.1 298.1 374.6 310.6z"],"arrow-down-1-9":[512,512,["sort-numeric-asc","sort-numeric-down"],"f162","M320 192c0 17.69 14.31 31.1 32 31.1L416 224c17.69 0 32-14.31 32-32s-14.31-32-32-32V63.98c0-11.19-5.844-21.53-15.38-27.34c-9.531-5.781-21.41-6.188-31.34-1.062l-32 16.59c-15.69 8.125-21.81 27.44-13.69 43.13C329.3 106.3 340.4 112.6 352 112.6V160C334.3 160 320 174.3 320 192zM392 255.6c-48.6 0-88 39.4-88 88c0 36.44 22.15 67.7 53.71 81.07l-7.682 8.004c-10.72 11.16-10.34 28.88 .8125 39.56C356.3 477.4 363.3 480 370.2 480c7.344 0 14.72-2.875 20.19-8.625c69.61-72.53 89.6-85.39 89.6-127.8C480 294.1 440.6 255.6 392 255.6zM392 367.6c-13.23 0-24-10.77-24-24s10.77-24 24-24s24 10.77 24 24S405.2 367.6 392 367.6zM216 320.3c-8.672 0-17.3 3.5-23.61 10.38L160 366.1V64.03C160 46.33 145.7 32 128 32S96 46.33 96 64.03v302L63.6 330.7c-11.95-13.01-32.2-13.91-45.22-1.969c-13.03 11.95-13.9 32.22-1.969 45.27l87.1 96.09c12.12 13.26 35.06 13.26 47.19 0l87.1-96.09c11.94-13.05 11.06-33.31-1.969-45.27C231.5 323.1 223.7 320.3 216 320.3z"],"arrow-down-9-1":[512,512,["sort-numeric-desc","sort-numeric-down-alt"],"f886","M216 320.3c-8.672 0-17.3 3.5-23.61 10.38L160 366.1V64.03C160 46.33 145.7 32 128 32S96 46.33 96 64.03v302L63.6 330.7c-11.95-13.01-32.2-13.91-45.22-1.969c-13.03 11.95-13.9 32.22-1.969 45.27l87.1 96.09c12.12 13.26 35.06 13.26 47.19 0l87.1-96.09c11.94-13.05 11.06-33.31-1.969-45.27C231.5 323.1 223.7 320.3 216 320.3zM357.7 201.1l-7.682 8.004c-10.72 11.16-10.34 28.88 .8125 39.56c5.406 5.219 12.41 7.812 19.38 7.812c7.344 0 14.72-2.875 20.19-8.625c69.61-72.53 89.6-85.39 89.6-127.8c0-48.6-39.4-88-88-88s-88 39.4-88 88C303.1 156.4 326.1 187.7 357.7 201.1zM392 96c13.23 0 24 10.77 24 24S405.2 144 392 144S368 133.2 368 120S378.8 96 392 96zM416 416.4v-96.02c0-11.19-5.844-21.53-15.38-27.34c-9.531-5.781-21.41-6.188-31.34-1.062l-32 16.59c-15.69 8.125-21.81 27.44-13.69 43.13C329.3 362.8 340.4 369 352 369v47.41c-17.69 0-32 14.31-32 32s14.31 32 32 32h64c17.69 0 32-14.31 32-32S433.7 416.4 416 416.4z"],"arrow-down-a-z":[512,512,["sort-alpha-asc","sort-alpha-down"],"f15d","M239.6 373.1c11.94-13.05 11.06-33.31-1.969-45.27c-13.55-12.42-33.76-10.52-45.22 1.973L160 366.1V64.03c0-17.7-14.33-32.03-32-32.03S96 46.33 96 64.03v302l-32.4-35.39C51.64 317.7 31.39 316.7 18.38 328.7c-13.03 11.95-13.9 32.22-1.969 45.27l87.1 96.09c12.12 13.26 35.06 13.26 47.19 0L239.6 373.1zM448 416h-50.75l73.38-73.38c9.156-9.156 11.89-22.91 6.938-34.88S460.9 288 447.1 288H319.1C302.3 288 288 302.3 288 320s14.33 32 32 32h50.75l-73.38 73.38c-9.156 9.156-11.89 22.91-6.938 34.88S307.1 480 319.1 480h127.1C465.7 480 480 465.7 480 448S465.7 416 448 416zM492.6 209.3l-79.99-160.1c-10.84-21.81-46.4-21.81-57.24 0L275.4 209.3c-7.906 15.91-1.5 35.24 14.31 43.19c15.87 7.922 35.04 1.477 42.93-14.4l7.154-14.39h88.43l7.154 14.39c6.174 12.43 23.97 23.87 42.93 14.4C494.1 244.6 500.5 225.2 492.6 209.3zM367.8 167.4L384 134.7l16.22 32.63H367.8z"],"arrow-down-long":[320,512,["long-arrow-down"],"f175","M9.375 329.4c12.51-12.51 32.76-12.49 45.25 0L128 402.8V32c0-17.69 14.31-32 32-32s32 14.31 32 32v370.8l73.38-73.38c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25l-128 128c-12.5 12.5-32.75 12.5-45.25 0l-128-128C-3.125 362.1-3.125 341.9 9.375 329.4z"],"arrow-down-short-wide":[576,512,["sort-amount-desc","sort-amount-down-alt"],"f884","M320 224H416c17.67 0 32-14.33 32-32s-14.33-32-32-32h-95.1c-17.67 0-32 14.33-32 32S302.3 224 320 224zM320 352H480c17.67 0 32-14.33 32-32s-14.33-32-32-32h-159.1c-17.67 0-32 14.33-32 32S302.3 352 320 352zM320 96h32c17.67 0 31.1-14.33 31.1-32s-14.33-32-31.1-32h-32c-17.67 0-32 14.33-32 32S302.3 96 320 96zM544 416h-223.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H544c17.67 0 32-14.33 32-32S561.7 416 544 416zM192.4 330.7L160 366.1V64.03C160 46.33 145.7 32 128 32S96 46.33 96 64.03v302L63.6 330.7c-6.312-6.883-14.94-10.38-23.61-10.38c-7.719 0-15.47 2.781-21.61 8.414c-13.03 11.95-13.9 32.22-1.969 45.27l87.1 96.09c12.12 13.26 35.06 13.26 47.19 0l87.1-96.09c11.94-13.05 11.06-33.31-1.969-45.27C224.6 316.8 204.4 317.7 192.4 330.7z"],"arrow-down-up-across-line":[576,512,[],"e4af","M41.37 406.6C28.88 394.1 28.88 373.9 41.37 361.4C53.87 348.9 74.13 348.9 86.63 361.4L128 402.7V287.1H32C14.33 287.1 0 273.7 0 255.1C0 238.3 14.33 223.1 32 223.1H384V109.3L342.6 150.6C330.1 163.1 309.9 163.1 297.4 150.6C284.9 138.1 284.9 117.9 297.4 105.4L393.4 9.372C405.9-3.124 426.1-3.124 438.6 9.372L534.6 105.4C547.1 117.9 547.1 138.1 534.6 150.6C522.1 163.1 501.9 163.1 489.4 150.6L448 109.3V223.1H544C561.7 223.1 576 238.3 576 255.1C576 273.7 561.7 287.1 544 287.1H192V402.7L233.4 361.4C245.9 348.9 266.1 348.9 278.6 361.4C291.1 373.9 291.1 394.1 278.6 406.6L182.6 502.6C170.1 515.1 149.9 515.1 137.4 502.6L41.37 406.6zM128 63.1C128 46.33 142.3 31.1 160 31.1C177.7 31.1 192 46.33 192 63.1V191.1H128V63.1zM448 319.1V448C448 465.7 433.7 480 416 480C398.3 480 384 465.7 384 448V319.1H448z"],"arrow-down-up-lock":[640,512,[],"e4b0","M105.4 502.6L9.373 406.6C-3.124 394.1-3.124 373.9 9.373 361.4C21.87 348.9 42.13 348.9 54.63 361.4L96 402.7V287.1H32C14.33 287.1 0 273.7 0 255.1C0 238.3 14.33 223.1 32 223.1H288V109.3L246.6 150.6C234.1 163.1 213.9 163.1 201.4 150.6C188.9 138.1 188.9 117.9 201.4 105.4L297.4 9.372C303.4 3.371 311.5 0 320 0C328.5 0 336.6 3.372 342.6 9.372L438.6 105.4C451.1 117.9 451.1 138.1 438.6 150.6C426.1 163.1 405.9 163.1 393.4 150.6L352 109.3V223.1H426.8C419.9 238.5 416 254.8 416 271.1V287.1H160V402.7L201.4 361.4C213.9 348.9 234.1 348.9 246.6 361.4C259.1 373.9 259.1 394.1 246.6 406.6L150.6 502.6C138.1 515.1 117.9 515.1 105.4 502.6H105.4zM96 191.1V63.1C96 46.33 110.3 31.1 128 31.1C145.7 31.1 160 46.33 160 63.1V191.1H96zM352 319.1V448C352 465.7 337.7 480 320 480C302.3 480 288 465.7 288 448V319.1H352zM528 191.1C572.2 191.1 608 227.8 608 271.1V319.1C625.7 319.1 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 319.1 448 319.1V271.1C448 227.8 483.8 191.1 528 191.1zM528 239.1C510.3 239.1 496 254.3 496 271.1V319.1H560V271.1C560 254.3 545.7 239.1 528 239.1z"],"arrow-down-wide-short":[576,512,["sort-amount-asc","sort-amount-down"],"f160","M416 288h-95.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H416c17.67 0 32-14.33 32-32S433.7 288 416 288zM544 32h-223.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H544c17.67 0 32-14.33 32-32S561.7 32 544 32zM352 416h-32c-17.67 0-32 14.33-32 32s14.33 32 32 32h32c17.67 0 31.1-14.33 31.1-32S369.7 416 352 416zM480 160h-159.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H480c17.67 0 32-14.33 32-32S497.7 160 480 160zM192.4 330.7L160 366.1V64.03C160 46.33 145.7 32 128 32S96 46.33 96 64.03v302L63.6 330.7c-6.312-6.883-14.94-10.38-23.61-10.38c-7.719 0-15.47 2.781-21.61 8.414c-13.03 11.95-13.9 32.22-1.969 45.27l87.1 96.09c12.12 13.26 35.06 13.26 47.19 0l87.1-96.09c11.94-13.05 11.06-33.31-1.969-45.27C224.6 316.8 204.4 317.7 192.4 330.7z"],"arrow-down-z-a":[512,512,["sort-alpha-desc","sort-alpha-down-alt"],"f881","M104.4 470.1c12.12 13.26 35.06 13.26 47.19 0l87.1-96.09c11.94-13.05 11.06-33.31-1.969-45.27c-13.02-11.95-33.27-11.04-45.22 1.973L160 366.1V64.03c0-17.7-14.33-32.03-32-32.03S96 46.33 96 64.03v302l-32.4-35.39c-6.312-6.883-14.94-10.39-23.61-10.39c-7.719 0-15.47 2.785-21.61 8.414c-13.03 11.95-13.9 32.22-1.969 45.27L104.4 470.1zM320 96h50.75l-73.38 73.38c-9.156 9.156-11.89 22.91-6.938 34.88s16.63 19.74 29.56 19.74h127.1C465.7 223.1 480 209.7 480 192s-14.33-32-32-32h-50.75l73.38-73.38c9.156-9.156 11.89-22.91 6.938-34.88S460.9 32 447.1 32h-127.1C302.3 32 288 46.31 288 64S302.3 96 320 96zM492.6 433.3l-79.99-160.1c-10.84-21.81-46.4-21.81-57.24 0l-79.99 160.1c-7.906 15.91-1.5 35.24 14.31 43.19c15.87 7.922 35.04 1.477 42.93-14.4l7.154-14.39h88.43l7.154 14.39c6.174 12.43 23.97 23.87 42.93 14.4C494.1 468.6 500.5 449.2 492.6 433.3zM367.8 391.4L384 358.7l16.22 32.63H367.8z"],"arrow-left":[448,512,[8592],"f060","M447.1 256C447.1 273.7 433.7 288 416 288H109.3l105.4 105.4c12.5 12.5 12.5 32.75 0 45.25C208.4 444.9 200.2 448 192 448s-16.38-3.125-22.62-9.375l-160-160c-12.5-12.5-12.5-32.75 0-45.25l160-160c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L109.3 224H416C433.7 224 447.1 238.3 447.1 256z"],"arrow-left-long":[512,512,["long-arrow-left"],"f177","M9.375 233.4l128-128c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L109.3 224H480c17.69 0 32 14.31 32 32s-14.31 32-32 32H109.3l73.38 73.38c12.5 12.5 12.5 32.75 0 45.25c-12.49 12.49-32.74 12.51-45.25 0l-128-128C-3.125 266.1-3.125 245.9 9.375 233.4z"],"arrow-pointer":[320,512,["mouse-pointer"],"f245","M23.19 32C28.86 32 34.34 34.08 38.59 37.86L312.6 281.4C317.3 285.6 320 291.6 320 297.9C320 310.1 310.1 320 297.9 320H179.8L236.6 433.7C244.5 449.5 238.1 468.7 222.3 476.6C206.5 484.5 187.3 478.1 179.4 462.3L121.2 346L38.58 440.5C34.4 445.3 28.36 448 22.01 448C9.855 448 0 438.1 0 425.1V55.18C0 42.38 10.38 32 23.18 32H23.19z"],"arrow-right":[448,512,[8594],"f061","M438.6 278.6l-160 160C272.4 444.9 264.2 448 256 448s-16.38-3.125-22.62-9.375c-12.5-12.5-12.5-32.75 0-45.25L338.8 288H32C14.33 288 .0016 273.7 .0016 256S14.33 224 32 224h306.8l-105.4-105.4c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l160 160C451.1 245.9 451.1 266.1 438.6 278.6z"],"arrow-right-arrow-left":[512,512,[8644,"exchange"],"f0ec","M32 176h370.8l-57.38 57.38c-12.5 12.5-12.5 32.75 0 45.25C351.6 284.9 359.8 288 368 288s16.38-3.125 22.62-9.375l112-112c12.5-12.5 12.5-32.75 0-45.25l-112-112c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25L402.8 112H32c-17.69 0-32 14.31-32 32S14.31 176 32 176zM480 336H109.3l57.38-57.38c12.5-12.5 12.5-32.75 0-45.25s-32.75-12.5-45.25 0l-112 112c-12.5 12.5-12.5 32.75 0 45.25l112 112C127.6 508.9 135.8 512 144 512s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25L109.3 400H480c17.69 0 32-14.31 32-32S497.7 336 480 336z"],"arrow-right-from-bracket":[512,512,["sign-out"],"f08b","M160 416H96c-17.67 0-32-14.33-32-32V128c0-17.67 14.33-32 32-32h64c17.67 0 32-14.33 32-32S177.7 32 160 32H96C42.98 32 0 74.98 0 128v256c0 53.02 42.98 96 96 96h64c17.67 0 32-14.33 32-32S177.7 416 160 416zM502.6 233.4l-128-128c-12.51-12.51-32.76-12.49-45.25 0c-12.5 12.5-12.5 32.75 0 45.25L402.8 224H192C174.3 224 160 238.3 160 256s14.31 32 32 32h210.8l-73.38 73.38c-12.5 12.5-12.5 32.75 0 45.25s32.75 12.5 45.25 0l128-128C515.1 266.1 515.1 245.9 502.6 233.4z"],"arrow-right-long":[512,512,["long-arrow-right"],"f178","M502.6 278.6l-128 128c-12.51 12.51-32.76 12.49-45.25 0c-12.5-12.5-12.5-32.75 0-45.25L402.8 288H32C14.31 288 0 273.7 0 255.1S14.31 224 32 224h370.8l-73.38-73.38c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l128 128C515.1 245.9 515.1 266.1 502.6 278.6z"],"arrow-right-to-bracket":[512,512,["sign-in"],"f090","M416 32h-64c-17.67 0-32 14.33-32 32s14.33 32 32 32h64c17.67 0 32 14.33 32 32v256c0 17.67-14.33 32-32 32h-64c-17.67 0-32 14.33-32 32s14.33 32 32 32h64c53.02 0 96-42.98 96-96V128C512 74.98 469 32 416 32zM342.6 233.4l-128-128c-12.51-12.51-32.76-12.49-45.25 0c-12.5 12.5-12.5 32.75 0 45.25L242.8 224H32C14.31 224 0 238.3 0 256s14.31 32 32 32h210.8l-73.38 73.38c-12.5 12.5-12.5 32.75 0 45.25s32.75 12.5 45.25 0l128-128C355.1 266.1 355.1 245.9 342.6 233.4z"],"arrow-right-to-city":[640,512,[],"e4b3","M288 48C288 21.49 309.5 0 336 0H432C458.5 0 480 21.49 480 48V192H520V120C520 106.7 530.7 96 544 96C557.3 96 568 106.7 568 120V192H592C618.5 192 640 213.5 640 240V464C640 490.5 618.5 512 592 512H336C309.5 512 288 490.5 288 464V48zM352 112C352 120.8 359.2 128 368 128H400C408.8 128 416 120.8 416 112V80C416 71.16 408.8 64 400 64H368C359.2 64 352 71.16 352 80V112zM368 160C359.2 160 352 167.2 352 176V208C352 216.8 359.2 224 368 224H400C408.8 224 416 216.8 416 208V176C416 167.2 408.8 160 400 160H368zM352 304C352 312.8 359.2 320 368 320H400C408.8 320 416 312.8 416 304V272C416 263.2 408.8 256 400 256H368C359.2 256 352 263.2 352 272V304zM528 256C519.2 256 512 263.2 512 272V304C512 312.8 519.2 320 528 320H560C568.8 320 576 312.8 576 304V272C576 263.2 568.8 256 560 256H528zM512 400C512 408.8 519.2 416 528 416H560C568.8 416 576 408.8 576 400V368C576 359.2 568.8 352 560 352H528C519.2 352 512 359.2 512 368V400zM246.6 233.4C259.1 245.9 259.1 266.1 246.6 278.6L166.6 358.6C154.1 371.1 133.9 371.1 121.4 358.6C108.9 346.1 108.9 325.9 121.4 313.4L146.7 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H146.7L121.4 198.6C108.9 186.1 108.9 165.9 121.4 153.4C133.9 140.9 154.1 140.9 166.6 153.4L246.6 233.4z"],"arrow-rotate-left":[512,512,[8634,"arrow-left-rotate","arrow-rotate-back","arrow-rotate-backward","undo"],"f0e2","M480 256c0 123.4-100.5 223.9-223.9 223.9c-48.86 0-95.19-15.58-134.2-44.86c-14.14-10.59-17-30.66-6.391-44.81c10.61-14.09 30.69-16.97 44.8-6.375c27.84 20.91 61 31.94 95.89 31.94C344.3 415.8 416 344.1 416 256s-71.67-159.8-159.8-159.8C205.9 96.22 158.6 120.3 128.6 160H192c17.67 0 32 14.31 32 32S209.7 224 192 224H48c-17.67 0-32-14.31-32-32V48c0-17.69 14.33-32 32-32s32 14.31 32 32v70.23C122.1 64.58 186.1 32.11 256.1 32.11C379.5 32.11 480 132.6 480 256z"],"arrow-rotate-right":[512,512,[8635,"arrow-right-rotate","arrow-rotate-forward","redo"],"f01e","M496 48V192c0 17.69-14.31 32-32 32H320c-17.69 0-32-14.31-32-32s14.31-32 32-32h63.39c-29.97-39.7-77.25-63.78-127.6-63.78C167.7 96.22 96 167.9 96 256s71.69 159.8 159.8 159.8c34.88 0 68.03-11.03 95.88-31.94c14.22-10.53 34.22-7.75 44.81 6.375c10.59 14.16 7.75 34.22-6.375 44.81c-39.03 29.28-85.36 44.86-134.2 44.86C132.5 479.9 32 379.4 32 256s100.5-223.9 223.9-223.9c69.15 0 134 32.47 176.1 86.12V48c0-17.69 14.31-32 32-32S496 30.31 496 48z"],"arrow-trend-down":[576,512,[],"e097","M466.7 352L320 205.3L214.6 310.6C202.1 323.1 181.9 323.1 169.4 310.6L9.372 150.6C-3.124 138.1-3.124 117.9 9.372 105.4C21.87 92.88 42.13 92.88 54.63 105.4L191.1 242.7L297.4 137.4C309.9 124.9 330.1 124.9 342.6 137.4L512 306.7V223.1C512 206.3 526.3 191.1 544 191.1C561.7 191.1 576 206.3 576 223.1V384C576 401.7 561.7 416 544 416H384C366.3 416 352 401.7 352 384C352 366.3 366.3 352 384 352L466.7 352z"],"arrow-trend-up":[576,512,[],"e098","M384 160C366.3 160 352 145.7 352 128C352 110.3 366.3 96 384 96H544C561.7 96 576 110.3 576 128V288C576 305.7 561.7 320 544 320C526.3 320 512 305.7 512 288V205.3L342.6 374.6C330.1 387.1 309.9 387.1 297.4 374.6L191.1 269.3L54.63 406.6C42.13 419.1 21.87 419.1 9.372 406.6C-3.124 394.1-3.124 373.9 9.372 361.4L169.4 201.4C181.9 188.9 202.1 188.9 214.6 201.4L320 306.7L466.7 159.1L384 160z"],"arrow-turn-down":[384,512,["level-down"],"f149","M342.6 374.6l-128 128C208.4 508.9 200.2 512 191.1 512s-16.38-3.125-22.63-9.375l-127.1-128c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L160 402.8V80C160 71.19 152.8 64 144 64H32C14.33 64 0 49.69 0 32s14.33-32 32-32h112C188.1 0 224 35.88 224 80v322.8l73.37-73.38c12.5-12.5 32.75-12.5 45.25 0S355.1 362.1 342.6 374.6z"],"arrow-turn-up":[384,512,["level-up"],"f148","M342.6 182.6C336.4 188.9 328.2 192 319.1 192s-16.38-3.125-22.62-9.375L224 109.3V432c0 44.13-35.89 80-80 80H32c-17.67 0-32-14.31-32-32s14.33-32 32-32h112C152.8 448 160 440.8 160 432V109.3L86.62 182.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l127.1-128c12.5-12.5 32.75-12.5 45.25 0l128 128C355.1 149.9 355.1 170.1 342.6 182.6z"],"arrow-up":[384,512,[8593],"f062","M374.6 246.6C368.4 252.9 360.2 256 352 256s-16.38-3.125-22.62-9.375L224 141.3V448c0 17.69-14.33 31.1-31.1 31.1S160 465.7 160 448V141.3L54.63 246.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l160-160c12.5-12.5 32.75-12.5 45.25 0l160 160C387.1 213.9 387.1 234.1 374.6 246.6z"],"arrow-up-1-9":[512,512,["sort-numeric-up"],"f163","M320 192c0 17.69 14.31 31.1 32 31.1L416 224c17.69 0 32-14.31 32-32s-14.31-32-32-32V63.98c0-11.19-5.844-21.53-15.38-27.34c-9.531-5.781-21.41-6.188-31.34-1.062l-32 16.59c-15.69 8.125-21.81 27.44-13.69 43.13C329.3 106.3 340.4 112.6 352 112.6V160C334.3 160 320 174.3 320 192zM392 255.6c-48.6 0-88 39.4-88 88c0 36.44 22.15 67.7 53.71 81.07l-7.682 8.004c-10.72 11.16-10.34 28.88 .8125 39.56C356.3 477.4 363.3 480 370.2 480c7.344 0 14.72-2.875 20.19-8.625c69.61-72.53 89.6-85.39 89.6-127.8C480 294.1 440.6 255.6 392 255.6zM392 367.6c-13.23 0-24-10.77-24-24s10.77-24 24-24s24 10.77 24 24S405.2 367.6 392 367.6zM39.99 191.7c8.672 0 17.3-3.5 23.61-10.38L96 145.9v302c0 17.7 14.33 32.03 31.1 32.03s32-14.33 32-32.03V145.9L192.4 181.3C204.4 194.3 224.6 195.2 237.6 183.3c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.94c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.475 151.1 5.35 171.3 18.38 183.3C24.52 188.9 32.27 191.7 39.99 191.7z"],"arrow-up-9-1":[512,512,["sort-numeric-up-alt"],"f887","M237.6 183.3c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.94c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.475 151.1 5.35 171.3 18.38 183.3c13.02 11.95 33.27 11.04 45.22-1.969L96 145.9v302c0 17.7 14.33 32.03 31.1 32.03s32-14.33 32-32.03V145.9L192.4 181.3c6.312 6.883 14.94 10.38 23.61 10.38C223.7 191.7 231.5 188.9 237.6 183.3zM357.7 201.1l-7.682 8.004c-10.72 11.16-10.34 28.88 .8125 39.56c5.406 5.219 12.41 7.812 19.38 7.812c7.344 0 14.72-2.875 20.19-8.625c69.61-72.53 89.6-85.39 89.6-127.8c0-48.6-39.4-88-88-88s-88 39.4-88 88C303.1 156.4 326.1 187.7 357.7 201.1zM392 96c13.23 0 24 10.77 24 24S405.2 144 392 144S368 133.2 368 120S378.8 96 392 96zM416 416.4v-96.02c0-11.19-5.844-21.53-15.38-27.34c-9.531-5.781-21.41-6.188-31.34-1.062l-32 16.59c-15.69 8.125-21.81 27.44-13.69 43.13C329.3 362.8 340.4 369 352 369v47.41c-17.69 0-32 14.31-32 32s14.31 32 32 32h64c17.69 0 32-14.31 32-32S433.7 416.4 416 416.4z"],"arrow-up-a-z":[512,512,["sort-alpha-up"],"f15e","M151.6 41.95c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.473 151.1 5.348 171.4 18.38 183.3c13.02 11.95 33.27 11.04 45.22-1.973L96 145.9v302C96 465.7 110.3 480 128 480S160 465.7 160 447.1V145.9L192.4 181.3c11.46 12.49 31.67 14.39 45.22 1.973c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.95zM448 416h-50.75l73.38-73.38c9.156-9.156 11.89-22.91 6.938-34.88s-16.63-19.86-29.56-19.86H319.1C302.3 287.9 288 302.3 288 320s14.33 32 32 32h50.75l-73.38 73.38c-9.156 9.156-11.89 22.91-6.938 34.88S307.1 480 319.1 480h127.1C465.7 480 480 465.7 480 448S465.7 416 448 416zM492.6 209.3l-79.99-160.1c-10.84-21.81-46.4-21.81-57.24 0L275.4 209.3c-7.906 15.91-1.5 35.24 14.31 43.19c15.87 7.922 35.04 1.477 42.93-14.4l7.154-14.39h88.43l7.154 14.39c6.174 12.43 23.97 23.87 42.93 14.4C494.1 244.6 500.5 225.2 492.6 209.3zM367.8 167.4L384 134.7l16.22 32.63H367.8z"],"arrow-up-from-bracket":[448,512,[],"e09a","M384 352v64c0 17.67-14.33 32-32 32H96c-17.67 0-32-14.33-32-32v-64c0-17.67-14.33-32-32-32s-32 14.33-32 32v64c0 53.02 42.98 96 96 96h256c53.02 0 96-42.98 96-96v-64c0-17.67-14.33-32-32-32S384 334.3 384 352zM201.4 9.375l-128 128c-12.51 12.51-12.49 32.76 0 45.25c12.5 12.5 32.75 12.5 45.25 0L192 109.3V320c0 17.69 14.31 32 32 32s32-14.31 32-32V109.3l73.38 73.38c12.5 12.5 32.75 12.5 45.25 0s12.5-32.75 0-45.25l-128-128C234.1-3.125 213.9-3.125 201.4 9.375z"],"arrow-up-from-ground-water":[576,512,[],"e4b5","M256 319.1V109.3L230.6 134.6C218.1 147.1 197.9 147.1 185.4 134.6C172.9 122.1 172.9 101.9 185.4 89.37L265.4 9.372C277.9-3.124 298.1-3.124 310.6 9.372L390.6 89.37C403.1 101.9 403.1 122.1 390.6 134.6C378.1 147.1 357.9 147.1 345.4 134.6L320 109.3V319.1C320 337.7 305.7 352 288 352C270.3 352 256 337.7 256 319.1zM269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448C410.9 448 439.4 437.2 461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515.1 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.13 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.854 504.5 .8429 487.3C-3.168 470.1 7.533 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9H269.5zM192 416.5C172.1 416.4 150.8 408.5 132.9 396.1C109.1 379.4 77.01 380.8 54.78 399.5C44.18 408.3 30.59 415.1 17.49 418.1C11.19 419.6 5.326 421.9 0 425V239.1C0 213.5 21.49 191.1 48 191.1H192V416.5zM576 239.1V424.1C570.7 421.9 564.8 419.6 558.5 418.1C545.4 415.1 531.8 408.3 521.2 399.5C499 380.8 466.9 379.4 443.2 396.1C425.2 408.5 403 416.5 384 416.5L384 191.1H528C554.5 191.1 576 213.5 576 239.1L576 239.1z"],"arrow-up-from-water-pump":[576,512,[],"e4b6","M239.1 0C266.5 0 287.1 21.49 287.1 48V256H416V109.3L390.6 134.6C378.1 147.1 357.9 147.1 345.4 134.6C332.9 122.1 332.9 101.9 345.4 89.37L425.4 9.373C437.9-3.124 458.1-3.124 470.6 9.373L550.6 89.37C563.1 101.9 563.1 122.1 550.6 134.6C538.1 147.1 517.9 147.1 505.4 134.6L480 109.3V256H528C554.5 256 576 277.5 576 304V400C576 408 574 415.6 570.6 422.2C566.8 420.5 562.8 419.1 558.5 418.1C545.4 415.1 531.8 408.3 521.2 399.5C499 380.8 466.9 379.4 443.2 396.1C425.2 408.5 403 416.5 384 416.5C364.4 416.5 343.2 408.8 324.8 396.1C302.8 380.6 273.3 380.6 251.2 396.1C234 407.9 213.2 416.5 192 416.5C172.1 416.5 150.8 408.5 132.9 396.1C109.1 379.4 77.01 380.8 54.78 399.5C44.18 408.3 30.59 415.1 17.49 418.1C13.27 419.1 9.239 420.5 5.439 422.2C1.965 415.6 0 408 0 400V304C0 277.5 21.49 256 48 256H64V48C64 21.49 85.49 0 112 0H239.1zM384 448C410.9 448 439.4 437.2 461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448H384z"],"arrow-up-long":[320,512,["long-arrow-up"],"f176","M310.6 182.6c-12.51 12.51-32.76 12.49-45.25 0L192 109.3V480c0 17.69-14.31 32-32 32s-32-14.31-32-32V109.3L54.63 182.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l128-128c12.5-12.5 32.75-12.5 45.25 0l128 128C323.1 149.9 323.1 170.1 310.6 182.6z"],"arrow-up-right-dots":[576,512,[],"e4b7","M287.1 0C305.7 0 320 14.33 320 32V160C320 177.7 305.7 192 287.1 192C270.3 192 255.1 177.7 255.1 160V109.3L54.63 310.6C42.13 323.1 21.87 323.1 9.372 310.6C-3.124 298.1-3.124 277.9 9.372 265.4L210.7 64H159.1C142.3 64 127.1 49.67 127.1 32C127.1 14.33 142.3 0 159.1 0H287.1zM576 80C576 106.5 554.5 128 528 128C501.5 128 480 106.5 480 80C480 53.49 501.5 32 528 32C554.5 32 576 53.49 576 80zM448 208C448 234.5 426.5 256 400 256C373.5 256 352 234.5 352 208C352 181.5 373.5 160 400 160C426.5 160 448 181.5 448 208zM352 336C352 309.5 373.5 288 400 288C426.5 288 448 309.5 448 336C448 362.5 426.5 384 400 384C373.5 384 352 362.5 352 336zM448 464C448 490.5 426.5 512 400 512C373.5 512 352 490.5 352 464C352 437.5 373.5 416 400 416C426.5 416 448 437.5 448 464zM576 464C576 490.5 554.5 512 528 512C501.5 512 480 490.5 480 464C480 437.5 501.5 416 528 416C554.5 416 576 437.5 576 464zM223.1 336C223.1 309.5 245.5 288 271.1 288C298.5 288 320 309.5 320 336C320 362.5 298.5 384 271.1 384C245.5 384 223.1 362.5 223.1 336zM320 464C320 490.5 298.5 512 271.1 512C245.5 512 223.1 490.5 223.1 464C223.1 437.5 245.5 416 271.1 416C298.5 416 320 437.5 320 464zM95.1 464C95.1 437.5 117.5 416 143.1 416C170.5 416 191.1 437.5 191.1 464C191.1 490.5 170.5 512 143.1 512C117.5 512 95.1 490.5 95.1 464zM576 336C576 362.5 554.5 384 528 384C501.5 384 480 362.5 480 336C480 309.5 501.5 288 528 288C554.5 288 576 309.5 576 336zM480 208C480 181.5 501.5 160 528 160C554.5 160 576 181.5 576 208C576 234.5 554.5 256 528 256C501.5 256 480 234.5 480 208z"],"arrow-up-right-from-square":[448,512,["external-link"],"f08e","M256 64C256 46.33 270.3 32 288 32H415.1C415.1 32 415.1 32 415.1 32C420.3 32 424.5 32.86 428.2 34.43C431.1 35.98 435.5 38.27 438.6 41.3C438.6 41.35 438.6 41.4 438.7 41.44C444.9 47.66 447.1 55.78 448 63.9C448 63.94 448 63.97 448 64V192C448 209.7 433.7 224 416 224C398.3 224 384 209.7 384 192V141.3L214.6 310.6C202.1 323.1 181.9 323.1 169.4 310.6C156.9 298.1 156.9 277.9 169.4 265.4L338.7 96H288C270.3 96 256 81.67 256 64V64zM0 128C0 92.65 28.65 64 64 64H160C177.7 64 192 78.33 192 96C192 113.7 177.7 128 160 128H64V416H352V320C352 302.3 366.3 288 384 288C401.7 288 416 302.3 416 320V416C416 451.3 387.3 480 352 480H64C28.65 480 0 451.3 0 416V128z"],"arrow-up-short-wide":[576,512,["sort-amount-up-alt"],"f885","M544 416h-223.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H544c17.67 0 32-14.33 32-32S561.7 416 544 416zM320 96h32c17.67 0 31.1-14.33 31.1-32s-14.33-32-31.1-32h-32c-17.67 0-32 14.33-32 32S302.3 96 320 96zM320 224H416c17.67 0 32-14.33 32-32s-14.33-32-32-32h-95.1c-17.67 0-32 14.33-32 32S302.3 224 320 224zM320 352H480c17.67 0 32-14.33 32-32s-14.33-32-32-32h-159.1c-17.67 0-32 14.33-32 32S302.3 352 320 352zM151.6 41.95c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.475 151.1 5.35 171.4 18.38 183.3c6.141 5.629 13.89 8.414 21.61 8.414c8.672 0 17.3-3.504 23.61-10.39L96 145.9v302C96 465.7 110.3 480 128 480s32-14.33 32-32.03V145.9L192.4 181.3C204.4 194.3 224.6 195.3 237.6 183.3c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.95z"],"arrow-up-wide-short":[576,512,["sort-amount-up"],"f161","M416 288h-95.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H416c17.67 0 32-14.33 32-32S433.7 288 416 288zM352 416h-32c-17.67 0-32 14.33-32 32s14.33 32 32 32h32c17.67 0 31.1-14.33 31.1-32S369.7 416 352 416zM480 160h-159.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H480c17.67 0 32-14.33 32-32S497.7 160 480 160zM544 32h-223.1c-17.67 0-32 14.33-32 32s14.33 32 32 32H544c17.67 0 32-14.33 32-32S561.7 32 544 32zM151.6 41.95c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.475 151.1 5.35 171.4 18.38 183.3c6.141 5.629 13.89 8.414 21.61 8.414c8.672 0 17.3-3.504 23.61-10.39L96 145.9v302C96 465.7 110.3 480 128 480s32-14.33 32-32.03V145.9L192.4 181.3C204.4 194.3 224.6 195.3 237.6 183.3c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.95z"],"arrow-up-z-a":[512,512,["sort-alpha-up-alt"],"f882","M151.6 41.95c-12.12-13.26-35.06-13.26-47.19 0l-87.1 96.09C4.473 151.1 5.348 171.4 18.38 183.3c13.02 11.95 33.27 11.04 45.22-1.973L96 145.9v302C96 465.7 110.3 480 128 480S160 465.7 160 447.1V145.9L192.4 181.3c6.312 6.883 14.94 10.39 23.61 10.39c7.719 0 15.47-2.785 21.61-8.414c13.03-11.95 13.9-32.22 1.969-45.27L151.6 41.95zM320 96h50.75l-73.38 73.38c-9.156 9.156-11.89 22.91-6.938 34.88s16.63 19.74 29.56 19.74h127.1C465.7 223.1 480 209.7 480 192s-14.33-32-32-32h-50.75l73.38-73.38c9.156-9.156 11.89-22.91 6.938-34.88S460.9 32 447.1 32h-127.1C302.3 32 288 46.31 288 64S302.3 96 320 96zM492.6 433.3l-79.99-160.1c-10.84-21.81-46.4-21.81-57.24 0l-79.99 160.1c-7.906 15.91-1.5 35.24 14.31 43.19c15.87 7.922 35.04 1.477 42.93-14.4l7.154-14.39h88.43l7.154 14.39c6.174 12.43 23.97 23.87 42.93 14.4C494.1 468.6 500.5 449.2 492.6 433.3zM367.8 391.4L384 358.7l16.22 32.63H367.8z"],"arrows-down-to-line":[576,512,[],"e4b8","M544 416C561.7 416 576 430.3 576 448C576 465.7 561.7 480 544 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H544zM470.6 374.6C458.1 387.1 437.9 387.1 425.4 374.6L329.4 278.6C316.9 266.1 316.9 245.9 329.4 233.4C341.9 220.9 362.1 220.9 374.6 233.4L416 274.7V64C416 46.33 430.3 32 448 32C465.7 32 480 46.33 480 64V274.7L521.4 233.4C533.9 220.9 554.1 220.9 566.6 233.4C579.1 245.9 579.1 266.1 566.6 278.6L470.6 374.6zM246.6 278.6L150.6 374.6C138.1 387.1 117.9 387.1 105.4 374.6L9.373 278.6C-3.124 266.1-3.124 245.9 9.373 233.4C21.87 220.9 42.13 220.9 54.63 233.4L96 274.7V64C96 46.33 110.3 32 128 32C145.7 32 160 46.33 160 64V274.7L201.4 233.4C213.9 220.9 234.1 220.9 246.6 233.4C259.1 245.9 259.1 266.1 246.6 278.6H246.6z"],"arrows-down-to-people":[640,512,[],"e4b9","M167.1 24V142.1L191 119C200.4 109.7 215.6 109.7 224.1 119C234.3 128.4 234.3 143.6 224.1 152.1L160.1 216.1C151.6 226.3 136.4 226.3 127 216.1L63.03 152.1C53.65 143.6 53.65 128.4 63.03 119C72.4 109.7 87.6 109.7 96.97 119L119.1 142.1V24C119.1 10.75 130.7 0 143.1 0C157.3 0 167.1 10.75 167.1 24V24zM359.1 200C359.1 222.1 342.1 240 319.1 240C297.9 240 279.1 222.1 279.1 200C279.1 177.9 297.9 160 319.1 160C342.1 160 359.1 177.9 359.1 200zM183.1 296C183.1 318.1 166.1 336 143.1 336C121.9 336 103.1 318.1 103.1 296C103.1 273.9 121.9 256 143.1 256C166.1 256 183.1 273.9 183.1 296zM455.1 296C455.1 273.9 473.9 256 495.1 256C518.1 256 535.1 273.9 535.1 296C535.1 318.1 518.1 336 495.1 336C473.9 336 455.1 318.1 455.1 296zM199.1 480C199.1 497.7 185.7 512 167.1 512H119.1C102.3 512 87.1 497.7 87.1 480V441.5L61.13 491.4C54.84 503 40.29 507.4 28.62 501.1C16.95 494.8 12.58 480.3 18.87 468.6L56.74 398.3C72.09 369.8 101.9 352 134.2 352H153.8C170.1 352 185.7 356.5 199.2 364.6L232.7 302.3C248.1 273.8 277.9 255.1 310.2 255.1H329.8C362.1 255.1 391.9 273.8 407.3 302.3L440.8 364.6C454.3 356.5 469.9 352 486.2 352H505.8C538.1 352 567.9 369.8 583.3 398.3L621.1 468.6C627.4 480.3 623 494.8 611.4 501.1C599.7 507.4 585.1 503 578.9 491.4L551.1 441.5V480C551.1 497.7 537.7 512 519.1 512H471.1C454.3 512 439.1 497.7 439.1 480V441.5L413.1 491.4C406.8 503 392.3 507.4 380.6 501.1C368.9 494.8 364.6 480.3 370.9 468.6L407.2 401.1C405.5 399.5 404 397.6 402.9 395.4L375.1 345.5V400C375.1 417.7 361.7 432 343.1 432H295.1C278.3 432 263.1 417.7 263.1 400V345.5L237.1 395.4C235.1 397.6 234.5 399.5 232.8 401.1L269.1 468.6C275.4 480.3 271 494.8 259.4 501.1C247.7 507.4 233.1 503 226.9 491.4L199.1 441.5L199.1 480zM415 152.1C405.7 143.6 405.7 128.4 415 119C424.4 109.7 439.6 109.7 448.1 119L471.1 142.1V24C471.1 10.75 482.7 0 495.1 0C509.3 0 519.1 10.75 519.1 24V142.1L543 119C552.4 109.7 567.6 109.7 576.1 119C586.3 128.4 586.3 143.6 576.1 152.1L512.1 216.1C503.6 226.3 488.4 226.3 479 216.1L415 152.1z"],"arrows-left-right":[512,512,["arrows-h"],"f07e","M502.6 278.6l-96 96C400.4 380.9 392.2 384 384 384s-16.38-3.125-22.62-9.375c-12.5-12.5-12.5-32.75 0-45.25L402.8 288h-293.5l41.38 41.38c12.5 12.5 12.5 32.75 0 45.25C144.4 380.9 136.2 384 128 384s-16.38-3.125-22.62-9.375l-96-96c-12.5-12.5-12.5-32.75 0-45.25l96-96c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L109.3 224h293.5l-41.38-41.38c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l96 96C515.1 245.9 515.1 266.1 502.6 278.6z"],"arrows-left-right-to-line":[640,512,[],"e4ba","M32 64C49.67 64 64 78.33 64 96V416C64 433.7 49.67 448 32 448C14.33 448 0 433.7 0 416V96C0 78.33 14.33 64 32 64zM246.6 137.4C259.1 149.9 259.1 170.1 246.6 182.6L205.3 224H434.7L393.4 182.6C380.9 170.1 380.9 149.9 393.4 137.4C405.9 124.9 426.1 124.9 438.6 137.4L534.6 233.4C547.1 245.9 547.1 266.1 534.6 278.6L438.6 374.6C426.1 387.1 405.9 387.1 393.4 374.6C380.9 362.1 380.9 341.9 393.4 329.4L434.7 288H205.3L246.6 329.4C259.1 341.9 259.1 362.1 246.6 374.6C234.1 387.1 213.9 387.1 201.4 374.6L105.4 278.6C92.88 266.1 92.88 245.9 105.4 233.4L201.4 137.4C213.9 124.9 234.1 124.9 246.6 137.4V137.4zM640 416C640 433.7 625.7 448 608 448C590.3 448 576 433.7 576 416V96C576 78.33 590.3 64 608 64C625.7 64 640 78.33 640 96V416z"],"arrows-rotate":[512,512,[128472,"refresh","sync"],"f021","M464 16c-17.67 0-32 14.31-32 32v74.09C392.1 66.52 327.4 32 256 32C161.5 32 78.59 92.34 49.58 182.2c-5.438 16.81 3.797 34.88 20.61 40.28c16.89 5.5 34.88-3.812 40.3-20.59C130.9 138.5 189.4 96 256 96c50.5 0 96.26 24.55 124.4 64H336c-17.67 0-32 14.31-32 32s14.33 32 32 32h128c17.67 0 32-14.31 32-32V48C496 30.31 481.7 16 464 16zM441.8 289.6c-16.92-5.438-34.88 3.812-40.3 20.59C381.1 373.5 322.6 416 256 416c-50.5 0-96.25-24.55-124.4-64H176c17.67 0 32-14.31 32-32s-14.33-32-32-32h-128c-17.67 0-32 14.31-32 32v144c0 17.69 14.33 32 32 32s32-14.31 32-32v-74.09C119.9 445.5 184.6 480 255.1 480c94.45 0 177.4-60.34 206.4-150.2C467.9 313 458.6 294.1 441.8 289.6z"],"arrows-spin":[512,512,[],"e4bb","M257.1 95.53C245.8 95.53 234.7 96.72 223.1 98.97V33.97C234.8 32.36 245.9 31.53 257.1 31.53C315.3 31.53 368.3 53.72 408.2 90.11L437.6 60.69C447.7 50.61 464.9 57.75 464.9 72V177.4C464.9 186.2 457.7 193.4 448.9 193.4H343.5C329.3 193.4 322.1 176.1 332.2 166.1L362.9 135.4C334.7 110.6 297.7 95.53 257.1 95.53L257.1 95.53zM97.14 255.5C97.14 266.7 98.27 277.5 100.4 288H35.47C33.93 277.4 33.14 266.6 33.14 255.5C33.14 198.2 54.71 145.8 90.18 106.2L60.69 76.69C50.61 66.61 57.74 49.38 71.1 49.38H177.4C186.2 49.38 193.4 56.54 193.4 65.38V170.7C193.4 185 176.1 192.1 166.1 182.1L135.5 151.5C111.6 179.5 97.14 215.8 97.14 255.5V255.5zM182.1 348.2L153.1 377.1C181.1 401.1 217.4 415.5 257.1 415.5C267.7 415.5 278 414.5 288 412.6V477.4C277.9 478.8 267.6 479.5 257.1 479.5C199.8 479.5 147.4 457.1 107.8 422.5L76.69 453.6C66.61 463.7 49.37 456.5 49.37 442.3V336.9C49.37 328.1 56.54 320.9 65.37 320.9H170.7C184.1 320.9 192.1 338.1 182.1 348.2H182.1zM348.2 332.2L377.2 361.2C402.1 333.1 417.1 296.1 417.1 255.5C417.1 244.7 416.1 234.2 414 224H478.9C480.4 234.3 481.1 244.8 481.1 255.5C481.1 313.7 458.9 366.7 422.6 406.6L453.6 437.6C463.7 447.7 456.5 464.9 442.3 464.9H336.9C328.1 464.9 320.9 457.7 320.9 448.9V343.5C320.9 329.3 338.1 322.1 348.2 332.2L348.2 332.2z"],"arrows-split-up-and-left":[512,512,[],"e4bc","M246.6 150.6C234.1 163.1 213.9 163.1 201.4 150.6C188.9 138.1 188.9 117.9 201.4 105.4L297.4 9.372C309.9-3.124 330.1-3.124 342.6 9.372L438.6 105.4C451.1 117.9 451.1 138.1 438.6 150.6C426.1 163.1 405.9 163.1 393.4 150.6L352 109.3V384C352 419.3 380.7 448 416 448H480C497.7 448 512 462.3 512 480C512 497.7 497.7 512 480 512H416C345.3 512 288 454.7 288 384C288 348.7 259.3 320 224 320H109.3L150.6 361.4C163.1 373.9 163.1 394.1 150.6 406.6C138.1 419.1 117.9 419.1 105.4 406.6L9.38 310.6L9.305 310.6C3.575 304.8 .0259 296.9 .0003 288.1L2.428 275.8C3.99 271.1 6.305 268.4 9.372 265.4L105.4 169.4C117.9 156.9 138.1 156.9 150.6 169.4C163.1 181.9 163.1 202.1 150.6 214.6L109.3 255.1H224C247.3 255.1 269.2 262.2 288 273.1V109.3L246.6 150.6zM0 287.9C.0125 283.6 .8749 279.5 2.428 275.8C.8214 279.6 .0122 283.8 0 287.9zM0 288.1V287.1V287.9V288.1z"],"arrows-to-circle":[640,512,[],"e4bd","M9.372 9.372C21.87-3.124 42.13-3.124 54.63 9.372L159.1 114.7V95.1C159.1 78.33 174.3 63.1 191.1 63.1C209.7 63.1 223.1 78.33 223.1 95.1V191.1C223.1 196.3 223.1 200.5 221.6 204.2C220 207.1 217.7 211.5 214.7 214.6L214.6 214.7C211.5 217.7 207.1 220 204.2 221.6C200.5 223.1 196.3 223.1 191.1 223.1H95.1C78.33 223.1 63.1 209.7 63.1 191.1C63.1 174.3 78.33 159.1 95.1 159.1H114.7L9.372 54.63C-3.124 42.13-3.124 21.87 9.372 9.372V9.372zM384 256C384 291.3 355.3 320 320 320C284.7 320 256 291.3 256 256C256 220.7 284.7 192 320 192C355.3 192 384 220.7 384 256zM96 352C78.33 352 64 337.7 64 320C64 302.3 78.33 288 96 288H192H192.1C200.9 288 208.8 291.6 214.6 297.3L214.7 297.4C217.7 300.5 220 304 221.6 307.8C223.1 311.5 224 315.7 224 319.1V416C224 433.7 209.7 448 192 448C174.3 448 160 433.7 160 416V397.3L54.63 502.6C42.13 515.1 21.87 515.1 9.373 502.6C-3.124 490.1-3.124 469.9 9.373 457.4L114.7 352L96 352zM448 64C465.7 64 480 78.33 480 96V114.7L585.4 9.373C597.9-3.124 618.1-3.124 630.6 9.373C643.1 21.87 643.1 42.13 630.6 54.63L525.3 160H544C561.7 160 576 174.3 576 192C576 209.7 561.7 224 544 224H448C439.2 224 431.2 220.4 425.4 214.7L425.3 214.6C422.3 211.5 419.1 207.1 418.4 204.2C416.9 200.5 416 196.4 416 192.1V191.1V96C416 78.33 430.3 64 448 64H448zM525.3 352L630.6 457.4C643.1 469.9 643.1 490.1 630.6 502.6C618.1 515.1 597.9 515.1 585.4 502.6L480 397.3V416C480 433.7 465.7 448 448 448C430.3 448 416 433.7 416 416V320C416 319.1 416 319.9 416 319.9C416 315.6 416.9 311.5 418.4 307.8C419.1 303.1 422.3 300.4 425.4 297.4C431.1 291.6 439.1 288 447.9 288C447.9 288 447.1 288 448 288H544C561.7 288 576 302.3 576 320C576 337.7 561.7 352 544 352L525.3 352z"],"arrows-to-dot":[512,512,[],"e4be","M288 82.74L297.4 73.37C309.9 60.88 330.1 60.88 342.6 73.37C355.1 85.87 355.1 106.1 342.6 118.6L278.6 182.6C266.1 195.1 245.9 195.1 233.4 182.6L169.4 118.6C156.9 106.1 156.9 85.87 169.4 73.37C181.9 60.88 202.1 60.88 214.6 73.37L223.1 82.75V32C223.1 14.33 238.3 0 255.1 0C273.7 0 288 14.33 288 32L288 82.74zM438.6 342.6C426.1 355.1 405.9 355.1 393.4 342.6L329.4 278.6C316.9 266.1 316.9 245.9 329.4 233.4L393.4 169.4C405.9 156.9 426.1 156.9 438.6 169.4C451.1 181.9 451.1 202.1 438.6 214.6L429.3 223.1H480C497.7 223.1 512 238.3 512 255.1C512 273.7 497.7 287.1 480 287.1H429.3L438.6 297.4C451.1 309.9 451.1 330.1 438.6 342.6V342.6zM288 256C288 273.7 273.7 288 256 288C238.3 288 224 273.7 224 256C224 238.3 238.3 224 256 224C273.7 224 288 238.3 288 256zM182.6 233.4C195.1 245.9 195.1 266.1 182.6 278.6L118.6 342.6C106.1 355.1 85.87 355.1 73.37 342.6C60.88 330.1 60.88 309.9 73.37 297.4L82.75 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H82.74L73.37 214.6C60.88 202.1 60.88 181.9 73.37 169.4C85.87 156.9 106.1 156.9 118.6 169.4L182.6 233.4zM169.4 438.6C156.9 426.1 156.9 405.9 169.4 393.4L233.4 329.4C245.9 316.9 266.1 316.9 278.6 329.4L342.6 393.4C355.1 405.9 355.1 426.1 342.6 438.6C330.1 451.1 309.9 451.1 297.4 438.6L288 429.3V480C288 497.7 273.7 512 256 512C238.3 512 224 497.7 224 480V429.3L214.6 438.6C202.1 451.1 181.9 451.1 169.4 438.6H169.4z"],"arrows-to-eye":[640,512,[],"e4bf","M15.03 15.03C24.4 5.657 39.6 5.657 48.97 15.03L112 78.06V40C112 26.75 122.7 15.1 136 15.1C149.3 15.1 160 26.75 160 40V136C160 149.3 149.3 160 136 160H40C26.75 160 15.1 149.3 15.1 136C15.1 122.7 26.75 112 40 112H78.06L15.03 48.97C5.657 39.6 5.657 24.4 15.03 15.03V15.03zM133.5 243.9C158.6 193.6 222.7 112 320 112C417.3 112 481.4 193.6 506.5 243.9C510.3 251.6 510.3 260.4 506.5 268.1C481.4 318.4 417.3 400 320 400C222.7 400 158.6 318.4 133.5 268.1C129.7 260.4 129.7 251.6 133.5 243.9V243.9zM320 320C355.3 320 384 291.3 384 256C384 220.7 355.3 192 320 192C284.7 192 256 220.7 256 256C256 291.3 284.7 320 320 320zM591 15.03C600.4 5.657 615.6 5.657 624.1 15.03C634.3 24.4 634.3 39.6 624.1 48.97L561.9 112H600C613.3 112 624 122.7 624 136C624 149.3 613.3 160 600 160H504C490.7 160 480 149.3 480 136V40C480 26.75 490.7 15.1 504 15.1C517.3 15.1 528 26.75 528 40V78.06L591 15.03zM15.03 463L78.06 400H40C26.75 400 15.1 389.3 15.1 376C15.1 362.7 26.75 352 40 352H136C149.3 352 160 362.7 160 376V472C160 485.3 149.3 496 136 496C122.7 496 112 485.3 112 472V433.9L48.97 496.1C39.6 506.3 24.4 506.3 15.03 496.1C5.657 487.6 5.657 472.4 15.03 463V463zM528 433.9V472C528 485.3 517.3 496 504 496C490.7 496 480 485.3 480 472V376C480 362.7 490.7 352 504 352H600C613.3 352 624 362.7 624 376C624 389.3 613.3 400 600 400H561.9L624.1 463C634.3 472.4 634.3 487.6 624.1 496.1C615.6 506.3 600.4 506.3 591 496.1L528 433.9z"],"arrows-turn-right":[448,512,[],"e4c0","M297.4 9.372C309.9-3.124 330.1-3.124 342.6 9.372L438.6 105.4C451.1 117.9 451.1 138.1 438.6 150.6L342.6 246.6C330.1 259.1 309.9 259.1 297.4 246.6C284.9 234.1 284.9 213.9 297.4 201.4L338.7 160H128C92.65 160 64 188.7 64 224V256C64 273.7 49.67 288 32 288C14.33 288 0 273.7 0 256V224C0 153.3 57.31 96 128 96H338.7L297.4 54.63C284.9 42.13 284.9 21.87 297.4 9.373V9.372zM201.4 265.4C213.9 252.9 234.1 252.9 246.6 265.4L342.6 361.4C355.1 373.9 355.1 394.1 342.6 406.6L246.6 502.6C234.1 515.1 213.9 515.1 201.4 502.6C188.9 490.1 188.9 469.9 201.4 457.4L242.7 416H96C78.33 416 64 430.3 64 448V480C64 497.7 49.67 512 32 512C14.33 512 0 497.7 0 480V448C0 394.1 42.98 352 96 352H242.7L201.4 310.6C188.9 298.1 188.9 277.9 201.4 265.4V265.4z"],"arrows-turn-to-dots":[512,512,[],"e4c1","M249.4 25.37C261.9 12.88 282.1 12.88 294.6 25.37C307.1 37.87 307.1 58.13 294.6 70.63L269.3 95.1H416C469 95.1 512 138.1 512 191.1V223.1C512 241.7 497.7 255.1 480 255.1C462.3 255.1 448 241.7 448 223.1V191.1C448 174.3 433.7 159.1 416 159.1H269.3L294.6 185.4C307.1 197.9 307.1 218.1 294.6 230.6C282.1 243.1 261.9 243.1 249.4 230.6L169.4 150.6C156.9 138.1 156.9 117.9 169.4 105.4L249.4 25.37zM342.6 361.4C355.1 373.9 355.1 394.1 342.6 406.6L262.6 486.6C250.1 499.1 229.9 499.1 217.4 486.6C204.9 474.1 204.9 453.9 217.4 441.4L242.7 416H96C78.33 416 64 430.3 64 448V480C64 497.7 49.67 512 32 512C14.33 512 0 497.7 0 480V448C0 394.1 42.98 352 96 352H242.7L217.4 326.6C204.9 314.1 204.9 293.9 217.4 281.4C229.9 268.9 250.1 268.9 262.6 281.4L342.6 361.4zM512 384C512 419.3 483.3 448 448 448C412.7 448 384 419.3 384 384C384 348.7 412.7 320 448 320C483.3 320 512 348.7 512 384zM128 128C128 163.3 99.35 192 64 192C28.65 192 0 163.3 0 128C0 92.65 28.65 64 64 64C99.35 64 128 92.65 128 128z"],"arrows-up-down":[256,512,["arrows-v"],"f07d","M246.6 361.4C252.9 367.6 256 375.8 256 384s-3.125 16.38-9.375 22.62l-96 96c-12.5 12.5-32.75 12.5-45.25 0l-96-96c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L96 402.8v-293.5L54.63 150.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l96-96c12.5-12.5 32.75-12.5 45.25 0l96 96C252.9 111.6 256 119.8 256 128s-3.125 16.38-9.375 22.62c-12.5 12.5-32.75 12.5-45.25 0L160 109.3v293.5l41.38-41.38C213.9 348.9 234.1 348.9 246.6 361.4z"],"arrows-up-down-left-right":[512,512,["arrows"],"f047","M512 255.1c0 8.188-3.125 16.41-9.375 22.66l-72 72C424.4 356.9 416.2 360 408 360c-18.28 0-32-14.95-32-32c0-8.188 3.125-16.38 9.375-22.62L402.8 288H288v114.8l17.38-17.38C311.6 379.1 319.8 376 328 376c18.28 0 32 14.95 32 32c0 8.188-3.125 16.38-9.375 22.62l-72 72C272.4 508.9 264.2 512 256 512s-16.38-3.125-22.62-9.375l-72-72C155.1 424.4 152 416.2 152 408c0-17.05 13.73-32 32-32c8.188 0 16.38 3.125 22.62 9.375L224 402.8V288H109.3l17.38 17.38C132.9 311.6 136 319.8 136 328c0 17.05-13.73 32-32 32c-8.188 0-16.38-3.125-22.62-9.375l-72-72C3.125 272.4 0 264.2 0 255.1s3.125-16.34 9.375-22.59l72-72C87.63 155.1 95.81 152 104 152c18.28 0 32 14.95 32 32c0 8.188-3.125 16.38-9.375 22.62L109.3 224H224V109.3L206.6 126.6C200.4 132.9 192.2 136 184 136c-18.28 0-32-14.95-32-32c0-8.188 3.125-16.38 9.375-22.62l72-72C239.6 3.125 247.8 0 256 0s16.38 3.125 22.62 9.375l72 72C356.9 87.63 360 95.81 360 104c0 17.05-13.73 32-32 32c-8.188 0-16.38-3.125-22.62-9.375L288 109.3V224h114.8l-17.38-17.38C379.1 200.4 376 192.2 376 184c0-17.05 13.73-32 32-32c8.188 0 16.38 3.125 22.62 9.375l72 72C508.9 239.6 512 247.8 512 255.1z"],"arrows-up-to-line":[576,512,[],"e4c2","M32 96C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H544C561.7 32 576 46.33 576 64C576 81.67 561.7 96 544 96H32zM105.4 137.4C117.9 124.9 138.1 124.9 150.6 137.4L246.6 233.4C259.1 245.9 259.1 266.1 246.6 278.6C234.1 291.1 213.9 291.1 201.4 278.6L160 237.3V448C160 465.7 145.7 480 128 480C110.3 480 96 465.7 96 448V237.3L54.63 278.6C42.13 291.1 21.87 291.1 9.372 278.6C-3.124 266.1-3.124 245.9 9.372 233.4L105.4 137.4zM329.4 233.4L425.4 137.4C437.9 124.9 458.1 124.9 470.6 137.4L566.6 233.4C579.1 245.9 579.1 266.1 566.6 278.6C554.1 291.1 533.9 291.1 521.4 278.6L480 237.3L480 448C480 465.7 465.7 480 448 480C430.3 480 416 465.7 416 448V237.3L374.6 278.6C362.1 291.1 341.9 291.1 329.4 278.6C316.9 266.1 316.9 245.9 329.4 233.4H329.4z"],asterisk:[448,512,[10033,61545],"2a","M417.1 368c-5.937 10.27-16.69 16-27.75 16c-5.422 0-10.92-1.375-15.97-4.281L256 311.4V448c0 17.67-14.33 32-31.1 32S192 465.7 192 448V311.4l-118.3 68.29C68.67 382.6 63.17 384 57.75 384c-11.06 0-21.81-5.734-27.75-16c-8.828-15.31-3.594-34.88 11.72-43.72L159.1 256L41.72 187.7C26.41 178.9 21.17 159.3 29.1 144C36.63 132.5 49.26 126.7 61.65 128.2C65.78 128.7 69.88 130.1 73.72 132.3L192 200.6V64c0-17.67 14.33-32 32-32S256 46.33 256 64v136.6l118.3-68.29c3.838-2.213 7.939-3.539 12.07-4.051C398.7 126.7 411.4 132.5 417.1 144c8.828 15.31 3.594 34.88-11.72 43.72L288 256l118.3 68.28C421.6 333.1 426.8 352.7 417.1 368z"],at:[512,512,[61946],"40","M207.8 20.73c-93.45 18.32-168.7 93.66-187 187.1c-27.64 140.9 68.65 266.2 199.1 285.1c19.01 2.888 36.17-12.26 36.17-31.49l.0001-.6631c0-15.74-11.44-28.88-26.84-31.24c-84.35-12.98-149.2-86.13-149.2-174.2c0-102.9 88.61-185.5 193.4-175.4c91.54 8.869 158.6 91.25 158.6 183.2l0 16.16c0 22.09-17.94 40.05-40 40.05s-40.01-17.96-40.01-40.05v-120.1c0-8.847-7.161-16.02-16.01-16.02l-31.98 .0036c-7.299 0-13.2 4.992-15.12 11.68c-24.85-12.15-54.24-16.38-86.06-5.106c-38.75 13.73-68.12 48.91-73.72 89.64c-9.483 69.01 43.81 128 110.9 128c26.44 0 50.43-9.544 69.59-24.88c24 31.3 65.23 48.69 109.4 37.49C465.2 369.3 496 324.1 495.1 277.2V256.3C495.1 107.1 361.2-9.332 207.8 20.73zM239.1 304.3c-26.47 0-48-21.56-48-48.05s21.53-48.05 48-48.05s48 21.56 48 48.05S266.5 304.3 239.1 304.3z"],atom:[512,512,[9883],"f5d2","M256 224C238.4 224 223.1 238.4 223.1 256S238.4 288 256 288c17.63 0 32-14.38 32-32S273.6 224 256 224zM470.2 128c-10.88-19.5-40.51-50.75-116.3-41.88C332.4 34.88 299.6 0 256 0S179.6 34.88 158.1 86.12C82.34 77.38 52.71 108.5 41.83 128c-16.38 29.38-14.91 73.12 25.23 128c-40.13 54.88-41.61 98.63-25.23 128c29.13 52.38 101.6 43.63 116.3 41.88C179.6 477.1 212.4 512 256 512s76.39-34.88 97.9-86.13C368.5 427.6 441 436.4 470.2 384c16.38-29.38 14.91-73.13-25.23-128C485.1 201.1 486.5 157.4 470.2 128zM95.34 352c-4.001-7.25-.1251-24.75 15-48.25c6.876 6.5 14.13 12.87 21.88 19.12c1.625 13.75 4.001 27.13 6.751 40.13C114.3 363.9 99.09 358.6 95.34 352zM132.2 189.1C124.5 195.4 117.2 201.8 110.3 208.2C95.22 184.8 91.34 167.2 95.34 160c3.376-6.125 16.38-11.5 37.88-11.5c1.75 0 3.876 .375 5.751 .375C136.1 162.2 133.8 175.6 132.2 189.1zM256 64c9.502 0 22.25 13.5 33.88 37.25C278.6 105 267.4 109.3 256 114.1C244.6 109.3 233.4 105 222.1 101.2C233.7 77.5 246.5 64 256 64zM256 448c-9.502 0-22.25-13.5-33.88-37.25C233.4 407 244.6 402.7 256 397.9c11.38 4.875 22.63 9.135 33.88 12.89C278.3 434.5 265.5 448 256 448zM256 336c-44.13 0-80.02-35.88-80.02-80S211.9 176 256 176s80.02 35.88 80.02 80S300.1 336 256 336zM416.7 352c-3.626 6.625-19 11.88-43.63 11c2.751-12.1 5.126-26.38 6.751-40.13c7.752-6.25 15-12.63 21.88-19.12C416.8 327.2 420.7 344.8 416.7 352zM401.7 208.2c-6.876-6.5-14.13-12.87-21.88-19.12c-1.625-13.5-3.876-26.88-6.751-40.25c1.875 0 4.001-.375 5.751-.375c21.5 0 34.51 5.375 37.88 11.5C420.7 167.2 416.8 184.8 401.7 208.2z"],"audio-description":[576,512,[],"f29e","M170.8 280H213.2L192 237.7L170.8 280zM512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM274.7 349.5C271.3 351.2 267.6 352 264 352c-8.812 0-17.28-4.859-21.5-13.27L233.2 320H150.8l-9.367 18.73c-5.906 11.86-20.31 16.7-32.19 10.73c-11.88-5.938-16.69-20.34-10.75-32.2l72-144c8.125-16.25 34.81-16.25 42.94 0l72 144C291.4 329.1 286.6 343.5 274.7 349.5zM384 352h-56c-13.25 0-24-10.75-24-24v-144C304 170.8 314.8 160 328 160H384c52.94 0 96 43.06 96 96S436.9 352 384 352zM384 208h-32v96h32c26.47 0 48-21.53 48-48S410.5 208 384 208z"],"austral-sign":[448,512,[],"e0a9","M325.3 224H416C433.7 224 448 238.3 448 256C448 273.7 433.7 288 416 288H352L365.3 320H416C433.7 320 448 334.3 448 352C448 369.7 433.7 384 416 384H392L413.5 435.7C420.3 452 412.6 470.7 396.3 477.5C379.1 484.3 361.3 476.6 354.5 460.3L322.7 384H125.3L93.54 460.3C86.74 476.6 68.01 484.3 51.69 477.5C35.38 470.7 27.66 452 34.46 435.7L56 384H32C14.33 384 0 369.7 0 352C0 334.3 14.33 320 32 320H82.67L96 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H122.7L194.5 51.69C199.4 39.77 211.1 32 224 32C236.9 32 248.6 39.77 253.5 51.69L325.3 224zM256 224L223.1 147.2L191.1 224H256zM165.3 288L151.1 320H296L282.7 288H165.3z"],award:[384,512,[],"f559","M288 358.3c13.98-8.088 17.53-30.04 28.88-41.39c11.35-11.35 33.3-14.88 41.39-28.87c7.98-13.79 .1658-34.54 4.373-50.29C366.7 222.5 383.1 208.5 383.1 192c0-16.5-17.27-30.52-21.34-45.73c-4.207-15.75 3.612-36.5-4.365-50.29c-8.086-13.98-30.03-17.52-41.38-28.87c-11.35-11.35-14.89-33.3-28.87-41.39c-13.79-7.979-34.54-.1637-50.29-4.375C222.5 17.27 208.5 0 192 0C175.5 0 161.5 17.27 146.3 21.34C130.5 25.54 109.8 17.73 95.98 25.7C82 33.79 78.46 55.74 67.11 67.08C55.77 78.43 33.81 81.97 25.72 95.95C17.74 109.7 25.56 130.5 21.35 146.2C17.27 161.5 .0008 175.5 .0008 192c0 16.5 17.27 30.52 21.34 45.73c4.207 15.75-3.615 36.5 4.361 50.29C33.8 302 55.74 305.5 67.08 316.9c11.35 11.35 14.89 33.3 28.88 41.4c13.79 7.979 34.53 .1582 50.28 4.369C161.5 366.7 175.5 384 192 384c16.5 0 30.52-17.27 45.74-21.34C253.5 358.5 274.2 366.3 288 358.3zM112 192c0-44.27 35.81-80 80-80s80 35.73 80 80c0 44.17-35.81 80-80 80S112 236.2 112 192zM1.719 433.2c-3.25 8.188-1.781 17.48 3.875 24.25c5.656 6.75 14.53 9.898 23.12 8.148l45.19-9.035l21.43 42.27C99.46 507 107.6 512 116.7 512c.3438 0 .6641-.0117 1.008-.0273c9.5-.375 17.65-6.082 21.24-14.88l33.58-82.08c-53.71-4.639-102-28.12-138.2-63.95L1.719 433.2zM349.6 351.1c-36.15 35.83-84.45 59.31-138.2 63.95l33.58 82.08c3.594 8.797 11.74 14.5 21.24 14.88C266.6 511.1 266.1 512 267.3 512c9.094 0 17.23-4.973 21.35-13.14l21.43-42.28l45.19 9.035c8.594 1.75 17.47-1.398 23.12-8.148c5.656-6.766 7.125-16.06 3.875-24.25L349.6 351.1z"],b:[320,512,[98],"42","M257.1 242.4C276.1 220.1 288 191.6 288 160c0-70.58-57.42-128-128-128H32c-17.67 0-32 14.33-32 32v384c0 17.67 14.33 32 32 32l160-.0049c70.58 0 128-57.42 128-128C320 305.3 294.6 264.8 257.1 242.4zM64 96.01h96c35.3 0 64 28.7 64 64s-28.7 64-64 64H64V96.01zM192 416H64v-128h128c35.3 0 64 28.7 64 64S227.3 416 192 416z"],baby:[448,512,[],"f77c","M156.8 411.8l31.22-31.22l-60.04-53.09l-52.29 52.28C61.63 393.8 60.07 416.1 72 432l48 64C127.9 506.5 139.9 512 152 512c8.345 0 16.78-2.609 23.97-8c17.69-13.25 21.25-38.33 8-56L156.8 411.8zM224 159.1c44.25 0 79.99-35.75 79.99-79.1S268.3 0 224 0S144 35.75 144 79.1S179.8 159.1 224 159.1zM408.7 145c-12.75-18.12-37.63-22.38-55.76-9.75l-40.63 28.5c-52.63 37-124.1 37-176.8 0l-40.63-28.5C76.84 122.6 51.97 127 39.22 145C26.59 163.1 30.97 188 48.97 200.8l40.63 28.5C101.7 237.7 114.7 244.3 128 250.2L128 288h192l.0002-37.71c13.25-5.867 26.22-12.48 38.34-21.04l40.63-28.5C417.1 188 421.4 163.1 408.7 145zM320 327.4l-60.04 53.09l31.22 31.22L264 448c-13.25 17.67-9.689 42.75 8 56C279.2 509.4 287.6 512 295.1 512c12.16 0 24.19-5.516 32.03-16l48-64c11.94-15.92 10.38-38.2-3.719-52.28L320 327.4z"],"baby-carriage":[512,512,["carriage-baby"],"f77d","M255.1 192H.1398C2.741 117.9 41.34 52.95 98.98 14.1C112.2 5.175 129.8 9.784 138.9 22.92L255.1 192zM384 160C384 124.7 412.7 96 448 96H480C497.7 96 512 110.3 512 128C512 145.7 497.7 160 480 160H448V224C448 249.2 442.2 274.2 430.9 297.5C419.7 320.8 403.2 341.9 382.4 359.8C361.6 377.6 336.9 391.7 309.7 401.4C282.5 411 253.4 416 223.1 416C194.6 416 165.5 411 138.3 401.4C111.1 391.7 86.41 377.6 65.61 359.8C44.81 341.9 28.31 320.8 17.05 297.5C5.794 274.2 0 249.2 0 224H384L384 160zM31.1 464C31.1 437.5 53.49 416 79.1 416C106.5 416 127.1 437.5 127.1 464C127.1 490.5 106.5 512 79.1 512C53.49 512 31.1 490.5 31.1 464zM416 464C416 490.5 394.5 512 368 512C341.5 512 320 490.5 320 464C320 437.5 341.5 416 368 416C394.5 416 416 437.5 416 464z"],backward:[512,512,[9194],"f04a","M459.5 71.41l-171.5 142.9v83.45l171.5 142.9C480.1 457.7 512 443.3 512 415.1V96.03C512 68.66 480.1 54.28 459.5 71.41zM203.5 71.41L11.44 231.4c-15.25 12.87-15.25 36.37 0 49.24l192 159.1c20.63 17.12 52.51 2.749 52.51-24.62v-319.9C255.1 68.66 224.1 54.28 203.5 71.41z"],"backward-fast":[512,512,[9198,"fast-backward"],"f049","M0 415.1V96.03c0-17.67 14.33-31.1 31.1-31.1C49.67 64.03 64 78.36 64 96.03v131.8l171.5-156.5C256.1 54.28 288 68.66 288 96.03v131.9l171.5-156.5C480.1 54.28 512 68.66 512 96.03v319.9c0 27.37-31.88 41.74-52.5 24.62L288 285.2v130.7c0 27.37-31.88 41.74-52.5 24.62L64 285.2v130.7c0 17.67-14.33 31.1-31.1 31.1C14.33 447.1 0 433.6 0 415.1z"],"backward-step":[320,512,["step-backward"],"f048","M31.1 64.03c-17.67 0-31.1 14.33-31.1 32v319.9c0 17.67 14.33 32 32 32C49.67 447.1 64 433.6 64 415.1V96.03C64 78.36 49.67 64.03 31.1 64.03zM267.5 71.41l-192 159.1C67.82 237.8 64 246.9 64 256c0 9.094 3.82 18.18 11.44 24.62l192 159.1c20.63 17.12 52.51 2.75 52.51-24.62v-319.9C319.1 68.66 288.1 54.28 267.5 71.41z"],bacon:[576,512,[129363],"f7e5","M29.34 432.5l-18.06-20.15c-9.406-10.47-13.25-25.3-10.31-39.65c2.813-13.71 11.23-24.74 23.09-30.23l68.88-31.94c47.95-22.25 87.64-60.2 114.8-109.8l20.66-37.76c28.77-52.59 70.98-92.93 122.1-116.6l92.75-42.99c14.84-6.812 32.41-3.078 43.69 9.518l34.08 38.01l-104.8 48.56c-55.72 25.83-101.7 69.73-133 127L261.3 266.5c-28.03 51.22-69 90.42-118.5 113.4L29.34 432.5zM564.7 99.68l-21.4-23.87l-113.6 52.68c-49.47 22.94-90.44 62.11-118.5 113.3L289.3 281.9c-31.33 57.27-77.34 101.2-133.1 127l-104.5 48.43l37.43 41.74C96.64 507.5 106.1 512 117.5 512c5.188 0 10.41-1.11 15.33-3.375l92.75-42.99c51.13-23.69 93.34-64.03 122.1-116.6l20.66-37.76c27.11-49.56 66.8-87.5 114.8-109.8l68.88-31.94c11.86-5.486 20.28-16.52 23.09-30.23C577.1 124.1 574.1 110.1 564.7 99.68z"],bacteria:[640,512,[],"e059","M627.3 227.3c9.439-2.781 14.81-12.65 12-22.04c-3.039-10.21-13.57-14.52-22.14-11.95l-11.27 3.33c-8.086-15.15-20.68-27.55-36.4-35.43l2.888-11.06c1.867-7.158-1.9-22.19-17.26-22.19c-7.92 0-15.14 5.288-17.23 13.28l-2.865 10.97c-7.701-.2793-26.9-.6485-48.75 13.63L477.6 157.1c-3.777-3.873-15.44-9.779-25.19-.3691c-7.062 6.822-7.225 18.04-.3711 25.07l9.14 9.373c-11.96 18.85-10.27 28.38-15.88 46.61c-8.023-3.758-11.44-5.943-16.66-5.943c-6.689 0-13.09 3.763-16.13 10.19c-4.188 8.856-.3599 19.42 8.546 23.58l8.797 4.115c-14.91 22.05-34.42 33.57-34.83 33.83l-3.922-8.855C387.2 285.8 376.7 281.7 367.7 285.6c-9 3.959-13.08 14.42-9.115 23.39l4.041 9.127c-16.38 4.559-27.93 4.345-46.15 16.94l-9.996-9.012c-6.969-6.303-18.28-6.33-25.15 1.235c-6.609 7.26-6.053 18.47 1.24 25.04l9.713 8.756c-8.49 14.18-12.74 30.77-11.64 48.17l-11.86 3.512c-9.428 2.793-14.8 12.66-11.99 22.05c2.781 9.385 12.69 14.71 22.15 11.94l11.34-3.359c8.287 15.49 20.99 27.86 36.38 35.57l-2.839 10.85c-2.482 9.477 3.224 19.16 12.75 21.62c9.566 2.482 19.25-3.221 21.72-12.69l2.82-10.78c5.508 .1875 11.11-.1523 16.75-1.102c11.37-1.893 22.23-5.074 33.1-8.24l3.379 9.455c3.305 9.225 13.5 14.11 22.75 10.76c9.266-3.279 14.1-13.41 10.81-22.65l-3.498-9.792c15.41-6.654 30.08-14.46 43.95-23.57l6.321 8.429c5.891 7.84 17.05 9.443 24.93 3.602c7.885-5.863 9.498-16.97 3.617-24.82l-6.457-8.611c12.66-10.78 24.33-22.54 34.96-35.33l8.816 6.413c7.932 5.795 19.07 4.074 24.89-3.855c5.809-7.908 4.072-18.1-3.874-24.77l-8.885-6.465c8.893-13.88 16.54-28.52 22.99-43.91l10.47 3.59c9.334 3.186 19.43-1.719 22.64-10.99c3.211-9.258-1.739-19.35-11.04-22.53l-10.33-3.541c5.744-20.5 9.424-31.81 8.338-49.26L627.3 227.3zM416 416c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32c17.67 0 32 14.33 32 32C448 401.7 433.7 416 416 416zM272.3 226.4c9-3.959 13.08-14.42 9.115-23.39L277.4 193.9c16.38-4.561 27.93-4.345 46.15-16.94l9.996 9.012c6.969 6.301 18.28 6.326 25.15-1.236c6.609-7.26 6.053-18.47-1.24-25.04l-9.713-8.756c8.49-14.18 12.74-30.77 11.64-48.18l11.86-3.511c9.428-2.793 14.8-12.66 11.99-22.05c-2.781-9.385-12.69-14.71-22.15-11.94l-11.34 3.357C341.5 53.13 328.8 40.76 313.4 33.05l2.838-10.85C318.7 12.73 313 3.04 303.5 .5811c-9.566-2.482-19.25 3.222-21.72 12.69l-2.82 10.78C273.4 23.86 267.8 24.2 262.2 25.15C250.8 27.04 239.1 30.22 229.1 33.39L225.7 23.93C222.4 14.71 212.2 9.827 202.1 13.17C193.7 16.45 188.9 26.59 192.2 35.82l3.498 9.793C180.2 52.27 165.6 60.07 151.7 69.19L145.4 60.76C139.5 52.92 128.3 51.32 120.5 57.16C112.6 63.02 110.1 74.13 116.8 81.98l6.457 8.611C110.6 101.4 98.96 113.1 88.34 125.9L79.52 119.5c-7.932-5.795-19.08-4.074-24.89 3.855c-5.809 7.908-4.07 19 3.875 24.77l8.885 6.465C58.5 168.5 50.86 183.1 44.41 198.5L33.93 194.9c-9.334-3.186-19.44 1.721-22.64 10.99C8.086 215.2 13.04 225.3 22.34 228.4l10.33 3.541C26.93 252.5 23.25 263.8 24.33 281.2L12.75 284.7C3.309 287.4-2.061 297.3 .7441 306.7c3.041 10.21 13.57 14.52 22.14 11.95l11.27-3.33c8.086 15.15 20.68 27.55 36.39 35.43l-2.887 11.06c-1.865 7.156 1.902 22.19 17.26 22.19c7.92 0 15.14-5.287 17.23-13.28l2.863-10.97c7.701 .2773 26.9 .6465 48.76-13.63l8.59 8.809c3.777 3.873 15.44 9.779 25.19 .3691c7.062-6.822 7.225-18.04 .3711-25.07l-9.14-9.373c11.96-18.85 10.27-28.38 15.88-46.61c8.025 3.756 11.44 5.943 16.66 5.943c6.689 0 13.09-3.762 16.13-10.19C231.6 261.1 227.8 250.6 218.9 246.4L210.1 242.3C225 220.2 244.5 208.7 244.9 208.5l3.922 8.856C252.8 226.2 263.3 230.3 272.3 226.4zM128 256C110.3 256 96 241.7 96 223.1c0-17.67 14.33-32 32-32c17.67 0 32 14.33 32 32C160 241.7 145.7 256 128 256zM208 160c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C224 152.8 216.8 160 208 160z"],bacterium:[576,512,[],"e05a","M543 102.9c-3.711-12.51-16.92-19.61-29.53-15.92l-15.12 4.48c-11.05-20.65-27.98-37.14-48.5-47.43l3.783-14.46c3.309-12.64-4.299-25.55-16.99-28.83c-12.76-3.309-25.67 4.295-28.96 16.92l-3.76 14.37c-9.947-.3398-26.22 .1016-66.67 11.88l-4.301-12.03c-4.406-12.3-17.1-18.81-30.34-14.34c-12.35 4.371-18.8 17.88-14.41 30.2l4.303 12.04c-20.6 8.889-40.16 19.64-58.69 31.83L225.9 81.01C217.1 70.56 203.1 68.42 192.6 76.21C182.1 84.03 179.9 98.83 187.8 109.3l7.975 10.63C178.8 134.3 163.3 150.3 149.1 167.4L138 159.3C127.5 151.6 112.6 153.9 104.8 164.5c-7.748 10.54-5.428 25.33 5.164 33.03l11.09 8.066C109.2 224.1 98.79 243.7 90.18 264.3l-12.93-4.431c-12.45-4.248-25.92 2.293-30.18 14.65C42.78 286.9 49.38 300.3 61.78 304.6l13.05 4.474c-11.86 42.33-11.02 55.76-10.39 65.93l-15.45 4.566c-12.59 3.709-19.74 16.87-16 29.38c4.053 13.61 18.1 19.36 29.52 15.93l15.02-4.441c10.78 20.21 27.57 36.73 48.53 47.24l-3.852 14.75C119.7 491.1 124.8 512 145.2 512c10.56 0 20.19-7.049 22.98-17.7l3.816-14.63c10.2 .377 35.85 .873 65.01-18.17l11.45 11.74c5.037 5.164 20.59 13.04 33.58 .4922c9.416-9.096 9.633-24.06 .4941-33.43l-12.19-12.5c7.805-12.29 13.56-26.13 16.11-41.4c1.186-7.107 3.082-13.95 5.158-20.7c10.66 4.988 15.16 7.881 22.12 7.881c8.922 0 17.46-5.018 21.51-13.59c5.582-11.8 .4785-25.89-11.4-31.45l-11.73-5.486c20.09-29.62 45.89-44.76 46.44-45.11l5.23 11.81c5.273 11.86 19.19 17.36 31.33 12.1c11.1-5.279 17.44-19.22 12.15-31.18L401.9 258.5c5.438-1.512 10.86-3.078 16.52-4.021c16.8-2.797 31.88-9.459 45.02-18.54l13.33 12.02c9.289 8.395 24.37 8.439 33.54-1.648c8.814-9.68 8.072-24.62-1.654-33.38l-12.95-11.68c11.32-18.9 16.99-41.02 15.52-64.23l15.81-4.681C539.6 128.6 546.7 115.4 543 102.9zM192 368c-26.51 0-48.01-21.49-48.01-48s21.5-48 48.01-48S240.1 293.5 240.1 320S218.6 368 192 368zM272 232c-13.25 0-23.92-10.75-23.92-24c0-13.26 10.67-23.1 23.92-23.1c13.26 0 23.1 10.74 23.1 23.1C295.1 221.3 285.3 232 272 232z"],"bag-shopping":[448,512,["shopping-bag"],"f290","M112 112C112 50.14 162.1 0 224 0C285.9 0 336 50.14 336 112V160H400C426.5 160 448 181.5 448 208V416C448 469 405 512 352 512H96C42.98 512 0 469 0 416V208C0 181.5 21.49 160 48 160H112V112zM160 160H288V112C288 76.65 259.3 48 224 48C188.7 48 160 76.65 160 112V160zM136 256C149.3 256 160 245.3 160 232C160 218.7 149.3 208 136 208C122.7 208 112 218.7 112 232C112 245.3 122.7 256 136 256zM312 208C298.7 208 288 218.7 288 232C288 245.3 298.7 256 312 256C325.3 256 336 245.3 336 232C336 218.7 325.3 208 312 208z"],bahai:[512,512,["haykal"],"f666","M496.3 202.5l-110-15.38l41.88-104.4c6.625-16.63-11.63-32.25-26.63-22.63L307.5 120l-34.13-107.1C270.6 4.25 263.4 0 255.1 0C248.6 0 241.4 4.25 238.6 12.88L204.5 120L110.5 60.12c-15-9.5-33.22 5.1-26.6 22.63l41.85 104.4L15.71 202.5C-1.789 205-5.915 228.8 9.71 237.2l98.14 52.63l-74.51 83.5c-10.88 12.25-1.78 31 13.35 31c1.25 0 2.657-.25 4.032-.5l108.6-23.63l-4.126 112.5C154.7 504.4 164.1 512 173.6 512c5.125 0 10.38-2.25 14.25-7.25l68.13-88.88l68.23 88.88C327.1 509.8 333.2 512 338.4 512c9.5 0 18.88-7.625 18.38-19.25l-4.032-112.5l108.5 23.63c17.38 3.75 29.25-17.25 17.38-30.5l-74.51-83.5l98.14-52.72C517.9 228.8 513.8 205 496.3 202.5zM338.5 311.6L286.6 300.4l2 53.75l-32.63-42.5l-32.63 42.5l2-53.75L173.5 311.6l35.63-39.87L162.1 246.6L214.7 239.2L194.7 189.4l45 28.63L255.1 166.8l16.25 51.25l45-28.63L297.2 239.2l52.63 7.375l-47 25.13L338.5 311.6z"],"baht-sign":[320,512,[],"e0ac","M176 32V64C237.9 64 288 114.1 288 176C288 200.2 280.3 222.6 267.3 240.9C298.9 260.7 320 295.9 320 336C320 397.9 269.9 448 208 448H176V480C176 497.7 161.7 512 144 512C126.3 512 112 497.7 112 480V448H41.74C18.69 448 0 429.3 0 406.3V101.6C0 80.82 16.82 64 37.57 64H112V32C112 14.33 126.3 0 144 0C161.7 0 176 14.33 176 32V32zM112 128H64V224H112V128zM224 176C224 149.5 202.5 128 176 128V224C202.5 224 224 202.5 224 176zM112 288H64V384H112V288zM208 384C234.5 384 256 362.5 256 336C256 309.5 234.5 288 208 288H176V384H208z"],ban:[512,512,[128683,"cancel"],"f05e","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM99.5 144.8C77.15 176.1 64 214.5 64 256C64 362 149.1 448 256 448C297.5 448 335.9 434.9 367.2 412.5L99.5 144.8zM448 256C448 149.1 362 64 256 64C214.5 64 176.1 77.15 144.8 99.5L412.5 367.2C434.9 335.9 448 297.5 448 256V256z"],"ban-smoking":[512,512,[128685,"smoking-ban"],"f54d","M96 304C96 312.8 103.3 320 112 320h117.5l-96-96H112C103.3 224 96 231.3 96 240V304zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 448c-105.9 0-192-86.13-192-192c0-41.38 13.25-79.75 35.75-111.1l267.4 267.4C335.8 434.8 297.4 448 256 448zM301.2 256H384v32h-50.81L301.2 256zM412.3 367.1L365.2 320H400c8.75 0 16-7.25 16-16v-64C416 231.3 408.8 224 400 224h-130.8L144.9 99.75C176.3 77.25 214.6 64 256 64C361.9 64 448 150.1 448 256C448 297.4 434.8 335.8 412.3 367.1zM320.6 128C305 128 292 116.8 289.3 102.1C288.5 98.5 285.3 96 281.5 96h-16.25c-5 0-8.625 4.5-8 9.375C261.9 136.3 288.5 160 320.6 160C336.3 160 349.3 171.3 352 185.9C352.8 189.5 356 192 359.8 192h16.17c5 0 8.708-4.5 7.958-9.375C379.3 151.7 352.8 128 320.6 128z"],bandage:[640,512,[129657,"band-aid"],"f462","M480 96H576C611.3 96 640 124.7 640 160V352C640 387.3 611.3 416 576 416H480V96zM448 416H192V96H448V416zM272 184C258.7 184 248 194.7 248 208C248 221.3 258.7 232 272 232C285.3 232 296 221.3 296 208C296 194.7 285.3 184 272 184zM368 232C381.3 232 392 221.3 392 208C392 194.7 381.3 184 368 184C354.7 184 344 194.7 344 208C344 221.3 354.7 232 368 232zM272 280C258.7 280 248 290.7 248 304C248 317.3 258.7 328 272 328C285.3 328 296 317.3 296 304C296 290.7 285.3 280 272 280zM368 328C381.3 328 392 317.3 392 304C392 290.7 381.3 280 368 280C354.7 280 344 290.7 344 304C344 317.3 354.7 328 368 328zM64 96H160V416H64C28.65 416 0 387.3 0 352V160C0 124.7 28.65 96 64 96z"],barcode:[512,512,[],"f02a","M40 32C53.25 32 64 42.75 64 56V456C64 469.3 53.25 480 40 480H24C10.75 480 0 469.3 0 456V56C0 42.75 10.75 32 24 32H40zM128 48V464C128 472.8 120.8 480 112 480C103.2 480 96 472.8 96 464V48C96 39.16 103.2 32 112 32C120.8 32 128 39.16 128 48zM200 32C213.3 32 224 42.75 224 56V456C224 469.3 213.3 480 200 480H184C170.7 480 160 469.3 160 456V56C160 42.75 170.7 32 184 32H200zM296 32C309.3 32 320 42.75 320 56V456C320 469.3 309.3 480 296 480H280C266.7 480 256 469.3 256 456V56C256 42.75 266.7 32 280 32H296zM448 56C448 42.75 458.7 32 472 32H488C501.3 32 512 42.75 512 56V456C512 469.3 501.3 480 488 480H472C458.7 480 448 469.3 448 456V56zM384 48C384 39.16 391.2 32 400 32C408.8 32 416 39.16 416 48V464C416 472.8 408.8 480 400 480C391.2 480 384 472.8 384 464V48z"],bars:[448,512,["navicon"],"f0c9","M0 96C0 78.33 14.33 64 32 64H416C433.7 64 448 78.33 448 96C448 113.7 433.7 128 416 128H32C14.33 128 0 113.7 0 96zM0 256C0 238.3 14.33 224 32 224H416C433.7 224 448 238.3 448 256C448 273.7 433.7 288 416 288H32C14.33 288 0 273.7 0 256zM416 448H32C14.33 448 0 433.7 0 416C0 398.3 14.33 384 32 384H416C433.7 384 448 398.3 448 416C448 433.7 433.7 448 416 448z"],"bars-progress":[512,512,["tasks-alt"],"f828","M464 64C490.5 64 512 85.49 512 112V176C512 202.5 490.5 224 464 224H48C21.49 224 0 202.5 0 176V112C0 85.49 21.49 64 48 64H464zM448 128H320V160H448V128zM464 288C490.5 288 512 309.5 512 336V400C512 426.5 490.5 448 464 448H48C21.49 448 0 426.5 0 400V336C0 309.5 21.49 288 48 288H464zM192 352V384H448V352H192z"],"bars-staggered":[512,512,["reorder","stream"],"f550","M0 96C0 78.33 14.33 64 32 64H416C433.7 64 448 78.33 448 96C448 113.7 433.7 128 416 128H32C14.33 128 0 113.7 0 96zM64 256C64 238.3 78.33 224 96 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H96C78.33 288 64 273.7 64 256zM416 448H32C14.33 448 0 433.7 0 416C0 398.3 14.33 384 32 384H416C433.7 384 448 398.3 448 416C448 433.7 433.7 448 416 448z"],baseball:[512,512,[129358,9918,"baseball-ball"],"f433","M429.6 272.9c0-16.26 16.36-16.81 29.99-16.81l2.931 .0029c16.64 0 33.14 2.056 49.2 5.834C511.7 259.9 512 258 512 256c0-141.4-114.6-256-256-256C253.9 0 251.1 .2578 249.9 .3047c3.658 15.51 6.111 31.34 6.111 47.54c0 6-.2813 12.03-.7813 18C254.6 74.19 247.6 80.5 239.3 80.5c-6.091 0-16.03-4.68-16.03-15.97c0-1.733 .7149-7.153 .7149-16.69c0-15.26-2.389-30.18-6.225-44.69C106.9 19.79 19.5 107.3 3.08 218.3c14.44 3.819 29.38 5.79 44.45 5.79c10.07 0 15.59-.811 17.42-.811c6.229 0 16.49 4.657 16.49 15.99c0 16.11-16.13 16.77-29.73 16.77L48.16 256c-16.33 0-32.25-2.445-47.85-6.109C.2578 251.1 0 253.9 0 256c0 141.4 114.6 256 256 256c2.066 0 4.062-.2578 6.117-.3086C258.5 496.2 256 480.4 256 464.2c0-5.688 .25-11.38 .7187-17.03c.6964-8.538 8.287-14.61 16.49-14.61c7.1 0 15.44 6.938 15.44 15.92c0 2.358-.6524 5.88-.6524 15.72c0 15.25 2.383 30.16 6.209 44.66c110.8-16.63 198.2-104.1 214.7-215c-14.55-3.851-29.59-5.871-44.74-5.871c-10.47 0-16.24 .895-18.13 .895C443.3 288.9 429.6 286.5 429.6 272.9zM238.2 128.9c0 27.78-78.3 108.1-108.6 108.1c-8.612 0-16.01-6.963-16.01-15.98c0-6.002 3.394-11.75 9.163-14.49c80.3-38.08 76.21-94.5 99.39-94.5C234.7 112.8 238.2 124.2 238.2 128.9zM397.5 290.6c0 5.965-3.364 11.68-9.131 14.43c-78.82 37.57-75.92 95-98.94 95c-12.58 0-16.01-11.54-16.01-16.03c0-28 78.29-109.4 108.1-109.4C390.8 274.6 397.5 282.3 397.5 290.6z"],"baseball-bat-ball":[640,512,[],"f432","M57.89 397.2c-6.262-8.616-16.02-13.19-25.92-13.19c-23.33 0-31.98 20.68-31.98 32.03c0 6.522 1.987 13.1 6.115 18.78l46.52 64C58.89 507.4 68.64 512 78.55 512c23.29 0 31.97-20.66 31.97-32.03c0-6.522-1.988-13.1-6.115-18.78L57.89 397.2zM496.1 352c-44.13 0-79.72 35.75-79.72 80s35.59 80 79.72 80s79.91-35.75 79.91-80S540.2 352 496.1 352zM640 99.38c0-13.61-4.133-27.34-12.72-39.2l-23.63-32.5c-13.44-18.5-33.77-27.68-54.12-27.68c-13.89 0-27.79 4.281-39.51 12.8L307.8 159.7C262.2 192.8 220.4 230.9 183.4 273.4c-24.22 27.88-59.18 63.99-103.5 99.63l56.34 77.52c53.79-35.39 99.15-55.3 127.1-67.27c51.88-22 101.3-49.87 146.9-82.1l202.3-146.7C630.5 140.4 640 120 640 99.38z"],"basket-shopping":[576,512,["shopping-basket"],"f291","M171.7 191.1H404.3L322.7 35.07C316.6 23.31 321.2 8.821 332.9 2.706C344.7-3.409 359.2 1.167 365.3 12.93L458.4 191.1H544C561.7 191.1 576 206.3 576 223.1C576 241.7 561.7 255.1 544 255.1L492.1 463.5C484.1 492 459.4 512 430 512H145.1C116.6 512 91 492 83.88 463.5L32 255.1C14.33 255.1 0 241.7 0 223.1C0 206.3 14.33 191.1 32 191.1H117.6L210.7 12.93C216.8 1.167 231.3-3.409 243.1 2.706C254.8 8.821 259.4 23.31 253.3 35.07L171.7 191.1zM191.1 303.1C191.1 295.1 184.8 287.1 175.1 287.1C167.2 287.1 159.1 295.1 159.1 303.1V399.1C159.1 408.8 167.2 415.1 175.1 415.1C184.8 415.1 191.1 408.8 191.1 399.1V303.1zM271.1 303.1V399.1C271.1 408.8 279.2 415.1 287.1 415.1C296.8 415.1 304 408.8 304 399.1V303.1C304 295.1 296.8 287.1 287.1 287.1C279.2 287.1 271.1 295.1 271.1 303.1zM416 303.1C416 295.1 408.8 287.1 400 287.1C391.2 287.1 384 295.1 384 303.1V399.1C384 408.8 391.2 415.1 400 415.1C408.8 415.1 416 408.8 416 399.1V303.1z"],basketball:[512,512,[127936,"basketball-ball"],"f434","M148.7 171.3L64.21 86.83c-28.39 32.16-48.9 71.38-58.3 114.8C19.41 205.4 33.34 208 48 208C86.34 208 121.1 193.9 148.7 171.3zM194.5 171.9L256 233.4l169.2-169.2C380 24.37 320.9 0 256 0C248.6 0 241.2 .4922 233.1 1.113C237.8 16.15 240 31.8 240 48C240 95.19 222.8 138.4 194.5 171.9zM208 48c0-14.66-2.623-28.59-6.334-42.09C158.2 15.31 118.1 35.82 86.83 64.21l84.48 84.48C193.9 121.1 208 86.34 208 48zM171.9 194.5C138.4 222.8 95.19 240 48 240c-16.2 0-31.85-2.236-46.89-6.031C.4922 241.2 0 248.6 0 256c0 64.93 24.37 124 64.21 169.2L233.4 256L171.9 194.5zM317.5 340.1L256 278.6l-169.2 169.2C131.1 487.6 191.1 512 256 512c7.438 0 14.75-.4922 22.03-1.113C274.2 495.8 272 480.2 272 464C272 416.8 289.2 373.6 317.5 340.1zM363.3 340.7l84.48 84.48c28.39-32.16 48.9-71.38 58.3-114.8C492.6 306.6 478.7 304 464 304C425.7 304 390.9 318.1 363.3 340.7zM447.8 86.83L278.6 256l61.52 61.52C373.6 289.2 416.8 272 464 272c16.2 0 31.85 2.236 46.89 6.031C511.5 270.8 512 263.4 512 256C512 191.1 487.6 131.1 447.8 86.83zM304 464c0 14.66 2.623 28.59 6.334 42.09c43.46-9.4 82.67-29.91 114.8-58.3l-84.48-84.48C318.1 390.9 304 425.7 304 464z"],bath:[512,512,[128705,"bathtub"],"f2cd","M32 384c0 28.32 12.49 53.52 32 71.09V496C64 504.8 71.16 512 80 512h32C120.8 512 128 504.8 128 496v-15.1h256V496c0 8.836 7.164 16 16 16h32c8.836 0 16-7.164 16-16v-40.9c19.51-17.57 32-42.77 32-71.09V352H32V384zM496 256H96V77.25C95.97 66.45 111 60.23 118.6 67.88L132.4 81.66C123.6 108.6 129.4 134.5 144.2 153.2C137.9 159.5 137.8 169.8 144 176l11.31 11.31c6.248 6.248 16.38 6.248 22.63 0l105.4-105.4c6.248-6.248 6.248-16.38 0-22.63l-11.31-11.31c-6.248-6.248-16.38-6.248-22.63 0C230.7 33.26 204.7 27.55 177.7 36.41L163.9 22.64C149.5 8.25 129.6 0 109.3 0C66.66 0 32 34.66 32 77.25v178.8L16 256C7.164 256 0 263.2 0 272v32C0 312.8 7.164 320 16 320h480c8.836 0 16-7.164 16-16v-32C512 263.2 504.8 256 496 256z"],"battery-empty":[576,512,["battery-0"],"f244","M464 96C508.2 96 544 131.8 544 176V192C561.7 192 576 206.3 576 224V288C576 305.7 561.7 320 544 320V336C544 380.2 508.2 416 464 416H80C35.82 416 0 380.2 0 336V176C0 131.8 35.82 96 80 96H464zM64 336C64 344.8 71.16 352 80 352H464C472.8 352 480 344.8 480 336V176C480 167.2 472.8 160 464 160H80C71.16 160 64 167.2 64 176V336z"],"battery-full":[576,512,[128267,"battery","battery-5"],"f240","M448 320H96V192H448V320zM0 176C0 131.8 35.82 96 80 96H464C508.2 96 544 131.8 544 176V192C561.7 192 576 206.3 576 224V288C576 305.7 561.7 320 544 320V336C544 380.2 508.2 416 464 416H80C35.82 416 0 380.2 0 336V176zM80 160C71.16 160 64 167.2 64 176V336C64 344.8 71.16 352 80 352H464C472.8 352 480 344.8 480 336V176C480 167.2 472.8 160 464 160H80z"],"battery-half":[576,512,["battery-3"],"f242","M288 320H96V192H288V320zM0 176C0 131.8 35.82 96 80 96H464C508.2 96 544 131.8 544 176V192C561.7 192 576 206.3 576 224V288C576 305.7 561.7 320 544 320V336C544 380.2 508.2 416 464 416H80C35.82 416 0 380.2 0 336V176zM80 160C71.16 160 64 167.2 64 176V336C64 344.8 71.16 352 80 352H464C472.8 352 480 344.8 480 336V176C480 167.2 472.8 160 464 160H80z"],"battery-quarter":[576,512,["battery-2"],"f243","M192 320H96V192H192V320zM0 176C0 131.8 35.82 96 80 96H464C508.2 96 544 131.8 544 176V192C561.7 192 576 206.3 576 224V288C576 305.7 561.7 320 544 320V336C544 380.2 508.2 416 464 416H80C35.82 416 0 380.2 0 336V176zM80 160C71.16 160 64 167.2 64 176V336C64 344.8 71.16 352 80 352H464C472.8 352 480 344.8 480 336V176C480 167.2 472.8 160 464 160H80z"],"battery-three-quarters":[576,512,["battery-4"],"f241","M352 320H96V192H352V320zM0 176C0 131.8 35.82 96 80 96H464C508.2 96 544 131.8 544 176V192C561.7 192 576 206.3 576 224V288C576 305.7 561.7 320 544 320V336C544 380.2 508.2 416 464 416H80C35.82 416 0 380.2 0 336V176zM80 160C71.16 160 64 167.2 64 176V336C64 344.8 71.16 352 80 352H464C472.8 352 480 344.8 480 336V176C480 167.2 472.8 160 464 160H80z"],bed:[640,512,[128716],"f236","M32 32C49.67 32 64 46.33 64 64V320H288V160C288 142.3 302.3 128 320 128H544C597 128 640 170.1 640 224V448C640 465.7 625.7 480 608 480C590.3 480 576 465.7 576 448V416H64V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V64C0 46.33 14.33 32 32 32zM96 208C96 163.8 131.8 128 176 128C220.2 128 256 163.8 256 208C256 252.2 220.2 288 176 288C131.8 288 96 252.2 96 208z"],"bed-pulse":[640,512,["procedures"],"f487","M524 64H616C629.3 64 640 74.75 640 88C640 101.3 629.3 112 616 112H512C504.4 112 497.3 108.4 492.8 102.4L468.7 70.31L421.7 170.2C418 178.1 410.4 183.3 401.8 183.9C393.1 184.6 384.8 180.5 380 173.3L339.2 112H216C202.7 112 192 101.3 192 88C192 74.75 202.7 64 216 64H352C360 64 367.5 68.01 371.1 74.69L396.4 111.3L442.3 13.78C445.9 6.163 453.2 .9806 461.6 .1246C469.9-.7314 478.1 2.865 483.2 9.6L524 64zM320 160H332.7L353.4 191.1C364.6 207.9 384 217.3 404.1 215.8C424.3 214.4 442.1 202.1 450.7 183.8L461.9 160H544C597 160 640 202.1 640 256V480C640 497.7 625.7 512 608 512C590.3 512 576 497.7 576 480V448H64V480C64 497.7 49.67 512 32 512C14.33 512 0 497.7 0 480V96C0 78.33 14.33 64 32 64C49.67 64 64 78.33 64 96V352H288V192C288 174.3 302.3 160 320 160zM96 240C96 195.8 131.8 160 176 160C220.2 160 256 195.8 256 240C256 284.2 220.2 320 176 320C131.8 320 96 284.2 96 240z"],"beer-mug-empty":[512,512,["beer"],"f0fc","M432 96H384V64c0-17.67-14.33-32-32-32H64C46.33 32 32 46.33 32 64v352c0 35.35 28.65 64 64 64h224c35.35 0 64-28.65 64-64v-32.08l80.66-35.94C493.5 335.1 512 306.5 512 275V176C512 131.8 476.2 96 432 96zM160 368C160 376.9 152.9 384 144 384S128 376.9 128 368v-224C128 135.1 135.1 128 144 128S160 135.1 160 144V368zM224 368C224 376.9 216.9 384 208 384S192 376.9 192 368v-224C192 135.1 199.1 128 208 128S224 135.1 224 144V368zM288 368c0 8.875-7.125 16-16 16S256 376.9 256 368v-224C256 135.1 263.1 128 272 128S288 135.1 288 144V368zM448 275c0 6.25-3.75 12-9.5 14.62L384 313.9V160h48C440.9 160 448 167.1 448 176V275z"],bell:[448,512,[61602,128276],"f0f3","M256 32V51.2C329 66.03 384 130.6 384 208V226.8C384 273.9 401.3 319.2 432.5 354.4L439.9 362.7C448.3 372.2 450.4 385.6 445.2 397.1C440 408.6 428.6 416 416 416H32C19.4 416 7.971 408.6 2.809 397.1C-2.353 385.6-.2883 372.2 8.084 362.7L15.5 354.4C46.74 319.2 64 273.9 64 226.8V208C64 130.6 118.1 66.03 192 51.2V32C192 14.33 206.3 0 224 0C241.7 0 256 14.33 256 32H256zM224 512C207 512 190.7 505.3 178.7 493.3C166.7 481.3 160 464.1 160 448H288C288 464.1 281.3 481.3 269.3 493.3C257.3 505.3 240.1 512 224 512z"],"bell-concierge":[512,512,[128718,"concierge-bell"],"f562","M280 145.3V112h16C309.3 112 320 101.3 320 88S309.3 64 296 64H215.1C202.7 64 192 74.75 192 87.1S202.7 112 215.1 112H232v33.32C119.6 157.3 32 252.4 32 368h448C480 252.4 392.4 157.3 280 145.3zM488 400h-464C10.75 400 0 410.7 0 423.1C0 437.3 10.75 448 23.1 448h464c13.25 0 24-10.75 24-23.1C512 410.7 501.3 400 488 400z"],"bell-slash":[640,512,[61943,128277],"f1f6","M186 120.5C209 85.38 245.4 59.84 288 51.2V32C288 14.33 302.3 .0003 320 .0003C337.7 .0003 352 14.33 352 32V51.2C425 66.03 480 130.6 480 208V226.8C480 273.9 497.3 319.2 528.5 354.4L535.9 362.7C544.3 372.2 546.4 385.6 541.2 397.1C540.1 397.5 540.8 397.1 540.6 398.4L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L186 120.5zM160 226.8V222.1L406.2 416H128C115.4 416 103.1 408.6 98.81 397.1C93.65 385.6 95.71 372.2 104.1 362.7L111.5 354.4C142.7 319.2 160 273.9 160 226.8V226.8zM320 512C303 512 286.7 505.3 274.7 493.3C262.7 481.3 256 464.1 256 448H384C384 464.1 377.3 481.3 365.3 493.3C353.3 505.3 336.1 512 320 512z"],"bezier-curve":[640,512,[],"f55b","M352 32C378.5 32 400 53.49 400 80V84H518.4C528.8 62.69 550.7 48 576 48C611.3 48 640 76.65 640 112C640 147.3 611.3 176 576 176C550.7 176 528.8 161.3 518.4 140H451.5C510.4 179.6 550.4 244.1 555.5 320H560C586.5 320 608 341.5 608 368V432C608 458.5 586.5 480 560 480H496C469.5 480 448 458.5 448 432V368C448 341.5 469.5 320 496 320H499.3C493.4 253 450.8 196.6 391.8 170.9C383.1 183.6 368.6 192 352 192H288C271.4 192 256.9 183.6 248.2 170.9C189.2 196.6 146.6 253 140.7 320H144C170.5 320 192 341.5 192 368V432C192 458.5 170.5 480 144 480H80C53.49 480 32 458.5 32 432V368C32 341.5 53.49 320 80 320H84.53C89.56 244.1 129.6 179.6 188.5 140H121.6C111.2 161.3 89.3 176 64 176C28.65 176 0 147.3 0 112C0 76.65 28.65 48 64 48C89.3 48 111.2 62.69 121.6 84H240V80C240 53.49 261.5 32 288 32H352zM296 136H344V88H296V136zM88 376V424H136V376H88zM552 424V376H504V424H552z"],bicycle:[640,512,[128690],"f206","M347.2 32C358.1 32 369.8 38.44 375.4 48.78L473.3 229.1C485.5 226.1 498.5 224 512 224C582.7 224 640 281.3 640 352C640 422.7 582.7 480 512 480C441.3 480 384 422.7 384 352C384 311.1 402.4 276.3 431.1 252.8L409.4 212.7L324.7 356.2C320.3 363.5 312.5 368 304 368H255C247.1 431.1 193.3 480 128 480C57.31 480 0 422.7 0 352C0 281.3 57.31 224 128 224C138.7 224 149.2 225.3 159.2 227.8L185.8 174.7L163.7 144H120C106.7 144 96 133.3 96 120C96 106.7 106.7 96 120 96H176C183.7 96 190.1 99.71 195.5 105.1L222.9 144H372.3L337.7 80H311.1C298.7 80 287.1 69.25 287.1 56C287.1 42.75 298.7 32 311.1 32H347.2zM440 352C440 391.8 472.2 424 512 424C551.8 424 584 391.8 584 352C584 312.2 551.8 280 512 280C508.2 280 504.5 280.3 500.8 280.9L533.1 340.6C539.4 352.2 535.1 366.8 523.4 373.1C511.8 379.4 497.2 375.1 490.9 363.4L458.6 303.7C447 316.5 440 333.4 440 352V352zM108.8 328.6L133.1 280.2C131.4 280.1 129.7 280 127.1 280C88.24 280 55.1 312.2 55.1 352C55.1 391.8 88.24 424 127.1 424C162.3 424 190.9 400.1 198.2 368H133.2C112.1 368 99.81 346.7 108.8 328.6H108.8zM290.3 320L290.4 319.9L217.5 218.7L166.8 320H290.3zM257.4 192L317 274.8L365.9 192H257.4z"],binoculars:[512,512,[],"f1e5","M416 48C416 39.13 408.9 32 400 32h-64C327.1 32 320 39.13 320 48V96h96.04L416 48zM63.88 160.1C61.34 253.9 3.5 274.3 0 404V448c0 17.6 14.4 32 32 32h128c17.6 0 32-14.4 32-32V128H95.88C78.26 128 64.35 142.5 63.88 160.1zM448.1 160.1C447.6 142.5 433.7 128 416.1 128H320v320c0 17.6 14.4 32 32 32h128c17.6 0 32-14.4 32-32v-44C508.5 274.3 450.7 253.9 448.1 160.1zM224 288h64V128H224V288zM176 32h-64C103.1 32 96 39.13 96 48L95.96 96H192V48C192 39.13 184.9 32 176 32z"],biohazard:[576,512,[9763],"f780","M575.5 283.5c-13.13-39.11-39.5-71.98-74.13-92.35c-17.5-10.37-36.25-16.62-55.25-19.87c6-17.75 10-36.49 10-56.24c0-40.99-14.5-80.73-41-112.2c-2.5-3-6.625-3.623-10-1.75c-3.25 1.875-4.75 5.998-3.625 9.748c4.5 13.75 6.625 26.24 6.625 38.49c0 67.73-53.76 122.8-120 122.8s-120-55.11-120-122.8c0-12.12 2.25-24.74 6.625-38.49c1.125-3.75-.375-7.873-3.625-9.748c-3.375-1.873-7.502-1.25-10 1.75C134.7 34.3 120.1 74.04 120.1 115c0 19.75 3.875 38.49 10 56.24C111.2 174.5 92.32 180.8 74.82 191.1c-34.63 20.49-61.01 53.24-74.38 92.35c-1.25 3.75 .25 7.748 3.5 9.748c3.375 2 7.5 1.375 10-1.5c9.377-10.87 19-19.12 29.25-25.12c57.25-33.87 130.8-13.75 163.9 44.99c33.13 58.61 13.38 133.1-43.88 167.8c-10.25 6.123-22 10.37-35.88 13.37c-3.627 .875-6.377 4.25-6.377 8.123c.125 4 2.75 7.248 6.502 7.998c39.75 7.748 80.63 .7495 115.3-19.74c18-10.5 32.88-24.49 45.25-39.99c12.38 15.5 27.38 29.49 45.38 39.99c34.5 20.49 75.51 27.49 115.1 19.74c3.875-.75 6.375-3.998 6.5-7.998c0-3.873-2.625-7.248-6.375-8.123c-13.88-2.873-25.63-7.248-35.75-13.37c-57.38-33.87-77.01-109.2-44-167.8c33.13-58.73 106.6-78.85 164-44.99c10.12 6.123 19.75 14.25 29.13 25.12c2.5 2.875 6.752 3.5 10 1.5C575.4 291.2 576.9 287.2 575.5 283.5zM287.1 320.1c-26.5 0-48-21.49-48-47.99c0-26.49 21.5-47.99 48-47.99c26.5 0 48.01 21.49 48.01 47.99C335.1 298.6 314.5 320.1 287.1 320.1zM385 377.6c1.152 22.77 10.74 44.63 27.22 60.92c47.45-35.44 79.13-90.58 83.1-153.4c-22.58-6.173-45.69-2.743-65.57 8.76C424.7 326.9 408.5 355.1 385 377.6zM253.3 132.6c26.22-6.551 45.37-6.024 69.52 .0254c21.93-9.777 39.07-28.55 47.48-51.75C345 69.98 317.3 63.94 288.1 63.94c-29.18 0-56.96 5.986-82.16 16.84C214.3 103.1 231.4 122.8 253.3 132.6zM163.8 438.5c16.46-16.26 26.03-38.19 27.14-61.01c-23.49-21.59-39.59-50.67-44.71-83.6C126.9 282.7 103.8 278.8 80.67 285.1C84.64 347.9 116.3 403.1 163.8 438.5z"],"bitcoin-sign":[320,512,[],"e0b4","M48 32C48 14.33 62.33 0 80 0C97.67 0 112 14.33 112 32V64H144V32C144 14.33 158.3 0 176 0C193.7 0 208 14.33 208 32V64C208 65.54 207.9 67.06 207.7 68.54C254.1 82.21 288 125.1 288 176C288 200.2 280.3 222.6 267.3 240.9C298.9 260.7 320 295.9 320 336C320 397.9 269.9 448 208 448V480C208 497.7 193.7 512 176 512C158.3 512 144 497.7 144 480V448H112V480C112 497.7 97.67 512 80 512C62.33 512 48 497.7 48 480V448H41.74C18.69 448 0 429.3 0 406.3V101.6C0 80.82 16.82 64 37.57 64H48V32zM176 224C202.5 224 224 202.5 224 176C224 149.5 202.5 128 176 128H64V224H176zM64 288V384H208C234.5 384 256 362.5 256 336C256 309.5 234.5 288 208 288H64z"],blender:[512,512,[],"f517","M336 64h158.5L512 0H48C21.49 0 0 21.49 0 48v160C0 234.5 21.49 256 48 256h103.3L160 352h256l17.49-64H336C327.2 288 320 280.8 320 272S327.2 256 336 256h106.1l17.49-64H336C327.2 192 320 184.8 320 176S327.2 160 336 160h132.4l17.49-64H336C327.2 96 320 88.8 320 80S327.2 64 336 64zM64 192V64h69.88L145.5 192H64zM416 384H160c-35.38 0-64 28.62-64 64l-.0001 32c0 17.62 14.38 32 32 32h320c17.62 0 32-14.38 32-32l.0003-32C480 412.6 451.4 384 416 384zM288 480c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S305.6 480 288 480z"],"blender-phone":[576,512,[],"f6b6","M158.7 334.1L132.1 271.7C130.2 264.1 123.2 260.7 115.7 261.5l-45 4.374c-17.25-46.87-17.63-99.74 0-147.6l45 4.374C123.2 123.4 130.2 119.1 132.1 112.4l25.75-63.25C161.9 41.76 158.1 33.26 152.1 29.01L112.9 4.887C98.49-3.863 80.12-.4886 68.99 12.01C-23.64 115.6-23.01 271.5 70.99 374.5c9.875 10.75 29.13 12.5 41.75 4.75l39.38-24.12C158.1 350.9 161.7 342.4 158.7 334.1zM479.1 384H224c-35.38 0-63.1 28.62-63.1 63.1l-.0052 32c0 17.62 14.37 31.1 31.1 31.1L511.1 512c17.63 0 32-14.38 32-31.1l.0019-31.1C543.1 412.6 515.4 384 479.1 384zM352 480c-17.63 0-31.1-14.38-31.1-31.1c0-17.62 14.37-31.1 31.1-31.1s31.1 14.38 31.1 31.1C384 465.6 369.6 480 352 480zM399.1 64h158.5L576 .008L191.1 .006l-.0023 351.1h288l17.49-64h-97.49c-8.801 0-16-7.199-16-15.1c0-8.799 7.199-15.1 16-15.1h106.1l17.49-63.1h-123.6c-8.801 0-16-7.199-16-15.1c0-8.799 7.199-15.1 16-15.1h132.4l17.49-63.1h-149.9c-8.801 0-16-7.199-16-15.1C383.1 71.2 391.2 64 399.1 64z"],blog:[512,512,[],"f781","M217.6 96.1c-12.95-.625-24.66 9.156-25.52 22.37C191.2 131.7 201.2 143.1 214.4 143.1c79.53 5.188 148.4 74.09 153.6 153.6c.8281 12.69 11.39 22.43 23.94 22.43c.5156 0 1.047-.0313 1.578-.0625c13.22-.8438 23.25-12.28 22.39-25.5C409.3 191.8 320.3 102.8 217.6 96.1zM224 0C206.3 0 192 14.31 192 32s14.33 32 32 32c123.5 0 224 100.5 224 224c0 17.69 14.33 32 32 32s32-14.31 32-32C512 129.2 382.8 0 224 0zM172.3 226.8C157.7 223.9 144 235.8 144 250.6v50.37c0 10.25 7.127 18.37 16.75 21.1c18.13 6.75 31.26 24.38 31.26 44.1c0 26.5-21.5 47.1-48.01 47.1c-26.5 0-48.01-21.5-48.01-47.1V120c0-13.25-10.75-23.1-24.01-23.1l-48.01 .0076C10.75 96.02 0 106.8 0 120v247.1c0 89.5 82.14 160.2 175 140.7c54.38-11.5 98.27-55.5 109.8-109.7C302.2 316.1 247.8 241.8 172.3 226.8z"],bold:[384,512,[],"f032","M321.1 242.4C340.1 220.1 352 191.6 352 160c0-70.59-57.42-128-128-128L32 32.01c-17.67 0-32 14.31-32 32s14.33 32 32 32h16v320H32c-17.67 0-32 14.31-32 32s14.33 32 32 32h224c70.58 0 128-57.41 128-128C384 305.3 358.6 264.8 321.1 242.4zM112 96.01H224c35.3 0 64 28.72 64 64s-28.7 64-64 64H112V96.01zM256 416H112v-128H256c35.3 0 64 28.71 64 63.1S291.3 416 256 416z"],bolt:[384,512,[9889,"zap"],"f0e7","M240.5 224H352C365.3 224 377.3 232.3 381.1 244.7C386.6 257.2 383.1 271.3 373.1 280.1L117.1 504.1C105.8 513.9 89.27 514.7 77.19 505.9C65.1 497.1 60.7 481.1 66.59 467.4L143.5 288H31.1C18.67 288 6.733 279.7 2.044 267.3C-2.645 254.8 .8944 240.7 10.93 231.9L266.9 7.918C278.2-1.92 294.7-2.669 306.8 6.114C318.9 14.9 323.3 30.87 317.4 44.61L240.5 224z"],"bolt-lightning":[384,512,[],"e0b7","M381.2 172.8C377.1 164.9 368.9 160 360 160h-156.6l50.84-127.1c2.969-7.375 2.062-15.78-2.406-22.38S239.1 0 232 0h-176C43.97 0 33.81 8.906 32.22 20.84l-32 240C-.7179 267.7 1.376 274.6 5.938 279.8C10.5 285 17.09 288 24 288h146.3l-41.78 194.1c-2.406 11.22 3.469 22.56 14 27.09C145.6 511.4 148.8 512 152 512c7.719 0 15.22-3.75 19.81-10.44l208-304C384.8 190.2 385.4 180.7 381.2 172.8z"],bomb:[512,512,[128163],"f1e2","M459.1 52.39L504.8 69.22C509 70.78 512 75.12 512 79.67C512 84.15 508.1 88.38 504.8 89.83L459.1 106.7L442.6 152.5C441.1 156.9 436.7 160 432.1 160C427.5 160 423.2 156.9 421.7 152.5L404.9 106.7L359.2 89.83C355 88.38 352 84.15 352 79.67C351.1 75.12 354.1 70.78 359.2 69.22L405.2 52.39L421.7 6.548C423.6 2.623 427.8 0 432.1 0C436.5 0 440.7 2.623 442.6 6.548L459.1 52.39zM406.6 185.4C419.1 197.9 419.1 218.1 406.6 230.6L403.8 233.5C411.7 255.5 416 279.3 416 303.1C416 418.9 322.9 512 208 512C93.12 512 0 418.9 0 303.1C0 189.1 93.12 95.1 208 95.1C232.7 95.1 256.5 100.3 278.5 108.2L281.4 105.4C293.9 92.88 314.1 92.88 326.6 105.4L406.6 185.4zM207.1 192C216.8 192 223.1 184.8 223.1 176C223.1 167.2 216.8 160 207.1 160H199.1C124.9 160 63.1 220.9 63.1 296V304C63.1 312.8 71.16 320 79.1 320C88.84 320 95.1 312.8 95.1 304V296C95.1 238.6 142.6 192 199.1 192H207.1z"],bone:[576,512,[129460],"f5d7","M534.9 267.5C560.1 280 576 305.8 576 334v4.387c0 35.55-23.49 68.35-58.24 75.88c-38.18 8.264-74.96-13.73-86.76-49.14c-.0352-.1035-.0684-.207-.1035-.3125C425.3 347.7 409.6 336 391.6 336H184.4c-17.89 0-33.63 11.57-39.23 28.56L145 365.1c-11.8 35.41-48.58 57.4-86.76 49.14C23.49 406.7 0 373.9 0 338.4v-4.387C0 305.8 15.88 280 41.13 267.5c9.375-4.75 9.375-18.25 0-23C15.88 232 0 206.3 0 178V173.6c0-35.55 23.49-68.35 58.24-75.88c38.18-8.264 74.99 13.82 86.79 49.23C150.7 164.1 166.4 176 184.4 176h207.2c17.89 0 33.63-11.57 39.23-28.56L431 146.9c11.8-35.41 48.58-57.4 86.76-49.14C552.5 105.3 576 138.1 576 173.6v4.387C576 206.3 560.1 232 534.9 244.5C525.5 249.3 525.5 262.8 534.9 267.5z"],bong:[512,512,[],"f55c","M334.5 512c23.12 0 44.38-12.62 56-32.63C406.8 451.2 416 418.8 416 384c0-36.13-10.11-69.75-27.49-98.63l43.5-43.37l9.376 9.375c6.25 6.25 16.38 6.25 22.63 0L475.3 240c6.25-6.25 6.25-16.38 0-22.62l-52.63-52.75c-6.25-6.25-16.38-6.25-22.63 0L388.6 176c-6.25 6.25-6.25 16.38 0 22.62L398 208l-39.38 39.38c-11.5-11.38-24.51-21.25-38.63-29.5l.0067-154.1h16c8.75 0 16-7.25 16-16L352 16.01C352 7.14 344.9 0 336 0L111.1 .1667c-8.75 0-15.99 7.11-15.99 15.99L96 48c0 8.875 7.126 16 16 16h16L128 217.9C70.63 251.1 32 313 32 384c0 34.75 9.252 67.25 25.5 95.38C69.13 499.4 90.38 512 113.5 512H334.5zM152 259.4l23.97-13.87V64.03L272 63.75l.0168 181.8l23.97 13.87C320.7 273.8 340 295.1 352.5 320H95.51C108 295.1 127.3 273.8 152 259.4z"],book:[448,512,[128212],"f02d","M448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-31.1c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM143.1 128h192C344.8 128 352 135.2 352 144C352 152.8 344.8 160 336 160H143.1C135.2 160 128 152.8 128 144C128 135.2 135.2 128 143.1 128zM143.1 192h192C344.8 192 352 199.2 352 208C352 216.8 344.8 224 336 224H143.1C135.2 224 128 216.8 128 208C128 199.2 135.2 192 143.1 192zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448z"],"book-atlas":[448,512,["atlas"],"f558","M240 97.25C232.3 104.8 219.3 131.8 216.6 176h46.88C260.8 131.8 247.8 104.8 240 97.25zM334.4 176c-5.25-31.25-25.62-57.13-53.25-70.38C288.8 124.6 293.8 149 295.3 176H334.4zM334.4 208h-39.13c-1.5 27-6.5 51.38-14.12 70.38C308.8 265.1 329.1 239.3 334.4 208zM263.4 208H216.5C219.3 252.3 232.3 279.3 240 286.8C247.8 279.3 260.8 252.3 263.4 208zM198.9 105.6C171.3 118.9 150.9 144.8 145.6 176h39.13C186.3 149 191.3 124.6 198.9 105.6zM448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-32c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM240 64c70.75 0 128 57.25 128 128s-57.25 128-128 128s-128-57.25-128-128S169.3 64 240 64zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448zM198.9 278.4C191.3 259.4 186.3 235 184.8 208H145.6C150.9 239.3 171.3 265.1 198.9 278.4z"],"book-bible":[448,512,["bible"],"f647","M448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-31.1c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM144 144c0-8.875 7.125-15.1 16-15.1L208 128V80c0-8.875 7.125-15.1 16-15.1l32 .0009c8.875 0 16 7.12 16 15.1V128L320 128c8.875 0 16 7.121 16 15.1v32c0 8.875-7.125 16-16 16L272 192v112c0 8.875-7.125 16-16 16l-32-.0002c-8.875 0-16-7.127-16-16V192L160 192c-8.875 0-16-7.127-16-16V144zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448z"],"book-bookmark":[448,512,[],"e0bb","M448 336v-288C448 21.49 426.5 0 400 0H352v191.1c0 13.41-15.52 20.88-25.1 12.49L272 160L217.1 204.5C207.5 212.8 192 205.4 192 191.1V0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-32c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448z"],"book-journal-whills":[448,512,["journal-whills"],"f66a","M448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-31.1c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM133.1 160.4l21.25 21.25c3.125 3.125 8.125 3.125 11.25 0s3.125-8.125 0-11.25l-26.38-26.5c10-20.75 26.25-38 46.38-49.25c-17 27.12-11 62.75 14 82.63C185.5 192 180.5 213.1 186.5 232.5c5.875 19.38 22 34.13 41.88 38.25l1.375-32.75L219.4 245.1C218.8 245.5 217.9 245.8 217.1 245.8c-1 0-2-.375-2.75-1c-.75-.875-1.25-1.875-1.25-3c0-.625 .25-1.375 .5-2L222.3 225.5l-18-3.75c-1.75-.375-3.125-2.125-3.125-4s1.375-3.5 3.125-3.875l18-3.75L213.6 195.9C212.8 194.3 213 192.1 214.4 190.9s3.5-1.5 5-.375l12 8.125L236 87.88C236.1 85.63 237.9 84 240 84s3.875 1.625 4 3.875l4.75 112.3l14.12-9.625c.625-.5 1.5-.625 2.25-.75c1.5 0 2.75 .75 3.5 2s.625 2.875-.125 4.125L260 210.1l17.1 3.75c1.75 .375 3.125 2 3.125 3.875s-1.375 3.625-3.125 4L260 225.4l8.5 14.38c.75 1.25 .875 2.75 .125 4s-2 2-3.5 2c-.75 0-1.625-.25-2.25-.625L250.3 236.5l1.375 34.25c19.88-4.125 36-18.88 41.88-38.25c6-19.38 1-40.63-13.12-55.25c25-19.88 31-55.5 14-82.63c20.25 11.25 36.38 28.5 46.38 49.25l-26.38 26.5c-3.125 3.125-3.125 8.125 0 11.25s8.125 3.125 11.25 0l21.25-21.25C349.9 170.5 352 181 352 192c0 .5-.125 1-.125 1.5l-37.13 32.5C313.1 227.6 312.1 229.8 312 232c.125 1.875 .7496 3.75 1.1 5.25C315.6 238.9 317.8 239.9 320 240c1.1 0 3.875-.7499 5.25-1.1l23.62-20.63C337.3 267 293.1 304 240 304S142.8 267 131.1 217.4l23.62 20.63C156.3 239.3 158.1 239.9 160 240c3.375 0 6.25-2.125 7.5-5.125c1.125-3.125 .25-6.75-2.25-8.875L128.1 193.5C128.1 193 128 192.5 128 192C128 181 130.1 170.5 133.1 160.4zM384 448H96c-17.67 0-32-14.33-32-32s14.33-32 32-32h288V448z"],"book-medical":[448,512,[],"f7e6","M448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-31.1c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM128 166c0-8.838 7.164-16 16-16h53.1V96c0-8.838 7.164-16 16-16h52c8.836 0 16 7.162 16 16v54H336c8.836 0 16 7.162 16 16v52c0 8.836-7.164 16-16 16h-54V288c0 8.836-7.164 16-16 16h-52c-8.836 0-16-7.164-16-16V234H144c-8.836 0-16-7.164-16-16V166zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448z"],"book-open":[576,512,[128366,128214],"f518","M144.3 32.04C106.9 31.29 63.7 41.44 18.6 61.29c-11.42 5.026-18.6 16.67-18.6 29.15l0 357.6c0 11.55 11.99 19.55 22.45 14.65c126.3-59.14 219.8 11 223.8 14.01C249.1 478.9 252.5 480 256 480c12.4 0 16-11.38 16-15.98V80.04c0-5.203-2.531-10.08-6.781-13.08C263.3 65.58 216.7 33.35 144.3 32.04zM557.4 61.29c-45.11-19.79-88.48-29.61-125.7-29.26c-72.44 1.312-118.1 33.55-120.9 34.92C306.5 69.96 304 74.83 304 80.04v383.1C304 468.4 307.5 480 320 480c3.484 0 6.938-1.125 9.781-3.328c3.925-3.018 97.44-73.16 223.8-14c10.46 4.896 22.45-3.105 22.45-14.65l.0001-357.6C575.1 77.97 568.8 66.31 557.4 61.29z"],"book-open-reader":[512,512,["book-reader"],"f5da","M0 219.2v212.5c0 14.25 11.62 26.25 26.5 27C75.32 461.2 180.2 471.3 240 511.9V245.2C181.4 205.5 79.99 194.8 29.84 192C13.59 191.1 0 203.6 0 219.2zM482.2 192c-50.09 2.848-151.3 13.47-209.1 53.09C272.1 245.2 272 245.3 272 245.5v266.5c60.04-40.39 164.7-50.76 213.5-53.28C500.4 457.9 512 445.9 512 431.7V219.2C512 203.6 498.4 191.1 482.2 192zM352 96c0-53-43-96-96-96S160 43 160 96s43 96 96 96S352 149 352 96z"],"book-quran":[448,512,["quran"],"f687","M352 0H48C21.49 0 0 21.49 0 48v288c0 14.16 6.246 26.76 16 35.54v81.36C6.607 458.5 0 468.3 0 479.1C0 497.7 14.33 512 31.1 512h320c53.02 0 96-42.98 96-96V96C448 42.98 405 0 352 0zM324.8 170.4c3.006 .4297 4.295 4.154 2.004 6.301L306.2 196.9l4.869 28.5c.4297 2.434-1.576 4.439-3.725 4.439c-.5723 0-1.145-.1445-1.719-.4297L280 215.9l-25.63 13.46c-.5723 .2852-1.145 .4297-1.719 .4297c-2.146 0-4.152-2.006-3.723-4.439l4.869-28.5l-20.62-20.19c-2.291-2.146-1.002-5.871 2.006-6.301l28.64-4.152l12.89-25.92C277.3 138.9 278.7 138.2 280 138.2s2.721 .7168 3.295 2.148l12.89 25.92L324.8 170.4zM216 72c23.66 0 46.61 6.953 66.36 20.09c3.219 2.141 4.438 6.281 2.906 9.844c-1.547 3.547-5.453 5.562-9.172 4.594C268.8 104.8 262.2 104 256 104C207.5 104 168 143.5 168 192S207.5 280 256 280c6.234 0 12.81-.8281 20.09-2.531c3.719-.9687 7.625 1.047 9.172 4.594c1.531 3.562 .3125 7.703-2.906 9.844C262.6 305 239.7 312 216 312C149.8 312 96 258.2 96 192S149.8 72 216 72zM352 448H64v-64h288c17.67 0 32 14.33 32 32C384 433.7 369.7 448 352 448z"],"book-skull":[448,512,["book-dead"],"f6b7","M272 144C280.8 144 288 136.8 288 128s-7.25-16-16-16S256 119.3 256 128S263.3 144 272 144zM448 336v-288C448 21.49 426.5 0 400 0H96C42.98 0 0 42.98 0 96v320c0 53.02 42.98 96 96 96h320c17.67 0 32-14.33 32-31.1c0-11.72-6.607-21.52-16-27.1v-81.36C441.8 362.8 448 350.2 448 336zM240 64C284.3 64 320 92.75 320 128c0 20.88-12.75 39.25-32 50.88V192c0 8.75-7.25 16-16 16h-64C199.3 208 192 200.8 192 192V178.9C172.8 167.3 160 148.9 160 128C160 92.75 195.8 64 240 64zM121.7 238.7c-8.125-3.484-11.91-12.89-8.438-21.02c3.469-8.094 12.94-11.86 21-8.422L240 254.5l105.7-45.21c8.031-3.438 17.53 .3281 21 8.422c3.469 8.125-.3125 17.53-8.438 21.02l-77.58 33.18l77.58 33.18c8.125 3.484 11.91 12.89 8.438 21.02C364.1 332.2 358.2 335.8 352 335.8c-2.094 0-4.25-.4062-6.281-1.281L240 289.3l-105.7 45.21C132.3 335.4 130.1 335.8 128 335.8c-6.219 0-12.12-3.641-14.72-9.703C109.8 317.1 113.6 308.6 121.7 305.1l77.58-33.18L121.7 238.7zM384 448H96c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32h288V448zM208 144C216.8 144 224 136.8 224 128S216.8 112 208 112S192 119.3 192 128S199.3 144 208 144z"],"book-tanakh":[448,512,["tanakh"],"f827","M267.1 244.5h34.87l-17.37-29.12L267.1 244.5zM352 0H48C21.49 0 0 21.49 0 48v288c0 14.16 6.246 26.76 16 35.54v81.36C6.607 458.5 0 468.3 0 480C0 497.7 14.33 512 31.1 512h320c53.02 0 96-42.98 96-96V96C448 42.98 405 0 352 0zM89.38 125.6C93 119.3 99.63 115.4 106.9 115.5h56.38l27.5-46.25C194.4 63.25 201 59.5 208 59.5s13.5 3.625 17 9.625l27.75 46.38h56.38c7.25 0 13.88 3.875 17.38 10.12S330 139.5 326.3 145.8L298.6 192l27.75 46.38c3.75 6.125 3.75 13.88 .25 20c-3.625 6.375-10.25 10.25-17.5 10.25h-56.38l-27.5 46.13C221.6 320.8 215.1 324.5 208 324.5c-7 0-13.5-3.625-17-9.625L163.3 268.5H106.9c-7.125 0-13.88-3.875-17.38-10.12S86.13 244.5 89.75 238.3L117.4 192L89.63 145.6C85.88 139.5 85.88 131.8 89.38 125.6zM352 448H64v-64h288c17.67 0 32 14.33 32 32C384 433.7 369.7 448 352 448zM208 296.6l16.88-28.12H191.3L208 296.6zM113.1 244.5h34.88l-17.5-29.12L113.1 244.5zM301.1 139.5h-34.87l17.5 29.12L301.1 139.5zM148.9 139.5H113.1L131.5 168.6L148.9 139.5zM176.9 244.5h62.25L270.6 192l-31.5-52.63H176.9L145.4 192L176.9 244.5zM208 87.38L191.3 115.5h33.5L208 87.38z"],bookmark:[384,512,[61591,128278],"f02e","M48 0H336C362.5 0 384 21.49 384 48V487.7C384 501.1 373.1 512 359.7 512C354.7 512 349.8 510.5 345.7 507.6L192 400L38.28 507.6C34.19 510.5 29.32 512 24.33 512C10.89 512 0 501.1 0 487.7V48C0 21.49 21.49 0 48 0z"],"border-all":[448,512,[],"f84c","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM384 96H256V224H384V96zM384 288H256V416H384V288zM192 224V96H64V224H192zM64 416H192V288H64V416z"],"border-none":[448,512,[],"f850","M64 448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416C49.67 416 64 430.3 64 448zM128 480C110.3 480 96 465.7 96 448C96 430.3 110.3 416 128 416C145.7 416 160 430.3 160 448C160 465.7 145.7 480 128 480zM128 96C110.3 96 96 81.67 96 64C96 46.33 110.3 32 128 32C145.7 32 160 46.33 160 64C160 81.67 145.7 96 128 96zM160 256C160 273.7 145.7 288 128 288C110.3 288 96 273.7 96 256C96 238.3 110.3 224 128 224C145.7 224 160 238.3 160 256zM320 480C302.3 480 288 465.7 288 448C288 430.3 302.3 416 320 416C337.7 416 352 430.3 352 448C352 465.7 337.7 480 320 480zM352 64C352 81.67 337.7 96 320 96C302.3 96 288 81.67 288 64C288 46.33 302.3 32 320 32C337.7 32 352 46.33 352 64zM320 288C302.3 288 288 273.7 288 256C288 238.3 302.3 224 320 224C337.7 224 352 238.3 352 256C352 273.7 337.7 288 320 288zM256 448C256 465.7 241.7 480 224 480C206.3 480 192 465.7 192 448C192 430.3 206.3 416 224 416C241.7 416 256 430.3 256 448zM224 96C206.3 96 192 81.67 192 64C192 46.33 206.3 32 224 32C241.7 32 256 46.33 256 64C256 81.67 241.7 96 224 96zM256 256C256 273.7 241.7 288 224 288C206.3 288 192 273.7 192 256C192 238.3 206.3 224 224 224C241.7 224 256 238.3 256 256zM416 480C398.3 480 384 465.7 384 448C384 430.3 398.3 416 416 416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480zM416 96C398.3 96 384 81.67 384 64C384 46.33 398.3 32 416 32C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96zM64 64C64 81.67 49.67 96 32 96C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32C49.67 32 64 46.33 64 64zM416 288C398.3 288 384 273.7 384 256C384 238.3 398.3 224 416 224C433.7 224 448 238.3 448 256C448 273.7 433.7 288 416 288zM64 256C64 273.7 49.67 288 32 288C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224C49.67 224 64 238.3 64 256zM224 384C206.3 384 192 369.7 192 352C192 334.3 206.3 320 224 320C241.7 320 256 334.3 256 352C256 369.7 241.7 384 224 384zM448 352C448 369.7 433.7 384 416 384C398.3 384 384 369.7 384 352C384 334.3 398.3 320 416 320C433.7 320 448 334.3 448 352zM32 384C14.33 384 0 369.7 0 352C0 334.3 14.33 320 32 320C49.67 320 64 334.3 64 352C64 369.7 49.67 384 32 384zM448 160C448 177.7 433.7 192 416 192C398.3 192 384 177.7 384 160C384 142.3 398.3 128 416 128C433.7 128 448 142.3 448 160zM32 192C14.33 192 0 177.7 0 160C0 142.3 14.33 128 32 128C49.67 128 64 142.3 64 160C64 177.7 49.67 192 32 192zM256 160C256 177.7 241.7 192 224 192C206.3 192 192 177.7 192 160C192 142.3 206.3 128 224 128C241.7 128 256 142.3 256 160z"],"border-top-left":[448,512,["border-style"],"f853","M0 112C0 67.82 35.82 32 80 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H80C71.16 96 64 103.2 64 112V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V112zM128 480C110.3 480 96 465.7 96 448C96 430.3 110.3 416 128 416C145.7 416 160 430.3 160 448C160 465.7 145.7 480 128 480zM320 480C302.3 480 288 465.7 288 448C288 430.3 302.3 416 320 416C337.7 416 352 430.3 352 448C352 465.7 337.7 480 320 480zM256 448C256 465.7 241.7 480 224 480C206.3 480 192 465.7 192 448C192 430.3 206.3 416 224 416C241.7 416 256 430.3 256 448zM416 480C398.3 480 384 465.7 384 448C384 430.3 398.3 416 416 416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480zM416 288C398.3 288 384 273.7 384 256C384 238.3 398.3 224 416 224C433.7 224 448 238.3 448 256C448 273.7 433.7 288 416 288zM448 352C448 369.7 433.7 384 416 384C398.3 384 384 369.7 384 352C384 334.3 398.3 320 416 320C433.7 320 448 334.3 448 352zM416 192C398.3 192 384 177.7 384 160C384 142.3 398.3 128 416 128C433.7 128 448 142.3 448 160C448 177.7 433.7 192 416 192z"],"bore-hole":[512,512,[],"e4c3","M256 0C273.7 0 288 14.33 288 32V296.6C307.1 307.6 320 328.3 320 352C320 387.3 291.3 416 256 416C220.7 416 192 387.3 192 352C192 328.3 204.9 307.6 224 296.6V32C224 14.33 238.3 0 256 0zM160 128V352C160 405 202.1 448 256 448C309 448 352 405 352 352V128H464C490.5 128 512 149.5 512 176V464C512 490.5 490.5 512 464 512H48C21.49 512 0 490.5 0 464V176C0 149.5 21.49 128 48 128H160z"],"bottle-droplet":[320,512,[],"e4c4","M224 0C237.3-.0003 248 10.74 248 23.1C248 37.25 237.3 47.1 224 48L216 48V140.9C258.6 161.6 288 205.4 288 256V448C288 483.3 259.3 512 224 512H96C60.65 512 32 483.3 32 448V256C32 205.4 61.37 161.6 104 140.9V48L96 48C82.75 48 72 37.26 72 24C71.1 10.75 82.74 .0045 95.1 .0042L224 0zM160 384C186.5 384 208 368 208 336C208 304 160 256 160 256C160 256 112 304 112 336C112 362.5 133.5 384 160 384z"],"bottle-water":[320,512,[],"e4c5","M200 0C213.3 0 224 10.75 224 24V64H96V24C96 10.75 106.7 0 120 0H200zM32 151.7C32 136.1 41.04 121.9 55.19 115.3L79.6 103.8C90.58 98.67 102.6 96 114.7 96H205.3C217.4 96 229.4 98.67 240.4 103.8L264.8 115.3C278.1 121.9 288 136.1 288 151.7C288 166.1 280.5 178.7 269.1 185.8C280.6 194.6 288 208.4 288 223.1C288 240.7 279.5 255.4 266.5 263.1C279.5 272.6 288 287.3 288 303.1C288 320.7 279.5 335.4 266.5 344C279.5 352.6 288 367.3 288 384C288 400.7 279.5 415.4 266.5 424C279.5 432.6 288 447.3 288 464C288 490.5 266.5 512 240 512H80C53.49 512 32 490.5 32 464C32 447.3 40.52 432.6 53.46 424C40.52 415.4 32 400.7 32 384C32 367.3 40.52 352.6 53.46 344C40.52 335.4 32 320.7 32 303.1C32 287.3 40.52 272.6 53.46 263.1C40.52 255.4 32 240.7 32 223.1C32 208.4 39.4 194.6 50.87 185.8C39.53 178.7 32 166.1 32 151.7L32 151.7zM112 256H208C216.8 256 224 248.8 224 240C224 231.2 216.8 224 208 224H112C103.2 224 96 231.2 96 240C96 248.8 103.2 256 112 256zM112 352C103.2 352 96 359.2 96 368C96 376.8 103.2 384 112 384H208C216.8 384 224 376.8 224 368C224 359.2 216.8 352 208 352H112z"],"bowl-food":[512,512,[],"e4c6","M64 128C64.53 128 65.07 128 65.6 128C73 91.49 105.3 64 144 64C158.1 64 172.1 68.1 184.9 75.25C198.2 49.55 225.1 32 256 32C286.9 32 313.8 49.56 327.1 75.25C339 68.1 353 64 368 64C406.7 64 438.1 91.49 446.4 128C446.9 128 447.5 128 448 128C483.3 128 512 156.7 512 192C512 203.7 508.9 214.6 503.4 224H8.563C3.118 214.6 .0013 203.7 .0013 192C.0013 156.7 28.66 128 64 128H64zM.001 283.4C.001 268.3 12.28 256 27.43 256H484.6C499.7 256 512 268.3 512 283.4C512 353.9 467.6 414.1 405.3 437.5L403.5 451.1C401.5 467.1 387.9 480 371.8 480H140.2C124.1 480 110.5 467.1 108.5 451.1L106.7 437.5C44.36 414.1 0 353.9 0 283.4H.001z"],"bowl-rice":[512,512,[],"e2eb","M176 56C176 42.75 186.7 32 200 32H216C229.3 32 240 42.75 240 56C240 69.25 229.3 80 216 80H200C186.7 80 176 69.25 176 56zM216 104C229.3 104 240 114.7 240 128C240 141.3 229.3 152 216 152H200C186.7 152 176 141.3 176 128C176 114.7 186.7 104 200 104H216zM72 176C85.26 176 96 186.7 96 200C96 213.3 85.26 224 72 224H56C42.75 224 32 213.3 32 200C32 186.7 42.75 176 56 176H72zM.001 283.4C.001 268.3 12.28 256 27.43 256H484.6C499.7 256 512 268.3 512 283.4C512 353.9 467.6 414.1 405.3 437.5L403.5 451.1C401.5 467.1 387.9 480 371.8 480H140.2C124.1 480 110.5 467.1 108.5 451.1L106.7 437.5C44.36 414.1 0 353.9 0 283.4H.001zM224 200C224 186.7 234.7 176 248 176H264C277.3 176 288 186.7 288 200C288 213.3 277.3 224 264 224H248C234.7 224 224 213.3 224 200zM128 200C128 186.7 138.7 176 152 176H168C181.3 176 192 186.7 192 200C192 213.3 181.3 224 168 224H152C138.7 224 128 213.3 128 200zM120 104C133.3 104 144 114.7 144 128C144 141.3 133.3 152 120 152H104C90.75 152 80 141.3 80 128C80 114.7 90.75 104 104 104H120zM320 200C320 186.7 330.7 176 344 176H360C373.3 176 384 186.7 384 200C384 213.3 373.3 224 360 224H344C330.7 224 320 213.3 320 200zM312 104C325.3 104 336 114.7 336 128C336 141.3 325.3 152 312 152H296C282.7 152 272 141.3 272 128C272 114.7 282.7 104 296 104H312zM416 200C416 186.7 426.7 176 440 176H456C469.3 176 480 186.7 480 200C480 213.3 469.3 224 456 224H440C426.7 224 416 213.3 416 200zM408 104C421.3 104 432 114.7 432 128C432 141.3 421.3 152 408 152H392C378.7 152 368 141.3 368 128C368 114.7 378.7 104 392 104H408zM312 32C325.3 32 336 42.75 336 56C336 69.25 325.3 80 312 80H296C282.7 80 272 69.25 272 56C272 42.75 282.7 32 296 32H312z"],"bowling-ball":[512,512,[],"f436","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM144 208c-17.7 0-32-14.25-32-32s14.3-32 32-32s32 14.25 32 32S161.7 208 144 208zM240 80c17.66 0 31.95 14.25 31.95 32s-14.29 32-31.95 32s-32.05-14.25-32.05-32S222.4 80 240 80zM240 240c-17.7 0-32-14.25-32-32s14.3-32 32-32s32 14.25 32 32S257.7 240 240 240z"],box:[448,512,[128230],"f466","M50.73 58.53C58.86 42.27 75.48 32 93.67 32H208V160H0L50.73 58.53zM240 160V32H354.3C372.5 32 389.1 42.27 397.3 58.53L448 160H240zM448 416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V192H448V416z"],"box-archive":[512,512,["archive"],"f187","M32 432C32 458.5 53.49 480 80 480h352c26.51 0 48-21.49 48-48V160H32V432zM160 236C160 229.4 165.4 224 172 224h168C346.6 224 352 229.4 352 236v8C352 250.6 346.6 256 340 256h-168C165.4 256 160 250.6 160 244V236zM480 32H32C14.31 32 0 46.31 0 64v48C0 120.8 7.188 128 16 128h480C504.8 128 512 120.8 512 112V64C512 46.31 497.7 32 480 32z"],"box-open":[640,512,[],"f49e","M75.23 33.4L320 63.1L564.8 33.4C571.5 32.56 578 36.06 581.1 42.12L622.8 125.5C631.7 143.4 622.2 165.1 602.9 170.6L439.6 217.3C425.7 221.2 410.8 215.4 403.4 202.1L320 63.1L236.6 202.1C229.2 215.4 214.3 221.2 200.4 217.3L37.07 170.6C17.81 165.1 8.283 143.4 17.24 125.5L58.94 42.12C61.97 36.06 68.5 32.56 75.23 33.4H75.23zM321.1 128L375.9 219.4C390.8 244.2 420.5 255.1 448.4 248L576 211.6V378.5C576 400.5 561 419.7 539.6 425.1L335.5 476.1C325.3 478.7 314.7 478.7 304.5 476.1L100.4 425.1C78.99 419.7 64 400.5 64 378.5V211.6L191.6 248C219.5 255.1 249.2 244.2 264.1 219.4L318.9 128H321.1z"],"box-tissue":[512,512,[],"e05b","M384 288l64-192h-109.4C308.4 96 281.6 76.66 272 48C262.4 19.33 235.6 0 205.4 0H64l64 288H384zM0 480c0 17.67 14.33 32 32 32h448c17.67 0 32-14.33 32-32v-64H0V480zM480 224h-40.94l-21.33 64H432C440.8 288 448 295.2 448 304S440.8 320 432 320h-352C71.16 320 64 312.8 64 304S71.16 288 80 288h15.22l-14.22-64H32C14.33 224 0 238.3 0 256v128h512V256C512 238.3 497.7 224 480 224z"],"boxes-packing":[640,512,[],"e4c7","M256 48C256 21.49 277.5 0 304 0H592C618.5 0 640 21.49 640 48V464C640 490.5 618.5 512 592 512H381.3C383 506.1 384 501.6 384 496V253.3C402.6 246.7 416 228.9 416 208V176C416 149.5 394.5 128 368 128H256V48zM571.3 347.3C577.6 341.1 577.6 330.9 571.3 324.7L507.3 260.7C501.1 254.4 490.9 254.4 484.7 260.7L420.7 324.7C414.4 330.9 414.4 341.1 420.7 347.3C426.9 353.6 437.1 353.6 443.3 347.3L480 310.6V432C480 440.8 487.2 448 496 448C504.8 448 512 440.8 512 432V310.6L548.7 347.3C554.9 353.6 565.1 353.6 571.3 347.3H571.3zM0 176C0 167.2 7.164 160 16 160H368C376.8 160 384 167.2 384 176V208C384 216.8 376.8 224 368 224H16C7.164 224 0 216.8 0 208V176zM352 480C352 497.7 337.7 512 320 512H64C46.33 512 32 497.7 32 480V256H352V480zM144 320C135.2 320 128 327.2 128 336C128 344.8 135.2 352 144 352H240C248.8 352 256 344.8 256 336C256 327.2 248.8 320 240 320H144z"],"boxes-stacked":[576,512,[62625,"boxes","boxes-alt"],"f468","M160 48C160 21.49 181.5 0 208 0H256V80C256 88.84 263.2 96 272 96H304C312.8 96 320 88.84 320 80V0H368C394.5 0 416 21.49 416 48V176C416 202.5 394.5 224 368 224H208C181.5 224 160 202.5 160 176V48zM96 288V368C96 376.8 103.2 384 112 384H144C152.8 384 160 376.8 160 368V288H208C234.5 288 256 309.5 256 336V464C256 490.5 234.5 512 208 512H48C21.49 512 0 490.5 0 464V336C0 309.5 21.49 288 48 288H96zM416 288V368C416 376.8 423.2 384 432 384H464C472.8 384 480 376.8 480 368V288H528C554.5 288 576 309.5 576 336V464C576 490.5 554.5 512 528 512H368C341.5 512 320 490.5 320 464V336C320 309.5 341.5 288 368 288H416z"],braille:[640,512,[],"f2a1","M128 96C128 131.3 99.35 160 64 160C28.65 160 0 131.3 0 96C0 60.65 28.65 32 64 32C99.35 32 128 60.65 128 96zM160 256C160 220.7 188.7 192 224 192C259.3 192 288 220.7 288 256C288 291.3 259.3 320 224 320C188.7 320 160 291.3 160 256zM224 272C232.8 272 240 264.8 240 256C240 247.2 232.8 240 224 240C215.2 240 208 247.2 208 256C208 264.8 215.2 272 224 272zM128 416C128 451.3 99.35 480 64 480C28.65 480 0 451.3 0 416C0 380.7 28.65 352 64 352C99.35 352 128 380.7 128 416zM64 400C55.16 400 48 407.2 48 416C48 424.8 55.16 432 64 432C72.84 432 80 424.8 80 416C80 407.2 72.84 400 64 400zM288 416C288 451.3 259.3 480 224 480C188.7 480 160 451.3 160 416C160 380.7 188.7 352 224 352C259.3 352 288 380.7 288 416zM224 400C215.2 400 208 407.2 208 416C208 424.8 215.2 432 224 432C232.8 432 240 424.8 240 416C240 407.2 232.8 400 224 400zM0 256C0 220.7 28.65 192 64 192C99.35 192 128 220.7 128 256C128 291.3 99.35 320 64 320C28.65 320 0 291.3 0 256zM160 96C160 60.65 188.7 32 224 32C259.3 32 288 60.65 288 96C288 131.3 259.3 160 224 160C188.7 160 160 131.3 160 96zM480 96C480 131.3 451.3 160 416 160C380.7 160 352 131.3 352 96C352 60.65 380.7 32 416 32C451.3 32 480 60.65 480 96zM640 96C640 131.3 611.3 160 576 160C540.7 160 512 131.3 512 96C512 60.65 540.7 32 576 32C611.3 32 640 60.65 640 96zM576 80C567.2 80 560 87.16 560 96C560 104.8 567.2 112 576 112C584.8 112 592 104.8 592 96C592 87.16 584.8 80 576 80zM512 256C512 220.7 540.7 192 576 192C611.3 192 640 220.7 640 256C640 291.3 611.3 320 576 320C540.7 320 512 291.3 512 256zM576 272C584.8 272 592 264.8 592 256C592 247.2 584.8 240 576 240C567.2 240 560 247.2 560 256C560 264.8 567.2 272 576 272zM640 416C640 451.3 611.3 480 576 480C540.7 480 512 451.3 512 416C512 380.7 540.7 352 576 352C611.3 352 640 380.7 640 416zM576 400C567.2 400 560 407.2 560 416C560 424.8 567.2 432 576 432C584.8 432 592 424.8 592 416C592 407.2 584.8 400 576 400zM352 256C352 220.7 380.7 192 416 192C451.3 192 480 220.7 480 256C480 291.3 451.3 320 416 320C380.7 320 352 291.3 352 256zM416 272C424.8 272 432 264.8 432 256C432 247.2 424.8 240 416 240C407.2 240 400 247.2 400 256C400 264.8 407.2 272 416 272zM480 416C480 451.3 451.3 480 416 480C380.7 480 352 451.3 352 416C352 380.7 380.7 352 416 352C451.3 352 480 380.7 480 416zM416 400C407.2 400 400 407.2 400 416C400 424.8 407.2 432 416 432C424.8 432 432 424.8 432 416C432 407.2 424.8 400 416 400z"],brain:[512,512,[129504],"f5dc","M184 0C214.9 0 240 25.07 240 56V456C240 486.9 214.9 512 184 512C155.1 512 131.3 490.1 128.3 461.9C123.1 463.3 117.6 464 112 464C76.65 464 48 435.3 48 400C48 392.6 49.27 385.4 51.59 378.8C21.43 367.4 0 338.2 0 304C0 272.1 18.71 244.5 45.77 231.7C37.15 220.8 32 206.1 32 192C32 161.3 53.59 135.7 82.41 129.4C80.84 123.9 80 118 80 112C80 82.06 100.6 56.92 128.3 49.93C131.3 21.86 155.1 0 184 0zM383.7 49.93C411.4 56.92 432 82.06 432 112C432 118 431.2 123.9 429.6 129.4C458.4 135.7 480 161.3 480 192C480 206.1 474.9 220.8 466.2 231.7C493.3 244.5 512 272.1 512 304C512 338.2 490.6 367.4 460.4 378.8C462.7 385.4 464 392.6 464 400C464 435.3 435.3 464 400 464C394.4 464 388.9 463.3 383.7 461.9C380.7 490.1 356.9 512 328 512C297.1 512 272 486.9 272 456V56C272 25.07 297.1 0 328 0C356.9 0 380.7 21.86 383.7 49.93z"],"brazilian-real-sign":[512,512,[],"e46c","M400 .0003C417.7 .0003 432 14.33 432 32V50.22C444.5 52.52 456.7 56.57 468.2 62.3L478.3 67.38C494.1 75.28 500.5 94.5 492.6 110.3C484.7 126.1 465.5 132.5 449.7 124.6L439.5 119.5C429.6 114.6 418.7 112 407.6 112H405.9C376.1 112 352 136.1 352 165.9C352 187.9 365.4 207.7 385.9 215.9L437.9 236.7C482.7 254.6 512 297.9 512 346.1V349.5C512 400.7 478.4 444.1 432 458.7V480C432 497.7 417.7 512 400 512C382.3 512 368 497.7 368 480V460.6C352.1 457.1 338.6 450.9 325.7 442.3L302.2 426.6C287.5 416.8 283.6 396.1 293.4 382.2C303.2 367.5 323 363.6 337.8 373.4L361.2 389C371.9 396.2 384.6 400 397.5 400C425.4 400 448 377.4 448 349.5V346.1C448 324.1 434.6 304.3 414.1 296.1L362.1 275.3C317.3 257.4 288 214.1 288 165.9C288 114 321.5 69.99 368 54.21V32C368 14.33 382.3 0 400 0L400 .0003zM.0003 64C.0003 46.33 14.33 32 32 32H112C191.5 32 256 96.47 256 176C256 234.8 220.8 285.3 170.3 307.7L221.7 436.1C228.3 452.5 220.3 471.1 203.9 477.7C187.5 484.3 168.9 476.3 162.3 459.9L106.3 320H64V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448L.0003 64zM64 256H112C156.2 256 192 220.2 192 176C192 131.8 156.2 96 112 96H64V256z"],"bread-slice":[512,512,[],"f7ec","M512 176.1C512 203 490.4 224 455.1 224H448v224c0 17.67-14.33 32-32 32H96c-17.67 0-32-14.33-32-32V224H56.89C21.56 224 0 203 0 176.1C0 112 96 32 256 32S512 112 512 176.1z"],bridge:[576,512,[],"e4c8","M544 32C561.7 32 576 46.33 576 64C576 81.67 561.7 96 544 96H504V160H576V288C522.1 288 480 330.1 480 384V448C480 465.7 465.7 480 448 480H416C398.3 480 384 465.7 384 448V384C384 330.1 341 288 288 288C234.1 288 192 330.1 192 384V448C192 465.7 177.7 480 160 480H128C110.3 480 96 465.7 96 448V384C96 330.1 53.02 288 0 288V160H72V96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H544zM456 96H376V160H456V96zM248 96V160H328V96H248zM200 96H120V160H200V96z"],"bridge-circle-check":[640,512,[],"e4c9","M576 32C593.7 32 608 46.33 608 64C608 81.67 593.7 96 576 96H536V160H608V232.2C577.6 207.1 538.5 192 496 192C426.9 192 367.1 231.8 338.3 289.7C332.4 288.6 326.3 288 320 288C266.1 288 224 330.1 224 384V448C224 465.7 209.7 480 192 480H160C142.3 480 128 465.7 128 448V384C128 330.1 85.02 288 32 288V160H104V96H64C46.33 96 32 81.67 32 64C32 46.33 46.33 32 64 32H576zM488 96H408V160H488V96zM280 96V160H360V96H280zM232 96H152V160H232V96zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"bridge-circle-exclamation":[640,512,[],"e4ca","M576 32C593.7 32 608 46.33 608 64C608 81.67 593.7 96 576 96H536V160H608V232.2C577.6 207.1 538.5 192 496 192C426.9 192 367.1 231.8 338.3 289.7C332.4 288.6 326.3 288 320 288C266.1 288 224 330.1 224 384V448C224 465.7 209.7 480 192 480H160C142.3 480 128 465.7 128 448V384C128 330.1 85.02 288 32 288V160H104V96H64C46.33 96 32 81.67 32 64C32 46.33 46.33 32 64 32H576zM488 96H408V160H488V96zM280 96V160H360V96H280zM232 96H152V160H232V96zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"bridge-circle-xmark":[640,512,[],"e4cb","M576 32C593.7 32 608 46.33 608 64C608 81.67 593.7 96 576 96H536V160H608V232.2C577.6 207.1 538.5 192 496 192C426.9 192 367.1 231.8 338.3 289.7C332.4 288.6 326.3 288 320 288C266.1 288 224 330.1 224 384V448C224 465.7 209.7 480 192 480H160C142.3 480 128 465.7 128 448V384C128 330.1 85.02 288 32 288V160H104V96H64C46.33 96 32 81.67 32 64C32 46.33 46.33 32 64 32H576zM488 96H408V160H488V96zM280 96V160H360V96H280zM232 96H152V160H232V96zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"bridge-lock":[640,512,[],"e4cc","M32 64C32 46.33 46.33 32 64 32H576C593.7 32 608 46.33 608 64C608 81.67 593.7 96 576 96H536V160H528C466.1 160 416 210.1 416 272V296.6C406.1 302.3 397.8 310.7 392.2 320.7C374.6 300.7 348.8 287.1 320 287.1C266.1 287.1 224 330.1 224 384V448C224 465.7 209.7 480 192 480H160C142.3 480 128 465.7 128 448V384C128 330.1 85.02 287.1 32 287.1V159.1H104V95.1H64C46.33 95.1 32 81.67 32 63.1V64zM408 160H488V96H408V160zM360 160V96H280V160H360zM152 160H232V96H152V160zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"bridge-water":[576,512,[],"e4ce","M.0003 96C.0003 78.33 14.33 64 32 64H544C561.7 64 576 78.33 576 96V131.6C576 147.3 563.3 160 547.6 160C510.2 160 480 190.2 480 227.6V352.5C467.1 352.5 454.2 356.3 443.2 364.1C425.2 376.5 403 384.5 384 384.5L384 384V256C384 202.1 341 160 288 160C234.1 160 192 202.1 192 256V384L191.1 384.5C172.1 384.4 150.8 376.5 132.9 364.1C121.8 356.3 108.9 352.4 96 352.5V227.6C96 190.2 65.75 160 28.44 160C12.74 160 0 147.3 0 131.6L.0003 96zM384 416C410.9 416 439.4 405.2 461.4 389.9L461.5 389.9C473.4 381.4 489.5 382.1 500.7 391.6C515.1 403.5 533.2 412.6 551.3 416.8C568.5 420.8 579.2 438.1 575.2 455.3C571.2 472.5 553.1 483.2 536.7 479.2C512.2 473.4 491.9 462.6 478.5 454.2C449.5 469.7 417 480 384 480C352.1 480 323.4 470.1 303.6 461.1C297.7 458.5 292.5 455.8 288 453.4C283.5 455.8 278.3 458.5 272.4 461.1C252.6 470.1 223.9 480 192 480C158.1 480 126.5 469.7 97.5 454.2C84.13 462.6 63.79 473.4 39.27 479.2C22.06 483.2 4.854 472.5 .8429 455.3C-3.168 438.1 7.533 420.8 24.74 416.8C42.84 412.6 60.96 403.5 75.31 391.6C86.46 382.1 102.6 381.4 114.5 389.9L114.6 389.9C136.7 405.2 165.1 416 192 416C219.5 416 247 405.4 269.5 389.9C280.6 382 295.4 382 306.5 389.9C328.1 405.4 356.5 416 384 416H384z"],briefcase:[512,512,[128188],"f0b1","M320 336c0 8.844-7.156 16-16 16h-96C199.2 352 192 344.8 192 336V288H0v144C0 457.6 22.41 480 48 480h416c25.59 0 48-22.41 48-48V288h-192V336zM464 96H384V48C384 22.41 361.6 0 336 0h-160C150.4 0 128 22.41 128 48V96H48C22.41 96 0 118.4 0 144V256h512V144C512 118.4 489.6 96 464 96zM336 96h-160V48h160V96z"],"briefcase-medical":[512,512,[],"f469","M464 96H384V48C384 21.5 362.5 0 336 0h-160C149.5 0 128 21.5 128 48V96H48C21.5 96 0 117.5 0 144v288C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48v-288C512 117.5 490.5 96 464 96zM176 48h160V96h-160V48zM368 314c0 8.836-7.164 16-16 16h-54V384c0 8.836-7.164 16-15.1 16h-52c-8.835 0-16-7.164-16-16v-53.1H160c-8.836 0-16-7.164-16-16v-52c0-8.838 7.164-16 16-16h53.1V192c0-8.838 7.165-16 16-16h52c8.836 0 15.1 7.162 15.1 16v54H352c8.836 0 16 7.162 16 16V314z"],broom:[640,512,[129529],"f51a","M93.13 257.7C71.25 275.1 53 313.5 38.63 355.1L99 333.1c5.75-2.125 10.62 4.749 6.625 9.499L11 454.7C3.75 486.1 0 510.2 0 510.2s206.6 13.62 266.6-34.12c60-47.87 76.63-150.1 76.63-150.1L256.5 216.7C256.5 216.7 153.1 209.1 93.13 257.7zM633.2 12.34c-10.84-13.91-30.91-16.45-44.91-5.624l-225.7 175.6l-34.99-44.06C322.5 131.9 312.5 133.1 309 140.5L283.8 194.1l86.75 109.2l58.75-12.5c8-1.625 11.38-11.12 6.375-17.5l-33.19-41.79l225.2-175.2C641.6 46.38 644.1 26.27 633.2 12.34z"],"broom-ball":[640,512,["quidditch","quidditch-broom-ball"],"f458","M495.1 351.1c-44.18 0-79.1 35.72-79.1 79.91c0 44.18 35.82 80.09 79.1 80.09s79.1-35.91 79.1-80.09C575.1 387.7 540.2 351.1 495.1 351.1zM242.7 216.4c-30.16 0-102.9 4.15-149.4 41.34c-22 17.5-40.25 55.75-54.63 97.5l60.38-22.12c.7363-.2715 1.46-.3967 2.151-.3967c3.33 0 5.935 2.885 5.935 6.039c0 1.301-.4426 2.647-1.462 3.856L11 454.7C3.75 487.1 0 510.2 0 510.2S27.07 512 64.45 512c65.94 0 163.1-5.499 202.2-35.89c60-47.75 76.63-150.1 76.63-150.1l-86.75-109.2C256.5 216.7 251.4 216.4 242.7 216.4zM607.1 .0074c-6.863 0-13.78 2.192-19.62 6.719L362.7 182.3l-29.88-37.67c-3.248-4.094-7.892-6.058-12.5-6.058c-5.891 0-11.73 3.204-14.54 9.26L283.8 195.1l86.75 109.1l50.88-10.72c7.883-1.66 12.72-8.546 12.72-15.71c0-3.412-1.096-6.886-3.478-9.89l-28.16-35.5l225.2-175.2c8.102-6.312 12.35-15.75 12.35-25.29C640 14.94 626.3 .0074 607.1 .0074z"],brush:[384,512,[],"f55d","M224 0H336C362.5 0 384 21.49 384 48V256H0V48C0 21.49 21.49 0 48 0H64L96 64L128 0H160L192 64L224 0zM384 288V320C384 355.3 355.3 384 320 384H256V448C256 483.3 227.3 512 192 512C156.7 512 128 483.3 128 448V384H64C28.65 384 0 355.3 0 320V288H384zM192 464C200.8 464 208 456.8 208 448C208 439.2 200.8 432 192 432C183.2 432 176 439.2 176 448C176 456.8 183.2 464 192 464z"],bucket:[448,512,[],"e4cf","M96 160H48V152C48 68.05 116.1 0 200 0H248C331.9 0 400 68.05 400 152V160H352V152C352 94.56 305.4 48 248 48H200C142.6 48 96 94.56 96 152V160zM.0003 224C.0003 206.3 14.33 192 32 192H416C433.7 192 448 206.3 448 224C448 241.7 433.7 256 416 256H410.9L388.5 469C385.1 493.5 365.4 512 340.8 512H107.2C82.65 512 62.05 493.5 59.48 469L37.05 256H32C14.33 256 0 241.7 0 224H.0003z"],bug:[512,512,[],"f188","M352 96V99.56C352 115.3 339.3 128 323.6 128H188.4C172.7 128 159.1 115.3 159.1 99.56V96C159.1 42.98 202.1 0 255.1 0C309 0 352 42.98 352 96zM41.37 105.4C53.87 92.88 74.13 92.88 86.63 105.4L150.6 169.4C151.3 170 151.9 170.7 152.5 171.4C166.8 164.1 182.9 160 199.1 160H312C329.1 160 345.2 164.1 359.5 171.4C360.1 170.7 360.7 170 361.4 169.4L425.4 105.4C437.9 92.88 458.1 92.88 470.6 105.4C483.1 117.9 483.1 138.1 470.6 150.6L406.6 214.6C405.1 215.3 405.3 215.9 404.6 216.5C410.7 228.5 414.6 241.9 415.7 256H480C497.7 256 512 270.3 512 288C512 305.7 497.7 320 480 320H416C416 344.6 410.5 367.8 400.6 388.6C402.7 389.9 404.8 391.5 406.6 393.4L470.6 457.4C483.1 469.9 483.1 490.1 470.6 502.6C458.1 515.1 437.9 515.1 425.4 502.6L362.3 439.6C337.8 461.4 306.5 475.8 272 479.2V240C272 231.2 264.8 224 255.1 224C247.2 224 239.1 231.2 239.1 240V479.2C205.5 475.8 174.2 461.4 149.7 439.6L86.63 502.6C74.13 515.1 53.87 515.1 41.37 502.6C28.88 490.1 28.88 469.9 41.37 457.4L105.4 393.4C107.2 391.5 109.3 389.9 111.4 388.6C101.5 367.8 96 344.6 96 320H32C14.33 320 0 305.7 0 288C0 270.3 14.33 256 32 256H96.3C97.38 241.9 101.3 228.5 107.4 216.5C106.7 215.9 106 215.3 105.4 214.6L41.37 150.6C28.88 138.1 28.88 117.9 41.37 105.4H41.37z"],"bug-slash":[640,512,[],"e490","M239.1 162.8C247.7 160.1 255.7 160 264 160H376C393.1 160 409.2 164.1 423.5 171.4C424.1 170.7 424.7 170 425.4 169.4L489.4 105.4C501.9 92.88 522.1 92.88 534.6 105.4C547.1 117.9 547.1 138.1 534.6 150.6L470.6 214.6C469.1 215.3 469.3 215.9 468.6 216.5C474.7 228.5 478.6 241.9 479.7 256H544C561.7 256 576 270.3 576 288C576 305.7 561.7 320 544 320H480C480 329.9 479.1 339.5 477.4 348.9L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L239.1 162.8zM416 96V99.56C416 115.3 403.3 128 387.6 128H252.4C236.7 128 224 115.3 224 99.56V96C224 42.98 266.1 .001 320 .001C373 .001 416 42.98 416 96V96zM160.3 256C161.1 245.1 163.3 236.3 166.7 227.3L304 335.5V479.2C269.5 475.8 238.2 461.4 213.7 439.6L150.6 502.6C138.1 515.1 117.9 515.1 105.4 502.6C92.88 490.1 92.88 469.9 105.4 457.4L169.4 393.4C171.2 391.5 173.3 389.9 175.4 388.6C165.5 367.8 160 344.6 160 320H96C78.33 320 64 305.7 64 288C64 270.3 78.33 256 96 256H160.3zM336 479.2V360.7L430.8 435.4C405.7 459.6 372.7 475.6 336 479.2V479.2z"],bugs:[576,512,[],"e4d0","M187.3 135.1H204.3L208.5 115.3C211.1 102.3 223.7 93.86 236.7 96.46C249.7 99.06 258.1 111.7 255.5 124.7L247.5 164.7C245.3 175.9 235.4 183.1 223.1 183.1H191.1V207.3L229.8 216.7C239.3 219.1 246.4 226.9 247.8 236.6L255.8 292.6C257.6 305.7 248.5 317.9 235.4 319.8C222.3 321.6 210.1 312.5 208.2 299.4L202.5 259.4L184.1 254.8C173.2 274.6 152.2 287.1 127.1 287.1C103.8 287.1 82.75 274.6 71.87 254.8L53.48 259.4L47.76 299.4C45.88 312.5 33.73 321.6 20.61 319.8C7.484 317.9-1.633 305.7 .2413 292.6L8.241 236.6C9.621 226.9 16.71 219.1 26.18 216.7L63.1 207.3V183.1H31.1C20.56 183.1 10.71 175.9 8.463 164.7L.4627 124.7C-2.137 111.7 6.292 99.06 19.29 96.46C32.29 93.86 44.93 102.3 47.53 115.3L51.67 135.1H68.65C73.35 124.4 81.36 114.5 91.51 107.4L58.15 33.92C52.67 21.85 58.01 7.625 70.08 2.145C82.15-3.335 96.37 2.007 101.9 14.08L128 71.66L154.1 14.08C159.6 2.007 173.9-3.335 185.9 2.145C197.1 7.625 203.3 21.85 197.9 33.92L164.5 107.4C174.6 114.5 182.6 124.4 187.3 135.1L187.3 135.1zM501.5 322.7L516.2 331.2L530.1 315.3C538.9 305.3 554 304.4 563.1 313.1C573.9 321.9 574.9 337 566.2 346.1L539.2 377.6C531.7 386.2 519.1 388.3 509.2 382.6L481.5 366.6L469.9 386.7L497.9 413.8C504.9 420.6 507.1 430.9 503.5 440L482.4 492.5C477.5 504.8 463.5 510.8 451.2 505.8C438.9 500.9 432.9 486.9 437.9 474.6L452.9 437.1L439.3 423.9C419.1 435.6 395 436.7 374.1 424.6C353.1 412.5 341.6 390.4 342.1 367.8L323.8 362.6L298.9 394.4C290.7 404.8 275.6 406.6 265.2 398.4C254.8 390.3 252.9 375.2 261.1 364.7L296 320.2C302.1 312.6 312.1 309.3 321.5 311.1L359 322.7L370.6 302.6L342.9 286.6C333 280.8 328.5 268.9 332.2 258.1L345.3 219.4C349.5 206.9 363.1 200.2 375.7 204.4C388.2 208.7 394.1 222.3 390.7 234.8L383.1 254.8L398.7 263.3C408.5 255.6 420.4 251 432.8 249.1L440.6 169.7C441.9 156.5 453.6 146.8 466.8 148.1C480 149.4 489.7 161.1 488.4 174.3L482.2 237.3L533.7 200.5C544.5 192.8 559.4 195.3 567.2 206C574.9 216.8 572.4 231.8 561.6 239.5L495.1 286.5C501.2 297.7 503.2 310.3 501.5 322.7V322.7z"],building:[384,512,[61687,127970],"f1ad","M336 0C362.5 0 384 21.49 384 48V464C384 490.5 362.5 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272z"],"building-circle-arrow-right":[640,512,[],"e4d1","M0 48C0 21.49 21.49 0 48 0H336C362.5 0 384 21.49 384 48V232.2C344.9 264.5 320 313.3 320 368C320 417.5 340.4 462.2 373.3 494.2C364.5 505.1 351.1 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48zM80 224C71.16 224 64 231.2 64 240V272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80zM160 272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176C167.2 224 160 231.2 160 240V272zM272 224C263.2 224 256 231.2 256 240V272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272zM64 144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80C71.16 96 64 103.2 64 112V144zM176 96C167.2 96 160 103.2 160 112V144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176zM256 144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272C263.2 96 256 103.2 256 112V144zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM492.7 323.3L521.4 352H432C423.2 352 416 359.2 416 368C416 376.8 423.2 384 432 384H521.4L492.7 412.7C486.4 418.9 486.4 429.1 492.7 435.3C498.9 441.6 509.1 441.6 515.3 435.3L571.3 379.3C577.6 373.1 577.6 362.9 571.3 356.7L515.3 300.7C509.1 294.4 498.9 294.4 492.7 300.7C486.4 306.9 486.4 317.1 492.7 323.3V323.3z"],"building-circle-check":[640,512,[],"e4d2","M336 0C362.5 0 384 21.49 384 48V232.2C344.9 264.5 320 313.3 320 368C320 417.5 340.4 462.2 373.3 494.2C364.5 505.1 351.1 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"building-circle-exclamation":[640,512,[],"e4d3","M336 0C362.5 0 384 21.49 384 48V232.2C344.9 264.5 320 313.3 320 368C320 417.5 340.4 462.2 373.3 494.2C364.5 505.1 351.1 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"building-circle-xmark":[640,512,[],"e4d4","M336 0C362.5 0 384 21.49 384 48V232.2C344.9 264.5 320 313.3 320 368C320 417.5 340.4 462.2 373.3 494.2C364.5 505.1 351.1 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"building-columns":[512,512,["bank","institution","museum","university"],"f19c","M243.4 2.587C251.4-.8625 260.6-.8625 268.6 2.587L492.6 98.59C506.6 104.6 514.4 119.6 511.3 134.4C508.3 149.3 495.2 159.1 479.1 160V168C479.1 181.3 469.3 192 455.1 192H55.1C42.74 192 31.1 181.3 31.1 168V160C16.81 159.1 3.708 149.3 .6528 134.4C-2.402 119.6 5.429 104.6 19.39 98.59L243.4 2.587zM256 128C273.7 128 288 113.7 288 96C288 78.33 273.7 64 256 64C238.3 64 224 78.33 224 96C224 113.7 238.3 128 256 128zM127.1 416H167.1V224H231.1V416H280V224H344V416H384V224H448V420.3C448.6 420.6 449.2 420.1 449.8 421.4L497.8 453.4C509.5 461.2 514.7 475.8 510.6 489.3C506.5 502.8 494.1 512 480 512H31.1C17.9 512 5.458 502.8 1.372 489.3C-2.715 475.8 2.515 461.2 14.25 453.4L62.25 421.4C62.82 420.1 63.41 420.6 63.1 420.3V224H127.1V416z"],"building-flag":[640,512,[],"e4d5","M336 0C362.5 0 384 21.49 384 48V464C384 490.5 362.5 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM448 0C465.7 0 480 14.33 480 32H624C632.8 32 640 39.16 640 48V176C640 184.8 632.8 192 624 192H480V512H416V32C416 14.33 430.3 0 448 0z"],"building-lock":[576,512,[],"e4d6","M336 0C362.5 0 384 21.49 384 48V193.6C364.2 213.8 352 241.5 352 272V296.6C332.9 307.6 320 328.3 320 352V480C320 491.7 323.1 502.6 328.6 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM464 192C508.2 192 544 227.8 544 272V320C561.7 320 576 334.3 576 352V480C576 497.7 561.7 512 544 512H384C366.3 512 352 497.7 352 480V352C352 334.3 366.3 320 384 320V272C384 227.8 419.8 192 464 192zM464 240C446.3 240 432 254.3 432 272V320H496V272C496 254.3 481.7 240 464 240z"],"building-ngo":[384,512,[],"e4d7","M320 112V144C320 152.8 312.8 160 304 160C295.2 160 288 152.8 288 144V112C288 103.2 295.2 96 304 96C312.8 96 320 103.2 320 112zM336 0C362.5 0 384 21.49 384 48V464C384 490.5 362.5 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM168 64C159.2 64 152 71.16 152 80V168C152 181.3 162.7 192 176 192H208C221.3 192 232 181.3 232 168V144C232 135.2 224.8 128 216 128C207.2 128 200 135.2 200 144V160H184V96H216C224.8 96 232 88.84 232 80C232 71.16 224.8 64 216 64H168zM256 144C256 170.5 277.5 192 304 192C330.5 192 352 170.5 352 144V112C352 85.49 330.5 64 304 64C277.5 64 256 85.49 256 112V144zM61.31 71.12C57.4 65.26 50.11 62.64 43.36 64.69C36.62 66.73 32 72.95 32 80V176C32 184.8 39.16 192 48 192C56.84 192 64 184.8 64 176V132.8L98.69 184.9C102.6 190.7 109.9 193.4 116.6 191.3C123.4 189.3 128 183.1 128 176V80C128 71.16 120.8 64 112 64C103.2 64 96 71.16 96 80V123.2L61.31 71.12z"],"building-shield":[576,512,[],"e4d8","M0 48C0 21.49 21.49 0 48 0H336C362.5 0 384 21.49 384 48V207L341.6 224H272C263.2 224 256 231.2 256 240V304C256 304.9 256.1 305.7 256.2 306.6C258.5 364.7 280.3 451.4 354.9 508.1C349.1 510.6 342.7 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48zM80 224C71.16 224 64 231.2 64 240V272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80zM160 272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176C167.2 224 160 231.2 160 240V272zM64 144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80C71.16 96 64 103.2 64 112V144zM176 96C167.2 96 160 103.2 160 112V144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176zM256 144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272C263.2 96 256 103.2 256 112V144zM423.1 225.7C428.8 223.4 435.2 223.4 440.9 225.7L560.9 273.7C570 277.4 576 286.2 576 296C576 359.3 550.1 464.8 441.2 510.2C435.3 512.6 428.7 512.6 422.8 510.2C313.9 464.8 288 359.3 288 296C288 286.2 293.1 277.4 303.1 273.7L423.1 225.7zM432 273.8V461.7C500.2 428.7 523.5 362.7 527.4 311.1L432 273.8z"],"building-un":[384,512,[],"e4d9","M336 0C362.5 0 384 21.49 384 48V464C384 490.5 362.5 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM237.3 71.12C233.4 65.26 226.1 62.64 219.4 64.69C212.6 66.73 208 72.95 208 80V176C208 184.8 215.2 192 224 192C232.8 192 240 184.8 240 176V132.8L274.7 184.9C278.6 190.7 285.9 193.4 292.6 191.3C299.4 189.3 304 183.1 304 176V80C304 71.16 296.8 64 288 64C279.2 64 272 71.16 272 80V123.2L237.3 71.12zM112 80C112 71.16 104.8 64 96 64C87.16 64 80 71.16 80 80V144C80 170.5 101.5 192 128 192C154.5 192 176 170.5 176 144V80C176 71.16 168.8 64 160 64C151.2 64 144 71.16 144 80V144C144 152.8 136.8 160 128 160C119.2 160 112 152.8 112 144V80z"],"building-user":[640,512,[],"e4da","M336 0C362.5 0 384 21.49 384 48V367.8C345.8 389.2 320 430 320 476.9C320 489.8 323.6 501.8 329.9 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48C0 21.49 21.49 0 48 0H336zM64 272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80C71.16 224 64 231.2 64 240V272zM176 224C167.2 224 160 231.2 160 240V272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176zM256 272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272C263.2 224 256 231.2 256 240V272zM80 96C71.16 96 64 103.2 64 112V144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80zM160 144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176C167.2 96 160 103.2 160 112V144zM272 96C263.2 96 256 103.2 256 112V144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272zM576 272C576 316.2 540.2 352 496 352C451.8 352 416 316.2 416 272C416 227.8 451.8 192 496 192C540.2 192 576 227.8 576 272zM352 477.1C352 425.7 393.7 384 445.1 384H546.9C598.3 384 640 425.7 640 477.1C640 496.4 624.4 512 605.1 512H386.9C367.6 512 352 496.4 352 477.1V477.1z"],"building-wheat":[640,512,[],"e4db","M0 48C0 21.49 21.49 0 48 0H336C362.5 0 384 21.49 384 48V464C384 490.5 362.5 512 336 512H240V432C240 405.5 218.5 384 192 384C165.5 384 144 405.5 144 432V512H48C21.49 512 0 490.5 0 464V48zM80 224C71.16 224 64 231.2 64 240V272C64 280.8 71.16 288 80 288H112C120.8 288 128 280.8 128 272V240C128 231.2 120.8 224 112 224H80zM160 272C160 280.8 167.2 288 176 288H208C216.8 288 224 280.8 224 272V240C224 231.2 216.8 224 208 224H176C167.2 224 160 231.2 160 240V272zM272 224C263.2 224 256 231.2 256 240V272C256 280.8 263.2 288 272 288H304C312.8 288 320 280.8 320 272V240C320 231.2 312.8 224 304 224H272zM64 144C64 152.8 71.16 160 80 160H112C120.8 160 128 152.8 128 144V112C128 103.2 120.8 96 112 96H80C71.16 96 64 103.2 64 112V144zM176 96C167.2 96 160 103.2 160 112V144C160 152.8 167.2 160 176 160H208C216.8 160 224 152.8 224 144V112C224 103.2 216.8 96 208 96H176zM256 144C256 152.8 263.2 160 272 160H304C312.8 160 320 152.8 320 144V112C320 103.2 312.8 96 304 96H272C263.2 96 256 103.2 256 112V144zM640 192V208C640 252.2 604.2 288 560 288H544V272C544 227.8 579.8 192 624 192H640zM560 400H544V384C544 339.8 579.8 304 624 304H640V320C640 364.2 604.2 400 560 400zM560 512H544V496C544 451.8 579.8 416 624 416H640V432C640 476.2 604.2 512 560 512zM512 496V512H496C451.8 512 416 476.2 416 432V416H432C476.2 416 512 451.8 512 496zM496 400C451.8 400 416 364.2 416 320V304H432C476.2 304 512 339.8 512 384V400H496zM512 272V288H496C451.8 288 416 252.2 416 208V192H432C476.2 192 512 227.8 512 272zM528 32C541.3 32 552 42.75 552 56V160C552 173.3 541.3 184 528 184C514.7 184 504 173.3 504 160V56C504 42.75 514.7 32 528 32zM624 128C624 141.3 613.3 152 600 152C586.7 152 576 141.3 576 128V96C576 82.75 586.7 72 600 72C613.3 72 624 82.75 624 96V128zM456 72C469.3 72 480 82.75 480 96V128C480 141.3 469.3 152 456 152C442.7 152 432 141.3 432 128V96C432 82.75 442.7 72 456 72z"],bullhorn:[512,512,[128363,128226],"f0a1","M480 179.6C498.6 188.4 512 212.1 512 240C512 267.9 498.6 291.6 480 300.4V448C480 460.9 472.2 472.6 460.2 477.6C448.3 482.5 434.5 479.8 425.4 470.6L381.7 426.1C333.7 378.1 268.6 352 200.7 352H192V480C192 497.7 177.7 512 160 512H96C78.33 512 64 497.7 64 480V352C28.65 352 0 323.3 0 288V192C0 156.7 28.65 128 64 128H200.7C268.6 128 333.7 101 381.7 53.02L425.4 9.373C434.5 .2215 448.3-2.516 460.2 2.437C472.2 7.39 480 19.06 480 32V179.6zM200.7 192H192V288H200.7C280.5 288 357.2 317.8 416 371.3V108.7C357.2 162.2 280.5 192 200.7 192V192z"],bullseye:[512,512,[],"f140","M288 256C288 273.7 273.7 288 256 288C238.3 288 224 273.7 224 256C224 238.3 238.3 224 256 224C273.7 224 288 238.3 288 256zM112 256C112 176.5 176.5 112 256 112C335.5 112 400 176.5 400 256C400 335.5 335.5 400 256 400C176.5 400 112 335.5 112 256zM256 336C300.2 336 336 300.2 336 256C336 211.8 300.2 176 256 176C211.8 176 176 211.8 176 256C176 300.2 211.8 336 256 336zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 64C149.1 64 64 149.1 64 256C64 362 149.1 448 256 448C362 448 448 362 448 256C448 149.1 362 64 256 64z"],burger:[512,512,["hamburger"],"f805","M481.9 270.1C490.9 279.1 496 291.3 496 304C496 316.7 490.9 328.9 481.9 337.9C472.9 346.9 460.7 352 448 352H64C51.27 352 39.06 346.9 30.06 337.9C21.06 328.9 16 316.7 16 304C16 291.3 21.06 279.1 30.06 270.1C39.06 261.1 51.27 256 64 256H448C460.7 256 472.9 261.1 481.9 270.1zM475.3 388.7C478.3 391.7 480 395.8 480 400V416C480 432.1 473.3 449.3 461.3 461.3C449.3 473.3 432.1 480 416 480H96C79.03 480 62.75 473.3 50.75 461.3C38.74 449.3 32 432.1 32 416V400C32 395.8 33.69 391.7 36.69 388.7C39.69 385.7 43.76 384 48 384H464C468.2 384 472.3 385.7 475.3 388.7zM50.39 220.8C45.93 218.6 42.03 215.5 38.97 211.6C35.91 207.7 33.79 203.2 32.75 198.4C31.71 193.5 31.8 188.5 32.99 183.7C54.98 97.02 146.5 32 256 32C365.5 32 457 97.02 479 183.7C480.2 188.5 480.3 193.5 479.2 198.4C478.2 203.2 476.1 207.7 473 211.6C469.1 215.5 466.1 218.6 461.6 220.8C457.2 222.9 452.3 224 447.3 224H64.67C59.73 224 54.84 222.9 50.39 220.8zM372.7 116.7C369.7 119.7 368 123.8 368 128C368 131.2 368.9 134.3 370.7 136.9C372.5 139.5 374.1 141.6 377.9 142.8C380.8 143.1 384 144.3 387.1 143.7C390.2 143.1 393.1 141.6 395.3 139.3C397.6 137.1 399.1 134.2 399.7 131.1C400.3 128 399.1 124.8 398.8 121.9C397.6 118.1 395.5 116.5 392.9 114.7C390.3 112.9 387.2 111.1 384 111.1C379.8 111.1 375.7 113.7 372.7 116.7V116.7zM244.7 84.69C241.7 87.69 240 91.76 240 96C240 99.16 240.9 102.3 242.7 104.9C244.5 107.5 246.1 109.6 249.9 110.8C252.8 111.1 256 112.3 259.1 111.7C262.2 111.1 265.1 109.6 267.3 107.3C269.6 105.1 271.1 102.2 271.7 99.12C272.3 96.02 271.1 92.8 270.8 89.88C269.6 86.95 267.5 84.45 264.9 82.7C262.3 80.94 259.2 79.1 256 79.1C251.8 79.1 247.7 81.69 244.7 84.69V84.69zM116.7 116.7C113.7 119.7 112 123.8 112 128C112 131.2 112.9 134.3 114.7 136.9C116.5 139.5 118.1 141.6 121.9 142.8C124.8 143.1 128 144.3 131.1 143.7C134.2 143.1 137.1 141.6 139.3 139.3C141.6 137.1 143.1 134.2 143.7 131.1C144.3 128 143.1 124.8 142.8 121.9C141.6 118.1 139.5 116.5 136.9 114.7C134.3 112.9 131.2 111.1 128 111.1C123.8 111.1 119.7 113.7 116.7 116.7L116.7 116.7z"],burst:[512,512,[],"e4dc","M200.9 116.2L233.2 16.6C236.4 6.706 245.6 .001 256 .001C266.4 .001 275.6 6.706 278.8 16.6L313.3 123.1L383.8 97.45C392.6 94.26 402.4 96.43 408.1 103C415.6 109.6 417.7 119.4 414.6 128.2L388.9 198.7L495.4 233.2C505.3 236.4 512 245.6 512 256C512 266.4 505.3 275.6 495.4 278.8L392.3 312.2L445.2 412.8C450.1 422.1 448.4 433.5 440.1 440.1C433.5 448.4 422.1 450.1 412.8 445.2L312.2 392.3L278.8 495.4C275.6 505.3 266.4 512 256 512C245.6 512 236.4 505.3 233.2 495.4L199.8 392.3L99.17 445.2C89.87 450.1 78.46 448.4 71.03 440.1C63.6 433.5 61.87 422.1 66.76 412.8L119.7 312.2L16.6 278.8C6.705 275.6 .0003 266.4 .0003 256C.0003 245.6 6.705 236.4 16.6 233.2L116.2 200.9L4.208 37.57C-2.33 28.04-1.143 15.2 7.03 7.03C15.2-1.144 28.04-2.33 37.57 4.208L200.9 116.2z"],bus:[576,512,[128653],"f207","M288 0C422.4 0 512 35.2 512 80V128C529.7 128 544 142.3 544 160V224C544 241.7 529.7 256 512 256L512 416C512 433.7 497.7 448 480 448V480C480 497.7 465.7 512 448 512H416C398.3 512 384 497.7 384 480V448H192V480C192 497.7 177.7 512 160 512H128C110.3 512 96 497.7 96 480V448C78.33 448 64 433.7 64 416L64 256C46.33 256 32 241.7 32 224V160C32 142.3 46.33 128 64 128V80C64 35.2 153.6 0 288 0zM128 256C128 273.7 142.3 288 160 288H272V128H160C142.3 128 128 142.3 128 160V256zM304 288H416C433.7 288 448 273.7 448 256V160C448 142.3 433.7 128 416 128H304V288zM144 400C161.7 400 176 385.7 176 368C176 350.3 161.7 336 144 336C126.3 336 112 350.3 112 368C112 385.7 126.3 400 144 400zM432 400C449.7 400 464 385.7 464 368C464 350.3 449.7 336 432 336C414.3 336 400 350.3 400 368C400 385.7 414.3 400 432 400zM368 64H208C199.2 64 192 71.16 192 80C192 88.84 199.2 96 208 96H368C376.8 96 384 88.84 384 80C384 71.16 376.8 64 368 64z"],"bus-simple":[448,512,["bus-alt"],"f55e","M224 0C348.8 0 448 35.2 448 80V416C448 433.7 433.7 448 416 448V480C416 497.7 401.7 512 384 512H352C334.3 512 320 497.7 320 480V448H128V480C128 497.7 113.7 512 96 512H64C46.33 512 32 497.7 32 480V448C14.33 448 0 433.7 0 416V80C0 35.2 99.19 0 224 0zM64 256C64 273.7 78.33 288 96 288H352C369.7 288 384 273.7 384 256V128C384 110.3 369.7 96 352 96H96C78.33 96 64 110.3 64 128V256zM80 400C97.67 400 112 385.7 112 368C112 350.3 97.67 336 80 336C62.33 336 48 350.3 48 368C48 385.7 62.33 400 80 400zM368 400C385.7 400 400 385.7 400 368C400 350.3 385.7 336 368 336C350.3 336 336 350.3 336 368C336 385.7 350.3 400 368 400z"],"business-time":[640,512,["briefcase-clock"],"f64a","M496 224C416.4 224 352 288.4 352 368s64.38 144 144 144s144-64.38 144-144S575.6 224 496 224zM544 384h-54.25C484.4 384 480 379.6 480 374.3V304C480 295.2 487.2 288 496 288C504.8 288 512 295.2 512 304V352h32c8.838 0 16 7.162 16 16C560 376.8 552.8 384 544 384zM320.1 352H208C199.2 352 192 344.8 192 336V288H0v144C0 457.6 22.41 480 48 480h312.2C335.1 449.6 320 410.5 320 368C320 362.6 320.5 357.3 320.1 352zM496 192c5.402 0 10.72 .3301 16 .8066V144C512 118.4 489.6 96 464 96H384V48C384 22.41 361.6 0 336 0h-160C150.4 0 128 22.41 128 48V96H48C22.41 96 0 118.4 0 144V256h360.2C392.5 216.9 441.3 192 496 192zM336 96h-160V48h160V96z"],c:[384,512,[99],"43","M352 359.8c22.46 0 31.1 19.53 31.1 31.99c0 23.14-66.96 88.23-164.5 88.23c-137.1 0-219.4-117.8-219.4-224c0-103.8 79.87-223.1 219.4-223.1c99.47 0 164.5 66.12 164.5 88.23c0 12.27-9.527 32.01-32.01 32.01c-31.32 0-45.8-56.25-132.5-56.25c-97.99 0-155.4 84.59-155.4 159.1c0 74.03 56.42 160 155.4 160C306.5 416 320.5 359.8 352 359.8z"],"cable-car":[512,512,[128673,57551,"tram"],"f7da","M256 32C256 14.33 270.3 0 288 0C305.7 0 320 14.33 320 32C320 49.67 305.7 64 288 64C270.3 64 256 49.67 256 32zM224 56C224 73.67 209.7 88 192 88C174.3 88 160 73.67 160 56C160 38.33 174.3 24 192 24C209.7 24 224 38.33 224 56zM32 288C32 252.7 60.65 224 96 224H232V157.5L28.86 199.5C15.88 202.2 3.183 193.8 .4976 180.9C-2.188 167.9 6.157 155.2 19.14 152.5L483.1 56.5C496.1 53.81 508.8 62.16 511.5 75.14C514.2 88.12 505.8 100.8 492.9 103.5L280 147.5V224H416C451.3 224 480 252.7 480 288V448C480 483.3 451.3 512 416 512H96C60.65 512 32 483.3 32 448V288zM96 288C87.16 288 80 295.2 80 304V368C80 376.8 87.16 384 96 384H160C168.8 384 176 376.8 176 368V304C176 295.2 168.8 288 160 288H96zM208 368C208 376.8 215.2 384 224 384H288C296.8 384 304 376.8 304 368V304C304 295.2 296.8 288 288 288H224C215.2 288 208 295.2 208 304V368zM352 288C343.2 288 336 295.2 336 304V368C336 376.8 343.2 384 352 384H416C424.8 384 432 376.8 432 368V304C432 295.2 424.8 288 416 288H352z"],"cake-candles":[448,512,[127874,"birthday-cake","cake"],"f1fd","M352 111.1c22.09 0 40-17.88 40-39.97S352 0 352 0s-40 49.91-40 72S329.9 111.1 352 111.1zM224 111.1c22.09 0 40-17.88 40-39.97S224 0 224 0S184 49.91 184 72S201.9 111.1 224 111.1zM383.1 223.1L384 160c0-8.836-7.164-16-16-16h-32C327.2 144 320 151.2 320 160v64h-64V160c0-8.836-7.164-16-16-16h-32C199.2 144 192 151.2 192 160v64H128V160c0-8.836-7.164-16-16-16h-32C71.16 144 64 151.2 64 160v63.97c-35.35 0-64 28.65-64 63.1v68.7c9.814 6.102 21.39 11.33 32 11.33c20.64 0 45.05-19.73 52.7-27.33c6.25-6.219 16.34-6.219 22.59 0C114.1 348.3 139.4 367.1 160 367.1s45.05-19.73 52.7-27.33c6.25-6.219 16.34-6.219 22.59 0C242.1 348.3 267.4 367.1 288 367.1s45.05-19.73 52.7-27.33c6.25-6.219 16.34-6.219 22.59 0C370.1 348.3 395.4 367.1 416 367.1c10.61 0 22.19-5.227 32-11.33V287.1C448 252.6 419.3 223.1 383.1 223.1zM352 373.3c-13.75 10.95-38.03 26.66-64 26.66s-50.25-15.7-64-26.66c-13.75 10.95-38.03 26.66-64 26.66s-50.25-15.7-64-26.66c-13.75 10.95-38.03 26.66-64 26.66c-11.27 0-22.09-3.121-32-7.377v87.38C0 497.7 14.33 512 32 512h384c17.67 0 32-14.33 32-32v-87.38c-9.91 4.256-20.73 7.377-32 7.377C390 399.1 365.8 384.3 352 373.3zM96 111.1c22.09 0 40-17.88 40-39.97S96 0 96 0S56 49.91 56 72S73.91 111.1 96 111.1z"],calculator:[384,512,[128425],"f1ec","M336 0h-288C22.38 0 0 22.38 0 48v416C0 489.6 22.38 512 48 512h288c25.62 0 48-22.38 48-48v-416C384 22.38 361.6 0 336 0zM64 208C64 199.2 71.2 192 80 192h32C120.8 192 128 199.2 128 208v32C128 248.8 120.8 256 112 256h-32C71.2 256 64 248.8 64 240V208zM64 304C64 295.2 71.2 288 80 288h32C120.8 288 128 295.2 128 304v32C128 344.8 120.8 352 112 352h-32C71.2 352 64 344.8 64 336V304zM224 432c0 8.801-7.199 16-16 16h-128C71.2 448 64 440.8 64 432v-32C64 391.2 71.2 384 80 384h128c8.801 0 16 7.199 16 16V432zM224 336c0 8.801-7.199 16-16 16h-32C167.2 352 160 344.8 160 336v-32C160 295.2 167.2 288 176 288h32C216.8 288 224 295.2 224 304V336zM224 240C224 248.8 216.8 256 208 256h-32C167.2 256 160 248.8 160 240v-32C160 199.2 167.2 192 176 192h32C216.8 192 224 199.2 224 208V240zM320 432c0 8.801-7.199 16-16 16h-32c-8.799 0-16-7.199-16-16v-32c0-8.801 7.201-16 16-16h32c8.801 0 16 7.199 16 16V432zM320 336c0 8.801-7.199 16-16 16h-32c-8.799 0-16-7.199-16-16v-32C256 295.2 263.2 288 272 288h32C312.8 288 320 295.2 320 304V336zM320 240C320 248.8 312.8 256 304 256h-32C263.2 256 256 248.8 256 240v-32C256 199.2 263.2 192 272 192h32C312.8 192 320 199.2 320 208V240zM320 144C320 152.8 312.8 160 304 160h-224C71.2 160 64 152.8 64 144v-64C64 71.2 71.2 64 80 64h224C312.8 64 320 71.2 320 80V144z"],calendar:[448,512,[128198,128197],"f133","M96 32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32zM448 464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192H448V464z"],"calendar-check":[448,512,[],"f274","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM328.1 304.1C338.3 295.6 338.3 280.4 328.1 271C319.6 261.7 304.4 261.7 295 271L200 366.1L152.1 319C143.6 309.7 128.4 309.7 119 319C109.7 328.4 109.7 343.6 119 352.1L183 416.1C192.4 426.3 207.6 426.3 216.1 416.1L328.1 304.1z"],"calendar-day":[448,512,[],"f783","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM80 256C71.16 256 64 263.2 64 272V368C64 376.8 71.16 384 80 384H176C184.8 384 192 376.8 192 368V272C192 263.2 184.8 256 176 256H80z"],"calendar-days":[448,512,["calendar-alt"],"f073","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM64 304C64 312.8 71.16 320 80 320H112C120.8 320 128 312.8 128 304V272C128 263.2 120.8 256 112 256H80C71.16 256 64 263.2 64 272V304zM192 304C192 312.8 199.2 320 208 320H240C248.8 320 256 312.8 256 304V272C256 263.2 248.8 256 240 256H208C199.2 256 192 263.2 192 272V304zM336 256C327.2 256 320 263.2 320 272V304C320 312.8 327.2 320 336 320H368C376.8 320 384 312.8 384 304V272C384 263.2 376.8 256 368 256H336zM64 432C64 440.8 71.16 448 80 448H112C120.8 448 128 440.8 128 432V400C128 391.2 120.8 384 112 384H80C71.16 384 64 391.2 64 400V432zM208 384C199.2 384 192 391.2 192 400V432C192 440.8 199.2 448 208 448H240C248.8 448 256 440.8 256 432V400C256 391.2 248.8 384 240 384H208zM320 432C320 440.8 327.2 448 336 448H368C376.8 448 384 440.8 384 432V400C384 391.2 376.8 384 368 384H336C327.2 384 320 391.2 320 400V432z"],"calendar-minus":[448,512,[],"f272","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM312 376C325.3 376 336 365.3 336 352C336 338.7 325.3 328 312 328H136C122.7 328 112 338.7 112 352C112 365.3 122.7 376 136 376H312z"],"calendar-plus":[448,512,[],"f271","M96 32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32zM448 464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192H448V464zM200 272V328H144C130.7 328 120 338.7 120 352C120 365.3 130.7 376 144 376H200V432C200 445.3 210.7 456 224 456C237.3 456 248 445.3 248 432V376H304C317.3 376 328 365.3 328 352C328 338.7 317.3 328 304 328H248V272C248 258.7 237.3 248 224 248C210.7 248 200 258.7 200 272z"],"calendar-week":[448,512,[],"f784","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM80 256C71.16 256 64 263.2 64 272V336C64 344.8 71.16 352 80 352H368C376.8 352 384 344.8 384 336V272C384 263.2 376.8 256 368 256H80z"],"calendar-xmark":[448,512,["calendar-times"],"f273","M160 32V64H288V32C288 14.33 302.3 0 320 0C337.7 0 352 14.33 352 32V64H400C426.5 64 448 85.49 448 112V160H0V112C0 85.49 21.49 64 48 64H96V32C96 14.33 110.3 0 128 0C145.7 0 160 14.33 160 32zM0 192H448V464C448 490.5 426.5 512 400 512H48C21.49 512 0 490.5 0 464V192zM304.1 304.1C314.3 295.6 314.3 280.4 304.1 271C295.6 261.7 280.4 261.7 271 271L224 318.1L176.1 271C167.6 261.7 152.4 261.7 143 271C133.7 280.4 133.7 295.6 143 304.1L190.1 352L143 399C133.7 408.4 133.7 423.6 143 432.1C152.4 442.3 167.6 442.3 176.1 432.1L224 385.9L271 432.1C280.4 442.3 295.6 442.3 304.1 432.1C314.3 423.6 314.3 408.4 304.1 399L257.9 352L304.1 304.1z"],camera:[512,512,[62258,"camera-alt"],"f030","M194.6 32H317.4C338.1 32 356.4 45.22 362.9 64.82L373.3 96H448C483.3 96 512 124.7 512 160V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V160C0 124.7 28.65 96 64 96H138.7L149.1 64.82C155.6 45.22 173.9 32 194.6 32H194.6zM256 384C309 384 352 341 352 288C352 234.1 309 192 256 192C202.1 192 160 234.1 160 288C160 341 202.1 384 256 384z"],"camera-retro":[512,512,[128247],"f083","M64 64V48C64 39.16 71.16 32 80 32H144C152.8 32 160 39.16 160 48V64H192L242.5 38.76C251.4 34.31 261.2 32 271.1 32H448C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V128C0 92.65 28.65 64 64 64zM220.6 121.2C211.7 125.7 201.9 128 192 128H64V192H178.8C200.8 176.9 227.3 168 256 168C284.7 168 311.2 176.9 333.2 192H448V96H271.1L220.6 121.2zM256 216C207.4 216 168 255.4 168 304C168 352.6 207.4 392 256 392C304.6 392 344 352.6 344 304C344 255.4 304.6 216 256 216z"],"camera-rotate":[512,512,[],"e0d8","M464 96h-88l-12.38-32.88C356.6 44.38 338.8 32 318.8 32h-125.5c-20 0-38 12.38-45 31.12L136 96H48C21.5 96 0 117.5 0 144v288C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48v-288C512 117.5 490.5 96 464 96zM356.9 366.8C332.4 398.1 295.7 416 256 416c-31.78 0-61.37-11.94-84.58-32.61l-19.28 19.29C143.2 411.6 128 405.3 128 392.7V316.3c0-5.453 4.359-9.838 9.775-9.99h76.98c12.35 .3027 18.47 15.27 9.654 24.09l-19.27 19.28C219.3 361.4 237.1 368 256 368c24.8 0 47.78-11.22 63.08-30.78c8.172-10.44 23.25-12.28 33.69-4.125S365.1 356.3 356.9 366.8zM384 259.7c0 5.453-4.359 9.838-9.775 9.99h-76.98c-12.35-.3027-18.47-15.27-9.654-24.09l19.27-19.28C292.7 214.6 274.9 208 256 208c-24.8 0-47.78 11.22-63.08 30.78C184.8 249.2 169.7 251.1 159.2 242.9C148.8 234.8 146.9 219.7 155.1 209.2C179.6 177.9 216.3 160 256 160c31.78 0 61.37 11.94 84.58 32.61l19.28-19.29C368.8 164.4 384 170.7 384 183.3V259.7z"],campground:[576,512,[9978],"f6bb","M328.1 112L563.7 405.4C571.7 415.4 576 427.7 576 440.4V464C576 490.5 554.5 512 528 512H48C21.49 512 0 490.5 0 464V440.4C0 427.7 4.328 415.4 12.27 405.4L247 112L199 51.99C187.1 38.19 190.2 18.05 204 7.013C217.8-4.027 237.9-1.789 248.1 12.01L288 60.78L327 12.01C338.1-1.789 358.2-4.027 371.1 7.013C385.8 18.05 388 38.19 376.1 51.99L328.1 112zM407.5 448L288 291.7L168.5 448H407.5z"],"candy-cane":[512,512,[],"f786","M497.5 91.1C469.6 33.13 411.8 0 352.4 0c-27.88 0-56.14 7.25-81.77 22.62L243.1 38.1C227.9 48.12 223 67.75 232.1 82.87l32.76 54.87c8.522 14.2 27.59 20.6 43.88 11.06l27.51-16.37c5.125-3.125 10.95-4.439 16.58-4.439c10.88 0 21.35 5.625 27.35 15.62c9 15.12 3.917 34.59-11.08 43.71L15.6 397.6c-15.25 9.125-20.13 28.62-11 43.87l32.76 54.87c8.522 14.2 27.59 20.66 43.88 11.12l347.4-206.5C500.2 258.1 533.2 167.5 497.5 91.1zM319.7 104.1L317.2 106.5l-20.5-61.5c9.75-4.75 19.88-8.125 30.38-10.25l20.63 61.87C337.8 97.37 328.2 99.87 319.7 104.1zM145.8 431.7l-60.5-38.5l30.88-18.25l60.5 38.5L145.8 431.7zM253.3 367.9l-60.5-38.5l30.88-18.25l60.5 38.5L253.3 367.9zM364.2 301.1L303.7 263.5l30.88-18.25l60.5 38.5L364.2 301.1zM384.7 104.7l46-45.1c8.375 6.5 16 13.1 22.5 22.5l-45.63 45.81C401.9 117.8 393.9 110.1 384.7 104.7zM466.7 212.5l-59.5-19.75c3.25-5.375 5.875-10.1 7.5-17.12c1-4.5 1.625-9.125 1.75-13.62l60.38 20.12C474.7 192.5 471.4 202.7 466.7 212.5z"],cannabis:[576,512,[],"f55f","M544 374.4c0 6-3.25 11.38-8.5 14.12c-2.5 1.375-60.75 31.75-133.5 31.75c-6.124 0-12-.125-17.5-.25c11.38 22.25 16.5 38.25 16.75 39.13c1.875 5.75 .375 12-3.875 16.12c-4.125 4.25-10.38 5.75-16.12 4c-1.631-.4648-32.94-10.66-69.25-34.06v42.81C312 501.3 301.3 512 288 512s-24-10.75-24-23.1v-42.81c-36.31 23.4-67.62 33.59-69.25 34.06c-5.75 1.75-12 .25-16.12-4c-4.25-4.25-5.75-10.38-3.875-16.12C175 458.3 180.1 442.1 191.5 420c-5.501 .125-11.37 .25-17.5 .25c-72.75 0-130.1-30.38-133.5-31.75C35.25 385.8 32 380.4 32 374.4c0-5.875 3.25-11.38 8.5-14.12c1.625-.875 32.38-16.88 76.75-25.75c-64.25-75.13-84-161.8-84.88-165.8C31.25 163.5 32.75 157.9 36.63 154C39.75 151 43.75 149.4 48 149.4c1.125 0 2.25 .125 3.375 .375C55.38 150.6 137.1 169.3 212 229.5V225.1c0-118.9 60-213.8 62.5-217.8C277.5 2.75 282.5 0 288 0s10.5 2.75 13.5 7.375C304 11.38 364 106.3 364 225.1V229.5c73.1-60.25 156.6-79 160.5-79.75C525.8 149.5 526.9 149.4 528 149.4c4.25 0 8.25 1.625 11.38 4.625c3.75 3.875 5.375 9.5 4.25 14.75c-.875 4-20.62 90.63-84.88 165.8c44.38 8.875 75.13 24.88 76.75 25.75C540.8 363 544 368.5 544 374.4z"],capsules:[576,512,[],"f46b","M555.3 300.1L424.3 112.8C401.9 81 366.4 64 330.4 64c-22.63 0-45.5 6.75-65.5 20.75C245.2 98.5 231.2 117.5 223.4 138.5C220.5 79.25 171.1 32 111.1 32c-61.88 0-111.1 50.08-111.1 111.1L-.0028 368c0 61.88 50.12 112 112 112s112-50.13 112-112L223.1 218.9C227.2 227.5 231.2 236 236.7 243.9l131.3 187.4C390.3 463 425.8 480 461.8 480c22.75 0 45.5-6.75 65.5-20.75C579 423.1 591.5 351.8 555.3 300.1zM159.1 256H63.99V144c0-26.5 21.5-48 48-48s48 21.5 48 48V256zM354.8 300.9l-65.5-93.63c-7.75-11-10.75-24.5-8.375-37.63c2.375-13.25 9.75-24.87 20.75-32.5C310.1 131.1 320.1 128 330.4 128c16.5 0 31.88 8 41.38 21.5l65.5 93.75L354.8 300.9z"],car:[512,512,[128664,"automobile"],"f1b9","M39.61 196.8L74.8 96.29C88.27 57.78 124.6 32 165.4 32H346.6C387.4 32 423.7 57.78 437.2 96.29L472.4 196.8C495.6 206.4 512 229.3 512 256V448C512 465.7 497.7 480 480 480H448C430.3 480 416 465.7 416 448V400H96V448C96 465.7 81.67 480 64 480H32C14.33 480 0 465.7 0 448V256C0 229.3 16.36 206.4 39.61 196.8V196.8zM109.1 192H402.9L376.8 117.4C372.3 104.6 360.2 96 346.6 96H165.4C151.8 96 139.7 104.6 135.2 117.4L109.1 192zM96 256C78.33 256 64 270.3 64 288C64 305.7 78.33 320 96 320C113.7 320 128 305.7 128 288C128 270.3 113.7 256 96 256zM416 320C433.7 320 448 305.7 448 288C448 270.3 433.7 256 416 256C398.3 256 384 270.3 384 288C384 305.7 398.3 320 416 320z"],"car-battery":[512,512,["battery-car"],"f5df","M80 96C80 78.33 94.33 64 112 64H176C193.7 64 208 78.33 208 96H304C304 78.33 318.3 64 336 64H400C417.7 64 432 78.33 432 96H448C483.3 96 512 124.7 512 160V384C512 419.3 483.3 448 448 448H64C28.65 448 0 419.3 0 384V160C0 124.7 28.65 96 64 96H80zM384 192C384 183.2 376.8 176 368 176C359.2 176 352 183.2 352 192V224H320C311.2 224 304 231.2 304 240C304 248.8 311.2 256 320 256H352V288C352 296.8 359.2 304 368 304C376.8 304 384 296.8 384 288V256H416C424.8 256 432 248.8 432 240C432 231.2 424.8 224 416 224H384V192zM96 256H192C200.8 256 208 248.8 208 240C208 231.2 200.8 224 192 224H96C87.16 224 80 231.2 80 240C80 248.8 87.16 256 96 256z"],"car-burst":[640,512,["car-crash"],"f5e1","M176 8C182.6 8 188.4 11.1 190.9 18.09L220.3 92.05L296.4 68.93C302.7 67.03 309.5 69.14 313.6 74.27C314.1 74.85 314.5 75.45 314.9 76.08C297.8 84.32 282.7 96.93 271.4 113.3L230.4 172.5C203.1 181.4 180.6 203.5 172.6 233.4L152.7 307.4L117.4 339.9C112.6 344.4 105.5 345.4 99.64 342.6C93.73 339.7 90.16 333.6 90.62 327L96.21 247.6L17.56 235.4C11.08 234.4 5.871 229.6 4.413 223.2C2.954 216.8 5.54 210.1 10.94 206.4L76.5 161.3L37.01 92.18C33.76 86.49 34.31 79.39 38.4 74.27C42.48 69.14 49.28 67.03 55.55 68.93L131.7 92.05L161.1 18.09C163.6 11.1 169.4 8 176 8L176 8zM384.2 99.67L519.8 135.1C552.5 144.7 576.1 173.1 578.8 206.8L585.7 290.7C602.9 304.2 611.3 327 605.3 349.4L570.1 480.8C565.5 497.8 547.1 507.1 530.9 503.4L515.5 499.3C498.4 494.7 488.3 477.1 492.8 460.1L501.1 429.1L253.8 362.9L245.6 393.8C240.1 410.9 223.4 421 206.4 416.4L190.9 412.3C173.8 407.7 163.7 390.2 168.3 373.1L203.5 241.7C209.5 219.3 228.2 203.8 249.8 200.7L297.7 131.5C316.9 103.6 351.6 90.92 384.2 99.67L384.2 99.67zM367.7 161.5C361.1 159.7 354.2 162.3 350.4 167.8L318.1 214.5L519.6 268.5L515 211.1C514.5 205.2 509.8 199.6 503.2 197.8L367.7 161.5zM268.3 308.8C281.1 312.2 294.3 304.6 297.7 291.8C301.2 279 293.6 265.9 280.8 262.4C267.1 259 254.8 266.6 251.4 279.4C247.9 292.2 255.5 305.4 268.3 308.8zM528 328.7C515.2 325.3 502.1 332.9 498.6 345.7C495.2 358.5 502.8 371.6 515.6 375.1C528.4 378.5 541.6 370.9 545 358.1C548.4 345.3 540.8 332.1 528 328.7z"],"car-on":[448,512,[],"e4dd","M248 104C248 117.3 237.3 128 224 128C210.7 128 200 117.3 200 104V24C200 10.75 210.7 0 224 0C237.3 0 248 10.75 248 24V104zM153.8 160H294.2C327.1 160 358.1 181.3 369.5 213.1L397.8 292.4C417.9 300.9 432 320.8 432 344V480C432 497.7 417.7 512 400 512H384C366.3 512 352 497.7 352 480V448H96V480C96 497.7 81.67 512 64 512H48C30.33 512 16 497.7 16 480V344C16 320.8 30.08 300.9 50.16 292.4L78.49 213.1C89.86 181.3 120 160 153.8 160H153.8zM153.8 224C147.1 224 141 228.3 138.8 234.6L119.7 288H328.3L309.2 234.6C306.1 228.3 300.9 224 294.2 224H153.8zM96 392C109.3 392 120 381.3 120 368C120 354.7 109.3 344 96 344C82.75 344 72 354.7 72 368C72 381.3 82.75 392 96 392zM352 344C338.7 344 328 354.7 328 368C328 381.3 338.7 392 352 392C365.3 392 376 381.3 376 368C376 354.7 365.3 344 352 344zM7.029 39.03C16.4 29.66 31.6 29.66 40.97 39.03L88.97 87.03C98.34 96.4 98.34 111.6 88.97 120.1C79.6 130.3 64.4 130.3 55.03 120.1L7.029 72.97C-2.343 63.6-2.343 48.4 7.029 39.03V39.03zM407 39.03C416.4 29.66 431.6 29.66 440.1 39.03C450.3 48.4 450.3 63.6 440.1 72.97L392.1 120.1C383.6 130.3 368.4 130.3 359 120.1C349.7 111.6 349.7 96.4 359 87.03L407 39.03z"],"car-rear":[512,512,["car-alt"],"f5de","M165.4 32H346.6C387.4 32 423.7 57.78 437.2 96.29L472.4 196.8C495.6 206.4 512 229.3 512 256V336C512 359.7 499.1 380.4 480 391.4V448C480 465.7 465.7 480 448 480H416C398.3 480 384 465.7 384 448V400H128V448C128 465.7 113.7 480 96 480H64C46.33 480 32 465.7 32 448V391.4C12.87 380.4 0 359.7 0 336V256C0 229.3 16.36 206.4 39.61 196.8L74.8 96.29C88.27 57.78 124.6 32 165.4 32V32zM165.4 96C151.8 96 139.7 104.6 135.2 117.4L109.1 192H402.9L376.8 117.4C372.3 104.6 360.2 96 346.6 96H165.4zM208 272C199.2 272 192 279.2 192 288V320C192 328.8 199.2 336 208 336H304C312.8 336 320 328.8 320 320V288C320 279.2 312.8 272 304 272H208zM72 304H104C117.3 304 128 293.3 128 280C128 266.7 117.3 256 104 256H72C58.75 256 48 266.7 48 280C48 293.3 58.75 304 72 304zM408 256C394.7 256 384 266.7 384 280C384 293.3 394.7 304 408 304H440C453.3 304 464 293.3 464 280C464 266.7 453.3 256 440 256H408z"],"car-side":[640,512,[128663],"f5e4","M640 320V368C640 385.7 625.7 400 608 400H574.7C567.1 445.4 527.6 480 480 480C432.4 480 392.9 445.4 385.3 400H254.7C247.1 445.4 207.6 480 160 480C112.4 480 72.94 445.4 65.33 400H32C14.33 400 0 385.7 0 368V256C0 228.9 16.81 205.8 40.56 196.4L82.2 92.35C96.78 55.9 132.1 32 171.3 32H353.2C382.4 32 409.1 45.26 428.2 68.03L528.2 193C591.2 200.1 640 254.8 640 319.1V320zM171.3 96C158.2 96 146.5 103.1 141.6 116.1L111.3 192H224V96H171.3zM272 192H445.4L378.2 108C372.2 100.4 362.1 96 353.2 96H272V192zM525.3 400C527 394.1 528 389.6 528 384C528 357.5 506.5 336 480 336C453.5 336 432 357.5 432 384C432 389.6 432.1 394.1 434.7 400C441.3 418.6 459.1 432 480 432C500.9 432 518.7 418.6 525.3 400zM205.3 400C207 394.1 208 389.6 208 384C208 357.5 186.5 336 160 336C133.5 336 112 357.5 112 384C112 389.6 112.1 394.1 114.7 400C121.3 418.6 139.1 432 160 432C180.9 432 198.7 418.6 205.3 400z"],"car-tunnel":[512,512,[],"e4de","M190.8 277.5C191.8 274.2 194.9 272 198.4 272H313.6C317.1 272 320.2 274.2 321.2 277.5L334.1 320H177L190.8 277.5zM144 384C144 370.7 154.7 360 168 360C181.3 360 192 370.7 192 384C192 397.3 181.3 408 168 408C154.7 408 144 397.3 144 384zM368 384C368 397.3 357.3 408 344 408C330.7 408 320 397.3 320 384C320 370.7 330.7 360 344 360C357.3 360 368 370.7 368 384zM512 256V448C512 483.3 483.3 512 448 512H384H128H64C28.65 512 0 483.3 0 448V256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM384 512C401.7 512 416 497.7 416 480V376C416 355.2 404.7 337.1 387.8 327.4L366.9 262.7C359.4 239.6 337.9 224 313.6 224H198.4C174.1 224 152.6 239.6 145.1 262.7L124.1 327.4C107.3 337.1 96 355.2 96 376V480C96 497.7 110.3 512 128 512C145.7 512 160 497.7 160 480V448H352V480C352 497.7 366.3 512 384 512H384z"],caravan:[640,512,[],"f8ff","M0 112C0 67.82 35.82 32 80 32H416C504.4 32 576 103.6 576 192V352H608C625.7 352 640 366.3 640 384C640 401.7 625.7 416 608 416H288C288 469 245 512 192 512C138.1 512 96 469 96 416H80C35.82 416 0 380.2 0 336V112zM320 352H448V256H416C407.2 256 400 248.8 400 240C400 231.2 407.2 224 416 224H448V160C448 142.3 433.7 128 416 128H352C334.3 128 320 142.3 320 160V352zM96 128C78.33 128 64 142.3 64 160V224C64 241.7 78.33 256 96 256H224C241.7 256 256 241.7 256 224V160C256 142.3 241.7 128 224 128H96zM192 464C218.5 464 240 442.5 240 416C240 389.5 218.5 368 192 368C165.5 368 144 389.5 144 416C144 442.5 165.5 464 192 464z"],"caret-down":[320,512,[],"f0d7","M310.6 246.6l-127.1 128C176.4 380.9 168.2 384 160 384s-16.38-3.125-22.63-9.375l-127.1-128C.2244 237.5-2.516 223.7 2.438 211.8S19.07 192 32 192h255.1c12.94 0 24.62 7.781 29.58 19.75S319.8 237.5 310.6 246.6z"],"caret-left":[256,512,[],"f0d9","M137.4 406.6l-128-127.1C3.125 272.4 0 264.2 0 255.1s3.125-16.38 9.375-22.63l128-127.1c9.156-9.156 22.91-11.9 34.88-6.943S192 115.1 192 128v255.1c0 12.94-7.781 24.62-19.75 29.58S146.5 415.8 137.4 406.6z"],"caret-right":[256,512,[],"f0da","M118.6 105.4l128 127.1C252.9 239.6 256 247.8 256 255.1s-3.125 16.38-9.375 22.63l-128 127.1c-9.156 9.156-22.91 11.9-34.88 6.943S64 396.9 64 383.1V128c0-12.94 7.781-24.62 19.75-29.58S109.5 96.23 118.6 105.4z"],"caret-up":[320,512,[],"f0d8","M9.39 265.4l127.1-128C143.6 131.1 151.8 128 160 128s16.38 3.125 22.63 9.375l127.1 128c9.156 9.156 11.9 22.91 6.943 34.88S300.9 320 287.1 320H32.01c-12.94 0-24.62-7.781-29.58-19.75S.2333 274.5 9.39 265.4z"],carrot:[512,512,[129365],"f787","M298.2 156.6C245.5 130.9 183.7 146.1 147.1 189.4l55.27 55.31c6.25 6.25 6.25 16.33 0 22.58c-3.127 3-7.266 4.605-11.39 4.605s-8.068-1.605-11.19-4.605L130.3 217l-128.1 262.8c-2.875 6-3 13.25 0 19.63c5.5 11.12 19 15.75 30 10.38l133.6-65.25L116.7 395.3c-6.377-6.125-6.377-16.38 0-22.5c6.25-6.25 16.37-6.25 22.5 0l56.98 56.98l102-49.89c24-11.63 44.5-31.26 57.13-57.13C385.5 261.1 359.9 186.8 298.2 156.6zM390.2 121.8C409.7 81 399.7 32.88 359.1 0c-50.25 41.75-52.51 107.5-7.875 151.9l8 8C404.5 204.5 470.4 202.3 512 152C479.1 112.3 430.1 102.3 390.2 121.8z"],"cart-arrow-down":[576,512,[],"f218","M0 24C0 10.75 10.75 0 24 0H96C107.5 0 117.4 8.19 119.6 19.51L121.1 32H312V134.1L288.1 111C279.6 101.7 264.4 101.7 255 111C245.7 120.4 245.7 135.6 255 144.1L319 208.1C328.4 218.3 343.6 218.3 352.1 208.1L416.1 144.1C426.3 135.6 426.3 120.4 416.1 111C407.6 101.7 392.4 101.7 383 111L360 134.1V32H541.8C562.1 32 578.3 52.25 572.6 72.66L518.6 264.7C514.7 278.5 502.1 288 487.8 288H170.7L179.9 336H488C501.3 336 512 346.7 512 360C512 373.3 501.3 384 488 384H159.1C148.5 384 138.6 375.8 136.4 364.5L76.14 48H24C10.75 48 0 37.25 0 24V24zM224 464C224 490.5 202.5 512 176 512C149.5 512 128 490.5 128 464C128 437.5 149.5 416 176 416C202.5 416 224 437.5 224 464zM416 464C416 437.5 437.5 416 464 416C490.5 416 512 437.5 512 464C512 490.5 490.5 512 464 512C437.5 512 416 490.5 416 464z"],"cart-flatbed":[640,512,["dolly-flatbed"],"f474","M240 320h320c26.4 0 48-21.6 48-48v-192C608 53.6 586.4 32 560 32H448v128l-48-32L352 160V32H240C213.6 32 192 53.6 192 80v192C192 298.4 213.6 320 240 320zM608 384H128V64c0-35.2-28.8-64-64-64H31.1C14.4 0 0 14.4 0 32S14.4 64 31.1 64H48C56.84 64 64 71.16 64 80v335.1c0 17.6 14.4 32 32 32l66.92-.0009C161.1 453 160 458.4 160 464C160 490.5 181.5 512 208 512S256 490.5 256 464c0-5.641-1.13-10.97-2.917-16h197.9c-1.787 5.027-2.928 10.36-2.928 16C448 490.5 469.5 512 496 512c26.51 0 48.01-21.49 48.01-47.1c0-5.641-1.12-10.97-2.907-16l66.88 .0009C625.6 448 640 433.6 640 415.1C640 398.4 625.6 384 608 384z"],"cart-flatbed-suitcase":[640,512,["luggage-cart"],"f59d","M541.2 448C542.1 453 544.1 458.4 544.1 464C544.1 490.5 522.6 512 496 512C469.5 512 448.1 490.5 448.1 464C448.1 458.4 449.2 453 450.1 448H253.1C254.9 453 256 458.4 256 464C256 490.5 234.5 512 208 512C181.5 512 160 490.5 160 464C160 458.4 161.1 453 162.9 448L96 448C78.4 448 64 433.6 64 416V80C64 71.16 56.84 64 48 64H32C14.4 64 0 49.6 0 32C0 14.4 14.4 0 32 0H64C99.2 0 128 28.8 128 64V384H608C625.6 384 640 398.4 640 416C640 433.6 625.6 448 608 448L541.2 448zM432 0C458.5 0 480 21.5 480 48V320H288V48C288 21.5 309.5 0 336 0H432zM336 96H432V48H336V96zM256 320H224C206.4 320 192 305.6 192 288V128C192 110.4 206.4 96 224 96H256V320zM576 128V288C576 305.6 561.6 320 544 320H512V96H544C561.6 96 576 110.4 576 128z"],"cart-plus":[576,512,[],"f217","M96 0C107.5 0 117.4 8.19 119.6 19.51L121.1 32H541.8C562.1 32 578.3 52.25 572.6 72.66L518.6 264.7C514.7 278.5 502.1 288 487.8 288H170.7L179.9 336H488C501.3 336 512 346.7 512 360C512 373.3 501.3 384 488 384H159.1C148.5 384 138.6 375.8 136.4 364.5L76.14 48H24C10.75 48 0 37.25 0 24C0 10.75 10.75 0 24 0H96zM272 180H316V224C316 235 324.1 244 336 244C347 244 356 235 356 224V180H400C411 180 420 171 420 160C420 148.1 411 140 400 140H356V96C356 84.95 347 76 336 76C324.1 76 316 84.95 316 96V140H272C260.1 140 252 148.1 252 160C252 171 260.1 180 272 180zM128 464C128 437.5 149.5 416 176 416C202.5 416 224 437.5 224 464C224 490.5 202.5 512 176 512C149.5 512 128 490.5 128 464zM512 464C512 490.5 490.5 512 464 512C437.5 512 416 490.5 416 464C416 437.5 437.5 416 464 416C490.5 416 512 437.5 512 464z"],"cart-shopping":[576,512,[128722,"shopping-cart"],"f07a","M96 0C107.5 0 117.4 8.19 119.6 19.51L121.1 32H541.8C562.1 32 578.3 52.25 572.6 72.66L518.6 264.7C514.7 278.5 502.1 288 487.8 288H170.7L179.9 336H488C501.3 336 512 346.7 512 360C512 373.3 501.3 384 488 384H159.1C148.5 384 138.6 375.8 136.4 364.5L76.14 48H24C10.75 48 0 37.25 0 24C0 10.75 10.75 0 24 0H96zM128 464C128 437.5 149.5 416 176 416C202.5 416 224 437.5 224 464C224 490.5 202.5 512 176 512C149.5 512 128 490.5 128 464zM512 464C512 490.5 490.5 512 464 512C437.5 512 416 490.5 416 464C416 437.5 437.5 416 464 416C490.5 416 512 437.5 512 464z"],"cash-register":[512,512,[],"f788","M288 0C305.7 0 320 14.33 320 32V96C320 113.7 305.7 128 288 128H208V160H424.1C456.6 160 483.5 183.1 488.2 214.4L510.9 364.1C511.6 368.8 512 373.6 512 378.4V448C512 483.3 483.3 512 448 512H64C28.65 512 0 483.3 0 448V378.4C0 373.6 .3622 368.8 1.083 364.1L23.76 214.4C28.5 183.1 55.39 160 87.03 160H143.1V128H63.1C46.33 128 31.1 113.7 31.1 96V32C31.1 14.33 46.33 0 63.1 0L288 0zM96 48C87.16 48 80 55.16 80 64C80 72.84 87.16 80 96 80H256C264.8 80 272 72.84 272 64C272 55.16 264.8 48 256 48H96zM80 448H432C440.8 448 448 440.8 448 432C448 423.2 440.8 416 432 416H80C71.16 416 64 423.2 64 432C64 440.8 71.16 448 80 448zM112 216C98.75 216 88 226.7 88 240C88 253.3 98.75 264 112 264C125.3 264 136 253.3 136 240C136 226.7 125.3 216 112 216zM208 264C221.3 264 232 253.3 232 240C232 226.7 221.3 216 208 216C194.7 216 184 226.7 184 240C184 253.3 194.7 264 208 264zM160 296C146.7 296 136 306.7 136 320C136 333.3 146.7 344 160 344C173.3 344 184 333.3 184 320C184 306.7 173.3 296 160 296zM304 264C317.3 264 328 253.3 328 240C328 226.7 317.3 216 304 216C290.7 216 280 226.7 280 240C280 253.3 290.7 264 304 264zM256 296C242.7 296 232 306.7 232 320C232 333.3 242.7 344 256 344C269.3 344 280 333.3 280 320C280 306.7 269.3 296 256 296zM400 264C413.3 264 424 253.3 424 240C424 226.7 413.3 216 400 216C386.7 216 376 226.7 376 240C376 253.3 386.7 264 400 264zM352 296C338.7 296 328 306.7 328 320C328 333.3 338.7 344 352 344C365.3 344 376 333.3 376 320C376 306.7 365.3 296 352 296z"],cat:[576,512,[128008],"f6be","M322.6 192C302.4 192 215.8 194 160 278V192c0-53-43-96-96-96C46.38 96 32 110.4 32 128s14.38 32 32 32s32 14.38 32 32v256c0 35.25 28.75 64 64 64h176c8.875 0 16-7.125 16-15.1V480c0-17.62-14.38-32-32-32h-32l128-96v144c0 8.875 7.125 16 16 16h32c8.875 0 16-7.125 16-16V289.9c-10.25 2.625-20.88 4.5-32 4.5C386.2 294.4 334.5 250.4 322.6 192zM480 96h-64l-64-64v134.4c0 53 43 95.1 96 95.1s96-42.1 96-95.1V32L480 96zM408 176c-8.875 0-16-7.125-16-16s7.125-16 16-16s16 7.125 16 16S416.9 176 408 176zM488 176c-8.875 0-16-7.125-16-16s7.125-16 16-16s16 7.125 16 16S496.9 176 488 176z"],"cedi-sign":[320,512,[],"e0df","M224 66.66C254.9 71.84 283.2 84.39 307.2 102.4C321.4 113 324.2 133.1 313.6 147.2C302.1 161.4 282.9 164.2 268.8 153.6C255.6 143.7 240.4 136.3 224 132V379.1C240.4 375.7 255.6 368.3 268.8 358.4C282.9 347.8 302.1 350.6 313.6 364.8C324.2 378.9 321.4 398.1 307.2 409.6C283.2 427.6 254.9 440.2 224 445.3V480C224 497.7 209.7 512 192 512C174.3 512 160 497.7 160 480V445.3C69.19 430.1 0 351.1 0 256C0 160.9 69.19 81.89 160 66.65V32C160 14.33 174.3 0 192 0C209.7 0 224 14.33 224 32V66.66zM160 132C104.8 146.2 64 196.4 64 255.1C64 315.6 104.8 365.8 160 379.1V132z"],"cent-sign":[320,512,[],"e3f5","M192 0C209.7 0 224 14.33 224 32V66.66C254.9 71.84 283.2 84.39 307.2 102.4C321.4 113 324.2 133.1 313.6 147.2C302.1 161.4 282.9 164.2 268.8 153.6C247.4 137.5 220.9 128 192 128C121.3 128 64 185.3 64 256C64 326.7 121.3 384 192 384C220.9 384 247.4 374.5 268.8 358.4C282.9 347.8 302.1 350.6 313.6 364.8C324.2 378.9 321.4 398.1 307.2 409.6C283.2 427.6 254.9 440.2 224 445.3V480C224 497.7 209.7 512 192 512C174.3 512 160 497.7 160 480V445.3C69.19 430.1 0 351.1 0 256C0 160.9 69.19 81.89 160 66.66V32C160 14.33 174.3 .0006 192 .0006V0z"],certificate:[512,512,[],"f0a3","M256 53.46L300.1 7.261C307 1.034 315.1-1.431 324.4 .8185C332.8 3.068 339.3 9.679 341.4 18.1L357.3 80.6L419.3 63.07C427.7 60.71 436.7 63.05 442.8 69.19C448.1 75.34 451.3 84.33 448.9 92.69L431.4 154.7L493.9 170.6C502.3 172.7 508.9 179.2 511.2 187.6C513.4 196 510.1 204.1 504.7 211L458.5 256L504.7 300.1C510.1 307 513.4 315.1 511.2 324.4C508.9 332.8 502.3 339.3 493.9 341.4L431.4 357.3L448.9 419.3C451.3 427.7 448.1 436.7 442.8 442.8C436.7 448.1 427.7 451.3 419.3 448.9L357.3 431.4L341.4 493.9C339.3 502.3 332.8 508.9 324.4 511.2C315.1 513.4 307 510.1 300.1 504.7L256 458.5L211 504.7C204.1 510.1 196 513.4 187.6 511.2C179.2 508.9 172.7 502.3 170.6 493.9L154.7 431.4L92.69 448.9C84.33 451.3 75.34 448.1 69.19 442.8C63.05 436.7 60.71 427.7 63.07 419.3L80.6 357.3L18.1 341.4C9.679 339.3 3.068 332.8 .8186 324.4C-1.431 315.1 1.034 307 7.261 300.1L53.46 256L7.261 211C1.034 204.1-1.431 196 .8186 187.6C3.068 179.2 9.679 172.7 18.1 170.6L80.6 154.7L63.07 92.69C60.71 84.33 63.05 75.34 69.19 69.19C75.34 63.05 84.33 60.71 92.69 63.07L154.7 80.6L170.6 18.1C172.7 9.679 179.2 3.068 187.6 .8185C196-1.431 204.1 1.034 211 7.261L256 53.46z"],chair:[448,512,[129681],"f6c0","M445.1 338.6l-14.77-32C425.1 295.3 413.7 288 401.2 288H46.76C34.28 288 22.94 295.3 17.7 306.6l-14.77 32c-4.563 9.906-3.766 21.47 2.109 30.66S21.09 384 31.1 384l.001 112c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16V384h256v112c0 8.836 7.164 16 16 16h31.1c8.838 0 16-7.164 16-16L416 384c10.91 0 21.08-5.562 26.95-14.75S449.6 348.5 445.1 338.6zM111.1 128c0-29.48 16.2-54.1 40-68.87L151.1 256h48l.0092-208h48L247.1 256h48l.0093-196.9C319.8 73 335.1 98.52 335.1 128l-.0094 128h48.03l-.0123-128c0-70.69-57.31-128-128-128H191.1C121.3 0 63.98 57.31 63.98 128l.0158 128h47.97L111.1 128z"],chalkboard:[576,512,["blackboard"],"f51b","M96 96h384v288h64V72C544 50 525.1 32 504 32H72C49.1 32 32 50 32 72V384h64V96zM560 416H416v-48c0-8.838-7.164-16-16-16h-160C231.2 352 224 359.2 224 368V416H16C7.164 416 0 423.2 0 432v32C0 472.8 7.164 480 16 480h544c8.836 0 16-7.164 16-16v-32C576 423.2 568.8 416 560 416z"],"chalkboard-user":[640,512,["chalkboard-teacher"],"f51c","M592 0h-384C181.5 0 160 22.25 160 49.63V96c23.42 0 45.1 6.781 63.1 17.81V64h352v288h-64V304c0-8.838-7.164-16-16-16h-96c-8.836 0-16 7.162-16 16V352H287.3c22.07 16.48 39.54 38.5 50.76 64h253.9C618.5 416 640 393.8 640 366.4V49.63C640 22.25 618.5 0 592 0zM160 320c53.02 0 96-42.98 96-96c0-53.02-42.98-96-96-96C106.1 128 64 170.1 64 224C64 277 106.1 320 160 320zM192 352H128c-70.69 0-128 57.31-128 128c0 17.67 14.33 32 32 32h256c17.67 0 32-14.33 32-32C320 409.3 262.7 352 192 352z"],"champagne-glasses":[640,512,[129346,"glass-cheers"],"f79f","M639.4 433.6c-8.374-20.37-31.75-30.12-52.12-21.62l-22.12 9.249l-38.75-101.1c47.87-34.1 64.87-100.2 34.5-152.7l-86.62-150.5c-7.999-13.87-24.1-19.75-39.1-13.62l-114.2 47.37L205.8 2.415C190.8-3.71 173.8 2.165 165.8 16.04L79.15 166.5C48.9 219 65.78 284.3 113.6 319.2l-38.75 101.9L52.78 411.9c-20.37-8.499-43.62 1.25-52.12 21.62c-1.75 4.124 .125 8.749 4.25 10.5l162.4 67.37c3.1 1.75 8.624-.125 10.37-4.249c8.374-20.37-1.25-43.87-21.62-52.37l-22.12-9.124l39.37-103.6c4.5 .4999 8.874 1.25 13.12 1.25c51.75 0 99.37-32.1 113.4-85.24l20.25-75.36l20.25 75.36c13.1 52.24 61.62 85.24 113.4 85.24c4.25 0 8.624-.7499 13.12-1.25l39.25 103.6l-22.12 9.124c-20.37 8.499-30.12 31.1-21.62 52.37c1.75 4.124 6.5 5.999 10.5 4.249l162.4-67.37C639.1 442.2 641.1 437.7 639.4 433.6zM275.9 162.1L163.8 115.6l36.5-63.37L294.8 91.4L275.9 162.1zM364.1 162.1l-18.87-70.74l94.49-39.12l36.5 63.37L364.1 162.1z"],"charging-station":[576,512,[],"f5e7","M256 0C291.3 0 320 28.65 320 64V256H336C384.6 256 424 295.4 424 344V376C424 389.3 434.7 400 448 400C461.3 400 472 389.3 472 376V252.3C439.5 242.1 416 211.8 416 176V144C416 135.2 423.2 128 432 128H448V80C448 71.16 455.2 64 464 64C472.8 64 480 71.16 480 80V128H512V80C512 71.16 519.2 64 528 64C536.8 64 544 71.16 544 80V128H560C568.8 128 576 135.2 576 144V176C576 211.8 552.5 242.1 520 252.3V376C520 415.8 487.8 448 448 448C408.2 448 376 415.8 376 376V344C376 321.9 358.1 304 336 304H320V448C337.7 448 352 462.3 352 480C352 497.7 337.7 512 320 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V64C32 28.65 60.65 0 96 0H256zM197.6 83.85L85.59 179.9C80.5 184.2 78.67 191.3 80.99 197.6C83.32 203.8 89.3 208 95.1 208H153.8L128.8 282.9C126.5 289.8 129.1 297.3 135.1 301.3C141 305.3 148.1 304.8 154.4 300.1L266.4 204.1C271.5 199.8 273.3 192.7 271 186.4C268.7 180.2 262.7 176 256 176H198.2L223.2 101.1C225.5 94.24 222.9 86.74 216.9 82.72C210.1 78.71 203 79.17 197.6 83.85V83.85z"],"chart-area":[512,512,["area-chart"],"f1fe","M64 400C64 408.8 71.16 416 80 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H80C35.82 480 0 444.2 0 400V64C0 46.33 14.33 32 32 32C49.67 32 64 46.33 64 64V400zM128 320V236C128 228.3 130.8 220.8 135.9 214.1L215.3 124.2C228.3 109.4 251.4 109.7 263.1 124.8L303.2 171.8C312.2 182.7 328.6 183.4 338.6 173.4L359.6 152.4C372.7 139.3 394.4 140.1 406.5 154.2L472.3 231C477.3 236.8 480 244.2 480 251.8V320C480 337.7 465.7 352 448 352H159.1C142.3 352 127.1 337.7 127.1 320L128 320z"],"chart-bar":[512,512,["bar-chart"],"f080","M32 32C49.67 32 64 46.33 64 64V400C64 408.8 71.16 416 80 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H80C35.82 480 0 444.2 0 400V64C0 46.33 14.33 32 32 32zM128 128C128 110.3 142.3 96 160 96H352C369.7 96 384 110.3 384 128C384 145.7 369.7 160 352 160H160C142.3 160 128 145.7 128 128zM288 192C305.7 192 320 206.3 320 224C320 241.7 305.7 256 288 256H160C142.3 256 128 241.7 128 224C128 206.3 142.3 192 160 192H288zM416 288C433.7 288 448 302.3 448 320C448 337.7 433.7 352 416 352H160C142.3 352 128 337.7 128 320C128 302.3 142.3 288 160 288H416z"],"chart-column":[512,512,[],"e0e3","M32 32C49.67 32 64 46.33 64 64V400C64 408.8 71.16 416 80 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H80C35.82 480 0 444.2 0 400V64C0 46.33 14.33 32 32 32zM160 224C177.7 224 192 238.3 192 256V320C192 337.7 177.7 352 160 352C142.3 352 128 337.7 128 320V256C128 238.3 142.3 224 160 224zM288 320C288 337.7 273.7 352 256 352C238.3 352 224 337.7 224 320V160C224 142.3 238.3 128 256 128C273.7 128 288 142.3 288 160V320zM352 192C369.7 192 384 206.3 384 224V320C384 337.7 369.7 352 352 352C334.3 352 320 337.7 320 320V224C320 206.3 334.3 192 352 192zM480 320C480 337.7 465.7 352 448 352C430.3 352 416 337.7 416 320V96C416 78.33 430.3 64 448 64C465.7 64 480 78.33 480 96V320z"],"chart-gantt":[512,512,[],"e0e4","M32 32C49.67 32 64 46.33 64 64V400C64 408.8 71.16 416 80 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H80C35.82 480 0 444.2 0 400V64C0 46.33 14.33 32 32 32zM128 128C128 110.3 142.3 96 160 96H256C273.7 96 288 110.3 288 128C288 145.7 273.7 160 256 160H160C142.3 160 128 145.7 128 128zM352 192C369.7 192 384 206.3 384 224C384 241.7 369.7 256 352 256H224C206.3 256 192 241.7 192 224C192 206.3 206.3 192 224 192H352zM448 288C465.7 288 480 302.3 480 320C480 337.7 465.7 352 448 352H384C366.3 352 352 337.7 352 320C352 302.3 366.3 288 384 288H448z"],"chart-line":[512,512,["line-chart"],"f201","M64 400C64 408.8 71.16 416 80 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H80C35.82 480 0 444.2 0 400V64C0 46.33 14.33 32 32 32C49.67 32 64 46.33 64 64V400zM342.6 278.6C330.1 291.1 309.9 291.1 297.4 278.6L240 221.3L150.6 310.6C138.1 323.1 117.9 323.1 105.4 310.6C92.88 298.1 92.88 277.9 105.4 265.4L217.4 153.4C229.9 140.9 250.1 140.9 262.6 153.4L320 210.7L425.4 105.4C437.9 92.88 458.1 92.88 470.6 105.4C483.1 117.9 483.1 138.1 470.6 150.6L342.6 278.6z"],"chart-pie":[576,512,["pie-chart"],"f200","M304 16.58C304 7.555 310.1 0 320 0C443.7 0 544 100.3 544 224C544 233 536.4 240 527.4 240H304V16.58zM32 272C32 150.7 122.1 50.34 238.1 34.25C248.2 32.99 256 40.36 256 49.61V288L412.5 444.5C419.2 451.2 418.7 462.2 411 467.7C371.8 495.6 323.8 512 272 512C139.5 512 32 404.6 32 272zM558.4 288C567.6 288 575 295.8 573.8 305C566.1 360.9 539.1 410.6 499.9 447.3C493.9 452.1 484.5 452.5 478.7 446.7L320 288H558.4z"],"chart-simple":[448,512,[],"e473","M160 80C160 53.49 181.5 32 208 32H240C266.5 32 288 53.49 288 80V432C288 458.5 266.5 480 240 480H208C181.5 480 160 458.5 160 432V80zM0 272C0 245.5 21.49 224 48 224H80C106.5 224 128 245.5 128 272V432C128 458.5 106.5 480 80 480H48C21.49 480 0 458.5 0 432V272zM400 96C426.5 96 448 117.5 448 144V432C448 458.5 426.5 480 400 480H368C341.5 480 320 458.5 320 432V144C320 117.5 341.5 96 368 96H400z"],check:[448,512,[10004,10003],"f00c","M438.6 105.4C451.1 117.9 451.1 138.1 438.6 150.6L182.6 406.6C170.1 419.1 149.9 419.1 137.4 406.6L9.372 278.6C-3.124 266.1-3.124 245.9 9.372 233.4C21.87 220.9 42.13 220.9 54.63 233.4L159.1 338.7L393.4 105.4C405.9 92.88 426.1 92.88 438.6 105.4H438.6z"],"check-double":[448,512,[],"f560","M182.6 246.6C170.1 259.1 149.9 259.1 137.4 246.6L57.37 166.6C44.88 154.1 44.88 133.9 57.37 121.4C69.87 108.9 90.13 108.9 102.6 121.4L159.1 178.7L297.4 41.37C309.9 28.88 330.1 28.88 342.6 41.37C355.1 53.87 355.1 74.13 342.6 86.63L182.6 246.6zM182.6 470.6C170.1 483.1 149.9 483.1 137.4 470.6L9.372 342.6C-3.124 330.1-3.124 309.9 9.372 297.4C21.87 284.9 42.13 284.9 54.63 297.4L159.1 402.7L393.4 169.4C405.9 156.9 426.1 156.9 438.6 169.4C451.1 181.9 451.1 202.1 438.6 214.6L182.6 470.6z"],"check-to-slot":[576,512,["vote-yea"],"f772","M480 80C480 53.49 458.5 32 432 32h-288C117.5 32 96 53.49 96 80V384h384V80zM378.9 166.8l-88 112c-4.031 5.156-10 8.438-16.53 9.062C273.6 287.1 272.7 287.1 271.1 287.1c-5.719 0-11.21-2.019-15.58-5.769l-56-48C190.3 225.6 189.2 210.4 197.8 200.4c8.656-10.06 23.81-11.19 33.84-2.594l36.97 31.69l72.53-92.28c8.188-10.41 23.31-12.22 33.69-4.062C385.3 141.3 387.1 156.4 378.9 166.8zM528 288H512v112c0 8.836-7.164 16-16 16h-416C71.16 416 64 408.8 64 400V288H48C21.49 288 0 309.5 0 336v96C0 458.5 21.49 480 48 480h480c26.51 0 48-21.49 48-48v-96C576 309.5 554.5 288 528 288z"],cheese:[512,512,[],"f7ef","M0 288v159.1C0 465.6 14.38 480 32 480h448c17.62 0 32-14.38 32-31.1V288H0zM299.9 32.01c-7.75-.25-15.25 2.25-21.12 6.1L0 255.1l512-.0118C512 136.1 417.1 38.26 299.9 32.01z"],chess:[512,512,[],"f439","M74.01 208h-10c-8.875 0-16 7.125-16 16v16c0 8.875 7.122 16 15.1 16h16c-.25 43.13-5.5 86.13-16 128h128c-10.5-41.88-15.75-84.88-16-128h15.1c8.875 0 16-7.125 16-16L208 224c0-8.875-7.122-16-15.1-16h-10l33.88-90.38C216.6 115.8 216.9 113.1 216.9 112.1C216.9 103.1 209.5 96 200.9 96H144V64h16c8.844 0 16-7.156 16-16S168.9 32 160 32h-16l.0033-16c0-8.844-7.16-16-16-16s-16 7.156-16 16V32H96.01c-8.844 0-16 7.156-16 16S87.16 64 96.01 64h16v32H55.13C46.63 96 39.07 102.8 39.07 111.9c0 1.93 .3516 3.865 1.061 5.711L74.01 208zM339.9 301.8L336.6 384h126.8l-3.25-82.25l24.5-20.75C491.9 274.9 496 266 496 256.5V198C496 194.6 493.4 192 489.1 192h-26.37c-3.375 0-6 2.625-6 6V224h-24.75V198C432.9 194.6 430.3 192 426.9 192h-53.75c-3.375 0-6 2.625-6 6V224h-24.75V198C342.4 194.6 339.8 192 336.4 192h-26.38C306.6 192 304 194.6 304 198v58.62c0 9.375 4.125 18.25 11.38 24.38L339.9 301.8zM384 304C384 295.1 391.1 288 400 288S416 295.1 416 304v32h-32V304zM247.1 459.6L224 448v-16C224 423.1 216.9 416 208 416h-160C39.13 416 32 423.1 32 432V448l-23.12 11.62C3.375 462.3 0 467.9 0 473.9V496C0 504.9 7.125 512 16 512h224c8.875 0 16-7.125 16-16v-22.12C256 467.9 252.6 462.3 247.1 459.6zM503.1 459.6L480 448v-16c0-8.875-7.125-16-16-16h-128c-8.875 0-16 7.125-16 16V448l-23.12 11.62C291.4 462.3 288 467.9 288 473.9V496c0 8.875 7.125 16 16 16h192c8.875 0 16-7.125 16-16v-22.12C512 467.9 508.6 462.3 503.1 459.6z"],"chess-bishop":[320,512,[9821],"f43a","M272 448h-224C21.49 448 0 469.5 0 496C0 504.8 7.164 512 16 512h288c8.836 0 16-7.164 16-16C320 469.5 298.5 448 272 448zM8 287.9c0 51.63 22.12 73.88 56 84.63V416h192v-43.5c33.88-10.75 56-33 56-84.63c0-30.62-10.75-67.13-26.75-102.5L185 285.6c-1.565 1.565-3.608 2.349-5.651 2.349c-2.036 0-4.071-.7787-5.63-2.339l-11.35-11.27c-1.56-1.56-2.339-3.616-2.339-5.672c0-2.063 .7839-4.128 2.349-5.693l107.9-107.9C249.5 117.3 223.8 83 199.4 62.5C213.4 59.13 224 47 224 32c0-17.62-14.38-32-32-32H128C110.4 0 96 14.38 96 32c0 15 10.62 27.12 24.62 30.5C67.75 106.8 8 214.5 8 287.9z"],"chess-board":[448,512,[],"f43c","M192 224H128v64h64V224zM384 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V96C448 60.65 419.3 32 384 32zM384 160h-64v64h64v64h-64v64h64v64h-64v-64h-64v64H192v-64H128v64H64v-64h64V288H64V224h64V160H64V96h64v64h64V96h64v64h64V96h64V160zM192 288v64h64V288H192zM256 224V160H192v64H256zM256 288h64V224h-64V288z"],"chess-king":[448,512,[9818],"f43f","M367.1 448H79.97c-26.51 0-48.01 21.49-48.01 47.1C31.96 504.8 39.13 512 47.96 512h352c8.838 0 16-7.163 16-16C416 469.5 394.5 448 367.1 448zM416.1 160h-160V112h16.01c17.6 0 31.98-14.4 31.98-32C303.1 62.4 289.6 48 272 48h-16.01V32C256 14.4 241.6 0 223.1 0C206.4 0 191.1 14.4 191.1 32.01V48H175.1c-17.6 0-32.01 14.4-32.01 32C143.1 97.6 158.4 112 175.1 112h16.01V160h-160C17.34 160 0 171.5 0 192C0 195.2 .4735 198.4 1.437 201.5L74.46 416h299.1l73.02-214.5C447.5 198.4 448 195.2 448 192C448 171.6 430.1 160 416.1 160z"],"chess-knight":[384,512,[9822],"f441","M19 272.5l40.62 18C63.78 292.3 68.25 293.3 72.72 293.3c4 0 8.001-.7543 11.78-2.289l12.75-5.125c9.125-3.625 16-11.12 18.75-20.5L125.2 234.8C127 227.9 131.5 222.2 137.9 219.1L160 208v50.38C160 276.5 149.6 293.1 133.4 301.2L76.25 329.9C49.12 343.5 32 371.1 32 401.5V416h319.9l-.0417-192c0-105.1-85.83-192-191.8-192H12C5.375 32 0 37.38 0 44c0 2.625 .625 5.25 1.75 7.625L16 80L7 89C2.5 93.5 0 99.62 0 106V243.2C0 255.9 7.5 267.4 19 272.5zM52 128C63 128 72 137 72 148S63 168 52 168S32 159 32 148S41 128 52 128zM336 448H47.1C21.49 448 0 469.5 0 495.1C0 504.8 7.163 512 16 512h352c8.837 0 16-7.163 16-16C384 469.5 362.5 448 336 448z"],"chess-pawn":[320,512,[9823],"f443","M105.1 224H80C71.12 224 64 231.1 64 240v32c0 8.875 7.125 15.1 16 15.1L96 288v5.5C96 337.5 91.88 380.1 72 416h176C228.1 380.1 224 337.5 224 293.5V288l16-.0001c8.875 0 16-7.125 16-15.1v-32C256 231.1 248.9 224 240 224h-25.12C244.3 205.6 264 173.2 264 136C264 78.5 217.5 32 159.1 32S56 78.5 56 136C56 173.2 75.74 205.6 105.1 224zM272 448H47.1C21.49 448 0 469.5 0 495.1C0 504.8 7.163 512 16 512h288c8.837 0 16-7.163 16-16C320 469.5 298.5 448 272 448z"],"chess-queen":[512,512,[9819],"f445","M256 112c30.88 0 56-25.12 56-56S286.9 0 256 0S199.1 25.12 199.1 56S225.1 112 256 112zM399.1 448H111.1c-26.51 0-48 21.49-48 47.1C63.98 504.8 71.15 512 79.98 512h352c8.837 0 16-7.163 16-16C447.1 469.5 426.5 448 399.1 448zM511.1 197.4c0-5.178-2.509-10.2-7.096-13.26L476.4 168.2c-2.684-1.789-5.602-2.62-8.497-2.62c-17.22 0-17.39 26.37-51.92 26.37c-29.35 0-47.97-25.38-47.97-50.63C367.1 134 361.1 128 354.6 128h-38.75c-6 0-11.63 4-12.88 9.875C298.2 160.1 278.7 176 255.1 176c-22.75 0-42.25-15.88-47-38.12C207.7 132 202.2 128 196.1 128h-38.75C149.1 128 143.1 134 143.1 141.4c0 18.45-13.73 50.62-47.95 50.62c-34.58 0-34.87-26.39-51.87-26.39c-2.909 0-5.805 .8334-8.432 2.645l-28.63 16C2.509 187.2 0 192.3 0 197.4C0 199.9 .5585 202.3 1.72 204.6L104.2 416h303.5l102.5-211.4C511.4 202.3 511.1 199.8 511.1 197.4z"],"chess-rook":[384,512,[9820],"f447","M368 32h-56c-8.875 0-16 7.125-16 16V96h-48V48c0-8.875-7.125-16-16-16h-80c-8.875 0-16 7.125-16 16V96H88.12V48c0-8.875-7.25-16-16-16H16C7.125 32 0 39.12 0 48V224l64 32c0 48.38-1.5 95-13.25 160h282.5C321.5 351 320 303.8 320 256l64-32V48C384 39.12 376.9 32 368 32zM224 320H160V256c0-17.62 14.38-32 32-32s32 14.38 32 32V320zM336 448H47.1C21.49 448 0 469.5 0 495.1C0 504.8 7.163 512 16 512h352c8.837 0 16-7.163 16-16C384 469.5 362.5 448 336 448z"],"chevron-down":[448,512,[],"f078","M224 416c-8.188 0-16.38-3.125-22.62-9.375l-192-192c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L224 338.8l169.4-169.4c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25l-192 192C240.4 412.9 232.2 416 224 416z"],"chevron-left":[320,512,[9001],"f053","M224 480c-8.188 0-16.38-3.125-22.62-9.375l-192-192c-12.5-12.5-12.5-32.75 0-45.25l192-192c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L77.25 256l169.4 169.4c12.5 12.5 12.5 32.75 0 45.25C240.4 476.9 232.2 480 224 480z"],"chevron-right":[320,512,[9002],"f054","M96 480c-8.188 0-16.38-3.125-22.62-9.375c-12.5-12.5-12.5-32.75 0-45.25L242.8 256L73.38 86.63c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l192 192c12.5 12.5 12.5 32.75 0 45.25l-192 192C112.4 476.9 104.2 480 96 480z"],"chevron-up":[448,512,[],"f077","M416 352c-8.188 0-16.38-3.125-22.62-9.375L224 173.3l-169.4 169.4c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l192-192c12.5-12.5 32.75-12.5 45.25 0l192 192c12.5 12.5 12.5 32.75 0 45.25C432.4 348.9 424.2 352 416 352z"],child:[320,512,[],"f1ae","M224 64C224 99.35 195.3 128 160 128C124.7 128 96 99.35 96 64C96 28.65 124.7 0 160 0C195.3 0 224 28.65 224 64zM144 384V480C144 497.7 129.7 512 112 512C94.33 512 80.01 497.7 80.01 480V287.8L59.09 321C49.67 336 29.92 340.5 14.96 331.1C.0016 321.7-4.491 301.9 4.924 286.1L44.79 223.6C69.72 184 113.2 160 160 160C206.8 160 250.3 184 275.2 223.6L315.1 286.1C324.5 301.9 320 321.7 305.1 331.1C290.1 340.5 270.3 336 260.9 321L240 287.8V480C240 497.7 225.7 512 208 512C190.3 512 176 497.7 176 480V384L144 384z"],"child-dress":[320,512,[],"e59c","M223.1 64C223.1 99.35 195.3 128 159.1 128C124.7 128 95.1 99.35 95.1 64C95.1 28.65 124.7 0 159.1 0C195.3 0 223.1 28.65 223.1 64zM70.2 400C59.28 400 51.57 389.3 55.02 378.9L86.16 285.5L57.5 323.3C46.82 337.4 26.75 340.2 12.67 329.5C-1.415 318.8-4.175 298.7 6.503 284.7L65.4 206.1C87.84 177.4 122.9 160 160 160C197.2 160 232.2 177.4 254.6 206.1L313.5 284.7C324.2 298.7 321.4 318.8 307.3 329.5C293.3 340.2 273.2 337.4 262.5 323.3L233.9 285.6L264.1 378.9C268.4 389.3 260.7 400 249.8 400H232V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V400H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V400H70.2z"],"child-reaching":[384,512,[],"e59d","M256 64C256 99.35 227.3 128 192 128C156.7 128 128 99.35 128 64C128 28.65 156.7 0 192 0C227.3 0 256 28.65 256 64zM155.7 170.2C167.3 173.1 179.6 176 192.2 176C232.1 176 269.3 155.8 291 122.4L309.2 94.54C318.8 79.73 338.6 75.54 353.5 85.18C368.3 94.82 372.5 114.6 362.8 129.5L344.7 157.3C326.4 185.4 301.2 207.3 272 221.6V480C272 497.7 257.7 512 240 512C222.3 512 208 497.7 208 480V384H176V480C176 497.7 161.7 512 144 512C126.3 512 112 497.7 112 480V221.4C83.63 207.4 58.94 186.1 40.87 158.1L21.37 129.8C11.57 115 15.54 95.18 30.25 85.37C44.95 75.57 64.82 79.54 74.62 94.25L94.12 123.5C108.5 145 129.2 160.9 152.9 169.3C153.9 169.5 154.8 169.8 155.7 170.2V170.2z"],"child-rifle":[512,512,[],"e4e0","M79.1 64C79.1 28.65 108.7 .0003 143.1 .0003C179.3 .0003 207.1 28.65 207.1 64C207.1 99.35 179.3 128 143.1 128C108.7 128 79.1 99.35 79.1 64V64zM104 512C86.33 512 72 497.7 72 480V300.5L59.09 321C49.67 336 29.91 340.5 14.96 331.1C.0006 321.7-4.492 301.9 4.923 286.1L56.6 204.9C74.17 176.9 104.9 160 137.8 160H150.2C183.2 160 213.8 176.9 231.4 204.9L283.1 286.1C292.5 301.9 288 321.7 273 331.1C258.1 340.5 238.3 336 228.9 321L216 300.5V480C216 497.7 201.7 512 184 512C166.3 512 152 497.7 152 480V352H136V480C136 497.7 121.7 512 104 512V512zM432 16V132.3C441.6 137.8 448 148.2 448 160V269.3L464 264V208C464 199.2 471.2 192 480 192H496C504.8 192 512 199.2 512 208V292.5C512 299.4 507.6 305.5 501.1 307.6L448 325.3V352H496C504.8 352 512 359.2 512 368V384C512 392.8 504.8 400 496 400H452L475 492.1C477.6 502.2 469.9 512 459.5 512H400C391.2 512 384 504.8 384 496V400H368C350.3 400 336 385.7 336 368V224C336 206.3 350.3 192 368 192V160C368 148.2 374.4 137.8 384 132.3V32C375.2 32 368 24.84 368 16C368 7.164 375.2 0 384 0H416C424.8 0 432 7.164 432 16V16z"],children:[640,512,[],"e4e1","M95.1 64C95.1 28.65 124.7 0 159.1 0C195.3 0 223.1 28.65 223.1 64C223.1 99.35 195.3 128 159.1 128C124.7 128 95.1 99.35 95.1 64zM88 480V400H70.2C59.28 400 51.57 389.3 55.02 378.9L86.16 285.5L57.5 323.3C46.82 337.4 26.75 340.2 12.67 329.5C-1.415 318.8-4.175 298.7 6.503 284.7L65.4 206.1C87.84 177.4 122.9 160 160 160C197.2 160 232.2 177.4 254.6 206.1L313.5 284.7C324.2 298.7 321.4 318.8 307.3 329.5C293.3 340.2 273.2 337.4 262.5 323.3L233.9 285.6L264.1 378.9C268.4 389.3 260.7 400 249.8 400H232V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V400H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480H88zM416 64C416 28.65 444.7 0 480 0C515.3 0 544 28.65 544 64C544 99.35 515.3 128 480 128C444.7 128 416 99.35 416 64V64zM472 384V480C472 497.7 457.7 512 440 512C422.3 512 408 497.7 408 480V300.5L395.1 321C385.7 336 365.9 340.5 350.1 331.1C336 321.7 331.5 301.9 340.9 286.1L392.6 204.9C410.2 176.9 440.9 159.1 473.8 159.1H486.2C519.2 159.1 549.8 176.9 567.4 204.9L619.1 286.1C628.5 301.9 624 321.7 609 331.1C594.1 340.5 574.3 336 564.9 321L552 300.5V480C552 497.7 537.7 512 520 512C502.3 512 488 497.7 488 480V384L472 384z"],church:[640,512,[9962],"f51d","M344 48H376C389.3 48 400 58.75 400 72C400 85.25 389.3 96 376 96H344V142.4L456.7 210C471.2 218.7 480 234.3 480 251.2V512H384V416C384 380.7 355.3 352 320 352C284.7 352 256 380.7 256 416V512H160V251.2C160 234.3 168.8 218.7 183.3 210L296 142.4V96H264C250.7 96 240 85.25 240 72C240 58.75 250.7 48 264 48H296V24C296 10.75 306.7 0 320 0C333.3 0 344 10.75 344 24V48zM24.87 330.3L128 273.6V512H48C21.49 512 0 490.5 0 464V372.4C0 354.9 9.53 338.8 24.87 330.3V330.3zM592 512H512V273.6L615.1 330.3C630.5 338.8 640 354.9 640 372.4V464C640 490.5 618.5 512 592 512V512z"],circle:[512,512,[128308,128309,128992,128993,128994,128995,128996,9898,9899,11044,61708,61915,9679],"f111","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256z"],"circle-arrow-down":[512,512,["arrow-circle-down"],"f0ab","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM382.6 302.6l-103.1 103.1C270.7 414.6 260.9 416 256 416c-4.881 0-14.65-1.391-22.65-9.398L129.4 302.6c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L224 306.8V128c0-17.69 14.33-32 32-32s32 14.31 32 32v178.8l49.38-49.38c12.5-12.5 32.75-12.5 45.25 0S395.1 290.1 382.6 302.6z"],"circle-arrow-left":[512,512,["arrow-circle-left"],"f0a8","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM384 288H205.3l49.38 49.38c12.5 12.5 12.5 32.75 0 45.25s-32.75 12.5-45.25 0L105.4 278.6C97.4 270.7 96 260.9 96 256c0-4.883 1.391-14.66 9.398-22.65l103.1-103.1c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L205.3 224H384c17.69 0 32 14.33 32 32S401.7 288 384 288z"],"circle-arrow-right":[512,512,["arrow-circle-right"],"f0a9","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM406.6 278.6l-103.1 103.1c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25L306.8 288H128C110.3 288 96 273.7 96 256s14.31-32 32-32h178.8l-49.38-49.38c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l103.1 103.1C414.6 241.3 416 251.1 416 256C416 260.9 414.6 270.7 406.6 278.6z"],"circle-arrow-up":[512,512,["arrow-circle-up"],"f0aa","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM382.6 254.6c-12.5 12.5-32.75 12.5-45.25 0L288 205.3V384c0 17.69-14.33 32-32 32s-32-14.31-32-32V205.3L174.6 254.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l103.1-103.1C241.3 97.4 251.1 96 256 96c4.881 0 14.65 1.391 22.65 9.398l103.1 103.1C395.1 221.9 395.1 242.1 382.6 254.6z"],"circle-check":[512,512,[61533,"check-circle"],"f058","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM371.8 211.8C382.7 200.9 382.7 183.1 371.8 172.2C360.9 161.3 343.1 161.3 332.2 172.2L224 280.4L179.8 236.2C168.9 225.3 151.1 225.3 140.2 236.2C129.3 247.1 129.3 264.9 140.2 275.8L204.2 339.8C215.1 350.7 232.9 350.7 243.8 339.8L371.8 211.8z"],"circle-chevron-down":[512,512,["chevron-circle-down"],"f13a","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM390.6 246.6l-112 112C272.4 364.9 264.2 368 256 368s-16.38-3.125-22.62-9.375l-112-112c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L256 290.8l89.38-89.38c12.5-12.5 32.75-12.5 45.25 0S403.1 234.1 390.6 246.6z"],"circle-chevron-left":[512,512,["chevron-circle-left"],"f137","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM310.6 345.4c12.5 12.5 12.5 32.75 0 45.25s-32.75 12.5-45.25 0l-112-112C147.1 272.4 144 264.2 144 256s3.125-16.38 9.375-22.62l112-112c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25L221.3 256L310.6 345.4z"],"circle-chevron-right":[512,512,["chevron-circle-right"],"f138","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM358.6 278.6l-112 112c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25L290.8 256L201.4 166.6c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0l112 112C364.9 239.6 368 247.8 368 256S364.9 272.4 358.6 278.6z"],"circle-chevron-up":[512,512,["chevron-circle-up"],"f139","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM390.6 310.6c-12.5 12.5-32.75 12.5-45.25 0L256 221.3L166.6 310.6c-12.5 12.5-32.75 12.5-45.25 0s-12.5-32.75 0-45.25l112-112C239.6 147.1 247.8 144 256 144s16.38 3.125 22.62 9.375l112 112C403.1 277.9 403.1 298.1 390.6 310.6z"],"circle-dollar-to-slot":[512,512,["donate"],"f4b9","M326.7 403.7C304.7 411.6 280.8 416 256 416C231.2 416 207.3 411.6 185.3 403.7C184.1 403.6 184.7 403.5 184.5 403.4C154.4 392.4 127.6 374.6 105.9 352C70.04 314.6 48 263.9 48 208C48 93.12 141.1 0 256 0C370.9 0 464 93.12 464 208C464 263.9 441.1 314.6 406.1 352C405.1 353 404.1 354.1 403.1 355.1C381.7 376.4 355.7 393.2 326.7 403.7L326.7 403.7zM235.9 111.1V118C230.3 119.2 224.1 120.9 220 123.1C205.1 129.9 192.1 142.5 188.9 160.8C187.1 171 188.1 180.9 192.3 189.8C196.5 198.6 203 204.8 209.6 209.3C221.2 217.2 236.5 221.8 248.2 225.3L250.4 225.9C264.4 230.2 273.8 233.3 279.7 237.6C282.2 239.4 283.1 240.8 283.4 241.7C283.8 242.5 284.4 244.3 283.7 248.3C283.1 251.8 281.2 254.8 275.7 257.1C269.6 259.7 259.7 261 246.9 259C240.9 258 230.2 254.4 220.7 251.2C218.5 250.4 216.3 249.7 214.3 249C203.8 245.5 192.5 251.2 189 261.7C185.5 272.2 191.2 283.5 201.7 286.1C202.9 287.4 204.4 287.9 206.1 288.5C213.1 291.2 226.4 295.4 235.9 297.6V304C235.9 315.1 244.9 324.1 255.1 324.1C267.1 324.1 276.1 315.1 276.1 304V298.5C281.4 297.5 286.6 295.1 291.4 293.9C307.2 287.2 319.8 274.2 323.1 255.2C324.9 244.8 324.1 234.8 320.1 225.7C316.2 216.7 309.9 210.1 303.2 205.3C291.1 196.4 274.9 191.6 262.8 187.9L261.1 187.7C247.8 183.4 238.2 180.4 232.1 176.2C229.5 174.4 228.7 173.2 228.5 172.7C228.3 172.3 227.7 171.1 228.3 167.7C228.7 165.7 230.2 162.4 236.5 159.6C242.1 156.7 252.9 155.1 265.1 156.1C269.5 157.7 283 160.3 286.9 161.3C297.5 164.2 308.5 157.8 311.3 147.1C314.2 136.5 307.8 125.5 297.1 122.7C292.7 121.5 282.7 119.5 276.1 118.3V112C276.1 100.9 267.1 91.9 256 91.9C244.9 91.9 235.9 100.9 235.9 112V111.1zM48 352H63.98C83.43 377.9 108 399.7 136.2 416H64V448H448V416H375.8C403.1 399.7 428.6 377.9 448 352H464C490.5 352 512 373.5 512 400V464C512 490.5 490.5 512 464 512H48C21.49 512 0 490.5 0 464V400C0 373.5 21.49 352 48 352H48z"],"circle-dot":[512,512,[128280,"dot-circle"],"f192","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 352C309 352 352 309 352 256C352 202.1 309 160 256 160C202.1 160 160 202.1 160 256C160 309 202.1 352 256 352z"],"circle-down":[512,512,[61466,"arrow-alt-circle-down"],"f358","M256 512c141.4 0 256-114.6 256-256s-114.6-256-256-256C114.6 0 0 114.6 0 256S114.6 512 256 512zM129.2 265.9C131.7 259.9 137.5 256 144 256h64V160c0-17.67 14.33-32 32-32h32c17.67 0 32 14.33 32 32v96h64c6.469 0 12.31 3.891 14.78 9.875c2.484 5.984 1.109 12.86-3.469 17.44l-112 112c-6.248 6.248-16.38 6.248-22.62 0l-112-112C128.1 278.7 126.7 271.9 129.2 265.9z"],"circle-exclamation":[512,512,["exclamation-circle"],"f06a","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM232 152C232 138.8 242.8 128 256 128s24 10.75 24 24v128c0 13.25-10.75 24-24 24S232 293.3 232 280V152zM256 400c-17.36 0-31.44-14.08-31.44-31.44c0-17.36 14.07-31.44 31.44-31.44s31.44 14.08 31.44 31.44C287.4 385.9 273.4 400 256 400z"],"circle-h":[512,512,[9405,"hospital-symbol"],"f47e","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM368 360c0 13.25-10.75 24-24 24S320 373.3 320 360v-80H192v80C192 373.3 181.3 384 168 384S144 373.3 144 360v-208C144 138.8 154.8 128 168 128S192 138.8 192 152v80h128v-80C320 138.8 330.8 128 344 128s24 10.75 24 24V360z"],"circle-half-stroke":[512,512,[9680,"adjust"],"f042","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 64V448C362 448 448 362 448 256C448 149.1 362 64 256 64z"],"circle-info":[512,512,["info-circle"],"f05a","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 128c17.67 0 32 14.33 32 32c0 17.67-14.33 32-32 32S224 177.7 224 160C224 142.3 238.3 128 256 128zM296 384h-80C202.8 384 192 373.3 192 360s10.75-24 24-24h16v-64H224c-13.25 0-24-10.75-24-24S210.8 224 224 224h32c13.25 0 24 10.75 24 24v88h16c13.25 0 24 10.75 24 24S309.3 384 296 384z"],"circle-left":[512,512,[61840,"arrow-alt-circle-left"],"f359","M0 256c0 141.4 114.6 256 256 256s256-114.6 256-256c0-141.4-114.6-256-256-256S0 114.6 0 256zM246.1 129.2C252.1 131.7 256 137.5 256 144v64h96c17.67 0 32 14.33 32 32v32c0 17.67-14.33 32-32 32h-96v64c0 6.469-3.891 12.31-9.875 14.78c-5.984 2.484-12.86 1.109-17.44-3.469l-112-112c-6.248-6.248-6.248-16.38 0-22.62l112-112C233.3 128.1 240.1 126.7 246.1 129.2z"],"circle-minus":[512,512,["minus-circle"],"f056","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM168 232C154.7 232 144 242.7 144 256C144 269.3 154.7 280 168 280H344C357.3 280 368 269.3 368 256C368 242.7 357.3 232 344 232H168z"],"circle-nodes":[512,512,[],"e4e2","M380.6 365.6C401.1 379.9 416 404.3 416 432C416 476.2 380.2 512 336 512C291.8 512 256 476.2 256 432C256 423.6 257.3 415.4 259.7 407.8L114.1 280.4C103.8 285.3 92.21 288 80 288C35.82 288 0 252.2 0 208C0 163.8 35.82 128 80 128C101.9 128 121.7 136.8 136.2 151.1L320 77.52C321.3 34.48 356.6 0 400 0C444.2 0 480 35.82 480 80C480 117.9 453.7 149.6 418.4 157.9L380.6 365.6zM156.3 232.2L301.9 359.6C306.9 357.3 312.1 355.4 317.6 354.1L355.4 146.4C351.2 143.6 347.4 140.4 343.8 136.9L159.1 210.5C159.7 218 158.5 225.3 156.3 232.2V232.2z"],"circle-notch":[512,512,[],"f1ce","M222.7 32.15C227.7 49.08 218.1 66.9 201.1 71.94C121.8 95.55 64 169.1 64 255.1C64 362 149.1 447.1 256 447.1C362 447.1 448 362 448 255.1C448 169.1 390.2 95.55 310.9 71.94C293.9 66.9 284.3 49.08 289.3 32.15C294.4 15.21 312.2 5.562 329.1 10.6C434.9 42.07 512 139.1 512 255.1C512 397.4 397.4 511.1 256 511.1C114.6 511.1 0 397.4 0 255.1C0 139.1 77.15 42.07 182.9 10.6C199.8 5.562 217.6 15.21 222.7 32.15V32.15z"],"circle-pause":[512,512,[62092,"pause-circle"],"f28b","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM224 191.1v128C224 337.7 209.7 352 192 352S160 337.7 160 320V191.1C160 174.3 174.3 160 191.1 160S224 174.3 224 191.1zM352 191.1v128C352 337.7 337.7 352 320 352S288 337.7 288 320V191.1C288 174.3 302.3 160 319.1 160S352 174.3 352 191.1z"],"circle-play":[512,512,[61469,"play-circle"],"f144","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM176 168V344C176 352.7 180.7 360.7 188.3 364.9C195.8 369.2 205.1 369 212.5 364.5L356.5 276.5C363.6 272.1 368 264.4 368 256C368 247.6 363.6 239.9 356.5 235.5L212.5 147.5C205.1 142.1 195.8 142.8 188.3 147.1C180.7 151.3 176 159.3 176 168V168z"],"circle-plus":[512,512,["plus-circle"],"f055","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 368C269.3 368 280 357.3 280 344V280H344C357.3 280 368 269.3 368 256C368 242.7 357.3 232 344 232H280V168C280 154.7 269.3 144 256 144C242.7 144 232 154.7 232 168V232H168C154.7 232 144 242.7 144 256C144 269.3 154.7 280 168 280H232V344C232 357.3 242.7 368 256 368z"],"circle-question":[512,512,[62108,"question-circle"],"f059","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 400c-18 0-32-14-32-32s13.1-32 32-32c17.1 0 32 14 32 32S273.1 400 256 400zM325.1 258L280 286V288c0 13-11 24-24 24S232 301 232 288V272c0-8 4-16 12-21l57-34C308 213 312 206 312 198C312 186 301.1 176 289.1 176h-51.1C225.1 176 216 186 216 198c0 13-11 24-24 24s-24-11-24-24C168 159 199 128 237.1 128h51.1C329 128 360 159 360 198C360 222 347 245 325.1 258z"],"circle-radiation":[512,512,[9762,"radiation-alt"],"f7ba","M226.4 208.6L184.8 141.9C179.6 133.7 168.3 132 160.7 138.2C130.8 162.3 110.1 197.4 105.1 237.4C103.9 247.2 111.2 256 121 256H200C200 236 210.6 218.6 226.4 208.6zM256 288c17.67 0 32-14.33 32-32s-14.33-32-32-32C238.3 224 224 238.3 224 256S238.3 288 256 288zM285.6 303.3C276.1 308.7 266.9 312 256 312c-10.89 0-20.98-3.252-29.58-8.65l-41.74 66.8c-5.211 8.338-1.613 19.07 7.27 23.29C211.4 402.7 233.1 408 256 408c22.97 0 44.64-5.334 64.12-14.59c8.883-4.219 12.48-14.95 7.262-23.29L285.6 303.3zM351.4 138.2c-7.604-6.145-18.86-4.518-24.04 3.77l-41.71 66.67C301.4 218.6 312 236 312 256h78.96c9.844 0 17.11-8.791 15.91-18.56C401.9 197.5 381.3 162.4 351.4 138.2zM256 16C123.4 16 16 123.4 16 256s107.4 240 240 240c132.6 0 240-107.4 240-240S388.6 16 256 16zM256 432c-97.05 0-176-78.99-176-176S158.1 80 256 80s176 78.95 176 176S353 432 256 432z"],"circle-right":[512,512,[61838,"arrow-alt-circle-right"],"f35a","M512 256c0-141.4-114.6-256-256-256S0 114.6 0 256c0 141.4 114.6 256 256 256S512 397.4 512 256zM265.9 382.8C259.9 380.3 256 374.5 256 368v-64H160c-17.67 0-32-14.33-32-32v-32c0-17.67 14.33-32 32-32h96v-64c0-6.469 3.891-12.31 9.875-14.78c5.984-2.484 12.86-1.109 17.44 3.469l112 112c6.248 6.248 6.248 16.38 0 22.62l-112 112C278.7 383.9 271.9 385.3 265.9 382.8z"],"circle-stop":[512,512,[62094,"stop-circle"],"f28d","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM352 328c0 13.2-10.8 24-24 24h-144C170.8 352 160 341.2 160 328v-144C160 170.8 170.8 160 184 160h144C341.2 160 352 170.8 352 184V328z"],"circle-up":[512,512,[61467,"arrow-alt-circle-up"],"f35b","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256c141.4 0 256-114.6 256-256S397.4 0 256 0zM382.8 246.1C380.3 252.1 374.5 256 368 256h-64v96c0 17.67-14.33 32-32 32h-32c-17.67 0-32-14.33-32-32V256h-64C137.5 256 131.7 252.1 129.2 246.1C126.7 240.1 128.1 233.3 132.7 228.7l112-112c6.248-6.248 16.38-6.248 22.62 0l112 112C383.9 233.3 385.3 240.1 382.8 246.1z"],"circle-user":[512,512,[62142,"user-circle"],"f2bd","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 128c39.77 0 72 32.24 72 72S295.8 272 256 272c-39.76 0-72-32.24-72-72S216.2 128 256 128zM256 448c-52.93 0-100.9-21.53-135.7-56.29C136.5 349.9 176.5 320 224 320h64c47.54 0 87.54 29.88 103.7 71.71C356.9 426.5 308.9 448 256 448z"],"circle-xmark":[512,512,[61532,"times-circle","xmark-circle"],"f057","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM175 208.1L222.1 255.1L175 303C165.7 312.4 165.7 327.6 175 336.1C184.4 346.3 199.6 346.3 208.1 336.1L255.1 289.9L303 336.1C312.4 346.3 327.6 346.3 336.1 336.1C346.3 327.6 346.3 312.4 336.1 303L289.9 255.1L336.1 208.1C346.3 199.6 346.3 184.4 336.1 175C327.6 165.7 312.4 165.7 303 175L255.1 222.1L208.1 175C199.6 165.7 184.4 165.7 175 175C165.7 184.4 165.7 199.6 175 208.1V208.1z"],city:[640,512,[127961],"f64f","M480 192H592C618.5 192 640 213.5 640 240V464C640 490.5 618.5 512 592 512H48C21.49 512 0 490.5 0 464V144C0 117.5 21.49 96 48 96H64V24C64 10.75 74.75 0 88 0C101.3 0 112 10.75 112 24V96H176V24C176 10.75 186.7 0 200 0C213.3 0 224 10.75 224 24V96H288V48C288 21.49 309.5 0 336 0H432C458.5 0 480 21.49 480 48V192zM576 368C576 359.2 568.8 352 560 352H528C519.2 352 512 359.2 512 368V400C512 408.8 519.2 416 528 416H560C568.8 416 576 408.8 576 400V368zM240 416C248.8 416 256 408.8 256 400V368C256 359.2 248.8 352 240 352H208C199.2 352 192 359.2 192 368V400C192 408.8 199.2 416 208 416H240zM128 368C128 359.2 120.8 352 112 352H80C71.16 352 64 359.2 64 368V400C64 408.8 71.16 416 80 416H112C120.8 416 128 408.8 128 400V368zM528 256C519.2 256 512 263.2 512 272V304C512 312.8 519.2 320 528 320H560C568.8 320 576 312.8 576 304V272C576 263.2 568.8 256 560 256H528zM256 176C256 167.2 248.8 160 240 160H208C199.2 160 192 167.2 192 176V208C192 216.8 199.2 224 208 224H240C248.8 224 256 216.8 256 208V176zM80 160C71.16 160 64 167.2 64 176V208C64 216.8 71.16 224 80 224H112C120.8 224 128 216.8 128 208V176C128 167.2 120.8 160 112 160H80zM256 272C256 263.2 248.8 256 240 256H208C199.2 256 192 263.2 192 272V304C192 312.8 199.2 320 208 320H240C248.8 320 256 312.8 256 304V272zM112 320C120.8 320 128 312.8 128 304V272C128 263.2 120.8 256 112 256H80C71.16 256 64 263.2 64 272V304C64 312.8 71.16 320 80 320H112zM416 272C416 263.2 408.8 256 400 256H368C359.2 256 352 263.2 352 272V304C352 312.8 359.2 320 368 320H400C408.8 320 416 312.8 416 304V272zM368 64C359.2 64 352 71.16 352 80V112C352 120.8 359.2 128 368 128H400C408.8 128 416 120.8 416 112V80C416 71.16 408.8 64 400 64H368zM416 176C416 167.2 408.8 160 400 160H368C359.2 160 352 167.2 352 176V208C352 216.8 359.2 224 368 224H400C408.8 224 416 216.8 416 208V176z"],clapperboard:[512,512,[],"e131","M326.1 160l127.4-127.4C451.7 32.39 449.9 32 448 32h-86.06l-128 128H326.1zM166.1 160l128-128H201.9l-128 128H166.1zM497.7 56.19L393.9 160H512V96C512 80.87 506.5 67.15 497.7 56.19zM134.1 32H64C28.65 32 0 60.65 0 96v64h6.062L134.1 32zM0 416c0 35.35 28.65 64 64 64h384c35.35 0 64-28.65 64-64V192H0V416z"],clipboard:[384,512,[128203],"f328","M336 64h-53.88C268.9 26.8 233.7 0 192 0S115.1 26.8 101.9 64H48C21.5 64 0 85.48 0 112v352C0 490.5 21.5 512 48 512h288c26.5 0 48-21.48 48-48v-352C384 85.48 362.5 64 336 64zM192 64c17.67 0 32 14.33 32 32c0 17.67-14.33 32-32 32S160 113.7 160 96C160 78.33 174.3 64 192 64zM272 224h-160C103.2 224 96 216.8 96 208C96 199.2 103.2 192 112 192h160C280.8 192 288 199.2 288 208S280.8 224 272 224z"],"clipboard-check":[384,512,[],"f46c","M336 64h-53.88C268.9 26.8 233.7 0 192 0S115.1 26.8 101.9 64H48C21.5 64 0 85.48 0 112v352C0 490.5 21.5 512 48 512h288c26.5 0 48-21.48 48-48v-352C384 85.48 362.5 64 336 64zM192 64c17.67 0 32 14.33 32 32s-14.33 32-32 32S160 113.7 160 96S174.3 64 192 64zM282.9 262.8l-88 112c-4.047 5.156-10.02 8.438-16.53 9.062C177.6 383.1 176.8 384 176 384c-5.703 0-11.25-2.031-15.62-5.781l-56-48c-10.06-8.625-11.22-23.78-2.594-33.84c8.609-10.06 23.77-11.22 33.84-2.594l36.98 31.69l72.52-92.28c8.188-10.44 23.3-12.22 33.7-4.062C289.3 237.3 291.1 252.4 282.9 262.8z"],"clipboard-list":[384,512,[],"f46d","M336 64h-53.88C268.9 26.8 233.7 0 192 0S115.1 26.8 101.9 64H48C21.5 64 0 85.48 0 112v352C0 490.5 21.5 512 48 512h288c26.5 0 48-21.48 48-48v-352C384 85.48 362.5 64 336 64zM96 392c-13.25 0-24-10.75-24-24S82.75 344 96 344s24 10.75 24 24S109.3 392 96 392zM96 296c-13.25 0-24-10.75-24-24S82.75 248 96 248S120 258.8 120 272S109.3 296 96 296zM192 64c17.67 0 32 14.33 32 32c0 17.67-14.33 32-32 32S160 113.7 160 96C160 78.33 174.3 64 192 64zM304 384h-128C167.2 384 160 376.8 160 368C160 359.2 167.2 352 176 352h128c8.801 0 16 7.199 16 16C320 376.8 312.8 384 304 384zM304 288h-128C167.2 288 160 280.8 160 272C160 263.2 167.2 256 176 256h128C312.8 256 320 263.2 320 272C320 280.8 312.8 288 304 288z"],"clipboard-question":[384,512,[],"e4e3","M282.5 64H320C355.3 64 384 92.65 384 128V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V128C0 92.65 28.65 64 64 64H101.5C114.6 26.71 150.2 0 192 0C233.8 0 269.4 26.71 282.5 64zM192 128C209.7 128 224 113.7 224 96C224 78.33 209.7 64 192 64C174.3 64 160 78.33 160 96C160 113.7 174.3 128 192 128zM105.4 230.5C100.9 243 107.5 256.7 119.1 261.2C132.5 265.6 146.2 259.1 150.6 246.6L151.1 245.3C152.2 242.1 155.2 240 158.6 240H216.9C225.2 240 232 246.8 232 255.1C232 260.6 229.1 265.6 224.4 268.3L180.1 293.7C172.6 298 168 305.9 168 314.5V328C168 341.3 178.7 352 192 352C205.1 352 215.8 341.5 215.1 328.4L248.3 309.9C267.9 298.7 280 277.8 280 255.1C280 220.3 251.7 192 216.9 192H158.6C134.9 192 113.8 206.9 105.8 229.3L105.4 230.5zM192 384C174.3 384 160 398.3 160 416C160 433.7 174.3 448 192 448C209.7 448 224 433.7 224 416C224 398.3 209.7 384 192 384z"],"clipboard-user":[384,512,[],"f7f3","M336 64h-53.88C268.9 26.8 233.7 0 192 0S115.1 26.8 101.9 64H48C21.5 64 0 85.48 0 112v352C0 490.5 21.5 512 48 512h288c26.5 0 48-21.48 48-48v-352C384 85.48 362.5 64 336 64zM192 64c17.67 0 32 14.33 32 32c0 17.67-14.33 32-32 32S160 113.7 160 96C160 78.33 174.3 64 192 64zM192 192c35.35 0 64 28.65 64 64s-28.65 64-64 64S128 291.3 128 256S156.7 192 192 192zM288 448H96c-8.836 0-16-7.164-16-16C80 387.8 115.8 352 160 352h64c44.18 0 80 35.82 80 80C304 440.8 296.8 448 288 448z"],clock:[512,512,[128339,"clock-four"],"f017","M256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512zM232 256C232 264 236 271.5 242.7 275.1L338.7 339.1C349.7 347.3 364.6 344.3 371.1 333.3C379.3 322.3 376.3 307.4 365.3 300L280 243.2V120C280 106.7 269.3 96 255.1 96C242.7 96 231.1 106.7 231.1 120L232 256z"],"clock-rotate-left":[512,512,["history"],"f1da","M256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C201.7 512 151.2 495 109.7 466.1C95.2 455.1 91.64 436 101.8 421.5C111.9 407 131.8 403.5 146.3 413.6C177.4 435.3 215.2 448 256 448C362 448 448 362 448 256C448 149.1 362 64 256 64C202.1 64 155 85.46 120.2 120.2L151 151C166.1 166.1 155.4 192 134.1 192H24C10.75 192 0 181.3 0 168V57.94C0 36.56 25.85 25.85 40.97 40.97L74.98 74.98C121.3 28.69 185.3 0 255.1 0L256 0zM256 128C269.3 128 280 138.7 280 152V246.1L344.1 311C354.3 320.4 354.3 335.6 344.1 344.1C335.6 354.3 320.4 354.3 311 344.1L239 272.1C234.5 268.5 232 262.4 232 256V152C232 138.7 242.7 128 256 128V128z"],clone:[512,512,[],"f24d","M0 224C0 188.7 28.65 160 64 160H128V288C128 341 170.1 384 224 384H352V448C352 483.3 323.3 512 288 512H64C28.65 512 0 483.3 0 448V224zM224 352C188.7 352 160 323.3 160 288V64C160 28.65 188.7 0 224 0H448C483.3 0 512 28.65 512 64V288C512 323.3 483.3 352 448 352H224z"],"closed-captioning":[576,512,[],"f20a","M512 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V96C576 60.65 547.3 32 512 32zM168.6 289.9c18.69 18.72 49.19 18.72 67.87 0c9.375-9.375 24.56-9.375 33.94 0s9.375 24.56 0 33.94c-18.72 18.72-43.28 28.08-67.87 28.08s-49.16-9.359-67.87-28.08C116.5 305.8 106.5 281.6 106.5 256s9.1-49.75 28.12-67.88c37.44-37.44 98.31-37.44 135.7 0c9.375 9.375 9.375 24.56 0 33.94s-24.56 9.375-33.94 0c-18.69-18.72-49.19-18.72-67.87 0C159.5 231.1 154.5 243.2 154.5 256S159.5 280.9 168.6 289.9zM360.6 289.9c18.69 18.72 49.19 18.72 67.87 0c9.375-9.375 24.56-9.375 33.94 0s9.375 24.56 0 33.94c-18.72 18.72-43.28 28.08-67.87 28.08s-49.16-9.359-67.87-28.08C308.5 305.8 298.5 281.6 298.5 256s9.1-49.75 28.12-67.88c37.44-37.44 98.31-37.44 135.7 0c9.375 9.375 9.375 24.56 0 33.94s-24.56 9.375-33.94 0c-18.69-18.72-49.19-18.72-67.87 0C351.5 231.1 346.5 243.2 346.5 256S351.5 280.9 360.6 289.9z"],cloud:[640,512,[9729],"f0c2","M96.2 200.1C96.07 197.4 96 194.7 96 192C96 103.6 167.6 32 256 32C315.3 32 367 64.25 394.7 112.2C409.9 101.1 428.3 96 448 96C501 96 544 138.1 544 192C544 204.2 541.7 215.8 537.6 226.6C596 238.4 640 290.1 640 352C640 422.7 582.7 480 512 480H144C64.47 480 0 415.5 0 336C0 273.2 40.17 219.8 96.2 200.1z"],"cloud-arrow-down":[640,512,[62337,"cloud-download","cloud-download-alt"],"f0ed","M144 480C64.47 480 0 415.5 0 336C0 273.2 40.17 219.8 96.2 200.1C96.07 197.4 96 194.7 96 192C96 103.6 167.6 32 256 32C315.3 32 367 64.25 394.7 112.2C409.9 101.1 428.3 96 448 96C501 96 544 138.1 544 192C544 204.2 541.7 215.8 537.6 226.6C596 238.4 640 290.1 640 352C640 422.7 582.7 480 512 480H144zM303 392.1C312.4 402.3 327.6 402.3 336.1 392.1L416.1 312.1C426.3 303.6 426.3 288.4 416.1 279C407.6 269.7 392.4 269.7 383 279L344 318.1V184C344 170.7 333.3 160 320 160C306.7 160 296 170.7 296 184V318.1L256.1 279C247.6 269.7 232.4 269.7 223 279C213.7 288.4 213.7 303.6 223 312.1L303 392.1z"],"cloud-arrow-up":[640,512,[62338,"cloud-upload","cloud-upload-alt"],"f0ee","M144 480C64.47 480 0 415.5 0 336C0 273.2 40.17 219.8 96.2 200.1C96.07 197.4 96 194.7 96 192C96 103.6 167.6 32 256 32C315.3 32 367 64.25 394.7 112.2C409.9 101.1 428.3 96 448 96C501 96 544 138.1 544 192C544 204.2 541.7 215.8 537.6 226.6C596 238.4 640 290.1 640 352C640 422.7 582.7 480 512 480H144zM223 263C213.7 272.4 213.7 287.6 223 296.1C232.4 306.3 247.6 306.3 256.1 296.1L296 257.9V392C296 405.3 306.7 416 320 416C333.3 416 344 405.3 344 392V257.9L383 296.1C392.4 306.3 407.6 306.3 416.1 296.1C426.3 287.6 426.3 272.4 416.1 263L336.1 183C327.6 173.7 312.4 173.7 303 183L223 263z"],"cloud-bolt":[512,512,[127785,"thunderstorm"],"f76c","M352 351.1h-71.25l47.44-105.4c3.062-6.781 1.031-14.81-4.906-19.31c-5.969-4.469-14.22-4.312-19.94 .4687l-153.6 128c-5.156 4.312-7.094 11.41-4.781 17.72c2.281 6.344 8.281 10.56 15.03 10.56h71.25l-47.44 105.4c-3.062 6.781-1.031 14.81 4.906 19.31C191.6 510.9 194.1 512 198.4 512c3.656 0 7.281-1.25 10.25-3.719l153.6-128c5.156-4.312 7.094-11.41 4.781-17.72C364.8 356.2 358.8 351.1 352 351.1zM416 128c-.625 0-1.125 .25-1.625 .25C415.5 123 416 117.6 416 112C416 67.75 380.3 32 336 32c-24.62 0-46.25 11.25-61 28.75C256.4 24.75 219.3 0 176 0C114.1 0 64 50.13 64 112c0 7.25 .75 14.25 2.125 21.25C27.75 145.8 0 181.5 0 224c0 53 43 96 96 96h46.63l140.2-116.8c8.605-7.195 19.53-11.16 30.76-11.16c10.34 0 20.6 3.416 29.03 9.734c17.96 13.61 24.02 37.45 14.76 57.95L330.2 320H416c53 0 96-43 96-96S469 128 416 128z"],"cloud-meatball":[576,512,[],"f73b","M80 352C53.5 352 32 373.5 32 400S53.5 448 80 448S128 426.5 128 400S106.5 352 80 352zM496 352c-26.5 0-48 21.5-48 48s21.5 48 48 48s48-21.5 48-48S522.5 352 496 352zM377 363.1c4.625-14.5 1.625-30.88-9.75-42.37c-11.5-11.5-27.87-14.38-42.37-9.875c-7-13.5-20.63-23-36.88-23s-29.88 9.5-36.88 23C236.6 306.2 220.2 309.2 208.8 320.8c-11.5 11.5-14.38 27.87-9.875 42.37c-13.5 7-23 20.63-23 36.88s9.5 29.88 23 36.88c-4.625 14.5-1.625 30.88 9.875 42.37c8.25 8.125 19 12.25 29.75 12.25c4.25 0 8.5-1.125 12.62-2.5C258.1 502.5 271.8 512 288 512s29.88-9.5 36.88-23c4.125 1.25 8.375 2.5 12.62 2.5c10.75 0 21.5-4.125 29.75-12.25c11.5-11.5 14.38-27.87 9.75-42.37C390.5 429.9 400 416.2 400 400S390.5 370.1 377 363.1zM544 224c0-53-43-96-96-96c-.625 0-1.125 .25-1.625 .25C447.5 123 448 117.6 448 112C448 67.75 412.2 32 368 32c-24.62 0-46.25 11.25-61 28.75C288.4 24.75 251.2 0 208 0C146.1 0 96 50.12 96 112c0 7.25 .75 14.25 2.125 21.25C59.75 145.8 32 181.5 32 224c0 53 43 96 96 96h43.38C175 312 179.8 304.6 186.2 298.2C199.8 284.8 217.8 277.1 237 276.9C250.5 263.8 268.8 256 288 256s37.5 7.75 51 20.88c19.25 .25 37.25 7.875 50.75 21.37C396.2 304.6 401.1 312 404.6 320H448C501 320 544 277 544 224z"],"cloud-moon":[576,512,[],"f6c3","M342.7 352.7c5.75-9.625 9.25-20.75 9.25-32.75c0-35.25-28.75-64-63.1-64c-17.25 0-32.75 6.875-44.25 17.87C227.4 244.2 196.2 223.1 159.1 223.1c-53 0-96 43.06-96 96.06c0 2 .5029 3.687 .6279 5.687c-37.5 13-64.62 48.38-64.62 90.25C-.0048 468.1 42.99 512 95.99 512h239.1c44.25 0 79.1-35.75 79.1-80C415.1 390.1 383.7 356.2 342.7 352.7zM565.2 298.4c-93 17.75-178.5-53.62-178.5-147.6c0-54.25 28.1-104 76.12-130.9c7.375-4.125 5.375-15.12-2.75-16.63C448.4 1.125 436.7 0 424.1 0c-105.9 0-191.9 85.88-191.9 192c0 8.5 .625 16.75 1.75 25c5.875 4.25 11.62 8.875 16.75 14.25C262.1 226.5 275.2 224 287.1 224c52.88 0 95.1 43.13 95.1 96c0 3.625-.25 7.25-.625 10.75c23.62 10.75 42.37 29.5 53.5 52.5c54.38-3.375 103.7-29.25 137.1-70.37C579.2 306.4 573.5 296.8 565.2 298.4z"],"cloud-moon-rain":[576,512,[],"f73c","M350.5 225.5c-6.876-37.25-39.25-65.5-78.51-65.5c-12.25 0-23.88 2.1-34.25 7.1C220.3 143.9 192.1 128 160 128c-53.01 0-96.01 42.1-96.01 95.1c0 .5 .25 1.125 .25 1.625C27.63 232.9 0 265.3 0 304c0 44.25 35.75 79.1 80.01 79.1h256c44.25 0 80.01-35.75 80.01-79.1C416 264.8 387.8 232.3 350.5 225.5zM567.9 223.8C497.6 237.1 432.9 183.5 432.9 113c0-40.63 21.88-78 57.5-98.13c5.501-3.125 4.077-11.37-2.173-12.5C479.6 .7538 470.8 0 461.8 0c-77.88 0-141.1 61.25-144.4 137.9c26.75 11.88 48.26 33.88 58.88 61.75c37.13 14.25 64.01 47.38 70.26 86.75c5.126 .5 10.05 1.522 15.3 1.522c44.63 0 85.46-20.15 112.5-53.27C578.6 229.8 574.2 222.6 567.9 223.8zM340.1 426.7l-32 48c-7.345 11.03-4.376 25.94 6.657 33.28C318.8 510.7 323.4 512 327.1 512c7.751 0 15.38-3.75 20-10.69l32-48c7.345-11.03 4.376-25.94-6.657-33.28C362.3 412.7 347.4 415.7 340.1 426.7zM244 426.7l-32 48c-7.345 11.03-4.376 25.94 6.657 33.28C222.8 510.7 227.4 512 231.1 512c7.751 0 15.38-3.75 20-10.69l32-48c7.345-11.03 4.376-25.94-6.657-33.28C266.3 412.7 251.4 415.7 244 426.7zM148 426.7l-32 48c-7.345 11.03-4.376 25.94 6.657 33.28C126.8 510.7 131.4 512 135.1 512c7.751 0 15.38-3.75 20-10.69l32-48c7.345-11.03 4.376-25.94-6.657-33.28C170.3 412.7 155.4 415.7 148 426.7zM52.03 426.7l-32 48c-7.345 11.03-4.376 25.94 6.657 33.28C30.78 510.7 35.41 512 39.97 512c7.751 0 15.38-3.75 20-10.69l32-48c7.345-11.03 4.376-25.94-6.657-33.28C74.25 412.7 59.41 415.7 52.03 426.7z"],"cloud-rain":[512,512,[127783,9926],"f73d","M416 128c-.625 0-1.125 .25-1.625 .25C415.5 123 416 117.6 416 112C416 67.75 380.3 32 336 32c-24.62 0-46.25 11.25-61 28.75C256.4 24.75 219.3 0 176 0C114.1 0 64 50.13 64 112c0 7.25 .75 14.25 2.125 21.25C27.75 145.8 0 181.5 0 224c0 53 43 96 96 96h320c53 0 96-43 96-96S469 128 416 128zM368 464c0 26.51 21.49 48 48 48s48-21.49 48-48s-48.01-95.1-48.01-95.1S368 437.5 368 464zM48 464C48 490.5 69.49 512 96 512s48-21.49 48-48s-48.01-95.1-48.01-95.1S48 437.5 48 464zM208 464c0 26.51 21.49 48 48 48s48-21.49 48-48s-48.01-95.1-48.01-95.1S208 437.5 208 464z"],"cloud-showers-heavy":[512,512,[],"f740","M416 128c-.625 0-1.125 .25-1.625 .25C415.5 123 416 117.6 416 112c0-44.25-35.75-80-79.1-80c-24.62 0-46.25 11.25-60.1 28.75C256.4 24.75 219.3 0 176 0C114.3 0 64 50.13 64 112c0 7.25 .7512 14.25 2.126 21.25C27.76 145.8 .0054 181.5 .0054 224c0 53 42.1 96 95.1 96h319.1C469 320 512 277 512 224S469 128 416 128zM198.8 353.9c-12.17-5.219-26.3 .4062-31.52 12.59l-47.1 112c-5.219 12.19 .4219 26.31 12.61 31.53C134.1 511.4 138.2 512 141.3 512c9.312 0 18.17-5.438 22.08-14.53l47.1-112C216.6 373.3 210.1 359.2 198.8 353.9zM81.46 353.9c-12.19-5.219-26.3 .4062-31.52 12.59l-47.1 112C-3.276 490.7 2.365 504.8 14.55 510.1C17.63 511.4 20.83 512 23.99 512c9.312 0 18.17-5.438 22.08-14.53l47.1-112C99.29 373.3 93.64 359.2 81.46 353.9zM316.1 353.9c-12.19-5.219-26.3 .4062-31.52 12.59l-47.1 112c-5.219 12.19 .4219 26.31 12.61 31.53C252.3 511.4 255.5 512 258.7 512c9.312 0 18.17-5.438 22.08-14.53l47.1-112C333.1 373.3 328.3 359.2 316.1 353.9zM433.5 353.9c-12.17-5.219-26.28 .4062-31.52 12.59l-47.1 112c-5.219 12.19 .4219 26.31 12.61 31.53C369.6 511.4 372.8 512 375.1 512c9.312 0 18.17-5.438 22.08-14.53l47.1-112C451.3 373.3 445.6 359.2 433.5 353.9z"],"cloud-showers-water":[576,512,[],"e4e4","M223.1 0C262.6 0 295.9 22.82 311.2 55.7C325.7 41.07 345.8 32 368 32C406.7 32 438.1 59.48 446.4 96H448C483.3 96 512 124.7 512 160C512 195.3 483.3 224 448 224H127.1C92.65 224 63.1 195.3 63.1 160C63.1 124.7 92.65 96 127.1 96C127.1 42.98 170.1 0 223.1 0zM92.58 372.3C85.76 383.7 71.02 387.4 59.65 380.6C48.29 373.8 44.6 359 51.42 347.7L99.42 267.7C106.2 256.3 120.1 252.6 132.3 259.4C143.7 266.2 147.4 280.1 140.6 292.3L92.58 372.3zM468.3 259.4C479.7 266.2 483.4 280.1 476.6 292.3L428.6 372.3C421.8 383.7 407 387.4 395.7 380.6C384.3 373.8 380.6 359 387.4 347.7L435.4 267.7C442.2 256.3 456.1 252.6 468.3 259.4V259.4zM204.6 372.3C197.8 383.7 183 387.4 171.7 380.6C160.3 373.8 156.6 359 163.4 347.7L211.4 267.7C218.2 256.3 232.1 252.6 244.3 259.4C255.7 266.2 259.4 280.1 252.6 292.3L204.6 372.3zM356.3 259.4C367.7 266.2 371.4 280.1 364.6 292.3L316.6 372.3C309.8 383.7 295 387.4 283.7 380.6C272.3 373.8 268.6 359 275.4 347.7L323.4 267.7C330.2 256.3 344.1 252.6 356.3 259.4V259.4zM384 448C410.9 448 439.4 437.2 461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448H384z"],"cloud-sun":[640,512,[9925],"f6c4","M96 208c0-61.86 50.14-111.1 111.1-111.1c52.65 0 96.5 36.45 108.5 85.42C334.7 173.1 354.7 168 375.1 168c4.607 0 9.152 .3809 13.68 .8203l24.13-34.76c5.145-7.414 .8965-17.67-7.984-19.27L317.2 98.78L301.2 10.21C299.6 1.325 289.4-2.919 281.9 2.226L208 53.54L134.1 2.225C126.6-2.92 116.4 1.326 114.8 10.21L98.78 98.78L10.21 114.8C1.326 116.4-2.922 126.7 2.223 134.1l51.3 73.94L2.224 281.9c-5.145 7.414-.8975 17.67 7.983 19.27L98.78 317.2l16.01 88.58c1.604 8.881 11.86 13.13 19.27 7.982l10.71-7.432c2.725-35.15 19.85-66.51 45.83-88.1C137.1 309.8 96 263.9 96 208zM128 208c0 44.18 35.82 80 80 80c9.729 0 18.93-1.996 27.56-5.176c7.002-33.65 25.53-62.85 51.57-83.44C282.8 159.3 249.2 128 208 128C163.8 128 128 163.8 128 208zM575.2 325.6c.125-2 .7453-3.744 .7453-5.619c0-35.38-28.75-64-63.1-64c-12.62 0-24.25 3.749-34.13 9.999c-17.62-38.88-56.5-65.1-101.9-65.1c-61.75 0-112 50.12-112 111.1c0 3 .7522 5.743 .8772 8.618c-49.63 3.75-88.88 44.74-88.88 95.37C175.1 469 218.1 512 271.1 512h272c53 0 96-42.99 96-95.99C639.1 373.9 612.7 338.6 575.2 325.6z"],"cloud-sun-rain":[640,512,[127782],"f743","M255.7 139.1C244.8 125.5 227.6 116 208 116c-33.14 0-60 26.86-60 59.1c0 25.56 16.06 47.24 38.58 55.88C197.2 219.3 210.5 208.9 225.9 201.1C229.1 178.5 240.6 157.3 255.7 139.1zM120 175.1c0-48.6 39.4-87.1 88-87.1c27.8 0 52.29 13.14 68.42 33.27c21.24-15.67 47.22-25.3 75.58-25.3c.0098 0-.0098 0 0 0L300.4 83.58L286.9 8.637C285.9 3.346 281.3 .0003 276.5 .0003c-2.027 0-4.096 .5928-5.955 1.881l-62.57 43.42L145.4 1.882C143.6 .5925 141.5-.0003 139.5-.0003c-4.818 0-9.399 3.346-10.35 8.636l-13.54 74.95L40.64 97.13c-5.289 .9556-8.637 5.538-8.637 10.36c0 2.026 .5921 4.094 1.881 5.951l43.41 62.57L33.88 238.6C32.59 240.4 32 242.5 32 244.5c0 4.817 3.347 9.398 8.636 10.35l74.95 13.54l13.54 74.95c.9555 5.289 5.537 8.636 10.35 8.636c2.027 0 4.096-.5927 5.954-1.882l19.47-13.51c-3.16-10.34-4.934-21.28-4.934-32.64c0-17.17 4.031-33.57 11.14-48.32C141 241.7 120 211.4 120 175.1zM542.5 225.5c-6.875-37.25-39.25-65.5-78.51-65.5c-12.25 0-23.88 3-34.25 8c-17.5-24.13-45.63-40-77.76-40c-53 0-96.01 43-96.01 96c0 .5 .25 1.125 .25 1.625C219.6 232.1 191.1 265.2 191.1 303.1c0 44.25 35.75 80 80.01 80h256C572.2 383.1 608 348.2 608 303.1C608 264.7 579.7 232.2 542.5 225.5zM552 415.1c-7.753 0-15.35 3.752-19.97 10.69l-32 48c-2.731 4.093-4.037 8.719-4.037 13.29C496 501.4 506.9 512 520 512c7.75 0 15.36-3.75 19.98-10.69l32-48c2.731-4.093 4.037-8.719 4.037-13.29C576 426.6 565.1 415.1 552 415.1zM456 415.1c-7.751 0-15.34 3.752-19.98 10.69l-32 48c-2.731 4.093-4.037 8.719-4.037 13.29C400 501.4 410.9 512 423.1 512c7.75 0 15.36-3.75 19.98-10.69l32-48c2.731-4.093 4.037-8.719 4.037-13.29C480 426.6 469.1 415.1 456 415.1zM360 415.1c-7.753 0-15.34 3.752-19.97 10.69l-32 48c-2.731 4.093-4.037 8.719-4.037 13.29C304 501.4 314.9 512 327.1 512c7.75 0 15.36-3.75 19.99-10.69l32-48c2.731-4.093 4.037-8.719 4.037-13.29C384 426.6 373.1 415.1 360 415.1zM264 415.1c-7.756 0-15.35 3.752-19.97 10.69l-32 48c-2.731 4.093-4.037 8.719-4.037 13.29C208 501.4 218.9 512 231.1 512c7.75 0 15.36-3.75 19.98-10.69l32-48c2.731-4.093 4.037-8.719 4.037-13.29C288 426.6 277.1 415.1 264 415.1z"],clover:[448,512,[],"e139","M216.6 49.94L217.8 51.18C221.2 54.6 226.8 54.6 230.2 51.18L231.4 49.94C242.9 38.45 258.5 32 274.7 32C308.6 32 336 59.42 336 93.25V98.12C336 110.1 332.7 121.9 326.6 132.1L307.8 163.4C306.7 165.2 306.7 166.5 306.8 167.6C307 168.8 307.7 170.1 308.8 171.2C309.9 172.3 311.2 172.1 312.4 173.2C313.5 173.3 314.8 173.2 316.6 172.2L347.9 153.4C358.1 147.3 369.9 144 381.9 144H386.7C420.6 144 448 171.4 448 205.3C448 221.5 441.5 237.1 430.1 248.6L428.8 249.8C425.4 253.2 425.4 258.8 428.8 262.2L430.1 263.4C441.5 274.9 448 290.5 448 306.7C448 340.6 420.6 368 386.7 368H381.9C369.9 368 358.1 364.7 347.9 358.6L316.6 339.8C314.8 338.7 313.5 338.7 312.4 338.8C311.2 339 309.9 339.7 308.8 340.8C307.7 341.9 307 343.2 306.8 344.4C306.7 345.5 306.7 346.8 307.8 348.6L326.6 379.9C332.7 390.1 336 401.9 336 413.9V418.7C336 452.6 308.6 480 274.7 480C258.5 480 242.9 473.5 231.4 462.1L230.2 460.8C226.8 457.4 221.2 457.4 217.8 460.8L216.6 462.1C205.1 473.5 189.5 480 173.3 480C139.4 480 112 452.6 112 418.7V413.9C112 401.9 115.3 390.1 121.4 379.9L140.2 348.6C141.2 346.8 141.3 345.5 141.2 344.4C140.1 343.2 140.3 341.9 139.2 340.8C138.1 339.7 136.8 339 135.6 338.8C134.5 338.7 133.2 338.7 131.4 339.8L100.1 358.6C89.86 364.7 78.1 368 66.12 368H61.25C27.42 368 0 340.6 0 306.7C0 290.5 6.454 274.9 17.94 263.4L19.18 262.2C22.6 258.8 22.6 253.2 19.18 249.8L17.94 248.6C6.454 237.1 0 221.5 0 205.3C0 171.4 27.42 144 61.25 144H66.12C78.1 144 89.86 147.3 100.1 153.4L131.4 172.2C133.2 173.2 134.5 173.3 135.6 173.2C136.8 172.1 138.1 172.3 139.2 171.2C140.3 170.1 140.1 168.8 141.2 167.6C141.3 166.5 141.2 165.2 140.2 163.4L121.4 132.1C115.3 121.9 112 110.1 112 98.12V93.25C112 59.42 139.4 32 173.3 32C189.5 32 205.1 38.45 216.6 49.94z"],code:[640,512,[],"f121","M414.8 40.79L286.8 488.8C281.9 505.8 264.2 515.6 247.2 510.8C230.2 505.9 220.4 488.2 225.2 471.2L353.2 23.21C358.1 6.216 375.8-3.624 392.8 1.232C409.8 6.087 419.6 23.8 414.8 40.79H414.8zM518.6 121.4L630.6 233.4C643.1 245.9 643.1 266.1 630.6 278.6L518.6 390.6C506.1 403.1 485.9 403.1 473.4 390.6C460.9 378.1 460.9 357.9 473.4 345.4L562.7 256L473.4 166.6C460.9 154.1 460.9 133.9 473.4 121.4C485.9 108.9 506.1 108.9 518.6 121.4V121.4zM166.6 166.6L77.25 256L166.6 345.4C179.1 357.9 179.1 378.1 166.6 390.6C154.1 403.1 133.9 403.1 121.4 390.6L9.372 278.6C-3.124 266.1-3.124 245.9 9.372 233.4L121.4 121.4C133.9 108.9 154.1 108.9 166.6 121.4C179.1 133.9 179.1 154.1 166.6 166.6V166.6z"],"code-branch":[448,512,[],"f126","M160 80C160 112.8 140.3 140.1 112 153.3V241.1C130.8 230.2 152.7 224 176 224H272C307.3 224 336 195.3 336 160V153.3C307.7 140.1 288 112.8 288 80C288 35.82 323.8 0 368 0C412.2 0 448 35.82 448 80C448 112.8 428.3 140.1 400 153.3V160C400 230.7 342.7 288 272 288H176C140.7 288 112 316.7 112 352V358.7C140.3 371 160 399.2 160 432C160 476.2 124.2 512 80 512C35.82 512 0 476.2 0 432C0 399.2 19.75 371 48 358.7V153.3C19.75 140.1 0 112.8 0 80C0 35.82 35.82 0 80 0C124.2 0 160 35.82 160 80V80zM80 104C93.25 104 104 93.25 104 80C104 66.75 93.25 56 80 56C66.75 56 56 66.75 56 80C56 93.25 66.75 104 80 104zM368 56C354.7 56 344 66.75 344 80C344 93.25 354.7 104 368 104C381.3 104 392 93.25 392 80C392 66.75 381.3 56 368 56zM80 456C93.25 456 104 445.3 104 432C104 418.7 93.25 408 80 408C66.75 408 56 418.7 56 432C56 445.3 66.75 456 80 456z"],"code-commit":[640,512,[],"f386","M476.8 288C461.1 361 397.4 416 320 416C242.6 416 178 361 163.2 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H163.2C178 150.1 242.6 96 320 96C397.4 96 461.1 150.1 476.8 224H608C625.7 224 640 238.3 640 256C640 273.7 625.7 288 608 288H476.8zM320 336C364.2 336 400 300.2 400 256C400 211.8 364.2 176 320 176C275.8 176 240 211.8 240 256C240 300.2 275.8 336 320 336z"],"code-compare":[512,512,[],"e13a","M320 488C320 497.5 314.4 506.1 305.8 509.9C297.1 513.8 286.1 512.2 279.9 505.8L199.9 433.8C194.9 429.3 192 422.8 192 416C192 409.2 194.9 402.7 199.9 398.2L279.9 326.2C286.1 319.8 297.1 318.2 305.8 322.1C314.4 325.9 320 334.5 320 344V384H336C371.3 384 400 355.3 400 320V153.3C371.7 140.1 352 112.8 352 80C352 35.82 387.8 0 432 0C476.2 0 512 35.82 512 80C512 112.8 492.3 140.1 464 153.3V320C464 390.7 406.7 448 336 448H320V488zM456 79.1C456 66.74 445.3 55.1 432 55.1C418.7 55.1 408 66.74 408 79.1C408 93.25 418.7 103.1 432 103.1C445.3 103.1 456 93.25 456 79.1zM192 24C192 14.52 197.6 5.932 206.2 2.076C214.9-1.78 225-.1789 232.1 6.161L312.1 78.16C317.1 82.71 320 89.2 320 96C320 102.8 317.1 109.3 312.1 113.8L232.1 185.8C225 192.2 214.9 193.8 206.2 189.9C197.6 186.1 192 177.5 192 168V128H176C140.7 128 112 156.7 112 192V358.7C140.3 371 160 399.2 160 432C160 476.2 124.2 512 80 512C35.82 512 0 476.2 0 432C0 399.2 19.75 371 48 358.7V192C48 121.3 105.3 64 176 64H192V24zM56 432C56 445.3 66.75 456 80 456C93.25 456 104 445.3 104 432C104 418.7 93.25 408 80 408C66.75 408 56 418.7 56 432z"],"code-fork":[448,512,[],"e13b","M160 80C160 112.8 140.3 140.1 112 153.3V192C112 209.7 126.3 224 144 224H304C321.7 224 336 209.7 336 192V153.3C307.7 140.1 288 112.8 288 80C288 35.82 323.8 0 368 0C412.2 0 448 35.82 448 80C448 112.8 428.3 140.1 400 153.3V192C400 245 357 288 304 288H256V358.7C284.3 371 304 399.2 304 432C304 476.2 268.2 512 224 512C179.8 512 144 476.2 144 432C144 399.2 163.7 371 192 358.7V288H144C90.98 288 48 245 48 192V153.3C19.75 140.1 0 112.8 0 80C0 35.82 35.82 0 80 0C124.2 0 160 35.82 160 80V80zM80 104C93.25 104 104 93.25 104 80C104 66.75 93.25 56 80 56C66.75 56 56 66.75 56 80C56 93.25 66.75 104 80 104zM368 104C381.3 104 392 93.25 392 80C392 66.75 381.3 56 368 56C354.7 56 344 66.75 344 80C344 93.25 354.7 104 368 104zM224 408C210.7 408 200 418.7 200 432C200 445.3 210.7 456 224 456C237.3 456 248 445.3 248 432C248 418.7 237.3 408 224 408z"],"code-merge":[448,512,[],"f387","M208 239.1H294.7C307 211.7 335.2 191.1 368 191.1C412.2 191.1 448 227.8 448 271.1C448 316.2 412.2 352 368 352C335.2 352 307 332.3 294.7 303.1H208C171.1 303.1 138.7 292.1 112 272V358.7C140.3 371 160 399.2 160 432C160 476.2 124.2 512 80 512C35.82 512 0 476.2 0 432C0 399.2 19.75 371 48 358.7V153.3C19.75 140.1 0 112.8 0 80C0 35.82 35.82 0 80 0C124.2 0 160 35.82 160 80C160 112.6 140.5 140.7 112.4 153.2C117 201.9 158.1 240 208 240V239.1zM80 103.1C93.25 103.1 104 93.25 104 79.1C104 66.74 93.25 55.1 80 55.1C66.75 55.1 56 66.74 56 79.1C56 93.25 66.75 103.1 80 103.1zM80 456C93.25 456 104 445.3 104 432C104 418.7 93.25 408 80 408C66.75 408 56 418.7 56 432C56 445.3 66.75 456 80 456zM368 247.1C354.7 247.1 344 258.7 344 271.1C344 285.3 354.7 295.1 368 295.1C381.3 295.1 392 285.3 392 271.1C392 258.7 381.3 247.1 368 247.1z"],"code-pull-request":[512,512,[],"e13c","M305.8 2.076C314.4 5.932 320 14.52 320 24V64H336C406.7 64 464 121.3 464 192V358.7C492.3 371 512 399.2 512 432C512 476.2 476.2 512 432 512C387.8 512 352 476.2 352 432C352 399.2 371.7 371 400 358.7V192C400 156.7 371.3 128 336 128H320V168C320 177.5 314.4 186.1 305.8 189.9C297.1 193.8 286.1 192.2 279.9 185.8L199.9 113.8C194.9 109.3 192 102.8 192 96C192 89.2 194.9 82.71 199.9 78.16L279.9 6.161C286.1-.1791 297.1-1.779 305.8 2.077V2.076zM432 456C445.3 456 456 445.3 456 432C456 418.7 445.3 408 432 408C418.7 408 408 418.7 408 432C408 445.3 418.7 456 432 456zM112 358.7C140.3 371 160 399.2 160 432C160 476.2 124.2 512 80 512C35.82 512 0 476.2 0 432C0 399.2 19.75 371 48 358.7V153.3C19.75 140.1 0 112.8 0 80C0 35.82 35.82 .0004 80 .0004C124.2 .0004 160 35.82 160 80C160 112.8 140.3 140.1 112 153.3V358.7zM80 56C66.75 56 56 66.75 56 80C56 93.25 66.75 104 80 104C93.25 104 104 93.25 104 80C104 66.75 93.25 56 80 56zM80 408C66.75 408 56 418.7 56 432C56 445.3 66.75 456 80 456C93.25 456 104 445.3 104 432C104 418.7 93.25 408 80 408z"],coins:[512,512,[],"f51e","M512 80C512 98.01 497.7 114.6 473.6 128C444.5 144.1 401.2 155.5 351.3 158.9C347.7 157.2 343.9 155.5 340.1 153.9C300.6 137.4 248.2 128 192 128C183.7 128 175.6 128.2 167.5 128.6L166.4 128C142.3 114.6 128 98.01 128 80C128 35.82 213.1 0 320 0C426 0 512 35.82 512 80V80zM160.7 161.1C170.9 160.4 181.3 160 192 160C254.2 160 309.4 172.3 344.5 191.4C369.3 204.9 384 221.7 384 240C384 243.1 383.3 247.9 381.9 251.7C377.3 264.9 364.1 277 346.9 287.3C346.9 287.3 346.9 287.3 346.9 287.3C346.8 287.3 346.6 287.4 346.5 287.5L346.5 287.5C346.2 287.7 345.9 287.8 345.6 288C310.6 307.4 254.8 320 192 320C132.4 320 79.06 308.7 43.84 290.9C41.97 289.9 40.15 288.1 38.39 288C14.28 274.6 0 258 0 240C0 205.2 53.43 175.5 128 164.6C138.5 163 149.4 161.8 160.7 161.1L160.7 161.1zM391.9 186.6C420.2 182.2 446.1 175.2 468.1 166.1C484.4 159.3 499.5 150.9 512 140.6V176C512 195.3 495.5 213.1 468.2 226.9C453.5 234.3 435.8 240.5 415.8 245.3C415.9 243.6 416 241.8 416 240C416 218.1 405.4 200.1 391.9 186.6V186.6zM384 336C384 354 369.7 370.6 345.6 384C343.8 384.1 342 385.9 340.2 386.9C304.9 404.7 251.6 416 192 416C129.2 416 73.42 403.4 38.39 384C14.28 370.6 .0003 354 .0003 336V300.6C12.45 310.9 27.62 319.3 43.93 326.1C83.44 342.6 135.8 352 192 352C248.2 352 300.6 342.6 340.1 326.1C347.9 322.9 355.4 319.2 362.5 315.2C368.6 311.8 374.3 308 379.7 304C381.2 302.9 382.6 301.7 384 300.6L384 336zM416 278.1C434.1 273.1 452.5 268.6 468.1 262.1C484.4 255.3 499.5 246.9 512 236.6V272C512 282.5 507 293 497.1 302.9C480.8 319.2 452.1 332.6 415.8 341.3C415.9 339.6 416 337.8 416 336V278.1zM192 448C248.2 448 300.6 438.6 340.1 422.1C356.4 415.3 371.5 406.9 384 396.6V432C384 476.2 298 512 192 512C85.96 512 .0003 476.2 .0003 432V396.6C12.45 406.9 27.62 415.3 43.93 422.1C83.44 438.6 135.8 448 192 448z"],"colon-sign":[320,512,[],"e140","M216.6 65.56C226.4 66.81 235.9 68.8 245.2 71.46L256.1 24.24C261.2 7.093 278.6-3.331 295.8 .9552C312.9 5.242 323.3 22.62 319 39.76L303.1 100C305.1 100.8 306.2 101.6 307.2 102.4C321.4 113 324.2 133.1 313.6 147.2C307.5 155.3 298.4 159.7 288.1 159.1L234.8 376.7C247.1 372.3 258.5 366.1 268.8 358.4C282.9 347.8 302.1 350.6 313.6 364.8C324.2 378.9 321.4 398.1 307.2 409.6C281.5 428.9 250.8 441.9 217.4 446.3L207 487.8C202.8 504.9 185.4 515.3 168.2 511C151.1 506.8 140.7 489.4 144.1 472.2L152.1 443.8C142.4 441.8 133.1 439.1 124.1 435.6L111 487.8C106.8 504.9 89.38 515.3 72.24 511C55.09 506.8 44.67 489.4 48.96 472.2L66.65 401.4C25.84 366.2 0 314.1 0 256C0 164.4 64.09 87.85 149.9 68.64L160.1 24.24C165.2 7.093 182.6-3.331 199.8 .9552C216.9 5.242 227.3 22.62 223 39.76L216.6 65.56zM131.2 143.3C91.17 164.1 64 207.3 64 256C64 282.2 71.85 306.5 85.32 326.8L131.2 143.3zM167.6 381.7L229.6 133.6C220.4 130.8 210.8 128.1 200.9 128.3L139.8 372.9C148.6 376.8 157.9 379.8 167.6 381.7V381.7z"],comment:[512,512,[61669,128489],"f075","M256 32C114.6 32 .0272 125.1 .0272 240c0 49.63 21.35 94.98 56.97 130.7c-12.5 50.37-54.27 95.27-54.77 95.77c-2.25 2.25-2.875 5.734-1.5 8.734C1.979 478.2 4.75 480 8 480c66.25 0 115.1-31.76 140.6-51.39C181.2 440.9 217.6 448 256 448c141.4 0 255.1-93.13 255.1-208S397.4 32 256 32z"],"comment-dollar":[512,512,[],"f651","M256 31.1c-141.4 0-255.1 93.09-255.1 208c0 49.59 21.37 94.1 56.97 130.7c-12.5 50.39-54.31 95.3-54.81 95.8C0 468.8-.5938 472.2 .6875 475.2C1.1 478.2 4.813 479.1 8 479.1c66.31 0 116-31.8 140.6-51.41c32.72 12.31 69.02 19.41 107.4 19.41c141.4 0 255.1-93.09 255.1-207.1S397.4 31.1 256 31.1zM317.8 282.3c-3.623 20.91-19.47 34.64-41.83 39.43V332c0 11.03-8.946 20-19.99 20S236 343 236 332v-10.77c-8.682-1.922-17.3-4.723-25.06-7.512l-4.266-1.5C196.3 308.5 190.8 297.1 194.5 286.7c3.688-10.41 15.11-15.81 25.52-12.22l4.469 1.625c7.844 2.812 16.72 6 23.66 7.031c13.72 2.125 28.94 .1875 30.31-7.625c.875-5.094 1.359-7.906-27.92-16.28L244.7 257.5c-17.33-5.094-57.92-17-50.52-59.84C197.8 176.8 213.6 162.8 236 157.1V148c0-11.03 8.961-20 20.01-20s19.99 8.969 19.99 20v10.63c5.453 1.195 11.34 2.789 18.56 5.273c10.44 3.625 15.95 15.03 12.33 25.47c-3.625 10.41-15.06 15.94-25.45 12.34c-5.859-2.031-12-4-17.59-4.844C250.2 194.8 234.1 196.7 233.6 204.5C232.8 208.1 232.3 212.2 255.1 219.2l5.547 1.594C283.8 227.1 325.3 239 317.8 282.3z"],"comment-dots":[512,512,[62075,128172,"commenting"],"f4ad","M256 31.1c-141.4 0-255.1 93.12-255.1 208c0 49.62 21.35 94.98 56.97 130.7c-12.5 50.37-54.27 95.27-54.77 95.77c-2.25 2.25-2.875 5.734-1.5 8.734c1.249 3 4.021 4.766 7.271 4.766c66.25 0 115.1-31.76 140.6-51.39c32.63 12.25 69.02 19.39 107.4 19.39c141.4 0 255.1-93.13 255.1-207.1S397.4 31.1 256 31.1zM127.1 271.1c-17.75 0-32-14.25-32-31.1s14.25-32 32-32s32 14.25 32 32S145.7 271.1 127.1 271.1zM256 271.1c-17.75 0-31.1-14.25-31.1-31.1s14.25-32 31.1-32s31.1 14.25 31.1 32S273.8 271.1 256 271.1zM383.1 271.1c-17.75 0-32-14.25-32-31.1s14.25-32 32-32s32 14.25 32 32S401.7 271.1 383.1 271.1z"],"comment-medical":[512,512,[],"f7f5","M256 31.1c-141.4 0-255.1 93.09-255.1 208c0 49.59 21.38 94.1 56.97 130.7c-12.5 50.39-54.31 95.3-54.81 95.8C0 468.8-.5938 472.2 .6875 475.2c1.312 3 4.125 4.797 7.312 4.797c66.31 0 116-31.8 140.6-51.41c32.72 12.31 69.01 19.41 107.4 19.41C397.4 447.1 512 354.9 512 239.1S397.4 31.1 256 31.1zM368 266c0 8.836-7.164 16-16 16h-54V336c0 8.836-7.164 16-16 16h-52c-8.836 0-16-7.164-16-16V282H160c-8.836 0-16-7.164-16-16V214c0-8.838 7.164-16 16-16h53.1V144c0-8.838 7.164-16 16-16h52c8.836 0 16 7.162 16 16v54H352c8.836 0 16 7.162 16 16V266z"],"comment-slash":[640,512,[],"f4b3","M64.03 239.1c0 49.59 21.38 94.1 56.97 130.7c-12.5 50.39-54.31 95.3-54.81 95.8c-2.187 2.297-2.781 5.703-1.5 8.703c1.312 3 4.125 4.797 7.312 4.797c66.31 0 116-31.8 140.6-51.41c32.72 12.31 69.02 19.41 107.4 19.41c37.39 0 72.78-6.663 104.8-18.36L82.93 161.7C70.81 185.9 64.03 212.3 64.03 239.1zM630.8 469.1l-118.1-92.59C551.1 340 576 292.4 576 240c0-114.9-114.6-207.1-255.1-207.1c-67.74 0-129.1 21.55-174.9 56.47L38.81 5.117C28.21-3.154 13.16-1.096 5.115 9.19C-3.072 19.63-1.249 34.72 9.188 42.89l591.1 463.1c10.5 8.203 25.57 6.333 33.7-4.073C643.1 492.4 641.2 477.3 630.8 469.1z"],"comment-sms":[512,512,["sms"],"f7cd","M256 32C114.6 32 .0137 125.1 .0137 240c0 49.59 21.39 95 56.99 130.7c-12.5 50.39-54.31 95.3-54.81 95.8C0 468.8-.5938 472.2 .6875 475.2C1.1 478.2 4.813 480 8 480c66.31 0 116-31.8 140.6-51.41C181.3 440.9 217.6 448 256 448C397.4 448 512 354.9 512 240S397.4 32 256 32zM167.3 271.9C163.9 291.1 146.3 304 121.1 304c-4.031 0-8.25-.3125-12.59-1C101.1 301.8 92.81 298.8 85.5 296.1c-8.312-3-14.06-12.66-11.09-20.97S85 261.1 93.38 264.9c6.979 2.498 14.53 5.449 20.88 6.438C125.7 273.1 135 271 135.8 266.4c1.053-5.912-10.84-8.396-24.56-12.34c-12.12-3.531-44.28-12.97-38.63-46c4.062-23.38 27.31-35.91 58-31.09c5.906 .9062 12.44 2.844 18.59 4.969c8.344 2.875 12.78 12 9.906 20.34C156.3 210.7 147.2 215.1 138.8 212.2c-4.344-1.5-8.938-2.938-13.09-3.594c-11.22-1.656-20.72 .4062-21.5 4.906C103.2 219.2 113.6 221.5 124.4 224.6C141.4 229.5 173.1 238.5 167.3 271.9zM320 288c0 8.844-7.156 16-16 16S288 296.8 288 288V240l-19.19 25.59c-6.062 8.062-19.55 8.062-25.62 0L224 240V288c0 8.844-7.156 16-16 16S192 296.8 192 288V192c0-6.875 4.406-12.1 10.94-15.18c6.5-2.094 13.71 .0586 17.87 5.59L256 229.3l35.19-46.93c4.156-5.531 11.4-7.652 17.87-5.59C315.6 179 320 185.1 320 192V288zM439.3 271.9C435.9 291.1 418.3 304 393.1 304c-4.031 0-8.25-.3125-12.59-1c-8.25-1.25-16.56-4.25-23.88-6.906c-8.312-3-14.06-12.66-11.09-20.97s10.59-13.16 18.97-10.19c6.979 2.498 14.53 5.449 20.88 6.438c11.44 1.719 20.78-.375 21.56-4.938c1.053-5.912-10.84-8.396-24.56-12.34c-12.12-3.531-44.28-12.97-38.63-46c4.031-23.38 27.25-35.91 58-31.09c5.906 .9062 12.44 2.844 18.59 4.969c8.344 2.875 12.78 12 9.906 20.34c-2.875 8.344-11.94 12.81-20.34 9.906c-4.344-1.5-8.938-2.938-13.09-3.594c-11.19-1.656-20.72 .4062-21.5 4.906C375.2 219.2 385.6 221.5 396.4 224.6C413.4 229.5 445.1 238.5 439.3 271.9z"],comments:[640,512,[61670,128490],"f086","M416 176C416 78.8 322.9 0 208 0S0 78.8 0 176c0 39.57 15.62 75.96 41.67 105.4c-16.39 32.76-39.23 57.32-39.59 57.68c-2.1 2.205-2.67 5.475-1.441 8.354C1.9 350.3 4.602 352 7.66 352c38.35 0 70.76-11.12 95.74-24.04C134.2 343.1 169.8 352 208 352C322.9 352 416 273.2 416 176zM599.6 443.7C624.8 413.9 640 376.6 640 336C640 238.8 554 160 448 160c-.3145 0-.6191 .041-.9336 .043C447.5 165.3 448 170.6 448 176c0 98.62-79.68 181.2-186.1 202.5C282.7 455.1 357.1 512 448 512c33.69 0 65.32-8.008 92.85-21.98C565.2 502 596.1 512 632.3 512c3.059 0 5.76-1.725 7.02-4.605c1.229-2.879 .6582-6.148-1.441-8.354C637.6 498.7 615.9 475.3 599.6 443.7z"],"comments-dollar":[640,512,[],"f653","M416 176C416 78.8 322.9 0 208 0S0 78.8 0 176c0 39.57 15.62 75.96 41.67 105.4c-16.39 32.76-39.23 57.32-39.59 57.68c-2.1 2.205-2.67 5.475-1.441 8.354C1.9 350.3 4.602 352 7.66 352c38.35 0 70.76-11.12 95.74-24.04C134.2 343.1 169.8 352 208 352C322.9 352 416 273.2 416 176zM269.8 218.3C266.2 239.2 250.4 252.1 228 257.7V268c0 11.03-8.953 20-20 20s-20-8.969-20-20V257.2c-8.682-1.922-17.3-4.723-25.06-7.512l-4.266-1.5C148.3 244.5 142.8 233.1 146.5 222.7c3.688-10.41 15.11-15.81 25.52-12.22l4.469 1.625c7.844 2.812 16.72 6 23.66 7.031C213.8 221.3 229 219.3 230.4 211.5C231.3 206.4 231.8 203.6 202.5 195.2L196.7 193.5c-17.33-5.094-57.92-17-50.52-59.84C149.8 112.8 165.6 98.76 188 93.99V84c0-11.03 8.953-20 20-20s20 8.969 20 20v10.63c5.453 1.195 11.34 2.789 18.56 5.273C257 103.5 262.5 114.9 258.9 125.4C255.3 135.8 243.8 141.3 233.4 137.7c-5.859-2.031-12-4-17.59-4.844C202.2 130.8 186.1 132.7 185.6 140.5C184.8 144.1 184.3 148.2 207.1 155.2L213.5 156.8C235.8 163.1 277.3 175 269.8 218.3zM599.6 443.7C624.8 413.9 640 376.6 640 336C640 238.8 554 160 448 160c-.3145 0-.6191 .041-.9336 .043C447.5 165.3 448 170.6 448 176c0 98.62-79.68 181.2-186.1 202.5C282.7 455.1 357.1 512 448 512c33.69 0 65.32-8.008 92.85-21.98C565.2 502 596.1 512 632.3 512c3.059 0 5.76-1.725 7.02-4.605c1.229-2.879 .6582-6.148-1.441-8.354C637.6 498.7 615.9 475.3 599.6 443.7z"],"compact-disc":[512,512,[128192,128440,128191],"f51f","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM80.72 256H79.63c-9.078 0-16.4-8.011-15.56-17.34C72.36 146 146.5 72.06 239.3 64.06C248.3 63.28 256 70.75 256 80.09c0 8.35-6.215 15.28-14.27 15.99C164.7 102.9 103.1 164.3 96.15 241.4C95.4 249.6 88.77 256 80.72 256zM256 351.1c-53.02 0-96-43-96-95.1s42.98-96 96-96s96 43 96 96S309 351.1 256 351.1zM256 224C238.3 224 224 238.2 224 256s14.3 32 32 32c17.7 0 32-14.25 32-32S273.7 224 256 224z"],compass:[512,512,[129517],"f14e","M288 256C288 273.7 273.7 288 256 288C238.3 288 224 273.7 224 256C224 238.3 238.3 224 256 224C273.7 224 288 238.3 288 256zM0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM325.1 306.7L380.6 162.4C388.1 142.1 369 123.9 349.6 131.4L205.3 186.9C196.8 190.1 190.1 196.8 186.9 205.3L131.4 349.6C123.9 369 142.1 388.1 162.4 380.6L306.7 325.1C315.2 321.9 321.9 315.2 325.1 306.7V306.7z"],"compass-drafting":[512,512,["drafting-compass"],"f568","M352 96C352 110.3 348.9 123.9 343.2 136.2L396 227.4C372.3 252.7 341.9 271.5 307.6 281L256 192H255.1L187.9 309.5C209.4 316.3 232.3 320 256 320C326.7 320 389.8 287.3 430.9 235.1C441.9 222.2 462.1 219.1 475.9 231C489.7 242.1 491.9 262.2 480.8 276C428.1 341.8 346.1 384 256 384C220.6 384 186.6 377.6 155.3 365.9L98.65 463.7C93.95 471.8 86.97 478.4 78.58 482.6L23.16 510.3C18.2 512.8 12.31 512.5 7.588 509.6C2.871 506.7 0 501.5 0 496V440.6C0 432.2 2.228 423.9 6.46 416.5L66.49 312.9C53.66 301.6 41.84 289.3 31.18 276C20.13 262.2 22.34 242.1 36.13 231C49.92 219.1 70.06 222.2 81.12 235.1C86.79 243.1 92.87 249.8 99.34 256.1L168.8 136.2C163.1 123.9 160 110.3 160 96C160 42.98 202.1 0 256 0C309 0 352 42.98 352 96L352 96zM256 128C273.7 128 288 113.7 288 96C288 78.33 273.7 64 256 64C238.3 64 224 78.33 224 96C224 113.7 238.3 128 256 128zM372.1 393.9C405.5 381.1 435.5 363.2 461.8 341L505.5 416.5C509.8 423.9 512 432.2 512 440.6V496C512 501.5 509.1 506.7 504.4 509.6C499.7 512.5 493.8 512.8 488.8 510.3L433.4 482.6C425 478.4 418.1 471.8 413.3 463.7L372.1 393.9z"],compress:[448,512,[],"f066","M128 320H32c-17.69 0-32 14.31-32 32s14.31 32 32 32h64v64c0 17.69 14.31 32 32 32s32-14.31 32-32v-96C160 334.3 145.7 320 128 320zM416 320h-96c-17.69 0-32 14.31-32 32v96c0 17.69 14.31 32 32 32s32-14.31 32-32v-64h64c17.69 0 32-14.31 32-32S433.7 320 416 320zM320 192h96c17.69 0 32-14.31 32-32s-14.31-32-32-32h-64V64c0-17.69-14.31-32-32-32s-32 14.31-32 32v96C288 177.7 302.3 192 320 192zM128 32C110.3 32 96 46.31 96 64v64H32C14.31 128 0 142.3 0 160s14.31 32 32 32h96c17.69 0 32-14.31 32-32V64C160 46.31 145.7 32 128 32z"],computer:[640,512,[],"e4e5","M400 32C426.5 32 448 53.49 448 80V336C448 362.5 426.5 384 400 384H266.7L277.3 416H352C369.7 416 384 430.3 384 448C384 465.7 369.7 480 352 480H96C78.33 480 64 465.7 64 448C64 430.3 78.33 416 96 416H170.7L181.3 384H48C21.49 384 0 362.5 0 336V80C0 53.49 21.49 32 48 32H400zM64 96V320H384V96H64zM592 32C618.5 32 640 53.49 640 80V432C640 458.5 618.5 480 592 480H528C501.5 480 480 458.5 480 432V80C480 53.49 501.5 32 528 32H592zM544 96C535.2 96 528 103.2 528 112C528 120.8 535.2 128 544 128H576C584.8 128 592 120.8 592 112C592 103.2 584.8 96 576 96H544zM544 192H576C584.8 192 592 184.8 592 176C592 167.2 584.8 160 576 160H544C535.2 160 528 167.2 528 176C528 184.8 535.2 192 544 192zM560 400C577.7 400 592 385.7 592 368C592 350.3 577.7 336 560 336C542.3 336 528 350.3 528 368C528 385.7 542.3 400 560 400z"],"computer-mouse":[384,512,[128433,"mouse"],"f8cc","M0 352c0 88.38 71.63 160 160 160h64c88.38 0 160-71.63 160-160V224H0V352zM176 0H160C71.63 0 0 71.62 0 160v32h176V0zM224 0h-16v192H384V160C384 71.62 312.4 0 224 0z"],cookie:[512,512,[127850],"f563","M494.5 254.8l-11.37-71.48c-4.102-25.9-16.29-49.8-34.8-68.32l-51.33-51.33c-18.52-18.52-42.3-30.7-68.2-34.8L256.9 17.53C231.2 13.42 204.7 17.64 181.5 29.48L116.7 62.53C93.23 74.36 74.36 93.35 62.41 116.7L29.51 181.2c-11.84 23.44-16.08 50.04-11.98 75.94l11.37 71.48c4.101 25.9 16.29 49.77 34.8 68.41l51.33 51.33c18.52 18.4 42.3 30.61 68.2 34.72l71.84 11.37c25.78 4.102 52.27-.1173 75.47-11.95l64.8-33.05c23.32-11.84 42.3-30.82 54.26-54.14l32.81-64.57C494.4 307.3 498.6 280.8 494.5 254.8zM176 367.1c-17.62 0-31.1-14.37-31.1-31.1c0-17.62 14.37-31.1 31.1-31.1s31.1 14.37 31.1 31.1C208 353.6 193.6 367.1 176 367.1zM208 208c-17.62 0-31.1-14.37-31.1-31.1s14.38-31.1 31.1-31.1c17.62 0 31.1 14.37 31.1 31.1S225.6 208 208 208zM368 335.1c-17.62 0-31.1-14.37-31.1-31.1c0-17.62 14.37-31.1 31.1-31.1s31.1 14.37 31.1 31.1C400 321.6 385.6 335.1 368 335.1z"],"cookie-bite":[512,512,[],"f564","M494.6 255.9c-65.63-.8203-118.6-54.14-118.6-119.9c-65.74 0-119.1-52.97-119.8-118.6c-25.66-3.867-51.8 .2346-74.77 12.07L116.7 62.41C93.35 74.36 74.36 93.35 62.41 116.7L29.6 181.2c-11.95 23.44-16.17 49.92-12.07 75.94l11.37 71.48c4.102 25.9 16.29 49.8 34.81 68.32l51.36 51.39C133.6 466.9 157.3 479 183.2 483.1l71.84 11.37c25.9 4.101 52.27-.1172 75.59-11.95l64.81-33.05c23.32-11.84 42.31-30.82 54.14-54.14l32.93-64.57C494.3 307.7 498.5 281.4 494.6 255.9zM176 367.1c-17.62 0-32-14.37-32-31.1s14.38-31.1 32-31.1s32 14.37 32 31.1S193.6 367.1 176 367.1zM208 208c-17.62 0-32-14.37-32-31.1s14.38-31.1 32-31.1s32 14.37 32 31.1S225.6 208 208 208zM368 335.1c-17.62 0-32-14.37-32-31.1s14.38-31.1 32-31.1s32 14.37 32 31.1S385.6 335.1 368 335.1z"],copy:[512,512,[],"f0c5","M384 96L384 0h-112c-26.51 0-48 21.49-48 48v288c0 26.51 21.49 48 48 48H464c26.51 0 48-21.49 48-48V128h-95.1C398.4 128 384 113.6 384 96zM416 0v96h96L416 0zM192 352V128h-144c-26.51 0-48 21.49-48 48v288c0 26.51 21.49 48 48 48h192c26.51 0 48-21.49 48-48L288 416h-32C220.7 416 192 387.3 192 352z"],copyright:[512,512,[169],"f1f9","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM199.2 312.6c14.94 15.06 34.8 23.38 55.89 23.38c.0313 0 0 0 0 0c21.06 0 40.92-8.312 55.83-23.38c9.375-9.375 24.53-9.469 33.97-.1562c9.406 9.344 9.469 24.53 .1562 33.97c-24 24.22-55.95 37.56-89.95 37.56c0 0 .0313 0 0 0c-33.97 0-65.95-13.34-89.95-37.56c-49.44-49.88-49.44-131 0-180.9c24-24.22 55.98-37.56 89.95-37.56c.0313 0 0 0 0 0c34 0 65.95 13.34 89.95 37.56c9.312 9.438 9.25 24.62-.1562 33.97c-9.438 9.344-24.59 9.188-33.97-.1562c-14.91-15.06-34.77-23.38-55.83-23.38c0 0 .0313 0 0 0c-21.09 0-40.95 8.312-55.89 23.38C168.3 230.6 168.3 281.4 199.2 312.6z"],couch:[640,512,[],"f4b8","M592 224C565.5 224 544 245.5 544 272V352H96V272C96 245.5 74.51 224 48 224S0 245.5 0 272v192C0 472.8 7.164 480 16 480h64c8.836 0 15.1-7.164 15.1-16L96 448h448v16c0 8.836 7.164 16 16 16h64c8.836 0 16-7.164 16-16v-192C640 245.5 618.5 224 592 224zM128 272V320h384V272c0-38.63 27.53-70.95 64-78.38V160c0-70.69-57.31-128-128-128H191.1c-70.69 0-128 57.31-128 128L64 193.6C100.5 201.1 128 233.4 128 272z"],cow:[640,512,[128004],"f6c8","M634 276.8l-9.999-13.88L624 185.7c0-11.88-12.5-19.49-23.12-14.11c-10.88 5.375-19.5 13.5-26.38 23l-65.75-90.92C490.6 78.71 461.8 64 431 64H112C63.37 64 24 103.4 24 152v86.38C9.5 250.1 0 267.9 0 288v32h8c35.38 0 64-28.62 64-64L72 152c0-16.88 10.5-31.12 25.38-37C96.5 119.1 96 123.5 96 128l.0002 304c0 8.875 7.126 16 16 16h63.1c8.875 0 16-7.125 16-16l.0006-112c9.375 9.375 20.25 16.5 32 21.88V368c0 8.875 7.252 16 16 16c8.875 0 15.1-7.125 15.1-16v-17.25c9.125 1 12.88 2.25 32-.125V368c0 8.875 7.25 16 16 16c8.875 0 16-7.125 16-16v-26.12C331.8 336.5 342.6 329.2 352 320l-.0012 112c0 8.875 7.125 16 15.1 16h64c8.75 0 16-7.125 16-16V256l31.1 32l.0006 41.55c0 12.62 3.752 24.95 10.75 35.45l41.25 62C540.8 440.1 555.5 448 571.4 448c22.5 0 41.88-15.88 46.25-38l21.75-108.6C641.1 292.8 639.1 283.9 634 276.8zM377.3 167.4l-22.88 22.75C332.5 211.8 302.9 224 272.1 224S211.5 211.8 189.6 190.1L166.8 167.4C151 151.8 164.4 128 188.9 128h166.2C379.6 128 393 151.8 377.3 167.4zM576 352c-8.875 0-16-7.125-16-16s7.125-16 16-16s16 7.125 16 16S584.9 352 576 352z"],"credit-card":[576,512,[62083,128179,"credit-card-alt"],"f09d","M512 32C547.3 32 576 60.65 576 96V128H0V96C0 60.65 28.65 32 64 32H512zM576 416C576 451.3 547.3 480 512 480H64C28.65 480 0 451.3 0 416V224H576V416zM112 352C103.2 352 96 359.2 96 368C96 376.8 103.2 384 112 384H176C184.8 384 192 376.8 192 368C192 359.2 184.8 352 176 352H112zM240 384H368C376.8 384 384 376.8 384 368C384 359.2 376.8 352 368 352H240C231.2 352 224 359.2 224 368C224 376.8 231.2 384 240 384z"],crop:[512,512,[],"f125","M448 384H480C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H448V480C448 497.7 433.7 512 416 512C398.3 512 384 497.7 384 480V173.3L173.3 384H352V448H128C92.65 448 64 419.3 64 384V128H32C14.33 128 0 113.7 0 96C0 78.33 14.33 64 32 64H64V32C64 14.33 78.33 0 96 0C113.7 0 128 14.33 128 32V338.7L338.7 128H160V64H402.7L457.4 9.372C469.9-3.124 490.1-3.124 502.6 9.372C515.1 21.87 515.1 42.13 502.6 54.63L448 109.3V384z"],"crop-simple":[512,512,["crop-alt"],"f565","M128 384H352V448H128C92.65 448 64 419.3 64 384V128H32C14.33 128 0 113.7 0 96C0 78.33 14.33 64 32 64H64V32C64 14.33 78.33 0 96 0C113.7 0 128 14.33 128 32V384zM384 128H160V64H384C419.3 64 448 92.65 448 128V384H480C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H448V480C448 497.7 433.7 512 416 512C398.3 512 384 497.7 384 480V128z"],cross:[384,512,[128327,10013],"f654","M383.1 160v64c0 17.62-14.37 32-31.1 32h-96v224c0 17.62-14.38 32-31.1 32H160c-17.62 0-32-14.38-32-32V256h-96C14.37 256-.0008 241.6-.0008 224V160c0-17.62 14.38-32 32-32h96V32c0-17.62 14.38-32 32-32h64c17.62 0 31.1 14.38 31.1 32v96h96C369.6 128 383.1 142.4 383.1 160z"],crosshairs:[512,512,[],"f05b","M224 256C224 238.3 238.3 224 256 224C273.7 224 288 238.3 288 256C288 273.7 273.7 288 256 288C238.3 288 224 273.7 224 256zM256 0C273.7 0 288 14.33 288 32V42.35C381.7 56.27 455.7 130.3 469.6 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H469.6C455.7 381.7 381.7 455.7 288 469.6V480C288 497.7 273.7 512 256 512C238.3 512 224 497.7 224 480V469.6C130.3 455.7 56.27 381.7 42.35 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H42.35C56.27 130.3 130.3 56.27 224 42.35V32C224 14.33 238.3 0 256 0V0zM224 404.6V384C224 366.3 238.3 352 256 352C273.7 352 288 366.3 288 384V404.6C346.3 392.1 392.1 346.3 404.6 288H384C366.3 288 352 273.7 352 256C352 238.3 366.3 224 384 224H404.6C392.1 165.7 346.3 119.9 288 107.4V128C288 145.7 273.7 160 256 160C238.3 160 224 145.7 224 128V107.4C165.7 119.9 119.9 165.7 107.4 224H128C145.7 224 160 238.3 160 256C160 273.7 145.7 288 128 288H107.4C119.9 346.3 165.7 392.1 224 404.6z"],crow:[640,512,[],"f520","M523.9 31.1H574C603.4 31.1 628.1 51.99 636.1 80.48L640 95.1L544 119.1V191.1C544 279.1 484.9 354.1 404.2 376.8L446.2 478.9C451.2 491.1 445.4 505.1 433.1 510.2C420.9 515.2 406.9 509.4 401.8 497.1L355.2 383.1C354.1 383.1 353.1 384 352 384H311.1L350.2 478.9C355.2 491.1 349.4 505.1 337.1 510.2C324.9 515.2 310.9 509.4 305.8 497.1L259.2 384H126.1L51.51 441.4C37.5 452.1 17.41 449.5 6.638 435.5C-4.138 421.5-1.517 401.4 12.49 390.6L368 117.2V88C368 39.4 407.4 0 456 0C483.3 0 507.7 12.46 523.9 32V31.1zM456 111.1C469.3 111.1 480 101.3 480 87.1C480 74.74 469.3 63.1 456 63.1C442.7 63.1 432 74.74 432 87.1C432 101.3 442.7 111.1 456 111.1z"],crown:[576,512,[128081],"f521","M576 136c0 22.09-17.91 40-40 40c-.248 0-.4551-.1266-.7031-.1305l-50.52 277.9C482 468.9 468.8 480 453.3 480H122.7c-15.46 0-28.72-11.06-31.48-26.27L40.71 175.9C40.46 175.9 40.25 176 39.1 176c-22.09 0-40-17.91-40-40S17.91 96 39.1 96s40 17.91 40 40c0 8.998-3.521 16.89-8.537 23.57l89.63 71.7c15.91 12.73 39.5 7.544 48.61-10.68l57.6-115.2C255.1 98.34 247.1 86.34 247.1 72C247.1 49.91 265.9 32 288 32s39.1 17.91 39.1 40c0 14.34-7.963 26.34-19.3 33.4l57.6 115.2c9.111 18.22 32.71 23.4 48.61 10.68l89.63-71.7C499.5 152.9 496 144.1 496 136C496 113.9 513.9 96 536 96S576 113.9 576 136z"],crutch:[512,512,[],"f7f7","M502.6 168.1l-159.6-159.5c-12.54-12.54-32.85-12.6-45.46-.1256c-12.68 12.54-12.73 33.1-.1256 45.71l159.6 159.5c12.6 12.59 33.03 12.57 45.59-.0628C515.1 201.9 515.1 181.5 502.6 168.1zM334.4 245.4l-67.88-67.87l55.13-55.12l-45.25-45.25L166.7 186.8C154.1 199.6 145.2 215.6 141.1 233.2L113.3 353.4l-108.6 108.6c-6.25 6.25-6.25 16.37 0 22.62l22.63 22.62c6.25 6.25 16.38 6.25 22.63 0l108.6-108.6l120.3-27.75c17.5-4.125 33.63-13 46.38-25.62l109.6-109.7l-45.25-45.25L334.4 245.4zM279.9 300.1C275.7 304.2 270.3 307.2 264.4 308.6l-79.25 18.25l18.25-79.25c1.375-5.875 4.375-11.25 8.5-15.5l9.375-9.25l67.88 67.87L279.9 300.1z"],"cruzeiro-sign":[384,512,[],"e152","M159.1 402.7V256C159.1 238.3 174.3 224 191.1 224C199.7 224 206.8 226.7 212.3 231.3C223 226.6 234.8 224 247.3 224C264.5 224 281.3 229.1 295.7 238.7L305.8 245.4C320.5 255.2 324.4 275 314.6 289.8C304.8 304.5 284.1 308.4 270.2 298.6L260.2 291.9C256.3 289.4 251.9 288 247.3 288C234.4 288 224 298.4 224 311.3V416C264.1 416 302.3 400.6 330.7 375.3C343.8 363.5 364.1 364.6 375.8 377.8C387.6 390.9 386.5 411.2 373.3 422.1C333.7 458.4 281.4 480 224 480C100.3 480 0 379.7 0 256C0 132.3 100.3 32 224 32C281.4 32 333.7 53.59 373.3 89.04C386.5 100.8 387.6 121.1 375.8 134.2C364.1 147.4 343.8 148.5 330.7 136.7C302.3 111.4 264.1 96 224 96C135.6 96 63.1 167.6 63.1 256C63.1 321.6 103.5 377.1 159.1 402.7V402.7z"],cube:[512,512,[],"f1b2","M234.5 5.709C248.4 .7377 263.6 .7377 277.5 5.709L469.5 74.28C494.1 83.38 512 107.5 512 134.6V377.4C512 404.5 494.1 428.6 469.5 437.7L277.5 506.3C263.6 511.3 248.4 511.3 234.5 506.3L42.47 437.7C17 428.6 0 404.5 0 377.4V134.6C0 107.5 17 83.38 42.47 74.28L234.5 5.709zM256 65.98L82.34 128L256 190L429.7 128L256 65.98zM288 434.6L448 377.4V189.4L288 246.6V434.6z"],cubes:[576,512,[],"f1b3","M172.1 40.16L268.1 3.76C280.9-1.089 295.1-1.089 307.9 3.76L403.9 40.16C425.6 48.41 440 69.25 440 92.52V204.7C441.3 205.1 442.6 205.5 443.9 205.1L539.9 242.4C561.6 250.6 576 271.5 576 294.7V413.9C576 436.1 562.9 456.2 542.5 465.1L446.5 507.3C432.2 513.7 415.8 513.7 401.5 507.3L288 457.5L174.5 507.3C160.2 513.7 143.8 513.7 129.5 507.3L33.46 465.1C13.13 456.2 0 436.1 0 413.9V294.7C0 271.5 14.39 250.6 36.15 242.4L132.1 205.1C133.4 205.5 134.7 205.1 136 204.7V92.52C136 69.25 150.4 48.41 172.1 40.16V40.16zM290.8 48.64C289 47.95 286.1 47.95 285.2 48.64L206.8 78.35L287.1 109.5L369.2 78.35L290.8 48.64zM392 210.6V121L309.6 152.6V241.8L392 210.6zM154.8 250.9C153 250.2 150.1 250.2 149.2 250.9L70.81 280.6L152 311.7L233.2 280.6L154.8 250.9zM173.6 455.3L256 419.1V323.2L173.6 354.8V455.3zM342.8 280.6L424 311.7L505.2 280.6L426.8 250.9C425 250.2 422.1 250.2 421.2 250.9L342.8 280.6zM528 413.9V323.2L445.6 354.8V455.3L523.2 421.2C526.1 419.9 528 417.1 528 413.9V413.9z"],"cubes-stacked":[448,512,[],"e4e6","M192 64C192 46.33 206.3 32 224 32H288C305.7 32 320 46.33 320 64V128C320 145.7 305.7 160 288 160H224C206.3 160 192 145.7 192 128V64zM138.1 174.1C153.4 166.1 172.1 171.4 181.8 186.7L213.8 242.1C222.6 257.4 217.4 276.1 202.1 285.8L146.7 317.8C131.4 326.6 111.8 321.4 102.1 306.1L70.96 250.7C62.12 235.4 67.37 215.8 82.67 206.1L138.1 174.1zM352 192C369.7 192 384 206.3 384 224V288C384 305.7 369.7 320 352 320H288C270.3 320 256 305.7 256 288V224C256 206.3 270.3 192 288 192H352zM416 352C433.7 352 448 366.3 448 384V448C448 465.7 433.7 480 416 480H352C334.3 480 320 465.7 320 448V384C320 366.3 334.3 352 352 352H416zM160 384C160 366.3 174.3 352 192 352H256C273.7 352 288 366.3 288 384V448C288 465.7 273.7 480 256 480H192C174.3 480 160 465.7 160 448V384zM96 352C113.7 352 128 366.3 128 384V448C128 465.7 113.7 480 96 480H32C14.33 480 0 465.7 0 448V384C0 366.3 14.33 352 32 352H96z"],d:[384,512,[100],"44","M160 32.01L32 32.01c-17.67 0-32 14.33-32 32v384c0 17.67 14.33 32 32 32l128-.0073c123.5 0 224-100.5 224-224S283.5 32.01 160 32.01zM160 416H64v-320h96c88.22 0 160 71.78 160 159.1S248.2 416 160 416z"],database:[448,512,[],"f1c0","M448 80V128C448 172.2 347.7 208 224 208C100.3 208 0 172.2 0 128V80C0 35.82 100.3 0 224 0C347.7 0 448 35.82 448 80zM393.2 214.7C413.1 207.3 433.1 197.8 448 186.1V288C448 332.2 347.7 368 224 368C100.3 368 0 332.2 0 288V186.1C14.93 197.8 34.02 207.3 54.85 214.7C99.66 230.7 159.5 240 224 240C288.5 240 348.3 230.7 393.2 214.7V214.7zM54.85 374.7C99.66 390.7 159.5 400 224 400C288.5 400 348.3 390.7 393.2 374.7C413.1 367.3 433.1 357.8 448 346.1V432C448 476.2 347.7 512 224 512C100.3 512 0 476.2 0 432V346.1C14.93 357.8 34.02 367.3 54.85 374.7z"],"delete-left":[576,512,[9003,"backspace"],"f55a","M576 384C576 419.3 547.3 448 512 448H205.3C188.3 448 172 441.3 160 429.3L9.372 278.6C3.371 272.6 0 264.5 0 256C0 247.5 3.372 239.4 9.372 233.4L160 82.75C172 70.74 188.3 64 205.3 64H512C547.3 64 576 92.65 576 128V384zM271 208.1L318.1 256L271 303C261.7 312.4 261.7 327.6 271 336.1C280.4 346.3 295.6 346.3 304.1 336.1L352 289.9L399 336.1C408.4 346.3 423.6 346.3 432.1 336.1C442.3 327.6 442.3 312.4 432.1 303L385.9 256L432.1 208.1C442.3 199.6 442.3 184.4 432.1 175C423.6 165.7 408.4 165.7 399 175L352 222.1L304.1 175C295.6 165.7 280.4 165.7 271 175C261.7 184.4 261.7 199.6 271 208.1V208.1z"],democrat:[640,512,[],"f747","M191.1 479.1C191.1 497.6 206.4 512 223.1 512h32c17.6 0 32-14.4 32-32v-64h160v64c0 17.6 14.41 32 32.01 32L511.1 512c17.6 0 32-14.4 32-32l.0102-128H192L191.1 479.1zM637.2 256.9l-19.5-29.38c-28.25-42.25-75.38-67.5-126.1-67.5H255.1L174.7 78.75c20.13-20 22.63-51 7.5-73.88C178.9-.2552 171.5-1.005 167.1 3.37L125.2 45.25L82.36 2.37C78.74-1.255 72.74-.6302 69.99 3.62c-12.25 18.63-10.25 44 6.125 60.38c3.25 3.25 7.25 5.25 11.25 7.5c-2.125 1.75-4.625 3.125-6.375 5.375l-74.63 99.38C-.8895 185.9-2.014 198.9 3.361 209.7l14.38 28.5c5.375 10.88 16.5 17.75 28.5 17.75H77.24c8.5 0 16.63-3.375 22.63-9.375l38.13-34.63l54.04 108h351.1l-.0102-77.75c16.25 12.13 18.25 17.5 40.13 50.25c4.875 7.375 14.75 9.25 22.13 4.375l26.63-17.63C640.2 274.2 642.2 264.2 637.2 256.9zM296.2 243.2L279.7 259.4l3.875 22.75c.625 4.125-3.625 7.125-7.25 5.25L255.1 276.7L235.6 287.4C231.1 289.2 227.7 286.2 228.4 282.1l3.875-22.75L215.7 243.2c-3-2.875-1.25-7.875 2.875-8.5l22.75-3.25l10.25-20.75c1.75-3.625 7.125-3.625 9 0l10.13 20.75l22.88 3.25C297.6 235.4 299.2 240.4 296.2 243.2zM408.2 243.2l-16.5 16.13l3.875 22.75c.625 4.125-3.625 7.125-7.25 5.25L367.1 276.7l-20.38 10.63c-3.625 1.875-7.875-1.125-7.25-5.25l3.875-22.75l-16.5-16.13c-3-2.875-1.25-7.875 2.875-8.5l22.75-3.25l10.25-20.75c1.75-3.625 7.125-3.625 9 0l10.13 20.75l22.88 3.25C409.6 235.4 411.2 240.4 408.2 243.2zM520.2 243.2l-16.5 16.13l3.875 22.75c.625 4.125-3.625 7.125-7.25 5.25l-20.38-10.63l-20.38 10.63c-3.625 1.875-7.875-1.125-7.25-5.25l3.875-22.75l-16.5-16.13c-3-2.875-1.25-7.875 2.875-8.5l22.75-3.25l10.25-20.75c1.75-3.625 7.125-3.625 9 0l10.13 20.75l22.88 3.25C521.6 235.4 523.2 240.4 520.2 243.2z"],desktop:[576,512,[61704,128421,"desktop-alt"],"f390","M528 0h-480C21.5 0 0 21.5 0 48v320C0 394.5 21.5 416 48 416h192L224 464H152C138.8 464 128 474.8 128 488S138.8 512 152 512h272c13.25 0 24-10.75 24-24s-10.75-24-24-24H352L336 416h192c26.5 0 48-21.5 48-48v-320C576 21.5 554.5 0 528 0zM512 288H64V64h448V288z"],dharmachakra:[512,512,[9784],"f655","M495 225l-17.24 1.124c-5.25-39.5-20.76-75.63-43.89-105.9l12.1-11.37c6.875-6.125 7.25-16.75 .75-23.38L426.5 64.38c-6.625-6.5-17.25-6.125-23.38 .75l-11.37 12.1c-30.25-23.12-66.38-38.64-105.9-43.89L287 17C287.5 7.75 280.2 0 271 0h-30c-9.25 0-16.5 7.75-16 17l1.124 17.24c-39.5 5.25-75.63 20.76-105.9 43.89L108.9 65.13C102.8 58.25 92.13 57.88 85.63 64.38L64.38 85.5C57.88 92.12 58.25 102.8 65.13 108.9l12.1 11.37C54.1 150.5 39.49 186.6 34.24 226.1L17 225C7.75 224.5 0 231.8 0 241v30c0 9.25 7.75 16.5 17 16l17.24-1.124c5.25 39.5 20.76 75.63 43.89 105.9l-12.1 11.37c-6.875 6.125-7.25 16.75-.75 23.25l21.25 21.25c6.5 6.5 17.13 6.125 23.25-.75l11.37-12.1c30.25 23.12 66.38 38.64 105.9 43.89L225 495C224.5 504.2 231.8 512 241 512h30c9.25 0 16.5-7.75 16-17l-1.124-17.24c39.5-5.25 75.63-20.76 105.9-43.89l11.37 12.1c6.125 6.875 16.75 7.25 23.38 .75l21.12-21.25c6.5-6.5 6.125-17.13-.75-23.25l-12.1-11.37c23.12-30.25 38.64-66.38 43.89-105.9L495 287C504.3 287.5 512 280.2 512 271v-30C512 231.8 504.3 224.5 495 225zM281.9 98.68c24.75 4 47.61 13.59 67.24 27.71L306.5 174.6c-8.75-5.375-18.38-9.507-28.62-11.88L281.9 98.68zM230.1 98.68l3.996 64.06C223.9 165.1 214.3 169.2 205.5 174.6L162.9 126.4C182.5 112.3 205.4 102.7 230.1 98.68zM126.4 163l48.35 42.48c-5.5 8.75-9.606 18.4-11.98 28.65L98.68 230.1C102.7 205.4 112.2 182.5 126.4 163zM98.68 281.9l64.06-3.996C165.1 288.1 169.3 297.8 174.6 306.5l-48.23 42.61C112.3 329.5 102.7 306.6 98.68 281.9zM230.1 413.3c-24.75-4-47.61-13.59-67.24-27.71l42.58-48.33c8.75 5.5 18.4 9.606 28.65 11.98L230.1 413.3zM256 288C238.4 288 224 273.6 224 256s14.38-32 32-32s32 14.38 32 32S273.6 288 256 288zM281.9 413.3l-3.996-64.06c10.25-2.375 19.9-6.48 28.65-11.98l42.48 48.35C329.5 399.8 306.6 409.3 281.9 413.3zM385.6 349l-48.25-42.5c5.375-8.75 9.507-18.38 11.88-28.62l64.06 3.996C409.3 306.6 399.8 329.5 385.6 349zM349.3 234.1c-2.375-10.25-6.48-19.9-11.98-28.65L385.6 163c14.13 19.5 23.69 42.38 27.69 67.13L349.3 234.1z"],"diagram-next":[512,512,[],"e476","M512 160C512 195.3 483.3 224 448 224H280V288H326.1C347.4 288 358.1 313.9 343 328.1L272.1 399C263.6 408.4 248.4 408.4 239 399L168.1 328.1C153.9 313.9 164.6 288 185.9 288H232V224H64C28.65 224 0 195.3 0 160V96C0 60.65 28.65 32 64 32H448C483.3 32 512 60.65 512 96V160zM312.6 416H448V352H376.6L384.1 343.6C401 327.6 404.6 306.4 399 288H448C483.3 288 512 316.7 512 352V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V352C0 316.7 28.65 288 64 288H112.1C107.4 306.4 110.1 327.6 127 343.6L135.4 352H64V416H199.4L216.4 432.1C238.3 454.8 273.7 454.8 295.6 432.1L312.6 416z"],"diagram-predecessor":[512,512,[],"e477","M64 480C28.65 480 0 451.3 0 416V352C0 316.7 28.65 288 64 288H448C483.3 288 512 316.7 512 352V416C512 451.3 483.3 480 448 480H64zM448 416V352H64V416H448zM288 160C288 195.3 259.3 224 224 224H64C28.65 224 0 195.3 0 160V96C0 60.65 28.65 32 64 32H368C412.2 32 448 67.82 448 112V128H486.1C507.4 128 518.1 153.9 503 168.1L432.1 239C423.6 248.4 408.4 248.4 399 239L328.1 168.1C313.9 153.9 324.6 128 345.9 128H384V112C384 103.2 376.8 96 368 96H288V160z"],"diagram-project":[576,512,["project-diagram"],"f542","M0 80C0 53.49 21.49 32 48 32H144C170.5 32 192 53.49 192 80V96H384V80C384 53.49 405.5 32 432 32H528C554.5 32 576 53.49 576 80V176C576 202.5 554.5 224 528 224H432C405.5 224 384 202.5 384 176V160H192V176C192 177.7 191.9 179.4 191.7 180.1L272 288H368C394.5 288 416 309.5 416 336V432C416 458.5 394.5 480 368 480H272C245.5 480 224 458.5 224 432V336C224 334.3 224.1 332.6 224.3 331L144 224H48C21.49 224 0 202.5 0 176V80z"],"diagram-successor":[512,512,[],"e47a","M512 416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V352C0 316.7 28.65 288 64 288H448C483.3 288 512 316.7 512 352V416zM224 224H64C28.65 224 0 195.3 0 160V96C0 60.65 28.65 32 64 32H368C412.2 32 448 67.82 448 112V128H486.1C507.4 128 518.1 153.9 503 168.1L432.1 239C423.6 248.4 408.4 248.4 399 239L328.1 168.1C313.9 153.9 324.6 128 345.9 128H384V112C384 103.2 376.8 96 368 96H288V160C288 195.3 259.3 224 224 224V224zM64 160H224V96H64V160z"],diamond:[512,512,[9830],"f219","M500.3 227.7C515.9 243.3 515.9 268.7 500.3 284.3L284.3 500.3C268.7 515.9 243.3 515.9 227.7 500.3L11.72 284.3C-3.905 268.7-3.905 243.3 11.72 227.7L227.7 11.72C243.3-3.905 268.7-3.905 284.3 11.72L500.3 227.7z"],"diamond-turn-right":[512,512,["directions"],"f5eb","M497.1 222.1l-208.1-208.1c-9.364-9.364-21.62-14.04-33.89-14.03C243.7 .0092 231.5 4.686 222.1 14.03L14.03 222.1C4.676 231.5 .0002 243.7 .0004 255.1c.0002 12.26 4.676 24.52 14.03 33.87l208.1 208.1C231.5 507.3 243.7 511.1 256 511.1c12.26 0 24.52-4.677 33.87-14.03l208.1-208.1c9.352-9.353 14.03-21.61 14.03-33.87C511.1 243.7 507.3 231.5 497.1 222.1zM410.5 252l-96 84c-10.79 9.545-26.53 .9824-26.53-12.03V272H223.1l-.0001 48C223.1 337.6 209.6 352 191.1 352S159.1 337.6 159.1 320V240c0-17.6 14.4-32 32-32h95.1V156c0-13.85 16.39-20.99 26.53-12.03l96 84C414 231 415.1 235.4 415.1 240S414 249 410.5 252z"],dice:[640,512,[127922],"f522","M447.1 224c0-12.56-4.781-25.13-14.35-34.76l-174.9-174.9C249.1 4.786 236.5 0 223.1 0C211.4 0 198.9 4.786 189.2 14.35L14.35 189.2C4.783 198.9-.0011 211.4-.0011 223.1c0 12.56 4.785 25.17 14.35 34.8l174.9 174.9c9.625 9.562 22.19 14.35 34.75 14.35s25.13-4.783 34.75-14.35l174.9-174.9C443.2 249.1 447.1 236.6 447.1 224zM96 248c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1S120 210.8 120 224S109.3 248 96 248zM224 376c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1s23.1 10.75 23.1 23.1S237.3 376 224 376zM224 248c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1S248 210.8 248 224S237.3 248 224 248zM224 120c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1s23.1 10.75 23.1 23.1S237.3 120 224 120zM352 248c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1s23.1 10.75 23.1 23.1S365.3 248 352 248zM591.1 192l-118.7 0c4.418 10.27 6.604 21.25 6.604 32.23c0 20.7-7.865 41.38-23.63 57.14l-136.2 136.2v46.37C320 490.5 341.5 512 368 512h223.1c26.5 0 47.1-21.5 47.1-47.1V240C639.1 213.5 618.5 192 591.1 192zM479.1 376c-13.25 0-23.1-10.75-23.1-23.1s10.75-23.1 23.1-23.1s23.1 10.75 23.1 23.1S493.2 376 479.1 376z"],"dice-d20":[512,512,[],"f6cf","M20.04 317.3C18 317.3 16 315.8 16 313.3V150.5c0-2.351 1.91-4.012 4.001-4.012c.6882 0 1.396 .18 2.062 .5748l76.62 45.1l-75.28 122.3C22.59 316.8 21.31 317.3 20.04 317.3zM231.4 405.2l-208.2-22.06c-4.27-.4821-7.123-4.117-7.123-7.995c0-1.401 .3725-2.834 1.185-4.161L122.7 215.1L231.4 405.2zM31.1 420.1c0-2.039 1.508-4.068 3.93-4.068c.1654 0 .3351 .0095 .5089 .0291l203.6 22.31v65.66C239.1 508.6 236.2 512 232 512c-1.113 0-2.255-.2387-3.363-.7565L34.25 423.6C32.69 422.8 31.1 421.4 31.1 420.1zM33.94 117.1c-1.289-.7641-1.938-2.088-1.938-3.417c0-1.281 .6019-2.567 1.813-3.364l150.8-98.59C185.1 10.98 187.3 10.64 188.6 10.64c4.32 0 8.003 3.721 8.003 8.022c0 1.379-.3788 2.818-1.237 4.214L115.5 165.8L33.94 117.1zM146.8 175.1l95.59-168.4C245.5 2.53 250.7 0 255.1 0s10.5 2.53 13.62 7.624l95.59 168.4H146.8zM356.4 207.1l-100.4 175.7L155.6 207.1H356.4zM476.1 415.1c2.422 0 3.93 2.029 3.93 4.068c0 1.378-.6893 2.761-2.252 3.524l-194.4 87.66c-1.103 .5092-2.241 .7443-3.35 .7443c-4.2 0-7.994-3.371-7.994-7.994v-65.69l203.6-22.28C475.7 416 475.9 415.1 476.1 415.1zM494.8 370.9C495.6 372.3 496 373.7 496 375.1c0 3.872-2.841 7.499-7.128 7.98l-208.2 22.06l108.6-190.1L494.8 370.9zM316.6 22.87c-.8581-1.395-1.237-2.834-1.237-4.214c0-4.301 3.683-8.022 8.003-8.022c1.308 0 2.675 .3411 4.015 1.11l150.8 98.59c1.211 .7973 1.813 2.076 1.813 3.353c0 1.325-.6488 2.649-1.938 3.429L396.5 165.8L316.6 22.87zM491.1 146.5c2.091 0 4.001 1.661 4.001 4.012v162.8c0 2.483-2.016 4.006-4.053 4.006c-1.27 0-2.549-.5919-3.353-1.912l-75.28-122.3l76.62-45.1C490.6 146.7 491.3 146.5 491.1 146.5z"],"dice-d6":[448,512,[],"f6d1","M7.994 153.5c1.326 0 2.687 .3508 3.975 1.119L208 271.5v223.8c0 9.741-7.656 16.71-16.01 16.71c-2.688 0-5.449-.7212-8.05-2.303l-152.2-92.47C12.13 405.3 0 383.3 0 359.5v-197.7C0 156.1 3.817 153.5 7.994 153.5zM426.2 117.2c0 2.825-1.352 5.647-4.051 7.248L224 242.6L25.88 124.4C23.19 122.8 21.85 119.1 21.85 117.2c0-2.8 1.32-5.603 3.965-7.221l165.1-100.9C201.7 3.023 212.9 0 224 0s22.27 3.023 32.22 9.07l165.1 100.9C424.8 111.6 426.2 114.4 426.2 117.2zM440 153.5C444.2 153.5 448 156.1 448 161.8v197.7c0 23.75-12.12 45.75-31.78 57.69l-152.2 92.5C261.5 511.3 258.7 512 256 512C247.7 512 240 505 240 495.3V271.5l196-116.9C437.3 153.8 438.7 153.5 440 153.5z"],"dice-five":[448,512,[9860],"f523","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM128 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S145.6 384 128 384zM128 192C110.4 192 96 177.6 96 160s14.38-32 32-32s32 14.38 32 32S145.6 192 128 192zM224 288C206.4 288 192 273.6 192 256s14.38-32 32-32s32 14.38 32 32S241.6 288 224 288zM320 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 384 320 384zM320 192c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 192 320 192z"],"dice-four":[448,512,[9859],"f524","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM128 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S145.6 384 128 384zM128 192C110.4 192 96 177.6 96 160s14.38-32 32-32s32 14.38 32 32S145.6 192 128 192zM320 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 384 320 384zM320 192c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 192 320 192z"],"dice-one":[448,512,[9856],"f525","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM224 288C206.4 288 192 273.6 192 256s14.38-32 32-32s32 14.38 32 32S241.6 288 224 288z"],"dice-six":[448,512,[9861],"f526","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM128 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S145.6 384 128 384zM128 288C110.4 288 96 273.6 96 256s14.38-32 32-32s32 14.38 32 32S145.6 288 128 288zM128 192C110.4 192 96 177.6 96 160s14.38-32 32-32s32 14.38 32 32S145.6 192 128 192zM320 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 384 320 384zM320 288c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 288 320 288zM320 192c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 192 320 192z"],"dice-three":[448,512,[9858],"f527","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM128 192C110.4 192 96 177.6 96 160s14.38-32 32-32s32 14.38 32 32S145.6 192 128 192zM224 288C206.4 288 192 273.6 192 256s14.38-32 32-32s32 14.38 32 32S241.6 288 224 288zM320 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 384 320 384z"],"dice-two":[448,512,[9857],"f528","M384 32H64C28.62 32 0 60.62 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.62 419.4 32 384 32zM128 192C110.4 192 96 177.6 96 160s14.38-32 32-32s32 14.38 32 32S145.6 192 128 192zM320 384c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 384 320 384z"],disease:[512,512,[],"f7fa","M472.2 195.9l-66.1-22.1c-19.25-6.624-33.5-20.87-38.13-38.24l-16-60.49c-11.62-43.74-76.63-57.11-110-22.62L194.1 99.3c-13.25 13.75-33.5 20.87-54.25 19.25L68.86 112.9c-52-3.999-86.88 44.99-59 82.86l38.63 52.49c11 14.1 12.75 33.74 4.625 50.12l-28.5 56.99c-20.62 41.24 22.88 84.86 73.5 73.86l69.1-15.25c20.12-4.499 41.38 .0001 57 11.62l54.38 40.87c39.38 29.62 101 7.623 104.5-37.24l4.625-61.86c1.375-17.75 12.88-33.87 30.62-42.99l61.1-31.62C526.1 269.8 520.9 212.5 472.2 195.9zM159.1 256c-17.62 0-31.1-14.37-31.1-31.1s14.37-31.1 31.1-31.1s31.1 14.37 31.1 31.1S177.6 256 159.1 256zM287.1 351.1c-17.62 0-31.1-14.37-31.1-31.1c0-17.62 14.37-31.1 31.1-31.1s31.1 14.37 31.1 31.1C319.1 337.6 305.6 351.1 287.1 351.1zM303.1 224c-8.875 0-15.1-7.125-15.1-15.1c0-8.873 7.125-15.1 15.1-15.1s15.1 7.125 15.1 15.1C319.1 216.9 312.9 224 303.1 224z"],display:[576,512,[],"e163","M528 0h-480C21.5 0 0 21.5 0 48v320C0 394.5 21.5 416 48 416h192L224 464H152C138.8 464 128 474.8 128 488S138.8 512 152 512h272c13.25 0 24-10.75 24-24s-10.75-24-24-24H352L336 416h192c26.5 0 48-21.5 48-48v-320C576 21.5 554.5 0 528 0zM512 352H64V64h448V352z"],divide:[448,512,[10135,247],"f529","M400 224h-352c-17.69 0-32 14.31-32 31.1s14.31 32 32 32h352c17.69 0 32-14.31 32-32S417.7 224 400 224zM224 144c26.47 0 48-21.53 48-48s-21.53-48-48-48s-48 21.53-48 48S197.5 144 224 144zM224 368c-26.47 0-48 21.53-48 48s21.53 48 48 48s48-21.53 48-48S250.5 368 224 368z"],dna:[448,512,[129516],"f471","M.1193 494.1c-1.125 9.5 6.312 17.87 15.94 17.87l32.06 .0635c8.125 0 15.21-5.833 16.21-13.83c.7501-4.875 1.869-11.17 3.494-18.17h312c1.625 6.875 2.904 13.31 3.529 18.18c1.125 7.1 7.84 13.94 15.97 13.82l32.46-.0625c9.625 0 17.12-8.374 15.99-17.87c-4.625-37.87-25.75-128.1-119.1-207.7c-17.5 12.37-36.98 24.37-58.48 35.49c6.25 4.625 11.56 9.405 17.06 14.15H159.7c21.25-18.12 47.03-35.63 78.65-51.38c172.1-85.5 203.7-218.8 209.5-266.7c1.125-9.5-6.297-17.88-15.92-17.88L399.6 .001c-8.125 0-14.84 5.832-15.96 13.83c-.7501 4.875-1.869 11.17-3.369 18.17H67.74C66.24 25 65.08 18.81 64.33 13.81C63.21 5.813 56.48-.124 48.36 .001L16.1 .1338c-9.625 0-17.09 8.354-15.96 17.85c5.125 42.87 31.29 153.8 159.9 238.1C31.55 340.3 5.245 451.2 .1193 494.1zM223.9 219.7C198.8 205.9 177.6 191.3 159.7 176h128.5C270.4 191.3 249 206.1 223.9 219.7zM355.1 96c-5.875 10.37-12.88 21.12-21 31.1H113.1c-8.25-10.87-15.3-21.63-21.05-32L355.1 96zM93 415.1c5.875-10.37 12.74-21.13 20.87-32h219.4c8.375 10.87 15.48 21.63 21.23 32H93z"],dog:[576,512,[128021],"f6d3","M332.7 19.85C334.6 8.395 344.5 0 356.1 0C363.6 0 370.6 3.52 375.1 9.502L392 32H444.1C456.8 32 469.1 37.06 478.1 46.06L496 64H552C565.3 64 576 74.75 576 88V112C576 156.2 540.2 192 496 192H426.7L421.6 222.5L309.6 158.5L332.7 19.85zM448 64C439.2 64 432 71.16 432 80C432 88.84 439.2 96 448 96C456.8 96 464 88.84 464 80C464 71.16 456.8 64 448 64zM416 256.1V480C416 497.7 401.7 512 384 512H352C334.3 512 320 497.7 320 480V364.8C295.1 377.1 268.8 384 240 384C211.2 384 184 377.1 160 364.8V480C160 497.7 145.7 512 128 512H96C78.33 512 64 497.7 64 480V249.8C35.23 238.9 12.64 214.5 4.836 183.3L.9558 167.8C-3.331 150.6 7.094 133.2 24.24 128.1C41.38 124.7 58.76 135.1 63.05 152.2L66.93 167.8C70.49 182 83.29 191.1 97.97 191.1H303.8L416 256.1z"],"dollar-sign":[320,512,[128178,61781,"dollar","usd"],"24","M160 0C177.7 0 192 14.33 192 32V67.68C193.6 67.89 195.1 68.12 196.7 68.35C207.3 69.93 238.9 75.02 251.9 78.31C268.1 82.65 279.4 100.1 275 117.2C270.7 134.3 253.3 144.7 236.1 140.4C226.8 137.1 198.5 133.3 187.3 131.7C155.2 126.9 127.7 129.3 108.8 136.5C90.52 143.5 82.93 153.4 80.92 164.5C78.98 175.2 80.45 181.3 82.21 185.1C84.1 189.1 87.79 193.6 95.14 198.5C111.4 209.2 136.2 216.4 168.4 225.1L171.2 225.9C199.6 233.6 234.4 243.1 260.2 260.2C274.3 269.6 287.6 282.3 295.8 299.9C304.1 317.7 305.9 337.7 302.1 358.1C295.1 397 268.1 422.4 236.4 435.6C222.8 441.2 207.8 444.8 192 446.6V480C192 497.7 177.7 512 160 512C142.3 512 128 497.7 128 480V445.1C127.6 445.1 127.1 444.1 126.7 444.9L126.5 444.9C102.2 441.1 62.07 430.6 35 418.6C18.85 411.4 11.58 392.5 18.76 376.3C25.94 360.2 44.85 352.9 60.1 360.1C81.9 369.4 116.3 378.5 136.2 381.6C168.2 386.4 194.5 383.6 212.3 376.4C229.2 369.5 236.9 359.5 239.1 347.5C241 336.8 239.6 330.7 237.8 326.9C235.9 322.9 232.2 318.4 224.9 313.5C208.6 302.8 183.8 295.6 151.6 286.9L148.8 286.1C120.4 278.4 85.58 268.9 59.76 251.8C45.65 242.4 32.43 229.7 24.22 212.1C15.89 194.3 14.08 174.3 17.95 153C25.03 114.1 53.05 89.29 85.96 76.73C98.98 71.76 113.1 68.49 128 66.73V32C128 14.33 142.3 0 160 0V0z"],dolly:[576,512,["dolly-box"],"f472","M294.2 277.8c17.1 5 34.62 13.38 49.5 24.62l161.5-53.75c8.375-2.875 12.88-11.88 10-20.25L454.8 47.25c-2.748-8.502-11.88-13-20.12-10.12l-61.13 20.37l33.12 99.38l-60.75 20.13l-33.12-99.38L251.2 98.13c-8.373 2.75-12.87 11.88-9.998 20.12L294.2 277.8zM574.4 309.9c-5.594-16.75-23.67-25.91-40.48-20.23l-202.5 67.51c-17.22-22.01-43.57-36.41-73.54-36.97L165.7 43.75C156.9 17.58 132.5 0 104.9 0H32C14.33 0 0 14.33 0 32s14.33 32 32 32h72.94l92.22 276.7C174.7 358.2 160 385.3 160 416c0 53.02 42.98 96 96 96c52.4 0 94.84-42.03 95.82-94.2l202.3-67.44C570.9 344.8 579.1 326.6 574.4 309.9zM256 448c-17.67 0-32-14.33-32-32c0-17.67 14.33-31.1 32-31.1S288 398.3 288 416C288 433.7 273.7 448 256 448z"],"dong-sign":[384,512,[],"e169","M320 64C337.7 64 352 78.33 352 96C352 113.7 337.7 128 320 128V384C320 401.7 305.7 416 288 416C275 416 263.9 408.3 258.8 397.2C239.4 409.1 216.5 416 192 416C121.3 416 64 358.7 64 288C64 217.3 121.3 160 192 160C215.3 160 237.2 166.2 256 177.1V128H224C206.3 128 192 113.7 192 96C192 78.33 206.3 64 224 64H256C256 46.33 270.3 32 288 32C305.7 32 320 46.33 320 64V64zM256 288C256 252.7 227.3 224 192 224C156.7 224 128 252.7 128 288C128 323.3 156.7 352 192 352C227.3 352 256 323.3 256 288zM352 448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H352z"],"door-closed":[576,512,[128682],"f52a","M560 448H480V50.75C480 22.75 458.5 0 432 0h-288C117.5 0 96 22.75 96 50.75V448H16C7.125 448 0 455.1 0 464v32C0 504.9 7.125 512 16 512h544c8.875 0 16-7.125 16-16v-32C576 455.1 568.9 448 560 448zM384 288c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S401.6 288 384 288z"],"door-open":[576,512,[],"f52b","M560 448H512V113.5c0-27.25-21.5-49.5-48-49.5L352 64.01V128h96V512h112c8.875 0 16-7.125 16-15.1v-31.1C576 455.1 568.9 448 560 448zM280.3 1.007l-192 49.75C73.1 54.51 64 67.76 64 82.88V448H16c-8.875 0-16 7.125-16 15.1v31.1C0 504.9 7.125 512 16 512H320V33.13C320 11.63 300.5-4.243 280.3 1.007zM232 288c-13.25 0-24-14.37-24-31.1c0-17.62 10.75-31.1 24-31.1S256 238.4 256 256C256 273.6 245.3 288 232 288z"],dove:[512,512,[128330],"f4ba","M288 167.2V139.1c-28.25-36.38-47.13-79.29-54.13-125.2C231.7 .4054 214.8-5.02 206.1 5.481C184.1 30.36 168.4 59.7 157.2 92.07C191.4 130.3 237.2 156.7 288 167.2zM400 63.97c-44.25 0-79.1 35.82-79.1 80.08l.0014 59.44c-104.4-6.251-193-70.46-233-161.7C81.48 29.25 63.76 28.58 58.01 40.83C41.38 75.96 32.01 115.2 32.01 156.6c0 70.76 34.11 136.9 85.11 185.9c13.12 12.75 26.13 23.27 38.88 32.77L12.12 411.2c-10.75 2.75-15.5 15.09-9.5 24.47c17.38 26.88 60.42 72.54 153.2 76.29c8 .25 15.99-2.633 22.12-7.883l65.23-56.12l76.84 .0561c88.38 0 160-71.49 160-159.9l.0013-160.2l31.1-63.99L400 63.97zM400 160.1c-8.75 0-16.01-7.259-16.01-16.01c0-8.876 7.261-16.05 16.01-16.05s15.99 7.136 15.99 16.01C416 152.8 408.8 160.1 400 160.1z"],"down-left-and-up-right-to-center":[512,512,["compress-alt"],"f422","M215.1 272h-136c-12.94 0-24.63 7.797-29.56 19.75C45.47 303.7 48.22 317.5 57.37 326.6l30.06 30.06l-78.06 78.07c-12.5 12.5-12.5 32.75-.0012 45.25l22.62 22.62c12.5 12.5 32.76 12.5 45.26 .0013l78.06-78.07l30.06 30.06c6.125 6.125 14.31 9.367 22.63 9.367c4.125 0 8.279-.7891 12.25-2.43c11.97-4.953 19.75-16.62 19.75-29.56V296C239.1 282.7 229.3 272 215.1 272zM296 240h136c12.94 0 24.63-7.797 29.56-19.75c4.969-11.97 2.219-25.72-6.938-34.87l-30.06-30.06l78.06-78.07c12.5-12.5 12.5-32.76 .0002-45.26l-22.62-22.62c-12.5-12.5-32.76-12.5-45.26-.0003l-78.06 78.07l-30.06-30.06c-9.156-9.141-22.87-11.84-34.87-6.937c-11.97 4.953-19.75 16.62-19.75 29.56v135.1C272 229.3 282.7 240 296 240z"],"down-long":[320,512,["long-arrow-alt-down"],"f309","M281.6 392.3l-104 112.1c-9.498 10.24-25.69 10.24-35.19 0l-104-112.1c-6.484-6.992-8.219-17.18-4.404-25.94c3.811-8.758 12.45-14.42 21.1-14.42H128V32c0-17.69 14.33-32 32-32S192 14.31 192 32v319.9h72c9.547 0 18.19 5.66 22 14.42C289.8 375.1 288.1 385.3 281.6 392.3z"],download:[512,512,[],"f019","M480 352h-133.5l-45.25 45.25C289.2 409.3 273.1 416 256 416s-33.16-6.656-45.25-18.75L165.5 352H32c-17.67 0-32 14.33-32 32v96c0 17.67 14.33 32 32 32h448c17.67 0 32-14.33 32-32v-96C512 366.3 497.7 352 480 352zM432 456c-13.2 0-24-10.8-24-24c0-13.2 10.8-24 24-24s24 10.8 24 24C456 445.2 445.2 456 432 456zM233.4 374.6C239.6 380.9 247.8 384 256 384s16.38-3.125 22.62-9.375l128-128c12.49-12.5 12.49-32.75 0-45.25c-12.5-12.5-32.76-12.5-45.25 0L288 274.8V32c0-17.67-14.33-32-32-32C238.3 0 224 14.33 224 32v242.8L150.6 201.4c-12.49-12.5-32.75-12.5-45.25 0c-12.49 12.5-12.49 32.75 0 45.25L233.4 374.6z"],dragon:[640,512,[128009],"f6d5","M18.43 255.8L192 224L100.8 292.6C90.67 302.8 97.8 320 112 320h222.7c-9.499-26.5-14.75-54.5-14.75-83.38V194.2L200.3 106.8C176.5 90.88 145 92.75 123.3 111.2l-117.5 116.4C-6.562 238 2.436 258 18.43 255.8zM575.2 289.9l-100.7-50.25c-16.25-8.125-26.5-24.75-26.5-43V160h63.99l28.12 22.62C546.1 188.6 554.2 192 562.7 192h30.1c11.1 0 23.12-6.875 28.5-17.75l14.37-28.62c5.374-10.87 4.25-23.75-2.999-33.5l-74.49-99.37C552.1 4.75 543.5 0 533.5 0H296C288.9 0 285.4 8.625 290.4 13.62L351.1 64L292.4 88.75c-5.874 3-5.874 11.37 0 14.37L351.1 128l-.0011 108.6c0 72 35.99 139.4 95.99 179.4c-195.6 6.75-344.4 41-434.1 60.88c-8.124 1.75-13.87 9-13.87 17.38C.0463 504 8.045 512 17.79 512h499.1c63.24 0 119.6-47.5 122.1-110.8C642.3 354 617.1 310.9 575.2 289.9zM489.1 66.25l45.74 11.38c-2.75 11-12.5 18.88-24.12 18.25C497.7 95.25 484.8 83.38 489.1 66.25z"],"draw-polygon":[448,512,[],"f5ee","M384.3 352C419.5 352.2 448 380.7 448 416C448 451.3 419.3 480 384 480C360.3 480 339.6 467.1 328.6 448H119.4C108.4 467.1 87.69 480 64 480C28.65 480 0 451.3 0 416C0 392.3 12.87 371.6 32 360.6V151.4C12.87 140.4 0 119.7 0 96C0 60.65 28.65 32 64 32C87.69 32 108.4 44.87 119.4 64H328.6C339.6 44.87 360.3 32 384 32C419.3 32 448 60.65 448 96C448 131.3 419.5 159.8 384.3 159.1L345.5 227.9C349.7 236.4 352 245.9 352 256C352 266.1 349.7 275.6 345.5 284.1L384.3 352zM96 360.6C105.7 366.2 113.8 374.3 119.4 384H328.6C328.6 383.9 328.7 383.8 328.7 383.7L292.2 319.9C290.8 319.1 289.4 320 288 320C252.7 320 224 291.3 224 256C224 220.7 252.7 192 288 192C289.4 192 290.8 192 292.2 192.1L328.7 128.3L328.6 128H119.4C113.8 137.7 105.7 145.8 96 151.4L96 360.6z"],droplet:[384,512,[128167,"tint"],"f043","M16 319.1C16 245.9 118.3 89.43 166.9 19.3C179.2 1.585 204.8 1.585 217.1 19.3C265.7 89.43 368 245.9 368 319.1C368 417.2 289.2 496 192 496C94.8 496 16 417.2 16 319.1zM112 319.1C112 311.2 104.8 303.1 96 303.1C87.16 303.1 80 311.2 80 319.1C80 381.9 130.1 432 192 432C200.8 432 208 424.8 208 416C208 407.2 200.8 400 192 400C147.8 400 112 364.2 112 319.1z"],"droplet-slash":[640,512,["tint-slash"],"f5c7","M215.3 143.4C243.5 95.07 274.2 49.29 294.9 19.3C307.2 1.585 332.8 1.585 345.1 19.3C393.7 89.43 496 245.9 496 319.1C496 333.7 494.4 347.1 491.5 359.9L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L215.3 143.4zM143.1 319.1C143.1 296.5 154.3 264.6 169.1 229.9L443.5 445.4C411.7 476.7 368.1 496 319.1 496C222.8 496 143.1 417.2 143.1 319.1V319.1zM239.1 319.1C239.1 311.2 232.8 303.1 223.1 303.1C215.2 303.1 207.1 311.2 207.1 319.1C207.1 381.9 258.1 432 319.1 432C328.8 432 336 424.8 336 416C336 407.2 328.8 400 319.1 400C275.8 400 239.1 364.2 239.1 319.1V319.1z"],drum:[512,512,[129345],"f569","M431.1 122l70.02-45.91c11.09-7.273 14.19-22.14 6.906-33.25c-7.219-11.07-22.09-14.23-33.22-6.924l-106.4 69.73c-49.81-8.787-97.18-9.669-112.4-9.669c-.002 0 .002 0 0 0C219.5 96 0 100.6 0 208.3v160.1c0 30.27 27.5 57.68 71.1 77.85v-101.9c0-13.27 10.75-24.03 24-24.03s23.1 10.76 23.1 24.03v118.9C153 472.4 191.1 478.3 231.1 480v-103.6c0-13.27 10.75-24.03 24-24.03c.002 0-.002 0 0 0c13.25 0 24 10.76 24 24.03V480c40.93-1.668 78.95-7.615 111.1-16.72v-118.9c0-13.27 10.75-24.03 24-24.03s24 10.76 24 24.03v101.9c44.49-20.17 71.1-47.58 71.1-77.85V208.3C511.1 164.9 476.1 138.4 431.1 122zM255.1 272.5C255.1 272.5 255.1 272.5 255.1 272.5c-114.9 0-207.1-28.97-207.1-64.39s93.12-63.1 207.1-63.1c.002 0-.002 0 0 0c17.5 0 34.47 .7139 50.71 1.966L242.8 187.1c-11.09 7.273-14.19 22.14-6.906 33.25C240.5 228.3 248.2 232.1 256 232.1c4.5 0 9.062-1.265 13.12-3.923l109.3-71.67c51.77 11.65 85.5 30.38 85.5 51.67C463.1 243.6 370.9 272.5 255.1 272.5z"],"drum-steelpan":[576,512,[],"f56a","M288 32C129 32 0 89.25 0 160v192c0 70.75 129 128 288 128s288-57.25 288-128V160C576 89.25 447 32 288 32zM205 190.4c-4.5 16.62-14.5 30.5-28.25 40.5C100.2 217.5 48 190.8 48 160c0-30.12 50.12-56.38 124-69.1l25.62 44.25C207.5 151.4 210.1 171.2 205 190.4zM288 240c-21.12 0-41.38-.1-60.88-2.75C235.1 211.1 259.2 192 288 192s52.88 19.12 60.88 45.25C329.4 239 309.1 240 288 240zM352 96c0 35.25-28.75 64-64 64S224 131.2 224 96V83C244.4 81.12 265.8 80 288 80s43.63 1.125 64 3V96zM398.9 230.9c-13.75-9.875-23.88-23.88-28.38-40.5c-5.125-19.13-2.5-39 7.375-56l25.62-44.5C477.8 103.5 528 129.8 528 160C528 190.9 475.6 217.5 398.9 230.9z"],"drumstick-bite":[512,512,[],"f6d7","M512 168.9c0 1.766-.0229 3.398-.0768 5.164c-16.91-9.132-35.51-13.76-53.96-13.76c-82.65 0-105.5 74.17-105.5 105.4c0 27.04 9.923 54.43 29.63 76.25c-19.52 6.629-39.99 9.997-60.62 9.997l-87.18 .0038l-40.59 40.49c-6.104 6.103-8.921 14.01-8.921 22.17c0 13.98 7.244 17.1 7.244 37.03C192.1 485.4 164.6 512 131.7 512c-15.63 0-31.11-6.055-42.72-17.8c-11.55-11.46-16.82-26.31-16.82-41.26c0-4.948 .575-9.903 1.695-14.75c-4.842 1.11-9.793 1.681-14.72 1.681c-42.15 0-59.13-36.64-59.13-59.5c0-33.43 27.15-60.34 60.39-60.34c18.97 0 22.97 7.219 36.96 7.219c8.159 0 16.04-2.811 22.14-8.914l40.57-40.47L160.1 191.1c0-63.1 27.79-107 63.17-142.4c33.13-33.06 76.39-49.59 119.7-49.59s86.79 16.53 119.9 49.59C495.9 82.5 512 125.7 512 168.9z"],dumbbell:[640,512,[],"f44b","M104 96h-48C42.75 96 32 106.8 32 120V224C14.33 224 0 238.3 0 256c0 17.67 14.33 32 31.1 32L32 392C32 405.3 42.75 416 56 416h48C117.3 416 128 405.3 128 392v-272C128 106.8 117.3 96 104 96zM456 32h-48C394.8 32 384 42.75 384 56V224H256V56C256 42.75 245.3 32 232 32h-48C170.8 32 160 42.75 160 56v400C160 469.3 170.8 480 184 480h48C245.3 480 256 469.3 256 456V288h128v168c0 13.25 10.75 24 24 24h48c13.25 0 24-10.75 24-24V56C480 42.75 469.3 32 456 32zM608 224V120C608 106.8 597.3 96 584 96h-48C522.8 96 512 106.8 512 120v272c0 13.25 10.75 24 24 24h48c13.25 0 24-10.75 24-24V288c17.67 0 32-14.33 32-32C640 238.3 625.7 224 608 224z"],dumpster:[576,512,[],"f793","M560 160c10.38 0 17.1-9.75 15.5-19.88l-24-95.1C549.8 37 543.3 32 536 32h-98.88l25.62 128H560zM272 32H171.5L145.9 160H272V32zM404.5 32H304v128h126.1L404.5 32zM16 160h97.25l25.63-128H40C32.75 32 26.25 37 24.5 44.12l-24 95.1C-2.001 150.2 5.625 160 16 160zM560 224h-20L544 192H32l4 32H16C7.25 224 0 231.2 0 240v32C0 280.8 7.25 288 16 288h28L64 448v16C64 472.8 71.25 480 80 480h32C120.8 480 128 472.8 128 464V448h320v16c0 8.75 7.25 16 16 16h32c8.75 0 16-7.25 16-16V448l20-160H560C568.8 288 576 280.8 576 272v-32C576 231.2 568.8 224 560 224z"],"dumpster-fire":[640,512,[],"f794","M418.8 104.2L404.6 32H304.1L304 159.1h60.77C381.1 140.7 399.1 121.8 418.8 104.2zM272.1 32.12H171.5L145.9 160.1h126.1L272.1 32.12zM461.3 104.2c18.25 16.25 35.51 33.62 51.14 51.49c5.751-5.623 11.38-11.12 17.38-16.37l21.26-18.98l21.25 18.98c1.125 .9997 2.125 2.124 3.126 3.124c-.125-.7498 .2501-1.5 0-2.249l-24-95.97c-1.625-7.123-8.127-12.12-15.38-12.12H437.2l12.25 61.5L461.3 104.2zM16 160.1l97.26-.0223l25.64-127.9h-98.89c-7.251 0-13.75 4.999-15.5 12.12L.5001 140.2C-2.001 150.3 5.626 160.1 16 160.1zM340.6 192.1L32.01 192.1l4.001 31.99L16 224.1C7.252 224.1 0 231.3 0 240.1V272c0 8.748 7.251 15.1 16 15.1l28.01 .0177l20 159.1L64.01 464C64.01 472.8 71.26 480 80.01 480h32.01c8.752 0 16-7.248 16-15.1v-15.1l208.8-.002c-30.13-33.74-48.73-77.85-48.73-126.3C288.1 285.8 307.9 238.8 340.6 192.1zM551.2 163.3c-14.88 13.25-28.38 27.12-40.26 41.12c-19.5-25.74-43.63-51.99-71.01-76.36c-70.14 62.73-120 144.2-120 193.6C319.1 409.1 391.6 480 479.1 480s160-70.87 160-158.3C640.1 285 602.1 209.4 551.2 163.3zM532.6 392.6c-14.75 10.62-32.88 16.1-52.51 16.1c-49.01 0-88.89-33.49-88.89-87.98c0-27.12 16.5-50.99 49.38-91.85c4.751 5.498 67.14 87.98 67.14 87.98l39.76-46.99c2.876 4.874 5.375 9.497 7.75 13.1C573.9 321.5 565.1 368.4 532.6 392.6z"],dungeon:[512,512,[],"f6d9","M336.6 156.5C327.3 148.1 322.6 136.5 327.1 125.3L357.6 49.18C362.7 36.27 377.8 30.36 389.7 37.63C410.9 50.63 430 66.62 446.5 85.02C455.7 95.21 452.9 110.9 441.5 118.5L373.9 163.5C363.6 170.4 349.8 168.1 340.5 159.9C339.2 158.7 337.9 157.6 336.6 156.5H336.6zM297.7 112.6C293.2 123.1 280.9 129.8 268.7 128.6C264.6 128.2 260.3 128 256 128C251.7 128 247.4 128.2 243.3 128.6C231.1 129.8 218.8 123.1 214.3 112.6L183.1 36.82C178.8 24.02 185.5 9.433 198.1 6.374C217.3 2.203 236.4 0 256 0C275.6 0 294.7 2.203 313 6.374C326.5 9.433 333.2 24.02 328 36.82L297.7 112.6zM122.3 37.63C134.2 30.36 149.3 36.27 154.4 49.18L184.9 125.3C189.4 136.5 184.7 148.1 175.4 156.5C174.1 157.6 172.8 158.7 171.5 159.9C162.2 168.1 148.4 170.4 138.1 163.5L70.52 118.5C59.13 110.9 56.32 95.21 65.46 85.02C81.99 66.62 101.1 50.63 122.3 37.63H122.3zM379.5 222.1C376.3 210.7 379.7 198.1 389.5 191.6L458.1 145.8C469.7 138.1 485.6 141.9 491.2 154.7C501.6 178.8 508.4 204.8 510.9 232C512.1 245.2 501.3 255.1 488 255.1H408C394.7 255.1 384.2 245.2 381.8 232.1C381.1 228.7 380.4 225.4 379.5 222.1V222.1zM122.5 191.6C132.3 198.1 135.7 210.7 132.5 222.1C131.6 225.4 130.9 228.7 130.2 232.1C127.8 245.2 117.3 256 104 256H24C10.75 256-.1184 245.2 1.107 232C3.636 204.8 10.43 178.8 20.82 154.7C26.36 141.9 42.26 138.1 53.91 145.8L122.5 191.6zM104 288C117.3 288 128 298.7 128 312V360C128 373.3 117.3 384 104 384H24C10.75 384 0 373.3 0 360V312C0 298.7 10.75 288 24 288H104zM488 288C501.3 288 512 298.7 512 312V360C512 373.3 501.3 384 488 384H408C394.7 384 384 373.3 384 360V312C384 298.7 394.7 288 408 288H488zM104 416C117.3 416 128 426.7 128 440V488C128 501.3 117.3 512 104 512H24C10.75 512 0 501.3 0 488V440C0 426.7 10.75 416 24 416H104zM488 416C501.3 416 512 426.7 512 440V488C512 501.3 501.3 512 488 512H408C394.7 512 384 501.3 384 488V440C384 426.7 394.7 416 408 416H488zM272 464C272 472.8 264.8 480 256 480C247.2 480 240 472.8 240 464V192C240 183.2 247.2 176 256 176C264.8 176 272 183.2 272 192V464zM208 464C208 472.8 200.8 480 192 480C183.2 480 176 472.8 176 464V224C176 215.2 183.2 208 192 208C200.8 208 208 215.2 208 224V464zM336 464C336 472.8 328.8 480 320 480C311.2 480 304 472.8 304 464V224C304 215.2 311.2 208 320 208C328.8 208 336 215.2 336 224V464z"],e:[320,512,[101],"45","M320 448c0 17.67-14.33 32-32 32H32c-17.67 0-32-14.33-32-32v-384C0 46.34 14.33 32.01 32 32.01h256c17.67 0 32 14.33 32 32s-14.33 32-32 32H64v128h160c17.67 0 32 14.32 32 31.99s-14.33 32.01-32 32.01H64v128h224C305.7 416 320 430.3 320 448z"],"ear-deaf":[512,512,["deaf","deafness","hard-of-hearing"],"f2a4","M192 319.1C185.8 313.7 177.6 310.6 169.4 310.6S153 313.7 146.8 319.1l-137.4 137.4C3.124 463.6 0 471.8 0 480c0 18.3 14.96 31.1 31.1 31.1c8.188 0 16.38-3.124 22.62-9.371l137.4-137.4c6.247-6.247 9.371-14.44 9.371-22.62S198.3 326.2 192 319.1zM200 240c0-22.06 17.94-40 40-40s40 17.94 40 40c0 13.25 10.75 24 24 24s24-10.75 24-24c0-48.53-39.47-88-88-88S152 191.5 152 240c0 13.25 10.75 24 24 24S200 253.3 200 240zM511.1 31.1c0-8.188-3.124-16.38-9.371-22.62s-14.44-9.372-22.63-9.372s-16.38 3.124-22.62 9.372L416 50.75c-6.248 6.248-9.372 14.44-9.372 22.63c0 8.188 3.123 16.38 9.37 22.62c6.247 6.248 14.44 9.372 22.63 9.372s16.38-3.124 22.63-9.372l41.38-41.38C508.9 48.37 511.1 40.18 511.1 31.1zM415.1 241.6c0-57.78-42.91-177.6-175.1-177.6c-153.6 0-175.2 150.8-175.2 160.4c0 17.32 14.99 31.58 32.75 31.58c16.61 0 29.25-13.07 31.24-29.55c6.711-55.39 54.02-98.45 111.2-98.45c80.45 0 111.2 75.56 111.2 119.6c0 57.94-38.22 98.14-46.37 106.3L288 370.7v13.25c0 31.4-22.71 57.58-52.58 62.98C220.4 449.7 208 463.3 208 478.6c0 17.95 14.72 32.09 32.03 32.09c4.805 0 100.5-14.34 111.2-112.7C412.6 335.8 415.1 263.4 415.1 241.6z"],"ear-listen":[512,512,["assistive-listening-systems"],"f2a2","M160.1 320c-17.64 0-32.02 14.37-32.02 31.1s14.38 31.1 32.02 31.1s32.02-14.37 32.02-31.1S177.8 320 160.1 320zM86.66 361.4c-12.51-12.49-32.77-12.49-45.27 0c-12.51 12.5-12.51 32.78 0 45.27l63.96 63.99c12.51 12.49 32.77 12.49 45.27 .002c12.51-12.5 12.51-32.78 0-45.27L86.66 361.4zM32.02 448C14.38 448 0 462.4 0 480S14.38 512 32.02 512c17.64 0 32.02-14.37 32.02-31.1S49.66 448 32.02 448zM287.7 70.31c-110.9-29.38-211.7 47.53-222.8 150.9C62.1 239.9 78.73 255.1 97.57 255.1c16.61 0 29.25-13.07 31.24-29.55c6.934-57.22 57.21-101.3 116.9-98.3c71.71 3.594 117.1 76.82 102.5 146.9c-6.551 29.65-21.4 56.87-43.38 78.87L288 370.7v13.25c0 31.4-22.71 57.58-52.58 62.98C220.4 449.7 208 463.3 208 478.6c0 19.78 17.88 34.94 37.38 31.64c55.92-9.443 99.63-55.28 105.9-112.2c40.11-40.68 62.89-93.95 64.65-150.9C418.4 166.4 365.8 91 287.7 70.31zM240 200c22.06 0 40 17.94 40 40c0 13.25 10.75 24 24 24s24-10.75 24-24c0-48.53-39.47-88-88-88S152 191.5 152 240c0 13.25 10.75 24 24 24S200 253.3 200 240C200 217.9 217.9 200 240 200zM397.8 3.125c-15.91-7.594-35.05-.8438-42.66 15.09c-7.594 15.97-.8281 35.06 15.12 42.66C417.5 83.41 448 134.9 448 192c0 17.69 14.33 32 32 32S512 209.7 512 192C512 110.3 467.2 36.19 397.8 3.125z"],"earth-africa":[512,512,[127757,"globe-africa"],"f57c","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM177.8 63.19L187.8 80.62C190.5 85.46 192 90.93 192 96.5V137.9C192 141.8 193.6 145.6 196.3 148.3C202.6 154.6 212.8 153.1 218.3 147.1L231.9 130.1C236.6 124.2 244.8 122.4 251.6 125.8L266.8 133.4C270.2 135.1 273.1 136 277.8 136C284.3 136 290.6 133.4 295.2 128.8L299.1 124.9C302 121.1 306.5 121.2 310.1 123.1L339.4 137.7C347.1 141.6 352 149.5 352 158.1C352 168.6 344.9 177.8 334.7 180.3L299.3 189.2C291.9 191 284.2 190.7 276.1 188.3L244.1 177.7C241.7 176.6 238.2 176 234.8 176C227.8 176 220.1 178.3 215.4 182.5L176 212C165.9 219.6 160 231.4 160 244V272C160 298.5 181.5 320 208 320H240C248.8 320 256 327.2 256 336V384C256 401.7 270.3 416 288 416C298.1 416 307.6 411.3 313.6 403.2L339.2 369.1C347.5 357.1 352 344.5 352 330.7V318.6C352 314.7 354.6 311.3 358.4 310.4L363.7 309.1C375.6 306.1 384 295.4 384 283.1C384 275.1 381.2 269.2 376.2 264.2L342.7 230.7C338.1 226.1 338.1 221 342.7 217.3C348.4 211.6 356.8 209.6 364.5 212.2L378.6 216.9C390.9 220.1 404.3 215.4 410.1 203.8C413.6 196.8 421.3 193.1 428.1 194.6L456.4 200.1C431.1 112.4 351.5 48 256 48C228.3 48 201.1 53.4 177.8 63.19L177.8 63.19z"],"earth-americas":[512,512,[127758,"earth","earth-america","globe-americas"],"f57d","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM57.71 192.1L67.07 209.4C75.36 223.9 88.99 234.6 105.1 239.2L162.1 255.7C180.2 260.6 192 276.3 192 294.2V334.1C192 345.1 198.2 355.1 208 359.1C217.8 364.9 224 374.9 224 385.9V424.9C224 440.5 238.9 451.7 253.9 447.4C270.1 442.8 282.5 429.1 286.6 413.7L289.4 402.5C293.6 385.6 304.6 371.1 319.7 362.4L327.8 357.8C342.8 349.3 352 333.4 352 316.1V307.9C352 295.1 346.9 282.9 337.9 273.9L334.1 270.1C325.1 261.1 312.8 255.1 300.1 255.1H256.1C245.9 255.1 234.9 253.1 225.2 247.6L190.7 227.8C186.4 225.4 183.1 221.4 181.6 216.7C178.4 207.1 182.7 196.7 191.7 192.1L197.7 189.2C204.3 185.9 211.9 185.3 218.1 187.7L242.2 195.4C250.3 198.1 259.3 195 264.1 187.9C268.8 180.8 268.3 171.5 262.9 165L249.3 148.8C239.3 136.8 239.4 119.3 249.6 107.5L265.3 89.12C274.1 78.85 275.5 64.16 268.8 52.42L266.4 48.26C262.1 48.09 259.5 48 256 48C163.1 48 84.4 108.9 57.71 192.1L57.71 192.1zM437.6 154.5L412 164.8C396.3 171.1 388.2 188.5 393.5 204.6L410.4 255.3C413.9 265.7 422.4 273.6 433 276.3L462.2 283.5C463.4 274.5 464 265.3 464 256C464 219.2 454.4 184.6 437.6 154.5H437.6z"],"earth-asia":[512,512,[127759,"globe-asia"],"f57e","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM51.68 295.1L83.41 301.5C91.27 303.1 99.41 300.6 105.1 294.9L120.5 279.5C132 267.1 151.6 271.1 158.9 285.8L168.2 304.3C172.1 313.9 182.8 319.1 193.5 319.1C208.7 319.1 219.6 305.4 215.2 290.8L209.3 270.9C204.6 255.5 216.2 240 232.3 240H234.6C247.1 240 260.5 233.3 267.9 222.2L278.6 206.1C284.2 197.7 283.9 186.6 277.8 178.4L261.7 156.9C251.4 143.2 258.4 123.4 275.1 119.2L292.1 114.1C299.6 113.1 305.7 107.8 308.6 100.6L324.9 59.69C303.4 52.12 280.2 48 255.1 48C141.1 48 47.1 141.1 47.1 256C47.1 269.4 49.26 282.5 51.68 295.1L51.68 295.1zM450.4 300.4L434.6 304.9C427.9 306.7 420.8 304 417.1 298.2L415.1 295.1C409.1 285.7 398.7 279.1 387.5 279.1C376.4 279.1 365.1 285.7 359.9 295.1L353.8 304.6C352.4 306.8 350.5 308.7 348.2 309.1L311.1 330.1C293.9 340.2 286.5 362.5 294.1 381.4L300.5 393.8C309.1 413 331.2 422.3 350.1 414.9L353.5 413.1C363.6 410.2 374.8 411.8 383.5 418.1L385 419.2C422.2 389.7 449.1 347.8 459.4 299.7C456.4 299.4 453.4 299.6 450.4 300.4H450.4zM156.1 367.5L188.1 375.5C196.7 377.7 205.4 372.5 207.5 363.9C209.7 355.3 204.5 346.6 195.9 344.5L163.9 336.5C155.3 334.3 146.6 339.5 144.5 348.1C142.3 356.7 147.5 365.4 156.1 367.5V367.5zM236.5 328.1C234.3 336.7 239.5 345.4 248.1 347.5C256.7 349.7 265.4 344.5 267.5 335.9L275.5 303.9C277.7 295.3 272.5 286.6 263.9 284.5C255.3 282.3 246.6 287.5 244.5 296.1L236.5 328.1zM321.7 120.8L305.7 152.8C301.7 160.7 304.9 170.4 312.8 174.3C320.7 178.3 330.4 175.1 334.3 167.2L350.3 135.2C354.3 127.3 351.1 117.6 343.2 113.7C335.3 109.7 325.6 112.9 321.7 120.8V120.8z"],"earth-europe":[512,512,["globe-europe"],"f7a2","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM266.3 48.25L232.5 73.6C227.2 77.63 224 83.95 224 90.67V99.72C224 106.5 229.5 112 236.3 112C238.7 112 241.1 111.3 243.1 109.9L284.9 82.06C286.9 80.72 289.3 80 291.7 80H292.7C298.9 80 304 85.07 304 91.31C304 94.31 302.8 97.19 300.7 99.31L280.8 119.2C275 124.1 267.9 129.4 260.2 131.9L233.6 140.8C227.9 142.7 224 148.1 224 154.2C224 157.9 222.5 161.5 219.9 164.1L201.9 182.1C195.6 188.4 192 197.1 192 206.1V210.3C192 226.7 205.6 240 221.9 240C232.9 240 243.1 233.8 248 224L252 215.9C254.5 211.1 259.4 208 264.8 208C269.4 208 273.6 210.1 276.3 213.7L292.6 235.5C294.7 238.3 298.1 240 301.7 240C310.1 240 315.6 231.1 311.8 223.6L310.7 221.3C307.1 214.3 310.7 205.8 318.1 203.3L339.3 196.2C346.9 193.7 352 186.6 352 178.6C352 168.3 360.3 160 370.6 160H400C408.8 160 416 167.2 416 176C416 184.8 408.8 192 400 192H379.3C372.1 192 365.1 194.9 360 200L355.3 204.7C353.2 206.8 352 209.7 352 212.7C352 218.9 357.1 224 363.3 224H374.6C380.6 224 386.4 226.4 390.6 230.6L397.2 237.2C398.1 238.1 400 241.4 400 244C400 246.6 398.1 249 397.2 250.8L389.7 258.3C386 261.1 384 266.9 384 272C384 277.1 386 282 389.7 285.7L408 304C418.2 314.2 432.1 320 446.6 320H453.1C460.5 299.8 464 278.3 464 256C464 144.6 376.4 53.64 266.3 48.25V48.25zM438.4 356.1C434.7 353.5 430.2 352 425.4 352C419.4 352 413.6 349.6 409.4 345.4L395.1 331.1C388.3 324.3 377.9 320 367.1 320C357.4 320 347.9 316.5 340.5 310.2L313.1 287.4C302.4 277.5 287.6 271.1 272.3 271.1H251.4C238.7 271.1 226.4 275.7 215.9 282.7L188.5 301C170.7 312.9 160 332.9 160 354.3V357.5C160 374.5 166.7 390.7 178.7 402.7L194.7 418.7C203.2 427.2 214.7 432 226.7 432H248C261.3 432 272 442.7 272 456C272 458.5 272.4 461 273.1 463.3C344.5 457.5 405.6 415.7 438.4 356.1L438.4 356.1zM164.7 100.7L132.7 132.7C126.4 138.9 126.4 149.1 132.7 155.3C138.9 161.6 149.1 161.6 155.3 155.3L187.3 123.3C193.6 117.1 193.6 106.9 187.3 100.7C181.1 94.44 170.9 94.44 164.7 100.7V100.7z"],"earth-oceania":[512,512,["globe-oceania"],"e47b","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM215.5 360.6L240.9 377C247.1 381.6 256.2 384 264.6 384C278 384 290.7 377.8 298.1 367.2L311 351.8C316.8 344.4 320 335.2 320 325.8C320 316.4 316.8 307.2 311 299.8L293.1 276.9C288.3 270.7 284.4 263.1 281.6 256.7L271.5 230.8C269.9 226.7 265.9 224 261.5 224C258 224 254.8 225.6 252.8 228.4L242.4 242.6C237.7 248.1 229.7 252.1 221.9 250.5C218.7 249.8 215.8 247.1 213.8 245.4L209.3 239.3C202.1 229.7 190.7 224 178.7 224C166.7 224 155.3 229.7 148.1 239.3L142.8 246.3C141.3 248.4 139.2 250 136.9 251.1L101.6 267.9C81.08 277.7 72.8 302.6 83.37 322.7L86.65 328.9C95.67 346.1 115.7 354.3 134.1 348.4L149.5 343.6C156 341.5 163.1 341.6 169.6 343.8L208.6 357.3C211 358.1 213.4 359.2 215.5 360.6H215.5zM273.8 142.5C264.3 132.1 250.8 128.9 237.6 131.5L199.1 139.2C183.8 142.3 181.5 163.2 195.7 169.5L238.5 188.6C243.7 190.8 249.2 192 254.8 192H284.7C298.9 192 306.1 174.8 296 164.7L273.8 142.5zM264 448H280C288.8 448 296 440.8 296 432C296 423.2 288.8 416 280 416H264C255.2 416 248 423.2 248 432C248 440.8 255.2 448 264 448zM431.2 298.9C428.4 290.6 419.3 286 410.9 288.8C402.6 291.6 398 300.7 400.8 309.1L408.8 333.1C411.6 341.4 420.7 345.1 429.1 343.2C437.4 340.4 441.1 331.3 439.2 322.9L431.2 298.9zM411.3 379.3C417.6 373.1 417.6 362.9 411.3 356.7C405.1 350.4 394.9 350.4 388.7 356.7L356.7 388.7C350.4 394.9 350.4 405.1 356.7 411.3C362.9 417.6 373.1 417.6 379.3 411.3L411.3 379.3z"],egg:[384,512,[129370],"f7fb","M192 16c-106 0-192 182-192 288c0 106 85.1 192 192 192c105.1 0 192-85.1 192-192C384 198 297.1 16 192 16zM160.1 138C128.6 177.1 96 249.8 96 304C96 312.8 88.84 320 80 320S64 312.8 64 304c0-63.56 36.7-143.3 71.22-186c5.562-6.906 15.64-7.969 22.5-2.406C164.6 121.1 165.7 131.2 160.1 138z"],eject:[448,512,[9167],"f052","M48.01 319.1h351.1c41.62 0 63.49-49.63 35.37-80.38l-175.1-192.1c-19-20.62-51.75-20.62-70.75 0L12.64 239.6C-15.48 270.2 6.393 319.1 48.01 319.1zM399.1 384H48.01c-26.39 0-47.99 21.59-47.99 47.98C.0117 458.4 21.61 480 48.01 480h351.1c26.39 0 47.99-21.6 47.99-47.99C447.1 405.6 426.4 384 399.1 384z"],elevator:[512,512,[],"e16d","M79 96h130c5.967 0 11.37-3.402 13.75-8.662c2.385-5.262 1.299-11.39-2.754-15.59l-65-67.34c-5.684-5.881-16.31-5.881-21.99 0l-65 67.34C63.95 75.95 62.87 82.08 65.25 87.34C67.63 92.6 73.03 96 79 96zM357 91.59c5.686 5.881 16.31 5.881 21.99 0l65-67.34c4.053-4.199 5.137-10.32 2.754-15.59C444.4 3.402 438.1 0 433 0h-130c-5.967 0-11.37 3.402-13.75 8.662c-2.385 5.262-1.301 11.39 2.752 15.59L357 91.59zM448 128H64c-35.35 0-64 28.65-64 63.1v255.1C0 483.3 28.65 512 64 512h384c35.35 0 64-28.65 64-63.1V192C512 156.7 483.3 128 448 128zM352 224C378.5 224.1 400 245.5 400 272c0 26.46-21.47 47.9-48 48C325.5 319.9 304 298.5 304 272C304 245.5 325.5 224.1 352 224zM160 224C186.5 224.1 208 245.5 208 272c0 26.46-21.47 47.9-48 48C133.5 319.9 112 298.5 112 272C112 245.5 133.5 224.1 160 224zM240 448h-160v-48C80 373.5 101.5 352 128 352h64c26.51 0 48 21.49 48 48V448zM432 448h-160v-48c0-26.51 21.49-48 48-48h64c26.51 0 48 21.49 48 48V448z"],ellipsis:[448,512,["ellipsis-h"],"f141","M120 256C120 286.9 94.93 312 64 312C33.07 312 8 286.9 8 256C8 225.1 33.07 200 64 200C94.93 200 120 225.1 120 256zM280 256C280 286.9 254.9 312 224 312C193.1 312 168 286.9 168 256C168 225.1 193.1 200 224 200C254.9 200 280 225.1 280 256zM328 256C328 225.1 353.1 200 384 200C414.9 200 440 225.1 440 256C440 286.9 414.9 312 384 312C353.1 312 328 286.9 328 256z"],"ellipsis-vertical":[128,512,["ellipsis-v"],"f142","M64 360C94.93 360 120 385.1 120 416C120 446.9 94.93 472 64 472C33.07 472 8 446.9 8 416C8 385.1 33.07 360 64 360zM64 200C94.93 200 120 225.1 120 256C120 286.9 94.93 312 64 312C33.07 312 8 286.9 8 256C8 225.1 33.07 200 64 200zM64 152C33.07 152 8 126.9 8 96C8 65.07 33.07 40 64 40C94.93 40 120 65.07 120 96C120 126.9 94.93 152 64 152z"],envelope:[512,512,[128386,61443,9993],"f0e0","M464 64C490.5 64 512 85.49 512 112C512 127.1 504.9 141.3 492.8 150.4L275.2 313.6C263.8 322.1 248.2 322.1 236.8 313.6L19.2 150.4C7.113 141.3 0 127.1 0 112C0 85.49 21.49 64 48 64H464zM217.6 339.2C240.4 356.3 271.6 356.3 294.4 339.2L512 176V384C512 419.3 483.3 448 448 448H64C28.65 448 0 419.3 0 384V176L217.6 339.2z"],"envelope-circle-check":[640,512,[],"e4e8","M464 64C490.5 64 512 85.49 512 112C512 127.1 504.9 141.3 492.8 150.4L478.9 160.8C412.3 167.2 356.5 210.8 332.6 270.6L275.2 313.6C263.8 322.1 248.2 322.1 236.8 313.6L19.2 150.4C7.113 141.3 0 127.1 0 112C0 85.49 21.49 64 48 64H464zM294.4 339.2L320.8 319.4C320.3 324.9 320 330.4 320 336C320 378.5 335.1 417.6 360.2 448H64C28.65 448 0 419.3 0 384V176L217.6 339.2C240.4 356.3 271.6 356.3 294.4 339.2zM640 336C640 415.5 575.5 480 496 480C416.5 480 352 415.5 352 336C352 256.5 416.5 192 496 192C575.5 192 640 256.5 640 336zM540.7 292.7L480 353.4L451.3 324.7C445.1 318.4 434.9 318.4 428.7 324.7C422.4 330.9 422.4 341.1 428.7 347.3L468.7 387.3C474.9 393.6 485.1 393.6 491.3 387.3L563.3 315.3C569.6 309.1 569.6 298.9 563.3 292.7C557.1 286.4 546.9 286.4 540.7 292.7H540.7z"],"envelope-open":[512,512,[62135],"f2b6","M493.6 163c-24.88-19.62-45.5-35.37-164.3-121.6C312.7 29.21 279.7 0 256.4 0H255.6C232.3 0 199.3 29.21 182.6 41.38c-118.8 86.25-139.4 101.1-164.3 121.6C6.75 172 0 186 0 200.8v263.2C0 490.5 21.49 512 48 512h416c26.51 0 48-21.49 48-47.1V200.8C512 186 505.3 172 493.6 163zM303.2 367.5C289.1 378.5 272.5 384 256 384s-33.06-5.484-47.16-16.47L64 254.9V208.5c21.16-16.59 46.48-35.66 156.4-115.5c3.18-2.328 6.891-5.187 10.98-8.353C236.9 80.44 247.8 71.97 256 66.84c8.207 5.131 19.14 13.6 24.61 17.84c4.09 3.166 7.801 6.027 11.15 8.478C400.9 172.5 426.6 191.7 448 208.5v46.32L303.2 367.5z"],"envelope-open-text":[512,512,[],"f658","M256 417.1c-16.38 0-32.88-4.1-46.88-15.12L0 250.9v213.1C0 490.5 21.5 512 48 512h416c26.5 0 48-21.5 48-47.1V250.9l-209.1 151.1C288.9 412 272.4 417.1 256 417.1zM493.6 163C484.8 156 476.4 149.5 464 140.1v-44.12c0-26.5-21.5-48-48-48l-77.5 .0016c-3.125-2.25-5.875-4.25-9.125-6.5C312.6 29.13 279.3-.3732 256 .0018C232.8-.3732 199.4 29.13 182.6 41.5c-3.25 2.25-6 4.25-9.125 6.5L96 48c-26.5 0-48 21.5-48 48v44.12C35.63 149.5 27.25 156 18.38 163C6.75 172 0 186 0 200.8v10.62l96 69.37V96h320v184.7l96-69.37V200.8C512 186 505.3 172 493.6 163zM176 255.1h160c8.836 0 16-7.164 16-15.1c0-8.838-7.164-16-16-16h-160c-8.836 0-16 7.162-16 16C160 248.8 167.2 255.1 176 255.1zM176 191.1h160c8.836 0 16-7.164 16-16c0-8.838-7.164-15.1-16-15.1h-160c-8.836 0-16 7.162-16 15.1C160 184.8 167.2 191.1 176 191.1z"],"envelopes-bulk":[640,512,["mail-bulk"],"f674","M191.9 448.6c-9.766 0-19.48-2.969-27.78-8.891L32 340.2V480c0 17.62 14.38 32 32 32h256c17.62 0 32-14.38 32-32v-139.8L220.2 439.5C211.7 445.6 201.8 448.6 191.9 448.6zM192 192c0-35.25 28.75-64 64-64h224V32c0-17.62-14.38-32-32-32H128C110.4 0 96 14.38 96 32v192h96V192zM320 256H64C46.38 256 32 270.4 32 288v12.18l151 113.8c5.25 3.719 12.7 3.734 18.27-.25L352 300.2V288C352 270.4 337.6 256 320 256zM576 160H256C238.4 160 224 174.4 224 192v32h96c33.25 0 60.63 25.38 63.75 57.88L384 416h192c17.62 0 32-14.38 32-32V192C608 174.4 593.6 160 576 160zM544 288h-64V224h64V288z"],equals:[448,512,[62764],"3d","M48 192h352c17.69 0 32-14.32 32-32s-14.31-31.1-32-31.1h-352c-17.69 0-32 14.31-32 31.1S30.31 192 48 192zM400 320h-352c-17.69 0-32 14.31-32 31.1s14.31 32 32 32h352c17.69 0 32-14.32 32-32S417.7 320 400 320z"],eraser:[512,512,[],"f12d","M480 416C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H150.6C133.7 480 117.4 473.3 105.4 461.3L25.37 381.3C.3786 356.3 .3786 315.7 25.37 290.7L258.7 57.37C283.7 32.38 324.3 32.38 349.3 57.37L486.6 194.7C511.6 219.7 511.6 260.3 486.6 285.3L355.9 416H480zM265.4 416L332.7 348.7L195.3 211.3L70.63 336L150.6 416L265.4 416z"],ethernet:[512,512,[],"f796","M512 208v224c0 8.75-7.25 16-16 16H416v-128h-32v128h-64v-128h-32v128H224v-128H192v128H128v-128H96v128H16C7.25 448 0 440.8 0 432v-224C0 199.2 7.25 192 16 192H64V144C64 135.2 71.25 128 80 128H128V80C128 71.25 135.2 64 144 64h224C376.8 64 384 71.25 384 80V128h48C440.8 128 448 135.2 448 144V192h48C504.8 192 512 199.2 512 208z"],"euro-sign":[384,512,[8364,"eur","euro"],"f153","M64 240C46.33 240 32 225.7 32 208C32 190.3 46.33 176 64 176H92.29C121.9 92.11 201.1 32 296 32H320C337.7 32 352 46.33 352 64C352 81.67 337.7 96 320 96H296C238.1 96 187.8 128.4 162.1 176H288C305.7 176 320 190.3 320 208C320 225.7 305.7 240 288 240H144.2C144.1 242.6 144 245.3 144 248V264C144 266.7 144.1 269.4 144.2 272H288C305.7 272 320 286.3 320 304C320 321.7 305.7 336 288 336H162.1C187.8 383.6 238.1 416 296 416H320C337.7 416 352 430.3 352 448C352 465.7 337.7 480 320 480H296C201.1 480 121.9 419.9 92.29 336H64C46.33 336 32 321.7 32 304C32 286.3 46.33 272 64 272H80.15C80.05 269.3 80 266.7 80 264V248C80 245.3 80.05 242.7 80.15 240H64z"],exclamation:[128,512,[10069,10071,61738],"21","M64 352c17.69 0 32-14.32 32-31.1V64.01c0-17.67-14.31-32.01-32-32.01S32 46.34 32 64.01v255.1C32 337.7 46.31 352 64 352zM64 400c-22.09 0-40 17.91-40 40s17.91 39.1 40 39.1s40-17.9 40-39.1S86.09 400 64 400z"],expand:[448,512,[],"f065","M128 32H32C14.31 32 0 46.31 0 64v96c0 17.69 14.31 32 32 32s32-14.31 32-32V96h64c17.69 0 32-14.31 32-32S145.7 32 128 32zM416 32h-96c-17.69 0-32 14.31-32 32s14.31 32 32 32h64v64c0 17.69 14.31 32 32 32s32-14.31 32-32V64C448 46.31 433.7 32 416 32zM128 416H64v-64c0-17.69-14.31-32-32-32s-32 14.31-32 32v96c0 17.69 14.31 32 32 32h96c17.69 0 32-14.31 32-32S145.7 416 128 416zM416 320c-17.69 0-32 14.31-32 32v64h-64c-17.69 0-32 14.31-32 32s14.31 32 32 32h96c17.69 0 32-14.31 32-32v-96C448 334.3 433.7 320 416 320z"],explosion:[576,512,[],"e4e9","M499.6 11.32C506.3 .5948 520.1-3.127 531.3 2.814C542.4 8.754 547.1 22.32 541.9 33.84L404.8 338.6C406.9 340.9 409 343.3 411.1 345.7L508.2 291.1C518.7 285.2 531.9 287.9 539.1 297.5C546.4 307 545.4 320.5 536.1 328.1L449.9 415.1H378.5C365.4 378.7 329.8 351.1 288 351.1C246.2 351.1 210.6 378.7 197.5 415.1H117.8L42.34 363.7C32.59 356.1 29.23 344.1 34.43 333.5C39.64 322.8 51.84 317.6 63.16 321.1L160.4 351.5C163.3 347.6 166.5 343.8 169.7 340.2L107.4 236.3C101.4 226.3 103.5 213.3 112.5 205.7C121.5 198.1 134.7 198.1 143.6 205.8L246 293.6C247.5 293.2 249 292.8 250.5 292.4L264.1 149.7C265.3 137.4 275.6 127.1 288 127.1C300.4 127.1 310.7 137.4 311.9 149.7L325.4 291.6L499.6 11.32zM544 447.1C561.7 447.1 576 462.3 576 479.1C576 497.7 561.7 511.1 544 511.1H32C14.33 511.1 0 497.7 0 479.1C0 462.3 14.33 447.1 32 447.1H544zM288-.0046C301.3-.0046 312 10.74 312 23.1V71.1C312 85.25 301.3 95.1 288 95.1C274.7 95.1 264 85.25 264 71.1V23.1C264 10.74 274.7-.0046 288-.0046V-.0046z"],eye:[576,512,[128065],"f06e","M279.6 160.4C282.4 160.1 285.2 160 288 160C341 160 384 202.1 384 256C384 309 341 352 288 352C234.1 352 192 309 192 256C192 253.2 192.1 250.4 192.4 247.6C201.7 252.1 212.5 256 224 256C259.3 256 288 227.3 288 192C288 180.5 284.1 169.7 279.6 160.4zM480.6 112.6C527.4 156 558.7 207.1 573.5 243.7C576.8 251.6 576.8 260.4 573.5 268.3C558.7 304 527.4 355.1 480.6 399.4C433.5 443.2 368.8 480 288 480C207.2 480 142.5 443.2 95.42 399.4C48.62 355.1 17.34 304 2.461 268.3C-.8205 260.4-.8205 251.6 2.461 243.7C17.34 207.1 48.62 156 95.42 112.6C142.5 68.84 207.2 32 288 32C368.8 32 433.5 68.84 480.6 112.6V112.6zM288 112C208.5 112 144 176.5 144 256C144 335.5 208.5 400 288 400C367.5 400 432 335.5 432 256C432 176.5 367.5 112 288 112z"],"eye-dropper":[512,512,["eye-dropper-empty","eyedropper"],"f1fb","M482.8 29.23C521.7 68.21 521.7 131.4 482.8 170.4L381.2 271.9L390.6 281.4C403.1 293.9 403.1 314.1 390.6 326.6C378.1 339.1 357.9 339.1 345.4 326.6L185.4 166.6C172.9 154.1 172.9 133.9 185.4 121.4C197.9 108.9 218.1 108.9 230.6 121.4L240.1 130.8L341.6 29.23C380.6-9.744 443.8-9.744 482.8 29.23L482.8 29.23zM55.43 323.3L176.1 202.6L221.4 247.9L100.7 368.6C97.69 371.6 96 375.6 96 379.9V416H132.1C136.4 416 140.4 414.3 143.4 411.3L264.1 290.6L309.4 335.9L188.7 456.6C173.7 471.6 153.3 480 132.1 480H89.69L49.75 506.6C37.06 515.1 20.16 513.4 9.373 502.6C-1.413 491.8-3.086 474.9 5.375 462.2L32 422.3V379.9C32 358.7 40.43 338.3 55.43 323.3L55.43 323.3z"],"eye-low-vision":[640,512,["low-vision"],"f2a8","M150.7 92.77C195 58.27 251.8 32 320 32C400.8 32 465.5 68.84 512.6 112.6C559.4 156 590.7 207.1 605.5 243.7C608.8 251.6 608.8 260.4 605.5 268.3C592.1 300.6 565.2 346.1 525.6 386.7L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L150.7 92.77zM223.1 149.5L313.4 220.3C317.6 211.8 320 202.2 320 191.1C320 180.5 316.1 169.7 311.6 160.4C314.4 160.1 317.2 159.1 320 159.1C373 159.1 416 202.1 416 255.1C416 269.7 413.1 282.7 407.1 294.5L446.6 324.7C457.7 304.3 464 280.9 464 255.1C464 176.5 399.5 111.1 320 111.1C282.7 111.1 248.6 126.2 223.1 149.5zM393.6 469.4L54.65 203.7C62.6 190.1 72.08 175.8 83.09 161.5L446.2 447.5C429.8 456.4 412.3 463.8 393.6 469.4V469.4zM34.46 268.3C31.74 261.8 31.27 254.5 33.08 247.8L329.2 479.8C326.1 479.9 323.1 480 320 480C239.2 480 174.5 443.2 127.4 399.4C80.62 355.1 49.34 304 34.46 268.3H34.46z"],"eye-slash":[640,512,[],"f070","M150.7 92.77C195 58.27 251.8 32 320 32C400.8 32 465.5 68.84 512.6 112.6C559.4 156 590.7 207.1 605.5 243.7C608.8 251.6 608.8 260.4 605.5 268.3C592.1 300.6 565.2 346.1 525.6 386.7L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L150.7 92.77zM223.1 149.5L313.4 220.3C317.6 211.8 320 202.2 320 191.1C320 180.5 316.1 169.7 311.6 160.4C314.4 160.1 317.2 159.1 320 159.1C373 159.1 416 202.1 416 255.1C416 269.7 413.1 282.7 407.1 294.5L446.6 324.7C457.7 304.3 464 280.9 464 255.1C464 176.5 399.5 111.1 320 111.1C282.7 111.1 248.6 126.2 223.1 149.5zM320 480C239.2 480 174.5 443.2 127.4 399.4C80.62 355.1 49.34 304 34.46 268.3C31.18 260.4 31.18 251.6 34.46 243.7C44 220.8 60.29 191.2 83.09 161.5L177.4 235.8C176.5 242.4 176 249.1 176 255.1C176 335.5 240.5 400 320 400C338.7 400 356.6 396.4 373 389.9L446.2 447.5C409.9 467.1 367.8 480 320 480H320z"],f:[320,512,[102],"46","M320 64.01c0 17.67-14.33 32-32 32H64v128h160c17.67 0 32 14.32 32 31.1s-14.33 32-32 32H64v160c0 17.67-14.33 32-32 32s-32-14.33-32-32v-384C0 46.34 14.33 32.01 32 32.01h256C305.7 32.01 320 46.34 320 64.01z"],"face-angry":[512,512,[128544,"angry"],"f556","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM339.9 373.3C323.8 355.4 295.7 336 256 336C216.3 336 188.2 355.4 172.1 373.3C166.2 379.9 166.7 389.1 173.3 395.9C179.9 401.8 189.1 401.3 195.9 394.7C207.6 381.7 227.5 368 255.1 368C284.5 368 304.4 381.7 316.1 394.7C322 401.3 332.1 401.8 338.7 395.9C345.3 389.1 345.8 379.9 339.9 373.3H339.9zM176.4 272C194 272 208.4 257.7 208.4 240C208.4 238.5 208.3 237 208.1 235.6L218.9 239.2C227.3 241.1 236.4 237.4 239.2 229.1C241.1 220.7 237.4 211.6 229.1 208.8L133.1 176.8C124.7 174 115.6 178.6 112.8 186.9C110 195.3 114.6 204.4 122.9 207.2L153.7 217.4C147.9 223.2 144.4 231.2 144.4 240C144.4 257.7 158.7 272 176.4 272zM358.9 217.2L389.1 207.2C397.4 204.4 401.1 195.3 399.2 186.9C396.4 178.6 387.3 174 378.9 176.8L282.9 208.8C274.6 211.6 270 220.7 272.8 229.1C275.6 237.4 284.7 241.1 293.1 239.2L304.7 235.3C304.5 236.8 304.4 238.4 304.4 240C304.4 257.7 318.7 272 336.4 272C354 272 368.4 257.7 368.4 240C368.4 231.1 364.7 223 358.9 217.2H358.9z"],"face-dizzy":[512,512,["dizzy"],"f567","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 416C291.3 416 320 387.3 320 352C320 316.7 291.3 288 256 288C220.7 288 192 316.7 192 352C192 387.3 220.7 416 256 416zM100.7 155.3L137.4 192L100.7 228.7C94.44 234.9 94.44 245.1 100.7 251.3C106.9 257.6 117.1 257.6 123.3 251.3L160 214.6L196.7 251.3C202.9 257.6 213.1 257.6 219.3 251.3C225.6 245.1 225.6 234.9 219.3 228.7L182.6 192L219.3 155.3C225.6 149.1 225.6 138.9 219.3 132.7C213.1 126.4 202.9 126.4 196.7 132.7L160 169.4L123.3 132.7C117.1 126.4 106.9 126.4 100.7 132.7C94.44 138.9 94.44 149.1 100.7 155.3zM292.7 155.3L329.4 192L292.7 228.7C286.4 234.9 286.4 245.1 292.7 251.3C298.9 257.6 309.1 257.6 315.3 251.3L352 214.6L388.7 251.3C394.9 257.6 405.1 257.6 411.3 251.3C417.6 245.1 417.6 234.9 411.3 228.7L374.6 192L411.3 155.3C417.6 149.1 417.6 138.9 411.3 132.7C405.1 126.4 394.9 126.4 388.7 132.7L352 169.4L315.3 132.7C309.1 126.4 298.9 126.4 292.7 132.7C286.4 138.9 286.4 149.1 292.7 155.3z"],"face-flushed":[512,512,[128563,"flushed"],"f579","M184 224C184 237.3 173.3 248 160 248C146.7 248 136 237.3 136 224C136 210.7 146.7 200 160 200C173.3 200 184 210.7 184 224zM376 224C376 237.3 365.3 248 352 248C338.7 248 328 237.3 328 224C328 210.7 338.7 200 352 200C365.3 200 376 210.7 376 224zM512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM192 400H320C328.8 400 336 392.8 336 384C336 375.2 328.8 368 320 368H192C183.2 368 176 375.2 176 384C176 392.8 183.2 400 192 400zM160 296C199.8 296 232 263.8 232 224C232 184.2 199.8 152 160 152C120.2 152 88 184.2 88 224C88 263.8 120.2 296 160 296zM352 152C312.2 152 280 184.2 280 224C280 263.8 312.2 296 352 296C391.8 296 424 263.8 424 224C424 184.2 391.8 152 352 152z"],"face-frown":[512,512,[9785,"frown"],"f119","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM159.3 388.7C171.5 349.4 209.9 320 256 320C302.1 320 340.5 349.4 352.7 388.7C355.3 397.2 364.3 401.9 372.7 399.3C381.2 396.7 385.9 387.7 383.3 379.3C366.8 326.1 315.8 287.1 256 287.1C196.3 287.1 145.2 326.1 128.7 379.3C126.1 387.7 130.8 396.7 139.3 399.3C147.7 401.9 156.7 397.2 159.3 388.7H159.3zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-frown-open":[512,512,[128550,"frown-open"],"f57a","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240zM336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176zM259.9 369.4C288.8 369.4 316.2 375.2 340.6 385.5C352.9 390.7 366.7 381.3 361.4 369.1C344.8 330.9 305.6 303.1 259.9 303.1C214.3 303.1 175.1 330.8 158.4 369.1C153.1 381.3 166.1 390.6 179.3 385.4C203.7 375.1 231 369.4 259.9 369.4L259.9 369.4z"],"face-grimace":[512,512,[128556,"grimace"],"f57f","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM399.3 360H344V400H352C375.8 400 395.5 382.7 399.3 360zM352 304H344V344H399.3C395.5 321.3 375.8 304 352 304zM328 344V304H264V344H328zM328 400V360H264V400H328zM184 304V344H248V304H184zM184 360V400H248V360H184zM168 344V304H160C136.2 304 116.5 321.3 112.7 344H168zM168 400V360H112.7C116.5 382.7 136.2 400 160 400H168zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-grin":[512,512,[128512,"grin"],"f580","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-grin-beam":[512,512,[128516,"grin-beam"],"f582","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM226.5 231.6C229.8 230.5 232 227.4 232 224C232 206.1 225.3 188.4 215.4 175.2C205.6 162.2 191.5 152 176 152C160.5 152 146.4 162.2 136.6 175.2C126.7 188.4 120 206.1 120 224C120 227.4 122.2 230.5 125.5 231.6C128.7 232.7 132.3 231.6 134.4 228.8L134.4 228.8L134.6 228.5C134.8 228.3 134.1 228 135.3 227.6C135.1 226.8 136.9 225.7 138.1 224.3C140.6 221.4 144.1 217.7 148.3 213.1C157.1 206.2 167.2 200 176 200C184.8 200 194.9 206.2 203.7 213.1C207.9 217.7 211.4 221.4 213.9 224.3C215.1 225.7 216 226.8 216.7 227.6C217 228 217.2 228.3 217.4 228.5L217.6 228.8L217.6 228.8C219.7 231.6 223.3 232.7 226.5 231.6V231.6zM377.6 228.8C379.7 231.6 383.3 232.7 386.5 231.6C389.8 230.5 392 227.4 392 224C392 206.1 385.3 188.4 375.4 175.2C365.6 162.2 351.5 152 336 152C320.5 152 306.4 162.2 296.6 175.2C286.7 188.4 280 206.1 280 224C280 227.4 282.2 230.5 285.5 231.6C288.7 232.7 292.3 231.6 294.4 228.8L294.4 228.8L294.6 228.5C294.8 228.3 294.1 228 295.3 227.6C295.1 226.8 296.9 225.7 298.1 224.3C300.6 221.4 304.1 217.7 308.3 213.1C317.1 206.2 327.2 200 336 200C344.8 200 354.9 206.2 363.7 213.1C367.9 217.7 371.4 221.4 373.9 224.3C375.1 225.7 376 226.8 376.7 227.6C377 228 377.2 228.3 377.4 228.5L377.6 228.8L377.6 228.8z"],"face-grin-beam-sweat":[512,512,[128517,"grin-beam-sweat"],"f583","M464 128C437.5 128 416 107 416 81.01C416 76.01 417.8 69.74 420.6 62.87C420.9 62.17 421.2 61.46 421.6 60.74C430.5 40.51 448.1 15.86 457.6 3.282C460.8-1.093 467.2-1.094 470.4 3.281C483.4 20.65 512 61.02 512 81.01C512 102.7 497.1 120.8 476.8 126.3C472.7 127.4 468.4 128 464 128L464 128zM256 .0003C307.4 .0003 355.3 15.15 395.4 41.23C393.9 44.32 392.4 47.43 391.1 50.53C387.8 58.57 384 69.57 384 81.01C384 125.4 420.6 160 464 160C473.6 160 482.8 158.3 491.4 155.2C504.7 186.1 512 220.2 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0V.0003zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM226.5 231.6C229.8 230.5 232 227.4 232 224C232 206.1 225.3 188.4 215.4 175.2C205.6 162.2 191.5 152 176 152C160.5 152 146.4 162.2 136.6 175.2C126.7 188.4 120 206.1 120 224C120 227.4 122.2 230.5 125.5 231.6C128.7 232.7 132.3 231.6 134.4 228.8L134.4 228.8L134.6 228.5C134.8 228.3 134.1 228 135.3 227.6C135.1 226.8 136.9 225.7 138.1 224.3C140.6 221.4 144.1 217.7 148.3 213.1C157.1 206.2 167.2 200 176 200C184.8 200 194.9 206.2 203.7 213.1C207.9 217.7 211.4 221.4 213.9 224.3C215.1 225.7 216 226.8 216.7 227.6C217 228 217.2 228.3 217.4 228.5L217.6 228.8L217.6 228.8C219.7 231.6 223.3 232.7 226.5 231.6V231.6zM377.6 228.8C379.7 231.6 383.3 232.7 386.5 231.6C389.8 230.5 392 227.4 392 224C392 206.1 385.3 188.4 375.4 175.2C365.6 162.2 351.5 152 336 152C320.5 152 306.4 162.2 296.6 175.2C286.7 188.4 280 206.1 280 224C280 227.4 282.2 230.5 285.5 231.6C288.7 232.7 292.3 231.6 294.4 228.8L294.4 228.8L294.6 228.5C294.8 228.3 294.1 228 295.3 227.6C295.1 226.8 296.9 225.7 298.1 224.3C300.6 221.4 304.1 217.7 308.3 213.1C317.1 206.2 327.2 200 336 200C344.8 200 354.9 206.2 363.7 213.1C367.9 217.7 371.4 221.4 373.9 224.3C375.1 225.7 376 226.8 376.7 227.6C377 228 377.2 228.3 377.4 228.5L377.6 228.8L377.6 228.8z"],"face-grin-hearts":[512,512,[128525,"grin-hearts"],"f584","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM199.3 129.1C181.5 124.4 163.2 134.9 158.4 152.7L154.1 168.8L137.1 164.5C120.2 159.7 101.9 170.3 97.14 188.1C92.38 205.8 102.9 224.1 120.7 228.9L185.8 246.3C194.4 248.6 203.1 243.6 205.4 235L222.9 169.1C227.6 152.2 217.1 133.9 199.3 129.1H199.3zM353.6 152.7C348.8 134.9 330.5 124.4 312.7 129.1C294.9 133.9 284.4 152.2 289.1 169.1L306.6 235C308.9 243.6 317.6 248.6 326.2 246.3L391.3 228.9C409.1 224.1 419.6 205.8 414.9 188.1C410.1 170.3 391.8 159.7 374 164.5L357.9 168.8L353.6 152.7z"],"face-grin-squint":[512,512,[128518,"grin-squint"],"f585","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM133.5 146.7C125.6 142.4 116 148.2 116 157.1C116 159.9 116.1 162.6 118.8 164.8L154.8 208L118.8 251.2C116.1 253.4 116 256.1 116 258.9C116 267.8 125.6 273.6 133.5 269.3L223.4 221.4C234.1 215.7 234.1 200.3 223.4 194.6L133.5 146.7zM396 157.1C396 148.2 386.4 142.4 378.5 146.7L288.6 194.6C277.9 200.3 277.9 215.7 288.6 221.4L378.5 269.3C386.4 273.6 396 267.8 396 258.9C396 256.1 395 253.4 393.2 251.2L357.2 208L393.2 164.8C395 162.6 396 159.9 396 157.1V157.1z"],"face-grin-squint-tears":[512,512,[129315,"grin-squint-tears"],"f586","M426.8 14.18C446-5.046 477.5-4.645 497.1 14.92C516.6 34.49 517 65.95 497.8 85.18C490.1 92.02 476.4 97.59 460.5 101.9C444.1 106.3 426.4 109.4 414.1 111.2C412.5 111.5 410.1 111.7 409.6 111.9C403.1 112.8 399.2 108 400.1 102.4C401.7 91.19 404.7 72.82 409.1 55.42C409.4 54.12 409.8 52.84 410.1 51.56C414.4 35.62 419.1 21.02 426.8 14.18L426.8 14.18zM382.2 33.17C380.6 37.96 379.3 42.81 378.1 47.52C373.3 66.46 370.1 86.05 368.4 97.79C364.5 124.6 387.4 147.5 414.1 143.6C426 141.9 445.6 138.8 464.5 133.9C469.2 132.7 474.1 131.4 478.8 129.9C534.2 227.5 520.2 353.8 437 437C353.8 520.3 227.5 534.2 129.8 478.8C131.3 474 132.7 469.2 133.9 464.5C138.7 445.5 141.9 425.1 143.6 414.2C147.5 387.4 124.6 364.5 97.89 368.4C85.97 370.1 66.39 373.2 47.46 378.1C42.76 379.3 37.93 380.6 33.15 382.1C-22.19 284.5-8.245 158.2 74.98 74.98C158.2-8.253 284.5-22.19 382.2 33.17V33.17zM416.4 202.3C411.6 190.4 395.6 191.4 389.6 202.7C370.1 239.4 343.3 275.9 309.8 309.4C276.3 342.9 239.8 369.7 203.1 389.2C191.8 395.2 190.8 411.2 202.7 416C262.1 440.2 332.6 428.3 380.7 380.3C428.7 332.2 440.6 261.7 416.4 202.3H416.4zM94.43 288.5L150.5 293.6L155.6 349.7C155.8 352.5 157.1 355 159 357C165.4 363.4 176.2 360.7 178.8 352.1L208.5 254.6C211.1 242.1 201.1 232.1 189.5 235.7L92.05 265.3C83.46 267.9 80.76 278.7 87.1 285.1C89.07 287.1 91.66 288.3 94.43 288.5V288.5zM235.7 189.5C232.1 201.1 242.1 211.1 254.6 208.5L352.1 178.8C360.7 176.2 363.4 165.4 357 159C355 157.1 352.5 155.8 349.7 155.6L293.6 150.5L288.5 94.43C288.3 91.66 287.1 89.07 285.1 87.1C278.7 80.76 267.9 83.46 265.3 92.05L235.7 189.5zM51.53 410.1C70.01 405.1 90.3 401.8 102.4 400.1C108 399.2 112.8 403.1 111.9 409.6C110.2 421.7 106.9 441.9 101.9 460.4C97.57 476.4 92.02 490.1 85.18 497.8C65.95 517 34.49 516.6 14.92 497.1C-4.645 477.5-5.046 446 14.18 426.8C21.02 419.1 35.6 414.4 51.53 410.1V410.1z"],"face-grin-stars":[512,512,[129321,"grin-stars"],"f587","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5H407.4zM152.8 124.6L136.2 159.3L98.09 164.3C95.03 164.7 92.48 166.8 91.52 169.8C90.57 172.7 91.39 175.9 93.62 178L121.5 204.5L114.5 242.3C113.1 245.4 115.2 248.4 117.7 250.2C120.2 252.1 123.5 252.3 126.2 250.8L159.1 232.5L193.8 250.8C196.5 252.3 199.8 252.1 202.3 250.2C204.8 248.4 206 245.4 205.5 242.3L198.5 204.5L226.4 178C228.6 175.9 229.4 172.7 228.5 169.8C227.5 166.8 224.1 164.7 221.9 164.3L183.8 159.3L167.2 124.6C165.9 121.8 163.1 120 159.1 120C156.9 120 154.1 121.8 152.8 124.6V124.6zM344.8 124.6L328.2 159.3L290.1 164.3C287 164.7 284.5 166.8 283.5 169.8C282.6 172.7 283.4 175.9 285.6 178L313.5 204.5L306.5 242.3C305.1 245.4 307.2 248.4 309.7 250.2C312.2 252.1 315.5 252.3 318.2 250.8L352 232.5L385.8 250.8C388.5 252.3 391.8 252.1 394.3 250.2C396.8 248.4 398 245.4 397.5 242.3L390.5 204.5L418.4 178C420.6 175.9 421.4 172.7 420.5 169.8C419.5 166.8 416.1 164.7 413.9 164.3L375.8 159.3L359.2 124.6C357.9 121.8 355.1 120 352 120C348.9 120 346.1 121.8 344.8 124.6H344.8z"],"face-grin-tears":[640,512,[128514,"grin-tears"],"f588","M548.6 371.4C506.4 454.8 419.9 512 319.1 512C220.1 512 133.6 454.8 91.4 371.4C95.87 368.4 100.1 365 104.1 361.1C112.2 352.1 117.3 342.5 120.6 334.4C124.2 325.7 127.1 316 129.4 306.9C134 288.7 137 269.1 138.6 258.7C142.6 232.2 119.9 209.5 93.4 213.3C86.59 214.3 77.18 215.7 66.84 217.7C85.31 94.5 191.6 0 319.1 0C448.4 0 554.7 94.5 573.2 217.7C562.8 215.7 553.4 214.3 546.6 213.3C520.1 209.5 497.4 232.2 501.4 258.7C502.1 269.1 505.1 288.7 510.6 306.9C512.9 316 515.8 325.7 519.4 334.4C522.7 342.5 527.8 352.1 535.9 361.1C539.9 365 544.1 368.4 548.6 371.4V371.4zM471.4 331.5C476.4 319.7 464.4 309 452.1 312.8C412.4 324.9 367.7 331.8 320.3 331.8C272.9 331.8 228.1 324.9 188.5 312.8C176.2 309 164.2 319.7 169.2 331.5C194.1 390.6 252.4 432 320.3 432C388.2 432 446.4 390.6 471.4 331.5H471.4zM281.6 228.8C283.7 231.6 287.3 232.7 290.5 231.6C293.8 230.5 295.1 227.4 295.1 224C295.1 206.1 289.3 188.4 279.4 175.2C269.6 162.2 255.5 152 239.1 152C224.5 152 210.4 162.2 200.6 175.2C190.7 188.4 183.1 206.1 183.1 224C183.1 227.4 186.2 230.5 189.5 231.6C192.7 232.7 196.3 231.6 198.4 228.8L198.4 228.8L198.6 228.5C198.8 228.3 198.1 228 199.3 227.6C199.1 226.8 200.9 225.7 202.1 224.3C204.6 221.4 208.1 217.7 212.3 213.1C221.1 206.2 231.2 200 239.1 200C248.8 200 258.9 206.2 267.7 213.1C271.9 217.7 275.4 221.4 277.9 224.3C279.1 225.7 280 226.8 280.7 227.6C281 228 281.2 228.3 281.4 228.5L281.6 228.8L281.6 228.8zM450.5 231.6C453.8 230.5 456 227.4 456 224C456 206.1 449.3 188.4 439.4 175.2C429.6 162.2 415.5 152 400 152C384.5 152 370.4 162.2 360.6 175.2C350.7 188.4 344 206.1 344 224C344 227.4 346.2 230.5 349.5 231.6C352.7 232.7 356.3 231.6 358.4 228.8L358.4 228.8L358.6 228.5C358.8 228.3 358.1 228 359.3 227.6C359.1 226.8 360.9 225.7 362.1 224.3C364.6 221.4 368.1 217.7 372.3 213.1C381.1 206.2 391.2 200 400 200C408.8 200 418.9 206.2 427.7 213.1C431.9 217.7 435.4 221.4 437.9 224.3C439.1 225.7 440 226.8 440.7 227.6C441 228 441.2 228.3 441.4 228.5L441.6 228.8L441.6 228.8C443.7 231.6 447.3 232.7 450.5 231.6V231.6zM106.1 254.1C103.9 275.6 95.58 324.3 81.43 338.4C80.49 339.4 79.51 340.3 78.5 341.1C59.98 356.7 32.01 355.5 14.27 337.7C-4.442 319-4.825 288.9 13.55 270.6C22.19 261.9 43.69 255.4 64.05 250.1C77.02 248.2 89.53 246.2 97.94 245C103.3 244.2 107.8 248.7 106.1 254.1V254.1zM561.5 341.1C560.7 340.5 559.1 339.8 559.2 339.1C559 338.9 558.8 338.7 558.6 338.4C544.4 324.3 536.1 275.6 533 254.1C532.2 248.7 536.7 244.2 542.1 245C543.1 245.2 544.2 245.3 545.4 245.5C553.6 246.7 564.6 248.5 575.1 250.1C596.3 255.4 617.8 261.9 626.4 270.6C644.8 288.9 644.4 319 625.7 337.7C607.1 355.5 580 356.7 561.5 341.1L561.5 341.1z"],"face-grin-tongue":[512,512,[128539,"grin-tongue"],"f589","M256 0C397.4 0 512 114.6 512 256C512 368.9 438.9 464.7 337.5 498.8C346.7 484 352 466.6 352 448V401.1C376.3 383.5 395.6 359.5 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C116.9 359.3 135.1 383.1 160 400.7V448C160 466.6 165.3 484 174.5 498.8C73.07 464.7 0 368.9 0 256C0 114.6 114.6 .0003 256 .0003L256 0zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240zM336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176zM256 512C220.7 512 192 483.3 192 448V402.6C192 387.9 203.9 376 218.6 376H220.6C231.9 376 241.7 383.9 244.2 394.9C247 407.5 264.1 407.5 267.8 394.9C270.3 383.9 280.1 376 291.4 376H293.4C308.1 376 320 387.9 320 402.6V448C320 483.3 291.3 512 256 512V512z"],"face-grin-tongue-squint":[512,512,[128541,"grin-tongue-squint"],"f58a","M256 0C397.4 0 512 114.6 512 256C512 368.9 438.9 464.7 337.5 498.8C346.7 484 352 466.6 352 448V401.1C376.3 383.5 395.6 359.5 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C116.9 359.3 135.1 383.1 160 400.7V448C160 466.6 165.3 484 174.5 498.8C73.07 464.7 0 368.9 0 256C0 114.6 114.6 .0003 256 .0003L256 0zM118.8 148.8L154.8 192L118.8 235.2C116.1 237.4 116 240.1 116 242.9C116 251.8 125.6 257.6 133.5 253.3L223.4 205.4C234.1 199.7 234.1 184.3 223.4 178.6L133.5 130.7C125.6 126.4 116 132.2 116 141.1C116 143.9 116.1 146.6 118.8 148.8V148.8zM288.6 178.6C277.9 184.3 277.9 199.7 288.6 205.4L378.5 253.3C386.4 257.6 396 251.8 396 242.9C396 240.1 395 237.4 393.2 235.2L357.2 192L393.2 148.8C395 146.6 396 143.9 396 141.1C396 132.2 386.4 126.4 378.5 130.7L288.6 178.6zM256 512C220.7 512 192 483.3 192 448V402.6C192 387.9 203.9 376 218.6 376H220.6C231.9 376 241.7 383.9 244.2 394.9C247 407.5 264.1 407.5 267.8 394.9C270.3 383.9 280.1 376 291.4 376H293.4C308.1 376 320 387.9 320 402.6V448C320 483.3 291.3 512 256 512V512z"],"face-grin-tongue-wink":[512,512,[128540,"grin-tongue-wink"],"f58b","M312 208C312 194.7 322.7 184 336 184C349.3 184 360 194.7 360 208C360 221.3 349.3 232 336 232C322.7 232 312 221.3 312 208zM174.5 498.8C73.07 464.7 0 368.9 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 368.9 438.9 464.7 337.5 498.8C346.7 484 352 466.6 352 448V401.1C376.3 383.5 395.6 359.5 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C116.9 359.3 135.1 383.1 159.1 400.7V448C159.1 466.6 165.3 484 174.5 498.8L174.5 498.8zM217.6 236.8C224.7 231.5 226.1 221.5 220.8 214.4C190.4 173.9 129.6 173.9 99.2 214.4C93.9 221.5 95.33 231.5 102.4 236.8C109.5 242.1 119.5 240.7 124.8 233.6C142.4 210.1 177.6 210.1 195.2 233.6C200.5 240.7 210.5 242.1 217.6 236.8zM336 272C371.3 272 400 243.3 400 208C400 172.7 371.3 144 336 144C300.7 144 272 172.7 272 208C272 243.3 300.7 272 336 272zM320 402.6V448C320 483.3 291.3 512 256 512C220.7 512 192 483.3 192 448V402.6C192 387.9 203.9 376 218.6 376H220.6C231.9 376 241.7 383.9 244.2 394.9C247 407.5 264.1 407.5 267.8 394.9C270.3 383.9 280.1 376 291.4 376H293.4C308.1 376 320 387.9 320 402.6V402.6z"],"face-grin-wide":[512,512,[128515,"grin-alt"],"f581","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM176 128C158.3 128 144 156.7 144 192C144 227.3 158.3 256 176 256C193.7 256 208 227.3 208 192C208 156.7 193.7 128 176 128zM336 256C353.7 256 368 227.3 368 192C368 156.7 353.7 128 336 128C318.3 128 304 156.7 304 192C304 227.3 318.3 256 336 256z"],"face-grin-wink":[512,512,["grin-wink"],"f58c","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256.3 331.8C208.9 331.8 164.1 324.9 124.5 312.8C112.2 309 100.2 319.7 105.2 331.5C130.1 390.6 188.4 432 256.3 432C324.2 432 382.4 390.6 407.4 331.5C412.4 319.7 400.4 309 388.1 312.8C348.4 324.9 303.7 331.8 256.3 331.8H256.3zM393.6 236.8C400.7 231.5 402.1 221.5 396.8 214.4C366.4 173.9 305.6 173.9 275.2 214.4C269.9 221.5 271.3 231.5 278.4 236.8C285.5 242.1 295.5 240.7 300.8 233.6C318.4 210.1 353.6 210.1 371.2 233.6C376.5 240.7 386.5 242.1 393.6 236.8zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240z"],"face-kiss":[512,512,[128535,"kiss"],"f596","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM287.9 300.3C274.7 292.9 257.4 288 240 288C236.4 288 233.2 290.5 232.3 293.1C231.3 297.5 232.9 301.2 236.1 302.1L236.1 302.1L236.3 303.1L236.8 303.4L237.2 303.7C238 304.1 239.2 304.9 240.6 305.8C243.4 307.6 247.2 310.3 250.8 313.4C254.6 316.5 258 319.1 260.5 323.4C262.1 326.1 264 329.8 264 332C264 334.2 262.1 337 260.5 340.6C258 344 254.6 347.5 250.8 350.6C247.2 353.7 243.4 356.4 240.6 358.2C239.2 359.1 238 359.9 237.2 360.3L236.6 360.7L236.3 360.9L236.1 361L236.1 361C233.6 362.4 232 365.1 232 368C232 370.9 233.6 373.6 236.1 374.1L236.1 374.1L236.3 375.1C236.5 375.2 236.8 375.4 237.2 375.7C238 376.1 239.2 376.9 240.6 377.8C243.4 379.6 247.2 382.3 250.8 385.4C254.6 388.5 258 391.9 260.5 395.4C262.1 398.1 264 401.8 264 403.1C264 406.2 262.1 409 260.5 412.6C258 416 254.6 419.5 250.8 422.6C247.2 425.7 243.4 428.4 240.6 430.2C239.2 431.1 238 431.9 237.2 432.3C236.8 432.6 236.5 432.8 236.3 432.9L236.1 432.1L236.1 433C232.9 434.8 231.3 438.5 232.3 442C233.2 445.5 236.4 447.1 240 447.1C257.4 447.1 274.7 443.1 287.9 435.7C294.5 432 300.4 427.5 304.7 422.3C308.9 417.2 312 410.9 312 403.1C312 397.1 308.9 390.8 304.7 385.7C300.4 380.5 294.5 375.1 287.9 372.3C285.2 370.7 282.3 369.3 279.2 367.1C282.3 366.7 285.2 365.3 287.9 363.7C294.5 360 300.4 355.5 304.7 350.3C308.9 345.2 312 338.9 312 331.1C312 325.1 308.9 318.8 304.7 313.7C300.4 308.5 294.5 303.1 287.9 300.3L287.9 300.3zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-kiss-beam":[512,512,[128537,"kiss-beam"],"f597","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM287.9 300.3C274.7 292.9 257.4 288 240 288C236.4 288 233.2 290.5 232.3 293.1C231.3 297.5 232.9 301.2 236.1 302.1L236.1 302.1L236.3 303.1L236.8 303.4L237.2 303.7C238 304.1 239.2 304.9 240.6 305.8C243.4 307.6 247.2 310.3 250.8 313.4C254.6 316.5 258 319.1 260.5 323.4C262.1 326.1 264 329.8 264 332C264 334.2 262.1 337 260.5 340.6C258 344 254.6 347.5 250.8 350.6C247.2 353.7 243.4 356.4 240.6 358.2C239.2 359.1 238 359.9 237.2 360.3L236.6 360.7L236.3 360.9L236.1 361L236.1 361C233.6 362.4 232 365.1 232 368C232 370.9 233.6 373.6 236.1 374.1L236.1 374.1L236.3 375.1C236.5 375.2 236.8 375.4 237.2 375.7C238 376.1 239.2 376.9 240.6 377.8C243.4 379.6 247.2 382.3 250.8 385.4C254.6 388.5 258 391.9 260.5 395.4C262.1 398.1 264 401.8 264 403.1C264 406.2 262.1 409 260.5 412.6C258 416 254.6 419.5 250.8 422.6C247.2 425.7 243.4 428.4 240.6 430.2C239.2 431.1 238 431.9 237.2 432.3C236.8 432.6 236.5 432.8 236.3 432.9L236.1 432.1L236.1 433C232.9 434.8 231.3 438.5 232.3 442C233.2 445.5 236.4 447.1 240 447.1C257.4 447.1 274.7 443.1 287.9 435.7C294.5 432 300.4 427.5 304.7 422.3C308.9 417.2 312 410.9 312 403.1C312 397.1 308.9 390.8 304.7 385.7C300.4 380.5 294.5 375.1 287.9 372.3C285.2 370.7 282.3 369.3 279.2 367.1C282.3 366.7 285.2 365.3 287.9 363.7C294.5 360 300.4 355.5 304.7 350.3C308.9 345.2 312 338.9 312 331.1C312 325.1 308.9 318.8 304.7 313.7C300.4 308.5 294.5 303.1 287.9 300.3L287.9 300.3zM226.5 231.6C229.8 230.5 232 227.4 232 224C232 206.1 225.3 188.4 215.4 175.2C205.6 162.2 191.5 152 176 152C160.5 152 146.4 162.2 136.6 175.2C126.7 188.4 120 206.1 120 224C120 227.4 122.2 230.5 125.5 231.6C128.7 232.7 132.3 231.6 134.4 228.8L134.4 228.8L134.6 228.5C134.8 228.3 134.1 228 135.3 227.6C135.1 226.8 136.9 225.7 138.1 224.3C140.6 221.4 144.1 217.7 148.3 213.1C157.1 206.2 167.2 200 176 200C184.8 200 194.9 206.2 203.7 213.1C207.9 217.7 211.4 221.4 213.9 224.3C215.1 225.7 216 226.8 216.7 227.6C217 228 217.2 228.3 217.4 228.5L217.6 228.8L217.6 228.8C219.7 231.6 223.3 232.7 226.5 231.6V231.6zM377.6 228.8C379.7 231.6 383.3 232.7 386.5 231.6C389.8 230.5 392 227.4 392 224C392 206.1 385.3 188.4 375.4 175.2C365.6 162.2 351.5 152 336 152C320.5 152 306.4 162.2 296.6 175.2C286.7 188.4 280 206.1 280 224C280 227.4 282.2 230.5 285.5 231.6C288.7 232.7 292.3 231.6 294.4 228.8L294.4 228.8L294.6 228.5C294.8 228.3 294.1 228 295.3 227.6C295.1 226.8 296.9 225.7 298.1 224.3C300.6 221.4 304.1 217.7 308.3 213.1C317.1 206.2 327.2 200 336 200C344.8 200 354.9 206.2 363.7 213.1C367.9 217.7 371.4 221.4 373.9 224.3C375.1 225.7 376 226.8 376.7 227.6C377 228 377.2 228.3 377.4 228.5L377.6 228.8L377.6 228.8z"],"face-kiss-wink-heart":[512,512,[128536,"kiss-wink-heart"],"f598","M461.8 334.6C448.1 300.8 411.5 280.3 374.3 290.7C334.2 301.9 312.4 343.8 322.4 382.8L345.3 472.1C347.3 479.7 350.9 486.4 355.7 491.8C325.1 504.8 291.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 285.3 507.1 313.4 498 339.7C486.9 334.1 474.5 333.1 461.8 334.6L461.8 334.6zM296 332C296 325.1 292.9 318.8 288.7 313.7C284.4 308.5 278.5 303.1 271.9 300.3C258.7 292.9 241.4 288 224 288C220.4 288 217.2 290.5 216.3 293.1C215.3 297.5 216.9 301.2 220.1 302.1L220.1 302.1L220.3 303.1C220.5 303.2 220.8 303.4 221.2 303.7C222 304.1 223.2 304.9 224.6 305.8C227.4 307.6 231.2 310.3 234.8 313.4C238.6 316.5 242 319.1 244.5 323.4C246.1 326.1 248 329.8 248 332C248 334.2 246.1 337 244.5 340.6C242 344 238.6 347.5 234.8 350.6C231.2 353.7 227.4 356.4 224.6 358.2C223.2 359.1 222 359.9 221.2 360.3C220.8 360.6 220.5 360.8 220.3 360.9L220.1 361L220.1 361C217.6 362.4 216 365.1 216 368C216 370.9 217.6 373.6 220.1 374.1L220.1 374.1L220.3 375.1L220.6 375.3L221.2 375.7C222 376.1 223.2 376.9 224.6 377.8C227.4 379.6 231.2 382.3 234.8 385.4C238.6 388.5 242 391.9 244.5 395.4C246.1 398.1 248 401.8 248 404C248 406.2 246.1 409 244.5 412.6C242 416 238.6 419.5 234.8 422.6C231.2 425.7 227.4 428.4 224.6 430.2C223.2 431.1 222 431.9 221.2 432.3C220.8 432.6 220.5 432.8 220.3 432.9L220.1 433L220.1 433C216.9 434.8 215.3 438.5 216.3 442C217.2 445.5 220.4 447.1 224 447.1C241.4 447.1 258.7 443.1 271.9 435.7C278.5 432 284.4 427.5 288.7 422.3C292.9 417.2 296 410.9 296 403.1C296 397.1 292.9 390.8 288.7 385.7C284.4 380.5 278.5 375.1 271.9 372.3C269.2 370.7 266.3 369.3 263.2 367.1C266.3 366.7 269.2 365.3 271.9 363.7C278.5 360 284.4 355.5 288.7 350.3C292.9 345.2 296 338.9 296 331.1V332zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240zM393.6 236.8C400.7 231.5 402.1 221.5 396.8 214.4C366.4 173.9 305.6 173.9 275.2 214.4C269.9 221.5 271.3 231.5 278.4 236.8C285.5 242.1 295.5 240.7 300.8 233.6C318.4 210.1 353.6 210.1 371.2 233.6C376.5 240.7 386.5 242.1 393.6 236.8zM439.4 373.3L459.5 367.6C481.7 361.4 504.6 375.2 510.6 398.4C516.5 421.7 503.3 445.6 481.1 451.8L396.1 475.6C387.5 478 378.6 472.9 376.3 464.2L353.4 374.9C347.5 351.6 360.7 327.7 382.9 321.5C405.2 315.3 428 329.1 433.1 352.3L439.4 373.3z"],"face-laugh":[512,512,["laugh"],"f599","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 432C332.1 432 396.2 382 415.2 314.1C419.1 300.4 407.8 288 393.6 288H118.4C104.2 288 92.92 300.4 96.76 314.1C115.8 382 179.9 432 256 432V432zM176.4 160C158.7 160 144.4 174.3 144.4 192C144.4 209.7 158.7 224 176.4 224C194 224 208.4 209.7 208.4 192C208.4 174.3 194 160 176.4 160zM336.4 224C354 224 368.4 209.7 368.4 192C368.4 174.3 354 160 336.4 160C318.7 160 304.4 174.3 304.4 192C304.4 209.7 318.7 224 336.4 224z"],"face-laugh-beam":[512,512,[128513,"laugh-beam"],"f59a","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 432C332.1 432 396.2 382 415.2 314.1C419.1 300.4 407.8 288 393.6 288H118.4C104.2 288 92.92 300.4 96.76 314.1C115.8 382 179.9 432 256 432V432zM226.5 215.6C229.8 214.5 232 211.4 232 208C232 190.1 225.3 172.4 215.4 159.2C205.6 146.2 191.5 136 176 136C160.5 136 146.4 146.2 136.6 159.2C126.7 172.4 120 190.1 120 208C120 211.4 122.2 214.5 125.5 215.6C128.7 216.7 132.3 215.6 134.4 212.8L134.4 212.8L134.6 212.5C134.8 212.3 134.1 212 135.3 211.6C135.1 210.8 136.9 209.7 138.1 208.3C140.6 205.4 144.1 201.7 148.3 197.1C157.1 190.2 167.2 184 176 184C184.8 184 194.9 190.2 203.7 197.1C207.9 201.7 211.4 205.4 213.9 208.3C215.1 209.7 216 210.8 216.7 211.6C217 212 217.2 212.3 217.4 212.5L217.6 212.8L217.6 212.8C219.7 215.6 223.3 216.7 226.5 215.6V215.6zM377.6 212.8C379.7 215.6 383.3 216.7 386.5 215.6C389.8 214.5 392 211.4 392 208C392 190.1 385.3 172.4 375.4 159.2C365.6 146.2 351.5 136 336 136C320.5 136 306.4 146.2 296.6 159.2C286.7 172.4 280 190.1 280 208C280 211.4 282.2 214.5 285.5 215.6C288.7 216.7 292.3 215.6 294.4 212.8L294.4 212.8L294.6 212.5C294.8 212.3 294.1 212 295.3 211.6C295.1 210.8 296.9 209.7 298.1 208.3C300.6 205.4 304.1 201.7 308.3 197.1C317.1 190.2 327.2 184 336 184C344.8 184 354.9 190.2 363.7 197.1C367.9 201.7 371.4 205.4 373.9 208.3C375.1 209.7 376 210.8 376.7 211.6C377 212 377.2 212.3 377.4 212.5L377.6 212.8L377.6 212.8z"],"face-laugh-squint":[512,512,["laugh-squint"],"f59b","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 432C332.1 432 396.2 382 415.2 314.1C419.1 300.4 407.8 288 393.6 288H118.4C104.2 288 92.92 300.4 96.76 314.1C115.8 382 179.9 432 256 432V432zM133.5 114.7C125.6 110.4 116 116.2 116 125.1C116 127.9 116.1 130.6 118.8 132.8L154.8 176L118.8 219.2C116.1 221.4 116 224.1 116 226.9C116 235.8 125.6 241.6 133.5 237.3L223.4 189.4C234.1 183.7 234.1 168.3 223.4 162.6L133.5 114.7zM396 125.1C396 116.2 386.4 110.4 378.5 114.7L288.6 162.6C277.9 168.3 277.9 183.7 288.6 189.4L378.5 237.3C386.4 241.6 396 235.8 396 226.9C396 224.1 395 221.4 393.2 219.2L357.2 176L393.2 132.8C395 130.6 396 127.9 396 125.1V125.1z"],"face-laugh-wink":[512,512,["laugh-wink"],"f59c","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM256 432C332.1 432 396.2 382 415.2 314.1C419.1 300.4 407.8 288 393.6 288H118.4C104.2 288 92.92 300.4 96.76 314.1C115.8 382 179.9 432 256 432V432zM176.4 160C158.7 160 144.4 174.3 144.4 192C144.4 209.7 158.7 224 176.4 224C194 224 208.4 209.7 208.4 192C208.4 174.3 194 160 176.4 160zM300.8 217.6C318.4 194.1 353.6 194.1 371.2 217.6C376.5 224.7 386.5 226.1 393.6 220.8C400.7 215.5 402.1 205.5 396.8 198.4C366.4 157.9 305.6 157.9 275.2 198.4C269.9 205.5 271.3 215.5 278.4 220.8C285.5 226.1 295.5 224.7 300.8 217.6z"],"face-meh":[512,512,[128528,"meh"],"f11a","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240zM336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176zM160 336C151.2 336 144 343.2 144 352C144 360.8 151.2 368 160 368H352C360.8 368 368 360.8 368 352C368 343.2 360.8 336 352 336H160z"],"face-meh-blank":[512,512,[128566,"meh-blank"],"f5a4","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-rolling-eyes":[512,512,[128580,"meh-rolling-eyes"],"f5a5","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM192 368C183.2 368 176 375.2 176 384C176 392.8 183.2 400 192 400H320C328.8 400 336 392.8 336 384C336 375.2 328.8 368 320 368H192zM186.2 165.6C189.8 170.8 192 177.1 192 184C192 201.7 177.7 216 160 216C142.3 216 128 201.7 128 184C128 177.1 130.2 170.8 133.8 165.6C111.5 175.6 96 197.1 96 224C96 259.3 124.7 288 160 288C195.3 288 224 259.3 224 224C224 197.1 208.5 175.6 186.2 165.6zM352 288C387.3 288 416 259.3 416 224C416 197.1 400.5 175.6 378.2 165.6C381.8 170.8 384 177.1 384 184C384 201.7 369.7 216 352 216C334.3 216 320 201.7 320 184C320 177.1 322.2 170.8 325.8 165.6C303.5 175.6 288 197.1 288 224C288 259.3 316.7 288 352 288z"],"face-sad-cry":[512,512,[128557,"sad-cry"],"f5b3","M352 493.4C322.4 505.4 289.9 512 256 512C222.1 512 189.6 505.4 160 493.4V288C160 279.2 152.8 272 144 272C135.2 272 128 279.2 128 288V477.8C51.48 433.5 0 350.8 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 350.8 460.5 433.5 384 477.8V288C384 279.2 376.8 272 368 272C359.2 272 352 279.2 352 288V493.4zM217.6 236.8C224.7 231.5 226.1 221.5 220.8 214.4C190.4 173.9 129.6 173.9 99.2 214.4C93.9 221.5 95.33 231.5 102.4 236.8C109.5 242.1 119.5 240.7 124.8 233.6C142.4 210.1 177.6 210.1 195.2 233.6C200.5 240.7 210.5 242.1 217.6 236.8zM316.8 233.6C334.4 210.1 369.6 210.1 387.2 233.6C392.5 240.7 402.5 242.1 409.6 236.8C416.7 231.5 418.1 221.5 412.8 214.4C382.4 173.9 321.6 173.9 291.2 214.4C285.9 221.5 287.3 231.5 294.4 236.8C301.5 242.1 311.5 240.7 316.8 233.6zM208 368C208 394.5 229.5 416 256 416C282.5 416 304 394.5 304 368V336C304 309.5 282.5 288 256 288C229.5 288 208 309.5 208 336V368z"],"face-sad-tear":[512,512,[128546,"sad-tear"],"f5b4","M256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0zM256 352C290.9 352 323.2 367.8 348.3 394.9C354.3 401.4 364.4 401.7 370.9 395.7C377.4 389.7 377.7 379.6 371.7 373.1C341.6 340.5 301 320 256 320C247.2 320 240 327.2 240 336C240 344.8 247.2 352 256 352H256zM208 369C208 349 179.6 308.6 166.4 291.3C163.2 286.9 156.8 286.9 153.6 291.3C140.6 308.6 112 349 112 369C112 395 133.5 416 160 416C186.5 416 208 395 208 369H208zM303.6 208C303.6 225.7 317.1 240 335.6 240C353.3 240 367.6 225.7 367.6 208C367.6 190.3 353.3 176 335.6 176C317.1 176 303.6 190.3 303.6 208zM207.6 208C207.6 190.3 193.3 176 175.6 176C157.1 176 143.6 190.3 143.6 208C143.6 225.7 157.1 240 175.6 240C193.3 240 207.6 225.7 207.6 208z"],"face-smile":[512,512,[128578,"smile"],"f118","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM164.1 325.5C158.3 318.8 148.2 318.1 141.5 323.9C134.8 329.7 134.1 339.8 139.9 346.5C162.1 372.1 200.9 400 255.1 400C311.1 400 349.8 372.1 372.1 346.5C377.9 339.8 377.2 329.7 370.5 323.9C363.8 318.1 353.7 318.8 347.9 325.5C329.9 346.2 299.4 368 255.1 368C212.6 368 182 346.2 164.1 325.5H164.1zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240z"],"face-smile-beam":[512,512,[128522,"smile-beam"],"f5b8","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM164.1 325.5C158.3 318.8 148.2 318.1 141.5 323.9C134.8 329.7 134.1 339.8 139.9 346.5C162.1 372.1 200.9 400 255.1 400C311.1 400 349.8 372.1 372.1 346.5C377.9 339.8 377.2 329.7 370.5 323.9C363.8 318.1 353.7 318.8 347.9 325.5C329.9 346.2 299.4 368 255.1 368C212.6 368 182 346.2 164.1 325.5H164.1zM226.5 231.6C229.8 230.5 232 227.4 232 224C232 206.1 225.3 188.4 215.4 175.2C205.6 162.2 191.5 152 176 152C160.5 152 146.4 162.2 136.6 175.2C126.7 188.4 120 206.1 120 224C120 227.4 122.2 230.5 125.5 231.6C128.7 232.7 132.3 231.6 134.4 228.8L134.4 228.8L134.6 228.5C134.8 228.3 134.1 228 135.3 227.6C135.1 226.8 136.9 225.7 138.1 224.3C140.6 221.4 144.1 217.7 148.3 213.1C157.1 206.2 167.2 200 176 200C184.8 200 194.9 206.2 203.7 213.1C207.9 217.7 211.4 221.4 213.9 224.3C215.1 225.7 216 226.8 216.7 227.6C217 228 217.2 228.3 217.4 228.5L217.6 228.8L217.6 228.8C219.7 231.6 223.3 232.7 226.5 231.6V231.6zM377.6 228.8C379.7 231.6 383.3 232.7 386.5 231.6C389.8 230.5 392 227.4 392 224C392 206.1 385.3 188.4 375.4 175.2C365.6 162.2 351.5 152 336 152C320.5 152 306.4 162.2 296.6 175.2C286.7 188.4 280 206.1 280 224C280 227.4 282.2 230.5 285.5 231.6C288.7 232.7 292.3 231.6 294.4 228.8L294.4 228.8L294.6 228.5C294.8 228.3 294.1 228 295.3 227.6C295.1 226.8 296.9 225.7 298.1 224.3C300.6 221.4 304.1 217.7 308.3 213.1C317.1 206.2 327.2 200 336 200C344.8 200 354.9 206.2 363.7 213.1C367.9 217.7 371.4 221.4 373.9 224.3C375.1 225.7 376 226.8 376.7 227.6C377 228 377.2 228.3 377.4 228.5L377.6 228.8L377.6 228.8z"],"face-smile-wink":[512,512,[128521,"smile-wink"],"f4da","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM164.1 325.5C158.3 318.8 148.2 318.1 141.5 323.9C134.8 329.7 134.1 339.8 139.9 346.5C162.1 372.1 200.9 400 255.1 400C311.1 400 349.8 372.1 372.1 346.5C377.9 339.8 377.2 329.7 370.5 323.9C363.8 318.1 353.7 318.8 347.9 325.5C329.9 346.2 299.4 368 255.1 368C212.6 368 182 346.2 164.1 325.5H164.1zM176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176zM300.8 233.6C318.4 210.1 353.6 210.1 371.2 233.6C376.5 240.7 386.5 242.1 393.6 236.8C400.7 231.5 402.1 221.5 396.8 214.4C366.4 173.9 305.6 173.9 275.2 214.4C269.9 221.5 271.3 231.5 278.4 236.8C285.5 242.1 295.5 240.7 300.8 233.6z"],"face-surprise":[512,512,[128558,"surprise"],"f5c2","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM176.4 240C194 240 208.4 225.7 208.4 208C208.4 190.3 194 176 176.4 176C158.7 176 144.4 190.3 144.4 208C144.4 225.7 158.7 240 176.4 240zM336.4 176C318.7 176 304.4 190.3 304.4 208C304.4 225.7 318.7 240 336.4 240C354 240 368.4 225.7 368.4 208C368.4 190.3 354 176 336.4 176zM256 416C291.3 416 320 387.3 320 352C320 316.7 291.3 288 256 288C220.7 288 192 316.7 192 352C192 387.3 220.7 416 256 416z"],"face-tired":[512,512,[128555,"tired"],"f5c8","M0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256zM138.3 364.1C132.2 375.8 128 388.4 128 400C128 405.2 130.6 410.2 134.9 413.2C139.2 416.1 144.7 416.8 149.6 414.1L170.2 407.3C197.1 397.2 225.6 392 254.4 392H257.6C286.4 392 314.9 397.2 341.8 407.3L362.4 414.1C367.3 416.8 372.8 416.1 377.1 413.2C381.4 410.2 384 405.2 384 400C384 388.4 379.8 375.8 373.7 364.1C367.4 352.1 358.4 339.8 347.3 328.7C325.3 306.7 293.4 287.1 256 287.1C218.6 287.1 186.7 306.7 164.7 328.7C153.6 339.8 144.6 352.1 138.3 364.1H138.3zM133.5 146.7C125.6 142.4 116 148.2 116 157.1C116 159.9 116.1 162.6 118.8 164.8L154.8 208L118.8 251.2C116.1 253.4 116 256.1 116 258.9C116 267.8 125.6 273.6 133.5 269.3L223.4 221.4C234.1 215.7 234.1 200.3 223.4 194.6L133.5 146.7zM396 157.1C396 148.2 386.4 142.4 378.5 146.7L288.6 194.6C277.9 200.3 277.9 215.7 288.6 221.4L378.5 269.3C386.4 273.6 396 267.8 396 258.9C396 256.1 395 253.4 393.2 251.2L357.2 208L393.2 164.8C395 162.6 396 159.9 396 157.1V157.1z"],fan:[512,512,[],"f863","M352.6 127.1c-28.12 0-54.13 4.5-77.13 12.88l12.38-123.1c1.125-10.5-8.125-18.88-18.5-17.63C189.6 10.12 127.1 77.62 127.1 159.4c0 28.12 4.5 54.13 12.88 77.13L17.75 224.1c-10.5-1.125-18.88 8.125-17.63 18.5c9.1 79.75 77.5 141.4 159.3 141.4c28.12 0 54.13-4.5 77.13-12.88l-12.38 123.1c-1.125 10.38 8.125 18.88 18.5 17.63c79.75-10 141.4-77.5 141.4-159.3c0-28.12-4.5-54.13-12.88-77.13l123.1 12.38c10.5 1.125 18.88-8.125 17.63-18.5C501.9 189.6 434.4 127.1 352.6 127.1zM255.1 287.1c-17.62 0-31.1-14.38-31.1-32s14.37-32 31.1-32s31.1 14.38 31.1 32S273.6 287.1 255.1 287.1z"],faucet:[512,512,[],"e005","M352 256h-38.54C297.7 242.5 277.9 232.9 256 228V180.5L224 177L192 180.5V228C170.1 233 150.3 242.6 134.5 256H16C7.125 256 0 263.1 0 272v96C0 376.9 7.125 384 16 384h92.78C129.4 421.8 173 448 224 448s94.59-26.25 115.2-64H352c17.62 0 32 14.29 32 31.91S398.4 448 416 448h64c17.62 0 32-14.31 32-31.94C512 327.7 440.4 256 352 256zM81.63 159.9L224 144.9l142.4 15C375.9 160.9 384 153.1 384 143.1V112.9c0-10-8.125-17.74-17.62-16.74L256 107.8V80C256 71.12 248.9 64 240 64h-32C199.1 64 192 71.12 192 80v27.75L81.63 96.14C72.13 95.14 64 102.9 64 112.9v30.24C64 153.1 72.13 160.9 81.63 159.9z"],"faucet-drip":[512,512,[128688],"e006","M416 480c0 17.62 14.38 32 32 32s32-14.38 32-32s-32-64-32-64S416 462.4 416 480zM352 192h-38.54C297.7 178.5 277.9 168.9 256 164V116.5L224 113L192 116.5V164C170.1 169 150.3 178.6 134.5 192H16C7.125 192 0 199.1 0 208v96C0 312.9 7.125 320 16 320h92.78C129.4 357.8 173 384 224 384s94.59-26.25 115.2-64H352c17.62 0 32 14.29 32 31.91S398.4 384 416 384h64c17.62 0 32-14.38 32-32C512 263.6 440.4 192 352 192zM81.63 95.88L224 80.88l142.4 15C375.9 96.88 384 89.12 384 79.12V48.89c0-10-8.125-17.74-17.62-16.74L256 43.75V16C256 7.125 248.9 0 240 0h-32C199.1 0 192 7.125 192 16v27.75L81.63 32.14C72.13 31.14 64 38.89 64 48.89V79.12C64 89.12 72.13 96.88 81.63 95.88z"],fax:[512,512,[128439,128224],"f1ac","M192 64h197.5L416 90.51V160h64V77.25c0-8.484-3.375-16.62-9.375-22.62l-45.25-45.25C419.4 3.375 411.2 0 402.8 0H160C142.3 0 128 14.33 128 32v128h64V64zM64 128H32C14.38 128 0 142.4 0 160v320c0 17.62 14.38 32 32 32h32c17.62 0 32-14.38 32-32V160C96 142.4 81.63 128 64 128zM480 192H128v288c0 17.6 14.4 32 32 32h320c17.6 0 32-14.4 32-32V224C512 206.4 497.6 192 480 192zM288 432c0 8.875-7.125 16-16 16h-32C231.1 448 224 440.9 224 432v-32C224 391.1 231.1 384 240 384h32c8.875 0 16 7.125 16 16V432zM288 304c0 8.875-7.125 16-16 16h-32C231.1 320 224 312.9 224 304v-32C224 263.1 231.1 256 240 256h32C280.9 256 288 263.1 288 272V304zM416 432c0 8.875-7.125 16-16 16h-32c-8.875 0-16-7.125-16-16v-32c0-8.875 7.125-16 16-16h32c8.875 0 16 7.125 16 16V432zM416 304c0 8.875-7.125 16-16 16h-32C359.1 320 352 312.9 352 304v-32C352 263.1 359.1 256 368 256h32C408.9 256 416 263.1 416 272V304z"],feather:[512,512,[129718],"f52d","M483.4 244.2L351.9 287.1h97.74c-9.874 10.62 3.75-3.125-46.24 46.87l-147.6 49.12h98.24c-74.99 73.12-194.6 70.62-246.8 54.1l-66.14 65.99c-9.374 9.374-24.6 9.374-33.98 0s-9.374-24.6 0-33.98l259.5-259.2c6.249-6.25 6.249-16.37 0-22.62c-6.249-6.249-16.37-6.249-22.62 0l-178.4 178.2C58.78 306.1 68.61 216.7 129.1 156.3l85.74-85.68c90.62-90.62 189.8-88.27 252.3-25.78C517.8 95.34 528.9 169.7 483.4 244.2z"],"feather-pointed":[512,512,["feather-alt"],"f56b","M467.1 241.1L351.1 288h94.34c-7.711 14.85-16.29 29.28-25.87 43.01l-132.5 52.99h85.65c-59.34 52.71-144.1 80.34-264.5 52.82l-68.13 68.13c-9.38 9.38-24.56 9.374-33.94 0c-9.375-9.375-9.375-24.56 0-33.94l253.4-253.4c4.846-6.275 4.643-15.19-1.113-20.95c-6.25-6.25-16.38-6.25-22.62 0l-168.6 168.6C24.56 58 366.9 8.118 478.9 .0846c18.87-1.354 34.41 14.19 33.05 33.05C508.7 78.53 498.5 161.8 467.1 241.1z"],ferry:[576,512,[],"e4ea","M352 0C369.7 0 384 14.33 384 32H459.1C479.7 32 490.7 56.29 477.2 71.8L456 96H119.1L98.83 71.8C85.25 56.29 96.27 32 116.9 32H191.1C191.1 14.33 206.3 0 223.1 0L352 0zM95.1 128H480C497.7 128 512 142.3 512 160V283.5C512 296.8 507.8 309.8 500.1 320.7L448.7 392.6C446.8 393.7 444.1 394.9 443.2 396.1C427.7 406.8 409.1 414.2 392.1 416H375.6C358.5 414.2 340.6 406.1 324.8 396.1C302.8 380.6 273.3 380.6 251.2 396.1C236.3 406.3 218.7 414.1 200.5 416H183.9C166.9 414.2 148.3 406.8 132.9 396.1C131.1 394.8 129.2 393.7 127.3 392.6L75.92 320.7C68.17 309.8 64 296.8 64 283.5V160C64 142.3 78.33 128 96 128H95.1zM127.1 288H448V192H127.1V288zM384 448C410.9 448 439.4 437.2 461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448H384z"],file:[384,512,[128459,61462,128196],"f15b","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256z"],"file-arrow-down":[384,512,["file-download"],"f56d","M384 128h-128V0L384 128zM256 160H384v304c0 26.51-21.49 48-48 48h-288C21.49 512 0 490.5 0 464v-416C0 21.49 21.49 0 48 0H224l.0039 128C224 145.7 238.3 160 256 160zM255 295L216 334.1V232c0-13.25-10.75-24-24-24S168 218.8 168 232v102.1L128.1 295C124.3 290.3 118.2 288 112 288S99.72 290.3 95.03 295c-9.375 9.375-9.375 24.56 0 33.94l80 80c9.375 9.375 24.56 9.375 33.94 0l80-80c9.375-9.375 9.375-24.56 0-33.94S264.4 285.7 255 295z"],"file-arrow-up":[384,512,["file-upload"],"f574","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM288.1 344.1C284.3 349.7 278.2 352 272 352s-12.28-2.344-16.97-7.031L216 305.9V408c0 13.25-10.75 24-24 24s-24-10.75-24-24V305.9l-39.03 39.03c-9.375 9.375-24.56 9.375-33.94 0s-9.375-24.56 0-33.94l80-80c9.375-9.375 24.56-9.375 33.94 0l80 80C298.3 320.4 298.3 335.6 288.1 344.1z"],"file-audio":[384,512,[],"f1c7","M224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM176 404c0 10.75-12.88 15.98-20.5 8.484L120 376H76C69.38 376 64 370.6 64 364v-56C64 301.4 69.38 296 76 296H120l35.5-36.5C163.1 251.9 176 257.3 176 268V404zM224 387.8c-4.391 0-8.75-1.835-11.91-5.367c-5.906-6.594-5.359-16.69 1.219-22.59C220.2 353.7 224 345.2 224 336s-3.797-17.69-10.69-23.88c-6.578-5.906-7.125-16-1.219-22.59c5.922-6.594 16.05-7.094 22.59-1.219C248.2 300.5 256 317.8 256 336s-7.766 35.53-21.31 47.69C231.6 386.4 227.8 387.8 224 387.8zM320 336c0 41.81-20.5 81.11-54.84 105.1c-2.781 1.938-5.988 2.875-9.145 2.875c-5.047 0-10.03-2.375-13.14-6.844c-5.047-7.25-3.281-17.22 3.969-22.28C272.6 396.9 288 367.4 288 336s-15.38-60.84-41.14-78.8c-7.25-5.062-9.027-15.03-3.98-22.28c5.047-7.281 14.99-9.062 22.27-3.969C299.5 254.9 320 294.2 320 336zM256 0v128h128L256 0z"],"file-circle-check":[576,512,[],"e5a0","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM476.7 324.7L416 385.4L387.3 356.7C381.1 350.4 370.9 350.4 364.7 356.7C358.4 362.9 358.4 373.1 364.7 379.3L404.7 419.3C410.9 425.6 421.1 425.6 427.3 419.3L499.3 347.3C505.6 341.1 505.6 330.9 499.3 324.7C493.1 318.4 482.9 318.4 476.7 324.7H476.7z"],"file-circle-exclamation":[576,512,[],"e4eb","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM415.1 288V368C415.1 376.8 423.2 384 431.1 384C440.8 384 447.1 376.8 447.1 368V288C447.1 279.2 440.8 272 431.1 272C423.2 272 415.1 279.2 415.1 288z"],"file-circle-minus":[576,512,[],"e4ed","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM496 351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1z"],"file-circle-plus":[576,512,[58606],"e494","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM448 303.1C448 295.2 440.8 287.1 432 287.1C423.2 287.1 416 295.2 416 303.1V351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H416V431.1C416 440.8 423.2 447.1 432 447.1C440.8 447.1 448 440.8 448 431.1V383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1H448V303.1z"],"file-circle-question":[576,512,[],"e4ef","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM368 328C368 336.8 375.2 344 384 344C392.8 344 400 336.8 400 328V321.6C400 316.3 404.3 312 409.6 312H450.1C457.8 312 464 318.2 464 325.9C464 331.1 461.1 335.8 456.6 338.3L424.6 355.1C419.3 357.9 416 363.3 416 369.2V384C416 392.8 423.2 400 432 400C440.8 400 448 392.8 448 384V378.9L471.5 366.6C486.6 358.6 496 342.1 496 325.9C496 300.6 475.4 280 450.1 280H409.6C386.6 280 368 298.6 368 321.6V328z"],"file-circle-xmark":[576,512,[],"e5a1","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V198.6C310.1 219.5 256 287.4 256 368C256 427.1 285.1 479.3 329.7 511.3C326.6 511.7 323.3 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM491.3 331.3C497.6 325.1 497.6 314.9 491.3 308.7C485.1 302.4 474.9 302.4 468.7 308.7L432 345.4L395.3 308.7C389.1 302.4 378.9 302.4 372.7 308.7C366.4 314.9 366.4 325.1 372.7 331.3L409.4 368L372.7 404.7C366.4 410.9 366.4 421.1 372.7 427.3C378.9 433.6 389.1 433.6 395.3 427.3L432 390.6L468.7 427.3C474.9 433.6 485.1 433.6 491.3 427.3C497.6 421.1 497.6 410.9 491.3 404.7L454.6 368L491.3 331.3z"],"file-code":[384,512,[],"f1c9","M224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM154.1 353.8c7.812 7.812 7.812 20.5 0 28.31C150.2 386.1 145.1 388 140 388s-10.23-1.938-14.14-5.844l-48-48c-7.812-7.812-7.812-20.5 0-28.31l48-48c7.812-7.812 20.47-7.812 28.28 0s7.812 20.5 0 28.31L120.3 320L154.1 353.8zM306.1 305.8c7.812 7.812 7.812 20.5 0 28.31l-48 48C254.2 386.1 249.1 388 244 388s-10.23-1.938-14.14-5.844c-7.812-7.812-7.812-20.5 0-28.31L263.7 320l-33.86-33.84c-7.812-7.812-7.812-20.5 0-28.31s20.47-7.812 28.28 0L306.1 305.8zM256 0v128h128L256 0z"],"file-contract":[384,512,[],"f56c","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM64 72C64 67.63 67.63 64 72 64h80C156.4 64 160 67.63 160 72v16C160 92.38 156.4 96 152 96h-80C67.63 96 64 92.38 64 88V72zM64 136C64 131.6 67.63 128 72 128h80C156.4 128 160 131.6 160 136v16C160 156.4 156.4 160 152 160h-80C67.63 160 64 156.4 64 152V136zM304 384c8.875 0 16 7.125 16 16S312.9 416 304 416h-47.25c-16.38 0-31.25-9.125-38.63-23.88c-2.875-5.875-8-6.5-10.12-6.5s-7.25 .625-10 6.125l-7.75 15.38C187.6 412.6 181.1 416 176 416H174.9c-6.5-.5-12-4.75-14-11L144 354.6L133.4 386.5C127.5 404.1 111 416 92.38 416H80C71.13 416 64 408.9 64 400S71.13 384 80 384h12.38c4.875 0 9.125-3.125 10.62-7.625l18.25-54.63C124.5 311.9 133.6 305.3 144 305.3s19.5 6.625 22.75 16.5l13.88 41.63c19.75-16.25 54.13-9.75 66 14.12c2 4 6 6.5 10.12 6.5H304z"],"file-csv":[384,512,[],"f6dd","M224 0V128C224 145.7 238.3 160 256 160H384V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V64C0 28.65 28.65 0 64 0H224zM80 224C57.91 224 40 241.9 40 264V344C40 366.1 57.91 384 80 384H96C118.1 384 136 366.1 136 344V336C136 327.2 128.8 320 120 320C111.2 320 104 327.2 104 336V344C104 348.4 100.4 352 96 352H80C75.58 352 72 348.4 72 344V264C72 259.6 75.58 256 80 256H96C100.4 256 104 259.6 104 264V272C104 280.8 111.2 288 120 288C128.8 288 136 280.8 136 272V264C136 241.9 118.1 224 96 224H80zM175.4 310.6L200.8 325.1C205.2 327.7 208 332.5 208 337.6C208 345.6 201.6 352 193.6 352H168C159.2 352 152 359.2 152 368C152 376.8 159.2 384 168 384H193.6C219.2 384 240 363.2 240 337.6C240 320.1 231.1 305.6 216.6 297.4L191.2 282.9C186.8 280.3 184 275.5 184 270.4C184 262.4 190.4 256 198.4 256H216C224.8 256 232 248.8 232 240C232 231.2 224.8 224 216 224H198.4C172.8 224 152 244.8 152 270.4C152 287 160.9 302.4 175.4 310.6zM280 240C280 231.2 272.8 224 264 224C255.2 224 248 231.2 248 240V271.6C248 306.3 258.3 340.3 277.6 369.2L282.7 376.9C285.7 381.3 290.6 384 296 384C301.4 384 306.3 381.3 309.3 376.9L314.4 369.2C333.7 340.3 344 306.3 344 271.6V240C344 231.2 336.8 224 328 224C319.2 224 312 231.2 312 240V271.6C312 294.6 306.5 317.2 296 337.5C285.5 317.2 280 294.6 280 271.6V240zM256 0L384 128H256V0z"],"file-excel":[384,512,[],"f1c3","M224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM272.1 264.4L224 344l48.99 79.61C279.6 434.3 271.9 448 259.4 448h-26.43c-5.557 0-10.71-2.883-13.63-7.617L192 396l-27.31 44.38C161.8 445.1 156.6 448 151.1 448H124.6c-12.52 0-20.19-13.73-13.63-24.39L160 344L111 264.4C104.4 253.7 112.1 240 124.6 240h26.43c5.557 0 10.71 2.883 13.63 7.613L192 292l27.31-44.39C222.2 242.9 227.4 240 232.9 240h26.43C271.9 240 279.6 253.7 272.1 264.4zM256 0v128h128L256 0z"],"file-export":[576,512,["arrow-right-from-file"],"f56e","M192 312C192 298.8 202.8 288 216 288H384V160H256c-17.67 0-32-14.33-32-32L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48v-128H216C202.8 336 192 325.3 192 312zM256 0v128h128L256 0zM568.1 295l-80-80c-9.375-9.375-24.56-9.375-33.94 0s-9.375 24.56 0 33.94L494.1 288H384v48h110.1l-39.03 39.03C450.3 379.7 448 385.8 448 392s2.344 12.28 7.031 16.97c9.375 9.375 24.56 9.375 33.94 0l80-80C578.3 319.6 578.3 304.4 568.1 295z"],"file-image":[384,512,[128443],"f1c5","M224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM96 224c17.67 0 32 14.33 32 32S113.7 288 96 288S64 273.7 64 256S78.33 224 96 224zM318.1 439.5C315.3 444.8 309.9 448 304 448h-224c-5.9 0-11.32-3.248-14.11-8.451c-2.783-5.201-2.479-11.52 .7949-16.42l53.33-80C122.1 338.7 127.1 336 133.3 336s10.35 2.674 13.31 7.125L160 363.2l45.35-68.03C208.3 290.7 213.3 288 218.7 288s10.35 2.674 13.31 7.125l85.33 128C320.6 428 320.9 434.3 318.1 439.5zM256 0v128h128L256 0z"],"file-import":[512,512,["arrow-right-to-file"],"f56f","M384 0v128h128L384 0zM352 128L352 0H176C149.5 0 128 21.49 128 48V288h174.1l-39.03-39.03c-9.375-9.375-9.375-24.56 0-33.94s24.56-9.375 33.94 0l80 80c9.375 9.375 9.375 24.56 0 33.94l-80 80c-9.375 9.375-24.56 9.375-33.94 0C258.3 404.3 256 398.2 256 392s2.344-12.28 7.031-16.97L302.1 336H128v128C128 490.5 149.5 512 176 512h288c26.51 0 48-21.49 48-48V160h-127.1C366.3 160 352 145.7 352 128zM24 288C10.75 288 0 298.7 0 312c0 13.25 10.75 24 24 24H128V288H24z"],"file-invoice":[384,512,[],"f570","M256 0v128h128L256 0zM288 256H96v64h192V256zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM64 72C64 67.63 67.63 64 72 64h80C156.4 64 160 67.63 160 72v16C160 92.38 156.4 96 152 96h-80C67.63 96 64 92.38 64 88V72zM64 136C64 131.6 67.63 128 72 128h80C156.4 128 160 131.6 160 136v16C160 156.4 156.4 160 152 160h-80C67.63 160 64 156.4 64 152V136zM320 440c0 4.375-3.625 8-8 8h-80C227.6 448 224 444.4 224 440v-16c0-4.375 3.625-8 8-8h80c4.375 0 8 3.625 8 8V440zM320 240v96c0 8.875-7.125 16-16 16h-224C71.13 352 64 344.9 64 336v-96C64 231.1 71.13 224 80 224h224C312.9 224 320 231.1 320 240z"],"file-invoice-dollar":[384,512,[],"f571","M384 128h-128V0L384 128zM256 160H384v304c0 26.51-21.49 48-48 48h-288C21.49 512 0 490.5 0 464v-416C0 21.49 21.49 0 48 0H224l.0039 128C224 145.7 238.3 160 256 160zM64 88C64 92.38 67.63 96 72 96h80C156.4 96 160 92.38 160 88v-16C160 67.63 156.4 64 152 64h-80C67.63 64 64 67.63 64 72V88zM72 160h80C156.4 160 160 156.4 160 152v-16C160 131.6 156.4 128 152 128h-80C67.63 128 64 131.6 64 136v16C64 156.4 67.63 160 72 160zM197.5 316.8L191.1 315.2C168.3 308.2 168.8 304.1 169.6 300.5c1.375-7.812 16.59-9.719 30.27-7.625c5.594 .8438 11.73 2.812 17.59 4.844c10.39 3.594 21.83-1.938 25.45-12.34c3.625-10.44-1.891-21.84-12.33-25.47c-7.219-2.484-13.11-4.078-18.56-5.273V248c0-11.03-8.953-20-20-20s-20 8.969-20 20v5.992C149.6 258.8 133.8 272.8 130.2 293.7c-7.406 42.84 33.19 54.75 50.52 59.84l5.812 1.688c29.28 8.375 28.8 11.19 27.92 16.28c-1.375 7.812-16.59 9.75-30.31 7.625c-6.938-1.031-15.81-4.219-23.66-7.031l-4.469-1.625c-10.41-3.594-21.83 1.812-25.52 12.22c-3.672 10.41 1.781 21.84 12.2 25.53l4.266 1.5c7.758 2.789 16.38 5.59 25.06 7.512V424c0 11.03 8.953 20 20 20s20-8.969 20-20v-6.254c22.36-4.793 38.21-18.53 41.83-39.43C261.3 335 219.8 323.1 197.5 316.8z"],"file-lines":[384,512,[128462,61686,128441,"file-alt","file-text"],"f15c","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM272 416h-160C103.2 416 96 408.8 96 400C96 391.2 103.2 384 112 384h160c8.836 0 16 7.162 16 16C288 408.8 280.8 416 272 416zM272 352h-160C103.2 352 96 344.8 96 336C96 327.2 103.2 320 112 320h160c8.836 0 16 7.162 16 16C288 344.8 280.8 352 272 352zM288 272C288 280.8 280.8 288 272 288h-160C103.2 288 96 280.8 96 272C96 263.2 103.2 256 112 256h160C280.8 256 288 263.2 288 272z"],"file-medical":[384,512,[],"f477","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM288 301.7v36.57C288 345.9 281.9 352 274.3 352L224 351.1v50.29C224 409.9 217.9 416 210.3 416H173.7C166.1 416 160 409.9 160 402.3V351.1L109.7 352C102.1 352 96 345.9 96 338.3V301.7C96 294.1 102.1 288 109.7 288H160V237.7C160 230.1 166.1 224 173.7 224h36.57C217.9 224 224 230.1 224 237.7V288h50.29C281.9 288 288 294.1 288 301.7z"],"file-pdf":[384,512,[],"f1c1","M88 304H80V256H88C101.3 256 112 266.7 112 280C112 293.3 101.3 304 88 304zM192 256H200C208.8 256 216 263.2 216 272V336C216 344.8 208.8 352 200 352H192V256zM224 0V128C224 145.7 238.3 160 256 160H384V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V64C0 28.65 28.65 0 64 0H224zM64 224C55.16 224 48 231.2 48 240V368C48 376.8 55.16 384 64 384C72.84 384 80 376.8 80 368V336H88C118.9 336 144 310.9 144 280C144 249.1 118.9 224 88 224H64zM160 368C160 376.8 167.2 384 176 384H200C226.5 384 248 362.5 248 336V272C248 245.5 226.5 224 200 224H176C167.2 224 160 231.2 160 240V368zM288 224C279.2 224 272 231.2 272 240V368C272 376.8 279.2 384 288 384C296.8 384 304 376.8 304 368V320H336C344.8 320 352 312.8 352 304C352 295.2 344.8 288 336 288H304V256H336C344.8 256 352 248.8 352 240C352 231.2 344.8 224 336 224H288zM256 0L384 128H256V0z"],"file-pen":[576,512,[128221,"file-edit"],"f31c","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V299.6L289.3 394.3C281.1 402.5 275.3 412.8 272.5 424.1L257.4 484.2C255.1 493.6 255.7 503.2 258.8 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM564.1 250.1C579.8 265.7 579.8 291 564.1 306.7L534.7 336.1L463.8 265.1L493.2 235.7C508.8 220.1 534.1 220.1 549.8 235.7L564.1 250.1zM311.9 416.1L441.1 287.8L512.1 358.7L382.9 487.9C378.8 492 373.6 494.9 368 496.3L307.9 511.4C302.4 512.7 296.7 511.1 292.7 507.2C288.7 503.2 287.1 497.4 288.5 491.1L303.5 431.8C304.9 426.2 307.8 421.1 311.9 416.1V416.1z"],"file-powerpoint":[384,512,[],"f1c4","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM279.6 308.1C284.2 353.5 248.5 392 204 392H160v40C160 440.8 152.8 448 144 448H128c-8.836 0-16-7.164-16-16V256c0-8.836 7.164-16 16-16h71.51C239.3 240 275.6 268.5 279.6 308.1zM160 344h44c15.44 0 28-12.56 28-28S219.4 288 204 288H160V344z"],"file-prescription":[384,512,[],"f572","M176 240H128v32h48C184.9 272 192 264.9 192 256S184.9 240 176 240zM256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM292.5 315.5l11.38 11.25c6.25 6.25 6.25 16.38 0 22.62l-29.88 30L304 409.4c6.25 6.25 6.25 16.38 0 22.62l-11.25 11.38c-6.25 6.25-16.5 6.25-22.75 0L240 413.3l-30 30c-6.249 6.25-16.48 6.266-22.73 .0156L176 432c-6.25-6.25-6.25-16.38 0-22.62l29.1-30.12L146.8 320H128l.0078 48.01c0 8.875-7.125 16-16 16L96 384c-8.875 0-16-7.125-16-16v-160C80 199.1 87.13 192 96 192h80c35.38 0 64 28.62 64 64c0 24.25-13.62 45-33.5 55.88L240 345.4l29.88-29.88C276.1 309.3 286.3 309.3 292.5 315.5z"],"file-shield":[576,512,[],"e4f0","M0 64C0 28.65 28.65 0 64 0H224V128C224 145.7 238.3 160 256 160H384V207L291.2 244.2C269.9 252.7 256 273.3 256 296.2C256 352.7 274.9 444.2 350.2 504.4C341.2 509.3 330.9 512 320 512H64C28.65 512 0 483.3 0 448V64zM256 128V0L384 128H256zM423.1 225.7C428.8 223.4 435.2 223.4 440.9 225.7L560.9 273.7C570 277.4 576 286.2 576 296C576 359.3 550.1 464.8 441.2 510.2C435.3 512.6 428.7 512.6 422.8 510.2C313.9 464.8 288 359.3 288 296C288 286.2 293.1 277.4 303.1 273.7L423.1 225.7zM432 273.8V461.7C500.2 428.7 523.5 362.7 527.4 311.1L432 273.8z"],"file-signature":[576,512,[],"f573","M292.7 342.3C289.7 345.3 288 349.4 288 353.7V416h62.34c4.264 0 8.35-1.703 11.35-4.727l156.9-158l-67.88-67.88L292.7 342.3zM568.5 167.4L536.6 135.5c-9.875-10-26-10-36 0l-27.25 27.25l67.88 67.88l27.25-27.25C578.5 193.4 578.5 177.3 568.5 167.4zM256 0v128h128L256 0zM256 448c-16.07-.2852-30.62-9.359-37.88-23.88c-2.875-5.875-8-6.5-10.12-6.5s-7.25 .625-10 6.125l-7.749 15.38C187.6 444.6 181.1 448 176 448H174.9c-6.5-.5-12-4.75-14-11L144 386.6L133.4 418.5C127.5 436.1 111 448 92.45 448H80C71.13 448 64 440.9 64 432S71.13 416 80 416h12.4c4.875 0 9.102-3.125 10.6-7.625l18.25-54.63C124.5 343.9 133.6 337.3 144 337.3s19.5 6.625 22.75 16.5l13.88 41.63c19.75-16.25 54.13-9.75 66 14.12C248.5 413.2 252.2 415.6 256 415.9V347c0-8.523 3.402-16.7 9.451-22.71L384 206.5V160H256c-17.67 0-32-14.33-32-32L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V448H256z"],"file-video":[384,512,[],"f1c8","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM224 384c0 17.67-14.33 32-32 32H96c-17.67 0-32-14.33-32-32V288c0-17.67 14.33-32 32-32h96c17.67 0 32 14.33 32 32V384zM320 284.9v102.3c0 12.57-13.82 20.23-24.48 13.57L256 376v-80l39.52-24.7C306.2 264.6 320 272.3 320 284.9z"],"file-waveform":[448,512,["file-medical-alt"],"f478","M320 0v128h128L320 0zM288 128L288 0H112C85.49 0 64 21.49 64 48V224H16C7.164 224 0 231.2 0 240v32C0 280.8 7.164 288 16 288h128c6.062 0 11.59 3.438 14.31 8.844L176 332.2l49.69-99.38c5.438-10.81 23.19-10.81 28.62 0L281.9 288H352c8.844 0 16 7.156 16 16S360.8 320 352 320h-80c-6.062 0-11.59-3.438-14.31-8.844L240 275.8l-49.69 99.38C187.6 380.6 182.1 384 176 384s-11.59-3.438-14.31-8.844L134.1 320H64v144C64 490.5 85.49 512 112 512h288c26.51 0 48-21.49 48-48V160h-127.1C302.3 160 288 145.7 288 128z"],"file-word":[384,512,[],"f1c2","M224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM281.5 240h23.37c7.717 0 13.43 7.18 11.69 14.7l-42.46 184C272.9 444.1 268 448 262.5 448h-29.26c-5.426 0-10.18-3.641-11.59-8.883L192 329.1l-29.61 109.1C160.1 444.4 156.2 448 150.8 448H121.5c-5.588 0-10.44-3.859-11.69-9.305l-42.46-184C65.66 247.2 71.37 240 79.08 240h23.37c5.588 0 10.44 3.859 11.69 9.301L137.8 352L165.6 248.9C167 243.6 171.8 240 177.2 240h29.61c5.426 0 10.18 3.641 11.59 8.883L246.2 352l23.7-102.7C271.1 243.9 275.1 240 281.5 240zM256 0v128h128L256 0z"],"file-zipper":[384,512,["file-archive"],"f1c6","M256 0v128h128L256 0zM224 128L224 0H48C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48V160h-127.1C238.3 160 224 145.7 224 128zM96 32h64v32H96V32zM96 96h64v32H96V96zM96 160h64v32H96V160zM128.3 415.1c-40.56 0-70.76-36.45-62.83-75.45L96 224h64l30.94 116.9C198.7 379.7 168.5 415.1 128.3 415.1zM144 336h-32C103.2 336 96 343.2 96 352s7.164 16 16 16h32C152.8 368 160 360.8 160 352S152.8 336 144 336z"],fill:[512,512,[],"f575","M168 90.74L221.1 37.66C249.2 9.539 294.8 9.539 322.9 37.66L474.3 189.1C502.5 217.2 502.5 262.8 474.3 290.9L283.9 481.4C246.4 518.9 185.6 518.9 148.1 481.4L30.63 363.9C-6.863 326.4-6.863 265.6 30.63 228.1L122.7 135.1L41.37 54.63C28.88 42.13 28.88 21.87 41.37 9.372C53.87-3.124 74.13-3.124 86.63 9.372L168 90.74zM75.88 273.4C71.69 277.6 68.9 282.6 67.52 287.1H386.7L429.1 245.7C432.2 242.5 432.2 237.5 429.1 234.3L277.7 82.91C274.5 79.79 269.5 79.79 266.3 82.91L213.3 136L262.6 185.4C275.1 197.9 275.1 218.1 262.6 230.6C250.1 243.1 229.9 243.1 217.4 230.6L168 181.3L75.88 273.4z"],"fill-drip":[576,512,[],"f576","M41.37 9.372C53.87-3.124 74.13-3.124 86.63 9.372L168 90.74L221.1 37.66C249.2 9.539 294.8 9.539 322.9 37.66L474.3 189.1C502.5 217.2 502.5 262.8 474.3 290.9L283.9 481.4C246.4 518.9 185.6 518.9 148.1 481.4L30.63 363.9C-6.863 326.4-6.863 265.6 30.63 228.1L122.7 135.1L41.37 54.63C28.88 42.13 28.88 21.87 41.37 9.372V9.372zM217.4 230.6L168 181.3L75.88 273.4C71.69 277.6 68.9 282.6 67.52 288H386.7L429.1 245.7C432.2 242.5 432.2 237.5 429.1 234.3L277.7 82.91C274.5 79.79 269.5 79.79 266.3 82.91L213.3 136L262.6 185.4C275.1 197.9 275.1 218.1 262.6 230.6C250.1 243.1 229.9 243.1 217.4 230.6L217.4 230.6zM448 448C448 422.8 480.6 368.4 499.2 339.3C505.3 329.9 518.7 329.9 524.8 339.3C543.4 368.4 576 422.8 576 448C576 483.3 547.3 512 512 512C476.7 512 448 483.3 448 448H448z"],film:[512,512,[127902],"f008","M463.1 32h-416C21.49 32-.0001 53.49-.0001 80v352c0 26.51 21.49 48 47.1 48h416c26.51 0 48-21.49 48-48v-352C511.1 53.49 490.5 32 463.1 32zM111.1 408c0 4.418-3.582 8-8 8H55.1c-4.418 0-8-3.582-8-8v-48c0-4.418 3.582-8 8-8h47.1c4.418 0 8 3.582 8 8L111.1 408zM111.1 280c0 4.418-3.582 8-8 8H55.1c-4.418 0-8-3.582-8-8v-48c0-4.418 3.582-8 8-8h47.1c4.418 0 8 3.582 8 8V280zM111.1 152c0 4.418-3.582 8-8 8H55.1c-4.418 0-8-3.582-8-8v-48c0-4.418 3.582-8 8-8h47.1c4.418 0 8 3.582 8 8L111.1 152zM351.1 400c0 8.836-7.164 16-16 16H175.1c-8.836 0-16-7.164-16-16v-96c0-8.838 7.164-16 16-16h160c8.836 0 16 7.162 16 16V400zM351.1 208c0 8.836-7.164 16-16 16H175.1c-8.836 0-16-7.164-16-16v-96c0-8.838 7.164-16 16-16h160c8.836 0 16 7.162 16 16V208zM463.1 408c0 4.418-3.582 8-8 8h-47.1c-4.418 0-7.1-3.582-7.1-8l0-48c0-4.418 3.582-8 8-8h47.1c4.418 0 8 3.582 8 8V408zM463.1 280c0 4.418-3.582 8-8 8h-47.1c-4.418 0-8-3.582-8-8v-48c0-4.418 3.582-8 8-8h47.1c4.418 0 8 3.582 8 8V280zM463.1 152c0 4.418-3.582 8-8 8h-47.1c-4.418 0-8-3.582-8-8l0-48c0-4.418 3.582-8 7.1-8h47.1c4.418 0 8 3.582 8 8V152z"],filter:[512,512,[],"f0b0","M3.853 54.87C10.47 40.9 24.54 32 40 32H472C487.5 32 501.5 40.9 508.1 54.87C514.8 68.84 512.7 85.37 502.1 97.33L320 320.9V448C320 460.1 313.2 471.2 302.3 476.6C291.5 482 278.5 480.9 268.8 473.6L204.8 425.6C196.7 419.6 192 410.1 192 400V320.9L9.042 97.33C-.745 85.37-2.765 68.84 3.854 54.87L3.853 54.87z"],"filter-circle-dollar":[576,512,["funnel-dollar"],"f662","M3.853 22.87C10.47 8.904 24.54 0 40 0H472C487.5 0 501.5 8.904 508.1 22.87C514.8 36.84 512.7 53.37 502.1 65.33L396.4 195.6C316.2 212.1 255.1 283 255.1 368C255.1 395.4 262.3 421.4 273.5 444.5C271.8 443.7 270.3 442.7 268.8 441.6L204.8 393.6C196.7 387.6 192 378.1 192 368V288.9L9.042 65.33C-.745 53.37-2.765 36.84 3.854 22.87H3.853zM576 368C576 447.5 511.5 512 432 512C352.5 512 287.1 447.5 287.1 368C287.1 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM413 331.1C418.1 329.3 425.6 327.9 431.8 328C439.1 328.1 448.9 329.8 458.1 332.1C466.7 334.2 475.4 328.1 477.5 320.4C479.7 311.8 474.4 303.2 465.9 301C460.3 299.6 454.3 298.3 448 297.4V288C448 279.2 440.8 272 432 272C423.2 272 416 279.2 416 288V297.5C409.9 298.7 403.7 300.7 397.1 303.8C386.1 310.1 374.9 322.2 376.1 341C377.1 357 387.8 366.4 397.7 371.7C406.6 376.4 417.5 379.5 426.3 381.1L428.1 382.5C438.3 385.4 445.1 387.7 451.2 390.8C455.8 393.5 455.1 395.1 455.1 396.5C456.1 398.9 455.5 400.2 454.1 401C454.3 401.1 453.2 403.2 450.1 404.4C446.3 406.9 439.2 408.2 432.5 407.1C422.1 407.7 414 404.8 402.6 401.2C400.7 400.6 398.8 400 396.8 399.4C388.3 396.8 379.3 401.5 376.7 409.9C374.1 418.3 378.8 427.3 387.2 429.9C388.9 430.4 390.5 430.1 392.3 431.5C399.3 433.8 407.4 436.4 416 438.1V449.5C416 458.4 423.2 465.5 432 465.5C440.8 465.5 448 458.4 448 449.5V438.7C454.2 437.6 460.5 435.6 466.3 432.5C478.3 425.9 488.5 413.8 487.1 395.5C487.5 379.4 477.7 369.3 467.5 363.3C458.1 357.7 446.2 354.4 436.9 351.7L436.8 351.7C426.3 348.7 418.5 346.5 412.9 343.5C408.1 340.9 408.1 339.5 408.1 339.1L408.1 338.1C407.9 337 408.4 336.1 408.8 335.4C409.4 334.5 410.6 333.3 413 331.1L413 331.1z"],"filter-circle-xmark":[576,512,[],"e17b","M3.853 22.87C10.47 8.904 24.54 0 40 0H472C487.5 0 501.5 8.904 508.1 22.87C514.8 36.84 512.7 53.37 502.1 65.33L396.4 195.6C316.2 212.1 255.1 283 255.1 368C255.1 395.4 262.3 421.4 273.5 444.5C271.8 443.7 270.3 442.7 268.8 441.6L204.8 393.6C196.7 387.6 192 378.1 192 368V288.9L9.042 65.33C-.745 53.37-2.765 36.84 3.854 22.87H3.853zM287.1 368C287.1 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 287.1 447.5 287.1 368zM491.3 331.3C497.6 325.1 497.6 314.9 491.3 308.7C485.1 302.4 474.9 302.4 468.7 308.7L432 345.4L395.3 308.7C389.1 302.4 378.9 302.4 372.7 308.7C366.4 314.9 366.4 325.1 372.7 331.3L409.4 368L372.7 404.7C366.4 410.9 366.4 421.1 372.7 427.3C378.9 433.6 389.1 433.6 395.3 427.3L432 390.6L468.7 427.3C474.9 433.6 485.1 433.6 491.3 427.3C497.6 421.1 497.6 410.9 491.3 404.7L454.6 368L491.3 331.3z"],fingerprint:[512,512,[],"f577","M256.1 246c-13.25 0-23.1 10.75-23.1 23.1c1.125 72.25-8.124 141.9-27.75 211.5C201.7 491.3 206.6 512 227.5 512c10.5 0 20.12-6.875 23.12-17.5c13.5-47.87 30.1-125.4 29.5-224.5C280.1 256.8 269.4 246 256.1 246zM255.2 164.3C193.1 164.1 151.2 211.3 152.1 265.4c.75 47.87-3.75 95.87-13.37 142.5c-2.75 12.1 5.624 25.62 18.62 28.37c12.1 2.625 25.62-5.625 28.37-18.62c10.37-50.12 15.12-101.6 14.37-152.1C199.7 238.6 219.1 212.1 254.5 212.3c31.37 .5 57.24 25.37 57.62 55.5c.8749 47.1-2.75 96.25-10.62 143.5c-2.125 12.1 6.749 25.37 19.87 27.62c19.87 3.25 26.75-15.12 27.5-19.87c8.249-49.1 12.12-101.1 11.25-151.1C359.2 211.1 312.2 165.1 255.2 164.3zM144.6 144.5C134.2 136.1 119.2 137.6 110.7 147.9C85.25 179.4 71.38 219.3 72 259.9c.6249 37.62-2.375 75.37-8.999 112.1c-2.375 12.1 6.249 25.5 19.25 27.87c20.12 3.5 27.12-14.87 27.1-19.37c7.124-39.87 10.5-80.62 9.749-121.4C119.6 229.3 129.2 201.3 147.1 178.3C156.4 167.9 154.9 152.9 144.6 144.5zM253.1 82.14C238.6 81.77 223.1 83.52 208.2 87.14c-12.87 2.1-20.87 15.1-17.87 28.87c3.125 12.87 15.1 20.75 28.1 17.75C230.4 131.3 241.7 130 253.4 130.1c75.37 1.125 137.6 61.5 138.9 134.6c.5 37.87-1.375 75.1-5.624 113.6c-1.5 13.12 7.999 24.1 21.12 26.5c16.75 1.1 25.5-11.87 26.5-21.12c4.625-39.75 6.624-79.75 5.999-119.7C438.6 165.3 355.1 83.64 253.1 82.14zM506.1 203.6c-2.875-12.1-15.51-21.25-28.63-18.38c-12.1 2.875-21.12 15.75-18.25 28.62c4.75 21.5 4.875 37.5 4.75 61.62c-.1249 13.25 10.5 24.12 23.75 24.25c13.12 0 24.12-10.62 24.25-23.87C512.1 253.8 512.3 231.8 506.1 203.6zM465.1 112.9c-48.75-69.37-128.4-111.7-213.3-112.9c-69.74-.875-134.2 24.84-182.2 72.96c-46.37 46.37-71.34 108-70.34 173.6l-.125 21.5C-.3651 281.4 10.01 292.4 23.26 292.8C23.51 292.9 23.76 292.9 24.01 292.9c12.1 0 23.62-10.37 23.1-23.37l.125-23.62C47.38 193.4 67.25 144 104.4 106.9c38.87-38.75 91.37-59.62 147.7-58.87c69.37 .1 134.7 35.62 174.6 92.37c7.624 10.87 22.5 13.5 33.37 5.875C470.1 138.6 473.6 123.8 465.1 112.9z"],fire:[448,512,[128293],"f06d","M323.5 51.25C302.8 70.5 284 90.75 267.4 111.1C240.1 73.62 206.2 35.5 168 0C69.75 91.12 0 210 0 281.6C0 408.9 100.2 512 224 512s224-103.1 224-230.4C448 228.4 396 118.5 323.5 51.25zM304.1 391.9C282.4 407 255.8 416 226.9 416c-72.13 0-130.9-47.73-130.9-125.2c0-38.63 24.24-72.64 72.74-130.8c7 8 98.88 125.4 98.88 125.4l58.63-66.88c4.125 6.75 7.867 13.52 11.24 19.9C364.9 290.6 353.4 357.4 304.1 391.9z"],"fire-burner":[640,512,[],"e4f1","M349 61.49C356.9 51.61 365.8 40.76 375.5 31.99C381.1 26.87 389.9 26.89 395.5 32.03C420.2 54.71 441.1 84.69 455.8 113.2C470.4 141.2 480 169.9 480 190.1C480 277.9 408.7 352 320 352C230.3 352 160 277.8 160 190.1C160 163.7 172.7 131.5 192.4 99.52C212.4 67.16 240.5 33.43 273.8 3.734C279.4-1.26 287.1-1.242 293.5 3.773C313.3 21.55 331.8 40.74 349 61.49V61.49zM390 176.1C388 172.1 386 168.1 383 164.1L347 206.1C347 206.1 289 132.1 285 127.1C255 164.1 240 185.1 240 209.1C240 258.1 276 287.1 320.1 287.1C339 287.1 355 282.1 370 272.1C400 251.1 408 209.1 390 176.1zM32 287.1C32 270.3 46.33 255.1 64 255.1H96C113.7 255.1 128 270.3 128 287.1C128 305.7 113.7 319.1 96 319.1V384H544V319.1C526.3 319.1 512 305.7 512 287.1C512 270.3 526.3 255.1 544 255.1H576C593.7 255.1 608 270.3 608 287.1V384C625.7 384 640 398.3 640 416V480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480V416C0 398.3 14.33 384 32 384V287.1zM320 480C337.7 480 352 465.7 352 448C352 430.3 337.7 416 320 416C302.3 416 288 430.3 288 448C288 465.7 302.3 480 320 480zM448 416C430.3 416 416 430.3 416 448C416 465.7 430.3 480 448 480C465.7 480 480 465.7 480 448C480 430.3 465.7 416 448 416zM192 480C209.7 480 224 465.7 224 448C224 430.3 209.7 416 192 416C174.3 416 160 430.3 160 448C160 465.7 174.3 480 192 480z"],"fire-extinguisher":[512,512,[129519],"f134","M64 480c0 17.67 14.33 32 31.1 32H256c17.67 0 31.1-14.33 31.1-32l-.0001-32H64L64 480zM503.4 5.56c-5.453-4.531-12.61-6.406-19.67-5.188l-175.1 32c-11.41 2.094-19.7 12.03-19.7 23.63L224 56L224 32c0-17.67-14.33-32-31.1-32H160C142.3 0 128 14.33 128 32l.0002 26.81C69.59 69.32 20.5 110.6 1.235 168.4C-2.952 181 3.845 194.6 16.41 198.8C18.94 199.6 21.48 200 24 200c10.05 0 19.42-6.344 22.77-16.41C59.45 145.5 90.47 117.8 128 108L128 139.2C90.27 157.2 64 195.4 64 240L64 416h223.1l.0001-176c0-44.6-26.27-82.79-63.1-100.8L224 104l63.1-.002c0 11.59 8.297 21.53 19.7 23.62l175.1 31.1c1.438 .25 2.875 .375 4.297 .375c5.578 0 11.03-1.938 15.37-5.562c5.469-4.562 8.625-11.31 8.625-18.44V23.1C511.1 16.87 508.8 10.12 503.4 5.56zM176 96C167.2 96 160 88.84 160 80S167.2 64 176 64s15.1 7.164 15.1 16S184.8 96 176 96z"],"fire-flame-curved":[384,512,["fire-alt"],"f7e4","M384 319.1C384 425.9 297.9 512 192 512s-192-86.13-192-192c0-58.67 27.82-106.8 54.57-134.1C69.54 169.3 96 179.8 96 201.5v85.5c0 35.17 27.97 64.5 63.16 64.94C194.9 352.5 224 323.6 224 288c0-88-175.1-96.12-52.15-277.2c13.5-19.72 44.15-10.77 44.15 13.03C215.1 127 384 149.7 384 319.1z"],"fire-flame-simple":[384,512,["burn"],"f46a","M203.1 4.365c-6.177-5.82-16.06-5.819-22.23-.0007C74.52 104.5 0 234.1 0 312C0 437.9 79 512 192 512s192-74.05 192-200C384 233.9 309 104.2 203.1 4.365zM192 432c-56.5 0-96-37.76-96-91.74c0-12.47 4.207-55.32 83.87-143c6.314-6.953 17.95-6.953 24.26 0C283.8 284.9 288 327.8 288 340.3C288 394.2 248.5 432 192 432z"],fish:[576,512,[128031],"f578","M180.5 141.5C219.7 108.5 272.6 80 336 80C399.4 80 452.3 108.5 491.5 141.5C530.5 174.5 558.3 213.1 572.4 241.3C577.2 250.5 577.2 261.5 572.4 270.7C558.3 298 530.5 337.5 491.5 370.5C452.3 403.5 399.4 432 336 432C272.6 432 219.7 403.5 180.5 370.5C164.3 356.7 150 341.9 137.8 327.3L48.12 379.6C35.61 386.9 19.76 384.9 9.474 374.7C-.8133 364.5-2.97 348.7 4.216 336.1L50 256L4.216 175.9C-2.97 163.3-.8133 147.5 9.474 137.3C19.76 127.1 35.61 125.1 48.12 132.4L137.8 184.7C150 170.1 164.3 155.3 180.5 141.5L180.5 141.5zM416 224C398.3 224 384 238.3 384 256C384 273.7 398.3 288 416 288C433.7 288 448 273.7 448 256C448 238.3 433.7 224 416 224z"],"fish-fins":[576,512,[],"e4f2","M352.8 96.61C407.7 100.6 454.3 123.6 490 150.4C529.2 179.8 557.3 215.1 571.7 239.9C577.4 249.9 577.4 262.1 571.7 272.1C557.3 296.9 529.2 332.2 490 361.6C454.3 388.4 407.7 411.4 352.8 415.4L275.2 473.6C264.6 481.6 250.2 482.1 238.9 475.1C227.7 468 222 454.7 224.6 441.7L234.3 393.1C214.1 384.1 197.5 373.2 181.1 361.6C166.6 350.1 152.1 337.7 141.2 325.3L48.12 379.6C35.61 386.9 19.76 384.9 9.475 374.7C-.8124 364.5-2.969 348.7 4.217 336.1L50 256L4.217 175.9C-2.969 163.3-.8124 147.5 9.475 137.3C19.76 127.1 35.61 125.1 48.12 132.4L141.2 186.7C152.1 174.3 166.6 161.9 181.1 150.4C197.5 138.8 214.1 127.9 234.3 118.9L224.6 70.28C222 57.27 227.7 44 238.9 36.93C250.2 29.85 264.6 30.44 275.2 38.4L352.8 96.61zM416 224C398.3 224 384 238.3 384 256C384 273.7 398.3 288 416 288C433.7 288 448 273.7 448 256C448 238.3 433.7 224 416 224z"],flag:[512,512,[61725,127988],"f024","M64 496C64 504.8 56.75 512 48 512h-32C7.25 512 0 504.8 0 496V32c0-17.75 14.25-32 32-32s32 14.25 32 32V496zM476.3 0c-6.365 0-13.01 1.35-19.34 4.233c-45.69 20.86-79.56 27.94-107.8 27.94c-59.96 0-94.81-31.86-163.9-31.87C160.9 .3055 131.6 4.867 96 15.75v350.5c32-9.984 59.87-14.1 84.85-14.1c73.63 0 124.9 31.78 198.6 31.78c31.91 0 68.02-5.971 111.1-23.09C504.1 355.9 512 344.4 512 332.1V30.73C512 11.1 495.3 0 476.3 0z"],"flag-checkered":[576,512,[127937],"f11e","M509.5 .0234c-6.145 0-12.53 1.344-18.64 4.227c-44.11 20.86-76.81 27.94-104.1 27.94c-57.89 0-91.53-31.86-158.2-31.87C195 .3203 153.3 8.324 96 32.38V32c0-17.75-14.25-32-32-32S32 14.25 32 32L31.96 496c0 8.75 7.25 16 16 16H80C88.75 512 96 504.8 96 496V384c51.74-23.86 92.71-31.82 128.3-31.82c71.09 0 120.6 31.78 191.7 31.78c30.81 0 65.67-5.969 108.1-23.09C536.3 355.9 544 344.4 544 332.1V30.74C544 12.01 527.8 .0234 509.5 .0234zM480 141.8c-31.99 14.04-57.81 20.59-80 22.49v80.21c25.44-1.477 51.59-6.953 80-17.34V308.9c-22.83 7.441-43.93 11.08-64.03 11.08c-5.447 0-10.71-.4258-15.97-.8906V244.5c-4.436 .2578-8.893 .6523-13.29 .6523c-25.82 0-47.35-4.547-66.71-10.08v66.91c-23.81-6.055-50.17-11.41-80-12.98V213.1C236.2 213.7 232.5 213.3 228.5 213.3C208.8 213.3 185.1 217.7 160 225.1v69.1C139.2 299.4 117.9 305.8 96 314.4V250.7l24.77-10.39C134.8 234.5 147.6 229.9 160 225.1V143.4C140.9 148.5 120.1 155.2 96 165.3V101.8l24.77-10.39C134.8 85.52 147.6 80.97 160 77.02v66.41c26.39-6.953 49.09-10.17 68.48-10.16c4.072 0 7.676 .4453 11.52 .668V65.03C258.6 66.6 274.4 71.55 293.2 77.83C301.7 80.63 310.7 83.45 320 86.12v66.07c20.79 6.84 41.45 12.96 66.71 12.96c4.207 0 8.781-.4766 13.29-.8594V95.54c25.44-1.477 51.59-6.953 80-17.34V141.8zM240 133.9v80.04c18.61 1.57 34.37 6.523 53.23 12.8C301.7 229.6 310.7 232.4 320 235.1V152.2C296.1 144.3 271.6 135.8 240 133.9z"],"flag-usa":[576,512,[],"f74d","M544 61.63V30.74c0-25-28.81-37.99-53.17-26.49C306.3 91.5 321.5-62.25 96 32.38V32c0-17.75-14.25-32-32-32S32 14.25 32 32L31.96 496c0 8.75 7.25 16 15.1 16H80C88.75 512 96 504.8 96 496V384c200-92.25 238.8 53.25 428.1-23.12C536.3 355.9 544 344.4 544 332.1V296.1c-46.98 17.25-86.42 24.12-120.8 24.12c-40.25-.125-74.17-8.5-107.7-16.62C254 288.5 195.3 274.8 96 314.8v-34.5c102-37.63 166.5-22.75 228.4-7.625C385.1 287.8 444.7 301.4 544 261.5V200c-46.98 17.25-86.42 24.12-120.8 24.12c-40.25 0-74.17-8.375-107.7-16.5C254 192.5 195.3 178.8 96 218.8v-34.5c102-37.5 166.5-22.62 228.4-7.5C385.1 191.8 444.7 205.4 544 165.6V96.75c-57.75 23.5-100.4 31.38-135.8 31.38c-62.96 0-118.9-27.09-120.2-27.38V67.5C331.9 78.94 390.1 128.3 544 61.63zM160 136c-8.75 0-16-7.125-16-16s7.25-16 16-16s16 7.125 16 16S168.8 136 160 136zM160 72c-8.75 0-16-7-16-16c0-8.75 7.25-16 16-16s16 7.125 16 16S168.8 72 160 72zM224 128C215.3 128 208 120.9 208 112S215.3 96 224 96s16 7 16 16C240 120.8 232.8 128 224 128zM224 64.25c-8.75 0-16-7-16-16c0-8.75 7.25-16 16-16s16 7.125 16 16S232.8 64.25 224 64.25z"],flask:[448,512,[],"f0c3","M437.2 403.5L319.1 215L319.1 64h7.1c13.25 0 23.1-10.75 23.1-24l-.0002-16c0-13.25-10.75-24-23.1-24H120C106.8 0 96.01 10.75 96.01 24l-.0002 16c0 13.25 10.75 24 23.1 24h7.1L128 215l-117.2 188.5C-18.48 450.6 15.27 512 70.89 512h306.2C432.7 512 466.5 450.5 437.2 403.5zM137.1 320l48.15-77.63C189.8 237.3 191.9 230.8 191.9 224l.0651-160h63.99l-.06 160c0 6.875 2.25 13.25 5.875 18.38L309.9 320H137.1z"],"flask-vial":[640,512,[],"e4f3","M160 442.5C149.1 446.1 139.2 448 128 448C74.98 448 32 405 32 352V64C14.33 64 0 49.67 0 32C0 14.33 14.33 0 32 0H224C241.7 0 256 14.33 256 32C256 49.67 241.7 64 224 64V309.9L175 389.4C165.2 405.4 160 423.8 160 442.5zM96 160H160V64H96V160zM512 0C529.7 0 544 14.33 544 32C544 49.67 529.7 64 512 64V214.9L629.7 406.2C636.4 417.2 640 429.7 640 442.6C640 480.9 608.9 512 570.6 512H261.4C223.1 512 191.1 480.9 191.1 442.6C191.1 429.7 195.6 417.2 202.3 406.2L319.1 214.9V64C302.3 64 287.1 49.67 287.1 32C287.1 14.33 302.3 0 319.1 0L512 0zM384 64V224C384 229.9 382.4 235.7 379.3 240.8L330.5 320H501.5L452.7 240.8C449.6 235.7 448 229.9 448 224V64H384z"],"floppy-disk":[448,512,[128426,128190,"save"],"f0c7","M433.1 129.1l-83.9-83.9C342.3 38.32 327.1 32 316.1 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V163.9C448 152.9 441.7 137.7 433.1 129.1zM224 416c-35.34 0-64-28.66-64-64s28.66-64 64-64s64 28.66 64 64S259.3 416 224 416zM320 208C320 216.8 312.8 224 304 224h-224C71.16 224 64 216.8 64 208v-96C64 103.2 71.16 96 80 96h224C312.8 96 320 103.2 320 112V208z"],"florin-sign":[384,512,[],"e184","M352 32C369.7 32 384 46.33 384 64C384 81.67 369.7 96 352 96H314.7C301.7 96 290.1 103.8 285.1 115.7L240 224H320C337.7 224 352 238.3 352 256C352 273.7 337.7 288 320 288H213.3L157.9 420.9C143 456.7 108.1 480 69.33 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H69.33C82.25 416 93.9 408.2 98.87 396.3L144 288H64C46.33 288 32 273.7 32 256C32 238.3 46.33 224 64 224H170.7L226.1 91.08C240.1 55.3 275.9 32 314.7 32H352z"],folder:[512,512,[128447,61716,128193,"folder-blank"],"f07b","M512 144v288c0 26.5-21.5 48-48 48h-416C21.5 480 0 458.5 0 432v-352C0 53.5 21.5 32 48 32h160l64 64h192C490.5 96 512 117.5 512 144z"],"folder-closed":[512,512,[],"e185","M464 96h-192l-64-64h-160C21.5 32 0 53.5 0 80V160h512V144C512 117.5 490.5 96 464 96zM0 432C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48V192H0V432z"],"folder-minus":[512,512,[],"f65d","M464 96h-192l-64-64h-160C21.5 32 0 53.5 0 80v352C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48v-288C512 117.5 490.5 96 464 96zM336 311.1H175.1C162.7 311.1 152 301.3 152 288c0-13.26 10.74-23.1 23.1-23.1h160C349.3 264 360 274.7 360 288S349.3 311.1 336 311.1z"],"folder-open":[576,512,[128449,61717,128194],"f07c","M147.8 192H480V144C480 117.5 458.5 96 432 96h-160l-64-64h-160C21.49 32 0 53.49 0 80v328.4l90.54-181.1C101.4 205.6 123.4 192 147.8 192zM543.1 224H147.8C135.7 224 124.6 230.8 119.2 241.7L0 480h447.1c12.12 0 23.2-6.852 28.62-17.69l96-192C583.2 249 567.7 224 543.1 224z"],"folder-plus":[512,512,[],"f65e","M464 96h-192l-64-64h-160C21.5 32 0 53.5 0 80v352C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48v-288C512 117.5 490.5 96 464 96zM336 311.1h-56v56C279.1 381.3 269.3 392 256 392c-13.27 0-23.1-10.74-23.1-23.1V311.1H175.1C162.7 311.1 152 301.3 152 288c0-13.26 10.74-23.1 23.1-23.1h56V207.1C232 194.7 242.7 184 256 184s23.1 10.74 23.1 23.1V264h56C349.3 264 360 274.7 360 288S349.3 311.1 336 311.1z"],"folder-tree":[576,512,[],"f802","M544 32h-112l-32-32H320c-17.62 0-32 14.38-32 32v160c0 17.62 14.38 32 32 32h224c17.62 0 32-14.38 32-32V64C576 46.38 561.6 32 544 32zM544 320h-112l-32-32H320c-17.62 0-32 14.38-32 32v160c0 17.62 14.38 32 32 32h224c17.62 0 32-14.38 32-32v-128C576 334.4 561.6 320 544 320zM64 16C64 7.125 56.88 0 48 0h-32C7.125 0 0 7.125 0 16V416c0 17.62 14.38 32 32 32h224v-64H64V160h192V96H64V16z"],font:[448,512,[],"f031","M416 416h-25.81L253.1 52.76c-4.688-12.47-16.57-20.76-29.91-20.76s-25.34 8.289-30.02 20.76L57.81 416H32c-17.67 0-32 14.31-32 32s14.33 32 32 32h96c17.67 0 32-14.31 32-32s-14.33-32-32-32H126.2l17.1-48h159.6l17.1 48H320c-17.67 0-32 14.31-32 32s14.33 32 32 32h96c17.67 0 32-14.31 32-32S433.7 416 416 416zM168.2 304L224 155.1l55.82 148.9H168.2z"],"font-awesome":[448,512,[62694,62501,"font-awesome-flag","font-awesome-logo-full"],"f2b4","M448 48V384c-63.09 22.54-82.34 32-119.5 32c-62.82 0-86.6-32-149.3-32C158.6 384 142.6 387.6 128 392.2v-64C142.6 323.6 158.6 320 179.2 320c62.73 0 86.51 32 149.3 32C348.9 352 364.1 349 384 342.7v-208C364.1 141 348.9 144 328.5 144c-62.82 0-86.6-32-149.3-32C128.4 112 104.3 132.6 64 140.7v307.3C64 465.7 49.67 480 32 480S0 465.7 0 448V63.1C0 46.33 14.33 32 31.1 32S64 46.33 64 63.1V76.66C104.3 68.63 128.4 48 179.2 48c62.73 0 86.51 32 149.3 32C365.7 80 384.9 70.54 448 48z"],football:[512,512,[127944,"football-ball"],"f44e","M16.17 337.5c0 44.98 7.565 83.54 13.98 107.9C35.22 464.3 50.46 496 174.9 496c9.566 0 19.59-.4707 29.84-1.271L17.33 307.3C16.53 317.6 16.17 327.7 16.17 337.5zM495.8 174.5c0-44.98-7.565-83.53-13.98-107.9c-4.688-17.54-18.34-31.23-36.04-35.95C435.5 27.91 392.9 16 337 16c-9.564 0-19.59 .4707-29.84 1.271l187.5 187.5C495.5 194.4 495.8 184.3 495.8 174.5zM26.77 248.8l236.3 236.3c142-36.1 203.9-150.4 222.2-221.1L248.9 26.87C106.9 62.96 45.07 177.2 26.77 248.8zM256 335.1c0 9.141-7.474 16-16 16c-4.094 0-8.188-1.564-11.31-4.689L164.7 283.3C161.6 280.2 160 276.1 160 271.1c0-8.529 6.865-16 16-16c4.095 0 8.189 1.562 11.31 4.688l64.01 64C254.4 327.8 256 331.9 256 335.1zM304 287.1c0 9.141-7.474 16-16 16c-4.094 0-8.188-1.564-11.31-4.689L212.7 235.3C209.6 232.2 208 228.1 208 223.1c0-9.141 7.473-16 16-16c4.094 0 8.188 1.562 11.31 4.688l64.01 64.01C302.5 279.8 304 283.9 304 287.1zM256 175.1c0-9.141 7.473-16 16-16c4.094 0 8.188 1.562 11.31 4.688l64.01 64.01c3.125 3.125 4.688 7.219 4.688 11.31c0 9.133-7.468 16-16 16c-4.094 0-8.189-1.562-11.31-4.688l-64.01-64.01C257.6 184.2 256 180.1 256 175.1z"],forward:[512,512,[9193],"f04e","M52.51 440.6l171.5-142.9V214.3L52.51 71.41C31.88 54.28 0 68.66 0 96.03v319.9C0 443.3 31.88 457.7 52.51 440.6zM308.5 440.6l192-159.1c15.25-12.87 15.25-36.37 0-49.24l-192-159.1c-20.63-17.12-52.51-2.749-52.51 24.62v319.9C256 443.3 287.9 457.7 308.5 440.6z"],"forward-fast":[512,512,[9197,"fast-forward"],"f050","M512 96.03v319.9c0 17.67-14.33 31.1-31.1 31.1C462.3 447.1 448 433.6 448 415.1V284.1l-171.5 156.5C255.9 457.7 224 443.3 224 415.1V284.1l-171.5 156.5C31.88 457.7 0 443.3 0 415.1V96.03c0-27.37 31.88-41.74 52.5-24.62L224 226.8V96.03c0-27.37 31.88-41.74 52.5-24.62L448 226.8V96.03c0-17.67 14.33-31.1 31.1-31.1C497.7 64.03 512 78.36 512 96.03z"],"forward-step":[320,512,["step-forward"],"f051","M287.1 447.1c17.67 0 31.1-14.33 31.1-32V96.03c0-17.67-14.33-32-32-32c-17.67 0-31.1 14.33-31.1 31.1v319.9C255.1 433.6 270.3 447.1 287.1 447.1zM52.51 440.6l192-159.1c7.625-6.436 11.43-15.53 11.43-24.62c0-9.094-3.809-18.18-11.43-24.62l-192-159.1C31.88 54.28 0 68.66 0 96.03v319.9C0 443.3 31.88 457.7 52.51 440.6z"],"franc-sign":[320,512,[],"e18f","M288 32C305.7 32 320 46.33 320 64C320 81.67 305.7 96 288 96H112V192H256C273.7 192 288 206.3 288 224C288 241.7 273.7 256 256 256H112V320H192C209.7 320 224 334.3 224 352C224 369.7 209.7 384 192 384H112V448C112 465.7 97.67 480 80 480C62.33 480 48 465.7 48 448V384H32C14.33 384 0 369.7 0 352C0 334.3 14.33 320 32 320H48V64C48 46.33 62.33 32 80 32H288z"],frog:[576,512,[],"f52e","M528 416h-32.07l-90.32-96.34l140.6-79.03c18.38-10.25 29.75-29.62 29.75-50.62c0-21.5-11.75-41-30.5-51.25c-40.5-22.25-99.07-41.43-99.07-41.43C439.6 60.19 407.3 32 368 32s-71.77 28.25-78.52 65.5C126.7 113-.4999 250.1 .0001 417C.1251 451.9 29.13 480 64 480h304c8.875 0 16-7.125 16-16c0-26.51-21.49-48-47.1-48H284.3l23.93-32.38c24.25-36.13 10.38-88.25-33.63-106.5C250.8 267.1 223 272.4 202.4 288L169.6 312.5c-7.125 5.375-17.12 4-22.38-3.125c-5.375-7.125-4-17.12 3.125-22.38l34.75-26.12c36.87-27.62 88.37-27.62 125.1 0c10.88 8.125 45.88 39 40.88 93.13L469.6 480h90.38c8.875 0 16-7.125 16-16C576 437.5 554.5 416 528 416zM344 112c0-13.25 10.75-24 24-24s24 10.75 24 24s-10.75 24-24 24S344 125.3 344 112z"],futbol:[512,512,[9917,"futbol-ball","soccer-ball"],"f1e3","M177.1 228.6L207.9 320h96.5l29.62-91.38L256 172.1L177.1 228.6zM255.1 0C114.6 0 .0001 114.6 .0001 256S114.6 512 256 512s255.1-114.6 255.1-255.1S397.4 0 255.1 0zM416.6 360.9l-85.4-1.297l-25.15 81.59C290.1 445.5 273.4 448 256 448s-34.09-2.523-50.09-6.859L180.8 359.6l-85.4 1.297c-18.12-27.66-29.15-60.27-30.88-95.31L134.3 216.4L106.6 135.6c21.16-26.21 49.09-46.61 81.06-58.84L256 128l68.29-51.22c31.98 12.23 59.9 32.64 81.06 58.84L377.7 216.4l69.78 49.1C445.8 300.6 434.8 333.2 416.6 360.9z"],g:[448,512,[103],"47","M448 256c0 143.4-118.6 222.3-225 222.3c-132.3 0-222.1-106.2-222.1-222.4c0-124.4 100.9-223.9 223.1-223.9c84.84 0 167.8 55.28 167.8 88.2c0 18.28-14.95 32-32 32c-31.04 0-46.79-56.16-135.8-56.16c-87.66 0-159.1 70.66-159.1 159.8c0 34.81 27.19 158.8 159.1 158.8c79.45 0 144.6-55.1 158.1-126.7h-134.1c-17.67 0-32-14.33-32-32s14.33-31.1 32-31.1H416C433.7 224 448 238.3 448 256z"],gamepad:[640,512,[],"f11b","M448 64H192C85.96 64 0 149.1 0 256s85.96 192 192 192h256c106 0 192-85.96 192-192S554 64 448 64zM247.1 280h-32v32c0 13.2-10.78 24-23.98 24c-13.2 0-24.02-10.8-24.02-24v-32L136 279.1C122.8 279.1 111.1 269.2 111.1 256c0-13.2 10.85-24.01 24.05-24.01L167.1 232v-32c0-13.2 10.82-24 24.02-24c13.2 0 23.98 10.8 23.98 24v32h32c13.2 0 24.02 10.8 24.02 24C271.1 269.2 261.2 280 247.1 280zM431.1 344c-22.12 0-39.1-17.87-39.1-39.1s17.87-40 39.1-40s39.1 17.88 39.1 40S454.1 344 431.1 344zM495.1 248c-22.12 0-39.1-17.87-39.1-39.1s17.87-40 39.1-40c22.12 0 39.1 17.88 39.1 40S518.1 248 495.1 248z"],"gas-pump":[512,512,[9981],"f52f","M32 64C32 28.65 60.65 0 96 0H256C291.3 0 320 28.65 320 64V256H328C376.6 256 416 295.4 416 344V376C416 389.3 426.7 400 440 400C453.3 400 464 389.3 464 376V221.1C436.4 214.9 416 189.8 416 160V96L384 64C375.2 55.16 375.2 40.84 384 32C392.8 23.16 407.2 23.16 416 32L493.3 109.3C505.3 121.3 512 137.5 512 154.5V376C512 415.8 479.8 448 440 448C400.2 448 368 415.8 368 376V344C368 321.9 350.1 303.1 328 303.1H320V448C337.7 448 352 462.3 352 480C352 497.7 337.7 512 320 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V64zM96 176C96 184.8 103.2 192 112 192H240C248.8 192 256 184.8 256 176V80C256 71.16 248.8 64 240 64H112C103.2 64 96 71.16 96 80V176z"],gauge:[512,512,["dashboard","gauge-med","tachometer-alt-average"],"f624","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM280 292.7V88C280 74.75 269.3 64 256 64C242.7 64 232 74.75 232 88V292.7C208.5 302.1 192 325.1 192 352C192 387.3 220.7 416 256 416C291.3 416 320 387.3 320 352C320 325.1 303.5 302.1 280 292.7zM144 176C161.7 176 176 161.7 176 144C176 126.3 161.7 112 144 112C126.3 112 112 126.3 112 144C112 161.7 126.3 176 144 176zM96 224C78.33 224 64 238.3 64 256C64 273.7 78.33 288 96 288C113.7 288 128 273.7 128 256C128 238.3 113.7 224 96 224zM416 288C433.7 288 448 273.7 448 256C448 238.3 433.7 224 416 224C398.3 224 384 238.3 384 256C384 273.7 398.3 288 416 288zM368 112C350.3 112 336 126.3 336 144C336 161.7 350.3 176 368 176C385.7 176 400 161.7 400 144C400 126.3 385.7 112 368 112z"],"gauge-high":[512,512,[62461,"tachometer-alt","tachometer-alt-fast"],"f625","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM256 64C238.3 64 224 78.33 224 96C224 113.7 238.3 128 256 128C273.7 128 288 113.7 288 96C288 78.33 273.7 64 256 64zM256 416C291.3 416 320 387.3 320 352C320 334.6 313.1 318.9 301.9 307.4L365.1 161.7C371.3 149.5 365.8 135.4 353.7 130C341.5 124.7 327.4 130.2 322 142.3L257.9 288C257.3 288 256.6 287.1 256 287.1C220.7 287.1 192 316.7 192 352C192 387.3 220.7 416 256 416V416zM144 112C126.3 112 112 126.3 112 144C112 161.7 126.3 176 144 176C161.7 176 176 161.7 176 144C176 126.3 161.7 112 144 112zM96 288C113.7 288 128 273.7 128 256C128 238.3 113.7 224 96 224C78.33 224 64 238.3 64 256C64 273.7 78.33 288 96 288zM416 224C398.3 224 384 238.3 384 256C384 273.7 398.3 288 416 288C433.7 288 448 273.7 448 256C448 238.3 433.7 224 416 224z"],"gauge-simple":[512,512,["gauge-simple-med","tachometer-average"],"f629","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM280 292.7V88C280 74.75 269.3 64 256 64C242.7 64 232 74.75 232 88V292.7C208.5 302.1 192 325.1 192 352C192 387.3 220.7 416 256 416C291.3 416 320 387.3 320 352C320 325.1 303.5 302.1 280 292.7z"],"gauge-simple-high":[512,512,[61668,"tachometer","tachometer-fast"],"f62a","M512 256C512 397.4 397.4 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256zM304.7 310.4L381.3 163.1C387.4 151.3 382.8 136.8 371.1 130.7C359.3 124.6 344.8 129.2 338.7 140.9L262.1 288.3C260.1 288.1 258.1 287.1 255.1 287.1C220.7 287.1 191.1 316.7 191.1 352C191.1 387.3 220.7 416 255.1 416C291.3 416 320 387.3 320 352C320 336.1 314.2 321.6 304.7 310.4L304.7 310.4z"],gavel:[512,512,["legal"],"f0e3","M512 216.3c0-6.125-2.344-12.25-7.031-16.93L482.3 176.8c-4.688-4.686-10.84-7.028-16.1-7.028s-12.31 2.343-16.1 7.028l-5.625 5.625L329.6 69.28l5.625-5.625c4.687-4.688 7.03-10.84 7.03-16.1s-2.343-12.31-7.03-16.1l-22.62-22.62C307.9 2.344 301.8 0 295.7 0s-12.15 2.344-16.84 7.031L154.2 131.5C149.6 136.2 147.2 142.3 147.2 148.5s2.344 12.25 7.031 16.94l22.62 22.62c4.688 4.688 10.84 7.031 16.1 7.031c6.156 0 12.31-2.344 16.1-7.031l5.625-5.625l113.1 113.1l-5.625 5.621c-4.688 4.688-7.031 10.84-7.031 16.1s2.344 12.31 7.031 16.1l22.62 22.62c4.688 4.688 10.81 7.031 16.94 7.031s12.25-2.344 16.94-7.031l124.5-124.6C509.7 228.5 512 222.5 512 216.3zM227.8 238.1L169.4 297.4C163.1 291.1 154.9 288 146.7 288S130.4 291.1 124.1 297.4l-114.7 114.7c-6.25 6.248-9.375 14.43-9.375 22.62s3.125 16.37 9.375 22.62l45.25 45.25C60.87 508.9 69.06 512 77.25 512s16.37-3.125 22.62-9.375l114.7-114.7c6.25-6.25 9.376-14.44 9.376-22.62c0-8.185-3.125-16.37-9.374-22.62l58.43-58.43L227.8 238.1z"],gear:[512,512,[9881,"cog"],"f013","M495.9 166.6C499.2 175.2 496.4 184.9 489.6 191.2L446.3 230.6C447.4 238.9 448 247.4 448 256C448 264.6 447.4 273.1 446.3 281.4L489.6 320.8C496.4 327.1 499.2 336.8 495.9 345.4C491.5 357.3 486.2 368.8 480.2 379.7L475.5 387.8C468.9 398.8 461.5 409.2 453.4 419.1C447.4 426.2 437.7 428.7 428.9 425.9L373.2 408.1C359.8 418.4 344.1 427 329.2 433.6L316.7 490.7C314.7 499.7 307.7 506.1 298.5 508.5C284.7 510.8 270.5 512 255.1 512C241.5 512 227.3 510.8 213.5 508.5C204.3 506.1 197.3 499.7 195.3 490.7L182.8 433.6C167 427 152.2 418.4 138.8 408.1L83.14 425.9C74.3 428.7 64.55 426.2 58.63 419.1C50.52 409.2 43.12 398.8 36.52 387.8L31.84 379.7C25.77 368.8 20.49 357.3 16.06 345.4C12.82 336.8 15.55 327.1 22.41 320.8L65.67 281.4C64.57 273.1 64 264.6 64 256C64 247.4 64.57 238.9 65.67 230.6L22.41 191.2C15.55 184.9 12.82 175.3 16.06 166.6C20.49 154.7 25.78 143.2 31.84 132.3L36.51 124.2C43.12 113.2 50.52 102.8 58.63 92.95C64.55 85.8 74.3 83.32 83.14 86.14L138.8 103.9C152.2 93.56 167 84.96 182.8 78.43L195.3 21.33C197.3 12.25 204.3 5.04 213.5 3.51C227.3 1.201 241.5 0 256 0C270.5 0 284.7 1.201 298.5 3.51C307.7 5.04 314.7 12.25 316.7 21.33L329.2 78.43C344.1 84.96 359.8 93.56 373.2 103.9L428.9 86.14C437.7 83.32 447.4 85.8 453.4 92.95C461.5 102.8 468.9 113.2 475.5 124.2L480.2 132.3C486.2 143.2 491.5 154.7 495.9 166.6V166.6zM256 336C300.2 336 336 300.2 336 255.1C336 211.8 300.2 175.1 256 175.1C211.8 175.1 176 211.8 176 255.1C176 300.2 211.8 336 256 336z"],gears:[640,512,["cogs"],"f085","M286.3 155.1C287.4 161.9 288 168.9 288 175.1C288 183.1 287.4 190.1 286.3 196.9L308.5 216.7C315.5 223 318.4 232.1 314.7 241.7C312.4 246.1 309.9 252.2 307.1 257.2L304 262.6C300.1 267.6 297.7 272.4 294.2 277.1C288.5 284.7 278.5 287.2 269.5 284.2L241.2 274.9C230.5 283.8 218.3 290.9 205 295.9L198.1 324.9C197 334.2 189.8 341.6 180.4 342.8C173.7 343.6 166.9 344 160 344C153.1 344 146.3 343.6 139.6 342.8C130.2 341.6 122.1 334.2 121 324.9L114.1 295.9C101.7 290.9 89.5 283.8 78.75 274.9L50.53 284.2C41.54 287.2 31.52 284.7 25.82 277.1C22.28 272.4 18.98 267.5 15.94 262.5L12.92 257.2C10.13 252.2 7.592 247 5.324 241.7C1.62 232.1 4.458 223 11.52 216.7L33.7 196.9C32.58 190.1 31.1 183.1 31.1 175.1C31.1 168.9 32.58 161.9 33.7 155.1L11.52 135.3C4.458 128.1 1.62 119 5.324 110.3C7.592 104.1 10.13 99.79 12.91 94.76L15.95 89.51C18.98 84.46 22.28 79.58 25.82 74.89C31.52 67.34 41.54 64.83 50.53 67.79L78.75 77.09C89.5 68.25 101.7 61.13 114.1 56.15L121 27.08C122.1 17.8 130.2 10.37 139.6 9.231C146.3 8.418 153.1 8 160 8C166.9 8 173.7 8.418 180.4 9.23C189.8 10.37 197 17.8 198.1 27.08L205 56.15C218.3 61.13 230.5 68.25 241.2 77.09L269.5 67.79C278.5 64.83 288.5 67.34 294.2 74.89C297.7 79.56 300.1 84.42 304 89.44L307.1 94.83C309.9 99.84 312.4 105 314.7 110.3C318.4 119 315.5 128.1 308.5 135.3L286.3 155.1zM160 127.1C133.5 127.1 112 149.5 112 175.1C112 202.5 133.5 223.1 160 223.1C186.5 223.1 208 202.5 208 175.1C208 149.5 186.5 127.1 160 127.1zM484.9 478.3C478.1 479.4 471.1 480 464 480C456.9 480 449.9 479.4 443.1 478.3L423.3 500.5C416.1 507.5 407 510.4 398.3 506.7C393 504.4 387.8 501.9 382.8 499.1L377.4 496C372.4 492.1 367.6 489.7 362.9 486.2C355.3 480.5 352.8 470.5 355.8 461.5L365.1 433.2C356.2 422.5 349.1 410.3 344.1 397L315.1 390.1C305.8 389 298.4 381.8 297.2 372.4C296.4 365.7 296 358.9 296 352C296 345.1 296.4 338.3 297.2 331.6C298.4 322.2 305.8 314.1 315.1 313L344.1 306.1C349.1 293.7 356.2 281.5 365.1 270.8L355.8 242.5C352.8 233.5 355.3 223.5 362.9 217.8C367.6 214.3 372.5 210.1 377.5 207.9L382.8 204.9C387.8 202.1 392.1 199.6 398.3 197.3C407 193.6 416.1 196.5 423.3 203.5L443.1 225.7C449.9 224.6 456.9 224 464 224C471.1 224 478.1 224.6 484.9 225.7L504.7 203.5C511 196.5 520.1 193.6 529.7 197.3C535 199.6 540.2 202.1 545.2 204.9L550.5 207.9C555.5 210.1 560.4 214.3 565.1 217.8C572.7 223.5 575.2 233.5 572.2 242.5L562.9 270.8C571.8 281.5 578.9 293.7 583.9 306.1L612.9 313C622.2 314.1 629.6 322.2 630.8 331.6C631.6 338.3 632 345.1 632 352C632 358.9 631.6 365.7 630.8 372.4C629.6 381.8 622.2 389 612.9 390.1L583.9 397C578.9 410.3 571.8 422.5 562.9 433.2L572.2 461.5C575.2 470.5 572.7 480.5 565.1 486.2C560.4 489.7 555.6 492.1 550.6 496L545.2 499.1C540.2 501.9 534.1 504.4 529.7 506.7C520.1 510.4 511 507.5 504.7 500.5L484.9 478.3zM512 352C512 325.5 490.5 304 464 304C437.5 304 416 325.5 416 352C416 378.5 437.5 400 464 400C490.5 400 512 378.5 512 352z"],gem:[512,512,[128142],"f3a5","M378.7 32H133.3L256 182.7L378.7 32zM512 192l-107.4-141.3L289.6 192H512zM107.4 50.67L0 192h222.4L107.4 50.67zM244.3 474.9C247.3 478.2 251.6 480 256 480s8.653-1.828 11.67-5.062L510.6 224H1.365L244.3 474.9z"],genderless:[384,512,[],"f22d","M192 80C94.83 80 16 158.8 16 256c0 97.17 78.83 176 176 176s176-78.83 176-176C368 158.8 289.2 80 192 80zM192 352c-52.95 0-96-43.05-96-96c0-52.95 43.05-96 96-96s96 43.05 96 96C288 308.9 244.1 352 192 352z"],ghost:[384,512,[128123],"f6e2","M186.1 .1032c-105.1 3.126-186.1 94.75-186.1 199.9v264c0 14.25 17.3 21.38 27.3 11.25l24.95-18.5c6.625-5.001 16-4.001 21.5 2.25l43 48.31c6.25 6.251 16.37 6.251 22.62 0l40.62-45.81c6.375-7.251 17.62-7.251 24 0l40.63 45.81c6.25 6.251 16.38 6.251 22.62 0l43-48.31c5.5-6.251 14.88-7.251 21.5-2.25l24.95 18.5c10 10.13 27.3 3.002 27.3-11.25V192C384 83.98 294.9-3.147 186.1 .1032zM128 224c-17.62 0-31.1-14.38-31.1-32.01s14.38-32.01 31.1-32.01s32 14.38 32 32.01S145.6 224 128 224zM256 224c-17.62 0-32-14.38-32-32.01s14.38-32.01 32-32.01c17.62 0 32 14.38 32 32.01S273.6 224 256 224z"],gift:[512,512,[127873],"f06b","M152 0H154.2C186.1 0 215.7 16.91 231.9 44.45L256 85.46L280.1 44.45C296.3 16.91 325.9 0 357.8 0H360C408.6 0 448 39.4 448 88C448 102.4 444.5 115.1 438.4 128H480C497.7 128 512 142.3 512 160V224C512 241.7 497.7 256 480 256H32C14.33 256 0 241.7 0 224V160C0 142.3 14.33 128 32 128H73.6C67.46 115.1 64 102.4 64 88C64 39.4 103.4 0 152 0zM190.5 68.78C182.9 55.91 169.1 48 154.2 48H152C129.9 48 112 65.91 112 88C112 110.1 129.9 128 152 128H225.3L190.5 68.78zM360 48H357.8C342.9 48 329.1 55.91 321.5 68.78L286.7 128H360C382.1 128 400 110.1 400 88C400 65.91 382.1 48 360 48V48zM32 288H224V512H80C53.49 512 32 490.5 32 464V288zM288 512V288H480V464C480 490.5 458.5 512 432 512H288z"],gifts:[640,512,[],"f79c","M192.5 55.09L217.9 36.59C228.6 28.79 243.6 31.16 251.4 41.88C259.2 52.6 256.8 67.61 246.1 75.41L217.8 95.1H240C256.9 95.1 271.7 104.7 280.3 117.9C257.3 135.7 241.9 162.1 240.2 193.1C212.5 201 192 226.1 192 256V480C192 491.7 195.1 502.6 200.6 512H48C21.49 512 0 490.5 0 464V144C0 117.5 21.49 96 48 96H70.2L41.88 75.41C31.16 67.61 28.79 52.6 36.59 41.88C44.39 31.16 59.4 28.79 70.12 36.59L97.55 56.54L89.23 31.59C85.04 19.01 91.84 5.423 104.4 1.232C116.1-2.96 130.6 3.836 134.8 16.41L144.7 46.17L155.4 15.99C159.8 3.493 173.5-3.048 186 1.377C198.5 5.802 205 19.52 200.6 32.01L192.5 55.09zM344.2 127.1C366.6 127.1 387.8 138.4 401.5 156.2L432 195.8L462.5 156.2C476.2 138.4 497.4 127.1 519.8 127.1C559.5 127.1 592 160.1 592 199.1C592 208.4 590.6 216.5 587.9 223.1H592C618.5 223.1 640 245.5 640 271.1V352H448V255.1H416V352H224V271.1C224 245.5 245.5 223.1 272 223.1H276.1C273.4 216.5 272 208.4 272 199.1C272 160.1 304.5 127.1 344.2 127.1H344.2zM363.5 185.5C358.9 179.5 351.7 175.1 344.2 175.1C330.8 175.1 320 186.9 320 199.1C320 213.3 330.7 223.1 344 223.1H393.1L363.5 185.5zM519.8 175.1C512.3 175.1 505.1 179.5 500.5 185.5L470.9 223.1H520C533.3 223.1 544 213.3 544 199.1C544 186.9 533.2 175.1 519.8 175.1H519.8zM224 464V384H416V512H272C245.5 512 224 490.5 224 464zM448 512V384H640V464C640 490.5 618.5 512 592 512H448z"],"glass-water":[384,512,[],"e4f4","M352 0C360.9 0 369.4 3.692 375.4 10.19C381.5 16.69 384.6 25.42 383.9 34.28L355.1 437.7C352.1 479.6 317.3 512 275.3 512H108.7C66.72 512 31.89 479.6 28.9 437.7L.0813 34.28C-.5517 25.42 2.527 16.69 8.58 10.19C14.63 3.692 23.12 0 32 0L352 0zM97.19 168.6C116.6 178.3 139.4 178.3 158.8 168.6C179.7 158.1 204.3 158.1 225.2 168.6C244.6 178.3 267.4 178.3 286.8 168.6L311 156.5L317.6 64H66.37L72.97 156.5L97.19 168.6z"],"glass-water-droplet":[384,512,[],"e4f5","M256 196C256 229.1 227.3 256 192 256C156.7 256 128 229.1 128 196C128 171.1 161.7 125.9 180.2 102.5C186.3 94.77 197.7 94.77 203.8 102.5C222.3 125.9 256 171.1 256 196zM352 0C360.9 0 369.4 3.692 375.4 10.19C381.5 16.69 384.6 25.42 383.9 34.28L355.1 437.7C352.1 479.6 317.3 512 275.3 512H108.7C66.72 512 31.89 479.6 28.9 437.7L.0813 34.28C-.5517 25.42 2.527 16.69 8.58 10.19C14.63 3.692 23.12 0 32 0L352 0zM96 304C116.1 314.1 139.9 314.1 160 304C180.1 293.9 203.9 293.9 224 304C244.1 314.1 267.9 314.1 288 304L300.1 297.5L317.6 64H66.37L83.05 297.5L96 304z"],glasses:[576,512,[],"f530","M574.1 280.4l-45.38-181.8c-5.875-23.63-21.62-44-43-55.75c-21.5-11.75-46.1-14.13-70.25-6.375l-15.25 5.125c-8.375 2.75-12.87 11.88-10 20.25l5 15.13c2.75 8.375 11.88 12.88 20.25 10.13l13.12-4.375c10.88-3.625 23-3.625 33.25 1.75c10.25 5.375 17.5 14.5 20.38 25.75l38.38 153.9c-22.12-6.875-49.75-12.5-81.13-12.5c-34.88 0-73.1 7-114.9 26.75H251.4C210.5 258.6 171.4 251.6 136.5 251.6c-31.38 0-59 5.625-81.12 12.5l38.38-153.9c2.875-11.25 10.12-20.38 20.5-25.75C124.4 79.12 136.5 79.12 147.4 82.74l13.12 4.375c8.375 2.75 17.5-1.75 20.25-10.13l5-15.13C188.6 53.49 184.1 44.37 175.6 41.62l-15.25-5.125c-23.13-7.75-48.75-5.375-70.13 6.375c-21.37 11.75-37.12 32.13-43 55.75L1.875 280.4C.6251 285.4 .0001 290.6 .0001 295.9v70.25C.0001 428.1 51.63 480 115.3 480h37.13c60.25 0 110.4-46 114.9-105.4l2.875-38.63h35.75l2.875 38.63C313.3 433.1 363.4 480 423.6 480h37.13c63.62 0 115.2-51 115.2-113.9V295.9C576 290.6 575.4 285.5 574.1 280.4zM203.4 369.7c-2 26-24.38 46.25-51 46.25H115.2C87 415.1 64 393.6 64 366.1v-37.5c18.12-6.5 43.38-13 72.62-13c23.88 0 47.25 4.375 69.88 13L203.4 369.7zM512 366.1c0 27.5-23 49.88-51.25 49.88h-37.13c-26.62 0-49-20.25-51-46.25l-3.125-41.13c22.62-8.625 46.13-13 70-13c29 0 54.38 6.5 72.5 13V366.1z"],globe:[512,512,[127760],"f0ac","M352 256C352 278.2 350.8 299.6 348.7 320H163.3C161.2 299.6 159.1 278.2 159.1 256C159.1 233.8 161.2 212.4 163.3 192H348.7C350.8 212.4 352 233.8 352 256zM503.9 192C509.2 212.5 512 233.9 512 256C512 278.1 509.2 299.5 503.9 320H380.8C382.9 299.4 384 277.1 384 256C384 234 382.9 212.6 380.8 192H503.9zM493.4 160H376.7C366.7 96.14 346.9 42.62 321.4 8.442C399.8 29.09 463.4 85.94 493.4 160zM344.3 160H167.7C173.8 123.6 183.2 91.38 194.7 65.35C205.2 41.74 216.9 24.61 228.2 13.81C239.4 3.178 248.7 0 256 0C263.3 0 272.6 3.178 283.8 13.81C295.1 24.61 306.8 41.74 317.3 65.35C328.8 91.38 338.2 123.6 344.3 160H344.3zM18.61 160C48.59 85.94 112.2 29.09 190.6 8.442C165.1 42.62 145.3 96.14 135.3 160H18.61zM131.2 192C129.1 212.6 127.1 234 127.1 256C127.1 277.1 129.1 299.4 131.2 320H8.065C2.8 299.5 0 278.1 0 256C0 233.9 2.8 212.5 8.065 192H131.2zM194.7 446.6C183.2 420.6 173.8 388.4 167.7 352H344.3C338.2 388.4 328.8 420.6 317.3 446.6C306.8 470.3 295.1 487.4 283.8 498.2C272.6 508.8 263.3 512 255.1 512C248.7 512 239.4 508.8 228.2 498.2C216.9 487.4 205.2 470.3 194.7 446.6H194.7zM190.6 503.6C112.2 482.9 48.59 426.1 18.61 352H135.3C145.3 415.9 165.1 469.4 190.6 503.6V503.6zM321.4 503.6C346.9 469.4 366.7 415.9 376.7 352H493.4C463.4 426.1 399.8 482.9 321.4 503.6V503.6z"],"golf-ball-tee":[384,512,["golf-ball"],"f450","M96 399.1c0 17.67 14.33 31.1 32 31.1s32 14.33 32 31.1v48h64v-48c0-17.67 14.33-31.1 32-31.1s32-14.33 32-31.1v-16H96V399.1zM192 .0001c-106 0-192 86.68-192 193.6c0 65.78 32.82 123.5 82.52 158.4h218.1C351.2 317.1 384 259.4 384 193.6C384 86.68 298 .0001 192 .0001zM179 205.1C183 206.9 187.4 208 192 208c17.53 0 31.74-14.33 31.74-31.1c0-4.688-1.111-9.062-2.904-13.07c11.03 5.016 18.77 16.08 18.77 29.07c0 17.67-14.21 31.1-31.74 31.1C194.1 224 184 216.2 179 205.1zM223.7 303.1c-12.88 0-23.86-7.812-28.83-18.93c3.977 1.809 8.316 2.93 12.96 2.93c17.53 0 31.74-14.33 31.74-31.1c0-4.688-1.109-9.062-2.904-13.07c11.03 5.016 18.77 16.08 18.77 29.07C255.5 289.7 241.3 303.1 223.7 303.1zM287.2 240c-12.88 0-23.86-7.812-28.83-18.93c3.977 1.809 8.316 2.93 12.96 2.93c17.53 0 31.73-14.33 31.73-31.1c0-4.688-1.109-9.062-2.902-13.07C311.2 183.9 318.9 195 318.9 208C318.9 225.7 304.7 240 287.2 240z"],gopuram:[512,512,[],"f664","M120 0C133.3 0 144 10.75 144 24V32H184V24C184 10.75 194.7 0 208 0C221.3 0 232 10.75 232 24V32H280V24C280 10.75 290.7 0 304 0C317.3 0 328 10.75 328 24V32H368V24C368 10.75 378.7 0 392 0C405.3 0 416 10.75 416 24V128C433.7 128 448 142.3 448 160V224C465.7 224 480 238.3 480 256V352C497.7 352 512 366.3 512 384V480C512 497.7 497.7 512 480 512H416V352H384V224H352V128H320V224H352V352H384V512H304V464C304 437.5 282.5 416 256 416C229.5 416 208 437.5 208 464V512H128V352H160V224H192V128H160V224H128V352H96V512H32C14.33 512 0 497.7 0 480V384C0 366.3 14.33 352 32 352V256C32 238.3 46.33 224 64 224V160C64 142.3 78.33 128 96 128V24C96 10.75 106.7 0 120 0zM256 272C238.3 272 224 286.3 224 304V352H288V304C288 286.3 273.7 272 256 272zM224 224H288V192C288 174.3 273.7 160 256 160C238.3 160 224 174.3 224 192V224z"],"graduation-cap":[640,512,[127891,"mortar-board"],"f19d","M623.1 136.9l-282.7-101.2c-13.73-4.91-28.7-4.91-42.43 0L16.05 136.9C6.438 140.4 0 149.6 0 160s6.438 19.65 16.05 23.09L76.07 204.6c-11.89 15.8-20.26 34.16-24.55 53.95C40.05 263.4 32 274.8 32 288c0 9.953 4.814 18.49 11.94 24.36l-24.83 149C17.48 471.1 25 480 34.89 480H93.11c9.887 0 17.41-8.879 15.78-18.63l-24.83-149C91.19 306.5 96 297.1 96 288c0-10.29-5.174-19.03-12.72-24.89c4.252-17.76 12.88-33.82 24.94-47.03l190.6 68.23c13.73 4.91 28.7 4.91 42.43 0l282.7-101.2C633.6 179.6 640 170.4 640 160S633.6 140.4 623.1 136.9zM351.1 314.4C341.7 318.1 330.9 320 320 320c-10.92 0-21.69-1.867-32-5.555L142.8 262.5L128 405.3C128 446.6 213.1 480 320 480c105.1 0 192-33.4 192-74.67l-14.78-142.9L351.1 314.4z"],"greater-than":[384,512,[62769],"3e","M32.03 448c-11.75 0-23.05-6.469-28.66-17.69c-7.906-15.81-1.5-35.03 14.31-42.94l262.8-131.4L17.69 124.6C1.875 116.7-4.531 97.51 3.375 81.7c7.891-15.81 27.06-22.19 42.94-14.31l320 160C377.2 232.8 384 243.9 384 256c0 12.12-6.844 23.19-17.69 28.63l-320 160C41.72 446.9 36.83 448 32.03 448z"],"greater-than-equal":[448,512,[],"f532","M34.28 331.9c5.016 12.53 17.03 20.12 29.73 20.12c3.953 0 7.969-.7187 11.88-2.281l320-127.1C408 216.9 416 205.1 416 192s-7.969-24.85-20.11-29.72l-320-128c-16.47-6.594-35.05 1.406-41.61 17.84C27.72 68.55 35.7 87.17 52.11 93.73l245.7 98.28L52.11 290.3C35.7 296.9 27.72 315.5 34.28 331.9zM416 416H32c-17.67 0-32 14.31-32 31.99s14.33 32.01 32 32.01h384c17.67 0 32-14.32 32-32.01S433.7 416 416 416z"],grip:[448,512,["grip-horizontal"],"f58d","M128 184C128 206.1 110.1 224 88 224H40C17.91 224 0 206.1 0 184V136C0 113.9 17.91 96 40 96H88C110.1 96 128 113.9 128 136V184zM128 376C128 398.1 110.1 416 88 416H40C17.91 416 0 398.1 0 376V328C0 305.9 17.91 288 40 288H88C110.1 288 128 305.9 128 328V376zM160 136C160 113.9 177.9 96 200 96H248C270.1 96 288 113.9 288 136V184C288 206.1 270.1 224 248 224H200C177.9 224 160 206.1 160 184V136zM288 376C288 398.1 270.1 416 248 416H200C177.9 416 160 398.1 160 376V328C160 305.9 177.9 288 200 288H248C270.1 288 288 305.9 288 328V376zM320 136C320 113.9 337.9 96 360 96H408C430.1 96 448 113.9 448 136V184C448 206.1 430.1 224 408 224H360C337.9 224 320 206.1 320 184V136zM448 376C448 398.1 430.1 416 408 416H360C337.9 416 320 398.1 320 376V328C320 305.9 337.9 288 360 288H408C430.1 288 448 305.9 448 328V376z"],"grip-lines":[448,512,[],"f7a4","M416 288C433.7 288 448 302.3 448 320C448 337.7 433.7 352 416 352H32C14.33 352 0 337.7 0 320C0 302.3 14.33 288 32 288H416zM416 160C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224H32C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H416z"],"grip-lines-vertical":[192,512,[],"f7a5","M64 448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V64C0 46.33 14.33 32 32 32C49.67 32 64 46.33 64 64V448zM192 448C192 465.7 177.7 480 160 480C142.3 480 128 465.7 128 448V64C128 46.33 142.3 32 160 32C177.7 32 192 46.33 192 64V448z"],"grip-vertical":[320,512,[],"f58e","M88 352C110.1 352 128 369.9 128 392V440C128 462.1 110.1 480 88 480H40C17.91 480 0 462.1 0 440V392C0 369.9 17.91 352 40 352H88zM280 352C302.1 352 320 369.9 320 392V440C320 462.1 302.1 480 280 480H232C209.9 480 192 462.1 192 440V392C192 369.9 209.9 352 232 352H280zM40 320C17.91 320 0 302.1 0 280V232C0 209.9 17.91 192 40 192H88C110.1 192 128 209.9 128 232V280C128 302.1 110.1 320 88 320H40zM280 192C302.1 192 320 209.9 320 232V280C320 302.1 302.1 320 280 320H232C209.9 320 192 302.1 192 280V232C192 209.9 209.9 192 232 192H280zM40 160C17.91 160 0 142.1 0 120V72C0 49.91 17.91 32 40 32H88C110.1 32 128 49.91 128 72V120C128 142.1 110.1 160 88 160H40zM280 32C302.1 32 320 49.91 320 72V120C320 142.1 302.1 160 280 160H232C209.9 160 192 142.1 192 120V72C192 49.91 209.9 32 232 32H280z"],"group-arrows-rotate":[512,512,[],"e4f6","M159.7 89.85C159.9 91.87 159.1 93.93 159.1 96C159.1 131.3 131.3 160 95.1 160C93.92 160 91.87 159.9 89.85 159.7C82.34 172.6 76.29 186.5 71.94 201.1C66.9 218.1 49.08 227.7 32.15 222.7C15.21 217.6 5.562 199.8 10.6 182.9C17.01 161.4 26.15 141 37.64 122.3C34.02 114.3 31.1 105.4 31.1 96C31.1 60.65 60.65 32 95.1 32C105.4 32 114.3 34.02 122.3 37.64C141 26.16 161.4 17.01 182.9 10.61C199.8 5.566 217.6 15.21 222.7 32.15C227.7 49.09 218.1 66.91 201.1 71.95C186.5 76.3 172.6 82.34 159.7 89.85V89.85zM389.7 37.64C397.7 34.02 406.6 32 415.1 32C451.3 32 479.1 60.65 479.1 96C479.1 105.4 477.1 114.3 474.4 122.3C485.8 141 494.1 161.4 501.4 182.9C506.4 199.8 496.8 217.6 479.8 222.7C462.9 227.7 445.1 218.1 440.1 201.1C435.7 186.5 429.7 172.6 422.1 159.7C420.1 159.9 418.1 160 416 160C380.7 160 352 131.3 352 96C352 93.93 352.1 91.87 352.3 89.85C339.4 82.34 325.5 76.3 310.9 71.95C293.9 66.91 284.3 49.09 289.3 32.15C294.4 15.21 312.2 5.566 329.1 10.61C350.6 17.01 370.1 26.16 389.7 37.64L389.7 37.64zM89.85 352.3C91.87 352.1 93.92 352 95.1 352C131.3 352 159.1 380.7 159.1 416C159.1 418.1 159.9 420.1 159.7 422.2C172.6 429.7 186.5 435.7 201.1 440.1C218.1 445.1 227.7 462.9 222.7 479.9C217.6 496.8 199.8 506.4 182.9 501.4C161.4 494.1 141 485.8 122.3 474.4C114.3 477.1 105.4 480 95.1 480C60.65 480 31.1 451.3 31.1 416C31.1 406.6 34.02 397.7 37.64 389.7C26.15 370.1 17.01 350.6 10.6 329.1C5.562 312.2 15.21 294.4 32.15 289.3C49.08 284.3 66.9 293.9 71.94 310.9C76.29 325.5 82.34 339.4 89.85 352.3L89.85 352.3zM474.4 389.7C477.1 397.7 479.1 406.6 479.1 416C479.1 451.3 451.3 480 415.1 480C406.6 480 397.7 477.1 389.7 474.4C370.1 485.8 350.6 494.1 329.1 501.4C312.2 506.4 294.4 496.8 289.3 479.9C284.3 462.9 293.9 445.1 310.9 440.1C325.5 435.7 339.4 429.7 352.3 422.2C352.1 420.1 351.1 418.1 351.1 416C351.1 380.7 380.7 352 415.1 352C418.1 352 420.1 352.1 422.2 352.3C429.7 339.4 435.7 325.5 440.1 310.9C445.1 293.9 462.9 284.3 479.8 289.3C496.8 294.4 506.4 312.2 501.4 329.1C494.1 350.6 485.8 370.1 474.4 389.7H474.4zM192.8 256.8C192.8 281.6 206.9 303.2 227.7 313.8C239.5 319.9 244.2 334.3 238.2 346.1C232.1 357.9 217.7 362.6 205.9 356.6C169.7 338.1 144.8 300.4 144.8 256.8C144.8 227.9 155.7 201.6 173.7 181.7L162.5 170.6C155.1 163.1 160.6 152.8 169.9 152.8H230.4C236.1 152.8 240.8 157.5 240.8 163.2V223.7C240.8 232.1 229.6 237.6 223 231L207.7 215.7C198.4 226.8 192.8 241.1 192.8 256.8V256.8zM275.4 165.9C281.5 154.1 295.9 149.4 307.7 155.4C343.9 173.9 368.8 211.6 368.8 255.2C368.8 284.1 357.8 310.5 339.9 330.3L351 341.5C357.6 348 352.1 359.2 343.7 359.2H283.2C277.5 359.2 272.8 354.6 272.8 348.8V288.3C272.8 279 284 274.4 290.6 280.1L305.9 296.3C315.2 285.2 320.8 270.9 320.8 255.2C320.8 230.4 306.6 208.8 285.9 198.2C274.1 192.1 269.4 177.7 275.4 165.9V165.9z"],"guarani-sign":[384,512,[],"e19a","M224 32V66.66C263.5 73.3 299 92.03 326.4 118.9C339 131.3 339.2 151.5 326.9 164.1C314.5 176.8 294.2 176.1 281.6 164.6C265.8 149.1 246.1 137.7 224 132V224H352C369.7 224 384 238.3 384 256C384 351.1 314.8 430.1 224 445.3V480C224 497.7 209.7 512 192 512C174.3 512 160 497.7 160 480V445.3C69.19 430.1 0 351.1 0 256C0 160.9 69.19 81.89 160 66.65V32C160 14.33 174.3 0 192 0C209.7 0 224 14.33 224 32H224zM160 132C104.8 146.2 64 196.4 64 256C64 315.6 104.8 365.8 160 379.1V132zM224 379.1C268.1 368.4 304.4 332.1 315.1 288H224V379.1z"],guitar:[512,512,[],"f7a6","M502.7 39.02L473 9.37c-12.5-12.5-32.74-12.49-45.24 .0106l-46.24 46.37c-3.875 3.875-6.848 8.506-8.598 13.76l-12.19 36.51L284.5 182.3C272.4 173.5 259 166.5 244.4 163.1C211 155.4 177.4 162.3 154.5 185.1C145.3 194.5 138.3 206 134.3 218.6C128.3 237.1 111.1 251.3 92.14 253C68.52 255.4 46.39 264.5 29.52 281.5c-45.62 45.5-37.38 127.5 18.12 183c55.37 55.38 137.4 63.51 182.9 18c16.1-16.88 26.25-38.85 28.5-62.72c1.75-18.75 15.84-36.16 34.47-42.16c12.5-3.875 24.03-10.87 33.4-20.25c22.87-22.88 29.75-56.38 21.1-89.76c-3.375-14.63-10.39-27.99-19.14-40.11l76.25-76.26l36.53-12.17c5.125-1.75 9.894-4.715 13.77-8.59l46.36-46.29C515.2 71.72 515.2 51.52 502.7 39.02zM208 352c-26.5 0-48-21.5-48-48c0-26.5 21.5-48 48-48s47.1 21.5 47.1 48C256 330.5 234.5 352 208 352z"],gun:[576,512,[],"e19b","M544 64h-16V56C528 42.74 517.3 32 504 32S480 42.74 480 56V64H43.17C19.33 64 0 83.33 0 107.2v89.66C0 220.7 19.33 240 43.17 240c21.26 0 36.61 20.35 30.77 40.79l-40.69 158.4C27.41 459.6 42.76 480 64.02 480h103.8c14.29 0 26.84-9.469 30.77-23.21L226.4 352h94.58c24.16 0 45.5-15.41 53.13-38.28L398.6 240h36.1c8.486 0 16.62-3.369 22.63-9.373L480 208h64c17.67 0 32-14.33 32-32V96C576 78.33 561.7 64 544 64zM328.5 298.6C327.4 301.8 324.4 304 320.9 304H239.1L256 240h92.02L328.5 298.6zM480 160H64V128h416V160z"],h:[384,512,[104],"48","M384 64.01v384c0 17.67-14.33 32-32 32s-32-14.33-32-32v-192H64v192c0 17.67-14.33 32-32 32s-32-14.33-32-32v-384C0 46.34 14.33 32.01 32 32.01S64 46.34 64 64.01v128h256v-128c0-17.67 14.33-32 32-32S384 46.34 384 64.01z"],hammer:[576,512,[128296],"f6e3","M568.1 196.3l-22.62-22.62c-4.533-4.533-10.56-7.029-16.97-7.029s-12.44 2.496-16.97 7.029l-5.654 5.656l-20.12-20.12c4.596-23.46-2.652-47.9-19.47-64.73l-45.25-45.25C390.2 17.47 347.1 0 303.1 0C258.2 0 216 17.47 184.3 49.21L176.5 57.05L272.5 105.1v13.81c0 18.95 7.688 37.5 21.09 50.91l49.16 49.14c13.44 13.45 31.39 20.86 50.54 20.86c4.758 0 9.512-.4648 14.18-1.387l20.12 20.12l-5.654 5.654c-9.357 9.357-9.357 24.58-.002 33.94l22.62 22.62c4.535 4.533 10.56 7.031 16.97 7.031s12.44-2.498 16.97-7.031l90.53-90.5C578.3 220.8 578.3 205.6 568.1 196.3zM270.9 192.4c-3.846-3.846-7.197-8.113-10.37-12.49l-239.5 209.2c-28.12 28.12-28.16 73.72-.0371 101.8C35.12 505 53.56 512 71.1 512s36.84-7.031 50.91-21.09l209.1-239.4c-4.141-3.061-8.184-6.289-11.89-9.996L270.9 192.4z"],hamsa:[512,512,[],"f665","M509.4 307.2C504.3 295.5 492.8 288 480 288h-64l.0001-208c0-21.1-18-40-40-40c-22 0-40 18-40 40l-.0001 134C336 219.5 331.5 224 326 224h-20c-5.5 0-10-4.5-10-9.1V40c0-21.1-17.1-40-39.1-40S215.1 18 215.1 40v174C215.1 219.5 211.5 224 205.1 224H185.1C180.5 224 175.1 219.5 175.1 214L175.1 80c0-21.1-18-40-40-40S95.1 58 95.1 80L95.1 288H31.99C19.24 288 7.743 295.5 2.618 307.2C-2.382 318.9-.1322 332.5 8.618 341.9l102.6 110C146.1 490.1 199.8 512 256 512s108.1-21.88 144.8-60.13l102.6-110C512.1 332.5 514.4 318.9 509.4 307.2zM256 416c-53 0-96.01-64-96.01-64s43-64 96.01-64s96.01 64 96.01 64S309 416 256 416zM256 320c-17.63 0-32 14.38-32 32s14.38 32 32 32s32-14.38 32-32S273.6 320 256 320z"],hand:[512,512,[129306,9995,"hand-paper"],"f256","M480 128v208c0 97.05-78.95 176-176 176h-37.72c-53.42 0-103.7-20.8-141.4-58.58l-113.1-113.1C3.906 332.5 0 322.2 0 312C0 290.7 17.15 272 40 272c10.23 0 20.47 3.906 28.28 11.72L128 343.4V64c0-17.67 14.33-32 32-32s32 14.33 32 32l.0729 176C192.1 248.8 199.2 256 208 256s16.07-7.164 16.07-16L224 32c0-17.67 14.33-32 32-32s32 14.33 32 32l.0484 208c0 8.836 7.111 16 15.95 16S320 248.8 320 240L320 64c0-17.67 14.33-32 32-32s32 14.33 32 32l.0729 176c0 8.836 7.091 16 15.93 16S416 248.8 416 240V128c0-17.67 14.33-32 32-32S480 110.3 480 128z"],"hand-back-fist":[448,512,["hand-rock"],"f255","M448 144v120.4C448 314.2 422.6 358.1 384 384v128H128v-128l-53.19-38.67C48 325.8 32 294.3 32 261.2V192c0-14.58 6.625-28.38 17.1-37.48L80 130.5V176C80 184.8 87.16 192 96 192s16-7.164 16-16v-128C112 21.48 133.5 0 160 0c25.38 0 45.96 19.77 47.67 44.73C216.2 36.9 227.5 32 240 32C266.5 32 288 53.48 288 80v5.531C296.6 72.57 311.3 64 328 64c23.47 0 42.94 16.87 47.11 39.14C382.4 98.7 390.9 96 400 96C426.5 96 448 117.5 448 144z"],"hand-dots":[512,512,["allergies"],"f461","M448 96c-17.67 0-32 14.33-32 32v112C416 248.8 408.8 256 400 256s-15.93-7.164-15.93-16L384 64c0-17.67-14.33-32-32-32s-32 14.33-32 32l.0498 176c0 8.836-7.219 16-16.06 16s-15.95-7.164-15.95-16L288 32c0-17.67-14.33-32-32-32S224 14.33 224 32l.0729 208C224.1 248.8 216.8 256 208 256S192.1 248.8 192.1 240L192 64c0-17.67-14.33-32-32-32S128 46.33 128 64v279.4L68.28 283.7C60.47 275.9 50.23 272 40 272C18.68 272 0 289.2 0 312c0 10.23 3.906 20.47 11.72 28.28l113.1 113.1C162.6 491.2 212.9 512 266.3 512H304c97.05 0 176-78.95 176-176V128C480 110.3 465.7 96 448 96zM192 416c-8.836 0-16-7.164-16-16C176 391.2 183.2 384 192 384s16 7.162 16 16C208 408.8 200.8 416 192 416zM256 448c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C272 440.8 264.8 448 256 448zM256 352c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C272 344.8 264.8 352 256 352zM320 384c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C336 376.8 328.8 384 320 384zM352 448c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C368 440.8 360.8 448 352 448zM384 352c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16s16 7.162 16 16C400 344.8 392.8 352 384 352z"],"hand-fist":[448,512,[9994,"fist-raised"],"f6de","M224 180.4V32c0-17.67-14.31-32-32-32S160 14.33 160 32v144h40C208.5 176 216.5 177.7 224 180.4zM128 176V64c0-17.67-14.31-32-32-32S64 46.33 64 64v112.8C66.66 176.5 69.26 176 72 176H128zM288 192c17.69 0 32-14.33 32-32V64c0-17.67-14.31-32-32-32s-32 14.33-32 32v96C256 177.7 270.3 192 288 192zM384 96c-17.69 0-32 14.33-32 32v64c0 17.67 14.31 32 32 32s32-14.34 32-32.02V128C416 110.3 401.7 96 384 96zM350.9 246.2c-12.43-7.648-21.94-19.31-26.88-33.25C313.7 219.9 301.3 223.9 288 223.9c-7.641 0-14.87-1.502-21.66-3.957C269.1 228.6 272 238.1 272 248c0 39.77-32.25 72-72 72H128c-8.836 0-16-7.164-16-16C112 295.2 119.2 288 128 288h72c22.09 0 40-17.91 40-40S222.1 208 200 208h-128C49.91 208 32 225.9 32 248v63.41c0 33.13 16 64.56 42.81 84.13L128 434.2V512h224v-85.09c38.3-24.09 64-66.42 64-114.9V247.1C406.6 252.6 395.7 256 384 256C371.7 256 360.5 252.2 350.9 246.2z"],"hand-holding":[576,512,[],"f4bd","M559.7 392.2l-135.1 99.51C406.9 504.8 385 512 362.1 512H15.1c-8.749 0-15.1-7.246-15.1-15.99l0-95.99c0-8.748 7.25-16.02 15.1-16.02l55.37 .0238l46.5-37.74c20.1-16.1 47.12-26.25 74.12-26.25h159.1c19.5 0 34.87 17.37 31.62 37.37c-2.625 15.75-17.37 26.62-33.37 26.62H271.1c-8.749 0-15.1 7.249-15.1 15.1s7.25 15.1 15.1 15.1h120.6l119.7-88.17c17.8-13.19 42.81-9.342 55.93 8.467C581.3 354.1 577.5 379.1 559.7 392.2z"],"hand-holding-dollar":[576,512,["hand-holding-usd"],"f4c0","M568.2 336.3c-13.12-17.81-38.14-21.66-55.93-8.469l-119.7 88.17h-120.6c-8.748 0-15.1-7.25-15.1-15.99c0-8.75 7.25-16 15.1-16h78.25c15.1 0 30.75-10.88 33.37-26.62c3.25-20-12.12-37.38-31.62-37.38H191.1c-26.1 0-53.12 9.25-74.12 26.25l-46.5 37.74L15.1 383.1C7.251 383.1 0 391.3 0 400v95.98C0 504.8 7.251 512 15.1 512h346.1c22.03 0 43.92-7.188 61.7-20.27l135.1-99.52C577.5 379.1 581.3 354.1 568.2 336.3zM279.3 175C271.7 173.9 261.7 170.3 252.9 167.1L248 165.4C235.5 160.1 221.8 167.5 217.4 179.1s2.121 26.2 14.59 30.64l4.655 1.656c8.486 3.061 17.88 6.095 27.39 8.312V232c0 13.25 10.73 24 23.98 24s24-10.75 24-24V221.6c25.27-5.723 42.88-21.85 46.1-45.72c8.688-50.05-38.89-63.66-64.42-70.95L288.4 103.1C262.1 95.64 263.6 92.42 264.3 88.31c1.156-6.766 15.3-10.06 32.21-7.391c4.938 .7813 11.37 2.547 19.65 5.422c12.53 4.281 26.21-2.312 30.52-14.84s-2.309-26.19-14.84-30.53c-7.602-2.627-13.92-4.358-19.82-5.721V24c0-13.25-10.75-24-24-24s-23.98 10.75-23.98 24v10.52C238.8 40.23 221.1 56.25 216.1 80.13C208.4 129.6 256.7 143.8 274.9 149.2l6.498 1.875c31.66 9.062 31.15 11.89 30.34 16.64C310.6 174.5 296.5 177.8 279.3 175z"],"hand-holding-droplet":[576,512,["hand-holding-water"],"f4c1","M287.1 256c53 0 95.1-42.13 95.1-93.1c0-40-57.12-120.8-83.25-155.6c-6.375-8.5-19.12-8.5-25.5 0C249.1 41.25 191.1 122 191.1 162C191.1 213.9 234.1 256 287.1 256zM568.2 336.3c-13.12-17.81-38.14-21.66-55.93-8.469l-119.7 88.17h-120.6c-8.748 0-15.1-7.25-15.1-15.99c0-8.75 7.25-16 15.1-16h78.25c15.1 0 30.75-10.88 33.37-26.62c3.25-20-12.12-37.38-31.62-37.38H191.1c-26.1 0-53.12 9.25-74.12 26.25l-46.5 37.74L15.1 383.1c-8.748 0-15.1 7.274-15.1 16.02L.0001 496C.0001 504.8 7.251 512 15.1 512h346.1c22.03 0 43.92-7.188 61.7-20.27l135.1-99.52C577.5 379.1 581.3 354.1 568.2 336.3z"],"hand-holding-hand":[512,512,[],"e4f7","M328.7 52.28L431.7 119.8C449.5 132.9 453.3 157.9 440.2 175.7C427.1 193.5 402.1 197.3 384.3 184.2L296.6 127.1H191.1C183.2 127.1 175.1 135.2 175.1 143.1C175.1 152.7 183.2 159.1 191.1 159.1H254.2C270.2 159.1 284.1 170.9 287.6 186.6C290.8 206.6 275.5 223.1 255.1 223.1H143.1C116.1 223.1 90.87 214.7 69.87 197.7L23.37 159.1L15.1 160C7.25 160 0 152.7 0 143.1V47.99C0 39.25 7.25 32 15.1 32H266.1C289 32 310.9 39.19 328.7 52.28L328.7 52.28zM151.3 459.7L16.27 360.2C-1.509 347.1-5.305 322.1 7.803 304.3C20.93 286.5 45.94 282.7 63.74 295.8L183.4 384H304C312.8 384 320 376.8 320 368C320 359.3 312.8 352 304 352H225.8C209.8 352 195 341.1 192.4 325.4C189.2 305.4 204.5 288 224 288H352C379 288 405.1 297.3 426.1 314.3L472.6 352L496 352C504.7 352 512 359.3 512 368V464C512 472.8 504.7 480 496 480H213C190.1 480 169.1 472.8 151.3 459.7V459.7z"],"hand-holding-heart":[576,512,[],"f4be","M275.2 250.5c7 7.375 18.5 7.375 25.5 0l108.1-114.2c31.5-33.12 29.72-88.1-5.65-118.7c-30.88-26.75-76.75-21.9-104.9 7.724L287.1 36.91L276.8 25.28C248.7-4.345 202.7-9.194 171.1 17.56C136.7 48.18 134.7 103.2 166.4 136.3L275.2 250.5zM568.2 336.3c-13.12-17.81-38.14-21.66-55.93-8.469l-119.7 88.17h-120.6c-8.748 0-15.1-7.25-15.1-15.1c0-8.746 7.25-15.1 15.1-15.1h78.25c15.1 0 30.75-10.87 33.37-26.62c3.25-19.1-12.12-37.37-31.62-37.37H191.1c-26.1 0-53.12 9.25-74.12 26.25l-46.5 37.74l-55.37-.0253c-8.748 0-15.1 7.275-15.1 16.02L.0001 496C.0001 504.8 7.251 512 15.1 512h346.1c22.03 0 43.92-7.187 61.7-20.28l135.1-99.51C577.5 379.1 581.3 354.1 568.2 336.3z"],"hand-holding-medical":[576,512,[],"e05c","M568.2 336.3c-13.12-17.81-38.14-21.66-55.93-8.469l-119.7 88.17h-120.6c-8.748 0-15.1-7.25-15.1-15.99c0-8.75 7.25-16 15.1-16h78.25c15.1 0 30.75-10.88 33.37-26.62c3.25-20-12.12-37.38-31.62-37.38H191.1c-26.1 0-53.12 9.25-74.12 26.25l-46.5 37.74L15.1 383.1C7.251 383.1 0 391.3 0 400v95.98C0 504.8 7.251 512 15.1 512h346.1c22.03 0 43.92-7.188 61.7-20.27l135.1-99.52C577.5 379.1 581.3 354.1 568.2 336.3zM160 176h64v64C224 248.8 231.2 256 240 256h64C312.8 256 320 248.8 320 240v-64h64c8.836 0 16-7.164 16-16V96c0-8.838-7.164-16-16-16h-64v-64C320 7.162 312.8 0 304 0h-64C231.2 0 224 7.162 224 16v64H160C151.2 80 144 87.16 144 96v64C144 168.8 151.2 176 160 176z"],"hand-lizard":[512,512,[],"f258","M512 329.1V432c0 8.836-7.164 16-16 16H368c-8.836 0-16-7.164-16-16V416l-85.33-64H95.1c-16.47 0-31.44-13.44-31.96-29.9C62.87 285.8 91.96 256 127.1 256h104.9c13.77 0 26-8.811 30.36-21.88l10.67-32C280.9 181.4 265.4 160 243.6 160H63.1C27.95 160-1.129 130.2 .0352 93.9C.5625 77.44 15.53 64 31.1 64h271.2c26.26 0 50.84 12.88 65.79 34.47l128.8 185.1C507 297.8 512 313.7 512 329.1z"],"hand-middle-finger":[448,512,[128405],"f806","M448 288v96c0 70.69-57.31 128-128 128H184c-50.35 0-97.76-23.7-127.1-63.98l-14.43-19.23C35.37 420.5 32 410.4 32 400v-48.02c0-14.58 6.629-28.37 18.02-37.48L80 290.5V336C80 344.8 87.16 352 96 352s16-7.164 16-16v-96C112 213.5 133.5 192 160 192s48 21.48 48 48V40C208 17.91 225.9 0 248 0S288 17.91 288 40v189.5C296.6 216.6 311.3 208 328 208c23.48 0 42.94 16.87 47.11 39.14C382.4 242.7 390.8 240 400 240C426.5 240 448 261.5 448 288z"],"hand-peace":[512,512,[9996],"f25b","M256 287.4V32c0-17.67-14.31-32-32-32S192 14.33 192 32v216.3C218.7 248.4 243.7 263.1 256 287.4zM170.8 251.2c2.514-.7734 5.043-1.027 7.57-1.516L93.41 51.39C88.21 39.25 76.34 31.97 63.97 31.97c-20.97 0-31.97 18.01-31.97 32.04c0 4.207 .8349 8.483 2.599 12.6l81.97 191.3L170.8 251.2zM416 224c-17.69 0-32 14.33-32 32v64c0 17.67 14.31 32 32 32s32-14.33 32-32V256C448 238.3 433.7 224 416 224zM320 352c17.69 0 32-14.33 32-32V224c0-17.67-14.31-32-32-32s-32 14.33-32 32v96C288 337.7 302.3 352 320 352zM368 361.9C356.3 375.3 339.2 384 320 384c-27.41 0-50.62-17.32-59.73-41.55c-7.059 21.41-23.9 39.23-47.08 46.36l-47.96 14.76c-1.562 .4807-3.147 .7105-4.707 .7105c-6.282 0-12.18-3.723-14.74-9.785c-.8595-2.038-1.264-4.145-1.264-6.213c0-6.79 4.361-13.16 11.3-15.3l46.45-14.29c17.2-5.293 29.76-20.98 29.76-38.63c0-34.19-32.54-40.07-40.02-40.07c-3.89 0-7.848 .5712-11.76 1.772l-104 32c-18.23 5.606-28.25 22.21-28.25 38.22c0 4.266 .6825 8.544 2.058 12.67L68.19 419C86.71 474.5 138.7 512 197.2 512H272c82.54 0 151.8-57.21 170.7-134C434.6 381.8 425.6 384 416 384C396.8 384 379.7 375.3 368 361.9z"],"hand-point-down":[448,512,[],"f0a7","M256 256v64c0 17.67 14.31 32 32 32s32-14.33 32-32V256c0-17.67-14.31-32-32-32S256 238.3 256 256zM200 272H160V352c0 17.67 14.31 32 32 32s32-14.33 32-32V267.6C216.5 270.3 208.5 272 200 272zM72 272C69.26 272 66.66 271.5 64 271.2V480c0 17.67 14.31 32 32 32s32-14.33 32-32V272H72zM416 288V224c0-17.67-14.31-32-32-32s-32 14.33-32 32v64c0 17.67 14.31 32 32 32S416 305.7 416 288zM384 160c11.72 0 22.55 3.381 32 8.879V136C416 60.89 355.1 0 280 0L191.3 0C162.5 0 134.5 9.107 111.2 26.02L74.81 52.47C48 72.03 32 103.5 32 136.6V200C32 222.1 49.91 240 72 240h128c22.09 0 39.1-17.91 39.1-39.1c0-28.73-26.72-40-42.28-40l-69.72 0C119.2 160 112 152.8 112 144S119.2 128 127.1 128H200c37.87 0 68.59 29.35 71.45 66.51C276.8 193.1 282.2 192 288 192c13.28 0 25.6 4.047 35.83 10.97C332.6 178 356.1 160 384 160z"],"hand-point-left":[512,512,[],"f0a5","M256 288H192c-17.67 0-32 14.31-32 32s14.33 32 32 32h64c17.67 0 32-14.31 32-32S273.7 288 256 288zM240 232V192H160C142.3 192 128 206.3 128 224s14.33 32 32 32h84.41C241.7 248.5 240 240.5 240 232zM240 104C240 101.3 240.5 98.66 240.8 96H32C14.33 96 0 110.3 0 128s14.33 32 32 32h208V104zM224 448h64c17.67 0 32-14.31 32-32s-14.33-32-32-32H224c-17.67 0-32 14.31-32 32S206.3 448 224 448zM352 416c0 11.72-3.381 22.55-8.879 32H376C451.1 448 512 387.1 512 312V223.3c0-28.76-9.107-56.79-26.02-80.06l-26.45-36.41C439.1 80 408.5 64 375.4 64H312c-22.09 0-40 17.91-40 40v128c0 22.09 17.91 39.1 39.1 39.1c28.73 0 40-26.72 40-42.28L352 159.1C352 151.2 359.2 144 368 144S384 151.2 384 159.1V232c0 37.87-29.35 68.59-66.51 71.45C318.9 308.8 320 314.2 320 320c0 13.28-4.047 25.6-10.97 35.83C333.1 364.6 352 388.1 352 416z"],"hand-point-right":[512,512,[],"f0a4","M224 320c0 17.69 14.33 32 32 32h64c17.67 0 32-14.31 32-32s-14.33-32-32-32h-64C238.3 288 224 302.3 224 320zM267.6 256H352c17.67 0 32-14.31 32-32s-14.33-32-32-32h-80v40C272 240.5 270.3 248.5 267.6 256zM272 160H480c17.67 0 32-14.31 32-32s-14.33-32-32-32h-208.8C271.5 98.66 272 101.3 272 104V160zM320 416c0-17.69-14.33-32-32-32H224c-17.67 0-32 14.31-32 32s14.33 32 32 32h64C305.7 448 320 433.7 320 416zM202.1 355.8C196 345.6 192 333.3 192 320c0-5.766 1.08-11.24 2.51-16.55C157.4 300.6 128 269.9 128 232V159.1C128 151.2 135.2 144 143.1 144S160 151.2 159.1 159.1l0 69.72C159.1 245.2 171.3 271.1 200 271.1C222.1 271.1 240 254.1 240 232v-128C240 81.91 222.1 64 200 64H136.6C103.5 64 72.03 80 52.47 106.8L26.02 143.2C9.107 166.5 0 194.5 0 223.3V312C0 387.1 60.89 448 136 448h32.88C163.4 438.6 160 427.7 160 416C160 388.1 178 364.6 202.1 355.8z"],"hand-point-up":[448,512,[9757],"f0a6","M288 288c17.69 0 32-14.33 32-32V192c0-17.67-14.31-32-32-32s-32 14.33-32 32v64C256 273.7 270.3 288 288 288zM224 244.4V160c0-17.67-14.31-32-32-32S160 142.3 160 160v80h40C208.5 240 216.5 241.7 224 244.4zM128 240V32c0-17.67-14.31-32-32-32S64 14.33 64 32v208.8C66.66 240.5 69.26 240 72 240H128zM384 192c-17.69 0-32 14.33-32 32v64c0 17.67 14.31 32 32 32s32-14.33 32-32V224C416 206.3 401.7 192 384 192zM323.8 309C313.6 315.1 301.3 320 288 320c-5.766 0-11.24-1.08-16.55-2.51C268.6 354.6 237.9 384 200 384H127.1C119.2 384 112 376.8 112 368S119.2 352 127.1 352l69.72 .0001c15.52 0 42.28-11.29 42.28-40C239.1 289.9 222.1 272 200 272h-128C49.91 272 32 289.9 32 312v63.41c0 33.13 16 64.56 42.81 84.13l36.41 26.45C134.5 502.9 162.5 512 191.3 512H280c75.11 0 136-60.89 136-136v-32.88C406.6 348.6 395.7 352 384 352C356.1 352 332.6 333.1 323.8 309z"],"hand-pointer":[448,512,[],"f25a","M400 224c-9.148 0-17.62 2.697-24.89 7.143C370.9 208.9 351.5 192 328 192c-17.38 0-32.46 9.33-40.89 23.17C282.1 192.9 263.5 176 240 176c-12.35 0-23.49 4.797-32 12.46V40c0-22.09-17.9-40-39.1-40C145.9 0 128 17.91 128 40v322.7L72 288C64.15 277.5 52.13 272 39.97 272c-21.22 0-39.97 17.06-39.97 40.02c0 8.356 2.608 16.78 8.005 23.98l91.22 121.6C124.8 491.7 165.5 512 208 512h96C383.4 512 448 447.4 448 368v-96C448 245.5 426.5 224 400 224zM240 400c0 8.844-7.156 16-16 16s-16-7.156-16-16v-96C208 295.2 215.2 288 224 288s16 7.156 16 16V400zM304 400c0 8.844-7.156 16-16 16s-16-7.156-16-16v-96C272 295.2 279.2 288 288 288s16 7.156 16 16V400zM368 400c0 8.844-7.156 16-16 16s-16-7.156-16-16v-96C336 295.2 343.2 288 352 288s16 7.156 16 16V400z"],"hand-scissors":[512,512,[],"f257","M512 192v111.1C512 383.4 447.4 448 368 448H288c-26.52 0-48-21.48-48-47.99c0-9.152 2.697-17.61 7.139-24.89C224.9 370.1 208 351.5 208 328c0-16.72 8.561-31.4 21.52-39.1H40c-22.09 0-40-17.9-40-39.99s17.91-39.1 40-39.1h229.5L60 142.2C42.93 136.8 31.99 121.1 31.99 104c0-3.973 .5967-8.014 1.851-12.01c5.35-17.07 21.08-28.04 38.06-28.04c4 0 8.071 .6085 12.09 1.889l279.2 87.22C364.8 153.6 366.4 153.8 368 153.8c6.812 0 13.12-4.375 15.27-11.23c.4978-1.588 .7346-3.195 .7346-4.777c0-6.807-4.388-13.12-11.23-15.25l-72.54-22.67l14.29-17.85C323.6 70.67 337.4 64.04 352 64.04h48c10.39 0 20.48 3.359 28.8 9.592l38.41 28.79c25.2 18.91 40.53 47.97 43.55 79.04C511.5 184.9 512 188.4 512 192z"],"hand-sparkles":[640,512,[],"e05d","M448 432c0-14.25 8.547-28.14 21.28-34.55l39.56-16.56l15.64-37.52c4.461-9.037 11.45-15.37 19.43-19.23L544 128c0-17.67-14.33-32-32-32s-32 14.33-32 32l-.0156 112c0 8.836-7.148 16-15.98 16s-16.07-7.164-16.07-16L448 64c0-17.67-14.33-32-32-32s-32 14.33-32 32l-.0635 176c0 8.836-7.106 16-15.94 16S351.9 248.8 351.9 240L352 32c0-17.67-14.33-32-32-32S288 14.33 288 32L287.9 240C287.9 248.8 280.8 256 272 256S255.9 248.8 255.9 240L256 64c0-17.67-14.33-32-32-32S192 46.33 192 64v279.4L132.3 283.7C124.5 275.9 114.2 272 104 272C82.68 272 64 289.2 64 312c0 10.23 3.906 20.47 11.72 28.28l113.1 113.1C226.6 491.2 276.9 512 330.3 512H368c42.72 0 81.91-15.32 112.4-40.73l-9.049-3.773C456.6 460.1 448 446.3 448 432zM349.8 371.6L320 383.1l-12.42 29.78C306.1 415 305.4 416 304 416s-2.969-.9941-3.578-2.219L288 383.1l-29.79-12.42C256.1 370.1 256 369.4 256 367.1c0-1.365 .9922-2.967 2.209-3.577L288 352l12.42-29.79C301 320.1 302.6 320 304 320s2.967 .9902 3.578 2.217L320 352l29.79 12.42C351 365 352 366.6 352 367.1C352 369.4 351 370.1 349.8 371.6zM80 224c2.277 0 4.943-1.656 5.959-3.699l20.7-49.63l49.65-20.71c2.027-1.014 3.682-3.696 3.686-5.958C159.1 141.7 158.3 139.1 156.3 138L106.7 117.4L85.96 67.7C84.94 65.65 82.28 64 80 64C77.72 64 75.05 65.65 74.04 67.7L53.34 117.3L3.695 138C1.668 139.1 .0117 141.7 .0078 143.1c.0039 2.262 1.662 4.953 3.688 5.967l49.57 20.67l20.77 49.67C75.05 222.3 77.72 224 80 224zM639.1 432c-.0039-2.275-1.657-4.952-3.687-5.968l-49.57-20.67l-20.77-49.67C564.9 353.7 562.3 352 560 352c-2.281 0-4.959 1.652-5.975 3.695l-20.7 49.63l-49.64 20.71c-2.027 1.016-3.682 3.683-3.686 5.958c.0039 2.262 1.661 4.954 3.686 5.968l49.57 20.67l20.77 49.67C555.1 510.3 557.7 512 560 512c2.277 0 4.933-1.656 5.949-3.699l20.7-49.63l49.65-20.71C638.3 436.9 639.1 434.3 639.1 432z"],"hand-spock":[576,512,[128406],"f259","M543.6 128.6c0-8.999-6.115-32.58-31.68-32.58c-14.1 0-27.02 9.324-30.92 23.56l-34.36 125.1c-1.682 6.16-7.275 10.43-13.66 10.43c-7.981 0-14.16-6.518-14.16-14.13c0-.9844 .1034-1.987 .3197-2.996l35.71-166.6c.5233-2.442 .7779-4.911 .7779-7.362c0-13.89-9.695-32.86-31.7-32.86c-14.79 0-28.12 10.26-31.34 25.29l-37.77 176.2c-2.807 13.1-14.38 22.46-27.77 22.46c-13.04 0-24.4-8.871-27.56-21.52l-52.11-208.5C243.6 11.2 230.5-.0013 215.6-.0013c-26.71 0-31.78 25.71-31.78 31.98c0 2.569 .3112 5.18 .9617 7.786l50.55 202.2c.2326 .9301 .3431 1.856 .3431 2.764c0 6.051-4.911 11.27-11.3 11.27c-4.896 0-9.234-3.154-10.74-7.812L166.9 103.9C162.4 89.1 149.5 80.02 135.5 80.02c-15.68 0-31.63 12.83-31.63 31.97c0 3.273 .5059 6.602 1.57 9.884l69.93 215.7c.2903 .8949 .4239 1.766 .4239 2.598c0 4.521-3.94 7.915-8.119 7.915c-1.928 0-3.906-.7219-5.573-2.388L101.7 285.3c-8.336-8.336-19.63-12.87-30.81-12.87c-23.56 0-39.07 19.69-39.07 39.55c0 10.23 3.906 20.47 11.72 28.28l122.5 122.5C197.6 494.3 240.3 512 284.9 512h50.98c23.5 0 108.4-14.57 132.5-103l73.96-271.2C543.2 134.8 543.6 131.7 543.6 128.6z"],handcuffs:[640,512,[],"e4f8","M304 32C304 49.67 289.7 64 272 64C254.3 64 240 49.67 240 32C240 14.33 254.3 0 272 0C289.7 0 304 14.33 304 32zM160 80C160 62.33 174.3 48 192 48C209.7 48 224 62.33 224 80C224 97.67 209.7 112 192 112C174.3 112 160 97.67 160 80zM160 128C177.7 128 192 142.3 192 160H200C213.3 160 224 170.7 224 184V200C224 201.7 223.8 203.4 223.5 205.1C280.3 229.6 320 286.2 320 352C320 440.4 248.4 512 160 512C71.63 512 0 440.4 0 352C0 286.2 39.74 229.6 96.54 205.1C96.19 203.4 96 201.7 96 200V184C96 170.7 106.7 160 120 160H128C128 142.3 142.3 128 160 128zM160 448C213 448 256 405 256 352C256 298.1 213 256 160 256C106.1 256 64 298.1 64 352C64 405 106.1 448 160 448zM337.6 278.9C354.5 246.1 382.5 219.8 416.5 205.1C416.2 203.4 416 201.7 416 199.1V183.1C416 170.7 426.7 159.1 440 159.1H448C448 142.3 462.3 127.1 480 127.1C497.7 127.1 512 142.3 512 159.1H520C533.3 159.1 544 170.7 544 183.1V199.1C544 201.7 543.8 203.4 543.5 205.1C600.3 229.6 640 286.2 640 352C640 440.4 568.4 512 480 512C417.1 512 364.2 476.7 337.6 425.1C346.9 402.5 352 377.9 352 352C352 326.1 346.9 301.5 337.6 278.9V278.9zM480 256C426.1 256 384 298.1 384 352C384 405 426.1 448 480 448C533 448 576 405 576 352C576 298.1 533 256 480 256zM336 32C336 14.33 350.3 0 368 0C385.7 0 400 14.33 400 32C400 49.67 385.7 64 368 64C350.3 64 336 49.67 336 32zM416 80C416 62.33 430.3 48 448 48C465.7 48 480 62.33 480 80C480 97.67 465.7 112 448 112C430.3 112 416 97.67 416 80z"],hands:[512,512,["sign-language","signing"],"f2a7","M330.8 242.3L223.1 209.1C210.3 205.2 197 212.3 193.1 224.9C189.2 237.6 196.3 251 208.9 254.9L256 272H56.9c-11.61 0-22.25 7.844-24.44 19.24C29.51 306.6 41.19 320 56 320h128C188.4 320 192 323.6 192 328S188.4 336 184 336H24.9c-11.61 0-22.25 7.844-24.44 19.24C-2.49 370.6 9.193 384 24 384h160C188.4 384 192 387.6 192 392S188.4 400 184 400H56.9c-11.61 0-22.25 7.844-24.44 19.24C29.51 434.6 41.19 448 56 448h128C188.4 448 192 451.6 192 456S188.4 464 184 464H88.9c-11.61 0-22.25 7.844-24.44 19.24C61.51 498.6 73.19 512 88 512h208c66.28 0 120-53.73 120-120v-32.03C416 306.6 381.1 259.4 330.8 242.3zM197.1 179.5c5.986-2.148 12.32-3.482 18.98-3.482c5.508 0 10.99 .8105 16.5 2.471l16.11 4.975L227.7 117.2C224.2 106.2 213.6 98.39 202 99.74c-15.51 1.807-24.79 16.99-20.33 31.11L197.1 179.5zM487.1 144.5c-13.27 .0977-23.95 10.91-23.86 24.16l-2.082 50.04l-59.98-189.8c-3.496-11.07-14.18-18.86-25.71-17.51c-15.51 1.807-24.79 16.99-20.33 31.11l38.56 122.1c1.332 4.213-1.004 8.707-5.219 10.04c-4.213 1.332-8.707-1.004-10.04-5.217l-47.93-151.7c-3.496-11.07-14.18-18.86-25.71-17.51c-15.51 1.807-24.79 16.99-20.33 31.11l43.37 137.8c1.33 4.213-1.006 8.707-5.219 10.04c-4.213 1.332-8.707-1.004-10.04-5.217l-33.46-106.4C275.6 56.39 264.9 48.6 253.4 49.94c-15.51 1.807-24.79 16.99-20.33 31.11l34.15 108.1l73.7 22.76C404.1 233.3 448 292.8 448 359.9v27.91c38.27-21.17 63.28-61.24 64-106.7V168.4C511.8 155.1 500.3 144.5 487.1 144.5z"],"hands-asl-interpreting":[640,512,["american-sign-language-interpreting","asl-interpreting","hands-american-sign-language-interpreting"],"f2a3","M200 240c16.94 0 32.09 10.72 37.73 26.67c5.891 16.66 24.17 25.39 40.84 19.5c16.66-5.891 25.39-24.17 19.5-40.84C287.2 214.7 262.8 191.6 233.1 181.5l79.68-22.76c16.98-4.859 26.83-22.56 21.97-39.56C329.9 102.2 312.2 92.35 295.2 97.24L196 125.6l80.82-69.28c13.42-11.5 14.97-31.7 3.469-45.12C268.8-2.24 248.6-3.803 235.2 7.713l-100.4 86.09l22.33-48.39c7.391-16.05 .3906-35.06-15.66-42.47C125.4-4.412 106.4 2.525 98.94 18.6L14.92 206.6C5.082 228.6 0 252.5 0 276.6C0 335.9 48.1 384 107.4 384l99.9-.0064c31.87-2.289 61.15-19.35 79.13-46.18c9.828-14.69 5.891-34.56-8.781-44.41C263 283.6 243.1 287.5 233.3 302.2C225.8 313.3 213.4 320 200 320c-22.06 0-40-17.94-40-40C160 257.9 177.9 240 200 240zM532.6 128l-99.9 .004c-31.87 2.289-61.15 19.35-79.13 46.18c-9.828 14.69-5.891 34.56 8.781 44.41c14.66 9.812 34.55 5.906 44.41-8.781C414.2 198.7 426.6 191.1 440 191.1c22.06 0 40 17.94 40 40c0 22.06-17.94 39.1-40 39.1c-16.94 0-32.09-10.72-37.73-26.67c-5.891-16.66-24.17-25.39-40.84-19.5c-16.66 5.891-25.39 24.17-19.5 40.84c10.84 30.64 35.23 53.77 64.96 63.8l-79.68 22.76c-16.98 4.859-26.83 22.56-21.97 39.56c4.844 16.98 22.56 26.86 39.56 21.97l99.2-28.34l-80.82 69.28c-13.42 11.5-14.97 31.7-3.469 45.12c11.52 13.42 31.73 14.98 45.13 3.469l100.4-86.09l-22.33 48.39c-7.391 16.05-.3906 35.06 15.66 42.47c16.02 7.359 35.05 .4219 42.47-15.65l84.02-188C634.9 283.4 640 259.5 640 235.4C640 176.1 591.9 128 532.6 128z"],"hands-bound":[640,512,[],"e4f9","M95.1 144.8L165.3 237.2C170.1 244.7 181.4 246.8 189.6 242C199.3 236.3 201.7 223.3 194.6 214.5L167 179.1C156.2 166.4 158.1 146.7 171.4 135.5C184.6 124.4 204.4 125.8 215.9 138.7L262.6 191.3C278.1 209.7 287.1 233.4 287.1 258.1V352H352V258.1C352 233.4 361 209.7 377.4 191.3L424.1 138.7C435.6 125.8 455.4 124.4 468.6 135.5C481.9 146.7 483.8 166.4 472.1 179.1L445.4 214.5C438.3 223.3 440.7 236.3 450.4 242C458.6 246.8 469 244.7 474.7 237.2L544 144.8V32C544 14.33 558.3 0 576 0C593.7 0 608 14.33 608 32V213.9C608 228 602.9 241.8 593.7 252.5L508.4 352H512C525.3 352 536 362.7 536 376C536 389.3 525.3 400 512 400H128C114.7 400 104 389.3 104 376C104 362.7 114.7 352 128 352H131.6L46.31 252.5C37.07 241.8 32 228 32 213.9V32C32 14.33 46.33 0 64 0C81.67 0 96 14.33 96 32L95.1 144.8zM127.1 480C114.7 480 103.1 469.3 103.1 456C103.1 442.7 114.7 432 127.1 432H512C525.3 432 536 442.7 536 456C536 469.3 525.3 480 512 480H480V512H352V480H287.1V512H159.1V480H127.1z"],"hands-bubbles":[576,512,["hands-wash"],"e05e","M416 64c17.67 0 32-14.33 32-31.1c0-17.67-14.33-32-32-32c-17.67 0-32 14.33-32 32C384 49.67 398.3 64 416 64zM519.1 336H360c-4.418 0-8-3.582-8-8s3.582-8 8-8h128c14.81 0 26.49-13.42 23.54-28.76c-2.191-11.4-12.84-19.24-24.44-19.24H288l47.09-17.06c12.66-3.906 19.75-17.34 15.84-30.03c-3.938-12.62-17.28-19.69-30.03-15.84L213.2 242.3C162 259.4 128 306.6 128 359.1v25.65c36.47 7.434 64 39.75 64 78.38c0 10.71-2.193 20.91-6.031 30.25C204.1 505.3 225.2 512 248 512h208c14.81 0 26.49-13.42 23.54-28.76c-2.191-11.4-12.84-19.24-24.44-19.24H360c-4.418 0-8-3.582-8-8s3.582-8 8-8h128c14.81 0 26.49-13.42 23.54-28.76c-2.191-11.4-12.84-19.24-24.44-19.24H360c-4.418 0-8-3.582-8-8s3.582-8 8-8h160c14.81 0 26.49-13.42 23.54-28.76C541.3 343.8 530.7 336 519.1 336zM311.5 178.4c5.508-1.66 10.99-2.471 16.5-2.471c6.662 0 12.1 1.334 18.98 3.482l15.36-48.61c4.461-14.12-4.82-29.3-20.33-31.11c-11.53-1.344-22.21 6.443-25.71 17.51l-20.9 66.17L311.5 178.4zM496 224c26.51 0 48-21.49 48-47.1s-21.49-48-48-48S448 149.5 448 176S469.5 224 496 224zM93.65 386.3C94.45 386.1 95.19 385.8 96 385.6v-25.69c0-67.17 43.03-126.7 107.1-148l73.7-22.76l34.15-108.1c4.459-14.12-4.82-29.3-20.33-31.11C279.1 48.6 268.4 56.39 264.9 67.46L231.4 173.9c-1.332 4.213-5.826 6.549-10.04 5.217C217.2 177.8 214.8 173.3 216.2 169.1l43.37-137.8c4.461-14.12-4.82-29.3-20.33-31.11c-11.53-1.344-22.21 6.445-25.71 17.51L165.6 169.4C164.2 173.6 159.7 175.9 155.5 174.6C151.3 173.3 148.1 168.8 150.3 164.6l38.56-122.1c4.459-14.12-4.82-29.3-20.33-31.11C157 10.04 146.3 17.83 142.8 28.9L82.84 218.7L80.76 168.7C80.85 155.5 70.17 144.6 56.9 144.5C43.67 144.5 32.18 155.1 32 168.4v112.7C32.71 325.6 56.76 364.8 93.65 386.3zM112 416c-26.51 0-48 21.49-48 47.1s21.49 48 48 48S160 490.5 160 464S138.5 416 112 416z"],"hands-clapping":[512,512,[],"e1a8","M320 96c8.844 0 16-7.156 16-16v-64C336 7.156 328.8 0 320 0s-16 7.156-16 16v64C304 88.84 311.2 96 320 96zM383.4 96c5.125 0 10.16-2.453 13.25-7.016l32.56-48c1.854-2.746 2.744-5.865 2.744-8.951c0-8.947-7.273-16.04-15.97-16.04c-5.125 0-10.17 2.465-13.27 7.02l-32.56 48C368.3 73.76 367.4 76.88 367.4 79.97C367.4 88.88 374.7 96 383.4 96zM384 357.5l0-163.9c0-6.016-4.672-33.69-32-33.69c-17.69 0-32.07 14.33-32.07 31.1L320 268.1L169.2 117.3C164.5 112.6 158.3 110.3 152.2 110.3c-13.71 0-24 11.21-24 24c0 6.141 2.344 12.28 7.031 16.97l89.3 89.3C227.4 243.4 228.9 247.2 228.9 251c0 3.8-1.45 7.6-4.349 10.5c-2.899 2.899-6.7 4.349-10.5 4.349c-3.8 0-7.6-1.45-10.5-4.349l-107.6-107.6C91.22 149.2 85.08 146.9 78.94 146.9c-13.71 0-24 11.21-24 24c0 6.141 2.344 12.28 7.031 16.97l107.6 107.6C172.5 298.4 173.9 302.2 173.9 305.1c0 3.8-1.45 7.6-4.349 10.5c-2.899 2.9-6.7 4.349-10.5 4.349c-3.8 0-7.6-1.45-10.5-4.349L59.28 227.2C54.59 222.5 48.45 220.1 42.31 220.1c-13.71 0-24 11.21-24 24c0 6.141 2.344 12.28 7.031 16.97l89.3 89.3c2.9 2.899 4.349 6.7 4.349 10.5c0 3.8-1.45 7.6-4.349 10.5c-2.899 2.899-6.7 4.349-10.5 4.349c-3.8 0-7.6-1.45-10.5-4.349L40.97 318.7C36.28 314 30.14 311.7 24 311.7c-13.71 0-23.99 11.26-23.99 24.05c0 6.141 2.332 12.23 7.02 16.92C112.6 458.2 151.3 512 232.3 512C318.1 512 384 440.9 384 357.5zM243.3 88.98C246.4 93.55 251.4 96 256.6 96c8.762 0 15.99-7.117 15.99-16.03c0-3.088-.8906-6.205-2.744-8.951l-32.56-48C234.2 18.46 229.1 15.98 223.1 15.98c-8.664 0-15.98 7.074-15.98 16.05c0 3.086 .8906 6.205 2.744 8.951L243.3 88.98zM480 160c-17.69 0-32 14.33-32 32v76.14l-32-32v121.4c0 94.01-63.31 141.5-78.32 152.2C345.1 510.9 352.6 512 360.3 512C446.1 512 512 440.9 512 357.5l-.0625-165.6C511.9 174.3 497.7 160 480 160z"],"hands-holding":[640,512,[],"f4c2","M79.1 264.2C79.1 281.2 86.74 297.5 98.74 309.5L149.8 360.6C158.1 368.9 171.1 370.1 180.8 363.7C193.7 355 195.5 336.8 184.6 325.8L137.4 278.6C124.9 266.1 124.9 245.9 137.4 233.4C149.9 220.9 170.1 220.9 182.6 233.4L255.2 305.9C276.2 326.9 288 355.4 288 385.1V464C288 490.5 266.5 512 240 512H173.3C156.3 512 140 505.3 128 493.3L28.12 393.4C10.11 375.4 0 350.1 0 325.5V104C0 81.91 17.91 64 40 64C62.09 64 80 81.91 80 104L79.1 264.2zM560 104C560 81.91 577.9 64 600 64C622.1 64 640 81.91 640 104V325.5C640 350.1 629.9 375.4 611.9 393.4L512 493.3C499.1 505.3 483.7 512 466.7 512H400C373.5 512 352 490.5 352 464V385.1C352 355.4 363.8 326.9 384.8 305.9L457.4 233.4C469.9 220.9 490.1 220.9 502.6 233.4C515.1 245.9 515.1 266.1 502.6 278.6L455.4 325.8C444.5 336.8 446.3 355 459.2 363.7C468.9 370.1 481.9 368.9 490.2 360.6L541.3 309.5C553.3 297.5 560 281.2 560 264.2L560 104z"],"hands-holding-child":[640,512,[],"e4fa","M279.1 40C279.1 17.91 297.9 0 319.1 0C342.1 0 360 17.91 360 40C360 62.09 342.1 80 319.1 80C297.9 80 279.1 62.09 279.1 40zM375.8 253C377.5 266.2 368.1 278.2 354.1 279.8C341.8 281.5 329.8 272.1 328.2 258.1L323.8 223.1H316.2L311.8 258.1C310.2 272.1 298.2 281.5 285 279.8C271.9 278.2 262.5 266.2 264.2 253L275.3 164.3L255.5 180.1C245.4 189.6 230.2 188.3 221.7 178.2C213.1 168 214.4 152.9 224.5 144.3L252.4 120.7C271.3 104.8 295.3 96 320 96C344.7 96 368.7 104.8 387.6 120.7L415.5 144.3C425.6 152.9 426.9 168 418.3 178.2C409.8 188.3 394.6 189.6 384.5 180.1L364.7 164.3L375.8 253zM39.1 64C62.09 64 79.1 81.91 79.1 104V264.2C79.1 281.2 86.74 297.5 98.74 309.5L149.8 360.6C158.1 368.9 171.1 370.1 180.8 363.7C193.7 355 195.5 336.8 184.6 325.8L137.4 278.6C124.9 266.1 124.9 245.9 137.4 233.4C149.9 220.9 170.1 220.9 182.6 233.4L255.2 305.9C276.2 326.9 288 355.4 288 385.1V464C288 490.5 266.5 512 240 512H173.3C156.3 512 140 505.3 128 493.3L28.12 393.4C10.11 375.4 0 350.1 0 325.5V104C0 81.91 17.91 64 40 64L39.1 64zM640 104V325.5C640 350.1 629.9 375.4 611.9 393.4L512 493.3C499.1 505.3 483.7 512 466.7 512H400C373.5 512 352 490.5 352 464V385.1C352 355.4 363.8 326.9 384.8 305.9L457.4 233.4C469.9 220.9 490.1 220.9 502.6 233.4C515.1 245.9 515.1 266.1 502.6 278.6L455.4 325.8C444.5 336.8 446.3 355 459.2 363.7C468.9 370.1 481.9 368.9 490.2 360.6L541.3 309.5C553.3 297.5 560 281.2 560 264.2V103.1C560 81.91 577.9 63.1 600 63.1C622.1 63.1 640 81.91 640 103.1L640 104z"],"hands-holding-circle":[640,512,[],"e4fb","M191.1 128C191.1 57.31 249.3 0 319.1 0C390.7 0 448 57.31 448 128C448 198.7 390.7 256 319.1 256C249.3 256 191.1 198.7 191.1 128zM39.1 64C62.09 64 79.1 81.91 79.1 104V264.2C79.1 281.2 86.74 297.5 98.74 309.5L149.8 360.6C158.1 368.9 171.1 370.1 180.8 363.7C193.7 355 195.5 336.8 184.6 325.8L137.4 278.6C124.9 266.1 124.9 245.9 137.4 233.4C149.9 220.9 170.1 220.9 182.6 233.4L255.2 305.9C276.2 326.9 288 355.4 288 385.1V464C288 490.5 266.5 512 240 512H173.3C156.3 512 140 505.3 128 493.3L28.12 393.4C10.11 375.4 0 350.1 0 325.5V104C0 81.91 17.91 64 40 64L39.1 64zM640 104V325.5C640 350.1 629.9 375.4 611.9 393.4L512 493.3C499.1 505.3 483.7 512 466.7 512H400C373.5 512 352 490.5 352 464V385.1C352 355.4 363.8 326.9 384.8 305.9L457.4 233.4C469.9 220.9 490.1 220.9 502.6 233.4C515.1 245.9 515.1 266.1 502.6 278.6L455.4 325.8C444.5 336.8 446.3 355 459.2 363.7C468.9 370.1 481.9 368.9 490.2 360.6L541.3 309.5C553.3 297.5 560 281.2 560 264.2V103.1C560 81.91 577.9 63.1 600 63.1C622.1 63.1 640 81.91 640 103.1L640 104z"],"hands-praying":[640,512,["praying-hands"],"f684","M272 191.9c-17.62 0-32 14.35-32 31.97V303.9c0 8.875-7.125 16-16 16s-16-7.125-16-16V227.4c0-17.37 4.75-34.5 13.75-49.37L299.5 48.41c9-15.12 4.125-34.76-11-43.88C273.1-4.225 255.8 .1289 246.1 13.63C245.1 13.88 245.5 13.88 245.4 14.13L128.1 190C117.5 205.9 112 224.3 112 243.3v80.24l-90.13 29.1C8.75 357.9 0 370.1 0 383.9v95.99c0 10.88 8.5 31.1 32 31.1c2.75 0 5.375-.25 8-1l179.3-46.62C269.1 450 304 403.8 304 351.9V223.9C304 206.3 289.6 191.9 272 191.9zM618.1 353.6L528 323.6V243.4c0-19-5.5-37.37-16.12-53.25l-117.3-175.9c-.125-.25-.6251-.2487-.75-.4987c-9.625-13.5-27.88-17.85-42.38-9.229c-15.12 9.125-20 28.76-11 44.01l77.75 129.5C427.3 193 432 210 432 227.5v76.49c0 8.875-7.125 16-16 16s-16-7.125-16-16V223.1c0-17.62-14.38-31.97-32-31.97s-32 14.38-32 31.1v127.1c0 51.87 34.88 98.12 84.75 112.4L600 511C602.6 511.6 605.4 512 608 512c23.5 0 32-21.25 32-31.1v-95.99C640 370.3 631.3 358 618.1 353.6z"],handshake:[640,512,[],"f2b5","M0 383.9l64 .0404c17.75 0 32-14.29 32-32.03V128.3L0 128.3V383.9zM48 320.1c8.75 0 16 7.118 16 15.99c0 8.742-7.25 15.99-16 15.99S32 344.8 32 336.1C32 327.2 39.25 320.1 48 320.1zM348.8 64c-7.941 0-15.66 2.969-21.52 8.328L228.9 162.3C228.8 162.5 228.8 162.7 228.6 162.7C212 178.3 212.3 203.2 226.5 218.7c12.75 13.1 39.38 17.62 56.13 2.75C282.8 221.3 282.9 221.3 283 221.2l79.88-73.1c6.5-5.871 16.75-5.496 22.62 1c6 6.496 5.5 16.62-1 22.62l-26.12 23.87L504 313.7c2.875 2.496 5.5 4.996 7.875 7.742V127.1c-40.98-40.96-96.48-63.88-154.4-63.88L348.8 64zM334.6 217.4l-30 27.49c-29.75 27.11-75.25 24.49-101.8-4.371C176 211.2 178.1 165.7 207.3 138.9L289.1 64H282.5C224.7 64 169.1 87.08 128.2 127.9L128 351.8l18.25 .0369l90.5 81.82c27.5 22.37 67.75 18.12 90-9.246l18.12 15.24c15.88 12.1 39.38 10.5 52.38-5.371l31.38-38.6l5.374 4.498c13.75 11 33.88 9.002 45-4.748l9.538-11.78c11.12-13.75 9.036-33.78-4.694-44.93L334.6 217.4zM544 128.4v223.6c0 17.62 14.25 32.05 31.1 32.05L640 384V128.1L544 128.4zM592 352c-8.75 0-16-7.246-16-15.99c0-8.875 7.25-15.99 16-15.99S608 327.2 608 336.1C608 344.8 600.8 352 592 352z"],"handshake-angle":[640,512,["hands-helping"],"f4c4","M488 191.1h-152l.0001 51.86c.0001 37.66-27.08 72-64.55 75.77c-43.09 4.333-79.45-29.42-79.45-71.63V126.4l-24.51 14.73C123.2 167.8 96.04 215.7 96.04 267.5L16.04 313.8c-15.25 8.751-20.63 28.38-11.75 43.63l80 138.6c8.875 15.25 28.5 20.5 43.75 11.75l103.4-59.75h136.6c35.25 0 64-28.75 64-64c26.51 0 48-21.49 48-48V288h8c13.25 0 24-10.75 24-24l.0001-48C512 202.7 501.3 191.1 488 191.1zM635.7 154.5l-79.95-138.6c-8.875-15.25-28.5-20.5-43.75-11.75l-103.4 59.75h-62.57c-37.85 0-74.93 10.61-107.1 30.63C229.7 100.4 224 110.6 224 121.6l-.0004 126.4c0 22.13 17.88 40 40 40c22.13 0 40-17.88 40-40V159.1h184c30.93 0 56 25.07 56 56v28.5l80-46.25C639.3 189.4 644.5 169.8 635.7 154.5z"],"handshake-simple":[640,512,[129309,"handshake-alt"],"f4c6","M334.6 217.4l-30 27.49C264 282.1 217.8 256.8 202.9 240.6C176 211.2 178.1 165.7 207.3 138.9L289.1 64H282.5C224.7 64 169.1 86.95 128.2 127.8L32 128.1c-17.6 0-32 14.39-32 31.98v159.8c0 17.59 14.4 32.04 31.1 32.04l114.3-.0604l90.5 81.82c27.5 22.37 67.75 18.11 90-9.255l18.12 15.25c15.88 12.1 39.38 10.5 52.38-5.369l31.38-38.6l5.374 4.498c13.75 11 33.88 9.002 45-4.748l9.576-11.83c11.08-13.7 8.979-33.75-4.701-44.86L334.6 217.4zM608 128.1l-96-.1257c-40.98-40.96-96.56-63.88-154.5-63.88L348.9 64c-8 0-15.62 3.197-21.62 8.568L229 162.3C228.9 162.5 228.8 162.7 228.8 162.7C212 178.5 212.4 203.3 226.6 218.7c9.625 10.5 35 21.62 56.13 2.75c0-.125 .25-.125 .375-.25l80-73.1c6.5-5.871 16.62-5.496 22.62 1s5.5 16.62-1 22.62l-26.12 23.87l145.6 118.1c12.12 9.992 19.5 23.49 22.12 37.98L608 351.7c17.6 0 32-14.38 32-31.98V160.1C640 142.4 625.7 128.1 608 128.1z"],"handshake-simple-slash":[640,512,["handshake-alt-slash"],"e05f","M358.6 195.6l145.6 118.1c12.12 9.992 19.5 23.49 22.12 37.98h81.62c17.6 0 31.1-14.39 31.1-31.99V159.1c0-17.67-14.33-31.99-31.1-31.99h-95.1c-40.98-40.96-96.56-63.98-154.5-63.98h-8.613c-7.1 0-15.63 3.002-21.63 8.373l-93.44 85.57L208.3 137.9L289.1 64.01L282.5 64c-43.48 0-85.19 13.66-120.8 37.44l-122.9-96.33C34.41 1.672 29.19 0 24.03 0c-7.125 0-14.19 3.156-18.91 9.187c-8.187 10.44-6.375 25.53 4.062 33.7L601.2 506.9c10.5 8.203 25.56 6.328 33.69-4.078c8.187-10.44 6.375-25.53-4.062-33.7l-135.5-106.2c-.1719-9.086-3.789-18.03-11.39-24.2l-149.2-121.2l-11.47 10.51L297.6 207.1l65.51-59.85c6.5-5.871 16.62-5.496 22.62 .1c5.1 6.496 5.5 16.62-.1 22.62L358.6 195.6zM32 127.1c-17.6 0-31.1 14.4-31.1 31.99v159.8c0 17.59 14.4 32.06 31.1 32.06l114.2-.0712l90.5 81.85c27.5 22.37 67.75 18.12 89.1-9.25l18.12 15.25c15.87 12.1 39.37 10.5 52.37-5.371l13.02-16.03L39.93 127.1L32 127.1z"],"handshake-slash":[640,512,[],"e060","M543.1 128.2l.0002 223.8c0 17.62 14.25 31.99 31.1 31.99h64V128.1L543.1 128.2zM591.1 352c-8.75 0-16-7.251-16-15.99c0-8.875 7.25-15.1 16-15.1c8.75 0 15.1 7.122 15.1 15.1C607.1 344.8 600.7 352 591.1 352zM.0005 128.2v255.7l63.1 .0446c17.75 0 32-14.28 32-32.03L96 171.9l-55.77-43.71H.0005zM64 336c0 8.742-7.25 15.99-15.1 15.99s-15.1-7.251-15.1-15.99c0-8.875 7.25-15.1 15.1-15.1S64 327.2 64 336zM128 351.8h18.25l90.5 81.85c27.5 22.37 67.75 18.12 89.1-9.25l18.12 15.25c15.87 12.1 39.37 10.5 52.37-5.371l13.02-16.03L128 196.1V351.8zM495.2 362.8c-.1875-9.101-3.824-18.05-11.44-24.24l-149.2-121.1l-11.47 10.51L297.5 207.9l65.33-59.79c6.5-5.871 16.75-5.496 22.62 1c5.1 6.496 5.5 16.62-1 22.62l-26.12 23.87l145.6 118.1c2.875 2.496 5.5 4.996 7.875 7.742V127.1c-40.98-40.96-96.52-63.98-154.5-63.98h-8.613c-7.941 0-15.64 2.97-21.5 8.329L233.7 157.9L208.3 137.9l80.85-73.92L282.5 64c-43.47 0-85.16 13.68-120.8 37.45L38.81 5.109C34.41 1.672 29.19 0 24.03 0C16.91 0 9.846 3.156 5.127 9.187C-3.06 19.62-1.248 34.72 9.19 42.89l591.1 463.1c10.5 8.203 25.56 6.328 33.69-4.078c8.187-10.44 6.375-25.53-4.062-33.7L495.2 362.8z"],hanukiah:[640,512,[128334],"f6e6","M231.1 159.9C227.6 159.9 224 163.6 224 168V288h32V168C256 163.6 252.4 160 248 160L231.1 159.9zM167.1 159.9C163.6 159.9 160 163.6 160 168V288h32V168C192 163.6 188.4 160 184 160L167.1 159.9zM392 160C387.6 160 384 163.6 384 168V288h32V168c0-4.375-3.625-8.061-8-8.061L392 160zM456 160C451.6 160 448 163.6 448 168V288h32V168c0-4.375-3.625-8.061-8-8.061L456 160zM544 168c0-4.375-3.625-8.061-8-8.061L520 160C515.6 160 512 163.6 512 168V288h32V168zM103.1 159.9C99.62 159.9 96 163.6 96 168V288h32V168C128 163.6 124.4 160 120 160L103.1 159.9zM624 160h-31.98c-8.837 0-16.03 7.182-16.03 16.02L576 288c0 17.6-14.4 32-32 32h-192V128c0-8.837-7.151-16.01-15.99-16.01H303.1C295.2 111.1 288 119.2 288 128v192H96c-17.6 0-32-14.4-32-32l.0065-112C64.01 167.2 56.85 160 48.02 160H16C7.163 160 0 167.2 0 176V288c0 53.02 42.98 96 96 96h192v64H175.1C149.5 448 128 469.5 128 495.1C128 504.8 135.2 512 143.1 512h352C504.9 512 512 504.9 512 496C512 469.5 490.5 448 464 448H352v-64h192c53.02 0 96-42.98 96-96V176C640 167.2 632.8 160 624 160zM607.1 127.9C621.2 127.9 632 116 632 101.4C632 86.62 608 48 608 48s-24 38.62-24 53.38C584 116 594.7 127.9 607.1 127.9zM31.1 127.9C45.25 127.9 56 116 56 101.4C56 86.62 32 48 32 48S8 86.62 8 101.4C8 116 18.75 127.9 31.1 127.9zM319.1 79.94c13.25 0 24-11.94 24-26.57C344 38.62 320 0 320 0S296 38.62 296 53.38C296 67.1 306.7 79.94 319.1 79.94zM112 128c13.25 0 24-12 24-26.62C136 86.62 112 48 112 48S88 86.62 88 101.4C88 115.1 98.75 128 112 128zM176 128c13.25 0 24-12 24-26.62C200 86.62 176 48 176 48S152 86.62 152 101.4C152 115.1 162.8 128 176 128zM240 128c13.25 0 24-12 24-26.62C264 86.62 240 48 240 48S216 86.62 216 101.4C216 115.1 226.8 128 240 128zM400 128c13.25 0 24-12 24-26.62C424 86.62 400 48 400 48s-24 38.62-24 53.38C376 115.1 386.8 128 400 128zM464 128c13.25 0 24-12 24-26.62C488 86.62 464 48 464 48s-24 38.62-24 53.38C440 115.1 450.8 128 464 128zM528 128c13.25 0 24-12 24-26.62C552 86.62 528 48 528 48s-24 38.62-24 53.38C504 115.1 514.8 128 528 128z"],"hard-drive":[512,512,[128436,"hdd"],"f0a0","M464 288h-416C21.5 288 0 309.5 0 336v96C0 458.5 21.5 480 48 480h416c26.5 0 48-21.5 48-48v-96C512 309.5 490.5 288 464 288zM320 416c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S337.6 416 320 416zM416 416c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S433.6 416 416 416zM464 32h-416C21.5 32 0 53.5 0 80v192.4C13.41 262.3 29.92 256 48 256h416c18.08 0 34.59 6.254 48 16.41V80C512 53.5 490.5 32 464 32z"],hashtag:[448,512,[62098],"23","M416 127.1h-58.23l9.789-58.74c2.906-17.44-8.875-33.92-26.3-36.83c-17.53-2.875-33.92 8.891-36.83 26.3L292.9 127.1H197.8l9.789-58.74c2.906-17.44-8.875-33.92-26.3-36.83c-17.53-2.875-33.92 8.891-36.83 26.3L132.9 127.1H64c-17.67 0-32 14.33-32 32C32 177.7 46.33 191.1 64 191.1h58.23l-21.33 128H32c-17.67 0-32 14.33-32 32c0 17.67 14.33 31.1 32 31.1h58.23l-9.789 58.74c-2.906 17.44 8.875 33.92 26.3 36.83C108.5 479.9 110.3 480 112 480c15.36 0 28.92-11.09 31.53-26.73l11.54-69.27h95.12l-9.789 58.74c-2.906 17.44 8.875 33.92 26.3 36.83C268.5 479.9 270.3 480 272 480c15.36 0 28.92-11.09 31.53-26.73l11.54-69.27H384c17.67 0 32-14.33 32-31.1c0-17.67-14.33-32-32-32h-58.23l21.33-128H416c17.67 0 32-14.32 32-31.1C448 142.3 433.7 127.1 416 127.1zM260.9 319.1H165.8L187.1 191.1h95.12L260.9 319.1z"],"hat-cowboy":[640,512,[],"f8c0","M489.1 264.9C480.5 207.5 450.5 32 392.3 32c-14 0-26.58 5.875-37.08 14c-20.75 15.87-49.62 15.87-70.5 0C274.2 38 261.7 32 247.7 32c-58.25 0-88.27 175.5-97.77 232.9C188.7 277.5 243.7 288 319.1 288S451.2 277.5 489.1 264.9zM632.9 227.7c-6.125-4.125-14.2-3.51-19.7 1.49c-1 .875-101.3 90.77-293.1 90.77c-190.9 0-292.2-89.99-293.2-90.86c-5.5-4.875-13.71-5.508-19.71-1.383c-6.125 4.125-8.587 11.89-6.087 18.77C1.749 248.5 78.37 448 319.1 448s318.2-199.5 318.1-201.5C641.5 239.6 639 231.9 632.9 227.7z"],"hat-cowboy-side":[640,512,[],"f8c1","M260.8 260C232.1 237.1 198.8 225 164.4 225c-77.38 0-142.9 62.75-163 156c-3.5 16.62-.375 33.88 8.625 47.38c8.75 13.12 21.88 20.62 35.88 20.62H592c-103.2 0-155-37.13-233.2-104.5L260.8 260zM495.5 241.8l-27.13-156.5c-2.875-17.25-12.75-32.5-27.12-42.25c-14.37-9.75-32.24-13.3-49.24-9.675L200.9 74.02C173.7 79.77 153.5 102.3 150.5 129.8L143.6 195c6.875-.875 13.62-2 20.75-2c41.87 0 82 14.5 117.4 42.88l98 84.37c71 61.25 115.1 96.75 212.2 96.75c26.5 0 48-21.5 48-48C640 343.6 610.4 249.6 495.5 241.8z"],"hat-wizard":[512,512,[],"f6e8","M200 376l-49.23-16.41c-7.289-2.434-7.289-12.75 0-15.18L200 328l16.41-49.23c2.434-7.289 12.75-7.289 15.18 0L248 328l49.23 16.41c7.289 2.434 7.289 12.75 0 15.18L248 376L240 416H448l-86.38-201.6C355.4 200 354.8 183.8 359.8 168.9L416 0L228.4 107.3C204.8 120.8 185.1 141.4 175 166.4L64 416h144L200 376zM231.2 172.4L256 160l12.42-24.84c1.477-2.949 5.68-2.949 7.156 0L288 160l24.84 12.42c2.949 1.477 2.949 5.68 0 7.156L288 192l-12.42 24.84c-1.477 2.949-5.68 2.949-7.156 0L256 192L231.2 179.6C228.2 178.1 228.2 173.9 231.2 172.4zM496 448h-480C7.164 448 0 455.2 0 464C0 490.5 21.49 512 48 512h416c26.51 0 48-21.49 48-48C512 455.2 504.8 448 496 448z"],"head-side-cough":[640,512,[],"e061","M608 359.1c-13.25 0-24 10.75-24 24s10.75 24 24 24s24-10.75 24-24S621.3 359.1 608 359.1zM477.2 275c-21-47.13-48.49-151.8-73.11-186.8C365.6 33.63 302.5 0 234.1 0L192 0C86 0 0 86 0 192c0 56.75 24.75 107.6 64 142.9L64 512h223.1v-32h64.01c35.38 0 64-28.62 64-63.1L320 416c-17.67 0-32-14.33-32-32s14.33-32 32-32h95.98l-.003-32h31.99C471.1 320 486.6 296.1 477.2 275zM336 224c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S353.6 224 336 224zM480 359.1c-13.25 0-23.1 10.75-23.1 24s10.75 24 23.1 24s24-10.75 24-24S493.3 359.1 480 359.1zM608 311.1c13.25 0 24-10.75 24-24s-10.75-24-24-24s-24 10.75-24 24S594.8 311.1 608 311.1zM544 311.1c-13.25 0-23.1 10.75-23.1 24s10.75 24 23.1 24s24-10.75 24-24S557.3 311.1 544 311.1zM544 407.1c-13.25 0-23.1 10.75-23.1 24s10.75 24 23.1 24s24-10.75 24-24S557.3 407.1 544 407.1zM608 455.1c-13.25 0-24 10.75-24 24s10.75 24 24 24s24-10.75 24-24S621.3 455.1 608 455.1z"],"head-side-cough-slash":[640,512,[],"e062","M607.1 311.1c13.25 0 24-10.75 24-23.1s-10.75-23.1-24-23.1s-23.1 10.75-23.1 23.1S594.7 311.1 607.1 311.1zM607.1 407.1c13.25 0 24-10.78 24-24.03c0-13.25-10.75-23.1-24-23.1s-24 10.78-24 24.03C583.1 397.2 594.7 407.1 607.1 407.1zM630.8 469.1l-190.2-149.1h7.4c23.12 0 38.62-23.87 29.25-44.1c-20.1-47.12-48.49-151.7-73.11-186.7C365.6 33.63 302.5 0 234.1 0H192C149.9 0 111.5 14.26 79.88 37.29L38.81 5.109C34.41 1.672 29.19 0 24.03 0C16.91 0 9.845 3.156 5.126 9.187c-8.187 10.44-6.375 25.53 4.062 33.7l591.1 463.1c10.5 8.203 25.56 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1zM320 415.1c-17.67 0-31.1-14.33-31.1-31.1S302.3 351.1 320 351.1l5.758-.0009L18.16 110.9C6.631 135.6 .0006 162.1 .0006 191.1c0 56.75 24.75 107.6 64 142.9L64 511.1h223.1l0-31.1l64.01 .001c33.25 0 60.2-25.38 63.37-57.78l-7.932-6.217H320zM543.1 359.1c13.25 0 24-10.78 24-24.03s-10.75-23.1-24-23.1c-13.25 0-24 10.78-24 24.03C519.1 349.2 530.7 359.1 543.1 359.1z"],"head-side-mask":[512,512,[],"e063","M.1465 184.4C-2.166 244.2 23.01 298 63.99 334.9L63.99 512h160L224 316.5L3.674 156.2C1.871 165.4 .5195 174.8 .1465 184.4zM336 368H496L512 320h-255.1l.0178 192h145.9c27.55 0 52-17.63 60.71-43.76L464 464h-127.1c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16h138.7l10.67-32h-149.3c-8.836 0-16-7.164-16-16C320 375.2 327.2 368 336 368zM509.2 275c-20.1-47.13-48.49-151.8-73.11-186.8C397.6 33.63 334.5 0 266.1 0H200C117.1 0 42.48 50.57 13.25 123.7L239.2 288h272.6C511.8 283.7 511.1 279.3 509.2 275zM352 224c-17.62 0-32-14.38-32-32s14.38-32 32-32c17.62 0 31.1 14.38 31.1 32S369.6 224 352 224z"],"head-side-virus":[512,512,[],"e064","M208 175.1c-8.836 0-16 7.162-16 16c0 8.836 7.163 15.1 15.1 15.1s16-7.164 16-16C224 183.2 216.8 175.1 208 175.1zM272 239.1c-8.836 0-15.1 7.163-15.1 16c0 8.836 7.165 16 16 16s16-7.164 16-16C288 247.2 280.8 239.1 272 239.1zM509.2 275c-20.94-47.13-48.46-151.7-73.1-186.8C397.7 33.59 334.6 0 266.1 0H192C85.95 0 0 85.95 0 192c0 56.8 24.8 107.7 64 142.8L64 512h256l-.0044-64h63.99c35.34 0 63.1-28.65 63.1-63.1V320h31.98C503.1 320 518.6 296.2 509.2 275zM368 240h-12.12c-28.51 0-42.79 34.47-22.63 54.63l8.576 8.576c6.25 6.25 6.25 16.38 0 22.62c-3.125 3.125-7.219 4.688-11.31 4.688s-8.188-1.562-11.31-4.688l-8.576-8.576c-20.16-20.16-54.63-5.881-54.63 22.63V352c0 8.844-7.156 16-16 16s-16-7.156-16-16v-12.12c0-28.51-34.47-42.79-54.63-22.63l-8.576 8.576c-3.125 3.125-7.219 4.688-11.31 4.688c-4.096 0-8.188-1.562-11.31-4.688c-6.25-6.25-6.25-16.38 0-22.62l8.577-8.576C166.9 274.5 152.6 240 124.1 240H112c-8.844 0-16-7.156-16-16s7.157-16 16-16L124.1 208c28.51 0 42.79-34.47 22.63-54.63L138.2 144.8c-6.25-6.25-6.25-16.38 0-22.62s16.38-6.25 22.63 0L169.4 130.7c20.16 20.16 54.63 5.881 54.63-22.63V96c0-8.844 7.156-16 16-16S256 87.16 256 96v12.12c0 28.51 34.47 42.79 54.63 22.63l8.576-8.576c6.25-6.25 16.38-6.25 22.63 0s6.25 16.38 0 22.62L333.3 153.4C313.1 173.5 327.4 208 355.9 208l12.12-.0004c8.844 0 15.1 7.157 15.1 16S376.8 240 368 240z"],heading:[448,512,["header"],"f1dc","M448 448c0 17.69-14.33 32-32 32h-96c-17.67 0-32-14.31-32-32s14.33-32 32-32h16v-144h-224v144H128c17.67 0 32 14.31 32 32s-14.33 32-32 32H32c-17.67 0-32-14.31-32-32s14.33-32 32-32h16v-320H32c-17.67 0-32-14.31-32-32s14.33-32 32-32h96c17.67 0 32 14.31 32 32s-14.33 32-32 32H112v112h224v-112H320c-17.67 0-32-14.31-32-32s14.33-32 32-32h96c17.67 0 32 14.31 32 32s-14.33 32-32 32h-16v320H416C433.7 416 448 430.3 448 448z"],headphones:[512,512,[127911],"f025","M512 287.9l-.0042 112C511.1 444.1 476.1 480 432 480c-26.47 0-48-21.56-48-48.06V304.1C384 277.6 405.5 256 432 256c10.83 0 20.91 2.723 30.3 6.678C449.7 159.1 362.1 80.13 256 80.13S62.29 159.1 49.7 262.7C59.09 258.7 69.17 256 80 256C106.5 256 128 277.6 128 304.1v127.9C128 458.4 106.5 480 80 480c-44.11 0-79.1-35.88-79.1-80.06L0 288c0-141.2 114.8-256 256-256c140.9 0 255.6 114.5 255.1 255.3C511.1 287.5 511.1 287.7 512 287.9z"],"headphones-simple":[512,512,["headphones-alt"],"f58f","M256 32C112.9 32 4.563 151.1 0 288v104C0 405.3 10.75 416 23.1 416S48 405.3 48 392V288c0-114.7 93.34-207.8 208-207.8C370.7 80.2 464 173.3 464 288v104C464 405.3 474.7 416 488 416S512 405.3 512 392V287.1C507.4 151.1 399.1 32 256 32zM160 288L144 288c-35.34 0-64 28.7-64 64.13v63.75C80 451.3 108.7 480 144 480L160 480c17.66 0 32-14.34 32-32.05v-127.9C192 302.3 177.7 288 160 288zM368 288L352 288c-17.66 0-32 14.32-32 32.04v127.9c0 17.7 14.34 32.05 32 32.05L368 480c35.34 0 64-28.7 64-64.13v-63.75C432 316.7 403.3 288 368 288z"],headset:[512,512,[],"f590","M191.1 224c0-17.72-14.34-32.04-32-32.04L144 192c-35.34 0-64 28.66-64 64.08v47.79C80 339.3 108.7 368 144 368H160c17.66 0 32-14.36 32-32.06L191.1 224zM256 0C112.9 0 4.583 119.1 .0208 256L0 296C0 309.3 10.75 320 23.1 320S48 309.3 48 296V256c0-114.7 93.34-207.8 208-207.8C370.7 48.2 464 141.3 464 256v144c0 22.09-17.91 40-40 40h-110.7C305 425.7 289.7 416 272 416H241.8c-23.21 0-44.5 15.69-48.87 38.49C187 485.2 210.4 512 239.1 512H272c17.72 0 33.03-9.711 41.34-24H424c48.6 0 88-39.4 88-88V256C507.4 119.1 399.1 0 256 0zM368 368c35.34 0 64-28.7 64-64.13V256.1C432 220.7 403.3 192 368 192l-16 0c-17.66 0-32 14.34-32 32.04L320 335.9C320 353.7 334.3 368 352 368H368z"],heart:[512,512,[128153,128154,128155,128156,128420,129293,129294,129505,10084,61578,9829],"f004","M0 190.9V185.1C0 115.2 50.52 55.58 119.4 44.1C164.1 36.51 211.4 51.37 244 84.02L256 96L267.1 84.02C300.6 51.37 347 36.51 392.6 44.1C461.5 55.58 512 115.2 512 185.1V190.9C512 232.4 494.8 272.1 464.4 300.4L283.7 469.1C276.2 476.1 266.3 480 256 480C245.7 480 235.8 476.1 228.3 469.1L47.59 300.4C17.23 272.1 .0003 232.4 .0003 190.9L0 190.9z"],"heart-circle-bolt":[576,512,[],"e4fc","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM464.8 286.4L368.8 358.4C364.7 361.5 362.1 366.9 364.6 371.8C366.2 376.7 370.8 380 376 380H411.6L381.5 434.2C378.8 439.1 379.8 445.3 384.1 449C388.4 452.8 394.7 452.1 399.2 449.6L495.2 377.6C499.3 374.5 501 369.1 499.4 364.2C497.8 359.3 493.2 356 488 356H452.4L482.5 301.8C485.2 296.9 484.2 290.7 479.9 286.1C475.6 283.2 469.3 283 464.8 286.4V286.4z"],"heart-circle-check":[576,512,[],"e4fd","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM476.7 324.7L416 385.4L387.3 356.7C381.1 350.4 370.9 350.4 364.7 356.7C358.4 362.9 358.4 373.1 364.7 379.3L404.7 419.3C410.9 425.6 421.1 425.6 427.3 419.3L499.3 347.3C505.6 341.1 505.6 330.9 499.3 324.7C493.1 318.4 482.9 318.4 476.7 324.7H476.7z"],"heart-circle-exclamation":[576,512,[],"e4fe","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM415.1 288V368C415.1 376.8 423.2 384 431.1 384C440.8 384 447.1 376.8 447.1 368V288C447.1 279.2 440.8 272 431.1 272C423.2 272 415.1 279.2 415.1 288z"],"heart-circle-minus":[576,512,[],"e4ff","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM496 351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1z"],"heart-circle-plus":[576,512,[],"e500","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM448 303.1C448 295.2 440.8 287.1 432 287.1C423.2 287.1 416 295.2 416 303.1V351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H416V431.1C416 440.8 423.2 447.1 432 447.1C440.8 447.1 448 440.8 448 431.1V383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1H448V303.1z"],"heart-circle-xmark":[576,512,[],"e501","M256 368C256 403.7 266.6 436.9 284.9 464.6L279.4 470.3C266.4 483.2 245.5 483.2 233.5 470.3L39.71 270.5C-16.22 212.5-13.23 116.6 49.7 62.68C103.6 15.73 186.5 24.72 236.5 75.67L256.4 96.64L275.4 75.67C325.4 24.72 407.3 15.73 463.2 62.68C506.1 100.1 520.7 157.6 507 208.7C484.3 198 458.8 192 432 192C334.8 192 256 270.8 256 368zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM491.3 331.3C497.6 325.1 497.6 314.9 491.3 308.7C485.1 302.4 474.9 302.4 468.7 308.7L432 345.4L395.3 308.7C389.1 302.4 378.9 302.4 372.7 308.7C366.4 314.9 366.4 325.1 372.7 331.3L409.4 368L372.7 404.7C366.4 410.9 366.4 421.1 372.7 427.3C378.9 433.6 389.1 433.6 395.3 427.3L432 390.6L468.7 427.3C474.9 433.6 485.1 433.6 491.3 427.3C497.6 421.1 497.6 410.9 491.3 404.7L454.6 368L491.3 331.3z"],"heart-crack":[512,512,[128148,"heart-broken"],"f7a9","M119.4 44.1C142.7 40.22 166.2 42.2 187.1 49.43L237.8 126.9L162.3 202.3C160.8 203.9 159.1 205.1 160 208.2C160 210.3 160.1 212.4 162.6 213.9L274.6 317.9C277.5 320.6 281.1 320.7 285.1 318.2C288.2 315.6 288.9 311.2 286.8 307.8L226.4 209.7L317.1 134.1C319.7 131.1 320.7 128.5 319.5 125.3L296.8 61.74C325.4 45.03 359.2 38.53 392.6 44.1C461.5 55.58 512 115.2 512 185.1V190.9C512 232.4 494.8 272.1 464.4 300.4L283.7 469.1C276.2 476.1 266.3 480 256 480C245.7 480 235.8 476.1 228.3 469.1L47.59 300.4C17.23 272.1 0 232.4 0 190.9V185.1C0 115.2 50.52 55.58 119.4 44.09V44.1z"],"heart-pulse":[576,512,["heartbeat"],"f21e","M352.4 243.8l-49.83 99.5c-6.009 12-23.41 11.62-28.92-.625L216.7 216.3l-30.05 71.75L88.55 288l176.4 182.2c12.66 13.07 33.36 13.07 46.03 0l176.4-182.2l-112.1 .0052L352.4 243.8zM495.2 62.86c-54.36-46.98-137.5-38.5-187.5 13.06L288 96.25L268.3 75.92C218.3 24.36 135.2 15.88 80.81 62.86C23.37 112.5 16.84 197.6 60.18 256h105l35.93-86.25c5.508-12.88 23.66-13.12 29.54-.375l58.21 129.4l49.07-98c5.884-11.75 22.78-11.75 28.67 0l27.67 55.25h121.5C559.2 197.6 552.6 112.5 495.2 62.86z"],helicopter:[640,512,[128641],"f533","M127.1 32C127.1 14.33 142.3 0 159.1 0H544C561.7 0 576 14.33 576 32C576 49.67 561.7 64 544 64H384V128H416C504.4 128 576 199.6 576 288V352C576 369.7 561.7 384 544 384H303.1C293.9 384 284.4 379.3 278.4 371.2L191.1 256L47.19 198.1C37.65 194.3 30.52 186.1 28.03 176.1L4.97 83.88C2.445 73.78 10.08 64 20.49 64H47.1C58.07 64 67.56 68.74 73.6 76.8L111.1 128H319.1V64H159.1C142.3 64 127.1 49.67 127.1 32V32zM384 320H512V288C512 234.1 469 192 416 192H384V320zM630.6 470.6L626.7 474.5C602.7 498.5 570.2 512 536.2 512H255.1C238.3 512 223.1 497.7 223.1 480C223.1 462.3 238.3 448 255.1 448H536.2C553.2 448 569.5 441.3 581.5 429.3L585.4 425.4C597.9 412.9 618.1 412.9 630.6 425.4C643.1 437.9 643.1 458.1 630.6 470.6L630.6 470.6z"],"helicopter-symbol":[576,512,[],"e502","M320 66.66V1.985C435.8 16.42 527.6 108.2 542 224H477.3C463.9 143.6 400.4 80.15 320 66.66V66.66zM320 510V445.4C400.4 431.9 463.9 368.4 477.3 288H542C527.6 403.8 435.8 495.6 320 510V510zM33.98 288H98.65C112.1 368.4 175.6 431.9 256 445.4V510C140.2 495.6 48.42 403.8 33.98 288zM256 1.984V66.66C175.6 80.15 112.1 143.6 98.66 224H33.98C48.42 108.2 140.2 16.42 256 1.985V1.984zM240 224H336V160C336 142.3 350.3 128 368 128C385.7 128 400 142.3 400 160V352C400 369.7 385.7 384 368 384C350.3 384 336 369.7 336 352V288H240V352C240 369.7 225.7 384 208 384C190.3 384 176 369.7 176 352V160C176 142.3 190.3 128 208 128C225.7 128 240 142.3 240 160V224z"],"helmet-safety":[576,512,["hard-hat","hat-hard"],"f807","M544 280.9c0-89.17-61.83-165.4-139.6-197.4L352 174.2V49.78C352 39.91 344.1 32 334.2 32H241.8C231.9 32 224 39.91 224 49.78v124.4L171.6 83.53C93.83 115.5 32 191.7 32 280.9L31.99 352h512L544 280.9zM574.7 393.7C572.2 387.8 566.4 384 560 384h-544c-6.375 0-12.16 3.812-14.69 9.656c-2.531 5.875-1.344 12.69 3.062 17.34C7.031 413.8 72.02 480 287.1 480s280.1-66.19 283.6-69C576 406.3 577.2 399.5 574.7 393.7z"],"helmet-un":[512,512,[],"e503","M480 224C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H368V462.5L369.5 464H456C469.3 464 480 474.7 480 488C480 501.3 469.3 512 456 512H360C353.9 512 347.1 509.7 343.5 505.4L214.9 384H87.65C39.24 384 0 344.8 0 296.3V240C0 107.5 107.5 0 240 0C367.2 0 471.2 98.91 479.5 224H480zM320 288H274.4L241.1 343.5L320 417.2V288zM285.3 103.1C281.4 97.26 274.1 94.64 267.4 96.69C260.6 98.73 256 104.9 256 112V208C256 216.8 263.2 224 272 224C280.8 224 288 216.8 288 208V164.8L322.7 216.9C326.6 222.7 333.9 225.4 340.6 223.3C347.4 221.3 352 215.1 352 208V112C352 103.2 344.8 96 336 96C327.2 96 320 103.2 320 112V155.2L285.3 103.1zM160 112C160 103.2 152.8 96 144 96C135.2 96 128 103.2 128 112V176C128 202.5 149.5 224 176 224C202.5 224 224 202.5 224 176V112C224 103.2 216.8 96 208 96C199.2 96 192 103.2 192 112V176C192 184.8 184.8 192 176 192C167.2 192 160 184.8 160 176V112z"],highlighter:[576,512,[],"f591","M143.1 320V248.3C143.1 233 151.2 218.7 163.5 209.6L436.6 8.398C444 2.943 452.1 0 462.2 0C473.6 0 484.5 4.539 492.6 12.62L547.4 67.38C555.5 75.46 559.1 86.42 559.1 97.84C559.1 107 557.1 115.1 551.6 123.4L350.4 396.5C341.3 408.8 326.1 416 311.7 416H239.1L214.6 441.4C202.1 453.9 181.9 453.9 169.4 441.4L118.6 390.6C106.1 378.1 106.1 357.9 118.6 345.4L143.1 320zM489.4 99.92L460.1 70.59L245 229L330.1 314.1L489.4 99.92zM23.03 466.3L86.06 403.3L156.7 473.9L125.7 504.1C121.2 509.5 115.1 512 108.7 512H40C26.75 512 16 501.3 16 488V483.3C16 476.1 18.53 470.8 23.03 466.3V466.3z"],"hill-avalanche":[640,512,[],"e507","M161.4 91.58C160.5 87.87 160 83.99 160 80C160 53.49 181.5 32 208 32C229.9 32 248.3 46.62 254.1 66.62C268.5 45.7 292.7 32 320 32C364.2 32 400 67.82 400 112C400 119.4 398.1 126.6 397.1 133.5C426.9 145.1 448 174.1 448 208C448 236.4 433.2 261.3 410.9 275.5L492.6 357.2C508.2 372.8 533.6 372.8 549.2 357.2C564.8 341.6 564.8 316.2 549.2 300.6C533.6 284.1 508.2 284.1 492.6 300.6L458.7 266.7C493 232.3 548.8 232.3 583.1 266.7C617.5 301 617.5 356.8 583.1 391.1C552.8 421.4 505.9 425 471.7 401.9L161.4 91.58zM512 64C512 81.67 497.7 96 480 96C462.3 96 448 81.67 448 64C448 46.33 462.3 32 480 32C497.7 32 512 46.33 512 64zM480 160C480 142.3 494.3 128 512 128C529.7 128 544 142.3 544 160C544 177.7 529.7 192 512 192C494.3 192 480 177.7 480 160zM456.1 443.7C482.2 468.9 464.3 512 428.7 512H112C67.82 512 32 476.2 32 432V115.3C32 79.68 75.09 61.83 100.3 87.03L456.1 443.7z"],"hill-rockslide":[576,512,[],"e508","M252.4 103.8C249.7 98.97 249.7 93.03 252.4 88.16L279.4 40.16C282.2 35.12 287.6 32 293.4 32H346.6C352.4 32 357.8 35.12 360.6 40.16L387.6 88.16C390.3 93.03 390.3 98.97 387.6 103.8L360.6 151.8C357.8 156.9 352.4 160 346.6 160H293.4C287.6 160 282.2 156.9 279.4 151.8L252.4 103.8zM424.1 443.7C450.2 468.9 432.3 512 396.7 512H80C35.82 512 0 476.2 0 432V115.3C0 79.68 43.09 61.83 68.28 87.03L424.1 443.7zM456.2 376.6C451.1 373.8 448 368.4 448 362.6V309.4C448 303.6 451.1 298.2 456.2 295.4L504.2 268.4C509 265.7 514.1 265.7 519.8 268.4L567.8 295.4C572.9 298.2 576 303.6 576 309.4V362.6C576 368.4 572.9 373.8 567.8 376.6L519.8 403.6C514.1 406.3 509 406.3 504.2 403.6L456.2 376.6zM192 64C192 81.67 177.7 96 160 96C142.3 96 128 81.67 128 64C128 46.33 142.3 32 160 32C177.7 32 192 46.33 192 64zM352 256C352 238.3 366.3 224 384 224C401.7 224 416 238.3 416 256C416 273.7 401.7 288 384 288C366.3 288 352 273.7 352 256z"],hippo:[640,512,[129435],"f6ed","M407 47.03C416.4 37.66 431.6 37.66 440.1 47.03L458.2 64.21C460.1 64.07 462 64 463.1 64H495.1C507.2 64 517.9 66.31 527.6 70.48L543 55.03C552.4 45.66 567.6 45.66 576.1 55.03C586.3 64.4 586.3 79.6 576.1 88.97L564 101.9C571.6 114.1 575.1 128.6 575.1 144C575.1 154.2 583.4 162.8 592.7 166.1C620.6 179.5 639.1 207.5 639.1 240C639.1 266.2 627.4 289.4 607.1 304V336C607.1 344.8 600.8 352 591.1 352H559.1C551.2 352 543.1 344.8 543.1 336V320H479.1V336C479.1 344.8 472.8 352 463.1 352H431.1C423.2 352 415.1 344.8 415.1 336V318.4C404.2 316 393.3 310.1 383.1 304C382.5 302.9 381.1 301.7 379.7 300.5C362.7 285.9 351.1 264.2 351.1 240C351.1 231.2 344.8 224 335.1 224C327.2 224 319.1 231.2 319.1 240C319.1 284.7 346.2 323.2 383.1 341.2V352C383.1 369.7 398.3 384 415.1 384H447.1V448C447.1 465.7 433.7 480 415.1 480H351.1C334.3 480 319.1 465.7 319.1 448V372C300.2 379.7 278.6 384 255.1 384C233.4 384 211.8 379.7 191.1 372V448C191.1 465.7 177.7 480 159.1 480H95.1C78.33 480 63.1 465.7 63.1 448V329.1L45.93 369.7C40.55 381.9 26.36 387.3 14.25 381.9C2.138 376.5-3.317 362.4 2.067 350.3L23.1 300.9C29.27 289 31.1 276.2 31.1 263.2C31.1 155.7 117.2 68.02 223.8 64.13L223.1 64H288C329.7 64 371.4 76.07 405.2 89.73C406.9 87.9 408.7 86.15 410.5 84.48L407 80.97C397.7 71.6 397.7 56.4 407 47.03H407zM455.1 208C442.7 208 431.1 218.7 431.1 232C431.1 245.3 442.7 256 455.1 256C469.3 256 479.1 245.3 479.1 232C479.1 218.7 469.3 208 455.1 208zM567.1 256C581.3 256 591.1 245.3 591.1 232C591.1 218.7 581.3 208 567.1 208C554.7 208 543.1 218.7 543.1 232C543.1 245.3 554.7 256 567.1 256zM463.1 128C455.2 128 447.1 135.2 447.1 144C447.1 152.8 455.2 160 463.1 160C472.8 160 479.1 152.8 479.1 144C479.1 135.2 472.8 128 463.1 128zM527.1 160C536.8 160 543.1 152.8 543.1 144C543.1 135.2 536.8 128 527.1 128C519.2 128 511.1 135.2 511.1 144C511.1 152.8 519.2 160 527.1 160z"],"hockey-puck":[512,512,[],"f453","M0 160c0-53 114.6-96 256-96s256 43 256 96s-114.6 96-256 96S0 213 0 160zM255.1 303.1C156.4 303.1 56.73 283.4 0 242.2V352c0 53 114.6 96 256 96s256-43 256-96V242.2C455.3 283.4 355.6 303.1 255.1 303.1z"],"holly-berry":[512,512,[],"f7aa","M287.1 143.1c0 26.5 21.5 47.1 47.1 47.1c26.5 0 48-21.5 48-47.1s-21.5-47.1-48-47.1C309.5 95.99 287.1 117.5 287.1 143.1zM176 191.1c26.5 0 47.1-21.5 47.1-47.1S202.5 95.96 176 95.96c-26.5 0-47.1 21.5-47.1 47.1S149.5 191.1 176 191.1zM303.1 47.1C303.1 21.5 282.5 0 255.1 0c-26.5 0-47.1 21.5-47.1 47.1S229.5 95.99 255.1 95.99C282.5 95.99 303.1 74.5 303.1 47.1zM243.7 242.6C245.3 229.7 231.9 220.1 219.5 225.5C179.7 242.8 137.8 251.4 96.72 250.8C86.13 250.6 78.49 260.7 81.78 270.4C86.77 285.7 90.33 301.4 92.44 317.7c2.133 16.15-9.387 31.26-26.12 34.23c-16.87 2.965-33.7 4.348-50.48 4.152c-10.6-.0586-18.37 10.05-15.08 19.74c12.4 35.79 16.57 74.93 12.12 114.7c-1.723 14.96 13.71 25.67 28.02 19.8c38.47-15.95 78.77-23.81 118.2-23.34c10.58 .1953 18.36-9.91 15.07-19.6c-5.141-15.15-8.68-31.06-10.79-47.34c-2.133-16.16 9.371-31.13 26.24-34.09c16.73-2.973 33.57-4.496 50.36-4.301c10.73 .0781 18.51-10.03 15.22-19.72C242.5 324.7 238.5 283.9 243.7 242.6zM496.2 356.1c-16.78 .1953-33.61-1.188-50.48-4.152c-16.73-2.973-28.25-18.08-26.12-34.23c2.115-16.28 5.67-32.05 10.66-47.32c3.289-9.691-4.35-19.81-14.93-19.62c-41.11 .6484-83.01-7.965-122.7-25.23c-6.85-2.969-13.71-1.18-18.47 2.953c1.508 5.836 2.102 11.93 1.332 18.05c-4.539 36.23-1.049 72.56 10.12 105.1c3.395 9.988 3.029 20.73-.4766 30.52c12.44 .5 24.89 1.602 37.28 3.801c16.87 2.957 28.37 17.93 26.24 34.09c-2.115 16.27-5.654 32.19-10.79 47.34c-3.289 9.691 4.486 19.8 15.07 19.6c39.47-.4766 79.77 7.383 118.2 23.34c14.31 5.867 29.74-4.844 28.02-19.8c-4.451-39.81-.2832-78.95 12.12-114.7C514.5 366.1 506.8 356 496.2 356.1z"],horse:[576,512,[128014],"f6f0","M575.9 76.61c0-8.125-3.05-15.84-8.55-21.84c-3.875-4-8.595-9.125-13.72-14.5c11.12-6.75 19.47-17.51 22.22-30.63c.9999-5-2.849-9.641-7.974-9.641L447.9 0c-70.62 0-127.9 57.25-127.9 128L159.1 128c-28.87 0-54.38 12.1-72 33.12L87.1 160C39.5 160 .0001 199.5 .0001 248L0 304c0 8.875 7.125 15.1 15.1 15.1L31.1 320c8.874 0 15.1-7.125 15.1-16l.0005-56c0-13.25 6.884-24.4 16.76-31.65c-.125 2.5-.758 5.024-.758 7.649c0 27.62 11.87 52.37 30.5 69.87l-25.65 68.61c-4.586 12.28-5.312 25.68-2.128 38.4l21.73 86.89C92.02 502 104.8 512 119.5 512h32.98c20.81 0 36.08-19.55 31.05-39.74L162.2 386.9l23.78-63.61l133.1 22.34L319.1 480c0 17.67 14.33 32 31.1 32h31.1c17.67 0 31.1-14.33 31.1-32l.0166-161.8C435.7 297.1 447.1 270.5 447.1 240c0-.25-.1025-.3828-.1025-.6328V136.9L463.9 144l18.95 37.72c7.481 14.86 25.08 21.55 40.52 15.34l32.54-13.05c12.13-4.878 20.11-16.67 20.09-29.74L575.9 76.61zM511.9 96c-8.75 0-15.1-7.125-15.1-16S503.1 64 511.9 64c8.874 0 15.1 7.125 15.1 16S520.8 96 511.9 96z"],"horse-head":[512,512,[],"f7ab","M509.8 332.5l-69.89-164.3c-14.88-41.25-50.38-70.98-93.01-79.24c18-10.63 46.35-35.9 34.23-82.29c-1.375-5.001-7.112-7.972-11.99-6.097l-202.3 75.66C35.89 123.4 0 238.9 0 398.8v81.24C0 497.7 14.25 512 32 512h236.2c23.75 0 39.3-25.03 28.55-46.28l-40.78-81.71V383.3c-45.63-3.5-84.66-30.7-104.3-69.58c-1.625-3.125-.9342-6.951 1.566-9.327l12.11-12.11c3.875-3.875 10.64-2.692 12.89 2.434c14.88 33.63 48.17 57.38 87.42 57.38c17.13 0 33.05-5.091 46.8-13.22l46 63.9c6 8.501 15.75 13.34 26 13.34h50.28c8.501 0 16.61-3.388 22.61-9.389l45.34-39.84C511.6 357.7 514.4 344.2 509.8 332.5zM328.1 223.1c-13.25 0-23.96-10.75-23.96-24c0-13.25 10.75-23.92 24-23.92s23.94 10.73 23.94 23.98C352 213.3 341.3 223.1 328.1 223.1z"],hospital:[640,512,[127973,62589,"hospital-alt","hospital-wide"],"f0f8","M192 48C192 21.49 213.5 0 240 0H400C426.5 0 448 21.49 448 48V512H368V432C368 405.5 346.5 384 320 384C293.5 384 272 405.5 272 432V512H192V48zM312 64C303.2 64 296 71.16 296 80V104H272C263.2 104 256 111.2 256 120V136C256 144.8 263.2 152 272 152H296V176C296 184.8 303.2 192 312 192H328C336.8 192 344 184.8 344 176V152H368C376.8 152 384 144.8 384 136V120C384 111.2 376.8 104 368 104H344V80C344 71.16 336.8 64 328 64H312zM160 96V512H48C21.49 512 0 490.5 0 464V320H80C88.84 320 96 312.8 96 304C96 295.2 88.84 288 80 288H0V224H80C88.84 224 96 216.8 96 208C96 199.2 88.84 192 80 192H0V144C0 117.5 21.49 96 48 96H160zM592 96C618.5 96 640 117.5 640 144V192H560C551.2 192 544 199.2 544 208C544 216.8 551.2 224 560 224H640V288H560C551.2 288 544 295.2 544 304C544 312.8 551.2 320 560 320H640V464C640 490.5 618.5 512 592 512H480V96H592z"],"hospital-user":[576,512,[],"f80d","M272 0C298.5 0 320 21.49 320 48V367.8C281.8 389.2 256 430 256 476.9C256 489.8 259.6 501.8 265.9 512H48C21.49 512 0 490.5 0 464V384H144C152.8 384 160 376.8 160 368C160 359.2 152.8 352 144 352H0V288H144C152.8 288 160 280.8 160 272C160 263.2 152.8 256 144 256H0V48C0 21.49 21.49 0 48 0H272zM152 64C143.2 64 136 71.16 136 80V104H112C103.2 104 96 111.2 96 120V136C96 144.8 103.2 152 112 152H136V176C136 184.8 143.2 192 152 192H168C176.8 192 184 184.8 184 176V152H208C216.8 152 224 144.8 224 136V120C224 111.2 216.8 104 208 104H184V80C184 71.16 176.8 64 168 64H152zM512 272C512 316.2 476.2 352 432 352C387.8 352 352 316.2 352 272C352 227.8 387.8 192 432 192C476.2 192 512 227.8 512 272zM288 477.1C288 425.7 329.7 384 381.1 384H482.9C534.3 384 576 425.7 576 477.1C576 496.4 560.4 512 541.1 512H322.9C303.6 512 288 496.4 288 477.1V477.1z"],"hot-tub-person":[512,512,["hot-tub"],"f593","M414.3 177.6C415.3 185.9 421.1 192 429.1 192h16.13c9.5 0 17-8.625 16-18.38C457.8 134.5 439.6 99.12 412 76.5c-17.38-14.12-28.88-36.75-32-62.12C379 6.125 372.3 0 364.3 0h-16.12c-9.5 0-17.12 8.625-16 18.38c4.375 39.12 22.38 74.5 50.13 97.13C399.6 129.6 411 152.2 414.3 177.6zM306.3 177.6C307.3 185.9 313.1 192 321.1 192h16.13c9.5 0 17-8.625 16-18.38C349.8 134.5 331.6 99.12 304 76.5c-17.38-14.12-28.88-36.75-32-62.12C271 6.125 264.3 0 256.3 0h-16.17C230.6 0 223 8.625 224.1 18.38C228.5 57.5 246.5 92.88 274.3 115.5C291.6 129.6 303 152.2 306.3 177.6zM480 256h-224L145.1 172.8C133.1 164.5 120.5 160 106.6 160H64C28.62 160 0 188.6 0 224v224c0 35.38 28.62 64 64 64h384c35.38 0 64-28.62 64-64V288C512 270.4 497.6 256 480 256zM128 440C128 444.4 124.4 448 120 448h-16C99.62 448 96 444.4 96 440v-112C96 323.6 99.62 320 104 320h16C124.4 320 128 323.6 128 328V440zM224 440C224 444.4 220.4 448 216 448h-16C195.6 448 192 444.4 192 440v-112C192 323.6 195.6 320 200 320h16C220.4 320 224 323.6 224 328V440zM320 440c0 4.375-3.625 8-8 8h-16C291.6 448 288 444.4 288 440v-112c0-4.375 3.625-8 8-8h16c4.375 0 8 3.625 8 8V440zM416 440c0 4.375-3.625 8-8 8h-16C387.6 448 384 444.4 384 440v-112c0-4.375 3.625-8 8-8h16c4.375 0 8 3.625 8 8V440zM64 128c35.38 0 64-28.62 64-64S99.38 0 64 0S0 28.62 0 64S28.62 128 64 128z"],hotdog:[512,512,[127789],"f80f","M488.6 23.44c-31.06-31.19-81.76-31.16-112.8 .0313L24.46 374.8c-20.83 19.96-29.19 49.66-21.83 77.6c7.36 27.94 29.07 49.65 57.02 57.01c27.94 7.36 57.64-1 77.6-21.83l351.3-351.3C519.7 105.2 519.8 54.5 488.6 23.44zM438.8 118.4c-19.59 19.59-37.39 22.52-51.74 25.01c-12.97 2.246-22.33 3.867-34.68 16.22c-12.35 12.35-13.97 21.71-16.22 34.69c-2.495 14.35-5.491 32.19-25.08 51.78c-19.59 19.59-37.43 22.58-51.78 25.08C246.3 273.4 236.9 275.1 224.6 287.4c-12.35 12.35-13.97 21.71-16.22 34.68C205.9 336.4 202.9 354.3 183.3 373.9c-19.59 19.59-37.43 22.58-51.78 25.08C118.5 401.2 109.2 402.8 96.83 415.2c-6.238 6.238-16.34 6.238-22.58 0c-6.238-6.238-6.238-16.35 0-22.58c19.59-19.59 37.43-22.58 51.78-25.07c12.97-2.245 22.33-3.869 34.68-16.22c12.35-12.35 13.97-21.71 16.22-34.69c2.495-14.35 5.492-32.19 25.08-51.78s37.43-22.58 51.78-25.08c12.97-2.246 22.33-3.869 34.68-16.22s13.97-21.71 16.22-34.68c2.495-14.35 5.492-32.19 25.08-51.78c19.59-19.59 37.43-22.58 51.78-25.07c12.97-2.246 22.28-3.815 34.63-16.17c6.238-6.238 16.36-6.238 22.59 0C444.1 102.1 444.1 112.2 438.8 118.4zM32.44 321.5l290-290l-11.48-11.6c-24.95-24.95-63.75-26.57-86.58-3.743L17.1 223.4C-5.73 246.3-4.108 285.1 20.84 310L32.44 321.5zM480.6 189.5l-290 290l11.48 11.6c24.95 24.95 63.75 26.57 86.58 3.743l207.3-207.3c22.83-22.83 21.21-61.63-3.743-86.58L480.6 189.5z"],hotel:[512,512,[127976],"f594","M480 0C497.7 0 512 14.33 512 32C512 49.67 497.7 64 480 64V448C497.7 448 512 462.3 512 480C512 497.7 497.7 512 480 512H304V448H208V512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V64C14.33 64 0 49.67 0 32C0 14.33 14.33 0 32 0H480zM112 96C103.2 96 96 103.2 96 112V144C96 152.8 103.2 160 112 160H144C152.8 160 160 152.8 160 144V112C160 103.2 152.8 96 144 96H112zM224 144C224 152.8 231.2 160 240 160H272C280.8 160 288 152.8 288 144V112C288 103.2 280.8 96 272 96H240C231.2 96 224 103.2 224 112V144zM368 96C359.2 96 352 103.2 352 112V144C352 152.8 359.2 160 368 160H400C408.8 160 416 152.8 416 144V112C416 103.2 408.8 96 400 96H368zM96 240C96 248.8 103.2 256 112 256H144C152.8 256 160 248.8 160 240V208C160 199.2 152.8 192 144 192H112C103.2 192 96 199.2 96 208V240zM240 192C231.2 192 224 199.2 224 208V240C224 248.8 231.2 256 240 256H272C280.8 256 288 248.8 288 240V208C288 199.2 280.8 192 272 192H240zM352 240C352 248.8 359.2 256 368 256H400C408.8 256 416 248.8 416 240V208C416 199.2 408.8 192 400 192H368C359.2 192 352 199.2 352 208V240zM256 288C211.2 288 173.5 318.7 162.1 360.2C159.7 373.1 170.7 384 184 384H328C341.3 384 352.3 373.1 349 360.2C338.5 318.7 300.8 288 256 288z"],hourglass:[384,512,[62032,9203,"hourglass-empty"],"f254","M0 32C0 14.33 14.33 0 32 0H352C369.7 0 384 14.33 384 32C384 49.67 369.7 64 352 64V74.98C352 117.4 335.1 158.1 305.1 188.1L237.3 256L305.1 323.9C335.1 353.9 352 394.6 352 437V448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V437C32 394.6 48.86 353.9 78.86 323.9L146.7 256L78.86 188.1C48.86 158.1 32 117.4 32 74.98V64C14.33 64 0 49.67 0 32zM96 64V74.98C96 100.4 106.1 124.9 124.1 142.9L192 210.7L259.9 142.9C277.9 124.9 288 100.4 288 74.98V64H96zM96 448H288V437C288 411.6 277.9 387.1 259.9 369.1L192 301.3L124.1 369.1C106.1 387.1 96 411.6 96 437V448z"],"hourglass-end":[384,512,[8987,"hourglass-3"],"f253","M352 0C369.7 0 384 14.33 384 32C384 49.67 369.7 64 352 64V74.98C352 117.4 335.1 158.1 305.1 188.1L237.3 256L305.1 323.9C335.1 353.9 352 394.6 352 437V448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V437C32 394.6 48.86 353.9 78.86 323.9L146.7 256L78.86 188.1C48.86 158.1 32 117.4 32 74.98V64C14.33 64 0 49.67 0 32C0 14.33 14.33 0 32 0H352zM124.1 142.9L192 210.7L259.9 142.9C277.9 124.9 288 100.4 288 74.98V64H96V74.98C96 100.4 106.1 124.9 124.1 142.9z"],"hourglass-half":[384,512,["hourglass-2"],"f252","M352 0C369.7 0 384 14.33 384 32C384 49.67 369.7 64 352 64V74.98C352 117.4 335.1 158.1 305.1 188.1L237.3 256L305.1 323.9C335.1 353.9 352 394.6 352 437V448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V437C32 394.6 48.86 353.9 78.86 323.9L146.7 256L78.86 188.1C48.86 158.1 32 117.4 32 74.98V64C14.33 64 0 49.67 0 32C0 14.33 14.33 0 32 0H352zM111.1 128H272C282.4 112.4 288 93.98 288 74.98V64H96V74.98C96 93.98 101.6 112.4 111.1 128zM111.1 384H272C268.5 378.7 264.5 373.7 259.9 369.1L192 301.3L124.1 369.1C119.5 373.7 115.5 378.7 111.1 384V384z"],"hourglass-start":[384,512,["hourglass-1"],"f251","M352 0C369.7 0 384 14.33 384 32C384 49.67 369.7 64 352 64V74.98C352 117.4 335.1 158.1 305.1 188.1L237.3 256L305.1 323.9C335.1 353.9 352 394.6 352 437V448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448V437C32 394.6 48.86 353.9 78.86 323.9L146.7 256L78.86 188.1C48.86 158.1 32 117.4 32 74.98V64C14.33 64 0 49.67 0 32C0 14.33 14.33 0 32 0H352zM259.9 369.1L192 301.3L124.1 369.1C106.1 387.1 96 411.6 96 437V448H288V437C288 411.6 277.9 387.1 259.9 369.1V369.1z"],house:[576,512,[63498,63500,127968,"home","home-alt","home-lg-alt"],"f015","M575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8L512.5 447.7C512.5 450.5 512.3 453.1 512 455.8V472C512 494.1 494.1 512 472 512H456C454.9 512 453.8 511.1 452.7 511.9C451.3 511.1 449.9 512 448.5 512H392C369.9 512 352 494.1 352 472V384C352 366.3 337.7 352 320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5L575.8 255.5z"],"house-chimney":[576,512,[63499,"home-lg"],"e3af","M511.8 287.6L512.5 447.7C512.5 450.5 512.3 453.1 512 455.8V472C512 494.1 494.1 512 472 512H456C454.9 512 453.8 511.1 452.7 511.9C451.3 511.1 449.9 512 448.5 512H392C369.9 512 352 494.1 352 472V384C352 366.3 337.7 352 320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L416 100.7V64C416 46.33 430.3 32 448 32H480C497.7 32 512 46.33 512 64V185L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6L511.8 287.6z"],"house-chimney-crack":[576,512,["house-damage"],"f6f1","M575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8L512.5 447.7C512.6 483.2 483.9 512 448.5 512H326.4L288 448L368.8 380.7C376.6 374.1 376.5 362.1 368.5 355.8L250.6 263.2C235.1 251.7 216.8 270.1 227.8 285.2L288 368L202.5 439.2C196.5 444.3 194.1 452.1 199.1 459.8L230.4 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L416 100.7V64C416 46.33 430.3 32 448 32H480C497.7 32 512 46.33 512 64V185L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5L575.8 255.5z"],"house-chimney-medical":[576,512,["clinic-medical"],"f7f2","M511.8 287.6L512.5 447.7C512.6 483.2 483.9 512 448.5 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L416 100.7V64C416 46.33 430.3 32 448 32H480C497.7 32 512 46.33 512 64V185L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6L511.8 287.6zM400 248C400 239.2 392.8 232 384 232H328V176C328 167.2 320.8 160 312 160H264C255.2 160 248 167.2 248 176V232H192C183.2 232 176 239.2 176 248V296C176 304.8 183.2 312 192 312H248V368C248 376.8 255.2 384 264 384H312C320.8 384 328 376.8 328 368V312H384C392.8 312 400 304.8 400 296V248z"],"house-chimney-user":[576,512,[],"e065","M511.8 287.6L512.5 447.7C512.6 483.2 483.9 512 448.5 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L416 100.7V64C416 46.33 430.3 32 448 32H480C497.7 32 512 46.33 512 64V185L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6L511.8 287.6zM288 288C323.3 288 352 259.3 352 224C352 188.7 323.3 160 288 160C252.7 160 224 188.7 224 224C224 259.3 252.7 288 288 288zM192 416H384C392.8 416 400 408.8 400 400C400 355.8 364.2 320 320 320H256C211.8 320 176 355.8 176 400C176 408.8 183.2 416 192 416z"],"house-chimney-window":[576,512,[],"e00d","M575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8L512.5 447.7C512.6 483.2 483.9 512 448.5 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L416 100.7V64C416 46.33 430.3 32 448 32H480C497.7 32 512 46.33 512 64V185L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5L575.8 255.5zM248 192C234.7 192 224 202.7 224 216V296C224 309.3 234.7 320 248 320H328C341.3 320 352 309.3 352 296V216C352 202.7 341.3 192 328 192H248z"],"house-circle-check":[640,512,[],"e509","M320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C404.2 192 328.8 262.3 320.7 352L320 352zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"house-circle-exclamation":[640,512,[],"e50a","M320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C404.2 192 328.8 262.3 320.7 352L320 352zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"house-circle-xmark":[640,512,[],"e50b","M320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C404.2 192 328.8 262.3 320.7 352L320 352zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"house-crack":[576,512,[],"e3b1","M511.8 287.6L512.5 447.7C512.6 483.2 483.9 512 448.5 512H326.4L288 448L368.8 380.7C376.6 374.1 376.5 362.1 368.5 355.8L250.6 263.2C235.1 251.7 216.8 270.1 227.8 285.2L288 368L202.5 439.2C196.5 444.3 194.1 452.1 199.1 459.8L230.4 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8z"],"house-fire":[640,512,[],"e50c","M288 350.1L288 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L447.3 128.1C434.9 127.2 422.3 131.1 412.5 139.9C377.1 171.5 346.9 207.6 325.2 242.7C304.3 276.5 288 314.9 288 350.1H288zM509 221.5C516.9 211.6 525.8 200.8 535.5 191.1C541.1 186.9 549.9 186.9 555.5 192C580.2 214.7 601.1 244.7 615.8 273.2C630.4 301.2 640 329.9 640 350.1C640 437.9 568.7 512 480 512C390.3 512 320 437.8 320 350.1C320 323.7 332.7 291.5 352.4 259.5C372.4 227.2 400.5 193.4 433.8 163.7C439.4 158.7 447.1 158.8 453.5 163.8C473.3 181.6 491.8 200.7 509 221.5V221.5zM550 336.1C548 332.1 546 328.1 543 324.1L507 367C507 367 449 293 445 288C415 324.1 400 346 400 370C400 419 436 448 481 448C499 448 515 443 530 432.1C560 412 568 370 550 336.1z"],"house-flag":[640,512,[],"e50d","M480 0C497.7 0 512 14.33 512 32H624C632.8 32 640 39.16 640 48V176C640 184.8 632.8 192 624 192H512V512H448V32C448 14.33 462.3 0 480 0V0zM416 512H416.1L416.8 512H352C334.3 512 320 497.7 320 480V384C320 366.3 305.7 352 288 352H224C206.3 352 192 366.3 192 384V480C192 497.7 177.7 512 160 512H96C78.33 512 64 497.7 64 480V288H31.1C18.61 288 6.631 279.7 1.985 267.1C-2.661 254.5 1.005 240.4 11.17 231.7L235.2 39.7C247.2 29.43 264.8 29.43 276.8 39.7L416 159V512z"],"house-flood-water":[576,512,[],"e50e","M482.8 134.1C494 142.3 498.7 156.7 494.4 169.9C490.1 183.1 477.9 192 464 192H447.4L447.7 265.2C446.1 266.1 444.6 267.1 443.2 268.1C425.2 280.5 403 288.5 384 288.5C364.4 288.5 343.2 280.8 324.8 268.1C302.8 252.6 273.3 252.6 251.2 268.1C234 279.9 213.2 288.5 192 288.5C172.1 288.5 150.8 280.5 132.9 268.1C131.3 267 129.7 265.1 128 265V192H112C98.14 192 85.86 183.1 81.57 169.9C77.28 156.7 81.97 142.3 93.18 134.1L269.2 6.12C280.4-2.04 295.6-2.04 306.8 6.12L482.8 134.1zM269.5 309.9C280.6 302 295.4 302 306.5 309.9C328.1 325.4 356.5 336 384 336C410.9 336 439.4 325.2 461.4 309.9L461.5 309.9C473.4 301.4 489.5 302.1 500.7 311.6C515 323.5 533.2 332.6 551.3 336.8C568.5 340.8 579.2 358.1 575.2 375.3C571.2 392.5 553.1 403.2 536.7 399.2C512.2 393.4 491.9 382.6 478.5 374.2C449.5 389.7 417 400 384 400C352.1 400 323.4 390.1 303.6 381.1C297.7 378.5 292.5 375.8 288 373.4C283.5 375.8 278.3 378.5 272.4 381.1C252.6 390.1 223.9 400 192 400C158.1 400 126.5 389.7 97.5 374.2C84.12 382.6 63.79 393.4 39.27 399.2C22.06 403.2 4.854 392.5 .8426 375.3C-3.169 358.1 7.532 340.8 24.74 336.8C42.84 332.6 60.96 323.5 75.31 311.6C86.46 302.1 102.6 301.4 114.5 309.9L114.6 309.9C136.7 325.2 165.1 336 192 336C219.5 336 247 325.4 269.5 309.9H269.5zM461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448C410.9 448 439.4 437.2 461.4 421.9H461.4z"],"house-flood-water-circle-arrow-right":[640,512,[],"e50f","M288 144C288 223.5 223.5 288 144 288C64.47 288 0 223.5 0 144C0 64.47 64.47 .0002 144 .0002C223.5 .0002 288 64.47 288 144zM140.7 99.31L169.4 128H80C71.16 128 64 135.2 64 144C64 152.8 71.16 160 80 160H169.4L140.7 188.7C134.4 194.9 134.4 205.1 140.7 211.3C146.9 217.6 157.1 217.6 163.3 211.3L219.3 155.3C225.6 149.1 225.6 138.9 219.3 132.7L163.3 76.69C157.1 70.44 146.9 70.44 140.7 76.69C134.4 82.94 134.4 93.07 140.7 99.31V99.31zM301 64.42L381.2 6.12C392.4-2.04 407.6-2.04 418.8 6.12L594.8 134.1C606 142.3 610.7 156.7 606.4 169.9C602.1 183.1 589.9 192 576 192H559.4L559.7 276.4C557.5 274.8 555.3 273.2 553.2 271.5C531 252.8 498.9 251.4 475.2 268.1C457.2 280.5 435 288.5 416 288.5C396.4 288.5 375.2 280.8 356.8 268.1C334.8 252.6 305.3 252.6 283.2 268.1C273.2 274.1 262 280.7 250.2 284.3C292.6 252.2 319.1 201.3 319.1 144C319.1 115.4 313.2 88.32 301 64.42V64.42zM416 336C442.9 336 471.4 325.2 493.4 309.9L493.5 309.9C505.4 301.4 521.5 302.1 532.7 311.6C547 323.5 565.2 332.6 583.3 336.8C600.5 340.8 611.2 358.1 607.2 375.3C603.2 392.5 585.1 403.2 568.7 399.2C544.2 393.4 523.9 382.6 510.5 374.2C481.5 389.7 449 400 416 400C384.1 400 355.4 390.1 335.6 381.1C329.7 378.5 324.5 375.8 320 373.4C315.5 375.8 310.3 378.5 304.4 381.1C284.6 390.1 255.9 400 224 400C190.1 400 158.5 389.7 129.5 374.2C116.1 382.6 95.79 393.4 71.27 399.2C54.06 403.2 36.85 392.5 32.84 375.3C28.83 358.1 39.53 340.8 56.74 336.8C74.84 332.6 92.96 323.5 107.3 311.6C118.5 302.1 134.6 301.4 146.5 309.9L146.6 309.9C168.7 325.2 197.1 336 224 336C251.5 336 279 325.4 301.5 309.9C312.6 302 327.4 302 338.5 309.9C360.1 325.4 388.5 336 416 336H416zM338.5 421.9C360.1 437.4 388.5 448 416 448C442.9 448 471.4 437.2 493.4 421.9L493.5 421.9C505.4 413.4 521.5 414.1 532.7 423.6C547 435.5 565.2 444.6 583.3 448.8C600.5 452.8 611.2 470.1 607.2 487.3C603.2 504.5 585.1 515.2 568.7 511.2C544.2 505.4 523.9 494.6 510.5 486.2C481.5 501.7 449 512 416 512C384.1 512 355.4 502.1 335.6 493.1C329.7 490.5 324.5 487.8 320 485.4C315.5 487.8 310.3 490.5 304.4 493.1C284.6 502.1 255.9 512 224 512C190.1 512 158.5 501.7 129.5 486.2C116.1 494.6 95.79 505.4 71.27 511.2C54.06 515.2 36.85 504.5 32.84 487.3C28.83 470.1 39.53 452.8 56.74 448.8C74.84 444.6 92.96 435.5 107.3 423.6C118.5 414.1 134.6 413.4 146.5 421.9L146.6 421.9C168.7 437.2 197.1 448 224 448C251.5 448 279 437.4 301.5 421.9C312.6 414 327.4 414 338.5 421.9H338.5z"],"house-laptop":[640,512,["laptop-house"],"e066","M218.3 8.486C230.6-2.829 249.4-2.829 261.7 8.486L469.7 200.5C476.4 206.7 480 215.2 480 224H336C316.9 224 299.7 232.4 288 245.7V208C288 199.2 280.8 192 272 192H208C199.2 192 192 199.2 192 208V272C192 280.8 199.2 288 208 288H271.1V416H112C85.49 416 64 394.5 64 368V256H32C18.83 256 6.996 247.9 2.198 235.7C-2.6 223.4 .6145 209.4 10.3 200.5L218.3 8.486zM336 256H560C577.7 256 592 270.3 592 288V448H624C632.8 448 640 455.2 640 464C640 490.5 618.5 512 592 512H303.1C277.5 512 255.1 490.5 255.1 464C255.1 455.2 263.2 448 271.1 448H303.1V288C303.1 270.3 318.3 256 336 256zM352 304V448H544V304H352z"],"house-lock":[640,512,[],"e510","M384 480C384 491.7 387.1 502.6 392.6 512H392C369.9 512 352 494.1 352 472V384C352 366.3 337.7 352 320 352H256C238.3 352 224 366.3 224 384V472C224 494.1 206.1 512 184 512H128.1C126.6 512 125.1 511.9 123.6 511.8C122.4 511.9 121.2 512 120 512H104C81.91 512 64 494.1 64 472V360C64 359.1 64.03 358.1 64.09 357.2V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L490.7 166.3C447.2 181.7 416 223.2 416 272V296.6C396.9 307.6 384 328.3 384 352L384 480zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"house-medical":[576,512,[],"e3b2","M575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8L512.5 447.7C512.6 483.2 483.9 512 448.5 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5H575.8zM328 232V176C328 167.2 320.8 160 312 160H264C255.2 160 248 167.2 248 176V232H192C183.2 232 176 239.2 176 248V296C176 304.8 183.2 312 192 312H248V368C248 376.8 255.2 384 264 384H312C320.8 384 328 376.8 328 368V312H384C392.8 312 400 304.8 400 296V248C400 239.2 392.8 232 384 232H328z"],"house-medical-circle-check":[640,512,[],"e511","M320.5 381.5C324.6 435.5 353 482.6 394.8 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C453.6 192 414.7 207 384.3 232L384 232H328V176C328 167.2 320.8 160 311.1 160H263.1C255.2 160 247.1 167.2 247.1 176V232H191.1C183.2 232 175.1 239.2 175.1 248V296C175.1 304.8 183.2 312 191.1 312H247.1V368C247.1 376.8 255.2 384 263.1 384H311.1C315.1 384 318 383.1 320.5 381.5H320.5zM328 312H329.1C328.7 313.1 328.4 314.3 328 315.4V312zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"house-medical-circle-exclamation":[640,512,[],"e512","M320.5 381.5C324.6 435.5 353 482.6 394.8 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C453.6 192 414.7 207 384.3 232L384 232H328V176C328 167.2 320.8 160 311.1 160H263.1C255.2 160 247.1 167.2 247.1 176V232H191.1C183.2 232 175.1 239.2 175.1 248V296C175.1 304.8 183.2 312 191.1 312H247.1V368C247.1 376.8 255.2 384 263.1 384H311.1C315.1 384 318 383.1 320.5 381.5H320.5zM328 312H329.1C328.7 313.1 328.4 314.3 328 315.4V312zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"house-medical-circle-xmark":[640,512,[],"e513","M320.5 381.5C324.6 435.5 353 482.6 394.8 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L522.1 193.9C513.6 192.7 504.9 192 496 192C453.6 192 414.7 207 384.3 232L384 232H328V176C328 167.2 320.8 160 311.1 160H263.1C255.2 160 247.1 167.2 247.1 176V232H191.1C183.2 232 175.1 239.2 175.1 248V296C175.1 304.8 183.2 312 191.1 312H247.1V368C247.1 376.8 255.2 384 263.1 384H311.1C315.1 384 318 383.1 320.5 381.5H320.5zM328 312H329.1C328.7 313.1 328.4 314.3 328 315.4V312zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"house-medical-flag":[640,512,[],"e514","M480 0C497.7 0 512 14.33 512 32H624C632.8 32 640 39.16 640 48V176C640 184.8 632.8 192 624 192H512V512H448V32C448 14.33 462.3 0 480 0V0zM416 512H416.1L416.8 512H96C78.33 512 64 497.7 64 480V288H31.1C18.61 288 6.631 279.7 1.985 267.1C-2.661 254.5 1.005 240.4 11.17 231.7L235.2 39.7C247.2 29.43 264.8 29.43 276.8 39.7L416 159V512zM223.1 256H175.1C167.2 256 159.1 263.2 159.1 272V304C159.1 312.8 167.2 320 175.1 320H223.1V368C223.1 376.8 231.2 384 239.1 384H271.1C280.8 384 287.1 376.8 287.1 368V320H336C344.8 320 352 312.8 352 304V272C352 263.2 344.8 256 336 256H287.1V208C287.1 199.2 280.8 192 271.1 192H239.1C231.2 192 223.1 199.2 223.1 208V256z"],"house-signal":[576,512,[],"e012","M314.3 8.486C326.6-2.829 345.4-2.829 357.7 8.486L565.7 200.5C575.4 209.4 578.6 223.4 573.8 235.7C569 247.9 557.2 256 544 256H512V368C512 394.5 490.5 416 464 416H296.4C272.7 317.5 195.4 239.1 97.06 215.8C98.58 210.1 101.7 204.7 106.3 200.5L314.3 8.486zM304 192C295.2 192 287.1 199.2 287.1 208V272C287.1 280.8 295.2 288 304 288H368C376.8 288 384 280.8 384 272V208C384 199.2 376.8 192 368 192H304zM256 488C256 501.3 245.3 512 232 512C218.7 512 208 501.3 208 488C208 386.4 125.6 304 24 304C10.75 304 0 293.3 0 280C0 266.7 10.75 256 24 256C152.1 256 256 359.9 256 488zM0 480C0 462.3 14.33 448 32 448C49.67 448 64 462.3 64 480C64 497.7 49.67 512 32 512C14.33 512 0 497.7 0 480zM0 376C0 362.7 10.75 352 24 352C99.11 352 160 412.9 160 488C160 501.3 149.3 512 136 512C122.7 512 112 501.3 112 488C112 439.4 72.6 400 24 400C10.75 400 0 389.3 0 376z"],"house-tsunami":[576,512,[],"e515","M184.4 96C207.4 96 229.3 101.1 248.1 110.3C264.1 117.7 271.9 136.8 264.4 152.8C256.1 168.8 237.9 175.7 221.9 168.3C210.6 162.1 197.9 160 184.4 160C135.5 160 95.1 199.5 95.1 248C95.1 287 121.6 320.2 157.1 331.7C167.1 334.5 179.6 336 191.1 336C192 336 192.1 336 192.1 336C219.6 335.1 247.1 325.4 269.5 309.9C280.6 302 295.4 302 306.5 309.9C328.1 325.4 356.5 336 384 336C410.9 336 439.4 325.2 461.4 309.9L461.5 309.9C473.4 301.4 489.5 302.1 500.7 311.6C515 323.5 533.2 332.6 551.3 336.8C568.5 340.8 579.2 358.1 575.2 375.3C571.2 392.5 553.1 403.2 536.7 399.2C512.2 393.4 491.9 382.6 478.5 374.2C449.5 389.7 417 400 384 400C352.1 400 323.4 390.1 303.6 381.1C297.7 378.5 292.5 375.8 288 373.4C283.5 375.8 278.3 378.5 272.4 381.1C252.6 390.1 223.9 400 192 400C190.2 400 188.3 399.1 186.5 399.9C185.8 399.1 185.1 400 184.4 400C169.8 400 155.6 397.9 142.2 394.1C53.52 372.1 .0006 291.6 .0006 200C.0006 87.99 95.18 0 209 0C232.8 0 255.8 3.823 277.2 10.9C294 16.44 303.1 34.54 297.6 51.32C292 68.1 273.9 77.21 257.2 71.67C242.2 66.72 225.1 64 209 64C152.6 64 104.9 93.82 80.81 136.5C108 111.4 144.4 96 184.4 96H184.4zM428.8 46.43C440.2 37.88 455.8 37.9 467.2 46.47L562.7 118.4C570.7 124.5 575.4 133.9 575.5 143.9L575.8 287.9C575.8 290.8 575.4 293.6 574.7 296.3C569.8 293.6 564.3 291.5 558.5 290.1C545.4 287.1 531.8 280.3 521.2 271.5C499 252.8 466.9 251.4 443.2 268.1C425.2 280.5 403 288.5 384 288.5C364.4 288.5 343.2 280.8 324.8 268.1C323.3 267 321.6 265.1 320 265V143.1C320 133.9 324.7 124.4 332.8 118.4L428.8 46.43zM461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448C410.9 448 439.4 437.2 461.4 421.9H461.4z"],"house-user":[576,512,["home-user"],"e1b0","M575.8 255.5C575.8 273.5 560.8 287.6 543.8 287.6H511.8L512.5 447.7C512.6 483.2 483.9 512 448.5 512H128.1C92.75 512 64.09 483.3 64.09 448V287.6H32.05C14.02 287.6 0 273.5 0 255.5C0 246.5 3.004 238.5 10.01 231.5L266.4 8.016C273.4 1.002 281.4 0 288.4 0C295.4 0 303.4 2.004 309.5 7.014L564.8 231.5C572.8 238.5 576.9 246.5 575.8 255.5H575.8zM288 160C252.7 160 224 188.7 224 224C224 259.3 252.7 288 288 288C323.3 288 352 259.3 352 224C352 188.7 323.3 160 288 160zM256 320C211.8 320 176 355.8 176 400C176 408.8 183.2 416 192 416H384C392.8 416 400 408.8 400 400C400 355.8 364.2 320 320 320H256z"],"hryvnia-sign":[384,512,[8372,"hryvnia"],"f6f2","M115.1 120.1C102.2 132 82.05 129.8 71.01 115.1C59.97 102.2 62.21 82.05 76.01 71.01L81.94 66.27C109.7 44.08 144.1 32 179.6 32H223C285.4 32 336 82.59 336 144.1C336 155.6 334.5 166.1 331.7 176H352C369.7 176 384 190.3 384 208C384 225.7 369.7 240 352 240H284.2C282.5 241.1 280.8 242.1 279.1 243.1L228.5 272H352C369.7 272 384 286.3 384 304C384 321.7 369.7 336 352 336H123.1C116 344.6 112 355.5 112 367C112 394.1 133.9 416 160.1 416H204.4C225.3 416 245.7 408.9 262.1 395.8L268 391C281.8 379.1 301.9 382.2 312.1 396C324 409.8 321.8 429.9 307.1 440.1L302.1 445.7C274.3 467.9 239.9 480 204.4 480H160.1C98.59 480 48 429.4 48 367C48 356.4 49.49 345.9 52.33 336H32C14.33 336 0 321.7 0 304C0 286.3 14.33 272 32 272H99.82C101.5 270.9 103.2 269.9 104.9 268.9L155.5 240H32C14.33 240 0 225.7 0 208C0 190.3 14.33 176 32 176H260.9C267.1 167.4 272 156.5 272 144.1C272 117.9 250.1 96 223 96H179.6C158.7 96 138.3 103.1 121.9 116.2L115.1 120.1z"],hurricane:[448,512,[],"f751","M224 223.1c-17.75 0-32 14.25-32 32c0 17.75 14.25 32 32 32s32-14.25 32-32C256 238.2 241.8 223.1 224 223.1zM208 95.98l24.5-74.74c3.75-11.25-5.615-22.49-17.36-21.11C112 12.38 32 101.6 32 208c0 114.9 93.13 208 208 208l-24.5 74.73c-3.75 11.25 5.615 22.5 17.36 21.12C335.1 499.6 416 410.4 416 304C416 189.1 322.9 95.98 208 95.98zM224 351.1c-53 0-96-43-96-96s43-96 96-96s96 43 96 96S277 351.1 224 351.1z"],i:[320,512,[105],"49","M320 448c0 17.67-14.31 32-32 32H32c-17.69 0-32-14.33-32-32s14.31-32 32-32h96v-320H32c-17.69 0-32-14.33-32-32s14.31-32 32-32h256c17.69 0 32 14.33 32 32s-14.31 32-32 32h-96v320h96C305.7 416 320 430.3 320 448z"],"i-cursor":[256,512,[],"f246","M256 480c0 17.69-14.33 31.1-32 31.1c-38.41 0-72.52-17.35-96-44.23c-23.48 26.88-57.59 44.23-96 44.23c-17.67 0-32-14.31-32-31.1s14.33-32 32-32c35.3 0 64-28.72 64-64V288H64C46.33 288 32 273.7 32 256s14.33-32 32-32h32V128c0-35.28-28.7-64-64-64C14.33 64 0 49.69 0 32s14.33-32 32-32c38.41 0 72.52 17.35 96 44.23c23.48-26.88 57.59-44.23 96-44.23c17.67 0 32 14.31 32 32s-14.33 32-32 32c-35.3 0-64 28.72-64 64v96h32c17.67 0 32 14.31 32 32s-14.33 32-32 32h-32v96c0 35.28 28.7 64 64 64C241.7 448 256 462.3 256 480z"],"ice-cream":[448,512,[127848],"f810","M96.06 288.3H351.9L252.6 493.8C250.1 499.2 246 503.8 240.1 507.1C235.9 510.3 230 512 224 512C217.1 512 212.1 510.3 207 507.1C201.1 503.8 197.9 499.2 195.4 493.8L96.06 288.3zM386.3 164C392.1 166.4 397.4 169.9 401.9 174.4C406.3 178.8 409.9 184.1 412.3 189.9C414.7 195.7 415.1 201.1 416 208.3C416 214.5 414.8 220.8 412.4 226.6C409.1 232.4 406.5 237.7 402 242.2C397.6 246.6 392.3 250.2 386.5 252.6C380.7 255 374.4 256.3 368.1 256.3H79.88C67.16 256.3 54.96 251.2 45.98 242.2C37 233.2 31.97 220.1 32 208.3C32.03 195.5 37.1 183.4 46.12 174.4C55.14 165.4 67.35 160.4 80.07 160.4H81.06C80.4 154.9 80.06 149.4 80.04 143.8C80.04 105.7 95.2 69.11 122.2 42.13C149.2 15.15 185.8 0 223.1 0C262.1 0 298.7 15.15 325.7 42.13C352.7 69.11 367.9 105.7 367.9 143.8C367.9 149.4 367.6 154.9 366.9 160.4H367.9C374.2 160.4 380.5 161.6 386.3 164z"],icicles:[512,512,[],"f7ad","M511.4 37.87l-87.54 467.6c-1.625 8.623-14.04 8.634-15.67 .0104L341.4 141.7L295.7 314.2c-2.375 7.624-12.98 7.624-15.36 0L246.3 180.9l-46.49 196.9c-1.875 8.373-13.64 8.373-15.51 0L139.1 190.5L103.6 314.5c-2.375 7.124-12.64 7.198-15.14 .0744L1.357 41.24C-4.768 20.75 10.61 0 31.98 0h448C500 0 515.2 18.25 511.4 37.87z"],icons:[512,512,["heart-music-camera-bolt"],"f86d","M500.3 7.251C507.7 13.33 512 22.41 512 31.1V175.1C512 202.5 483.3 223.1 447.1 223.1C412.7 223.1 383.1 202.5 383.1 175.1C383.1 149.5 412.7 127.1 447.1 127.1V71.03L351.1 90.23V207.1C351.1 234.5 323.3 255.1 287.1 255.1C252.7 255.1 223.1 234.5 223.1 207.1C223.1 181.5 252.7 159.1 287.1 159.1V63.1C287.1 48.74 298.8 35.61 313.7 32.62L473.7 .6198C483.1-1.261 492.9 1.173 500.3 7.251H500.3zM74.66 303.1L86.5 286.2C92.43 277.3 102.4 271.1 113.1 271.1H174.9C185.6 271.1 195.6 277.3 201.5 286.2L213.3 303.1H239.1C266.5 303.1 287.1 325.5 287.1 351.1V463.1C287.1 490.5 266.5 511.1 239.1 511.1H47.1C21.49 511.1-.0019 490.5-.0019 463.1V351.1C-.0019 325.5 21.49 303.1 47.1 303.1H74.66zM143.1 359.1C117.5 359.1 95.1 381.5 95.1 407.1C95.1 434.5 117.5 455.1 143.1 455.1C170.5 455.1 191.1 434.5 191.1 407.1C191.1 381.5 170.5 359.1 143.1 359.1zM440.3 367.1H496C502.7 367.1 508.6 372.1 510.1 378.4C513.3 384.6 511.6 391.7 506.5 396L378.5 508C372.9 512.1 364.6 513.3 358.6 508.9C352.6 504.6 350.3 496.6 353.3 489.7L391.7 399.1H336C329.3 399.1 323.4 395.9 321 389.6C318.7 383.4 320.4 376.3 325.5 371.1L453.5 259.1C459.1 255 467.4 254.7 473.4 259.1C479.4 263.4 481.6 271.4 478.7 278.3L440.3 367.1zM116.7 219.1L19.85 119.2C-8.112 90.26-6.614 42.31 24.85 15.34C51.82-8.137 93.26-3.642 118.2 21.83L128.2 32.32L137.7 21.83C162.7-3.642 203.6-8.137 231.6 15.34C262.6 42.31 264.1 90.26 236.1 119.2L139.7 219.1C133.2 225.6 122.7 225.6 116.7 219.1H116.7z"],"id-badge":[384,512,[],"f2c1","M336 0h-288C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48v-416C384 21.49 362.5 0 336 0zM192 160c35.35 0 64 28.65 64 64s-28.65 64-64 64S128 259.3 128 224S156.7 160 192 160zM288 416H96c-8.836 0-16-7.164-16-16C80 355.8 115.8 320 160 320h64c44.18 0 80 35.82 80 80C304 408.8 296.8 416 288 416zM240 96h-96C135.2 96 128 88.84 128 80S135.2 64 144 64h96C248.8 64 256 71.16 256 80S248.8 96 240 96z"],"id-card":[576,512,[62147,"drivers-license"],"f2c2","M528 32h-480C21.49 32 0 53.49 0 80V96h576V80C576 53.49 554.5 32 528 32zM0 432C0 458.5 21.49 480 48 480h480c26.51 0 48-21.49 48-48V128H0V432zM368 192h128C504.8 192 512 199.2 512 208S504.8 224 496 224h-128C359.2 224 352 216.8 352 208S359.2 192 368 192zM368 256h128C504.8 256 512 263.2 512 272S504.8 288 496 288h-128C359.2 288 352 280.8 352 272S359.2 256 368 256zM368 320h128c8.836 0 16 7.164 16 16S504.8 352 496 352h-128c-8.836 0-16-7.164-16-16S359.2 320 368 320zM176 192c35.35 0 64 28.66 64 64s-28.65 64-64 64s-64-28.66-64-64S140.7 192 176 192zM112 352h128c26.51 0 48 21.49 48 48c0 8.836-7.164 16-16 16h-192C71.16 416 64 408.8 64 400C64 373.5 85.49 352 112 352z"],"id-card-clip":[576,512,["id-card-alt"],"f47f","M256 128h64c17.67 0 32-14.33 32-32V32c0-17.67-14.33-32-32-32H256C238.3 0 224 14.33 224 32v64C224 113.7 238.3 128 256 128zM528 64H384v48C384 138.5 362.5 160 336 160h-96C213.5 160 192 138.5 192 112V64H48C21.49 64 0 85.49 0 112v352C0 490.5 21.49 512 48 512h480c26.51 0 48-21.49 48-48v-352C576 85.49 554.5 64 528 64zM288 224c35.35 0 64 28.66 64 64s-28.65 64-64 64s-64-28.66-64-64S252.7 224 288 224zM384 448H192c-8.836 0-16-7.164-16-16C176 405.5 197.5 384 224 384h128c26.51 0 48 21.49 48 48C400 440.8 392.8 448 384 448z"],igloo:[576,512,[],"f7ae","M320 160H48.5C100.2 82.82 188.1 32 288 32C298.8 32 309.5 32.6 320 33.76V160zM352 39.14C424.9 55.67 487.2 99.82 527.5 160H352V39.14zM96 192V320H0C0 274 10.77 230.6 29.94 192H96zM192 320H128V192H448V320H384V352H576V432C576 458.5 554.5 480 528 480H352V352C352 316.7 323.3 288 288 288C252.7 288 224 316.7 224 352V480H48C21.49 480 0 458.5 0 432V352H192V320zM480 192H546.1C565.2 230.6 576 274 576 320H480V192z"],image:[512,512,[],"f03e","M447.1 32h-384C28.64 32-.0091 60.65-.0091 96v320c0 35.35 28.65 64 63.1 64h384c35.35 0 64-28.65 64-64V96C511.1 60.65 483.3 32 447.1 32zM111.1 96c26.51 0 48 21.49 48 48S138.5 192 111.1 192s-48-21.49-48-48S85.48 96 111.1 96zM446.1 407.6C443.3 412.8 437.9 416 432 416H82.01c-6.021 0-11.53-3.379-14.26-8.75c-2.73-5.367-2.215-11.81 1.334-16.68l70-96C142.1 290.4 146.9 288 152 288s9.916 2.441 12.93 6.574l32.46 44.51l93.3-139.1C293.7 194.7 298.7 192 304 192s10.35 2.672 13.31 7.125l128 192C448.6 396 448.9 402.3 446.1 407.6z"],"image-portrait":[384,512,["portrait"],"f3e0","M336 0h-288c-26.51 0-48 21.49-48 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48v-416C384 21.49 362.5 0 336 0zM192 128c35.35 0 64 28.65 64 64s-28.65 64-64 64S128 227.3 128 192S156.7 128 192 128zM288 384H96c-8.836 0-16-7.164-16-16C80 323.8 115.8 288 160 288h64c44.18 0 80 35.82 80 80C304 376.8 296.8 384 288 384z"],images:[576,512,[],"f302","M528 32H144c-26.51 0-48 21.49-48 48v256c0 26.51 21.49 48 48 48H528c26.51 0 48-21.49 48-48v-256C576 53.49 554.5 32 528 32zM223.1 96c17.68 0 32 14.33 32 32S241.7 160 223.1 160c-17.67 0-32-14.33-32-32S206.3 96 223.1 96zM494.1 311.6C491.3 316.8 485.9 320 480 320H192c-6.023 0-11.53-3.379-14.26-8.75c-2.73-5.367-2.215-11.81 1.332-16.68l70-96C252.1 194.4 256.9 192 262 192c5.111 0 9.916 2.441 12.93 6.574l22.35 30.66l62.74-94.11C362.1 130.7 367.1 128 373.3 128c5.348 0 10.34 2.672 13.31 7.125l106.7 160C496.6 300 496.9 306.3 494.1 311.6zM456 432H120c-39.7 0-72-32.3-72-72v-240C48 106.8 37.25 96 24 96S0 106.8 0 120v240C0 426.2 53.83 480 120 480h336c13.25 0 24-10.75 24-24S469.3 432 456 432z"],inbox:[512,512,[],"f01c","M447 56.25C443.5 42 430.7 31.1 416 31.1H96c-14.69 0-27.47 10-31.03 24.25L3.715 304.9C1.247 314.9 0 325.2 0 335.5v96.47c0 26.51 21.49 48 48 48h416c26.51 0 48-21.49 48-48v-96.47c0-10.32-1.247-20.6-3.715-30.61L447 56.25zM352 352H160L128 288H72.97L121 96h270l48.03 192H384L352 352z"],indent:[448,512,[],"f03c","M0 64C0 46.33 14.33 32 32 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H32C14.33 96 0 81.67 0 64zM192 192C192 174.3 206.3 160 224 160H416C433.7 160 448 174.3 448 192C448 209.7 433.7 224 416 224H224C206.3 224 192 209.7 192 192zM416 288C433.7 288 448 302.3 448 320C448 337.7 433.7 352 416 352H224C206.3 352 192 337.7 192 320C192 302.3 206.3 288 224 288H416zM0 448C0 430.3 14.33 416 32 416H416C433.7 416 448 430.3 448 448C448 465.7 433.7 480 416 480H32C14.33 480 0 465.7 0 448zM25.82 347.9C15.31 356.1 0 348.6 0 335.3V176.7C0 163.4 15.31 155.9 25.82 164.1L127.8 243.4C135.1 249.8 135.1 262.2 127.8 268.6L25.82 347.9z"],"indian-rupee-sign":[320,512,["indian-rupee","inr"],"e1bc","M.0022 64C.0022 46.33 14.33 32 32 32H288C305.7 32 320 46.33 320 64C320 81.67 305.7 96 288 96H231.8C241.4 110.4 248.5 126.6 252.4 144H288C305.7 144 320 158.3 320 176C320 193.7 305.7 208 288 208H252.4C239.2 266.3 190.5 311.2 130.3 318.9L274.6 421.1C288.1 432.2 292.3 452.2 282 466.6C271.8 480.1 251.8 484.3 237.4 474L13.4 314C2.083 305.1-2.716 291.5 1.529 278.2C5.774 264.1 18.09 256 32 256H112C144.8 256 173 236.3 185.3 208H32C14.33 208 .0022 193.7 .0022 176C.0022 158.3 14.33 144 32 144H185.3C173 115.7 144.8 96 112 96H32C14.33 96 .0022 81.67 .0022 64V64z"],industry:[576,512,[],"f275","M128 32C145.7 32 160 46.33 160 64V215.4L316.6 131C332.6 122.4 352 134 352 152.2V215.4L508.6 131C524.6 122.4 544 134 544 152.2V432C544 458.5 522.5 480 496 480H80C53.49 480 32 458.5 32 432V64C32 46.33 46.33 32 64 32H128z"],infinity:[640,512,[9854,8734],"f534","M494.9 96.01c-38.78 0-75.22 15.09-102.6 42.5L320 210.8L247.8 138.5c-27.41-27.41-63.84-42.5-102.6-42.5C65.11 96.01 0 161.1 0 241.1v29.75c0 80.03 65.11 145.1 145.1 145.1c38.78 0 75.22-15.09 102.6-42.5L320 301.3l72.23 72.25c27.41 27.41 63.84 42.5 102.6 42.5C574.9 416 640 350.9 640 270.9v-29.75C640 161.1 574.9 96.01 494.9 96.01zM202.5 328.3c-15.31 15.31-35.69 23.75-57.38 23.75C100.4 352 64 315.6 64 270.9v-29.75c0-44.72 36.41-81.13 81.14-81.13c21.69 0 42.06 8.438 57.38 23.75l72.23 72.25L202.5 328.3zM576 270.9c0 44.72-36.41 81.13-81.14 81.13c-21.69 0-42.06-8.438-57.38-23.75l-72.23-72.25l72.23-72.25c15.31-15.31 35.69-23.75 57.38-23.75C539.6 160 576 196.4 576 241.1V270.9z"],info:[192,512,[],"f129","M160 448h-32V224c0-17.69-14.33-32-32-32L32 192c-17.67 0-32 14.31-32 32s14.33 31.1 32 31.1h32v192H32c-17.67 0-32 14.31-32 32s14.33 32 32 32h128c17.67 0 32-14.31 32-32S177.7 448 160 448zM96 128c26.51 0 48-21.49 48-48S122.5 32.01 96 32.01s-48 21.49-48 48S69.49 128 96 128z"],italic:[384,512,[],"f033","M384 64.01c0 17.69-14.31 32-32 32h-58.67l-133.3 320H224c17.69 0 32 14.31 32 32s-14.31 32-32 32H32c-17.69 0-32-14.31-32-32s14.31-32 32-32h58.67l133.3-320H160c-17.69 0-32-14.31-32-32s14.31-32 32-32h192C369.7 32.01 384 46.33 384 64.01z"],j:[320,512,[106],"4a","M320 64.01v259.4c0 86.36-71.78 156.6-160 156.6s-160-70.26-160-156.6V288c0-17.67 14.31-32 32-32s32 14.33 32 32v35.38c0 51.08 43.06 92.63 96 92.63s96-41.55 96-92.63V64.01c0-17.67 14.31-32 32-32S320 46.34 320 64.01z"],jar:[320,512,[],"e516","M32 32C32 14.33 46.33 0 64 0H256C273.7 0 288 14.33 288 32C288 49.67 273.7 64 256 64H64C46.33 64 32 49.67 32 32zM0 160C0 124.7 28.65 96 64 96H256C291.3 96 320 124.7 320 160V448C320 483.3 291.3 512 256 512H64C28.65 512 0 483.3 0 448V160zM256 224H64V384H256V224z"],"jar-wheat":[320,512,[],"e517","M32 32C32 14.33 46.33 0 64 0H256C273.7 0 288 14.33 288 32C288 49.67 273.7 64 256 64H64C46.33 64 32 49.67 32 32zM0 160C0 124.7 28.65 96 64 96H256C291.3 96 320 124.7 320 160V448C320 483.3 291.3 512 256 512H64C28.65 512 0 483.3 0 448V160zM192 320C227.3 320 256 291.3 256 256H208C188.9 256 171.7 264.4 160 277.7C148.3 264.4 131.1 256 112 256H64C64 291.3 92.65 320 128 320H192zM192 224C227.3 224 256 195.3 256 160H208C188.9 160 171.7 168.4 160 181.7C148.3 168.4 131.1 160 112 160H64C64 195.3 92.65 224 128 224H192zM192 416C227.3 416 256 387.3 256 352H208C188.9 352 171.7 360.4 160 373.7C148.3 360.4 131.1 352 112 352H64C64 387.3 92.65 416 128 416H144V448C144 456.8 151.2 464 160 464C168.8 464 176 456.8 176 448V416H192z"],jedi:[576,512,[],"f669","M554.9 293.1l-58.88 58.88h40C493.2 446.1 398.2 511.1 287.1 512c-110.3-.0078-205.2-65.88-247.1-160h40L21.13 293.1C17.75 275.1 16 258.6 16 241.2c0-5.75 .75-11.5 1-17.25h47L22.75 182.7C37.38 117.1 75.86 59.37 130.6 20.5c2.75-2 6.021-3.005 9.272-3.005c5.5 0 10.5 2.75 13.5 7.25c3.125 4.375 3.625 10.13 1.625 15.13C148.5 56.12 145.1 73.62 145.1 91.12c0 45.13 21.13 86.63 57.75 113.8C206.9 207.7 209.4 212.4 209.5 217.2c.25 5-1.751 9.752-5.501 13c-32.75 29.38-47.5 74-38.5 117.1c9.751 48.38 48.88 87.13 97.26 96.5l2.5-65.37l-27.13 18.5c-3.125 2-7.251 1.75-10-.75c-2.75-2.625-3.25-6.75-1.375-10l20.13-33.75l-42.13-8.627c-3.625-.875-6.375-4.125-6.375-7.875s2.75-7 6.375-7.875l42.13-8.75L226.8 285.6C224.9 282.5 225.4 278.4 228.1 275.7c2.75-2.5 6.876-2.875 10-.75l30.38 20.63l11.49-287.8C280.3 3.461 283.7 .0156 287.1 0c4.237 .0156 7.759 3.461 8.009 7.828l11.49 287.8l30.38-20.63c3.125-2.125 7.251-1.75 10 .75c2.75 2.625 3.25 6.75 1.375 9.875l-20.13 33.75l42.13 8.75c3.625 .875 6.375 4.125 6.375 7.875s-2.75 7-6.375 7.875l-42.13 8.627l20.13 33.75c1.875 3.25 1.375 7.375-1.375 10c-2.75 2.5-6.876 2.75-10 .75l-27.13-18.5l2.5 65.37c48.38-9.375 87.51-48.13 97.26-96.5c9.001-43.13-5.75-87.75-38.5-117.1c-3.75-3.25-5.751-8.002-5.501-13c.125-4.875 2.626-9.5 6.626-12.38c36.63-27.13 57.75-68.63 57.75-113.8c0-17.5-3.375-35-9.875-51.25c-2-5-1.5-10.75 1.625-15.13c3-4.5 8.001-7.25 13.5-7.25c3.25 0 6.474 .9546 9.224 2.955c54.75 38.88 93.28 96.67 107.9 162.3l-41.25 41.25h47c.2501 5.75 .9965 11.5 .9965 17.25C559.1 258.6 558.3 275.1 554.9 293.1z"],"jet-fighter":[640,512,["fighter-jet"],"f0fb","M160 24C160 10.75 170.7 0 184 0H296C309.3 0 320 10.75 320 24C320 37.25 309.3 48 296 48H280L384 192H500.4C508.1 192 515.7 193.4 522.9 196.1L625 234.4C634 237.8 640 246.4 640 256C640 265.6 634 274.2 625 277.6L522.9 315.9C515.7 318.6 508.1 320 500.4 320H384L280 464H296C309.3 464 320 474.7 320 488C320 501.3 309.3 512 296 512H184C170.7 512 160 501.3 160 488C160 474.7 170.7 464 184 464H192V320H160L105.4 374.6C99.37 380.6 91.23 384 82.75 384H64C46.33 384 32 369.7 32 352V288C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224V160C32 142.3 46.33 128 64 128H82.75C91.23 128 99.37 131.4 105.4 137.4L160 192H192V48H184C170.7 48 160 37.25 160 24V24zM80 240C71.16 240 64 247.2 64 256C64 264.8 71.16 272 80 272H144C152.8 272 160 264.8 160 256C160 247.2 152.8 240 144 240H80z"],"jet-fighter-up":[576,512,[],"e518","M346.8 112.6C350.2 120.6 352 129.2 352 137.9V214.8L496 298.8V280C496 266.7 506.7 256 520 256C533.3 256 544 266.7 544 280V392C544 405.3 533.3 416 520 416C506.7 416 496 405.3 496 392V384H352V416.7L410.5 467.1C414 470.1 416 475.4 416 480V496C416 504.8 408.8 512 400 512H304V448C304 439.2 296.8 432 288 432C279.2 432 272 439.2 272 448V512H176C167.2 512 160 504.8 160 496V480C160 475.4 161.1 470.1 165.5 467.1L224 416.7V384H80V392C80 405.3 69.25 416 56 416C42.75 416 32 405.3 32 392V280C32 266.7 42.75 256 56 256C69.25 256 80 266.7 80 280V298.8L224 214.8V137.9C224 129.2 225.8 120.6 229.2 112.6L273.3 9.697C275.8 3.814 281.6 0 288 0C294.4 0 300.2 3.814 302.7 9.697L346.8 112.6z"],joint:[640,512,[],"f595","M444.4 181.1C466.8 196.8 480 222.2 480 249.8V280C480 284.4 483.6 288 488 288h48C540.4 288 544 284.4 544 280V249.8c0-43.25-21-83.5-56.38-108.1C463.9 125 448 99.38 448 70.25V8C448 3.625 444.4 0 440 0h-48C387.6 0 384 3.625 384 8v66.38C384 118.1 408.5 156 444.4 181.1zM195 359C125.1 370.1 59.75 394.8 0 432C83.62 484.2 180.2 512 279 512h88.5l-112.7-131.5C240 363.2 217.4 355.4 195 359zM553.3 87.12C547.6 83.25 544 77.12 544 70.25V8C544 3.625 540.4 0 536 0h-48C483.6 0 480 3.625 480 8v62.25c0 22.13 10.12 43.5 28.62 55.5C550.8 153 576 199.5 576 249.8V280C576 284.4 579.6 288 584 288h48C636.4 288 640 284.4 640 280V249.8C640 184.2 607.6 123.5 553.3 87.12zM360.9 352c-34.38 .125-86.75 .25-88.25 .25l117.9 137.4C402.6 503.9 420.4 512 439.1 512h88.38l-117.9-137.6C397.4 360.1 379.6 352 360.9 352zM616 352H432l117.1 137.6C562.1 503.9 579.9 512 598.6 512H616c13.25 0 24-10.75 24-24v-112C640 362.8 629.3 352 616 352z"],"jug-detergent":[384,512,[],"e519","M96 24C96 10.75 106.7 0 120 0H200C213.3 0 224 10.75 224 24V48H232C245.3 48 256 58.75 256 72C256 85.25 245.3 96 232 96H88C74.75 96 64 85.25 64 72C64 58.75 74.75 48 88 48H96V24zM0 256C0 185.3 57.31 128 128 128H256C326.7 128 384 185.3 384 256V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V256zM256 352C256 369.7 270.3 384 288 384C305.7 384 320 369.7 320 352V256C320 238.3 305.7 224 288 224C270.3 224 256 238.3 256 256V352z"],k:[320,512,[107],"4b","M314.3 429.8c10.06 14.53 6.438 34.47-8.094 44.53c-5.562 3.844-11.91 5.688-18.19 5.688c-10.16 0-20.12-4.812-26.34-13.78L128.1 273.3L64 338.9v109.1c0 17.67-14.31 32-32 32s-32-14.33-32-32v-384C0 46.34 14.31 32.01 32 32.01S64 46.34 64 64.01v183.3l201.1-205.7c12.31-12.61 32.63-12.86 45.25-.5c12.62 12.34 12.88 32.61 .5 45.25l-137.2 140.3L314.3 429.8z"],kaaba:[576,512,[128331],"f66b","M278.5 1.457C284.7-.4856 291.3-.4856 297.5 1.457L553.5 81.46C566.9 85.63 576 98 576 112V149.2L292.8 237.7C289.7 238.7 286.3 238.7 283.2 237.7L.0006 149.2V112C.0006 98.01 9.097 85.63 22.46 81.46L278.5 1.457zM288 191.2L515.1 120L288 48.76L60.04 120L288 191.2zM302.3 268.3L576 182.8V229.2L523.2 245.7C514.8 248.4 510.1 257.3 512.7 265.8C515.4 274.2 524.3 278.9 532.8 276.3L576 262.8V400C576 413.1 566.9 426.4 553.5 430.5L297.5 510.5C291.3 512.5 284.7 512.5 278.5 510.5L22.46 430.5C9.096 426.4 0 413.1 0 399.1V262.8L43.23 276.3C51.67 278.9 60.64 274.2 63.28 265.8C65.91 257.3 61.21 248.4 52.78 245.7L0 229.2V182.8L273.7 268.3C283 271.2 292.1 271.2 302.3 268.3L302.3 268.3zM116.8 265.7C108.3 263.1 99.37 267.8 96.73 276.2C94.1 284.7 98.8 293.6 107.2 296.3L171.2 316.3C179.7 318.9 188.6 314.2 191.3 305.8C193.9 297.3 189.2 288.4 180.8 285.7L116.8 265.7zM468.8 296.3C477.2 293.6 481.9 284.7 479.3 276.2C476.6 267.8 467.7 263.1 459.2 265.7L395.2 285.7C386.8 288.4 382.1 297.3 384.7 305.8C387.4 314.2 396.3 318.9 404.8 316.3L468.8 296.3zM244.8 305.7C236.3 303.1 227.4 307.8 224.7 316.2C222.1 324.7 226.8 333.6 235.2 336.3L273.7 348.3C283 351.2 292.1 351.2 302.3 348.3L340.8 336.3C349.2 333.6 353.9 324.7 351.3 316.2C348.6 307.8 339.7 303.1 331.2 305.7L292.8 317.7C289.7 318.7 286.3 318.7 283.2 317.7L244.8 305.7z"],key:[512,512,[128273],"f084","M282.3 343.7L248.1 376.1C244.5 381.5 238.4 384 232 384H192V424C192 437.3 181.3 448 168 448H128V488C128 501.3 117.3 512 104 512H24C10.75 512 0 501.3 0 488V408C0 401.6 2.529 395.5 7.029 391L168.3 229.7C162.9 212.8 160 194.7 160 176C160 78.8 238.8 0 336 0C433.2 0 512 78.8 512 176C512 273.2 433.2 352 336 352C317.3 352 299.2 349.1 282.3 343.7zM376 176C398.1 176 416 158.1 416 136C416 113.9 398.1 96 376 96C353.9 96 336 113.9 336 136C336 158.1 353.9 176 376 176z"],keyboard:[576,512,[9e3],"f11c","M512 448H64c-35.35 0-64-28.65-64-64V128c0-35.35 28.65-64 64-64h448c35.35 0 64 28.65 64 64v256C576 419.3 547.3 448 512 448zM128 180v-40C128 133.4 122.6 128 116 128h-40C69.38 128 64 133.4 64 140v40C64 186.6 69.38 192 76 192h40C122.6 192 128 186.6 128 180zM224 180v-40C224 133.4 218.6 128 212 128h-40C165.4 128 160 133.4 160 140v40C160 186.6 165.4 192 172 192h40C218.6 192 224 186.6 224 180zM320 180v-40C320 133.4 314.6 128 308 128h-40C261.4 128 256 133.4 256 140v40C256 186.6 261.4 192 268 192h40C314.6 192 320 186.6 320 180zM416 180v-40C416 133.4 410.6 128 404 128h-40C357.4 128 352 133.4 352 140v40C352 186.6 357.4 192 364 192h40C410.6 192 416 186.6 416 180zM512 180v-40C512 133.4 506.6 128 500 128h-40C453.4 128 448 133.4 448 140v40C448 186.6 453.4 192 460 192h40C506.6 192 512 186.6 512 180zM128 276v-40C128 229.4 122.6 224 116 224h-40C69.38 224 64 229.4 64 236v40C64 282.6 69.38 288 76 288h40C122.6 288 128 282.6 128 276zM224 276v-40C224 229.4 218.6 224 212 224h-40C165.4 224 160 229.4 160 236v40C160 282.6 165.4 288 172 288h40C218.6 288 224 282.6 224 276zM320 276v-40C320 229.4 314.6 224 308 224h-40C261.4 224 256 229.4 256 236v40C256 282.6 261.4 288 268 288h40C314.6 288 320 282.6 320 276zM416 276v-40C416 229.4 410.6 224 404 224h-40C357.4 224 352 229.4 352 236v40C352 282.6 357.4 288 364 288h40C410.6 288 416 282.6 416 276zM512 276v-40C512 229.4 506.6 224 500 224h-40C453.4 224 448 229.4 448 236v40C448 282.6 453.4 288 460 288h40C506.6 288 512 282.6 512 276zM128 372v-40C128 325.4 122.6 320 116 320h-40C69.38 320 64 325.4 64 332v40C64 378.6 69.38 384 76 384h40C122.6 384 128 378.6 128 372zM416 372v-40C416 325.4 410.6 320 404 320h-232C165.4 320 160 325.4 160 332v40C160 378.6 165.4 384 172 384h232C410.6 384 416 378.6 416 372zM512 372v-40C512 325.4 506.6 320 500 320h-40C453.4 320 448 325.4 448 332v40C448 378.6 453.4 384 460 384h40C506.6 384 512 378.6 512 372z"],khanda:[576,512,[9772],"f66d","M447.7 65.1c-6.25-3.5-14.29-2.351-19.29 3.024c-5.125 5.375-5.833 13.37-1.958 19.5c16.5 26.25 25.23 56.34 25.23 87.46c-.25 53.25-26.74 102.6-71.24 132.4l-76.62 53.35v-20.12l44.01-36.12c3.875-4.125 4.983-10.13 2.858-15.26L342.8 273c33.88-19.25 56.94-55.25 56.94-97c0-40.75-22.06-76.12-54.56-95.75l5.151-11.39c2.375-5.5 .9825-11.87-3.518-15.1L287.9 .0074l-59.05 52.77C224.4 57.02 222.1 63.37 225.2 68.87l5.203 11.32C197.1 99.81 175.9 135.2 175.9 175.1c0 41.75 23.08 77.75 56.95 97L224.1 290.2C222.9 295.4 223.9 301.2 227.9 305.5l43.1 36.11v19.91L195.2 308.1c-44.25-29.5-70.72-78.9-70.97-132.1c0-31.12 8.73-61.2 25.23-87.45C153.3 82.4 151.8 74.75 146.8 69.5C141.8 64.12 133.2 63.25 126.8 66.75C48.34 109.6 9.713 205.2 45.34 296c7 18 17.88 34.38 30.5 49l55.92 65.38c4.875 5.75 13.09 7.232 19.71 3.732l79.25-42.25l29.26 20.37l-47.09 32.75c-1.625-.375-3.125-1-4.1-1c-13.25 0-23.97 10.75-23.97 24s10.72 23.1 23.97 23.1c12.13 0 21.74-9.126 23.36-20.75l40.6-28.25v29.91c-9.375 5.625-15.97 15.37-15.97 27.12c0 17.62 14.37 31.1 31.1 31.1c17.63 0 31.1-14.37 31.1-31.1c0-11.75-6.656-21.52-16.03-27.14v-30.12l40.87 28.48c1.625 11.63 11.23 20.75 23.35 20.75c13.25 0 23.98-10.74 23.98-23.99s-10.73-24-23.98-24c-1.875 0-3.375 .625-5 1l-47.09-32.75l29.25-20.37l79.26 42.25c6.625 3.5 14.84 2.018 19.71-3.732l52.51-61.27c18.88-22 33.1-47.49 41.25-75.61C559.6 189.9 521.5 106.2 447.7 65.1zM351.8 176c0 22.25-11.45 41.91-28.82 53.41l-5.613-12.43c-8.75-24.5-8.811-51.11-.061-75.61l7.748-17.12C341.2 135.9 351.8 154.6 351.8 176zM223.8 176c0-21.38 10.67-40.16 26.67-51.79l7.848 17.17c8.75 24.63 8.747 51.11-.0032 75.61L252.7 229.4C235.4 217.9 223.8 198.2 223.8 176z"],"kip-sign":[384,512,[],"e1c4","M182.5 224H352C369.7 224 384 238.3 384 256C384 273.7 369.7 288 352 288H182.5L340.8 423.7C354.2 435.2 355.8 455.4 344.3 468.8C332.8 482.2 312.6 483.8 299.2 472.3L128 325.6V448C128 465.7 113.7 480 96 480C78.33 480 64 465.7 64 448V288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H64V64C64 46.33 78.33 32 96 32C113.7 32 128 46.33 128 64V186.4L299.2 39.7C312.6 28.2 332.8 29.76 344.3 43.18C355.8 56.59 354.2 76.8 340.8 88.3L182.5 224z"],"kit-medical":[576,512,["first-aid"],"f479","M64 32h32v448H64c-35.35 0-64-28.66-64-64V96C0 60.66 28.65 32 64 32zM128 32h320v448H128V32zM176 282c0 8.835 7.164 16 16 16h53.1V352c0 8.836 7.165 16 16 16h52c8.836 0 16-7.164 16-16V298H384c8.836 0 16-7.165 16-16v-52c0-8.837-7.164-16-16-16h-54V160c0-8.836-7.164-16-16-16h-52c-8.835 0-16 7.164-16 16v54H192c-8.836 0-16 7.163-16 16V282zM512 32h-32v448h32c35.35 0 64-28.66 64-64V96C576 60.66 547.3 32 512 32z"],"kitchen-set":[576,512,[],"e51a","M80 144C80 108.7 108.7 80 144 80C179.3 80 208 108.7 208 144C208 179.3 179.3 208 144 208C108.7 208 80 179.3 80 144zM284.4 176C269.9 240.1 212.5 288 144 288C64.47 288 0 223.5 0 144C0 64.47 64.47 0 144 0C212.5 0 269.9 47.87 284.4 112H356.2C365 102.2 377.8 96 392 96H496C522.5 96 544 117.5 544 144C544 170.5 522.5 192 496 192H392C377.8 192 365 185.8 356.2 176H284.4zM144 48C90.98 48 48 90.98 48 144C48 197 90.98 240 144 240C197 240 240 197 240 144C240 90.98 197 48 144 48zM424 264V272H520C533.3 272 544 282.7 544 296C544 309.3 533.3 320 520 320H280C266.7 320 256 309.3 256 296C256 282.7 266.7 272 280 272H376V264C376 250.7 386.7 240 400 240C413.3 240 424 250.7 424 264zM288 464V352H512V464C512 490.5 490.5 512 464 512H336C309.5 512 288 490.5 288 464zM176 320C202.5 320 224 341.5 224 368C224 394.5 202.5 416 176 416H160C160 433.7 145.7 448 128 448H64C46.33 448 32 433.7 32 416V336C32 327.2 39.16 320 48 320H176zM192 368C192 359.2 184.8 352 176 352H160V384H176C184.8 384 192 376.8 192 368zM200 464C213.3 464 224 474.7 224 488C224 501.3 213.3 512 200 512H24C10.75 512 0 501.3 0 488C0 474.7 10.75 464 24 464H200z"],"kiwi-bird":[576,512,[],"f535","M256 405.1V456C256 469.3 245.3 480 232 480C218.7 480 208 469.3 208 456V415.3C202.7 415.8 197.4 416 192 416C175.4 416 159.3 413.9 144 409.1V456C144 469.3 133.3 480 120 480C106.7 480 96 469.3 96 456V390.3C38.61 357.1 0 295.1 0 224C0 117.1 85.96 32 192 32C228.3 32 262.3 42.08 291.2 59.6C322.4 78.44 355.9 96 392.3 96H448C518.7 96 576 153.3 576 224V464C576 470.1 571.5 477.2 564.8 479.3C558.2 481.4 550.9 478.9 546.9 473.2L461.6 351.3C457.1 351.8 452.6 352 448 352H392.3C355.9 352 322.4 369.6 291.2 388.4C280.2 395.1 268.4 400.7 256 405.1zM448 248C461.3 248 472 237.3 472 224C472 210.7 461.3 200 448 200C434.7 200 424 210.7 424 224C424 237.3 434.7 248 448 248z"],l:[320,512,[108],"4c","M320 448c0 17.67-14.31 32-32 32H64c-17.69 0-32-14.33-32-32v-384C32 46.34 46.31 32.01 64 32.01S96 46.34 96 64.01v352h192C305.7 416 320 430.3 320 448z"],"land-mine-on":[576,512,[],"e51b","M312 168C312 181.3 301.3 192 288 192C274.7 192 264 181.3 264 168V24C264 10.75 274.7 0 288 0C301.3 0 312 10.75 312 24V168zM160 320C160 302.3 174.3 288 192 288H384C401.7 288 416 302.3 416 320V352H160V320zM82.74 410.5C90.87 394.3 107.5 384 125.7 384H450.3C468.5 384 485.1 394.3 493.3 410.5L520.8 465.7C531.5 486.1 516 512 492.2 512H83.78C59.99 512 44.52 486.1 55.16 465.7L82.74 410.5zM4.269 138.3C11.81 127.4 26.77 124.7 37.66 132.3L141.7 204.3C152.6 211.8 155.3 226.8 147.7 237.7C140.2 248.6 125.2 251.3 114.3 243.7L10.34 171.7C-.5568 164.2-3.275 149.2 4.269 138.3V138.3zM538.3 132.3C549.2 124.7 564.2 127.4 571.7 138.3C579.3 149.2 576.6 164.2 565.7 171.7L461.7 243.7C450.8 251.3 435.8 248.6 428.3 237.7C420.7 226.8 423.4 211.8 434.3 204.3L538.3 132.3z"],landmark:[512,512,[127963],"f66f","M240.1 4.216C249.1-1.405 262-1.405 271.9 4.216L443.6 102.4L447.1 104V104.9L495.9 132.2C508.5 139.4 514.6 154.2 510.9 168.2C507.2 182.2 494.5 192 479.1 192H31.1C17.49 192 4.795 182.2 1.071 168.2C-2.653 154.2 3.524 139.4 16.12 132.2L63.1 104.9V104L68.37 102.4L240.1 4.216zM64 224H128V416H168V224H232V416H280V224H344V416H384V224H448V420.3C448.6 420.6 449.2 420.1 449.8 421.4L497.8 453.4C509.5 461.2 514.7 475.8 510.6 489.3C506.5 502.8 494.1 512 480 512H32C17.9 512 5.46 502.8 1.373 489.3C-2.713 475.8 2.517 461.2 14.25 453.4L62.25 421.4C62.82 420.1 63.41 420.6 64 420.3V224z"],"landmark-dome":[512,512,["landmark-alt"],"f752","M264 0C277.3 0 288 10.75 288 24V34.65C368.4 48.14 431.9 111.6 445.3 192H448C465.7 192 480 206.3 480 224C480 241.7 465.7 256 448 256H63.1C46.33 256 31.1 241.7 31.1 224C31.1 206.3 46.33 192 63.1 192H66.65C80.14 111.6 143.6 48.14 223.1 34.65V24C223.1 10.75 234.7 0 247.1 0L264 0zM63.1 288H127.1V416H167.1V288H231.1V416H280V288H344V416H384V288H448V420.3C448.6 420.6 449.2 420.1 449.8 421.4L497.8 453.4C509.5 461.2 514.7 475.8 510.6 489.3C506.5 502.8 494.1 512 480 512H31.1C17.9 512 5.458 502.8 1.372 489.3C-2.715 475.8 2.515 461.2 14.25 453.4L62.25 421.4C62.82 420.1 63.41 420.6 63.1 420.3V288z"],"landmark-flag":[512,512,[],"e51c","M352 0C360.8 0 368 7.164 368 16V80C368 88.84 360.8 96 352 96H272V128H464C481.7 128 496 142.3 496 160C496 177.7 481.7 192 464 192H47.1C30.33 192 15.1 177.7 15.1 160C15.1 142.3 30.33 128 47.1 128H239.1V16C239.1 7.164 247.2 0 255.1 0H352zM63.1 224H127.1V416H167.1V224H231.1V416H280V224H344V416H384V224H448V420.3C448.6 420.6 449.2 420.1 449.8 421.4L497.8 453.4C509.5 461.2 514.7 475.8 510.6 489.3C506.5 502.8 494.1 512 480 512H31.1C17.9 512 5.458 502.8 1.372 489.3C-2.715 475.8 2.515 461.2 14.25 453.4L62.25 421.4C62.82 420.1 63.4 420.6 63.1 420.3V224z"],language:[640,512,[],"f1ab","M448 164C459 164 468 172.1 468 184V188H528C539 188 548 196.1 548 208C548 219 539 228 528 228H526L524.4 232.5C515.5 256.1 501.9 279.1 484.7 297.9C485.6 298.4 486.5 298.1 487.4 299.5L506.3 310.8C515.8 316.5 518.8 328.8 513.1 338.3C507.5 347.8 495.2 350.8 485.7 345.1L466.8 333.8C462.4 331.1 457.1 328.3 453.7 325.3C443.2 332.8 431.8 339.3 419.8 344.7L416.1 346.3C406 350.8 394.2 346.2 389.7 336.1C385.2 326 389.8 314.2 399.9 309.7L403.5 308.1C409.9 305.2 416.1 301.1 422 298.3L409.9 286.1C402 278.3 402 265.7 409.9 257.9C417.7 250 430.3 250 438.1 257.9L452.7 272.4L453.3 272.1C465.7 259.9 475.8 244.7 483.1 227.1H376C364.1 227.1 356 219 356 207.1C356 196.1 364.1 187.1 376 187.1H428V183.1C428 172.1 436.1 163.1 448 163.1L448 164zM160 233.2L179 276H140.1L160 233.2zM0 128C0 92.65 28.65 64 64 64H576C611.3 64 640 92.65 640 128V384C640 419.3 611.3 448 576 448H64C28.65 448 0 419.3 0 384V128zM320 384H576V128H320V384zM178.3 175.9C175.1 168.7 167.9 164 160 164C152.1 164 144.9 168.7 141.7 175.9L77.72 319.9C73.24 329.1 77.78 341.8 87.88 346.3C97.97 350.8 109.8 346.2 114.3 336.1L123.2 315.1H196.8L205.7 336.1C210.2 346.2 222 350.8 232.1 346.3C242.2 341.8 246.8 329.1 242.3 319.9L178.3 175.9z"],laptop:[640,512,[128187],"f109","M128 96h384v256h64v-272c0-26.38-21.62-48-48-48h-416c-26.38 0-48 21.62-48 48V352h64V96zM624 383.1h-608c-8.75 0-16 7.25-16 16v16c0 35.25 28.75 64 64 64h512c35.25 0 64-28.75 64-64v-16C640 391.2 632.8 383.1 624 383.1z"],"laptop-code":[640,512,[],"f5fc","M128 96h384v256h64V80C576 53.63 554.4 32 528 32h-416C85.63 32 64 53.63 64 80V352h64V96zM624 384h-608C7.25 384 0 391.3 0 400V416c0 35.25 28.75 64 64 64h512c35.25 0 64-28.75 64-64v-16C640 391.3 632.8 384 624 384zM365.9 286.2C369.8 290.1 374.9 292 380 292s10.23-1.938 14.14-5.844l48-48c7.812-7.813 7.812-20.5 0-28.31l-48-48c-7.812-7.813-20.47-7.813-28.28 0c-7.812 7.813-7.812 20.5 0 28.31l33.86 33.84l-33.86 33.84C358 265.7 358 278.4 365.9 286.2zM274.1 161.9c-7.812-7.813-20.47-7.813-28.28 0l-48 48c-7.812 7.813-7.812 20.5 0 28.31l48 48C249.8 290.1 254.9 292 260 292s10.23-1.938 14.14-5.844c7.812-7.813 7.812-20.5 0-28.31L240.3 224l33.86-33.84C281.1 182.4 281.1 169.7 274.1 161.9z"],"laptop-file":[640,512,[],"e51d","M192 96C192 113.7 206.3 128 224 128H320V192H288C243.8 192 208 227.8 208 272V384C187.1 384 169.3 397.4 162.7 416H48C21.49 416 0 394.5 0 368V48C0 21.49 21.49 0 48 0H192V96zM240 272C240 245.5 261.5 224 288 224H544C570.5 224 592 245.5 592 272V416H624C632.8 416 640 423.2 640 432V448C640 483.3 611.3 512 576 512H256C220.7 512 192 483.3 192 448V432C192 423.2 199.2 416 208 416H240V272zM304 288V416H528V288H304zM320 96H224V0L320 96z"],"laptop-medical":[640,512,[],"f812","M624 384h-608C7.25 384 0 391.3 0 400V416c0 35.25 28.75 64 64 64h512c35.25 0 64-28.75 64-64v-16C640 391.3 632.8 384 624 384zM128 96h384v256h64V80C576 53.63 554.4 32 528 32h-416C85.63 32 64 53.63 64 80V352h64V96zM304 336h32c8.801 0 16-7.201 16-16V272h48C408.8 272 416 264.8 416 256V224c0-8.801-7.199-16-16-16H352V160c0-8.801-7.199-16-16-16h-32C295.2 144 288 151.2 288 160v48H240C231.2 208 224 215.2 224 224v32c0 8.799 7.199 16 16 16H288V320C288 328.8 295.2 336 304 336z"],"lari-sign":[384,512,[],"e1c8","M144 32C161.7 32 176 46.33 176 64V96.66C181.3 96.22 186.6 96 192 96C197.4 96 202.7 96.22 208 96.66V64C208 46.33 222.3 32 240 32C257.7 32 272 46.33 272 64V113.4C326.9 138.6 367.8 188.9 380.2 249.6C383.7 266.1 372.5 283.8 355.2 287.4C337.8 290.9 320.1 279.7 317.4 262.4C311.4 232.5 294.9 206.4 272 188.1V256C272 273.7 257.7 288 240 288C222.3 288 208 273.7 208 256V160.1C202.8 160.3 197.4 160 192 160C186.6 160 181.2 160.3 176 160.1V256C176 273.7 161.7 288 144 288C126.3 288 112 273.7 112 256V188.1C82.74 211.5 64 247.6 64 288C64 358.7 121.3 416 192 416H352C369.7 416 384 430.3 384 448C384 465.7 369.7 480 352 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H48.89C18.49 382 0 337.2 0 288C0 210.5 45.9 143.7 112 113.4V64C112 46.33 126.3 32 144 32V32z"],"layer-group":[512,512,[],"f5fd","M232.5 5.171C247.4-1.718 264.6-1.718 279.5 5.171L498.1 106.2C506.6 110.1 512 118.6 512 127.1C512 137.3 506.6 145.8 498.1 149.8L279.5 250.8C264.6 257.7 247.4 257.7 232.5 250.8L13.93 149.8C5.438 145.8 0 137.3 0 127.1C0 118.6 5.437 110.1 13.93 106.2L232.5 5.171zM498.1 234.2C506.6 238.1 512 246.6 512 255.1C512 265.3 506.6 273.8 498.1 277.8L279.5 378.8C264.6 385.7 247.4 385.7 232.5 378.8L13.93 277.8C5.438 273.8 0 265.3 0 255.1C0 246.6 5.437 238.1 13.93 234.2L67.13 209.6L219.1 279.8C242.5 290.7 269.5 290.7 292.9 279.8L444.9 209.6L498.1 234.2zM292.9 407.8L444.9 337.6L498.1 362.2C506.6 366.1 512 374.6 512 383.1C512 393.3 506.6 401.8 498.1 405.8L279.5 506.8C264.6 513.7 247.4 513.7 232.5 506.8L13.93 405.8C5.438 401.8 0 393.3 0 383.1C0 374.6 5.437 366.1 13.93 362.2L67.13 337.6L219.1 407.8C242.5 418.7 269.5 418.7 292.9 407.8V407.8z"],leaf:[512,512,[],"f06c","M512 165.4c0 127.9-70.05 235.3-175.3 270.1c-20.04 7.938-41.83 12.46-64.69 12.46c-64.9 0-125.2-36.51-155.7-94.47c-54.13 49.93-68.71 107-68.96 108.1C44.72 472.6 34.87 480 24.02 480c-1.844 0-3.727-.2187-5.602-.6562c-12.89-3.098-20.84-16.08-17.75-28.96c9.598-39.5 90.47-226.4 335.3-226.4C344.8 224 352 216.8 352 208S344.8 192 336 192C228.6 192 151 226.6 96.29 267.6c.1934-10.82 1.242-21.84 3.535-33.05c13.47-65.81 66.04-119 131.4-134.2c28.33-6.562 55.68-6.013 80.93-.0054c56 13.32 118.2-7.412 149.3-61.24c5.664-9.828 20.02-9.516 24.66 .8282C502.7 76.76 512 121.9 512 165.4z"],"left-long":[512,512,["long-arrow-alt-left"],"f30a","M512 256C512 273.7 497.7 288 480 288H160.1l0 72c0 9.547-5.66 18.19-14.42 22c-8.754 3.812-18.95 2.077-25.94-4.407l-112.1-104c-10.24-9.5-10.24-25.69 0-35.19l112.1-104c6.992-6.484 17.18-8.218 25.94-4.406C154.4 133.8 160.1 142.5 160.1 151.1L160.1 224H480C497.7 224 512 238.3 512 256z"],"left-right":[512,512,[8596,"arrows-alt-h"],"f337","M503.1 273.6l-112 104c-6.984 6.484-17.17 8.219-25.92 4.406s-14.41-12.45-14.41-22v-56l-192 .001V360c0 9.547-5.656 18.19-14.41 22c-8.75 3.812-18.94 2.078-25.92-4.406l-112-104c-9.781-9.094-9.781-26.09 0-35.19l112-104c6.984-6.484 17.17-8.219 25.92-4.406C154 133.8 159.7 142.5 159.7 152v55.1l192-.001v-56c0-9.547 5.656-18.19 14.41-22s18.94-2.078 25.92 4.406l112 104C513.8 247.5 513.8 264.5 503.1 273.6z"],lemon:[448,512,[127819],"f094","M427.9 52.1c-20.13-20.23-47.58-25.27-65.63-14.77c-51.63 30.08-158.6-46.49-281 75.91c-122.4 122.4-45.83 229.4-75.91 281c-10.5 18.05-5.471 45.5 14.77 65.63c20.13 20.24 47.58 25.27 65.63 14.77c51.63-30.08 158.6 46.49 281-75.91c122.4-122.4 45.83-229.4 75.91-281C453.2 99.69 448.1 72.23 427.9 52.1zM211.9 127.5C167.6 138.7 106.7 199.6 95.53 243.9C93.69 251.2 87.19 255.1 79.1 255.1c-1.281 0-2.594-.1562-3.906-.4687C67.53 253.4 62.34 244.7 64.47 236.1c14.16-56.28 83.31-125.4 139.6-139.6c8.656-2.031 17.25 3.062 19.44 11.62C225.7 116.7 220.5 125.3 211.9 127.5z"],"less-than":[384,512,[62774],"3c","M351.1 448c-4.797 0-9.688-1.094-14.28-3.375l-320-160C6.844 279.2 0 268.1 0 256c0-12.13 6.844-23.18 17.69-28.62l320-160c15.88-7.875 35.05-1.5 42.94 14.31c7.906 15.81 1.5 35.03-14.31 42.94L103.5 256l262.8 131.4c15.81 7.906 22.22 27.12 14.31 42.94C375 441.5 363.7 448 351.1 448z"],"less-than-equal":[448,512,[],"f537","M52.11 221.7l320 128C376 351.3 380 352 383.1 352c12.7 0 24.72-7.594 29.73-20.12c6.562-16.41-1.422-35.03-17.83-41.59L150.2 192l245.7-98.28c16.41-6.562 24.39-25.19 17.83-41.59S388.6 27.68 372.1 34.21l-320 128.1C39.97 167.2 32 178.9 32 192S39.97 216.8 52.11 221.7zM416 416H32c-17.67 0-32 14.31-32 31.1S14.33 480 32 480h384c17.67 0 32-14.31 32-32S433.7 416 416 416z"],"life-ring":[512,512,[],"f1cd","M470.6 425.4C483.1 437.9 483.1 458.1 470.6 470.6C458.1 483.1 437.9 483.1 425.4 470.6L412.1 458.2C369.6 491.9 315.2 512 255.1 512C196.8 512 142.4 491.9 99.02 458.2L86.63 470.6C74.13 483.1 53.87 483.1 41.37 470.6C28.88 458.1 28.88 437.9 41.37 425.4L53.76 412.1C20.07 369.6 0 315.2 0 255.1C0 196.8 20.07 142.4 53.76 99.02L41.37 86.63C28.88 74.13 28.88 53.87 41.37 41.37C53.87 28.88 74.13 28.88 86.63 41.37L99.02 53.76C142.4 20.07 196.8 0 255.1 0C315.2 0 369.6 20.07 412.1 53.76L425.4 41.37C437.9 28.88 458.1 28.88 470.6 41.37C483.1 53.87 483.1 74.13 470.6 86.63L458.2 99.02C491.9 142.4 512 196.8 512 255.1C512 315.2 491.9 369.6 458.2 412.1L470.6 425.4zM309.3 354.5C293.4 363.1 275.3 368 255.1 368C236.7 368 218.6 363.1 202.7 354.5L144.8 412.5C176.1 434.9 214.5 448 255.1 448C297.5 448 335.9 434.9 367.2 412.5L309.3 354.5zM448 255.1C448 214.5 434.9 176.1 412.5 144.8L354.5 202.7C363.1 218.6 368 236.7 368 256C368 275.3 363.1 293.4 354.5 309.3L412.5 367.2C434.9 335.9 448 297.5 448 256V255.1zM255.1 63.1C214.5 63.1 176.1 77.14 144.8 99.5L202.7 157.5C218.6 148.9 236.7 143.1 255.1 143.1C275.3 143.1 293.4 148.9 309.3 157.5L367.2 99.5C335.9 77.14 297.5 63.1 256 63.1H255.1zM157.5 309.3C148.9 293.4 143.1 275.3 143.1 255.1C143.1 236.7 148.9 218.6 157.5 202.7L99.5 144.8C77.14 176.1 63.1 214.5 63.1 255.1C63.1 297.5 77.14 335.9 99.5 367.2L157.5 309.3zM255.1 207.1C229.5 207.1 207.1 229.5 207.1 255.1C207.1 282.5 229.5 303.1 255.1 303.1C282.5 303.1 304 282.5 304 255.1C304 229.5 282.5 207.1 255.1 207.1z"],lightbulb:[384,512,[128161],"f0eb","M112.1 454.3c0 6.297 1.816 12.44 5.284 17.69l17.14 25.69c5.25 7.875 17.17 14.28 26.64 14.28h61.67c9.438 0 21.36-6.401 26.61-14.28l17.08-25.68c2.938-4.438 5.348-12.37 5.348-17.7L272 415.1h-160L112.1 454.3zM191.4 .0132C89.44 .3257 16 82.97 16 175.1c0 44.38 16.44 84.84 43.56 115.8c16.53 18.84 42.34 58.23 52.22 91.45c.0313 .25 .0938 .5166 .125 .7823h160.2c.0313-.2656 .0938-.5166 .125-.7823c9.875-33.22 35.69-72.61 52.22-91.45C351.6 260.8 368 220.4 368 175.1C368 78.61 288.9-.2837 191.4 .0132zM192 96.01c-44.13 0-80 35.89-80 79.1C112 184.8 104.8 192 96 192S80 184.8 80 176c0-61.76 50.25-111.1 112-111.1c8.844 0 16 7.159 16 16S200.8 96.01 192 96.01z"],"lines-leaning":[384,512,[],"e51e","M62.36 458.1C56.77 474.9 38.65 483.9 21.88 478.4C5.116 472.8-3.946 454.6 1.643 437.9L129.6 53.88C135.2 37.12 153.4 28.05 170.1 33.64C186.9 39.23 195.9 57.35 190.4 74.12L62.36 458.1zM261.3 32.44C278.7 35.34 290.5 51.83 287.6 69.26L223.6 453.3C220.7 470.7 204.2 482.5 186.7 479.6C169.3 476.7 157.5 460.2 160.4 442.7L224.4 58.74C227.3 41.31 243.8 29.53 261.3 32.44H261.3zM352 32C369.7 32 384 46.33 384 64V448C384 465.7 369.7 480 352 480C334.3 480 320 465.7 320 448V64C320 46.33 334.3 32 352 32V32z"],link:[640,512,[128279,"chain"],"f0c1","M172.5 131.1C228.1 75.51 320.5 75.51 376.1 131.1C426.1 181.1 433.5 260.8 392.4 318.3L391.3 319.9C381 334.2 361 337.6 346.7 327.3C332.3 317 328.9 297 339.2 282.7L340.3 281.1C363.2 249 359.6 205.1 331.7 177.2C300.3 145.8 249.2 145.8 217.7 177.2L105.5 289.5C73.99 320.1 73.99 372 105.5 403.5C133.3 431.4 177.3 435 209.3 412.1L210.9 410.1C225.3 400.7 245.3 404 255.5 418.4C265.8 432.8 262.5 452.8 248.1 463.1L246.5 464.2C188.1 505.3 110.2 498.7 60.21 448.8C3.741 392.3 3.741 300.7 60.21 244.3L172.5 131.1zM467.5 380C411 436.5 319.5 436.5 263 380C213 330 206.5 251.2 247.6 193.7L248.7 192.1C258.1 177.8 278.1 174.4 293.3 184.7C307.7 194.1 311.1 214.1 300.8 229.3L299.7 230.9C276.8 262.1 280.4 306.9 308.3 334.8C339.7 366.2 390.8 366.2 422.3 334.8L534.5 222.5C566 191 566 139.1 534.5 108.5C506.7 80.63 462.7 76.99 430.7 99.9L429.1 101C414.7 111.3 394.7 107.1 384.5 93.58C374.2 79.2 377.5 59.21 391.9 48.94L393.5 47.82C451 6.731 529.8 13.25 579.8 63.24C636.3 119.7 636.3 211.3 579.8 267.7L467.5 380z"],"link-slash":[640,512,["chain-broken","chain-slash","unlink"],"f127","M185.7 120.3C242.5 75.82 324.7 79.73 376.1 131.1C420.1 175.1 430.9 239.6 406.7 293.5L438.6 318.4L534.5 222.5C566 191 566 139.1 534.5 108.5C506.7 80.63 462.7 76.1 430.7 99.9L429.1 101C414.7 111.3 394.7 107.1 384.5 93.58C374.2 79.2 377.5 59.21 391.9 48.94L393.5 47.82C451 6.732 529.8 13.25 579.8 63.24C636.3 119.7 636.3 211.3 579.8 267.7L489.3 358.2L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L185.7 120.3zM238.1 161.1L353.4 251.7C359.3 225.5 351.7 197.2 331.7 177.2C306.6 152.1 269.1 147 238.1 161.1V161.1zM263 380C233.1 350.1 218.7 309.8 220.9 270L406.6 416.4C357.4 431 301.9 418.9 263 380V380zM116.6 187.9L167.2 227.8L105.5 289.5C73.99 320.1 73.99 372 105.5 403.5C133.3 431.4 177.3 435 209.3 412.1L210.9 410.1C225.3 400.7 245.3 404 255.5 418.4C265.8 432.8 262.5 452.8 248.1 463.1L246.5 464.2C188.1 505.3 110.2 498.7 60.21 448.8C3.741 392.3 3.741 300.7 60.21 244.3L116.6 187.9z"],"lira-sign":[320,512,[8356],"f195","M111.1 191.1H224C241.7 191.1 256 206.3 256 223.1C256 241.7 241.7 255.1 224 255.1H111.1V287.1H224C241.7 287.1 256 302.3 256 319.1C256 337.7 241.7 352 224 352H110.8C108.1 374.2 100.8 395.6 89.2 414.9L88.52 416H288C305.7 416 320 430.3 320 448C320 465.7 305.7 480 288 480H32C20.47 480 9.834 473.8 4.154 463.8C-1.527 453.7-1.371 441.4 4.56 431.5L34.32 381.9C39.89 372.6 43.83 362.5 46.01 352H32C14.33 352 0 337.7 0 320C0 302.3 14.33 288 32 288H48V256H32C14.33 256 0 241.7 0 224C0 206.3 14.33 192 32 192H48V160.4C48 89.47 105.5 32 176.4 32C190.2 32 203.9 34.22 216.1 38.59L298.1 65.64C314.9 71.23 323.9 89.35 318.4 106.1C312.8 122.9 294.6 131.9 277.9 126.4L196.7 99.3C190.2 97.12 183.3 96 176.4 96C140.8 96 112 124.8 112 160.4L111.1 191.1z"],list:[512,512,["list-squares"],"f03a","M88 48C101.3 48 112 58.75 112 72V120C112 133.3 101.3 144 88 144H40C26.75 144 16 133.3 16 120V72C16 58.75 26.75 48 40 48H88zM480 64C497.7 64 512 78.33 512 96C512 113.7 497.7 128 480 128H192C174.3 128 160 113.7 160 96C160 78.33 174.3 64 192 64H480zM480 224C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H192C174.3 288 160 273.7 160 256C160 238.3 174.3 224 192 224H480zM480 384C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H192C174.3 448 160 433.7 160 416C160 398.3 174.3 384 192 384H480zM16 232C16 218.7 26.75 208 40 208H88C101.3 208 112 218.7 112 232V280C112 293.3 101.3 304 88 304H40C26.75 304 16 293.3 16 280V232zM88 368C101.3 368 112 378.7 112 392V440C112 453.3 101.3 464 88 464H40C26.75 464 16 453.3 16 440V392C16 378.7 26.75 368 40 368H88z"],"list-check":[512,512,["tasks"],"f0ae","M152.1 38.16C161.9 47.03 162.7 62.2 153.8 72.06L81.84 152.1C77.43 156.9 71.21 159.8 64.63 159.1C58.05 160.2 51.69 157.6 47.03 152.1L7.029 112.1C-2.343 103.6-2.343 88.4 7.029 79.03C16.4 69.66 31.6 69.66 40.97 79.03L63.08 101.1L118.2 39.94C127 30.09 142.2 29.29 152.1 38.16V38.16zM152.1 198.2C161.9 207 162.7 222.2 153.8 232.1L81.84 312.1C77.43 316.9 71.21 319.8 64.63 319.1C58.05 320.2 51.69 317.6 47.03 312.1L7.029 272.1C-2.343 263.6-2.343 248.4 7.029 239C16.4 229.7 31.6 229.7 40.97 239L63.08 261.1L118.2 199.9C127 190.1 142.2 189.3 152.1 198.2V198.2zM224 96C224 78.33 238.3 64 256 64H480C497.7 64 512 78.33 512 96C512 113.7 497.7 128 480 128H256C238.3 128 224 113.7 224 96V96zM224 256C224 238.3 238.3 224 256 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H256C238.3 288 224 273.7 224 256zM160 416C160 398.3 174.3 384 192 384H480C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H192C174.3 448 160 433.7 160 416zM0 416C0 389.5 21.49 368 48 368C74.51 368 96 389.5 96 416C96 442.5 74.51 464 48 464C21.49 464 0 442.5 0 416z"],"list-ol":[576,512,["list-1-2","list-numeric"],"f0cb","M55.1 56.04C55.1 42.78 66.74 32.04 79.1 32.04H111.1C125.3 32.04 135.1 42.78 135.1 56.04V176H151.1C165.3 176 175.1 186.8 175.1 200C175.1 213.3 165.3 224 151.1 224H71.1C58.74 224 47.1 213.3 47.1 200C47.1 186.8 58.74 176 71.1 176H87.1V80.04H79.1C66.74 80.04 55.1 69.29 55.1 56.04V56.04zM118.7 341.2C112.1 333.8 100.4 334.3 94.65 342.4L83.53 357.9C75.83 368.7 60.84 371.2 50.05 363.5C39.26 355.8 36.77 340.8 44.47 330.1L55.59 314.5C79.33 281.2 127.9 278.8 154.8 309.6C176.1 333.1 175.6 370.5 153.7 394.3L118.8 432H152C165.3 432 176 442.7 176 456C176 469.3 165.3 480 152 480H64C54.47 480 45.84 474.4 42.02 465.6C38.19 456.9 39.9 446.7 46.36 439.7L118.4 361.7C123.7 355.9 123.8 347.1 118.7 341.2L118.7 341.2zM512 64C529.7 64 544 78.33 544 96C544 113.7 529.7 128 512 128H256C238.3 128 224 113.7 224 96C224 78.33 238.3 64 256 64H512zM512 224C529.7 224 544 238.3 544 256C544 273.7 529.7 288 512 288H256C238.3 288 224 273.7 224 256C224 238.3 238.3 224 256 224H512zM512 384C529.7 384 544 398.3 544 416C544 433.7 529.7 448 512 448H256C238.3 448 224 433.7 224 416C224 398.3 238.3 384 256 384H512z"],"list-ul":[512,512,["list-dots"],"f0ca","M16 96C16 69.49 37.49 48 64 48C90.51 48 112 69.49 112 96C112 122.5 90.51 144 64 144C37.49 144 16 122.5 16 96zM480 64C497.7 64 512 78.33 512 96C512 113.7 497.7 128 480 128H192C174.3 128 160 113.7 160 96C160 78.33 174.3 64 192 64H480zM480 224C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H192C174.3 288 160 273.7 160 256C160 238.3 174.3 224 192 224H480zM480 384C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H192C174.3 448 160 433.7 160 416C160 398.3 174.3 384 192 384H480zM16 416C16 389.5 37.49 368 64 368C90.51 368 112 389.5 112 416C112 442.5 90.51 464 64 464C37.49 464 16 442.5 16 416zM112 256C112 282.5 90.51 304 64 304C37.49 304 16 282.5 16 256C16 229.5 37.49 208 64 208C90.51 208 112 229.5 112 256z"],"litecoin-sign":[384,512,[],"e1d3","M128 195.3L247.2 161.2C264.2 156.4 281.9 166.2 286.8 183.2C291.6 200.2 281.8 217.9 264.8 222.8L128 261.9V416H352C369.7 416 384 430.3 384 448C384 465.7 369.7 480 352 480H96C78.33 480 64 465.7 64 448V280.1L40.79 286.8C23.8 291.6 6.087 281.8 1.232 264.8C-3.623 247.8 6.216 230.1 23.21 225.2L64 213.6V64C64 46.33 78.33 32 96 32C113.7 32 128 46.33 128 64V195.3z"],"location-arrow":[448,512,[],"f124","M285.6 444.1C279.8 458.3 264.8 466.3 249.8 463.4C234.8 460.4 223.1 447.3 223.1 432V256H47.1C32.71 256 19.55 245.2 16.6 230.2C13.65 215.2 21.73 200.2 35.88 194.4L387.9 50.38C399.8 45.5 413.5 48.26 422.6 57.37C431.7 66.49 434.5 80.19 429.6 92.12L285.6 444.1z"],"location-crosshairs":[512,512,["location"],"f601","M176 256C176 211.8 211.8 176 256 176C300.2 176 336 211.8 336 256C336 300.2 300.2 336 256 336C211.8 336 176 300.2 176 256zM256 0C273.7 0 288 14.33 288 32V66.65C368.4 80.14 431.9 143.6 445.3 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H445.3C431.9 368.4 368.4 431.9 288 445.3V480C288 497.7 273.7 512 256 512C238.3 512 224 497.7 224 480V445.3C143.6 431.9 80.14 368.4 66.65 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H66.65C80.14 143.6 143.6 80.14 224 66.65V32C224 14.33 238.3 0 256 0zM128 256C128 326.7 185.3 384 256 384C326.7 384 384 326.7 384 256C384 185.3 326.7 128 256 128C185.3 128 128 185.3 128 256z"],"location-dot":[384,512,["map-marker-alt"],"f3c5","M168.3 499.2C116.1 435 0 279.4 0 192C0 85.96 85.96 0 192 0C298 0 384 85.96 384 192C384 279.4 267 435 215.7 499.2C203.4 514.5 180.6 514.5 168.3 499.2H168.3zM192 256C227.3 256 256 227.3 256 192C256 156.7 227.3 128 192 128C156.7 128 128 156.7 128 192C128 227.3 156.7 256 192 256z"],"location-pin":[384,512,["map-marker"],"f041","M384 192C384 279.4 267 435 215.7 499.2C203.4 514.5 180.6 514.5 168.3 499.2C116.1 435 0 279.4 0 192C0 85.96 85.96 0 192 0C298 0 384 85.96 384 192H384z"],"location-pin-lock":[512,512,[],"e51f","M168.3 499.2C116.1 435 0 279.4 0 192C0 85.96 85.96 0 192 0C287.7 0 366.1 69.96 381.6 161.5C328.5 170.3 288 216.4 288 272V296.6C268.9 307.6 256 328.3 256 352V446.8C240.7 467.4 226.7 485.4 215.7 499.2C203.4 514.5 180.6 514.5 168.3 499.2H168.3zM192 256C227.3 256 256 227.3 256 192C256 156.7 227.3 128 192 128C156.7 128 128 156.7 128 192C128 227.3 156.7 256 192 256zM400 192C444.2 192 480 227.8 480 272V320C497.7 320 512 334.3 512 352V480C512 497.7 497.7 512 480 512H320C302.3 512 288 497.7 288 480V352C288 334.3 302.3 320 320 320V272C320 227.8 355.8 192 400 192zM400 240C382.3 240 368 254.3 368 272V320H432V272C432 254.3 417.7 240 400 240z"],lock:[448,512,[128274],"f023","M80 192V144C80 64.47 144.5 0 224 0C303.5 0 368 64.47 368 144V192H384C419.3 192 448 220.7 448 256V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V256C0 220.7 28.65 192 64 192H80zM144 192H304V144C304 99.82 268.2 64 224 64C179.8 64 144 99.82 144 144V192z"],"lock-open":[576,512,[],"f3c1","M352 192H384C419.3 192 448 220.7 448 256V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V256C0 220.7 28.65 192 64 192H288V144C288 64.47 352.5 0 432 0C511.5 0 576 64.47 576 144V192C576 209.7 561.7 224 544 224C526.3 224 512 209.7 512 192V144C512 99.82 476.2 64 432 64C387.8 64 352 99.82 352 144V192z"],locust:[576,512,[],"e520","M328 32C464.1 32 576 143 576 280V320C576 320.1 576 320.2 576 320.3C575.8 364.3 540.1 400 496 400H483.6L508.8 444.1C515.4 455.6 511.4 470.3 499.9 476.8C488.4 483.4 473.7 479.4 467.2 467.9L428.4 400H347.1L299.7 469.7C292.2 480.6 277.2 483.3 266.3 475.7C255.4 468.2 252.7 453.2 260.3 442.3L289.6 400H215.1L163.3 470.2C155.5 480.9 140.4 483.2 129.8 475.3C119.1 467.5 116.8 452.4 124.7 441.8L165.2 386.7L122.2 370.4L42.84 470.9C34.62 481.3 19.53 483 9.13 474.8C-1.274 466.6-3.049 451.5 5.164 441.1L245.2 137.1C250.4 130.5 258.8 127.1 267.2 128.2C275.5 129.3 282.7 134.8 286.1 142.5L307.8 193.3L348.7 137.8C353.8 130.8 362.2 127.2 370.8 128.2C379.3 129.1 386.7 134.6 390.1 142.5L431.8 240H496C506.2 240 516 241.9 525 245.4C508.6 151.4 426.7 80 328 80H312C298.7 80 288 69.26 288 56C288 42.75 298.7 32 312 32L328 32zM332.1 240H379.6L362.5 199.1L332.1 240zM257.8 198.5L225.1 240H273.3L274.8 238.1L257.8 198.5zM496 336C504.8 336 512 328.8 512 320C512 311.2 504.8 304 496 304C487.2 304 480 311.2 480 320C480 328.8 487.2 336 496 336zM88.83 240H126.7L48.9 337.3C38.31 326.8 32 312.3 32 296.8C32 265.4 57.45 240 88.83 240V240z"],lungs:[640,512,[129729],"f604","M640 419.8c0 61.25-62.5 105.5-125.3 88.63l-59.53-15.88c-42.12-11.38-71.25-47.5-71.25-88.63L384 316.4l85.88 57.25c3.625 2.375 8.625 1.375 11-2.25l8.875-13.37c2.5-3.625 1.5-8.625-2.125-11L320 235.3l-167.6 111.8c-1.75 1.125-3 3-3.375 5c-.375 2.125 0 4.25 1.25 6l8.875 13.37c1.125 1.75 3 3 5 3.375c2.125 .375 4.25 0 6-1.125L256 316.4l.0313 87.5c0 41.13-29.12 77.25-71.25 88.63l-59.53 15.88C62.5 525.3 0 481 0 419.8c0-10 1.25-19.88 3.875-29.63C25.5 308.9 59.91 231 105.9 159.1c22.12-34.63 36.12-63.13 80.12-63.13C224.7 96 256 125.4 256 161.8v60.1l32.88-21.97C293.4 196.9 296 192 296 186.6V16C296 7.125 303.1 0 312 0h16c8.875 0 16 7.125 16 16v170.6c0 5.375 2.625 10.25 7.125 13.25L384 221.8v-60.1c0-36.38 31.34-65.75 69.97-65.75c43.1 0 58 28.5 80.13 63.13c46 71.88 80.41 149.8 102 231C638.8 399.9 640 409.8 640 419.8z"],"lungs-virus":[640,512,[],"e067","M195.5 444.5c-18.71-18.72-18.71-49.16 .0033-67.87l8.576-8.576H192c-26.47 0-48-21.53-48-48c0-26.47 21.53-48 48-48l12.12-.0055L195.5 263.4c-18.71-18.72-18.71-49.16 0-67.88C204.6 186.5 216.7 181.5 229.5 181.5c9.576 0 18.72 2.799 26.52 7.986l.04-27.75c0-36.38-31.42-65.72-70.05-65.72c-44 0-57.97 28.5-80.09 63.13c-46 71.88-80.39 149.8-102 231C1.257 399.9 0 409.8 0 419.8c0 61.25 62.5 105.5 125.3 88.62l59.5-15.9c21.74-5.867 39.91-18.39 52.51-34.73c-2.553 .4141-5.137 .7591-7.774 .7591C216.7 458.5 204.6 453.5 195.5 444.5zM343.1 150.7L344 16C344 7.125 336.9 0 328 0h-16c-8.875 0-16 7.125-16 16L295.1 150.7c7.088-4.133 15.22-6.675 23.1-6.675S336.9 146.5 343.1 150.7zM421.8 421.8c6.25-6.25 6.25-16.37 0-22.62l-8.576-8.576c-20.16-20.16-5.881-54.63 22.63-54.63H448c8.844 0 16-7.156 16-16c0-8.844-7.156-16-16-16h-12.12c-28.51 0-42.79-34.47-22.63-54.63l8.576-8.577c6.25-6.25 6.25-16.37 0-22.62s-16.38-6.25-22.62 0l-8.576 8.577C370.5 246.9 336 232.6 336 204.1v-12.12c0-8.844-7.156-15.1-16-15.1s-16 7.156-16 15.1v12.12c0 28.51-34.47 42.79-54.63 22.63L240.8 218.2c-6.25-6.25-16.38-6.25-22.62 0s-6.25 16.37 0 22.62l8.576 8.577c20.16 20.16 5.881 54.63-22.63 54.63H192c-8.844 0-16 7.156-16 16c0 8.844 7.156 16 16 16h12.12c28.51 0 42.79 34.47 22.63 54.63l-8.576 8.576c-6.25 6.25-6.25 16.37 0 22.62c3.125 3.125 7.219 4.688 11.31 4.688s8.188-1.562 11.31-4.688l8.576-8.575C269.5 393.1 304 407.4 304 435.9v12.12c0 8.844 7.156 16 16 16s16-7.156 16-16v-12.12c0-28.51 34.47-42.79 54.63-22.63l8.576 8.575c3.125 3.125 7.219 4.688 11.31 4.688S418.7 424.9 421.8 421.8zM288 303.1c-8.836 0-16-7.162-16-15.1S279.2 271.1 288 271.1S304 279.2 304 287.1S296.8 303.1 288 303.1zM352 367.1c-8.836 0-16-7.166-16-16s7.164-15.1 16-15.1s16 7.166 16 16S360.8 367.1 352 367.1zM636.1 390.1c-21.62-81.25-56.02-159.1-102-231c-22.12-34.63-36.09-63.13-80.09-63.13c-38.62 0-70.01 29.35-70.01 65.73v27.74c7.795-5.188 16.94-7.986 26.52-7.986c12.82 0 24.88 4.999 33.95 14.07c18.71 18.72 18.71 49.16 0 67.88l-8.576 8.571L448 272c26.47 0 48 21.54 48 48c0 26.47-21.53 48-48 48h-12.12l8.576 8.576c18.71 18.72 18.71 49.16-.0072 67.87c-9.066 9.066-21.12 14.06-33.94 14.06c-2.637 0-5.211-.3438-7.764-.7578c12.6 16.34 30.77 28.86 52.51 34.73l59.5 15.9C577.5 525.3 640 481 640 419.8C640 409.8 638.7 399.9 636.1 390.1z"],m:[448,512,[109],"4d","M448 64.01v384c0 17.67-14.31 32-32 32s-32-14.33-32-32V169.7l-133.4 200.1c-11.88 17.81-41.38 17.81-53.25 0L64 169.7v278.3c0 17.67-14.31 32-32 32s-32-14.33-32-32v-384c0-14.09 9.219-26.55 22.72-30.63c13.47-4.156 28.09 1.141 35.91 12.88L224 294.3l165.4-248.1c7.812-11.73 22.47-17.03 35.91-12.88C438.8 37.47 448 49.92 448 64.01z"],magnet:[448,512,[129522],"f076","M128 160V256C128 309 170.1 352 224 352C277 352 320 309 320 256V160H448V256C448 379.7 347.7 480 224 480C100.3 480 0 379.7 0 256V160H128zM0 64C0 46.33 14.33 32 32 32H96C113.7 32 128 46.33 128 64V128H0V64zM320 64C320 46.33 334.3 32 352 32H416C433.7 32 448 46.33 448 64V128H320V64z"],"magnifying-glass":[512,512,[128269,"search"],"f002","M500.3 443.7l-119.7-119.7c27.22-40.41 40.65-90.9 33.46-144.7C401.8 87.79 326.8 13.32 235.2 1.723C99.01-15.51-15.51 99.01 1.724 235.2c11.6 91.64 86.08 166.7 177.6 178.9c53.8 7.189 104.3-6.236 144.7-33.46l119.7 119.7c15.62 15.62 40.95 15.62 56.57 0C515.9 484.7 515.9 459.3 500.3 443.7zM79.1 208c0-70.58 57.42-128 128-128s128 57.42 128 128c0 70.58-57.42 128-128 128S79.1 278.6 79.1 208z"],"magnifying-glass-arrow-right":[512,512,[],"e521","M416 208C416 253.9 401.1 296.3 375.1 330.7L502.6 457.4C515.1 469.9 515.1 490.1 502.6 502.6C490.1 515.1 469.9 515.1 457.4 502.6L330.7 375.1C296.3 401.1 253.9 416 208 416C93.12 416 0 322.9 0 208C0 93.12 93.12 0 208 0C322.9 0 416 93.12 416 208zM240.1 119C231.6 109.7 216.4 109.7 207 119C197.7 128.4 197.7 143.6 207 152.1L238.1 184H120C106.7 184 96 194.7 96 208C96 221.3 106.7 232 120 232H238.1L207 263C197.7 272.4 197.7 287.6 207 296.1C216.4 306.3 231.6 306.3 240.1 296.1L312.1 224.1C322.3 215.6 322.3 200.4 312.1 191L240.1 119z"],"magnifying-glass-chart":[512,512,[],"e522","M416 208C416 253.9 401.1 296.3 375.1 330.7L502.6 457.4C515.1 469.9 515.1 490.1 502.6 502.6C490.1 515.1 469.9 515.1 457.4 502.6L330.7 375.1C296.3 401.1 253.9 416 208 416C93.12 416 0 322.9 0 208C0 93.12 93.12 0 208 0C322.9 0 416 93.12 416 208zM104 280C104 293.3 114.7 304 128 304C141.3 304 152 293.3 152 280V216C152 202.7 141.3 192 128 192C114.7 192 104 202.7 104 216V280zM184 280C184 293.3 194.7 304 208 304C221.3 304 232 293.3 232 280V120C232 106.7 221.3 96 208 96C194.7 96 184 106.7 184 120V280zM264 280C264 293.3 274.7 304 288 304C301.3 304 312 293.3 312 280V184C312 170.7 301.3 160 288 160C274.7 160 264 170.7 264 184V280z"],"magnifying-glass-dollar":[512,512,["search-dollar"],"f688","M500.3 443.7l-119.7-119.7c27.22-40.41 40.65-90.9 33.46-144.7c-12.23-91.55-87.28-166-178.9-177.6c-136.2-17.24-250.7 97.28-233.4 233.4c11.6 91.64 86.07 166.7 177.6 178.9c53.81 7.191 104.3-6.235 144.7-33.46l119.7 119.7c15.62 15.62 40.95 15.62 56.57 .0004C515.9 484.7 515.9 459.3 500.3 443.7zM273.7 253.8C269.8 276.4 252.6 291.3 228 296.1V304c0 11.03-8.953 20-20 20S188 315 188 304V295.2C178.2 293.2 168.4 289.9 159.6 286.8L154.8 285.1C144.4 281.4 138.9 269.9 142.6 259.5C146.2 249.1 157.6 243.7 168.1 247.3l5.062 1.812c8.562 3.094 18.25 6.562 25.91 7.719c16.23 2.5 33.47-.0313 35.17-9.812c1.219-7.094 .4062-10.62-31.8-19.84L196.2 225.4C177.8 219.1 134.5 207.3 142.3 162.2C146.2 139.6 163.5 124.8 188 120V112c0-11.03 8.953-20 20-20S228 100.1 228 112v8.695c6.252 1.273 13.06 3.07 21.47 5.992c10.42 3.625 15.95 15.03 12.33 25.47C258.2 162.6 246.8 168.1 236.3 164.5C228.2 161.7 221.8 159.9 216.8 159.2c-16.11-2.594-33.38 .0313-35.08 9.812c-1 5.812-1.719 10 25.7 18.03l6 1.719C238.9 196 281.5 208.2 273.7 253.8z"],"magnifying-glass-location":[512,512,["search-location"],"f689","M236 176c0 15.46-12.54 28-28 28S180 191.5 180 176S192.5 148 208 148S236 160.5 236 176zM500.3 500.3c-15.62 15.62-40.95 15.62-56.57 0l-119.7-119.7c-40.41 27.22-90.9 40.65-144.7 33.46c-91.55-12.23-166-87.28-177.6-178.9c-17.24-136.2 97.29-250.7 233.4-233.4c91.64 11.6 166.7 86.07 178.9 177.6c7.19 53.8-6.236 104.3-33.46 144.7l119.7 119.7C515.9 459.3 515.9 484.7 500.3 500.3zM294.1 182.2C294.1 134.5 255.6 96 207.1 96C160.4 96 121.9 134.5 121.9 182.2c0 38.35 56.29 108.5 77.87 134C201.8 318.5 204.7 320 207.1 320c3.207 0 6.26-1.459 8.303-3.791C237.8 290.7 294.1 220.5 294.1 182.2z"],"magnifying-glass-minus":[512,512,["search-minus"],"f010","M500.3 443.7l-119.7-119.7c27.22-40.41 40.65-90.9 33.46-144.7c-12.23-91.55-87.28-166-178.9-177.6c-136.2-17.24-250.7 97.28-233.4 233.4c11.6 91.64 86.07 166.7 177.6 178.9c53.81 7.191 104.3-6.235 144.7-33.46l119.7 119.7c15.62 15.62 40.95 15.62 56.57 .0003C515.9 484.7 515.9 459.3 500.3 443.7zM288 232H127.1C114.7 232 104 221.3 104 208s10.74-24 23.1-24h160C301.3 184 312 194.7 312 208S301.3 232 288 232z"],"magnifying-glass-plus":[512,512,["search-plus"],"f00e","M500.3 443.7l-119.7-119.7c27.22-40.41 40.65-90.9 33.46-144.7c-12.23-91.55-87.28-166-178.9-177.6c-136.2-17.24-250.7 97.28-233.4 233.4c11.6 91.64 86.07 166.7 177.6 178.9c53.81 7.191 104.3-6.235 144.7-33.46l119.7 119.7c15.62 15.62 40.95 15.62 56.57 .0003C515.9 484.7 515.9 459.3 500.3 443.7zM288 232H231.1V288c0 13.26-10.74 24-23.1 24C194.7 312 184 301.3 184 288V232H127.1C114.7 232 104 221.3 104 208s10.74-24 23.1-24H184V128c0-13.26 10.74-24 23.1-24S231.1 114.7 231.1 128v56h56C301.3 184 312 194.7 312 208S301.3 232 288 232z"],"manat-sign":[384,512,[],"e1d5","M224 64V98.65C314.8 113.9 384 192.9 384 288V448C384 465.7 369.7 480 352 480C334.3 480 320 465.7 320 448V288C320 228.4 279.2 178.2 224 164V448C224 465.7 209.7 480 192 480C174.3 480 160 465.7 160 448V164C104.8 178.2 64 228.4 64 288V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V288C0 192.9 69.19 113.9 160 98.65V64C160 46.33 174.3 32 192 32C209.7 32 224 46.33 224 64z"],map:[576,512,[62072,128506],"f279","M384 476.1L192 421.2V35.93L384 90.79V476.1zM416 88.37L543.1 37.53C558.9 31.23 576 42.84 576 59.82V394.6C576 404.4 570 413.2 560.9 416.9L416 474.8V88.37zM15.09 95.13L160 37.17V423.6L32.91 474.5C17.15 480.8 0 469.2 0 452.2V117.4C0 107.6 5.975 98.78 15.09 95.13V95.13z"],"map-location":[576,512,["map-marked"],"f59f","M273.2 311.1C241.1 271.9 167.1 174.6 167.1 120C167.1 53.73 221.7 0 287.1 0C354.3 0 408 53.73 408 120C408 174.6 334.9 271.9 302.8 311.1C295.1 321.6 280.9 321.6 273.2 311.1V311.1zM416 503V200.4C419.5 193.5 422.7 186.7 425.6 179.8C426.1 178.6 426.6 177.4 427.1 176.1L543.1 129.7C558.9 123.4 576 135 576 152V422.8C576 432.6 570 441.4 560.9 445.1L416 503zM15.09 187.3L137.6 138.3C140 152.5 144.9 166.6 150.4 179.8C153.3 186.7 156.5 193.5 160 200.4V451.8L32.91 502.7C17.15 508.1 0 497.4 0 480.4V209.6C0 199.8 5.975 190.1 15.09 187.3H15.09zM384 504.3L191.1 449.4V255C212.5 286.3 234.3 314.6 248.2 331.1C268.7 357.6 307.3 357.6 327.8 331.1C341.7 314.6 363.5 286.3 384 255L384 504.3z"],"map-location-dot":[576,512,["map-marked-alt"],"f5a0","M408 120C408 174.6 334.9 271.9 302.8 311.1C295.1 321.6 280.9 321.6 273.2 311.1C241.1 271.9 168 174.6 168 120C168 53.73 221.7 0 288 0C354.3 0 408 53.73 408 120zM288 152C310.1 152 328 134.1 328 112C328 89.91 310.1 72 288 72C265.9 72 248 89.91 248 112C248 134.1 265.9 152 288 152zM425.6 179.8C426.1 178.6 426.6 177.4 427.1 176.1L543.1 129.7C558.9 123.4 576 135 576 152V422.8C576 432.6 570 441.4 560.9 445.1L416 503V200.4C419.5 193.5 422.7 186.7 425.6 179.8zM150.4 179.8C153.3 186.7 156.5 193.5 160 200.4V451.8L32.91 502.7C17.15 508.1 0 497.4 0 480.4V209.6C0 199.8 5.975 190.1 15.09 187.3L137.6 138.3C140 152.5 144.9 166.6 150.4 179.8H150.4zM327.8 331.1C341.7 314.6 363.5 286.3 384 255V504.3L192 449.4V255C212.5 286.3 234.3 314.6 248.2 331.1C268.7 357.6 307.3 357.6 327.8 331.1L327.8 331.1z"],"map-pin":[320,512,[128205],"f276","M320 144C320 223.5 255.5 288 176 288C96.47 288 32 223.5 32 144C32 64.47 96.47 0 176 0C255.5 0 320 64.47 320 144zM192 64C192 55.16 184.8 48 176 48C122.1 48 80 90.98 80 144C80 152.8 87.16 160 96 160C104.8 160 112 152.8 112 144C112 108.7 140.7 80 176 80C184.8 80 192 72.84 192 64zM144 480V317.1C154.4 319 165.1 319.1 176 319.1C186.9 319.1 197.6 319 208 317.1V480C208 497.7 193.7 512 176 512C158.3 512 144 497.7 144 480z"],marker:[512,512,[],"f5a1","M480.1 160.1L316.3 325.7L186.3 195.7L302.1 80L288.1 66.91C279.6 57.54 264.4 57.54 255 66.91L168.1 152.1C159.6 162.3 144.4 162.3 135 152.1C125.7 143.6 125.7 128.4 135 119L221.1 32.97C249.2 4.853 294.8 4.853 322.9 32.97L336 46.06L351 31.03C386.9-4.849 445.1-4.849 480.1 31.03C516.9 66.91 516.9 125.1 480.1 160.1V160.1zM229.5 412.5C181.5 460.5 120.3 493.2 53.7 506.5L28.71 511.5C20.84 513.1 12.7 510.6 7.03 504.1C1.356 499.3-1.107 491.2 .4662 483.3L5.465 458.3C18.78 391.7 51.52 330.5 99.54 282.5L163.7 218.3L293.7 348.3L229.5 412.5z"],mars:[448,512,[9794],"f222","M431.1 31.1l-112.6 0c-21.42 0-32.15 25.85-17 40.97l29.61 29.56l-56.65 56.55c-30.03-20.66-65.04-31-100-31c-47.99-.002-95.96 19.44-131.1 58.39c-60.86 67.51-58.65 175 4.748 240.1C83.66 462.2 129.6 480 175.5 480c45.12 0 90.34-17.18 124.8-51.55c61.11-60.99 67.77-155.6 20.42-224.1l56.65-56.55l29.61 29.56C411.9 182.2 417.9 184.4 423.8 184.4C436.1 184.4 448 174.8 448 160.4V47.1C448 39.16 440.8 31.1 431.1 31.1zM243.5 371.9c-18.75 18.71-43.38 28.07-68 28.07c-24.63 0-49.25-9.355-68.01-28.07c-37.5-37.43-37.5-98.33 0-135.8c18.75-18.71 43.38-28.07 68.01-28.07c24.63 0 49.25 9.357 68 28.07C281 273.5 281 334.5 243.5 371.9z"],"mars-and-venus":[512,512,[9893],"f224","M480 .0002l-112.4 .0001c-21.38 0-32.09 25.85-16.97 40.97l29.56 29.56l-27.11 27.11C326.1 76.85 292.7 64 256 64c-88.37 0-160 71.63-160 160c0 77.4 54.97 141.9 128 156.8v19.22H192c-8.836 0-16 7.162-16 16v31.1c0 8.836 7.164 16 16 16l32 .0001v32c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16v-32l32-.0001c8.838 0 16-7.164 16-16v-31.1c0-8.838-7.162-16-16-16h-32v-19.22c73.03-14.83 128-79.37 128-156.8c0-28.38-8.018-54.65-20.98-77.77l30.45-30.45l29.56 29.56C470.1 160.5 496 149.8 496 128.4V16C496 7.164 488.8 .0002 480 .0002zM256 304c-44.11 0-80-35.89-80-80c0-44.11 35.89-80 80-80c44.11 0 80 35.89 80 80C336 268.1 300.1 304 256 304z"],"mars-and-venus-burst":[640,512,[],"e523","M607.1 0C625.7 0 639.1 14.33 639.1 32V120C639.1 137.7 625.7 152 607.1 152C590.3 152 575.1 137.7 575.1 120V109.3L539.6 145.7C552.6 168.8 559.1 195.6 559.1 224C559.1 301.4 505 365.1 431.1 380.8V400H447.1C465.7 400 479.1 414.3 479.1 432C479.1 449.7 465.7 464 447.1 464H431.1V480C431.1 497.7 417.7 512 399.1 512C382.3 512 367.1 497.7 367.1 480V464H351.1C334.3 464 319.1 449.7 319.1 432C319.1 414.3 334.3 400 351.1 400H367.1V380.8C294.1 365.1 239.1 301.4 239.1 224C239.1 135.6 311.6 64 399.1 64C436.7 64 470.6 76.37 497.6 97.18L530.7 64H511.1C494.3 64 479.1 49.67 479.1 32C479.1 14.33 494.3 0 511.1 0L607.1 0zM399.1 128C346.1 128 303.1 170.1 303.1 224C303.1 277 346.1 320 399.1 320C453 320 495.1 277 495.1 224C495.1 170.1 453 128 399.1 128zM220.3 92.05L280.4 73.81C236.3 108.1 207.1 163.2 207.1 224C207.1 269.2 223.6 310.8 249.8 343.6C244.5 345 238.7 343.7 234.6 339.9L175.1 286.1L117.4 339.9C112.6 344.4 105.5 345.4 99.63 342.6C93.73 339.7 90.15 333.6 90.62 327L96.21 247.6L17.55 235.4C11.08 234.4 5.868 229.6 4.41 223.2C2.951 216.8 5.538 210.1 10.94 206.4L76.5 161.3L37.01 92.18C33.76 86.49 34.31 79.39 38.39 74.27C42.48 69.14 49.28 67.03 55.55 68.93L131.7 92.05L161.1 18.09C163.6 11.1 169.4 7.1 175.1 7.1C182.6 7.1 188.4 11.1 190.9 18.09L220.3 92.05z"],"mars-double":[640,512,[9891],"f227","M320.7 204.3l56.65-56.55l29.61 29.56C422.1 192.5 448 181.7 448 160.4V47.1c0-8.838-7.176-15.1-16.03-15.1H319.4c-21.42 0-32.15 25.85-17 40.97l29.61 29.56L275.4 159.1c-71.21-48.99-170.4-39.96-231.1 27.39c-60.86 67.51-58.65 175 4.748 240.1c68.7 70.57 181.8 71.19 251.3 1.847C361.4 367.5 368 272.9 320.7 204.3zM243.5 371.9c-37.5 37.43-98.51 37.43-136 0s-37.5-98.33 0-135.8c37.5-37.43 98.51-37.43 136 0C281 273.5 281 334.5 243.5 371.9zM623.1 32h-112.6c-21.42 0-32.15 25.85-17 40.97l29.61 29.56L480 146.5v13.91C480 191.3 454.8 216.4 423.8 216.4C421.2 216.4 418.6 216 416 215.6v5.862c6.922 4.049 13.58 8.691 19.51 14.61c37.5 37.43 37.5 98.33 0 135.8c-18.75 18.71-43.38 28.07-68 28.07c-2.277 0-4.523-.4883-6.795-.6484c-9.641 18.69-22.1 36.24-37.64 51.77c-6.059 6.059-12.49 11.53-19.13 16.73C324.4 475.7 345.9 480 367.5 480c45.12 0 90.34-17.18 124.8-51.55c61.11-60.99 67.77-155.6 20.42-224.1l56.65-56.55l29.61 29.56c4.898 4.889 10.92 7.075 16.83 7.075C628.1 184.4 640 174.8 640 160.4V48C640 39.16 632.8 32 623.1 32z"],"mars-stroke":[512,512,[9894],"f229","M496 .0002l-112.4 .0001c-21.38 0-32.09 25.85-16.97 40.97l29.56 29.56l-24.33 24.34l-33.94-33.94c-6.248-6.25-16.38-6.248-22.63 0l-22.63 22.63c-6.25 6.25-6.25 16.38 0 22.63l33.94 33.94l-18.96 18.96C239.1 111.8 144.5 118.6 83.55 179.5c-68.73 68.73-68.73 180.2 0 248.9c68.73 68.73 180.2 68.73 248.9 0c60.99-60.99 67.73-155.6 20.47-224.1l18.96-18.96l33.94 33.94c6.248 6.248 16.38 6.25 22.63 0l22.63-22.63c6.248-6.248 6.248-16.38 0-22.63l-33.94-33.94l24.34-24.33l29.56 29.56C486.1 160.5 512 149.8 512 128.4v-112.4C512 7.162 504.8 .0002 496 .0002zM275.9 371.9c-37.43 37.43-98.33 37.43-135.8 0c-37.43-37.43-37.43-98.33 0-135.8c37.43-37.43 98.33-37.43 135.8 0C313.3 273.5 313.3 334.5 275.9 371.9z"],"mars-stroke-right":[640,512,[9897,"mars-stroke-h"],"f22b","M619.3 244.7l-82.34-77.61c-15.12-15.12-40.97-4.41-40.97 16.97V223.1L463.1 224V176c.002-8.838-7.162-16-15.1-16h-32c-8.84 0-16 7.16-16 16V224h-19.05c-15.07-81.9-86.7-144-172.1-144C110.8 80 32 158.8 32 256c0 97.2 78.8 176 176 176c86.26 0 157.9-62.1 172.1-144h19.05V336c0 8.836 7.162 16 16 16h32c8.836 0 15.1-7.164 15.1-16V287.1L496 288v39.95c0 21.38 25.85 32.09 40.97 16.97l82.34-77.61C625.6 261.1 625.6 250.9 619.3 244.7zM208 352c-52.94 0-96-43.07-96-96c-.002-52.94 43.06-96 96-96c52.93 0 95.1 43.06 95.1 96C304 308.9 260.9 352 208 352z"],"mars-stroke-up":[384,512,[9896,"mars-stroke-v"],"f22a","M224 163V144h24c4.418 0 8-3.578 8-7.1V120c0-4.418-3.582-7.1-8-7.1H224V96h24.63c16.41 0 24.62-19.84 13.02-31.44l-60.97-60.97c-4.795-4.793-12.57-4.793-17.36 0L122.3 64.56c-11.6 11.6-3.383 31.44 13.02 31.44H160v15.1H136c-4.418 0-8 3.582-8 7.1v15.1c0 4.422 3.582 7.1 8 7.1H160v19.05c-84.9 15.62-148.5 92.01-143.7 182.5c4.783 90.69 82.34 165.1 173.2 166.5C287.8 513.4 368 434.1 368 336C368 249.7 305.9 178.1 224 163zM192 431.1c-52.94 0-96-43.06-96-95.1s43.06-95.1 96-95.1c52.93 0 96 43.06 96 95.1S244.9 431.1 192 431.1z"],"martini-glass":[512,512,[127864,"glass-martini-alt"],"f57b","M502 57.63C523.3 36.38 508.3 0 478.3 0H33.72C3.711 0-11.29 36.38 9.962 57.63l214 214V448H175.1c-26.51 0-47.1 21.49-47.1 48c0 8.836 7.164 16 16 16h224c8.836 0 16-7.164 16-16c0-26.51-21.49-48-48-48h-47.1V271.6L502 57.63zM405.1 64l-64.01 64H170.9L106.9 64H405.1z"],"martini-glass-citrus":[576,512,["cocktail"],"f561","M288 464H240v-125.3l168.8-168.7C424.3 154.5 413.3 128 391.4 128H24.63C2.751 128-8.249 154.5 7.251 170l168.7 168.7V464H128c-17.67 0-32 14.33-32 32c0 8.836 7.164 16 15.1 16h191.1c8.836 0 15.1-7.164 15.1-16C320 478.3 305.7 464 288 464zM432 0c-62.63 0-115.4 40.25-135.1 96h52.5c16.62-28.5 47.25-48 82.62-48c52.88 0 95.1 43 95.1 96s-43.12 96-95.1 96c-14 0-27.25-3.25-39.37-8.625l-35.25 35.25c21.88 13.25 47.25 21.38 74.62 21.38c79.5 0 143.1-64.5 143.1-144S511.5 0 432 0z"],"martini-glass-empty":[512,512,["glass-martini"],"f000","M502 57.63C523.3 36.38 508.3 0 478.3 0H33.72C3.711 0-11.29 36.38 9.962 57.63l214 214V448H176c-26.51 0-48 21.49-48 48c0 8.836 7.164 16 16 16h224c8.836 0 16-7.164 16-16c0-26.51-21.49-48-47.1-48h-47.1V271.6L502 57.63zM256 213.1L106.9 64h298.3L256 213.1z"],mask:[576,512,[],"f6fa","M288 64C39.52 64 0 182.1 0 273.5C0 379.5 78.8 448 176 448c27.33 0 51.21-6.516 66.11-36.79l19.93-40.5C268.3 358.6 278.1 352.4 288 352.1c9.9 .3711 19.7 6.501 25.97 18.63l19.93 40.5C348.8 441.5 372.7 448 400 448c97.2 0 176-68.51 176-174.5C576 182.1 536.5 64 288 64zM160 320c-35.35 0-64-28.65-64-64s28.65-64 64-64c35.35 0 64 28.65 64 64S195.3 320 160 320zM416 320c-35.35 0-64-28.65-64-64s28.65-64 64-64c35.35 0 64 28.65 64 64S451.3 320 416 320z"],"mask-face":[640,512,[],"e1d7","M396.4 87.12L433.5 111.9C449.3 122.4 467.8 128 486.8 128H584C614.9 128 640 153.1 640 184V269C640 324.1 602.5 372.1 549.1 385.5L441.1 412.5C406.2 434.1 364.6 448 320 448C275.4 448 233.8 434.1 198.9 412.5L90.9 385.5C37.48 372.1 0 324.1 0 269V184C0 153.1 25.07 128 56 128H153.2C172.2 128 190.7 122.4 206.5 111.9L243.6 87.12C266.2 72.05 292.8 64 320 64C347.2 64 373.8 72.05 396.4 87.12zM132.3 346.3C109.4 311.2 96 269.1 96 224V176H56C51.58 176 48 179.6 48 184V269C48 302.1 70.49 330.9 102.5 338.9L132.3 346.3zM592 269V184C592 179.6 588.4 176 584 176H544V224C544 269.1 530.6 311.2 507.7 346.3L537.5 338.9C569.5 330.9 592 302.1 592 269H592zM208 224H432C440.8 224 448 216.8 448 208C448 199.2 440.8 192 432 192H208C199.2 192 192 199.2 192 208C192 216.8 199.2 224 208 224zM208 256C199.2 256 192 263.2 192 272C192 280.8 199.2 288 208 288H432C440.8 288 448 280.8 448 272C448 263.2 440.8 256 432 256H208zM240 352H400C408.8 352 416 344.8 416 336C416 327.2 408.8 320 400 320H240C231.2 320 224 327.2 224 336C224 344.8 231.2 352 240 352z"],"mask-ventilator":[640,512,[],"e524","M320 32C372.1 32 419.7 73.8 454.5 128H584C614.9 128 640 153.1 640 184V269C640 324.1 602.5 372.1 549.1 385.5L477.5 403.4C454.6 433.8 421.1 457.2 384 469.8V393.2C403.6 376.8 416 353.1 416 326.4C416 276.9 372.5 191.1 320 191.1C267 191.1 224 276.9 224 326.4C224 353 236.3 376.9 256 393.3V469.9C217.6 457.4 184.9 433.8 162.2 403.3L90.9 385.5C37.48 372.1 0 324.1 0 269V184C0 153.1 25.07 128 56 128H185.1C219.8 73.8 267.4 32 320 32V32zM56 176C51.58 176 48 179.6 48 184V269C48 302.1 70.49 330.9 102.5 338.9L134.3 346.8C130.2 332.2 127.1 316.7 127.1 300.8C127.1 264.7 139.4 219.2 159.1 176H56zM480.7 176C500.4 219.2 512 264.7 512 300.8C512 316.8 509.8 332.2 505.6 346.9L537.5 338.9C569.5 330.9 592 302.1 592 269V184C592 179.6 588.4 176 584 176H480.7zM288 320C288 302.3 302.3 288 320 288C337.7 288 352 302.3 352 320V512H288V320z"],"masks-theater":[640,512,[127917,"theater-masks"],"f630","M206.9 245.1C171 255.6 146.8 286.4 149.3 319.3C160.7 306.5 178.1 295.5 199.3 288.4L206.9 245.1zM95.78 294.9L64.11 115.5C63.74 113.9 64.37 112.9 64.37 112.9c57.75-32.13 123.1-48.99 189-48.99c1.625 0 3.113 .0745 4.738 .0745c13.1-13.5 31.75-22.75 51.62-26c18.87-3 38.12-4.5 57.25-5.25c-9.999-14-24.47-24.27-41.84-27.02c-23.87-3.875-47.9-5.732-71.77-5.732c-76.74 0-152.4 19.45-220.1 57.07C9.021 70.57-3.853 98.5 1.021 126.6L32.77 306c14.25 80.5 136.3 142 204.5 142c3.625 0 6.777-.2979 10.03-.6729c-13.5-17.13-28.1-40.5-39.5-67.63C160.1 366.8 101.7 328 95.78 294.9zM193.4 157.6C192.6 153.4 191.1 149.7 189.3 146.2c-8.249 8.875-20.62 15.75-35.25 18.37c-14.62 2.5-28.75 .376-39.5-5.249c-.5 4-.6249 7.998 .125 12.12c3.75 21.75 24.5 36.24 46.25 32.37C182.6 200.1 197.3 179.3 193.4 157.6zM606.8 121c-88.87-49.38-191.4-67.38-291.9-51.38C287.5 73.1 265.8 95.85 260.8 123.1L229 303.5c-15.37 87.13 95.33 196.3 158.3 207.3c62.1 11.13 204.5-53.68 219.9-140.8l31.75-179.5C643.9 162.3 631 134.4 606.8 121zM333.5 217.8c3.875-21.75 24.62-36.25 46.37-32.37c21.75 3.75 36.25 24.49 32.5 46.12c-.7499 4.125-2.25 7.873-4.125 11.5c-8.249-9-20.62-15.75-35.25-18.37c-14.75-2.625-28.75-.3759-39.5 5.124C332.1 225.9 332.9 221.9 333.5 217.8zM403.1 416.5c-55.62-9.875-93.49-59.23-88.99-112.1c20.62 25.63 56.25 46.24 99.49 53.87c43.25 7.625 83.74 .3781 111.9-16.62C512.2 392.7 459.7 426.3 403.1 416.5zM534.4 265.2c-8.249-8.875-20.75-15.75-35.37-18.37c-14.62-2.5-28.62-.3759-39.5 5.249c-.5-4-.625-7.998 .125-12.12c3.875-21.75 24.62-36.25 46.37-32.37c21.75 3.875 36.25 24.49 32.37 46.24C537.6 257.9 536.1 261.7 534.4 265.2z"],"mattress-pillow":[640,512,[],"e525","M256 448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H256V448zM64 352C64 369.7 78.33 384 96 384H160C177.7 384 192 369.7 192 352V160C192 142.3 177.7 128 160 128H96C78.33 128 64 142.3 64 160V352zM288 64H576C611.3 64 640 92.65 640 128V384C640 419.3 611.3 448 576 448H288V64z"],maximize:[448,512,["expand-arrows-alt"],"f31e","M447.1 319.1v135.1c0 13.26-10.75 23.1-23.1 23.1h-135.1c-12.94 0-24.61-7.781-29.56-19.75c-4.906-11.1-2.203-25.72 6.937-34.87l30.06-30.06L224 323.9l-71.43 71.44l30.06 30.06c9.156 9.156 11.91 22.91 6.937 34.87C184.6 472.2 172.9 479.1 160 479.1H24c-13.25 0-23.1-10.74-23.1-23.1v-135.1c0-12.94 7.781-24.61 19.75-29.56C23.72 288.8 27.88 288 32 288c8.312 0 16.5 3.242 22.63 9.367l30.06 30.06l71.44-71.44L84.69 184.6L54.63 214.6c-9.156 9.156-22.91 11.91-34.87 6.937C7.798 216.6 .0013 204.9 .0013 191.1v-135.1c0-13.26 10.75-23.1 23.1-23.1h135.1c12.94 0 24.61 7.781 29.56 19.75C191.2 55.72 191.1 59.87 191.1 63.1c0 8.312-3.237 16.5-9.362 22.63L152.6 116.7l71.44 71.44l71.43-71.44l-30.06-30.06c-9.156-9.156-11.91-22.91-6.937-34.87c4.937-11.95 16.62-19.75 29.56-19.75h135.1c13.26 0 23.1 10.75 23.1 23.1v135.1c0 12.94-7.781 24.61-19.75 29.56c-11.1 4.906-25.72 2.203-34.87-6.937l-30.06-30.06l-71.43 71.43l71.44 71.44l30.06-30.06c9.156-9.156 22.91-11.91 34.87-6.937C440.2 295.4 447.1 307.1 447.1 319.1z"],medal:[512,512,[127941],"f5a2","M223.7 130.8L149.1 7.77C147.1 2.949 141.9 0 136.3 0H16.03c-12.95 0-20.53 14.58-13.1 25.18l111.3 158.9C143.9 156.4 181.7 137.3 223.7 130.8zM256 160c-97.25 0-176 78.75-176 176S158.8 512 256 512s176-78.75 176-176S353.3 160 256 160zM348.5 317.3l-37.88 37l8.875 52.25c1.625 9.25-8.25 16.5-16.63 12l-46.88-24.62L209.1 418.5c-8.375 4.5-18.25-2.75-16.63-12l8.875-52.25l-37.88-37C156.6 310.6 160.5 299 169.9 297.6l52.38-7.625L245.7 242.5c2-4.25 6.125-6.375 10.25-6.375S264.2 238.3 266.2 242.5l23.5 47.5l52.38 7.625C351.6 299 355.4 310.6 348.5 317.3zM495.1 0H375.7c-5.621 0-10.83 2.949-13.72 7.77l-73.76 122.1c42 6.5 79.88 25.62 109.5 53.38l111.3-158.9C516.5 14.58 508.9 0 495.1 0z"],memory:[576,512,[],"f538","M0 448h80v-32c0-8.838 7.164-16 16-16c8.838 0 16 7.162 16 16v32h96v-32c0-8.838 7.164-16 16-16c8.838 0 16 7.162 16 16v32h96v-32c0-8.838 7.164-16 16-16c8.838 0 16 7.162 16 16v32h96v-32c0-8.838 7.164-16 16-16c8.838 0 16 7.162 16 16v32H576v-96H0V448zM576 146.9V112C576 85.49 554.5 64 528 64h-480C21.49 64 0 85.49 0 112v34.94C18.6 153.5 32 171.1 32 192S18.6 230.5 0 237.1V320h576V237.1C557.4 230.5 544 212.9 544 192S557.4 153.5 576 146.9zM192 240C192 248.8 184.8 256 176 256h-32C135.2 256 128 248.8 128 240v-96C128 135.2 135.2 128 144 128h32C184.8 128 192 135.2 192 144V240zM320 240C320 248.8 312.8 256 304 256h-32C263.2 256 256 248.8 256 240v-96C256 135.2 263.2 128 272 128h32C312.8 128 320 135.2 320 144V240zM448 240C448 248.8 440.8 256 432 256h-32C391.2 256 384 248.8 384 240v-96C384 135.2 391.2 128 400 128h32C440.8 128 448 135.2 448 144V240z"],menorah:[640,512,[],"f676","M544 144C544 135.1 536.9 128 528 128h-32C487.1 128 480 135.1 480 144V288h64V144zM416 95.1c17.62 0 32-14.38 32-32s-32-63.1-32-63.1s-32 46.37-32 63.1S398.4 95.1 416 95.1zM448 144C448 135.1 440.9 128 432 128h-32C391.1 128 384 135.1 384 144V288h64V144zM608 95.1c17.62 0 32-14.38 32-32s-32-63.1-32-63.1s-32 46.37-32 63.1S590.4 95.1 608 95.1zM320 95.1c17.62 0 32-14.38 32-32s-32-63.1-32-63.1S288 46.37 288 63.1S302.4 95.1 320 95.1zM512 95.1c17.62 0 32-14.38 32-32s-32-63.1-32-63.1s-32 46.37-32 63.1S494.4 95.1 512 95.1zM624 128h-32C583.2 128 576 135.2 576 144V288c0 17.6-14.4 32-32 32h-192V144C352 135.2 344.8 128 336 128h-32C295.2 128 288 135.2 288 144V320H96c-17.6 0-32-14.4-32-32V144C64 135.2 56.84 128 48 128h-32C7.164 128 0 135.2 0 144V288c0 53.02 42.98 96 96 96h192v64H176C149.5 448 128 469.5 128 496C128 504.8 135.2 512 144 512h352c8.836 0 16-7.164 16-16c0-26.51-21.49-48-48-48H352v-64h192c53.02 0 96-42.98 96-96V144C640 135.2 632.8 128 624 128zM160 144C160 135.1 152.9 128 144 128h-32C103.1 128 96 135.1 96 144V288h64V144zM224 95.1c17.62 0 32-14.38 32-32S224 0 224 0S192 46.37 192 63.1S206.4 95.1 224 95.1zM32 95.1c17.62 0 32-14.38 32-32S32 0 32 0S0 46.37 0 63.1S14.38 95.1 32 95.1zM128 95.1c17.62 0 32-14.38 32-32S128 0 128 0S96 46.37 96 63.1S110.4 95.1 128 95.1zM256 144C256 135.1 248.9 128 240 128h-32C199.1 128 192 135.1 192 144V288h64V144z"],mercury:[384,512,[9791],"f223","M368 223.1c0-55.32-25.57-104.6-65.49-136.9c20.49-17.32 37.2-39.11 48.1-64.21c4.656-10.72-2.9-22.89-14.45-22.89h-54.31c-5.256 0-9.93 2.828-12.96 7.188C251.8 31.77 223.8 47.1 192 47.1c-31.85 0-59.78-16.23-76.88-40.81C112.1 2.828 107.4 0 102.2 0H47.84c-11.55 0-19.11 12.17-14.45 22.89C44.29 47.1 60.1 69.79 81.49 87.11C41.57 119.4 16 168.7 16 223.1c0 86.26 62.1 157.9 144 172.1V416H128c-8.836 0-16 7.164-16 16v32C112 472.8 119.2 480 128 480h32v16C160 504.8 167.2 512 176 512h32c8.838 0 16-7.164 16-16V480h32c8.838 0 16-7.164 16-16v-32c0-8.836-7.162-16-16-16h-32v-19.05C305.9 381.9 368 310.3 368 223.1zM192 320c-52.93 0-96-43.07-96-96c0-52.94 43.07-95.1 96-95.1c52.94 0 96 43.06 96 95.1C288 276.9 244.9 320 192 320z"],message:[512,512,["comment-alt"],"f27a","M511.1 63.1v287.1c0 35.25-28.75 63.1-64 63.1h-144l-124.9 93.68c-7.875 5.75-19.12 .0497-19.12-9.7v-83.98h-96c-35.25 0-64-28.75-64-63.1V63.1c0-35.25 28.75-63.1 64-63.1h384C483.2 0 511.1 28.75 511.1 63.1z"],meteor:[512,512,[9732],"f753","M511.4 20.72c-11.63 38.75-34.38 111.8-61.38 187.8c7 2.125 13.38 4 18.63 5.625c4.625 1.375 8.375 4.751 10.13 9.127c1.875 4.5 1.625 9.501-.625 13.75c-22.13 42.25-82.63 152.8-142.5 214.4c-1 1.125-2.001 2.5-3.001 3.5c-76 76.13-199.4 76.13-275.5 .125c-76.13-76.13-76.13-199.5 0-275.7c1-1 2.375-2 3.5-3C122.1 116.5 232.5 55.97 274.1 33.84c4.25-2.25 9.25-2.5 13.63-.625c4.5 1.875 7.875 5.626 9.25 10.13c1.625 5.125 3.5 11.63 5.625 18.63c75.88-27 148.9-49.75 187.6-61.25c5.75-1.75 11.88-.2503 16.13 4C511.5 8.844 512.1 15.09 511.4 20.72zM319.1 319.1c0-70.63-57.38-128-128-128c-70.75 0-128 57.38-128 128c0 70.76 57.25 128 128 128C262.6 448 319.1 390.8 319.1 319.1zM191.1 287.1c0 17.63-14.37 32-32 32c-17.75 0-32-14.38-32-32s14.25-32 32-32c8.5 0 16.63 3.375 22.63 9.375S191.1 279.5 191.1 287.1zM223.9 367.1c0 8.876-7.224 16-15.97 16c-8.875 0-16-7.127-16-16c0-8.876 7.1-16 15.98-16C216.7 351.1 223.9 359.1 223.9 367.1z"],microchip:[512,512,[],"f2db","M160 352h192V160H160V352zM448 176h48C504.8 176 512 168.8 512 160s-7.162-16-16-16H448V128c0-35.35-28.65-64-64-64h-16V16C368 7.164 360.8 0 352 0c-8.836 0-16 7.164-16 16V64h-64V16C272 7.164 264.8 0 256 0C247.2 0 240 7.164 240 16V64h-64V16C176 7.164 168.8 0 160 0C151.2 0 144 7.164 144 16V64H128C92.65 64 64 92.65 64 128v16H16C7.164 144 0 151.2 0 160s7.164 16 16 16H64v64H16C7.164 240 0 247.2 0 256s7.164 16 16 16H64v64H16C7.164 336 0 343.2 0 352s7.164 16 16 16H64V384c0 35.35 28.65 64 64 64h16v48C144 504.8 151.2 512 160 512c8.838 0 16-7.164 16-16V448h64v48c0 8.836 7.164 16 16 16c8.838 0 16-7.164 16-16V448h64v48c0 8.836 7.164 16 16 16c8.838 0 16-7.164 16-16V448H384c35.35 0 64-28.65 64-64v-16h48c8.838 0 16-7.164 16-16s-7.162-16-16-16H448v-64h48C504.8 272 512 264.8 512 256s-7.162-16-16-16H448V176zM384 368c0 8.836-7.162 16-16 16h-224C135.2 384 128 376.8 128 368v-224C128 135.2 135.2 128 144 128h224C376.8 128 384 135.2 384 144V368z"],microphone:[384,512,[],"f130","M192 352c53.03 0 96-42.97 96-96v-160c0-53.03-42.97-96-96-96s-96 42.97-96 96v160C96 309 138.1 352 192 352zM344 192C330.7 192 320 202.7 320 215.1V256c0 73.33-61.97 132.4-136.3 127.7c-66.08-4.169-119.7-66.59-119.7-132.8L64 215.1C64 202.7 53.25 192 40 192S16 202.7 16 215.1v32.15c0 89.66 63.97 169.6 152 181.7V464H128c-18.19 0-32.84 15.18-31.96 33.57C96.43 505.8 103.8 512 112 512h160c8.222 0 15.57-6.216 15.96-14.43C288.8 479.2 274.2 464 256 464h-40v-33.77C301.7 418.5 368 344.9 368 256V215.1C368 202.7 357.3 192 344 192z"],"microphone-lines":[384,512,[127897,"microphone-alt"],"f3c9","M192 352c53.03 0 96-42.97 96-96h-80C199.2 256 192 248.8 192 240S199.2 224 208 224H288V192h-80C199.2 192 192 184.8 192 176S199.2 160 208 160H288V127.1h-80c-8.836 0-16-7.164-16-16s7.164-16 16-16L288 96c0-53.03-42.97-96-96-96s-96 42.97-96 96v160C96 309 138.1 352 192 352zM344 192C330.7 192 320 202.7 320 215.1V256c0 73.33-61.97 132.4-136.3 127.7c-66.08-4.169-119.7-66.59-119.7-132.8L64 215.1C64 202.7 53.25 192 40 192S16 202.7 16 215.1v32.15c0 89.66 63.97 169.6 152 181.7V464H128c-18.19 0-32.84 15.18-31.96 33.57C96.43 505.8 103.8 512 112 512h160c8.222 0 15.57-6.216 15.96-14.43C288.8 479.2 274.2 464 256 464h-40v-33.77C301.7 418.5 368 344.9 368 256V215.1C368 202.7 357.3 192 344 192z"],"microphone-lines-slash":[640,512,["microphone-alt-slash"],"f539","M383.1 464l-39.1-.0001v-33.77c20.6-2.824 39.99-9.402 57.69-18.72l-43.26-33.91c-14.66 4.65-30.28 7.179-46.68 6.144C245.7 379.6 191.1 317.1 191.1 250.9v-3.777L143.1 209.5l.0001 38.61c0 89.65 63.97 169.6 151.1 181.7v34.15l-40 .0001c-17.67 0-31.1 14.33-31.1 31.1C223.1 504.8 231.2 512 239.1 512h159.1c8.838 0 15.1-7.164 15.1-15.1C415.1 478.3 401.7 464 383.1 464zM630.8 469.1l-159.3-124.9c15.37-25.94 24.53-55.91 24.53-88.21V216c0-13.25-10.75-24-23.1-24c-13.25 0-24 10.75-24 24l-.0001 39.1c0 21.12-5.557 40.77-14.77 58.24l-25.73-20.16c5.234-11.68 8.493-24.42 8.493-38.08l-57.07 .0006l-34.45-27c2.914-3.055 6.969-4.999 11.52-4.999h79.1V192L335.1 192c-8.836 0-15.1-7.164-15.1-15.1s7.164-16 15.1-16l79.1 .0013V128l-79.1-.0015c-8.836 0-15.1-7.164-15.1-15.1s7.164-15.1 15.1-15.1l80-.0003c0-54-44.56-97.57-98.93-95.95C264.5 1.614 223.1 47.45 223.1 100l.0006 50.23L38.81 5.111C34.41 1.673 29.19 0 24.03 0C16.91 0 9.84 3.158 5.121 9.189C-3.067 19.63-1.249 34.72 9.189 42.89l591.1 463.1c10.5 8.203 25.57 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],"microphone-slash":[640,512,[],"f131","M383.1 464l-39.1-.0001v-33.77c20.6-2.824 39.98-9.402 57.69-18.72l-43.26-33.91c-14.66 4.65-30.28 7.179-46.68 6.144C245.7 379.6 191.1 317.1 191.1 250.9V247.2L143.1 209.5l.0001 38.61c0 89.65 63.97 169.6 151.1 181.7v34.15l-40 .0001c-17.67 0-31.1 14.33-31.1 31.1C223.1 504.8 231.2 512 239.1 512h159.1c8.838 0 15.1-7.164 15.1-15.1C415.1 478.3 401.7 464 383.1 464zM630.8 469.1l-159.3-124.9c15.37-25.94 24.53-55.91 24.53-88.21V216c0-13.25-10.75-24-23.1-24c-13.25 0-24 10.75-24 24l-.0001 39.1c0 21.12-5.559 40.77-14.77 58.24l-25.72-20.16c5.234-11.68 8.493-24.42 8.493-38.08l-.001-155.1c0-52.57-40.52-98.41-93.07-99.97c-54.37-1.617-98.93 41.95-98.93 95.95l0 54.25L38.81 5.111C34.41 1.673 29.19 0 24.03 0C16.91 0 9.839 3.158 5.12 9.189c-8.187 10.44-6.37 25.53 4.068 33.7l591.1 463.1c10.5 8.203 25.57 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],microscope:[512,512,[128300],"f610","M160 320h12v16c0 8.875 7.125 16 16 16h40c8.875 0 16-7.125 16-16V320H256c17.62 0 32-14.38 32-32V64c0-17.62-14.38-32-32-32V16C256 7.125 248.9 0 240 0h-64C167.1 0 160 7.125 160 16V32C142.4 32 128 46.38 128 64v224C128 305.6 142.4 320 160 320zM464 448h-1.25C493.2 414 512 369.2 512 320c0-105.9-86.13-192-192-192v64c70.63 0 128 57.38 128 128s-57.38 128-128 128H48C21.5 448 0 469.5 0 496C0 504.9 7.125 512 16 512h480c8.875 0 16-7.125 16-16C512 469.5 490.5 448 464 448zM104 416h208c4.375 0 8-3.625 8-8v-16c0-4.375-3.625-8-8-8h-208C99.63 384 96 387.6 96 392v16C96 412.4 99.63 416 104 416z"],"mill-sign":[384,512,[],"e1ed","M282.9 96.53C339.7 102 384 149.8 384 208V416C384 433.7 369.7 448 352 448C334.3 448 320 433.7 320 416V208C320 181.5 298.5 160 272 160C267.7 160 263.6 160.6 259.7 161.6L224 261.5V416C224 433.7 209.7 448 192 448C179.6 448 168.9 440.1 163.6 430.7L142.1 490.8C136.2 507.4 117.9 516.1 101.2 510.1C84.59 504.2 75.92 485.9 81.86 469.2L160 250.5V208C160 181.5 138.5 160 112 160C85.49 160 64 181.5 64 208V416C64 433.7 49.67 448 32 448C14.33 448 0 433.7 0 416V128C0 110.3 14.33 96 32 96C42.87 96 52.48 101.4 58.26 109.7C74.21 100.1 92.53 96 112 96C143.3 96 171.7 108.9 192 129.6C196.9 124.6 202.2 120.1 207.1 116.1L241.9 21.24C247.8 4.595 266.1-4.079 282.8 1.865C299.4 7.809 308.1 26.12 302.1 42.76L282.9 96.53z"],minimize:[512,512,["compress-arrows-alt"],"f78c","M200 287.1H64c-12.94 0-24.62 7.797-29.56 19.75c-4.969 11.97-2.219 25.72 6.937 34.87l30.06 30.06l-62.06 62.07c-12.49 12.5-12.5 32.75-.0012 45.25l22.62 22.62c12.5 12.5 32.76 12.5 45.26 .0012l62.06-62.07l30.06 30.06c6.125 6.125 14.31 9.375 22.62 9.375c4.125 0 8.281-.7969 12.25-2.437c11.97-4.953 19.75-16.62 19.75-29.56V311.1C224 298.7 213.3 287.1 200 287.1zM312 224h135.1c12.94 0 24.62-7.797 29.56-19.75c4.969-11.97 2.219-25.72-6.937-34.87l-30.06-30.06l62.06-62.07c12.5-12.5 12.5-32.76 .0003-45.26l-22.62-22.62c-12.5-12.5-32.76-12.5-45.26-.0003l-62.06 62.07l-30.06-30.06c-9.156-9.141-22.87-11.84-34.87-6.937C295.8 39.39 288 51.06 288 64v135.1C288 213.3 298.7 224 312 224zM204.3 34.44C192.3 29.47 178.5 32.22 169.4 41.38L139.3 71.44L77.25 9.374C64.75-3.123 44.49-3.123 31.1 9.374l-22.63 22.63c-12.49 12.49-12.49 32.75 .0018 45.25l62.07 62.06L41.38 169.4C35.25 175.5 32 183.7 32 192c0 4.125 .7969 8.281 2.438 12.25C39.39 216.2 51.07 224 64 224h135.1c13.25 0 23.1-10.75 23.1-23.1V64C224 51.06 216.2 39.38 204.3 34.44zM440.6 372.7l30.06-30.06c9.141-9.156 11.84-22.88 6.938-34.87C472.6 295.8 460.9 287.1 448 287.1h-135.1c-13.25 0-23.1 10.75-23.1 23.1v135.1c0 12.94 7.797 24.62 19.75 29.56c11.97 4.969 25.72 2.219 34.87-6.937l30.06-30.06l62.06 62.06c12.5 12.5 32.76 12.5 45.26 .0002l22.62-22.62c12.5-12.5 12.5-32.76 .0002-45.26L440.6 372.7z"],minus:[448,512,[8722,10134,8211,"subtract"],"f068","M400 288h-352c-17.69 0-32-14.32-32-32.01s14.31-31.99 32-31.99h352c17.69 0 32 14.3 32 31.99S417.7 288 400 288z"],mitten:[448,512,[],"f7b5","M351.1 416H63.99c-17.6 0-31.1 14.4-31.1 31.1l.0026 31.1C31.1 497.6 46.4 512 63.1 512h288c17.6 0 32-14.4 32-31.1l-.0049-31.1C383.1 430.4 369.6 416 351.1 416zM425 206.9c-27.25-22.62-67.5-19-90.13 8.25l-20.88 25L284.4 111.8c-18-77.5-95.38-125.1-172.8-108C34.26 21.63-14.25 98.88 3.754 176.4L64 384h288l81.14-86.1C455.8 269.8 452.1 229.5 425 206.9z"],mobile:[384,512,[128241,"mobile-android","mobile-phone"],"f3ce","M320 0H64C37.5 0 16 21.5 16 48v416C16 490.5 37.5 512 64 512h256c26.5 0 48-21.5 48-48v-416C368 21.5 346.5 0 320 0zM240 447.1C240 456.8 232.8 464 224 464H159.1C151.2 464 144 456.8 144 448S151.2 432 160 432h64C232.8 432 240 439.2 240 447.1z"],"mobile-button":[384,512,[],"f10b","M320 0H64C37.49 0 16 21.49 16 48v416C16 490.5 37.49 512 64 512h256c26.51 0 48-21.49 48-48v-416C368 21.49 346.5 0 320 0zM192 464c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S209.8 464 192 464z"],"mobile-retro":[320,512,[],"e527","M0 64C0 28.65 28.65 0 64 0H256C291.3 0 320 28.65 320 64V448C320 483.3 291.3 512 256 512H64C28.65 512 0 483.3 0 448V64zM64 232C64 245.3 74.75 256 88 256H232C245.3 256 256 245.3 256 232V152C256 138.7 245.3 128 232 128H88C74.75 128 64 138.7 64 152V232zM80 352C93.25 352 104 341.3 104 328C104 314.7 93.25 304 80 304C66.75 304 56 314.7 56 328C56 341.3 66.75 352 80 352zM80 384C66.75 384 56 394.7 56 408C56 421.3 66.75 432 80 432C93.25 432 104 421.3 104 408C104 394.7 93.25 384 80 384zM160 352C173.3 352 184 341.3 184 328C184 314.7 173.3 304 160 304C146.7 304 136 314.7 136 328C136 341.3 146.7 352 160 352zM160 384C146.7 384 136 394.7 136 408C136 421.3 146.7 432 160 432C173.3 432 184 421.3 184 408C184 394.7 173.3 384 160 384zM240 352C253.3 352 264 341.3 264 328C264 314.7 253.3 304 240 304C226.7 304 216 314.7 216 328C216 341.3 226.7 352 240 352zM240 384C226.7 384 216 394.7 216 408C216 421.3 226.7 432 240 432C253.3 432 264 421.3 264 408C264 394.7 253.3 384 240 384zM128 48C119.2 48 112 55.16 112 64C112 72.84 119.2 80 128 80H192C200.8 80 208 72.84 208 64C208 55.16 200.8 48 192 48H128z"],"mobile-screen":[384,512,["mobile-android-alt"],"f3cf","M320 0H64C37.5 0 16 21.5 16 48v416C16 490.5 37.5 512 64 512h256c26.5 0 48-21.5 48-48v-416C368 21.5 346.5 0 320 0zM240 447.1C240 456.8 232.8 464 224 464H159.1C151.2 464 144 456.8 144 448S151.2 432 160 432h64C232.8 432 240 439.2 240 447.1zM304 384h-224V64h224V384z"],"mobile-screen-button":[384,512,["mobile-alt"],"f3cd","M304 0h-224c-35.35 0-64 28.65-64 64v384c0 35.35 28.65 64 64 64h224c35.35 0 64-28.65 64-64V64C368 28.65 339.3 0 304 0zM192 480c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S209.8 480 192 480zM304 64v320h-224V64H304z"],"money-bill":[576,512,[],"f0d6","M512 64C547.3 64 576 92.65 576 128V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H512zM128 384C128 348.7 99.35 320 64 320V384H128zM64 192C99.35 192 128 163.3 128 128H64V192zM512 384V320C476.7 320 448 348.7 448 384H512zM512 128H448C448 163.3 476.7 192 512 192V128zM288 352C341 352 384 309 384 256C384 202.1 341 160 288 160C234.1 160 192 202.1 192 256C192 309 234.1 352 288 352z"],"money-bill-1":[576,512,["money-bill-alt"],"f3d1","M252 208C252 196.1 260.1 188 272 188H288C299 188 308 196.1 308 208V276H312C323 276 332 284.1 332 296C332 307 323 316 312 316H264C252.1 316 244 307 244 296C244 284.1 252.1 276 264 276H268V227.6C258.9 225.7 252 217.7 252 208zM512 64C547.3 64 576 92.65 576 128V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H512zM128 384C128 348.7 99.35 320 64 320V384H128zM64 192C99.35 192 128 163.3 128 128H64V192zM512 384V320C476.7 320 448 348.7 448 384H512zM512 128H448C448 163.3 476.7 192 512 192V128zM288 144C226.1 144 176 194.1 176 256C176 317.9 226.1 368 288 368C349.9 368 400 317.9 400 256C400 194.1 349.9 144 288 144z"],"money-bill-1-wave":[576,512,["money-bill-wave-alt"],"f53b","M251.1 207.1C251.1 196.1 260.1 187.1 271.1 187.1H287.1C299 187.1 308 196.1 308 207.1V275.1H312C323 275.1 332 284.1 332 295.1C332 307 323 315.1 312 315.1H263.1C252.1 315.1 243.1 307 243.1 295.1C243.1 284.1 252.1 275.1 263.1 275.1H267.1V227.6C258.9 225.7 251.1 217.7 251.1 207.1zM48.66 79.13C128.4 100.9 208.2 80.59 288 60.25C375 38.08 462 15.9 549 48.38C565.9 54.69 576 71.62 576 89.66V399.5C576 423.4 550.4 439.2 527.3 432.9C447.6 411.1 367.8 431.4 288 451.7C200.1 473.9 113.1 496.1 26.97 463.6C10.06 457.3 0 440.4 0 422.3V112.5C0 88.59 25.61 72.83 48.66 79.13L48.66 79.13zM127.1 416C127.1 380.7 99.35 352 63.1 352V416H127.1zM63.1 223.1C99.35 223.1 127.1 195.3 127.1 159.1H63.1V223.1zM512 352V287.1C476.7 287.1 448 316.7 448 352H512zM512 95.1H448C448 131.3 476.7 159.1 512 159.1V95.1zM287.1 143.1C234.1 143.1 191.1 194.1 191.1 255.1C191.1 317.9 234.1 368 287.1 368C341 368 384 317.9 384 255.1C384 194.1 341 143.1 287.1 143.1z"],"money-bill-transfer":[640,512,[],"e528","M535 7.03C544.4-2.343 559.6-2.343 568.1 7.029L632.1 71.02C637.5 75.52 640 81.63 640 87.99C640 94.36 637.5 100.5 632.1 104.1L568.1 168.1C559.6 178.3 544.4 178.3 535 168.1C525.7 159.6 525.7 144.4 535 135L558.1 111.1L384 111.1C370.7 111.1 360 101.2 360 87.99C360 74.74 370.7 63.99 384 63.99L558.1 63.1L535 40.97C525.7 31.6 525.7 16.4 535 7.03V7.03zM104.1 376.1L81.94 400L255.1 399.1C269.3 399.1 279.1 410.7 279.1 423.1C279.1 437.2 269.3 447.1 255.1 447.1L81.95 448L104.1 471C114.3 480.4 114.3 495.6 104.1 504.1C95.6 514.3 80.4 514.3 71.03 504.1L7.029 440.1C2.528 436.5-.0003 430.4 0 423.1C0 417.6 2.529 411.5 7.03 407L71.03 343C80.4 333.7 95.6 333.7 104.1 343C114.3 352.4 114.3 367.6 104.1 376.1H104.1zM95.1 64H337.9C334.1 71.18 332 79.34 332 87.1C332 116.7 355.3 139.1 384 139.1L481.1 139.1C484.4 157.5 494.9 172.5 509.4 181.9C511.1 184.3 513.1 186.6 515.2 188.8C535.5 209.1 568.5 209.1 588.8 188.8L608 169.5V384C608 419.3 579.3 448 544 448H302.1C305.9 440.8 307.1 432.7 307.1 423.1C307.1 395.3 284.7 371.1 255.1 371.1L158.9 372C155.5 354.5 145.1 339.5 130.6 330.1C128.9 327.7 126.9 325.4 124.8 323.2C104.5 302.9 71.54 302.9 51.23 323.2L31.1 342.5V128C31.1 92.65 60.65 64 95.1 64V64zM95.1 192C131.3 192 159.1 163.3 159.1 128H95.1V192zM544 384V320C508.7 320 480 348.7 480 384H544zM319.1 352C373 352 416 309 416 256C416 202.1 373 160 319.1 160C266.1 160 223.1 202.1 223.1 256C223.1 309 266.1 352 319.1 352z"],"money-bill-trend-up":[512,512,[],"e529","M470.7 9.441C473.7 12.49 476 16 477.6 19.75C479.1 23.5 479.1 27.6 480 31.9V32V128C480 145.7 465.7 160 448 160C430.3 160 416 145.7 416 128V109.3L310.6 214.6C298.8 226.5 279.9 227.2 267.2 216.3L175.1 138.1L84.82 216.3C71.41 227.8 51.2 226.2 39.7 212.8C28.2 199.4 29.76 179.2 43.17 167.7L155.2 71.7C167.2 61.43 184.8 61.43 196.8 71.7L286.3 148.4L370.7 64H352C334.3 64 320 49.67 320 32C320 14.33 334.3 0 352 0H447.1C456.8 0 464.8 3.554 470.6 9.305L470.7 9.441zM0 304C0 277.5 21.49 256 48 256H464C490.5 256 512 277.5 512 304V464C512 490.5 490.5 512 464 512H48C21.49 512 0 490.5 0 464V304zM48 464H96C96 437.5 74.51 416 48 416V464zM48 304V352C74.51 352 96 330.5 96 304H48zM464 416C437.5 416 416 437.5 416 464H464V416zM416 304C416 330.5 437.5 352 464 352V304H416zM256 320C220.7 320 192 348.7 192 384C192 419.3 220.7 448 256 448C291.3 448 320 419.3 320 384C320 348.7 291.3 320 256 320z"],"money-bill-wave":[576,512,[],"f53a","M48.66 79.13C128.4 100.9 208.2 80.59 288 60.25C375 38.08 462 15.9 549 48.38C565.9 54.69 576 71.62 576 89.66V399.5C576 423.4 550.4 439.2 527.3 432.9C447.6 411.1 367.8 431.4 288 451.7C200.1 473.9 113.1 496.1 26.97 463.6C10.06 457.3 0 440.4 0 422.3V112.5C0 88.59 25.61 72.83 48.66 79.13L48.66 79.13zM287.1 352C332.2 352 368 309 368 255.1C368 202.1 332.2 159.1 287.1 159.1C243.8 159.1 207.1 202.1 207.1 255.1C207.1 309 243.8 352 287.1 352zM63.1 416H127.1C127.1 380.7 99.35 352 63.1 352V416zM63.1 143.1V207.1C99.35 207.1 127.1 179.3 127.1 143.1H63.1zM512 303.1C476.7 303.1 448 332.7 448 368H512V303.1zM448 95.1C448 131.3 476.7 159.1 512 159.1V95.1H448z"],"money-bill-wheat":[512,512,[],"e52a","M256 80C256 88.84 248.8 96 240 96C195.8 96 160 60.18 160 16C160 7.164 167.2 0 176 0C220.2 0 256 35.82 256 80zM104 16C117.3 16 128 26.75 128 40C128 53.25 117.3 64 104 64H56C42.75 64 32 53.25 32 40C32 26.75 42.75 16 56 16H104zM136 88C149.3 88 160 98.75 160 112C160 125.3 149.3 136 136 136H24C10.75 136 0 125.3 0 112C0 98.75 10.75 88 24 88H136zM32 184C32 170.7 42.75 160 56 160H104C117.3 160 128 170.7 128 184C128 197.3 117.3 208 104 208H56C42.75 208 32 197.3 32 184zM272 16C272 7.164 279.2 0 288 0C332.2 0 368 35.82 368 80C368 88.84 360.8 96 352 96C307.8 96 272 60.18 272 16zM480 80C480 88.84 472.8 96 464 96C419.8 96 384 60.18 384 16C384 7.164 391.2 0 400 0C444.2 0 480 35.82 480 80zM400 224C391.2 224 384 216.8 384 208C384 163.8 419.8 128 464 128C472.8 128 480 135.2 480 144C480 188.2 444.2 224 400 224zM352 128C360.8 128 368 135.2 368 144C368 188.2 332.2 224 288 224C279.2 224 272 216.8 272 208C272 163.8 307.8 128 352 128zM176 224C167.2 224 160 216.8 160 208C160 163.8 195.8 128 240 128C248.8 128 256 135.2 256 144C256 188.2 220.2 224 176 224zM0 304C0 277.5 21.49 256 48 256H464C490.5 256 512 277.5 512 304V464C512 490.5 490.5 512 464 512H48C21.49 512 0 490.5 0 464V304zM48 464H96C96 437.5 74.51 416 48 416V464zM48 304V352C74.51 352 96 330.5 96 304H48zM464 416C437.5 416 416 437.5 416 464H464V416zM416 304C416 330.5 437.5 352 464 352V304H416zM256 320C220.7 320 192 348.7 192 384C192 419.3 220.7 448 256 448C291.3 448 320 419.3 320 384C320 348.7 291.3 320 256 320z"],"money-bills":[640,512,[],"e1f3","M96 96C96 60.65 124.7 32 160 32H576C611.3 32 640 60.65 640 96V320C640 355.3 611.3 384 576 384H160C124.7 384 96 355.3 96 320V96zM160 320H224C224 284.7 195.3 256 160 256V320zM160 96V160C195.3 160 224 131.3 224 96H160zM576 256C540.7 256 512 284.7 512 320H576V256zM512 96C512 131.3 540.7 160 576 160V96H512zM368 128C323.8 128 288 163.8 288 208C288 252.2 323.8 288 368 288C412.2 288 448 252.2 448 208C448 163.8 412.2 128 368 128zM48 360C48 399.8 80.24 432 120 432H520C533.3 432 544 442.7 544 456C544 469.3 533.3 480 520 480H120C53.73 480 0 426.3 0 360V120C0 106.7 10.75 96 24 96C37.25 96 48 106.7 48 120V360z"],"money-check":[576,512,[],"f53c","M512 64C547.3 64 576 92.65 576 128V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H512zM112 224C103.2 224 96 231.2 96 240C96 248.8 103.2 256 112 256H272C280.8 256 288 248.8 288 240C288 231.2 280.8 224 272 224H112zM112 352H464C472.8 352 480 344.8 480 336C480 327.2 472.8 320 464 320H112C103.2 320 96 327.2 96 336C96 344.8 103.2 352 112 352zM376 160C362.7 160 352 170.7 352 184V232C352 245.3 362.7 256 376 256H456C469.3 256 480 245.3 480 232V184C480 170.7 469.3 160 456 160H376z"],"money-check-dollar":[576,512,["money-check-alt"],"f53d","M512 64C547.3 64 576 92.65 576 128V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H512zM272 192C263.2 192 256 199.2 256 208C256 216.8 263.2 224 272 224H496C504.8 224 512 216.8 512 208C512 199.2 504.8 192 496 192H272zM272 320H496C504.8 320 512 312.8 512 304C512 295.2 504.8 288 496 288H272C263.2 288 256 295.2 256 304C256 312.8 263.2 320 272 320zM164.1 160C164.1 148.9 155.1 139.9 143.1 139.9C132.9 139.9 123.9 148.9 123.9 160V166C118.3 167.2 112.1 168.9 108 171.1C93.06 177.9 80.07 190.5 76.91 208.8C75.14 219 76.08 228.9 80.32 237.8C84.47 246.6 91 252.8 97.63 257.3C109.2 265.2 124.5 269.8 136.2 273.3L138.4 273.9C152.4 278.2 161.8 281.3 167.7 285.6C170.2 287.4 171.1 288.8 171.4 289.7C171.8 290.5 172.4 292.3 171.7 296.3C171.1 299.8 169.2 302.8 163.7 305.1C157.6 307.7 147.7 309 134.9 307C128.9 306 118.2 302.4 108.7 299.2C106.5 298.4 104.3 297.7 102.3 297C91.84 293.5 80.51 299.2 77.02 309.7C73.53 320.2 79.2 331.5 89.68 334.1C90.89 335.4 92.39 335.9 94.11 336.5C101.1 339.2 114.4 343.4 123.9 345.6V352C123.9 363.1 132.9 372.1 143.1 372.1C155.1 372.1 164.1 363.1 164.1 352V346.5C169.4 345.5 174.6 343.1 179.4 341.9C195.2 335.2 207.8 322.2 211.1 303.2C212.9 292.8 212.1 282.8 208.1 273.7C204.2 264.7 197.9 258.1 191.2 253.3C179.1 244.4 162.9 239.6 150.8 235.9L149.1 235.7C135.8 231.4 126.2 228.4 120.1 224.2C117.5 222.4 116.7 221.2 116.5 220.7C116.3 220.3 115.7 219.1 116.3 215.7C116.7 213.7 118.2 210.4 124.5 207.6C130.1 204.7 140.9 203.1 153.1 204.1C157.5 205.7 171 208.3 174.9 209.3C185.5 212.2 196.5 205.8 199.3 195.1C202.2 184.5 195.8 173.5 185.1 170.7C180.7 169.5 170.7 167.5 164.1 166.3L164.1 160z"],monument:[384,512,[],"f5a6","M180.7 4.686C186.9-1.562 197.1-1.562 203.3 4.686L283.3 84.69C285.8 87.2 287.4 90.48 287.9 94.02L328.1 416H55.88L96.12 94.02C96.57 90.48 98.17 87.2 100.7 84.69L180.7 4.686zM152 272C138.7 272 128 282.7 128 296C128 309.3 138.7 320 152 320H232C245.3 320 256 309.3 256 296C256 282.7 245.3 272 232 272H152zM352 448C369.7 448 384 462.3 384 480C384 497.7 369.7 512 352 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H352z"],moon:[512,512,[127769,9214],"f186","M32 256c0-123.8 100.3-224 223.8-224c11.36 0 29.7 1.668 40.9 3.746c9.616 1.777 11.75 14.63 3.279 19.44C245 86.5 211.2 144.6 211.2 207.8c0 109.7 99.71 193 208.3 172.3c9.561-1.805 16.28 9.324 10.11 16.95C387.9 448.6 324.8 480 255.8 480C132.1 480 32 379.6 32 256z"],"mortar-pestle":[512,512,[],"f5a7","M501.5 60.87c17.25-17.12 12.5-46.25-9.25-57.13c-12.12-6-26.5-4.75-37.38 3.375L251.1 159.1h151.4L501.5 60.87zM496 191.1h-480c-8.875 0-16 7.125-16 16v32c0 8.875 7.125 16 16 16L31.1 256c0 81 50.25 150.1 121.1 178.4c-12.75 16.88-21.75 36.75-25 58.63C126.8 502.9 134.2 512 144.2 512h223.5c10 0 17.51-9.125 16.13-19c-3.25-21.88-12.25-41.75-25-58.63C429.8 406.1 479.1 337 479.1 256L496 255.1c8.875 0 16-7.125 16-16v-32C512 199.1 504.9 191.1 496 191.1z"],mosque:[640,512,[128332],"f678","M400 0C405 0 409.8 2.371 412.8 6.4C447.5 52.7 490.9 81.34 546.3 117.9C551.5 121.4 556.9 124.9 562.3 128.5C591.3 147.7 608 180.2 608 214.6C608 243.1 596.7 269 578.2 288H221.8C203.3 269 192 243.1 192 214.6C192 180.2 208.7 147.7 237.7 128.5C243.1 124.9 248.5 121.4 253.7 117.9C309.1 81.34 352.5 52.7 387.2 6.4C390.2 2.371 394.1 0 400 0V0zM288 440C288 426.7 277.3 416 264 416C250.7 416 240 426.7 240 440V512H192C174.3 512 160 497.7 160 480V352C160 334.3 174.3 320 192 320H608C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H560V440C560 426.7 549.3 416 536 416C522.7 416 512 426.7 512 440V512H448V453.1C448 434.1 439.6 416.1 424.1 404.8L400 384L375 404.8C360.4 416.1 352 434.1 352 453.1V512H288V440zM70.4 5.2C76.09 .9334 83.91 .9334 89.6 5.2L105.6 17.2C139.8 42.88 160 83.19 160 126V128H0V126C0 83.19 20.15 42.88 54.4 17.2L70.4 5.2zM0 160H160V296.6C140.9 307.6 128 328.3 128 352V480C128 489.6 130.1 498.6 133.8 506.8C127.3 510.1 119.9 512 112 512H48C21.49 512 0 490.5 0 464V160z"],mosquito:[640,512,[],"e52b","M430.3 503.8L382.3 447.8C378.4 443.4 376.3 437.7 376.3 431.7V376.3L351.1 344.7V407.8C351.1 425.4 337.7 439.8 319.1 439.8C302.3 439.8 287.1 425.4 287.1 407.8V344.7L263.7 376.3V431.7C263.7 437.7 261.6 443.4 257.7 447.8L209.7 503.8C201.1 513.8 186.1 514.8 176.3 505.9C166.5 497 165.6 481.6 174.3 471.6L216.3 422.5V367.8C216.3 362.3 218.1 357 221.5 352.7L287.1 266.3V266L154.6 387.8C97.58 447.6 .0003 405.2 0 320.6C0 272.7 34.02 232.3 79.35 226.4L232.3 202.5L191.5 161.6C183.7 153.8 182.1 141.5 187.6 131.8L211.5 90.06L173.3 39.18C165.3 28.54 167.2 13.26 177.5 5.046C187.9-3.17 202.7-1.207 210.7 9.429L258.7 73.34C264.6 81.21 265.3 91.99 260.4 100.6L237.8 140L287.1 190.3V152.1C287.1 137.2 298.2 124.7 311.1 121.1V63.93C311.1 59.51 315.6 55.93 319.1 55.93C324.4 55.93 327.1 59.51 327.1 63.93V121.1C341.8 124.7 351.1 137.2 351.1 152.1V190.3L402.2 140L379.6 100.6C374.7 91.99 375.4 81.21 381.3 73.34L429.3 9.429C437.3-1.207 452.1-3.169 462.5 5.047C472.8 13.26 474.7 28.55 466.7 39.18L428.5 90.06L452.4 131.8C457.9 141.5 456.3 153.8 448.5 161.6L407.7 202.5L560.6 226.4C605.1 232.3 640 272.7 640 320.6C640 405.2 542.4 447.6 485.4 387.8L351.1 266V266.3L418.5 352.7C421.9 357 423.7 362.3 423.7 367.8V422.5L465.7 471.6C474.4 481.6 473.5 497 463.7 505.9C453.9 514.8 438.9 513.8 430.3 503.8L430.3 503.8z"],"mosquito-net":[640,512,[],"e52c","M168.8 462.3C160.9 458.4 157.7 448.7 161.7 440.8L191.1 380.2V335.1C191.1 331.8 193.7 327.7 196.7 324.7L255.1 265.4V242.2L139.2 343.1C87.82 395.3 0 358.9 0 286.3C0 245.2 30.62 210.6 71.41 205.5L231.3 181.6L181.8 140.3C176.7 136.1 174.7 129.2 176.8 122.9L190.7 81.22L161.7 23.15C157.7 15.25 160.9 5.637 168.8 1.685C176.7-2.267 186.4 .9369 190.3 8.841L222.3 72.84C224.2 76.64 224.5 81.03 223.2 85.06L210.6 122.7L255.1 160.5V137.9C255.1 123.1 266.1 110.6 279.8 106.1V63.67C279.8 59.17 283.5 55.51 287.1 55.51C292.5 55.51 296.2 59.17 296.2 63.67V106.1C309.9 110.6 319.1 123.1 319.1 137.9V160.5L365.4 122.7L352.8 85.06C351.5 81.03 351.8 76.64 353.7 72.84L385.7 8.84C389.6 .9366 399.3-2.267 407.2 1.685C415.1 5.636 418.3 15.25 414.3 23.15L385.3 81.22L399.2 122.9C401.3 129.2 399.3 136.1 394.2 140.3L344.7 181.6L504.6 205.5C527 208.3 546.4 220 559.3 236.9C556.5 239.4 554.1 242.3 552 245.5C543.4 232.5 528.7 223.1 512 223.1C495.3 223.1 480.6 232.5 472 245.5C463.4 232.5 448.7 223.1 432 223.1C410.3 223.1 392 238.3 386.1 258.1C375.4 261.3 366.3 268.2 360.2 277.2L319.1 242.2V265.4L352.4 297.8C352.1 299.8 352 301.9 352 303.1C352 320.7 360.5 335.4 373.5 343.1C369.5 346.6 365.9 349.9 362.9 353.5L319.1 310.6V360.6C319.1 378.3 305.7 392.6 287.1 392.6C270.3 392.6 255.1 378.3 255.1 360.6V310.6L224 342.6V383.1C224 386.5 223.4 388.9 222.3 391.2L190.3 455.2C186.4 463.1 176.7 466.3 168.8 462.3V462.3zM512 255.1C520.8 255.1 528 263.2 528 271.1V287.1H576V271.1C576 263.2 583.2 255.1 592 255.1C600.8 255.1 608 263.2 608 271.1V287.1H624C632.8 287.1 640 295.2 640 303.1C640 312.8 632.8 319.1 624 319.1H608V367.1H624C632.8 367.1 640 375.2 640 383.1C640 392.8 632.8 399.1 624 399.1H608V447.1H624C632.8 447.1 640 455.2 640 463.1C640 472.8 632.8 479.1 624 479.1H608V495.1C608 504.8 600.8 511.1 592 511.1C583.2 511.1 576 504.8 576 495.1V479.1H528V495.1C528 504.8 520.8 511.1 512 511.1C503.2 511.1 496 504.8 496 495.1V479.1H448V495.1C448 504.8 440.8 511.1 432 511.1C423.2 511.1 416 504.8 416 495.1V479.1H400C391.2 479.1 384 472.8 384 463.1C384 455.2 391.2 447.1 400 447.1H416V399.1H400C391.2 399.1 384 392.8 384 383.1C384 375.2 391.2 367.1 400 367.1H416V319.1H400C391.2 319.1 384 312.8 384 303.1C384 295.2 391.2 287.1 400 287.1H416V271.1C416 263.2 423.2 255.1 432 255.1C440.8 255.1 448 263.2 448 271.1V287.1H496V271.1C496 263.2 503.2 255.1 512 255.1V255.1zM576 367.1V319.1H528V367.1H576zM576 447.1V399.1H528V447.1H576zM448 319.1V367.1H496V319.1H448zM448 399.1V447.1H496V399.1H448z"],motorcycle:[640,512,[127949],"f21c","M342.5 32C357.2 32 370.7 40.05 377.6 52.98L391.7 78.93L439.1 39.42C444.9 34.62 452.1 32 459.6 32H480C497.7 32 512 46.33 512 64V96C512 113.7 497.7 128 480 128H418.2L473.3 229.1C485.5 226.1 498.5 224 512 224C582.7 224 640 281.3 640 352C640 422.7 582.7 480 512 480C441.3 480 384 422.7 384 352C384 311.1 402.4 276.3 431.1 252.8L415.7 224.2C376.1 253.4 352 299.8 352 352C352 362.1 353.1 373.7 355.2 384H284.8C286.9 373.7 287.1 362.1 287.1 352C287.1 263.6 216.4 192 127.1 192H31.1V160C31.1 142.3 46.33 128 63.1 128H165.5C182.5 128 198.7 134.7 210.7 146.7L255.1 192L354.1 110.3L337.7 80H279.1C266.7 80 255.1 69.25 255.1 56C255.1 42.75 266.7 32 279.1 32L342.5 32zM448 352C448 387.3 476.7 416 512 416C547.3 416 576 387.3 576 352C576 316.7 547.3 288 512 288C509.6 288 507.2 288.1 504.9 288.4L533.1 340.6C539.4 352.2 535.1 366.8 523.4 373.1C511.8 379.4 497.2 375.1 490.9 363.4L462.7 311.2C453.5 322.3 448 336.5 448 352V352zM253.8 376C242.5 435.2 190.5 480 128 480C57.31 480 0 422.7 0 352C0 281.3 57.31 224 128 224C190.5 224 242.5 268.8 253.8 328H187.3C177.9 304.5 154.9 288 128 288C92.65 288 64 316.7 64 352C64 387.3 92.65 416 128 416C154.9 416 177.9 399.5 187.3 376H253.8zM96 352C96 334.3 110.3 320 128 320C145.7 320 160 334.3 160 352C160 369.7 145.7 384 128 384C110.3 384 96 369.7 96 352z"],mound:[576,512,[],"e52d","M144.1 179.2C173.8 127.7 228.6 96 288 96C347.4 96 402.2 127.7 431.9 179.2L540.4 368C552.7 389.4 537.3 416 512.7 416H63.31C38.7 416 23.31 389.4 35.57 368L144.1 179.2z"],mountain:[512,512,[127956],"f6fc","M503.2 393.8L280.1 44.25c-10.42-16.33-37.73-16.33-48.15 0L8.807 393.8c-11.11 17.41-11.75 39.42-1.666 57.45C17.07 468.1 35.92 480 56.31 480h399.4c20.39 0 39.24-11.03 49.18-28.77C514.9 433.2 514.3 411.2 503.2 393.8zM256 111.8L327.8 224H256L208 288L177.2 235.3L256 111.8z"],"mountain-city":[640,512,[],"e52e","M432 0C458.5 0 480 21.49 480 48V192H520V120C520 106.7 530.7 96 544 96C557.3 96 568 106.7 568 120V192H592C618.5 192 640 213.5 640 240V464C640 490.5 618.5 512 592 512H470.2C470.7 511.2 471.2 510.5 471.6 509.7C483.2 488.6 482.8 462.9 470.3 442.4L396.5 320H400C408.8 320 416 312.8 416 304V272C416 263.2 408.8 256 400 256H368C364.8 256 361.9 256.9 359.4 258.5L288 140.1V48C288 21.49 309.5 0 336 0L432 0zM368 64C359.2 64 352 71.16 352 80V112C352 120.8 359.2 128 368 128H400C408.8 128 416 120.8 416 112V80C416 71.16 408.8 64 400 64H368zM352 208C352 216.8 359.2 224 368 224H400C408.8 224 416 216.8 416 208V176C416 167.2 408.8 160 400 160H368C359.2 160 352 167.2 352 176V208zM512 304C512 312.8 519.2 320 528 320H560C568.8 320 576 312.8 576 304V272C576 263.2 568.8 256 560 256H528C519.2 256 512 263.2 512 272V304zM528 352C519.2 352 512 359.2 512 368V400C512 408.8 519.2 416 528 416H560C568.8 416 576 408.8 576 400V368C576 359.2 568.8 352 560 352H528zM442.9 458.9C449.4 469.7 449.7 483.2 443.6 494.2C437.5 505.2 426 512 413.5 512H34.46C21.1 512 10.5 505.2 4.404 494.2C-1.693 483.2-1.444 469.7 5.056 458.9L194.6 144.7C200.9 134.3 211.1 128 224 128C236 128 247.1 134.3 253.4 144.7L442.9 458.9zM223.1 188.9L150.4 310.8L174.1 352L222.1 288H283.8L223.1 188.9z"],"mountain-sun":[640,512,[],"e52f","M480 80C480 35.82 515.8 0 560 0C604.2 0 640 35.82 640 80C640 124.2 604.2 160 560 160C515.8 160 480 124.2 480 80zM0 456.1C0 445.6 2.964 435.3 8.551 426.4L225.3 81.01C231.9 70.42 243.5 64 256 64C268.5 64 280.1 70.42 286.8 81.01L412.7 281.7L460.9 202.7C464.1 196.1 472.2 192 480 192C487.8 192 495 196.1 499.1 202.7L631.1 419.1C636.9 428.6 640 439.7 640 450.9C640 484.6 612.6 512 578.9 512H55.91C25.03 512 .0006 486.1 .0006 456.1L0 456.1z"],"mug-hot":[512,512,[9749],"f7b6","M400 192H32C14.25 192 0 206.3 0 224v192c0 53 43 96 96 96h192c53 0 96-43 96-96h16c61.75 0 112-50.25 112-112S461.8 192 400 192zM400 352H384V256h16C426.5 256 448 277.5 448 304S426.5 352 400 352zM107.9 100.7C120.3 107.1 128 121.4 128 136c0 13.25 10.75 23.89 24 23.89S176 148.1 176 135.7c0-31.34-16.83-60.64-43.91-76.45C119.7 52.03 112 38.63 112 24.28c0-13.25-10.75-24.14-24-24.14S64 11.03 64 24.28C64 55.63 80.83 84.92 107.9 100.7zM219.9 100.7C232.3 107.1 240 121.4 240 136c0 13.25 10.75 23.86 24 23.86S288 148.1 288 135.7c0-31.34-16.83-60.64-43.91-76.45C231.7 52.03 224 38.63 224 24.28c0-13.25-10.75-24.18-24-24.18S176 11.03 176 24.28C176 55.63 192.8 84.92 219.9 100.7z"],"mug-saucer":[640,512,["coffee"],"f0f4","M512 32H120c-13.25 0-24 10.75-24 24L96.01 288c0 53 43 96 96 96h192C437 384 480 341 480 288h32c70.63 0 128-57.38 128-128S582.6 32 512 32zM512 224h-32V96h32c35.25 0 64 28.75 64 64S547.3 224 512 224zM560 416h-544C7.164 416 0 423.2 0 432C0 458.5 21.49 480 48 480h480c26.51 0 48-21.49 48-48C576 423.2 568.8 416 560 416z"],music:[512,512,[127925],"f001","M511.1 367.1c0 44.18-42.98 80-95.1 80s-95.1-35.82-95.1-79.1c0-44.18 42.98-79.1 95.1-79.1c11.28 0 21.95 1.92 32.01 4.898V148.1L192 224l-.0023 208.1C191.1 476.2 149 512 95.1 512S0 476.2 0 432c0-44.18 42.98-79.1 95.1-79.1c11.28 0 21.95 1.92 32 4.898V126.5c0-12.97 10.06-26.63 22.41-30.52l319.1-94.49C472.1 .6615 477.3 0 480 0c17.66 0 31.97 14.34 32 31.99L511.1 367.1z"],n:[384,512,[110],"4e","M384 64.01v384c0 13.47-8.438 25.5-21.09 30.09C359.3 479.4 355.7 480 352 480c-9.312 0-18.38-4.078-24.59-11.52L64 152.4v295.6c0 17.67-14.31 32-32 32s-32-14.33-32-32v-384c0-13.47 8.438-25.5 21.09-30.09c12.62-4.516 26.84-.75 35.5 9.609L320 359.6v-295.6c0-17.67 14.31-32 32-32S384 46.34 384 64.01z"],"naira-sign":[448,512,[],"e1f6","M262.5 256H320V64C320 46.33 334.3 32 352 32C369.7 32 384 46.33 384 64V256H416C433.7 256 448 270.3 448 288C448 305.7 433.7 320 416 320H384V448C384 462.1 374.8 474.5 361.3 478.6C347.8 482.7 333.2 477.5 325.4 465.8L228.2 320H128V448C128 465.7 113.7 480 96 480C78.33 480 64 465.7 64 448V320H32C14.33 320 0 305.7 0 288C0 270.3 14.33 256 32 256H64V64C64 49.9 73.23 37.46 86.73 33.37C100.2 29.29 114.8 34.52 122.6 46.25L262.5 256zM305.1 320L320 342.3V320H305.1zM185.5 256L128 169.7V256H185.5z"],"network-wired":[640,512,[],"f6ff","M400 0C426.5 0 448 21.49 448 48V144C448 170.5 426.5 192 400 192H352V224H608C625.7 224 640 238.3 640 256C640 273.7 625.7 288 608 288H512V320H560C586.5 320 608 341.5 608 368V464C608 490.5 586.5 512 560 512H400C373.5 512 352 490.5 352 464V368C352 341.5 373.5 320 400 320H448V288H192V320H240C266.5 320 288 341.5 288 368V464C288 490.5 266.5 512 240 512H80C53.49 512 32 490.5 32 464V368C32 341.5 53.49 320 80 320H128V288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H288V192H240C213.5 192 192 170.5 192 144V48C192 21.49 213.5 0 240 0H400zM256 64V128H384V64H256zM224 448V384H96V448H224zM416 384V448H544V384H416z"],neuter:[384,512,[9906],"f22c","M368 176c0-97.2-78.8-176-176-176c-97.2 0-176 78.8-176 176c0 86.26 62.1 157.9 144 172.1V496C160 504.8 167.2 512 176 512h32c8.838 0 16-7.164 16-16v-147C305.9 333.9 368 262.3 368 176zM192 272c-52.93 0-96-43.07-96-96c0-52.94 43.07-95.1 96-95.1c52.94 0 96 43.06 96 95.1C288 228.9 244.9 272 192 272z"],newspaper:[512,512,[128240],"f1ea","M480 32H128C110.3 32 96 46.33 96 64v336C96 408.8 88.84 416 80 416S64 408.8 64 400V96H32C14.33 96 0 110.3 0 128v288c0 35.35 28.65 64 64 64h384c35.35 0 64-28.65 64-64V64C512 46.33 497.7 32 480 32zM272 416h-96C167.2 416 160 408.8 160 400C160 391.2 167.2 384 176 384h96c8.836 0 16 7.162 16 16C288 408.8 280.8 416 272 416zM272 320h-96C167.2 320 160 312.8 160 304C160 295.2 167.2 288 176 288h96C280.8 288 288 295.2 288 304C288 312.8 280.8 320 272 320zM432 416h-96c-8.836 0-16-7.164-16-16c0-8.838 7.164-16 16-16h96c8.836 0 16 7.162 16 16C448 408.8 440.8 416 432 416zM432 320h-96C327.2 320 320 312.8 320 304C320 295.2 327.2 288 336 288h96C440.8 288 448 295.2 448 304C448 312.8 440.8 320 432 320zM448 208C448 216.8 440.8 224 432 224h-256C167.2 224 160 216.8 160 208v-96C160 103.2 167.2 96 176 96h256C440.8 96 448 103.2 448 112V208z"],"not-equal":[448,512,[],"f53e","M432 336c0 17.69-14.31 32.01-32 32.01H187.8l-65.15 97.74C116.5 474.1 106.3 480 95.97 480c-6.094 0-12.25-1.75-17.72-5.375c-14.72-9.812-18.69-29.66-8.875-44.38l41.49-62.23H48c-17.69 0-32-14.32-32-32.01s14.31-31.99 32-31.99h105.5l63.1-96H48c-17.69 0-32-14.32-32-32.01s14.31-31.99 32-31.99h212.2l65.18-97.77c9.781-14.69 29.62-18.66 44.37-8.875c14.72 9.812 18.69 29.66 8.875 44.38l-41.51 62.27H400c17.69 0 32 14.31 32 31.99s-14.31 32.01-32 32.01h-105.6l-63.1 96H400C417.7 304 432 318.3 432 336z"],notdef:[384,512,[],"e1fe","M336 0h-288C21.49 0 0 21.49 0 48v416C0 490.5 21.49 512 48 512h288c26.51 0 48-21.49 48-48v-416C384 21.49 362.5 0 336 0zM281.5 64L192 198.3L102.5 64H281.5zM64 121.7L153.5 256L64 390.3V121.7zM102.5 448L192 313.7L281.5 448H102.5zM320 390.3L230.5 256L320 121.7V390.3z"],"note-sticky":[448,512,[62026,"sticky-note"],"f249","M400 32h-352C21.49 32 0 53.49 0 80v352C0 458.5 21.49 480 48 480h245.5c16.97 0 33.25-6.744 45.26-18.75l90.51-90.51C441.3 358.7 448 342.5 448 325.5V80C448 53.49 426.5 32 400 32zM64 96h320l-.001 224H320c-17.67 0-32 14.33-32 32v64H64V96z"],"notes-medical":[512,512,[],"f481","M480 144V384l-96 96H144C117.5 480 96 458.5 96 432v-288C96 117.5 117.5 96 144 96h288C458.5 96 480 117.5 480 144zM384 264C384 259.6 380.4 256 376 256H320V200C320 195.6 316.4 192 312 192h-48C259.6 192 256 195.6 256 200V256H200C195.6 256 192 259.6 192 264v48C192 316.4 195.6 320 200 320H256v56c0 4.375 3.625 8 8 8h48c4.375 0 8-3.625 8-8V320h56C380.4 320 384 316.4 384 312V264zM0 360v-240C0 53.83 53.83 0 120 0h240C373.3 0 384 10.75 384 24S373.3 48 360 48h-240C80.3 48 48 80.3 48 120v240C48 373.3 37.25 384 24 384S0 373.3 0 360z"],o:[448,512,[111],"4f","M224 32.01c-123.5 0-224 100.5-224 224s100.5 224 224 224s224-100.5 224-224S347.5 32.01 224 32.01zM224 416c-88.22 0-160-71.78-160-160s71.78-159.1 160-159.1s160 71.78 160 159.1S312.2 416 224 416z"],"object-group":[576,512,[],"f247","M128 160C128 142.3 142.3 128 160 128H288C305.7 128 320 142.3 320 160V256C320 273.7 305.7 288 288 288H160C142.3 288 128 273.7 128 256V160zM288 320C323.3 320 352 291.3 352 256V224H416C433.7 224 448 238.3 448 256V352C448 369.7 433.7 384 416 384H288C270.3 384 256 369.7 256 352V320H288zM32 119.4C12.87 108.4 0 87.69 0 64C0 28.65 28.65 0 64 0C87.69 0 108.4 12.87 119.4 32H456.6C467.6 12.87 488.3 0 512 0C547.3 0 576 28.65 576 64C576 87.69 563.1 108.4 544 119.4V392.6C563.1 403.6 576 424.3 576 448C576 483.3 547.3 512 512 512C488.3 512 467.6 499.1 456.6 480H119.4C108.4 499.1 87.69 512 64 512C28.65 512 0 483.3 0 448C0 424.3 12.87 403.6 32 392.6V119.4zM119.4 96C113.8 105.7 105.7 113.8 96 119.4V392.6C105.7 398.2 113.8 406.3 119.4 416H456.6C462.2 406.3 470.3 398.2 480 392.6V119.4C470.3 113.8 462.2 105.7 456.6 96H119.4z"],"object-ungroup":[640,512,[],"f248","M32 119.4C12.87 108.4 0 87.69 0 64C0 28.65 28.65 0 64 0C87.69 0 108.4 12.87 119.4 32H328.6C339.6 12.87 360.3 0 384 0C419.3 0 448 28.65 448 64C448 87.69 435.1 108.4 416 119.4V232.6C435.1 243.6 448 264.3 448 288C448 323.3 419.3 352 384 352C360.3 352 339.6 339.1 328.6 320H119.4C108.4 339.1 87.69 352 64 352C28.65 352 0 323.3 0 288C0 264.3 12.87 243.6 32 232.6V119.4zM96 119.4V232.6C105.7 238.2 113.8 246.3 119.4 256H328.6C334.2 246.3 342.3 238.2 352 232.6V119.4C342.3 113.8 334.2 105.7 328.6 96H119.4C113.8 105.7 105.7 113.8 96 119.4V119.4zM311.4 480C300.4 499.1 279.7 512 256 512C220.7 512 192 483.3 192 448C192 424.3 204.9 403.6 224 392.6V352H288V392.6C297.7 398.2 305.8 406.3 311.4 416H520.6C526.2 406.3 534.3 398.2 544 392.6V279.4C534.3 273.8 526.2 265.7 520.6 255.1H474.5C469.1 240.6 459.9 227.1 448 216.4V191.1H520.6C531.6 172.9 552.3 159.1 576 159.1C611.3 159.1 640 188.7 640 223.1C640 247.7 627.1 268.4 608 279.4V392.6C627.1 403.6 640 424.3 640 448C640 483.3 611.3 512 576 512C552.3 512 531.6 499.1 520.6 480H311.4z"],"oil-can":[640,512,[],"f613","M288 128V160H368.9C378.8 160 388.6 162.3 397.5 166.8L448 192L615 156.2C633.1 152.3 645.7 173.8 633.5 187.7L451.1 394.3C438.1 408.1 421.5 416 403.1 416H144C117.5 416 96 394.5 96 368V346.7L28.51 316.7C11.17 308.1 0 291.8 0 272.8V208C0 181.5 21.49 160 48 160H224V128H192C174.3 128 160 113.7 160 96C160 78.33 174.3 64 192 64H320C337.7 64 352 78.33 352 96C352 113.7 337.7 128 320 128L288 128zM96 208H48V272.8L96 294.1V208z"],"oil-well":[576,512,[],"e532","M569.8 215.8C581.2 258.5 555.9 302.4 513.2 313.8L497.7 317.9C480.7 322.5 463.1 312.4 458.5 295.3L433.3 201.3L95.1 288.8V448H137.3L190.4 296.3L264.1 276.1L238.7 352H305.3L277.9 273.6L340 257.5L406.7 448H544C561.7 448 576 462.3 576 480C576 497.7 561.7 512 544 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H48V184C48 170.7 58.75 160 72 160C85.25 160 96 170.7 96 184V222.6L228.2 188.4L241.8 149.4C246.3 136.6 258.4 128 272 128C285.6 128 297.7 136.6 302.2 149.4L308.5 167.5L416.8 139.5L392.3 48.04C387.7 30.97 397.8 13.42 414.9 8.848L430.4 4.707C473-6.729 516.9 18.6 528.3 61.28L569.8 215.8zM205.1 448H338.9L327.7 416H216.3L205.1 448z"],om:[512,512,[128329],"f679","M360.6 61C362.5 62.88 365.2 64 368 64s5.375-1.125 7.375-3l21.5-21.62C398.9 37.38 400 34.75 400 32s-1.125-5.375-3.125-7.375L375.4 3c-4.125-4-10.75-4-14.75 0L339 24.62C337 26.62 336 29.25 336 32s1 5.375 3 7.375L360.6 61zM412.1 191.1c-26.75 0-51.75 10.38-70.63 29.25l-24.25 24.25c-6.75 6.75-15.75 10.5-25.37 10.5H245c10.5-22.12 14.12-48.12 7.75-75.25C242.6 138.2 206.4 104.6 163.2 97.62c-36.25-6-71 5-96 28.75c-7.375 7-7 18.87 1.125 24.87L94.5 170.9c5.75 4.375 13.62 4.375 19.12-.125C122.1 163.8 132.8 159.1 144 159.1c26.38 0 48 21.5 48 48S170.4 255.9 143.1 255.9L112 255.1c-11.88 0-19.75 12.63-14.38 23.25L113.8 311.5C116.2 316.5 121.4 319.5 126.9 320H160c35.25 0 64 28.75 64 64s-28.75 64-64 64c-96.12 0-122.4-53.1-145.2-92C10.25 348.4 0 352.4 0 361.2C-.125 416 41.12 512 160 512c70.5 0 127.1-57.44 127.1-128.1c0-23.38-6.874-45.06-17.87-63.94h21.75c26.62 0 51.75-10.38 70.63-29.25l24.25-24.25c6.75-6.75 15.75-10.5 25.37-10.5C431.9 255.1 448 272.1 448 291.9V392c0 13.25-18.75 24-32 24c-39.38 0-66.75-24.25-81.88-42.88C329.4 367.2 320 370.6 320 378.1V416c0 0 0 64 96 64c48.5 0 96-39.5 96-88V291.9C512 236.8 467.3 191.1 412.1 191.1zM454.3 67.25c-85.5 65.13-169 2.751-172.5 .125c-6-4.625-14.5-4.375-20.13 .5C255.9 72.75 254.3 81 257.9 87.63C259.5 90.63 298.2 160 376.8 160c79.88 0 98.75-31.38 101.8-37.63C479.5 120.2 480 117.9 480 115.5V80C480 66.75 464.9 59.25 454.3 67.25z"],otter:[640,512,[129446],"f700","M224 160c8.836 0 16-7.164 16-16C240 135.2 232.8 128 224 128S208 135.2 208 144C208 152.8 215.2 160 224 160zM96 128C87.16 128 80 135.2 80 144C80 152.8 87.16 160 96 160s16-7.164 16-16C112 135.2 104.8 128 96 128zM474.4 64.12C466.8 63.07 460 69.07 460 76.73c0 5.959 4.188 10.1 9.991 12.36C514.2 99.46 544 160 544 192v112c0 8.844-7.156 16-16 16S512 312.8 512 304V212c0-14.87-15.65-24.54-28.94-17.89c-28.96 14.48-47.83 42.99-50.51 74.88C403.7 285.6 384 316.3 384 352v32H224c17.67 0 32-14.33 32-32c0-17.67-14.33-32-32-32H132.4c-14.46 0-27.37-9.598-31.08-23.57C97.86 283.5 96 269.1 96 256V254.4C101.1 255.3 106.3 256 111.7 256c10.78 0 21.45-2.189 31.36-6.436L160 242.3l16.98 7.271C186.9 253.8 197.6 256 208.3 256c7.176 0 14.11-.9277 20.83-2.426C241.7 292 277.4 320 320 320l36.56-.0366C363.1 294.7 377.1 272.7 396.2 256H320c0-25.73 17.56-31.61 32.31-32C369.8 223.8 384 209.6 384 192c0-17.67-14.31-32-32-32c-15.09 0-32.99 4.086-49.28 13.06C303.3 168.9 304 164.7 304 160.3v-16c0-1.684-.4238-3.248-.4961-4.912C313.2 133.9 320 123.9 320 112C320 103.2 312.8 96 304 96H292.7C274.6 58.26 236.3 32 191.7 32H128.3C83.68 32 45.44 58.26 27.33 96H16C7.164 96 0 103.2 0 112c0 11.93 6.816 21.93 16.5 27.43C16.42 141.1 16 142.7 16 144.3v16c0 19.56 5.926 37.71 16 52.86V256c0 123.7 100.3 224 224 224h160c123.9-1.166 224-101.1 224-226.2C639.9 156.9 567.8 76.96 474.4 64.12zM64 160.3v-16C64 108.9 92.86 80 128.3 80h63.32C227.1 80 256 108.9 256 144.3v16C256 186.6 234.6 208 208.3 208c-4.309 0-8.502-.8608-12.46-2.558L162.1 191.4c2.586-.3066 5.207-.543 7.598-1.631l8.314-3.777C186.9 182.3 192 174.9 192 166.7V160c0-6.723-5.996-12.17-13.39-12.17H141.4C133.1 147.8 128 153.3 128 160v6.701c0 8.15 5.068 15.6 13.09 19.25l8.314 3.777c2.391 1.088 5.012 1.324 7.598 1.631l-32.88 14.08C120.2 207.1 115.1 208 111.7 208C85.38 208 64 186.6 64 160.3z"],outdent:[512,512,["dedent"],"f03b","M32 64C32 46.33 46.33 32 64 32H448C465.7 32 480 46.33 480 64C480 81.67 465.7 96 448 96H64C46.33 96 32 81.67 32 64V64zM224 192C224 174.3 238.3 160 256 160H448C465.7 160 480 174.3 480 192C480 209.7 465.7 224 448 224H256C238.3 224 224 209.7 224 192zM448 288C465.7 288 480 302.3 480 320C480 337.7 465.7 352 448 352H256C238.3 352 224 337.7 224 320C224 302.3 238.3 288 256 288H448zM32 448C32 430.3 46.33 416 64 416H448C465.7 416 480 430.3 480 448C480 465.7 465.7 480 448 480H64C46.33 480 32 465.7 32 448V448zM32.24 268.6C24 262.2 24 249.8 32.24 243.4L134.2 164.1C144.7 155.9 160 163.4 160 176.7V335.3C160 348.6 144.7 356.1 134.2 347.9L32.24 268.6z"],p:[320,512,[112],"50","M160 32.01H32c-17.69 0-32 14.33-32 32v384c0 17.67 14.31 32 32 32s32-14.33 32-32v-96h96c88.22 0 160-71.78 160-159.1S248.2 32.01 160 32.01zM160 288H64V96.01h96c52.94 0 96 43.06 96 96S212.9 288 160 288z"],pager:[512,512,[128223],"f815","M448 64H64C28.63 64 0 92.63 0 128v256c0 35.38 28.62 64 64 64h384c35.38 0 64-28.62 64-64V128C512 92.63 483.4 64 448 64zM160 368H80C71.13 368 64 360.9 64 352v-16C64 327.1 71.13 320 80 320H160V368zM288 352c0 8.875-7.125 16-16 16H192V320h80c8.875 0 16 7.125 16 16V352zM448 224c0 17.62-14.38 32-32 32H96C78.38 256 64 241.6 64 224V160c0-17.62 14.38-32 32-32h320c17.62 0 32 14.38 32 32V224z"],"paint-roller":[512,512,[],"f5aa","M0 64C0 28.65 28.65 0 64 0H352C387.3 0 416 28.65 416 64V128C416 163.3 387.3 192 352 192H64C28.65 192 0 163.3 0 128V64zM160 352C160 334.3 174.3 320 192 320V304C192 259.8 227.8 224 272 224H416C433.7 224 448 209.7 448 192V69.46C485.3 82.64 512 118.2 512 160V192C512 245 469 288 416 288H272C263.2 288 256 295.2 256 304V320C273.7 320 288 334.3 288 352V480C288 497.7 273.7 512 256 512H192C174.3 512 160 497.7 160 480V352z"],paintbrush:[576,512,[128396,"paint-brush"],"f1fc","M224 263.3C224.2 233.3 238.4 205.2 262.4 187.2L499.1 9.605C517.7-4.353 543.6-2.965 560.7 12.9C577.7 28.76 580.8 54.54 568.2 74.07L406.5 324.1C391.3 347.7 366.6 363.2 339.3 367.1L224 263.3zM320 400C320 461.9 269.9 512 208 512H64C46.33 512 32 497.7 32 480C32 462.3 46.33 448 64 448H68.81C86.44 448 98.4 429.1 96.59 411.6C96.2 407.8 96 403.9 96 400C96 339.6 143.9 290.3 203.7 288.1L319.8 392.5C319.9 394.1 320 397.5 320 400V400z"],palette:[512,512,[127912],"f53f","M512 255.1C512 256.9 511.1 257.8 511.1 258.7C511.6 295.2 478.4 319.1 441.9 319.1H344C317.5 319.1 296 341.5 296 368C296 371.4 296.4 374.7 297 377.9C299.2 388.1 303.5 397.1 307.9 407.8C313.9 421.6 320 435.3 320 449.8C320 481.7 298.4 510.5 266.6 511.8C263.1 511.9 259.5 512 256 512C114.6 512 0 397.4 0 256C0 114.6 114.6 0 256 0C397.4 0 512 114.6 512 256V255.1zM96 255.1C78.33 255.1 64 270.3 64 287.1C64 305.7 78.33 319.1 96 319.1C113.7 319.1 128 305.7 128 287.1C128 270.3 113.7 255.1 96 255.1zM128 191.1C145.7 191.1 160 177.7 160 159.1C160 142.3 145.7 127.1 128 127.1C110.3 127.1 96 142.3 96 159.1C96 177.7 110.3 191.1 128 191.1zM256 63.1C238.3 63.1 224 78.33 224 95.1C224 113.7 238.3 127.1 256 127.1C273.7 127.1 288 113.7 288 95.1C288 78.33 273.7 63.1 256 63.1zM384 191.1C401.7 191.1 416 177.7 416 159.1C416 142.3 401.7 127.1 384 127.1C366.3 127.1 352 142.3 352 159.1C352 177.7 366.3 191.1 384 191.1z"],pallet:[640,512,[],"f482","M624 384c8.75 0 16-7.25 16-16v-32c0-8.75-7.25-16-16-16h-608C7.25 320 0 327.3 0 336v32C0 376.8 7.25 384 16 384H64v64H16C7.25 448 0 455.3 0 464v32C0 504.8 7.25 512 16 512h608c8.75 0 16-7.25 16-16v-32c0-8.75-7.25-16-16-16H576v-64H624zM288 448H128v-64h160V448zM512 448h-160v-64h160V448z"],panorama:[640,512,[],"e209","M578.2 66.06C409.8 116.6 230.2 116.6 61.8 66.06C31 56.82 0 79.88 0 112v319.9c0 32.15 30.1 55.21 61.79 45.97c168.4-50.53 347.1-50.53 516.4-.002C608.1 487.2 640 464.1 640 431.1V112C640 79.88 609 56.82 578.2 66.06zM128 224C110.3 224 96 209.7 96 192s14.33-32 32-32c17.68 0 32 14.33 32 32S145.7 224 128 224zM474.3 388.6C423.4 380.3 371.8 376 320 376c-50.45 0-100.7 4.043-150.3 11.93c-14.14 2.246-24.11-13.19-15.78-24.84l49.18-68.56C206.1 290.4 210.9 288 216 288s9.916 2.441 12.93 6.574l32.46 44.51l93.3-139.1C357.7 194.7 362.7 192 368 192s10.35 2.672 13.31 7.125l109.1 165.1C498.1 375.9 488.1 390.8 474.3 388.6z"],"paper-plane":[512,512,[61913],"f1d8","M511.6 36.86l-64 415.1c-1.5 9.734-7.375 18.22-15.97 23.05c-4.844 2.719-10.27 4.097-15.68 4.097c-4.188 0-8.319-.8154-12.29-2.472l-122.6-51.1l-50.86 76.29C226.3 508.5 219.8 512 212.8 512C201.3 512 192 502.7 192 491.2v-96.18c0-7.115 2.372-14.03 6.742-19.64L416 96l-293.7 264.3L19.69 317.5C8.438 312.8 .8125 302.2 .0625 289.1s5.469-23.72 16.06-29.77l448-255.1c10.69-6.109 23.88-5.547 34 1.406S513.5 24.72 511.6 36.86z"],paperclip:[448,512,[128206],"f0c6","M364.2 83.8C339.8 59.39 300.2 59.39 275.8 83.8L91.8 267.8C49.71 309.9 49.71 378.1 91.8 420.2C133.9 462.3 202.1 462.3 244.2 420.2L396.2 268.2C407.1 257.3 424.9 257.3 435.8 268.2C446.7 279.1 446.7 296.9 435.8 307.8L283.8 459.8C219.8 523.8 116.2 523.8 52.2 459.8C-11.75 395.8-11.75 292.2 52.2 228.2L236.2 44.2C282.5-2.08 357.5-2.08 403.8 44.2C450.1 90.48 450.1 165.5 403.8 211.8L227.8 387.8C199.2 416.4 152.8 416.4 124.2 387.8C95.59 359.2 95.59 312.8 124.2 284.2L268.2 140.2C279.1 129.3 296.9 129.3 307.8 140.2C318.7 151.1 318.7 168.9 307.8 179.8L163.8 323.8C157.1 330.5 157.1 341.5 163.8 348.2C170.5 354.9 181.5 354.9 188.2 348.2L364.2 172.2C388.6 147.8 388.6 108.2 364.2 83.8V83.8z"],"parachute-box":[512,512,[],"f4cd","M272 192V320H304C311 320 317.7 321.5 323.7 324.2L443.8 192H415.5C415.8 186.7 416 181.4 416 176C416 112.1 393.8 54.84 358.9 16.69C450 49.27 493.4 122.6 507.8 173.6C510.5 183.1 502.1 192 493.1 192H487.1L346.8 346.3C350.1 352.8 352 360.2 352 368V464C352 490.5 330.5 512 304 512H207.1C181.5 512 159.1 490.5 159.1 464V368C159.1 360.2 161.9 352.8 165.2 346.3L24.92 192H18.89C9 192 1.483 183.1 4.181 173.6C18.64 122.6 61.97 49.27 153.1 16.69C118.2 54.84 96 112.1 96 176C96 181.4 96.16 186.7 96.47 192H68.17L188.3 324.2C194.3 321.5 200.1 320 207.1 320H239.1V192H128.5C128.2 186.7 127.1 181.4 127.1 176C127.1 125 143.9 80.01 168.2 48.43C192.5 16.89 223.8 0 255.1 0C288.2 0 319.5 16.89 343.8 48.43C368.1 80.01 384 125 384 176C384 181.4 383.8 186.7 383.5 192H272z"],paragraph:[448,512,[182],"f1dd","M448 63.1C448 81.67 433.7 96 416 96H384v352c0 17.67-14.33 32-31.1 32S320 465.7 320 448V96h-32v352c0 17.67-14.33 32-31.1 32S224 465.7 224 448v-96H198.9c-83.57 0-158.2-61.11-166.1-144.3C23.66 112.3 98.44 32 191.1 32h224C433.7 32 448 46.33 448 63.1z"],passport:[448,512,[],"f5ab","M129.6 208c5.25 31.25 25.62 57.13 53.25 70.38C175.3 259.4 170.3 235 168.8 208H129.6zM129.6 176h39.13c1.5-27 6.5-51.38 14.12-70.38C155.3 118.9 134.9 144.8 129.6 176zM224 286.8C231.8 279.3 244.8 252.3 247.4 208H200.5C203.3 252.3 216.3 279.3 224 286.8zM265.1 105.6C272.8 124.6 277.8 149 279.3 176h39.13C313.1 144.8 292.8 118.9 265.1 105.6zM384 0H64C28.65 0 0 28.65 0 64v384c0 35.35 28.65 64 64 64h320c35.2 0 64-28.8 64-64V64C448 28.8 419.2 0 384 0zM336 416h-224C103.3 416 96 408.8 96 400S103.3 384 112 384h224c8.75 0 16 7.25 16 16S344.8 416 336 416zM224 320c-70.75 0-128-57.25-128-128s57.25-128 128-128s128 57.25 128 128S294.8 320 224 320zM265.1 278.4c27.62-13.25 48-39.13 53.25-70.38h-39.13C277.8 235 272.8 259.4 265.1 278.4zM200.6 176h46.88C244.7 131.8 231.8 104.8 224 97.25C216.3 104.8 203.2 131.8 200.6 176z"],paste:[512,512,["file-clipboard"],"f0ea","M320 96V80C320 53.49 298.5 32 272 32H215.4C204.3 12.89 183.6 0 160 0S115.7 12.89 104.6 32H48C21.49 32 0 53.49 0 80v320C0 426.5 21.49 448 48 448l144 .0013L192 176C192 131.8 227.8 96 272 96H320zM160 88C146.8 88 136 77.25 136 64S146.8 40 160 40S184 50.75 184 64S173.3 88 160 88zM416 128v96h96L416 128zM384 224L384 128h-112C245.5 128 224 149.5 224 176v288c0 26.51 21.49 48 48 48h192c26.51 0 48-21.49 48-48V256h-95.99C398.4 256 384 241.6 384 224z"],pause:[320,512,[9208],"f04c","M272 63.1l-32 0c-26.51 0-48 21.49-48 47.1v288c0 26.51 21.49 48 48 48L272 448c26.51 0 48-21.49 48-48v-288C320 85.49 298.5 63.1 272 63.1zM80 63.1l-32 0c-26.51 0-48 21.49-48 48v288C0 426.5 21.49 448 48 448l32 0c26.51 0 48-21.49 48-48v-288C128 85.49 106.5 63.1 80 63.1z"],paw:[512,512,[],"f1b0","M226.5 92.85C240.8 135.7 226.2 179.1 193.9 189.7C161.6 200.2 123.8 174 109.5 131.1C95.19 88.26 109.8 44.92 142.1 34.34C174.4 23.77 212.2 49.96 226.5 92.85zM100.4 198.6C119.2 231 114.7 268.7 90.16 282.7C65.65 296.8 30.49 281.9 11.63 249.4C-7.237 216.1-2.664 179.3 21.84 165.3C46.35 151.2 81.51 166.1 100.4 198.6zM69.21 401.2C121.6 259.9 214.7 224 256 224C297.3 224 390.4 259.9 442.8 401.2C446.4 410.9 448 421.3 448 431.7V433.3C448 459.1 427.1 480 401.3 480C389.8 480 378.4 478.6 367.3 475.8L279.3 453.8C263.1 450 248 450 232.7 453.8L144.7 475.8C133.6 478.6 122.2 480 110.7 480C84.93 480 64 459.1 64 433.3V431.7C64 421.3 65.6 410.9 69.21 401.2H69.21zM421.8 282.7C397.3 268.7 392.8 231 411.6 198.6C430.5 166.1 465.7 151.2 490.2 165.3C514.7 179.3 519.2 216.1 500.4 249.4C481.5 281.9 446.3 296.8 421.8 282.7zM310.1 189.7C277.8 179.1 263.2 135.7 277.5 92.85C291.8 49.96 329.6 23.77 361.9 34.34C394.2 44.92 408.8 88.26 394.5 131.1C380.2 174 342.4 200.2 310.1 189.7z"],peace:[512,512,[9774],"f67c","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM224 445.1c-36.36-6.141-69.2-22.48-95.59-46.04L224 322.6V445.1zM288 322.6l95.59 76.47C357.2 422.6 324.4 438.1 288 445.1V322.6zM64 256c0-94.95 69.34-173.8 160-189.1v173.7l-135.7 108.6C72.86 321.6 64 289.8 64 256zM423.7 349.2L288 240.6V66.89C378.7 82.2 448 161.1 448 256C448 289.8 439.1 321.6 423.7 349.2z"],pen:[512,512,[128394],"f304","M362.7 19.32C387.7-5.678 428.3-5.678 453.3 19.32L492.7 58.75C517.7 83.74 517.7 124.3 492.7 149.3L444.3 197.7L314.3 67.72L362.7 19.32zM421.7 220.3L188.5 453.4C178.1 463.8 165.2 471.5 151.1 475.6L30.77 511C22.35 513.5 13.24 511.2 7.03 504.1C.8198 498.8-1.502 489.7 .976 481.2L36.37 360.9C40.53 346.8 48.16 333.9 58.57 323.5L291.7 90.34L421.7 220.3z"],"pen-clip":[512,512,["pen-alt"],"f305","M492.7 58.75C517.7 83.74 517.7 124.3 492.7 149.3L440.6 201.4L310.6 71.43L362.7 19.32C387.7-5.678 428.3-5.678 453.3 19.32L492.7 58.75zM240.1 114.9C231.6 105.5 216.4 105.5 207 114.9L104.1 216.1C95.6 226.3 80.4 226.3 71.03 216.1C61.66 207.6 61.66 192.4 71.03 183L173.1 80.97C201.2 52.85 246.8 52.85 274.9 80.97L417.9 224L229.5 412.5C181.5 460.5 120.3 493.2 53.7 506.5L28.71 511.5C20.84 513.1 12.7 510.6 7.03 504.1C1.356 499.3-1.107 491.2 .4662 483.3L5.465 458.3C18.78 391.7 51.52 330.5 99.54 282.5L254.1 128L240.1 114.9z"],"pen-fancy":[512,512,[128395,10002],"f5ac","M373.5 27.11C388.5 9.885 410.2 0 433 0C476.6 0 512 35.36 512 78.98C512 101.8 502.1 123.5 484.9 138.5L277.7 319L192.1 234.3L373.5 27.11zM255.1 341.7L235.9 425.1C231.9 442.2 218.9 455.8 202 460.5L24.35 510.3L119.7 414.9C122.4 415.6 125.1 416 128 416C145.7 416 160 401.7 160 384C160 366.3 145.7 352 128 352C110.3 352 96 366.3 96 384C96 386.9 96.38 389.6 97.08 392.3L1.724 487.6L51.47 309.1C56.21 293.1 69.8 280.1 86.9 276.1L170.3 256.9L255.1 341.7z"],"pen-nib":[512,512,[10001],"f5ad","M368.4 18.34C390.3-3.526 425.7-3.526 447.6 18.34L493.7 64.4C515.5 86.27 515.5 121.7 493.7 143.6L437.9 199.3L312.7 74.06L368.4 18.34zM417.4 224L371.4 377.3C365.4 397.2 350.2 413 330.5 419.6L66.17 508.2C54.83 512 42.32 509.2 33.74 500.9L187.3 347.3C193.6 350.3 200.6 352 207.1 352C234.5 352 255.1 330.5 255.1 304C255.1 277.5 234.5 256 207.1 256C181.5 256 159.1 277.5 159.1 304C159.1 311.4 161.7 318.4 164.7 324.7L11.11 478.3C2.809 469.7-.04 457.2 3.765 445.8L92.39 181.5C98.1 161.8 114.8 146.6 134.7 140.6L287.1 94.6L417.4 224z"],"pen-ruler":[512,512,["pencil-ruler"],"f5ae","M492.7 42.75C517.7 67.74 517.7 108.3 492.7 133.3L436.3 189.7L322.3 75.72L378.7 19.32C403.7-5.678 444.3-5.678 469.3 19.32L492.7 42.75zM44.89 353.2L299.7 98.34L413.7 212.3L158.8 467.1C152.1 473.8 143.8 478.7 134.6 481.4L30.59 511.1C22.21 513.5 13.19 511.1 7.03 504.1C.8669 498.8-1.47 489.8 .9242 481.4L30.65 377.4C33.26 368.2 38.16 359.9 44.89 353.2zM249.4 103.4L103.4 249.4L16 161.9C-2.745 143.2-2.745 112.8 16 94.06L94.06 16C112.8-2.745 143.2-2.745 161.9 16L181.7 35.76C181.4 36.05 181 36.36 180.7 36.69L116.7 100.7C110.4 106.9 110.4 117.1 116.7 123.3C122.9 129.6 133.1 129.6 139.3 123.3L203.3 59.31C203.6 58.99 203.1 58.65 204.2 58.3L249.4 103.4zM453.7 307.8C453.4 308 453 308.4 452.7 308.7L388.7 372.7C382.4 378.9 382.4 389.1 388.7 395.3C394.9 401.6 405.1 401.6 411.3 395.3L475.3 331.3C475.6 330.1 475.1 330.6 476.2 330.3L496 350.1C514.7 368.8 514.7 399.2 496 417.9L417.9 496C399.2 514.7 368.8 514.7 350.1 496L262.6 408.6L408.6 262.6L453.7 307.8z"],"pen-to-square":[512,512,["edit"],"f044","M490.3 40.4C512.2 62.27 512.2 97.73 490.3 119.6L460.3 149.7L362.3 51.72L392.4 21.66C414.3-.2135 449.7-.2135 471.6 21.66L490.3 40.4zM172.4 241.7L339.7 74.34L437.7 172.3L270.3 339.6C264.2 345.8 256.7 350.4 248.4 353.2L159.6 382.8C150.1 385.6 141.5 383.4 135 376.1C128.6 370.5 126.4 361 129.2 352.4L158.8 263.6C161.6 255.3 166.2 247.8 172.4 241.7V241.7zM192 63.1C209.7 63.1 224 78.33 224 95.1C224 113.7 209.7 127.1 192 127.1H96C78.33 127.1 64 142.3 64 159.1V416C64 433.7 78.33 448 96 448H352C369.7 448 384 433.7 384 416V319.1C384 302.3 398.3 287.1 416 287.1C433.7 287.1 448 302.3 448 319.1V416C448 469 405 512 352 512H96C42.98 512 0 469 0 416V159.1C0 106.1 42.98 63.1 96 63.1H192z"],pencil:[512,512,[61504,9999,"pencil-alt"],"f303","M421.7 220.3L188.5 453.4L154.6 419.5L158.1 416H112C103.2 416 96 408.8 96 400V353.9L92.51 357.4C87.78 362.2 84.31 368 82.42 374.4L59.44 452.6L137.6 429.6C143.1 427.7 149.8 424.2 154.6 419.5L188.5 453.4C178.1 463.8 165.2 471.5 151.1 475.6L30.77 511C22.35 513.5 13.24 511.2 7.03 504.1C.8198 498.8-1.502 489.7 .976 481.2L36.37 360.9C40.53 346.8 48.16 333.9 58.57 323.5L291.7 90.34L421.7 220.3zM492.7 58.75C517.7 83.74 517.7 124.3 492.7 149.3L444.3 197.7L314.3 67.72L362.7 19.32C387.7-5.678 428.3-5.678 453.3 19.32L492.7 58.75z"],"people-arrows":[576,512,["people-arrows-left-right"],"e068","M96 304.1c0-12.16 4.971-23.83 13.64-32.01l72.13-68.08c1.65-1.555 3.773-2.311 5.611-3.578C177.1 176.8 155 160 128 160H64C28.65 160 0 188.7 0 224v96c0 17.67 14.33 32 31.1 32L32 480c0 17.67 14.33 32 32 32h64c17.67 0 32-14.33 32-32v-96.39l-50.36-47.53C100.1 327.9 96 316.2 96 304.1zM480 128c35.38 0 64-28.62 64-64s-28.62-64-64-64s-64 28.62-64 64S444.6 128 480 128zM96 128c35.38 0 64-28.62 64-64S131.4 0 96 0S32 28.62 32 64S60.63 128 96 128zM444.4 295.3L372.3 227.3c-3.49-3.293-8.607-4.193-13.01-2.299C354.9 226.9 352 231.2 352 236V272H224V236c0-4.795-2.857-9.133-7.262-11.03C212.3 223.1 207.2 223.1 203.7 227.3L131.6 295.3c-4.805 4.535-4.805 12.94 0 17.47l72.12 68.07c3.49 3.291 8.607 4.191 13.01 2.297C221.1 381.3 224 376.9 224 372.1V336h128v36.14c0 4.795 2.857 9.135 7.262 11.04c4.406 1.893 9.523 .9922 13.01-2.299l72.12-68.07C449.2 308.3 449.2 299.9 444.4 295.3zM512 160h-64c-26.1 0-49.98 16.77-59.38 40.42c1.842 1.271 3.969 2.027 5.623 3.588l72.12 68.06C475 280.2 480 291.9 480 304.1c.002 12.16-4.969 23.83-13.64 32.01L416 383.6V480c0 17.67 14.33 32 32 32h64c17.67 0 32-14.33 32-32v-128c17.67 0 32-14.33 32-32V224C576 188.7 547.3 160 512 160z"],"people-carry-box":[640,512,["people-carry"],"f4ce","M128 95.1c26.5 0 47.1-21.5 47.1-47.1S154.5 0 128 0S80.01 21.5 80.01 47.1S101.5 95.1 128 95.1zM511.1 95.1c26.5 0 47.1-21.5 47.1-47.1S538.5 0 511.1 0c-26.5 0-48 21.5-48 47.1S485.5 95.1 511.1 95.1zM603.5 258.3l-18.5-80.13c-4.625-20-18.62-36.88-37.5-44.88c-18.5-8-38.1-6.75-56.12 3.25c-22.62 13.38-39.62 34.5-48.12 59.38l-11.25 33.88l-15.1 10.25L415.1 144c0-8.75-7.25-16-16-16H240c-8.75 0-16 7.25-16 16L224 239.1l-16.12-10.25l-11.25-33.88c-8.375-25-25.38-46-48.12-59.38c-17.25-10-37.63-11.25-56.12-3.25c-18.88 8-32.88 24.88-37.5 44.88l-18.37 80.13c-4.625 20 .7506 41.25 14.37 56.75l67.25 75.88l10.12 92.63C130 499.8 143.8 512 160 512c1.25 0 2.25-.125 3.5-.25c17.62-1.875 30.25-17.62 28.25-35.25l-10-92.75c-1.5-13-7-25.12-15.62-35l-43.37-49l17.62-70.38l6.876 20.38c4 12.5 11.87 23.5 24.5 32.63l51 32.5c4.623 2.875 12.12 4.625 17.25 5h159.1c5.125-.375 12.62-2.125 17.25-5l51-32.5c12.62-9.125 20.5-20 24.5-32.63l6.875-20.38l17.63 70.38l-43.37 49c-8.625 9.875-14.12 22-15.62 35l-10 92.75c-2 17.62 10.75 33.38 28.25 35.25C477.7 511.9 478.7 512 479.1 512c16.12 0 29.1-12.12 31.75-28.5l10.12-92.63L589.1 315C602.7 299.5 608.1 278.3 603.5 258.3zM46.26 358.1l-44 110c-6.5 16.38 1.5 35 17.88 41.63c16.75 6.5 35.12-1.75 41.62-17.88l27.62-69.13l-2-18.25L46.26 358.1zM637.7 468.1l-43.1-110l-41.13 46.38l-2 18.25l27.62 69.13C583.2 504.4 595.2 512 607.1 512c3.998 0 7.998-.75 11.87-2.25C636.2 503.1 644.2 484.5 637.7 468.1z"],"people-group":[640,512,[],"e533","M184 88C184 118.9 158.9 144 128 144C97.07 144 72 118.9 72 88C72 57.07 97.07 32 128 32C158.9 32 184 57.07 184 88zM208.4 196.3C178.7 222.7 160 261.2 160 304C160 338.3 171.1 369.8 192 394.5V416C192 433.7 177.7 448 160 448H96C78.33 448 64 433.7 64 416V389.2C26.16 371.2 0 332.7 0 288C0 226.1 50.14 176 112 176H144C167.1 176 190.2 183.5 208.4 196.3V196.3zM64 245.7C54.04 256.9 48 271.8 48 288C48 304.2 54.04 319.1 64 330.3V245.7zM448 416V394.5C468 369.8 480 338.3 480 304C480 261.2 461.3 222.7 431.6 196.3C449.8 183.5 472 176 496 176H528C589.9 176 640 226.1 640 288C640 332.7 613.8 371.2 576 389.2V416C576 433.7 561.7 448 544 448H480C462.3 448 448 433.7 448 416zM576 330.3C585.1 319.1 592 304.2 592 288C592 271.8 585.1 256.9 576 245.7V330.3zM568 88C568 118.9 542.9 144 512 144C481.1 144 456 118.9 456 88C456 57.07 481.1 32 512 32C542.9 32 568 57.07 568 88zM256 96C256 60.65 284.7 32 320 32C355.3 32 384 60.65 384 96C384 131.3 355.3 160 320 160C284.7 160 256 131.3 256 96zM448 304C448 348.7 421.8 387.2 384 405.2V448C384 465.7 369.7 480 352 480H288C270.3 480 256 465.7 256 448V405.2C218.2 387.2 192 348.7 192 304C192 242.1 242.1 192 304 192H336C397.9 192 448 242.1 448 304zM256 346.3V261.7C246 272.9 240 287.8 240 304C240 320.2 246 335.1 256 346.3zM384 261.7V346.3C393.1 335 400 320.2 400 304C400 287.8 393.1 272.9 384 261.7z"],"people-line":[640,512,[],"e534","M360 72C360 94.09 342.1 112 320 112C297.9 112 280 94.09 280 72C280 49.91 297.9 32 320 32C342.1 32 360 49.91 360 72zM104 168C104 145.9 121.9 128 144 128C166.1 128 184 145.9 184 168C184 190.1 166.1 208 144 208C121.9 208 104 190.1 104 168zM608 416C625.7 416 640 430.3 640 448C640 465.7 625.7 480 608 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H608zM456 168C456 145.9 473.9 128 496 128C518.1 128 536 145.9 536 168C536 190.1 518.1 208 496 208C473.9 208 456 190.1 456 168zM200 352C200 369.7 185.7 384 168 384H120C102.3 384 88 369.7 88 352V313.5L61.13 363.4C54.85 375 40.29 379.4 28.62 373.1C16.95 366.8 12.58 352.3 18.87 340.6L56.75 270.3C72.09 241.8 101.9 224 134.2 224H153.8C170.1 224 185.7 228.5 199.2 236.6L232.7 174.3C248.1 145.8 277.9 128 310.2 128H329.8C362.1 128 391.9 145.8 407.3 174.3L440.8 236.6C454.3 228.5 469.9 224 486.2 224H505.8C538.1 224 567.9 241.8 583.3 270.3L621.1 340.6C627.4 352.3 623 366.8 611.4 373.1C599.7 379.4 585.2 375 578.9 363.4L552 313.5V352C552 369.7 537.7 384 520 384H472C454.3 384 440 369.7 440 352V313.5L413.1 363.4C406.8 375 392.3 379.4 380.6 373.1C368.1 366.8 364.6 352.3 370.9 340.6L407.2 273.1C405.5 271.5 404 269.6 402.9 267.4L376 217.5V272C376 289.7 361.7 304 344 304H295.1C278.3 304 263.1 289.7 263.1 272V217.5L237.1 267.4C235.1 269.6 234.5 271.5 232.8 273.1L269.1 340.6C275.4 352.3 271 366.8 259.4 373.1C247.7 379.4 233.2 375 226.9 363.4L199.1 313.5L200 352z"],"people-pulling":[576,512,[],"e535","M32 48C32 21.49 53.49 0 80 0C106.5 0 128 21.49 128 48C128 74.51 106.5 96 80 96C53.49 96 32 74.51 32 48V48zM118.3 128C130.1 128 143.5 130.5 155.2 135.4L289.3 191.2C302.6 171.1 320.1 156.6 342.7 146.9L353.7 142C374.5 132.8 396.1 128 419.7 128C464.3 128 504.5 154.8 521.6 195.9L536.1 232.7L558.3 243.4C574.1 251.3 580.5 270.5 572.6 286.3C564.7 302.1 545.5 308.5 529.7 300.6L503 287.3C492.7 282.1 484.6 273.4 480.2 262.8L470.6 239.8L451.3 305.3L500.8 359.4C506.2 365.3 510.1 372.4 512 380.2L535 472.2C539.3 489.4 528.9 506.8 511.8 511C494.6 515.3 477.2 504.9 472.1 487.8L450.9 399.6L380.3 322.5C365.5 306.4 359.1 283.9 365.6 262.8L382.5 199.3C381.6 199.7 380.6 200.1 379.7 200.5L368.7 205.4C353.4 212.2 341.4 224.6 335.2 240.1L333.7 243.9C328.6 256.7 316.1 264.4 303 263.1C299.2 263.9 295.4 263.1 291.7 261.5L173.3 212.2L231.2 473.1C235.1 490.3 224.2 507.4 206.9 511.2C189.7 515.1 172.6 504.2 168.8 486.9L138.8 352H123.1L143.6 474.7C146.5 492.2 134.7 508.7 117.3 511.6C99.83 514.5 83.34 502.7 80.44 485.3L56.35 340.8C50.48 347.6 41.75 352 32 352C14.33 352 0 337.7 0 319.1V191.1C0 156.7 28.65 127.1 64 127.1L118.3 128zM416 48C416 21.49 437.5 0 464 0C490.5 0 512 21.49 512 48C512 74.51 490.5 96 464 96C437.5 96 416 74.51 416 48V48zM356.7 344.2L397.4 388.6L382.9 424.8C380.5 430.9 376.9 436.4 372.3 440.9L310.6 502.6C298.1 515.1 277.9 515.1 265.4 502.6C252.9 490.1 252.9 469.9 265.4 457.4L324.7 398L349.7 335.6C351.8 338.6 354.2 341.4 356.7 344.2H356.7z"],"people-robbery":[576,512,[],"e536","M496.1 24.24C501.2 7.093 518.6-3.331 535.8 .9552C552.9 5.242 563.3 22.62 559 39.76L550.3 74.63C539.3 118.6 510.1 154.2 472 174.3V480C472 497.7 457.7 512 440 512C422.3 512 408 497.7 408 480V352H392V480C392 497.7 377.7 512 360 512C342.3 512 328 497.7 328 480V174.3C289.9 154.2 260.7 118.6 249.7 74.63L240.1 39.76C236.7 22.62 247.1 5.242 264.2 .9552C281.4-3.331 298.8 7.093 303 24.24L311.8 59.1C321.9 99.59 358.3 127.1 400 127.1C441.7 127.1 478.1 99.59 488.2 59.1L496.1 24.24zM352 47.1C352 21.49 373.5-.0006 400-.0006C426.5-.0006 448 21.49 448 47.1C448 74.51 426.5 95.1 400 95.1C373.5 95.1 352 74.51 352 47.1V47.1zM32.01 48C32.01 21.49 53.5 0 80.01 0C106.5 0 128 21.49 128 48C128 74.51 106.5 96 80.01 96C53.5 96 32.01 74.51 32.01 48V48zM104.7 128C132.1 128 157.6 142 172.2 165.1L209.6 224H240C257.7 224 272 238.3 272 256C272 273.7 257.7 288 240 288H192C181 288 170.9 282.4 164.1 273.1L152 252.7V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V352H72V480C72 497.7 57.68 512 40 512C22.33 512 8.005 497.7 8.005 480V288.6L8 287.1V191.1C8 156.7 36.65 127.1 72 127.1L104.7 128z"],"people-roof":[640,512,[],"e537","M623.5 164C638.1 172.6 644.6 192.1 635.1 207.5C627.4 222.1 607.9 228.6 592.5 219.1L319.1 68.61L47.54 219.1C32.09 228.6 12.61 222.1 4.025 207.5C-4.558 192.1 1.008 172.6 16.46 164L304.5 4.027C314.1-1.342 325.9-1.342 335.5 4.027L623.5 164zM279.1 200C279.1 177.9 297.9 160 319.1 160C342.1 160 359.1 177.9 359.1 200C359.1 222.1 342.1 240 319.1 240C297.9 240 279.1 222.1 279.1 200zM103.1 296C103.1 273.9 121.9 256 143.1 256C166.1 256 183.1 273.9 183.1 296C183.1 318.1 166.1 336 143.1 336C121.9 336 103.1 318.1 103.1 296V296zM535.1 296C535.1 318.1 518.1 336 495.1 336C473.9 336 455.1 318.1 455.1 296C455.1 273.9 473.9 256 495.1 256C518.1 256 535.1 273.9 535.1 296zM226.9 491.4L199.1 441.5V480C199.1 497.7 185.7 512 167.1 512H119.1C102.3 512 87.1 497.7 87.1 480V441.5L61.13 491.4C54.84 503 40.29 507.4 28.62 501.1C16.95 494.8 12.58 480.3 18.87 468.6L56.74 398.3C72.09 369.8 101.9 352 134.2 352H153.8C170.1 352 185.7 356.5 199.2 364.6L232.7 302.3C248.1 273.8 277.9 255.1 310.2 255.1H329.8C362.1 255.1 391.9 273.8 407.3 302.3L440.8 364.6C454.3 356.5 469.9 352 486.2 352H505.8C538.1 352 567.9 369.8 583.3 398.3L621.1 468.6C627.4 480.3 623 494.8 611.4 501.1C599.7 507.4 585.2 503 578.9 491.4L551.1 441.5V480C551.1 497.7 537.7 512 519.1 512H471.1C454.3 512 439.1 497.7 439.1 480V441.5L413.1 491.4C406.8 503 392.3 507.4 380.6 501.1C368.1 494.8 364.6 480.3 370.9 468.6L407.2 401.1C405.5 399.5 404 397.6 402.9 395.4L375.1 345.5V400C375.1 417.7 361.7 432 343.1 432H295.1C278.3 432 263.1 417.7 263.1 400V345.5L237.1 395.4C235.1 397.6 234.5 399.5 232.8 401.1L269.1 468.6C275.4 480.3 271 494.8 259.4 501.1C247.7 507.4 233.2 503 226.9 491.4H226.9z"],"pepper-hot":[512,512,[127798],"f816","M465 134.2c21.46-38.38 19.87-87.17-5.65-123.1c-7.541-10.83-22.31-13.53-33.2-5.938c-10.77 7.578-13.44 22.55-5.896 33.41c14.41 20.76 15.13 47.69 4.098 69.77C407.1 100.1 388 95.1 368 95.1c-36.23 0-68.93 13.83-94.24 35.92L352 165.5V256h90.56l33.53 78.23C498.2 308.9 512 276.2 512 239.1C512 198 493.7 160.6 465 134.2zM320 288V186.6l-52.95-22.69C216.2 241.3 188.5 400 56 400C25.13 400 0 425.1 0 456S25.13 512 56 512c180.3 0 320.1-88.27 389.3-168.5L421.5 288H320z"],percent:[384,512,[62101,62785,"percentage"],"25","M374.6 73.39c-12.5-12.5-32.75-12.5-45.25 0l-320 320c-12.5 12.5-12.5 32.75 0 45.25C15.63 444.9 23.81 448 32 448s16.38-3.125 22.62-9.375l320-320C387.1 106.1 387.1 85.89 374.6 73.39zM64 192c35.3 0 64-28.72 64-64S99.3 64.01 64 64.01S0 92.73 0 128S28.7 192 64 192zM320 320c-35.3 0-64 28.72-64 64s28.7 64 64 64s64-28.72 64-64S355.3 320 320 320z"],person:[320,512,[129485,"male"],"f183","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L315.4 271.5C324.5 286.7 319.6 306.3 304.5 315.4C289.3 324.5 269.7 319.6 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352z"],"person-arrow-down-to-line":[640,512,[],"e538","M144 48C144 21.49 165.5 0 192 0C218.5 0 240 21.49 240 48C240 74.51 218.5 96 192 96C165.5 96 144 74.51 144 48zM120 256.9L91.43 304.5C82.33 319.6 62.67 324.5 47.52 315.4C32.37 306.3 27.47 286.7 36.57 271.5L94.85 174.6C112.2 145.7 143.4 128 177.1 128H206.9C240.6 128 271.8 145.7 289.2 174.6L347.4 271.5C356.5 286.7 351.6 306.3 336.5 315.4C321.3 324.5 301.7 319.6 292.6 304.5L264 256.9V448H608C625.7 448 640 462.3 640 480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H120L120 256.9zM200 448V352H184V448H200zM393.4 326.6C380.9 314.1 380.9 293.9 393.4 281.4C405.9 268.9 426.1 268.9 438.6 281.4L464 306.7V64C464 46.33 478.3 32 496 32C513.7 32 528 46.33 528 64V306.7L553.4 281.4C565.9 268.9 586.1 268.9 598.6 281.4C611.1 293.9 611.1 314.1 598.6 326.6L518.6 406.6C506.1 419.1 485.9 419.1 473.4 406.6L393.4 326.6z"],"person-arrow-up-from-line":[640,512,[],"e539","M144 48C144 21.49 165.5 0 192 0C218.5 0 240 21.49 240 48C240 74.51 218.5 96 192 96C165.5 96 144 74.51 144 48zM120 256.9L91.43 304.5C82.33 319.6 62.67 324.5 47.52 315.4C32.37 306.3 27.47 286.7 36.57 271.5L94.85 174.6C112.2 145.7 143.4 128 177.1 128H206.9C240.6 128 271.8 145.7 289.2 174.6L347.4 271.5C356.5 286.7 351.6 306.3 336.5 315.4C321.3 324.5 301.7 319.6 292.6 304.5L264 256.9V448H608C625.7 448 640 462.3 640 480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H120L120 256.9zM200 448V352H184V448H200zM598.6 121.4C611.1 133.9 611.1 154.1 598.6 166.6C586.1 179.1 565.9 179.1 553.4 166.6L528 141.3V384C528 401.7 513.7 416 496 416C478.3 416 464 401.7 464 384V141.3L438.6 166.6C426.1 179.1 405.9 179.1 393.4 166.6C380.9 154.1 380.9 133.9 393.4 121.4L473.4 41.37C485.9 28.88 506.1 28.88 518.6 41.37L598.6 121.4z"],"person-biking":[640,512,[128692,"biking"],"f84a","M352 48C352 21.49 373.5 0 400 0C426.5 0 448 21.49 448 48C448 74.51 426.5 96 400 96C373.5 96 352 74.51 352 48zM480 159.1C497.7 159.1 512 174.3 512 191.1C512 209.7 497.7 223.1 480 223.1H416C408.7 223.1 401.7 221.5 396 216.1L355.3 184.4L295 232.9L337.8 261.4C346.7 267.3 352 277.3 352 288V416C352 433.7 337.7 448 320 448C302.3 448 288 433.7 288 416V305.1L227.5 266.8C194.7 245.1 192.5 198.9 223.2 175.2L306.3 110.9C323.8 97.45 348.1 97.58 365.4 111.2L427.2 159.1H480zM256 384C256 454.7 198.7 512 128 512C57.31 512 0 454.7 0 384C0 313.3 57.31 256 128 256C198.7 256 256 313.3 256 384zM128 312C88.24 312 56 344.2 56 384C56 423.8 88.24 456 128 456C167.8 456 200 423.8 200 384C200 344.2 167.8 312 128 312zM640 384C640 454.7 582.7 512 512 512C441.3 512 384 454.7 384 384C384 313.3 441.3 256 512 256C582.7 256 640 313.3 640 384zM512 312C472.2 312 440 344.2 440 384C440 423.8 472.2 456 512 456C551.8 456 584 423.8 584 384C584 344.2 551.8 312 512 312z"],"person-booth":[576,512,[],"f756","M192 496C192 504.8 199.3 512 208 512h32C248.8 512 256 504.8 256 496V320H192V496zM544 0h-32v496c0 8.75 7.25 16 16 16h32c8.75 0 16-7.25 16-16V32C576 14.25 561.8 0 544 0zM64 128c26.5 0 48-21.5 48-48S90.5 32 64 32S16 53.5 16 80S37.5 128 64 128zM224 224H173.1L127.9 178.8C115.8 166.6 99.75 160 82.75 160H64C46.88 160 30.75 166.8 18.75 178.8c-12 12.12-18.72 28.22-18.72 45.35L0 480c0 17.75 14.25 32 31.88 32s32-14.25 32-32L64 379.3c.875 .5 1.625 1.375 2.5 1.75L95.63 424V480c0 17.75 14.25 32 32 32c17.62 0 32-14.25 32-32v-56.5c0-9.875-2.375-19.75-6.75-28.62l-41.13-61.25V253l20.88 20.88C141.8 283 153.8 288 166.5 288H224c17.75 0 32-14.25 32-32S241.8 224 224 224zM192 32v160h64V0H224C206.3 0 192 14.25 192 32zM288 32l31.5 223.1l-30.88 154.6C284.3 431.3 301.6 448 320 448c15.25 0 27.99-9.125 32.24-30.38C353.3 434.5 366.9 448 384 448c17.75 0 32-14.25 32-32c0 17.75 14.25 32 32 32s32-14.25 32-32V0h-192V32z"],"person-breastfeeding":[448,512,[],"e53a","M144 80C144 35.82 179.8 0 224 0C268.2 0 304 35.82 304 80C304 124.2 268.2 160 224 160C179.8 160 144 124.2 144 80zM436.8 382.8L373.5 461.1C356.9 482.7 326.7 486 306 469.5C288.4 455.4 283.3 431.3 292.5 411.7L291.7 411.6C252.8 406.1 217.4 386.5 192 356.8V320C192 302.3 177.7 288 160 288C142.3 288 128 302.3 128 320V368C128 368.8 128 369.6 128.1 370.4L229.5 421.1C253.2 432.9 262.8 461.8 250.9 485.5C239.1 509.2 210.2 518.8 186.5 506.9L27.21 427.3C26.11 426.7 25.02 426.2 23.95 425.5C19.04 422.7 14.79 419.1 11.3 414.1C6.732 409.5 3.492 403.3 1.683 396.6C-1.576 384.6-.1811 371.4 6.459 359.9C7.098 358.8 7.776 357.8 8.489 356.7L75.56 256.1C102.3 216.1 147.2 192 195.4 192H270.6C317.1 192 360.7 214.5 387.8 252.3L438.5 323.2C440.7 326.2 442.5 329.4 443.9 332.7C446.9 339.3 448.2 346.4 447.1 353.5C447.7 364.1 443.8 374.5 436.8 382.8V382.8zM276 288C251.7 288 232 307.7 232 332C232 356.3 251.7 376 276 376C300.3 376 320 356.3 320 332C320 307.7 300.3 288 276 288z"],"person-burst":[640,512,[],"e53b","M431.1 48C431.1 21.49 453.5 0 479.1 0C506.5 0 527.1 21.49 527.1 48C527.1 74.51 506.5 96 479.1 96C453.5 96 431.1 74.51 431.1 48zM439.1 512C422.3 512 407.1 497.7 407.1 480V256.9L379.4 304.5C370.3 319.6 350.7 324.5 335.5 315.4C320.4 306.3 315.5 286.7 324.6 271.5L382.8 174.6C400.2 145.7 431.4 128 465.1 128H494.9C528.6 128 559.8 145.7 577.2 174.6L635.4 271.5C644.5 286.7 639.6 306.3 624.5 315.4C609.3 324.5 589.7 319.6 580.6 304.5L551.1 256.9V480C551.1 497.7 537.7 512 519.1 512C502.3 512 487.1 497.7 487.1 480V352H471.1V480C471.1 497.7 457.7 512 439.1 512L439.1 512zM220.3 92.05L296.4 68.93C302.7 67.03 309.5 69.14 313.6 74.27C317.7 79.39 318.2 86.49 314.1 92.18L275.5 161.3L330.7 199.3L306.3 239.8L255.8 247.6L261.4 327C261.8 333.6 258.3 339.7 252.4 342.6C246.5 345.4 239.4 344.4 234.6 339.9L175.1 286.1L117.4 339.9C112.6 344.4 105.5 345.4 99.63 342.6C93.73 339.7 90.15 333.6 90.62 327L96.21 247.6L17.55 235.4C11.08 234.4 5.868 229.6 4.41 223.2C2.951 216.8 5.538 210.1 10.94 206.4L76.5 161.3L37.01 92.18C33.76 86.49 34.31 79.39 38.39 74.27C42.48 69.14 49.28 67.03 55.55 68.93L131.7 92.05L161.1 18.09C163.6 11.1 169.4 7.1 175.1 7.1C182.6 7.1 188.4 11.1 190.9 18.09L220.3 92.05z"],"person-cane":[384,512,[],"e53c","M240 48C240 74.51 218.5 96 192 96C165.5 96 144 74.51 144 48C144 21.49 165.5 0 192 0C218.5 0 240 21.49 240 48zM232 480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H181C209.6 128 236.7 140.7 254.9 162.7L328.6 251.6C339.9 265.2 338 285.3 324.4 296.6C310.8 307.9 290.7 306 279.4 292.4L232 235.3L232 480zM320 384C320 397.3 309.3 408 296 408C282.7 408 272 397.3 272 384V376C272 345.1 297.1 320 328 320C358.9 320 384 345.1 384 376V488C384 501.3 373.3 512 360 512C346.7 512 336 501.3 336 488V376C336 371.6 332.4 368 328 368C323.6 368 320 371.6 320 376V384z"],"person-chalkboard":[640,512,[],"e53d","M144 48C144 21.49 165.5 0 192 0C218.5 0 240 21.49 240 48C240 74.51 218.5 96 192 96C165.5 96 144 74.51 144 48zM152 512C134.3 512 120 497.7 120 480V256.9L91.43 304.5C82.33 319.6 62.67 324.5 47.52 315.4C32.37 306.3 27.47 286.7 36.58 271.5L94.85 174.6C112.2 145.7 143.4 128 177.1 128H320V48C320 21.49 341.5 .0003 368 .0003H592C618.5 .0003 640 21.49 640 48V272C640 298.5 618.5 320 592 320H368C341.5 320 320 298.5 320 272V224H384V256H576V64H384V128H400C417.7 128 432 142.3 432 160C432 177.7 417.7 192 400 192H264V480C264 497.7 249.7 512 232 512C214.3 512 200 497.7 200 480V352H184V480C184 497.7 169.7 512 152 512L152 512z"],"person-circle-check":[576,512,[],"e53e","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM476.7 324.7L416 385.4L387.3 356.7C381.1 350.4 370.9 350.4 364.7 356.7C358.4 362.9 358.4 373.1 364.7 379.3L404.7 419.3C410.9 425.6 421.1 425.6 427.3 419.3L499.3 347.3C505.6 341.1 505.6 330.9 499.3 324.7C493.1 318.4 482.9 318.4 476.7 324.7H476.7z"],"person-circle-exclamation":[576,512,[],"e53f","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM415.1 288V368C415.1 376.8 423.2 384 431.1 384C440.8 384 447.1 376.8 447.1 368V288C447.1 279.2 440.8 272 431.1 272C423.2 272 415.1 279.2 415.1 288z"],"person-circle-minus":[576,512,[],"e540","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM496 351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1z"],"person-circle-plus":[576,512,[],"e541","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM448 303.1C448 295.2 440.8 287.1 432 287.1C423.2 287.1 416 295.2 416 303.1V351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H416V431.1C416 440.8 423.2 447.1 432 447.1C440.8 447.1 448 440.8 448 431.1V383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1H448V303.1z"],"person-circle-question":[576,512,[],"e542","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM368 328C368 336.8 375.2 344 384 344C392.8 344 400 336.8 400 328V321.6C400 316.3 404.3 312 409.6 312H450.1C457.8 312 464 318.2 464 325.9C464 331.1 461.1 335.8 456.6 338.3L424.6 355.1C419.3 357.9 416 363.3 416 369.2V384C416 392.8 423.2 400 432 400C440.8 400 448 392.8 448 384V378.9L471.5 366.6C486.5 358.6 496 342.1 496 325.9C496 300.6 475.4 280 450.1 280H409.6C386.6 280 368 298.6 368 321.6V328z"],"person-circle-xmark":[576,512,[],"e543","M208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48zM152 352V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H174.9C208.6 128 239.8 145.7 257.2 174.6L302.1 249.3C285.1 266.9 273.4 287.7 265.5 310.8C263.6 308.9 261.1 306.8 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352L152 352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM491.3 331.3C497.6 325.1 497.6 314.9 491.3 308.7C485.1 302.4 474.9 302.4 468.7 308.7L432 345.4L395.3 308.7C389.1 302.4 378.9 302.4 372.7 308.7C366.4 314.9 366.4 325.1 372.7 331.3L409.4 368L372.7 404.7C366.4 410.9 366.4 421.1 372.7 427.3C378.9 433.6 389.1 433.6 395.3 427.3L432 390.6L468.7 427.3C474.9 433.6 485.1 433.6 491.3 427.3C497.6 421.1 497.6 410.9 491.3 404.7L454.6 368L491.3 331.3z"],"person-digging":[576,512,["digging"],"f85e","M272 95.93c26.5 0 47.99-21.47 47.99-47.97S298.5 0 272 0C245.5 0 224 21.47 224 47.97S245.5 95.93 272 95.93zM209.7 357.3c-25.75-17.25-52.25-33.24-79.5-48.11L58.62 270.2L1.246 471.1c-4.875 16.1 4.1 34.74 22 39.62s34.63-4.998 39.5-21.99l36.63-128.1l60.63 40.37v78.86c0 17.62 14.38 31.99 32 31.99s32-14.37 32-31.99l.0022-95.93C224 373.2 218.6 363.2 209.7 357.3zM311.1 416c-13.88 0-25.95 8.863-30.33 21.86l-24.75 74.07h319.9l-101.9-206.3c-11.38-22.49-43.1-23.63-56.1-2.01l-31.89 54.21l-65.26-35.64l-24-121.2C288.1 161.3 263.2 127.7 227.1 109.7c-1-.4999-2.125-.625-3.125-1.125c-2.25-1.125-4.752-1.1-7.252-2.625C201.5 99.85 185.2 95.98 168.7 95.98H95.1c-9.25 0-18.05 4.061-24.18 10.93l-55.95 63.92c-.75 .9998-1.5 2.124-2.25 3.249c-8.875 13.1-3 32.87 11.63 40.74l336.6 184.3l-9.837 16.87H311.1zM105.9 204.1l-23.5-12.87l28.13-32.12h34.38L105.9 204.1zM199.5 256.1l34.9-41.28l13.5 67.61L199.5 256.1z"],"person-dots-from-line":[576,512,["diagnoses"],"f470","M463.1 256c8.75 0 15.1-7.25 15.1-16S472.7 224 463.1 224c-8.75 0-15.1 7.25-15.1 16S455.2 256 463.1 256zM287.1 176c48.5 0 87.1-39.5 87.1-88S336.5 0 287.1 0S200 39.5 200 88S239.5 176 287.1 176zM80 256c8.75 0 15.1-7.25 15.1-16S88.75 224 80 224S64 231.3 64 240S71.25 256 80 256zM75.91 375.1c.6289-.459 41.62-29.26 100.1-50.05L176 432h223.1l-.0004-106.8c58.32 20.8 99.51 49.49 100.1 49.91C508.6 381.1 518.3 384 527.9 384c14.98 0 29.73-7 39.11-20.09c15.41-21.59 10.41-51.56-11.16-66.97c-1.955-1.391-21.1-14.83-51.83-30.85C495.5 279.2 480.7 288 463.1 288c-26.25 0-47.1-21.75-47.1-48c0-3.549 .4648-6.992 1.217-10.33C378.6 217.2 334.4 208 288 208c-59.37 0-114.1 15.01-160.1 32.67C127.6 266.6 106 288 80 288C69.02 288 58.94 284 50.8 277.7c-18.11 10.45-29.25 18.22-30.7 19.26c-21.56 15.41-26.56 45.38-11.16 66.97C24.33 385.5 54.3 390.4 75.91 375.1zM335.1 344c13.25 0 23.1 10.75 23.1 24s-10.75 24-23.1 24c-13.25 0-23.1-10.75-23.1-24S322.7 344 335.1 344zM240 248c13.25 0 23.1 10.75 23.1 24S253.3 296 240 296c-13.25 0-23.1-10.75-23.1-24S226.8 248 240 248zM559.1 464H16c-8.75 0-15.1 7.25-15.1 16l-.0016 16c0 8.75 7.25 16 15.1 16h543.1c8.75 0 15.1-7.25 15.1-16L575.1 480C575.1 471.3 568.7 464 559.1 464z"],"person-dress":[320,512,["female"],"f182","M112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48zM88 384H70.2C59.28 384 51.57 373.3 55.02 362.9L93.28 248.1L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L58.18 182.3C78.43 148.6 114.9 128 154.2 128H165.8C205.1 128 241.6 148.6 261.8 182.3L315.4 271.5C324.5 286.7 319.6 306.3 304.5 315.4C289.3 324.5 269.7 319.6 260.6 304.5L226.7 248.1L264.1 362.9C268.4 373.3 260.7 384 249.8 384H232V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V384H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480L88 384z"],"person-dress-burst":[640,512,[],"e544","M527.1 48C527.1 74.51 506.5 96 479.1 96C453.5 96 431.1 74.51 431.1 48C431.1 21.49 453.5 0 479.1 0C506.5 0 527.1 21.49 527.1 48zM375 362.9L413.3 248.1L379.4 304.5C370.3 319.6 350.7 324.5 335.5 315.4C320.4 306.3 315.5 286.7 324.6 271.5L378.2 182.3C398.4 148.6 434.9 128 474.2 128H485.8C525.1 128 561.6 148.6 581.8 182.3L635.4 271.5C644.5 286.7 639.6 306.3 624.5 315.4C609.3 324.5 589.7 319.6 580.6 304.5L546.7 248.1L584.1 362.9C588.4 373.3 580.7 384 569.8 384H551.1V480C551.1 497.7 537.7 512 519.1 512C502.3 512 487.1 497.7 487.1 480V384H471.1V480C471.1 497.7 457.7 512 439.1 512C422.3 512 407.1 497.7 407.1 480V384H390.2C379.3 384 371.6 373.3 375 362.9L375 362.9zM220.3 92.05L296.4 68.93C302.7 67.03 309.5 69.14 313.6 74.27C317.7 79.39 318.2 86.49 314.1 92.18L275.5 161.3L330.7 199.3L306.3 239.8L255.8 247.6L261.4 327C261.8 333.6 258.3 339.7 252.4 342.6C246.5 345.4 239.4 344.4 234.6 339.9L175.1 286.1L117.4 339.9C112.6 344.4 105.5 345.4 99.63 342.6C93.73 339.7 90.15 333.6 90.62 327L96.21 247.6L17.55 235.4C11.08 234.4 5.868 229.6 4.41 223.2C2.951 216.8 5.538 210.1 10.94 206.4L76.5 161.3L37.01 92.18C33.76 86.49 34.31 79.39 38.39 74.27C42.48 69.14 49.28 67.03 55.55 68.93L131.7 92.05L161.1 18.09C163.6 11.1 169.4 7.1 175.1 7.1C182.6 7.1 188.4 11.1 190.9 18.09L220.3 92.05z"],"person-drowning":[576,512,[],"e545","M191.1 96.16C191.1 148.8 226.1 195.4 276.3 211.4C316.3 224.2 358.1 225.1 399.1 216.6L504.9 192.8C522.1 188.9 539.3 199.7 543.2 216.9C547.1 234.1 536.3 251.3 519.1 255.2L414.1 279.1C403.6 281.5 392.9 283.3 382.2 284.5L364.5 382.1C350.9 378.9 337.2 372.7 324.8 364.1C302.8 348.6 273.3 348.6 251.2 364.1C234 375.9 213.2 384.5 192 384.5C184.7 384.5 177 383.3 169.2 381.2L190.2 234.5C151.5 200.1 127.1 150.2 127.1 96.16V64C127.1 46.33 142.3 32 159.1 32C177.7 32 191.1 46.33 191.1 64V96.16zM255.1 127.1C255.1 92.65 284.7 63.1 320 63.1C355.3 63.1 384 92.65 384 127.1C384 163.3 355.3 191.1 320 191.1C284.7 191.1 255.1 163.3 255.1 127.1zM384 416C410.9 416 439.4 405.2 461.4 389.9L461.5 389.9C473.4 381.4 489.5 382.1 500.7 391.6C515 403.5 533.2 412.6 551.3 416.8C568.5 420.8 579.2 438.1 575.2 455.3C571.2 472.5 553.1 483.2 536.7 479.2C512.2 473.4 491.9 462.6 478.5 454.2C449.5 469.7 417 480 384 480C352.1 480 323.4 470.1 303.6 461.1C297.7 458.5 292.5 455.8 288 453.4C283.5 455.8 278.3 458.5 272.4 461.1C252.6 470.1 223.9 480 192 480C158.1 480 126.5 469.7 97.5 454.2C84.12 462.6 63.79 473.4 39.27 479.2C22.06 483.2 4.853 472.5 .8422 455.3C-3.169 438.1 7.532 420.8 24.74 416.8C42.84 412.6 60.96 403.5 75.31 391.6C86.46 382.1 102.6 381.4 114.5 389.9L114.6 389.9C136.7 405.2 165.1 416 192 416C219.5 416 247 405.4 269.5 389.9C280.6 382 295.4 382 306.5 389.9C328.1 405.4 356.5 416 384 416H384z"],"person-falling":[448,512,[],"e546","M256 0C273.7 0 288 14.33 288 32V41.84C288 96.45 260.1 146.5 215.5 175.4L215.7 175.8L272.5 255.1H360C375.1 255.1 389.3 263.1 398.4 275.2L441.6 332.8C452.2 346.9 449.3 366.1 435.2 377.6C421.1 388.2 401 385.3 390.4 371.2L352 319.1H254.6L346.9 462.6C356.5 477.5 352.2 497.3 337.4 506.9C322.5 516.5 302.7 512.2 293.1 497.4L132.5 249.2C129.6 258.4 127.1 268.1 127.1 278.2V351.1C127.1 369.7 113.7 383.1 95.1 383.1C78.33 383.1 63.1 369.7 63.1 351.1V278.2C63.1 213 103.6 154.5 164.1 130.3C200.3 115.8 223.1 80.79 223.1 41.84V32C223.1 14.33 238.3 .0003 256 .0003L256 0zM32 80C32 53.49 53.49 32 80 32C106.5 32 128 53.49 128 80C128 106.5 106.5 128 80 128C53.49 128 32 106.5 32 80z"],"person-falling-burst":[640,512,[],"e547","M256 41.84C256 96.45 228.1 146.5 183.5 175.4L183.7 175.8L240.5 255.1H311.1C327.1 255.1 341.3 263.1 350.4 275.2L393.6 332.8C404.2 346.9 401.3 366.1 387.2 377.6C373.1 388.2 353 385.3 342.4 371.2L303.1 319.1H222.6L314.9 462.6C324.5 477.5 320.2 497.3 305.4 506.9C290.5 516.5 270.7 512.2 261.1 497.4L100.5 249.2C97.57 258.4 95.1 268.1 95.1 278.2V351.1C95.1 369.7 81.67 383.1 63.1 383.1C46.33 383.1 31.1 369.7 31.1 351.1V278.2C31.1 213 71.65 154.5 132.1 130.3C168.3 115.8 191.1 80.79 191.1 41.84V32C191.1 14.33 206.3 0 223.1 0C241.7 0 255.1 14.33 255.1 32L256 41.84zM96 79.1C96 106.5 74.51 127.1 48 127.1C21.49 127.1 0 106.5 0 79.1C0 53.49 21.49 31.1 48 31.1C74.51 31.1 96 53.49 96 79.1zM464 286.1L424.7 322.2C423.1 319.3 421.3 316.4 419.2 313.6L382.1 265.3L384.2 247.6L365.8 244.8C351.2 231.5 332.1 223.1 311.1 223.1H292.6C292.5 223.7 292.5 223.4 292.4 223.2C290.1 216.8 293.5 210.1 298.9 206.4L364.5 161.3L325 92.18C321.8 86.49 322.3 79.39 326.4 74.27C330.5 69.14 337.3 67.03 343.6 68.93L419.7 92.05L449.1 18.09C451.6 11.1 457.4 8 464 8C470.6 8 476.4 11.1 478.9 18.09L508.3 92.05L584.4 68.93C590.7 67.03 597.5 69.14 601.6 74.27C605.7 79.39 606.2 86.49 602.1 92.18L563.5 161.3L629.1 206.4C634.5 210.1 637 216.8 635.6 223.2C634.1 229.6 628.9 234.4 622.4 235.4L543.8 247.6L549.4 327C549.8 333.6 546.3 339.7 540.4 342.6C534.5 345.4 527.4 344.4 522.6 339.9L464 286.1z"],"person-half-dress":[320,512,[],"e548","M112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48zM168 128H174.9C208.6 128 239.8 145.7 257.2 174.6L315.4 271.5C324.5 286.7 319.6 306.3 304.5 315.4C289.3 324.5 269.7 319.6 260.6 304.5L232 256.9V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480L168 128zM58.18 182.3C78.06 149.2 113.5 128.8 152 128V480.2C151.9 497.8 137.6 512 120 512C102.3 512 88 497.7 88 480V384H70.2C59.28 384 51.57 373.3 55.02 362.9L93.28 248.1L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L58.18 182.3z"],"person-harassing":[576,512,[],"e549","M144 48C144 21.49 165.5 0 192 0C218.5 0 240 21.49 240 48C240 74.51 218.5 96 192 96C165.5 96 144 74.51 144 48V48zM15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C80.2 145.7 111.4 128 145.1 128H181C209.6 128 236.7 140.7 254.9 162.7L328.6 251.6C339.9 265.2 338 285.3 324.4 296.6C310.8 307.9 290.7 306 279.4 292.4L232 235.3V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V352H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480V256.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4H15.52zM480 240C480 266.5 458.5 288 432 288C405.5 288 384 266.5 384 240C384 213.5 405.5 192 432 192C458.5 192 480 213.5 480 240zM464 344C464 313.1 489.1 288 520 288C550.9 288 576 313.1 576 344V446.1C576 482.5 546.5 512 510.1 512C492.6 512 475.8 505.1 463.4 492.7L408.8 438L380.6 494.3C372.7 510.1 353.5 516.5 337.7 508.6C321.9 500.7 315.5 481.5 323.4 465.7L371.4 369.7C375.1 360.5 384.7 354.1 394.9 352.4C405 350.8 415.4 354.1 422.6 361.4L464 402.7V344zM288 48C288 39.16 295.2 32 304 32H360C368.8 32 376 39.16 376 48C376 56.84 368.8 64 360 64H304C295.2 64 288 56.84 288 48zM335.2 121.7C343.1 125.6 346.3 135.3 342.3 143.2C338.4 151.1 328.7 154.3 320.8 150.3L272.8 126.3C264.9 122.4 261.7 112.7 265.7 104.8C269.6 96.94 279.3 93.74 287.2 97.69L335.2 121.7z"],"person-hiking":[384,512,["hiking"],"f6ec","M240 96c26.5 0 48-21.5 48-48S266.5 0 240 0C213.5 0 192 21.5 192 48S213.5 96 240 96zM80.01 287.1c7.31 0 13.97-4.762 15.87-11.86L137 117c.3468-1.291 .5125-2.588 .5125-3.866c0-7.011-4.986-13.44-12.39-15.13C118.4 96.38 111.7 95.6 105.1 95.6c-36.65 0-70 23.84-79.32 59.53L.5119 253.3C.1636 254.6-.0025 255.9-.0025 257.2c0 7.003 4.961 13.42 12.36 15.11L76.01 287.5C77.35 287.8 78.69 287.1 80.01 287.1zM368 160h-15.1c-8.875 0-15.1 7.125-15.1 16V192h-34.75l-46.75-46.75C243.4 134.1 228.6 128 212.9 128C185.9 128 162.5 146.3 155.9 172.5L129 280.3C128.4 282.8 128 285.5 128 288.1c0 8.325 3.265 16.44 9.354 22.53l86.62 86.63V480c0 17.62 14.37 32 31.1 32s32-14.38 32-32v-82.75c0-17.12-6.625-33.13-18.75-45.25l-46.87-46.88c.25-.5 .5-.875 .625-1.375l19.1-79.5l22.37 22.38C271.4 252.6 279.5 256 288 256h47.1v240c0 8.875 7.125 16 15.1 16h15.1C376.9 512 384 504.9 384 496v-320C384 167.1 376.9 160 368 160zM81.01 472.3c-.672 2.63-.993 5.267-.993 7.86c0 14.29 9.749 27.29 24.24 30.89C106.9 511.8 109.5 512 112 512c14.37 0 27.37-9.75 30.1-24.25l25.25-101l-52.75-52.75L81.01 472.3z"],"person-military-pointing":[512,512,[],"e54a","M366.7 1.443C376 .6658 384 8.027 384 17.39V47.1C384 56.84 376.8 63.1 368 63.1H216.1C203.2 63.1 192 52.81 192 39C192 25.1 201.1 15.17 214.9 14.09L366.7 1.443zM208 111.1C208 106.5 208.6 101.2 209.6 95.1H366.4C367.5 101.2 368 106.5 368 111.1C368 156.2 332.2 191.1 288 191.1C243.8 191.1 208 156.2 208 111.1V111.1zM313.2 223.1C327.6 223.1 341.6 226.3 354.9 230.5L192 393.4V303.1H40.01C17.92 303.1 .0077 286.1 .0077 263.1C.0077 241.9 17.92 223.1 40.01 223.1H313.2zM430.3 290.8L506.4 419.7C517.7 438.7 511.4 463.2 492.4 474.4C473.3 485.7 448.8 479.4 437.6 460.3L384 369.7V416H214.6L385.7 244.9C403.7 256.3 419.1 271.9 430.3 290.8V290.8zM384 448V480C384 497.7 369.7 512 352 512H224C206.3 512 192 497.7 192 480V448H384z"],"person-military-rifle":[448,512,[],"e54b","M128 39C128 25.1 137.1 15.17 150.9 14.09L302.7 1.443C312 .6658 320 8.027 320 17.39V47.1C320 56.84 312.8 63.1 304 63.1H152.1C139.2 63.1 128 52.81 128 39V39zM302.4 95.1C303.5 101.2 304 106.5 304 111.1C304 156.2 268.2 191.1 224 191.1C179.8 191.1 144 156.2 144 111.1C144 106.5 144.6 101.2 145.6 95.1H302.4zM373.6 460.3L320 369.7V480C320 481.3 319.9 482.5 319.8 483.8L145.5 234.9C162.1 227.8 180.2 223.1 198.8 223.1H249.2C265.1 223.1 280.6 226.8 295 231.9L389.9 67.71C382.2 63.3 379.6 53.51 384 45.86C388.4 38.21 398.2 35.58 405.9 40L433.6 56C441.2 60.42 443.8 70.21 439.4 77.86L383.1 173.9L385.6 174.9C400.9 183.7 406.1 203.3 397.3 218.6L360.6 282C362.6 284.9 364.5 287.8 366.3 290.8L442.4 419.7C453.7 438.7 447.4 463.2 428.4 474.4C409.3 485.7 384.8 479.4 373.6 460.3V460.3zM264 319.1C277.3 319.1 288 309.3 288 295.1C288 282.7 277.3 271.1 264 271.1C250.7 271.1 240 282.7 240 295.1C240 309.3 250.7 319.1 264 319.1zM160 512C142.3 512 128 497.7 128 480V369.7L74.44 460.3C63.21 479.4 38.68 485.7 19.66 474.4C.6381 463.2-5.669 438.7 5.569 419.7L81.7 290.8C91.06 274.1 103.4 261.5 117.7 250.8L299.1 510C295.6 511.3 291.9 512 288 512L160 512z"],"person-military-to-person":[512,512,[],"e54c","M182.2 .0998C191.7-.9534 200 6.466 200 16V30.13C200 38.91 192.9 46.05 184.1 46.13H72.74C63.48 46.04 56 38.52 56 29.24C56 20.64 62.47 13.41 71.02 12.46L182.2 .0998zM192 96C192 131.3 163.3 160 128 160C92.65 160 64 131.3 64 96C64 89.8 64.88 83.8 66.53 78.13H189.5C191.1 83.8 192 89.8 192 96V96zM32 256C32 237.2 40.09 220.3 52.97 208.6L197.2 319.6C195.5 319.9 193.8 320 192 320H64C46.33 320 32 305.7 32 288L32 256zM222.2 298.5L85.05 192.9C88.61 192.3 92.27 191.1 96 191.1H160C195.3 191.1 224 220.7 224 255.1V287.1C224 291.7 223.4 295.2 222.2 298.5V298.5zM320 96C320 60.65 348.7 31.1 384 31.1C419.3 31.1 448 60.65 448 96C448 131.3 419.3 160 384 160C348.7 160 320 131.3 320 96zM416 192C451.3 192 480 220.7 480 256V288C480 305.7 465.7 320 448 320H320C302.3 320 288 305.7 288 288V256C288 220.7 316.7 192 352 192H416zM151.8 506.1C141.8 514.8 126.7 513.8 117.9 503.8C109.2 493.8 110.2 478.7 120.2 469.9L136.1 456L23.1 455.1C10.74 455.1-.0003 445.2 0 431.1C.0003 418.7 10.75 407.1 24 407.1L136.1 408L120.2 394.1C110.2 385.3 109.2 370.2 117.9 360.2C126.7 350.2 141.8 349.2 151.8 357.9L215.8 413.9C221 418.5 224 425.1 224 431.1C224 438.9 221 445.5 215.8 450.1L151.8 506.1zM296.2 413.9L360.2 357.9C370.2 349.2 385.3 350.2 394.1 360.2C402.8 370.2 401.8 385.3 391.8 394.1L375.9 407.1L488 407.1C501.3 407.1 512 418.7 512 431.1C512 445.2 501.3 455.1 488 455.1L375.9 455.1L391.8 469.9C401.8 478.7 402.8 493.8 394.1 503.8C385.3 513.8 370.2 514.8 360.2 506.1L296.2 450.1C290.1 445.5 288 438.9 288 431.1C288 425.1 290.1 418.5 296.2 413.9H296.2z"],"person-praying":[384,512,[128720,"pray"],"f683","M255.1 128c35.38 0 63.1-28.62 63.1-64s-28.62-64-63.1-64S191.1 28.62 191.1 64S220.6 128 255.1 128zM225.4 297.8c14 16.75 39 19.12 56.01 5.25l88.01-72c17-14 19.5-39.25 5.625-56.38c-14-17.12-39.25-19.5-56.38-5.625L261.3 216l-39-46.25c-15.38-18.38-39.13-27.88-64.01-25.38c-24.13 2.5-45.25 16.25-56.38 37l-49.38 92C29.13 317 43.88 369.8 86.76 397.1L131.5 432H40C17.88 432 0 449.9 0 472S17.88 512 40 512h208c34.13 0 53.76-42.75 28.25-68.25L166.4 333.9L201.3 269L225.4 297.8z"],"person-pregnant":[320,512,[],"e31e","M112 48C112 21.49 133.5 0 160 0C186.5 0 208 21.49 208 48C208 74.51 186.5 96 160 96C133.5 96 112 74.51 112 48zM88 382.1C74.2 379.4 64 366.9 64 352V296.9L59.43 304.5C50.33 319.6 30.67 324.5 15.52 315.4C.3696 306.3-4.531 286.7 4.573 271.5L62.85 174.6C77.84 149.6 103.2 133 131.5 128.1C135.6 128.3 139.8 128 144 128H160C161.4 128 162.8 128.1 164.1 128.3C199.8 131.2 229.5 157.6 236.2 193.3L242.3 225.7C286.6 234.3 320 273.2 320 320V352C320 369.7 305.7 384 288 384H232V480C232 497.7 217.7 512 200 512C182.3 512 168 497.7 168 480V384H152V480C152 497.7 137.7 512 120 512C102.3 512 88 497.7 88 480L88 382.1z"],"person-rays":[512,512,[],"e54d","M304 48C304 74.51 282.5 96 256 96C229.5 96 208 74.51 208 48C208 21.49 229.5 0 256 0C282.5 0 304 21.49 304 48zM248 352V480C248 497.7 233.7 512 216 512C198.3 512 184 497.7 184 480V256.9L155.4 304.5C146.3 319.6 126.7 324.5 111.5 315.4C96.37 306.3 91.47 286.7 100.6 271.5L158.8 174.6C176.2 145.7 207.4 128 241.1 128H270.9C304.6 128 335.8 145.7 353.2 174.6L411.4 271.5C420.5 286.7 415.6 306.3 400.5 315.4C385.3 324.5 365.7 319.6 356.6 304.5L328 256.9V480C328 497.7 313.7 512 296 512C278.3 512 264 497.7 264 480V352L248 352zM7.029 7.029C16.4-2.343 31.6-2.343 40.97 7.029L120.1 87.03C130.3 96.4 130.3 111.6 120.1 120.1C111.6 130.3 96.4 130.3 87.03 120.1L7.029 40.97C-2.343 31.6-2.343 16.4 7.029 7.029V7.029zM471 7.029C480.4-2.343 495.6-2.343 504.1 7.029C514.3 16.4 514.3 31.6 504.1 40.97L424.1 120.1C415.6 130.3 400.4 130.3 391 120.1C381.7 111.6 381.7 96.4 391 87.03L471 7.029zM7.029 471L87.03 391C96.4 381.7 111.6 381.7 120.1 391C130.3 400.4 130.3 415.6 120.1 424.1L40.97 504.1C31.6 514.3 16.4 514.3 7.029 504.1C-2.343 495.6-2.343 480.4 7.029 471V471zM391 424.1C381.7 415.6 381.7 400.4 391 391C400.4 381.7 415.6 381.7 424.1 391L504.1 471C514.3 480.4 514.3 495.6 504.1 504.1C495.6 514.3 480.4 514.3 471 504.1L391 424.1z"],"person-rifle":[576,512,[],"e54e","M265.2 192C290.6 192 315 199.1 336 211.9V512H144V337.7L90.44 428.3C79.21 447.4 54.68 453.7 35.66 442.4C16.64 431.2 10.33 406.7 21.57 387.7L97.7 258.8C122.2 217.4 166.7 192 214.8 192L265.2 192zM320 80C320 124.2 284.2 160 240 160C195.8 160 160 124.2 160 80C160 35.82 195.8 .0003 240 .0003C284.2 .0003 320 35.82 320 80zM464 16V132.3C473.6 137.8 480 148.2 480 160V269.3L496 264V208C496 199.2 503.2 192 512 192H528C536.8 192 544 199.2 544 208V292.5C544 299.4 539.6 305.5 533.1 307.6L480 325.3V352H528C536.8 352 544 359.2 544 368V384C544 392.8 536.8 400 528 400H484L507 492.1C509.6 502.2 501.9 512 491.5 512H432C423.2 512 416 504.8 416 496V400H400C382.3 400 368 385.7 368 368V224C368 206.3 382.3 192 400 192V160C400 148.2 406.4 137.8 416 132.3V32C407.2 32 400 24.84 400 16C400 7.164 407.2 0 416 0H448C456.8 0 464 7.164 464 16V16z"],"person-running":[448,512,[127939,"running"],"f70c","M400 224h-44l-26.12-53.25c-12.5-25.5-35.38-44.25-61.75-51L197 98.63C189.5 96.84 181.1 95.97 174.5 95.97c-20.88 0-41.33 6.81-58.26 19.78L76.5 146.3C68.31 152.5 64.01 162 64.01 171.6c0 17.11 13.67 32.02 32.02 32.02c6.808 0 13.67-2.158 19.47-6.616l39.63-30.38c5.92-4.488 13.01-6.787 19.53-6.787c2.017 0 3.981 .2196 5.841 .6623l14.62 4.25l-37.5 87.5C154.1 260.3 152.5 268.8 152.5 277.2c0 22.09 11.49 43.52 31.51 55.29l85 50.13l-27.5 87.75c-.9875 3.174-1.458 6.388-1.458 9.55c0 13.65 8.757 26.31 22.46 30.58C265.6 511.5 268.9 512 272 512c13.62 0 26.25-8.75 30.5-22.5l31.75-101c1.211-4.278 1.796-8.625 1.796-12.93c0-16.57-8.661-32.51-23.55-41.44l-61.13-36.12l31.25-78.38l20.25 41.5C310.9 277.4 327.9 288 345.1 288H400c17.62 0 32-14.38 32-32C432 238.3 417.6 224 400 224zM288 96c26.5 0 48-21.5 48-48s-21.5-48-48-48s-48 21.5-48 48S261.5 96 288 96zM129.8 317.5L114.9 352H48c-17.62 0-32 14.38-32 32s14.38 32 32 32h77.5c19.25 0 36.5-11.5 44-29.12l8.875-20.5l-10.75-6.25C150.4 349.9 137.6 334.8 129.8 317.5z"],"person-shelter":[512,512,[],"e54f","M495.9 132.2C505.8 137.9 512 148.5 512 160V480C512 497.7 497.7 512 480 512C462.3 512 448 497.7 448 480V178.6L256 68.86L64 178.6V480C64 497.7 49.67 512 32 512C14.33 512 0 497.7 0 480V160C0 148.5 6.153 137.9 16.12 132.2L240.1 4.216C249.1-1.405 262-1.405 271.9 4.216L495.9 132.2zM216 168C216 145.9 233.9 128 256 128C278.1 128 296 145.9 296 168C296 190.1 278.1 208 256 208C233.9 208 216 190.1 216 168zM224 512C210.7 512 200 501.3 200 488V313.5L173.1 363.4C166.8 375 152.3 379.4 140.6 373.1C128.1 366.8 124.6 352.3 130.9 340.6L168.7 270.3C184.1 241.8 213.9 223.1 246.2 223.1H265.8C298.1 223.1 327.9 241.8 343.3 270.3L381.1 340.6C387.4 352.3 383 366.8 371.4 373.1C359.7 379.4 345.2 375 338.9 363.4L312 313.5V488C312 501.3 301.3 512 288 512C274.7 512 264 501.3 264 488V400H248V488C248 501.3 237.3 512 224 512V512z"],"person-skating":[448,512,["skating"],"f7c5","M399.1 0c-26.5 0-48.01 21.5-48.01 48S373.5 96 399.1 96C426.5 96 448 74.5 448 48S426.5 0 399.1 0zM399.1 448c-8.751 0-16 7.25-16 16S376.7 480 367.1 480h-96.01c-8.751 0-16 7.25-16 16s7.251 16 16 16h96.01c26.5 0 48.01-21.5 48.01-48C415.1 455.2 408.7 448 399.1 448zM129.1 451.9c-11.34 0-11.19 9.36-22.65 9.36c-4.074 0-8.163-1.516-11.21-4.625l-67.98-67.89c-3.063-3.125-7.165-4.688-11.27-4.688c-4.102 0-8.204 1.562-11.27 4.688C1.562 391.8-.0001 395.9-.0001 400s1.562 8.203 4.688 11.27l67.88 67.98c9.376 9.375 21.59 14 33.96 14c13.23 0 38.57-8.992 38.57-25.36C145.1 456.7 135.2 451.9 129.1 451.9zM173.8 276.8L80.2 370.5c-6.251 6.25-9.376 14.44-9.376 22.62c0 24.75 22.57 32 31.88 32c8.251 0 16.5-3.125 22.63-9.375l91.89-92l-30.13-30.12C182.1 288.6 177.7 282.9 173.8 276.8zM127.1 160h105.5L213.3 177.3c-21.18 18.04-22.31 41.73-22.31 48.65c0 16.93 6.8 33.22 18.68 45.1l78.26 78.25V432c0 17.75 14.25 32 32 32s32-14.25 32-32v-89.38c0-12.62-5.126-25-14.13-33.88l-61.01-61c.5001-.5 1.25-.625 1.75-1.125l82.26-82.38c7.703-7.702 11.76-17.87 11.76-28.25c0-22.04-17.86-39.97-40.01-39.97L127.1 96C110.2 96 95.96 110.2 95.96 128S110.2 160 127.1 160z"],"person-skiing":[512,512,[9975,"skiing"],"f7c9","M432.1 96.02c26.51 0 47.99-21.5 47.99-48.01S458.6 0 432.1 0s-47.98 21.5-47.98 48.01S405.6 96.02 432.1 96.02zM511.1 469.1c0-13.98-11.33-23.95-23.89-23.95c-18.89 0-19.23 19.11-46.15 19.11c-5.476 0-10.87-1.081-15.87-3.389l-135.8-70.26l49.15-73.82c5.446-8.116 8.09-17.39 8.09-26.63c0-12.4-4.776-24.73-14.09-33.9l-40.38-40.49l-106.1-53.1C185.6 165.8 185.4 169 185.4 172.2c0 16.65 6.337 32.78 18.42 44.86l75.03 75.21l-45.88 68.76L34.97 258.8C31.44 257 27.64 256.1 23.93 256.1C9.675 256.1 0 267.8 0 280.1c0 8.673 4.735 17.04 12.96 21.24l392 202.6c11.88 5.501 24.45 8.119 37.08 8.119C480.1 512 511.1 486.7 511.1 469.1zM119.1 91.65L108.5 114.2C114.2 117 120.2 118.4 126.2 118.4c9.153 0 18.1-3.2 25.06-9.102l47.26 23.51c-.125 0-.125 .125-.2501 .25l114.5 56.76l32.51-13l6.376 19.13c4.001 12.13 12.63 22.01 24 27.76l58.14 28.1c4.609 2.287 9.455 3.355 14.26 3.355c18.8 0 31.98-15.43 31.98-31.93c0-11.74-6.461-23.1-17.74-28.7l-52.03-26.1l-17.12-51.15C386.6 98.69 364.2 73.99 333.1 73.99c-7.658 0-15.82 1.504-24.43 4.934L227.4 111.3L164.9 80.33c.009-.3461 .0134-.692 .0134-1.038c0-14.13-7.468-27.7-20.89-34.53L132.9 66.45L98.17 59.43C97.83 59.36 97.53 59.35 97.19 59.35c-2.666 0-5.276 2.177-5.276 5.273c0 1.473 .648 2.936 1.81 3.961L119.1 91.65z"],"person-skiing-nordic":[576,512,["skiing-nordic"],"f7ca","M336 96C362.5 96 384 74.5 384 48S362.5 0 336 0S288 21.5 288 48S309.5 96 336 96zM552 416c-13.25 0-24 10.75-24 24s-10.75 24-24 24h-69.5L460 285.6c11.75-4.75 20.04-16.31 20.04-29.69c0-17.75-14.38-31.95-32.01-31.95l-43.9-.0393l-26.11-53.22c-12.5-25.5-35.5-44.12-61.75-50.87l-71.22-21.15c-7.475-1.819-15.08-2.693-22.59-2.693c-20.86 0-41.25 6.854-58.16 19.72L124.6 146.2C116.3 152.5 111.1 161.1 111.1 171.6c0 14.71 8.712 21.23 9.031 21.6L66.88 464H24C10.75 464 0 474.8 0 488S10.75 512 24 512h480c39.75 0 72-32.25 72-72C576 426.8 565.3 416 552 416zM291.6 463.9H194.7l43.1-90.97l-21.99-12.1c-12.13-7.25-21.99-16.89-29.49-27.77l-62.48 131.7L99.5 464l52.25-261.4c4.125-1 8.112-2.846 11.74-5.596l39.81-30.45c5.821-4.485 12.86-6.771 19.38-6.771c2.021 0 4.015 .212 5.878 .6556l14.73 4.383L205.8 252.2C202.3 260.3 200.7 268.9 200.7 277.3c0 22.06 11.42 43.37 31.41 55.22l84.97 50.15L291.6 463.9zM402.1 464l-43.58-.125l23.6-75.48c1.221-4.314 1.805-8.69 1.805-13.03c0-16.53-8.558-32.43-23.41-41.34l-61.21-36.1l31.32-78.23l20.26 41.36c8 16.25 24.86 26.89 43.11 26.89L427.3 288L402.1 464z"],"person-snowboarding":[512,512,[127938,"snowboarding"],"f7ce","M460.7 249.6c5.877 4.25 12.47 6.393 19.22 6.393c10.76 0 32.05-8.404 32.05-31.97c0-9.74-4.422-19.36-12.8-25.65l-111.5-83.48c-13.75-10.25-29.04-18.42-45.42-23.79l-63.66-21.23l-26.12-52.12c-5.589-11.17-16.9-17.64-28.63-17.64c-17.8 0-31.99 14.47-31.99 32.01c0 4.803 1.086 9.674 3.374 14.25l29.12 58.12c5.75 11.38 15.55 19.85 27.67 23.98l16.45 5.522L227.3 154.6C205.5 165.5 191.9 187.4 191.9 211.8L191.9 264.9L117.8 289.6C104.4 294.1 95.95 306.5 95.95 319.9c0 12.05 6.004 19.05 10.33 23.09l-38.68-14.14C41.23 319.4 49.11 295 23.97 295c-18.67 0-23.97 17.16-23.97 24.09c0 8.553 13.68 41.32 51.13 54.88l364.1 132.8C425.7 510.2 435.7 512 445.7 512c12.5 0 24.97-2.732 36.47-8.232c8.723-3.997 13.85-12.71 13.85-21.77c0-18.67-17.15-23.96-24.06-23.96c-3.375 0-6.73 .7505-9.998 2.248c-5.111 2.486-10.64 3.702-16.21 3.702c-4.511 0-9.049-.7978-13.41-2.364l-90.68-33.12c8.625-4.125 15.53-11.76 17.78-21.89l21.88-101.1c.7086-3.335 1.05-6.668 1.05-10c0-14.91-6.906-29.31-19.17-38.4l-52.01-39l66.01-30.5L460.7 249.6zM316.3 301.3l-19.66 92c-.4205 1.997-.5923 3.976-.5923 5.911c0 4.968 1.264 9.691 3.333 14.01l-169.5-61.49c2.625-.25 5.492-.4448 8.117-1.32l85-28.38c19.63-6.5 32.77-24.73 32.77-45.48l0-20.53L316.3 301.3zM431.9 95.99c26.5 0 48-21.5 48-47.1S458.4 0 431.9 0s-48 21.5-48 47.1S405.4 95.99 431.9 95.99z"],"person-swimming":[576,512,[127946,"swimmer"],"f5c4","M192.4 320c63.38 0 54.09-39.67 95.33-40.02c42.54 .3672 31.81 40.02 95.91 40.02c39.27 0 55.72-18.41 62.21-24.83l-140.4-116.1c3.292-1.689 31.66-18.2 75.25-18.2c12.57 0 25.18 1.397 37.53 4.21l38.59 8.844c2.412 .5592 4.824 .8272 7.2 .8272c15.91 0 31.96-12.81 31.96-32.04c0-14.58-10.03-27.77-24.84-31.16l-38.59-8.844c-17.06-3.904-34.46-5.837-51.81-5.837c-120.1 0-177.4 85.87-178.1 88.02L179.1 213.3C158.1 241.3 147.4 273.8 145 307.7C157.5 315.4 174.3 320 192.4 320zM576 397c0-15.14-10.82-28.59-26.25-31.42c-48.52-8.888-45.5-29.48-69.6-29.48c-25.02 0-31.19 31.79-96.18 31.79c-48.59 0-72.72-22.06-73.38-22.62c-6.141-6.157-14.26-9.188-22.42-9.188c-24.75 0-31.59 31.81-96.2 31.81c-48.59 0-72.69-22.03-73.41-22.59c-6.125-6.157-14.3-9.245-22.46-9.245c-8.072 0-16.12 3.026-22.38 8.901c-29.01 26.25-73.75 12.54-73.75 52.08c0 16.08 12.77 32.07 31.71 32.07c9.77 0 39.65-7.34 64.26-21.84C115.5 418.8 147.4 431.1 192 431.1s76.5-13.12 96-24.66c19.53 11.53 51.47 24.59 96 24.59c44.59 0 76.56-13.09 96.06-24.62c24.71 14.57 54.74 21.83 64.24 21.83C563.2 429.1 576 413.3 576 397zM95.1 224c35.35 0 64-28.65 64-64c0-35.35-28.65-64-64-64s-64 28.65-64 64C31.1 195.3 60.65 224 95.1 224z"],"person-through-window":[640,512,[],"e5a9","M191.1 128C191.1 154.5 170.5 176 143.1 176C117.5 176 95.1 154.5 95.1 128C95.1 101.5 117.5 80 143.1 80C170.5 80 191.1 101.5 191.1 128zM385 336H310.5L394.6 462.2C404.4 476.1 400.5 496.8 385.8 506.6C371 516.4 351.2 512.5 341.4 497.8L308.2 448H48C21.49 448 0 426.5 0 400V48C0 21.49 21.49 0 48 0H592C618.5 0 640 21.49 640 48V400C640 426.5 618.5 448 592 448H421.9L379.2 384H425L385 336zM63.1 64V384H127.1C127.1 384 127.1 384 127.1 384V310.2C127.1 245 167.6 186.5 228.1 162.3C264.3 147.8 287.1 112.8 287.1 73.84V64H63.1zM352 64V73.84C352 128.5 324.1 178.5 279.5 207.4C279.8 207.9 280.1 208.4 280.4 208.9L321.4 271.1H392.5C406.8 271.1 420.3 278.3 429.4 289.3L508.3 384H576V64H352zM265.5 384L196.7 280.7C193.6 290 191.1 299.1 191.1 310.2V383.1C191.1 383.1 191.1 384 191.1 383.1L265.5 384z"],"person-walking":[320,512,[128694,"walking"],"f554","M256 48C256 74.51 234.5 96 208 96C181.5 96 160 74.51 160 48C160 21.49 181.5 0 208 0C234.5 0 256 21.49 256 48zM126.5 199.3C125.6 199.7 124.6 200.1 123.7 200.5L112.7 205.4C97.41 212.2 85.42 224.6 79.22 240.1L77.71 243.9C71.15 260.3 52.53 268.3 36.12 261.7C19.71 255.1 11.73 236.5 18.29 220.1L19.8 216.3C32.19 185.4 56.18 160.5 86.66 146.9L97.66 142C118.5 132.8 140.1 128 163.7 128C208.3 128 248.5 154.8 265.6 195.9L280.1 232.7L302.3 243.4C318.1 251.3 324.5 270.5 316.6 286.3C308.7 302.1 289.5 308.5 273.7 300.6L247 287.3C236.7 282.1 228.6 273.4 224.2 262.8L214.6 239.8L195.3 305.3L244.8 359.4C250.2 365.3 254.1 372.4 256 380.2L279 472.2C283.3 489.4 272.9 506.8 255.8 511C238.6 515.3 221.2 504.9 216.1 487.8L194.9 399.6L124.3 322.5C109.5 306.4 103.1 283.9 109.6 262.8L126.5 199.3zM68.73 398L93.69 335.6C95.84 338.6 98.16 341.4 100.7 344.2L141.4 388.6L126.9 424.8C124.5 430.9 120.9 436.4 116.3 440.9L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L68.73 398z"],"person-walking-arrow-loop-left":[640,512,[],"e551","M160 48C160 21.49 181.5 0 208 0C234.5 0 256 21.49 256 48C256 74.51 234.5 96 208 96C181.5 96 160 74.51 160 48V48zM112.7 205.4C97.41 212.2 85.42 224.6 79.22 240.1L77.71 243.9C71.15 260.3 52.53 268.3 36.12 261.7C19.71 255.1 11.73 236.5 18.29 220.1L19.8 216.3C32.19 185.4 56.18 160.5 86.66 146.9L97.66 142C118.5 132.8 140.1 128 163.7 128C208.3 128 248.5 154.8 265.6 195.9L280.1 232.7L302.3 243.4C318.1 251.3 324.5 270.5 316.6 286.3C308.7 302.1 289.5 308.5 273.7 300.6L247 287.3C236.7 282.1 228.6 273.4 224.2 262.8L214.6 239.8L195.3 305.3L244.8 359.4C250.2 365.3 254.1 372.4 256 380.2L279 472.2C283.3 489.4 272.9 506.8 255.8 511C238.6 515.3 221.2 504.9 216.1 487.8L194.9 399.6L124.3 322.5C109.5 306.4 103.1 283.9 109.6 262.8L126.5 199.3C125.6 199.7 124.6 200.1 123.7 200.5L112.7 205.4zM100.7 344.2L141.4 388.6L126.9 424.8C124.5 430.9 120.9 436.4 116.3 440.9L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L68.73 398L93.69 335.6C95.84 338.6 98.17 341.4 100.7 344.2H100.7zM361.4 374.6C348.9 362.1 348.9 341.9 361.4 329.4L441.4 249.4C453.9 236.9 474.1 236.9 486.6 249.4C499.1 261.9 499.1 282.1 486.6 294.6L461.3 320H480C533 320 576 277 576 224C576 170.1 533 128 480 128H352C334.3 128 319.1 113.7 319.1 96C319.1 78.33 334.3 64 352 64H480C568.4 64 640 135.6 640 224C640 312.4 568.4 384 480 384H461.3L486.6 409.4C499.1 421.9 499.1 442.1 486.6 454.6C474.1 467.1 453.9 467.1 441.4 454.6L361.4 374.6z"],"person-walking-arrow-right":[640,512,[],"e552","M160 48C160 21.49 181.5 0 208 0C234.5 0 256 21.49 256 48C256 74.51 234.5 96 208 96C181.5 96 160 74.51 160 48V48zM112.7 205.4C97.41 212.2 85.42 224.6 79.22 240.1L77.71 243.9C71.15 260.3 52.53 268.3 36.12 261.7C19.71 255.1 11.73 236.5 18.29 220.1L19.8 216.3C32.19 185.4 56.18 160.5 86.66 146.9L97.66 142C118.5 132.8 140.1 128 163.7 128C208.3 128 248.5 154.8 265.6 195.9L280.1 232.7L302.3 243.4C318.1 251.3 324.5 270.5 316.6 286.3C308.7 302.1 289.5 308.5 273.7 300.6L247 287.3C236.7 282.1 228.6 273.4 224.2 262.8L214.6 239.8L195.3 305.3L244.8 359.4C250.2 365.3 254.1 372.4 256 380.2L279 472.2C283.3 489.4 272.9 506.8 255.8 511C238.6 515.3 221.2 504.9 216.1 487.8L194.9 399.6L124.3 322.5C109.5 306.4 103.1 283.9 109.6 262.8L126.5 199.3C125.6 199.7 124.6 200.1 123.7 200.5L112.7 205.4zM100.7 344.2L141.4 388.6L126.9 424.8C124.5 430.9 120.9 436.4 116.3 440.9L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L68.73 398L93.69 335.6C95.84 338.6 98.17 341.4 100.7 344.2H100.7zM630.6 233.4C643.1 245.9 643.1 266.1 630.6 278.6L550.6 358.6C538.1 371.1 517.9 371.1 505.4 358.6C492.9 346.1 492.9 325.9 505.4 313.4L530.7 288H384C366.3 288 352 273.7 352 256C352 238.3 366.3 224 384 224H530.7L505.4 198.6C492.9 186.1 492.9 165.9 505.4 153.4C517.9 140.9 538.1 140.9 550.6 153.4L630.6 233.4z"],"person-walking-dashed-line-arrow-right":[640,512,[],"e553","M160 48C160 21.49 181.5 0 208 0C234.5 0 256 21.49 256 48C256 74.51 234.5 96 208 96C181.5 96 160 74.51 160 48V48zM112.7 205.4C97.41 212.2 85.42 224.6 79.22 240.1L77.71 243.9C71.15 260.3 52.53 268.3 36.12 261.7C19.71 255.1 11.73 236.5 18.29 220.1L19.8 216.3C32.19 185.4 56.18 160.5 86.66 146.9L97.66 142C118.5 132.8 140.1 128 163.7 128C208.3 128 248.5 154.8 265.6 195.9L280.1 232.7L302.3 243.4C318.1 251.3 324.5 270.5 316.6 286.3C308.7 302.1 289.5 308.5 273.7 300.6L247 287.3C236.7 282.1 228.6 273.4 224.2 262.8L214.6 239.8L195.3 305.3L244.8 359.4C250.2 365.3 254.1 372.4 256 380.2L279 472.2C283.3 489.4 272.9 506.8 255.8 511C238.6 515.3 221.2 504.9 216.1 487.8L194.9 399.6L124.3 322.5C109.5 306.4 103.1 283.9 109.6 262.8L126.5 199.3C125.6 199.7 124.6 200.1 123.7 200.5L112.7 205.4zM100.7 344.2L141.4 388.6L126.9 424.8C124.5 430.9 120.9 436.4 116.3 440.9L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L68.73 398L93.69 335.6C95.84 338.6 98.17 341.4 100.7 344.2H100.7zM630.6 233.4C643.1 245.9 643.1 266.1 630.6 278.6L550.6 358.6C538.1 371.1 517.9 371.1 505.4 358.6C492.9 346.1 492.9 325.9 505.4 313.4L530.7 288H384C366.3 288 352 273.7 352 256C352 238.3 366.3 224 384 224H530.7L505.4 198.6C492.9 186.1 492.9 165.9 505.4 153.4C517.9 140.9 538.1 140.9 550.6 153.4L630.6 233.4zM392 0C405.3 0 416 10.75 416 24V72C416 85.25 405.3 96 392 96C378.7 96 368 85.25 368 72V24C368 10.75 378.7 0 392 0zM416 168C416 181.3 405.3 192 392 192C378.7 192 368 181.3 368 168V152C368 138.7 378.7 128 392 128C405.3 128 416 138.7 416 152V168zM392 320C405.3 320 416 330.7 416 344V360C416 373.3 405.3 384 392 384C378.7 384 368 373.3 368 360V344C368 330.7 378.7 320 392 320zM416 488C416 501.3 405.3 512 392 512C378.7 512 368 501.3 368 488V440C368 426.7 378.7 416 392 416C405.3 416 416 426.7 416 440V488z"],"person-walking-luggage":[512,512,[],"e554","M352 48C352 21.49 373.5 0 400 0C426.5 0 448 21.49 448 48C448 74.51 426.5 96 400 96C373.5 96 352 74.51 352 48zM304.6 205.4C289.4 212.2 277.4 224.6 271.2 240.1L269.7 243.9C263.1 260.3 244.5 268.3 228.1 261.7C211.7 255.1 203.7 236.5 210.3 220.1L211.8 216.3C224.2 185.4 248.2 160.5 278.7 146.9L289.7 142C310.5 132.8 332.1 128 355.7 128C400.3 128 440.5 154.8 457.6 195.9L472.1 232.7L494.3 243.4C510.1 251.3 516.5 270.5 508.6 286.3C500.7 302.1 481.5 308.5 465.7 300.6L439 287.3C428.7 282.1 420.6 273.4 416.2 262.8L406.6 239.8L387.3 305.3L436.8 359.4C442.2 365.3 446.1 372.4 448 380.2L471 472.2C475.3 489.4 464.9 506.8 447.8 511C430.6 515.3 413.2 504.9 408.1 487.8L386.9 399.6L316.3 322.5C301.5 306.4 295.1 283.9 301.6 262.8L318.5 199.3C317.6 199.7 316.6 200.1 315.7 200.5L304.6 205.4zM292.7 344.2L333.4 388.6L318.9 424.8C316.5 430.9 312.9 436.4 308.3 440.9L246.6 502.6C234.1 515.1 213.9 515.1 201.4 502.6C188.9 490.1 188.9 469.9 201.4 457.4L260.7 398L285.7 335.6C287.8 338.6 290.2 341.4 292.7 344.2H292.7zM223.1 274.1C231.7 278.6 234.3 288.3 229.9 295.1L186.1 371.8C185.4 374.5 184.3 377.2 182.9 379.7L118.9 490.6C110 505.9 90.44 511.1 75.14 502.3L19.71 470.3C4.407 461.4-.8371 441.9 7.999 426.6L71.1 315.7C80.84 300.4 100.4 295.2 115.7 303.1L170.1 335.4L202.1 279.1C206.6 272.3 216.3 269.7 223.1 274.1H223.1z"],"person-walking-with-cane":[448,512,["blind"],"f29d","M445.2 486.1l-117.3-172.6c-3.002 4.529-6.646 8.652-11.12 12c-4.414 3.318-9.299 5.689-14.43 7.307l116.4 171.3c3.094 4.547 8.127 7.008 13.22 7.008c3.125 0 6.247-.8984 8.997-2.773C448.3 504.2 450.2 494.3 445.2 486.1zM143.1 95.1c26.51 0 48.01-21.49 48.01-47.1S170.5 0 144 0S96 21.49 96 48S117.5 95.1 143.1 95.1zM96.01 348.1l-31.03 124.2c-4.312 17.16 6.125 34.53 23.28 38.81C90.86 511.7 93.48 512 96.04 512c14.34 0 27.38-9.703 31-24.23l22.04-88.18L96.01 346.5V348.1zM313.6 268.8l-76.78-102.4C218.8 142.3 190.1 128 160 128L135.6 127.1c-36.59 0-69.5 20.33-85.87 53.06L3.387 273.7C-4.518 289.5 1.887 308.7 17.7 316.6c4.594 2.297 9.469 3.375 14.28 3.375c11.75 0 23.03-6.469 28.66-17.69l35.38-70.76v56.45c0 8.484 3.375 16.62 9.375 22.63l86.63 86.63v82.75c0 17.67 14.31 32 32 32c17.69 0 32-14.33 32-32v-82.75c0-17.09-6.656-33.16-18.75-45.25L192 306.8V213.3l70.38 93.88c10.59 14.11 30.62 16.98 44.78 6.406C321.3 303 324.2 282.9 313.6 268.8z"],"peseta-sign":[384,512,[],"e221","M192 32C269.4 32 333.1 86.97 348.8 160H352C369.7 160 384 174.3 384 192C384 209.7 369.7 224 352 224H348.8C333.1 297 269.4 352 192 352H96V448C96 465.7 81.67 480 64 480C46.33 480 32 465.7 32 448V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160V64C32 46.33 46.33 32 64 32H192zM282.5 160C269.4 122.7 233.8 96 192 96H96V160H282.5zM96 224V288H192C233.8 288 269.4 261.3 282.5 224H96z"],"peso-sign":[384,512,[],"e222","M176 32C244.4 32 303.7 71.01 332.8 128H352C369.7 128 384 142.3 384 160C384 177.7 369.7 192 352 192H351.3C351.8 197.3 352 202.6 352 208C352 213.4 351.8 218.7 351.3 224H352C369.7 224 384 238.3 384 256C384 273.7 369.7 288 352 288H332.8C303.7 344.1 244.4 384 176 384H96V448C96 465.7 81.67 480 64 480C46.33 480 32 465.7 32 448V288C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224V192C14.33 192 0 177.7 0 160C0 142.3 14.33 128 32 128V64C32 46.33 46.33 32 64 32H176zM254.4 128C234.2 108.2 206.5 96 176 96H96V128H254.4zM96 192V224H286.9C287.6 218.8 288 213.4 288 208C288 202.6 287.6 197.2 286.9 192H96zM254.4 288H96V320H176C206.5 320 234.2 307.8 254.4 288z"],phone:[512,512,[128379,128222],"f095","M511.2 387l-23.25 100.8c-3.266 14.25-15.79 24.22-30.46 24.22C205.2 512 0 306.8 0 54.5c0-14.66 9.969-27.2 24.22-30.45l100.8-23.25C139.7-2.602 154.7 5.018 160.8 18.92l46.52 108.5c5.438 12.78 1.77 27.67-8.98 36.45L144.5 207.1c33.98 69.22 90.26 125.5 159.5 159.5l44.08-53.8c8.688-10.78 23.69-14.51 36.47-8.975l108.5 46.51C506.1 357.2 514.6 372.4 511.2 387z"],"phone-flip":[512,512,[128381,"phone-alt"],"f879","M18.92 351.2l108.5-46.52c12.78-5.531 27.77-1.801 36.45 8.98l44.09 53.82c69.25-34 125.5-90.31 159.5-159.5l-53.81-44.04c-10.75-8.781-14.41-23.69-8.974-36.47l46.51-108.5c6.094-13.91 21.1-21.52 35.79-18.11l100.8 23.25c14.25 3.25 24.22 15.8 24.22 30.46c0 252.3-205.2 457.5-457.5 457.5c-14.67 0-27.18-9.968-30.45-24.22l-23.25-100.8C-2.571 372.4 5.018 357.2 18.92 351.2z"],"phone-slash":[640,512,[],"f3dd","M271.1 367.5L227.9 313.7c-8.688-10.78-23.69-14.51-36.47-8.974l-108.5 46.51c-13.91 6-21.49 21.19-18.11 35.79l23.25 100.8C91.32 502 103.8 512 118.5 512c107.4 0 206.1-37.46 284.2-99.65l-88.75-69.56C300.6 351.9 286.6 360.3 271.1 367.5zM630.8 469.1l-159.6-125.1c65.03-78.97 104.7-179.5 104.7-289.5c0-14.66-9.969-27.2-24.22-30.45L451 .8125c-14.69-3.406-29.73 4.213-35.82 18.12l-46.52 108.5c-5.438 12.78-1.771 27.67 8.979 36.45l53.82 44.08C419.2 232.1 403.9 256.2 386.2 277.4L38.81 5.111C34.41 1.673 29.19 0 24.03 0C16.91 0 9.84 3.158 5.121 9.189c-8.188 10.44-6.37 25.53 4.068 33.7l591.1 463.1c10.5 8.203 25.57 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],"phone-volume":[512,512,["volume-control-phone"],"f2a0","M284.6 181.9c-10.28-8.344-25.41-6.875-33.75 3.406C242.4 195.6 243.9 210.7 254.2 219.1c11.31 9.25 17.81 22.69 17.81 36.87c0 14.19-6.5 27.62-17.81 36.87c-10.28 8.406-11.78 23.53-3.375 33.78c4.719 5.812 11.62 8.812 18.56 8.812c5.344 0 10.75-1.781 15.19-5.406c22.53-18.44 35.44-45.4 35.44-74.05S307.1 200.4 284.6 181.9zM345.1 107.1c-10.22-8.344-25.34-6.907-33.78 3.343c-8.406 10.25-6.906 25.37 3.344 33.78c33.88 27.78 53.31 68.18 53.31 110.9s-19.44 83.09-53.31 110.9c-10.25 8.406-11.75 23.53-3.344 33.78c4.75 5.781 11.62 8.781 18.56 8.781c5.375 0 10.75-1.781 15.22-5.438C390.2 367.1 416 313.1 416 255.1S390.2 144.9 345.1 107.1zM406.4 33.15c-10.22-8.344-25.34-6.875-33.78 3.344c-8.406 10.25-6.906 25.37 3.344 33.78C431.9 116.1 464 183.8 464 255.1s-32.09 139.9-88.06 185.7c-10.25 8.406-11.75 23.53-3.344 33.78c4.75 5.781 11.62 8.781 18.56 8.781c5.375 0 10.75-1.781 15.22-5.438C473.5 423.8 512 342.6 512 255.1S473.5 88.15 406.4 33.15zM151.3 174.6C161.1 175.6 172.1 169.5 176 159.6l33.75-84.38C214 64.35 209.1 51.1 200.2 45.86l-67.47-42.17C123.2-2.289 110.9-.8945 102.9 7.08C-34.32 144.3-34.31 367.7 102.9 504.9c7.982 7.984 20.22 9.379 29.75 3.402l67.48-42.19c9.775-6.104 13.9-18.47 9.598-29.3L176 352.5c-3.945-9.963-14.14-16.11-24.73-14.97l-53.24 5.314C78.89 286.7 78.89 225.4 98.06 169.3L151.3 174.6z"],"photo-film":[640,512,["photo-video"],"f87c","M352 432c0 8.836-7.164 16-16 16H176c-8.838 0-16-7.164-16-16L160 128H48C21.49 128 .0003 149.5 .0003 176v288c0 26.51 21.49 48 48 48h416c26.51 0 48-21.49 48-48L512 384h-160L352 432zM104 439c0 4.969-4.031 9-9 9h-30c-4.969 0-9-4.031-9-9v-30c0-4.969 4.031-9 9-9h30c4.969 0 9 4.031 9 9V439zM104 335c0 4.969-4.031 9-9 9h-30c-4.969 0-9-4.031-9-9v-30c0-4.969 4.031-9 9-9h30c4.969 0 9 4.031 9 9V335zM104 231c0 4.969-4.031 9-9 9h-30c-4.969 0-9-4.031-9-9v-30C56 196 60.03 192 65 192h30c4.969 0 9 4.031 9 9V231zM408 409c0-4.969 4.031-9 9-9h30c4.969 0 9 4.031 9 9v30c0 4.969-4.031 9-9 9h-30c-4.969 0-9-4.031-9-9V409zM591.1 0H239.1C213.5 0 191.1 21.49 191.1 48v256c0 26.51 21.49 48 48 48h352c26.51 0 48-21.49 48-48v-256C640 21.49 618.5 0 591.1 0zM303.1 64c17.68 0 32 14.33 32 32s-14.32 32-32 32C286.3 128 271.1 113.7 271.1 96S286.3 64 303.1 64zM574.1 279.6C571.3 284.8 565.9 288 560 288H271.1C265.1 288 260.5 284.6 257.7 279.3C255 273.9 255.5 267.4 259.1 262.6l70-96C332.1 162.4 336.9 160 341.1 160c5.11 0 9.914 2.441 12.93 6.574l22.35 30.66l62.74-94.11C442.1 98.67 447.1 96 453.3 96c5.348 0 10.34 2.672 13.31 7.125l106.7 160C576.6 268 576.9 274.3 574.1 279.6z"],"piggy-bank":[576,512,[],"f4d3","M400 96L399.1 96.66C394.7 96.22 389.4 96 384 96H256C239.5 96 223.5 98.08 208.2 102C208.1 100 208 98.02 208 96C208 42.98 250.1 0 304 0C357 0 400 42.98 400 96zM384 128C387.5 128 390.1 128.1 394.4 128.3C398.7 128.6 402.9 129 407 129.6C424.6 109.1 450.8 96 480 96H512L493.2 171.1C509.1 185.9 521.9 203.9 530.7 224H544C561.7 224 576 238.3 576 256V352C576 369.7 561.7 384 544 384H512C502.9 396.1 492.1 406.9 480 416V480C480 497.7 465.7 512 448 512H416C398.3 512 384 497.7 384 480V448H256V480C256 497.7 241.7 512 224 512H192C174.3 512 160 497.7 160 480V416C125.1 389.8 101.3 349.8 96.79 304H68C30.44 304 0 273.6 0 236C0 198.4 30.44 168 68 168H72C85.25 168 96 178.7 96 192C96 205.3 85.25 216 72 216H68C56.95 216 48 224.1 48 236C48 247 56.95 256 68 256H99.2C111.3 196.2 156.9 148.5 215.5 133.2C228.4 129.8 241.1 128 256 128H384zM424 240C410.7 240 400 250.7 400 264C400 277.3 410.7 288 424 288C437.3 288 448 277.3 448 264C448 250.7 437.3 240 424 240z"],pills:[576,512,[],"f484","M112 32C50.12 32 0 82.12 0 143.1v223.1c0 61.88 50.12 111.1 112 111.1s112-50.12 112-111.1V143.1C224 82.12 173.9 32 112 32zM160 256H64V144c0-26.5 21.5-48 48-48s48 21.5 48 48V256zM299.8 226.2c-3.5-3.5-9.5-3-12.38 .875c-45.25 62.5-40.38 150.1 15.88 206.4c56.38 56.25 144 61.25 206.5 15.88c4-2.875 4.249-8.75 .75-12.25L299.8 226.2zM529.5 207.2c-56.25-56.25-143.9-61.13-206.4-15.87c-4 2.875-4.375 8.875-.875 12.38l210.9 210.7c3.5 3.5 9.375 3.125 12.25-.75C590.8 351.1 585.9 263.6 529.5 207.2z"],"pizza-slice":[512,512,[],"f818","M100.4 112.3L.5101 491.7c-1.375 5.625 .1622 11.6 4.287 15.6c4.127 4.125 10.13 5.744 15.63 4.119l379.1-105.1C395.3 231.4 276.5 114.1 100.4 112.3zM127.1 416c-17.62 0-32-14.38-32-31.1c0-17.62 14.39-32 32.01-32c17.63 0 32 14.38 32 31.1C160 401.6 145.6 416 127.1 416zM175.1 271.1c-17.63 0-32-14.38-32-32c0-17.62 14.38-31.1 32-31.1c17.62 0 32 14.38 32 31.1C208 257.6 193.6 271.1 175.1 271.1zM272 367.1c-17.62 0-32-14.38-32-31.1c0-17.62 14.38-32 32-32c17.63 0 32 14.38 32 32C304 353.6 289.6 367.1 272 367.1zM158.9 .1406c-16.13-1.5-31.25 8.501-35.38 24.12L108.7 80.52c187.6 5.5 314.5 130.6 322.5 316.1l56.88-15.75c15.75-4.375 25.5-19.62 23.63-35.87C490.9 165.1 340.8 17.39 158.9 .1406z"],"place-of-worship":[640,512,[],"f67f","M233.4 86.63L308.7 11.32C314.9 5.067 325.1 5.067 331.3 11.32L406.6 86.63C412.6 92.63 416 100.8 416 109.3V217.6L456.7 242C471.2 250.7 480 266.3 480 283.2V512H384V416C384 380.7 355.3 352 319.1 352C284.7 352 255.1 380.7 255.1 416V512H159.1V283.2C159.1 266.3 168.8 250.7 183.3 242L223.1 217.6V109.3C223.1 100.8 227.4 92.63 233.4 86.63H233.4zM24.87 330.3L128 273.6V512H48C21.49 512 0 490.5 0 464V372.4C0 354.9 9.53 338.8 24.87 330.3V330.3zM592 512H512V273.6L615.1 330.3C630.5 338.8 640 354.9 640 372.4V464C640 490.5 618.5 512 592 512V512z"],plane:[576,512,[],"f072","M482.3 192C516.5 192 576 221 576 256C576 292 516.5 320 482.3 320H365.7L265.2 495.9C259.5 505.8 248.9 512 237.4 512H181.2C170.6 512 162.9 501.8 165.8 491.6L214.9 320H112L68.8 377.6C65.78 381.6 61.04 384 56 384H14.03C6.284 384 0 377.7 0 369.1C0 368.7 .1818 367.4 .5398 366.1L32 256L.5398 145.9C.1818 144.6 0 143.3 0 142C0 134.3 6.284 128 14.03 128H56C61.04 128 65.78 130.4 68.8 134.4L112 192H214.9L165.8 20.4C162.9 10.17 170.6 0 181.2 0H237.4C248.9 0 259.5 6.153 265.2 16.12L365.7 192H482.3z"],"plane-arrival":[640,512,[128748],"f5af","M.2528 166.9L.0426 67.99C.0208 57.74 9.508 50.11 19.51 52.34L55.07 60.24C65.63 62.58 74.29 70.11 78.09 80.24L95.1 127.1L223.3 165.6L181.8 20.4C178.9 10.18 186.6 .001 197.2 .001H237.3C248.8 .001 259.5 6.236 265.2 16.31L374.2 210.2L481.5 241.8C497.4 246.5 512.2 254.3 525.2 264.7L559.6 292.2C583.7 311.4 577.7 349.5 548.9 360.5C507.7 376.1 462.7 378.5 420.1 367.4L121.7 289.8C110.6 286.9 100.5 281.1 92.4 272.9L9.536 189.4C3.606 183.4 .2707 175.3 .2528 166.9V166.9zM608 448C625.7 448 640 462.3 640 480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H608zM192 368C192 385.7 177.7 400 160 400C142.3 400 128 385.7 128 368C128 350.3 142.3 336 160 336C177.7 336 192 350.3 192 368zM224 384C224 366.3 238.3 352 256 352C273.7 352 288 366.3 288 384C288 401.7 273.7 416 256 416C238.3 416 224 401.7 224 384z"],"plane-circle-check":[640,512,[],"e555","M320 93.68V178.3L397.1 222.4C350.6 254 320 307.4 320 368C320 422.2 344.5 470.7 383.1 502.1C381 508.3 375.9 512 369.1 512C368.7 512 367.4 511.8 366.1 511.5L256 480L145.9 511.5C144.6 511.8 143.3 512 142 512C134.3 512 128 505.7 128 497.1V456C128 450.1 130.4 446.2 134.4 443.2L192 400V329.1L20.4 378.2C10.17 381.1 0 373.4 0 362.8V297.3C0 291.5 3.076 286.2 8.062 283.4L192 178.3V93.68C192 59.53 221 0 256 0C292 0 320 59.53 320 93.68H320zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"plane-circle-exclamation":[640,512,[],"e556","M320 93.68V178.3L397.1 222.4C350.6 254 320 307.4 320 368C320 422.2 344.5 470.7 383.1 502.1C381 508.3 375.9 512 369.1 512C368.7 512 367.4 511.8 366.1 511.5L256 480L145.9 511.5C144.6 511.8 143.3 512 142 512C134.3 512 128 505.7 128 497.1V456C128 450.1 130.4 446.2 134.4 443.2L192 400V329.1L20.4 378.2C10.17 381.1 0 373.4 0 362.8V297.3C0 291.5 3.076 286.2 8.062 283.4L192 178.3V93.68C192 59.53 221 0 256 0C292 0 320 59.53 320 93.68H320zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"plane-circle-xmark":[640,512,[],"e557","M320 93.68V178.3L397.1 222.4C350.6 254 320 307.4 320 368C320 422.2 344.5 470.7 383.1 502.1C381 508.3 375.9 512 369.1 512C368.7 512 367.4 511.8 366.1 511.5L256 480L145.9 511.5C144.6 511.8 143.3 512 142 512C134.3 512 128 505.7 128 497.1V456C128 450.1 130.4 446.2 134.4 443.2L192 400V329.1L20.4 378.2C10.17 381.1 0 373.4 0 362.8V297.3C0 291.5 3.076 286.2 8.062 283.4L192 178.3V93.68C192 59.53 221 0 256 0C292 0 320 59.53 320 93.68H320zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368L555.3 331.3z"],"plane-departure":[640,512,[128747],"f5b0","M484.6 62C502.6 52.8 522.6 48 542.8 48H600.2C627.2 48 645.9 74.95 636.4 100.2C618.2 148.9 582.1 188.9 535.6 212.2L262.8 348.6C258.3 350.8 253.4 352 248.4 352H110.7C101.4 352 92.5 347.9 86.42 340.8L13.34 255.6C6.562 247.7 9.019 235.5 18.33 230.8L50.49 214.8C59.05 210.5 69.06 210.2 77.8 214.1L135.1 239.1L234.6 189.7L87.64 95.2C77.21 88.49 78.05 72.98 89.14 67.43L135 44.48C150.1 36.52 169.5 35.55 186.1 41.8L381 114.9L484.6 62zM0 480C0 462.3 14.33 448 32 448H608C625.7 448 640 462.3 640 480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480z"],"plane-lock":[640,512,[],"e558","M192 93.68C192 59.53 221 0 256 0C292 0 320 59.53 320 93.68V178.3L421.8 236.4C418 247.6 416 259.6 416 272V296.6C398.1 306.9 385.7 325.7 384.2 347.5L320 329.1V400L377.6 443.2C381.6 446.2 384 450.1 384 456V497.1C384 505.7 377.7 512 369.1 512C368.7 512 367.4 511.8 366.1 511.5L256 480L145.9 511.5C144.6 511.8 143.3 512 142 512C134.3 512 128 505.7 128 497.1V456C128 450.1 130.4 446.2 134.4 443.2L192 400V329.1L20.4 378.2C10.17 381.1 0 373.4 0 362.8V297.3C0 291.5 3.076 286.2 8.062 283.4L192 178.3L192 93.68zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"plane-slash":[640,512,[],"e069","M238.1 161.3L197.8 20.4C194.9 10.17 202.6-.0001 213.2-.0001H269.4C280.9-.0001 291.5 6.153 297.2 16.12L397.7 192H514.3C548.5 192 608 221 608 256C608 292 548.5 320 514.3 320H440.6L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.237 28.37-3.065 38.81 5.112L238.1 161.3zM41.54 128.7L362.5 381.6L297.2 495.9C291.5 505.8 280.9 512 269.4 512H213.2C202.6 512 194.9 501.8 197.8 491.6L246.9 319.1H144L100.8 377.6C97.78 381.6 93.04 384 88 384H46.03C38.28 384 32 377.7 32 369.1C32 368.7 32.18 367.4 32.54 366.1L64 255.1L32.54 145.9C32.18 144.6 32 143.3 32 142C32 135.9 35.1 130.6 41.54 128.7V128.7z"],"plane-up":[512,512,[],"e22d","M192 93.68C192 59.53 221 0 256 0C292 0 320 59.53 320 93.68V160L497.8 278.5C506.7 284.4 512 294.4 512 305.1V361.8C512 372.7 501.3 380.4 490.9 376.1L320 319.1V400L377.6 443.2C381.6 446.2 384 450.1 384 456V497.1C384 505.7 377.7 512 369.1 512C368.7 512 367.4 511.8 366.1 511.5L256 480L145.9 511.5C144.6 511.8 143.3 512 142 512C134.3 512 128 505.7 128 497.1V456C128 450.1 130.4 446.2 134.4 443.2L192 400V319.1L21.06 376.1C10.7 380.4 0 372.7 0 361.8V305.1C0 294.4 5.347 284.4 14.25 278.5L192 160L192 93.68z"],"plant-wilt":[512,512,[],"e5aa","M288 512H224V248C224 217.1 198.9 192 168 192C137.1 192 112 217.1 112 248V260.1C141.3 270.9 160 295.5 160 331.1C160 359.1 124.2 410.5 80 448C35.83 410.5 0 360.4 0 331.1C0 295.5 18.67 270.9 48 260.1V248C48 181.7 101.7 128 168 128C188.2 128 207.3 133 224 141.8V120C224 53.73 277.7 0 344 0C410.3 0 464 53.73 464 120V132.1C493.3 142.9 512 167.5 512 203.1C512 231.1 476.2 282.5 432 320C387.8 282.5 352 232.4 352 203.1C352 167.5 370.7 142.9 400 132.1V120C400 89.07 374.9 64 344 64C313.1 64 288 89.07 288 120V512z"],"plate-wheat":[512,512,[],"e55a","M256 112V128C256 136.8 248.8 144 240 144C195.8 144 160 108.2 160 64V48C160 39.16 167.2 32 176 32C220.2 32 256 67.82 256 112zM104 64C117.3 64 128 74.75 128 88C128 101.3 117.3 112 104 112H56C42.75 112 32 101.3 32 88C32 74.75 42.75 64 56 64H104zM136 136C149.3 136 160 146.7 160 160C160 173.3 149.3 184 136 184H24C10.75 184 0 173.3 0 160C0 146.7 10.75 136 24 136H136zM32 232C32 218.7 42.75 208 56 208H104C117.3 208 128 218.7 128 232C128 245.3 117.3 256 104 256H56C42.75 256 32 245.3 32 232zM272 48C272 39.16 279.2 32 288 32C332.2 32 368 67.82 368 112V128C368 136.8 360.8 144 352 144C307.8 144 272 108.2 272 64V48zM480 112V128C480 136.8 472.8 144 464 144C419.8 144 384 108.2 384 64V48C384 39.16 391.2 32 400 32C444.2 32 480 67.82 480 112zM480 208C480 252.2 444.2 288 400 288C391.2 288 384 280.8 384 272V256C384 211.8 419.8 176 464 176C472.8 176 480 183.2 480 192V208zM352 176C360.8 176 368 183.2 368 192V208C368 252.2 332.2 288 288 288C279.2 288 272 280.8 272 272V256C272 211.8 307.8 176 352 176zM256 208C256 252.2 220.2 288 176 288C167.2 288 160 280.8 160 272V256C160 211.8 195.8 176 240 176C248.8 176 256 183.2 256 192V208zM3.451 347.6C1.618 332.9 13.05 320 27.82 320H484.2C498.1 320 510.4 332.9 508.6 347.6C502.3 397.8 464.2 437 416 446V448C416 465.7 401.7 480 384 480H127.1C110.3 480 95.1 465.7 95.1 448V446C47.84 437 9.724 397.8 3.45 347.6H3.451z"],play:[384,512,[9654],"f04b","M361 215C375.3 223.8 384 239.3 384 256C384 272.7 375.3 288.2 361 296.1L73.03 472.1C58.21 482 39.66 482.4 24.52 473.9C9.377 465.4 0 449.4 0 432V80C0 62.64 9.377 46.63 24.52 38.13C39.66 29.64 58.21 29.99 73.03 39.04L361 215z"],plug:[384,512,[128268],"f1e6","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 209.7 369.7 224 352 224V256C352 333.4 297 397.1 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352z"],"plug-circle-bolt":[576,512,[],"e55b","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM464.8 286.4L368.8 358.4C364.7 361.5 362.1 366.9 364.6 371.8C366.2 376.7 370.8 380 376 380H411.6L381.5 434.2C378.8 439.1 379.8 445.3 384.1 449C388.4 452.8 394.7 452.1 399.2 449.6L495.2 377.6C499.3 374.5 501 369.1 499.4 364.2C497.8 359.3 493.2 356 488 356H452.4L482.5 301.8C485.2 296.9 484.2 290.7 479.9 286.1C475.6 283.2 469.3 283 464.8 286.4V286.4z"],"plug-circle-check":[576,512,[],"e55c","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM476.7 324.7L416 385.4L387.3 356.7C381.1 350.4 370.9 350.4 364.7 356.7C358.4 362.9 358.4 373.1 364.7 379.3L404.7 419.3C410.9 425.6 421.1 425.6 427.3 419.3L499.3 347.3C505.6 341.1 505.6 330.9 499.3 324.7C493.1 318.4 482.9 318.4 476.7 324.7H476.7z"],"plug-circle-exclamation":[576,512,[],"e55d","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM432 464C445.3 464 456 453.3 456 440C456 426.7 445.3 416 432 416C418.7 416 408 426.7 408 440C408 453.3 418.7 464 432 464zM415.1 288V368C415.1 376.8 423.2 384 431.1 384C440.8 384 447.1 376.8 447.1 368V288C447.1 279.2 440.8 272 431.1 272C423.2 272 415.1 279.2 415.1 288z"],"plug-circle-minus":[576,512,[],"e55e","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368zM496 351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1z"],"plug-circle-plus":[576,512,[],"e55f","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM448 303.1C448 295.2 440.8 287.1 432 287.1C423.2 287.1 416 295.2 416 303.1V351.1H368C359.2 351.1 352 359.2 352 367.1C352 376.8 359.2 383.1 368 383.1H416V431.1C416 440.8 423.2 447.1 432 447.1C440.8 447.1 448 440.8 448 431.1V383.1H496C504.8 383.1 512 376.8 512 367.1C512 359.2 504.8 351.1 496 351.1H448V303.1z"],"plug-circle-xmark":[576,512,[],"e560","M96 0C113.7 0 128 14.33 128 32V128H64V32C64 14.33 78.33 0 96 0zM288 0C305.7 0 320 14.33 320 32V128H256V32C256 14.33 270.3 0 288 0zM352 160C369.7 160 384 174.3 384 192C384 194.3 383.7 196.6 383.3 198.8C309.8 219.1 256 287.7 256 368C256 379.4 257.1 390.5 259.1 401.3C248.1 406.4 236.3 410.3 224 412.8V512H160V412.8C86.97 397.1 32 333.4 32 256V224C14.33 224 0 209.7 0 192C0 174.3 14.33 160 32 160H352zM288 368C288 288.5 352.5 224 432 224C511.5 224 576 288.5 576 368C576 447.5 511.5 512 432 512C352.5 512 288 447.5 288 368zM491.3 331.3C497.6 325.1 497.6 314.9 491.3 308.7C485.1 302.4 474.9 302.4 468.7 308.7L432 345.4L395.3 308.7C389.1 302.4 378.9 302.4 372.7 308.7C366.4 314.9 366.4 325.1 372.7 331.3L409.4 368L372.7 404.7C366.4 410.9 366.4 421.1 372.7 427.3C378.9 433.6 389.1 433.6 395.3 427.3L432 390.6L468.7 427.3C474.9 433.6 485.1 433.6 491.3 427.3C497.6 421.1 497.6 410.9 491.3 404.7L454.6 368L491.3 331.3z"],plus:[448,512,[10133,61543,"add"],"2b","M432 256c0 17.69-14.33 32.01-32 32.01H256v144c0 17.69-14.33 31.99-32 31.99s-32-14.3-32-31.99v-144H48c-17.67 0-32-14.32-32-32.01s14.33-31.99 32-31.99H192v-144c0-17.69 14.33-32.01 32-32.01s32 14.32 32 32.01v144h144C417.7 224 432 238.3 432 256z"],"plus-minus":[384,512,[],"e43c","M352 448H32c-17.69 0-32 14.31-32 32s14.31 31.1 32 31.1h320c17.69 0 32-14.31 32-31.1S369.7 448 352 448zM48 208H160v111.1c0 17.69 14.31 31.1 32 31.1s32-14.31 32-31.1V208h112c17.69 0 32-14.32 32-32.01s-14.31-31.99-32-31.99H224v-112c0-17.69-14.31-32.01-32-32.01S160 14.33 160 32.01v112H48c-17.69 0-32 14.31-32 31.99S30.31 208 48 208z"],podcast:[448,512,[],"f2ce","M224 0C100.3 0 0 100.3 0 224c0 92.22 55.77 171.4 135.4 205.7c-3.48-20.75-6.17-41.59-6.998-58.15C80.08 340.1 48 285.8 48 224c0-97.05 78.95-176 176-176s176 78.95 176 176c0 61.79-32.08 116.1-80.39 147.6c-.834 16.5-3.541 37.37-7.035 58.17C392.2 395.4 448 316.2 448 224C448 100.3 347.7 0 224 0zM224 312c-32.88 0-64 8.625-64 43.75c0 33.13 12.88 104.3 20.62 132.8C185.8 507.6 205.1 512 224 512s38.25-4.375 43.38-23.38C275.1 459.9 288 388.8 288 355.8C288 320.6 256.9 312 224 312zM224 280c30.95 0 56-25.05 56-56S254.1 168 224 168S168 193 168 224S193 280 224 280zM368 224c0-79.53-64.47-144-144-144S80 144.5 80 224c0 44.83 20.92 84.38 53.04 110.8c4.857-12.65 14.13-25.88 32.05-35.04C165.1 299.7 165.4 299.7 165.6 299.7C142.9 282.1 128 254.9 128 224c0-53.02 42.98-96 96-96s96 42.98 96 96c0 30.92-14.87 58.13-37.57 75.68c.1309 .0254 .5078 .0488 .4746 .0742c17.93 9.16 27.19 22.38 32.05 35.04C347.1 308.4 368 268.8 368 224z"],poo:[512,512,[128169],"f2fe","M451.4 369.1C468.8 356 480 335.4 480 312c0-39.75-32.25-72-72-72h-14.12C407.3 228.2 416 211.2 416 191.1c0-35.25-28.75-63.1-64-63.1h-5.875C349.8 117.9 352 107.2 352 95.1c0-53-43-96-96-96c-5.25 0-10.25 .75-15.12 1.5C250.3 14.62 256 30.62 256 47.1c0 44.25-35.75 80-80 80H160c-35.25 0-64 28.75-64 63.1c0 19.25 8.75 36.25 22.12 48H104C64.25 239.1 32 272.3 32 312c0 23.38 11.25 44 28.62 57.13C26.25 374.6 0 404.1 0 440C0 479.8 32.25 512 72 512h368c39.75 0 72-32.25 72-72C512 404.1 485.8 374.6 451.4 369.1zM192 256c17.75 0 32 14.25 32 32s-14.25 32-32 32S160 305.8 160 288S174.3 256 192 256zM351.5 395C340.1 422.9 292.1 448 256 448c-36.99 0-84.98-25.12-95.48-53C158.5 389.8 162.5 384 168.3 384h175.5C349.5 384 353.5 389.8 351.5 395zM320 320c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S337.8 320 320 320z"],"poo-storm":[448,512,["poo-bolt"],"f75a","M304 368H248.3l38.45-89.7c2.938-6.859 .7187-14.84-5.312-19.23c-6.096-4.422-14.35-4.031-19.94 .8906l-128 111.1c-5.033 4.391-6.783 11.44-4.439 17.67c2.346 6.25 8.314 10.38 14.97 10.38H199.7l-38.45 89.7c-2.938 6.859-.7187 14.84 5.312 19.23C169.4 510.1 172.7 512 175.1 512c3.781 0 7.531-1.328 10.53-3.953l128-111.1c5.033-4.391 6.783-11.44 4.439-17.67C316.6 372.1 310.7 368 304 368zM373.3 226.6C379.9 216.6 384 204.9 384 192c0-35.38-28.62-64-64-64h-5.875C317.8 118 320 107.3 320 96c0-53-43-96-96-96C218.9 0 213.9 .75 208.9 1.5C218.3 14.62 224 30.62 224 48C224 92.13 188.1 128 144 128H128C92.63 128 64 156.6 64 192c0 12.88 4.117 24.58 10.72 34.55C31.98 236.3 0 274.3 0 320c0 53.02 42.98 96 96 96h12.79c-4.033-4.414-7.543-9.318-9.711-15.1c-7.01-18.64-1.645-39.96 13.32-53.02l127.9-111.9C249.1 228.2 260.3 223.1 271.1 224c10.19 0 19.95 3.174 28.26 9.203c18.23 13.27 24.76 36.1 15.89 57.71l-19.33 45.1h7.195c19.89 0 37.95 12.51 44.92 31.11C355.3 384 351 402.8 339.1 416H352c53.02 0 96-42.98 96-96C448 274.3 416 236.3 373.3 226.6z"],poop:[512,512,[],"f619","M512 440.1C512 479.9 479.7 512 439.1 512H71.92C32.17 512 0 479.8 0 440c0-35.88 26.19-65.35 60.56-70.85C43.31 356 32 335.4 32 312C32 272.2 64.25 240 104 240h13.99C104.5 228.2 96 211.2 96 192c0-35.38 28.56-64 63.94-64h16C220.1 128 256 92.12 256 48c0-17.38-5.784-33.35-15.16-46.47C245.8 .7754 250.9 0 256 0c53 0 96 43 96 96c0 11.25-2.288 22-5.913 32h5.879C387.3 128 416 156.6 416 192c0 19.25-8.59 36.25-22.09 48H408C447.8 240 480 272.2 480 312c0 23.38-11.38 44.01-28.63 57.14C485.7 374.6 512 404.3 512 440.1z"],"power-off":[512,512,[9211],"f011","M288 256C288 273.7 273.7 288 256 288C238.3 288 224 273.7 224 256V32C224 14.33 238.3 0 256 0C273.7 0 288 14.33 288 32V256zM80 256C80 353.2 158.8 432 256 432C353.2 432 432 353.2 432 256C432 201.6 407.3 152.9 368.5 120.6C354.9 109.3 353 89.13 364.3 75.54C375.6 61.95 395.8 60.1 409.4 71.4C462.2 115.4 496 181.8 496 255.1C496 388.5 388.5 496 256 496C123.5 496 16 388.5 16 255.1C16 181.8 49.75 115.4 102.6 71.4C116.2 60.1 136.4 61.95 147.7 75.54C158.1 89.13 157.1 109.3 143.5 120.6C104.7 152.9 80 201.6 80 256z"],prescription:[448,512,[],"f5b1","M440.1 448.4l-96.28-96.21l95.87-95.95c9.373-9.381 9.373-24.59 0-33.97l-22.62-22.64c-9.373-9.381-24.57-9.381-33.94 0L288.1 295.6L220.5 228c46.86-22.92 76.74-75.46 64.95-133.1C273.9 38.74 221.8 0 164.6 0H31.1C14.33 0 0 14.34 0 32.03v264.1c0 13.26 10.75 24.01 23.1 24.01l31.1 .085c13.25 0 23.1-10.75 23.1-24.02V240.2H119.4l112.1 112L135.4 448.4c-9.373 9.381-9.373 24.59 0 33.97l22.62 22.64c9.373 9.38 24.57 9.38 33.94 0l96.13-96.21l96.28 96.21c9.373 9.381 24.57 9.381 33.94 0l22.62-22.64C450.3 472.9 450.3 457.7 440.1 448.4zM79.1 80.06h87.1c22.06 0 39.1 17.95 39.1 40.03s-17.94 40.03-39.1 40.03H79.1V80.06z"],"prescription-bottle":[384,512,[],"f485","M32 192h112C152.8 192 160 199.2 160 208C160 216.8 152.8 224 144 224H32v64h112C152.8 288 160 295.2 160 304C160 312.8 152.8 320 144 320H32v64h112C152.8 384 160 391.2 160 400C160 408.8 152.8 416 144 416H32v32c0 35.2 28.8 64 64 64h192c35.2 0 64-28.8 64-64V128H32V192zM360 0H24C10.75 0 0 10.75 0 24v48C0 85.25 10.75 96 24 96h336C373.3 96 384 85.25 384 72v-48C384 10.75 373.3 0 360 0z"],"prescription-bottle-medical":[384,512,["prescription-bottle-alt"],"f486","M32 448c0 35.2 28.8 64 64 64h192c35.2 0 64-28.8 64-64V128H32V448zM96 304C96 295.2 103.2 288 112 288H160V240C160 231.2 167.2 224 176 224h32C216.8 224 224 231.2 224 240V288h48C280.8 288 288 295.2 288 304v32c0 8.799-7.199 16-16 16H224v48c0 8.799-7.199 16-16 16h-32C167.2 416 160 408.8 160 400V352H112C103.2 352 96 344.8 96 336V304zM360 0H24C10.75 0 0 10.75 0 24v48C0 85.25 10.75 96 24 96h336C373.3 96 384 85.25 384 72v-48C384 10.75 373.3 0 360 0z"],print:[512,512,[128424,128438,9113],"f02f","M448 192H64C28.65 192 0 220.7 0 256v96c0 17.67 14.33 32 32 32h32v96c0 17.67 14.33 32 32 32h320c17.67 0 32-14.33 32-32v-96h32c17.67 0 32-14.33 32-32V256C512 220.7 483.3 192 448 192zM384 448H128v-96h256V448zM432 296c-13.25 0-24-10.75-24-24c0-13.27 10.75-24 24-24s24 10.73 24 24C456 285.3 445.3 296 432 296zM128 64h229.5L384 90.51V160h64V77.25c0-8.484-3.375-16.62-9.375-22.62l-45.25-45.25C387.4 3.375 379.2 0 370.8 0H96C78.34 0 64 14.33 64 32v128h64V64z"],"pump-medical":[384,512,[],"e06a","M379.3 94.06l-43.32-43.32C323.1 38.74 307.7 32 290.8 32h-66.75c0-17.67-14.33-32-32-32H127.1c-17.67 0-32 14.33-32 32L96 128h128l-.0002-32h66.75l43.31 43.31c6.248 6.248 16.38 6.248 22.63 0l22.62-22.62C385.6 110.4 385.6 100.3 379.3 94.06zM235.6 160H84.37C51.27 160 23.63 185.2 20.63 218.2l-20.36 224C-3.139 479.7 26.37 512 64.01 512h191.1c37.63 0 67.14-32.31 63.74-69.79l-20.36-224C296.4 185.2 268.7 160 235.6 160zM239.1 333.3c0 7.363-5.971 13.33-13.33 13.33h-40v40c0 7.363-5.969 13.33-13.33 13.33h-26.67c-7.363 0-13.33-5.971-13.33-13.33v-40H93.33c-7.363 0-13.33-5.971-13.33-13.33V306.7c0-7.365 5.971-13.33 13.33-13.33h40v-40C133.3 245.1 139.3 240 146.7 240h26.67c7.363 0 13.33 5.969 13.33 13.33v40h40c7.363 0 13.33 5.969 13.33 13.33V333.3z"],"pump-soap":[384,512,[],"e06b","M235.6 160H84.37C51.27 160 23.63 185.2 20.63 218.2l-20.36 224C-3.139 479.7 26.37 512 64.01 512h191.1c37.63 0 67.14-32.31 63.74-69.79l-20.36-224C296.4 185.2 268.7 160 235.6 160zM159.1 416C124.7 416 96 389.7 96 357.3c0-25 38.08-75.47 55.5-97.27c4.25-5.312 12.75-5.312 17 0C185.9 281.8 224 332.3 224 357.3C224 389.7 195.3 416 159.1 416zM379.3 94.06l-43.32-43.32C323.1 38.74 307.7 32 290.8 32h-66.75c0-17.67-14.33-32-32-32H127.1c-17.67 0-32 14.33-32 32L96 128h128l-.0002-32h66.75l43.31 43.31c6.248 6.248 16.38 6.248 22.63 0l22.62-22.62C385.6 110.4 385.6 100.3 379.3 94.06z"],"puzzle-piece":[512,512,[129513],"f12e","M512 288c0 35.35-21.49 64-48 64c-32.43 0-31.72-32-55.64-32C394.9 320 384 330.9 384 344.4V480c0 17.67-14.33 32-32 32h-71.64C266.9 512 256 501.1 256 487.6C256 463.1 288 464.4 288 432c0-26.51-28.65-48-64-48s-64 21.49-64 48c0 32.43 32 31.72 32 55.64C192 501.1 181.1 512 167.6 512H32c-17.67 0-32-14.33-32-32v-135.6C0 330.9 10.91 320 24.36 320C48.05 320 47.6 352 80 352C106.5 352 128 323.3 128 288S106.5 223.1 80 223.1c-32.43 0-31.72 32-55.64 32C10.91 255.1 0 245.1 0 231.6v-71.64c0-17.67 14.33-31.1 32-31.1h135.6C181.1 127.1 192 117.1 192 103.6c0-23.69-32-23.24-32-55.64c0-26.51 28.65-47.1 64-47.1s64 21.49 64 47.1c0 32.43-32 31.72-32 55.64c0 13.45 10.91 24.36 24.36 24.36H352c17.67 0 32 14.33 32 31.1v71.64c0 13.45 10.91 24.36 24.36 24.36c23.69 0 23.24-32 55.64-32C490.5 223.1 512 252.7 512 288z"],q:[448,512,[113],"51","M393.1 402.5c34.12-39.32 54.93-90.48 54.93-146.5c0-123.5-100.5-224-223.1-224S.0001 132.5 .0001 256s100.5 224 223.1 224c44.45 0 85.81-13.16 120.7-35.58l46.73 56.08c6.328 7.594 15.42 11.52 24.59 11.52c21.35 0 31.98-18.26 31.98-32.01c0-7.223-2.433-14.49-7.419-20.47L393.1 402.5zM224 416c-88.22 0-160-71.78-160-160s71.78-159.1 160-159.1s160 71.78 160 159.1c0 36.21-12.55 69.28-32.92 96.12L280.6 267.5c-6.338-7.597-15.44-11.53-24.61-11.53c-21.27 0-31.96 18.22-31.96 32.02c0 7.223 2.433 14.49 7.419 20.47l71.53 85.83C279.6 407.7 252.8 416 224 416z"],qrcode:[448,512,[],"f029","M144 32C170.5 32 192 53.49 192 80V176C192 202.5 170.5 224 144 224H48C21.49 224 0 202.5 0 176V80C0 53.49 21.49 32 48 32H144zM128 96H64V160H128V96zM144 288C170.5 288 192 309.5 192 336V432C192 458.5 170.5 480 144 480H48C21.49 480 0 458.5 0 432V336C0 309.5 21.49 288 48 288H144zM128 352H64V416H128V352zM256 80C256 53.49 277.5 32 304 32H400C426.5 32 448 53.49 448 80V176C448 202.5 426.5 224 400 224H304C277.5 224 256 202.5 256 176V80zM320 160H384V96H320V160zM352 448H384V480H352V448zM448 480H416V448H448V480zM416 288H448V416H352V384H320V480H256V288H352V320H416V288z"],question:[320,512,[10067,10068,61736],"3f","M204.3 32.01H96c-52.94 0-96 43.06-96 96c0 17.67 14.31 31.1 32 31.1s32-14.32 32-31.1c0-17.64 14.34-32 32-32h108.3C232.8 96.01 256 119.2 256 147.8c0 19.72-10.97 37.47-30.5 47.33L127.8 252.4C117.1 258.2 112 268.7 112 280v40c0 17.67 14.31 31.99 32 31.99s32-14.32 32-31.99V298.3L256 251.3c39.47-19.75 64-59.42 64-103.5C320 83.95 268.1 32.01 204.3 32.01zM144 400c-22.09 0-40 17.91-40 40s17.91 39.1 40 39.1s40-17.9 40-39.1S166.1 400 144 400z"],"quote-left":[448,512,[8220,"quote-left-alt"],"f10d","M96 224C84.72 224 74.05 226.3 64 229.9V224c0-35.3 28.7-64 64-64c17.67 0 32-14.33 32-32S145.7 96 128 96C57.42 96 0 153.4 0 224v96c0 53.02 42.98 96 96 96s96-42.98 96-96S149 224 96 224zM352 224c-11.28 0-21.95 2.305-32 5.879V224c0-35.3 28.7-64 64-64c17.67 0 32-14.33 32-32s-14.33-32-32-32c-70.58 0-128 57.42-128 128v96c0 53.02 42.98 96 96 96s96-42.98 96-96S405 224 352 224z"],"quote-right":[448,512,[8221,"quote-right-alt"],"f10e","M96 96C42.98 96 0 138.1 0 192s42.98 96 96 96c11.28 0 21.95-2.305 32-5.879V288c0 35.3-28.7 64-64 64c-17.67 0-32 14.33-32 32s14.33 32 32 32c70.58 0 128-57.42 128-128V192C192 138.1 149 96 96 96zM448 192c0-53.02-42.98-96-96-96s-96 42.98-96 96s42.98 96 96 96c11.28 0 21.95-2.305 32-5.879V288c0 35.3-28.7 64-64 64c-17.67 0-32 14.33-32 32s14.33 32 32 32c70.58 0 128-57.42 128-128V192z"],r:[320,512,[114],"52","M228.7 309.7C282 288.6 320 236.8 320 176c0-79.41-64.59-144-144-144H32c-17.67 0-32 14.33-32 32v384c0 17.67 14.33 32 32 32s32-14.33 32-32v-128h93.43l104.5 146.6c6.25 8.75 16.09 13.42 26.09 13.42c6.422 0 12.91-1.922 18.55-5.938c14.39-10.27 17.73-30.25 7.484-44.64L228.7 309.7zM64 96.01h112c44.11 0 80 35.89 80 80s-35.89 79.1-80 79.1H64V96.01z"],radiation:[512,512,[],"f7b9","M256 303.1c26.5 0 48-21.5 48-48S282.5 207.1 256 207.1S208 229.5 208 255.1S229.5 303.1 256 303.1zM213.6 188L142.7 74.71C132.5 58.41 109.9 54.31 95.25 66.75c-44.94 38.1-76.19 91.82-85.17 152.8C7.266 238.7 22.67 255.8 42.01 255.8h133.8C175.8 227.2 191 202.3 213.6 188zM416.8 66.75c-14.67-12.44-37.21-8.338-47.41 7.965L298.4 188c22.6 14.3 37.8 39.2 37.8 67.8h133.8c19.34 0 34.74-17.13 31.93-36.26C492.9 158.6 461.7 104.8 416.8 66.75zM298.4 323.5C286.1 331.2 271.6 335.9 256 335.9s-30.1-4.701-42.4-12.4L142.7 436.9c-10.14 16.21-4.16 38.2 13.32 45.95C186.6 496.4 220.4 504 256 504s69.42-7.611 100-21.18c17.48-7.752 23.46-29.74 13.32-45.95L298.4 323.5z"],radio:[512,512,[128251],"f8d7","M447.1 128L218.5 128l276.2-80.97c12.72-3.734 19.1-17.06 16.28-29.78c-3.719-12.7-16.1-19.1-29.78-16.28L51.75 126.9c-29.07 8.512-49.55 34.8-51.39 64.78L.0007 192v255.1c0 35.31 28.69 63.1 63.1 63.1h383.1c35.31 0 63.1-28.69 63.1-63.1V192C511.1 156.7 483.3 128 447.1 128zM80 248c0-4.406 3.594-7.1 7.1-7.1h111.1c4.406 0 7.1 3.594 7.1 7.1V263.1c0 4.406-3.594 7.1-7.1 7.1h-111.1c-4.406 0-7.1-3.594-7.1-7.1V248zM208 391.1c0 4.406-3.594 7.1-7.1 7.1h-111.1c-4.406 0-7.1-3.594-7.1-7.1v-15.1c0-4.406 3.594-7.1 7.1-7.1h111.1c4.406 0 7.1 3.594 7.1 7.1V391.1zM224 327.1c0 4.406-3.594 7.1-7.1 7.1H72c-4.406 0-7.1-3.594-7.1-7.1V311.1c0-4.406 3.594-7.1 7.1-7.1h143.1c4.406 0 7.1 3.594 7.1 7.1V327.1zM367.1 399.1c-44.16 0-80-35.84-80-79.1s35.84-80 80-80s79.1 35.85 79.1 80S412.2 399.1 367.1 399.1z"],rainbow:[640,512,[127752],"f75b","M312.3 32.09C137.6 36.22 0 183.3 0 358V464C0 472.8 7.164 480 16 480h32C56.84 480 64 472.8 64 464v-106.9c0-143.2 117.2-263.5 260.4-261.1C463.5 98.4 576 212.3 576 352v112c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16V352C640 172.1 492.3 27.84 312.3 32.09zM313.5 224.2C244.8 227.6 192 286.9 192 355.7V464C192 472.8 199.2 480 208 480h32C248.8 480 256 472.8 256 464v-109.7c0-34.06 25.65-63.85 59.64-66.11C352.9 285.7 384 315.3 384 352v112c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16V352C448 279.3 387 220.5 313.5 224.2zM313.2 128.1C191.4 131.7 96 234.9 96 356.8V464C96 472.8 103.2 480 112 480h32C152.8 480 160 472.8 160 464v-108.1c0-86.64 67.24-160.5 153.8-163.8C404.8 188.7 480 261.7 480 352v112c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16V352C544 226.2 439.8 124.3 313.2 128.1z"],"ranking-star":[640,512,[],"e561","M406.1 61.65C415.4 63.09 419.4 74.59 412.6 81.41L374.6 118.1L383.6 170.1C384.1 179.5 375.3 186.7 366.7 182.4L320.2 157.9L273.3 182.7C264.7 187 255 179.8 256.4 170.5L265.4 118.4L227.4 81.41C220.6 74.59 224.6 63.09 233.9 61.65L286.2 54.11L309.8 6.332C314.1-2.289 326.3-1.93 330.2 6.332L353.8 54.11L406.1 61.65zM384 256C401.7 256 416 270.3 416 288V480C416 497.7 401.7 512 384 512H256C238.3 512 224 497.7 224 480V288C224 270.3 238.3 256 256 256H384zM160 320C177.7 320 192 334.3 192 352V480C192 497.7 177.7 512 160 512H32C14.33 512 0 497.7 0 480V352C0 334.3 14.33 320 32 320H160zM448 416C448 398.3 462.3 384 480 384H608C625.7 384 640 398.3 640 416V480C640 497.7 625.7 512 608 512H480C462.3 512 448 497.7 448 480V416z"],receipt:[384,512,[129534],"f543","M13.97 2.196C22.49-1.72 32.5-.3214 39.62 5.778L80 40.39L120.4 5.778C129.4-1.926 142.6-1.926 151.6 5.778L192 40.39L232.4 5.778C241.4-1.926 254.6-1.926 263.6 5.778L304 40.39L344.4 5.778C351.5-.3214 361.5-1.72 370 2.196C378.5 6.113 384 14.63 384 24V488C384 497.4 378.5 505.9 370 509.8C361.5 513.7 351.5 512.3 344.4 506.2L304 471.6L263.6 506.2C254.6 513.9 241.4 513.9 232.4 506.2L192 471.6L151.6 506.2C142.6 513.9 129.4 513.9 120.4 506.2L80 471.6L39.62 506.2C32.5 512.3 22.49 513.7 13.97 509.8C5.456 505.9 0 497.4 0 488V24C0 14.63 5.456 6.112 13.97 2.196V2.196zM96 144C87.16 144 80 151.2 80 160C80 168.8 87.16 176 96 176H288C296.8 176 304 168.8 304 160C304 151.2 296.8 144 288 144H96zM96 368H288C296.8 368 304 360.8 304 352C304 343.2 296.8 336 288 336H96C87.16 336 80 343.2 80 352C80 360.8 87.16 368 96 368zM96 240C87.16 240 80 247.2 80 256C80 264.8 87.16 272 96 272H288C296.8 272 304 264.8 304 256C304 247.2 296.8 240 288 240H96z"],"record-vinyl":[512,512,[],"f8d9","M256 160C202.9 160 160 202.9 160 256s42.92 96 96 96c53.08 0 96-42.92 96-96S309.1 160 256 160zM256 288C238.3 288 224 273.7 224 256s14.33-32 32-32c17.67 0 32 14.33 32 32S273.7 288 256 288zM256 0c-141.4 0-256 114.6-256 256s114.6 256 256 256c141.4 0 256-114.6 256-256S397.4 0 256 0zM256 384c-70.75 0-128-57.25-128-128s57.25-128 128-128s128 57.25 128 128S326.8 384 256 384z"],"rectangle-ad":[576,512,["ad"],"f641","M208 237.7L229.2 280H186.8L208 237.7zM416 280C416 293.3 405.3 304 392 304C378.7 304 368 293.3 368 280C368 266.7 378.7 256 392 256C405.3 256 416 266.7 416 280zM512 32C547.3 32 576 60.65 576 96V416C576 451.3 547.3 480 512 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H512zM229.5 173.3C225.4 165.1 217.1 160 208 160C198.9 160 190.6 165.1 186.5 173.3L114.5 317.3C108.6 329.1 113.4 343.5 125.3 349.5C137.1 355.4 151.5 350.6 157.5 338.7L162.8 328H253.2L258.5 338.7C264.5 350.6 278.9 355.4 290.7 349.5C302.6 343.5 307.4 329.1 301.5 317.3L229.5 173.3zM416 212.1C408.5 209.4 400.4 208 392 208C352.2 208 320 240.2 320 280C320 319.8 352.2 352 392 352C403.1 352 413.6 349.5 423 344.1C427.4 349.3 433.4 352 440 352C453.3 352 464 341.3 464 328V184C464 170.7 453.3 160 440 160C426.7 160 416 170.7 416 184V212.1z"],"rectangle-list":[576,512,["list-alt"],"f022","M0 96C0 60.65 28.65 32 64 32H512C547.3 32 576 60.65 576 96V416C576 451.3 547.3 480 512 480H64C28.65 480 0 451.3 0 416V96zM160 256C160 238.3 145.7 224 128 224C110.3 224 96 238.3 96 256C96 273.7 110.3 288 128 288C145.7 288 160 273.7 160 256zM160 160C160 142.3 145.7 128 128 128C110.3 128 96 142.3 96 160C96 177.7 110.3 192 128 192C145.7 192 160 177.7 160 160zM160 352C160 334.3 145.7 320 128 320C110.3 320 96 334.3 96 352C96 369.7 110.3 384 128 384C145.7 384 160 369.7 160 352zM224 136C210.7 136 200 146.7 200 160C200 173.3 210.7 184 224 184H448C461.3 184 472 173.3 472 160C472 146.7 461.3 136 448 136H224zM224 232C210.7 232 200 242.7 200 256C200 269.3 210.7 280 224 280H448C461.3 280 472 269.3 472 256C472 242.7 461.3 232 448 232H224zM224 328C210.7 328 200 338.7 200 352C200 365.3 210.7 376 224 376H448C461.3 376 472 365.3 472 352C472 338.7 461.3 328 448 328H224z"],"rectangle-xmark":[512,512,[62164,"rectangle-times","times-rectangle","window-close"],"f410","M448 32C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM175 208.1L222.1 255.1L175 303C165.7 312.4 165.7 327.6 175 336.1C184.4 346.3 199.6 346.3 208.1 336.1L255.1 289.9L303 336.1C312.4 346.3 327.6 346.3 336.1 336.1C346.3 327.6 346.3 312.4 336.1 303L289.9 255.1L336.1 208.1C346.3 199.6 346.3 184.4 336.1 175C327.6 165.7 312.4 165.7 303 175L255.1 222.1L208.1 175C199.6 165.7 184.4 165.7 175 175C165.7 184.4 165.7 199.6 175 208.1V208.1z"],recycle:[512,512,[9850,9851,9842],"f1b8","M180.2 243.1C185 263.9 162.2 280.2 144.1 268.8L119.8 253.6l-50.9 81.43c-13.33 21.32 2.004 48.98 27.15 48.98h32.02c17.64 0 31.98 14.32 31.98 31.96c0 17.64-14.34 32.05-31.98 32.05H96.15c-75.36 0-121.3-82.84-81.47-146.8L65.51 219.8L41.15 204.5C23.04 193.1 27.66 165.5 48.48 160.7l91.43-21.15C148.5 137.7 157.2 142.9 159.2 151.6L180.2 243.1zM283.1 78.96l41.25 66.14l-24.25 15.08c-18.16 11.31-13.57 38.94 7.278 43.77l91.4 21.15c8.622 1.995 17.23-3.387 19.21-12.01l21.04-91.43c4.789-20.81-17.95-37.05-36.07-25.76l-24.36 15.2L337.4 45.14c-37.58-60.14-125.2-60.18-162.8-.0617L167.2 56.9C157.9 71.75 162.5 91.58 177.3 100.9c14.92 9.359 34.77 4.886 44.11-10.04l7.442-11.89C241.6 58.58 270.9 59.33 283.1 78.96zM497.3 301.3l-16.99-27.26c-9.336-14.98-29.06-19.56-44.04-10.21c-14.94 9.318-19.52 29.15-10.18 44.08l16.99 27.15c13.35 21.32-1.984 49-27.14 49h-95.99l.0234-28.74c0-21.38-25.85-32.09-40.97-16.97l-66.41 66.43c-6.222 6.223-6.222 16.41 .0044 22.63l66.42 66.34c15.12 15.1 40.95 4.386 40.95-16.98l-.0234-28.68h95.86C491.2 448.1 537.2 365.2 497.3 301.3z"],registered:[512,512,[174],"f25d","M256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM349.8 349.8c5.594 12.03 .4375 26.31-11.56 31.94c-3.312 1.531-6.75 2.25-10.19 2.25c-9 0-17.66-5.125-21.75-13.81l-38.46-82.19H208v72c0 13.25-10.75 24-24 24s-24-10.75-24-24V152c0-13.25 10.75-24 24-24l88 .0044c44.13 0 80 35.88 80 80c0 28.32-14.87 53.09-37.12 67.31L349.8 349.8zM272 176h-64v64h64c17.66 0 32-14.34 32-32S289.7 176 272 176z"],repeat:[512,512,[128257],"f363","M480 256c-17.67 0-32 14.31-32 32c0 52.94-43.06 96-96 96H192L192 344c0-9.469-5.578-18.06-14.23-21.94C169.1 318.3 159 319.8 151.9 326.2l-80 72C66.89 402.7 64 409.2 64 416s2.891 13.28 7.938 17.84l80 72C156.4 509.9 162.2 512 168 512c3.312 0 6.615-.6875 9.756-2.062C186.4 506.1 192 497.5 192 488L192 448h160c88.22 0 160-71.78 160-160C512 270.3 497.7 256 480 256zM160 128h159.1L320 168c0 9.469 5.578 18.06 14.23 21.94C337.4 191.3 340.7 192 343.1 192c5.812 0 11.57-2.125 16.07-6.156l80-72C445.1 109.3 448 102.8 448 95.1s-2.891-13.28-7.938-17.84l-80-72c-7.047-6.312-17.19-7.875-25.83-4.094C325.6 5.938 319.1 14.53 319.1 24L320 64H160C71.78 64 0 135.8 0 224c0 17.69 14.33 32 32 32s32-14.31 32-32C64 171.1 107.1 128 160 128z"],reply:[512,512,[61714,"mail-reply"],"f3e5","M8.31 189.9l176-151.1c15.41-13.3 39.69-2.509 39.69 18.16v80.05C384.6 137.9 512 170.1 512 322.3c0 61.44-39.59 122.3-83.34 154.1c-13.66 9.938-33.09-2.531-28.06-18.62c45.34-145-21.5-183.5-176.6-185.8v87.92c0 20.7-24.31 31.45-39.69 18.16l-176-151.1C-2.753 216.6-2.784 199.4 8.31 189.9z"],"reply-all":[576,512,["mail-reply-all"],"f122","M136.3 226.2l176 151.1c15.38 13.3 39.69 2.545 39.69-18.16V275.1c108.5 12.58 151.1 58.79 112.6 181.9c-5.031 16.09 14.41 28.56 28.06 18.62c43.75-31.81 83.34-92.69 83.34-154.1c0-131.3-94.86-173.2-224-183.5V56.02c0-20.67-24.28-31.46-39.69-18.16L136.3 189.9C125.2 199.4 125.2 216.6 136.3 226.2zM8.31 226.2l176 151.1c15.38 13.3 39.69 2.545 39.69-18.16v-15.83L66.33 208l157.7-136.2V56.02c0-20.67-24.28-31.46-39.69-18.16l-176 151.1C-2.77 199.4-2.77 216.6 8.31 226.2z"],republican:[640,512,[],"f75e","M544 191.1c0-88.37-71.62-159.1-159.1-159.1L159.1 32C71.62 32 0 103.6 0 191.1l.025 63.98h543.1V191.1zM176.3 170.4l-19.75 19.37l4.75 27.25c.7498 4.875-4.375 8.625-8.75 6.25l-24.5-12.87L103.5 223.2C99.27 225.6 94.02 221.9 94.77 216.1l4.75-27.25l-19.75-19.37C76.15 166.9 78.15 160.9 83.02 160.2L110.4 156.2l12.25-24.87c2.125-4.5 8.625-4.375 10.62 0L145.5 156.2L172.9 160.2C177.9 160.9 179.8 166.9 176.3 170.4zM320.3 170.4l-19.75 19.37l4.75 27.25c.7498 4.875-4.375 8.625-8.75 6.25L272 210.4l-24.5 12.87C243.3 225.6 238 221.9 238.8 216.1L243.5 189.7l-19.75-19.37c-3.625-3.5-1.625-9.498 3.25-10.12L254.4 156.2l12.25-24.87c2.125-4.5 8.625-4.375 10.62 0L289.5 156.2l27.37 4C321.9 160.9 323.8 166.9 320.3 170.4zM464.3 170.4l-19.75 19.37l4.75 27.25c.7498 4.875-4.375 8.625-8.75 6.25l-24.5-12.87l-24.5 12.87c-4.25 2.375-9.5-1.375-8.75-6.25l4.75-27.25l-19.75-19.37c-3.625-3.5-1.625-9.498 3.25-10.12l27.37-4l12.25-24.87c2.125-4.5 8.625-4.375 10.62 0l12.25 24.87l27.37 4C465.9 160.9 467.8 166.9 464.3 170.4zM624 319.1L592 319.1c-8.799 0-15.1 7.199-15.1 15.1v63.99c0 8.748-7.25 15.1-15.1 15.1c-8.75 0-15.1-7.25-15.1-15.1l-.0313-111.1L.025 287.1v159.1c0 17.6 14.4 31.1 31.1 31.1L95.98 479.1c17.6 0 32.04-14.4 32.04-32v-63.98l191.1-.0169v63.99c0 17.6 14.36 32 31.96 32l64.04 .013c17.6 0 31.1-14.4 31.1-31.1l-.0417-96.01l32.04 .0006v43.25c0 41.79 29.91 80.03 71.48 84.35C599.3 484.5 640 446.9 640 399.1v-63.98C640 327.2 632.8 319.1 624 319.1z"],restroom:[640,512,[],"f7bd","M319.1 0C306.8 0 296 10.8 296 24v464c0 13.2 10.8 24 23.1 24s24-10.8 24-24V24C344 10.8 333.2 0 319.1 0zM213.7 171.8C204.9 145.6 180.5 128 152.9 128H103.1C75.47 128 51.06 145.6 42.37 171.8L1.653 293.9c-5.594 16.77 3.469 34.89 20.22 40.48c12.68 4.211 25.93 .1426 34.13-9.18V480c0 17.67 14.33 32 32 32s31.1-14.33 31.1-32l-.0003-144h16l.0003 144c0 17.67 14.33 32 32 32s31.1-14.33 31.1-32l-.0003-155.2c6.041 6.971 14.7 11.25 24 11.25c3.344 0 6.75-.5313 10.13-1.656c16.75-5.594 25.81-23.72 20.22-40.48L213.7 171.8zM128 96c26.5 0 47.1-21.5 47.1-48S154.5 0 128 0S80 21.5 80 48S101.5 96 128 96zM511.1 96c26.5 0 48-21.5 48-48S538.5 0 511.1 0s-47.1 21.5-47.1 48S485.5 96 511.1 96zM638.3 293.9l-40.69-122.1C588.9 145.6 564.5 128 536.9 128h-49.88c-27.59 0-52 17.59-60.69 43.75l-40.72 122.1c-5.594 16.77 3.469 34.89 20.22 40.48c3.422 1.137 6.856 1.273 10.25 1.264L399.1 384h40v96c0 17.67 14.32 32 31.1 32s32-14.33 32-32v-96h16v96c0 17.67 14.32 32 31.1 32s32-14.33 32-32v-96h39.1l-15.99-47.98c3.342 0 6.747-.5313 10.12-1.656C634.9 328.8 643.9 310.6 638.3 293.9z"],retweet:[640,512,[],"f079","M614.2 334.8C610.5 325.8 601.7 319.1 592 319.1H544V176C544 131.9 508.1 96 464 96h-128c-17.67 0-32 14.31-32 32s14.33 32 32 32h128C472.8 160 480 167.2 480 176v143.1h-48c-9.703 0-18.45 5.844-22.17 14.82s-1.656 19.29 5.203 26.16l80 80.02C499.7 445.7 505.9 448 512 448s12.28-2.344 16.97-7.031l80-80.02C615.8 354.1 617.9 343.8 614.2 334.8zM304 352h-128C167.2 352 160 344.8 160 336V192h48c9.703 0 18.45-5.844 22.17-14.82s1.656-19.29-5.203-26.16l-80-80.02C140.3 66.34 134.1 64 128 64S115.7 66.34 111 71.03l-80 80.02C24.17 157.9 22.11 168.2 25.83 177.2S38.3 192 48 192H96V336C96 380.1 131.9 416 176 416h128c17.67 0 32-14.31 32-32S321.7 352 304 352z"],ribbon:[448,512,[127895],"f4d6","M6.05 444.3c-9.626 10.87-7.501 27.62 4.5 35.75l68.76 27.87c9.876 6.75 23.38 4.1 31.38-3.75l91.76-101.9L123.2 314.3L6.05 444.3zM441.8 444.3c0 0-292-324.5-295.4-329.1c15.38-8.5 40.25-17.1 77.51-17.1s62.13 9.5 77.51 17.1c-3.25 5.5-56.01 64.5-56.01 64.5l79.13 87.75l34.13-37.1c28.75-31.87 33.38-78.62 11.5-115.5L326.5 39.52c-4.25-7.25-9.876-13.25-16.75-17.1c-40.75-27.62-127.5-29.75-171.5 0C131.3 26.27 125.7 32.27 121.4 39.52L77.81 112.8C76.31 115.3 40.68 174.9 89.31 228.8l248.1 275.2c8.001 8.875 21.38 10.5 31.25 3.75l68.88-27.87C449.5 471.9 451.6 455.1 441.8 444.3z"],"right-from-bracket":[512,512,["sign-out-alt"],"f2f5","M96 480h64C177.7 480 192 465.7 192 448S177.7 416 160 416H96c-17.67 0-32-14.33-32-32V128c0-17.67 14.33-32 32-32h64C177.7 96 192 81.67 192 64S177.7 32 160 32H96C42.98 32 0 74.98 0 128v256C0 437 42.98 480 96 480zM504.8 238.5l-144.1-136c-6.975-6.578-17.2-8.375-26-4.594c-8.803 3.797-14.51 12.47-14.51 22.05l-.0918 72l-128-.001c-17.69 0-32.02 14.33-32.02 32v64c0 17.67 14.34 32 32.02 32l128 .001l.0918 71.1c0 9.578 5.707 18.25 14.51 22.05c8.803 3.781 19.03 1.984 26-4.594l144.1-136C514.4 264.4 514.4 247.6 504.8 238.5z"],"right-left":[512,512,["exchange-alt"],"f362","M32 160h319.9l.0791 72c0 9.547 5.652 18.19 14.41 22c8.754 3.812 18.93 2.078 25.93-4.406l112-104c10.24-9.5 10.24-25.69 0-35.19l-112-104c-6.992-6.484-17.17-8.217-25.93-4.408c-8.758 3.816-14.41 12.46-14.41 22L351.9 96H32C14.31 96 0 110.3 0 127.1S14.31 160 32 160zM480 352H160.1L160 279.1c0-9.547-5.652-18.19-14.41-22C136.9 254.2 126.7 255.9 119.7 262.4l-112 104c-10.24 9.5-10.24 25.69 0 35.19l112 104c6.992 6.484 17.17 8.219 25.93 4.406C154.4 506.2 160 497.5 160 488L160.1 416H480c17.69 0 32-14.31 32-32S497.7 352 480 352z"],"right-long":[512,512,["long-arrow-alt-right"],"f30b","M504.3 273.6l-112.1 104c-6.992 6.484-17.18 8.218-25.94 4.406c-8.758-3.812-14.42-12.45-14.42-21.1L351.9 288H32C14.33 288 .0002 273.7 .0002 255.1S14.33 224 32 224h319.9l0-72c0-9.547 5.66-18.19 14.42-22c8.754-3.809 18.95-2.075 25.94 4.41l112.1 104C514.6 247.9 514.6 264.1 504.3 273.6z"],"right-to-bracket":[512,512,["sign-in-alt"],"f2f6","M344.7 238.5l-144.1-136C193.7 95.97 183.4 94.17 174.6 97.95C165.8 101.8 160.1 110.4 160.1 120V192H32.02C14.33 192 0 206.3 0 224v64c0 17.68 14.33 32 32.02 32h128.1v72c0 9.578 5.707 18.25 14.51 22.05c8.803 3.781 19.03 1.984 26-4.594l144.1-136C354.3 264.4 354.3 247.6 344.7 238.5zM416 32h-64c-17.67 0-32 14.33-32 32s14.33 32 32 32h64c17.67 0 32 14.33 32 32v256c0 17.67-14.33 32-32 32h-64c-17.67 0-32 14.33-32 32s14.33 32 32 32h64c53.02 0 96-42.98 96-96V128C512 74.98 469 32 416 32z"],ring:[512,512,[],"f70b","M256 64C109.1 64 0 125.9 0 208v98.13C0 384.5 114.6 448 256 448s256-63.5 256-141.9V208C512 125.9 401.1 64 256 64zM256 288C203.1 288 155.1 279.1 120.4 264.6C155 249.9 201.6 240 256 240s101 9.875 135.6 24.62C356.9 279.1 308.9 288 256 288zM437.1 234.4C392.1 208.3 328.3 192 256 192S119.9 208.3 74.88 234.4C68 226.1 64 217.3 64 208C64 163.9 149.1 128 256 128c105.1 0 192 35.88 192 80C448 217.3 444 226.1 437.1 234.4z"],road:[576,512,[128739],"f018","M256 96C256 113.7 270.3 128 288 128C305.7 128 320 113.7 320 96V32H394.8C421.9 32 446 49.08 455.1 74.63L572.9 407.2C574.9 413 576 419.2 576 425.4C576 455.5 551.5 480 521.4 480H320V416C320 398.3 305.7 384 288 384C270.3 384 256 398.3 256 416V480H54.61C24.45 480 0 455.5 0 425.4C0 419.2 1.06 413 3.133 407.2L120.9 74.63C129.1 49.08 154.1 32 181.2 32H255.1L256 96zM320 224C320 206.3 305.7 192 288 192C270.3 192 256 206.3 256 224V288C256 305.7 270.3 320 288 320C305.7 320 320 305.7 320 288V224z"],"road-barrier":[640,512,[],"e562","M32 32C49.67 32 64 46.33 64 64V96H149.2L64 266.3V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V64C0 46.33 14.33 32 32 32V32zM309.2 288H234.8L330.8 96H405.2L309.2 288zM458.8 96H533.2L437.2 288H362.8L458.8 96zM202.8 96H277.2L181.2 288H106.8L202.8 96zM576 117.7V64C576 46.33 590.3 32 608 32C625.7 32 640 46.33 640 64V448C640 465.7 625.7 480 608 480C590.3 480 576 465.7 576 448V288H490.8L576 117.7z"],"road-bridge":[640,512,[],"e563","M352 0H608C625.7 0 640 14.33 640 32V480C640 497.7 625.7 512 608 512H352C334.3 512 320 497.7 320 480V32C320 14.33 334.3 0 352 0zM456 224V288C456 301.3 466.7 312 480 312C493.3 312 504 301.3 504 288V224C504 210.7 493.3 200 480 200C466.7 200 456 210.7 456 224zM504 384C504 370.7 493.3 360 480 360C466.7 360 456 370.7 456 384V448C456 461.3 466.7 472 480 472C493.3 472 504 461.3 504 448V384zM456 64V128C456 141.3 466.7 152 480 152C493.3 152 504 141.3 504 128V64C504 50.75 493.3 40 480 40C466.7 40 456 50.75 456 64zM32 96H288V160H248V224H288V320C234.1 320 192 362.1 192 416V480C192 497.7 177.7 512 160 512H128C110.3 512 96 497.7 96 480V416C96 362.1 53.02 320 0 320V224H72V160H32C14.33 160 0 145.7 0 128C0 110.3 14.33 96 32 96zM200 160H120V224H200V160z"],"road-circle-check":[640,512,[],"e564","M213.2 32H288V96C288 113.7 302.3 128 320 128C337.7 128 352 113.7 352 96V32H426.8C453.9 32 478 49.08 487.1 74.63L529.8 195.2C518.9 193.1 507.6 192 496 192C436.5 192 383.9 221.6 352 266.8V224C352 206.3 337.7 192 320 192C302.3 192 288 206.3 288 224V288C288 305.7 302.3 320 320 320C322.3 320 324.6 319.7 326.8 319.3C322.4 334.7 320 351.1 320 368C320 373.4 320.2 378.7 320.7 384L320 384C302.3 384 288 398.3 288 416V480H86.61C56.45 480 32 455.5 32 425.4C32 419.2 33.06 413 35.13 407.2L152.9 74.63C161.1 49.08 186.1 32 213.2 32H213.2zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM540.7 324.7L480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7H540.7z"],"road-circle-exclamation":[640,512,[],"e565","M213.2 32H288V96C288 113.7 302.3 128 320 128C337.7 128 352 113.7 352 96V32H426.8C453.9 32 478 49.08 487.1 74.63L529.8 195.2C518.9 193.1 507.6 192 496 192C436.5 192 383.9 221.6 352 266.8V224C352 206.3 337.7 192 320 192C302.3 192 288 206.3 288 224V288C288 305.7 302.3 320 320 320C322.3 320 324.6 319.7 326.8 319.3C322.4 334.7 320 351.1 320 368C320 373.4 320.2 378.7 320.7 384L320 384C302.3 384 288 398.3 288 416V480H86.61C56.45 480 32 455.5 32 425.4C32 419.2 33.06 413 35.13 407.2L152.9 74.63C161.1 49.08 186.1 32 213.2 32H213.2zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"road-circle-xmark":[640,512,[],"e566","M213.2 32H288V96C288 113.7 302.3 128 320 128C337.7 128 352 113.7 352 96V32H426.8C453.9 32 478 49.08 487.1 74.63L529.8 195.2C518.9 193.1 507.6 192 496 192C436.5 192 383.9 221.6 352 266.8V224C352 206.3 337.7 192 320 192C302.3 192 288 206.3 288 224V288C288 305.7 302.3 320 320 320C322.3 320 324.6 319.7 326.8 319.3C322.4 334.7 320 351.1 320 368C320 373.4 320.2 378.7 320.7 384L320 384C302.3 384 288 398.3 288 416V480H86.61C56.45 480 32 455.5 32 425.4C32 419.2 33.06 413 35.13 407.2L152.9 74.63C161.1 49.08 186.1 32 213.2 32H213.2zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM518.6 368L555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368z"],"road-lock":[640,512,[],"e567","M288 96C288 113.7 302.3 128 320 128C337.7 128 352 113.7 352 96V32H426.8C453.9 32 478 49.08 487.1 74.63L517.5 160.5C460.6 165.8 416 213.7 416 272V296.6C396.9 307.6 384 328.3 384 352V480H352V416C352 398.3 337.7 384 320 384C302.3 384 288 398.3 288 416V480H86.61C56.45 480 32 455.5 32 425.4C32 419.2 33.06 413 35.13 407.2L152.9 74.63C161.1 49.08 186.1 32 213.2 32H287.1L288 96zM352 224C352 206.3 337.7 192 320 192C302.3 192 288 206.3 288 224V288C288 305.7 302.3 320 320 320C337.7 320 352 305.7 352 288V224zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"road-spikes":[640,512,[],"e568","M64 116.8C64 101 84.53 94.79 93.31 107.1L192 255.1V116.8C192 101 212.5 94.79 221.3 107.1L320 255.1V116.8C320 101 340.5 94.79 349.3 107.1L448 255.1V116.8C448 101 468.5 94.79 477.3 107.1L606.8 302.2C621 323.5 605.8 351.1 580.2 351.1H64L64 116.8zM608 383.1C625.7 383.1 640 398.3 640 415.1C640 433.7 625.7 447.1 608 447.1H32C14.33 447.1 0 433.7 0 415.1C0 398.3 14.33 383.1 32 383.1H608z"],robot:[640,512,[129302],"f544","M9.375 233.4C3.375 239.4 0 247.5 0 256v128c0 8.5 3.375 16.62 9.375 22.62S23.5 416 32 416h32V224H32C23.5 224 15.38 227.4 9.375 233.4zM464 96H352V32c0-17.62-14.38-32-32-32S288 14.38 288 32v64H176C131.8 96 96 131.8 96 176V448c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V176C544 131.8 508.3 96 464 96zM256 416H192v-32h64V416zM224 296C201.9 296 184 278.1 184 256S201.9 216 224 216S264 233.9 264 256S246.1 296 224 296zM352 416H288v-32h64V416zM448 416h-64v-32h64V416zM416 296c-22.12 0-40-17.88-40-40S393.9 216 416 216S456 233.9 456 256S438.1 296 416 296zM630.6 233.4C624.6 227.4 616.5 224 608 224h-32v192h32c8.5 0 16.62-3.375 22.62-9.375S640 392.5 640 384V256C640 247.5 636.6 239.4 630.6 233.4z"],rocket:[512,512,[],"f135","M156.6 384.9L125.7 353.1C117.2 345.5 114.2 333.1 117.1 321.8C120.1 312.9 124.1 301.3 129.8 288H24C15.38 288 7.414 283.4 3.146 275.9C-1.123 268.4-1.042 259.2 3.357 251.8L55.83 163.3C68.79 141.4 92.33 127.1 117.8 127.1H200C202.4 124 204.8 120.3 207.2 116.7C289.1-4.07 411.1-8.142 483.9 5.275C495.6 7.414 504.6 16.43 506.7 28.06C520.1 100.9 516.1 222.9 395.3 304.8C391.8 307.2 387.1 309.6 384 311.1V394.2C384 419.7 370.6 443.2 348.7 456.2L260.2 508.6C252.8 513 243.6 513.1 236.1 508.9C228.6 504.6 224 496.6 224 488V380.8C209.9 385.6 197.6 389.7 188.3 392.7C177.1 396.3 164.9 393.2 156.6 384.9V384.9zM384 167.1C406.1 167.1 424 150.1 424 127.1C424 105.9 406.1 87.1 384 87.1C361.9 87.1 344 105.9 344 127.1C344 150.1 361.9 167.1 384 167.1z"],rotate:[512,512,[128260,"sync-alt"],"f2f1","M449.9 39.96l-48.5 48.53C362.5 53.19 311.4 32 256 32C161.5 32 78.59 92.34 49.58 182.2c-5.438 16.81 3.797 34.88 20.61 40.28c16.97 5.5 34.86-3.812 40.3-20.59C130.9 138.5 189.4 96 256 96c37.96 0 73 14.18 100.2 37.8L311.1 178C295.1 194.8 306.8 223.4 330.4 224h146.9C487.7 223.7 496 215.3 496 204.9V59.04C496 34.99 466.9 22.95 449.9 39.96zM441.8 289.6c-16.94-5.438-34.88 3.812-40.3 20.59C381.1 373.5 322.6 416 256 416c-37.96 0-73-14.18-100.2-37.8L200 334C216.9 317.2 205.2 288.6 181.6 288H34.66C24.32 288.3 16 296.7 16 307.1v145.9c0 24.04 29.07 36.08 46.07 19.07l48.5-48.53C149.5 458.8 200.6 480 255.1 480c94.45 0 177.4-60.34 206.4-150.2C467.9 313 458.6 294.1 441.8 289.6z"],"rotate-left":[512,512,["rotate-back","rotate-backward","undo-alt"],"f2ea","M480 256c0 123.4-100.5 223.9-223.9 223.9c-48.84 0-95.17-15.58-134.2-44.86c-14.12-10.59-16.97-30.66-6.375-44.81c10.59-14.12 30.62-16.94 44.81-6.375c27.84 20.91 61 31.94 95.88 31.94C344.3 415.8 416 344.1 416 256s-71.69-159.8-159.8-159.8c-37.46 0-73.09 13.49-101.3 36.64l45.12 45.14c17.01 17.02 4.955 46.1-19.1 46.1H35.17C24.58 224.1 16 215.5 16 204.9V59.04c0-24.04 29.07-36.08 46.07-19.07l47.6 47.63C149.9 52.71 201.5 32.11 256.1 32.11C379.5 32.11 480 132.6 480 256z"],"rotate-right":[512,512,["redo-alt","rotate-forward"],"f2f9","M468.9 32.11c13.87 0 27.18 10.77 27.18 27.04v145.9c0 10.59-8.584 19.17-19.17 19.17h-145.7c-16.28 0-27.06-13.32-27.06-27.2c0-6.634 2.461-13.4 7.96-18.9l45.12-45.14c-28.22-23.14-63.85-36.64-101.3-36.64c-88.09 0-159.8 71.69-159.8 159.8S167.8 415.9 255.9 415.9c73.14 0 89.44-38.31 115.1-38.31c18.48 0 31.97 15.04 31.97 31.96c0 35.04-81.59 70.41-147 70.41c-123.4 0-223.9-100.5-223.9-223.9S132.6 32.44 256 32.44c54.6 0 106.2 20.39 146.4 55.26l47.6-47.63C455.5 34.57 462.3 32.11 468.9 32.11z"],route:[512,512,[],"f4d7","M320 256C302.3 256 288 270.3 288 288C288 305.7 302.3 320 320 320H416C469 320 512 362.1 512 416C512 469 469 512 416 512H139.6C148.3 502.1 158.9 489.4 169.6 475.2C175.9 466.8 182.4 457.6 188.6 448H416C433.7 448 448 433.7 448 416C448 398.3 433.7 384 416 384H320C266.1 384 223.1 341 223.1 288C223.1 234.1 266.1 192 320 192H362.1C340.2 161.5 320 125.4 320 96C320 42.98 362.1 0 416 0C469 0 512 42.98 512 96C512 160 416 256 416 256H320zM416 128C433.7 128 448 113.7 448 96C448 78.33 433.7 64 416 64C398.3 64 384 78.33 384 96C384 113.7 398.3 128 416 128zM118.3 487.8C118.1 488 117.9 488.2 117.7 488.4C113.4 493.4 109.5 497.7 106.3 501.2C105.9 501.6 105.5 502 105.2 502.4C99.5 508.5 96 512 96 512C96 512 0 416 0 352C0 298.1 42.98 255.1 96 255.1C149 255.1 192 298.1 192 352C192 381.4 171.8 417.5 149.9 448C138.1 463.2 127.7 476.9 118.3 487.8L118.3 487.8zM95.1 384C113.7 384 127.1 369.7 127.1 352C127.1 334.3 113.7 320 95.1 320C78.33 320 63.1 334.3 63.1 352C63.1 369.7 78.33 384 95.1 384z"],rss:[448,512,["feed"],"f09e","M25.57 176.1C12.41 175.4 .9117 185.2 .0523 198.4s9.173 24.65 22.39 25.5c120.1 7.875 225.7 112.7 233.6 233.6C256.9 470.3 267.4 480 279.1 480c.5313 0 1.062-.0313 1.594-.0625c13.22-.8438 23.25-12.28 22.39-25.5C294.6 310.3 169.7 185.4 25.57 176.1zM32 32C14.33 32 0 46.31 0 64s14.33 32 32 32c194.1 0 352 157.9 352 352c0 17.69 14.33 32 32 32s32-14.31 32-32C448 218.6 261.4 32 32 32zM63.1 351.9C28.63 351.9 0 380.6 0 416s28.63 64 63.1 64s64.08-28.62 64.08-64S99.37 351.9 63.1 351.9z"],"ruble-sign":[384,512,[8381,"rouble","rub","ruble"],"f158","M240 32C319.5 32 384 96.47 384 176C384 255.5 319.5 320 240 320H128V352H288C305.7 352 320 366.3 320 384C320 401.7 305.7 416 288 416H128V448C128 465.7 113.7 480 96 480C78.33 480 64 465.7 64 448V416H32C14.33 416 0 401.7 0 384C0 366.3 14.33 352 32 352H64V320H32C14.33 320 0 305.7 0 288C0 270.3 14.33 256 32 256H64V64C64 46.33 78.33 32 96 32H240zM320 176C320 131.8 284.2 96 240 96H128V256H240C284.2 256 320 220.2 320 176z"],rug:[640,512,[],"e569","M80 64V448H24C10.75 448 0 437.3 0 424C0 410.7 10.75 400 24 400H32V360H24C10.75 360 0 349.3 0 336C0 322.7 10.75 312 24 312H32V280H24C10.75 280 0 269.3 0 256C0 242.7 10.75 232 24 232H32V200H24C10.75 200 0 189.3 0 176C0 162.7 10.75 152 24 152H32V112H24C10.75 112 0 101.3 0 88C0 74.75 10.75 64 24 64H80zM112 64H528V448H112V64zM616 112H608V152H616C629.3 152 640 162.7 640 176C640 189.3 629.3 200 616 200H608V232H616C629.3 232 640 242.7 640 256C640 269.3 629.3 280 616 280H608V312H616C629.3 312 640 322.7 640 336C640 349.3 629.3 360 616 360H608V400H616C629.3 400 640 410.7 640 424C640 437.3 629.3 448 616 448H560V64H616C629.3 64 640 74.75 640 88C640 101.3 629.3 112 616 112z"],ruler:[512,512,[128207],"f545","M177.9 494.1C159.2 512.8 128.8 512.8 110.1 494.1L17.94 401.9C-.8054 383.2-.8054 352.8 17.94 334.1L68.69 283.3L116.7 331.3C122.9 337.6 133.1 337.6 139.3 331.3C145.6 325.1 145.6 314.9 139.3 308.7L91.31 260.7L132.7 219.3L180.7 267.3C186.9 273.6 197.1 273.6 203.3 267.3C209.6 261.1 209.6 250.9 203.3 244.7L155.3 196.7L196.7 155.3L244.7 203.3C250.9 209.6 261.1 209.6 267.3 203.3C273.6 197.1 273.6 186.9 267.3 180.7L219.3 132.7L260.7 91.31L308.7 139.3C314.9 145.6 325.1 145.6 331.3 139.3C337.6 133.1 337.6 122.9 331.3 116.7L283.3 68.69L334.1 17.94C352.8-.8055 383.2-.8055 401.9 17.94L494.1 110.1C512.8 128.8 512.8 159.2 494.1 177.9L177.9 494.1z"],"ruler-combined":[512,512,[],"f546","M0 464V48C0 21.49 21.49 0 48 0H144C170.5 0 192 21.49 192 48V96H112C103.2 96 96 103.2 96 112C96 120.8 103.2 128 112 128H192V192H112C103.2 192 96 199.2 96 208C96 216.8 103.2 224 112 224H192V288H112C103.2 288 96 295.2 96 304C96 312.8 103.2 320 112 320H192V400C192 408.8 199.2 416 208 416C216.8 416 224 408.8 224 400V320H288V400C288 408.8 295.2 416 304 416C312.8 416 320 408.8 320 400V320H384V400C384 408.8 391.2 416 400 416C408.8 416 416 408.8 416 400V320H464C490.5 320 512 341.5 512 368V464C512 490.5 490.5 512 464 512H48C23.15 512 2.706 493.1 .2477 468.9C.0838 467.3 0 465.7 0 464z"],"ruler-horizontal":[640,512,[],"f547","M0 176C0 149.5 21.49 128 48 128H112V208C112 216.8 119.2 224 128 224C136.8 224 144 216.8 144 208V128H208V208C208 216.8 215.2 224 224 224C232.8 224 240 216.8 240 208V128H304V208C304 216.8 311.2 224 320 224C328.8 224 336 216.8 336 208V128H400V208C400 216.8 407.2 224 416 224C424.8 224 432 216.8 432 208V128H496V208C496 216.8 503.2 224 512 224C520.8 224 528 216.8 528 208V128H592C618.5 128 640 149.5 640 176V336C640 362.5 618.5 384 592 384H48C21.49 384 0 362.5 0 336V176z"],"ruler-vertical":[256,512,[],"f548","M0 48C0 21.49 21.49 0 48 0H208C234.5 0 256 21.49 256 48V96H176C167.2 96 160 103.2 160 112C160 120.8 167.2 128 176 128H256V192H176C167.2 192 160 199.2 160 208C160 216.8 167.2 224 176 224H256V288H176C167.2 288 160 295.2 160 304C160 312.8 167.2 320 176 320H256V384H176C167.2 384 160 391.2 160 400C160 408.8 167.2 416 176 416H256V464C256 490.5 234.5 512 208 512H48C21.49 512 0 490.5 0 464V48z"],"rupee-sign":[448,512,[8360,"rupee"],"f156","M.0003 64C.0003 46.33 14.33 32 32 32H112C191.5 32 256 96.47 256 176C256 234.8 220.8 285.3 170.3 307.7L221.7 436.1C228.3 452.5 220.3 471.1 203.9 477.7C187.5 484.3 168.9 476.3 162.3 459.9L106.3 320H64V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448L.0003 64zM64 256H112C156.2 256 192 220.2 192 176C192 131.8 156.2 96 112 96H64V256zM320.8 282.2C321.3 283.3 322.2 284.8 325 287.1C332.2 292.8 343.7 297.1 362.9 303.8L364.2 304.3C380.3 309.1 402.9 317.9 419.1 332.4C429.5 340.5 437.9 351 443 364.7C448.1 378.4 449.1 393.2 446.8 408.7C442.7 436.8 426.4 457.1 403.1 469.6C381 480.7 354.9 482.1 329.9 477.6L329.7 477.5C320.4 475.8 309.2 471.8 300.5 468.6C294.4 466.3 287.9 463.7 282.7 461.6C280.2 460.6 278.1 459.8 276.4 459.1C259.9 452.7 251.8 434.2 258.2 417.7C264.6 401.2 283.1 393.1 299.6 399.5C302.2 400.5 304.8 401.5 307.5 402.6C312.3 404.5 317.4 406.5 322.9 408.6C331.7 411.9 338.2 413.1 341.6 414.6C357.2 417.5 368.3 415.5 374.5 412.4C379.4 409.9 382.5 406.3 383.5 399.3C384.5 392.4 383.7 388.8 383.1 387.1C382.4 385.4 381.3 383.5 378.6 381.2C371.7 375.4 360.4 370.8 341.6 364.2L338.6 363.1C323.1 357.7 301.6 350.2 285.3 337.2C275.8 329.7 266.1 319.7 261.5 306.3C256.1 292.8 254.9 278.2 257.2 263.1C265.6 205.1 324.2 185.1 374.1 194.2C380.1 195.5 401.4 200 409.5 202.6C426.4 207.8 435.8 225.7 430.6 242.6C425.3 259.5 407.4 268.9 390.5 263.7C385.8 262.2 368.2 258.2 362.6 257.2C347.1 254.5 336.8 256.8 329.1 260.4C323.7 263.7 321.1 267.1 320.5 272.4C319.6 278.4 320.4 281.2 320.8 282.2H320.8z"],"rupiah-sign":[512,512,[],"e23d","M.0003 64C.0003 46.33 14.33 32 32 32H112C191.5 32 256 96.47 256 176C256 234.8 220.8 285.3 170.3 307.7L221.7 436.1C228.3 452.5 220.3 471.1 203.9 477.7C187.5 484.3 168.9 476.3 162.3 459.9L106.3 320H64V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448L.0003 64zM64 256H112C156.2 256 192 220.2 192 176C192 131.8 156.2 96 112 96H64V256zM400 160C461.9 160 512 210.1 512 272C512 333.9 461.9 384 400 384H352V480C352 497.7 337.7 512 320 512C302.3 512 288 497.7 288 480V192C288 174.3 302.3 160 320 160H400zM448 272C448 245.5 426.5 224 400 224H352V320H400C426.5 320 448 298.5 448 272z"],s:[384,512,[115],"53","M349.9 379.1c-6.281 36.63-25.89 65.02-56.69 82.11c-24.91 13.83-54.08 18.98-83.73 18.98c-61.86 0-125.8-22.42-157.5-35.38c-16.38-6.672-24.22-25.34-17.55-41.7c6.641-16.36 25.27-24.28 41.7-17.55c77.56 31.64 150.6 39.39 186.1 19.69c13.83-7.672 21.67-19.42 24.69-36.98c7.25-42.31-18.2-56.75-103.7-81.38C112.6 266.6 15.98 238.7 34.11 133.2c5.484-32 23.64-59.36 51.14-77.02c45.59-29.33 115-31.87 206.4-7.688c17.09 4.531 27.27 22.05 22.75 39.13s-22.06 27.23-39.13 22.75C184 86.17 140.4 96.81 119.8 110c-12.55 8.062-20.17 19.5-22.66 34c-7.266 42.31 18.19 56.75 103.7 81.38C271.4 245.7 368 273.5 349.9 379.1z"],"sack-dollar":[512,512,[128176],"f81d","M320 96H192L144.6 24.88C137.5 14.24 145.1 0 157.9 0H354.1C366.9 0 374.5 14.24 367.4 24.88L320 96zM192 128H320C323.8 130.5 328.1 133.3 332.1 136.4C389.7 172.7 512 250.9 512 416C512 469 469 512 416 512H96C42.98 512 0 469 0 416C0 250.9 122.3 172.7 179 136.4C183.9 133.3 188.2 130.5 192 128V128zM276.1 224C276.1 212.9 267.1 203.9 255.1 203.9C244.9 203.9 235.9 212.9 235.9 224V230C230.3 231.2 224.1 232.9 220 235.1C205.1 241.9 192.1 254.5 188.9 272.8C187.1 283 188.1 292.9 192.3 301.8C196.5 310.6 203 316.8 209.6 321.3C221.2 329.2 236.5 333.8 248.2 337.3L250.4 337.9C264.4 342.2 273.8 345.3 279.7 349.6C282.2 351.4 283.1 352.8 283.4 353.7C283.8 354.5 284.4 356.3 283.7 360.3C283.1 363.8 281.2 366.8 275.7 369.1C269.6 371.7 259.7 373 246.9 371C240.9 370 230.2 366.4 220.7 363.2C218.5 362.4 216.3 361.7 214.3 361C203.8 357.5 192.5 363.2 189 373.7C185.5 384.2 191.2 395.5 201.7 398.1C202.9 399.4 204.4 399.9 206.1 400.5C213.1 403.2 226.4 407.4 235.9 409.6V416C235.9 427.1 244.9 436.1 255.1 436.1C267.1 436.1 276.1 427.1 276.1 416V410.5C281.4 409.5 286.6 407.1 291.4 405.9C307.2 399.2 319.8 386.2 323.1 367.2C324.9 356.8 324.1 346.8 320.1 337.7C316.2 328.7 309.9 322.1 303.2 317.3C291.1 308.4 274.9 303.6 262.8 299.9L261.1 299.7C247.8 295.4 238.2 292.4 232.1 288.2C229.5 286.4 228.7 285.2 228.5 284.7C228.3 284.3 227.7 283.1 228.3 279.7C228.7 277.7 230.2 274.4 236.5 271.6C242.1 268.7 252.9 267.1 265.1 268.1C269.5 269.7 283 272.3 286.9 273.3C297.5 276.2 308.5 269.8 311.3 259.1C314.2 248.5 307.8 237.5 297.1 234.7C292.7 233.5 282.7 231.5 276.1 230.3L276.1 224z"],"sack-xmark":[512,512,[],"e56a","M144.6 24.88C137.5 14.24 145.1 0 157.9 0H354.1C366.9 0 374.5 14.24 367.4 24.88L320 96H192L144.6 24.88zM332.1 136.4C389.7 172.7 512 250.9 512 416C512 469 469 512 416 512H96C42.98 512 0 469 0 416C0 250.9 122.3 172.7 179 136.4C183.9 133.3 188.2 130.5 192 128H320C323.8 130.5 328.1 133.3 332.1 136.4V136.4zM336.1 288.1C346.3 279.6 346.3 264.4 336.1 255C327.6 245.7 312.4 245.7 303 255L256 302.1L208.1 255C199.6 245.7 184.4 245.7 175 255C165.7 264.4 165.7 279.6 175 288.1L222.1 336L175 383C165.7 392.4 165.7 407.6 175 416.1C184.4 426.3 199.6 426.3 208.1 416.1L256 369.9L303 416.1C312.4 426.3 327.6 426.3 336.1 416.1C346.3 407.6 346.3 392.4 336.1 383L289.9 336L336.1 288.1z"],sailboat:[576,512,[],"e445","M256 16C256 9.018 260.5 2.841 267.2 .7414C273.9-1.358 281.1 1.105 285.1 6.826L509.1 326.8C512.5 331.7 512.9 338.1 510.2 343.4C507.4 348.7 501.1 352 496 352H272C263.2 352 256 344.8 256 336V16zM212.1 96.54C219.1 98.4 224 104.7 224 112V336C224 344.8 216.8 352 208 352H80C74.3 352 69.02 348.1 66.16 344C63.3 339.1 63.28 333 66.11 328.1L194.1 104.1C197.7 97.76 205.1 94.68 212.1 96.54V96.54zM5.718 404.3C2.848 394.1 10.52 384 21.12 384H554.9C565.5 384 573.2 394.1 570.3 404.3L566.3 418.7C550.7 473.9 500.4 512 443 512H132.1C75.62 512 25.27 473.9 9.747 418.7L5.718 404.3z"],satellite:[512,512,[128752],"f7bf","M502.8 264.1l-80.37-80.37l47.87-47.88c13-13.12 13-34.37 0-47.5l-47.5-47.5c-13.12-13.12-34.38-13.12-47.5 0l-47.88 47.88L247.1 9.25C241 3.375 232.9 0 224.5 0c-8.5 0-16.62 3.375-22.5 9.25l-96.75 96.75c-12.38 12.5-12.38 32.62 0 45.12L185.5 231.5L175.8 241.4c-54-24.5-116.3-22.5-168.5 5.375c-8.498 4.625-9.623 16.38-2.873 23.25l107.6 107.5l-17.88 17.75c-2.625-.75-5-1.625-7.75-1.625c-17.75 0-32 14.38-32 32c0 17.75 14.25 32 32 32c17.62 0 32-14.25 32-32c0-2.75-.875-5.125-1.625-7.75l17.75-17.88l107.6 107.6c6.75 6.75 18.62 5.625 23.12-2.875c27.88-52.25 29.88-114.5 5.375-168.5l10-9.873l80.25 80.36c12.5 12.38 32.62 12.38 44.1 0l96.75-96.75C508.6 304.1 512 295.1 512 287.5C512 279.1 508.6 270.1 502.8 264.1zM219.5 197.4L150.6 128.5l73.87-73.75l68.86 68.88L219.5 197.4zM383.5 361.4L314.6 292.5l73.75-73.88l68.88 68.87L383.5 361.4z"],"satellite-dish":[512,512,[128225],"f7c0","M216 104C202.8 104 192 114.8 192 128s10.75 24 24 24c79.41 0 144 64.59 144 144C360 309.3 370.8 320 384 320s24-10.75 24-24C408 190.1 321.9 104 216 104zM224 0C206.3 0 192 14.31 192 32s14.33 32 32 32c123.5 0 224 100.5 224 224c0 17.69 14.33 32 32 32s32-14.31 32-32C512 129.2 382.8 0 224 0zM188.9 346l27.37-27.37c2.625 .625 5.059 1.506 7.809 1.506c17.75 0 31.99-14.26 31.99-32c0-17.62-14.24-32.01-31.99-32.01c-17.62 0-31.99 14.38-31.99 32.01c0 2.875 .8099 5.25 1.56 7.875L166.2 323.4L49.37 206.5c-7.25-7.25-20.12-6-24.1 3c-41.75 77.88-29.88 176.7 35.75 242.4c65.62 65.62 164.6 77.5 242.4 35.75c9.125-5 10.38-17.75 3-25L188.9 346z"],"scale-balanced":[640,512,[9878,"balance-scale"],"f24e","M554.9 154.5c-17.62-35.25-68.12-35.38-85.87 0c-87 174.3-84.1 165.9-84.1 181.5c0 44.13 57.25 80 128 80s127.1-35.88 127.1-80C639.1 319.9 641.4 327.3 554.9 154.5zM439.1 320l71.96-144l72.17 144H439.1zM256 336c0-16.12 1.375-8.75-85.12-181.5c-17.62-35.25-68.12-35.38-85.87 0c-87 174.3-84.1 165.9-84.1 181.5c0 44.13 57.25 80 127.1 80S256 380.1 256 336zM127.9 176L200.1 320H55.96L127.9 176zM495.1 448h-143.1V153.3C375.5 143 393.1 121.8 398.4 96h113.6c17.67 0 31.1-14.33 31.1-32s-14.33-32-31.1-32h-128.4c-14.62-19.38-37.5-32-63.62-32S270.1 12.62 256.4 32H128C110.3 32 96 46.33 96 64S110.3 96 127.1 96h113.6c5.25 25.75 22.87 47 46.37 57.25V448H144c-26.51 0-48.01 21.49-48.01 48c0 8.836 7.165 16 16 16h416c8.836 0 16-7.164 16-16C544 469.5 522.5 448 495.1 448z"],"scale-unbalanced":[640,512,["balance-scale-left"],"f515","M85 250.5c-87 174.2-84.1 165.9-84.1 181.5C.0035 476.1 57.25 512 128 512s128-35.88 128-79.1c0-16.12 1.375-8.752-85.12-181.5C153.3 215.3 102.8 215.1 85 250.5zM55.96 416l71.98-143.1l72.15 143.1H55.96zM554.9 122.5c-17.62-35.25-68.08-35.37-85.83 0c-87 174.2-85.04 165.9-85.04 181.5c0 44.12 57.25 79.1 128 79.1s127.1-35.87 127.1-79.1C639.1 287.9 641.4 295.3 554.9 122.5zM439.1 288l72.04-143.1l72.08 143.1H439.1zM495.1 448h-143.1V153.3c20.83-9.117 36.72-26.93 43.78-48.77l126.3-42.11c16.77-5.594 25.83-23.72 20.23-40.48c-5.578-16.73-23.62-25.86-40.48-20.23l-113.3 37.76c-13.94-23.49-39.29-39.41-68.58-39.41c-44.18 0-79.1 35.82-79.1 80c0 2.961 .5587 5.771 .8712 8.648L117.9 129.7C101.1 135.3 92.05 153.4 97.64 170.1c4.469 13.41 16.95 21.88 30.36 21.88c3.344 0 6.768-.5186 10.13-1.644L273.8 145.1C278.2 148.3 282.1 151.1 288 153.3V496C288 504.8 295.2 512 304 512h223.1c8.838 0 16-7.164 16-15.1C543.1 469.5 522.5 448 495.1 448z"],"scale-unbalanced-flip":[640,512,["balance-scale-right"],"f516","M554.9 250.5c-17.62-35.37-68.12-35.25-85.87 0c-86.38 172.7-85.04 165.4-85.04 181.5C383.1 476.1 441.3 512 512 512s127.1-35.88 127.1-79.1C639.1 416.4 642 424.7 554.9 250.5zM439.9 416l72.15-143.1l71.98 143.1H439.9zM512 192c13.41 0 25.89-8.471 30.36-21.88c5.594-16.76-3.469-34.89-20.23-40.48l-122.1-40.1c.3125-2.877 .8712-5.687 .8712-8.648c0-44.18-35.81-80-79.1-80c-29.29 0-54.65 15.92-68.58 39.41l-113.3-37.76C121.3-3.963 103.2 5.162 97.64 21.9C92.05 38.66 101.1 56.78 117.9 62.38l126.3 42.11c7.061 21.84 22.95 39.65 43.78 48.77v294.7H144c-26.51 0-47.1 21.49-47.1 47.1C96 504.8 103.2 512 112 512h223.1c8.836 0 15.1-7.164 15.1-15.1V153.3c5.043-2.207 9.756-4.965 14.19-8.115l135.7 45.23C505.2 191.5 508.7 192 512 192zM256 304c0-15.62 1.1-7.252-85.12-181.5c-17.62-35.37-68.08-35.25-85.83 0c-86.38 172.7-85.04 165.4-85.04 181.5c0 44.12 57.25 79.1 127.1 79.1S256 348.1 256 304zM128 144l72.04 143.1H55.92L128 144z"],school:[640,512,[127979],"f549","M320 128C328.8 128 336 135.2 336 144V160H352C360.8 160 368 167.2 368 176C368 184.8 360.8 192 352 192H320C311.2 192 304 184.8 304 176V144C304 135.2 311.2 128 320 128zM476.8 98.06L602.4 125.1C624.4 130.9 640 150.3 640 172.8V464C640 490.5 618.5 512 592 512H48C21.49 512 0 490.5 0 464V172.8C0 150.3 15.63 130.9 37.59 125.1L163.2 98.06L302.2 5.374C312.1-1.791 327-1.791 337.8 5.374L476.8 98.06zM256 512H384V416C384 380.7 355.3 352 320 352C284.7 352 256 380.7 256 416V512zM96 192C87.16 192 80 199.2 80 208V272C80 280.8 87.16 288 96 288H128C136.8 288 144 280.8 144 272V208C144 199.2 136.8 192 128 192H96zM496 272C496 280.8 503.2 288 512 288H544C552.8 288 560 280.8 560 272V208C560 199.2 552.8 192 544 192H512C503.2 192 496 199.2 496 208V272zM96 320C87.16 320 80 327.2 80 336V400C80 408.8 87.16 416 96 416H128C136.8 416 144 408.8 144 400V336C144 327.2 136.8 320 128 320H96zM496 400C496 408.8 503.2 416 512 416H544C552.8 416 560 408.8 560 400V336C560 327.2 552.8 320 544 320H512C503.2 320 496 327.2 496 336V400zM320 88C271.4 88 232 127.4 232 176C232 224.6 271.4 264 320 264C368.6 264 408 224.6 408 176C408 127.4 368.6 88 320 88z"],"school-circle-check":[640,512,[],"e56b","M476.8 98.06L602.4 125.1C624.4 130.9 640 150.3 640 172.8V266.8C608.1 221.6 555.5 191.1 496 191.1C457.5 191.1 421.8 204.4 392.9 225.4C402.4 211.3 408 194.3 408 175.1C408 127.4 368.6 87.1 320 87.1C271.4 87.1 232 127.4 232 175.1C232 224.6 271.4 263.1 320 263.1C335.6 263.1 350.2 259.1 362.9 252.9C339.4 279.9 324.1 314.3 320.7 352H320.3L320 352C284.7 352 256 380.7 256 416V512L320 512H48C21.49 512 0 490.5 0 464V172.8C0 150.3 15.63 130.9 37.59 125.1L163.2 98.06L302.2 5.374C312.1-1.791 327-1.791 337.8 5.374L476.8 98.06zM96 192C87.16 192 80 199.2 80 208V272C80 280.8 87.16 288 96 288H128C136.8 288 144 280.8 144 272V208C144 199.2 136.8 192 128 192H96zM96 320C87.16 320 80 327.2 80 336V400C80 408.8 87.16 416 96 416H128C136.8 416 144 408.8 144 400V336C144 327.2 136.8 320 128 320H96zM320 128C328.8 128 336 135.2 336 144V160H352C360.8 160 368 167.2 368 176C368 184.8 360.8 192 352 192H320C311.2 192 304 184.8 304 176V144C304 135.2 311.2 128 320 128zM640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368zM480 385.4L451.3 356.7C445.1 350.4 434.9 350.4 428.7 356.7C422.4 362.9 422.4 373.1 428.7 379.3L468.7 419.3C474.9 425.6 485.1 425.6 491.3 419.3L563.3 347.3C569.6 341.1 569.6 330.9 563.3 324.7C557.1 318.4 546.9 318.4 540.7 324.7L480 385.4z"],"school-circle-exclamation":[640,512,[],"e56c","M476.8 98.06L602.4 125.1C624.4 130.9 640 150.3 640 172.8V266.8C608.1 221.6 555.5 191.1 496 191.1C457.5 191.1 421.8 204.4 392.9 225.4C402.4 211.3 408 194.3 408 175.1C408 127.4 368.6 87.1 320 87.1C271.4 87.1 232 127.4 232 175.1C232 224.6 271.4 263.1 320 263.1C335.6 263.1 350.2 259.1 362.9 252.9C339.4 279.9 324.1 314.3 320.7 352H320.3L320 352C284.7 352 256 380.7 256 416V512L320 512H48C21.49 512 0 490.5 0 464V172.8C0 150.3 15.63 130.9 37.59 125.1L163.2 98.06L302.2 5.374C312.1-1.791 327-1.791 337.8 5.374L476.8 98.06zM96 192C87.16 192 80 199.2 80 208V272C80 280.8 87.16 288 96 288H128C136.8 288 144 280.8 144 272V208C144 199.2 136.8 192 128 192H96zM96 320C87.16 320 80 327.2 80 336V400C80 408.8 87.16 416 96 416H128C136.8 416 144 408.8 144 400V336C144 327.2 136.8 320 128 320H96zM320 128C328.8 128 336 135.2 336 144V160H352C360.8 160 368 167.2 368 176C368 184.8 360.8 192 352 192H320C311.2 192 304 184.8 304 176V144C304 135.2 311.2 128 320 128zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],"school-circle-xmark":[640,512,[],"e56d","M476.8 98.06L602.4 125.1C624.4 130.9 640 150.3 640 172.8V266.8C608.1 221.6 555.5 191.1 496 191.1C457.5 191.1 421.8 204.4 392.9 225.4C402.4 211.3 408 194.3 408 175.1C408 127.4 368.6 87.1 320 87.1C271.4 87.1 232 127.4 232 175.1C232 224.6 271.4 263.1 320 263.1C335.6 263.1 350.2 259.1 362.9 252.9C339.4 279.9 324.1 314.3 320.7 352H320.3L320 352C284.7 352 256 380.7 256 416V512L320 512H48C21.49 512 0 490.5 0 464V172.8C0 150.3 15.63 130.9 37.59 125.1L163.2 98.06L302.2 5.374C312.1-1.791 327-1.791 337.8 5.374L476.8 98.06zM96 192C87.16 192 80 199.2 80 208V272C80 280.8 87.16 288 96 288H128C136.8 288 144 280.8 144 272V208C144 199.2 136.8 192 128 192H96zM96 320C87.16 320 80 327.2 80 336V400C80 408.8 87.16 416 96 416H128C136.8 416 144 408.8 144 400V336C144 327.2 136.8 320 128 320H96zM320 128C328.8 128 336 135.2 336 144V160H352C360.8 160 368 167.2 368 176C368 184.8 360.8 192 352 192H320C311.2 192 304 184.8 304 176V144C304 135.2 311.2 128 320 128zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM518.6 368L555.3 331.3C561.6 325.1 561.6 314.9 555.3 308.7C549.1 302.4 538.9 302.4 532.7 308.7L496 345.4L459.3 308.7C453.1 302.4 442.9 302.4 436.7 308.7C430.4 314.9 430.4 325.1 436.7 331.3L473.4 368L436.7 404.7C430.4 410.9 430.4 421.1 436.7 427.3C442.9 433.6 453.1 433.6 459.3 427.3L496 390.6L532.7 427.3C538.9 433.6 549.1 433.6 555.3 427.3C561.6 421.1 561.6 410.9 555.3 404.7L518.6 368z"],"school-flag":[576,512,[],"e56e","M288 0H400C408.8 0 416 7.164 416 16V64C416 72.84 408.8 80 400 80H320V95.53L410.3 160H512C547.3 160 576 188.7 576 224V448C576 483.3 547.3 512 512 512H336V400C336 373.5 314.5 352 288 352C261.5 352 240 373.5 240 400V512H64C28.65 512 0 483.3 0 448V224C0 188.7 28.65 160 64 160H165.7L256 95.53V32C256 14.33 270.3 0 288 0V0zM288 192C261.5 192 240 213.5 240 240C240 266.5 261.5 288 288 288C314.5 288 336 266.5 336 240C336 213.5 314.5 192 288 192zM80 224C71.16 224 64 231.2 64 240V304C64 312.8 71.16 320 80 320H112C120.8 320 128 312.8 128 304V240C128 231.2 120.8 224 112 224H80zM448 304C448 312.8 455.2 320 464 320H496C504.8 320 512 312.8 512 304V240C512 231.2 504.8 224 496 224H464C455.2 224 448 231.2 448 240V304zM80 352C71.16 352 64 359.2 64 368V432C64 440.8 71.16 448 80 448H112C120.8 448 128 440.8 128 432V368C128 359.2 120.8 352 112 352H80zM464 352C455.2 352 448 359.2 448 368V432C448 440.8 455.2 448 464 448H496C504.8 448 512 440.8 512 432V368C512 359.2 504.8 352 496 352H464z"],"school-lock":[640,512,[],"e56f","M336 160H352C360.8 160 368 167.2 368 176C368 184.8 360.8 192 352 192H320C311.2 192 304 184.8 304 176V144C304 135.2 311.2 128 320 128C328.8 128 336 135.2 336 144V160zM302.2 5.374C312.1-1.791 327-1.791 337.8 5.374L476.8 98.06L602.4 125.1C624.4 130.9 640 150.3 640 172.8V271.1C640 210.1 589.9 159.1 528 159.1C466.1 159.1 416 210.1 416 271.1V296.6C396.9 307.6 384 328.3 384 352H320.3L320 352C284.7 352 256 380.7 256 416V512H320L48 512C21.49 512 0 490.5 0 464V172.8C0 150.3 15.63 130.9 37.59 125.1L163.2 98.06L302.2 5.374zM80 272C80 280.8 87.16 288 96 288H128C136.8 288 144 280.8 144 272V208C144 199.2 136.8 192 128 192H96C87.16 192 80 199.2 80 208V272zM80 400C80 408.8 87.16 416 96 416H128C136.8 416 144 408.8 144 400V336C144 327.2 136.8 320 128 320H96C87.16 320 80 327.2 80 336V400zM320 264C368.6 264 408 224.6 408 176C408 127.4 368.6 88 320 88C271.4 88 232 127.4 232 176C232 224.6 271.4 264 320 264zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],scissors:[512,512,[9986,9988,9984,"cut"],"f0c4","M396.8 51.2C425.1 22.92 470.9 22.92 499.2 51.2C506.3 58.27 506.3 69.73 499.2 76.8L216.5 359.5C221.3 372.1 224 385.7 224 400C224 461.9 173.9 512 112 512C50.14 512 0 461.9 0 400C0 338.1 50.14 287.1 112 287.1C126.3 287.1 139.9 290.7 152.5 295.5L191.1 255.1L152.5 216.5C139.9 221.3 126.3 224 112 224C50.14 224 0 173.9 0 112C0 50.14 50.14 0 112 0C173.9 0 224 50.14 224 112C224 126.3 221.3 139.9 216.5 152.5L255.1 191.1L396.8 51.2zM160 111.1C160 85.49 138.5 63.1 112 63.1C85.49 63.1 64 85.49 64 111.1C64 138.5 85.49 159.1 112 159.1C138.5 159.1 160 138.5 160 111.1zM112 448C138.5 448 160 426.5 160 400C160 373.5 138.5 352 112 352C85.49 352 64 373.5 64 400C64 426.5 85.49 448 112 448zM278.6 342.6L342.6 278.6L499.2 435.2C506.3 442.3 506.3 453.7 499.2 460.8C470.9 489.1 425.1 489.1 396.8 460.8L278.6 342.6z"],screwdriver:[512,512,[129691],"f54a","M128 278.6l-117.1 116.9c-14.5 14.62-14.5 38.29 0 52.79l52.75 52.75c14.5 14.5 38.17 14.5 52.79 0L233.4 384c29.12-29.12 29.12-76.25 0-105.4S157.1 249.5 128 278.6zM447.1 0l-128 96L320 158L237 241.1C243.8 245.4 250.3 250.1 256 256c5.875 5.75 10.62 12.25 14.88 19L353.1 192h61.99l95.1-128L447.1 0z"],"screwdriver-wrench":[512,512,["tools"],"f7d9","M331.8 224.1c28.29 0 54.88 10.99 74.86 30.97l19.59 19.59c40.01-17.74 71.25-53.3 81.62-96.65c5.725-23.92 5.34-47.08 .2148-68.4c-2.613-10.88-16.43-14.51-24.34-6.604l-68.9 68.9h-75.6V97.2l68.9-68.9c7.912-7.912 4.275-21.73-6.604-24.34c-21.32-5.125-44.48-5.51-68.4 .2148c-55.3 13.23-98.39 60.22-107.2 116.4C224.5 128.9 224.2 137 224.3 145l82.78 82.86C315.2 225.1 323.5 224.1 331.8 224.1zM384 278.6c-23.16-23.16-57.57-27.57-85.39-13.9L191.1 158L191.1 95.99l-127.1-95.99L0 63.1l96 127.1l62.04 .0077l106.7 106.6c-13.67 27.82-9.251 62.23 13.91 85.39l117 117.1c14.62 14.5 38.21 14.5 52.71-.0016l52.75-52.75c14.5-14.5 14.5-38.08-.0016-52.71L384 278.6zM227.9 307L168.7 247.9l-148.9 148.9c-26.37 26.37-26.37 69.08 0 95.45C32.96 505.4 50.21 512 67.5 512s34.54-6.592 47.72-19.78l119.1-119.1C225.5 352.3 222.6 329.4 227.9 307zM64 472c-13.25 0-24-10.75-24-24c0-13.26 10.75-24 24-24S88 434.7 88 448C88 461.3 77.25 472 64 472z"],scroll:[576,512,[128220],"f70e","M48 32C21.5 32 0 53.5 0 80v64C0 152.9 7.125 160 16 160H96V80C96 53.5 74.5 32 48 32zM256 380.6V320h224V128c0-53-43-96-96-96H111.6C121.8 45.38 128 61.88 128 80V384c0 38.88 34.62 69.63 74.75 63.13C234.3 442 256 412.5 256 380.6zM288 352v32c0 52.88-43 96-96 96h272c61.88 0 112-50.13 112-112c0-8.875-7.125-16-16-16H288z"],"scroll-torah":[640,512,["torah"],"f6a0","M320 366.5l17.75-29.62l-35.5 .0011L320 366.5zM382.5 311.5l36.75-.0011l-18.38-30.75L382.5 311.5zM48 0C21.5 0 0 14.38 0 32v448c0 17.62 21.5 32 48 32S96 497.6 96 480V32C96 14.38 74.5 0 48 0zM419.2 200.5L382.4 200.5l18.5 30.79L419.2 200.5zM220.8 311.5l36.87-.0012l-18.5-30.87L220.8 311.5zM287.1 311.5L352.9 311.5l33.25-55.5l-33.25-55.5L287.1 200.5L253.9 256L287.1 311.5zM592 0C565.5 0 544 14.38 544 32v448c0 17.62 21.5 32 48 32s48-14.38 48-32V32C640 14.38 618.5 0 592 0zM128 480h384V32H128V480zM194.8 185.9c3.75-6.625 10.87-10.75 18.5-10.75L272.7 175.1l29.12-48.67C305.6 119.1 312.6 116.1 319.1 116.1c7.375-.125 14.25 3.916 17.1 10.17l29.25 48.87l59.5-.0019c7.625 0 14.62 4.124 18.38 10.75s3.626 14.75-.2493 21.25l-29.25 48.87l29.38 48.1c4 6.5 4.001 14.62 .2506 21.12c-3.75 6.625-10.87 10.75-18.5 10.75l-59.5 .0019l-29.12 48.67c-3.75 6.5-10.62 10.33-18.12 10.46c-7.375 0-14.25-3.874-18-10.25l-29.25-48.87l-59.5 .0019c-7.625 0-14.62-4.124-18.37-10.75S191.3 311.4 195.1 304.9l29.25-48.87L195 207C191.1 200.5 191 192.4 194.8 185.9zM319.1 145.5L302.2 175.1l35.37-.0011L319.1 145.5zM257.5 200.5L220.8 200.5l18.38 30.83L257.5 200.5z"],"sd-card":[384,512,[],"f7c2","M320 0H128L0 128v320c0 35.25 28.75 64 64 64h256c35.25 0 64-28.75 64-64V64C384 28.75 355.3 0 320 0zM160 160H112V64H160V160zM240 160H192V64h48V160zM320 160h-48V64H320V160z"],section:[256,512,[],"e447","M224.5 337.4c15.66-14.28 26.09-33.12 29.8-55.82c14.46-88.44-64.67-112.4-117-128.2L124.7 149.5C65.67 131.2 61.11 119.4 64.83 96.79c1.531-9.344 5.715-16.19 13.21-21.56c14.74-10.56 39.94-13.87 69.23-9.029c10.74 1.75 24.36 5.686 41.66 12.03c16.58 6 34.98-2.438 41.04-19.06c6.059-16.59-2.467-34.97-19.05-41.06c-21.39-7.842-38.35-12.62-53.28-15.06c-46.47-7.781-88.1-.5313-116.9 20.19C19.46 38.52 5.965 60.39 1.686 86.48C-5.182 128.6 9.839 156 31.47 174.7C15.87 188.1 5.406 207.8 1.686 230.5C-12.59 317.9 67.36 342.7 105.7 354.6l12.99 3.967c64.71 19.56 76.92 29.09 72.42 56.59c-1.279 7.688-4.84 18.75-21.23 26.16c-15.27 6.906-37.01 8.406-61.4 4.469c-16.74-2.656-37.32-10.5-55.49-17.41l-9.773-3.719c-16.52-6.156-34.95 2.25-41.16 18.75c-6.184 16.56 2.186 34.1 18.74 41.19l9.463 3.594c21.05 8 44.94 17.12 68.02 20.75c12.21 2.031 24.14 3.032 35.54 3.032c23.17 0 44.28-4.157 62.4-12.34c31.95-14.44 52.53-40.75 58.02-74.12C261.1 383.6 246.8 356.3 224.5 337.4zM64.83 240.8c3.303-20.28 21.22-28.1 38.09-31.04c.9258 .2891 15.81 4.852 15.81 4.852c64.71 19.56 76.92 29.09 72.39 56.62c-3.291 20.2-21.12 28.07-37.93 31.04c-5.488-1.746-28.49-8.754-28.49-8.754C65.67 275.2 61.11 263.4 64.83 240.8z"],seedling:[512,512,[127793,"sprout"],"f4d8","M64 95.1H0c0 123.8 100.3 224 224 224v128C224 465.6 238.4 480 255.1 480S288 465.6 288 448V320C288 196.3 187.7 95.1 64 95.1zM448 32c-84.25 0-157.4 46.5-195.8 115.3c27.75 30.12 48.25 66.88 59 107.5C424 243.1 512 147.9 512 32H448z"],server:[512,512,[],"f233","M480 288H32c-17.62 0-32 14.38-32 32v128c0 17.62 14.38 32 32 32h448c17.62 0 32-14.38 32-32v-128C512 302.4 497.6 288 480 288zM352 408c-13.25 0-24-10.75-24-24s10.75-24 24-24s24 10.75 24 24S365.3 408 352 408zM416 408c-13.25 0-24-10.75-24-24s10.75-24 24-24s24 10.75 24 24S429.3 408 416 408zM480 32H32C14.38 32 0 46.38 0 64v128c0 17.62 14.38 32 32 32h448c17.62 0 32-14.38 32-32V64C512 46.38 497.6 32 480 32zM352 152c-13.25 0-24-10.75-24-24S338.8 104 352 104S376 114.8 376 128S365.3 152 352 152zM416 152c-13.25 0-24-10.75-24-24S402.8 104 416 104S440 114.8 440 128S429.3 152 416 152z"],shapes:[512,512,["triangle-circle-square"],"f61f","M411.4 175.5C417.4 185.4 417.5 197.7 411.8 207.8C406.2 217.8 395.5 223.1 384 223.1H192C180.5 223.1 169.8 217.8 164.2 207.8C158.5 197.7 158.6 185.4 164.6 175.5L260.6 15.54C266.3 5.897 276.8 0 288 0C299.2 0 309.7 5.898 315.4 15.54L411.4 175.5zM288 312C288 289.9 305.9 272 328 272H472C494.1 272 512 289.9 512 312V456C512 478.1 494.1 496 472 496H328C305.9 496 288 478.1 288 456V312zM0 384C0 313.3 57.31 256 128 256C198.7 256 256 313.3 256 384C256 454.7 198.7 512 128 512C57.31 512 0 454.7 0 384z"],share:[512,512,["arrow-turn-right","mail-forward"],"f064","M503.7 226.2l-176 151.1c-15.38 13.3-39.69 2.545-39.69-18.16V272.1C132.9 274.3 66.06 312.8 111.4 457.8c5.031 16.09-14.41 28.56-28.06 18.62C39.59 444.6 0 383.8 0 322.3c0-152.2 127.4-184.4 288-186.3V56.02c0-20.67 24.28-31.46 39.69-18.16l176 151.1C514.8 199.4 514.8 216.6 503.7 226.2z"],"share-from-square":[576,512,[61509,"share-square"],"f14d","M568.9 143.5l-150.9-138.2C404.8-6.773 384 3.039 384 21.84V96C241.2 97.63 128 126.1 128 260.6c0 54.3 35.2 108.1 74.08 136.2c12.14 8.781 29.42-2.238 24.94-16.46C186.7 252.2 256 224 384 223.1v74.2c0 18.82 20.84 28.59 34.02 16.51l150.9-138.2C578.4 167.8 578.4 152.2 568.9 143.5zM416 384c-17.67 0-32 14.33-32 32v31.1l-320-.0013V128h32c17.67 0 32-14.32 32-32S113.7 64 96 64H64C28.65 64 0 92.65 0 128v319.1c0 35.34 28.65 64 64 64l320-.0013c35.35 0 64-28.66 64-64V416C448 398.3 433.7 384 416 384z"],"share-nodes":[448,512,["share-alt"],"f1e0","M285.4 197.1L191.3 244.1C191.8 248 191.1 251.1 191.1 256C191.1 260 191.8 263.1 191.3 267.9L285.4 314.9C302.6 298.2 326.1 288 352 288C405 288 448 330.1 448 384C448 437 405 480 352 480C298.1 480 256 437 256 384C256 379.1 256.2 376 256.7 372.1L162.6 325.1C145.4 341.8 121.9 352 96 352C42.98 352 0 309 0 256C0 202.1 42.98 160 96 160C121.9 160 145.4 170.2 162.6 186.9L256.7 139.9C256.2 135.1 256 132 256 128C256 74.98 298.1 32 352 32C405 32 448 74.98 448 128C448 181 405 224 352 224C326.1 224 302.6 213.8 285.4 197.1L285.4 197.1z"],"sheet-plastic":[384,512,[],"e571","M0 64C0 28.65 28.65 0 64 0H320C355.3 0 384 28.65 384 64V352H256C238.3 352 224 366.3 224 384V512H64C28.65 512 0 483.3 0 448V64zM171.3 52.69C165.1 46.44 154.9 46.44 148.7 52.69L52.69 148.7C46.44 154.9 46.44 165.1 52.69 171.3C58.93 177.6 69.06 177.6 75.31 171.3L171.3 75.31C177.6 69.07 177.6 58.94 171.3 52.69V52.69zM267.3 107.3C273.6 101.1 273.6 90.93 267.3 84.69C261.1 78.44 250.9 78.44 244.7 84.69L84.69 244.7C78.44 250.9 78.44 261.1 84.69 267.3C90.93 273.6 101.1 273.6 107.3 267.3L267.3 107.3zM384 384L256 512V384H384z"],"shekel-sign":[448,512,[8362,"ils","shekel","sheqel","sheqel-sign"],"f20b","M192 32C262.7 32 320 89.31 320 160V320C320 337.7 305.7 352 288 352C270.3 352 256 337.7 256 320V160C256 124.7 227.3 96 192 96H64V448C64 465.7 49.67 480 32 480C14.33 480 0 465.7 0 448V64C0 46.33 14.33 32 32 32H192zM160 480C142.3 480 128 465.7 128 448V192C128 174.3 142.3 160 160 160C177.7 160 192 174.3 192 192V416H320C355.3 416 384 387.3 384 352V64C384 46.33 398.3 32 416 32C433.7 32 448 46.33 448 64V352C448 422.7 390.7 480 320 480H160z"],shield:[512,512,[128737,"shield-blank"],"f132","M256-.0078C260.7-.0081 265.2 1.008 269.4 2.913L457.7 82.79C479.7 92.12 496.2 113.8 496 139.1C495.5 239.2 454.7 420.7 282.4 503.2C265.7 511.1 246.3 511.1 229.6 503.2C57.25 420.7 16.49 239.2 15.1 139.1C15.87 113.8 32.32 92.12 54.3 82.79L242.7 2.913C246.8 1.008 251.4-.0081 256-.0078V-.0078z"],"shield-cat":[512,512,[],"e572","M199.1 272C199.1 263.2 207.2 256 215.1 256C224.8 256 231.1 263.2 231.1 272C231.1 280.8 224.8 288 215.1 288C207.2 288 199.1 280.8 199.1 272zM312 272C312 280.8 304.8 288 296 288C287.2 288 280 280.8 280 272C280 263.2 287.2 256 296 256C304.8 256 312 263.2 312 272zM256.3-.0068C261.9-.0507 267.3 1.386 272.1 4.066L476.5 90.53C487.7 95.27 495.2 105.1 495.9 118.1C501.6 213.6 466.7 421.9 272.5 507.7C267.6 510.5 261.1 512.1 256.3 512C250.5 512.1 244.9 510.5 239.1 507.7C45.8 421.9 10.95 213.6 16.57 118.1C17.28 105.1 24.83 95.27 36.04 90.53L240.4 4.066C245.2 1.386 250.7-.0507 256.3-.0068H256.3zM223.1 208L159.1 144V272C159.1 325 202.1 368 255.1 368C309 368 352 325 352 272V144L288 208H223.1z"],"shield-dog":[512,512,[],"e573","M288 208C288 216.8 280.8 224 272 224C263.2 224 255.1 216.8 255.1 208C255.1 199.2 263.2 192 272 192C280.8 192 288 199.2 288 208zM256.3-.0068C261.9-.0507 267.3 1.386 272.1 4.066L476.5 90.53C487.7 95.27 495.2 105.1 495.9 118.1C501.6 213.6 466.7 421.9 272.5 507.7C267.6 510.5 261.1 512.1 256.3 512C250.5 512.1 244.9 510.5 239.1 507.7C45.8 421.9 10.95 213.6 16.57 118.1C17.28 105.1 24.83 95.27 36.04 90.53L240.4 4.066C245.2 1.386 250.7-.0507 256.3-.0068H256.3zM160.9 286.2L143.1 320L272 384V320H320C364.2 320 400 284.2 400 240V208C400 199.2 392.8 192 384 192H320L312.8 177.7C307.4 166.8 296.3 160 284.2 160H239.1V224C239.1 259.3 211.3 288 175.1 288C170.8 288 165.7 287.4 160.9 286.2H160.9zM143.1 176V224C143.1 241.7 158.3 256 175.1 256C193.7 256 207.1 241.7 207.1 224V160H159.1C151.2 160 143.1 167.2 143.1 176z"],"shield-halved":[512,512,["shield-alt"],"f3ed","M256-.0078C260.7-.0081 265.2 1.008 269.4 2.913L457.7 82.79C479.7 92.12 496.2 113.8 496 139.1C495.5 239.2 454.7 420.7 282.4 503.2C265.7 511.1 246.3 511.1 229.6 503.2C57.25 420.7 16.49 239.2 15.1 139.1C15.87 113.8 32.32 92.12 54.3 82.79L242.7 2.913C246.8 1.008 251.4-.0081 256-.0078V-.0078zM256 444.8C393.1 378 431.1 230.1 432 141.4L256 66.77L256 444.8z"],"shield-heart":[512,512,[],"e574","M256.3-.0068C261.9-.0507 267.3 1.386 272.1 4.066L476.5 90.53C487.7 95.27 495.2 105.1 495.9 118.1C501.6 213.6 466.7 421.9 272.5 507.7C267.6 510.5 261.1 512.1 256.3 512C250.5 512.1 244.9 510.5 239.1 507.7C45.8 421.9 10.95 213.6 16.57 118.1C17.28 105.1 24.83 95.27 36.04 90.53L240.4 4.066C245.2 1.386 250.7-.0507 256.3-.0068H256.3zM266.1 363.4L364.2 263.6C392.2 234.7 390.5 186.6 358.1 159.5C331.8 135.8 291.5 140.2 266.1 166.5L256.4 176.1L245.9 166.5C221.4 140.2 180.2 135.8 153 159.5C121.5 186.6 119.8 234.7 147.8 263.6L244.2 363.4C251.2 369.5 260.8 369.5 266.1 363.4V363.4z"],"shield-virus":[512,512,[],"e06c","M288 255.1c-8.836 0-16 7.162-16 16c0 8.836 7.164 15.1 16 15.1s16-7.163 16-15.1C304 263.2 296.8 255.1 288 255.1zM224 191.1c-8.836 0-16 7.162-16 16c0 8.836 7.164 16 15.1 16s16-7.164 16-16C240 199.2 232.8 191.1 224 191.1zM466.5 83.68l-192-80.01C269.6 1.641 261.3 0 256.1 0C250.7 0 242.5 1.641 237.6 3.672l-192 80.01C27.69 91.07 16 108.6 16 127.1C16 385.2 205.2 512 255.9 512c52.02 0 240.1-128.2 240.1-384C496 108.6 484.3 91.07 466.5 83.68zM384 255.1h-12.12c-19.29 0-32.06 15.78-32.06 32.23c0 7.862 2.918 15.88 9.436 22.4l8.576 8.576c3.125 3.125 4.688 7.218 4.688 11.31c0 8.527-6.865 15.1-16 15.1c-4.094 0-8.188-1.562-11.31-4.688l-8.576-8.576c-6.519-6.519-14.53-9.436-22.4-9.436c-16.45 0-32.23 12.77-32.23 32.06v12.12c0 8.844-7.156 16-16 16s-16-7.156-16-16v-12.12c0-19.29-15.78-32.06-32.23-32.06c-7.862 0-15.87 2.917-22.39 9.436l-8.576 8.576c-3.125 3.125-7.219 4.688-11.31 4.688c-9.139 0-16-7.473-16-15.1c0-4.094 1.562-8.187 4.688-11.31l8.576-8.576c6.519-6.519 9.436-14.53 9.436-22.4c0-16.45-12.77-32.23-32.06-32.23H128c-8.844 0-16-7.156-16-16s7.156-16 16-16h12.12c19.29 0 32.06-15.78 32.06-32.23c0-7.862-2.918-15.88-9.436-22.4L154.2 160.8C151 157.7 149.5 153.6 149.5 149.5c0-8.527 6.865-15.1 16-15.1c4.094 0 8.188 1.562 11.31 4.688L185.4 146.7C191.9 153.3 199.9 156.2 207.8 156.2c16.45 0 32.23-12.77 32.23-32.07V111.1c0-8.844 7.156-16 16-16s16 7.156 16 16v12.12c0 19.29 15.78 32.07 32.23 32.07c7.862 0 15.88-2.917 22.4-9.436l8.576-8.577c3.125-3.125 7.219-4.688 11.31-4.688c9.139 0 16 7.473 16 15.1c0 4.094-1.562 8.187-4.688 11.31l-8.576 8.577c-6.519 6.519-9.436 14.53-9.436 22.4c0 16.45 12.77 32.23 32.06 32.23h12.12c8.844 0 16 7.156 16 16S392.8 255.1 384 255.1z"],ship:[576,512,[128674],"f21a","M192 32C192 14.33 206.3 0 224 0H352C369.7 0 384 14.33 384 32V64H432C458.5 64 480 85.49 480 112V240L524.4 254.8C547.6 262.5 553.9 292.3 535.9 308.7L434.9 401.4C418.7 410.7 400.2 416.5 384 416.5C364.4 416.5 343.2 408.8 324.8 396.1C302.8 380.6 273.3 380.6 251.2 396.1C234 407.9 213.2 416.5 192 416.5C175.8 416.5 157.3 410.7 141.1 401.3L40.09 308.7C22.1 292.3 28.45 262.5 51.59 254.8L96 239.1V111.1C96 85.49 117.5 63.1 144 63.1H192V32zM160 218.7L267.8 182.7C280.9 178.4 295.1 178.4 308.2 182.7L416 218.7V128H160V218.7zM384 448C410.9 448 439.4 437.2 461.4 421.9L461.5 421.9C473.4 413.4 489.5 414.1 500.7 423.6C515 435.5 533.2 444.6 551.3 448.8C568.5 452.8 579.2 470.1 575.2 487.3C571.2 504.5 553.1 515.2 536.7 511.2C512.2 505.4 491.9 494.6 478.5 486.2C449.5 501.7 417 512 384 512C352.1 512 323.4 502.1 303.6 493.1C297.7 490.5 292.5 487.8 288 485.4C283.5 487.8 278.3 490.5 272.4 493.1C252.6 502.1 223.9 512 192 512C158.1 512 126.5 501.7 97.5 486.2C84.12 494.6 63.79 505.4 39.27 511.2C22.06 515.2 4.853 504.5 .8422 487.3C-3.169 470.1 7.532 452.8 24.74 448.8C42.84 444.6 60.96 435.5 75.31 423.6C86.46 414.1 102.6 413.4 114.5 421.9L114.6 421.9C136.7 437.2 165.1 448 192 448C219.5 448 247 437.4 269.5 421.9C280.6 414 295.4 414 306.5 421.9C328.1 437.4 356.5 448 384 448H384z"],shirt:[640,512,[128085,"t-shirt","tshirt"],"f553","M640 162.8c0 6.917-2.293 13.88-7.012 19.7l-49.96 61.63c-6.32 7.796-15.62 11.85-25.01 11.85c-7.01 0-14.07-2.262-19.97-6.919L480 203.3V464c0 26.51-21.49 48-48 48H208C181.5 512 160 490.5 160 464V203.3L101.1 249.1C96.05 253.7 88.99 255.1 81.98 255.1c-9.388 0-18.69-4.057-25.01-11.85L7.012 182.5C2.292 176.7-.0003 169.7-.0003 162.8c0-9.262 4.111-18.44 12.01-24.68l135-106.6C159.8 21.49 175.7 16 191.1 16H225.6C233.3 61.36 272.5 96 320 96s86.73-34.64 94.39-80h33.6c16.35 0 32.22 5.49 44.99 15.57l135 106.6C635.9 144.4 640 153.6 640 162.8z"],"shoe-prints":[640,512,[],"f54b","M192 159.1L224 159.1V32L192 32c-35.38 0-64 28.62-64 63.1S156.6 159.1 192 159.1zM0 415.1c0 35.37 28.62 64.01 64 64.01l32-.0103v-127.1l-32-.0005C28.62 351.1 0 380.6 0 415.1zM337.5 287.1c-35 0-76.25 13.12-104.8 31.1C208 336.4 188.3 351.1 128 351.1v128l57.5 15.98c26.25 7.25 53 13.13 80.38 15.01c32.63 2.375 65.63 .743 97.5-6.132C472.9 481.2 512 429.2 512 383.1C512 319.1 427.9 287.1 337.5 287.1zM491.4 7.252c-31.88-6.875-64.88-8.625-97.5-6.25C366.5 2.877 339.8 8.752 313.5 16L256 32V159.1c60.25 0 80 15.62 104.8 31.1c28.5 18.87 69.75 31.1 104.8 31.1C555.9 223.1 640 191.1 640 127.1C640 82.75 600.9 30.75 491.4 7.252z"],shop:[640,512,["store-alt"],"f54f","M0 155.2C0 147.9 2.153 140.8 6.188 134.7L81.75 21.37C90.65 8.021 105.6 0 121.7 0H518.3C534.4 0 549.3 8.021 558.2 21.37L633.8 134.7C637.8 140.8 640 147.9 640 155.2C640 175.5 623.5 192 603.2 192H36.84C16.5 192 .0003 175.5 .0003 155.2H0zM64 224H128V384H320V224H384V464C384 490.5 362.5 512 336 512H112C85.49 512 64 490.5 64 464V224zM512 224H576V480C576 497.7 561.7 512 544 512C526.3 512 512 497.7 512 480V224z"],"shop-lock":[640,512,[],"e4a5","M0 155.2C0 147.9 2.153 140.8 6.188 134.7L81.75 21.37C90.65 8.021 105.6 0 121.7 0H518.3C534.4 0 549.3 8.021 558.2 21.37L633.8 134.7C637.8 140.8 640 147.9 640 155.2C640 174.5 625.2 190.3 606.3 191.9C586.1 172.2 558.5 160 528 160C497.5 160 469.8 172.2 449.6 192H36.84C16.5 192 .0003 175.5 .0003 155.2H0zM384 224V464C384 490.5 362.5 512 336 512H112C85.49 512 64 490.5 64 464V224H128V384H320V224H384zM528 192C572.2 192 608 227.8 608 272V320C625.7 320 640 334.3 640 352V480C640 497.7 625.7 512 608 512H448C430.3 512 416 497.7 416 480V352C416 334.3 430.3 320 448 320V272C448 227.8 483.8 192 528 192zM528 240C510.3 240 496 254.3 496 272V320H560V272C560 254.3 545.7 240 528 240z"],"shop-slash":[640,512,["store-alt-slash"],"e070","M74.13 32.8L81.75 21.38C90.65 8.022 105.6 .001 121.7 .001H518.3C534.4 .001 549.3 8.022 558.2 21.38L633.8 134.7C637.8 140.8 640 147.9 640 155.2C640 175.5 623.5 192 603.2 192H277.3L320 225.5V224H384V275.7L512 375.1V224H576V426.2L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L74.13 32.8zM0 155.2C0 147.9 2.153 140.8 6.188 134.7L20.98 112.5L121.8 192H36.84C16.5 192 .0003 175.5 .0003 155.2H0zM320 384V348.1L384 398.5V464C384 490.5 362.5 512 336 512H112C85.49 512 64 490.5 64 464V224H128V384H320z"],shower:[512,512,[128703],"f2cc","M288 384c-17.67 0-32 14.33-32 32c0 17.67 14.33 32 32 32s32-14.33 32-32C320 398.3 305.7 384 288 384zM416 256c-17.67 0-32 14.33-32 32c0 17.67 14.33 32 32 32s32-14.33 32-32C448 270.3 433.7 256 416 256zM480 192c-17.67 0-32 14.33-32 32c0 17.67 14.33 32 32 32s32-14.33 32-32C512 206.3 497.7 192 480 192zM288 320c0-17.67-14.33-32-32-32s-32 14.33-32 32c0 17.67 14.33 32 32 32S288 337.7 288 320zM320 224c-17.67 0-32 14.33-32 32c0 17.67 14.33 32 32 32s32-14.33 32-32C352 238.3 337.7 224 320 224zM384 224c17.67 0 32-14.33 32-32c0-17.67-14.33-32-32-32s-32 14.33-32 32C352 209.7 366.3 224 384 224zM352 320c-17.67 0-32 14.33-32 32c0 17.67 14.33 32 32 32s32-14.33 32-32C384 334.3 369.7 320 352 320zM347.3 91.31l-11.31-11.31c-6.248-6.248-16.38-6.248-22.63 0l-6.631 6.631c-35.15-26.29-81.81-29.16-119.6-8.779L170.5 61.25C132.2 22.95 63.65 18.33 21.98 71.16C7.027 90.11 0 114.3 0 138.4V464C0 472.8 7.164 480 16 480h32C56.84 480 64 472.8 64 464V131.9c0-19.78 16.09-35.87 35.88-35.87c9.438 0 18.69 3.828 25.38 10.5l16.61 16.61C121.5 160.9 124.3 207.6 150.6 242.7L144 249.4c-6.248 6.248-6.248 16.38 0 22.63l11.31 11.31c6.248 6.25 16.38 6.25 22.63 0l169.4-169.4C353.6 107.7 353.6 97.56 347.3 91.31z"],shrimp:[512,512,[129424],"e448","M288 320V128H64C46.34 128 32 113.6 32 96s14.34-32 32-32h368c8.844 0 16-7.156 16-16s-7.156-16-16-16H64C28.72 32 0 60.7 0 96s28.72 64 64 64h2.879c15.26 90.77 94.01 160 189.1 160H288zM192 216c-13.25 0-24-10.75-24-24c0-13.26 10.75-24 24-24s24 10.74 24 24C216 205.3 205.3 216 192 216zM225.6 399.4c-4.75 12.36 1.406 26.25 13.78 31.02l5.688 2.188C233.3 434.1 224 443.8 224 456c0 13.25 10.75 24 24 24h72v-70.03l-63.38-24.38C244.3 380.9 230.4 386.1 225.6 399.4zM511.2 286.7c-.5488-5.754-2.201-11.1-3.314-16.65l-124.6 90.62c.3711 2.404 .7383 4.814 .7383 7.322c0 1.836-.3379 3.576-.5391 5.357l90.15 40.06C500.8 379.2 515.8 334.8 511.2 286.7zM352 413.1v66.08c37.23-3.363 71.04-18.3 97.94-41.21l-80.34-35.71C364.7 407.1 358.6 410.7 352 413.1zM497.9 237.7C470.1 172.4 402.8 128 328.4 128h-8.436v192h16c12.28 0 23.36 4.748 31.85 12.33L497.9 237.7z"],shuffle:[512,512,[128256,"random"],"f074","M424.1 287c-15.13-15.12-40.1-4.426-40.1 16.97V352H336L153.6 108.8C147.6 100.8 138.1 96 128 96H32C14.31 96 0 110.3 0 128s14.31 32 32 32h80l182.4 243.2C300.4 411.3 309.9 416 320 416h63.97v47.94c0 21.39 25.86 32.12 40.99 17l79.1-79.98c9.387-9.387 9.387-24.59 0-33.97L424.1 287zM336 160h47.97v48.03c0 21.39 25.87 32.09 40.1 16.97l79.1-79.98c9.387-9.391 9.385-24.59-.0013-33.97l-79.1-79.98c-15.13-15.12-40.99-4.391-40.99 17V96H320c-10.06 0-19.56 4.75-25.59 12.81L254 162.7L293.1 216L336 160zM112 352H32c-17.69 0-32 14.31-32 32s14.31 32 32 32h96c10.06 0 19.56-4.75 25.59-12.81l40.4-53.87L154 296L112 352z"],"shuttle-space":[640,512,["space-shuttle"],"f197","M129.1 480H128V384H352L245.2 448.1C210.4 468.1 170.6 480 129.1 480zM352 128H128V32H129.1C170.6 32 210.4 43.03 245.2 63.92L352 128zM104 128C130.2 128 153.4 140.6 168 160H456C525.3 160 591 182.7 635.2 241.6C641.6 250.1 641.6 261.9 635.2 270.4C591 329.3 525.3 352 456 352H168C153.4 371.4 130.2 384 104 384H96V480H80C53.49 480 32 458.5 32 432V384H40C17.91 384 0 366.1 0 344V168C0 145.9 17.89 128 39.96 128H32V80C32 53.49 53.49 32 80 32H96V128H104zM476.4 208C473.1 208 472 209.1 472 212.4V299.6C472 302 473.1 304 476.4 304C496.1 304 512 288.1 512 268.4V243.6C512 223.9 496.1 208 476.4 208z"],"sign-hanging":[512,512,["sign"],"f4d9","M96 0C113.7 0 128 14.33 128 32V64H480C497.7 64 512 78.33 512 96C512 113.7 497.7 128 480 128H128V480C128 497.7 113.7 512 96 512C78.33 512 64 497.7 64 480V128H32C14.33 128 0 113.7 0 96C0 78.33 14.33 64 32 64H64V32C64 14.33 78.33 0 96 0zM448 160C465.7 160 480 174.3 480 192V352C480 369.7 465.7 384 448 384H192C174.3 384 160 369.7 160 352V192C160 174.3 174.3 160 192 160H448z"],signal:[576,512,[128246,"signal-5","signal-perfect"],"f012","M544 0c-17.67 0-32 14.33-32 31.1V480C512 497.7 526.3 512 544 512s32-14.33 32-31.1V31.1C576 14.33 561.7 0 544 0zM160 288C142.3 288 128 302.3 128 319.1v160C128 497.7 142.3 512 160 512s32-14.33 32-31.1V319.1C192 302.3 177.7 288 160 288zM32 384C14.33 384 0 398.3 0 415.1v64C0 497.7 14.33 512 31.1 512S64 497.7 64 480V415.1C64 398.3 49.67 384 32 384zM416 96c-17.67 0-32 14.33-32 31.1V480C384 497.7 398.3 512 416 512s32-14.33 32-31.1V127.1C448 110.3 433.7 96 416 96zM288 192C270.3 192 256 206.3 256 223.1v256C256 497.7 270.3 512 288 512s32-14.33 32-31.1V223.1C320 206.3 305.7 192 288 192z"],signature:[640,512,[],"f5b7","M192 160C192 177.7 177.7 192 160 192C142.3 192 128 177.7 128 160V128C128 74.98 170.1 32 224 32C277 32 320 74.98 320 128V135.8C320 156.6 318.8 177.4 316.4 198.1L438.8 161.3C450.2 157.9 462.6 161.1 470.1 169.7C479.3 178.3 482.1 190.8 478.4 202.1L460.4 255.1H544C561.7 255.1 576 270.3 576 287.1C576 305.7 561.7 319.1 544 319.1H416C405.7 319.1 396.1 315.1 390 306.7C384 298.4 382.4 287.6 385.6 277.9L398.1 240.4L303.7 268.7C291.9 321.5 272.2 372.2 245.3 419.2L231.4 443.5C218.5 466.1 194.5 480 168.5 480C128.5 480 95.1 447.5 95.1 407.5V335.6C95.1 293.2 123.8 255.8 164.4 243.7L248.8 218.3C253.6 191.1 255.1 163.5 255.1 135.8V128C255.1 110.3 241.7 96 223.1 96C206.3 96 191.1 110.3 191.1 128L192 160zM160 335.6V407.5C160 412.2 163.8 416 168.5 416C171.5 416 174.4 414.4 175.9 411.7L189.8 387.4C207.3 356.6 221.4 324.1 231.8 290.3L182.8 304.1C169.3 309 160 321.5 160 335.6V335.6zM24 368H64V407.5C64 410.4 64.11 413.2 64.34 416H24C10.75 416 0 405.3 0 392C0 378.7 10.75 368 24 368zM616 416H283.5C291.7 400.3 299.2 384.3 305.9 368H616C629.3 368 640 378.7 640 392C640 405.3 629.3 416 616 416z"],"signs-post":[512,512,["map-signs"],"f277","M223.1 32C223.1 14.33 238.3 0 255.1 0C273.7 0 288 14.33 288 32H441.4C445.6 32 449.7 33.69 452.7 36.69L500.7 84.69C506.9 90.93 506.9 101.1 500.7 107.3L452.7 155.3C449.7 158.3 445.6 160 441.4 160H63.1C46.33 160 31.1 145.7 31.1 128V64C31.1 46.33 46.33 32 63.1 32L223.1 32zM480 320C480 337.7 465.7 352 448 352H70.63C66.38 352 62.31 350.3 59.31 347.3L11.31 299.3C5.065 293.1 5.065 282.9 11.31 276.7L59.31 228.7C62.31 225.7 66.38 223.1 70.63 223.1H223.1V191.1H288V223.1H448C465.7 223.1 480 238.3 480 255.1V320zM255.1 512C238.3 512 223.1 497.7 223.1 480V384H288V480C288 497.7 273.7 512 255.1 512z"],"sim-card":[384,512,[],"f7c4","M0 64v384c0 35.25 28.75 64 64 64h256c35.25 0 64-28.75 64-64V128l-128-128H64C28.75 0 0 28.75 0 64zM224 256H160V192h64V256zM320 256h-64V192h32c17.75 0 32 14.25 32 32V256zM256 384h64v32c0 17.75-14.25 32-32 32h-32V384zM160 384h64v64H160V384zM64 384h64v64H96c-17.75 0-32-14.25-32-32V384zM64 288h256v64H64V288zM64 224c0-17.75 14.25-32 32-32h32v64H64V224z"],sink:[512,512,[],"e06d","M496 288h-96V256l64 .0002c8.838 0 16-7.164 16-15.1v-15.1c0-8.838-7.162-16-16-16L384 208c-17.67 0-32 14.33-32 32v47.1l-64 .0005v-192c0-17.64 14.36-32 32-32s32 14.36 32 32v16c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16v-16c0-59.2-53.85-106-115.1-94.14C255.3 10.71 224 53.36 224 99.79v188.2L160 288V240c0-17.67-14.33-32-32-32L48 208c-8.836 0-16 7.162-16 16v15.1C32 248.8 39.16 256 48 256l64-.0002V288h-96c-8.836 0-16 7.164-16 16v32c0 8.836 7.164 16 16 16h480c8.836 0 16-7.164 16-16V304C512 295.2 504.8 288 496 288zM32 416c0 53.02 42.98 96 96 96h256c53.02 0 96-42.98 96-96v-32H32V416z"],sitemap:[576,512,[],"f0e8","M208 80C208 53.49 229.5 32 256 32H320C346.5 32 368 53.49 368 80V144C368 170.5 346.5 192 320 192H312V232H464C494.9 232 520 257.1 520 288V320H528C554.5 320 576 341.5 576 368V432C576 458.5 554.5 480 528 480H464C437.5 480 416 458.5 416 432V368C416 341.5 437.5 320 464 320H472V288C472 283.6 468.4 280 464 280H312V320H320C346.5 320 368 341.5 368 368V432C368 458.5 346.5 480 320 480H256C229.5 480 208 458.5 208 432V368C208 341.5 229.5 320 256 320H264V280H112C107.6 280 104 283.6 104 288V320H112C138.5 320 160 341.5 160 368V432C160 458.5 138.5 480 112 480H48C21.49 480 0 458.5 0 432V368C0 341.5 21.49 320 48 320H56V288C56 257.1 81.07 232 112 232H264V192H256C229.5 192 208 170.5 208 144V80z"],skull:[512,512,[128128],"f54c","M416 400V464C416 490.5 394.5 512 368 512H320V464C320 455.2 312.8 448 304 448C295.2 448 288 455.2 288 464V512H224V464C224 455.2 216.8 448 208 448C199.2 448 192 455.2 192 464V512H144C117.5 512 96 490.5 96 464V400C96 399.6 96 399.3 96.01 398.9C37.48 357.8 0 294.7 0 224C0 100.3 114.6 0 256 0C397.4 0 512 100.3 512 224C512 294.7 474.5 357.8 415.1 398.9C415.1 399.3 416 399.6 416 400V400zM160 192C124.7 192 96 220.7 96 256C96 291.3 124.7 320 160 320C195.3 320 224 291.3 224 256C224 220.7 195.3 192 160 192zM352 320C387.3 320 416 291.3 416 256C416 220.7 387.3 192 352 192C316.7 192 288 220.7 288 256C288 291.3 316.7 320 352 320z"],"skull-crossbones":[448,512,[128369,9760],"f714","M368 128C368 172.4 342.6 211.5 304 234.4V256C304 273.7 289.7 288 272 288H175.1C158.3 288 143.1 273.7 143.1 256V234.4C105.4 211.5 79.1 172.4 79.1 128C79.1 57.31 144.5 0 223.1 0C303.5 0 368 57.31 368 128V128zM167.1 176C185.7 176 199.1 161.7 199.1 144C199.1 126.3 185.7 112 167.1 112C150.3 112 135.1 126.3 135.1 144C135.1 161.7 150.3 176 167.1 176zM280 112C262.3 112 248 126.3 248 144C248 161.7 262.3 176 280 176C297.7 176 312 161.7 312 144C312 126.3 297.7 112 280 112zM3.378 273.7C11.28 257.9 30.5 251.5 46.31 259.4L223.1 348.2L401.7 259.4C417.5 251.5 436.7 257.9 444.6 273.7C452.5 289.5 446.1 308.7 430.3 316.6L295.6 384L430.3 451.4C446.1 459.3 452.5 478.5 444.6 494.3C436.7 510.1 417.5 516.5 401.7 508.6L223.1 419.8L46.31 508.6C30.5 516.5 11.28 510.1 3.378 494.3C-4.526 478.5 1.881 459.3 17.69 451.4L152.4 384L17.69 316.6C1.881 308.7-4.526 289.5 3.378 273.7V273.7z"],slash:[640,512,[],"f715","M5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196V9.196z"],sleigh:[640,512,[],"f7cc","M63.1 32C66.31 32 68.56 32.24 70.74 32.71C124.1 37.61 174.2 67.59 203.4 114.3L207.7 121.1C247.7 185.1 317.8 224 393.3 224C423.5 224 448 199.5 448 169.3V128C448 110.3 462.3 96 480 96H544C561.7 96 576 110.3 576 128C576 145.7 561.7 160 544 160V256C544 309 501 352 448 352V384H384V352H192V384H128V352C74.98 352 32 309 32 256V96C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H63.1zM640 392C640 440.6 600.6 480 552 480H63.1C46.33 480 31.1 465.7 31.1 448C31.1 430.3 46.33 416 63.1 416H552C565.3 416 576 405.3 576 392V384C576 366.3 590.3 352 608 352C625.7 352 640 366.3 640 384V392z"],sliders:[512,512,["sliders-h"],"f1de","M0 416C0 398.3 14.33 384 32 384H86.66C99 355.7 127.2 336 160 336C192.8 336 220.1 355.7 233.3 384H480C497.7 384 512 398.3 512 416C512 433.7 497.7 448 480 448H233.3C220.1 476.3 192.8 496 160 496C127.2 496 99 476.3 86.66 448H32C14.33 448 0 433.7 0 416V416zM192 416C192 398.3 177.7 384 160 384C142.3 384 128 398.3 128 416C128 433.7 142.3 448 160 448C177.7 448 192 433.7 192 416zM352 176C384.8 176 412.1 195.7 425.3 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H425.3C412.1 316.3 384.8 336 352 336C319.2 336 291 316.3 278.7 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H278.7C291 195.7 319.2 176 352 176zM384 256C384 238.3 369.7 224 352 224C334.3 224 320 238.3 320 256C320 273.7 334.3 288 352 288C369.7 288 384 273.7 384 256zM480 64C497.7 64 512 78.33 512 96C512 113.7 497.7 128 480 128H265.3C252.1 156.3 224.8 176 192 176C159.2 176 131 156.3 118.7 128H32C14.33 128 0 113.7 0 96C0 78.33 14.33 64 32 64H118.7C131 35.75 159.2 16 192 16C224.8 16 252.1 35.75 265.3 64H480zM160 96C160 113.7 174.3 128 192 128C209.7 128 224 113.7 224 96C224 78.33 209.7 64 192 64C174.3 64 160 78.33 160 96z"],smog:[640,512,[],"f75f","M144 288h156.1C322.6 307.8 351.8 320 384 320s61.25-12.25 83.88-32H528C589.9 288 640 237.9 640 176s-50.13-112-112-112c-18 0-34.75 4.625-49.75 12.12C453.1 30.1 406.8 0 352 0c-41 0-77.75 17.25-104 44.75C221.8 17.25 185 0 144 0c-79.5 0-144 64.5-144 144S64.5 288 144 288zM136 464H23.1C10.8 464 0 474.8 0 487.1S10.8 512 23.1 512H136C149.2 512 160 501.2 160 488S149.2 464 136 464zM616 368h-528C74.8 368 64 378.8 64 391.1S74.8 416 87.1 416h528c13.2 0 24-10.8 24-23.1S629.2 368 616 368zM552 464H231.1C218.8 464 208 474.8 208 487.1S218.8 512 231.1 512H552c13.2 0 24-10.8 24-23.1S565.2 464 552 464z"],smoking:[640,512,[128684],"f48d","M432 352h-384C21.5 352 0 373.5 0 400v64C0 490.5 21.5 512 48 512h384c8.75 0 16-7.25 16-16v-128C448 359.3 440.8 352 432 352zM400 464H224v-64h176V464zM536 352h-48C483.6 352 480 355.6 480 360v144c0 4.375 3.625 8 8 8h48c4.375 0 8-3.625 8-8v-144C544 355.6 540.4 352 536 352zM632 352h-48C579.6 352 576 355.6 576 360v144c0 4.375 3.625 8 8 8h48c4.375 0 8-3.625 8-8v-144C640 355.6 636.4 352 632 352zM553.3 87.13C547.6 83.25 544 77.12 544 70.25V8C544 3.625 540.4 0 536 0h-48C483.6 0 480 3.625 480 8v62.25c0 22 10.25 43.5 28.62 55.5C550.8 153 576 199.5 576 249.8V280C576 284.4 579.6 288 584 288h48C636.4 288 640 284.4 640 280V249.8C640 184.3 607.6 123.5 553.3 87.13zM487.8 141.6C463.8 125 448 99.25 448 70.25V8C448 3.625 444.4 0 440 0h-48C387.6 0 384 3.625 384 8v66.38C384 118.1 408.6 156 444.3 181.1C466.8 196.8 480 222.3 480 249.8V280C480 284.4 483.6 288 488 288h48C540.4 288 544 284.4 544 280V249.8C544 206.4 523 166.3 487.8 141.6z"],snowflake:[512,512,[10054,10052],"f2dc","M475.6 384.1C469.7 394.3 458.9 400 447.9 400c-5.488 0-11.04-1.406-16.13-4.375l-25.09-14.64l5.379 20.29c3.393 12.81-4.256 25.97-17.08 29.34c-2.064 .5625-4.129 .8125-6.164 .8125c-10.63 0-20.36-7.094-23.21-17.84l-17.74-66.92L288 311.7l.0002 70.5l48.38 48.88c9.338 9.438 9.244 24.62-.1875 33.94C331.5 469.7 325.4 472 319.3 472c-6.193 0-12.39-2.375-17.08-7.125l-14.22-14.37L288 480c0 17.69-14.34 32-32.03 32s-32.03-14.31-32.03-32l-.0002-29.5l-14.22 14.37c-9.322 9.438-24.53 9.5-33.97 .1875c-9.432-9.312-9.525-24.5-.1875-33.94l48.38-48.88L223.1 311.7l-59.87 34.93l-17.74 66.92c-2.848 10.75-12.58 17.84-23.21 17.84c-2.035 0-4.1-.25-6.164-.8125c-12.82-3.375-20.47-16.53-17.08-29.34l5.379-20.29l-25.09 14.64C75.11 398.6 69.56 400 64.07 400c-11.01 0-21.74-5.688-27.69-15.88c-8.932-15.25-3.785-34.84 11.5-43.75l25.96-15.15l-20.33-5.508C40.7 316.3 33.15 303.1 36.62 290.3S53.23 270 66.09 273.4L132 291.3L192.5 256L132 220.7L66.09 238.6c-2.111 .5625-4.225 .8438-6.305 .8438c-10.57 0-20.27-7.031-23.16-17.72C33.15 208.9 40.7 195.8 53.51 192.3l20.33-5.508L47.88 171.6c-15.28-8.906-20.43-28.5-11.5-43.75c8.885-15.28 28.5-20.44 43.81-11.5l25.09 14.64L99.9 110.7C96.51 97.91 104.2 84.75 116.1 81.38C129.9 77.91 142.1 85.63 146.4 98.41l17.74 66.92L223.1 200.3l-.0002-70.5L175.6 80.88C166.3 71.44 166.3 56.25 175.8 46.94C185.2 37.59 200.4 37.72 209.8 47.13l14.22 14.37L223.1 32c0-17.69 14.34-32 32.03-32s32.03 14.31 32.03 32l.0002 29.5l14.22-14.37c9.307-9.406 24.51-9.531 33.97-.1875c9.432 9.312 9.525 24.5 .1875 33.94l-48.38 48.88L288 200.3l59.87-34.93l17.74-66.92c3.395-12.78 16.56-20.5 29.38-17.03c12.82 3.375 20.47 16.53 17.08 29.34l-5.379 20.29l25.09-14.64c15.28-8.906 34.91-3.75 43.81 11.5c8.932 15.25 3.785 34.84-11.5 43.75l-25.96 15.15l20.33 5.508c12.81 3.469 20.37 16.66 16.89 29.44c-2.895 10.69-12.59 17.72-23.16 17.72c-2.08 0-4.193-.2813-6.305-.8438L379.1 220.7L319.5 256l60.46 35.28l65.95-17.87C458.8 270 471.9 277.5 475.4 290.3c3.473 12.78-4.082 25.97-16.89 29.44l-20.33 5.508l25.96 15.15C479.4 349.3 484.5 368.9 475.6 384.1z"],snowman:[512,512,[9924,9731],"f7d0","M510.9 152.3l-5.875-14.5c-3.25-8-12.62-11.88-20.75-8.625l-28.25 11.5v-29C455.1 103 448.7 96 439.1 96h-16c-8.75 0-16 7-16 15.62V158.5c0 .5 .25 1 .25 1.5l-48.98 20.6c-5.291-12.57-12.98-23.81-22.24-33.55c9.35-14.81 14.98-32.23 14.98-51.04C351.1 42.98 309 0 255.1 0S160 42.98 160 95.1c0 18.81 5.626 36.23 14.98 51.04C165.7 156.8 158.1 168.1 152.8 180.7L103.8 160c0-.5 .25-1 .25-1.5V111.6C104 103 96.76 96 88.01 96h-16c-8.75 0-16 7-16 15.62v29l-28.25-11.5c-8.125-3.25-17.5 .625-20.75 8.625l-5.875 14.5C-2.119 160.4 1.881 169.5 10.01 172.6L144.4 228.4C144.9 240.8 147.3 252.7 151.5 263.7c-33.78 29.34-55.53 72.04-55.53 120.3c0 52.59 25.71 98.84 64.88 128h190.2c39.17-29.17 64.88-75.42 64.88-128c0-48.25-21.76-90.95-55.53-120.3c4.195-11.03 6.599-22.89 7.091-35.27l134.4-55.8C510.1 169.5 514.1 160.4 510.9 152.3zM224 95.1c-8.75 0-15.1-7.25-15.1-15.1s7.25-15.1 15.1-15.1s15.1 7.25 15.1 15.1S232.8 95.1 224 95.1zM256 367.1c-8.75 0-15.1-7.25-15.1-15.1S247.3 335.1 256 335.1s15.1 7.25 15.1 15.1S264.8 367.1 256 367.1zM256 303.1c-8.75 0-15.1-7.25-15.1-15.1S247.3 271.1 256 271.1s15.1 7.25 15.1 15.1S264.8 303.1 256 303.1zM256 239.1c-8.75 0-15.1-7.25-15.1-15.1S247.3 207.1 256 207.1s15.1 7.25 15.1 15.1S264.8 239.1 256 239.1zM256 152c0 0-15.1-23.25-15.1-32S247.3 104 256 104s15.1 7.25 15.1 16S256 152 256 152zM287.1 95.1c-8.75 0-15.1-7.25-15.1-15.1s7.25-15.1 15.1-15.1s15.1 7.25 15.1 15.1S296.7 95.1 287.1 95.1z"],snowplow:[640,512,[],"f7d2","M144 400C144 413.3 133.3 424 120 424C106.7 424 96 413.3 96 400C96 386.7 106.7 376 120 376C133.3 376 144 386.7 144 400zM336 400C336 386.7 346.7 376 360 376C373.3 376 384 386.7 384 400C384 413.3 373.3 424 360 424C346.7 424 336 413.3 336 400zM304 400C304 413.3 293.3 424 280 424C266.7 424 256 413.3 256 400C256 386.7 266.7 376 280 376C293.3 376 304 386.7 304 400zM176 400C176 386.7 186.7 376 200 376C213.3 376 224 386.7 224 400C224 413.3 213.3 424 200 424C186.7 424 176 413.3 176 400zM447.4 249.6C447.8 251.9 448.1 254.3 448 256.7V288H512V235.2C512 220.7 516.9 206.6 526 195.2L583 124C594.1 110.2 614.2 107.1 627.1 119C641.8 130.1 644 150.2 632.1 163.1L576 235.2V402.7L630.6 457.4C643.1 469.9 643.1 490.1 630.6 502.6C618.1 515.1 597.9 515.1 585.4 502.6L530.7 448C518.7 435.1 512 419.7 512 402.7V352H469.2C476.1 366.5 480 382.8 480 400C480 461.9 429.9 512 368 512H112C50.14 512 0 461.9 0 400C0 355.3 26.16 316.8 64 298.8V192C64 174.3 78.33 160 96 160H128V48C128 21.49 149.5 0 176 0H298.9C324.5 0 347.6 15.26 357.7 38.79L445.1 242.7C446.1 244.9 446.9 247.2 447.4 249.6H447.4zM298.9 64H192V160L256 224H367.5L298.9 64zM368 352H112C85.49 352 64 373.5 64 400C64 426.5 85.49 448 112 448H368C394.5 448 416 426.5 416 400C416 373.5 394.5 352 368 352z"],soap:[512,512,[129532],"e06e","M320 256c35.35 0 64-28.65 64-64c0-35.35-28.65-64-64-64s-64 28.65-64 64C256 227.3 284.7 256 320 256zM160 288c-35.35 0-64 28.65-64 64c0 35.35 28.65 64 64 64h192c35.35 0 64-28.65 64-64c0-35.35-28.65-64-64-64H160zM384 64c17.67 0 32-14.33 32-32c0-17.67-14.33-32-32-32s-32 14.33-32 32C352 49.67 366.3 64 384 64zM208 96C234.5 96 256 74.51 256 48S234.5 0 208 0S160 21.49 160 48S181.5 96 208 96zM416 192c0 27.82-12.02 52.68-30.94 70.21C421.7 275.7 448 310.7 448 352c0 53.02-42.98 96-96 96H160c-53.02 0-96-42.98-96-96s42.98-96 96-96h88.91C233.6 238.1 224 216.7 224 192H96C42.98 192 0 234.1 0 288v128c0 53.02 42.98 96 96 96h320c53.02 0 96-42.98 96-96V288C512 234.1 469 192 416 192z"],socks:[576,512,[129510],"f696","M319.1 32c0-11 3.125-21.25 8-30.38C325.4 .8721 322.9 0 319.1 0H192C174.4 0 159.1 14.38 159.1 32l.0042 32h160L319.1 32zM246.6 310.1l73.36-55l.0026-159.1h-160l-.0042 175.1l-86.64 64.61c-39.38 29.5-53.86 84.4-29.24 127c18.25 31.62 51.1 48.36 83.97 48.36c20 0 40.26-6.225 57.51-19.22l21.87-16.38C177.6 421 193.9 350.6 246.6 310.1zM351.1 271.1l-86.13 64.61c-39.37 29.5-53.86 84.4-29.23 127C254.9 495.3 287.2 512 320.1 512c20 0 40.25-6.25 57.5-19.25l115.2-86.38C525 382.3 544 344.2 544 303.1v-207.1h-192L351.1 271.1zM512 0h-128c-17.62 0-32 14.38-32 32l-.0003 32H544V32C544 14.38 529.6 0 512 0z"],"solar-panel":[640,512,[],"f5ba","M575.4 25.72C572.4 10.78 559.2 0 543.1 0H96c-15.25 0-28.39 10.78-31.38 25.72l-63.1 320c-1.891 9.406 .5469 19.16 6.625 26.56S22.41 384 32 384h255.1v64.25H239.8c-26.26 0-47.75 21.49-47.75 47.75c0 8.844 7.168 16.01 16.01 16l223.1-.1667c8.828-.0098 15.99-7.17 15.99-16C447.1 469.5 426.6 448 400.2 448h-48.28v-64h256c9.594 0 18.67-4.312 24.75-11.72s8.516-17.16 6.625-26.56L575.4 25.72zM517.8 64l19.2 96h-97.98L429.2 64H517.8zM380.1 64l9.617 96H250l9.873-96H380.1zM210.8 64L201 160H103.1l19.18-96H210.8zM71.16 320l22.28-112h102.7L184.6 320H71.16zM233.8 320l11.37-112h149.7L406.2 320H233.8zM455.4 320l-11.5-112h102.7l22.28 112H455.4z"],sort:[320,512,["unsorted"],"f0dc","M27.66 224h264.7c24.6 0 36.89-29.78 19.54-47.12l-132.3-136.8c-5.406-5.406-12.47-8.107-19.53-8.107c-7.055 0-14.09 2.701-19.45 8.107L8.119 176.9C-9.229 194.2 3.055 224 27.66 224zM292.3 288H27.66c-24.6 0-36.89 29.77-19.54 47.12l132.5 136.8C145.9 477.3 152.1 480 160 480c7.053 0 14.12-2.703 19.53-8.109l132.3-136.8C329.2 317.8 316.9 288 292.3 288z"],"sort-down":[320,512,["sort-desc"],"f0dd","M311.9 335.1l-132.4 136.8C174.1 477.3 167.1 480 160 480c-7.055 0-14.12-2.702-19.47-8.109l-132.4-136.8C-9.229 317.8 3.055 288 27.66 288h264.7C316.9 288 329.2 317.8 311.9 335.1z"],"sort-up":[320,512,["sort-asc"],"f0de","M27.66 224h264.7c24.6 0 36.89-29.78 19.54-47.12l-132.3-136.8c-5.406-5.406-12.47-8.107-19.53-8.107c-7.055 0-14.09 2.701-19.45 8.107L8.119 176.9C-9.229 194.2 3.055 224 27.66 224z"],spa:[576,512,[],"f5bb","M568.3 192c-29 .125-135 6.124-213.9 82.1C321.2 304.7 301 338.3 288 369.9c-13-31.63-33.25-65.25-66.38-94.87C142.8 198.2 36.75 192.2 7.75 192C3.375 192 0 195.4 0 199.9c.25 27.88 7.125 126.2 88.75 199.3C172.8 481 256 479.1 288 479.1s115.2 1.025 199.3-80.85C568.9 326 575.8 227.7 576 199.9C576 195.4 572.6 192 568.3 192zM288 302.6c12.75-18.87 27.62-35.75 44.13-50.5c19-18.62 39.5-33.37 60.25-45.25c-16.5-70.5-51.75-133-96.75-172.3c-4.125-3.5-11-3.5-15.12 0c-45 39.25-80.25 101.6-96.75 172.1c20.37 11.75 40.5 26.12 59.25 44.37C260 266.4 275.1 283.7 288 302.6z"],"spaghetti-monster-flying":[640,512,["pastafarianism"],"f67b","M624.5 347.7c-32.63-12.5-57.38 4.241-75.38 16.49c-17 11.5-23.25 14.37-31.38 11.37c-8.125-3.125-10.88-9.358-15.88-29.36c-3.375-13.12-7.5-29.47-18-42.72c2.25-3 4.5-5.875 6.375-8.625C500.5 304.5 513.8 312 532 312c33.1 0 50.87-25.75 61.1-42.88C604.6 253 609 248 616 248C629.3 248 640 237.3 640 224s-10.75-24-24-24c-34 0-50.88 25.75-62 42.88C543.4 259 539 264 532 264c-17.25 0-37.5-61.38-97.25-101.9L452 127.6C485.4 125.5 512 97.97 512 63.97C512 28.6 483.4 0 448 0s-64 28.6-64 63.97c0 13 4 25.15 10.62 35.28L376.5 135.5C359.5 130.9 340.9 128 320 128S280.5 130.9 263.5 135.5L245.4 99.25C252 89.13 256 76.97 256 63.97C256 28.6 227.4 0 192 0S128 28.6 128 63.97C128 97.97 154.5 125.5 188 127.6l17.25 34.5C145.6 202.5 125.1 264 108 264c-7 0-11.31-5-21.94-21.12C74.94 225.8 57.1 200 24 200C10.75 200 0 210.8 0 224s10.75 24 24 24c7 0 11.37 5 21.1 21.12C57.12 286.3 73.1 312 108 312c18.25 0 31.5-7.5 41.75-17.12C151.6 297.6 153.9 300.5 156.1 303.5c-10.5 13.25-14.62 29.59-18 42.72c-5 20-7.75 26.23-15.88 29.36c-8.125 3-14.37 .1314-31.37-11.37c-18.12-12.25-42.75-28.87-75.38-16.49c-12.38 4.75-18.62 18.61-13.88 30.98c4.625 12.38 18.62 18.62 30.88 13.87C40.75 389.6 46.88 392.4 64 403.9c13.5 9.125 30.75 20.86 52.38 20.86c7.125 0 14.88-1.248 23-4.373c32.63-12.5 40-41.34 45.25-62.46c2.25-8.75 4-14.49 6-18.86c16.62 13.62 37 25.86 61.63 34.23C242.3 410.3 220.1 464 192 464c-13.25 0-24 10.74-24 23.99S178.8 512 192 512c66.75 0 97-88.55 107.4-129.1C306.1 383.6 312.9 384 320 384s13.88-.4706 20.62-1.096C351 423.4 381.3 512 448 512c13.25 0 24-10.74 24-23.99S461.3 464 448 464c-28 0-50.25-53.74-60.25-90.74c24.75-8.375 45-20.56 61.63-34.19c2 4.375 3.75 10.11 6 18.86c5.375 21.12 12.62 49.96 45.25 62.46c8.25 3.125 15.88 4.373 23 4.373c21.62 0 38.83-11.74 52.46-20.86c17-11.5 23.29-14.37 31.42-11.37c12.38 4.75 26.25-1.492 30.88-13.87C643.1 366.3 637 352.5 624.5 347.7zM192 79.97c-8.875 0-16-7.125-16-16S183.1 47.98 192 47.98s16 7.118 16 15.99S200.9 79.97 192 79.97zM448 47.98c8.875 0 16 7.118 16 15.99s-7.125 16-16 16s-16-7.125-16-16S439.1 47.98 448 47.98z"],"spell-check":[576,512,[],"f891","M566.6 265.4c-12.5-12.5-32.75-12.5-45.25 0L352 434.8l-73.38-73.38c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25l96 96c6.25 6.25 14.44 9.368 22.62 9.368s16.38-3.118 22.63-9.368l192-192C579.1 298.1 579.1 277.9 566.6 265.4zM221.5 211.7l-80-192C136.6 7.796 124.9 .0147 112 .0147S87.44 7.796 82.47 19.7l-80 192C-4.328 228 3.375 246.8 19.69 253.5c16.36 6.812 35.06-.9375 41.84-17.22l5.131-12.31h90.68l5.131 12.31c5.109 12.28 17.02 19.69 29.55 19.69c4.094 0 8.266-.7812 12.3-2.469C220.6 246.8 228.3 228 221.5 211.7zM93.33 160L112 115.2l18.67 44.81H93.33zM288 256h80c44.11 0 80-35.87 80-79.1c0-23.15-10.03-43.85-25.79-58.47C428.3 106.3 432 93.65 432 80.01c0-44.13-35.89-80-79.1-80L288 .0147c-17.67 0-32 14.31-32 31.1v192C256 241.7 270.3 256 288 256zM320 64.01h32c8.828 0 16 7.188 16 16s-7.172 16-16 16h-32V64.01zM320 160h48c8.828 0 16 7.188 16 16s-7.172 16-16 16H320V160z"],spider:[576,512,[128375],"f717","M563.3 401.6c2.608 8.443-2.149 17.4-10.62 19.1l-15.35 4.709c-8.48 2.6-17.47-2.139-20.08-10.59L493.2 338l-79.79-31.8l53.47 62.15c5.08 5.904 6.972 13.89 5.08 21.44l-28.23 110.1c-2.151 8.57-10.87 13.78-19.47 11.64l-15.58-3.873c-8.609-2.141-13.84-10.83-11.69-19.4l25.2-98.02l-38.51-44.77c.1529 2.205 .6627 4.307 .6627 6.549c0 53.02-43.15 96-96.37 96S191.6 405 191.6 352c0-2.242 .5117-4.34 .6627-6.543l-38.51 44.76l25.2 98.02c2.151 8.574-3.084 17.26-11.69 19.4l-15.58 3.873c-8.603 2.141-17.32-3.072-19.47-11.64l-28.23-110.1c-1.894-7.543 0-15.53 5.08-21.44l53.47-62.15l-79.79 31.8l-24.01 77.74c-2.608 8.447-11.6 13.19-20.08 10.59l-15.35-4.709c-8.478-2.6-13.23-11.55-10.63-19.1l27.4-88.69c2.143-6.939 7.323-12.54 14.09-15.24L158.9 256l-104.7-41.73C47.43 211.6 42.26 205.1 40.11 199.1L12.72 110.4c-2.608-8.443 2.149-17.4 10.62-19.1l15.35-4.709c8.48-2.6 17.47 2.139 20.08 10.59l24.01 77.74l79.79 31.8L109.1 143.6C104 137.7 102.1 129.7 104 122.2l28.23-110.1c2.151-8.57 10.87-13.78 19.47-11.64l15.58 3.873C175.9 6.494 181.1 15.18 178.1 23.76L153.8 121.8L207.7 184.4l.1542-24.44C206.1 123.4 228.9 91.77 261.4 80.43c5.141-1.793 10.5 2.215 10.5 7.641V112h32.12V88.09c0-5.443 5.394-9.443 10.55-7.641C345.9 91.39 368.3 121 368.3 155.9c0 1.393-.1786 2.689-.2492 4.064L368.3 184.4l53.91-62.66l-25.2-98.02c-2.151-8.574 3.084-17.26 11.69-19.4l15.58-3.873c8.603-2.141 17.32 3.072 19.47 11.64l28.23 110.1c1.894 7.543 0 15.53-5.08 21.44l-53.47 62.15l79.79-31.8l24.01-77.74c2.608-8.447 11.6-13.19 20.08-10.59l15.35 4.709c8.478 2.6 13.23 11.55 10.63 19.1l-27.4 88.69c-2.143 6.939-7.323 12.54-14.09 15.24L417.1 256l104.7 41.73c6.754 2.691 11.92 8.283 14.07 15.21L563.3 401.6z"],spinner:[512,512,[],"f110","M304 48C304 74.51 282.5 96 256 96C229.5 96 208 74.51 208 48C208 21.49 229.5 0 256 0C282.5 0 304 21.49 304 48zM304 464C304 490.5 282.5 512 256 512C229.5 512 208 490.5 208 464C208 437.5 229.5 416 256 416C282.5 416 304 437.5 304 464zM0 256C0 229.5 21.49 208 48 208C74.51 208 96 229.5 96 256C96 282.5 74.51 304 48 304C21.49 304 0 282.5 0 256zM512 256C512 282.5 490.5 304 464 304C437.5 304 416 282.5 416 256C416 229.5 437.5 208 464 208C490.5 208 512 229.5 512 256zM74.98 437C56.23 418.3 56.23 387.9 74.98 369.1C93.73 350.4 124.1 350.4 142.9 369.1C161.6 387.9 161.6 418.3 142.9 437C124.1 455.8 93.73 455.8 74.98 437V437zM142.9 142.9C124.1 161.6 93.73 161.6 74.98 142.9C56.24 124.1 56.24 93.73 74.98 74.98C93.73 56.23 124.1 56.23 142.9 74.98C161.6 93.73 161.6 124.1 142.9 142.9zM369.1 369.1C387.9 350.4 418.3 350.4 437 369.1C455.8 387.9 455.8 418.3 437 437C418.3 455.8 387.9 455.8 369.1 437C350.4 418.3 350.4 387.9 369.1 369.1V369.1z"],splotch:[512,512,[],"f5bc","M349.3 47.38L367.9 116.1C374.6 142.1 393.2 162.3 417.6 171.2L475.8 192.4C497.5 200.3 512 221 512 244.2C512 261.8 503.6 278.4 489.4 288.8L406.9 348.1C393.3 358.9 385.7 374.1 386.7 391.8L389.8 442.4C392.1 480.1 362.2 511.9 324.4 511.9C308.8 511.9 293.8 506.4 281.1 496.4L236.1 458.2C221.1 444.7 200.9 437.3 180 437.3H171.6C165.1 437.3 160.4 437.8 154.8 438.9L87.81 451.9C63.82 456.6 39.53 445.5 27.41 424.3C17.39 406.7 17.39 385.2 27.41 367.7L55.11 319.2C60.99 308.9 64.09 297.3 64.09 285.4C64.09 272.3 60.33 259.6 53.27 248.6L8.796 179.4C-6.738 155.2-1.267 123.2 21.41 105.6C32.12 97.25 45.52 93.13 59.07 94.01L130.8 98.66C159.8 100.5 187.1 87.91 205.9 64.93L237.3 24.66C249.4 9.133 267.9 .0566 287.6 .0566C316.5 .0566 341.8 19.47 349.3 47.38V47.38z"],spoon:[512,512,[61873,129348,"utensil-spoon"],"f2e5","M449.5 242.2C436.4 257.8 419.8 270 400.1 277.8C382.2 285.6 361.7 288.8 341.4 287C326.2 284.5 311.8 278.4 299.5 269.1L68.29 500.3C60.79 507.8 50.61 512 40 512C29.39 512 19.22 507.8 11.71 500.3C4.211 492.8-.0039 482.6-.0039 472C-.0039 461.4 4.211 451.2 11.71 443.7L243 212.5C233.7 200.2 227.6 185.8 225.1 170.6C223.3 150.3 226.5 129.9 234.3 111C242.1 92.22 254.3 75.56 269.9 62.47C337.8-5.437 433.1-20.28 482.7 29.35C532.3 78.95 517.4 174.2 449.5 242.2z"],"spray-can":[512,512,[],"f5bd","M192 0C209.7 0 224 14.33 224 32V128H96V32C96 14.33 110.3 0 128 0H192zM0 256C0 202.1 42.98 160 96 160H224C277 160 320 202.1 320 256V464C320 490.5 298.5 512 272 512H48C21.49 512 0 490.5 0 464V256zM160 256C115.8 256 80 291.8 80 336C80 380.2 115.8 416 160 416C204.2 416 240 380.2 240 336C240 291.8 204.2 256 160 256zM320 64C320 81.67 305.7 96 288 96C270.3 96 256 81.67 256 64C256 46.33 270.3 32 288 32C305.7 32 320 46.33 320 64zM352 64C352 46.33 366.3 32 384 32C401.7 32 416 46.33 416 64C416 81.67 401.7 96 384 96C366.3 96 352 81.67 352 64zM512 64C512 81.67 497.7 96 480 96C462.3 96 448 81.67 448 64C448 46.33 462.3 32 480 32C497.7 32 512 46.33 512 64zM448 160C448 142.3 462.3 128 480 128C497.7 128 512 142.3 512 160C512 177.7 497.7 192 480 192C462.3 192 448 177.7 448 160zM512 256C512 273.7 497.7 288 480 288C462.3 288 448 273.7 448 256C448 238.3 462.3 224 480 224C497.7 224 512 238.3 512 256zM352 160C352 142.3 366.3 128 384 128C401.7 128 416 142.3 416 160C416 177.7 401.7 192 384 192C366.3 192 352 177.7 352 160z"],"spray-can-sparkles":[512,512,["air-freshener"],"f5d0","M96 32C96 14.33 110.3 0 128 0H192C209.7 0 224 14.33 224 32V128H96V32zM224 160C277 160 320 202.1 320 256V464C320 490.5 298.5 512 272 512H48C21.49 512 0 490.5 0 464V256C0 202.1 42.98 160 96 160H224zM160 416C204.2 416 240 380.2 240 336C240 291.8 204.2 256 160 256C115.8 256 80 291.8 80 336C80 380.2 115.8 416 160 416zM384 48C384 49.36 383 50.97 381.8 51.58L352 64L339.6 93.78C338.1 95 337.4 96 336 96C334.6 96 333 95 332.4 93.78L320 64L290.2 51.58C288.1 50.97 288 49.36 288 48C288 46.62 288.1 45.03 290.2 44.42L320 32L332.4 2.219C333 1 334.6 0 336 0C337.4 0 338.1 1 339.6 2.219L352 32L381.8 44.42C383 45.03 384 46.62 384 48zM460.4 93.78L448 64L418.2 51.58C416.1 50.97 416 49.36 416 48C416 46.62 416.1 45.03 418.2 44.42L448 32L460.4 2.219C461 1 462.6 0 464 0C465.4 0 466.1 1 467.6 2.219L480 32L509.8 44.42C511 45.03 512 46.62 512 48C512 49.36 511 50.97 509.8 51.58L480 64L467.6 93.78C466.1 95 465.4 96 464 96C462.6 96 461 95 460.4 93.78zM467.6 194.2L480 224L509.8 236.4C511 237 512 238.6 512 240C512 241.4 511 242.1 509.8 243.6L480 256L467.6 285.8C466.1 287 465.4 288 464 288C462.6 288 461 287 460.4 285.8L448 256L418.2 243.6C416.1 242.1 416 241.4 416 240C416 238.6 416.1 237 418.2 236.4L448 224L460.4 194.2C461 193 462.6 192 464 192C465.4 192 466.1 193 467.6 194.2zM448 144C448 145.4 447 146.1 445.8 147.6L416 160L403.6 189.8C402.1 191 401.4 192 400 192C398.6 192 397 191 396.4 189.8L384 160L354.2 147.6C352.1 146.1 352 145.4 352 144C352 142.6 352.1 141 354.2 140.4L384 128L396.4 98.22C397 97 398.6 96 400 96C401.4 96 402.1 97 403.6 98.22L416 128L445.8 140.4C447 141 448 142.6 448 144z"],square:[448,512,[9723,9724,61590,9632],"f0c8","M0 96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96z"],"square-arrow-up-right":[448,512,["external-link-square"],"f14c","M384 32H64C28.65 32 0 60.66 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM344 312c0 17.69-14.31 32-32 32s-32-14.31-32-32V245.3l-121.4 121.4C152.4 372.9 144.2 376 136 376s-16.38-3.125-22.62-9.375c-12.5-12.5-12.5-32.75 0-45.25L234.8 200H168c-17.69 0-32-14.31-32-32s14.31-32 32-32h144c17.69 0 32 14.31 32 32V312z"],"square-caret-down":[448,512,["caret-square-down"],"f150","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.65 419.3 32 384 32zM345.6 232.3l-104 112C237 349.2 230.7 352 224 352s-13.03-2.781-17.59-7.656l-104-112c-6.5-7-8.219-17.19-4.407-25.94C101.8 197.7 110.5 192 120 192h208c9.531 0 18.19 5.656 21.1 14.41C353.8 215.2 352.1 225.3 345.6 232.3z"],"square-caret-left":[448,512,["caret-square-left"],"f191","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.65 419.3 32 384 32zM288 360c0 9.531-5.656 18.19-14.41 22C270.5 383.3 267.3 384 264 384c-5.938 0-11.81-2.219-16.34-6.406l-112-104C130.8 269 128 262.7 128 256s2.781-13.03 7.656-17.59l112-104c7.031-6.469 17.22-8.156 25.94-4.406C282.3 133.8 288 142.5 288 152V360z"],"square-caret-right":[448,512,["caret-square-right"],"f152","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.65 419.3 32 384 32zM312.3 273.6l-112 104C195.8 381.8 189.9 384 184 384c-3.25 0-6.5-.6562-9.594-2C165.7 378.2 160 369.5 160 360v-208c0-9.531 5.656-18.19 14.41-22c8.75-3.75 18.94-2.062 25.94 4.406l112 104C317.2 242.1 320 249.3 320 256S317.2 269 312.3 273.6z"],"square-caret-up":[448,512,["caret-square-up"],"f151","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.65 419.3 32 384 32zM349.1 305.6C346.2 314.3 337.5 320 328 320h-208c-9.531 0-18.19-5.656-22-14.41C94.19 296.8 95.91 286.7 102.4 279.7l104-112c9.125-9.75 26.06-9.75 35.19 0l104 112C352.1 286.7 353.8 296.8 349.1 305.6z"],"square-check":[448,512,[9989,61510,9745,"check-square"],"f14a","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM339.8 211.8C350.7 200.9 350.7 183.1 339.8 172.2C328.9 161.3 311.1 161.3 300.2 172.2L192 280.4L147.8 236.2C136.9 225.3 119.1 225.3 108.2 236.2C97.27 247.1 97.27 264.9 108.2 275.8L172.2 339.8C183.1 350.7 200.9 350.7 211.8 339.8L339.8 211.8z"],"square-envelope":[448,512,["envelope-square"],"f199","M384 32H64C28.63 32 0 60.63 0 96v320c0 35.38 28.62 64 64 64h320c35.38 0 64-28.62 64-64V96C448 60.63 419.4 32 384 32zM384 336c0 17.67-14.33 32-32 32H96c-17.67 0-32-14.33-32-32V225.9l138.5 69.27C209.3 298.5 216.6 300.2 224 300.2s14.75-1.688 21.47-5.047L384 225.9V336zM384 190.1l-152.8 76.42c-4.5 2.25-9.812 2.25-14.31 0L64 190.1V176c0-17.67 14.33-32 32-32h256c17.67 0 32 14.33 32 32V190.1z"],"square-full":[512,512,[128997,128998,128999,129e3,129001,129002,129003,11036,11035],"f45c","M0 0H512V512H0V0z"],"square-h":[448,512,["h-square"],"f0fd","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V96C448 60.65 419.3 32 384 32zM336 360c0 13.25-10.75 24-24 24S288 373.3 288 360v-80H160v80C160 373.3 149.3 384 136 384S112 373.3 112 360v-208C112 138.8 122.8 128 136 128S160 138.8 160 152v80h128v-80C288 138.8 298.8 128 312 128s24 10.75 24 24V360z"],"square-minus":[448,512,[61767,"minus-square"],"f146","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM136 232C122.7 232 112 242.7 112 256C112 269.3 122.7 280 136 280H312C325.3 280 336 269.3 336 256C336 242.7 325.3 232 312 232H136z"],"square-nfi":[448,512,[],"e576","M0 96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96zM64 176V336C64 344.8 71.16 352 80 352C88.84 352 96 344.8 96 336V233.8L162.3 344.2C165.1 350.4 173.3 353.3 180.3 351.4C187.2 349.5 191.1 343.2 191.1 336V176C191.1 167.2 184.8 160 175.1 160C167.2 160 159.1 167.2 159.1 176V278.2L93.72 167.8C90.02 161.6 82.66 158.7 75.73 160.6C68.8 162.5 64 168.8 64 176V176zM224 336C224 344.8 231.2 352 240 352C248.8 352 256 344.8 256 336V256H304C312.8 256 320 248.8 320 240C320 231.2 312.8 224 304 224H256V192H304C312.8 192 320 184.8 320 176C320 167.2 312.8 160 304 160H240C231.2 160 224 167.2 224 176V336zM384 176C384 167.2 376.8 160 368 160C359.2 160 352 167.2 352 176V336C352 344.8 359.2 352 368 352C376.8 352 384 344.8 384 336V176z"],"square-parking":[448,512,[127359,"parking"],"f540","M192 256V192H240C257.7 192 272 206.3 272 224C272 241.7 257.7 256 240 256H192zM384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM336 224C336 170.1 293 128 240 128H168C145.9 128 128 145.9 128 168V352C128 369.7 142.3 384 160 384C177.7 384 192 369.7 192 352V320H240C293 320 336 277 336 224z"],"square-pen":[448,512,["pen-square","pencil-square"],"f14b","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM325.8 139.7C310.1 124.1 284.8 124.1 269.2 139.7L247.8 161.1L318.7 232.1L340.1 210.7C355.8 195 355.8 169.7 340.1 154.1L325.8 139.7zM111.5 303.8L96.48 363.1C95.11 369.4 96.71 375.2 100.7 379.2C104.7 383.1 110.4 384.7 115.9 383.4L176 368.3C181.6 366.9 186.8 364 190.9 359.9L296.1 254.7L225.1 183.8L119.9 288.1C115.8 293.1 112.9 298.2 111.5 303.8z"],"square-person-confined":[448,512,[],"e577","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM208 96C181.5 96 160 117.5 160 144C160 170.5 181.5 192 208 192C234.5 192 256 170.5 256 144C256 117.5 234.5 96 208 96zM240 306.7L198.6 265.4C191.4 258.1 181 254.8 170.9 256.4C160.7 258.1 151.1 264.5 147.4 273.7L99.39 369.7C91.48 385.5 97.89 404.7 113.7 412.6C129.5 420.5 148.7 414.1 156.6 398.3L184.8 342L239.4 396.7C251.8 409.1 268.6 416 286.1 416C322.5 416 352 386.5 352 350.1V248C352 217.1 326.9 192 296 192C265.1 192 240 217.1 240 248V306.7z"],"square-phone":[448,512,["phone-square"],"f098","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V96C448 60.65 419.3 32 384 32zM351.6 321.5l-11.62 50.39c-1.633 7.125-7.9 12.11-15.24 12.11c-126.1 0-228.7-102.6-228.7-228.8c0-7.328 4.984-13.59 12.11-15.22l50.38-11.63c7.344-1.703 14.88 2.109 17.93 9.062l23.27 54.28c2.719 6.391 .8828 13.83-4.492 18.22L168.3 232c16.99 34.61 45.14 62.75 79.77 79.75l22.02-26.91c4.344-5.391 11.85-7.25 18.24-4.484l54.24 23.25C349.5 306.6 353.3 314.2 351.6 321.5z"],"square-phone-flip":[448,512,["phone-square-alt"],"f87b","M0 96v320c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V96c0-35.35-28.65-64-64-64H64C28.65 32 0 60.65 0 96zM105.5 303.6l54.24-23.25c6.391-2.766 13.9-.9062 18.24 4.484l22.02 26.91c34.63-17 62.77-45.14 79.77-79.75l-26.91-22.05c-5.375-4.391-7.211-11.83-4.492-18.22l23.27-54.28c3.047-6.953 10.59-10.77 17.93-9.062l50.38 11.63c7.125 1.625 12.11 7.891 12.11 15.22c0 126.1-102.6 228.8-228.7 228.8c-7.336 0-13.6-4.984-15.24-12.11l-11.62-50.39C94.71 314.2 98.5 306.6 105.5 303.6z"],"square-plus":[448,512,[61846,"plus-square"],"f0fe","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM224 368C237.3 368 248 357.3 248 344V280H312C325.3 280 336 269.3 336 256C336 242.7 325.3 232 312 232H248V168C248 154.7 237.3 144 224 144C210.7 144 200 154.7 200 168V232H136C122.7 232 112 242.7 112 256C112 269.3 122.7 280 136 280H200V344C200 357.3 210.7 368 224 368z"],"square-poll-horizontal":[448,512,["poll-h"],"f682","M448 416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384C419.3 32 448 60.65 448 96V416zM256 160C256 142.3 241.7 128 224 128H128C110.3 128 96 142.3 96 160C96 177.7 110.3 192 128 192H224C241.7 192 256 177.7 256 160zM128 224C110.3 224 96 238.3 96 256C96 273.7 110.3 288 128 288H320C337.7 288 352 273.7 352 256C352 238.3 337.7 224 320 224H128zM192 352C192 334.3 177.7 320 160 320H128C110.3 320 96 334.3 96 352C96 369.7 110.3 384 128 384H160C177.7 384 192 369.7 192 352z"],"square-poll-vertical":[448,512,["poll"],"f681","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM128 224C110.3 224 96 238.3 96 256V352C96 369.7 110.3 384 128 384C145.7 384 160 369.7 160 352V256C160 238.3 145.7 224 128 224zM192 352C192 369.7 206.3 384 224 384C241.7 384 256 369.7 256 352V160C256 142.3 241.7 128 224 128C206.3 128 192 142.3 192 160V352zM320 288C302.3 288 288 302.3 288 320V352C288 369.7 302.3 384 320 384C337.7 384 352 369.7 352 352V320C352 302.3 337.7 288 320 288z"],"square-root-variable":[576,512,["square-root-alt"],"f698","M576 32.01c0-17.69-14.33-31.1-32-31.1l-224-.0049c-14.69 0-27.48 10-31.05 24.25L197.9 388.3L124.6 241.7C119.2 230.9 108.1 224 96 224L32 224c-17.67 0-32 14.31-32 31.1s14.33 32 32 32h44.22l103.2 206.3c5.469 10.91 16.6 17.68 28.61 17.68c1.172 0 2.323-.0576 3.495-.1826c13.31-1.469 24.31-11.06 27.56-24.06l105.9-423.8H544C561.7 64.01 576 49.7 576 32.01zM566.6 233.4c-12.5-12.5-32.75-12.5-45.25 0L480 274.8l-41.38-41.37c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25l41.38 41.38l-41.38 41.38c-12.5 12.5-12.5 32.75 0 45.25C399.6 412.9 407.8 416 416 416s16.38-3.125 22.62-9.375L480 365.3l41.38 41.38C527.6 412.9 535.8 416 544 416s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25l-41.38-41.38L566.6 278.6C579.1 266.1 579.1 245.9 566.6 233.4z"],"square-rss":[448,512,["rss-square"],"f143","M384 32H64C28.65 32 0 60.66 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.66 419.3 32 384 32zM150.6 374.6C144.4 380.9 136.2 384 128 384s-16.38-3.121-22.63-9.371c-12.5-12.5-12.5-32.76 0-45.26C111.6 323.1 119.8 320 128 320s16.38 3.121 22.63 9.371C163.1 341.9 163.1 362.1 150.6 374.6zM249.6 383.9C249 383.1 248.5 384 247.1 384c-12.53 0-23.09-9.75-23.92-22.44C220.5 306.9 173.1 259.5 118.4 255.9c-13.22-.8438-23.25-12.28-22.39-25.5c.8594-13.25 12.41-22.81 25.52-22.38c77.86 5.062 145.3 72.5 150.4 150.4C272.8 371.7 262.8 383.1 249.6 383.9zM345 383.1C344.7 384 344.3 384 343.1 384c-12.8 0-23.42-10.09-23.97-23C315.6 254.6 225.4 164.4 119 159.1C105.8 159.4 95.47 148.3 96.02 135C96.58 121.8 107.9 111.2 121 112c130.7 5.469 241.5 116.3 246.1 246.1C368.5 372.3 358.3 383.4 345 383.1z"],"square-share-nodes":[448,512,["share-alt-square"],"f1e1","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM320 96C284.7 96 256 124.7 256 160C256 162.5 256.1 164.9 256.4 167.3L174.5 212C162.8 199.7 146.3 192 128 192C92.65 192 64 220.7 64 256C64 291.3 92.65 320 128 320C146.3 320 162.8 312.3 174.5 299.1L256.4 344.7C256.1 347.1 256 349.5 256 352C256 387.3 284.7 416 320 416C355.3 416 384 387.3 384 352C384 316.7 355.3 288 320 288C304.6 288 290.5 293.4 279.4 302.5L194.1 256L279.4 209.5C290.5 218.6 304.6 224 320 224C355.3 224 384 195.3 384 160C384 124.7 355.3 96 320 96V96z"],"square-up-right":[448,512,[8599,"external-link-square-alt"],"f360","M384 32H64C28.65 32 0 60.65 0 96v320c0 35.34 28.65 64 64 64h320c35.35 0 64-28.66 64-64V96C448 60.65 419.3 32 384 32zM330.5 323.9c0 6.473-3.889 12.3-9.877 14.78c-5.979 2.484-12.86 1.105-17.44-3.469l-45.25-45.25l-67.92 67.92c-12.5 12.5-32.72 12.46-45.21-.0411l-22.63-22.63C109.7 322.7 109.6 302.5 122.1 289.1l67.92-67.92L144.8 176.8C140.2 172.2 138.8 165.3 141.3 159.4c2.477-5.984 8.309-9.875 14.78-9.875h158.4c8.835 0 15.1 7.163 15.1 15.1V323.9z"],"square-virus":[448,512,[],"e578","M160 224C160 206.3 174.3 192 192 192C209.7 192 224 206.3 224 224C224 241.7 209.7 256 192 256C174.3 256 160 241.7 160 224zM280 288C280 301.3 269.3 312 256 312C242.7 312 232 301.3 232 288C232 274.7 242.7 264 256 264C269.3 264 280 274.7 280 288zM384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM199.8 117.7C199.8 146.9 164.5 161.6 143.8 140.9C134.4 131.5 119.2 131.5 109.8 140.9C100.5 150.2 100.5 165.4 109.8 174.8C130.5 195.5 115.9 230.9 86.61 230.9C73.35 230.9 62.61 241.6 62.61 254.9C62.61 268.1 73.35 278.9 86.61 278.9C115.9 278.9 130.5 314.3 109.8 334.9C100.5 344.3 100.5 359.5 109.8 368.9C119.2 378.3 134.4 378.3 143.8 368.9C164.5 348.2 199.8 362.9 199.8 392.1C199.8 405.4 210.6 416.1 223.8 416.1C237.1 416.1 247.8 405.4 247.8 392.1C247.8 362.9 283.2 348.2 303.9 368.9C313.3 378.3 328.5 378.3 337.8 368.9C347.2 359.5 347.2 344.3 337.8 334.9C317.2 314.3 331.8 278.9 361.1 278.9C374.3 278.9 385.1 268.1 385.1 254.9C385.1 241.6 374.3 230.9 361.1 230.9C331.8 230.9 317.2 195.5 337.8 174.8C347.2 165.4 347.2 150.2 337.8 140.9C328.5 131.5 313.3 131.5 303.9 140.9C283.2 161.6 247.8 146.9 247.8 117.7C247.8 104.4 237.1 93.65 223.8 93.65C210.6 93.65 199.8 104.4 199.8 117.7H199.8z"],"square-xmark":[448,512,[10062,"times-square","xmark-square"],"f2d3","M384 32C419.3 32 448 60.65 448 96V416C448 451.3 419.3 480 384 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H384zM143 208.1L190.1 255.1L143 303C133.7 312.4 133.7 327.6 143 336.1C152.4 346.3 167.6 346.3 176.1 336.1L223.1 289.9L271 336.1C280.4 346.3 295.6 346.3 304.1 336.1C314.3 327.6 314.3 312.4 304.1 303L257.9 255.1L304.1 208.1C314.3 199.6 314.3 184.4 304.1 175C295.6 165.7 280.4 165.7 271 175L223.1 222.1L176.1 175C167.6 165.7 152.4 165.7 143 175C133.7 184.4 133.7 199.6 143 208.1V208.1z"],"staff-snake":[384,512,["rod-asclepius","rod-snake","staff-aesculapius"],"e579","M222.5 48H288C341 48 384 90.98 384 144C384 197 341 240 288 240H248V160H288C296.8 160 304 152.8 304 144C304 135.2 296.8 128 288 128H220L215.5 272H256C309 272 352 314.1 352 368C352 421 309 464 256 464H240V384H256C264.8 384 272 376.8 272 368C272 359.2 264.8 352 256 352H212.1L208.5 496C208.2 504.9 200.9 512 191.1 512C183.1 512 175.8 504.9 175.5 496L174.5 464H135.1C113.9 464 95.1 446.1 95.1 424C95.1 401.9 113.9 384 135.1 384H171.1L170.1 352H151.1C98.98 352 55.1 309 55.1 256C55.1 208.4 90.6 168.9 135.1 161.3V256C135.1 264.8 143.2 272 151.1 272H168.5L164 128H122.6C113.6 146.9 94.34 160 72 160H56C25.07 160 0 134.9 0 104C0 73.07 25.07 48 56 48H161.5L160.1 31.98C160.1 31.33 160.1 30.69 160.1 30.05C161.5 13.43 175.1 0 192 0C208.9 0 222.5 13.43 223 30.05C223 30.69 223 31.33 223 31.98L222.5 48zM79.1 96C79.1 87.16 72.84 80 63.1 80C55.16 80 47.1 87.16 47.1 96C47.1 104.8 55.16 112 63.1 112C72.84 112 79.1 104.8 79.1 96z"],stairs:[576,512,[],"e289","M576 64c0 17.67-14.31 32-32 32h-96v96c0 17.67-14.31 32-32 32h-96v96c0 17.67-14.31 32-32 32H192v96c0 17.67-14.31 32-32 32H32c-17.69 0-32-14.33-32-32s14.31-32 32-32h96v-96c0-17.67 14.31-32 32-32h96V192c0-17.67 14.31-32 32-32h96V64c0-17.67 14.31-32 32-32h128C561.7 32 576 46.33 576 64z"],stamp:[512,512,[],"f5bf","M366.2 256H400C461.9 256 512 306.1 512 368C512 388.9 498.6 406.7 480 413.3V464C480 490.5 458.5 512 432 512H80C53.49 512 32 490.5 32 464V413.3C13.36 406.7 0 388.9 0 368C0 306.1 50.14 256 112 256H145.8C175.7 256 200 231.7 200 201.8C200 184.3 190.8 168.5 180.1 154.8C167.5 138.5 160 118.1 160 96C160 42.98 202.1 0 256 0C309 0 352 42.98 352 96C352 118.1 344.5 138.5 331.9 154.8C321.2 168.5 312 184.3 312 201.8C312 231.7 336.3 256 366.2 256zM416 416H96V448H416V416z"],stapler:[640,512,[],"e5af","M640 299.3V432C640 458.5 618.5 480 592 480H64C46.33 480 32 465.7 32 448C32 430.3 46.33 416 64 416H448V368H96C78.33 368 64 353.7 64 336V219.4L33.8 214C14.24 210.5 0 193.5 0 173.7C0 164.8 2.878 156.2 8.201 149.1L43.83 101.6C76.67 57.77 128.2 32 182.9 32C209.9 32 236.6 38.29 260.7 50.36L586.9 213.5C619.5 229.7 640 262.1 640 299.3H640zM448 288L128 230.9V304H448V288z"],star:[576,512,[61446,11088],"f005","M381.2 150.3L524.9 171.5C536.8 173.2 546.8 181.6 550.6 193.1C554.4 204.7 551.3 217.3 542.7 225.9L438.5 328.1L463.1 474.7C465.1 486.7 460.2 498.9 450.2 506C440.3 513.1 427.2 514 416.5 508.3L288.1 439.8L159.8 508.3C149 514 135.9 513.1 126 506C116.1 498.9 111.1 486.7 113.2 474.7L137.8 328.1L33.58 225.9C24.97 217.3 21.91 204.7 25.69 193.1C29.46 181.6 39.43 173.2 51.42 171.5L195 150.3L259.4 17.97C264.7 6.954 275.9-.0391 288.1-.0391C300.4-.0391 311.6 6.954 316.9 17.97L381.2 150.3z"],"star-and-crescent":[512,512,[9770],"f699","M340.5 466.4c-1.5 0-6.875 .5-9.25 .5c-116.3 0-210.8-94.63-210.8-210.9s94.5-210.9 210.8-210.9c2.375 0 7.75 .5 9.25 .5c7.125 0 13.25-5 14.75-12c1.375-7.25-2.625-14.5-9.5-17.12c-29.13-11-59.38-16.5-89.75-16.5c-141.1 0-256 114.9-256 256s114.9 256 256 256c30.25 0 60.25-5.5 89.38-16.38c5.875-2 10.25-7.625 10.25-14.25C355.6 473.4 349.3 466.4 340.5 466.4zM503.5 213.9l-76.38-11.12L392.9 133.5C391.1 129.9 387.5 128 384 128c-3.5 0-7.125 1.875-9 5.5l-34.13 69.25l-76.38 11.12c-8.125 1.125-11.38 11.25-5.5 17l55.25 53.88l-13 76c-1.125 6.5 3.1 11.75 9.75 11.75c1.5 0 3.125-.375 4.625-1.25l68.38-35.88l68.25 35.88c1.625 .875 3.125 1.25 4.75 1.25c5.75 0 10.88-5.25 9.75-11.75l-13-76l55.25-53.88C514.9 225.1 511.6 214.1 503.5 213.9z"],"star-half":[576,512,[61731],"f089","M288 439.8L159.8 508.3C149 514 135.9 513.1 126 506C116.1 498.9 111.1 486.7 113.2 474.7L137.8 328.1L33.58 225.9C24.97 217.3 21.91 204.7 25.69 193.1C29.46 181.6 39.43 173.2 51.42 171.5L195 150.3L259.4 17.97C264.7 6.995 275.8 .0131 287.1-.0391L288 439.8zM433.2 512C432.1 512.1 431 512.1 429.9 512H433.2z"],"star-half-stroke":[576,512,["star-half-alt"],"f5c0","M463.1 474.7C465.1 486.7 460.2 498.9 450.2 506C440.3 513.1 427.2 514 416.5 508.3L288.1 439.8L159.8 508.3C149 514 135.9 513.1 126 506C116.1 498.9 111.1 486.7 113.2 474.7L137.8 328.1L33.58 225.9C24.97 217.3 21.91 204.7 25.69 193.1C29.46 181.6 39.43 173.2 51.42 171.5L195 150.3L259.4 17.97C264.7 6.954 275.9-.0391 288.1-.0391C300.4-.0391 311.6 6.954 316.9 17.97L381.2 150.3L524.9 171.5C536.8 173.2 546.8 181.6 550.6 193.1C554.4 204.7 551.3 217.3 542.7 225.9L438.5 328.1L463.1 474.7zM288 376.4L288.1 376.3L399.7 435.9L378.4 309.6L469.2 219.8L343.8 201.4L288.1 86.85L288 87.14V376.4z"],"star-of-david":[512,512,[10017],"f69a","M490.7 345.4L435.6 256l55.1-89.38c14.87-24.25-3.62-54.61-33.12-54.61l-110.6-.005l-57.87-93.1C281.7 6.003 268.9 0 256 0C243.1 0 230.3 6.003 222.9 18L165 112H54.39c-29.62 0-47.99 30.37-33.12 54.62L76.37 256l-55.1 89.38C6.4 369.6 24.77 399.1 54.39 399.1h110.6l57.87 93.1C230.3 505.1 243.1 512 256 512c12.88 0 25.74-6.002 33.12-18l57.83-93.1h110.7C487.2 399.1 505.6 369.6 490.7 345.4zM256 73.77l23.59 38.23H232.5L256 73.77zM89.48 343.1l20.59-33.35l20.45 33.35H89.48zM110 201.3L89.48 168h41.04L110 201.3zM256 438.2l-23.59-38.25h47.08L256 438.2zM313.9 343.1H198L143.8 256l54.22-87.1h116L368.3 256L313.9 343.1zM381.3 343.1l20.67-33.29l20.52 33.29H381.3zM401.1 201.3l-20.51-33.29h41.04L401.1 201.3z"],"star-of-life":[512,512,[],"f621","M489.1 363.3l-24.03 41.59c-6.635 11.48-21.33 15.41-32.82 8.78l-129.1-74.56V488c0 13.25-10.75 24-24.02 24H231.1c-13.27 0-24.02-10.75-24.02-24v-148.9L78.87 413.7c-11.49 6.629-26.19 2.698-32.82-8.78l-24.03-41.59c-6.635-11.48-2.718-26.14 8.774-32.77L159.9 256L30.8 181.5C19.3 174.8 15.39 160.2 22.02 148.7l24.03-41.59c6.635-11.48 21.33-15.41 32.82-8.781l129.1 74.56L207.1 24c0-13.25 10.75-24 24.02-24h48.04c13.27 0 24.02 10.75 24.02 24l.0005 148.9l129.1-74.56c11.49-6.629 26.19-2.698 32.82 8.78l24.02 41.59c6.637 11.48 2.718 26.14-8.774 32.77L352.1 256l129.1 74.53C492.7 337.2 496.6 351.8 489.1 363.3z"],"sterling-sign":[320,512,[163,"gbp","pound-sign"],"f154","M112 223.1H224C241.7 223.1 256 238.3 256 255.1C256 273.7 241.7 287.1 224 287.1H112V332.5C112 361.5 104.1 389.1 89.2 414.9L88.52 416H288C305.7 416 320 430.3 320 448C320 465.7 305.7 480 288 480H32C20.47 480 9.834 473.8 4.154 463.8C-1.527 453.7-1.371 441.4 4.56 431.5L34.32 381.9C43.27 367 48 349.9 48 332.5V288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H48V160.4C48 89.47 105.5 32 176.4 32C190.2 32 203.9 34.22 216.1 38.59L298.1 65.64C314.9 71.23 323.9 89.35 318.4 106.1C312.8 122.9 294.6 131.9 277.9 126.4L196.7 99.3C190.2 97.12 183.3 96 176.4 96C140.8 96 112 124.8 112 160.4V223.1z"],stethoscope:[576,512,[129658],"f0f1","M480 112c-44.18 0-80 35.82-80 80c0 32.84 19.81 60.98 48.11 73.31v78.7c0 57.25-50.25 104-112 104c-60 0-109.3-44.1-111.9-99.23C296.1 333.8 352 269.3 352 191.1V36.59c0-11.38-8.15-21.38-19.28-23.5L269.8 .4775c-13-2.625-25.54 5.766-28.16 18.77L238.4 34.99c-2.625 13 5.812 25.59 18.81 28.22l30.69 6.059L287.9 190.7c0 52.88-42.13 96.63-95.13 97.13c-53.38 .5-96.81-42.56-96.81-95.93L95.89 69.37l30.72-6.112c13-2.5 21.41-15.15 18.78-28.15L142.3 19.37c-2.5-13-15.15-21.41-28.15-18.78L51.28 12.99C40.15 15.24 32 25.09 32 36.59v155.4c0 77.25 55.11 142 128.1 156.8C162.7 439.3 240.6 512 336 512c97 0 176-75.37 176-168V265.3c28.23-12.36 48-40.46 48-73.25C560 147.8 524.2 112 480 112zM480 216c-13.25 0-24-10.75-24-24S466.7 168 480 168S504 178.7 504 192S493.3 216 480 216z"],stop:[384,512,[9209],"f04d","M384 128v255.1c0 35.35-28.65 64-64 64H64c-35.35 0-64-28.65-64-64V128c0-35.35 28.65-64 64-64H320C355.3 64 384 92.65 384 128z"],stopwatch:[448,512,[9201],"f2f2","M272 0C289.7 0 304 14.33 304 32C304 49.67 289.7 64 272 64H256V98.45C293.5 104.2 327.7 120 355.7 143L377.4 121.4C389.9 108.9 410.1 108.9 422.6 121.4C435.1 133.9 435.1 154.1 422.6 166.6L398.5 190.8C419.7 223.3 432 262.2 432 304C432 418.9 338.9 512 224 512C109.1 512 16 418.9 16 304C16 200 92.32 113.8 192 98.45V64H176C158.3 64 144 49.67 144 32C144 14.33 158.3 0 176 0L272 0zM248 192C248 178.7 237.3 168 224 168C210.7 168 200 178.7 200 192V320C200 333.3 210.7 344 224 344C237.3 344 248 333.3 248 320V192z"],"stopwatch-20":[448,512,[],"e06f","M276 256C276 249.4 281.4 244 288 244C294.6 244 300 249.4 300 256V352C300 358.6 294.6 364 288 364C281.4 364 276 358.6 276 352V256zM272 0C289.7 0 304 14.33 304 32C304 49.67 289.7 64 272 64H256V98.45C293.5 104.2 327.7 120 355.7 143L377.4 121.4C389.9 108.9 410.1 108.9 422.6 121.4C435.1 133.9 435.1 154.1 422.6 166.6L398.5 190.8C419.7 223.3 432 262.2 432 304C432 418.9 338.9 512 224 512C109.1 512 16 418.9 16 304C16 200 92.32 113.8 192 98.45V64H176C158.3 64 144 49.67 144 32C144 14.33 158.3 0 176 0L272 0zM288 204C259.3 204 236 227.3 236 256V352C236 380.7 259.3 404 288 404C316.7 404 340 380.7 340 352V256C340 227.3 316.7 204 288 204zM172 256.5V258.8C172 262.4 170.7 265.9 168.3 268.6L129.2 312.5C115.5 327.9 108 347.8 108 368.3V384C108 395 116.1 404 128 404H192C203 404 212 395 212 384C212 372.1 203 364 192 364H148.2C149.1 354.8 152.9 346.1 159.1 339.1L198.2 295.2C207.1 285.1 211.1 272.2 211.1 258.8V256.5C211.1 227.5 188.5 204 159.5 204C136.8 204 116.8 218.5 109.6 239.9L109 241.7C105.5 252.2 111.2 263.5 121.7 266.1C132.2 270.5 143.5 264.8 146.1 254.3L147.6 252.6C149.3 247.5 154.1 244 159.5 244C166.4 244 171.1 249.6 171.1 256.5L172 256.5z"],store:[576,512,[],"f54e","M495.5 223.2C491.6 223.7 487.6 224 483.4 224C457.4 224 434.2 212.6 418.3 195C402.4 212.6 379.2 224 353.1 224C327 224 303.8 212.6 287.9 195C272 212.6 248.9 224 222.7 224C196.7 224 173.5 212.6 157.6 195C141.7 212.6 118.5 224 92.36 224C88.3 224 84.21 223.7 80.24 223.2C24.92 215.8-1.255 150.6 28.33 103.8L85.66 13.13C90.76 4.979 99.87 0 109.6 0H466.4C476.1 0 485.2 4.978 490.3 13.13L547.6 103.8C577.3 150.7 551 215.8 495.5 223.2H495.5zM499.7 254.9C503.1 254.4 508 253.6 512 252.6V448C512 483.3 483.3 512 448 512H128C92.66 512 64 483.3 64 448V252.6C67.87 253.6 71.86 254.4 75.97 254.9L76.09 254.9C81.35 255.6 86.83 256 92.36 256C104.8 256 116.8 254.1 128 250.6V384H448V250.7C459.2 254.1 471.1 256 483.4 256C489 256 494.4 255.6 499.7 254.9L499.7 254.9z"],"store-slash":[640,512,[],"e071","M94.92 49.09L117.7 13.13C122.8 4.98 131.9 .0007 141.6 .0007H498.4C508.1 .0007 517.2 4.979 522.3 13.13L579.6 103.8C609.3 150.7 583 215.8 527.5 223.2C523.6 223.7 519.6 224 515.4 224C489.4 224 466.2 212.6 450.3 195C434.4 212.6 411.2 224 385.1 224C359 224 335.8 212.6 319.9 195C314.4 201.1 308.1 206.4 301.2 210.7L480 350.9V250.7C491.2 254.1 503.1 256 515.4 256C521 256 526.4 255.6 531.7 254.9L531.7 254.9C535.1 254.4 540 253.6 544 252.6V401.1L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L94.92 49.09zM112.2 223.2C68.36 217.3 42.82 175.1 48.9 134.5L155.3 218.4C145.7 222 135.3 224 124.4 224C120.3 224 116.2 223.7 112.2 223.2V223.2zM160 384H365.5L514.9 501.7C504.8 508.2 492.9 512 480 512H160C124.7 512 96 483.3 96 448V252.6C99.87 253.6 103.9 254.4 107.1 254.9L108.1 254.9C113.3 255.6 118.8 256 124.4 256C136.8 256 148.8 254.1 160 250.6V384z"],"street-view":[512,512,[],"f21d","M320 64C320 99.35 291.3 128 256 128C220.7 128 192 99.35 192 64C192 28.65 220.7 0 256 0C291.3 0 320 28.65 320 64zM288 160C323.3 160 352 188.7 352 224V272C352 289.7 337.7 304 320 304H318.2L307.2 403.5C305.4 419.7 291.7 432 275.4 432H236.6C220.3 432 206.6 419.7 204.8 403.5L193.8 304H192C174.3 304 160 289.7 160 272V224C160 188.7 188.7 160 224 160H288zM63.27 414.7C60.09 416.3 57.47 417.8 55.33 419.2C51.7 421.6 51.72 426.4 55.34 428.8C64.15 434.6 78.48 440.6 98.33 446.1C137.7 456.1 193.5 464 256 464C318.5 464 374.3 456.1 413.7 446.1C433.5 440.6 447.9 434.6 456.7 428.8C460.3 426.4 460.3 421.6 456.7 419.2C454.5 417.8 451.9 416.3 448.7 414.7C433.4 406.1 409.9 399.8 379.7 394.2C366.6 391.8 358 379.3 360.4 366.3C362.8 353.3 375.3 344.6 388.3 347C420.8 352.9 449.2 361.2 470.3 371.8C480.8 377.1 490.6 383.5 498 391.4C505.6 399.5 512 410.5 512 424C512 445.4 496.5 460.1 482.9 469C468.2 478.6 448.6 486.3 426.4 492.4C381.8 504.7 321.6 512 256 512C190.4 512 130.2 504.7 85.57 492.4C63.44 486.3 43.79 478.6 29.12 469C15.46 460.1 0 445.4 0 424C0 410.5 6.376 399.5 13.96 391.4C21.44 383.5 31.24 377.1 41.72 371.8C62.75 361.2 91.24 352.9 123.7 347C136.7 344.6 149.2 353.3 151.6 366.3C153.1 379.3 145.4 391.8 132.3 394.2C102.1 399.8 78.57 406.1 63.27 414.7H63.27z"],strikethrough:[512,512,[],"f0cc","M332.2 319.9c17.22 12.17 22.33 26.51 18.61 48.21c-3.031 17.59-10.88 29.34-24.72 36.99c-35.44 19.75-108.5 11.96-186-19.68c-16.34-6.686-35.03 1.156-41.72 17.53s1.188 35.05 17.53 41.71c31.75 12.93 95.69 35.37 157.6 35.37c29.62 0 58.81-5.156 83.72-18.96c30.81-17.09 50.44-45.46 56.72-82.11c3.998-23.27 2.168-42.58-3.488-59.05H332.2zM488 239.9l-176.5-.0309c-15.85-5.613-31.83-10.34-46.7-14.62c-85.47-24.62-110.9-39.05-103.7-81.33c2.5-14.53 10.16-25.96 22.72-34.03c20.47-13.15 64.06-23.84 155.4 .3438c17.09 4.531 34.59-5.654 39.13-22.74c4.531-17.09-5.656-34.59-22.75-39.12c-91.31-24.18-160.7-21.62-206.3 7.654C121.8 73.72 103.6 101.1 98.09 133.1C89.26 184.5 107.9 217.3 137.2 239.9L24 239.9c-13.25 0-24 10.75-24 23.1c0 13.25 10.75 23.1 24 23.1h464c13.25 0 24-10.75 24-23.1C512 250.7 501.3 239.9 488 239.9z"],stroopwafel:[512,512,[],"f551","M188.1 210.8l-45.25 45.25l45.25 45.25l45.25-45.25L188.1 210.8zM301.2 188.1l-45.25-45.25L210.7 188.1l45.25 45.25L301.2 188.1zM210.7 323.9l45.25 45.25l45.25-45.25L255.1 278.6L210.7 323.9zM256 16c-132.5 0-240 107.5-240 240s107.5 240 240 240s240-107.5 240-240S388.5 16 256 16zM442.6 295.6l-11.25 11.25c-3.125 3.125-8.25 3.125-11.38 0L391.8 278.6l-45.25 45.25l34 33.88l16.88-16.88c3.125-3.125 8.251-3.125 11.38 0l11.25 11.25c3.125 3.125 3.125 8.25 0 11.38l-16.88 16.88l16.88 17c3.125 3.125 3.125 8.25 0 11.38l-11.25 11.25c-3.125 3.125-8.251 3.125-11.38 0l-16.88-17l-17 17c-3.125 3.125-8.25 3.125-11.38 0l-11.25-11.25c-3.125-3.125-3.125-8.25 0-11.38l17-17l-34-33.88l-45.25 45.25l28.25 28.25c3.125 3.125 3.125 8.25 0 11.38l-11.25 11.25c-3.125 3.125-8.25 3.125-11.38 0l-28.25-28.25L227.7 442.6c-3.125 3.125-8.25 3.125-11.38 0l-11.25-11.25c-3.125-3.125-3.125-8.25 0-11.38l28.25-28.25l-45.25-45.25l-33.88 34l16.88 16.88c3.125 3.125 3.125 8.25 0 11.38l-11.25 11.25c-3.125 3.125-8.25 3.125-11.38 0L131.6 403.1l-16.1 16.88c-3.125 3.125-8.25 3.125-11.38 0l-11.25-11.25c-3.125-3.125-3.125-8.25 0-11.38l17-16.88l-17-17c-3.125-3.125-3.125-8.25 0-11.38l11.25-11.25c3.125-3.125 8.25-3.125 11.38 0l16.1 17l33.88-34L120.2 278.6l-28.25 28.25c-3.125 3.125-8.25 3.125-11.38 0L69.37 295.6c-3.125-3.125-3.125-8.25 0-11.38l28.25-28.25l-28.25-28.25c-3.125-3.125-3.125-8.25 0-11.38l11.25-11.25c3.125-3.125 8.25-3.125 11.38 0l28.25 28.25l45.25-45.25l-34-34l-16.88 17c-3.125 3.125-8.25 3.125-11.38 0l-11.25-11.25c-3.125-3.125-3.125-8.25 0-11.38l16.88-17l-16.88-16.88c-3.125-3.125-3.125-8.25 0-11.38l11.25-11.25c3.125-3.125 8.25-3.125 11.38 0l16.88 17l17-17c3.125-3.125 8.25-3.125 11.38 0l11.25 11.25c3.125 3.125 3.125 8.25 0 11.38l-17 16.88l34 34l45.25-45.25L205.1 92c-3.125-3.125-3.125-8.25 0-11.38l11.25-11.25c3.125-3.125 8.25-3.125 11.38 0l28.25 28.25l28.25-28.25c3.125-3.125 8.25-3.125 11.38 0l11.25 11.25c3.125 3.125 3.125 8.25 0 11.38l-28.25 28.25l45.25 45.25l34-34l-17-16.88c-3.125-3.125-3.125-8.25 0-11.38l11.25-11.25c3.125-3.125 8.25-3.125 11.38 0l17 16.88l16.88-16.88c3.125-3.125 8.251-3.125 11.38 0l11.25 11.25c3.125 3.125 3.125 8.25 0 11.38l-17 16.88l17 17c3.125 3.125 3.125 8.25 0 11.38l-11.25 11.25c-3.125 3.125-8.251 3.125-11.38 0l-16.88-17l-34 34l45.25 45.25l28.25-28.25c3.125-3.125 8.25-3.125 11.38 0l11.25 11.25c3.125 3.125 3.125 8.25 0 11.38l-28.25 28.25l28.25 28.25C445.7 287.4 445.7 292.5 442.6 295.6zM278.6 256l45.25 45.25l45.25-45.25l-45.25-45.25L278.6 256z"],subscript:[512,512,[],"f12c","M480 448v-128c0-11.09-5.75-21.38-15.17-27.22c-9.422-5.875-21.25-6.344-31.14-1.406l-32 16c-15.81 7.906-22.22 27.12-14.31 42.94c5.609 11.22 16.89 17.69 28.62 17.69v80c-17.67 0-32 14.31-32 32s14.33 32 32 32h64c17.67 0 32-14.31 32-32S497.7 448 480 448zM320 128c17.67 0 32-14.31 32-32s-14.33-32-32-32l-32-.0024c-10.44 0-20.23 5.101-26.22 13.66L176 200.2L90.22 77.67C84.23 69.11 74.44 64.01 64 64.01L32 64.01c-17.67 0-32 14.32-32 32s14.33 32 32 32h15.34L136.9 256l-89.6 128H32c-17.67 0-32 14.31-32 32s14.33 31.1 32 31.1l32-.0024c10.44 0 20.23-5.086 26.22-13.65L176 311.8l85.78 122.5C267.8 442.9 277.6 448 288 448l32 .0024c17.67 0 32-14.31 32-31.1s-14.33-32-32-32h-15.34l-89.6-128l89.6-127.1H320z"],suitcase:[512,512,[129523],"f0f2","M128 56C128 25.07 153.1 0 184 0H328C358.9 0 384 25.07 384 56V480H128V56zM176 96H336V56C336 51.58 332.4 48 328 48H184C179.6 48 176 51.58 176 56V96zM64 96H96V480H64C28.65 480 0 451.3 0 416V160C0 124.7 28.65 96 64 96zM448 480H416V96H448C483.3 96 512 124.7 512 160V416C512 451.3 483.3 480 448 480z"],"suitcase-medical":[512,512,["medkit"],"f0fa","M0 144v288C0 457.6 22.41 480 48 480H64V96H48C22.41 96 0 118.4 0 144zM464 96H448v384h16c25.59 0 48-22.41 48-48v-288C512 118.4 489.6 96 464 96zM384 48C384 22.41 361.6 0 336 0h-160C150.4 0 128 22.41 128 48V96H96v384h320V96h-32V48zM176 48h160V96h-160V48zM352 312C352 316.4 348.4 320 344 320H288v56c0 4.375-3.625 8-8 8h-48C227.6 384 224 380.4 224 376V320H168C163.6 320 160 316.4 160 312v-48C160 259.6 163.6 256 168 256H224V200C224 195.6 227.6 192 232 192h48C284.4 192 288 195.6 288 200V256h56C348.4 256 352 259.6 352 264V312z"],"suitcase-rolling":[448,512,[],"f5c1","M368 128h-47.95l.0123-80c0-26.5-21.5-48-48-48h-96c-26.5 0-48 21.5-48 48L128 128H80C53.5 128 32 149.5 32 176v256C32 458.5 53.5 480 80 480h16.05L96 496C96 504.9 103.1 512 112 512h32C152.9 512 160 504.9 160 496L160.1 480h128L288 496c0 8.875 7.125 16 16 16h32c8.875 0 16-7.125 16-16l.0492-16H368c26.5 0 48-21.5 48-48v-256C416 149.5 394.5 128 368 128zM176.1 48h96V128h-96V48zM336 384h-224C103.2 384 96 376.8 96 368C96 359.2 103.2 352 112 352h224c8.801 0 16 7.199 16 16C352 376.8 344.8 384 336 384zM336 256h-224C103.2 256 96 248.8 96 240C96 231.2 103.2 224 112 224h224C344.8 224 352 231.2 352 240C352 248.8 344.8 256 336 256z"],sun:[512,512,[9728],"f185","M256 159.1c-53.02 0-95.1 42.98-95.1 95.1S202.1 351.1 256 351.1s95.1-42.98 95.1-95.1S309 159.1 256 159.1zM509.3 347L446.1 255.1l63.15-91.01c6.332-9.125 1.104-21.74-9.826-23.72l-109-19.7l-19.7-109c-1.975-10.93-14.59-16.16-23.72-9.824L256 65.89L164.1 2.736c-9.125-6.332-21.74-1.107-23.72 9.824L121.6 121.6L12.56 141.3C1.633 143.2-3.596 155.9 2.736 164.1L65.89 256l-63.15 91.01c-6.332 9.125-1.105 21.74 9.824 23.72l109 19.7l19.7 109c1.975 10.93 14.59 16.16 23.72 9.824L256 446.1l91.01 63.15c9.127 6.334 21.75 1.107 23.72-9.822l19.7-109l109-19.7C510.4 368.8 515.6 356.1 509.3 347zM256 383.1c-70.69 0-127.1-57.31-127.1-127.1c0-70.69 57.31-127.1 127.1-127.1s127.1 57.3 127.1 127.1C383.1 326.7 326.7 383.1 256 383.1z"],"sun-plant-wilt":[640,512,[],"e57a","M192 160C192 177.7 177.7 192 160 192C142.3 192 128 177.7 128 160C128 142.3 142.3 128 160 128C177.7 128 192 142.3 192 160zM160 0C166.3 0 172 3.708 174.6 9.467L199.4 64.89L256.1 43.23C262 40.98 268.7 42.4 273.1 46.86C277.6 51.32 279 57.99 276.8 63.88L255.1 120.6L310.5 145.4C316.3 147.1 320 153.7 320 160C320 166.3 316.3 172 310.5 174.6L255.1 199.4L276.8 256.1C279 262 277.6 268.7 273.1 273.1C268.7 277.6 262 279 256.1 276.8L199.4 255.1L174.6 310.5C172 316.3 166.3 320 160 320C153.7 320 147.1 316.3 145.4 310.5L120.6 255.1L63.88 276.8C57.99 279 51.32 277.6 46.86 273.1C42.4 268.7 40.98 262 43.23 256.1L64.89 199.4L9.467 174.6C3.708 172 0 166.3 0 160C0 153.7 3.708 147.1 9.467 145.4L64.89 120.6L43.23 63.88C40.98 57.99 42.4 51.32 46.86 46.86C51.32 42.4 57.99 40.98 63.88 43.23L120.6 64.89L145.4 9.467C147.1 3.708 153.7 0 160 0V0zM160 224C195.3 224 224 195.3 224 160C224 124.7 195.3 96 160 96C124.7 96 96 124.7 96 160C96 195.3 124.7 224 160 224zM504 448H608C625.7 448 640 462.3 640 480C640 497.7 625.7 512 608 512H32C14.33 512 .0003 497.7 .0003 480C.0003 462.3 14.33 448 32 448H456V272C456 254.3 441.7 240 424 240C406.3 240 392 254.3 392 272V293.4C406.8 301.1 416 316.5 416 338C416 357.3 394.5 390.1 368 416C341.5 390.1 320 357.6 320 338C320 316.5 329.2 301.1 344 293.4V271.1C344 227.8 379.8 191.1 424 191.1C435.4 191.1 446.2 194.4 456 198.7V175.1C456 131.8 491.8 95.1 536 95.1C580.2 95.1 616 131.8 616 175.1V229.4C630.8 237.1 640 252.5 640 274C640 293.3 618.5 326.1 592 352C565.5 326.1 544 293.6 544 274C544 252.5 553.2 237.1 568 229.4V175.1C568 158.3 553.7 143.1 536 143.1C518.3 143.1 504 158.3 504 175.1V448z"],superscript:[512,512,[],"f12b","M480 160v-128c0-11.09-5.75-21.37-15.17-27.22C455.4-1.048 443.6-1.548 433.7 3.39l-32 16c-15.81 7.906-22.22 27.12-14.31 42.94C392.1 73.55 404.3 80.01 416 80.01v80c-17.67 0-32 14.31-32 32s14.33 32 32 32h64c17.67 0 32-14.31 32-32S497.7 160 480 160zM320 128c17.67 0 32-14.31 32-32s-14.33-32-32-32l-32-.0024c-10.44 0-20.23 5.101-26.22 13.66L176 200.2L90.22 77.67C84.23 69.11 74.44 64.01 64 64.01L32 64.01c-17.67 0-32 14.32-32 32s14.33 32 32 32h15.34L136.9 256l-89.6 128H32c-17.67 0-32 14.31-32 32s14.33 31.1 32 31.1l32-.0024c10.44 0 20.23-5.086 26.22-13.65L176 311.8l85.78 122.5C267.8 442.9 277.6 448 288 448l32 .0024c17.67 0 32-14.31 32-31.1s-14.33-32-32-32h-15.34l-89.6-128l89.6-127.1H320z"],swatchbook:[512,512,[],"f5c3","M0 32C0 14.33 14.33 0 32 0H160C177.7 0 192 14.33 192 32V416C192 469 149 512 96 512C42.98 512 0 469 0 416V32zM128 64H64V128H128V64zM64 256H128V192H64V256zM96 440C109.3 440 120 429.3 120 416C120 402.7 109.3 392 96 392C82.75 392 72 402.7 72 416C72 429.3 82.75 440 96 440zM224 416V154L299.4 78.63C311.9 66.13 332.2 66.13 344.7 78.63L435.2 169.1C447.7 181.6 447.7 201.9 435.2 214.4L223.6 425.9C223.9 422.7 224 419.3 224 416V416zM374.8 320H480C497.7 320 512 334.3 512 352V480C512 497.7 497.7 512 480 512H182.8L374.8 320z"],synagogue:[640,512,[128333],"f69b","M309.8 3.708C315.7-1.236 324.3-1.236 330.2 3.708L451.2 104.5C469.5 119.7 480 142.2 480 165.1V512H384V384C384 348.7 355.3 320 320 320C284.7 320 256 348.7 256 384V512H160V165.1C160 142.2 170.5 119.7 188.8 104.5L309.8 3.708zM326.1 124.3C323.9 118.9 316.1 118.9 313 124.3L297.2 152.4L264.9 152.1C258.7 152.1 254.8 158.8 257.9 164.2L274.3 191.1L257.9 219.8C254.8 225.2 258.7 231.9 264.9 231.9L297.2 231.6L313 259.7C316.1 265.1 323.9 265.1 326.1 259.7L342.8 231.6L375.1 231.9C381.3 231.9 385.2 225.2 382.1 219.8L365.7 191.1L382.1 164.2C385.2 158.8 381.3 152.1 375.1 152.1L342.8 152.4L326.1 124.3zM512 244.5L540.1 213.3C543.1 209.9 547.5 208 552 208C556.5 208 560.9 209.9 563.9 213.3L627.7 284.2C635.6 292.1 640 304.4 640 316.3V448C640 483.3 611.3 512 576 512H512V244.5zM128 244.5V512H64C28.65 512 0 483.3 0 448V316.3C0 304.4 4.389 292.1 12.32 284.2L76.11 213.3C79.14 209.9 83.46 208 88 208C92.54 208 96.86 209.9 99.89 213.3L128 244.5z"],syringe:[512,512,[128137],"f48e","M504.1 71.03l-64-64c-9.375-9.375-24.56-9.375-33.94 0s-9.375 24.56 0 33.94L422.1 56L384 94.06l-55.03-55.03c-9.375-9.375-24.56-9.375-33.94 0c-8.467 8.467-8.873 21.47-2.047 30.86l149.1 149.1C446.3 222.1 451.1 224 456 224c6.141 0 12.28-2.344 16.97-7.031c9.375-9.375 9.375-24.56 0-33.94L417.9 128L456 89.94l15.03 15.03C475.7 109.7 481.9 112 488 112s12.28-2.344 16.97-7.031C514.3 95.59 514.3 80.41 504.1 71.03zM208.8 154.1l58.56 58.56c6.25 6.25 6.25 16.38 0 22.62C264.2 238.4 260.1 240 256 240S247.8 238.4 244.7 235.3L186.1 176.8L144.8 218.1l58.56 58.56c6.25 6.25 6.25 16.38 0 22.62C200.2 302.4 196.1 304 192 304S183.8 302.4 180.7 299.3L122.1 240.8L82.75 280.1C70.74 292.1 64 308.4 64 325.4v88.68l-56.97 56.97c-9.375 9.375-9.375 24.56 0 33.94C11.72 509.7 17.86 512 24 512s12.28-2.344 16.97-7.031L97.94 448h88.69c16.97 0 33.25-6.744 45.26-18.75l187.6-187.6l-149.1-149.1L208.8 154.1z"],t:[384,512,[116],"54","M384 64.01c0 17.67-14.33 32-32 32h-128v352c0 17.67-14.33 31.99-32 31.99s-32-14.32-32-31.99v-352H32c-17.67 0-32-14.33-32-32s14.33-32 32-32h320C369.7 32.01 384 46.34 384 64.01z"],table:[512,512,[],"f0ce","M448 32C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM224 256V160H64V256H224zM64 320V416H224V320H64zM288 416H448V320H288V416zM448 256V160H288V256H448z"],"table-cells":[512,512,["th"],"f00a","M448 32C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM152 96H64V160H152V96zM208 160H296V96H208V160zM448 96H360V160H448V96zM64 288H152V224H64V288zM296 224H208V288H296V224zM360 288H448V224H360V288zM152 352H64V416H152V352zM208 416H296V352H208V416zM448 352H360V416H448V352z"],"table-cells-large":[512,512,["th-large"],"f009","M448 32C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM448 96H288V224H448V96zM448 288H288V416H448V288zM224 224V96H64V224H224zM64 416H224V288H64V416z"],"table-columns":[512,512,["columns"],"f0db","M0 96C0 60.65 28.65 32 64 32H448C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96zM64 416H224V160H64V416zM448 160H288V416H448V160z"],"table-list":[512,512,["th-list"],"f00b","M0 96C0 60.65 28.65 32 64 32H448C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96zM64 160H128V96H64V160zM448 96H192V160H448V96zM64 288H128V224H64V288zM448 224H192V288H448V224zM64 416H128V352H64V416zM448 352H192V416H448V352z"],"table-tennis-paddle-ball":[512,512,[127955,"ping-pong-paddle-ball","table-tennis"],"f45d","M416 287.1c27.99 0 53.68 9.254 74.76 24.51c14.03-29.82 21.06-62.13 21.06-94.43c0-103.1-79.37-218.1-216.5-218.1c-59.94 0-120.4 23.71-165.5 68.95l-54.66 54.8C73.61 125.3 72.58 126.1 71.14 128.5l230.7 230.7C322.8 317.2 365.8 287.1 416 287.1zM290.3 392.1l-238.6-238.6C38.74 176.2 32.3 199.4 32.3 221.9c0 30.53 11.71 59.94 34.29 82.58l36.6 36.7l-92.38 81.32c-7.177 6.255-10.81 15.02-10.81 23.81c0 8.027 3.032 16.07 9.164 22.24l34.05 34.2c6.145 6.16 14.16 9.205 22.15 9.205c8.749 0 17.47-3.649 23.7-10.86l81.03-92.85l35.95 36.04c23.62 23.68 54.41 35.23 85.37 35.23c4.532 0 9.205-.2677 13.72-.7597c-10.56-18.61-17.12-39.89-17.12-62.81C288 408.1 288.1 400.5 290.3 392.1zM415.1 320c-52.99 0-95.99 42.1-95.99 95.1c0 52.1 42.99 95.99 95.99 95.99c52.1 0 95.99-42.1 95.99-95.99C511.1 363 468.1 320 415.1 320z"],tablet:[448,512,["tablet-android"],"f3fb","M384 0H64C28.65 0 0 28.65 0 64v384c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V64C448 28.65 419.3 0 384 0zM288 447.1C288 456.8 280.8 464 272 464H175.1C167.2 464 160 456.8 160 448S167.2 432 175.1 432h96C280.8 432 288 439.2 288 447.1z"],"tablet-button":[448,512,[],"f10a","M384 0H64C28.65 0 0 28.65 0 64v384c0 35.35 28.65 64 64 64h320c35.35 0 64-28.65 64-64V64C448 28.65 419.3 0 384 0zM224 464c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S241.8 464 224 464z"],"tablet-screen-button":[448,512,["tablet-alt"],"f3fa","M384 .0001H64c-35.35 0-64 28.65-64 64v384c0 35.35 28.65 63.1 64 63.1h320c35.35 0 64-28.65 64-63.1v-384C448 28.65 419.3 .0001 384 .0001zM224 480c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S241.8 480 224 480zM384 384H64v-320h320V384z"],tablets:[640,512,[],"f490","M159.1 191.1c-81.1 0-147.5 58.51-159.9 134.8C-.7578 331.5 3.367 336 8.365 336h303.3c4.998 0 8.996-4.5 8.248-9.25C307.4 250.5 241.1 191.1 159.1 191.1zM311.5 368H8.365c-4.998 0-9.123 4.5-8.248 9.25C12.49 453.5 78.88 512 159.1 512s147.4-58.5 159.8-134.8C320.7 372.5 316.5 368 311.5 368zM362.9 65.74c-3.502-3.502-9.504-3.252-12.25 .75c-45.52 62.76-40.52 150.4 15.88 206.9c56.52 56.51 144.2 61.39 206.1 15.88c4.002-2.875 4.252-8.877 .75-12.25L362.9 65.74zM593.4 46.61c-56.52-56.51-144.2-61.39-206.1-16c-4.002 2.877-4.252 8.877-.75 12.25l211.3 211.4c3.5 3.502 9.504 3.252 12.25-.75C654.8 190.8 649.9 103.1 593.4 46.61z"],"tachograph-digital":[640,512,["digital-tachograph"],"f566","M576 64H64C28.8 64 0 92.8 0 128v256c0 35.2 28.8 64 64 64h512c35.2 0 64-28.8 64-64V128C640 92.8 611.2 64 576 64zM64 296C64 291.6 67.63 288 72 288h16C92.38 288 96 291.6 96 296v16C96 316.4 92.38 320 88 320h-16C67.63 320 64 316.4 64 312V296zM336 384h-256C71.2 384 64 376.8 64 368C64 359.2 71.2 352 79.1 352h256c8.801 0 16 7.199 16 16C352 376.8 344.8 384 336 384zM128 312v-16C128 291.6 131.6 288 136 288h16C156.4 288 160 291.6 160 296v16C160 316.4 156.4 320 152 320h-16C131.6 320 128 316.4 128 312zM192 312v-16C192 291.6 195.6 288 200 288h16C220.4 288 224 291.6 224 296v16C224 316.4 220.4 320 216 320h-16C195.6 320 192 316.4 192 312zM256 312v-16C256 291.6 259.6 288 264 288h16C284.4 288 288 291.6 288 296v16C288 316.4 284.4 320 280 320h-16C259.6 320 256 316.4 256 312zM352 312C352 316.4 348.4 320 344 320h-16C323.6 320 320 316.4 320 312v-16C320 291.6 323.6 288 328 288h16C348.4 288 352 291.6 352 296V312zM352 237.7C352 247.9 344.4 256 334.9 256H81.07C71.6 256 64 247.9 64 237.7V146.3C64 136.1 71.6 128 81.07 128h253.9C344.4 128 352 136.1 352 146.3V237.7zM560 384h-160c-8.801 0-16-7.201-16-16c0-8.801 7.199-16 16-16h160c8.801 0 16 7.199 16 16C576 376.8 568.8 384 560 384z"],tag:[448,512,[127991],"f02b","M48 32H197.5C214.5 32 230.7 38.74 242.7 50.75L418.7 226.7C443.7 251.7 443.7 292.3 418.7 317.3L285.3 450.7C260.3 475.7 219.7 475.7 194.7 450.7L18.75 274.7C6.743 262.7 0 246.5 0 229.5V80C0 53.49 21.49 32 48 32L48 32zM112 176C129.7 176 144 161.7 144 144C144 126.3 129.7 112 112 112C94.33 112 80 126.3 80 144C80 161.7 94.33 176 112 176z"],tags:[512,512,[],"f02c","M472.8 168.4C525.1 221.4 525.1 306.6 472.8 359.6L360.8 472.9C351.5 482.3 336.3 482.4 326.9 473.1C317.4 463.8 317.4 448.6 326.7 439.1L438.6 325.9C472.5 291.6 472.5 236.4 438.6 202.1L310.9 72.87C301.5 63.44 301.6 48.25 311.1 38.93C320.5 29.61 335.7 29.7 344.1 39.13L472.8 168.4zM.0003 229.5V80C.0003 53.49 21.49 32 48 32H197.5C214.5 32 230.7 38.74 242.7 50.75L410.7 218.7C435.7 243.7 435.7 284.3 410.7 309.3L277.3 442.7C252.3 467.7 211.7 467.7 186.7 442.7L18.75 274.7C6.743 262.7 0 246.5 0 229.5L.0003 229.5zM112 112C94.33 112 80 126.3 80 144C80 161.7 94.33 176 112 176C129.7 176 144 161.7 144 144C144 126.3 129.7 112 112 112z"],tape:[576,512,[],"f4db","M288 256C288 291.3 259.3 320 224 320C188.7 320 160 291.3 160 256C160 220.7 188.7 192 224 192C259.3 192 288 220.7 288 256zM544 416C561.7 416 576 430.3 576 448C576 465.7 561.7 480 544 480H224C100.3 480 0 379.7 0 256C0 132.3 100.3 32 224 32C347.7 32 448 132.3 448 256C448 318.7 422.3 375.3 380.8 416H544zM224 352C277 352 320 309 320 256C320 202.1 277 160 224 160C170.1 160 128 202.1 128 256C128 309 170.1 352 224 352z"],tarp:[576,512,[],"e57b","M576 288H448C430.3 288 416 302.3 416 320V448H64C28.65 448 0 419.3 0 384V128C0 92.65 28.65 64 64 64H512C547.3 64 576 92.65 576 128V288zM96 192C113.7 192 128 177.7 128 160C128 142.3 113.7 128 96 128C78.33 128 64 142.3 64 160C64 177.7 78.33 192 96 192zM448 448V320H576L448 448z"],"tarp-droplet":[576,512,[],"e57c","M224 100C224 75.95 257.7 29.93 276.2 6.49C282.3-1.226 293.7-1.226 299.8 6.49C318.3 29.93 352 75.95 352 100C352 133.1 323.3 160 288 160C252.7 160 224 133.1 224 100V100zM64 128H197.5C210.6 165.3 246.2 192 288 192C329.8 192 365.4 165.3 378.5 128H512C547.3 128 576 156.7 576 192V352H448C430.3 352 416 366.3 416 384V512H64C28.65 512 0 483.3 0 448V192C0 156.7 28.65 128 64 128V128zM96 256C113.7 256 128 241.7 128 224C128 206.3 113.7 192 96 192C78.33 192 64 206.3 64 224C64 241.7 78.33 256 96 256zM448 512V384H576L448 512z"],taxi:[576,512,[128662,"cab"],"f1ba","M352 0C369.7 0 384 14.33 384 32V64L384 64.15C422.6 66.31 456.3 91.49 469.2 128.3L504.4 228.8C527.6 238.4 544 261.3 544 288V480C544 497.7 529.7 512 512 512H480C462.3 512 448 497.7 448 480V432H128V480C128 497.7 113.7 512 96 512H64C46.33 512 32 497.7 32 480V288C32 261.3 48.36 238.4 71.61 228.8L106.8 128.3C119.7 91.49 153.4 66.31 192 64.15L192 64V32C192 14.33 206.3 0 224 0L352 0zM197.4 128C183.8 128 171.7 136.6 167.2 149.4L141.1 224H434.9L408.8 149.4C404.3 136.6 392.2 128 378.6 128H197.4zM128 352C145.7 352 160 337.7 160 320C160 302.3 145.7 288 128 288C110.3 288 96 302.3 96 320C96 337.7 110.3 352 128 352zM448 288C430.3 288 416 302.3 416 320C416 337.7 430.3 352 448 352C465.7 352 480 337.7 480 320C480 302.3 465.7 288 448 288z"],teeth:[576,512,[],"f62e","M480 32H96C42.98 32 0 74.98 0 128v256c0 53.02 42.98 96 96 96h384c53.02 0 96-42.98 96-96V128C576 74.98 533 32 480 32zM144 336C144 362.5 122.5 384 96 384s-48-21.5-48-48v-32C48 295.1 55.13 288 64 288h64c8.875 0 16 7.125 16 16V336zM144 240C144 248.9 136.9 256 128 256H64C55.13 256 48 248.9 48 240v-32C48 181.5 69.5 160 96 160s48 21.5 48 48V240zM272 336C272 362.5 250.5 384 224 384s-48-21.5-48-48v-32C176 295.1 183.1 288 192 288h64c8.875 0 16 7.125 16 16V336zM272 242.3C272 249.9 265.9 256 258.3 256H189.7C182.1 256 176 249.9 176 242.3V176C176 149.5 197.5 128 224 128s48 21.54 48 48V242.3zM400 336c0 26.5-21.5 48-48 48s-48-21.5-48-48v-32C304 295.1 311.1 288 320 288h64c8.875 0 16 7.125 16 16V336zM400 242.3C400 249.9 393.9 256 386.3 256h-68.57C310.1 256 304 249.9 304 242.3V176C304 149.5 325.5 128 352 128s48 21.54 48 48V242.3zM528 336c0 26.5-21.5 48-48 48s-48-21.5-48-48v-32C432 295.1 439.1 288 448 288h64c8.875 0 16 7.125 16 16V336zM528 240C528 248.9 520.9 256 512 256h-64c-8.875 0-16-7.125-16-16v-32C432 181.5 453.5 160 480 160s48 21.5 48 48V240z"],"teeth-open":[576,512,[],"f62f","M512 288H64c-35.35 0-64 28.65-64 64v32c0 53.02 42.98 96 96 96h384c53.02 0 96-42.98 96-96v-32C576 316.7 547.3 288 512 288zM144 368C144 394.5 122.5 416 96 416s-48-21.5-48-48v-32C48 327.1 55.13 320 64 320h64c8.875 0 16 7.125 16 16V368zM272 368C272 394.5 250.5 416 224 416s-48-21.5-48-48v-32C176 327.1 183.1 320 192 320h64c8.875 0 16 7.125 16 16V368zM400 368c0 26.5-21.5 48-48 48s-48-21.5-48-48v-32c0-8.875 7.125-16 16-16h64c8.875 0 16 7.125 16 16V368zM528 368c0 26.5-21.5 48-48 48s-48-21.5-48-48v-32c0-8.875 7.125-16 16-16h64c8.875 0 16 7.125 16 16V368zM480 32H96C42.98 32 0 74.98 0 128v64c0 35.35 28.65 64 64 64h448c35.35 0 64-28.65 64-64V128C576 74.98 533 32 480 32zM144 208C144 216.9 136.9 224 128 224H64C55.13 224 48 216.9 48 208v-32C48 149.5 69.5 128 96 128s48 21.5 48 48V208zM272 210.3C272 217.9 265.9 224 258.3 224H189.7C182.1 224 176 217.9 176 210.3V144C176 117.5 197.5 96 224 96s48 21.54 48 48V210.3zM400 210.3C400 217.9 393.9 224 386.3 224h-68.57C310.1 224 304 217.9 304 210.3V144C304 117.5 325.5 96 352 96s48 21.54 48 48V210.3zM528 208C528 216.9 520.9 224 512 224h-64c-8.875 0-16-7.125-16-16v-32C432 149.5 453.5 128 480 128s48 21.5 48 48V208z"],"temperature-arrow-down":[512,512,["temperature-down"],"e03f","M159.1 322.9l-.0002-18.92C159.1 295.1 152.9 287.1 144 287.1c-8.875 0-15.1 7.115-15.1 15.99L128 322.9c-22 7.875-35.25 30.38-31.25 53.38C100.6 399.4 120.6 416.1 144 416.1c23.37 0 43.37-16.71 47.25-39.83C195.2 353.3 181.1 330.8 159.1 322.9zM255.1 112C255.1 50.13 205.9 0 144 0C82.13 0 32 50.13 32 112v166.5C12.25 303.3 0 334 0 368C0 447.5 64.5 512 144 512c79.5 0 143.1-64.5 143.1-144c0-34-12.25-64.88-32-89.5V112zM219.9 393.4C208.1 426.1 178.4 447.1 144 447.1c-34.38 0-65-21.84-75.88-54.59C57.25 360.8 68.5 324.9 96 304.3V112C96 85.5 117.5 64 144 64c26.5 0 47.1 21.5 47.1 48v192.3C219.5 324.9 230.7 360.8 219.9 393.4zM499.1 343c-13.77-11.03-33.92-8.75-44.97 5L448 356.8V64c0-17.69-14.33-32-32-32s-32 14.31-32 32v292.8L376.1 348c-11.03-13.81-31.19-16.03-44.97-5c-13.81 11.06-16.05 31.19-5 45l64 80C397.1 475.6 406.3 480 416 480s18.92-4.406 24.98-12l64-80C516 374.2 513.8 354.1 499.1 343z"],"temperature-arrow-up":[512,512,["temperature-up"],"e040","M159.1 322.9V112C159.1 103.1 152.9 96 144 96C135.1 96 128 103.1 128 112v210.9c-22 7.875-35.25 30.38-31.25 53.38C100.6 399.4 120.6 416.1 144 416.1c23.37 0 43.37-16.71 47.25-39.83C195.2 353.3 181.1 330.8 159.1 322.9zM255.1 112C255.1 50.13 205.9 0 144 0C82.13 0 32 50.13 32 112v166.5C12.25 303.3 0 334 0 368C0 447.5 64.5 512 144 512c79.5 0 143.1-64.5 143.1-144c0-34-12.25-64.88-32-89.5V112zM219.9 393.4C208.1 426.1 178.4 447.1 144 447.1c-34.38 0-65-21.84-75.88-54.59C57.25 360.8 68.5 324.9 96 304.3V112c0-26.5 21.5-48.01 48-48.01c26.5 0 47.1 21.51 47.1 48.01v192.3C219.5 324.9 230.7 360.8 219.9 393.4zM504.1 124l-64-80c-12.12-15.19-37.84-15.19-49.97 0l-64 80c-11.05 13.81-8.812 33.94 5 45c13.75 11.03 33.94 8.781 44.97-5L384 155.2V448c0 17.69 14.33 32 32 32s32-14.31 32-32V155.2L455 164c6.312 7.906 15.61 12 25 12c7.016 0 14.08-2.281 19.97-7C513.8 157.9 516 137.8 504.1 124z"],"temperature-empty":[320,512,["temperature-0","thermometer-0","thermometer-empty"],"f2cb","M272 278.5V112c0-61.87-50.12-112-111.1-112S48 50.13 48 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 143.1 144 143.1S304 447.5 304 368C304 334 291.8 303.1 272 278.5zM160 448c-44.13 0-80-35.87-80-79.1c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.3c19.75 14.75 32 38.25 32 63.75C240 412.1 204.1 448 160 448zM160 320c-26.51 0-48 21.49-48 48s21.49 48 48 48s48-21.49 48-48S186.5 320 160 320z"],"temperature-full":[320,512,["temperature-4","thermometer-4","thermometer-full"],"f2c7","M176 322.9V112c0-8.75-7.25-16-16-16s-16 7.25-16 16v210.9c-18.62 6.625-32 24.25-32 45.13c0 26.5 21.5 48 48 48s48-21.5 48-48C208 347.1 194.6 329.5 176 322.9zM272 278.5V112c0-61.87-50.12-112-111.1-112S48 50.13 48 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 143.1 144 143.1S304 447.5 304 368C304 334 291.8 303.1 272 278.5zM160 448c-44.13 0-80-35.87-80-79.1c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.3c19.75 14.75 32 38.25 32 63.75C240 412.1 204.1 448 160 448z"],"temperature-half":[320,512,[127777,"temperature-2","thermometer-2","thermometer-half"],"f2c9","M176 322.9l.0002-114.9c0-8.75-7.25-16-16-16s-15.1 7.25-15.1 16L144 322.9c-18.62 6.625-32 24.25-32 45.13c0 26.5 21.5 48 48 48s48-21.5 48-48C208 347.1 194.6 329.5 176 322.9zM272 278.5V112c0-61.87-50.12-112-111.1-112S48 50.13 48 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 143.1 144 143.1S304 447.5 304 368C304 334 291.8 303.1 272 278.5zM160 448c-44.13 0-80-35.87-80-79.1c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.3c19.75 14.75 32 38.25 32 63.75C240 412.1 204.1 448 160 448z"],"temperature-high":[512,512,[],"f769","M160 322.9V112C160 103.3 152.8 96 144 96S128 103.3 128 112v210.9C109.4 329.5 96 347.1 96 368C96 394.5 117.5 416 144 416S192 394.5 192 368C192 347.1 178.6 329.5 160 322.9zM416 0c-52.88 0-96 43.13-96 96s43.13 96 96 96s96-43.13 96-96S468.9 0 416 0zM416 128c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S433.8 128 416 128zM256 112c0-61.88-50.13-112-112-112s-112 50.13-112 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 144 144 144s144-64.5 144-144c0-33.1-12.25-64.88-32-89.5V112zM144 448c-44.13 0-80-35.88-80-80c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48S192 85.5 192 112V304.3c19.75 14.75 32 38.25 32 63.75C224 412.1 188.1 448 144 448z"],"temperature-low":[512,512,[],"f76b","M160 322.9V304C160 295.3 152.8 288 144 288S128 295.3 128 304v18.88C109.4 329.5 96 347.1 96 368C96 394.5 117.5 416 144 416S192 394.5 192 368C192 347.1 178.6 329.5 160 322.9zM256 112c0-61.88-50.13-112-112-112s-112 50.13-112 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 144 144 144s144-64.5 144-144c0-33.1-12.25-64.88-32-89.5V112zM144 448c-44.13 0-80-35.88-80-80c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.1c19.75 14.75 32 38.38 32 63.88C224 412.1 188.1 448 144 448zM416 0c-52.88 0-96 43.13-96 96s43.13 96 96 96s96-43.13 96-96S468.9 0 416 0zM416 128c-17.75 0-32-14.25-32-32s14.25-32 32-32s32 14.25 32 32S433.8 128 416 128z"],"temperature-quarter":[320,512,["temperature-1","thermometer-1","thermometer-quarter"],"f2ca","M176 322.9l.0002-50.88c0-8.75-7.25-16-16-16s-15.1 7.25-15.1 16L144 322.9c-18.62 6.625-32 24.25-32 45.13c0 26.5 21.5 48 48 48s48-21.5 48-48C208 347.1 194.6 329.5 176 322.9zM272 278.5V112c0-61.87-50.12-112-111.1-112S48 50.13 48 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 143.1 144 143.1S304 447.5 304 368C304 334 291.8 303.1 272 278.5zM160 448c-44.13 0-80-35.87-80-79.1c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.3c19.75 14.75 32 38.25 32 63.75C240 412.1 204.1 448 160 448z"],"temperature-three-quarters":[320,512,["temperature-3","thermometer-3","thermometer-three-quarters"],"f2c8","M176 322.9V160c0-8.75-7.25-16-16-16s-16 7.25-16 16v162.9c-18.62 6.625-32 24.25-32 45.13c0 26.5 21.5 48 48 48s48-21.5 48-48C208 347.1 194.6 329.5 176 322.9zM272 278.5V112c0-61.87-50.12-112-111.1-112S48 50.13 48 112v166.5c-19.75 24.75-32 55.5-32 89.5c0 79.5 64.5 143.1 144 143.1S304 447.5 304 368C304 334 291.8 303.1 272 278.5zM160 448c-44.13 0-80-35.87-80-79.1c0-25.5 12.25-48.88 32-63.75v-192.3c0-26.5 21.5-48 48-48s48 21.5 48 48v192.3c19.75 14.75 32 38.25 32 63.75C240 412.1 204.1 448 160 448z"],"tenge-sign":[384,512,[8376,"tenge"],"f7d7","M0 64C0 46.33 14.33 32 32 32H352C369.7 32 384 46.33 384 64C384 81.67 369.7 96 352 96H32C14.33 96 0 81.67 0 64zM0 192C0 174.3 14.33 160 32 160H352C369.7 160 384 174.3 384 192C384 209.7 369.7 224 352 224H224V448C224 465.7 209.7 480 192 480C174.3 480 160 465.7 160 448V224H32C14.33 224 0 209.7 0 192z"],tent:[576,512,[],"e57d","M269.4 5.961C280.5-1.987 295.5-1.987 306.6 5.961L530.6 165.1C538 171.2 542.8 179.4 543.8 188.5L575.8 476.5C576.8 485.5 573.9 494.6 567.8 501.3C561.8 508.1 553.1 512 544 512H416L288 288V512H32C22.9 512 14.23 508.1 8.156 501.3C2.086 494.6-.8093 485.5 .1958 476.5L32.2 188.5C33.2 179.4 38 171.2 45.4 165.1L269.4 5.961z"],"tent-arrow-down-to-line":[640,512,[],"e57e","M241.8 111.9C250.7 121.8 249.9 136.1 240.1 145.8L160.1 217.8C150.9 226.1 137.1 226.1 127.9 217.8L47.94 145.8C38.09 136.1 37.29 121.8 46.16 111.9C55.03 102.1 70.2 101.3 80.05 110.2L119.1 146.1V24C119.1 10.75 130.7 0 143.1 0C157.3 0 167.1 10.75 167.1 24V146.1L207.9 110.2C217.8 101.3 232.1 102.1 241.8 111.9H241.8zM364.6 134.5C376.1 125.8 391.9 125.8 403.4 134.5L571.4 262.5C578 267.6 582.4 275 583.6 283.3L608.4 448C625.9 448.2 640 462.4 640 480C640 497.7 625.7 512 608 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H159.6L184.4 283.3C185.6 275 189.1 267.6 196.6 262.5L364.6 134.5zM384 448H460.8L384 320V448z"],"tent-arrow-left-right":[576,512,[],"e57f","M568.1 78.16C573.1 82.71 576 89.2 576 96C576 102.8 573.1 109.3 568.1 113.8L488.1 185.8C478.2 194.7 463 193.9 454.2 184.1C445.3 174.2 446.1 159 455.9 150.2L489.5 120H86.54L120.1 150.2C129.9 159 130.7 174.2 121.8 184.1C112.1 193.9 97.8 194.7 87.94 185.8L7.945 113.8C2.888 109.3 0 102.8 0 96C0 89.2 2.888 82.71 7.945 78.16L87.94 6.161C97.8-2.706 112.1-1.907 121.8 7.945C130.7 17.8 129.9 32.97 120.1 41.84L86.54 72H489.5L455.9 41.84C446.1 32.97 445.3 17.8 454.2 7.945C463-1.907 478.2-2.706 488.1 6.161L568.1 78.16zM475.4 294.5C482 299.6 486.4 307 487.6 315.3L511.6 475.3C513 484.5 510.3 493.8 504.2 500.9C498.2 507.9 489.3 512 480 512H384L287.1 352V512H96C86.68 512 77.83 507.9 71.75 500.9C65.67 493.8 62.97 484.5 64.35 475.3L88.35 315.3C89.59 307 93.98 299.6 100.6 294.5L268.6 166.5C280.1 157.8 295.9 157.8 307.4 166.5L475.4 294.5z"],"tent-arrow-turn-left":[576,512,[],"e580","M86.54 72H456C522.3 72 576 125.7 576 192V232C576 245.3 565.3 256 552 256C538.7 256 528 245.3 528 232V192C528 152.2 495.8 120 456 120H86.54L120.1 150.2C129.9 159 130.7 174.2 121.8 184.1C112.1 193.9 97.8 194.7 87.94 185.8L7.945 113.8C2.888 109.3 0 102.8 0 96C0 89.2 2.888 82.71 7.945 78.16L87.94 6.161C97.8-2.706 112.1-1.907 121.8 7.945C130.7 17.8 129.9 32.97 120.1 41.84L86.54 72zM475.4 294.5C482 299.6 486.4 307 487.6 315.3L511.6 475.3C513 484.5 510.3 493.8 504.2 500.9C498.2 507.9 489.3 512 480 512H384L287.1 352V512H96C86.68 512 77.83 507.9 71.75 500.9C65.67 493.8 62.97 484.5 64.35 475.3L88.35 315.3C89.59 307 93.98 299.6 100.6 294.5L268.6 166.5C280.1 157.8 295.9 157.8 307.4 166.5L475.4 294.5z"],"tent-arrows-down":[576,512,[],"e581","M209.8 111.9C218.7 121.8 217.9 136.1 208.1 145.8L128.1 217.8C118.9 226.1 105.1 226.1 95.94 217.8L15.94 145.8C6.093 136.1 5.294 121.8 14.16 111.9C23.03 102.1 38.2 101.3 48.06 110.2L88 146.1V24C88 10.75 98.75 0 112 0C125.3 0 136 10.75 136 24V146.1L175.9 110.2C185.8 101.3 200.1 102.1 209.8 111.9H209.8zM561.8 111.9C570.7 121.8 569.9 136.1 560.1 145.8L480.1 217.8C470.9 226.1 457.1 226.1 447.9 217.8L367.9 145.8C358.1 136.1 357.3 121.8 366.2 111.9C375 102.1 390.2 101.3 400.1 110.2L440 146.1V24C440 10.75 450.7 0 464 0C477.3 0 488 10.75 488 24V146.1L527.9 110.2C537.8 101.3 552.1 102.1 561.8 111.9H561.8zM475.4 294.5C482 299.6 486.4 307 487.6 315.3L511.6 475.3C513 484.5 510.3 493.8 504.2 500.9C498.2 507.9 489.3 512 480 512H384L287.1 352V512H96C86.68 512 77.83 507.9 71.75 500.9C65.67 493.8 62.97 484.5 64.35 475.3L88.35 315.3C89.59 307 93.98 299.6 100.6 294.5L268.6 166.5C280.1 157.8 295.9 157.8 307.4 166.5L475.4 294.5z"],tents:[640,512,[],"e582","M396.6 6.546C408.1-2.182 423.9-2.182 435.4 6.546L603.4 134.5C610 139.6 614.4 147 615.6 155.3L639.6 315.3C641 324.5 638.3 333.8 632.2 340.9C626.2 347.9 617.3 352 608 352H461.5L455.3 310.5C452.8 294 444 279.2 430.8 269.1L262.8 141.1C254.6 134.9 245.4 130.9 235.8 129.1L396.6 6.546zM411.4 294.5C418 299.6 422.4 307 423.6 315.3L447.6 475.3C449 484.5 446.3 493.8 440.2 500.9C434.2 507.9 425.3 512 416 512H319.1L223.1 352V512H32C22.68 512 13.83 507.9 7.753 500.9C1.674 493.8-1.028 484.5 .3542 475.3L24.35 315.3C25.59 307 29.98 299.6 36.61 294.5L204.6 166.5C216.1 157.8 231.9 157.8 243.4 166.5L411.4 294.5z"],terminal:[576,512,[],"f120","M9.372 86.63C-3.124 74.13-3.124 53.87 9.372 41.37C21.87 28.88 42.13 28.88 54.63 41.37L246.6 233.4C259.1 245.9 259.1 266.1 246.6 278.6L54.63 470.6C42.13 483.1 21.87 483.1 9.372 470.6C-3.124 458.1-3.124 437.9 9.372 425.4L178.7 256L9.372 86.63zM544 416C561.7 416 576 430.3 576 448C576 465.7 561.7 480 544 480H256C238.3 480 224 465.7 224 448C224 430.3 238.3 416 256 416H544z"],"text-height":[576,512,[],"f034","M288 32.01H32c-17.67 0-32 14.31-32 32v64c0 17.69 14.33 32 32 32s32-14.31 32-32v-32h64v320H96c-17.67 0-32 14.31-32 32s14.33 32 32 32h128c17.67 0 32-14.31 32-32s-14.33-32-32-32H192v-320h64v32c0 17.69 14.33 32 32 32s32-14.31 32-32v-64C320 46.33 305.7 32.01 288 32.01zM521.4 361.4L512 370.8V141.3l9.375 9.375C527.6 156.9 535.8 160 544 160s16.38-3.125 22.62-9.375c12.5-12.5 12.5-32.75 0-45.25l-64-64c-12.5-12.5-32.75-12.5-45.25 0l-64 64c-12.5 12.5-12.5 32.75 0 45.25s32.75 12.5 45.25 0L448 141.3v229.5l-9.375-9.375c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25l64 64C463.6 476.9 471.8 480 480 480s16.38-3.118 22.62-9.368l64-64c12.5-12.5 12.5-32.75 0-45.25S533.9 348.9 521.4 361.4z"],"text-slash":[640,512,["remove-format"],"f87d","M352 416H306.7l18.96-64.1L271.4 308.5L239.1 416H192c-17.67 0-32 14.31-32 32s14.33 31.99 31.1 31.99h160C369.7 480 384 465.7 384 448S369.7 416 352 416zM630.8 469.1l-276.4-216.7l45.63-156.5H512v32c0 17.69 14.33 32 32 32s32-14.31 32-32v-64c0-17.69-14.33-32-32-32H192c-17.67 0-32 14.31-32 32v36.11L38.81 5.13c-10.47-8.219-25.53-6.37-33.7 4.068s-6.349 25.54 4.073 33.69l591.1 463.1c4.406 3.469 9.61 5.127 14.8 5.127c7.125 0 14.17-3.164 18.9-9.195C643.1 492.4 641.2 477.3 630.8 469.1zM300.1 209.9l-82.08-64.33C221.5 140.5 224 134.7 224 128v-32h109.3L300.1 209.9z"],"text-width":[448,512,[],"f035","M416 32.01H32c-17.67 0-32 14.31-32 32v63.1c0 17.69 14.33 32 32 32s32-14.31 32-32v-32h128v128H176c-17.67 0-32 14.31-32 31.1s14.33 32 32 32h96c17.67 0 32-14.31 32-32s-14.33-31.1-32-31.1H256v-128h128v32c0 17.69 14.33 32 32 32s32-14.32 32-32V64.01C448 46.33 433.7 32.01 416 32.01zM374.6 297.4c-12.5-12.5-32.75-12.5-45.25 0s-12.5 32.75 0 45.25l9.375 9.375h-229.5L118.6 342.6c12.5-12.5 12.5-32.75 0-45.25s-32.75-12.5-45.25 0l-64 64c-12.5 12.5-12.5 32.75 0 45.25l64 64C79.63 476.9 87.81 480 96 480s16.38-3.118 22.62-9.368c12.5-12.5 12.5-32.75 0-45.25l-9.375-9.375h229.5l-9.375 9.375c-12.5 12.5-12.5 32.75 0 45.25C335.6 476.9 343.8 480 352 480s16.38-3.118 22.62-9.368l64-64c12.5-12.5 12.5-32.75 0-45.25L374.6 297.4z"],thermometer:[512,512,[],"f491","M483.1 162.6L229.8 415.9l-99.87-.0001l-88.99 89.02c-9.249 9.377-24.5 9.377-33.87 0c-9.374-9.252-9.374-24.51 0-33.88l88.99-89.02l.0003-100.9l49.05-49.39l51.6 51.59c3.125 3.126 7.218 4.688 11.31 4.688s8.187-1.563 11.31-4.688c6.249-6.252 6.249-16.38 0-22.63L167.6 209.1l41.24-41.52l51.81 51.81c3.125 3.126 7.218 4.688 11.31 4.688s8.187-1.563 11.31-4.688c6.249-6.252 6.249-16.38 0-22.63L231.4 144.8l41.24-41.52l52.02 52.02c3.125 3.126 7.218 4.688 11.31 4.688s8.187-1.563 11.31-4.688c6.249-6.252 6.249-16.38 0-22.63l-52.09-52.09l49.68-50.02c36.37-36.51 94.37-40.88 131.9-10.25C526.2 61.11 518.9 127.8 483.1 162.6z"],"thumbs-down":[512,512,[61576,128078],"f165","M96 32.04H32c-17.67 0-32 14.32-32 31.1v223.1c0 17.67 14.33 31.1 32 31.1h64c17.67 0 32-14.33 32-31.1V64.03C128 46.36 113.7 32.04 96 32.04zM467.3 240.2C475.1 231.7 480 220.4 480 207.9c0-23.47-16.87-42.92-39.14-47.09C445.3 153.6 448 145.1 448 135.1c0-21.32-14-39.18-33.25-45.43C415.5 87.12 416 83.61 416 79.98C416 53.47 394.5 32 368 32h-58.69c-34.61 0-68.28 11.22-95.97 31.98L179.2 89.57C167.1 98.63 160 112.9 160 127.1l.1074 160c0 0-.0234-.0234 0 0c.0703 13.99 6.123 27.94 17.91 37.36l16.3 13.03C276.2 403.9 239.4 480 302.5 480c30.96 0 49.47-24.52 49.47-48.11c0-15.15-11.76-58.12-34.52-96.02H464c26.52 0 48-21.47 48-47.98C512 262.5 492.2 241.9 467.3 240.2z"],"thumbs-up":[512,512,[61575,128077],"f164","M128 447.1V223.1c0-17.67-14.33-31.1-32-31.1H32c-17.67 0-32 14.33-32 31.1v223.1c0 17.67 14.33 31.1 32 31.1h64C113.7 479.1 128 465.6 128 447.1zM512 224.1c0-26.5-21.48-47.98-48-47.98h-146.5c22.77-37.91 34.52-80.88 34.52-96.02C352 56.52 333.5 32 302.5 32c-63.13 0-26.36 76.15-108.2 141.6L178 186.6C166.2 196.1 160.2 210 160.1 224c-.0234 .0234 0 0 0 0L160 384c0 15.1 7.113 29.33 19.2 38.39l34.14 25.59C241 468.8 274.7 480 309.3 480H368c26.52 0 48-21.47 48-47.98c0-3.635-.4805-7.143-1.246-10.55C434 415.2 448 397.4 448 376c0-9.148-2.697-17.61-7.139-24.88C463.1 347 480 327.5 480 304.1c0-12.5-4.893-23.78-12.72-32.32C492.2 270.1 512 249.5 512 224.1z"],thumbtack:[384,512,[128392,128204,"thumb-tack"],"f08d","M32 32C32 14.33 46.33 0 64 0H320C337.7 0 352 14.33 352 32C352 49.67 337.7 64 320 64H290.5L301.9 212.2C338.6 232.1 367.5 265.4 381.4 306.9L382.4 309.9C385.6 319.6 383.1 330.4 377.1 338.7C371.9 347.1 362.3 352 352 352H32C21.71 352 12.05 347.1 6.04 338.7C.0259 330.4-1.611 319.6 1.642 309.9L2.644 306.9C16.47 265.4 45.42 232.1 82.14 212.2L93.54 64H64C46.33 64 32 49.67 32 32zM224 384V480C224 497.7 209.7 512 192 512C174.3 512 160 497.7 160 480V384H224z"],ticket:[576,512,[127903],"f145","M128 160H448V352H128V160zM512 64C547.3 64 576 92.65 576 128V208C549.5 208 528 229.5 528 256C528 282.5 549.5 304 576 304V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V304C26.51 304 48 282.5 48 256C48 229.5 26.51 208 0 208V128C0 92.65 28.65 64 64 64H512zM96 352C96 369.7 110.3 384 128 384H448C465.7 384 480 369.7 480 352V160C480 142.3 465.7 128 448 128H128C110.3 128 96 142.3 96 160V352z"],"ticket-simple":[576,512,["ticket-alt"],"f3ff","M0 128C0 92.65 28.65 64 64 64H512C547.3 64 576 92.65 576 128V208C549.5 208 528 229.5 528 256C528 282.5 549.5 304 576 304V384C576 419.3 547.3 448 512 448H64C28.65 448 0 419.3 0 384V304C26.51 304 48 282.5 48 256C48 229.5 26.51 208 0 208V128z"],timeline:[640,512,[],"e29c","M160 224H480V169.3C451.7 156.1 432 128.8 432 96C432 51.82 467.8 16 512 16C556.2 16 592 51.82 592 96C592 128.8 572.3 156.1 544 169.3V224H608C625.7 224 640 238.3 640 256C640 273.7 625.7 288 608 288H352V342.7C380.3 355 400 383.2 400 416C400 460.2 364.2 496 320 496C275.8 496 240 460.2 240 416C240 383.2 259.7 355 288 342.7V288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H96V169.3C67.75 156.1 48 128.8 48 96C48 51.82 83.82 16 128 16C172.2 16 208 51.82 208 96C208 128.8 188.3 156.1 160 169.3V224zM128 120C141.3 120 152 109.3 152 96C152 82.75 141.3 72 128 72C114.7 72 104 82.75 104 96C104 109.3 114.7 120 128 120zM512 72C498.7 72 488 82.75 488 96C488 109.3 498.7 120 512 120C525.3 120 536 109.3 536 96C536 82.75 525.3 72 512 72zM320 440C333.3 440 344 429.3 344 416C344 402.7 333.3 392 320 392C306.7 392 296 402.7 296 416C296 429.3 306.7 440 320 440z"],"toggle-off":[576,512,[],"f204","M192 352C138.1 352 96 309 96 256C96 202.1 138.1 160 192 160C245 160 288 202.1 288 256C288 309 245 352 192 352zM384 448H192C85.96 448 0 362 0 256C0 149.1 85.96 64 192 64H384C490 64 576 149.1 576 256C576 362 490 448 384 448zM384 128H192C121.3 128 64 185.3 64 256C64 326.7 121.3 384 192 384H384C454.7 384 512 326.7 512 256C512 185.3 454.7 128 384 128z"],"toggle-on":[576,512,[],"f205","M384 64C490 64 576 149.1 576 256C576 362 490 448 384 448H192C85.96 448 0 362 0 256C0 149.1 85.96 64 192 64H384zM384 352C437 352 480 309 480 256C480 202.1 437 160 384 160C330.1 160 288 202.1 288 256C288 309 330.1 352 384 352z"],toilet:[448,512,[128701],"f7d8","M432 48C440.8 48 448 40.75 448 32V16C448 7.25 440.8 0 432 0h-416C7.25 0 0 7.25 0 16V32c0 8.75 7.25 16 16 16H32v158.7C11.82 221.2 0 237.1 0 256c0 60.98 33.28 115.2 84.1 150.4l-19.59 64.36C59.16 491.3 74.53 512 96.03 512h255.9c21.5 0 36.88-20.75 30.62-41.25L363 406.4C414.7 371.2 448 316.1 448 256c0-18.04-11.82-34.85-32-49.26V48H432zM96 72C96 67.63 99.63 64 104 64h48C156.4 64 160 67.63 160 72v16C160 92.38 156.4 96 152 96h-48C99.63 96 96 92.38 96 88V72zM224 288C135.6 288 64 273.7 64 256c0-17.67 71.63-32 160-32s160 14.33 160 32C384 273.7 312.4 288 224 288z"],"toilet-paper":[576,512,[129531],"f71e","M127.1 0C74.98 0 31.98 86 31.98 192v172.1c0 41.12-9.751 62.75-31.13 126.9C-2.65 501.2 5.101 512 15.98 512h280.9c13.88 0 26-8.75 30.38-21.88c12.88-38.5 24.75-72.37 24.75-126L351.1 192c0-83.62 23.62-153.5 60.5-192H127.1zM95.99 224C87.11 224 79.99 216.9 79.99 208S87.11 192 95.99 192s16 7.125 16 16S104.9 224 95.99 224zM159.1 224c-8.875 0-16-7.125-16-16S151.1 192 159.1 192s16 7.125 16 16S168.9 224 159.1 224zM223.1 224C215.1 224 207.1 216.9 207.1 208S215.1 192 223.1 192c8.875 0 16 7.125 16 16S232.9 224 223.1 224zM287.1 224C279.1 224 271.1 216.9 271.1 208S279.1 192 287.1 192c8.875 0 16 7.125 16 16S296.9 224 287.1 224zM479.1 0c-53 0-96 86.06-96 192.1C383.1 298.1 426.1 384 479.1 384S576 298 576 192C576 86 532.1 0 479.1 0zM479.1 256c-17.63 0-32-28.62-32-64s14.38-64 32-64c17.63 0 32 28.62 32 64S497.6 256 479.1 256z"],"toilet-paper-slash":[640,512,[],"e072","M63.98 191.1v172.1c0 41.12-9.75 62.75-31.13 126.9c-3.5 10.25 4.25 20.1 15.13 20.1l280.9-.0059c13.87 0 25.1-8.75 30.37-21.87c10.08-30.15 19.46-57.6 23.1-93.78L66.51 148.8C64.9 162.7 63.98 177.1 63.98 191.1zM630.8 469.1l-109.8-86.02c48.75-9.144 86.94-91.2 86.94-191.1C607.1 86 564.1 0 511.1 0s-96 86-96 191.1c0 49.25 9.362 94.03 24.62 128l-56.62-44.38l.0049-83.65c0-83.62 23.62-153.5 60.5-191.1H159.1C135.2 0 112.7 18.93 95.72 49.72L38.81 5.109C34.41 1.672 29.19 0 24.03 0c-7.125 0-14.19 3.156-18.91 9.187C-3.061 19.62-1.249 34.72 9.189 42.89l591.1 463.1c10.5 8.203 25.56 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1zM479.1 191.1c0-35.37 14.37-64 32-64c17.62 0 32 28.63 32 64S529.6 255.1 511.1 255.1C494.4 255.1 479.1 227.4 479.1 191.1z"],"toilet-portable":[320,512,[],"e583","M0 32C0 14.33 14.33 0 32 0H288C305.7 0 320 14.33 320 32V64H0V32zM320 96V488C320 501.3 309.3 512 296 512C282.7 512 272 501.3 272 488V480H48V488C48 501.3 37.25 512 24 512C10.75 512 0 501.3 0 488V96H320zM256 240C256 231.2 248.8 224 240 224C231.2 224 224 231.2 224 240V304C224 312.8 231.2 320 240 320C248.8 320 256 312.8 256 304V240z"],"toilets-portable":[576,512,[],"e584","M224 0C241.7 0 256 14.33 256 32V64H0V32C0 14.33 14.33 0 32 0H224zM0 96H256V488C256 501.3 245.3 512 232 512C218.7 512 208 501.3 208 488V480H48V488C48 501.3 37.25 512 24 512C10.75 512 0 501.3 0 488V96zM176 240V304C176 312.8 183.2 320 192 320C200.8 320 208 312.8 208 304V240C208 231.2 200.8 224 192 224C183.2 224 176 231.2 176 240zM544 0C561.7 0 576 14.33 576 32V64H320V32C320 14.33 334.3 0 352 0H544zM320 96H576V488C576 501.3 565.3 512 552 512C538.7 512 528 501.3 528 488V480H368V488C368 501.3 357.3 512 344 512C330.7 512 320 501.3 320 488V96zM496 240V304C496 312.8 503.2 320 512 320C520.8 320 528 312.8 528 304V240C528 231.2 520.8 224 512 224C503.2 224 496 231.2 496 240z"],toolbox:[512,512,[129520],"f552","M502.6 182.6l-45.25-45.25C451.4 131.4 443.3 128 434.8 128H384V80C384 53.5 362.5 32 336 32h-160C149.5 32 128 53.5 128 80V128H77.25c-8.5 0-16.62 3.375-22.62 9.375L9.375 182.6C3.375 188.6 0 196.8 0 205.3V304h128v-32C128 263.1 135.1 256 144 256h32C184.9 256 192 263.1 192 272v32h128v-32C320 263.1 327.1 256 336 256h32C376.9 256 384 263.1 384 272v32h128V205.3C512 196.8 508.6 188.6 502.6 182.6zM336 128h-160V80h160V128zM384 368c0 8.875-7.125 16-16 16h-32c-8.875 0-16-7.125-16-16v-32H192v32C192 376.9 184.9 384 176 384h-32C135.1 384 128 376.9 128 368v-32H0V448c0 17.62 14.38 32 32 32h448c17.62 0 32-14.38 32-32v-112h-128V368z"],tooth:[448,512,[129463],"f5c9","M394.1 212.8c-20.04 27.67-28.07 60.15-31.18 93.95c-3.748 41.34-8.785 82.46-17.89 122.8l-6.75 29.64c-2.68 12.14-13.29 20.78-25.39 20.78c-12 0-22.39-8.311-25.29-20.23l-29.57-121.2C254.1 322.6 240.1 311.4 224 311.4c-16.18 0-30.21 11.26-34.07 27.23l-29.57 121.2c-2.893 11.92-13.39 20.23-25.29 20.23c-12.21 0-22.71-8.639-25.5-20.78l-6.643-29.64c-9.105-40.36-14.14-81.48-17.1-122.8C81.93 272.1 73.9 240.5 53.86 212.8c-18.75-25.92-27.11-60.15-18.43-96.57c9.428-39.59 40.39-71.75 78.85-82.03c20.14-5.25 39.54-.4375 57.32 9.077l86.14 56.54c6.643 4.375 15.11 1.86 18.96-4.264c4.07-6.454 2.25-15.09-4.18-19.36l-24.21-15.86c3-1.531 6.215-2.735 9-4.813c22.39-16.84 48.75-28.65 76.39-21.33c38.46 10.28 69.43 42.43 78.85 82.03C421.2 152.7 412.9 187 394.1 212.8z"],"torii-gate":[512,512,[9961],"f6a1","M0 80V0L71.37 23.79C87.68 29.23 104.8 32 121.1 32H390C407.2 32 424.3 29.23 440.6 23.79L512 0V80C512 106.5 490.5 128 464 128H448V192H384V128H288V192H224V128H128V192H64V128H48C21.49 128 0 106.5 0 80zM32 288C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H448V480C448 497.7 433.7 512 416 512C398.3 512 384 497.7 384 480V288H128V480C128 497.7 113.7 512 96 512C78.33 512 64 497.7 64 480V288H32z"],tornado:[448,512,[127786],"f76f","M407.8 42.09c7.531-6.562 10.22-17.12 6.688-26.5C410.1 6.219 401.1 0 391.1 0L24.16 .0313c-13 0-23.66 10.38-24 23.38C-.5495 50.32 1.349 74.22 4.945 95.98h353.9C367.9 80.76 383.4 63.34 407.8 42.09zM387.7 195.9c-22.02-25.33-38.96-44.87-39-67.93H12.05c11.47 40.4 30.38 71.34 53.15 96h345.8C403.4 214.1 395.4 204.8 387.7 195.9zM303.6 485.3c-1.125 10.12 4.249 19.84 13.44 24.28C320.3 511.2 323.9 512 327.4 512c6.219 0 12.34-2.406 16.94-7c43.73-43.61 73.32-83.63 89.35-121h-148.6C300.8 408.6 308.7 440 303.6 485.3zM431.7 255.1H100.5C127.1 276.3 155.8 291.6 182.4 305.8c28.14 15.01 54.04 28.9 74.73 46.14h186.8C446.4 341.1 447.1 330.4 448 320C448 295.4 441.4 274.6 431.7 255.1z"],"tower-broadcast":[576,512,["broadcast-tower"],"f519","M160.9 59.01C149.3 52.6 134.7 56.76 128.3 68.39C117.6 87.6 112 109.4 112 131.4c0 19.03 4.031 37.44 11.98 54.62c4.047 8.777 12.73 13.93 21.8 13.93c3.375 0 6.797-.7187 10.05-2.219C167.9 192.2 173.1 177.1 167.5 165.9C162.5 155.1 160 143.5 160 131.4c0-13.93 3.547-27.69 10.25-39.81C176.7 80.04 172.5 65.42 160.9 59.01zM62.61 2.363C46.17-4.32 27.58 3.676 20.95 20.02C7.047 54.36 0 90.69 0 127.1C0 165.3 7.047 201.7 20.95 236C25.98 248.5 37.97 256 50.63 256C54.61 256 58.69 255.3 62.61 253.7C79 247 86.91 228.4 80.27 212C69.47 185.3 64 157.1 64 128c0-29.06 5.469-57.3 16.27-83.99C86.91 27.64 79 8.988 62.61 2.363zM555 20.02c-6.609-16.41-25.23-24.31-41.66-17.66c-16.39 6.625-24.3 25.28-17.66 41.65C506.5 70.7 512 98.95 512 128c0 29.06-5.469 57.31-16.27 83.1C489.1 228.4 497 247 513.4 253.7C517.3 255.3 521.4 256 525.4 256c12.66 0 24.64-7.562 29.67-20C568.1 201.7 576 165.3 576 127.1C576 90.69 568.1 54.36 555 20.02zM420.2 58.23c-12.03 5.562-17.28 19.81-11.72 31.84C413.5 100.9 416 112.5 416 124.6c0 13.94-3.547 27.69-10.25 39.81c-6.422 11.59-2.219 26.22 9.375 32.62c3.688 2.031 7.672 3 11.61 3c8.438 0 16.64-4.47 21.02-12.37C458.4 168.4 464 146.6 464 124.6c0-19.03-4.031-37.43-11.98-54.62C446.5 57.89 432.1 52.7 420.2 58.23zM301.8 65.45C260.5 56.78 224 88.13 224 128c0 23.63 12.95 44.04 32 55.12v296.9c0 17.67 14.33 32 32 32s32-14.33 32-32V183.1c23.25-13.54 37.42-40.96 30.03-71.18C344.4 88.91 325 70.31 301.8 65.45z"],"tower-cell":[576,512,[],"e585","M62.62 2.339C78.1 8.97 86.9 27.63 80.27 44.01C69.79 69.9 64 98.24 64 128C64 157.8 69.79 186.1 80.27 211.1C86.9 228.4 78.1 247 62.62 253.7C46.23 260.3 27.58 252.4 20.95 236C7.428 202.6 0 166.1 0 128C0 89.87 7.428 53.39 20.95 19.99C27.58 3.612 46.23-4.293 62.62 2.339V2.339zM513.4 2.339C529.8-4.293 548.4 3.612 555.1 19.99C568.6 53.39 576 89.87 576 128C576 166.1 568.6 202.6 555.1 236C548.4 252.4 529.8 260.3 513.4 253.7C497 247 489.1 228.4 495.7 211.1C506.2 186.1 512 157.8 512 128C512 98.24 506.2 69.9 495.7 44.01C489.1 27.63 497 8.969 513.4 2.338V2.339zM477.1 466.8C484.4 482.8 477.3 501.8 461.2 509.1C445.2 516.4 426.2 509.3 418.9 493.2L398.3 448H177.7L157.1 493.2C149.8 509.3 130.8 516.4 114.8 509.1C98.67 501.8 91.56 482.8 98.87 466.8L235.9 165.2C228.4 154.7 224 141.9 224 128C224 92.65 252.7 64 288 64C323.3 64 352 92.65 352 128C352 141.9 347.6 154.7 340.1 165.2L477.1 466.8zM369.2 384L354.7 352H221.3L206.8 384H369.2zM250.4 288H325.6L288 205.3L250.4 288zM152 128C152 147.4 156 165.8 163.3 182.4C168.6 194.5 163.1 208.7 150.9 213.1C138.8 219.3 124.6 213.8 119.3 201.6C109.5 179 104 154.1 104 128C104 101.9 109.5 76.96 119.3 54.39C124.6 42.25 138.8 36.7 150.9 42.01C163.1 47.31 168.6 61.46 163.3 73.61C156 90.23 152 108.6 152 128V128zM472 128C472 154.1 466.5 179 456.7 201.6C451.4 213.8 437.2 219.3 425.1 213.1C412.9 208.7 407.4 194.5 412.7 182.4C419.1 165.8 424 147.4 424 128C424 108.6 419.1 90.24 412.7 73.61C407.4 61.46 412.9 47.32 425.1 42.01C437.2 36.7 451.4 42.25 456.7 54.39C466.5 76.96 472 101.9 472 128V128z"],"tower-observation":[512,512,[],"e586","M241.7 3.378C250.7-1.126 261.3-1.126 270.3 3.378L430.3 83.38C446.1 91.28 452.5 110.5 444.6 126.3C439 137.5 427.7 143.1 416 144V224C416 241.7 401.7 256 384 256H379.1L411.1 448H480C497.7 448 512 462.3 512 480C512 497.7 497.7 512 480 512H384.5C384.2 512 383.8 512 383.4 512H128.6C128.2 512 127.9 512 127.5 512H32C14.33 512 0 497.7 0 480C0 462.3 14.33 448 32 448H100.9L132.9 256H128C110.3 256 96 241.7 96 224V144C84.27 143.1 72.98 137.5 67.38 126.3C59.47 110.5 65.88 91.28 81.69 83.38L241.7 3.378zM314.5 448L256 399.2L197.5 448H314.5zM193.1 284.3L256 336.8L318.9 284.3L314.2 256H197.8L193.1 284.3zM183.9 339.2L172.8 406.1L218.5 368L183.9 339.2zM293.5 368L339.2 406.1L328.1 339.2L293.5 368zM176 128C167.2 128 160 135.2 160 144C160 152.8 167.2 160 176 160H336C344.8 160 352 152.8 352 144C352 135.2 344.8 128 336 128H176z"],tractor:[640,512,[128668],"f722","M96 64C96 28.65 124.7 0 160 0H266.3C292.5 0 316 15.93 325.8 40.23L373.7 160H480V126.2C480 101.4 485.8 76.88 496.9 54.66L499.4 49.69C507.3 33.88 526.5 27.47 542.3 35.38C558.1 43.28 564.5 62.5 556.6 78.31L554.1 83.28C547.5 96.61 544 111.3 544 126.2V160H600C622.1 160 640 177.9 640 200V245.4C640 261.9 631.5 277.3 617.4 286.1L574.1 313.2C559.9 307.3 544.3 304 528 304C488.7 304 453.9 322.9 431.1 352H352C352 369.7 337.7 384 320 384H311.8C310.1 388.8 308.2 393.5 305.1 398.1L311.8 403.9C324.3 416.4 324.3 436.6 311.8 449.1L289.1 471.8C276.6 484.3 256.4 484.3 243.9 471.8L238.1 465.1C233.5 468.2 228.8 470.1 224 471.8V480C224 497.7 209.7 512 192 512H160C142.3 512 128 497.7 128 480V471.8C123.2 470.1 118.5 468.2 113.9 465.1L108.1 471.8C95.62 484.3 75.36 484.3 62.86 471.8L40.24 449.1C27.74 436.6 27.74 416.4 40.24 403.9L46.03 398.1C43.85 393.5 41.9 388.8 40.19 384H32C14.33 384 0 369.7 0 352V320C0 302.3 14.33 288 32 288H40.19C41.9 283.2 43.85 278.5 46.03 273.9L40.24 268.1C27.74 255.6 27.74 235.4 40.24 222.9L62.86 200.2C71.82 191.3 84.78 188.7 96 192.6L96 64zM160 64V160H304.7L266.3 64H160zM176 256C131.8 256 96 291.8 96 336C96 380.2 131.8 416 176 416C220.2 416 256 380.2 256 336C256 291.8 220.2 256 176 256zM440 424C440 394.2 454.8 367.9 477.4 352C491.7 341.9 509.2 336 528 336C530.7 336 533.3 336.1 535.9 336.3C580.8 340.3 616 378.1 616 424C616 472.6 576.6 512 528 512C479.4 512 440 472.6 440 424zM528 448C541.3 448 552 437.3 552 424C552 410.7 541.3 400 528 400C514.7 400 504 410.7 504 424C504 437.3 514.7 448 528 448z"],trademark:[640,512,[8482],"f25c","M618.1 97.67c-13.02-4.375-27.45 .1562-35.72 11.16L464 266.7l-118.4-157.8c-8.266-11.03-22.64-15.56-35.72-11.16C296.8 102 288 114.2 288 128v256c0 17.69 14.33 32 32 32s32-14.31 32-32v-160l86.41 115.2c12.06 16.12 39.13 16.12 51.19 0L576 224v160c0 17.69 14.33 32 32 32s32-14.31 32-32v-256C640 114.2 631.2 102 618.1 97.67zM224 96.01H32c-17.67 0-32 14.31-32 32s14.33 32 32 32h64v223.1c0 17.69 14.33 31.99 32 31.99s32-14.3 32-31.99V160h64c17.67 0 32-14.31 32-32S241.7 96.01 224 96.01z"],"traffic-light":[320,512,[128678],"f637","M256 0C291.3 0 320 28.65 320 64V352C320 440.4 248.4 512 160 512C71.63 512 0 440.4 0 352V64C0 28.65 28.65 0 64 0H256zM160 320C133.5 320 112 341.5 112 368C112 394.5 133.5 416 160 416C186.5 416 208 394.5 208 368C208 341.5 186.5 320 160 320zM160 288C186.5 288 208 266.5 208 240C208 213.5 186.5 192 160 192C133.5 192 112 213.5 112 240C112 266.5 133.5 288 160 288zM160 64C133.5 64 112 85.49 112 112C112 138.5 133.5 160 160 160C186.5 160 208 138.5 208 112C208 85.49 186.5 64 160 64z"],trailer:[640,512,[],"e041","M496 32C522.5 32 544 53.49 544 80V320H608C625.7 320 640 334.3 640 352C640 369.7 625.7 384 608 384H286.9C279.1 329.7 232.4 288 176 288C119.6 288 72.9 329.7 65.13 384H48C21.49 384 0 362.5 0 336V80C0 53.49 21.49 32 48 32H496zM64 112V264.2C73.83 256.1 84.55 249 96 243.2V112C96 103.2 88.84 96 80 96C71.16 96 64 103.2 64 112V112zM176 224C181.4 224 186.7 224.2 192 224.7V112C192 103.2 184.8 96 176 96C167.2 96 160 103.2 160 112V224.7C165.3 224.2 170.6 224 176 224zM256 243.2C267.4 249 278.2 256.1 288 264.2V112C288 103.2 280.8 96 272 96C263.2 96 256 103.2 256 112V243.2zM352 112V304C352 312.8 359.2 320 368 320C376.8 320 384 312.8 384 304V112C384 103.2 376.8 96 368 96C359.2 96 352 103.2 352 112zM480 112C480 103.2 472.8 96 464 96C455.2 96 448 103.2 448 112V304C448 312.8 455.2 320 464 320C472.8 320 480 312.8 480 304V112zM96 400C96 355.8 131.8 320 176 320C220.2 320 256 355.8 256 400C256 444.2 220.2 480 176 480C131.8 480 96 444.2 96 400zM176 432C193.7 432 208 417.7 208 400C208 382.3 193.7 368 176 368C158.3 368 144 382.3 144 400C144 417.7 158.3 432 176 432z"],train:[448,512,[128646],"f238","M352 0C405 0 448 42.98 448 96V352C448 399.1 412.8 439.7 366.9 446.9L412.9 492.9C419.9 499.9 414.9 512 404.1 512H365.3C356.8 512 348.6 508.6 342.6 502.6L288 448H160L105.4 502.6C99.37 508.6 91.23 512 82.75 512H43.04C33.06 512 28.06 499.9 35.12 492.9L81.14 446.9C35.18 439.7 0 399.1 0 352V96C0 42.98 42.98 0 96 0H352zM64 192C64 209.7 78.33 224 96 224H352C369.7 224 384 209.7 384 192V96C384 78.33 369.7 64 352 64H96C78.33 64 64 78.33 64 96V192zM224 384C250.5 384 272 362.5 272 336C272 309.5 250.5 288 224 288C197.5 288 176 309.5 176 336C176 362.5 197.5 384 224 384z"],"train-subway":[448,512,["subway"],"f239","M352 0C405 0 448 42.98 448 96V352C448 399.1 412.8 439.7 366.9 446.9L412.9 492.9C419.9 499.9 414.9 512 404.1 512H365.3C356.8 512 348.6 508.6 342.6 502.6L288 448H160L105.4 502.6C99.37 508.6 91.23 512 82.75 512H43.04C33.06 512 28.06 499.9 35.12 492.9L81.14 446.9C35.18 439.7 0 399.1 0 352V96C0 42.98 42.98 0 96 0H352zM64 224C64 241.7 78.33 256 96 256H176C193.7 256 208 241.7 208 224V128C208 110.3 193.7 96 176 96H96C78.33 96 64 110.3 64 128V224zM272 96C254.3 96 240 110.3 240 128V224C240 241.7 254.3 256 272 256H352C369.7 256 384 241.7 384 224V128C384 110.3 369.7 96 352 96H272zM96 320C78.33 320 64 334.3 64 352C64 369.7 78.33 384 96 384C113.7 384 128 369.7 128 352C128 334.3 113.7 320 96 320zM352 384C369.7 384 384 369.7 384 352C384 334.3 369.7 320 352 320C334.3 320 320 334.3 320 352C320 369.7 334.3 384 352 384z"],"train-tram":[448,512,[128650],"e5b4","M86.76 48C74.61 48 63.12 53.52 55.53 63.01L42.74 78.99C34.46 89.34 19.36 91.02 9.007 82.74C-1.343 74.46-3.021 59.36 5.259 49.01L18.04 33.03C34.74 12.15 60.03 0 86.76 0H361.2C387.1 0 413.3 12.15 429.1 33.03L442.7 49.01C451 59.36 449.3 74.46 438.1 82.74C428.6 91.02 413.5 89.34 405.3 78.99L392.5 63.01C384.9 53.52 373.4 48 361.2 48H248V96H288C341 96 384 138.1 384 192V352C384 382.6 369.7 409.8 347.4 427.4L412.9 492.9C419.9 499.9 414.9 512 404.1 512H365.3C356.8 512 348.6 508.6 342.6 502.6L288 448H160L105.4 502.6C99.37 508.6 91.23 512 82.74 512H43.04C33.06 512 28.06 499.9 35.12 492.9L100.6 427.4C78.3 409.8 64 382.6 64 352V192C64 138.1 106.1 96 160 96H200V48H86.76zM160 160C142.3 160 128 174.3 128 192V224C128 241.7 142.3 256 160 256H288C305.7 256 320 241.7 320 224V192C320 174.3 305.7 160 288 160H160zM160 320C142.3 320 128 334.3 128 352C128 369.7 142.3 384 160 384C177.7 384 192 369.7 192 352C192 334.3 177.7 320 160 320zM288 384C305.7 384 320 369.7 320 352C320 334.3 305.7 320 288 320C270.3 320 256 334.3 256 352C256 369.7 270.3 384 288 384z"],transgender:[512,512,[9895,"transgender-alt"],"f225","M498.6 .0003h-94.37c-17.96 0-26.95 21.71-14.25 34.41L411.1 55.61l-67.01 67.01C318.8 105.9 288.6 96 256 96S193.2 105.9 167.9 122.6L151.6 106.3l6.061-6.062c6.25-6.248 6.25-16.38 0-22.63L146.3 66.34c-6.25-6.248-16.38-6.248-22.63 0L117.7 72.41L100.9 55.61L122.1 34.41c12.7-12.7 3.703-34.41-14.25-34.41H13.44C6.016 .0003 0 6.016 0 13.44v94.37c0 17.96 21.71 26.95 34.41 14.25l21.2-21.2l16.8 16.8L66.35 123.7c-6.25 6.248-6.25 16.38 0 22.63l11.31 11.31c6.25 6.248 16.38 6.248 22.63 0l6.061-6.061L122.6 167.9C105.9 193.2 96 223.4 96 256c0 77.4 54.97 141.9 128 156.8v19.23l-16-.0014c-8.836 0-16 7.165-16 16v15.1c0 8.836 7.164 16 16 16L224 480v16c0 8.836 7.164 16 16 16h32c8.836 0 16-7.164 16-16v-16l16-.0001c8.836 0 16-7.164 16-16v-15.1c0-8.836-7.164-16-16-16L288 432v-19.23c73.03-14.83 128-79.37 128-156.8c0-32.6-9.867-62.85-26.61-88.14l67.01-67.01l21.2 21.2C490.3 134.8 512 125.8 512 107.8V13.44C512 6.016 505.1 .0003 498.6 .0003zM256 336c-44.11 0-80-35.89-80-80c0-44.11 35.89-80 80-80c44.11 0 80 35.89 80 80C336 300.1 300.1 336 256 336z"],trash:[448,512,[],"f1f8","M135.2 17.69C140.6 6.848 151.7 0 163.8 0H284.2C296.3 0 307.4 6.848 312.8 17.69L320 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H128L135.2 17.69zM394.8 466.1C393.2 492.3 372.3 512 346.9 512H101.1C75.75 512 54.77 492.3 53.19 466.1L31.1 128H416L394.8 466.1z"],"trash-arrow-up":[448,512,["trash-restore"],"f829","M284.2 0C296.3 0 307.4 6.848 312.8 17.69L320 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H128L135.2 17.69C140.6 6.848 151.7 0 163.8 0H284.2zM31.1 128H416L394.8 466.1C393.2 492.3 372.3 512 346.9 512H101.1C75.75 512 54.77 492.3 53.19 466.1L31.1 128zM207 199L127 279C117.7 288.4 117.7 303.6 127 312.1C136.4 322.3 151.6 322.3 160.1 312.1L199.1 273.9V408C199.1 421.3 210.7 432 223.1 432C237.3 432 248 421.3 248 408V273.9L287 312.1C296.4 322.3 311.6 322.3 320.1 312.1C330.3 303.6 330.3 288.4 320.1 279L240.1 199C236.5 194.5 230.4 191.1 223.1 191.1C217.6 191.1 211.5 194.5 207 199V199z"],"trash-can":[448,512,[61460,"trash-alt"],"f2ed","M135.2 17.69C140.6 6.848 151.7 0 163.8 0H284.2C296.3 0 307.4 6.848 312.8 17.69L320 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H128L135.2 17.69zM31.1 128H416V448C416 483.3 387.3 512 352 512H95.1C60.65 512 31.1 483.3 31.1 448V128zM111.1 208V432C111.1 440.8 119.2 448 127.1 448C136.8 448 143.1 440.8 143.1 432V208C143.1 199.2 136.8 192 127.1 192C119.2 192 111.1 199.2 111.1 208zM207.1 208V432C207.1 440.8 215.2 448 223.1 448C232.8 448 240 440.8 240 432V208C240 199.2 232.8 192 223.1 192C215.2 192 207.1 199.2 207.1 208zM304 208V432C304 440.8 311.2 448 320 448C328.8 448 336 440.8 336 432V208C336 199.2 328.8 192 320 192C311.2 192 304 199.2 304 208z"],"trash-can-arrow-up":[448,512,["trash-restore-alt"],"f82a","M284.2 0C296.3 0 307.4 6.848 312.8 17.69L320 32H416C433.7 32 448 46.33 448 64C448 81.67 433.7 96 416 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H128L135.2 17.69C140.6 6.848 151.7 0 163.8 0H284.2zM31.1 128H416V448C416 483.3 387.3 512 352 512H95.1C60.65 512 31.1 483.3 31.1 448V128zM207 199L127 279C117.7 288.4 117.7 303.6 127 312.1C136.4 322.3 151.6 322.3 160.1 312.1L199.1 273.9V408C199.1 421.3 210.7 432 223.1 432C237.3 432 248 421.3 248 408V273.9L287 312.1C296.4 322.3 311.6 322.3 320.1 312.1C330.3 303.6 330.3 288.4 320.1 279L240.1 199C236.5 194.5 230.4 191.1 223.1 191.1C217.6 191.1 211.5 194.5 207 199V199z"],tree:[448,512,[127794],"f1bb","M413.8 447.1L256 448l0 31.99C256 497.7 241.8 512 224.1 512c-17.67 0-32.1-14.32-32.1-31.99l0-31.99l-158.9-.0099c-28.5 0-43.69-34.49-24.69-56.4l68.98-79.59H62.22c-25.41 0-39.15-29.8-22.67-49.13l60.41-70.85H89.21c-21.28 0-32.87-22.5-19.28-37.31l134.8-146.5c10.4-11.3 28.22-11.3 38.62-.0033l134.9 146.5c13.62 14.81 2.001 37.31-19.28 37.31h-10.77l60.35 70.86c16.46 19.34 2.716 49.12-22.68 49.12h-15.2l68.98 79.59C458.7 413.7 443.1 447.1 413.8 447.1z"],"tree-city":[640,512,[],"e587","M288 48C288 21.49 309.5 0 336 0H432C458.5 0 480 21.49 480 48V192H520V120C520 106.7 530.7 96 544 96C557.3 96 568 106.7 568 120V192H592C618.5 192 640 213.5 640 240V464C640 490.5 618.5 512 592 512H336C309.5 512 288 490.5 288 464V48zM352 112C352 120.8 359.2 128 368 128H400C408.8 128 416 120.8 416 112V80C416 71.16 408.8 64 400 64H368C359.2 64 352 71.16 352 80V112zM368 160C359.2 160 352 167.2 352 176V208C352 216.8 359.2 224 368 224H400C408.8 224 416 216.8 416 208V176C416 167.2 408.8 160 400 160H368zM352 304C352 312.8 359.2 320 368 320H400C408.8 320 416 312.8 416 304V272C416 263.2 408.8 256 400 256H368C359.2 256 352 263.2 352 272V304zM528 256C519.2 256 512 263.2 512 272V304C512 312.8 519.2 320 528 320H560C568.8 320 576 312.8 576 304V272C576 263.2 568.8 256 560 256H528zM512 400C512 408.8 519.2 416 528 416H560C568.8 416 576 408.8 576 400V368C576 359.2 568.8 352 560 352H528C519.2 352 512 359.2 512 368V400zM224 160C224 166 223 171 222 176C242 190 256 214 256 240C256 285 220 320 176 320H160V480C160 498 145 512 128 512C110 512 96 498 96 480V320H80C35 320 0 285 0 240C0 214 13 190 33 176C32 171 32 166 32 160C32 107 74 64 128 64C181 64 224 107 224 160z"],"triangle-exclamation":[512,512,[9888,"exclamation-triangle","warning"],"f071","M506.3 417l-213.3-364c-16.33-28-57.54-28-73.98 0l-213.2 364C-10.59 444.9 9.849 480 42.74 480h426.6C502.1 480 522.6 445 506.3 417zM232 168c0-13.25 10.75-24 24-24S280 154.8 280 168v128c0 13.25-10.75 24-23.1 24S232 309.3 232 296V168zM256 416c-17.36 0-31.44-14.08-31.44-31.44c0-17.36 14.07-31.44 31.44-31.44s31.44 14.08 31.44 31.44C287.4 401.9 273.4 416 256 416z"],trophy:[576,512,[127942],"f091","M572.1 82.38C569.5 71.59 559.8 64 548.7 64h-100.8c.2422-12.45 .1078-23.7-.1559-33.02C447.3 13.63 433.2 0 415.8 0H160.2C142.8 0 128.7 13.63 128.2 30.98C127.1 40.3 127.8 51.55 128.1 64H27.26C16.16 64 6.537 71.59 3.912 82.38C3.1 85.78-15.71 167.2 37.07 245.9c37.44 55.82 100.6 95.03 187.5 117.4c18.7 4.805 31.41 22.06 31.41 41.37C256 428.5 236.5 448 212.6 448H208c-26.51 0-47.99 21.49-47.99 48c0 8.836 7.163 16 15.1 16h223.1c8.836 0 15.1-7.164 15.1-16c0-26.51-21.48-48-47.99-48h-4.644c-23.86 0-43.36-19.5-43.36-43.35c0-19.31 12.71-36.57 31.41-41.37c86.96-22.34 150.1-61.55 187.5-117.4C591.7 167.2 572.9 85.78 572.1 82.38zM77.41 219.8C49.47 178.6 47.01 135.7 48.38 112h80.39c5.359 59.62 20.35 131.1 57.67 189.1C137.4 281.6 100.9 254.4 77.41 219.8zM498.6 219.8c-23.44 34.6-59.94 61.75-109 81.22C426.9 243.1 441.9 171.6 447.2 112h80.39C528.1 135.7 526.5 178.7 498.6 219.8z"],trowel:[512,512,[],"e589","M343.9 213.4L245.3 312L310.6 377.4C318.5 385.3 321.8 396.8 319.1 407.6C316.4 418.5 308.2 427.2 297.5 430.5L41.55 510.5C30.18 514.1 17.79 511 9.373 502.6C.9565 494.2-2.093 481.8 1.458 470.5L81.46 214.5C84.8 203.8 93.48 195.6 104.4 192.9C115.2 190.3 126.7 193.5 134.6 201.4L200 266.7L298.6 168.1C284.4 153.5 284.5 130.1 298.9 115.6L394.4 20.18C421.3-6.728 464.9-6.728 491.8 20.18C518.7 47.1 518.7 90.73 491.8 117.6L396.4 213.1C381.9 227.5 358.5 227.6 343.9 213.4V213.4z"],"trowel-bricks":[512,512,[],"e58a","M240.8 4.779C250.3 10.61 256 20.91 256 32V104H345C348.6 90.2 361.1 80 376 80H464C490.5 80 512 101.5 512 128C512 154.5 490.5 176 464 176H376C361.1 176 348.6 165.8 345 152H256V224C256 235.1 250.3 245.4 240.8 251.2C231.4 257.1 219.6 257.6 209.7 252.6L17.69 156.6C6.848 151.2 0 140.1 0 128C0 115.9 6.848 104.8 17.69 99.38L209.7 3.378C219.6-1.581 231.4-1.051 240.8 4.779V4.779zM288 256C288 238.3 302.3 224 320 224H480C497.7 224 512 238.3 512 256V320C512 337.7 497.7 352 480 352H320C302.3 352 288 337.7 288 320V256zM128 384C145.7 384 160 398.3 160 416V480C160 497.7 145.7 512 128 512H32C14.33 512 0 497.7 0 480V416C0 398.3 14.33 384 32 384H128zM480 384C497.7 384 512 398.3 512 416V480C512 497.7 497.7 512 480 512H224C206.3 512 192 497.7 192 480V416C192 398.3 206.3 384 224 384H480z"],truck:[640,512,[128666,9951],"f0d1","M368 0C394.5 0 416 21.49 416 48V96H466.7C483.7 96 499.1 102.7 512 114.7L589.3 192C601.3 204 608 220.3 608 237.3V352C625.7 352 640 366.3 640 384C640 401.7 625.7 416 608 416H576C576 469 533 512 480 512C426.1 512 384 469 384 416H256C256 469 213 512 160 512C106.1 512 64 469 64 416H48C21.49 416 0 394.5 0 368V48C0 21.49 21.49 0 48 0H368zM416 160V256H544V237.3L466.7 160H416zM160 368C133.5 368 112 389.5 112 416C112 442.5 133.5 464 160 464C186.5 464 208 442.5 208 416C208 389.5 186.5 368 160 368zM480 464C506.5 464 528 442.5 528 416C528 389.5 506.5 368 480 368C453.5 368 432 389.5 432 416C432 442.5 453.5 464 480 464z"],"truck-arrow-right":[640,512,[],"e58b","M0 48C0 21.49 21.49 0 48 0H368C394.5 0 416 21.49 416 48V96H466.7C483.7 96 499.1 102.7 512 114.7L589.3 192C601.3 204 608 220.3 608 237.3V352C625.7 352 640 366.3 640 384C640 401.7 625.7 416 608 416H576C576 469 533 512 480 512C426.1 512 384 469 384 416H256C256 469 213 512 160 512C106.1 512 64 469 64 416H48C21.49 416 0 394.5 0 368V48zM544 256V237.3L466.7 160H416V256H544zM160 464C186.5 464 208 442.5 208 416C208 389.5 186.5 368 160 368C133.5 368 112 389.5 112 416C112 442.5 133.5 464 160 464zM480 368C453.5 368 432 389.5 432 416C432 442.5 453.5 464 480 464C506.5 464 528 442.5 528 416C528 389.5 506.5 368 480 368zM256.1 95.03C247.6 85.66 232.4 85.66 223 95.03C213.7 104.4 213.7 119.6 223 128.1L262.1 168H96C82.75 168 72 178.7 72 192C72 205.3 82.75 216 96 216H262.1L223 255C213.7 264.4 213.7 279.6 223 288.1C232.4 298.3 247.6 298.3 256.1 288.1L336.1 208.1C346.3 199.6 346.3 184.4 336.1 175L256.1 95.03z"],"truck-droplet":[640,512,[],"e58c","M0 48C0 21.49 21.49 0 48 0H368C394.5 0 416 21.49 416 48V96H466.7C483.7 96 499.1 102.7 512 114.7L589.3 192C601.3 204 608 220.3 608 237.3V352C625.7 352 640 366.3 640 384C640 401.7 625.7 416 608 416H576C576 469 533 512 480 512C426.1 512 384 469 384 416H256C256 469 213 512 160 512C106.1 512 64 469 64 416H48C21.49 416 0 394.5 0 368V48zM544 256V237.3L466.7 160H416V256H544zM160 464C186.5 464 208 442.5 208 416C208 389.5 186.5 368 160 368C133.5 368 112 389.5 112 416C112 442.5 133.5 464 160 464zM480 368C453.5 368 432 389.5 432 416C432 442.5 453.5 464 480 464C506.5 464 528 442.5 528 416C528 389.5 506.5 368 480 368zM208 272C247.8 272 280 242.4 280 205.1C280 179 240.6 123 220.1 95.71C213.1 87.54 202 87.54 195.9 95.71C175.4 123 136 179 136 205.1C136 242.4 168.2 272 208 272V272z"],"truck-fast":[640,512,["shipping-fast"],"f48b","M112 0C85.49 0 64 21.49 64 48V96H16C7.163 96 0 103.2 0 112C0 120.8 7.163 128 16 128H272C280.8 128 288 135.2 288 144C288 152.8 280.8 160 272 160H48C39.16 160 32 167.2 32 176C32 184.8 39.16 192 48 192H240C248.8 192 256 199.2 256 208C256 216.8 248.8 224 240 224H16C7.163 224 0 231.2 0 240C0 248.8 7.163 256 16 256H208C216.8 256 224 263.2 224 272C224 280.8 216.8 288 208 288H64V416C64 469 106.1 512 160 512C213 512 256 469 256 416H384C384 469 426.1 512 480 512C533 512 576 469 576 416H608C625.7 416 640 401.7 640 384C640 366.3 625.7 352 608 352V237.3C608 220.3 601.3 204 589.3 192L512 114.7C499.1 102.7 483.7 96 466.7 96H416V48C416 21.49 394.5 0 368 0H112zM544 237.3V256H416V160H466.7L544 237.3zM160 464C133.5 464 112 442.5 112 416C112 389.5 133.5 368 160 368C186.5 368 208 389.5 208 416C208 442.5 186.5 464 160 464zM528 416C528 442.5 506.5 464 480 464C453.5 464 432 442.5 432 416C432 389.5 453.5 368 480 368C506.5 368 528 389.5 528 416z"],"truck-field":[640,512,[],"e58d","M32 96C32 60.65 60.65 32 96 32H320C343.7 32 364.4 44.87 375.4 64H427.2C452.5 64 475.4 78.9 485.7 102L538.5 220.8C538.1 221.9 539.4 222.9 539.8 223.1H544C579.3 223.1 608 252.7 608 287.1V319.1C625.7 319.1 640 334.3 640 352C640 369.7 625.7 384 608 384H576C576 437 533 480 480 480C426.1 480 384 437 384 384H256C256 437 213 480 160 480C106.1 480 64 437 64 384H32C14.33 384 0 369.7 0 352C0 334.3 14.33 319.1 32 319.1V287.1C14.33 287.1 0 273.7 0 255.1V159.1C0 142.3 14.33 127.1 32 127.1V96zM469.9 224L427.2 128H384V224H469.9zM160 432C186.5 432 208 410.5 208 384C208 357.5 186.5 336 160 336C133.5 336 112 357.5 112 384C112 410.5 133.5 432 160 432zM480 336C453.5 336 432 357.5 432 384C432 410.5 453.5 432 480 432C506.5 432 528 410.5 528 384C528 357.5 506.5 336 480 336z"],"truck-field-un":[640,512,[],"e58e","M320 32C343.7 32 364.4 44.87 375.4 64H427.2C452.5 64 475.4 78.9 485.7 102L538.5 220.8C538.1 221.9 539.4 222.9 539.8 224H544C579.3 224 608 252.7 608 288V320C625.7 320 640 334.3 640 352C640 369.7 625.7 384 608 384H576C576 437 533 480 480 480C426.1 480 384 437 384 384H256C256 437 213 480 160 480C106.1 480 64 437 64 384H32C14.33 384 0 369.7 0 352C0 334.3 14.33 320 32 320V288C14.33 288 0 273.7 0 256V160C0 142.3 14.33 128 32 128V96C32 60.65 60.65 32 96 32L320 32zM384 128V224H469.9L427.2 128H384zM160 336C133.5 336 112 357.5 112 384C112 410.5 133.5 432 160 432C186.5 432 208 410.5 208 384C208 357.5 186.5 336 160 336zM480 432C506.5 432 528 410.5 528 384C528 357.5 506.5 336 480 336C453.5 336 432 357.5 432 384C432 410.5 453.5 432 480 432zM253.3 135.1C249.4 129.3 242.1 126.6 235.4 128.7C228.6 130.7 224 136.9 224 144V240C224 248.8 231.2 256 240 256C248.8 256 256 248.8 256 240V196.8L290.7 248.9C294.6 254.7 301.9 257.4 308.6 255.3C315.4 253.3 320 247.1 320 240V144C320 135.2 312.8 128 304 128C295.2 128 288 135.2 288 144V187.2L253.3 135.1zM128 144C128 135.2 120.8 128 112 128C103.2 128 96 135.2 96 144V208C96 234.5 117.5 256 144 256C170.5 256 192 234.5 192 208V144C192 135.2 184.8 128 176 128C167.2 128 160 135.2 160 144V208C160 216.8 152.8 224 144 224C135.2 224 128 216.8 128 208V144z"],"truck-front":[512,512,[],"e2b7","M0 80C0 35.82 35.82 0 80 0H432C476.2 0 512 35.82 512 80V368C512 394.2 499.4 417.4 480 432V480C480 497.7 465.7 512 448 512H416C398.3 512 384 497.7 384 480V448H128V480C128 497.7 113.7 512 96 512H64C46.33 512 32 497.7 32 480V432C12.57 417.4 0 394.2 0 368V80zM129.9 152.2L112 224H400L382.1 152.2C378.5 137.1 365.7 128 351 128H160.1C146.3 128 133.5 137.1 129.9 152.2H129.9zM96 288C78.33 288 64 302.3 64 320C64 337.7 78.33 352 96 352C113.7 352 128 337.7 128 320C128 302.3 113.7 288 96 288zM416 352C433.7 352 448 337.7 448 320C448 302.3 433.7 288 416 288C398.3 288 384 302.3 384 320C384 337.7 398.3 352 416 352z"],"truck-medical":[640,512,[128657,"ambulance"],"f0f9","M368 0C394.5 0 416 21.49 416 48V96H466.7C483.7 96 499.1 102.7 512 114.7L589.3 192C601.3 204 608 220.3 608 237.3V352C625.7 352 640 366.3 640 384C640 401.7 625.7 416 608 416H576C576 469 533 512 480 512C426.1 512 384 469 384 416H256C256 469 213 512 160 512C106.1 512 64 469 64 416H48C21.49 416 0 394.5 0 368V48C0 21.49 21.49 0 48 0H368zM416 160V256H544V237.3L466.7 160H416zM160 368C133.5 368 112 389.5 112 416C112 442.5 133.5 464 160 464C186.5 464 208 442.5 208 416C208 389.5 186.5 368 160 368zM480 464C506.5 464 528 442.5 528 416C528 389.5 506.5 368 480 368C453.5 368 432 389.5 432 416C432 442.5 453.5 464 480 464zM112 176C112 184.8 119.2 192 128 192H176V240C176 248.8 183.2 256 192 256H224C232.8 256 240 248.8 240 240V192H288C296.8 192 304 184.8 304 176V144C304 135.2 296.8 128 288 128H240V80C240 71.16 232.8 64 224 64H192C183.2 64 176 71.16 176 80V128H128C119.2 128 112 135.2 112 144V176z"],"truck-monster":[640,512,[],"f63b","M419.2 25.6L496 128H576C593.7 128 608 142.3 608 160V224C625.7 224 640 238.3 640 256C640 273.7 625.7 287.1 608 288C578.8 249.1 532.3 224 480 224C427.7 224 381.2 249.1 351.1 288H288C258.8 249.1 212.3 224 160 224C107.7 224 61.18 249.1 31.99 288C14.32 287.1 0 273.7 0 256C0 238.3 14.33 224 32 224V160C32 142.3 46.33 128 64 128H224V48C224 21.49 245.5 0 272 0H368C388.1 0 407.1 9.484 419.2 25.6H419.2zM288 128H416L368 64H288V128zM168 256C180.1 256 190.1 264.9 191.8 276.6C199.4 278.8 206.7 281.9 213.5 285.6C222.9 278.5 236.3 279.3 244.9 287.8L256.2 299.1C264.7 307.7 265.5 321.1 258.4 330.5C262.1 337.3 265.2 344.6 267.4 352.2C279.1 353.9 288 363.9 288 376V392C288 404.1 279.1 414.1 267.4 415.8C265.2 423.4 262.1 430.7 258.4 437.5C265.5 446.9 264.7 460.3 256.2 468.9L244.9 480.2C236.3 488.7 222.9 489.5 213.5 482.4C206.7 486.1 199.4 489.2 191.8 491.4C190.1 503.1 180.1 512 167.1 512H151.1C139.9 512 129.9 503.1 128.2 491.4C120.6 489.2 113.3 486.1 106.5 482.4C97.09 489.5 83.7 488.7 75.15 480.2L63.83 468.9C55.28 460.3 54.53 446.9 61.58 437.5C57.85 430.7 54.81 423.4 52.57 415.8C40.94 414.1 31.1 404.1 31.1 392V376C31.1 363.9 40.94 353.9 52.57 352.2C54.81 344.6 57.85 337.3 61.58 330.5C54.53 321.1 55.28 307.7 63.83 299.1L75.15 287.8C83.7 279.3 97.09 278.5 106.5 285.6C113.3 281.9 120.6 278.8 128.2 276.6C129.9 264.9 139.9 255.1 151.1 255.1L168 256zM160 432C186.5 432 208 410.5 208 384C208 357.5 186.5 336 160 336C133.5 336 112 357.5 112 384C112 410.5 133.5 432 160 432zM448.2 276.6C449.9 264.9 459.9 256 472 256H488C500.1 256 510.1 264.9 511.8 276.6C519.4 278.8 526.7 281.9 533.5 285.6C542.9 278.5 556.3 279.3 564.9 287.8L576.2 299.1C584.7 307.7 585.5 321.1 578.4 330.5C582.1 337.3 585.2 344.6 587.4 352.2C599.1 353.9 608 363.9 608 376V392C608 404.1 599.1 414.1 587.4 415.8C585.2 423.4 582.1 430.7 578.4 437.5C585.5 446.9 584.7 460.3 576.2 468.9L564.9 480.2C556.3 488.7 542.9 489.5 533.5 482.4C526.7 486.1 519.4 489.2 511.8 491.4C510.1 503.1 500.1 512 488 512H472C459.9 512 449.9 503.1 448.2 491.4C440.6 489.2 433.3 486.1 426.5 482.4C417.1 489.5 403.7 488.7 395.1 480.2L383.8 468.9C375.3 460.3 374.5 446.9 381.6 437.5C377.9 430.7 374.8 423.4 372.6 415.8C360.9 414.1 352 404.1 352 392V376C352 363.9 360.9 353.9 372.6 352.2C374.8 344.6 377.9 337.3 381.6 330.5C374.5 321.1 375.3 307.7 383.8 299.1L395.1 287.8C403.7 279.3 417.1 278.5 426.5 285.6C433.3 281.9 440.6 278.8 448.2 276.6L448.2 276.6zM480 336C453.5 336 432 357.5 432 384C432 410.5 453.5 432 480 432C506.5 432 528 410.5 528 384C528 357.5 506.5 336 480 336z"],"truck-moving":[640,512,[],"f4df","M416 32C451.3 32 480 60.65 480 96V144H528.8C545.6 144 561.5 151.5 572.2 164.5L630.1 236.4C636.8 243.5 640 252.5 640 261.7V352C640 369.7 625.7 384 608 384H606.4C607.4 389.2 608 394.5 608 400C608 444.2 572.2 480 528 480C483.8 480 448 444.2 448 400C448 394.5 448.6 389.2 449.6 384H286.4C287.4 389.2 288 394.5 288 400C288 444.2 252.2 480 208 480C181.8 480 158.6 467.4 144 448C129.4 467.4 106.2 480 80 480C35.82 480 0 444.2 0 400V96C0 60.65 28.65 32 64 32H416zM535 194.9C533.5 193.1 531.2 192 528.8 192H480V256H584.1L535 194.9zM528 432C545.7 432 560 417.7 560 400C560 382.3 545.7 368 528 368C510.3 368 496 382.3 496 400C496 417.7 510.3 432 528 432zM208 368C190.3 368 176 382.3 176 400C176 417.7 190.3 432 208 432C225.7 432 240 417.7 240 400C240 382.3 225.7 368 208 368zM80 432C97.67 432 112 417.7 112 400C112 382.3 97.67 368 80 368C62.33 368 48 382.3 48 400C48 417.7 62.33 432 80 432z"],"truck-pickup":[640,512,[128763],"f63c","M272 32H368.6C388.1 32 406.5 40.84 418.6 56.02L527.4 192H576C593.7 192 608 206.3 608 224V288C625.7 288 640 302.3 640 320C640 337.7 625.7 352 608 352H574.9C575.6 357.2 576 362.6 576 368C576 429.9 525.9 480 464 480C402.1 480 352 429.9 352 368C352 362.6 352.4 357.2 353.1 352H286.9C287.6 357.2 288 362.6 288 368C288 429.9 237.9 480 176 480C114.1 480 64 429.9 64 368C64 362.6 64.39 357.2 65.13 352H32C14.33 352 0 337.7 0 320C0 302.3 14.33 288 32 288V224C32 206.3 46.33 192 64 192H224V80C224 53.49 245.5 32 272 32H272zM368.6 96H288V192H445.4L368.6 96zM176 416C202.5 416 224 394.5 224 368C224 341.5 202.5 320 176 320C149.5 320 128 341.5 128 368C128 394.5 149.5 416 176 416zM464 416C490.5 416 512 394.5 512 368C512 341.5 490.5 320 464 320C437.5 320 416 341.5 416 368C416 394.5 437.5 416 464 416z"],"truck-plane":[640,512,[],"e58f","M256 86.06L256 182.9L256 184V411.5L256.1 411.6C257.3 433.8 269.8 452.9 288 463.4V496C288 501.2 288.8 506.3 290.4 510.1L200 480.9L109.1 511.2C104.2 512.8 98.82 511.1 94.64 508.1C90.47 505.1 88 501.1 88 496V464C88 459.1 90.21 454.5 94 451.5L144 411.5V330.3L20.6 367.3C15.75 368.8 10.51 367.9 6.449 364.8C2.391 361.8 0 357.1 0 352V288C0 282.4 2.949 277.2 7.768 274.3L144 192.5V86.06C144 54.68 169.4 0 200 0C231.5 0 256 54.68 256 86.06V86.06zM288 176C288 149.5 309.5 128 336 128H592C618.5 128 640 149.5 640 176V400C640 420.9 626.6 438.7 608 445.3V488C608 501.3 597.3 512 584 512H568C554.7 512 544 501.3 544 488V448H384V488C384 501.3 373.3 512 360 512H344C330.7 512 320 501.3 320 488V445.3C301.4 438.7 288 420.9 288 400V176zM367.8 254.7L352 304H576L560.2 254.7C556.9 246 548.9 240 539.7 240H388.3C379.1 240 371.1 246 367.8 254.7H367.8zM568 400C581.3 400 592 389.3 592 376C592 362.7 581.3 352 568 352C554.7 352 544 362.7 544 376C544 389.3 554.7 400 568 400zM360 352C346.7 352 336 362.7 336 376C336 389.3 346.7 400 360 400C373.3 400 384 389.3 384 376C384 362.7 373.3 352 360 352z"],"truck-ramp-box":[640,512,["truck-loading"],"f4de","M640 .0003V400C640 461.9 589.9 512 528 512C467 512 417.5 463.3 416 402.7L48.41 502.9C31.36 507.5 13.77 497.5 9.126 480.4C4.48 463.4 14.54 445.8 31.59 441.1L352 353.8V64C352 28.65 380.7 0 416 0L640 .0003zM528 352C501.5 352 480 373.5 480 400C480 426.5 501.5 448 528 448C554.5 448 576 426.5 576 400C576 373.5 554.5 352 528 352zM23.11 207.7C18.54 190.6 28.67 173.1 45.74 168.5L92.1 156.1L112.8 233.4C115.1 241.9 123.9 246.1 132.4 244.7L163.3 236.4C171.8 234.1 176.9 225.3 174.6 216.8L153.9 139.5L200.3 127.1C217.4 122.5 234.9 132.7 239.5 149.7L280.9 304.3C285.5 321.4 275.3 338.9 258.3 343.5L103.7 384.9C86.64 389.5 69.1 379.3 64.52 362.3L23.11 207.7z"],tty:[512,512,["teletype"],"f1e4","M271.1 364v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40c0-6.625-5.375-12-12-12h-40C277.3 352 271.1 357.4 271.1 364zM367.1 364v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40c0-6.625-5.375-12-12-12h-40C373.3 352 367.1 357.4 367.1 364zM275.1 256h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.376 12 12 12h39.1c6.625 0 12-5.375 12-12v-40C287.1 261.4 282.6 256 275.1 256zM83.96 448h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40C95.96 453.4 90.59 448 83.96 448zM175.1 364v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40c0-6.625-5.375-12-12-12h-40C181.3 352 175.1 357.4 175.1 364zM371.1 256h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.372 12 11.1 12h39.1c6.625 0 12-5.375 12-12v-40C383.1 261.4 378.6 256 371.1 256zM467.1 256h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.369 12 11.99 12h39.1c6.625 0 12.01-5.375 12.01-12v-40C479.1 261.4 474.6 256 467.1 256zM371.1 448h-232c-6.625 0-12 5.375-12 12v40c0 6.625 5.375 12 12 12h232c6.625 0 12-5.375 12-12v-40C383.1 453.4 378.6 448 371.1 448zM179.1 256h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.38 12 12 12h39.1c6.625 0 11.1-5.375 11.1-12v-40C191.1 261.4 186.6 256 179.1 256zM467.1 448h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40C479.1 453.4 474.6 448 467.1 448zM79.96 364v40c0 6.625 5.375 12 12 12h40c6.625 0 12-5.375 12-12v-40c0-6.625-5.375-12-12-12h-40C85.34 352 79.96 357.4 79.96 364zM83.96 256h-40c-6.625 0-12 5.375-12 12v40c0 6.625 5.383 12 12.01 12H83.97c6.625 0 11.99-5.375 11.99-12v-40C95.96 261.4 90.59 256 83.96 256zM504.9 102.9C367.7-34.31 144.3-34.32 7.083 102.9c-7.975 7.973-9.375 20.22-3.391 29.74l42.17 67.47c6.141 9.844 18.47 13.88 29.35 9.632l84.36-33.74C169.5 172.1 175.6 161.1 174.5 151.3l-5.303-53.27c56.15-19.17 117.4-19.17 173.6 .0059L337.5 151.3c-1.139 10.59 4.997 20.78 14.96 24.73l84.35 33.73c10.83 4.303 23.22 .1608 29.33-9.615l42.18-67.48C514.3 123.2 512.9 110.9 504.9 102.9z"],"turkish-lira-sign":[384,512,["try","turkish-lira"],"e2bb","M96 32C113.7 32 128 46.33 128 64V99.29L247.2 65.23C264.2 60.38 281.9 70.22 286.8 87.21C291.6 104.2 281.8 121.9 264.8 126.8L128 165.9V195.3L247.2 161.2C264.2 156.4 281.9 166.2 286.8 183.2C291.6 200.2 281.8 217.9 264.8 222.8L128 261.9V416H191.8C260 416 316.2 362.5 319.6 294.4L320 286.4C320.9 268.8 335.9 255.2 353.6 256C371.2 256.9 384.8 271.9 383.1 289.6L383.6 297.6C378.5 399.8 294.1 480 191.8 480H96C78.33 480 64 465.7 64 448V280.1L40.79 286.8C23.8 291.6 6.087 281.8 1.232 264.8C-3.623 247.8 6.217 230.1 23.21 225.2L64 213.6V184.1L40.79 190.8C23.8 195.6 6.087 185.8 1.232 168.8C-3.623 151.8 6.216 134.1 23.21 129.2L64 117.6V64C64 46.33 78.33 32 96 32L96 32z"],"turn-down":[384,512,[10549,"level-down-alt"],"f3be","M313.6 392.3l-104 112c-9.5 10.23-25.69 10.23-35.19 0l-104-112c-6.484-6.984-8.219-17.17-4.406-25.92S78.45 352 88 352H160V80C160 71.19 152.8 64 144 64H32C14.33 64 0 49.69 0 32s14.33-32 32-32h112C188.1 0 224 35.88 224 80V352h72c9.547 0 18.19 5.656 22 14.41S320.1 385.3 313.6 392.3z"],"turn-up":[384,512,[10548,"level-up-alt"],"f3bf","M318 145.6c-3.812 8.75-12.45 14.41-22 14.41L224 160v272c0 44.13-35.89 80-80 80H32c-17.67 0-32-14.31-32-32s14.33-32 32-32h112C152.8 448 160 440.8 160 432V160L88 159.1c-9.547 0-18.19-5.656-22-14.41S63.92 126.7 70.41 119.7l104-112c9.498-10.23 25.69-10.23 35.19 0l104 112C320.1 126.7 321.8 136.8 318 145.6z"],tv:[640,512,[63717,"television","tv-alt"],"f26c","M512 448H127.1C110.3 448 96 462.3 96 479.1S110.3 512 127.1 512h384C529.7 512 544 497.7 544 480S529.7 448 512 448zM592 0h-544C21.5 0 0 21.5 0 48v320C0 394.5 21.5 416 48 416h544c26.5 0 48-21.5 48-48v-320C640 21.5 618.5 0 592 0zM576 352H64v-288h512V352z"],u:[384,512,[117],"55","M384 64.01v225.7c0 104.1-86.13 190.3-192 190.3s-192-85.38-192-190.3V64.01C0 46.34 14.33 32.01 32 32.01S64 46.34 64 64.01v225.7c0 69.67 57.42 126.3 128 126.3s128-56.67 128-126.3V64.01c0-17.67 14.33-32 32-32S384 46.34 384 64.01z"],umbrella:[576,512,[],"f0e9","M255.1 301.7v130.3c0 8.814-7.188 16-16 16c-7.814 0-13.19-5.314-15.1-10.69c-5.906-16.72-24.1-25.41-40.81-19.5c-16.69 5.875-25.41 24.19-19.5 40.79C175.8 490.6 206.2 512 239.1 512C284.1 512 320 476.1 320 431.1v-130.3c-9.094-7.908-19.81-13.61-32-13.61C275.7 288.1 265.6 292.9 255.1 301.7zM575.7 280.9C547.1 144.5 437.3 62.61 320 49.91V32.01c0-17.69-14.31-32.01-32-32.01S255.1 14.31 255.1 32.01v17.91C138.3 62.61 29.48 144.5 .2949 280.9C-1.926 290.1 8.795 302.1 18.98 292.2c52-55.01 107.7-52.39 158.6 37.01c5.312 9.502 14.91 8.625 19.72 0C217.5 293.9 242.2 256 287.1 256c58.5 0 88.19 68.82 90.69 73.2c4.812 8.625 14.41 9.502 19.72 0c51-89.52 107.1-91.39 158.6-37.01C567.3 302.2 577.9 290.1 575.7 280.9z"],"umbrella-beach":[640,512,[127958],"f5ca","M115.4 136.8l102.1 37.35c35.13-81.62 86.25-144.4 139-173.7c-95.88-4.875-188.8 36.96-248.5 111.7C101.2 120.6 105.2 133.2 115.4 136.8zM247.6 185l238.5 86.87c35.75-121.4 18.62-231.6-42.63-253.9c-7.375-2.625-15.12-4.062-23.12-4.062C362.4 13.88 292.1 83.13 247.6 185zM521.5 60.51c6.25 16.25 10.75 34.62 13.13 55.25c5.75 49.87-1.376 108.1-18.88 166.9l102.6 37.37c10.13 3.75 21.25-3.375 21.5-14.12C642.3 210.1 598 118.4 521.5 60.51zM528 448h-207l65-178.5l-60.13-21.87l-72.88 200.4H48C21.49 448 0 469.5 0 496C0 504.8 7.163 512 16 512h544c8.837 0 16-7.163 16-15.1C576 469.5 554.5 448 528 448z"],underline:[448,512,[],"f0cd","M416 448H32c-17.69 0-32 14.31-32 32s14.31 32 32 32h384c17.69 0 32-14.31 32-32S433.7 448 416 448zM48 64.01H64v160c0 88.22 71.78 159.1 160 159.1s160-71.78 160-159.1v-160h16c17.69 0 32-14.32 32-32s-14.31-31.1-32-31.1l-96-.0049c-17.69 0-32 14.32-32 32s14.31 32 32 32H320v160c0 52.94-43.06 95.1-96 95.1S128 276.1 128 224v-160h16c17.69 0 32-14.31 32-32s-14.31-32-32-32l-96 .0049c-17.69 0-32 14.31-32 31.1S30.31 64.01 48 64.01z"],"universal-access":[512,512,[],"f29a","M256 0C114.6 0 0 114.6 0 256c0 141.4 114.6 256 256 256s256-114.6 256-256C512 114.6 397.4 0 256 0zM256 80c22.09 0 40 17.91 40 40S278.1 160 256 160S216 142.1 216 120S233.9 80 256 80zM374.6 215.1L315.3 232C311.6 233.1 307.8 233.6 304 234.4v62.32l30.64 87.34c4.391 12.5-2.188 26.19-14.69 30.59C317.3 415.6 314.6 416 312 416c-9.906 0-19.19-6.188-22.64-16.06l-25.85-70.65c-2.562-7.002-12.46-7.002-15.03 0l-25.85 70.65C219.2 409.8 209.9 416 200 416c-2.641 0-5.312-.4375-7.953-1.344c-12.5-4.406-19.08-18.09-14.69-30.59L208 296.7V234.4C204.2 233.6 200.4 233.1 196.7 232L137.4 215.1C124.7 211.4 117.3 198.2 120.9 185.4S137.9 165.2 150.6 168.9l59.25 16.94c30.17 8.623 62.15 8.623 92.31 0l59.25-16.94c12.7-3.781 26.02 3.719 29.67 16.47C394.7 198.2 387.3 211.4 374.6 215.1z"],unlock:[448,512,[128275],"f09c","M144 192H384C419.3 192 448 220.7 448 256V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V256C0 220.7 28.65 192 64 192H80V144C80 64.47 144.5 0 224 0C281.5 0 331 33.69 354.1 82.27C361.7 98.23 354.9 117.3 338.1 124.9C322.1 132.5 303.9 125.7 296.3 109.7C283.4 82.63 255.9 64 224 64C179.8 64 144 99.82 144 144L144 192z"],"unlock-keyhole":[448,512,["unlock-alt"],"f13e","M224 64C179.8 64 144 99.82 144 144V192H384C419.3 192 448 220.7 448 256V448C448 483.3 419.3 512 384 512H64C28.65 512 0 483.3 0 448V256C0 220.7 28.65 192 64 192H80V144C80 64.47 144.5 0 224 0C281.5 0 331 33.69 354.1 82.27C361.7 98.23 354.9 117.3 338.1 124.9C322.1 132.5 303.9 125.7 296.3 109.7C283.4 82.63 255.9 64 224 64H224zM256 384C273.7 384 288 369.7 288 352C288 334.3 273.7 320 256 320H192C174.3 320 160 334.3 160 352C160 369.7 174.3 384 192 384H256z"],"up-down":[256,512,[11021,8597,"arrows-alt-v"],"f338","M249.6 392.3l-104 112c-9.094 9.781-26.09 9.781-35.19 0l-103.1-112c-6.484-6.984-8.219-17.17-4.406-25.92S14.45 352 24 352H80V160H24C14.45 160 5.812 154.3 1.999 145.6C-1.813 136.8-.0781 126.7 6.406 119.7l104-112c9.094-9.781 26.09-9.781 35.19 0l104 112c6.484 6.984 8.219 17.17 4.406 25.92C250.2 154.3 241.5 160 232 160H176v192h56c9.547 0 18.19 5.656 22 14.41S256.1 385.3 249.6 392.3z"],"up-down-left-right":[512,512,["arrows-alt"],"f0b2","M512 256c0 6.797-2.891 13.28-7.938 17.84l-80 72C419.6 349.9 413.8 352 408 352c-3.312 0-6.625-.6875-9.766-2.078C389.6 346.1 384 337.5 384 328V288h-96v96l40-.0013c9.484 0 18.06 5.578 21.92 14.23s2.25 18.78-4.078 25.83l-72 80C269.3 509.1 262.8 512 255.1 512s-13.28-2.89-17.84-7.937l-71.1-80c-6.328-7.047-7.938-17.17-4.078-25.83s12.44-14.23 21.92-14.23l39.1 .0013V288H128v40c0 9.484-5.578 18.06-14.23 21.92C110.6 351.3 107.3 352 104 352c-5.812 0-11.56-2.109-16.06-6.156l-80-72C2.891 269.3 0 262.8 0 256s2.891-13.28 7.938-17.84l80-72C95 159.8 105.1 158.3 113.8 162.1C122.4 165.9 128 174.5 128 184V224h95.1V128l-39.1-.0013c-9.484 0-18.06-5.578-21.92-14.23S159.8 94.99 166.2 87.94l71.1-80c9.125-10.09 26.56-10.09 35.69 0l72 80c6.328 7.047 7.938 17.17 4.078 25.83s-12.44 14.23-21.92 14.23l-40 .0013V224H384V184c0-9.484 5.578-18.06 14.23-21.92c8.656-3.812 18.77-2.266 25.83 4.078l80 72C509.1 242.7 512 249.2 512 256z"],"up-long":[320,512,["long-arrow-alt-up"],"f30c","M285.1 145.7c-3.81 8.758-12.45 14.42-21.1 14.42L192 160.1V480c0 17.69-14.33 32-32 32s-32-14.31-32-32V160.1L55.1 160.1c-9.547 0-18.19-5.658-22-14.42c-3.811-8.758-2.076-18.95 4.408-25.94l104-112.1c9.498-10.24 25.69-10.24 35.19 0l104 112.1C288.1 126.7 289.8 136.9 285.1 145.7z"],"up-right-and-down-left-from-center":[512,512,["expand-alt"],"f424","M208 281.4c-12.5-12.5-32.76-12.5-45.26-.002l-78.06 78.07l-30.06-30.06c-6.125-6.125-14.31-9.367-22.63-9.367c-4.125 0-8.279 .7891-12.25 2.43c-11.97 4.953-19.75 16.62-19.75 29.56v135.1C.0013 501.3 10.75 512 24 512h136c12.94 0 24.63-7.797 29.56-19.75c4.969-11.97 2.219-25.72-6.938-34.87l-30.06-30.06l78.06-78.07c12.5-12.49 12.5-32.75 .002-45.25L208 281.4zM487.1 0h-136c-12.94 0-24.63 7.797-29.56 19.75c-4.969 11.97-2.219 25.72 6.938 34.87l30.06 30.06l-78.06 78.07c-12.5 12.5-12.5 32.76 0 45.26l22.62 22.62c12.5 12.5 32.76 12.5 45.26 0l78.06-78.07l30.06 30.06c9.156 9.141 22.87 11.84 34.87 6.937C504.2 184.6 512 172.9 512 159.1V23.1C512 10.74 501.3 0 487.1 0z"],"up-right-from-square":[512,512,["external-link-alt"],"f35d","M384 320c-17.67 0-32 14.33-32 32v96H64V160h96c17.67 0 32-14.32 32-32s-14.33-32-32-32L64 96c-35.35 0-64 28.65-64 64V448c0 35.34 28.65 64 64 64h288c35.35 0 64-28.66 64-64v-96C416 334.3 401.7 320 384 320zM488 0H352c-12.94 0-24.62 7.797-29.56 19.75c-4.969 11.97-2.219 25.72 6.938 34.88L370.8 96L169.4 297.4c-12.5 12.5-12.5 32.75 0 45.25C175.6 348.9 183.8 352 192 352s16.38-3.125 22.62-9.375L416 141.3l41.38 41.38c9.156 9.141 22.88 11.84 34.88 6.938C504.2 184.6 512 172.9 512 160V24C512 10.74 501.3 0 488 0z"],upload:[512,512,[],"f093","M105.4 182.6c12.5 12.49 32.76 12.5 45.25 .001L224 109.3V352c0 17.67 14.33 32 32 32c17.67 0 32-14.33 32-32V109.3l73.38 73.38c12.49 12.49 32.75 12.49 45.25-.001c12.49-12.49 12.49-32.75 0-45.25l-128-128C272.4 3.125 264.2 0 256 0S239.6 3.125 233.4 9.375L105.4 137.4C92.88 149.9 92.88 170.1 105.4 182.6zM480 352h-160c0 35.35-28.65 64-64 64s-64-28.65-64-64H32c-17.67 0-32 14.33-32 32v96c0 17.67 14.33 32 32 32h448c17.67 0 32-14.33 32-32v-96C512 366.3 497.7 352 480 352zM432 456c-13.2 0-24-10.8-24-24c0-13.2 10.8-24 24-24s24 10.8 24 24C456 445.2 445.2 456 432 456z"],user:[448,512,[62144,128100],"f007","M224 256c70.7 0 128-57.31 128-128s-57.3-128-128-128C153.3 0 96 57.31 96 128S153.3 256 224 256zM274.7 304H173.3C77.61 304 0 381.6 0 477.3c0 19.14 15.52 34.67 34.66 34.67h378.7C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304z"],"user-astronaut":[448,512,[],"f4fb","M176 448C167.3 448 160 455.3 160 464V512h32v-48C192 455.3 184.8 448 176 448zM272 448c-8.75 0-16 7.25-16 16s7.25 16 16 16s16-7.25 16-16S280.8 448 272 448zM164 172l8.205 24.62c1.215 3.645 6.375 3.645 7.59 0L188 172l24.62-8.203c3.646-1.219 3.646-6.375 0-7.594L188 148L179.8 123.4c-1.215-3.648-6.375-3.648-7.59 0L164 148L139.4 156.2c-3.646 1.219-3.646 6.375 0 7.594L164 172zM336.1 315.4C304 338.6 265.1 352 224 352s-80.03-13.43-112.1-36.59C46.55 340.2 0 403.3 0 477.3C0 496.5 15.52 512 34.66 512H128v-64c0-17.75 14.25-32 32-32h128c17.75 0 32 14.25 32 32v64h93.34C432.5 512 448 496.5 448 477.3C448 403.3 401.5 340.2 336.1 315.4zM64 224h13.5C102.3 280.5 158.4 320 224 320s121.8-39.5 146.5-96H384c8.75 0 16-7.25 16-16v-96C400 103.3 392.8 96 384 96h-13.5C345.8 39.5 289.6 0 224 0S102.3 39.5 77.5 96H64C55.25 96 48 103.3 48 112v96C48 216.8 55.25 224 64 224zM104 136C104 113.9 125.5 96 152 96h144c26.5 0 48 17.88 48 40V160c0 53-43 96-96 96h-48c-53 0-96-43-96-96V136z"],"user-check":[640,512,[],"f4fc","M274.7 304H173.3C77.61 304 0 381.6 0 477.3C0 496.5 15.52 512 34.66 512H413.3C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM632.3 134.4c-9.703-9-24.91-8.453-33.92 1.266l-87.05 93.75l-38.39-38.39c-9.375-9.375-24.56-9.375-33.94 0s-9.375 24.56 0 33.94l56 56C499.5 285.5 505.6 288 512 288h.4375c6.531-.125 12.72-2.891 17.16-7.672l104-112C642.6 158.6 642 143.4 632.3 134.4z"],"user-clock":[640,512,[],"f4fd","M496 224c-79.63 0-144 64.38-144 144s64.38 144 144 144s144-64.38 144-144S575.6 224 496 224zM544 384h-54.25C484.4 384 480 379.6 480 374.3V304c0-8.836 7.164-16 16-16c8.838 0 16 7.164 16 16v48h32c8.838 0 16 7.164 16 15.1S552.8 384 544 384zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM320 368c0-19.3 3.221-37.82 8.961-55.2C311.9 307.2 293.6 304 274.7 304H173.3C77.61 304 0 381.7 0 477.4C0 496.5 15.52 512 34.66 512H395C349.7 480.2 320 427.6 320 368z"],"user-doctor":[448,512,["user-md"],"f0f0","M96 128C96 57.31 153.3 0 224 0C294.7 0 352 57.31 352 128C352 198.7 294.7 256 224 256C153.3 256 96 198.7 96 128zM128 370.3C104.9 377.2 88 398.6 88 424C88 454.9 113.1 480 144 480C174.9 480 200 454.9 200 424C200 398.6 183.1 377.2 160 370.3V304.9C166 304.3 172.1 304 178.3 304H269.7C275.9 304 281.1 304.3 288 304.9V362C260.4 369.1 240 394.2 240 424V464C240 472.8 247.2 480 256 480H272C280.8 480 288 472.8 288 464C288 455.2 280.8 448 272 448V424C272 406.3 286.3 392 304 392C321.7 392 336 406.3 336 424V448C327.2 448 320 455.2 320 464C320 472.8 327.2 480 336 480H352C360.8 480 368 472.8 368 464V424C368 394.2 347.6 369.1 320 362V311.2C393.1 332.9 448 401.3 448 482.3C448 498.7 434.7 512 418.3 512H29.71C13.3 512 0 498.7 0 482.3C0 401.3 54.02 332.9 128 311.2V370.3zM120 424C120 410.7 130.7 400 144 400C157.3 400 168 410.7 168 424C168 437.3 157.3 448 144 448C130.7 448 120 437.3 120 424z"],"user-gear":[640,512,["user-cog"],"f4fe","M425.1 482.6c-2.303-1.25-4.572-2.559-6.809-3.93l-7.818 4.493c-6.002 3.504-12.83 5.352-19.75 5.352c-10.71 0-21.13-4.492-28.97-12.75c-18.41-20.09-32.29-44.15-40.22-69.9c-5.352-18.06 2.343-36.87 17.83-45.24l8.018-4.669c-.0664-2.621-.0664-5.242 0-7.859l-7.655-4.461c-12.3-6.953-19.4-19.66-19.64-33.38C305.6 306.3 290.4 304 274.7 304H173.3C77.61 304 0 381.7 0 477.4C0 496.5 15.52 512 34.66 512H413.3c5.727 0 10.9-1.727 15.66-4.188c-2.271-4.984-3.86-10.3-3.86-16.06V482.6zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM610.5 373.3c2.625-14 2.625-28.5 0-42.5l25.75-15c3-1.625 4.375-5.125 3.375-8.5c-6.75-21.5-18.25-41.13-33.25-57.38c-2.25-2.5-6-3.125-9-1.375l-25.75 14.88c-10.88-9.25-23.38-16.5-36.88-21.25V212.3c0-3.375-2.5-6.375-5.75-7c-22.25-5-45-4.875-66.25 0c-3.25 .625-5.625 3.625-5.625 7v29.88c-13.5 4.75-26 12-36.88 21.25L394.4 248.5c-2.875-1.75-6.625-1.125-9 1.375c-15 16.25-26.5 35.88-33.13 57.38c-1 3.375 .3751 6.875 3.25 8.5l25.75 15c-2.5 14-2.5 28.5 0 42.5l-25.75 15c-3 1.625-4.25 5.125-3.25 8.5c6.625 21.5 18.13 41 33.13 57.38c2.375 2.5 6 3.125 9 1.375l25.88-14.88c10.88 9.25 23.38 16.5 36.88 21.25v29.88c0 3.375 2.375 6.375 5.625 7c22.38 5 45 4.875 66.25 0c3.25-.625 5.75-3.625 5.75-7v-29.88c13.5-4.75 26-12 36.88-21.25l25.75 14.88c2.875 1.75 6.75 1.125 9-1.375c15-16.25 26.5-35.88 33.25-57.38c1-3.375-.3751-6.875-3.375-8.5L610.5 373.3zM496 400.5c-26.75 0-48.5-21.75-48.5-48.5s21.75-48.5 48.5-48.5c26.75 0 48.5 21.75 48.5 48.5S522.8 400.5 496 400.5z"],"user-graduate":[512,512,[],"f501","M45.63 79.75L52 81.25v58.5C45 143.9 40 151.3 40 160c0 8.375 4.625 15.38 11.12 19.75L35.5 242C33.75 248.9 37.63 256 43.13 256h41.75c5.5 0 9.375-7.125 7.625-13.1L76.88 179.8C83.38 175.4 88 168.4 88 160c0-8.75-5-16.12-12-20.25V87.13L128 99.63l.001 60.37c0 70.75 57.25 128 128 128s127.1-57.25 127.1-128L384 99.62l82.25-19.87c18.25-4.375 18.25-27 0-31.5l-190.4-46c-13-3-26.62-3-39.63 0l-190.6 46C27.5 52.63 27.5 75.38 45.63 79.75zM359.2 312.8l-103.2 103.2l-103.2-103.2c-69.93 22.3-120.8 87.2-120.8 164.5C32 496.5 47.53 512 66.67 512h378.7C464.5 512 480 496.5 480 477.3C480 400 429.1 335.1 359.2 312.8z"],"user-group":[640,512,[128101,"user-friends"],"f500","M224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM274.7 304H173.3c-95.73 0-173.3 77.6-173.3 173.3C0 496.5 15.52 512 34.66 512H413.3C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM479.1 320h-73.85C451.2 357.7 480 414.1 480 477.3C480 490.1 476.2 501.9 470 512h138C625.7 512 640 497.6 640 479.1C640 391.6 568.4 320 479.1 320zM432 256C493.9 256 544 205.9 544 144S493.9 32 432 32c-25.11 0-48.04 8.555-66.72 22.51C376.8 76.63 384 101.4 384 128c0 35.52-11.93 68.14-31.59 94.71C372.7 243.2 400.8 256 432 256z"],"user-injured":[448,512,[],"f728","M277.4 11.98C261.1 4.469 243.1 0 224 0C170.3 0 124.5 33.13 105.5 80h81.07L277.4 11.98zM342.5 80c-7.895-19.47-20.66-36.19-36.48-49.51L240 80H342.5zM224 256c70.7 0 128-57.31 128-128c0-5.48-.9453-10.7-1.613-16H97.61C96.95 117.3 96 122.5 96 128C96 198.7 153.3 256 224 256zM272 416h-45.14l58.64 93.83C305.4 503.1 320 485.8 320 464C320 437.5 298.5 416 272 416zM274.7 304H173.3c-5.393 0-10.71 .3242-15.98 .8047L206.9 384H272c44.13 0 80 35.88 80 80c0 18.08-6.252 34.59-16.4 48h77.73C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM0 477.3C0 496.5 15.52 512 34.66 512H64v-169.1C24.97 374.7 0 423.1 0 477.3zM96 322.4V512h153.1L123.7 311.3C114.1 314.2 104.8 317.9 96 322.4z"],"user-large":[512,512,["user-alt"],"f406","M256 288c79.53 0 144-64.47 144-144s-64.47-144-144-144c-79.52 0-144 64.47-144 144S176.5 288 256 288zM351.1 320H160c-88.36 0-160 71.63-160 160c0 17.67 14.33 32 31.1 32H480c17.67 0 31.1-14.33 31.1-32C512 391.6 440.4 320 351.1 320z"],"user-large-slash":[640,512,["user-alt-slash"],"f4fa","M284.9 320l-60.9-.0002c-88.36 0-160 71.63-160 159.1C63.1 497.7 78.33 512 95.1 512l448-.0039c.0137 0-.0137 0 0 0l-14.13-.0013L284.9 320zM630.8 469.1l-249.5-195.5c48.74-22.1 82.65-72.1 82.65-129.6c0-79.53-64.47-143.1-143.1-143.1c-69.64 0-127.3 49.57-140.6 115.3L38.81 5.109C34.41 1.672 29.19 0 24.03 0C16.91 0 9.845 3.156 5.127 9.187c-8.187 10.44-6.375 25.53 4.062 33.7L601.2 506.9c10.5 8.203 25.56 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],"user-lock":[640,512,[],"f502","M592 288H576V212.7c0-41.84-30.03-80.04-71.66-84.27C456.5 123.6 416 161.1 416 208V288h-16C373.6 288 352 309.6 352 336v128c0 26.4 21.6 48 48 48h192c26.4 0 48-21.6 48-48v-128C640 309.6 618.4 288 592 288zM496 432c-17.62 0-32-14.38-32-32s14.38-32 32-32s32 14.38 32 32S513.6 432 496 432zM528 288h-64V208c0-17.62 14.38-32 32-32s32 14.38 32 32V288zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM320 336c0-8.672 1.738-16.87 4.303-24.7C308.6 306.6 291.9 304 274.7 304H173.3C77.61 304 0 381.7 0 477.4C0 496.5 15.52 512 34.66 512h301.7C326.3 498.6 320 482.1 320 464V336z"],"user-minus":[640,512,[],"f503","M274.7 304H173.3C77.61 304 0 381.6 0 477.3C0 496.5 15.52 512 34.66 512h378.7C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM616 200h-144C458.8 200 448 210.8 448 224s10.75 24 24 24h144C629.3 248 640 237.3 640 224S629.3 200 616 200z"],"user-ninja":[512,512,[129399],"f504","M64 192c27.25 0 51.75-11.5 69.25-29.75c15 54 64 93.75 122.8 93.75c70.75 0 127.1-57.25 127.1-128s-57.25-128-127.1-128c-50.38 0-93.63 29.38-114.5 71.75C124.1 47.75 96 32 64 32c0 33.37 17.12 62.75 43.13 80C81.13 129.3 64 158.6 64 192zM208 96h95.1C321.7 96 336 110.3 336 128h-160C176 110.3 190.3 96 208 96zM337.8 306.9L256 416L174.2 306.9C93.36 321.6 32 392.2 32 477.3c0 19.14 15.52 34.67 34.66 34.67H445.3c19.14 0 34.66-15.52 34.66-34.67C480 392.2 418.6 321.6 337.8 306.9z"],"user-nurse":[448,512,[],"f82f","M224 304c70.75 0 128-57.25 128-128V65.88c0-13.38-8.25-25.38-20.75-30L246.5 4.125C239.3 1.375 231.6 0 224 0S208.8 1.375 201.5 4.125L116.8 35.88C104.3 40.5 96 52.5 96 65.88V176C96 246.8 153.3 304 224 304zM184 71.63c0-2.75 2.25-5 5-5h21.62V45c0-2.75 2.25-5 5-5h16.75c2.75 0 5 2.25 5 5v21.62H259c2.75 0 5 2.25 5 5v16.75c0 2.75-2.25 5-5 5h-21.62V115c0 2.75-2.25 5-5 5H215.6c-2.75 0-5-2.25-5-5V93.38H189c-2.75 0-5-2.25-5-5V71.63zM144 160h160v16C304 220.1 268.1 256 224 256S144 220.1 144 176V160zM327.2 312.8L224 416L120.8 312.8c-69.93 22.3-120.8 87.25-120.8 164.6C.0006 496.5 15.52 512 34.66 512H413.3c19.14 0 34.66-15.46 34.66-34.61C447.1 400.1 397.1 335.1 327.2 312.8z"],"user-pen":[640,512,["user-edit"],"f4ff","M223.1 256c70.7 0 128-57.31 128-128s-57.3-128-128-128C153.3 0 96 57.31 96 128S153.3 256 223.1 256zM274.7 304H173.3C77.61 304 0 381.7 0 477.4C0 496.5 15.52 512 34.66 512h286.4c-1.246-5.531-1.43-11.31-.2832-17.04l14.28-71.41c1.943-9.723 6.676-18.56 13.68-25.56l45.72-45.72C363.3 322.4 321.2 304 274.7 304zM371.4 420.6c-2.514 2.512-4.227 5.715-4.924 9.203l-14.28 71.41c-1.258 6.289 4.293 11.84 10.59 10.59l71.42-14.29c3.482-.6992 6.682-2.406 9.195-4.922l125.3-125.3l-72.01-72.01L371.4 420.6zM629.5 255.7l-21.1-21.11c-14.06-14.06-36.85-14.06-50.91 0l-38.13 38.14l72.01 72.01l38.13-38.13C643.5 292.5 643.5 269.7 629.5 255.7z"],"user-plus":[640,512,[],"f234","M224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM274.7 304H173.3C77.61 304 0 381.6 0 477.3C0 496.5 15.52 512 34.66 512h378.7C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM616 200h-48v-48C568 138.8 557.3 128 544 128s-24 10.75-24 24v48h-48C458.8 200 448 210.8 448 224s10.75 24 24 24h48v48C520 309.3 530.8 320 544 320s24-10.75 24-24v-48h48C629.3 248 640 237.3 640 224S629.3 200 616 200z"],"user-secret":[448,512,[128373],"f21b","M377.7 338.8l37.15-92.87C419 235.4 411.3 224 399.1 224h-57.48C348.5 209.2 352 193 352 176c0-4.117-.8359-8.057-1.217-12.08C390.7 155.1 416 142.3 416 128c0-16.08-31.75-30.28-80.31-38.99C323.8 45.15 304.9 0 277.4 0c-10.38 0-19.62 4.5-27.38 10.5c-15.25 11.88-36.75 11.88-52 0C190.3 4.5 181.1 0 170.7 0C143.2 0 124.4 45.16 112.5 88.98C63.83 97.68 32 111.9 32 128c0 14.34 25.31 27.13 65.22 35.92C96.84 167.9 96 171.9 96 176C96 193 99.47 209.2 105.5 224H48.02C36.7 224 28.96 235.4 33.16 245.9l37.15 92.87C27.87 370.4 0 420.4 0 477.3C0 496.5 15.52 512 34.66 512H413.3C432.5 512 448 496.5 448 477.3C448 420.4 420.1 370.4 377.7 338.8zM176 479.1L128 288l64 32l16 32L176 479.1zM271.1 479.1L240 352l16-32l64-32L271.1 479.1zM320 186C320 207 302.8 224 281.6 224h-12.33c-16.46 0-30.29-10.39-35.63-24.99C232.1 194.9 228.4 192 224 192S215.9 194.9 214.4 199C209 213.6 195.2 224 178.8 224h-12.33C145.2 224 128 207 128 186V169.5C156.3 173.6 188.1 176 224 176s67.74-2.383 96-6.473V186z"],"user-shield":[640,512,[],"f505","M622.3 271.1l-115.1-45.01c-4.125-1.629-12.62-3.754-22.25 0L369.8 271.1C359 275.2 352 285.1 352 295.1c0 111.6 68.75 188.8 132.9 213.9c9.625 3.75 18 1.625 22.25 0C558.4 489.9 640 420.5 640 295.1C640 285.1 633 275.2 622.3 271.1zM496 462.4V273.2l95.5 37.38C585.9 397.8 530.6 446 496 462.4zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM320.6 310.3C305.9 306.3 290.6 304 274.7 304H173.3C77.61 304 0 381.7 0 477.4C0 496.5 15.52 512 34.66 512H413.3c3.143 0 5.967-1.004 8.861-1.789C369.7 469.8 324.1 400.3 320.6 310.3z"],"user-slash":[640,512,[],"f506","M95.1 477.3c0 19.14 15.52 34.67 34.66 34.67h378.7c5.625 0 10.73-1.65 15.42-4.029L264.9 304.3C171.3 306.7 95.1 383.1 95.1 477.3zM630.8 469.1l-277.1-217.9c54.69-14.56 95.18-63.95 95.18-123.2C447.1 57.31 390.7 0 319.1 0C250.2 0 193.7 55.93 192.3 125.4l-153.4-120.3C34.41 1.672 29.19 0 24.03 0C16.91 0 9.845 3.156 5.127 9.187c-8.187 10.44-6.375 25.53 4.062 33.7L601.2 506.9c10.5 8.203 25.56 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],"user-tag":[640,512,[],"f507","M351.8 367.3v-44.1C328.5 310.7 302.4 304 274.7 304H173.3c-95.73 0-173.3 77.65-173.3 173.4C.0005 496.5 15.52 512 34.66 512h378.7c11.86 0 21.82-6.337 28.07-15.43l-61.65-61.57C361.7 416.9 351.8 392.9 351.8 367.3zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM630.6 364.8L540.3 274.8C528.3 262.8 512 256 495 256h-79.23c-17.75 0-31.99 14.25-31.99 32l.0147 79.2c0 17 6.647 33.15 18.65 45.15l90.31 90.27c12.5 12.5 32.74 12.5 45.24 0l92.49-92.5C643.1 397.6 643.1 377.3 630.6 364.8zM447.8 343.9c-13.25 0-24-10.62-24-24c0-13.25 10.75-24 24-24c13.38 0 24 10.75 24 24S461.1 343.9 447.8 343.9z"],"user-tie":[448,512,[],"f508","M352 128C352 198.7 294.7 256 224 256C153.3 256 96 198.7 96 128C96 57.31 153.3 0 224 0C294.7 0 352 57.31 352 128zM209.1 359.2L176 304H272L238.9 359.2L272.2 483.1L311.7 321.9C388.9 333.9 448 400.7 448 481.3C448 498.2 434.2 512 417.3 512H30.72C13.75 512 0 498.2 0 481.3C0 400.7 59.09 333.9 136.3 321.9L175.8 483.1L209.1 359.2z"],"user-xmark":[640,512,["user-times"],"f235","M274.7 304H173.3C77.61 304 0 381.6 0 477.3C0 496.5 15.52 512 34.66 512h378.7C432.5 512 448 496.5 448 477.3C448 381.6 370.4 304 274.7 304zM224 256c70.7 0 128-57.31 128-128S294.7 0 224 0C153.3 0 96 57.31 96 128S153.3 256 224 256zM577.9 223.1l47.03-47.03c9.375-9.375 9.375-24.56 0-33.94s-24.56-9.375-33.94 0L544 190.1l-47.03-47.03c-9.375-9.375-24.56-9.375-33.94 0s-9.375 24.56 0 33.94l47.03 47.03l-47.03 47.03c-9.375 9.375-9.375 24.56 0 33.94c9.373 9.373 24.56 9.381 33.94 0L544 257.9l47.03 47.03c9.373 9.373 24.56 9.381 33.94 0c9.375-9.375 9.375-24.56 0-33.94L577.9 223.1z"],users:[640,512,[],"f0c0","M319.9 320c57.41 0 103.1-46.56 103.1-104c0-57.44-46.54-104-103.1-104c-57.41 0-103.1 46.56-103.1 104C215.9 273.4 262.5 320 319.9 320zM369.9 352H270.1C191.6 352 128 411.7 128 485.3C128 500.1 140.7 512 156.4 512h327.2C499.3 512 512 500.1 512 485.3C512 411.7 448.4 352 369.9 352zM512 160c44.18 0 80-35.82 80-80S556.2 0 512 0c-44.18 0-80 35.82-80 80S467.8 160 512 160zM183.9 216c0-5.449 .9824-10.63 1.609-15.91C174.6 194.1 162.6 192 149.9 192H88.08C39.44 192 0 233.8 0 285.3C0 295.6 7.887 304 17.62 304h199.5C196.7 280.2 183.9 249.7 183.9 216zM128 160c44.18 0 80-35.82 80-80S172.2 0 128 0C83.82 0 48 35.82 48 80S83.82 160 128 160zM551.9 192h-61.84c-12.8 0-24.88 3.037-35.86 8.24C454.8 205.5 455.8 210.6 455.8 216c0 33.71-12.78 64.21-33.16 88h199.7C632.1 304 640 295.6 640 285.3C640 233.8 600.6 192 551.9 192z"],"users-between-lines":[640,512,[],"e591","M0 24C0 10.75 10.75 0 24 0H616C629.3 0 640 10.75 640 24C640 37.25 629.3 48 616 48H24C10.75 48 0 37.25 0 24zM0 488C0 474.7 10.75 464 24 464H616C629.3 464 640 474.7 640 488C640 501.3 629.3 512 616 512H24C10.75 512 0 501.3 0 488zM211.2 160C211.2 195.3 182.5 224 147.2 224C111.9 224 83.2 195.3 83.2 160C83.2 124.7 111.9 96 147.2 96C182.5 96 211.2 124.7 211.2 160zM32 320C32 284.7 60.65 256 96 256H192C204.2 256 215.7 259.4 225.4 265.4C188.2 280.5 159.8 312.6 149.6 352H64C46.33 352 32 337.7 32 320V320zM415.9 264.6C425.3 259.1 436.3 256 448 256H544C579.3 256 608 284.7 608 320C608 337.7 593.7 352 576 352H493.6C483.2 311.9 453.1 279.4 415.9 264.6zM391.2 290.4C423.3 297.8 449.3 321.3 460.1 352C463.7 362 465.6 372.8 465.6 384C465.6 401.7 451.3 416 433.6 416H209.6C191.9 416 177.6 401.7 177.6 384C177.6 372.8 179.5 362 183.1 352C193.6 322.3 218.3 299.2 249.1 291.1C256.1 289.1 265.1 288 273.6 288H369.6C377 288 384.3 288.8 391.2 290.4zM563.2 160C563.2 195.3 534.5 224 499.2 224C463.9 224 435.2 195.3 435.2 160C435.2 124.7 463.9 96 499.2 96C534.5 96 563.2 124.7 563.2 160zM241.6 176C241.6 131.8 277.4 96 321.6 96C365.8 96 401.6 131.8 401.6 176C401.6 220.2 365.8 256 321.6 256C277.4 256 241.6 220.2 241.6 176z"],"users-gear":[640,512,["users-cog"],"f509","M512 160c44.18 0 80-35.82 80-80S556.2 0 512 0c-44.18 0-80 35.82-80 80S467.8 160 512 160zM128 160c44.18 0 80-35.82 80-80S172.2 0 128 0C83.82 0 48 35.82 48 80S83.82 160 128 160zM319.9 320c57.41 0 103.1-46.56 103.1-104c0-57.44-46.54-104-103.1-104c-57.41 0-103.1 46.56-103.1 104C215.9 273.4 262.5 320 319.9 320zM368 400c0-16.69 3.398-32.46 8.619-47.36C374.3 352.5 372.2 352 369.9 352H270.1C191.6 352 128 411.7 128 485.3C128 500.1 140.7 512 156.4 512h266.1C389.5 485.6 368 445.5 368 400zM183.9 216c0-5.449 .9824-10.63 1.609-15.91C174.6 194.1 162.6 192 149.9 192H88.08C39.44 192 0 233.8 0 285.3C0 295.6 7.887 304 17.62 304h199.5C196.7 280.2 183.9 249.7 183.9 216zM551.9 192h-61.84c-12.8 0-24.88 3.037-35.86 8.24C454.8 205.5 455.8 210.6 455.8 216c0 21.47-5.625 41.38-14.65 59.34C462.2 263.4 486.1 256 512 256c42.48 0 80.27 18.74 106.6 48h3.756C632.1 304 640 295.6 640 285.3C640 233.8 600.6 192 551.9 192zM618.1 366.7c-5.025-16.01-13.59-30.62-24.75-42.71c-1.674-1.861-4.467-2.326-6.699-1.023l-19.17 11.07c-8.096-6.887-17.4-12.28-27.45-15.82V295.1c0-2.514-1.861-4.746-4.281-5.213c-16.56-3.723-33.5-3.629-49.32 0C484.9 291.2 483.1 293.5 483.1 295.1v22.24c-10.05 3.537-19.36 8.932-27.45 15.82l-19.26-11.07c-2.139-1.303-4.932-.8379-6.697 1.023c-11.17 12.1-19.73 26.71-24.66 42.71c-.7441 2.512 .2793 5.117 2.42 6.326l19.17 11.17c-1.859 10.42-1.859 21.21 0 31.64l-19.17 11.17c-2.234 1.209-3.164 3.816-2.42 6.328c4.932 16.01 13.49 30.52 24.66 42.71c1.766 1.863 4.467 2.328 6.697 1.025l19.26-11.07c8.094 6.887 17.4 12.28 27.45 15.82v22.24c0 2.514 1.77 4.746 4.188 5.211c16.66 3.723 33.5 3.629 49.32 0c2.42-.4648 4.281-2.697 4.281-5.211v-22.24c10.05-3.535 19.36-8.932 27.45-15.82l19.17 11.07c2.141 1.303 5.025 .8379 6.699-1.025c11.17-12.1 19.73-26.7 24.75-42.71c.7441-2.512-.2773-5.119-2.512-6.328l-19.17-11.17c1.953-10.42 1.953-21.22 0-31.64l19.17-11.17C618.7 371.8 619.7 369.2 618.1 366.7zM512 432c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32s32 14.33 32 32C544 417.7 529.7 432 512 432z"],"users-line":[640,512,[],"e592","M211.2 96C211.2 131.3 182.5 160 147.2 160C111.9 160 83.2 131.3 83.2 96C83.2 60.65 111.9 32 147.2 32C182.5 32 211.2 60.65 211.2 96zM32 256C32 220.7 60.65 192 96 192H192C204.2 192 215.7 195.4 225.4 201.4C188.2 216.5 159.8 248.6 149.6 288H64C46.33 288 32 273.7 32 256V256zM415.9 200.6C425.3 195.1 436.3 192 448 192H544C579.3 192 608 220.7 608 256C608 273.7 593.7 288 576 288H493.6C483.2 247.9 453.1 215.4 415.9 200.6zM391.2 226.4C423.3 233.8 449.3 257.3 460.1 288C463.7 298 465.6 308.8 465.6 320C465.6 337.7 451.3 352 433.6 352H209.6C191.9 352 177.6 337.7 177.6 320C177.6 308.8 179.5 298 183.1 288C193.6 258.3 218.3 235.2 249.1 227.1C256.1 225.1 265.1 224 273.6 224H369.6C377 224 384.3 224.8 391.2 226.4zM563.2 96C563.2 131.3 534.5 160 499.2 160C463.9 160 435.2 131.3 435.2 96C435.2 60.65 463.9 32 499.2 32C534.5 32 563.2 60.65 563.2 96zM241.6 112C241.6 67.82 277.4 32 321.6 32C365.8 32 401.6 67.82 401.6 112C401.6 156.2 365.8 192 321.6 192C277.4 192 241.6 156.2 241.6 112zM608 416C625.7 416 640 430.3 640 448C640 465.7 625.7 480 608 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H608z"],"users-rays":[640,512,[],"e593","M112.1 79.03C122.3 88.4 122.3 103.6 112.1 112.1C103.6 122.3 88.4 122.3 79.03 112.1L7.029 40.97C-2.343 31.6-2.343 16.4 7.029 7.029C16.4-2.343 31.6-2.343 40.97 7.029L112.1 79.03zM599 7.029C608.4-2.343 623.6-2.343 632.1 7.029C642.3 16.4 642.3 31.6 632.1 40.97L560.1 112.1C551.6 122.3 536.4 122.3 527 112.1C517.7 103.6 517.7 88.4 527 79.03L599 7.029zM7.029 471L79.03 399C88.4 389.7 103.6 389.7 112.1 399C122.3 408.4 122.3 423.6 112.1 432.1L40.97 504.1C31.6 514.3 16.4 514.3 7.029 504.1C-2.343 495.6-2.343 480.4 7.029 471V471zM527 432.1C517.7 423.6 517.7 408.4 527 399C536.4 389.7 551.6 389.7 560.1 399L632.1 471C642.3 480.4 642.3 495.6 632.1 504.1C623.6 514.3 608.4 514.3 599 504.1L527 432.1zM256 192C256 156.7 284.7 128 320 128C355.3 128 384 156.7 384 192C384 227.3 355.3 256 320 256C284.7 256 256 227.3 256 192zM265.5 289.5C266.3 289.3 267.1 289.1 267.1 288.1C271.9 288.3 275.9 288 280 288H360C364.1 288 368.1 288.3 372 288.1C396.6 293.1 416.9 309.7 426.3 331.1C426.9 333.3 427.4 334.6 427.9 336C430.6 343.5 432 351.6 432 360C432 373.3 421.3 384 408 384H232C218.7 384 208 373.3 208 360C208 351.6 209.4 343.5 212.1 336C220.4 312.5 240.6 294.6 265.5 289.5V289.5zM127.8 176C127.8 149.5 149.3 128 175.8 128C202.3 128 223.8 149.5 223.8 176C223.8 202.5 202.3 224 175.8 224C149.3 224 127.8 202.5 127.8 176V176zM218.7 256C227.8 256 236.5 258.3 244 262.4C211.6 274.3 186.8 301.9 178.8 336H122.7C107.9 336 96 324.1 96 309.3C96 279.9 119.9 256 149.3 256H218.7zM517.3 336H461.2C453.2 301.9 428.4 274.3 395.1 262.4C403.5 258.3 412.2 256 421.3 256H490.7C520.1 256 544 279.9 544 309.3C544 324.1 532.1 336 517.3 336H517.3zM416 176C416 149.5 437.5 128 464 128C490.5 128 512 149.5 512 176C512 202.5 490.5 224 464 224C437.5 224 416 202.5 416 176z"],"users-rectangle":[640,512,[],"e594","M223.8 176C223.8 202.5 202.3 224 175.8 224C149.3 224 127.8 202.5 127.8 176C127.8 149.5 149.3 128 175.8 128C202.3 128 223.8 149.5 223.8 176zM96 309.3C96 279.9 119.9 256 149.3 256H218.7C227.8 256 236.5 258.3 244 262.4C211.6 274.3 186.8 301.9 178.8 336H122.7C107.9 336 96 324.1 96 309.3H96zM395.1 262.4C403.5 258.3 412.2 256 421.3 256H490.7C520.1 256 544 279.9 544 309.3C544 324.1 532.1 336 517.3 336H461.2C453.2 301.9 428.4 274.3 395.1 262.4H395.1zM372 288.1C398 293.4 419.3 311.7 427.9 336C430.6 343.5 432 351.6 432 360C432 373.3 421.3 384 408 384H232C218.7 384 208 373.3 208 360C208 351.6 209.4 343.5 212.1 336C220.7 311.7 241.1 293.4 267.1 288.1C271.9 288.3 275.9 288 280 288H360C364.1 288 368.1 288.3 372 288.1V288.1zM512 176C512 202.5 490.5 224 464 224C437.5 224 416 202.5 416 176C416 149.5 437.5 128 464 128C490.5 128 512 149.5 512 176zM256 192C256 156.7 284.7 128 320 128C355.3 128 384 156.7 384 192C384 227.3 355.3 256 320 256C284.7 256 256 227.3 256 192zM544 0C597 0 640 42.98 640 96V416C640 469 597 512 544 512H96C42.98 512 0 469 0 416V96C0 42.98 42.98 0 96 0H544zM64 416C64 433.7 78.33 448 96 448H544C561.7 448 576 433.7 576 416V96C576 78.33 561.7 64 544 64H96C78.33 64 64 78.33 64 96V416z"],"users-slash":[640,512,[],"e073","M512 160c44.18 0 80-35.82 80-80S556.2 0 512 0c-44.18 0-80 35.82-80 80S467.8 160 512 160zM490.1 192c-12.8 0-24.88 3.037-35.86 8.24C454.8 205.5 455.8 210.6 455.8 216c0 33.71-12.78 64.21-33.16 88h199.7C632.1 304 640 295.6 640 285.3C640 233.8 600.6 192 551.9 192H490.1zM396.6 285.5C413.4 267.2 423.8 242.9 423.8 216c0-57.44-46.54-104-103.1-104c-35.93 0-67.07 18.53-85.59 46.3L193.1 126.1C202.4 113.1 208 97.24 208 80C208 35.82 172.2 0 128 0C103.8 0 82.52 10.97 67.96 27.95L38.81 5.109C34.41 1.672 29.19 0 24.03 0C16.91 0 9.846 3.156 5.127 9.188C-3.061 19.62-1.248 34.72 9.189 42.89l591.1 463.1c10.5 8.203 25.56 6.328 33.69-4.078c8.188-10.44 6.375-25.53-4.062-33.7L396.6 285.5zM270.1 352C191.6 352 128 411.7 128 485.3C128 500.1 140.7 512 156.4 512h327.2c11.62 0 21.54-6.583 25.95-15.96L325.7 352H270.1zM186.1 243.2L121.6 192H88.08C39.44 192 0 233.8 0 285.3C0 295.6 7.887 304 17.62 304h199.5C202.4 286.8 191.8 266.1 186.1 243.2z"],"users-viewfinder":[640,512,[],"e595","M48 136C48 149.3 37.25 160 24 160C10.75 160 0 149.3 0 136V32C0 14.33 14.33 0 32 0H136C149.3 0 160 10.75 160 24C160 37.25 149.3 48 136 48H48V136zM127.8 176C127.8 149.5 149.3 128 175.8 128C202.3 128 223.8 149.5 223.8 176C223.8 202.5 202.3 224 175.8 224C149.3 224 127.8 202.5 127.8 176V176zM218.7 256C227.8 256 236.5 258.3 244 262.4C211.6 274.3 186.8 301.9 178.8 336H122.7C107.9 336 96 324.1 96 309.3C96 279.9 119.9 256 149.3 256H218.7zM517.3 336H461.2C453.2 301.9 428.4 274.3 395.1 262.4C403.5 258.3 412.2 256 421.3 256H490.7C520.1 256 544 279.9 544 309.3C544 324.1 532.1 336 517.3 336H517.3zM432 360C432 373.3 421.3 384 408 384H232C218.7 384 208 373.3 208 360C208 351.6 209.4 343.5 212.1 336C220.7 311.7 241.1 293.4 267.1 288.1C271.9 288.3 275.9 288 280 288H360C364.1 288 368.1 288.3 372 288.1C398 293.4 419.3 311.7 427.9 336C430.6 343.5 432 351.6 432 360zM416 176C416 149.5 437.5 128 464 128C490.5 128 512 149.5 512 176C512 202.5 490.5 224 464 224C437.5 224 416 202.5 416 176zM384 192C384 227.3 355.3 256 320 256C284.7 256 256 227.3 256 192C256 156.7 284.7 128 320 128C355.3 128 384 156.7 384 192zM480 24C480 10.75 490.7 0 504 0H608C625.7 0 640 14.33 640 32V136C640 149.3 629.3 160 616 160C602.7 160 592 149.3 592 136V48H504C490.7 48 480 37.25 480 24zM48 464H136C149.3 464 160 474.7 160 488C160 501.3 149.3 512 136 512H32C14.33 512 0 497.7 0 480V376C0 362.7 10.75 352 24 352C37.25 352 48 362.7 48 376V464zM504 464H592V376C592 362.7 602.7 352 616 352C629.3 352 640 362.7 640 376V480C640 497.7 625.7 512 608 512H504C490.7 512 480 501.3 480 488C480 474.7 490.7 464 504 464z"],utensils:[448,512,[61685,127860,"cutlery"],"f2e7","M221.6 148.7C224.7 161.3 224.8 174.5 222.1 187.2C219.3 199.1 213.6 211.9 205.6 222.1C191.1 238.6 173 249.1 151.1 254.1V472C151.1 482.6 147.8 492.8 140.3 500.3C132.8 507.8 122.6 512 111.1 512C101.4 512 91.22 507.8 83.71 500.3C76.21 492.8 71.1 482.6 71.1 472V254.1C50.96 250.1 31.96 238.9 18.3 222.4C10.19 212.2 4.529 200.3 1.755 187.5C-1.019 174.7-.8315 161.5 2.303 148.8L32.51 12.45C33.36 8.598 35.61 5.197 38.82 2.9C42.02 .602 45.97-.4297 49.89 .0026C53.82 .4302 57.46 2.303 60.1 5.259C62.74 8.214 64.18 12.04 64.16 16V160H81.53L98.62 11.91C99.02 8.635 100.6 5.621 103.1 3.434C105.5 1.248 108.7 .0401 111.1 .0401C115.3 .0401 118.5 1.248 120.9 3.434C123.4 5.621 124.1 8.635 125.4 11.91L142.5 160H159.1V16C159.1 12.07 161.4 8.268 163.1 5.317C166.6 2.366 170.2 .474 174.1 .0026C178-.4262 181.1 .619 185.2 2.936C188.4 5.253 190.6 8.677 191.5 12.55L221.6 148.7zM448 472C448 482.6 443.8 492.8 436.3 500.3C428.8 507.8 418.6 512 408 512C397.4 512 387.2 507.8 379.7 500.3C372.2 492.8 368 482.6 368 472V352H351.2C342.8 352 334.4 350.3 326.6 347.1C318.9 343.8 311.8 339.1 305.8 333.1C299.9 327.1 295.2 320 291.1 312.2C288.8 304.4 287.2 296 287.2 287.6L287.1 173.8C288 136.9 299.1 100.8 319.8 70.28C340.5 39.71 369.8 16.05 404.1 2.339C408.1 .401 414.2-.3202 419.4 .2391C424.6 .7982 429.6 2.62 433.9 5.546C438.2 8.472 441.8 12.41 444.2 17.03C446.7 21.64 447.1 26.78 448 32V472z"],v:[384,512,[118],"56","M381.5 76.33l-160 384C216.6 472.2 204.9 480 192 480s-24.56-7.757-29.53-19.68l-160-384c-6.797-16.31 .9062-35.05 17.22-41.84c16.38-6.859 35.08 .9219 41.84 17.22L192 364.8l130.5-313.1c6.766-16.3 25.47-24.09 41.84-17.22C380.6 41.28 388.3 60.01 381.5 76.33z"],"van-shuttle":[640,512,[128656,"shuttle-van"],"f5b6","M592 384H576C576 437 533 480 480 480C426.1 480 384 437 384 384H256C256 437 213 480 160 480C106.1 480 64 437 64 384H48C21.49 384 0 362.5 0 336V104C0 64.24 32.24 32 72 32H465.1C483.1 32 501.9 40.34 514.1 54.78L624.1 186.5C634.7 197.1 640 212.6 640 227.7V336C640 362.5 618.5 384 592 384zM64 192H160V96H72C67.58 96 64 99.58 64 104V192zM545.1 192L465.1 96H384V192H545.1zM320 192V96H224V192H320zM480 336C453.5 336 432 357.5 432 384C432 410.5 453.5 432 480 432C506.5 432 528 410.5 528 384C528 357.5 506.5 336 480 336zM160 432C186.5 432 208 410.5 208 384C208 357.5 186.5 336 160 336C133.5 336 112 357.5 112 384C112 410.5 133.5 432 160 432z"],vault:[576,512,[],"e2c5","M144 240C144 195.8 179.8 160 224 160C268.2 160 304 195.8 304 240C304 284.2 268.2 320 224 320C179.8 320 144 284.2 144 240zM512 0C547.3 0 576 28.65 576 64V416C576 451.3 547.3 480 512 480H496L480 512H416L400 480H176L160 512H96L80 480H64C28.65 480 0 451.3 0 416V64C0 28.65 28.65 0 64 0H512zM224 400C312.4 400 384 328.4 384 240C384 151.6 312.4 80 224 80C135.6 80 64 151.6 64 240C64 328.4 135.6 400 224 400zM480 221.3C498.6 214.7 512 196.9 512 176C512 149.5 490.5 128 464 128C437.5 128 416 149.5 416 176C416 196.9 429.4 214.7 448 221.3V336C448 344.8 455.2 352 464 352C472.8 352 480 344.8 480 336V221.3z"],"vector-square":[448,512,[],"f5cb","M416 32C433.7 32 448 46.33 448 64V128C448 145.7 433.7 160 416 160V352C433.7 352 448 366.3 448 384V448C448 465.7 433.7 480 416 480H352C334.3 480 320 465.7 320 448H128C128 465.7 113.7 480 96 480H32C14.33 480 0 465.7 0 448V384C0 366.3 14.33 352 32 352V160C14.33 160 0 145.7 0 128V64C0 46.33 14.33 32 32 32H96C113.7 32 128 46.33 128 64H320C320 46.33 334.3 32 352 32H416zM368 80V112H400V80H368zM96 160V352C113.7 352 128 366.3 128 384H320C320 366.3 334.3 352 352 352V160C334.3 160 320 145.7 320 128H128C128 145.7 113.7 160 96 160zM48 400V432H80V400H48zM400 432V400H368V432H400zM80 112V80H48V112H80z"],venus:[384,512,[9792],"f221","M368 176c0-97.2-78.8-176-176-176c-97.2 0-176 78.8-176 176c0 86.26 62.1 157.9 144 172.1v35.05H112c-8.836 0-16 7.162-16 16v32c0 8.836 7.164 16 16 16H160v48c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16v-48h48c8.838 0 16-7.164 16-16v-32c0-8.838-7.162-16-16-16H224v-35.05C305.9 333.9 368 262.3 368 176zM192 272c-52.93 0-96-43.07-96-96c0-52.94 43.07-96 96-96c52.94 0 96 43.06 96 96C288 228.9 244.9 272 192 272z"],"venus-double":[640,512,[9890],"f226","M368 176c0-97.2-78.8-176-176-176c-97.2 0-176 78.8-176 176c0 86.26 62.1 157.9 144 172.1v35.05H112c-8.836 0-16 7.162-16 16v32c0 8.836 7.164 16 16 16H160v48c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16v-48h48c8.838 0 16-7.164 16-16v-32c0-8.838-7.162-16-16-16H224v-35.05C305.9 333.9 368 262.3 368 176zM192 272c-52.93 0-96-43.07-96-96c0-52.94 43.07-96 96-96c52.94 0 96 43.06 96 96C288 228.9 244.9 272 192 272zM624 176C624 78.8 545.2 0 448 0c-39.02 0-74.95 12.85-104.1 34.34c18.38 19.7 32.94 42.91 42.62 68.58C403.2 88.83 424.5 80 448 80c52.94 0 96 43.06 96 96c0 52.93-43.06 96-96 96c-23.57 0-44.91-8.869-61.63-23.02c-9.572 25.45-23.95 48.54-42.23 68.23C365.1 332.7 389.3 344 416 348.1V384h-48c-8.836 0-16 7.162-16 16v32c0 8.836 7.164 16 16 16H416v48c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16V448h48c8.838 0 16-7.164 16-16v-32c0-8.838-7.162-16-16-16H480v-35.05C561.9 333.9 624 262.3 624 176z"],"venus-mars":[640,512,[9892],"f228","M256 384H208v-35.05C289.9 333.9 352 262.3 352 176c0-97.2-78.8-176-176-176c-97.2 0-176 78.8-176 176c0 86.26 62.1 157.9 144 172.1v35.05H96c-8.836 0-16 7.162-16 16v32c0 8.836 7.164 16 16 16h48v48c0 8.836 7.164 16 16 16h32c8.838 0 16-7.164 16-16v-48H256c8.838 0 16-7.164 16-16v-32C272 391.2 264.8 384 256 384zM176 272c-52.93 0-96-43.07-96-96c0-52.94 43.07-96 96-96c52.94 0 96 43.06 96 96C272 228.9 228.9 272 176 272zM624 0h-112.4c-21.38 0-32.09 25.85-16.97 40.97l29.56 29.56l-24.55 24.55c-29.97-20.66-64.81-31.05-99.74-31.05c-15.18 0-30.42 2.225-45.19 6.132c13.55 22.8 22.82 48.36 26.82 75.67c6.088-1.184 12.27-1.785 18.45-1.785c24.58 0 49.17 9.357 67.88 28.07c37.43 37.43 37.43 98.33 0 135.8c-18.71 18.71-43.3 28.07-67.88 28.07c-23.55 0-46.96-8.832-65.35-26.01c-15.92 18.84-34.93 35.1-56.75 47.35c11.45 5.898 20.17 16.3 23.97 28.82C331.5 406 365.7 416 400 416c45.04 0 90.08-17.18 124.5-51.55c60.99-60.99 67.73-155.6 20.47-224.1l24.55-24.55l29.56 29.56c4.889 4.889 10.9 7.078 16.8 7.078C628.2 152.4 640 142.8 640 128.4V16C640 7.164 632.8 0 624 0z"],vest:[448,512,[],"e085","M437.3 239.9L384 160V32c0-17.67-14.33-32-32-32h-32c-4.75 0-9.375 1.406-13.31 4.031l-25 16.66c-35.03 23.38-80.28 23.38-115.4 0l-25-16.66C137.4 1.406 132.8 0 128 0H96C78.33 0 64 14.33 64 32v128L10.75 239.9C3.74 250.4 0 262.7 0 275.4V480c0 17.67 14.33 32 32 32h160V288c0-3.439 .5547-6.855 1.643-10.12l13.49-40.48L150.2 66.56C173.2 79.43 198.5 86.25 224 86.25s50.79-6.824 73.81-19.69L224 288v224h192c17.67 0 32-14.33 32-32V275.4C448 262.7 444.3 250.4 437.3 239.9zM131.3 371.3l-48 48C80.19 422.4 76.09 424 72 424s-8.188-1.562-11.31-4.688c-6.25-6.25-6.25-16.38 0-22.62l48-48c6.25-6.25 16.38-6.25 22.62 0S137.6 365.1 131.3 371.3zM387.3 419.3C384.2 422.4 380.1 424 376 424s-8.188-1.562-11.31-4.688l-48-48c-6.25-6.25-6.25-16.38 0-22.62s16.38-6.25 22.62 0l48 48C393.6 402.9 393.6 413.1 387.3 419.3z"],"vest-patches":[448,512,[],"e086","M437.3 239.9L384 160V32c0-17.67-14.33-32-32-32h-32c-4.75 0-9.375 1.406-13.31 4.031l-25 16.66c-35.03 23.38-80.28 23.38-115.4 0l-25-16.66C137.4 1.406 132.8 0 128 0H96C78.33 0 64 14.33 64 32v128L10.75 239.9C3.74 250.4 0 262.7 0 275.4V480c0 17.67 14.33 32 32 32h160V288c0-3.439 .5547-6.855 1.643-10.12l13.49-40.48L150.2 66.56C173.2 79.43 198.5 86.25 224 86.25s50.79-6.824 73.81-19.69L224 288v224h192c17.67 0 32-14.33 32-32V275.4C448 262.7 444.3 250.4 437.3 239.9zM63.5 272.5c-4.656-4.688-4.656-12.31 0-17c4.688-4.688 12.31-4.688 17 0L96 271l15.5-15.5c4.688-4.688 12.31-4.688 17 0c4.656 4.688 4.656 12.31 0 17L113 288l15.5 15.5c4.656 4.688 4.656 12.31 0 17C126.2 322.8 123.1 324 120 324s-6.156-1.156-8.5-3.5L96 305l-15.5 15.5C78.16 322.8 75.06 324 72 324s-6.156-1.156-8.5-3.5c-4.656-4.688-4.656-12.31 0-17L79 288L63.5 272.5zM96 456c-22.09 0-40-17.91-40-40S73.91 376 96 376S136 393.9 136 416S118.1 456 96 456zM359.2 335.8L310.7 336C306.1 336 303.1 333 304 329.3l.2158-48.53c.1445-14.4 12.53-25.98 27.21-24.67c12.79 1.162 22.13 12.62 22.06 25.42l-.0557 5.076l5.069-.0566c12.83-.0352 24.24 9.275 25.4 22.08C385.2 323.3 373.7 335.7 359.2 335.8z"],vial:[512,512,[129514],"f492","M502.6 169.4l-160-160C336.4 3.125 328.2 0 320 0s-16.38 3.125-22.62 9.375c-12.5 12.5-12.5 32.75 0 45.25l6.975 6.977l-271.4 271c-38.75 38.75-45.13 102-9.375 143.5C44.08 500 72.76 512 101.5 512h.4473c26.38 0 52.75-9.1 72.88-30.12l275.2-274.6l7.365 7.367C463.6 220.9 471.8 224 480 224s16.38-3.125 22.62-9.375C515.1 202.1 515.1 181.9 502.6 169.4zM310.6 256H200.2l149.3-149.1l55.18 55.12L310.6 256z"],"vial-circle-check":[512,512,[],"e596","M0 64C0 46.33 14.33 32 32 32H224C241.7 32 256 46.33 256 64C256 81.67 241.7 96 224 96V266.8C203.8 295.4 192 330.3 192 368C192 393.2 197.3 417.1 206.8 438.8C189.5 463.7 160.6 480 128 480C74.98 480 32 437 32 384V96C14.33 96 0 81.67 0 64V64zM96 192H160V96H96V192zM512 368C512 447.5 447.5 512 368 512C288.5 512 224 447.5 224 368C224 288.5 288.5 224 368 224C447.5 224 512 288.5 512 368zM412.7 324.7L352 385.4L323.3 356.7C317.1 350.4 306.9 350.4 300.7 356.7C294.4 362.9 294.4 373.1 300.7 379.3L340.7 419.3C346.9 425.6 357.1 425.6 363.3 419.3L435.3 347.3C441.6 341.1 441.6 330.9 435.3 324.7C429.1 318.4 418.9 318.4 412.7 324.7H412.7z"],"vial-virus":[576,512,[],"e597","M256 32C273.7 32 288 46.33 288 64C288 81.67 273.7 96 256 96V207.1C252.9 209.1 249.9 211.5 247.2 214.2C225.3 236.1 225.3 271.6 247.2 293.4C247.4 293.6 247.4 293.7 247.5 293.8L247.5 293.8C247.5 293.9 247.5 294.1 247.4 294.4C247.3 294.6 247.1 294.8 247.1 294.8L247 294.9C246.1 294.9 246.8 294.9 246.6 294.9C215.7 294.9 190.6 319.1 190.6 350.9C190.6 381.8 215.7 406.9 246.6 406.9C246.8 406.9 246.1 406.9 247 406.9L247.1 406.9C247.1 406.1 247.3 407.1 247.4 407.4C247.5 407.7 247.5 407.9 247.5 407.1L247.5 408C247.4 408.1 247.4 408.2 247.2 408.3C236 419.5 230.6 434.2 230.8 448.8C213.3 467.1 188 480 160 480C106.1 480 64 437 64 384V96C46.33 96 32 81.67 32 64C32 46.33 46.33 32 64 32H256zM192 192V96H128V192H192zM383.8 189.7C397.1 189.7 407.8 200.4 407.8 213.7C407.8 242.9 443.2 257.6 463.9 236.9C473.3 227.5 488.5 227.5 497.8 236.9C507.2 246.2 507.2 261.4 497.8 270.8C477.2 291.5 491.8 326.9 521.1 326.9C534.3 326.9 545.1 337.6 545.1 350.9C545.1 364.1 534.3 374.9 521.1 374.9C491.8 374.9 477.2 410.3 497.8 430.9C507.2 440.3 507.2 455.5 497.8 464.9C488.5 474.3 473.3 474.3 463.9 464.9C443.2 444.2 407.8 458.9 407.8 488.1C407.8 501.4 397.1 512.1 383.8 512.1C370.6 512.1 359.8 501.4 359.8 488.1C359.8 458.9 324.5 444.2 303.8 464.9C294.4 474.3 279.2 474.3 269.8 464.9C260.5 455.5 260.5 440.3 269.8 430.9C290.5 410.3 275.9 374.9 246.6 374.9C233.4 374.9 222.6 364.1 222.6 350.9C222.6 337.6 233.4 326.9 246.6 326.9C275.9 326.9 290.5 291.5 269.8 270.8C260.5 261.4 260.5 246.2 269.8 236.9C279.2 227.5 294.4 227.5 303.8 236.9C324.5 257.6 359.8 242.9 359.8 213.7C359.8 200.4 370.6 189.7 383.8 189.7H383.8zM352 352C369.7 352 384 337.7 384 320C384 302.3 369.7 288 352 288C334.3 288 320 302.3 320 320C320 337.7 334.3 352 352 352zM416 360C402.7 360 392 370.7 392 384C392 397.3 402.7 408 416 408C429.3 408 440 397.3 440 384C440 370.7 429.3 360 416 360z"],vials:[512,512,[],"f493","M200 32h-176C10.75 32 0 42.74 0 56C0 69.25 10.75 80 24 80H32v320C32 444.1 67.88 480 112 480S192 444.1 192 400v-320h8C213.3 80 224 69.25 224 56C224 42.74 213.3 32 200 32zM144 256h-64V80h64V256zM488 32h-176C298.7 32 288 42.74 288 56c0 13.25 10.75 24 24 24H320v320c0 44.13 35.88 80 80 80s80-35.88 80-80v-320h8C501.3 80 512 69.25 512 56C512 42.74 501.3 32 488 32zM432 256h-64V80h64V256z"],video:[576,512,["video-camera"],"f03d","M384 112v288c0 26.51-21.49 48-48 48h-288c-26.51 0-48-21.49-48-48v-288c0-26.51 21.49-48 48-48h288C362.5 64 384 85.49 384 112zM576 127.5v256.9c0 25.5-29.17 40.39-50.39 25.79L416 334.7V177.3l109.6-75.56C546.9 87.13 576 102.1 576 127.5z"],"video-slash":[640,512,[],"f4e2","M32 399.1c0 26.51 21.49 47.1 47.1 47.1h287.1c19.57 0 36.34-11.75 43.81-28.56L32 121.8L32 399.1zM630.8 469.1l-89.21-69.92l15.99 11.02c21.22 14.59 50.41-.2971 50.41-25.8V127.5c0-25.41-29.07-40.37-50.39-25.76l-109.6 75.56l.0001 148.5l-32-25.08l.0001-188.7c0-26.51-21.49-47.1-47.1-47.1H113.9L38.81 5.111C34.41 1.673 29.19 0 24.03 0C16.91 0 9.84 3.158 5.121 9.189C-3.066 19.63-1.249 34.72 9.189 42.89l591.1 463.1c10.5 8.203 25.57 6.328 33.69-4.078C643.1 492.4 641.2 477.3 630.8 469.1z"],vihara:[640,512,[],"f6a7","M280.1 22.03L305.8 4.661C307.1 3.715 308.4 2.908 309.9 2.246C313.1 .7309 316.6-.0029 319.1 0C323.4-.0029 326.9 .7309 330.1 2.246C331.6 2.909 332.9 3.716 334.2 4.661L359 22.03C392.1 45.8 430.8 63.52 470.8 74.42L493.8 80.71C495.6 81.17 497.4 81.83 499 82.68C502.2 84.33 504.1 86.66 507.1 89.43C510.8 94.38 512.7 100.7 511.8 107.2C511.4 109.1 510.6 112.6 509.3 115C507.7 118.2 505.3 120.1 502.6 123.1C498.3 126.3 492.1 128.1 487.5 128H480V184.1L491.7 193.3C512.8 210 536.6 222.9 562.2 231.4L591.1 241.1C592.7 241.6 594.2 242.2 595.7 243C598.8 244.8 601.4 247.2 603.5 249.1C605.5 252.8 606.9 256 607.6 259.6C608.1 262.2 608.2 265 607.7 267.8C607.2 270.6 606.3 273.3 604.1 275.7C603.2 278.8 600.8 281.5 598 283.5C595.2 285.5 591.1 286.9 588.4 287.6C586.8 287.9 585.1 288 583.4 288H544V353.9C564.5 376.7 591.4 393 621.4 400.6C632 403 640 412.6 640 424C640 437.3 629.3 448 616 448H576V480C576 497.7 561.7 512 544 512C526.3 512 512 497.7 512 480V448H352V480C352 497.7 337.7 512 320 512C302.3 512 288 497.7 288 480V448H128V480C128 497.7 113.7 512 96 512C78.33 512 64 497.7 64 480V448H24C10.75 448 0 437.3 0 424C0 412.6 7.962 403 18.63 400.6C48.61 393 75.51 376.7 96 353.9V288H56.55C54.87 288 53.2 287.9 51.57 287.6C48.03 286.9 44.77 285.5 41.96 283.5C39.16 281.5 36.77 278.8 35.03 275.7C33.69 273.3 32.76 270.6 32.31 267.8C31.85 265 31.9 262.2 32.41 259.6C33.07 256 34.51 252.8 36.53 249.1C38.55 247.2 41.19 244.8 44.34 243C45.78 242.2 47.32 241.6 48.94 241.1L77.81 231.4C103.4 222.9 127.2 210 148.3 193.3L160 184.1V128H152.5C147 128.1 141.7 126.3 137.4 123.1C134.7 120.1 132.3 118.2 130.7 115C129.4 112.6 128.6 109.1 128.2 107.2C127.3 100.7 129.2 94.38 132.9 89.43C135 86.66 137.8 84.33 140.1 82.68C142.6 81.83 144.4 81.17 146.2 80.71L169.2 74.42C209.2 63.52 247 45.8 280.1 22.03H280.1zM223.1 128V192H416V128H223.1zM159.1 352H480V288H159.1V352z"],virus:[512,512,[],"e074","M288 43.55C288 93.44 348.3 118.4 383.6 83.15L391.8 74.98C404.3 62.48 424.5 62.48 437 74.98C449.5 87.48 449.5 107.7 437 120.2L428.9 128.4C393.6 163.7 418.6 224 468.5 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H468.5C418.6 288 393.6 348.3 428.9 383.6L437 391.8C449.5 404.3 449.5 424.5 437 437C424.5 449.5 404.3 449.5 391.8 437L383.6 428.9C348.3 393.6 288 418.6 288 468.5V480C288 497.7 273.7 512 256 512C238.3 512 224 497.7 224 480V468.5C224 418.6 163.7 393.6 128.4 428.9L120.2 437C107.7 449.5 87.48 449.5 74.98 437C62.48 424.5 62.48 404.3 74.98 391.8L83.15 383.6C118.4 348.3 93.44 288 43.55 288H32C14.33 288 0 273.7 0 256C0 238.3 14.33 224 32 224H43.55C93.44 224 118.4 163.7 83.15 128.4L74.98 120.2C62.48 107.7 62.48 87.48 74.98 74.98C87.48 62.48 107.7 62.48 120.2 74.98L128.4 83.15C163.7 118.4 224 93.44 224 43.55V32C224 14.33 238.3 0 256 0C273.7 0 288 14.33 288 32V43.55zM224 176C197.5 176 176 197.5 176 224C176 250.5 197.5 272 224 272C250.5 272 272 250.5 272 224C272 197.5 250.5 176 224 176zM304 328C317.3 328 328 317.3 328 304C328 290.7 317.3 280 304 280C290.7 280 280 290.7 280 304C280 317.3 290.7 328 304 328z"],"virus-covid":[512,512,[],"e4a8","M192 24C192 10.75 202.7 0 216 0H296C309.3 0 320 10.75 320 24C320 37.25 309.3 48 296 48H280V81.62C310.7 85.8 338.8 97.88 362.3 115.7L386.1 91.95L374.8 80.64C365.4 71.26 365.4 56.07 374.8 46.7C384.2 37.32 399.4 37.32 408.7 46.7L465.3 103.3C474.7 112.6 474.7 127.8 465.3 137.2C455.9 146.6 440.7 146.6 431.4 137.2L420 125.9L396.3 149.7C414.1 173.2 426.2 201.3 430.4 232H464V216C464 202.7 474.7 192 488 192C501.3 192 512 202.7 512 216V296C512 309.3 501.3 320 488 320C474.7 320 464 309.3 464 296V280H430.4C426.2 310.7 414.1 338.8 396.3 362.3L420 386.1L431.4 374.8C440.7 365.4 455.9 365.4 465.3 374.8C474.7 384.2 474.7 399.4 465.3 408.7L408.7 465.3C399.4 474.7 384.2 474.7 374.8 465.3C365.4 455.9 365.4 440.7 374.8 431.4L386.1 420L362.3 396.3C338.8 414.1 310.7 426.2 280 430.4V464H296C309.3 464 320 474.7 320 488C320 501.3 309.3 512 296 512H216C202.7 512 192 501.3 192 488C192 474.7 202.7 464 216 464H232V430.4C201.3 426.2 173.2 414.1 149.7 396.3L125.9 420.1L137.2 431.4C146.6 440.7 146.6 455.9 137.2 465.3C127.8 474.7 112.6 474.7 103.3 465.3L46.7 408.7C37.32 399.4 37.32 384.2 46.7 374.8C56.07 365.4 71.27 365.4 80.64 374.8L91.95 386.1L115.7 362.3C97.88 338.8 85.8 310.7 81.62 280H48V296C48 309.3 37.25 320 24 320C10.75 320 0 309.3 0 296V216C0 202.7 10.75 192 24 192C37.25 192 48 202.7 48 216V232H81.62C85.8 201.3 97.88 173.2 115.7 149.7L91.95 125.9L80.64 137.2C71.26 146.6 56.07 146.6 46.7 137.2C37.32 127.8 37.32 112.6 46.7 103.3L103.3 46.7C112.6 37.33 127.8 37.33 137.2 46.7C146.6 56.07 146.6 71.27 137.2 80.64L125.9 91.95L149.7 115.7C173.2 97.88 201.3 85.8 232 81.62V48H216C202.7 48 192 37.26 192 24V24zM192 176C165.5 176 144 197.5 144 224C144 250.5 165.5 272 192 272C218.5 272 240 250.5 240 224C240 197.5 218.5 176 192 176zM304 328C317.3 328 328 317.3 328 304C328 290.7 317.3 280 304 280C290.7 280 280 290.7 280 304C280 317.3 290.7 328 304 328z"],"virus-covid-slash":[640,512,[],"e4a9","M134.1 79.83L167.3 46.7C176.6 37.33 191.8 37.33 201.2 46.7C210.6 56.07 210.6 71.27 201.2 80.64L189.9 91.95L213.7 115.7C237.2 97.88 265.3 85.8 295.1 81.62V48H279.1C266.7 48 255.1 37.26 255.1 24C255.1 10.75 266.7 .0003 279.1 .0003H360C373.3 .0003 384 10.75 384 24C384 37.26 373.3 48 360 48H344V81.62C374.7 85.8 402.8 97.88 426.3 115.7L450.1 91.95L438.8 80.64C429.4 71.26 429.4 56.07 438.8 46.7C448.2 37.32 463.4 37.32 472.7 46.7L529.3 103.3C538.7 112.6 538.7 127.8 529.3 137.2C519.9 146.6 504.7 146.6 495.4 137.2L484 125.9L460.3 149.7C478.1 173.2 490.2 201.3 494.4 232H528V216C528 202.7 538.7 192 552 192C565.3 192 576 202.7 576 216V296C576 309.3 565.3 320 552 320C538.7 320 528 309.3 528 296V280H494.4C491.2 303.3 483.4 325.2 472.1 344.7L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L134.1 79.83zM149.2 213.5L401.3 412.2C383.7 421.3 364.4 427.6 344 430.4V464H360C373.3 464 384 474.7 384 488C384 501.3 373.3 512 360 512H279.1C266.7 512 255.1 501.3 255.1 488C255.1 474.7 266.7 464 279.1 464H295.1V430.4C265.3 426.2 237.2 414.1 213.7 396.3L189.9 420.1L201.2 431.4C210.6 440.7 210.6 455.9 201.2 465.3C191.8 474.7 176.6 474.7 167.3 465.3L110.7 408.7C101.3 399.4 101.3 384.2 110.7 374.8C120.1 365.4 135.3 365.4 144.6 374.8L155.1 386.1L179.7 362.3C161.9 338.8 149.8 310.7 145.6 280H111.1V296C111.1 309.3 101.3 320 87.1 320C74.74 320 63.1 309.3 63.1 296V216C63.1 202.7 74.74 192 87.1 192C101.3 192 111.1 202.7 111.1 216V232H145.6C146.5 225.7 147.7 219.6 149.2 213.5L149.2 213.5z"],"virus-slash":[640,512,[],"e075","M134.7 80.27C135.9 78.4 137.3 76.62 138.1 74.98C151.5 62.48 171.7 62.48 184.2 74.98L192.4 83.15C227.7 118.4 287.1 93.44 287.1 43.55V32C287.1 14.33 302.3 0 319.1 0C337.7 0 352 14.33 352 32V43.55C352 93.44 412.3 118.4 447.6 83.15L455.8 74.98C468.3 62.48 488.5 62.48 501 74.98C513.5 87.48 513.5 107.7 501 120.2L492.9 128.4C457.6 163.7 482.6 224 532.4 224H544C561.7 224 576 238.3 576 256C576 273.7 561.7 288 544 288H532.5C497.2 288 474.4 318.1 476.5 348.1L630.8 469.1C641.2 477.3 643.1 492.4 634.9 502.8C626.7 513.2 611.6 515.1 601.2 506.9L9.196 42.89C-1.236 34.71-3.065 19.63 5.112 9.196C13.29-1.236 28.37-3.065 38.81 5.112L134.7 80.27zM264.6 182.1L334.3 236.7C335.4 232.7 336 228.4 336 224C336 197.5 314.5 176 288 176C279.5 176 271.5 178.2 264.6 182.1V182.1zM107.5 224C122.5 224 135.2 218.6 144.7 210L401.1 412.7C375.6 415.7 352 437.2 352 468.5V480C352 497.7 337.7 512 319.1 512C302.3 512 287.1 497.7 287.1 480V468.5C287.1 418.6 227.7 393.6 192.4 428.9L184.2 437C171.7 449.5 151.5 449.5 138.1 437C126.5 424.5 126.5 404.3 138.1 391.8L147.1 383.6C182.4 348.3 157.4 288 107.5 288H95.1C78.33 288 63.1 273.7 63.1 256C63.1 238.3 78.33 224 95.1 224H107.5z"],viruses:[640,512,[],"e076","M346.5 213.3h16.16C374.5 213.3 384 203.8 384 192c0-11.79-9.541-21.33-21.33-21.33h-16.16c-38.01 0-57.05-45.96-30.17-72.84l11.44-11.44c8.332-8.332 8.331-21.83-.0012-30.17c-8.334-8.334-21.83-8.332-30.17 .002L286.2 67.66C259.3 94.54 213.3 75.51 213.3 37.49V21.33C213.3 9.542 203.8 0 192 0S170.7 9.542 170.7 21.33v16.16c0 38.01-45.96 57.05-72.84 30.17L86.4 56.23c-8.334-8.334-21.83-8.336-30.17-.002c-8.332 8.334-8.333 21.84-.0012 30.17L67.66 97.83c26.88 26.88 7.842 72.84-30.17 72.84H21.33C9.541 170.7 0 180.2 0 192c0 11.79 9.541 21.33 21.33 21.33h16.16c38.01 0 57.05 45.96 30.17 72.84L56.23 297.6c-8.332 8.334-8.328 21.84 .0043 30.17c4.168 4.168 9.621 6.248 15.08 6.248s10.92-2.082 15.08-6.25L97.83 316.3c26.88-26.88 72.84-7.842 72.84 30.17v16.16C170.7 374.5 180.2 384 192 384s21.33-9.543 21.33-21.33v-16.16c0-38.01 45.96-57.05 72.84-30.17l11.43 11.43c4.168 4.168 9.625 6.25 15.08 6.25s10.91-2.08 15.08-6.248c8.332-8.332 8.333-21.83 .0012-30.17L316.3 286.2C289.5 259.3 308.5 213.3 346.5 213.3zM160 192C142.3 192 128 177.7 128 160c0-17.67 14.33-32 32-32s32 14.33 32 32C192 177.7 177.7 192 160 192zM240 224C231.2 224 224 216.8 224 208C224 199.2 231.2 192 240 192S256 199.2 256 208C256 216.8 248.8 224 240 224zM624 352h-12.12c-28.51 0-42.79-34.47-22.63-54.63l8.576-8.576c6.25-6.25 6.25-16.37 0-22.62s-16.38-6.253-22.62-.0031l-8.576 8.576C546.5 294.9 512 280.6 512 252.1V240C512 231.2 504.8 224 496 224S480 231.2 480 240v12.12c0 28.51-34.47 42.79-54.63 22.63l-8.576-8.576c-6.25-6.25-16.37-6.253-22.62-.0031s-6.253 16.38-.0031 22.63l8.576 8.576C422.9 317.5 408.6 352 380.1 352H368c-8.844 0-16 7.156-16 16s7.156 16 16 16h12.12c28.51 0 42.79 34.47 22.63 54.63l-8.576 8.576c-6.25 6.25-6.253 16.37-.0031 22.62c3.125 3.125 7.222 4.691 11.32 4.691s8.188-1.562 11.31-4.688l8.576-8.576C445.5 441.1 480 455.4 480 483.9V496c0 8.844 7.156 16 16 16s16-7.156 16-16v-12.12c0-28.51 34.47-42.79 54.63-22.63l8.576 8.576c3.125 3.125 7.219 4.688 11.31 4.688s8.184-1.559 11.31-4.684c6.25-6.25 6.253-16.38 .0031-22.63l-8.576-8.576C569.1 418.5 583.4 384 611.9 384H624c8.844 0 16-7.156 16-16S632.8 352 624 352zM480 384c-17.67 0-32-14.33-32-32c0-17.67 14.33-32 32-32s32 14.33 32 32C512 369.7 497.7 384 480 384z"],voicemail:[640,512,[],"f897","M495.1 96c-53.13 0-102 29.25-127 76.13c-25 46.88-22.25 103.8 7.25 147.9H263.7c36.63-54.88 31.25-127.8-13-176.8c-44.38-48.87-116.4-61.37-174.6-30.25s-87.88 97.88-71.75 162c16 64 73.63 108.1 139.6 108.1h352C575.5 384 640 319.5 640 240S575.5 96 495.1 96zM63.99 240c0-44.12 35.88-80 80-80s80 35.88 80 80s-35.88 79.1-80 79.1S63.99 284.1 63.99 240zM495.1 320c-44.13 0-80-35.88-80-79.1s35.88-80 80-80s80 35.88 80 80S540.1 320 495.1 320z"],volcano:[512,512,[127755],"f770","M304.4 224H207.6C197.7 224 188.5 228.5 182.4 236.3l-55.63 71l13.25 16.5C149.7 336 170.2 336 180.1 323.8c10.75-13.5 26.75-21.25 44.13-21.5c17.13-1.5 33.5 7 44.75 20l31.63 36.88c9.751 11.38 29.13 11.38 39 0l45.13-52.62l-55-70.25C323.5 228.5 314.3 224 304.4 224zM159.1 144c12.88 0 24.75-3.875 34.75-10.38L223.1 192h64l29.25-58.38C327.3 140.1 339.1 144 352 144c35.25 0 64-28.75 64-64s-28.75-64-64-64c-15.75 0-30 5.875-41.25 15.38C299.6 12.75 279.4 0 255.1 0C232.6 0 212.4 12.75 201.2 31.38C189.1 21.88 175.7 16 159.1 16c-35.25 0-64 28.75-64 64S124.7 144 159.1 144zM505.5 460.8l-100.8-128.6l-41 47.63C352.8 392.6 336.8 400 320 400s-32.75-7.25-43.75-20.25L244.6 343C239.7 337.3 232.6 334 225.1 334H224.7c-7.751 .25-14.88 3.75-19.63 9.75c-22.13 27.5-68.13 27.5-90.13 0l-8.376-10.62l-100.1 127.6C-9.397 481.9 5.727 512 32.1 512h447.9C506.3 512 521.4 481.9 505.5 460.8z"],volleyball:[512,512,[127952,"volleyball-ball"],"f45f","M200.3 106C185.4 80.24 165.2 53.9 137.4 29.26C55.75 72.05 0 157.4 0 256c0 21.33 2.898 41.94 7.814 61.75C53.59 182.1 155.1 124.9 200.3 106zM381.7 281.1c1.24-9.223 2.414-22.08 2.414-37.65c0-59.1-16.93-157.2-111.5-242.6C267.1 .4896 261.6 0 256 0C225.5 0 196.5 5.591 169.4 15.36c93.83 90.15 102.6 198.5 102.8 231.7C287.8 255.9 327.3 275.1 381.7 281.1zM240.1 246.5C239.1 228.5 236.9 184.7 214.9 134.6C173.6 151.6 60.4 211.7 26.67 369.2c15.66 31.64 37.52 59.66 64.22 82.23C122 325.1 211.5 263.3 240.1 246.5zM326.5 10.07c74.79 84.9 89.5 175.9 89.5 234c0 15.45-1.042 28.56-2.27 38.61l.5501 .0005c29.54 0 62.2-4.325 97.16-15.99C511.6 263.1 512 259.6 512 256C512 139.1 433.6 40.72 326.5 10.07zM255.7 274.5c-15.43 9.086-51.89 33.63-84.32 77.86c26.34 20.33 93.51 63.27 189.5 63.27c32.83 0 69.02-5.021 108.1-17.69c19.08-28.59 32.41-61.34 38.71-96.47C474.5 311.1 443 315 414.4 315C334.6 315 276.5 286.3 255.7 274.5zM153.1 379.3c-14.91 25.71-27.62 56.33-35.03 92.72C158.6 497.2 205.5 512 256 512c69 0 131.5-27.43 177.5-71.82c-25.42 5.105-49.71 7.668-72.38 7.668C258.6 447.8 185.5 402.1 153.1 379.3z"],"volume-high":[640,512,[128266,"volume-up"],"f028","M412.6 182c-10.28-8.334-25.41-6.867-33.75 3.402c-8.406 10.24-6.906 25.35 3.375 33.74C393.5 228.4 400 241.8 400 255.1c0 14.17-6.5 27.59-17.81 36.83c-10.28 8.396-11.78 23.5-3.375 33.74c4.719 5.806 11.62 8.802 18.56 8.802c5.344 0 10.75-1.779 15.19-5.399C435.1 311.5 448 284.6 448 255.1S435.1 200.4 412.6 182zM473.1 108.2c-10.22-8.334-25.34-6.898-33.78 3.34c-8.406 10.24-6.906 25.35 3.344 33.74C476.6 172.1 496 213.3 496 255.1s-19.44 82.1-53.31 110.7c-10.25 8.396-11.75 23.5-3.344 33.74c4.75 5.775 11.62 8.771 18.56 8.771c5.375 0 10.75-1.779 15.22-5.431C518.2 366.9 544 313 544 255.1S518.2 145 473.1 108.2zM534.4 33.4c-10.22-8.334-25.34-6.867-33.78 3.34c-8.406 10.24-6.906 25.35 3.344 33.74C559.9 116.3 592 183.9 592 255.1s-32.09 139.7-88.06 185.5c-10.25 8.396-11.75 23.5-3.344 33.74C505.3 481 512.2 484 519.2 484c5.375 0 10.75-1.779 15.22-5.431C601.5 423.6 640 342.5 640 255.1S601.5 88.34 534.4 33.4zM301.2 34.98c-11.5-5.181-25.01-3.076-34.43 5.29L131.8 160.1H48c-26.51 0-48 21.48-48 47.96v95.92c0 26.48 21.49 47.96 48 47.96h83.84l134.9 119.8C272.7 477 280.3 479.8 288 479.8c4.438 0 8.959-.9314 13.16-2.835C312.7 471.8 320 460.4 320 447.9V64.12C320 51.55 312.7 40.13 301.2 34.98z"],"volume-low":[448,512,[128264,"volume-down"],"f027","M412.6 181.9c-10.28-8.344-25.41-6.875-33.75 3.406c-8.406 10.25-6.906 25.37 3.375 33.78C393.5 228.4 400 241.8 400 256c0 14.19-6.5 27.62-17.81 36.87c-10.28 8.406-11.78 23.53-3.375 33.78c4.719 5.812 11.62 8.812 18.56 8.812c5.344 0 10.75-1.781 15.19-5.406C435.1 311.6 448 284.7 448 256S435.1 200.4 412.6 181.9zM301.2 34.84c-11.5-5.187-25.01-3.116-34.43 5.259L131.8 160H48c-26.51 0-48 21.49-48 47.1v95.1c0 26.51 21.49 47.1 48 47.1h83.84l134.9 119.9C272.7 477.2 280.3 480 288 480c4.438 0 8.959-.9313 13.16-2.837C312.7 472 320 460.6 320 448V64C320 51.41 312.7 39.1 301.2 34.84z"],"volume-off":[320,512,[],"f026","M320 64v383.1c0 12.59-7.337 24.01-18.84 29.16C296.1 479.1 292.4 480 288 480c-7.688 0-15.28-2.781-21.27-8.094l-134.9-119.9H48c-26.51 0-48-21.49-48-47.1V208c0-26.51 21.49-47.1 48-47.1h83.84l134.9-119.9c9.422-8.375 22.93-10.45 34.43-5.259C312.7 39.1 320 51.41 320 64z"],"volume-xmark":[576,512,["volume-mute","volume-times"],"f6a9","M301.2 34.85c-11.5-5.188-25.02-3.122-34.44 5.253L131.8 160H48c-26.51 0-48 21.49-48 47.1v95.1c0 26.51 21.49 47.1 48 47.1h83.84l134.9 119.9c5.984 5.312 13.58 8.094 21.26 8.094c4.438 0 8.972-.9375 13.17-2.844c11.5-5.156 18.82-16.56 18.82-29.16V64C319.1 51.41 312.7 40 301.2 34.85zM513.9 255.1l47.03-47.03c9.375-9.375 9.375-24.56 0-33.94s-24.56-9.375-33.94 0L480 222.1L432.1 175c-9.375-9.375-24.56-9.375-33.94 0s-9.375 24.56 0 33.94l47.03 47.03l-47.03 47.03c-9.375 9.375-9.375 24.56 0 33.94c9.373 9.373 24.56 9.381 33.94 0L480 289.9l47.03 47.03c9.373 9.373 24.56 9.381 33.94 0c9.375-9.375 9.375-24.56 0-33.94L513.9 255.1z"],"vr-cardboard":[640,512,[],"f729","M576 64H64c-35.2 0-64 28.8-64 64v256c0 35.2 28.8 64 64 64l128.3 .0001c25.18 0 48.03-14.77 58.37-37.73l27.76-61.65c7.875-17.5 24-28.63 41.63-28.63s33.75 11.13 41.63 28.63l27.75 61.63c10.35 22.98 33.2 37.75 58.4 37.75L576 448c35.2 0 64-28.8 64-64v-256C640 92.8 611.2 64 576 64zM160 304c-35.38 0-64-28.63-64-64s28.62-63.1 64-63.1s64 28.62 64 63.1S195.4 304 160 304zM480 304c-35.38 0-64-28.63-64-64s28.62-63.1 64-63.1s64 28.62 64 63.1S515.4 304 480 304z"],w:[576,512,[119],"57","M573.1 75.25l-144 384c-4.703 12.53-16.67 20.77-29.95 20.77c-.4062 0-.8125 0-1.219-.0156c-13.77-.5156-25.66-9.797-29.52-23.03L288 178.3l-81.28 278.7c-3.859 13.23-15.75 22.52-29.52 23.03c-13.75 .4687-26.33-7.844-31.17-20.75l-144-384c-6.203-16.55 2.188-34.98 18.73-41.2C37.31 27.92 55.75 36.23 61.97 52.78l110.2 293.1l85.08-291.7C261.3 41.41 273.8 32.01 288 32.01s26.73 9.396 30.72 23.05l85.08 291.7l110.2-293.1c6.219-16.55 24.67-24.86 41.2-18.73C571.8 40.26 580.2 58.7 573.1 75.25z"],"walkie-talkie":[384,512,[],"f8ef","M352 96h-32V80C320 71.16 312.8 64 304 64h-32C263.2 64 256 71.16 256 80V96h-32V80C224 71.16 216.8 64 208 64h-32C167.2 64 160 71.16 160 80V96H112V23.1C112 10.74 101.3 0 88 0S64 10.74 64 23.1V96H32C14.4 96 0 110.4 0 128v178.7c0 8.484 3.373 16.62 9.371 22.62L32 352v112C32 490.5 53.49 512 80 512h224c26.51 0 48-21.49 48-48V352l22.63-22.63C380.6 323.4 384 315.2 384 306.7V128C384 110.4 369.6 96 352 96zM288 312C288 316.4 284.4 320 280 320h-176C99.63 320 96 316.4 96 312v-16C96 291.6 99.63 288 104 288h176C284.4 288 288 291.6 288 296V312zM288 248C288 252.4 284.4 256 280 256h-176C99.63 256 96 252.4 96 248v-16C96 227.6 99.63 224 104 224h176C284.4 224 288 227.6 288 232V248zM288 184C288 188.4 284.4 192 280 192h-176C99.63 192 96 188.4 96 184v-16C96 163.6 99.63 160 104 160h176C284.4 160 288 163.6 288 168V184z"],wallet:[512,512,[],"f555","M448 32C465.7 32 480 46.33 480 64C480 81.67 465.7 96 448 96H80C71.16 96 64 103.2 64 112C64 120.8 71.16 128 80 128H448C483.3 128 512 156.7 512 192V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM416 336C433.7 336 448 321.7 448 304C448 286.3 433.7 272 416 272C398.3 272 384 286.3 384 304C384 321.7 398.3 336 416 336z"],"wand-magic":[512,512,["magic"],"f0d0","M14.06 463.3C-4.686 444.6-4.686 414.2 14.06 395.4L395.4 14.06C414.2-4.686 444.6-4.686 463.3 14.06L497.9 48.64C516.6 67.38 516.6 97.78 497.9 116.5L116.5 497.9C97.78 516.6 67.38 516.6 48.64 497.9L14.06 463.3zM347.6 187.6L452.6 82.58L429.4 59.31L324.3 164.3L347.6 187.6z"],"wand-magic-sparkles":[576,512,["magic-wand-sparkles"],"e2ca","M248.8 4.994C249.9 1.99 252.8 .0001 256 .0001C259.2 .0001 262.1 1.99 263.2 4.994L277.3 42.67L315 56.79C318 57.92 320 60.79 320 64C320 67.21 318 70.08 315 71.21L277.3 85.33L263.2 123C262.1 126 259.2 128 256 128C252.8 128 249.9 126 248.8 123L234.7 85.33L196.1 71.21C193.1 70.08 192 67.21 192 64C192 60.79 193.1 57.92 196.1 56.79L234.7 42.67L248.8 4.994zM427.4 14.06C446.2-4.686 476.6-4.686 495.3 14.06L529.9 48.64C548.6 67.38 548.6 97.78 529.9 116.5L148.5 497.9C129.8 516.6 99.38 516.6 80.64 497.9L46.06 463.3C27.31 444.6 27.31 414.2 46.06 395.4L427.4 14.06zM461.4 59.31L356.3 164.3L379.6 187.6L484.6 82.58L461.4 59.31zM7.491 117.2L64 96L85.19 39.49C86.88 34.98 91.19 32 96 32C100.8 32 105.1 34.98 106.8 39.49L128 96L184.5 117.2C189 118.9 192 123.2 192 128C192 132.8 189 137.1 184.5 138.8L128 160L106.8 216.5C105.1 221 100.8 224 96 224C91.19 224 86.88 221 85.19 216.5L64 160L7.491 138.8C2.985 137.1 0 132.8 0 128C0 123.2 2.985 118.9 7.491 117.2zM359.5 373.2L416 352L437.2 295.5C438.9 290.1 443.2 288 448 288C452.8 288 457.1 290.1 458.8 295.5L480 352L536.5 373.2C541 374.9 544 379.2 544 384C544 388.8 541 393.1 536.5 394.8L480 416L458.8 472.5C457.1 477 452.8 480 448 480C443.2 480 438.9 477 437.2 472.5L416 416L359.5 394.8C354.1 393.1 352 388.8 352 384C352 379.2 354.1 374.9 359.5 373.2z"],"wand-sparkles":[512,512,[],"f72b","M3.682 149.1L53.32 170.7L74.02 220.3c1.016 2.043 3.698 3.696 5.977 3.696c.0078 0-.0078 0 0 0c2.271-.0156 4.934-1.661 5.946-3.696l20.72-49.63l49.62-20.71c2.023-1.008 3.68-3.681 3.691-5.947C159.1 141.7 158.3 139 156.3 138L106.9 117.4L106.5 117L85.94 67.7C84.93 65.66 82.27 64.02 80 64c-.0078 0 .0078 0 0 0c-2.279 0-4.966 1.649-5.981 3.692L53.32 117.3L3.682 138C1.652 139.1 0 141.7 0 144C0 146.3 1.652 148.9 3.682 149.1zM511.1 368c-.0039-2.273-1.658-4.95-3.687-5.966l-49.57-20.67l-20.77-49.67C436.9 289.7 434.3 288 432 288c-2.281 0-4.948 1.652-5.964 3.695l-20.7 49.63l-49.64 20.71c-2.027 1.016-3.684 3.683-3.687 5.956c.0039 2.262 1.662 4.954 3.687 5.966l49.57 20.67l20.77 49.67C427.1 446.3 429.7 448 432 448c2.277 0 4.944-1.656 5.96-3.699l20.69-49.63l49.65-20.71C510.3 372.9 511.1 370.3 511.1 368zM207.1 64l12.42 29.78C221 95.01 222.6 96 223.1 96s2.965-.9922 3.575-2.219L239.1 64l29.78-12.42c1.219-.6094 2.215-2.219 2.215-3.578c0-1.367-.996-2.969-2.215-3.578L239.1 32L227.6 2.219C226.1 .9922 225.4 0 223.1 0S221 .9922 220.4 2.219L207.1 32L178.2 44.42C176.1 45.03 176 46.63 176 48c0 1.359 .9928 2.969 2.21 3.578L207.1 64zM399.1 191.1c8.875 0 15.1-7.127 15.1-16v-28l91.87-101.7c5.75-6.371 5.5-15.1-.4999-22.12L487.8 4.774c-6.125-6.125-15.75-6.375-22.12-.625L186.6 255.1H144c-8.875 0-15.1 7.125-15.1 15.1v36.88l-117.5 106c-13.5 12.25-14.14 33.34-1.145 46.34l41.4 41.41c12.1 12.1 34.13 12.36 46.37-1.133l279.2-309.5H399.1z"],warehouse:[640,512,[],"f494","M0 488V171.3C0 145.2 15.93 121.6 40.23 111.9L308.1 4.753C315.7 1.702 324.3 1.702 331.9 4.753L599.8 111.9C624.1 121.6 640 145.2 640 171.3V488C640 501.3 629.3 512 616 512H568C554.7 512 544 501.3 544 488V223.1C544 206.3 529.7 191.1 512 191.1H128C110.3 191.1 96 206.3 96 223.1V488C96 501.3 85.25 512 72 512H24C10.75 512 0 501.3 0 488zM152 512C138.7 512 128 501.3 128 488V432H512V488C512 501.3 501.3 512 488 512H152zM128 336H512V400H128V336zM128 224H512V304H128V224z"],water:[576,512,[],"f773","M549.8 237.5c-31.23-5.719-46.84-20.06-47.13-20.31C490.4 205 470.3 205.1 457.7 216.8c-1 .9375-25.14 23-73.73 23s-72.73-22.06-73.38-22.62C298.4 204.9 278.3 205.1 265.7 216.8c-1 .9375-25.14 23-73.73 23S119.3 217.8 118.6 217.2C106.4 204.9 86.35 205 73.74 216.9C73.09 217.4 57.48 231.8 26.24 237.5c-17.38 3.188-28.89 19.84-25.72 37.22c3.188 17.38 19.78 29.09 37.25 25.72C63.1 295.8 82.49 287.1 95.96 279.2c19.5 11.53 51.47 24.68 96.04 24.68c44.55 0 76.49-13.12 96-24.65c19.52 11.53 51.45 24.59 96 24.59c44.58 0 76.55-13.09 96.05-24.62c13.47 7.938 32.86 16.62 58.19 21.25c17.56 3.375 34.06-8.344 37.25-25.72C578.7 257.4 567.2 240.7 549.8 237.5zM549.8 381.7c-31.23-5.719-46.84-20.06-47.13-20.31c-12.22-12.19-32.31-12.12-44.91-.375C456.7 361.9 432.6 384 384 384s-72.73-22.06-73.38-22.62c-12.22-12.25-32.3-12.12-44.89-.375C264.7 361.9 240.6 384 192 384s-72.73-22.06-73.38-22.62c-12.22-12.25-32.28-12.16-44.89-.3438c-.6562 .5938-16.27 14.94-47.5 20.66c-17.38 3.188-28.89 19.84-25.72 37.22C3.713 436.3 20.31 448 37.78 444.6C63.1 440 82.49 431.3 95.96 423.4c19.5 11.53 51.51 24.62 96.08 24.62c44.55 0 76.45-13.06 95.96-24.59C307.5 434.9 339.5 448 384.1 448c44.58 0 76.5-13.09 95.1-24.62c13.47 7.938 32.86 16.62 58.19 21.25C555.8 448 572.3 436.3 575.5 418.9C578.7 401.5 567.2 384.9 549.8 381.7zM37.78 156.4c25.33-4.625 44.72-13.31 58.19-21.25c19.5 11.53 51.47 24.68 96.04 24.68c44.55 0 76.49-13.12 96-24.65c19.52 11.53 51.45 24.59 96 24.59c44.58 0 76.55-13.09 96.05-24.62c13.47 7.938 32.86 16.62 58.19 21.25c17.56 3.375 34.06-8.344 37.25-25.72c3.172-17.38-8.344-34.03-25.72-37.22c-31.23-5.719-46.84-20.06-47.13-20.31c-12.22-12.19-32.31-12.12-44.91-.375c-1 .9375-25.14 23-73.73 23s-72.73-22.06-73.38-22.62c-12.22-12.25-32.3-12.12-44.89-.375c-1 .9375-25.14 23-73.73 23S119.3 73.76 118.6 73.2C106.4 60.95 86.35 61.04 73.74 72.85C73.09 73.45 57.48 87.79 26.24 93.51c-17.38 3.188-28.89 19.84-25.72 37.22C3.713 148.1 20.31 159.8 37.78 156.4z"],"water-ladder":[576,512,["ladder-water","swimming-pool"],"f5c5","M320 128c0 .375-.1992 .6855-.2129 1.057C319.8 129.9 320 130.7 320 131.6V128zM192 383.1V288h192v95.99c39.6-.1448 53.95-17.98 64-26.83V128c0-17.62 14.38-32 32-32s32 14.38 32 32c0 17.67 14.33 32 32 32s32-14.33 32-32c0-53-42.1-95.1-95.1-95.1C420.1 32 384 81.94 384 131.6V224H192V128c0-17.62 14.38-32 32-32s32 14.38 32 32c0 17.67 14.33 32 32 32c17.3 0 31.2-13.79 31.79-30.94c-1.227-49.01-37.99-97.06-95.79-97.06C170.1 32 128 74.1 128 128v229.2C138.5 366.4 151.4 383.8 192 383.1zM576 445c0-15.14-10.82-28.59-26.25-31.42c-48.52-8.888-45.5-29.48-69.6-29.48c-25.02 0-31.19 31.79-96.18 31.79c-48.59 0-72.72-22.06-73.38-22.62c-6.141-6.157-14.26-9.188-22.42-9.188c-24.75 0-31.59 31.81-96.2 31.81c-48.59 0-72.69-22.03-73.41-22.59c-6.125-6.157-14.24-9.196-22.4-9.196c-8.072 0-16.18 2.976-22.45 8.852c-29.01 26.25-73.75 12.54-73.75 52.08c0 16.08 12.77 32.07 31.71 32.07c9.77 0 39.65-7.34 64.26-21.84c19.5 11.53 51.51 24.69 96.08 24.69s76.46-13.12 95.96-24.66c19.53 11.53 51.52 24.62 96.06 24.62c44.59 0 76.51-13.12 96.01-24.66c24.71 14.57 54.74 21.83 64.24 21.83C563.2 477.1 576 461.3 576 445z"],"wave-square":[640,512,[],"f83e","M476 480h-152c-19.88 0-36-16.12-36-36v-348H192v156c0 19.88-16.12 36-36 36H31.1C14.33 288 0 273.7 0 256s14.33-31.1 31.1-31.1H128v-156c0-19.88 16.12-36 36-36h152c19.88 0 36 16.12 36 36v348h96v-156c0-19.88 16.12-36 36-36h124C625.7 224 640 238.3 640 256s-14.33 32-31.1 32H512v156C512 463.9 495.9 480 476 480z"],"weight-hanging":[512,512,[],"f5cd","M510.3 445.9L437.3 153.8C433.5 138.5 420.8 128 406.4 128H346.1c3.625-9.1 5.875-20.75 5.875-32c0-53-42.1-96-96-96S159.1 43 159.1 96c0 11.25 2.25 22 5.875 32H105.6c-14.38 0-27.13 10.5-30.88 25.75l-73.01 292.1C-6.641 479.1 16.36 512 47.99 512h416C495.6 512 518.6 479.1 510.3 445.9zM256 128C238.4 128 223.1 113.6 223.1 96S238.4 64 256 64c17.63 0 32 14.38 32 32S273.6 128 256 128z"],"weight-scale":[512,512,["weight"],"f496","M310.3 97.25c-8-3.5-17.5 .25-21 8.5L255.8 184C233.8 184.3 216 202 216 224c0 22.12 17.88 40 40 40S296 246.1 296 224c0-10.5-4.25-20-11-27.12l33.75-78.63C322.3 110.1 318.4 100.8 310.3 97.25zM448 64h-56.23C359.5 24.91 310.7 0 256 0S152.5 24.91 120.2 64H64C28.75 64 0 92.75 0 128v320c0 35.25 28.75 64 64 64h384c35.25 0 64-28.75 64-64V128C512 92.75 483.3 64 448 64zM256 304c-70.58 0-128-57.42-128-128s57.42-128 128-128c70.58 0 128 57.42 128 128S326.6 304 256 304z"],"wheat-awn":[512,512,["wheat-alt"],"e2cd","M416.1 128.1C407.6 138.3 392.4 138.3 383 128.1C373.7 119.6 373.7 104.4 383 95.03L471 7.029C480.4-2.343 495.6-2.343 504.1 7.029C514.3 16.4 514.3 31.6 504.1 40.97L416.1 128.1zM316.8 38.63C321.3 43.15 325.4 47.94 329.1 52.93L375 7.029C384.4-2.343 399.6-2.343 408.1 7.029C418.3 16.4 418.3 31.6 408.1 40.97L350.7 99.2C355.9 120.7 355.4 143.2 349.3 164.5C369.6 158.7 391.1 157.1 411.7 162.4L471 103C480.4 93.66 495.6 93.66 504.1 103C514.3 112.4 514.3 127.6 504.1 136.1L458.8 183.1C464.5 187.2 470 191.9 475.2 197L486.5 208.3C492.7 214.6 492.7 224.7 486.5 230.1L475.2 242.3C437.7 279.8 376.9 279.8 339.4 242.3L327.2 230.1L295.3 261.1C323.8 264.7 351.5 277 373.4 298.8L384.7 310.2C390.9 316.4 390.9 326.5 384.7 332.8L373.4 344.1C335.9 381.6 275.1 381.6 237.6 344.1L225.4 331.9L193.5 363.8C221.1 366.5 249.7 378.8 271.5 400.7L282.8 411.1C289.1 418.2 289.1 428.4 282.8 434.6L271.5 445.9C234 483.4 173.3 483.4 135.8 445.9L123.5 433.7L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L78.29 388.5L67.88 378C30.39 340.6 30.39 279.8 67.88 242.3L79.2 230.1C85.44 224.7 95.57 224.7 101.8 230.1L113.1 242.3C134.1 263.3 146.3 289.7 149.7 317.1L180.1 286.6L169.7 276.2C132.2 238.7 132.2 177.9 169.7 140.5L181 129.1C187.3 122.9 197.4 122.9 203.6 129.1L214.1 140.5C235.1 161.4 248.1 187.9 251.5 215.3L281.9 184.8L271.5 174.4C234 136.9 234 76.12 271.5 38.63L282.8 27.31C289.1 21.07 299.2 21.07 305.5 27.31L316.8 38.63z"],"wheat-awn-circle-exclamation":[640,512,[],"e598","M416.1 128.1C407.6 138.3 392.4 138.3 383 128.1C373.7 119.6 373.7 104.4 383 95.03L471 7.029C480.4-2.343 495.6-2.343 504.1 7.029C514.3 16.4 514.3 31.6 504.1 40.97L416.1 128.1zM316.8 38.63C321.3 43.15 325.4 47.94 329.1 52.93L375 7.029C384.4-2.343 399.6-2.343 408.1 7.029C418.3 16.4 418.3 31.6 408.1 40.97L350.7 99.2C355.9 120.7 355.4 143.2 349.3 164.5C369.6 158.7 391.1 157.1 411.7 162.4L471 103C480.4 93.66 495.6 93.66 504.1 103C514.3 112.4 514.3 127.6 504.1 136.1L458.8 183.1C463.3 186.3 467.6 189.8 471.7 193.7C426.3 199.9 386.5 223.5 359.1 257.4C352 253.3 345.4 248.3 339.4 242.3L327.2 230.1L295.3 261.1C312.5 263.6 329.5 268.8 345 277.4C329.1 303.9 320 334.9 320 368C320 369 320 370.1 320 371.1C290.9 375.6 260 366.6 237.6 344.1L225.4 331.9L193.5 363.8C221.1 366.5 249.7 378.8 271.5 400.7L282.8 411.1C289.1 418.2 289.1 428.4 282.8 434.6L271.5 445.9C234 483.4 173.3 483.4 135.8 445.9L123.5 433.7L54.63 502.6C42.13 515.1 21.87 515.1 9.372 502.6C-3.124 490.1-3.124 469.9 9.372 457.4L78.29 388.5L67.88 378C30.39 340.6 30.39 279.8 67.88 242.3L79.2 230.1C85.44 224.7 95.57 224.7 101.8 230.1L113.1 242.3C134.1 263.3 146.3 289.7 149.7 317.1L180.1 286.6L169.7 276.2C132.2 238.7 132.2 177.9 169.7 140.5L181 129.1C187.3 122.9 197.4 122.9 203.6 129.1L214.1 140.5C235.1 161.4 248.1 187.9 251.5 215.3L281.9 184.8L271.5 174.4C234 136.9 234 76.12 271.5 38.63L282.8 27.31C289.1 21.06 299.2 21.06 305.5 27.31L316.8 38.63zM352 368C352 288.5 416.5 224 496 224C575.5 224 640 288.5 640 368C640 447.5 575.5 512 496 512C416.5 512 352 447.5 352 368zM496 464C509.3 464 520 453.3 520 440C520 426.7 509.3 416 496 416C482.7 416 472 426.7 472 440C472 453.3 482.7 464 496 464zM479.1 288V368C479.1 376.8 487.2 384 495.1 384C504.8 384 511.1 376.8 511.1 368V288C511.1 279.2 504.8 272 495.1 272C487.2 272 479.1 279.2 479.1 288z"],wheelchair:[512,512,[],"f193","M510.3 421.9c-5.594-16.75-23.53-25.84-40.47-20.22l-19.38 6.438l-41.7-99.97C403.9 295.1 392.2 288 379.1 288h-97.78l-10.4-48h65.11c17.69 0 32-14.31 32-32s-14.31-32-32-32h-78.98L255.6 169.2C251.8 142.1 227.2 124.8 201.2 128.5C174.1 132.2 156.7 156.5 160.5 182.8l23.68 140.4C185.8 339.6 199.6 352 216 352h141.4l44.86 107.9C407.3 472.3 419.3 480 432 480c3.344 0 6.781-.5313 10.12-1.656l48-16C506.9 456.8 515.9 438.7 510.3 421.9zM160 464c-61.76 0-112-50.24-112-112c0-54.25 38.78-99.55 90.06-109.8L130.1 195C56.06 209 0 273.9 0 352c0 88.37 71.63 160 160 160c77.4 0 141.9-54.97 156.8-128h-49.1C252.9 430.1 210.6 464 160 464zM192 96c26.51 0 48-21.49 48-48S218.5 0 192 0S144 21.49 144 48S165.5 96 192 96z"],"wheelchair-move":[448,512,["wheelchair-alt"],"e2ce","M416 48C416 74.51 394.5 96 368 96C341.5 96 320 74.51 320 48C320 21.49 341.5 0 368 0C394.5 0 416 21.49 416 48zM172.8 54.4C182.3 47.29 194.9 46 205.6 51.05L322.1 105.9C351.3 119.6 358.9 157.5 337.4 181.4L299.1 224H416C425.6 224 434.7 228.3 440.7 235.7C446.8 243.1 449.3 252.9 447.4 262.3L415.4 422.3C411.9 439.6 395.1 450.8 377.7 447.4C360.4 443.9 349.2 427.1 352.6 409.7L376.1 288H306.7C315.3 307.6 320 329.2 320 352C320 440.4 248.4 512 160 512C71.63 512 0 440.4 0 352C0 263.6 71.63 192 160 192C171.1 192 181.1 193.1 192.4 195.3L246.6 141.1L195.8 117.2L147.2 153.6C133.1 164.2 113 161.3 102.4 147.2C91.8 133.1 94.66 113 108.8 102.4L172.8 54.4zM160 448C213 448 256 405 256 352C256 298.1 213 256 160 256C106.1 256 64 298.1 64 352C64 405 106.1 448 160 448z"],"whiskey-glass":[512,512,[129347,"glass-whiskey"],"f7a0","M479.1 32H32.04C12.55 32-2.324 49.25 .3008 68.51L56.29 425.1C60.79 456.6 87.78 480 119.8 480h272.9c31.74 0 58.86-23.38 63.36-54.89l55.61-356.6C514.3 49.25 499.5 32 479.1 32zM422.7 224H89.49L69.39 96h373.2L422.7 224z"],wifi:[640,512,["wifi-3","wifi-strong"],"f1eb","M319.1 351.1c-35.35 0-64 28.66-64 64.01s28.66 64.01 64 64.01c35.34 0 64-28.66 64-64.01S355.3 351.1 319.1 351.1zM320 191.1c-70.25 0-137.9 25.6-190.5 72.03C116.3 275.7 115 295.9 126.7 309.2C138.5 322.4 158.7 323.7 171.9 312C212.8 275.9 265.4 256 320 256s107.3 19.88 148.1 56C474.2 317.4 481.8 320 489.3 320c8.844 0 17.66-3.656 24-10.81C525 295.9 523.8 275.7 510.5 264C457.9 217.6 390.3 191.1 320 191.1zM630.2 156.7C546.3 76.28 436.2 32 320 32S93.69 76.28 9.844 156.7c-12.75 12.25-13.16 32.5-.9375 45.25c12.22 12.78 32.47 13.12 45.25 .9375C125.1 133.1 220.4 96 320 96s193.1 37.97 265.8 106.9C592.1 208.8 600 211.8 608 211.8c8.406 0 16.81-3.281 23.09-9.844C643.3 189.2 642.9 168.1 630.2 156.7z"],wind:[512,512,[],"f72e","M32 192h320c52.94 0 96-43.06 96-96s-43.06-96-96-96h-32c-17.69 0-32 14.31-32 32s14.31 32 32 32h32c17.66 0 32 14.34 32 32s-14.34 32-32 32H32C14.31 128 0 142.3 0 160S14.31 192 32 192zM160 320H32c-17.69 0-32 14.31-32 32s14.31 32 32 32h128c17.66 0 32 14.34 32 32s-14.34 32-32 32H128c-17.69 0-32 14.31-32 32s14.31 32 32 32h32c52.94 0 96-43.06 96-96S212.9 320 160 320zM416 224H32C14.31 224 0 238.3 0 256s14.31 32 32 32h384c17.66 0 32 14.34 32 32s-14.34 32-32 32h-32c-17.69 0-32 14.31-32 32s14.31 32 32 32h32c52.94 0 96-43.06 96-96S468.9 224 416 224z"],"window-maximize":[512,512,[128470],"f2d0","M448 32C483.3 32 512 60.65 512 96V416C512 451.3 483.3 480 448 480H64C28.65 480 0 451.3 0 416V96C0 60.65 28.65 32 64 32H448zM96 96C78.33 96 64 110.3 64 128C64 145.7 78.33 160 96 160H416C433.7 160 448 145.7 448 128C448 110.3 433.7 96 416 96H96z"],"window-minimize":[512,512,[128469],"f2d1","M0 448C0 430.3 14.33 416 32 416H480C497.7 416 512 430.3 512 448C512 465.7 497.7 480 480 480H32C14.33 480 0 465.7 0 448z"],"window-restore":[512,512,[],"f2d2","M432 64H208C199.2 64 192 71.16 192 80V96H128V80C128 35.82 163.8 0 208 0H432C476.2 0 512 35.82 512 80V304C512 348.2 476.2 384 432 384H416V320H432C440.8 320 448 312.8 448 304V80C448 71.16 440.8 64 432 64zM0 192C0 156.7 28.65 128 64 128H320C355.3 128 384 156.7 384 192V448C384 483.3 355.3 512 320 512H64C28.65 512 0 483.3 0 448V192zM96 256H288C305.7 256 320 241.7 320 224C320 206.3 305.7 192 288 192H96C78.33 192 64 206.3 64 224C64 241.7 78.33 256 96 256z"],"wine-bottle":[512,512,[],"f72f","M507.3 72.57l-67.88-67.88c-6.252-6.25-16.38-6.25-22.63 0l-22.63 22.62c-6.25 6.254-6.251 16.38-.0006 22.63l-76.63 76.63c-46.63-19.75-102.4-10.75-140.4 27.25l-158.4 158.4c-25 25-25 65.51 0 90.51l90.51 90.52c25 25 65.51 25 90.51 0l158.4-158.4c38-38 47-93.76 27.25-140.4l76.63-76.63c6.25 6.25 16.5 6.25 22.75 0l22.63-22.63C513.5 88.95 513.5 78.82 507.3 72.57zM179.3 423.2l-90.51-90.51l122-122l90.51 90.52L179.3 423.2z"],"wine-glass":[320,512,[127863],"f4e3","M232 464h-40.01v-117.3c68.51-15.88 118-79.86 111.4-154.1L287.5 14.5C286.8 6.25 279.9 0 271.8 0H48.23C40.1 0 33.22 6.25 32.47 14.5L16.6 192.6c-6.626 74.25 42.88 138.2 111.4 154.2V464H87.98c-22.13 0-40.01 17.88-40.01 40c0 4.375 3.626 8 8.002 8h208c4.376 0 8.002-3.625 8.002-8C272 481.9 254.1 464 232 464zM77.72 48h164.6L249.4 128H70.58L77.72 48z"],"wine-glass-empty":[320,512,["wine-glass-alt"],"f5ce","M232 464h-40.01v-117.3c68.52-15.88 118-79.86 111.4-154.1L287.5 14.5C286.8 6.25 279.9 0 271.8 0H48.23C40.1 0 33.22 6.25 32.47 14.5L16.6 192.6c-6.625 74.25 42.88 138.2 111.4 154.2V464H87.98c-22.13 0-40.01 17.88-40.01 40c0 4.375 3.625 8 8.002 8h208c4.377 0 8.002-3.625 8.002-8C272 481.9 254.1 464 232 464zM180.4 300.2c-13.64 3.16-27.84 3.148-41.48-.0371C91.88 289.2 60.09 245.2 64.38 197.1L77.7 48h164.6L255.6 197.2c4.279 48.01-27.5 91.93-74.46 102.8L180.4 300.2z"],"won-sign":[512,512,[8361,"krw","won"],"f159","M119.1 224H183L224.1 56.24C228.5 41.99 241.3 32 256 32C270.7 32 283.5 41.99 287 56.24L328.1 224H392.9L449.6 53.88C455.2 37.12 473.4 28.05 490.1 33.64C506.9 39.23 515.9 57.35 510.4 74.12L460.4 224H480C497.7 224 512 238.3 512 256C512 273.7 497.7 288 480 288H439.1L382.4 458.1C377.9 471.6 364.1 480.5 350.8 479.1C336.6 479.4 324.4 469.6 320.1 455.8L279 288H232.1L191 455.8C187.6 469.6 175.4 479.4 161.2 479.1C147 480.5 134.1 471.6 129.6 458.1L72.94 288H32C14.33 288 .001 273.7 .001 256C.001 238.3 14.33 224 32 224H51.6L1.643 74.12C-3.946 57.35 5.115 39.23 21.88 33.64C38.65 28.05 56.77 37.12 62.36 53.88L119.1 224zM140.4 288L155.6 333.6L167 288H140.4zM248.1 224H263L256 195.9L248.1 224zM344.1 288L356.4 333.6L371.6 288H344.1z"],worm:[512,512,[],"e599","M256 96C256 42.98 298.1 0 352 0H390.4C439.9 0 480 40.12 480 89.6V376C480 451.1 419.1 512 344 512C268.9 512 208 451.1 208 376V296C208 273.9 190.1 256 168 256C145.9 256 128 273.9 128 296V464C128 490.5 106.5 512 80 512C53.49 512 32 490.5 32 464V296C32 220.9 92.89 160 168 160C243.1 160 304 220.9 304 296V376C304 398.1 321.9 416 344 416C366.1 416 384 398.1 384 376V192H352C298.1 192 256 149 256 96zM376 64C362.7 64 352 74.75 352 88C352 101.3 362.7 112 376 112C389.3 112 400 101.3 400 88C400 74.75 389.3 64 376 64z"],wrench:[512,512,[128295],"f0ad","M507.6 122.8c-2.904-12.09-18.25-16.13-27.04-7.338l-76.55 76.56l-83.1-.0002l0-83.1l76.55-76.56c8.791-8.789 4.75-24.14-7.336-27.04c-23.69-5.693-49.34-6.111-75.92 .2484c-61.45 14.7-109.4 66.9-119.2 129.3C189.8 160.8 192.3 186.7 200.1 210.1l-178.1 178.1c-28.12 28.12-28.12 73.69 0 101.8C35.16 504.1 53.56 512 71.1 512s36.84-7.031 50.91-21.09l178.1-178.1c23.46 7.736 49.31 10.24 76.17 6.004c62.41-9.84 114.6-57.8 129.3-119.2C513.7 172.1 513.3 146.5 507.6 122.8zM80 456c-13.25 0-24-10.75-24-24c0-13.26 10.75-24 24-24s24 10.74 24 24C104 445.3 93.25 456 80 456z"],x:[384,512,[120],"58","M376.6 427.5c11.31 13.58 9.484 33.75-4.094 45.06c-5.984 4.984-13.25 7.422-20.47 7.422c-9.172 0-18.27-3.922-24.59-11.52L192 305.1l-135.4 162.5c-6.328 7.594-15.42 11.52-24.59 11.52c-7.219 0-14.48-2.438-20.47-7.422c-13.58-11.31-15.41-31.48-4.094-45.06l142.9-171.5L7.422 84.5C-3.891 70.92-2.063 50.75 11.52 39.44c13.56-11.34 33.73-9.516 45.06 4.094L192 206l135.4-162.5c11.3-13.58 31.48-15.42 45.06-4.094c13.58 11.31 15.41 31.48 4.094 45.06l-142.9 171.5L376.6 427.5z"],"x-ray":[512,512,[],"f497","M208 352C199.2 352 192 359.2 192 368C192 376.8 199.2 384 208 384S224 376.8 224 368C224 359.2 216.8 352 208 352zM304 384c8.836 0 16-7.164 16-16c0-8.838-7.164-16-16-16S288 359.2 288 368C288 376.8 295.2 384 304 384zM496 96C504.8 96 512 88.84 512 80v-32C512 39.16 504.8 32 496 32h-480C7.164 32 0 39.16 0 48v32C0 88.84 7.164 96 16 96H32v320H16C7.164 416 0 423.2 0 432v32C0 472.8 7.164 480 16 480h480c8.836 0 16-7.164 16-16v-32c0-8.836-7.164-16-16-16H480V96H496zM416 216C416 220.4 412.4 224 408 224H272v32h104C380.4 256 384 259.6 384 264v16C384 284.4 380.4 288 376 288H272v32h69.33c25.56 0 40.8 28.48 26.62 49.75l-21.33 32C340.7 410.7 330.7 416 319.1 416H192c-10.7 0-20.69-5.347-26.62-14.25l-21.33-32C129.9 348.5 145.1 320 170.7 320H240V288H136C131.6 288 128 284.4 128 280v-16C128 259.6 131.6 256 136 256H240V224H104C99.6 224 96 220.4 96 216v-16C96 195.6 99.6 192 104 192H240V160H136C131.6 160 128 156.4 128 152v-16C128 131.6 131.6 128 136 128H240V104C240 99.6 243.6 96 248 96h16c4.4 0 8 3.6 8 8V128h104C380.4 128 384 131.6 384 136v16C384 156.4 380.4 160 376 160H272v32h136C412.4 192 416 195.6 416 200V216z"],xmark:[320,512,[128473,10005,10006,10060,215,"close","multiply","remove","times"],"f00d","M310.6 361.4c12.5 12.5 12.5 32.75 0 45.25C304.4 412.9 296.2 416 288 416s-16.38-3.125-22.62-9.375L160 301.3L54.63 406.6C48.38 412.9 40.19 416 32 416S15.63 412.9 9.375 406.6c-12.5-12.5-12.5-32.75 0-45.25l105.4-105.4L9.375 150.6c-12.5-12.5-12.5-32.75 0-45.25s32.75-12.5 45.25 0L160 210.8l105.4-105.4c12.5-12.5 32.75-12.5 45.25 0s12.5 32.75 0 45.25l-105.4 105.4L310.6 361.4z"],"xmarks-lines":[640,512,[],"e59a","M608 32C625.7 32 640 46.33 640 64C640 81.67 625.7 96 608 96H32C14.33 96 0 81.67 0 64C0 46.33 14.33 32 32 32H608zM608 416C625.7 416 640 430.3 640 448C640 465.7 625.7 480 608 480H32C14.33 480 0 465.7 0 448C0 430.3 14.33 416 32 416H608zM7.029 167C16.4 157.7 31.6 157.7 40.97 167L96 222.1L151 167C160.4 157.7 175.6 157.7 184.1 167C194.3 176.4 194.3 191.6 184.1 200.1L129.9 256L184.1 311C194.3 320.4 194.3 335.6 184.1 344.1C175.6 354.3 160.4 354.3 151 344.1L96 289.9L40.97 344.1C31.6 354.3 16.4 354.3 7.029 344.1C-2.343 335.6-2.343 320.4 7.029 311L62.06 256L7.029 200.1C-2.343 191.6-2.343 176.4 7.029 167V167zM320 222.1L375 167C384.4 157.7 399.6 157.7 408.1 167C418.3 176.4 418.3 191.6 408.1 200.1L353.9 256L408.1 311C418.3 320.4 418.3 335.6 408.1 344.1C399.6 354.3 384.4 354.3 375 344.1L320 289.9L264.1 344.1C255.6 354.3 240.4 354.3 231 344.1C221.7 335.6 221.7 320.4 231 311L286.1 256L231 200.1C221.7 191.6 221.7 176.4 231 167C240.4 157.7 255.6 157.7 264.1 167L320 222.1zM455 167C464.4 157.7 479.6 157.7 488.1 167L544 222.1L599 167C608.4 157.7 623.6 157.7 632.1 167C642.3 176.4 642.3 191.6 632.1 200.1L577.9 256L632.1 311C642.3 320.4 642.3 335.6 632.1 344.1C623.6 354.3 608.4 354.3 599 344.1L544 289.9L488.1 344.1C479.6 354.3 464.4 354.3 455 344.1C445.7 335.6 445.7 320.4 455 311L510.1 256L455 200.1C445.7 191.6 445.7 176.4 455 167V167z"],y:[384,512,[121],"59","M378 82.61L224 298.3v149.8c0 17.67-14.31 31.1-32 31.1S160 465.7 160 448V298.3L5.969 82.61C-4.313 68.23-.9688 48.25 13.41 37.97c14.34-10.27 34.38-6.922 44.63 7.453L192 232.1l133.1-187.5c10.28-14.37 30.28-17.7 44.63-7.453C384.1 48.25 388.3 68.23 378 82.61z"],"yen-sign":[320,512,[165,"cny","jpy","rmb","yen"],"f157","M159.1 198.3L261.4 46.25C271.2 31.54 291 27.57 305.8 37.37C320.5 47.18 324.4 67.04 314.6 81.75L219.8 223.1H272C289.7 223.1 304 238.3 304 255.1C304 273.7 289.7 287.1 272 287.1H192V319.1H272C289.7 319.1 304 334.3 304 352C304 369.7 289.7 384 272 384H192V448C192 465.7 177.7 480 159.1 480C142.3 480 127.1 465.7 127.1 448V384H47.1C30.33 384 15.1 369.7 15.1 352C15.1 334.3 30.33 319.1 47.1 319.1H127.1V287.1H47.1C30.33 287.1 15.1 273.7 15.1 255.1C15.1 238.3 30.33 223.1 47.1 223.1H100.2L5.374 81.75C-4.429 67.04-.456 47.18 14.25 37.37C28.95 27.57 48.82 31.54 58.62 46.25L159.1 198.3z"],"yin-yang":[512,512,[9775],"f6ad","M256 128C238.3 128 224 142.4 224 160S238.3 192 256 192s31.97-14.38 31.97-32S273.7 128 256 128zM256 0C114.6 0 0 114.6 0 256s114.6 256 256 256s256-114.6 256-256S397.4 0 256 0zM256 384c-17.68 0-31.97-14.38-31.97-32S238.3 320 256 320s31.97 14.38 31.97 32S273.7 384 256 384zM256 256c-53.04 0-96.03 43-96.03 96S202.1 448 256 448c-106.1 0-192.1-86-192.1-192S149.9 64 256 64c53.04 0 96.03 43 96.03 96S309 256 256 256z"],z:[384,512,[122],"5a","M384 448c0 17.67-14.31 32-32 32H32c-12.41 0-23.72-7.188-28.97-18.42c-5.281-11.25-3.562-24.53 4.375-34.06l276.3-331.5H32c-17.69 0-32-14.33-32-32s14.31-32 32-32h320c12.41 0 23.72 7.188 28.97 18.42c5.281 11.25 3.562 24.53-4.375 34.06L100.3 416H352C369.7 416 384 430.3 384 448z"]};!function(C){try{for(var c=arguments.length,z=new Array(1<c?c-1:0),l=1;l<c;l++)z[l-1]=arguments[l];C.apply(void 0,z)}catch(C){if(!H)throw C}}((function(){i("fas",o),i("fa-solid",o)}))}(),function(){"use strict";function C(C,c){var z,l=Object.keys(C);return Object.getOwnPropertySymbols&&(z=Object.getOwnPropertySymbols(C),c&&(z=z.filter((function(c){return Object.getOwnPropertyDescriptor(C,c).enumerable}))),l.push.apply(l,z)),l}function c(c){for(var z=1;z<arguments.length;z++){var l=null!=arguments[z]?arguments[z]:{};z%2?C(Object(l),!0).forEach((function(C){var z,e;z=c,C=l[e=C],e in z?Object.defineProperty(z,e,{value:C,enumerable:!0,configurable:!0,writable:!0}):z[e]=C})):Object.getOwnPropertyDescriptors?Object.defineProperties(c,Object.getOwnPropertyDescriptors(l)):C(Object(l)).forEach((function(C){Object.defineProperty(c,C,Object.getOwnPropertyDescriptor(l,C))}))}return c}function z(C){return(z="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(C){return typeof C}:function(C){return C&&"function"==typeof Symbol&&C.constructor===Symbol&&C!==Symbol.prototype?"symbol":typeof C})(C)}function l(C,c){return function(C){if(Array.isArray(C))return C}(C)||function(C,c){var z=null==C?null:"undefined"!=typeof Symbol&&C[Symbol.iterator]||C["@@iterator"];if(null!=z){var l,e,a=[],M=!0,L=!1;try{for(z=z.call(C);!(M=(l=z.next()).done)&&(a.push(l.value),!c||a.length!==c);M=!0);}catch(C){L=!0,e=C}finally{try{M||null==z.return||z.return()}finally{if(L)throw e}}return a}}(C,c)||a(C,c)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function e(C){return function(C){if(Array.isArray(C))return M(C)}(C)||function(C){if("undefined"!=typeof Symbol&&null!=C[Symbol.iterator]||null!=C["@@iterator"])return Array.from(C)}(C)||a(C)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function a(C,c){if(C){if("string"==typeof C)return M(C,c);var z=Object.prototype.toString.call(C).slice(8,-1);return"Map"===(z="Object"===z&&C.constructor?C.constructor.name:z)||"Set"===z?Array.from(C):"Arguments"===z||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(z)?M(C,c):void 0}}function M(C,c){(null==c||c>C.length)&&(c=C.length);for(var z=0,l=new Array(c);z<c;z++)l[z]=C[z];return l}function L(){}var V={},H={},t=null,r={mark:L,measure:L};try{"undefined"!=typeof window&&(V=window),"undefined"!=typeof document&&(H=document),"undefined"!=typeof MutationObserver&&(t=MutationObserver),"undefined"!=typeof performance&&(r=performance)}catch(L){}var s=void 0===(o=(V.navigator||{}).userAgent)?"":o,h=V,n=H,i=t,o=r,f=!!h.document,v=!!n.documentElement&&!!n.head&&"function"==typeof n.addEventListener&&"function"==typeof n.createElement,m=~s.indexOf("MSIE")||~s.indexOf("Trident/"),u=(V="___FONT_AWESOME___","svg-inline--fa"),d="data-fa-i2svg",p="data-fa-pseudo-element",b="data-fa-pseudo-element-pending",g="data-prefix",S="data-icon",y="fontawesome-i2svg",w="async",k=["HTML","HEAD","STYLE","SCRIPT"],x=function(){try{return!0}catch(C){return!1}}(),A={fas:"solid","fa-solid":"solid",far:"regular","fa-regular":"regular",fal:"light","fa-light":"light",fat:"thin","fa-thin":"thin",fad:"duotone","fa-duotone":"duotone",fab:"brands","fa-brands":"brands",fak:"kit","fa-kit":"kit",fa:"solid"},q={solid:"fas",regular:"far",light:"fal",thin:"fat",duotone:"fad",brands:"fab",kit:"fak"},O={fab:"fa-brands",fad:"fa-duotone",fak:"fa-kit",fal:"fa-light",far:"fa-regular",fas:"fa-solid",fat:"fa-thin"},j={"fa-brands":"fab","fa-duotone":"fad","fa-kit":"fak","fa-light":"fal","fa-regular":"far","fa-solid":"fas","fa-thin":"fat"},P=/fa[srltdbk]?[\-\ ]/,N="fa-layers-text",E=/Font ?Awesome ?([56 ]*)(Solid|Regular|Light|Thin|Duotone|Brands|Free|Pro|Kit)?.*/i,I={900:"fas",400:"far",normal:"far",300:"fal",100:"fat"},T=(t=(H=[1,2,3,4,5,6,7,8,9,10]).concat([11,12,13,14,15,16,17,18,19,20]),["class","data-prefix","data-icon","data-fa-transform","data-fa-mask"]),Y={GROUP:"duotone-group",SWAP_OPACITY:"swap-opacity",PRIMARY:"primary",SECONDARY:"secondary"},R=[].concat(e(Object.keys(q)),["2xs","xs","sm","lg","xl","2xl","beat","border","fade","beat-fade","bounce","flip-both","flip-horizontal","flip-vertical","flip","fw","inverse","layers-counter","layers-text","layers","li","pull-left","pull-right","pulse","rotate-180","rotate-270","rotate-90","rotate-by","shake","spin-pulse","spin-reverse","spin","stack-1x","stack-2x","stack","ul",Y.GROUP,Y.SWAP_OPACITY,Y.PRIMARY,Y.SECONDARY]).concat(H.map((function(C){return"".concat(C,"x")}))).concat(t.map((function(C){return"w-".concat(C)}))),D=h.FontAwesomeConfig||{};n&&"function"==typeof n.querySelector&&[["data-family-prefix","familyPrefix"],["data-style-default","styleDefault"],["data-replacement-class","replacementClass"],["data-auto-replace-svg","autoReplaceSvg"],["data-auto-add-css","autoAddCss"],["data-auto-a11y","autoA11y"],["data-search-pseudo-elements","searchPseudoElements"],["data-observe-mutations","observeMutations"],["data-mutate-approach","mutateApproach"],["data-keep-original-source","keepOriginalSource"],["data-measure-performance","measurePerformance"],["data-show-missing-icons","showMissingIcons"]].forEach((function(C){C=(c=l(C,2))[0];var c=c[1];C=""===(C=function(C){var c=n.querySelector("script["+C+"]");if(c)return c.getAttribute(C)}(C))||"false"!==C&&("true"===C||C),null!=C&&(D[c]=C)}));var _=c(c({},{familyPrefix:"fa",styleDefault:"solid",replacementClass:u,autoReplaceSvg:!0,autoAddCss:!0,autoA11y:!0,searchPseudoElements:!1,observeMutations:!0,mutateApproach:"async",keepOriginalSource:!0,measurePerformance:!1,showMissingIcons:!0}),D);_.autoReplaceSvg||(_.observeMutations=!1);var F={};Object.keys(_).forEach((function(C){Object.defineProperty(F,C,{enumerable:!0,set:function(c){_[C]=c,W.forEach((function(C){return C(F)}))},get:function(){return _[C]}})})),h.FontAwesomeConfig=F;var W=[],U=16,X={size:16,x:0,y:0,rotate:0,flipX:!1,flipY:!1},B="0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";function Q(){for(var C=12,c="";0<C--;)c+=B[62*Math.random()|0];return c}function G(C){for(var c=[],z=(C||[]).length>>>0;z--;)c[z]=C[z];return c}function K(C){return C.classList?G(C.classList):(C.getAttribute("class")||"").split(" ").filter((function(C){return C}))}function $(C){return"".concat(C).replace(/&/g,"&amp;").replace(/"/g,"&quot;").replace(/'/g,"&#39;").replace(/</g,"&lt;").replace(/>/g,"&gt;")}function J(C){return Object.keys(C||{}).reduce((function(c,z){return c+"".concat(z,": ").concat(C[z].trim(),";")}),"")}function Z(C){return C.size!==X.size||C.x!==X.x||C.y!==X.y||C.rotate!==X.rotate||C.flipX||C.flipY}function CC(){var C,c,z=u,l=F.familyPrefix,e=F.replacementClass,a=':host,:root{--fa-font-solid:normal 900 1em/1 "Font Awesome 6 Solid";--fa-font-regular:normal 400 1em/1 "Font Awesome 6 Regular";--fa-font-light:normal 300 1em/1 "Font Awesome 6 Light";--fa-font-thin:normal 100 1em/1 "Font Awesome 6 Thin";--fa-font-duotone:normal 900 1em/1 "Font Awesome 6 Duotone";--fa-font-brands:normal 400 1em/1 "Font Awesome 6 Brands"}svg:not(:host).svg-inline--fa,svg:not(:root).svg-inline--fa{overflow:visible;box-sizing:content-box}.svg-inline--fa{display:var(--fa-display,inline-block);height:1em;overflow:visible;vertical-align:-.125em}.svg-inline--fa.fa-2xs{vertical-align:.1em}.svg-inline--fa.fa-xs{vertical-align:0}.svg-inline--fa.fa-sm{vertical-align:-.0714285705em}.svg-inline--fa.fa-lg{vertical-align:-.2em}.svg-inline--fa.fa-xl{vertical-align:-.25em}.svg-inline--fa.fa-2xl{vertical-align:-.3125em}.svg-inline--fa.fa-pull-left{margin-right:var(--fa-pull-margin,.3em);width:auto}.svg-inline--fa.fa-pull-right{margin-left:var(--fa-pull-margin,.3em);width:auto}.svg-inline--fa.fa-li{width:var(--fa-li-width,2em);top:.25em}.svg-inline--fa.fa-fw{width:var(--fa-fw-width,1.25em)}.fa-layers svg.svg-inline--fa{bottom:0;left:0;margin:auto;position:absolute;right:0;top:0}.fa-layers-counter,.fa-layers-text{display:inline-block;position:absolute;text-align:center}.fa-layers{display:inline-block;height:1em;position:relative;text-align:center;vertical-align:-.125em;width:1em}.fa-layers svg.svg-inline--fa{-webkit-transform-origin:center center;transform-origin:center center}.fa-layers-text{left:50%;top:50%;-webkit-transform:translate(-50%,-50%);transform:translate(-50%,-50%);-webkit-transform-origin:center center;transform-origin:center center}.fa-layers-counter{background-color:var(--fa-counter-background-color,#ff253a);border-radius:var(--fa-counter-border-radius,1em);box-sizing:border-box;color:var(--fa-inverse,#fff);line-height:var(--fa-counter-line-height,1);max-width:var(--fa-counter-max-width,5em);min-width:var(--fa-counter-min-width,1.5em);overflow:hidden;padding:var(--fa-counter-padding,.25em .5em);right:var(--fa-right,0);text-overflow:ellipsis;top:var(--fa-top,0);-webkit-transform:scale(var(--fa-counter-scale,.25));transform:scale(var(--fa-counter-scale,.25));-webkit-transform-origin:top right;transform-origin:top right}.fa-layers-bottom-right{bottom:var(--fa-bottom,0);right:var(--fa-right,0);top:auto;-webkit-transform:scale(var(--fa-layers-scale,.25));transform:scale(var(--fa-layers-scale,.25));-webkit-transform-origin:bottom right;transform-origin:bottom right}.fa-layers-bottom-left{bottom:var(--fa-bottom,0);left:var(--fa-left,0);right:auto;top:auto;-webkit-transform:scale(var(--fa-layers-scale,.25));transform:scale(var(--fa-layers-scale,.25));-webkit-transform-origin:bottom left;transform-origin:bottom left}.fa-layers-top-right{top:var(--fa-top,0);right:var(--fa-right,0);-webkit-transform:scale(var(--fa-layers-scale,.25));transform:scale(var(--fa-layers-scale,.25));-webkit-transform-origin:top right;transform-origin:top right}.fa-layers-top-left{left:var(--fa-left,0);right:auto;top:var(--fa-top,0);-webkit-transform:scale(var(--fa-layers-scale,.25));transform:scale(var(--fa-layers-scale,.25));-webkit-transform-origin:top left;transform-origin:top left}.fa-1x{font-size:1em}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-6x{font-size:6em}.fa-7x{font-size:7em}.fa-8x{font-size:8em}.fa-9x{font-size:9em}.fa-10x{font-size:10em}.fa-2xs{font-size:.625em;line-height:.1em;vertical-align:.225em}.fa-xs{font-size:.75em;line-height:.0833333337em;vertical-align:.125em}.fa-sm{font-size:.875em;line-height:.0714285718em;vertical-align:.0535714295em}.fa-lg{font-size:1.25em;line-height:.05em;vertical-align:-.075em}.fa-xl{font-size:1.5em;line-height:.0416666682em;vertical-align:-.125em}.fa-2xl{font-size:2em;line-height:.03125em;vertical-align:-.1875em}.fa-fw{text-align:center;width:1.25em}.fa-ul{list-style-type:none;margin-left:var(--fa-li-margin,2.5em);padding-left:0}.fa-ul>li{position:relative}.fa-li{left:calc(var(--fa-li-width,2em) * -1);position:absolute;text-align:center;width:var(--fa-li-width,2em);line-height:inherit}.fa-border{border-color:var(--fa-border-color,#eee);border-radius:var(--fa-border-radius,.1em);border-style:var(--fa-border-style,solid);border-width:var(--fa-border-width,.08em);padding:var(--fa-border-padding,.2em .25em .15em)}.fa-pull-left{float:left;margin-right:var(--fa-pull-margin,.3em)}.fa-pull-right{float:right;margin-left:var(--fa-pull-margin,.3em)}.fa-beat{-webkit-animation-name:fa-beat;animation-name:fa-beat;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-bounce{-webkit-animation-name:fa-bounce;animation-name:fa-bounce;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.28,.84,.42,1))}.fa-fade{-webkit-animation-name:fa-fade;animation-name:fa-fade;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-beat-fade{-webkit-animation-name:fa-beat-fade;animation-name:fa-beat-fade;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1));animation-timing-function:var(--fa-animation-timing,cubic-bezier(.4,0,.6,1))}.fa-flip{-webkit-animation-name:fa-flip;animation-name:fa-flip;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,ease-in-out);animation-timing-function:var(--fa-animation-timing,ease-in-out)}.fa-shake{-webkit-animation-name:fa-shake;animation-name:fa-shake;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-spin{-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-delay:var(--fa-animation-delay,0);animation-delay:var(--fa-animation-delay,0);-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,2s);animation-duration:var(--fa-animation-duration,2s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,linear);animation-timing-function:var(--fa-animation-timing,linear)}.fa-spin-reverse{--fa-animation-direction:reverse}.fa-pulse,.fa-spin-pulse{-webkit-animation-name:fa-spin;animation-name:fa-spin;-webkit-animation-direction:var(--fa-animation-direction,normal);animation-direction:var(--fa-animation-direction,normal);-webkit-animation-duration:var(--fa-animation-duration,1s);animation-duration:var(--fa-animation-duration,1s);-webkit-animation-iteration-count:var(--fa-animation-iteration-count,infinite);animation-iteration-count:var(--fa-animation-iteration-count,infinite);-webkit-animation-timing-function:var(--fa-animation-timing,steps(8));animation-timing-function:var(--fa-animation-timing,steps(8))}@media (prefers-reduced-motion:reduce){.fa-beat,.fa-beat-fade,.fa-bounce,.fa-fade,.fa-flip,.fa-pulse,.fa-shake,.fa-spin,.fa-spin-pulse{-webkit-animation-delay:-1ms;animation-delay:-1ms;-webkit-animation-duration:1ms;animation-duration:1ms;-webkit-animation-iteration-count:1;animation-iteration-count:1;transition-delay:0s;transition-duration:0s}}@-webkit-keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@keyframes fa-beat{0%,90%{-webkit-transform:scale(1);transform:scale(1)}45%{-webkit-transform:scale(var(--fa-beat-scale,1.25));transform:scale(var(--fa-beat-scale,1.25))}}@-webkit-keyframes fa-bounce{0%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1,1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1,1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}100%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}}@keyframes fa-bounce{0%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}10%{-webkit-transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0);transform:scale(var(--fa-bounce-start-scale-x,1.1),var(--fa-bounce-start-scale-y,.9)) translateY(0)}30%{-webkit-transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em));transform:scale(var(--fa-bounce-jump-scale-x,.9),var(--fa-bounce-jump-scale-y,1.1)) translateY(var(--fa-bounce-height,-.5em))}50%{-webkit-transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0);transform:scale(var(--fa-bounce-land-scale-x,1.05),var(--fa-bounce-land-scale-y,.95)) translateY(0)}57%{-webkit-transform:scale(1,1) translateY(var(--fa-bounce-rebound,-.125em));transform:scale(1,1) translateY(var(--fa-bounce-rebound,-.125em))}64%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}100%{-webkit-transform:scale(1,1) translateY(0);transform:scale(1,1) translateY(0)}}@-webkit-keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@keyframes fa-fade{50%{opacity:var(--fa-fade-opacity,.4)}}@-webkit-keyframes fa-beat-fade{0%,100%{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@keyframes fa-beat-fade{0%,100%{opacity:var(--fa-beat-fade-opacity,.4);-webkit-transform:scale(1);transform:scale(1)}50%{opacity:1;-webkit-transform:scale(var(--fa-beat-fade-scale,1.125));transform:scale(var(--fa-beat-fade-scale,1.125))}}@-webkit-keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@keyframes fa-flip{50%{-webkit-transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg));transform:rotate3d(var(--fa-flip-x,0),var(--fa-flip-y,1),var(--fa-flip-z,0),var(--fa-flip-angle,-180deg))}}@-webkit-keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}24%,8%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}100%,40%{-webkit-transform:rotate(0);transform:rotate(0)}}@keyframes fa-shake{0%{-webkit-transform:rotate(-15deg);transform:rotate(-15deg)}4%{-webkit-transform:rotate(15deg);transform:rotate(15deg)}24%,8%{-webkit-transform:rotate(-18deg);transform:rotate(-18deg)}12%,28%{-webkit-transform:rotate(18deg);transform:rotate(18deg)}16%{-webkit-transform:rotate(-22deg);transform:rotate(-22deg)}20%{-webkit-transform:rotate(22deg);transform:rotate(22deg)}32%{-webkit-transform:rotate(-12deg);transform:rotate(-12deg)}36%{-webkit-transform:rotate(12deg);transform:rotate(12deg)}100%,40%{-webkit-transform:rotate(0);transform:rotate(0)}}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0);transform:rotate(0)}100%{-webkit-transform:rotate(360deg);transform:rotate(360deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0);transform:rotate(0)}100%{-webkit-transform:rotate(360deg);transform:rotate(360deg)}}.fa-rotate-90{-webkit-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-webkit-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-webkit-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-webkit-transform:scale(-1,1);transform:scale(-1,1)}.fa-flip-vertical{-webkit-transform:scale(1,-1);transform:scale(1,-1)}.fa-flip-both,.fa-flip-horizontal.fa-flip-vertical{-webkit-transform:scale(-1,-1);transform:scale(-1,-1)}.fa-rotate-by{-webkit-transform:rotate(var(--fa-rotate-angle,none));transform:rotate(var(--fa-rotate-angle,none))}.fa-stack{display:inline-block;vertical-align:middle;height:2em;position:relative;width:2.5em}.fa-stack-1x,.fa-stack-2x{bottom:0;left:0;margin:auto;position:absolute;right:0;top:0;z-index:var(--fa-stack-z-index,auto)}.svg-inline--fa.fa-stack-1x{height:1em;width:1.25em}.svg-inline--fa.fa-stack-2x{height:2em;width:2.5em}.fa-inverse{color:var(--fa-inverse,#fff)}.fa-sr-only,.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);white-space:nowrap;border-width:0}.fa-sr-only-focusable:not(:focus),.sr-only-focusable:not(:focus){position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);white-space:nowrap;border-width:0}.svg-inline--fa .fa-primary{fill:var(--fa-primary-color,currentColor);opacity:var(--fa-primary-opacity,1)}.svg-inline--fa .fa-secondary{fill:var(--fa-secondary-color,currentColor);opacity:var(--fa-secondary-opacity,.4)}.svg-inline--fa.fa-swap-opacity .fa-primary{opacity:var(--fa-secondary-opacity,.4)}.svg-inline--fa.fa-swap-opacity .fa-secondary{opacity:var(--fa-primary-opacity,1)}.svg-inline--fa mask .fa-primary,.svg-inline--fa mask .fa-secondary{fill:#000}.fa-duotone.fa-inverse,.fad.fa-inverse{color:var(--fa-inverse,#fff)}';return"fa"===l&&e===z||(C=new RegExp("\\.".concat("fa","\\-"),"g"),c=new RegExp("\\--".concat("fa","\\-"),"g"),z=new RegExp("\\.".concat(z),"g"),a=a.replace(C,".".concat(l,"-")).replace(c,"--".concat(l,"-")).replace(z,".".concat(e))),a}var cC=!1;function zC(){F.autoAddCss&&!cC&&(function(C){if(C&&v){var c=n.createElement("style");c.setAttribute("type","text/css"),c.innerHTML=C;for(var z=n.head.childNodes,l=null,e=z.length-1;-1<e;e--){var a=z[e],M=(a.tagName||"").toUpperCase();-1<["STYLE","LINK"].indexOf(M)&&(l=a)}n.head.insertBefore(c,l)}}(CC()),cC=!0)}r={mixout:function(){return{dom:{css:CC,insertCss:zC}}},hooks:function(){return{beforeDOMElementCreation:function(){zC()},beforeI2svg:function(){zC()}}}},(s=h||{})[V]||(s[V]={}),s[V].styles||(s[V].styles={}),s[V].hooks||(s[V].hooks={}),s[V].shims||(s[V].shims=[]);var lC=s[V],eC=[],aC=!1;function MC(C){v&&(aC?setTimeout(C,0):eC.push(C))}function LC(C){var c,z=C.tag,l=void 0===(e=C.attributes)?{}:e,e=void 0===(e=C.children)?[]:e;return"string"==typeof C?$(C):"<".concat(z," ").concat((c=l,Object.keys(c||{}).reduce((function(C,z){return C+"".concat(z,'="').concat($(c[z]),'" ')}),"").trim()),">").concat(e.map(LC).join(""),"</").concat(z,">")}function VC(C,c,z){if(C&&C[c]&&C[c][z])return{prefix:c,iconName:z,icon:C[c][z]}}function HC(C,c,z,l){for(var e,a,M=Object.keys(C),L=M.length,V=void 0!==l?tC(c,l):c,H=void 0===z?(e=1,C[M[0]]):(e=0,z);e<L;e++)H=V(H,C[a=M[e]],a,C);return H}v&&((aC=(n.documentElement.doScroll?/^loaded|^c/:/^loaded|^i|^c/).test(n.readyState))||n.addEventListener("DOMContentLoaded",(function C(){n.removeEventListener("DOMContentLoaded",C),aC=1,eC.map((function(C){return C()}))})));var tC=function(C,c){return function(z,l,e,a){return C.call(c,z,l,e,a)}};function rC(C){return C=function(C){for(var c=[],z=0,l=C.length;z<l;){var e,a=C.charCodeAt(z++);55296<=a&&a<=56319&&z<l?56320==(64512&(e=C.charCodeAt(z++)))?c.push(((1023&a)<<10)+(1023&e)+65536):(c.push(a),z--):c.push(a)}return c}(C),1===C.length?C[0].toString(16):null}function sC(C){return Object.keys(C).reduce((function(c,z){var l=C[z];return l.icon?c[l.iconName]=l.icon:c[z]=l,c}),{})}function hC(C,z,l){l=void 0!==(e=(2<arguments.length&&void 0!==l?l:{}).skipHooks)&&e;var e=sC(z);"function"!=typeof lC.hooks.addPack||l?lC.styles[C]=c(c({},lC.styles[C]||{}),e):lC.hooks.addPack(C,sC(z)),"fas"===C&&hC("fa",z)}var nC=lC.styles,iC=lC.shims,oC=Object.values(O),fC=null,vC={},mC={},uC={},dC={},pC={},bC=Object.keys(A);function gC(){function C(C){return HC(nC,(function(c,z,l){return c[l]=HC(z,C,{}),c}),{})}vC=C((function(C,c,z){return c[3]&&(C[c[3]]=z),c[2]&&c[2].filter((function(C){return"number"==typeof C})).forEach((function(c){C[c.toString(16)]=z})),C})),mC=C((function(C,c,z){return C[z]=z,c[2]&&c[2].filter((function(C){return"string"==typeof C})).forEach((function(c){C[c]=z})),C})),pC=C((function(C,c,z){return c=c[2],C[z]=z,c.forEach((function(c){C[c]=z})),C}));var c="far"in nC||F.autoFetchSvg,z=HC(iC,(function(C,z){var l=z[0],e=z[1];return z=z[2],"far"!==e||c||(e="fas"),"string"==typeof l&&(C.names[l]={prefix:e,iconName:z}),"number"==typeof l&&(C.unicodes[l.toString(16)]={prefix:e,iconName:z}),C}),{names:{},unicodes:{}});uC=z.names,dC=z.unicodes,fC=kC(F.styleDefault)}function SC(C,c){return(vC[C]||{})[c]}function yC(C,c){return(pC[C]||{})[c]}function wC(C){return uC[C]||{prefix:null,iconName:null}}function kC(C){var c=q[C]||q[A[C]];return C=C in lC.styles?C:null,c||C||null}function xC(C,c){var z=void 0!==(c=(1<arguments.length&&void 0!==c?c:{}).skipLookups)&&c,l=null;return C=C.reduce((function(C,c){var e=function(C,c){c=(z=c.split("-"))[0];var z=z.slice(1).join("-");return c!==C||""===z||~R.indexOf(z)?null:z}(F.familyPrefix,c);return nC[c]?(c=oC.includes(c)?j[c]:c,l=c,C.prefix=c):-1<bC.indexOf(c)?(l=c,C.prefix=kC(c)):e?C.iconName=e:c!==F.replacementClass&&C.rest.push(c),!z&&C.prefix&&C.iconName&&(e="fa"===l?wC(C.iconName):{},c=yC(C.prefix,C.iconName),e.prefix&&(l=null),C.iconName=e.iconName||c||C.iconName,C.prefix=e.prefix||C.prefix,"far"!==C.prefix||nC.far||!nC.fas||F.autoFetchSvg||(C.prefix="fas")),C}),{prefix:null,iconName:null,rest:[]}),"fa"!==C.prefix&&"fa"!==l||(C.prefix=fC||"fas"),C}H=function(C){fC=kC(C.styleDefault)},W.push(H),gC(),t=function(){function C(){!function(C,c){if(!(C instanceof c))throw new TypeError("Cannot call a class as a function")}(this,C),this.definitions={}}var z,l;return z=C,(l=[{key:"add",value:function(){for(var C=this,z=arguments.length,l=new Array(z),e=0;e<z;e++)l[e]=arguments[e];var a=l.reduce(this._pullDefinitions,{});Object.keys(a).forEach((function(z){C.definitions[z]=c(c({},C.definitions[z]||{}),a[z]),hC(z,a[z]);var l=O[z];l&&hC(l,a[z]),gC()}))}},{key:"reset",value:function(){this.definitions={}}},{key:"_pullDefinitions",value:function(C,c){var z=c.prefix&&c.iconName&&c.icon?{0:c}:c;return Object.keys(z).map((function(c){var l=(a=z[c]).prefix,e=(c=a.iconName,a.icon),a=e[2];C[l]||(C[l]={}),0<a.length&&a.forEach((function(c){"string"==typeof c&&(C[l][c]=e)})),C[l][c]=e})),C}}])&&function(C,c){for(var z=0;z<c.length;z++){var l=c[z];l.enumerable=l.enumerable||!1,l.configurable=!0,"value"in l&&(l.writable=!0),Object.defineProperty(C,l.key,l)}}(z.prototype,l),Object.defineProperty(z,"prototype",{writable:!1}),C}(),s=[];var AC={},qC={},OC=Object.keys(qC);function jC(C,c){for(var z=arguments.length,l=new Array(2<z?z-2:0),e=2;e<z;e++)l[e-2]=arguments[e];return(AC[C]||[]).forEach((function(C){c=C.apply(null,[c].concat(l))})),c}function PC(C){for(var c=arguments.length,z=new Array(1<c?c-1:0),l=1;l<c;l++)z[l-1]=arguments[l];(AC[C]||[]).forEach((function(C){C.apply(null,z)}))}function NC(C){var c=C;return C=Array.prototype.slice.call(arguments,1),qC[c]?qC[c].apply(null,C):void 0}function EC(C){"fa"===C.prefix&&(C.prefix="fas");var c=C.iconName;if(C=C.prefix||fC,c)return c=yC(C,c)||c,VC(IC.definitions,C,c)||VC(lC.styles,C,c)}var IC=new t,TC={noAuto:function(){F.autoReplaceSvg=!1,F.observeMutations=!1,PC("noAuto")},config:F,dom:{i2svg:function(){var C=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};return v?(PC("beforeI2svg",C),NC("pseudoElements2svg",C),NC("i2svg",C)):Promise.reject("Operation requires a DOM of some kind.")},watch:function(){var C=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},c=C.autoReplaceSvgRoot;!1===F.autoReplaceSvg&&(F.autoReplaceSvg=!0),F.observeMutations=!0,MC((function(){YC({autoReplaceSvgRoot:c}),PC("watch",C)}))}},parse:{icon:function(C){if(null===C)return null;if("object"===z(C)&&C.prefix&&C.iconName)return{prefix:C.prefix,iconName:yC(C.prefix,C.iconName)||C.iconName};if(Array.isArray(C)&&2===C.length){var c=0===C[1].indexOf("fa-")?C[1].slice(3):C[1],l=kC(C[0]);return{prefix:l,iconName:yC(l,c)||c}}return"string"==typeof C&&(-1<C.indexOf("".concat(F.familyPrefix,"-"))||C.match(P))?{prefix:(c=xC(C.split(" "),{skipLookups:!0})).prefix||fC,iconName:yC(c.prefix,c.iconName)||c.iconName}:"string"==typeof C?{prefix:fC,iconName:yC(fC,C)||C}:void 0}},library:IC,findIconDefinition:EC,toHtml:LC},YC=function(){var C=void 0===(C=(0<arguments.length&&void 0!==arguments[0]?arguments[0]:{}).autoReplaceSvgRoot)?n:C;(0<Object.keys(lC.styles).length||F.autoFetchSvg)&&v&&F.autoReplaceSvg&&TC.dom.i2svg({node:C})};function RC(C,c){return Object.defineProperty(C,"abstract",{get:c}),Object.defineProperty(C,"html",{get:function(){return C.abstract.map(LC)}}),Object.defineProperty(C,"node",{get:function(){if(v){var c=n.createElement("div");return c.innerHTML=C.html,c.children}}}),C}function DC(C){var z,l,e,a,M,L=(v=C.icons).main,V=v.mask,H=C.prefix,t=C.iconName,r=C.transform,s=C.symbol,h=C.title,n=C.maskId,i=C.titleId,o=C.extra,f=void 0!==(m=C.watchable)&&m,v=(u=V.found?V:L).width,m=(C=u.height,"fak"===H),u=[F.replacementClass,t?"".concat(F.familyPrefix,"-").concat(t):""].filter((function(C){return-1===o.classes.indexOf(C)})).filter((function(C){return""!==C||!!C})).concat(o.classes).join(" ");return u={children:[],attributes:c(c({},o.attributes),{},{"data-prefix":H,"data-icon":t,class:u,role:o.attributes.role||"img",xmlns:"http://www.w3.org/2000/svg",viewBox:"0 0 ".concat(v," ").concat(C)})},C=m&&!~o.classes.indexOf("fa-fw")?{width:"".concat(v/C*16*.0625,"em")}:{},f&&(u.attributes[d]=""),h&&(u.children.push({tag:"title",attributes:{id:u.attributes["aria-labelledby"]||"title-".concat(i||Q())},children:[h]}),delete u.attributes.title),C=c(c({},u),{},{prefix:H,iconName:t,main:L,mask:V,maskId:n,transform:r,symbol:s,styles:c(c({},C),o.styles)}),L=(V=V.found&&L.found?NC("generateAbstractMask",C)||{children:[],attributes:{}}:NC("generateAbstractIcon",C)||{children:[],attributes:{}}).children,V=V.attributes,C.children=L,C.attributes=V,s?(l=(z=C).prefix,e=z.iconName,a=z.children,M=z.attributes,z=!0===(z=z.symbol)?"".concat(l,"-").concat(F.familyPrefix,"-").concat(e):z,[{tag:"svg",attributes:{style:"display: none;"},children:[{tag:"symbol",attributes:c(c({},M),{},{id:z}),children:a}]}]):(e=(l=C).children,M=l.main,z=l.mask,a=l.attributes,C=l.styles,Z(l=l.transform)&&M.found&&!z.found&&(z=M.width/M.height/2,M=.5,a.style=J(c(c({},C),{},{"transform-origin":"".concat(z+l.x/16,"em ").concat(M+l.y/16,"em")}))),[{tag:"svg",attributes:a,children:e}])}function _C(C){var z=C.content,l=C.width,e=C.height,a=C.transform,M=C.title,L=C.extra,V=C.watchable,H=void 0!==V&&V;return C=c(c(c({},L.attributes),M?{title:M}:{}),{},{class:L.classes.join(" ")}),H&&(C[d]=""),V=c({},L.styles),Z(a)&&(V.transform=(L=(H={transform:a,startCentered:!0,width:l,height:e}).transform,a=H.width,e=void 0===(l=H.height)?16:l,H=void 0!==(l=H.startCentered)&&l,l="",l+=H&&m?"translate(".concat(L.x/U-(void 0===a?16:a)/2,"em, ").concat(L.y/U-e/2,"em) "):H?"translate(calc(-50% + ".concat(L.x/U,"em), calc(-50% + ").concat(L.y/U,"em)) "):"translate(".concat(L.x/U,"em, ").concat(L.y/U,"em) "),l+="scale(".concat(L.size/U*(L.flipX?-1:1),", ").concat(L.size/U*(L.flipY?-1:1),") "),l+="rotate(".concat(L.rotate,"deg) ")),V["-webkit-transform"]=V.transform),0<(V=J(V)).length&&(C.style=V),(V=[]).push({tag:"span",attributes:C,children:[z]}),M&&V.push({tag:"span",attributes:{class:"sr-only"},children:[M]}),V}var FC=lC.styles;function WC(C){var c=C[0],z=C[1];return C=l(C.slice(4),1)[0],{found:!0,width:c,height:z,icon:Array.isArray(C)?{tag:"g",attributes:{class:"".concat(F.familyPrefix,"-").concat(Y.GROUP)},children:[{tag:"path",attributes:{class:"".concat(F.familyPrefix,"-").concat(Y.SECONDARY),fill:"currentColor",d:C[0]}},{tag:"path",attributes:{class:"".concat(F.familyPrefix,"-").concat(Y.PRIMARY),fill:"currentColor",d:C[1]}}]}:{tag:"path",attributes:{fill:"currentColor",d:C}}}}var UC={found:!1,width:512,height:512};function XC(C,z){var l=z;return"fa"===z&&null!==F.styleDefault&&(z=fC),new Promise((function(e,a){var M,L;if(NC("missingIconAbstract"),"fa"===l&&(L=wC(C)||{},C=L.iconName||C,z=L.prefix||z),C&&z&&FC[z]&&FC[z][C])return e(WC(FC[z][C]));M=C,L=z,x||F.showMissingIcons||!M||console.error('Icon with name "'.concat(M,'" and prefix "').concat(L,'" is missing.')),e(c(c({},UC),{},{icon:F.showMissingIcons&&C&&NC("missingIconAbstract")||{}}))}))}function BC(){}function QC(C){GC.mark("".concat(KC," ").concat(C," ends")),GC.measure("".concat(KC," ").concat(C),"".concat(KC," ").concat(C," begins"),"".concat(KC," ").concat(C," ends"))}var GC=F.measurePerformance&&o&&o.mark&&o.measure?o:{mark:BC,measure:BC},KC='FA "6.1.2"',$C={begin:function(C){return GC.mark("".concat(KC," ").concat(C," begins")),function(){return QC(C)}},end:QC},JC=function(){};function ZC(C){return"string"==typeof(C.getAttribute?C.getAttribute(d):null)}function Cc(C){return n.createElementNS("http://www.w3.org/2000/svg",C)}function cc(C){return n.createElement(C)}var zc={replace:function(C){var c=C[0];c.parentNode&&(C[1].forEach((function(C){c.parentNode.insertBefore(function C(c,z){var l=void 0===(z=(1<arguments.length&&void 0!==z?z:{}).ceFn)?"svg"===c.tag?Cc:cc:z;if("string"==typeof c)return n.createTextNode(c);var e=l(c.tag);return Object.keys(c.attributes||[]).forEach((function(C){e.setAttribute(C,c.attributes[C])})),(c.children||[]).forEach((function(c){e.appendChild(C(c,{ceFn:l}))})),e}(C),c)})),null===c.getAttribute(d)&&F.keepOriginalSource?(C=n.createComment((C=" ".concat((C=c).outerHTML," "),C="".concat(C,"Font Awesome fontawesome.com "))),c.parentNode.replaceChild(C,c)):c.remove())},nest:function(C){var c=C[0],z=C[1];if(~K(c).indexOf(F.replacementClass))return zc.replace(C);var l=new RegExp("".concat(F.familyPrefix,"-.*"));delete z[0].attributes.id,z[0].attributes.class&&(C=z[0].attributes.class.split(" ").reduce((function(C,c){return(c===F.replacementClass||c.match(l)?C.toSvg:C.toNode).push(c),C}),{toNode:[],toSvg:[]}),z[0].attributes.class=C.toSvg.join(" "),0===C.toNode.length?c.removeAttribute("class"):c.setAttribute("class",C.toNode.join(" "))),z=z.map(LC).join("\n"),c.setAttribute(d,""),c.innerHTML=z}};function lc(C){C()}function ec(C,c){var z="function"==typeof c?c:JC;0===C.length?z():(F.mutateApproach===w&&h.requestAnimationFrame||lc)((function(){var c=!0!==F.autoReplaceSvg&&zc[F.autoReplaceSvg]||zc.replace,l=$C.begin("mutate");C.map(c),l(),z()}))}var ac=!1;function Mc(){ac=!0}function Lc(){ac=!1}var Vc=null;function Hc(C){var c,z,l,e;i&&F.observeMutations&&(l=C.treeCallback,c=void 0===l?JC:l,l=C.nodeCallback,z=void 0===l?JC:l,l=C.pseudoElementsCallback,e=void 0===l?JC:l,C=void 0===(C=C.observeMutationsRoot)?n:C,Vc=new i((function(C){var l;ac||(l=fC,G(C).forEach((function(C){var a,M,L;"childList"===C.type&&0<C.addedNodes.length&&!ZC(C.addedNodes[0])&&(F.searchPseudoElements&&e(C.target),c(C.target)),"attributes"===C.type&&C.target.parentNode&&F.searchPseudoElements&&e(C.target.parentNode),"attributes"===C.type&&ZC(C.target)&&~T.indexOf(C.attributeName)&&("class"===C.attributeName&&(L=(M=C.target).getAttribute?M.getAttribute(g):null,M=M.getAttribute?M.getAttribute(S):null,L&&M)?(M=(a=xC(K(C.target))).prefix,a=a.iconName,C.target.setAttribute(g,M||l),a&&C.target.setAttribute(S,a)):(a=C.target)&&a.classList&&a.classList.contains&&a.classList.contains(F.replacementClass)&&z(C.target))})))})),v&&Vc.observe(C,{childList:!0,attributes:!0,characterData:!0,subtree:!0}))}function tc(C,z){var l=1<arguments.length&&void 0!==z?z:{styleParser:!0},e=function(C){var c=C.getAttribute("data-prefix"),z=C.getAttribute("data-icon"),l=void 0!==C.innerText?C.innerText.trim():"",e=xC(K(C));return e.prefix||(e.prefix=fC),c&&z&&(e.prefix=c,e.iconName=z),e.iconName&&e.prefix||(e.prefix&&0<l.length&&(e.iconName=(z=e.prefix,l=C.innerText,(mC[z]||{})[l]||SC(e.prefix,rC(C.innerText)))),!e.iconName&&F.autoFetchSvg&&C.firstChild&&C.firstChild.nodeType===Node.TEXT_NODE&&(e.iconName=C.firstChild.data)),e}(C),a=e.iconName,M=e.prefix,L=e.rest,V=(z=G((V=C).attributes).reduce((function(C,c){return"class"!==C.name&&"style"!==C.name&&(C[c.name]=c.value),C}),{}),e=V.getAttribute("title"),V=V.getAttribute("data-fa-title-id"),F.autoA11y&&(e?z["aria-labelledby"]="".concat(F.replacementClass,"-title-").concat(V||Q()):(z["aria-hidden"]="true",z.focusable="false")),z),H=(z=jC("parseNodeAttributes",{},C),l.styleParser?(l=(H=C).getAttribute("style"),H=[],H=l?l.split(";").reduce((function(C,c){c=(z=c.split(":"))[0];var z=z.slice(1);return c&&0<z.length&&(C[c]=z.join(":").trim()),C}),{}):H):[]);return c({iconName:a,title:C.getAttribute("title"),titleId:C.getAttribute("data-fa-title-id"),prefix:M,transform:X,mask:{iconName:null,prefix:null,rest:[]},maskId:null,symbol:!1,extra:{classes:L,styles:H,attributes:V}},z)}var rc=lC.styles;function sc(C){var c="nest"===F.autoReplaceSvg?tc(C,{styleParser:!1}):tc(C);return~c.extra.classes.indexOf(N)?NC("generateLayersText",C,c):NC("generateSvgReplacementMutation",C,c)}function hc(C){var c=1<arguments.length&&void 0!==arguments[1]?arguments[1]:null;if(!v)return Promise.resolve();function z(C){return e.add("".concat(y,"-").concat(C))}function l(C){return e.remove("".concat(y,"-").concat(C))}var e=n.documentElement.classList,a=F.autoFetchSvg?Object.keys(A):Object.keys(rc);a.includes("fa")||a.push("fa");var M=[".".concat(N,":not([").concat(d,"])")].concat(a.map((function(C){return".".concat(C,":not([").concat(d,"])")}))).join(", ");if(0===M.length)return Promise.resolve();a=[];try{a=G(C.querySelectorAll(M))}catch(C){}if(!(0<a.length))return Promise.resolve();z("pending"),l("complete");var L=$C.begin("onTree"),V=a.reduce((function(C,c){try{var z=sc(c);z&&C.push(z)}catch(C){x||"MissingIcon"===C.name&&console.error(C)}return C}),[]);return new Promise((function(C,e){Promise.all(V).then((function(e){ec(e,(function(){z("active"),z("complete"),l("pending"),"function"==typeof c&&c(),L(),C()}))})).catch((function(C){L(),e(C)}))}))}function nc(C){var c=1<arguments.length&&void 0!==arguments[1]?arguments[1]:null;sc(C).then((function(C){C&&ec([C],c)}))}function ic(C){var z=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},l=z.transform,e=void 0===l?X:l,a=void 0!==(l=z.symbol)&&l,M=void 0===(l=z.mask)?null:l,L=void 0===(l=z.maskId)?null:l,V=void 0===(l=z.title)?null:l,H=void 0===(l=z.titleId)?null:l,t=void 0===(l=z.classes)?[]:l,r=void 0===(l=z.attributes)?{}:l,s=void 0===(l=z.styles)?{}:l;if(C){var h=C.prefix,n=C.iconName,i=C.icon;return RC(c({type:"icon"},C),(function(){return PC("beforeDOMElementCreation",{iconDefinition:C,params:z}),F.autoA11y&&(V?r["aria-labelledby"]="".concat(F.replacementClass,"-title-").concat(H||Q()):(r["aria-hidden"]="true",r.focusable="false")),DC({icons:{main:WC(i),mask:M?WC(M.icon):{found:!1,width:null,height:null,icon:{}}},prefix:h,iconName:n,transform:c(c({},X),e),symbol:a,title:V,maskId:L,titleId:H,extra:{attributes:r,styles:s,classes:t}})}))}}V={mixout:function(){return{icon:(C=ic,function(z){var l=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},e=(z||{}).icon?z:EC(z||{});return z=(z=l.mask)&&((z||{}).icon?z:EC(z||{})),C(e,c(c({},l),{},{mask:z}))})};var C},hooks:function(){return{mutationObserverCallbacks:function(C){return C.treeCallback=hc,C.nodeCallback=nc,C}}},provides:function(C){C.i2svg=function(C){var c=C.node;return C=C.callback,hc(void 0===c?n:c,void 0===C?function(){}:C)},C.generateSvgReplacementMutation=function(C,c){var z=c.iconName,e=c.title,a=c.titleId,M=c.prefix,L=c.transform,V=c.symbol,H=c.mask,t=c.maskId,r=c.extra;return new Promise((function(c,s){Promise.all([XC(z,M),H.iconName?XC(H.iconName,H.prefix):Promise.resolve({found:!1,width:512,height:512,icon:{}})]).then((function(H){H=(s=l(H,2))[0];var s=s[1];c([C,DC({icons:{main:H,mask:s},prefix:M,iconName:z,transform:L,symbol:V,maskId:t,title:e,titleId:a,extra:r,watchable:!0})])})).catch(s)}))},C.generateAbstractIcon=function(C){var c,z=C.children,l=C.attributes,e=C.main,a=C.transform;return 0<(C=J(C.styles)).length&&(l.style=C),Z(a)&&(c=NC("generateAbstractTransformGrouping",{main:e,transform:a,containerWidth:e.width,iconWidth:e.width})),z.push(c||e.icon),{children:z,attributes:l}}}},H={mixout:function(){return{layer:function(C){var c=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},z=c.classes,l=void 0===z?[]:z;return RC({type:"layer"},(function(){PC("beforeDOMElementCreation",{assembler:C,params:c});var z=[];return C((function(C){Array.isArray(C)?C.map((function(C){z=z.concat(C.abstract)})):z=z.concat(C.abstract)})),[{tag:"span",attributes:{class:["".concat(F.familyPrefix,"-layers")].concat(e(l)).join(" ")},children:z}]}))}}}},t={mixout:function(){return{counter:function(C){var z,l=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},a=void 0===(z=l.title)?null:z,M=void 0===(z=l.classes)?[]:z,L=void 0===(z=l.attributes)?{}:z,V=void 0===(z=l.styles)?{}:z;return RC({type:"counter",content:C},(function(){return PC("beforeDOMElementCreation",{content:C,params:l}),H=(z={content:C.toString(),title:a,extra:{attributes:L,styles:V,classes:["".concat(F.familyPrefix,"-layers-counter")].concat(e(M))}}).content,t=z.title,z=c(c(c({},(r=z.extra).attributes),t?{title:t}:{}),{},{class:r.classes.join(" ")}),0<(r=J(r.styles)).length&&(z.style=r),(r=[]).push({tag:"span",attributes:z,children:[H]}),t&&r.push({tag:"span",attributes:{class:"sr-only"},children:[t]}),r;var z,H,t,r}))}}}},o={mixout:function(){return{text:function(C){var z,l=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},a=void 0===(z=l.transform)?X:z,M=void 0===(z=l.title)?null:z,L=void 0===(z=l.classes)?[]:z,V=void 0===(z=l.attributes)?{}:z,H=void 0===(z=l.styles)?{}:z;return RC({type:"text",content:C},(function(){return PC("beforeDOMElementCreation",{content:C,params:l}),_C({content:C,transform:c(c({},X),a),title:M,extra:{attributes:V,styles:H,classes:["".concat(F.familyPrefix,"-layers-text")].concat(e(L))}})}))}}},provides:function(C){C.generateLayersText=function(C,c){var z,l=c.title,e=c.transform,a=c.extra,M=null,L=null;return m&&(z=parseInt(getComputedStyle(C).fontSize,10),M=(c=C.getBoundingClientRect()).width/z,L=c.height/z),F.autoA11y&&!l&&(a.attributes["aria-hidden"]="true"),Promise.resolve([C,_C({content:C.innerHTML,width:M,height:L,transform:e,title:l,extra:a,watchable:!0})])}}};var oc=new RegExp('"',"ug"),fc=[1105920,1112319];function vc(C,z){var l="".concat(b).concat(z.replace(":","-"));return new Promise((function(e,a){if(null!==C.getAttribute(l))return e();var M,L,V,H,t,r,s,i=G(C.children).filter((function(C){return C.getAttribute(p)===z}))[0],o=h.getComputedStyle(C,z),f=o.getPropertyValue("font-family").match(E),v=o.getPropertyValue("font-weight"),m=o.getPropertyValue("content");if(i&&!f)return C.removeChild(i),e();f&&"none"!==m&&""!==m?(r=o.getPropertyValue("content"),M=~["Solid","Regular","Light","Thin","Duotone","Brands","Kit"].indexOf(f[2])?q[f[2].toLowerCase()]:I[v],t=(m=(t=r).replace(oc,""),o=0,r=(v=m).length,s=55296<=(t=v.charCodeAt(o))&&t<=56319&&o+1<r&&56320<=(s=v.charCodeAt(o+1))&&s<=57343?1024*(t-55296)+s-56320+65536:t,t=fc[0]<=s&&s<=fc[1],m={value:rC((s=2===m.length&&m[0]===m[1])?m[0]:m),isSecondary:t||s}).value,s=m.isSecondary,m=f[0].startsWith("FontAwesome"),f=SC(M,t),L=f,m&&(t=dC[m=t],m=SC("fas",m),(m=t||(m?{prefix:"fas",iconName:m}:null)||{prefix:null,iconName:null}).iconName&&m.prefix&&(f=m.iconName,M=m.prefix)),!f||s||i&&i.getAttribute(g)===M&&i.getAttribute(S)===L?e():(C.setAttribute(l,L),i&&C.removeChild(i),(H=(V={iconName:null,title:null,titleId:null,prefix:null,transform:X,symbol:!1,mask:{iconName:null,prefix:null,rest:[]},maskId:null,extra:{classes:[],styles:{},attributes:{}}}).extra).attributes[p]=z,XC(f,M).then((function(a){var t=DC(c(c({},V),{},{icons:{main:a,mask:{prefix:null,iconName:null,rest:[]}},prefix:M,iconName:L,extra:H,watchable:!0}));a=n.createElement("svg"),"::before"===z?C.insertBefore(a,C.firstChild):C.appendChild(a),a.outerHTML=t.map(LC).join("\n"),C.removeAttribute(l),e()})).catch(a))):e()}))}function mc(C){return Promise.all([vc(C,"::before"),vc(C,"::after")])}function uc(C){return!(C.parentNode===document.head||~k.indexOf(C.tagName.toUpperCase())||C.getAttribute(p)||C.parentNode&&"svg"===C.parentNode.tagName)}function dc(C){if(v)return new Promise((function(c,z){var l=G(C.querySelectorAll("*")).filter(uc).map(mc),e=$C.begin("searchPseudoElements");Mc(),Promise.all(l).then((function(){e(),Lc(),c()})).catch((function(){e(),Lc(),z()}))}))}function pc(C){return C.toLowerCase().split(" ").reduce((function(C,c){var z=c.toLowerCase().split("-"),l=(c=z[0],z.slice(1).join("-"));if(c&&"h"===l)return C.flipX=!0,C;if(c&&"v"===l)return C.flipY=!0,C;if(l=parseFloat(l),isNaN(l))return C;switch(c){case"grow":C.size=C.size+l;break;case"shrink":C.size=C.size-l;break;case"left":C.x=C.x-l;break;case"right":C.x=C.x+l;break;case"up":C.y=C.y-l;break;case"down":C.y=C.y+l;break;case"rotate":C.rotate=C.rotate+l}return C}),{size:16,x:0,y:0,flipX:!1,flipY:!1,rotate:0})}var bc,gc=!1,Sc={x:0,y:0,width:"100%",height:"100%"};function yc(C){return C.attributes&&(C.attributes.fill||!(1<arguments.length&&void 0!==arguments[1])||arguments[1])&&(C.attributes.fill="black"),C}bc=TC,s=[r,V,H,t,o,{hooks:function(){return{mutationObserverCallbacks:function(C){return C.pseudoElementsCallback=dc,C}}},provides:function(C){C.pseudoElements2svg=function(C){C=C.node,F.searchPseudoElements&&dc(void 0===C?n:C)}}},{mixout:function(){return{dom:{unwatch:function(){Mc(),gc=!0}}}},hooks:function(){return{bootstrap:function(){Hc(jC("mutationObserverCallbacks",{}))},noAuto:function(){Vc&&Vc.disconnect()},watch:function(C){C=C.observeMutationsRoot,gc?Lc():Hc(jC("mutationObserverCallbacks",{observeMutationsRoot:C}))}}}},{mixout:function(){return{parse:{transform:pc}}},hooks:function(){return{parseNodeAttributes:function(C,c){return(c=c.getAttribute("data-fa-transform"))&&(C.transform=pc(c)),C}}},provides:function(C){C.generateAbstractTransformGrouping=function(C){var z=C.main,l=C.transform,e=C.containerWidth,a=C.iconWidth,M={transform:"translate(".concat(e/2," 256)")};return C="translate(".concat(32*l.x,", ").concat(32*l.y,") "),e="scale(".concat(l.size/16*(l.flipX?-1:1),", ").concat(l.size/16*(l.flipY?-1:1),") "),l="rotate(".concat(l.rotate," 0 0)"),{tag:"g",attributes:c({},(a={outer:M,inner:{transform:"".concat(C," ").concat(e," ").concat(l)},path:{transform:"translate(".concat(a/2*-1," -256)")}}).outer),children:[{tag:"g",attributes:c({},a.inner),children:[{tag:z.icon.tag,children:z.icon.children,attributes:c(c({},z.icon.attributes),a.path)}]}]}}}},{hooks:function(){return{parseNodeAttributes:function(C,c){var z=(z=c.getAttribute("data-fa-mask"))?xC(z.split(" ").map((function(C){return C.trim()}))):{prefix:null,iconName:null,rest:[]};return z.prefix||(z.prefix=fC),C.mask=z,C.maskId=c.getAttribute("data-fa-mask-id"),C}}},provides:function(C){C.generateAbstractMask=function(C){var z=C.children,l=C.attributes,e=C.main,a=C.mask,M=C.maskId,L=C.transform,V=e.width,H=e.icon,t=a.width;return C=a.icon,a=(e={transform:L,containerWidth:t,iconWidth:V}).transform,L=e.containerWidth,t=e.iconWidth,V={transform:"translate(".concat(L/2," 256)")},e="translate(".concat(32*a.x,", ").concat(32*a.y,") "),L="scale(".concat(a.size/16*(a.flipX?-1:1),", ").concat(a.size/16*(a.flipY?-1:1),") "),a="rotate(".concat(a.rotate," 0 0)"),L={outer:V,inner:{transform:"".concat(e," ").concat(L," ").concat(a)},path:{transform:"translate(".concat(t/2*-1," -256)")}},a={tag:"rect",attributes:c(c({},Sc),{},{fill:"white"})},t=H.children?{children:H.children.map(yc)}:{},t={tag:"g",attributes:c({},L.inner),children:[yc(c({tag:H.tag,attributes:c(c({},H.attributes),L.path)},t))]},L={tag:"g",attributes:c({},L.outer),children:[t]},t="mask-".concat(M||Q()),M="clip-".concat(M||Q()),L={tag:"mask",attributes:c(c({},Sc),{},{id:t,maskUnits:"userSpaceOnUse",maskContentUnits:"userSpaceOnUse"}),children:[a,L]},L={tag:"defs",children:[{tag:"clipPath",attributes:{id:M},children:"g"===C.tag?C.children:[C]},L]},z.push(L,{tag:"rect",attributes:c({fill:"currentColor","clip-path":"url(#".concat(M,")"),mask:"url(#".concat(t,")")},Sc)}),{children:z,attributes:l}}}},{provides:function(C){var z=!1;h.matchMedia&&(z=h.matchMedia("(prefers-reduced-motion: reduce)").matches),C.missingIconAbstract=function(){var C=[],l={fill:"currentColor"},e={attributeType:"XML",repeatCount:"indefinite",dur:"2s"};C.push({tag:"path",attributes:c(c({},l),{},{d:"M156.5,447.7l-12.6,29.5c-18.7-9.5-35.9-21.2-51.5-34.9l22.7-22.7C127.6,430.5,141.5,440,156.5,447.7z M40.6,272H8.5 c1.4,21.2,5.4,41.7,11.7,61.1L50,321.2C45.1,305.5,41.8,289,40.6,272z M40.6,240c1.4-18.8,5.2-37,11.1-54.1l-29.5-12.6 C14.7,194.3,10,216.7,8.5,240H40.6z M64.3,156.5c7.8-14.9,17.2-28.8,28.1-41.5L69.7,92.3c-13.7,15.6-25.5,32.8-34.9,51.5 L64.3,156.5z M397,419.6c-13.9,12-29.4,22.3-46.1,30.4l11.9,29.8c20.7-9.9,39.8-22.6,56.9-37.6L397,419.6z M115,92.4 c13.9-12,29.4-22.3,46.1-30.4l-11.9-29.8c-20.7,9.9-39.8,22.6-56.8,37.6L115,92.4z M447.7,355.5c-7.8,14.9-17.2,28.8-28.1,41.5 l22.7,22.7c13.7-15.6,25.5-32.9,34.9-51.5L447.7,355.5z M471.4,272c-1.4,18.8-5.2,37-11.1,54.1l29.5,12.6 c7.5-21.1,12.2-43.5,13.6-66.8H471.4z M321.2,462c-15.7,5-32.2,8.2-49.2,9.4v32.1c21.2-1.4,41.7-5.4,61.1-11.7L321.2,462z M240,471.4c-18.8-1.4-37-5.2-54.1-11.1l-12.6,29.5c21.1,7.5,43.5,12.2,66.8,13.6V471.4z M462,190.8c5,15.7,8.2,32.2,9.4,49.2h32.1 c-1.4-21.2-5.4-41.7-11.7-61.1L462,190.8z M92.4,397c-12-13.9-22.3-29.4-30.4-46.1l-29.8,11.9c9.9,20.7,22.6,39.8,37.6,56.9 L92.4,397z M272,40.6c18.8,1.4,36.9,5.2,54.1,11.1l12.6-29.5C317.7,14.7,295.3,10,272,8.5V40.6z M190.8,50 c15.7-5,32.2-8.2,49.2-9.4V8.5c-21.2,1.4-41.7,5.4-61.1,11.7L190.8,50z M442.3,92.3L419.6,115c12,13.9,22.3,29.4,30.5,46.1 l29.8-11.9C470,128.5,457.3,109.4,442.3,92.3z M397,92.4l22.7-22.7c-15.6-13.7-32.8-25.5-51.5-34.9l-12.6,29.5 C370.4,72.1,384.4,81.5,397,92.4z"})});var a=c(c({},e),{},{attributeName:"opacity"}),M={tag:"circle",attributes:c(c({},l),{},{cx:"256",cy:"364",r:"28"}),children:[]};return z||M.children.push({tag:"animate",attributes:c(c({},e),{},{attributeName:"r",values:"28;14;28;28;14;28;"})},{tag:"animate",attributes:c(c({},a),{},{values:"1;0;1;1;0;1;"})}),C.push(M),C.push({tag:"path",attributes:c(c({},l),{},{opacity:"1",d:"M263.7,312h-16c-6.6,0-12-5.4-12-12c0-71,77.4-63.9,77.4-107.8c0-20-17.8-40.2-57.4-40.2c-29.1,0-44.3,9.6-59.2,28.7 c-3.9,5-11.1,6-16.2,2.4l-13.1-9.2c-5.6-3.9-6.9-11.8-2.6-17.2c21.2-27.2,46.4-44.7,91.2-44.7c52.3,0,97.4,29.8,97.4,80.2 c0,67.6-77.4,63.5-77.4,107.8C275.7,306.6,270.3,312,263.7,312z"}),children:z?[]:[{tag:"animate",attributes:c(c({},a),{},{values:"1;0;0;0;0;1;"})}]}),z||C.push({tag:"path",attributes:c(c({},l),{},{opacity:"0",d:"M232.5,134.5l7,168c0.3,6.4,5.6,11.5,12,11.5h9c6.4,0,11.7-5.1,12-11.5l7-168c0.3-6.8-5.2-12.5-12-12.5h-23 C237.7,122,232.2,127.7,232.5,134.5z"}),children:[{tag:"animate",attributes:c(c({},a),{},{values:"0;0;1;1;0;0;"})}]}),{tag:"g",attributes:{class:"missing"},children:C}}}},{hooks:function(){return{parseNodeAttributes:function(C,c){return c=c.getAttribute("data-fa-symbol"),C.symbol=null!==c&&(""===c||c),C}}}}],AC={},Object.keys(qC).forEach((function(C){-1===OC.indexOf(C)&&delete qC[C]})),s.forEach((function(C){var c,l=C.mixout?C.mixout():{};Object.keys(l).forEach((function(C){"function"==typeof l[C]&&(bc[C]=l[C]),"object"===z(l[C])&&Object.keys(l[C]).forEach((function(c){bc[C]||(bc[C]={}),bc[C][c]=l[C][c]}))})),C.hooks&&(c=C.hooks(),Object.keys(c).forEach((function(C){AC[C]||(AC[C]=[]),AC[C].push(c[C])}))),C.provides&&C.provides(qC)})),function(C){try{for(var c=arguments.length,z=new Array(1<c?c-1:0),l=1;l<c;l++)z[l-1]=arguments[l];C.apply(void 0,z)}catch(C){if(!x)throw C}}((function(C){f&&(h.FontAwesome||(h.FontAwesome=TC),MC((function(){YC(),PC("bootstrap")}))),lC.hooks=c(c({},lC.hooks),{},{addPack:function(C,z){lC.styles[C]=c(c({},lC.styles[C]||{}),z),gC(),YC()},addPacks:function(C){C.forEach((function(C){C=(z=l(C,2))[0];var z=z[1];lC.styles[C]=c(c({},lC.styles[C]||{}),z)})),gC(),YC()},addShims:function(C){var c;(c=lC.shims).push.apply(c,e(C)),gC(),YC()}})}))}();
\ No newline at end of file
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt b/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt
deleted file mode 100644
index b71b9f0..0000000
--- a/docs/_build/html/_static/vendor/fontawesome/6.1.2/js/all.min.js.LICENSE.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-/*!
- * Font Awesome Free 6.1.2 by @fontawesome - https://fontawesome.com
- * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)
- * Copyright 2022 Fonticons, Inc.
- */
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf
deleted file mode 100644
index 24ca8b1..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.ttf and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2 b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2
deleted file mode 100644
index e67e5cd..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2 and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf
deleted file mode 100644
index c5ac009..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.ttf and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2 b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2
deleted file mode 100644
index 7dca1d9..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2 and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf
deleted file mode 100644
index 43ba1cc..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.ttf and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2 b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2
deleted file mode 100644
index 4a7f966..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2 and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf
deleted file mode 100644
index 243bc25..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.ttf and /dev/null differ
diff --git a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2 b/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2
deleted file mode 100644
index e18a16d..0000000
Binary files a/docs/_build/html/_static/vendor/fontawesome/6.1.2/webfonts/fa-v4compatibility.woff2 and /dev/null differ
diff --git a/docs/_build/html/_static/webpack-macros.html b/docs/_build/html/_static/webpack-macros.html
deleted file mode 100644
index f483694..0000000
--- a/docs/_build/html/_static/webpack-macros.html
+++ /dev/null
@@ -1,31 +0,0 @@
-<!--
-  AUTO-GENERATED from webpack.config.js, do **NOT** edit by hand.
-  These are re-used in layout.html
--->
-{# Load FontAwesome icons #}
-{% macro head_pre_icons() %}
-  <link href="{{ pathto('_static/vendor/fontawesome/6.1.2/css/all.min.css', 1) }}?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="{{ pathto('_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2', 1) }}" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="{{ pathto('_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2', 1) }}" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="{{ pathto('_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2', 1) }}" />
-{% endmacro %}
-
-{% macro head_pre_assets() %}
-  <!-- Loaded before other Sphinx assets -->
-  <link href="{{ pathto('_static/styles/theme.css', 1) }}?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="{{ pathto('_static/styles/bootstrap.css', 1) }}?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="{{ pathto('_static/styles/pydata-sphinx-theme.css', 1) }}?digest=365ca57ee442770a23c6" rel="stylesheet" />
-{% endmacro %}
-
-{% macro head_js_preload() %}
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="{{ pathto('_static/scripts/bootstrap.js', 1) }}?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="{{ pathto('_static/scripts/pydata-sphinx-theme.js', 1) }}?digest=365ca57ee442770a23c6" />
-  <script src="{{ pathto('_static/vendor/fontawesome/6.1.2/js/all.min.js', 1) }}?digest=365ca57ee442770a23c6"></script>
-{% endmacro %}
-
-{% macro body_post() %}
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="{{ pathto('_static/scripts/bootstrap.js', 1) }}?digest=365ca57ee442770a23c6"></script>
-<script src="{{ pathto('_static/scripts/pydata-sphinx-theme.js', 1) }}?digest=365ca57ee442770a23c6"></script>
-{% endmacro %}
\ No newline at end of file
diff --git a/docs/_build/html/index.html b/docs/_build/html/index.html
deleted file mode 100644
index 960bb69..0000000
--- a/docs/_build/html/index.html
+++ /dev/null
@@ -1 +0,0 @@
-<meta http-equiv="Refresh" content="0; url=README.html" />
diff --git a/docs/_build/html/objects.inv b/docs/_build/html/objects.inv
deleted file mode 100644
index fc3664e..0000000
Binary files a/docs/_build/html/objects.inv and /dev/null differ
diff --git a/docs/_build/html/reports/Book.err.log b/docs/_build/html/reports/Book.err.log
deleted file mode 100644
index b438e38..0000000
--- a/docs/_build/html/reports/Book.err.log
+++ /dev/null
@@ -1,35 +0,0 @@
-Traceback (most recent call last):
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 778, in _async_poll_for_reply
-    msg = await ensure_async(self.kc.shell_channel.get_msg(timeout=new_timeout))
-  File "/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py", line 189, in ensure_async
-    result = await obj
-  File "/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/channels.py", line 315, in get_msg
-    raise Empty
-_queue.Empty
-
-During handling of the above exception, another exception occurred:
-
-Traceback (most recent call last):
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_cache/executors/utils.py", line 58, in single_nb_execution
-    executenb(
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 1305, in execute
-    return NotebookClient(nb=nb, resources=resources, km=km, **kwargs).execute()
-  File "/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py", line 173, in wrapped
-    return loop.run_until_complete(inner)
-  File "/usr/local/python/3.10.8/lib/python3.10/asyncio/base_events.py", line 649, in run_until_complete
-    return future.result()
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 705, in async_execute
-    await self.async_execute_cell(
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 1001, in async_execute_cell
-    exec_reply = await self.task_poll_for_reply
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 802, in _async_poll_for_reply
-    error_on_timeout_execute_reply = await self._async_handle_timeout(timeout, cell)
-  File "/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py", line 852, in _async_handle_timeout
-    raise CellTimeoutError.error_from_timeout_and_cell(
-nbclient.exceptions.CellTimeoutError: A cell timed out while it was being executed, after 30 seconds.
-The message was: Cell execution timed out.
-Here is a preview of the cell contents:
--------------------
-!jupyter-book build .
--------------------
-
diff --git a/docs/_build/html/search.html b/docs/_build/html/search.html
deleted file mode 100644
index a7412a1..0000000
--- a/docs/_build/html/search.html
+++ /dev/null
@@ -1,492 +0,0 @@
-
-
-<!DOCTYPE html>
-
-
-<html lang="en" >
-
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><title>Search - Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
-  
-  
-  
-  <script data-cfasync="false">
-    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
-    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
-  </script>
-  
-  <!-- Loaded before other Sphinx assets -->
-  <link href="_static/styles/theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/bootstrap.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-<link href="_static/styles/pydata-sphinx-theme.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-
-  
-  <link href="_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=365ca57ee442770a23c6" rel="stylesheet" />
-  <link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2" />
-<link rel="preload" as="font" type="font/woff2" crossorigin href="_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2" />
-
-    <link rel="stylesheet" type="text/css" href="_static/pygments.css" />
-    <link rel="stylesheet" href="_static/styles/sphinx-book-theme.css?digest=14f4ca6b54d191a8c7657f6c759bf11a5fb86285" type="text/css" />
-    <link rel="stylesheet" type="text/css" href="_static/togglebutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/copybutton.css" />
-    <link rel="stylesheet" type="text/css" href="_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css" />
-    <link rel="stylesheet" type="text/css" href="_static/sphinx-thebe.css" />
-    <link rel="stylesheet" type="text/css" href="_static/design-style.4045f2051d55cab465a707391d5b2007.min.css" />
-  
-  <!-- Pre-loaded scripts that we'll load fully later -->
-  <link rel="preload" as="script" href="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6" />
-<link rel="preload" as="script" href="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6" />
-  <script src="_static/vendor/fontawesome/6.1.2/js/all.min.js?digest=365ca57ee442770a23c6"></script>
-
-    <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-    <script src="_static/jquery.js"></script>
-    <script src="_static/underscore.js"></script>
-    <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
-    <script src="_static/doctools.js"></script>
-    <script src="_static/clipboard.min.js"></script>
-    <script src="_static/copybutton.js"></script>
-    <script src="_static/scripts/sphinx-book-theme.js?digest=5a5c038af52cf7bc1a1ec88eea08e6366ee68824"></script>
-    <script>let toggleHintShow = 'Click to show';</script>
-    <script>let toggleHintHide = 'Click to hide';</script>
-    <script>let toggleOpenOnPrint = 'true';</script>
-    <script src="_static/togglebutton.js"></script>
-    <script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
-    <script src="_static/design-tabs.js"></script>
-    <script>const THEBE_JS_URL = "https://unpkg.com/thebe@0.8.2/lib/index.js"
-const thebe_selector = ".thebe,.cell"
-const thebe_selector_input = "pre"
-const thebe_selector_output = ".output, .cell_output"
-</script>
-    <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'search';</script>
-  <script src="_static/searchtools.js"></script>
-  <script src="_static/language_data.js"></script>
-  <script src="searchindex.js"></script>
-    <link rel="index" title="Index" href="genindex.html" />
-    <link rel="search" title="Search" href="#" />
-  <meta name="viewport" content="width=device-width, initial-scale=1"/>
-  <meta name="docsearch:language" content="en"/>
-  </head>
-  
-  
-  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
-
-  
-  
-  <a class="skip-link" href="#main-content">Skip to main content</a>
-  
-  <div id="pst-scroll-pixel-helper"></div>
-
-  
-  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
-    <i class="fa-solid fa-arrow-up"></i>
-    Back to top
-  </button>
-
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__primary"
-          id="__primary"/>
-  <label class="overlay overlay-primary" for="__primary"></label>
-  
-  <input type="checkbox"
-          class="sidebar-toggle"
-          name="__secondary"
-          id="__secondary"/>
-  <label class="overlay overlay-secondary" for="__secondary"></label>
-  
-  <div class="search-button__wrapper">
-    <div class="search-button__overlay"></div>
-    <div class="search-button__search-container">
-<form class="bd-search d-flex align-items-center"
-      action="#"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form></div>
-  </div>
-  
-    <nav class="bd-header navbar navbar-expand-lg bd-navbar">
-    </nav>
-  
-  <div class="bd-container">
-    <div class="bd-container__inner bd-page-width">
-      
-      <div class="bd-sidebar-primary bd-sidebar">
-        
-
-  
-  <div class="sidebar-header-items sidebar-primary__section">
-    
-    
-    
-    
-  </div>
-  
-    <div class="sidebar-primary-items__start sidebar-primary__section">
-        <div class="sidebar-primary-item">
-  
-
-<a class="navbar-brand logo" href="README.html">
-  
-  
-  
-  
-  
-  
-    <p class="title logo__title">Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</p>
-  
-</a></div>
-        <div class="sidebar-primary-item"><nav class="bd-links" id="bd-docs-nav" aria-label="Main">
-    <div class="bd-toc-item navbar-nav active">
-        
-        <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
-                </a>
-            </li>
-        </ul>
-        <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/238.%20Product%20of%20Array%20Except%20Self.html">238. Product of Array Except Self</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/242.%20Valid%20Anagram.html">242. Valid Anagram</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/347.%20Top%20K%20Frequent%20Elements.html">347. Top K Frequent Elements</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/49.%20Group%20Anagrams.html">49. Group Anagrams</a></li>
-<li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
-<li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
-<li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
-<li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/206.%20Reverse%20Linked%20List.html">206. Reverse Linked List</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/21.%20Merge%20Two%20Sorted%20Lists.html">21. Merge Two Sorted Lists</a></li>
-<li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.html">105. Construct Binary Tree from Preorder and Inorder Traversal</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.html">124. Binary Tree Maximum Path Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/199.%20Binary%20Tree%20Right%20Side%20View.html">199. Binary Tree Right Side View</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/226.%20Invert%20Binary%20Tree.html">226: Invert Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.html">230. Kth Smallest Element in a BST</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.html">235. Lowest Common Ancestor of a Binary Search Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.html">297. Serialize and Deserialize Binary Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/572.%20Subtree%20of%20Another%20Tree.html">572: Subtree of Another Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
-<li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
-<li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
-<li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/207.%20Course%20Schedule.html">207. Course Schedule</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/3651.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.html">3651. Number of Connected Components in an Undirected Graph</a></li>
-<li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
-</ul>
-</li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/README.html">1-D Dynamic Programming Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/70.%20Climbing%20Stairs.html">70. Climbing Stairs</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/198.%20House%20Robber.html">House Robber</a></li>
-<li class="toctree-l2"><a class="reference internal" href="13.%20One-D%20Dynamic%20Programming/213.%20House%20Robber%20II.html">House Robber II</a></li>
-</ul>
-</li>
-<li class="toctree-l1"><a class="reference internal" href="14.%20Two-D%20Dynamic%20Programming/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="15.%20Greedy/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="16.%20Intervals/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="17.%20Math%20Geometry/README.html">Blind 75 LeetCode Problems</a></li>
-<li class="toctree-l1"><a class="reference internal" href="18.%20Bit%20Manipulation/README.html">Blind 75 LeetCode Problems</a></li>
-</ul>
-
-    </div>
-</nav></div>
-    </div>
-  
-  
-  <div class="sidebar-primary-items__end sidebar-primary__section">
-  </div>
-  
-  <div id="rtd-footer-container"></div>
-
-
-      </div>
-      
-      <main id="main-content" class="bd-main">
-        
-        
-
-<div class="sbt-scroll-pixel-helper"></div>
-
-          <div class="bd-content">
-            <div class="bd-article-container">
-              
-              <div class="bd-header-article">
-<div class="header-article-items header-article__inner">
-  
-    <div class="header-article-items__start">
-      
-        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
-  <span class="fa-solid fa-bars"></span>
-</label></div>
-      
-    </div>
-  
-  
-    <div class="header-article-items__end">
-      
-        <div class="header-article-item">
-
-<div class="article-header-buttons">
-
-
-
-
-
-<div class="dropdown dropdown-source-buttons">
-  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Source repositories">
-    <i class="fab fa-github"></i>
-  </button>
-  <ul class="dropdown-menu">
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions" target="_blank"
-   class="btn btn-sm btn-source-repository-button dropdown-item"
-   title="Source repository"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fab fa-github"></i>
-  </span>
-<span class="btn__text-container">Repository</span>
-</a>
-</li>
-      
-      
-      
-      
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2Fsearch.html&body=Your%20issue%20content%20here." target="_blank"
-   class="btn btn-sm btn-source-issues-button dropdown-item"
-   title="Open an issue"
-   data-bs-placement="left" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-lightbulb"></i>
-  </span>
-<span class="btn__text-container">Open issue</span>
-</a>
-</li>
-      
-  </ul>
-</div>
-
-
-
-
-<button onclick="toggleFullScreen()"
-  class="btn btn-sm btn-fullscreen-button"
-  title="Fullscreen mode"
-  data-bs-placement="bottom" data-bs-toggle="tooltip"
->
-  
-
-<span class="btn__icon-container">
-  <i class="fas fa-expand"></i>
-  </span>
-
-</button>
-
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn theme-switch-button" title="light/dark" aria-label="light/dark" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
-    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
-  </button>
-`);
-</script>
-
-<script>
-document.write(`
-  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-bs-placement="bottom" data-bs-toggle="tooltip">
-    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
-  </button>
-`);
-</script>
-
-</div></div>
-      
-    </div>
-  
-</div>
-</div>
-              
-              
-  <div class="bd-search-container">
-    <h1>Search</h1>
-    <noscript>
-      <div class="admonition error">
-        <p class="admonition-title">Error</p>
-        <p>Please activate JavaScript to enable the search functionality.</p>
-      </div>
-    </noscript>
-    
-<form class="bd-search d-flex align-items-center"
-      action="#"
-      method="get">
-  <i class="fa-solid fa-magnifying-glass"></i>
-  <input type="search"
-         class="form-control"
-         name="q"
-         id="search-input"
-         placeholder="Search this book..."
-         aria-label="Search this book..."
-         autocomplete="off"
-         autocorrect="off"
-         autocapitalize="off"
-         spellcheck="false"/>
-  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
-</form>
-    <div id="search-results"></div>
-  </div>
-  <script>
-    // Activate the search field on page load
-    let searchInput = document.querySelector("form.bd-search input");
-    if (searchInput) {
-        searchInput.focus();
-        searchInput.select();
-        console.log("[PST]: Set focus on search field.");
-    }
-  </script>
-
-              
-              
-              
-              
-                <footer class="prev-next-footer">
-                  <!-- Previous / next buttons -->
-<div class="prev-next-area">
-</div>
-                </footer>
-              
-            </div>
-            
-            
-              
-            
-          </div>
-          <footer class="bd-footer-content">
-            
-<div class="bd-footer-content__inner container">
-  
-  <div class="footer-item">
-    
-<p class="component-author">
-By Mohsen Tabibian and Saeed Samadidana
-</p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  <p class="copyright">
-    
-      © Copyright 2022.
-      <br/>
-    
-  </p>
-
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-  <div class="footer-item">
-    
-  </div>
-  
-</div>
-          </footer>
-        
-
-      </main>
-    </div>
-  </div>
-  
-  <!-- Scripts loaded after <body> so the DOM is not blocked -->
-  <script src="_static/scripts/bootstrap.js?digest=365ca57ee442770a23c6"></script>
-<script src="_static/scripts/pydata-sphinx-theme.js?digest=365ca57ee442770a23c6"></script>
-
-  <footer class="bd-footer">
-  </footer>
-  </body>
-</html>
\ No newline at end of file
diff --git a/docs/_build/html/searchindex.js b/docs/_build/html/searchindex.js
deleted file mode 100644
index 8321071..0000000
--- a/docs/_build/html/searchindex.js
+++ /dev/null
@@ -1 +0,0 @@
-Search.setIndex({"docnames": ["01. Array Hashing/1. Two Sum", "01. Array Hashing/128. Longest Consecutive Sequence", "01. Array Hashing/217. Contains Duplicate", "01. Array Hashing/238. Product of Array Except Self", "01. Array Hashing/242. Valid Anagram", "01. Array Hashing/347. Top K Frequent Elements", "01. Array Hashing/49. Group Anagrams", "01. Array Hashing/659. Encode and Decode Strings", "01. Array Hashing/README", "02. Two Pointers/11. Container With Most Water", "02. Two Pointers/125. Valid Palindrome", "02. Two Pointers/15. 3Sum", "02. Two Pointers/README", "03. Sliding Window/121. Best Time to Buy and Sell Stock", "03. Sliding Window/3. Longest Substring Without Repeating Characters", "03. Sliding Window/424. Longest Repeating Character Replacement", "03. Sliding Window/76. Minimum Window Substring", "03. Sliding Window/README", "04. Stack/20. Valid Parentheses", "04. Stack/README", "05. Binary Search/153. Find Minimum in Rotated Sorted Array", "05. Binary Search/33. Search in Rotated Sorted Array", "05. Binary Search/README", "06. Linked List/141. Linked List Cycle", "06. Linked List/143. Reorder List", "06. Linked List/19. Remove Nth Node From End of List", "06. Linked List/206. Reverse Linked List", "06. Linked List/21. Merge Two Sorted Lists", "06. Linked List/23. Merge k Sorted Lists", "06. Linked List/README", "07. Trees/100. Same Tree", "07. Trees/102. Binary Tree Level Order Traversal", "07. Trees/104. Maximum Depth of Binary Tree", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal", "07. Trees/124. Binary Tree Maximum Path Sum", "07. Trees/199. Binary Tree Right Side View", "07. Trees/226. Invert Binary Tree", "07. Trees/230. Kth Smallest Element in a BST", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree", "07. Trees/297. Serialize and Deserialize Binary Tree", "07. Trees/572. Subtree of Another Tree", "07. Trees/98. Validate Binary Search Tree", "07. Trees/README", "08. Tries/208. Implement Trie (Prefix Tree)", "08. Tries/211. Design Add and Search Words Data Structure", "08. Tries/212. Word Search II", "08. Tries/README", "09. Heap - Priority Queue/1046. Last Stone Weight", "09. Heap - Priority Queue/295. Find Median from Data Stream", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream", "09. Heap - Priority Queue/README", "10. Backtracking/39. Combination Sum", "10. Backtracking/79. Word Search", "10. Backtracking/README", "11. Graphs/133. Clone Graph", "11. Graphs/178. Graph Valid Tree", "11. Graphs/200. Number of Islands", "11. Graphs/207. Course Schedule", "11. Graphs/3651. Number of Connected Components in an Undirected Graph", "11. Graphs/417. Pacific Atlantic Water Flow", "11. Graphs/README", "12. Advanced Graphs/892. Alien Dictionary", "12. Advanced Graphs/README", "13. One-D Dynamic Programming/198. House Robber", "13. One-D Dynamic Programming/213. House Robber II", "13. One-D Dynamic Programming/70. Climbing Stairs", "13. One-D Dynamic Programming/README", "14. Two-D Dynamic Programming/README", "15. Greedy/README", "16. Intervals/README", "17. Math Geometry/README", "18. Bit Manipulation/README", "Book", "CODE_OF_CONDUCT", "CONTRIBUTING", "README", "SECURITY"], "filenames": ["01. Array Hashing/1. Two Sum.ipynb", "01. Array Hashing/128. Longest Consecutive Sequence.ipynb", "01. Array Hashing/217. Contains Duplicate.ipynb", "01. Array Hashing/238. Product of Array Except Self.ipynb", "01. Array Hashing/242. Valid Anagram.ipynb", "01. Array Hashing/347. Top K Frequent Elements.ipynb", "01. Array Hashing/49. Group Anagrams.ipynb", "01. Array Hashing/659. Encode and Decode Strings.ipynb", "01. Array Hashing/README.md", "02. Two Pointers/11. Container With Most Water.ipynb", "02. Two Pointers/125. Valid Palindrome.ipynb", "02. Two Pointers/15. 3Sum.ipynb", "02. Two Pointers/README.md", "03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb", "03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb", "03. Sliding Window/424. Longest Repeating Character Replacement.ipynb", "03. Sliding Window/76. Minimum Window Substring.ipynb", "03. Sliding Window/README.md", "04. Stack/20. Valid Parentheses.ipynb", "04. Stack/README.md", "05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb", "05. Binary Search/33. Search in Rotated Sorted Array.ipynb", "05. Binary Search/README.md", "06. Linked List/141. Linked List Cycle.ipynb", "06. Linked List/143. Reorder List.ipynb", "06. Linked List/19. Remove Nth Node From End of List.ipynb", "06. Linked List/206. Reverse Linked List.ipynb", "06. Linked List/21. Merge Two Sorted Lists.ipynb", "06. Linked List/23. Merge k Sorted Lists.ipynb", "06. Linked List/README.md", "07. Trees/100. Same Tree.ipynb", "07. Trees/102. Binary Tree Level Order Traversal.ipynb", "07. Trees/104. Maximum Depth of Binary Tree.ipynb", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb", "07. Trees/124. Binary Tree Maximum Path Sum.ipynb", "07. Trees/199. Binary Tree Right Side View.ipynb", "07. Trees/226. Invert Binary Tree.ipynb", "07. Trees/230. Kth Smallest Element in a BST.ipynb", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb", "07. Trees/297. Serialize and Deserialize Binary Tree.ipynb", "07. Trees/572. Subtree of Another Tree.ipynb", "07. Trees/98. Validate Binary Search Tree.ipynb", "07. Trees/README.md", "08. Tries/208. Implement Trie (Prefix Tree).ipynb", "08. Tries/211. Design Add and Search Words Data Structure.ipynb", "08. Tries/212. Word Search II.ipynb", "08. Tries/README.md", "09. Heap - Priority Queue/1046. Last Stone Weight.ipynb", "09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb", "09. Heap - Priority Queue/README.md", "10. Backtracking/39. Combination Sum.ipynb", "10. Backtracking/79. Word Search.ipynb", "10. Backtracking/README.md", "11. Graphs/133. Clone Graph.ipynb", "11. Graphs/178. Graph Valid Tree.ipynb", "11. Graphs/200. Number of Islands.ipynb", "11. Graphs/207. Course Schedule.ipynb", "11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb", "11. Graphs/417. Pacific Atlantic Water Flow.ipynb", "11. Graphs/README.md", "12. Advanced Graphs/892. Alien Dictionary.ipynb", "12. Advanced Graphs/README.md", "13. One-D Dynamic Programming/198. House Robber.ipynb", "13. One-D Dynamic Programming/213. House Robber II.ipynb", "13. One-D Dynamic Programming/70. Climbing Stairs.ipynb", "13. One-D Dynamic Programming/README.md", "14. Two-D Dynamic Programming/README.md", "15. Greedy/README.md", "16. Intervals/README.md", "17. Math Geometry/README.md", "18. Bit Manipulation/README.md", "Book.ipynb", "CODE_OF_CONDUCT.md", "CONTRIBUTING.md", "README.md", "SECURITY.md"], "titles": ["100: Same Tree", "128. Longest Consecutive Sequence", "217. Contains Duplicate", "238. Product of Array Except Self", "242. Valid Anagram", "347. Top K Frequent Elements", "49. Group Anagrams", "659\u00b7 Encode and Decode Strings", "Array &amp; Hashing Solutions - Blind 75 LeetCode Problems", "11. Container With Most Water", "125. Valid Palindrome", "15. 3Sum", "Two Pointers Problems - Blind 75 LeetCode", "121. Best Time to Buy and Sell Stock", "3. Longest Substring Without Repeating Characters", "424. Longest Repeating Character Replacement", "76. Minimum Window Substring", "Sliding Window Problems - Blind 75 LeetCode", "20. Valid Parentheses", "Stack Problems - Blind 75 LeetCode", "153. Find Minimum in Rotated Sorted Array", "33. Search in Rotated Sorted Array", "Binary search Problems - Blind 75 LeetCode", "141. Linked List Cycle", "143. Reorder List", "19. Remove Nth Node From End of List", "206. Reverse Linked List", "21. Merge Two Sorted Lists", "23. Merge k Sorted Lists", "Linked List Problems - Blind 75 LeetCode", "100: Same Tree", "102. Binary Tree Level Order Traversal", "104. Maximum Depth of Binary Tree", "105. Construct Binary Tree from Preorder and Inorder Traversal", "124. Binary Tree Maximum Path Sum", "199. Binary Tree Right Side View", "226: Invert Binary Tree", "230. Kth Smallest Element in a BST", "235. Lowest Common Ancestor of a Binary Search Tree", "297. Serialize and Deserialize Binary Tree", "572: Subtree of Another Tree", "98. Validate Binary Search Tree", "Trees Problems - Blind 75 LeetCode", "208. Implement Trie (Prefix Tree)", "211. Design Add and Search Words Data Structure", "212. Word Search II", "Trie Problems - Blind 75 LeetCode", "1046. Last Stone Weight", "295. Find Median from Data Stream", "703. Kth Largest Element in a Stream", "Heap / Priority Queue Problems - Blind 75 LeetCode", "39. Combination Sum", "79. Word Search", "Backtracking Problems - Blind 75 LeetCode", "133. Clone Graph", "178. Graph Valid Tree", "200. Number of Islands", "207. Course Schedule", "3651. Number of Connected Components in an Undirected Graph", "417. Pacific Atlantic Water Flow", "Graphs Problems - Blind 75 LeetCode", "892. Alien Dictionary", "Advanced Graphs Problems - Blind 75 LeetCode", "House Robber", "House Robber II", "70. Climbing Stairs", "1-D Dynamic Programming Problems - Blind 75 LeetCode", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "&lt;no title&gt;", "Contributor Covenant Code of Conduct", "Contributing Guidelines", "Blind 75 LeetCode Solutions", "Security Policy"], "terms": {"difficulti": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 75], "easi": [0, 2, 4, 8, 10, 12, 13, 17, 18, 19, 23, 26, 27, 29, 30, 32, 36, 40, 42, 47, 49, 50, 65, 66, 68, 69, 71, 75], "link": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "problem": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74], "To": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "see": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73], "leetcod": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 56, 57, 59, 63, 64, 65, 72, 74, 76], "click": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 74], "here": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75], "given": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "root": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 49, 72], "two": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 20, 21, 23, 24, 25, 26, 28, 29, 30, 31, 33, 34, 37, 38, 40, 43, 44, 47, 48, 49, 51, 52, 55, 57, 58, 59, 61, 63, 64, 65, 71, 72], "binari": [0, 20, 21, 30, 37, 40, 42, 56, 72], "p": [0, 10, 30, 38, 43, 72], "q": [0, 30, 38, 58], "write": [0, 1, 2, 3, 14, 15, 18, 20, 21, 26, 30, 31, 55, 58, 61], "function": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "check": [0, 1, 2, 4, 9, 10, 11, 13, 14, 15, 16, 18, 20, 23, 24, 25, 26, 27, 28, 30, 31, 33, 34, 35, 38, 40, 41, 43, 44, 45, 48, 49, 52, 54, 55, 56, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 72, 75], "thei": [0, 1, 4, 10, 15, 18, 21, 23, 24, 25, 26, 27, 30, 31, 33, 35, 40, 43, 45, 47, 48, 51, 55, 63, 64, 73, 76], "ar": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "consid": [0, 1, 4, 10, 11, 13, 14, 21, 30, 34, 37, 39, 40, 41, 48, 51, 52, 55, 57, 59, 61, 63, 64, 65, 73, 74], "structur": [0, 2, 9, 14, 21, 24, 27, 28, 30, 31, 32, 33, 34, 36, 38, 39, 40, 43, 45, 46, 48, 49, 54, 55, 58, 61, 64, 67, 68, 69, 70, 71, 74, 75], "ident": [0, 30, 39, 73], "node": [0, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 54, 55, 57, 58, 75], "have": [0, 1, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 29, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76], "valu": [0, 2, 5, 6, 11, 13, 14, 16, 18, 21, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 47, 48, 49, 51, 52, 54, 58, 59, 63, 65], "constraint": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 59, 61, 63, 64, 65], "The": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75], "number": [0, 1, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 57, 59, 60, 61, 63, 64, 65, 71, 72, 75], "both": [0, 4, 5, 7, 9, 11, 15, 23, 24, 25, 26, 27, 30, 34, 37, 38, 39, 40, 41, 44, 47, 48, 49, 54, 58, 59, 63, 64, 65], "rang": [0, 3, 4, 5, 11, 14, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 34, 35, 36, 38, 39, 40, 41, 45, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 65, 67, 68, 69, 70, 71, 75], "0": [0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73], "10": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 28, 30, 32, 34, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 59, 72], "4": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 58, 59, 63, 64, 72], "val": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 49, 54], "definit": [0, 23, 26, 28, 30, 32, 33, 36, 38, 39, 40, 54], "class": [0, 4, 6, 7, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65, 73], "treenod": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41], "def": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "__init__": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 54, 72], "self": [0, 7, 8, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65, 72, 75], "left": [0, 3, 4, 9, 10, 11, 15, 16, 18, 20, 21, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 52, 56, 59], "none": [0, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 48, 54, 72], "right": [0, 3, 9, 10, 11, 15, 16, 20, 21, 26, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 45, 52, 56, 59, 73], "initi": [0, 1, 3, 4, 6, 9, 10, 11, 13, 14, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 33, 34, 35, 37, 39, 41, 43, 44, 47, 48, 49, 51, 52, 54, 56, 57, 58, 59, 61, 63, 65], "child": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 43, 44, 45], "issametre": [0, 30, 40], "base": [0, 4, 5, 6, 14, 24, 26, 30, 32, 34, 36, 38, 41, 43, 44, 48, 49, 55, 61, 63, 64, 65, 72], "If": [0, 1, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "return": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "true": [0, 2, 4, 10, 18, 20, 23, 30, 40, 41, 43, 44, 45, 52, 55, 57, 58, 59, 72], "either": [0, 10, 16, 24, 26, 27, 30, 34, 37, 38, 40, 52, 55, 56, 59, 63, 64, 65], "differ": [0, 1, 4, 5, 6, 9, 13, 15, 18, 23, 24, 30, 34, 39, 40, 48, 51, 58, 61, 63, 64, 65, 73], "fals": [0, 2, 4, 10, 18, 23, 30, 40, 41, 43, 44, 45, 52, 55, 57, 58, 59, 72], "current": [0, 1, 3, 5, 6, 7, 9, 11, 13, 14, 15, 16, 20, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 48, 51, 52, 56, 58, 59, 63, 64, 72], "equal": [0, 1, 3, 4, 5, 10, 14, 15, 20, 21, 23, 27, 30, 34, 36, 37, 40, 41, 44, 47, 48, 51, 52, 55, 59], "recurs": [0, 26, 30, 32, 33, 34, 36, 38, 39, 40, 41, 44, 45, 51, 52, 54, 55, 56, 58, 59], "subtre": [0, 30, 32, 33, 34, 36, 37, 38, 39, 41, 42, 75], "entir": [0, 9, 18, 25, 30, 33, 37, 38, 40, 43, 45, 49, 54, 56, 59], "In": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 75], "thi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "code": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72], "we": [0, 1, 2, 6, 7, 9, 11, 13, 14, 15, 16, 18, 21, 24, 25, 27, 28, 30, 31, 32, 34, 35, 36, 37, 38, 40, 41, 44, 45, 47, 49, 51, 52, 54, 55, 57, 58, 59, 61, 65, 73, 74, 75, 76], "defin": [0, 1, 4, 7, 14, 18, 23, 25, 27, 28, 30, 31, 32, 34, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 64, 65], "repres": [0, 1, 5, 6, 9, 13, 14, 15, 16, 20, 21, 23, 24, 25, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "us": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73, 76], "travers": [0, 5, 9, 23, 24, 25, 26, 27, 30, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 54, 55, 56, 59, 75], "compar": [0, 1, 4, 10, 16, 18, 21, 27, 28, 30, 38, 40, 48, 49, 51, 55, 59, 61, 67, 68, 69, 70, 71, 75], "start": [0, 1, 5, 7, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 40, 41, 43, 44, 45, 47, 49, 51, 52, 54, 55, 56, 58, 59, 61], "which": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "each": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 75], "ha": [0, 2, 4, 5, 6, 9, 16, 18, 21, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 63, 64, 72, 76], "s": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "help": [0, 8, 11, 12, 14, 17, 18, 19, 20, 22, 27, 29, 30, 42, 46, 50, 51, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75, 76], "creat": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "work": [0, 18, 21, 23, 24, 25, 26, 28, 30, 32, 39, 40, 43, 44, 47, 48, 49, 51, 52, 58, 74, 76], "next": [0, 1, 2, 7, 10, 11, 13, 14, 23, 24, 25, 26, 27, 28, 30, 33, 34, 35, 44, 51, 56, 57, 63, 72], "when": [0, 10, 11, 14, 16, 20, 23, 24, 26, 30, 35, 36, 37, 40, 44, 45, 48, 49, 51, 52, 55, 56, 58, 67, 68, 69, 70, 71, 73, 74, 75], "so": [0, 1, 5, 6, 7, 10, 11, 13, 14, 16, 20, 21, 23, 24, 26, 28, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 44, 47, 48, 49, 51, 52, 54, 56, 57, 58, 59, 64, 72], "cannot": [0, 4, 13, 24, 30, 38, 51, 52, 55, 63, 64], "becaus": [0, 1, 2, 3, 4, 7, 9, 10, 11, 13, 14, 16, 18, 20, 23, 25, 26, 30, 31, 32, 33, 35, 36, 37, 38, 40, 43, 44, 48, 49, 51, 52, 54, 55, 59, 64, 65], "final": [0, 1, 3, 4, 6, 7, 9, 11, 13, 15, 16, 18, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 43, 44, 45, 47, 49, 51, 54, 55, 56, 59, 61, 63, 64, 65], "exampl": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "1": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 71, 72], "input": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 35, 36, 38, 39, 40, 41, 44, 45, 47, 48, 51, 54, 55, 56, 58, 59, 61, 63, 64, 65, 72], "2": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "3": [0, 1, 2, 3, 5, 6, 9, 10, 11, 13, 16, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 45, 48, 49, 51, 52, 54, 55, 56, 58, 59, 63, 64, 65, 72, 75], "p1": [0, 24, 30], "q1": [0, 30], "print": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "null": [0, 30, 31, 32, 34, 37, 39, 40], "p2": [0, 24, 30], "q2": [0, 30], "p3": [0, 30], "q3": [0, 30], "can": [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 26, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "analyz": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 61, 63, 64], "follow": [0, 3, 4, 5, 6, 15, 16, 23, 24, 25, 26, 30, 31, 32, 35, 37, 38, 39, 41, 43, 45, 47, 48, 49, 52, 54, 55, 57, 59, 61, 72, 73, 74, 75, 76], "worst": [0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 14, 16, 18, 20, 21, 23, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61], "need": [0, 9, 11, 14, 15, 16, 18, 21, 24, 25, 26, 27, 30, 34, 37, 39, 40, 43, 44, 45, 48, 49, 54, 55, 57, 58, 59, 61, 63, 64, 65, 72, 74, 76], "visit": [0, 1, 26, 30, 31, 32, 35, 36, 37, 39, 40, 41, 45, 52, 54, 55, 56, 58, 59], "everi": [0, 2, 16, 18, 30, 32, 40, 41, 56, 58], "onc": [0, 1, 2, 4, 5, 6, 7, 9, 10, 13, 14, 15, 18, 24, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 44, 45, 52, 54, 55, 56, 57, 59, 63, 64, 65, 72, 74, 76], "determin": [0, 1, 2, 4, 10, 15, 16, 18, 21, 23, 24, 30, 31, 33, 34, 35, 36, 39, 40, 41, 43, 45, 47, 49, 51, 52, 55, 56, 57, 58, 59, 61, 63, 64, 73], "sinc": [0, 2, 3, 4, 16, 21, 30, 31, 35, 37, 41, 52, 55, 58, 64], "exactli": [0, 1, 2, 4, 5, 6, 13, 14, 26, 30, 31, 32, 34, 35, 36, 39, 55, 56, 65], "o": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "n": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 45, 47, 48, 49, 51, 52, 54, 55, 56, 58, 59, 61, 63, 64, 65], "where": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "total": [0, 5, 9, 11, 23, 24, 27, 28, 30, 31, 33, 40, 43, 44, 48, 49, 52, 56, 57, 58, 61, 63, 64, 65], "call": [0, 1, 2, 4, 5, 6, 7, 14, 23, 26, 28, 30, 31, 32, 33, 34, 35, 36, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64, 72], "stack": [0, 18, 26, 30, 32, 33, 34, 36, 37, 38, 39, 40, 41, 44, 45, 51, 52, 54, 55, 56, 58, 59, 72], "dure": [0, 10, 24, 30, 31, 33, 34, 36, 39, 40, 41, 44, 45, 49, 54, 55, 59, 61, 72, 73], "proport": [0, 23, 24, 26, 27, 28, 30, 31, 39, 40, 44, 65], "maximum": [0, 1, 4, 5, 6, 9, 13, 14, 15, 16, 20, 30, 31, 35, 40, 41, 42, 44, 45, 48, 51, 56, 58, 59, 61, 63, 64, 66, 68, 75], "depth": [0, 30, 34, 36, 38, 39, 40, 41, 42, 44, 45, 51, 52, 54, 55, 56, 58, 59, 75], "complet": [0, 2, 10, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 38, 39, 41, 43, 44, 45, 47, 51, 52, 55, 57], "unbalanc": [0, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41], "all": [0, 1, 2, 3, 4, 6, 9, 10, 11, 13, 14, 16, 18, 20, 21, 24, 25, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 43, 44, 45, 47, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64, 73, 74, 75], "form": [0, 4, 6, 9, 24, 25, 26, 27, 30, 45, 51, 52, 55, 56, 57, 61], "singl": [0, 2, 6, 7, 13, 14, 15, 18, 20, 25, 26, 28, 30, 32, 34, 37, 45, 58, 65, 73], "branch": [0, 30, 32, 44, 51, 74], "therefor": [0, 1, 2, 3, 4, 5, 9, 10, 13, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 39, 41, 43, 45, 47, 49, 51, 52, 54, 56, 63, 64, 65], "due": [0, 1, 6, 11, 14, 18, 24, 26, 28, 30, 33, 37, 39, 40, 41, 43, 47, 51, 52, 55, 61], "addit": [0, 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 32, 33, 38, 42, 43, 46, 48, 50, 52, 53, 55, 56, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 75, 76], "small": [0, 30, 32, 52, 59], "constant": [0, 1, 4, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 32, 34, 35, 38, 39, 47, 48, 49, 63, 64, 65], "amount": [0, 9, 11, 13, 15, 16, 20, 21, 25, 26, 27, 28, 30, 32, 34, 38, 39, 51, 52, 63, 64], "variabl": [0, 1, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 20, 21, 23, 24, 25, 27, 28, 30, 32, 34, 35, 38, 47, 49, 51, 52, 56, 58, 63, 64, 65], "comparison": [0, 4, 10, 11, 13, 14, 27, 28, 30, 39, 61], "within": [0, 1, 3, 6, 10, 13, 14, 15, 16, 21, 24, 30, 34, 37, 39, 40, 41, 45, 47, 48, 51, 54, 58, 73, 76], "signific": [0, 16, 30, 34, 40], "term": [0, 5, 18, 24, 26, 30, 31, 33, 37, 47, 56, 65, 67, 68, 69, 70, 71, 73, 75], "overal": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 14, 16, 18, 21, 24, 25, 28, 30, 31, 33, 34, 35, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73], "summari": [0, 2, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 38, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 58, 61, 63, 64, 65], "medium": [1, 3, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 20, 21, 22, 24, 25, 29, 31, 33, 35, 37, 38, 41, 42, 43, 44, 46, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 63, 64, 66, 67, 68, 69, 70, 71, 75], "an": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "unsort": 1, "arrai": [1, 2, 5, 6, 9, 11, 13, 16, 22, 28, 33, 47, 48, 49, 51, 57, 58, 63, 64, 65, 72], "integ": [1, 2, 3, 5, 9, 11, 14, 15, 18, 20, 21, 23, 33, 37, 39, 47, 48, 49, 51, 54, 59, 63, 64, 65, 71, 75], "num": [1, 2, 3, 5, 11, 20, 21, 48, 49, 63, 64], "length": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 25, 27, 28, 31, 32, 33, 35, 39, 43, 44, 45, 47, 49, 51, 52, 56, 57, 59, 61, 63, 64, 65], "element": [1, 2, 3, 6, 8, 9, 11, 18, 20, 21, 24, 25, 26, 27, 28, 33, 39, 42, 48, 50, 51, 57, 58, 59, 72, 75], "you": [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76], "must": [1, 3, 5, 11, 13, 16, 18, 20, 21, 38, 41, 45, 54, 55, 57], "algorithm": [1, 3, 5, 7, 9, 11, 14, 15, 16, 20, 21, 23, 24, 34, 38, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 75], "run": [1, 3, 9, 10, 11, 14, 15, 16, 20, 27, 38, 47, 63, 72], "5": [1, 2, 3, 4, 5, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 35, 37, 38, 39, 40, 41, 48, 49, 51, 55, 58, 59, 63, 66, 72, 75, 76], "9": [1, 2, 3, 9, 31, 32, 33, 34, 36, 38, 49, 63, 72], "i": [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 16, 18, 20, 21, 23, 25, 26, 28, 31, 33, 34, 35, 37, 39, 43, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "python": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 18, 24, 26, 27, 28, 31, 33, 34, 35, 36, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "solv": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 20, 23, 31, 33, 34, 35, 37, 38, 39, 41, 45, 48, 49, 52, 54, 55, 59, 61, 63, 64, 67, 68, 69, 70, 71, 75], "longestconsecut": 1, "num_set": 1, "set": [1, 2, 5, 11, 14, 16, 20, 21, 23, 24, 26, 38, 39, 43, 44, 45, 47, 51, 52, 54, 55, 57, 63, 70, 72, 73, 75], "max_length": [1, 14, 15], "current_num": 1, "current_length": [1, 14], "while": [1, 2, 5, 7, 9, 10, 11, 13, 16, 20, 21, 23, 24, 25, 26, 27, 28, 31, 33, 34, 35, 37, 38, 39, 41, 47, 49, 52, 54, 57, 59, 61, 63], "max": [1, 9, 13, 14, 15, 16, 32, 34, 40, 47, 48, 56, 63, 64], "take": [1, 2, 4, 5, 7, 10, 11, 13, 14, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 73, 74, 75, 76], "empti": [1, 2, 5, 6, 11, 13, 16, 18, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 39, 44, 45, 47, 48, 49, 51, 54, 56, 57, 58, 59, 61], "insert": [1, 25, 37, 43, 45, 69, 75], "from": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 18, 20, 24, 26, 27, 28, 29, 31, 32, 34, 35, 37, 39, 42, 43, 44, 45, 47, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72, 73, 74, 75], "allow": [1, 2, 7, 13, 15, 16, 23, 24, 27, 38, 39, 40, 41, 44, 47, 48, 49, 56, 59, 63, 64, 73], "effici": [1, 2, 3, 4, 5, 6, 7, 9, 11, 14, 15, 20, 23, 25, 26, 27, 28, 31, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 55, 56, 57, 59, 63, 64], "exist": [1, 2, 18, 27, 31, 33, 35, 37, 38, 40, 43, 44, 52, 56, 61, 74], "keep": [1, 2, 3, 10, 13, 14, 15, 16, 18, 20, 27, 28, 34, 35, 36, 37, 39, 40, 43, 47, 51, 54, 55, 56, 57, 58, 59, 61, 63], "track": [1, 2, 3, 13, 14, 15, 16, 18, 20, 27, 28, 34, 35, 37, 39, 43, 47, 49, 51, 54, 55, 56, 57, 58, 59, 61, 63], "found": [1, 11, 14, 16, 33, 34, 37, 40, 43, 44, 45, 47, 51, 52, 56, 58, 72, 76], "iter": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 23, 24, 25, 26, 27, 28, 31, 33, 35, 36, 37, 43, 44, 45, 47, 49, 51, 52, 54, 56, 57, 58, 59, 61, 63, 64, 65], "through": [1, 2, 3, 4, 5, 6, 7, 10, 11, 13, 14, 15, 16, 18, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 43, 44, 45, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 73], "For": [1, 2, 3, 4, 5, 6, 10, 14, 16, 18, 20, 21, 24, 26, 27, 31, 34, 35, 36, 40, 41, 44, 45, 51, 52, 54, 57, 58, 61, 63, 65, 72, 73], "doesn": [1, 24, 28, 40, 44, 48, 51, 52, 54, 56], "t": [1, 4, 9, 10, 13, 16, 21, 23, 24, 28, 37, 38, 39, 40, 43, 44, 45, 48, 51, 52, 54, 56, 58, 72], "mean": [1, 2, 4, 6, 9, 10, 11, 14, 15, 16, 18, 20, 21, 23, 26, 27, 32, 33, 35, 37, 38, 39, 48, 51, 52, 54, 55, 56, 57, 58, 59, 61, 64], "potenti": [1, 11, 18, 37, 43], "insid": [1, 2, 4, 6, 9, 10, 11, 14, 15, 16, 18, 20, 21, 23, 24, 26, 27, 28, 31, 34, 35, 38, 41, 45, 47, 51, 52, 54, 58, 63], "loop": [1, 2, 3, 4, 5, 6, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 38, 45, 47, 51, 52, 54, 55, 56, 57, 58, 61, 63, 65, 72], "itself": [1, 3, 7, 20, 26, 38, 40], "part": [1, 21, 41, 44, 58, 63], "enter": [1, 4, 11, 20, 23, 26, 27, 31, 35, 37, 47, 51], "continu": [1, 2, 9, 10, 11, 14, 16, 18, 20, 21, 23, 25, 26, 27, 28, 31, 33, 34, 35, 37, 43, 45, 47, 57, 61, 73], "long": [1, 47], "increment": [1, 4, 5, 6, 10, 11, 16, 48, 56, 57, 58, 65], "also": [1, 2, 3, 5, 6, 7, 9, 10, 13, 16, 18, 21, 24, 25, 26, 31, 33, 34, 35, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 57, 58, 59, 61, 72, 73], "account": [1, 14, 44, 73, 74], "updat": [1, 3, 4, 7, 9, 13, 14, 15, 16, 20, 21, 24, 25, 26, 27, 28, 34, 41, 47, 49, 51, 57, 58, 61, 63, 64, 72], "longer": [1, 4, 9], "after": [1, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 21, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 39, 43, 44, 45, 47, 51, 52, 55, 57, 58, 59, 61], "move": [1, 9, 10, 11, 15, 16, 23, 24, 25, 26, 27, 37, 38, 43, 44, 48, 51, 52, 56], "outer": [1, 11, 52], "repeat": [1, 2, 17, 20, 24, 54, 56, 72, 75], "process": [1, 2, 6, 7, 9, 11, 18, 20, 21, 24, 26, 27, 28, 31, 33, 35, 36, 37, 39, 43, 44, 48, 51, 54, 56, 57, 58, 59, 61], "result": [1, 3, 4, 5, 6, 7, 9, 10, 11, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 40, 44, 45, 47, 48, 51, 52, 54, 59, 61, 63, 64, 65, 72], "kei": [1, 5, 6, 16, 18, 37, 39, 41, 43, 44, 54, 56, 59, 61, 63, 72, 76], "idea": [1, 37, 63, 74], "By": [1, 7, 15, 34, 37, 49, 74, 75], "do": [1, 4, 10, 13, 15, 16, 18, 21, 23, 24, 25, 27, 34, 35, 37, 39, 47, 48, 51, 55, 56, 63, 65, 74, 76], "find": [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 29, 33, 34, 35, 37, 38, 42, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75], "nums1": [1, 2, 20, 21, 63, 64], "100": [1, 6, 25, 27, 32, 35, 36, 42, 48, 54, 63, 64, 72, 75], "200": [1, 59, 60, 72, 75], "nums2": [1, 2, 20, 21, 63, 64], "7": [1, 9, 13, 20, 21, 31, 32, 33, 34, 36, 38, 47, 51, 59, 63, 72], "8": [1, 3, 9, 38, 47, 49, 51, 72], "6": [1, 3, 9, 13, 20, 21, 26, 28, 34, 36, 37, 38, 41, 51, 52, 58, 59, 72], "let": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 61, 63, 64], "provid": [1, 2, 3, 4, 5, 7, 13, 14, 15, 18, 20, 21, 26, 28, 32, 36, 38, 39, 40, 43, 44, 45, 47, 48, 49, 54, 55, 56, 58, 59, 61, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "design": [1, 7, 23, 24, 39, 46, 49, 54, 56, 57, 61, 63, 72, 75], "breakdown": [1, 48, 59], "construct": [1, 3, 31, 35, 38, 42, 45, 52, 55, 57, 61, 73, 75], "perform": [1, 2, 4, 6, 13, 14, 15, 16, 18, 21, 25, 27, 28, 31, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 52, 54, 56, 57, 58, 59, 61, 63, 65], "oper": [1, 2, 3, 6, 7, 11, 13, 14, 15, 16, 18, 27, 28, 34, 35, 37, 39, 43, 44, 47, 48, 49, 63, 65], "main": [1, 9, 16, 32, 33, 38, 43, 45, 49, 51, 56, 58, 61, 64, 72, 74], "onli": [1, 5, 9, 10, 11, 13, 15, 18, 23, 24, 26, 28, 34, 35, 38, 40, 41, 43, 47, 49, 52, 54, 55, 56, 59, 63, 64, 65], "mai": [1, 5, 7, 9, 11, 15, 16, 20, 23, 24, 40, 41, 43, 44, 45, 49, 51, 52, 55, 56, 57, 58, 61, 72, 73, 74, 76], "howev": [1, 23, 28, 38, 40, 43, 44, 51, 52, 56, 61, 64], "nest": [1, 11, 45, 51, 52, 56, 72], "its": [1, 3, 5, 6, 7, 14, 16, 18, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 43, 45, 47, 48, 49, 54, 55, 56, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 75], "remain": [1, 2, 23, 25, 26, 27, 28, 44, 47, 48, 51, 57], "few": [1, 4, 13, 14, 16, 27, 28, 51, 64], "store": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 24, 25, 26, 27, 28, 31, 32, 33, 35, 37, 39, 43, 44, 45, 48, 49, 51, 54, 55, 57, 59, 61, 63, 65], "uniqu": [1, 2, 4, 5, 11, 14, 16, 20, 21, 33, 34, 38, 41, 45, 51, 52, 54, 55, 57, 61, 67, 75], "requir": [1, 2, 3, 4, 9, 10, 11, 16, 28, 35, 43, 44, 45, 47, 48, 49, 51, 54, 57, 65, 72], "depend": [1, 4, 6, 9, 10, 11, 13, 15, 16, 20, 21, 23, 25, 27, 28, 32, 33, 34, 35, 36, 37, 40, 41, 44, 45, 48, 54, 55, 57, 61, 63], "size": [1, 2, 4, 5, 6, 9, 10, 11, 13, 15, 16, 20, 21, 23, 24, 25, 26, 27, 28, 35, 38, 40, 45, 48, 49, 56, 58, 59, 61, 63, 64, 65, 73], "actual": [1, 16, 27, 41, 43, 47, 48, 51, 54, 55, 61, 76], "extend": [1, 5, 13, 15, 27, 33, 34, 35, 38, 44, 45, 48, 61, 63], "certain": [1, 47, 51, 63, 64], "absolut": 1, "e": [1, 5, 16, 18, 21, 23, 25, 26, 31, 33, 34, 37, 39, 43, 45, 47, 48, 51, 52, 54, 55, 57, 58, 61, 65, 72, 73], "g": [1, 5, 21, 25, 33, 45, 47, 54, 55, 65], "less": [1, 9, 10, 11, 15, 20, 21, 38, 40, 41, 43, 45, 47, 48, 51, 59], "than": [1, 2, 5, 9, 10, 11, 13, 15, 16, 20, 21, 27, 34, 37, 38, 40, 41, 43, 45, 47, 48, 51, 52, 54, 57, 59, 65], "k": [1, 2, 6, 8, 11, 13, 14, 15, 21, 24, 26, 27, 29, 37, 38, 45, 47, 49, 52, 63, 72, 75], "instead": [1, 5, 9, 11, 16, 21, 27, 28, 34, 35, 37, 47, 49, 51, 52, 61, 65, 72], "ani": [2, 3, 5, 6, 7, 9, 10, 13, 15, 16, 18, 21, 23, 24, 27, 28, 31, 33, 34, 39, 40, 41, 43, 44, 45, 48, 49, 51, 52, 55, 57, 58, 59, 72, 73, 74, 76], "appear": [2, 24, 25, 27, 33, 34, 55, 61, 73], "least": [2, 48, 49, 51, 58], "twice": [2, 64], "distinct": [2, 6, 14, 16, 21, 49, 51, 56, 58, 65], "containsdupl": 2, "unique_el": 2, "alreadi": [2, 4, 14, 43, 55, 72], "otherwis": [2, 4, 10, 18, 21, 23, 39, 40, 41, 43, 44, 45, 48, 51, 52, 55, 57, 61, 73], "add": [2, 8, 12, 14, 16, 17, 19, 22, 29, 33, 34, 35, 39, 42, 43, 45, 46, 47, 48, 49, 50, 51, 53, 55, 57, 58, 60, 61, 62, 66, 67, 68, 69, 70, 71, 74, 75], "els": [2, 9, 11, 18, 20, 21, 27, 28, 33, 38, 47, 48, 54], "without": [2, 3, 5, 10, 16, 17, 21, 23, 24, 25, 38, 45, 51, 52, 56, 63, 64, 72, 73, 75], "argument": [2, 5, 13, 14, 18, 21, 23, 32, 34, 36, 38, 40, 51, 52, 58], "whether": [2, 4, 15, 40, 41, 43, 44, 52, 55, 56, 57, 58, 61], "condit": [2, 11, 15, 20, 24, 38, 41, 51, 52, 55, 56, 59, 61], "immedi": [2, 4, 43, 55], "ad": [2, 5, 7, 27, 32, 35, 44, 45, 48, 49, 54, 57, 58, 59, 61, 63, 65, 72], "util": [2, 45, 63, 72], "data": [2, 9, 14, 21, 24, 27, 28, 31, 33, 36, 38, 39, 43, 45, 46, 49, 50, 54, 55, 58, 61, 64, 67, 68, 69, 70, 71, 72, 75, 76], "quickli": [2, 49], "detect": [2, 23, 40, 55, 57, 61], "meet": [2, 11, 49, 69, 75], "explain": [2, 24, 25, 26, 27, 43, 44], "earlier": [2, 44, 65], "nums3": [2, 20, 21, 64], "primari": [2, 14, 52], "affect": [2, 6, 44, 48, 72, 73], "averag": [2, 7, 41, 45, 48], "grow": [2, 20, 48], "linearli": [2, 11, 35], "modifi": [2, 3, 5, 7, 9, 11, 13, 14, 15, 18, 20, 24, 25, 26, 31, 33, 34, 35, 37, 39, 41, 45, 47, 49, 51, 52, 54, 55, 56, 57, 59, 61, 63, 64], "paramet": [2, 23, 26, 37, 49, 52, 57], "frequenc": [2, 4, 5, 51], "count": [2, 3, 4, 5, 6, 11, 15, 16, 32, 34, 43, 51, 56, 57, 58, 65, 71, 75], "list": [2, 3, 4, 5, 6, 7, 10, 11, 13, 18, 20, 31, 33, 35, 36, 37, 38, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 72, 74], "more": [2, 7, 8, 12, 17, 19, 22, 25, 26, 29, 38, 39, 41, 42, 45, 46, 47, 48, 50, 52, 53, 56, 57, 58, 60, 61, 62, 66, 67, 68, 69, 70, 71, 72, 74, 75], "along": [2, 32, 63, 64], "answer": [3, 5, 6, 14, 16, 47, 48, 73], "prefix": [3, 44, 45, 46, 61, 75], "suffix": 3, "guarante": [3, 5, 33, 49], "fit": 3, "32": [3, 72], "bit": [3, 39], "divis": [3, 20, 21], "30": [3, 25, 47, 51, 72], "up": [3, 4, 5, 11, 16, 23, 24, 25, 26, 33, 35, 37, 39, 45, 47, 48, 51, 52, 54, 55, 56, 58, 63, 76], "extra": [3, 9, 16, 23, 25, 26, 27, 38, 40, 63, 72], "output": [3, 5, 9, 11, 25, 26, 28, 31, 35, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 72], "doe": [3, 6, 9, 10, 11, 13, 15, 18, 20, 21, 25, 27, 28, 34, 38, 43, 44, 45, 48, 49, 52, 55, 57, 58, 59], "productexceptself": 3, "len": [3, 4, 5, 7, 9, 10, 11, 14, 15, 16, 18, 20, 21, 28, 31, 35, 45, 47, 48, 49, 51, 52, 54, 55, 56, 59, 61, 64], "left_product": 3, "right_product": 3, "calcul": [3, 9, 11, 13, 14, 16, 20, 21, 32, 34, 47, 48, 57, 58, 63, 64, 65], "fill": [3, 9, 65], "ones": [3, 49], "A": [3, 10, 23, 26, 32, 33, 34, 38, 39, 40, 41, 43, 45, 51, 52, 55, 57, 58, 72, 73, 74, 76], "index": [3, 11, 14, 15, 20, 21, 23, 24, 33, 37, 39, 51, 52, 54, 72], "includ": [3, 10, 15, 16, 26, 34, 39, 44, 45, 49, 51, 54, 56, 61, 63, 72, 73, 74, 76], "accordingli": [3, 57, 61], "anoth": [3, 11, 37, 39, 42, 57, 58, 61, 65, 72, 75], "revers": [3, 5, 24, 29, 31, 39, 45, 71, 75], "order": [3, 5, 6, 11, 18, 20, 21, 24, 25, 26, 27, 28, 33, 34, 35, 37, 39, 42, 45, 48, 49, 51, 61, 75], "multipli": 3, "correspond": [3, 5, 6, 18, 33, 43, 45, 51, 54, 59], "contain": [3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 18, 20, 21, 24, 25, 26, 27, 28, 31, 33, 34, 35, 38, 39, 40, 41, 44, 47, 48, 51, 54, 57, 58, 59, 61, 64, 67, 68, 69, 70, 71, 72, 75], "desir": [3, 37, 76], "comput": [3, 39, 48, 64], "It": [3, 5, 6, 9, 10, 11, 13, 14, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 36, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "result1": [3, 5, 6, 9, 21, 28, 56], "24": [3, 72], "12": [3, 9, 45, 63, 72], "result2": [3, 5, 6, 9, 21, 28, 56], "first": [3, 4, 5, 6, 13, 23, 24, 25, 26, 27, 31, 32, 33, 34, 35, 36, 37, 39, 41, 44, 45, 49, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "second": [3, 5, 24, 25, 37, 41, 47, 54, 65, 72], "independ": [3, 25, 27, 48, 63], "sequenti": [3, 21, 45, 52], "consum": [3, 10, 14, 15, 27, 38, 52, 55], "respect": [3, 4, 16, 24, 26, 27, 32, 40, 44, 51, 52, 57, 63, 65, 67, 68, 69, 70, 71, 73, 75], "These": [3, 4, 15, 16, 21, 23, 24, 25, 26, 27, 35, 48, 55, 61, 64, 67, 68, 69, 70, 71, 75], "occupi": [3, 24, 28, 65], "toward": [3, 10, 11, 73], "per": [3, 5, 51], "handl": [3, 5, 7, 11, 15, 24, 25, 33, 36, 41, 47, 49, 54, 61, 64, 72], "zero": [3, 11, 14, 26, 51, 56, 70, 75], "should": [3, 5, 7, 10, 20, 21, 23, 26, 27, 31, 39, 41, 43, 44, 47, 48, 52, 54, 55, 56, 57, 61, 65], "place": [3, 5, 24, 26, 52, 64], "modif": [3, 11], "attempt": [3, 16, 76], "directli": [3, 43, 59, 65, 72], "string": [4, 6, 8, 10, 14, 15, 16, 18, 39, 43, 44, 45, 52, 61, 72, 75], "word": [4, 6, 43, 46, 53, 57, 58, 59, 61, 66, 75], "phrase": [4, 6, 10], "rearrang": [4, 6, 27], "letter": [4, 6, 10, 14, 15, 16, 43, 44, 45, 52, 61], "typic": [4, 6, 36, 37, 41, 51, 54, 55], "origin": [4, 6, 7, 10, 20, 24, 26, 39, 45, 51, 52, 54, 55, 57, 74], "consist": [4, 6, 10, 14, 15, 16, 18, 33, 40, 43, 44, 45, 52, 56, 58, 61, 72, 74], "lowercas": [4, 6, 10, 15, 16, 43, 44, 45, 52, 61], "english": [4, 6, 14, 15, 16, 43, 44, 45, 52, 72], "what": [4, 73, 76], "unicod": 4, "charact": [4, 6, 7, 10, 16, 17, 18, 39, 43, 44, 45, 52, 61, 72, 75], "how": [4, 16, 18, 20, 23, 24, 26, 28, 31, 32, 34, 36, 37, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74, 76], "would": [4, 13, 14, 20, 24, 34, 37, 41, 48, 49, 56, 57], "adapt": [4, 20, 21, 41, 73], "your": [4, 5, 13, 21, 33, 39, 47, 48, 52, 55, 58, 63, 67, 68, 69, 70, 71, 72, 74, 75, 76], "isanagram": 4, "str": [4, 6, 7, 39, 44, 52, 56], "bool": [4, 23, 44, 52, 57], "dictionari": [4, 5, 6, 14, 15, 16, 18, 43, 44, 45, 54, 62, 75], "countt": 4, "get": [4, 5, 15, 16, 31, 35, 45, 47, 54, 56], "same": [4, 5, 6, 7, 10, 11, 15, 18, 25, 26, 31, 33, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 48, 51, 52, 54, 55, 58, 61, 63, 64, 75], "method": [4, 5, 6, 7, 18, 23, 28, 34, 39, 40, 43, 44, 48, 49, 52, 54, 56, 57, 59, 63, 64, 65], "boolean": [4, 43, 52, 58, 59], "other": [4, 6, 10, 11, 15, 16, 21, 24, 35, 38, 40, 45, 51, 54, 55, 56, 57, 58, 59, 73], "occurr": [4, 6, 7, 14, 16, 51], "line": [4, 5, 9, 13, 33, 52, 72], "similarli": 4, "wai": [4, 9, 14, 16, 26, 39, 57, 61, 65, 66, 73, 75], "indic": [4, 7, 9, 10, 14, 20, 21, 23, 25, 26, 31, 33, 37, 41, 43, 44, 47, 52, 55, 56, 57, 58, 72], "match": [4, 10, 16, 18, 23, 38, 40, 44, 45, 52, 54], "nagaram": 4, "rat": 4, "car": [4, 10], "scenario": [4, 13, 33, 36, 37, 43, 48, 51, 55, 59, 63, 64, 65], "linear": [4, 13, 14, 15, 26, 27, 32, 39, 44, 56, 63, 64, 65], "simpli": [4, 14, 18, 48], "bookkeep": 4, "significantli": [4, 6, 24, 47, 48, 52, 65], "impact": [4, 16, 24, 73], "chain": 4, "longest": [4, 8, 10, 17, 32, 45, 66, 67, 72, 75], "previou": [4, 5, 11, 25, 63, 64, 65], "bat": [4, 6], "tab": [4, 6], "cat": 4, "tac": [4, 6], "dog": [4, 6], "minimum": [4, 9, 13, 17, 21, 22, 48, 55, 65, 72, 75], "delet": [4, 37, 44], "make": [4, 9, 13, 23, 25, 26, 27, 34, 35, 38, 45, 48, 49, 52, 55, 59, 65, 73, 74], "them": [4, 6, 10, 11, 16, 18, 25, 26, 28, 34, 35, 36, 40, 47, 48, 49, 52, 55, 56, 57, 58, 61, 63], "hello": 4, "billion": 4, "remov": [4, 10, 15, 16, 29, 31, 33, 44, 47, 49, 57, 61, 72, 73, 75], "heo": 4, "billi": 4, "lo": 4, "most": [5, 12, 13, 15, 18, 34, 37, 39, 43, 44, 45, 47, 48, 49, 52, 55, 57, 59, 63, 72, 75], "better": [5, 8, 12, 17, 19, 22, 29, 34, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 74, 75], "log": [5, 11, 20, 21, 28, 31, 32, 34, 36, 37, 38, 41, 47, 48, 49, 72], "topkfrequ": 5, "freq": 5, "accord": [5, 24, 38, 61], "c": [5, 6, 10, 33, 35, 45, 52, 59, 72], "item": 5, "append": [5, 6, 7, 11, 18, 23, 24, 25, 26, 27, 28, 31, 33, 35, 37, 39, 49, 51, 54, 55, 57, 58, 59, 61], "re": [5, 49], "end": [5, 7, 9, 10, 11, 14, 15, 16, 20, 21, 23, 24, 26, 27, 28, 29, 32, 34, 43, 44, 45, 47, 58, 63, 75], "higher": [5, 13, 52], "similar": [5, 7, 27, 33, 43], "one": [5, 7, 9, 10, 13, 15, 21, 23, 24, 25, 26, 27, 28, 36, 37, 38, 39, 40, 47, 48, 51, 52, 54, 56, 58, 61, 63, 64, 65], "greater": [5, 9, 10, 11, 13, 15, 20, 21, 34, 37, 38, 40, 41, 48, 65], "retriev": [5, 43, 47, 48], "default": [5, 6, 61, 72], "abov": [5, 15, 24, 38, 44, 55, 59, 65, 72], "pair": [5, 9, 16, 18, 28, 34, 55, 57, 58, 61], "bucket": 5, "group": [5, 8, 26, 56, 58, 72, 75], "highest": 5, "go": [5, 21, 23, 32, 33, 58, 59, 74], "down": [5, 24, 26, 31, 32, 33, 38, 40, 45, 52, 56, 65], "note": [5, 11, 23, 34, 44, 49, 56, 72, 74], "typo": 5, "exit": [5, 20, 21, 27, 72], "sort": [5, 11, 22, 29, 37, 49, 51, 57, 61, 72, 73, 75], "being": [5, 16, 21, 34, 40, 43, 44, 65], "name": [5, 8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 59, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "third": 5, "domin": [5, 10, 11, 16, 21, 24, 27, 31, 35, 39, 41, 45, 47, 51, 52, 59, 61], "factor": [5, 11, 16, 21, 27, 31, 35, 39, 44, 51], "105": [5, 42, 75], "optim": [5, 7, 9, 15, 16, 31, 37, 39, 43, 45, 48, 51, 52, 56, 57, 59, 63, 64], "ensur": [5, 7, 9, 10, 11, 14, 15, 25, 33, 34, 35, 38, 39, 41, 44, 45, 48, 49, 52, 54, 55, 59, 61, 74], "klogk": 5, "prioriti": [5, 47, 48], "queue": [5, 31, 33, 35, 36, 38, 47, 48, 57, 61], "heap": [5, 28, 47, 48, 49], "achiev": [5, 7, 13, 15, 26, 36, 51, 54, 63], "duplic": [5, 8, 11, 16, 20, 33, 41, 45, 51, 54, 55, 72, 75], "multipl": [5, 6, 7, 13, 24, 38, 41, 44, 47, 58, 61], "among": [5, 34, 43, 45, 61], "togeth": [6, 7, 9, 25, 26, 27, 35, 47, 55, 61, 74], "collect": [6, 8, 12, 17, 19, 22, 29, 31, 42, 45, 46, 47, 50, 52, 53, 54, 57, 60, 61, 62, 66, 67, 68, 69, 70, 71, 75], "import": [6, 11, 35, 40, 47, 48, 49, 52, 56, 57, 59, 61, 63, 64, 72], "defaultdict": [6, 57, 61], "groupanagram": 6, "z": [6, 61], "26": [6, 44, 72], "ord": 6, "tupl": 6, "convert": [6, 10, 24, 25, 26, 27, 33, 39, 45, 47], "associ": [6, 23, 26, 58], "step": [6, 10, 11, 14, 16, 20, 23, 24, 26, 27, 28, 31, 32, 33, 35, 38, 39, 43, 44, 45, 47, 49, 51, 54, 56, 59, 61, 65, 76], "specif": [6, 24, 39, 43, 44, 45, 47, 52, 55, 57, 61, 65, 67, 68, 69, 70, 71, 72, 75], "ascii": [6, 10], "under": [6, 63], "constructor": [6, 43, 44], "inner": [6, 52, 72], "strs1": 6, "eat": [6, 45], "tea": 6, "tan": 6, "ate": 6, "nat": 6, "strs2": 6, "strs3": 6, "result3": [6, 9, 21, 28], "instanc": [6, 7, 33, 40, 49, 52, 54, 56, 64, 73], "done": [6, 7, 10, 11, 24, 31, 34, 51, 52, 61, 72], "belong": [6, 58], "fix": [6, 13, 20, 27, 74, 76], "effect": [6, 15, 20, 23, 24, 26, 28, 31, 33, 34, 35, 36, 40, 43, 45], "palindrom": [6, 12, 66, 72, 75], "act": [6, 73], "largest": [6, 28, 37, 48, 50, 56, 58], "lintcod": [7, 55, 58, 61], "sent": 7, "over": [7, 16, 25, 39, 48, 49, 51], "network": [7, 39], "back": [7, 25, 26, 39, 47], "pleas": [7, 39, 67, 68, 69, 70, 71, 72, 74, 75, 76], "implement": [7, 11, 20, 26, 33, 34, 36, 39, 44, 45, 46, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 74, 75], "codec": [7, 39], "type": [7, 18, 49, 52, 55, 56, 57, 59, 63, 64, 72], "rtype": 7, "replac": [7, 17, 28, 52, 72, 75], "encapsul": [7, 52, 56], "involv": [7, 24, 25, 27, 34, 37, 43, 47, 48, 52, 55, 56, 59, 61, 63, 73, 76], "concaten": [7, 45], "delimit": 7, "avoid": [7, 11, 18, 26, 40, 45, 51, 54, 55, 61, 63, 64, 73], "conflict": 7, "split": [7, 24, 39], "begin": [7, 9, 10, 14, 15, 20, 23, 24, 25, 27], "repeatedli": [7, 28, 37, 61], "extract": [7, 33], "substr": [7, 10, 15, 17, 66, 72, 75], "between": [7, 9, 15, 20, 26, 35, 38, 44, 54, 55, 57, 58, 61, 64], "posit": [7, 11, 15, 18, 23, 25, 27, 33, 39, 41, 47, 52, 73], "befor": [7, 13, 24, 31, 34, 38, 43, 45, 48, 54, 57, 61, 63, 74], "revert": 7, "escap": 7, "preserv": [7, 54], "content": [7, 24, 27], "even": [7, 24, 31, 38, 48, 74], "colon": 7, "input1": [7, 10], "lint": 7, "love": 7, "encoded1": 7, "decoded1": 7, "input2": [7, 10], "sai": 7, "ye": 7, "encoded2": 7, "decoded2": 7, "m": [7, 10, 14, 16, 27, 40, 43, 44, 45, 52, 56, 58, 59, 72, 74], "doubl": [7, 48], "build": [7, 27, 33, 45, 61, 65, 67, 68, 69, 70, 71, 72, 75], "scan": 7, "aris": 7, "just": [7, 11, 18, 27, 33, 39, 57, 61, 73], "could": [7, 16, 20, 25, 26, 34, 40, 52, 73], "own": [7, 40, 58], "abl": [7, 44], "try": [7, 11, 16, 43, 49], "minim": [7, 16, 21, 23, 39, 57, 65], "correctli": [7, 33, 44, 49, 54], "repositori": [8, 67, 68, 69, 70, 71, 74, 75, 76], "my": 8, "ve": [8, 13, 14, 37, 47, 56, 58], "organ": [8, 43], "categori": 8, "easier": [8, 25, 26], "navig": [8, 67, 68, 69, 70, 71, 75], "refer": [8, 23, 24, 25, 32, 33, 38, 39, 54, 67, 68, 69, 70, 71, 72, 75], "present": [8, 16, 21, 43, 55], "jupyt": [8, 72], "notebook": [8, 72], "format": [8, 25, 33, 39, 54, 72], "ipynb": [8, 72], "217": [8, 72, 75], "242": [8, 72, 75], "valid": [8, 11, 12, 14, 15, 16, 19, 23, 33, 34, 39, 42, 43, 45, 51, 52, 60, 61, 72, 75], "anagram": [8, 72, 75], "sum": [8, 11, 28, 42, 53, 59, 65, 71, 72, 75], "49": [8, 9, 72, 75], "347": [8, 72, 75], "top": [8, 18, 31, 35, 45, 48, 59, 65, 72, 74, 75], "frequent": [8, 37, 67, 68, 69, 70, 71, 72, 75], "238": [8, 72, 75], "product": [8, 66, 72, 75], "except": [8, 72, 75], "659": [8, 72, 75], "encod": [8, 39, 72, 75], "decod": [8, 66, 72, 75], "128": [8, 72, 75], "consecut": [8, 64, 72, 75], "sequenc": [8, 34, 39, 45, 48, 65, 72, 75], "hard": [8, 16, 17, 28, 29, 34, 39, 42, 45, 46, 48, 50, 61, 62, 69, 75], "want": [8, 12, 13, 14, 17, 19, 21, 22, 25, 29, 37, 38, 42, 46, 50, 53, 57, 60, 62, 66, 67, 68, 69, 70, 71, 72, 75], "feel": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "free": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 73, 75], "pull": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "request": [8, 12, 17, 19, 22, 29, 42, 46, 48, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "open": [8, 12, 17, 18, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75], "issu": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76], "discuss": [8, 12, 17, 19, 22, 23, 29, 36, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "improv": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "offici": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 73, 75], "websit": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "forum": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "hint": [8, 12, 15, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "happi": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "height": [9, 32, 33, 34, 36, 37, 38, 39, 40, 41, 59], "There": [9, 21, 23, 39, 43, 44, 48, 54, 55, 57, 58, 59, 61, 65, 72, 74], "vertic": [9, 45, 52, 54, 56, 57, 61], "drawn": 9, "endpoint": 9, "th": [9, 13, 25, 37, 47, 63], "x": [9, 39, 45, 47, 52, 56, 59, 61, 74], "axi": 9, "notic": [9, 11, 20], "slant": 9, "maxarea": 9, "area": 9, "max_area": 9, "pointer": [9, 10, 11, 16, 20, 21, 23, 24, 25, 26, 27, 28, 72], "until": [9, 10, 11, 15, 20, 21, 24, 25, 26, 27, 28, 31, 33, 35, 37, 38, 43, 47, 56, 57, 61, 76], "h": [9, 32, 34, 36, 37, 38, 39, 45], "min": [9, 13, 14, 48, 49, 59, 61], "width": [9, 35], "distanc": 9, "shorter": 9, "inward": 9, "possibl": [9, 11, 13, 21, 34, 37, 40, 44, 45, 51, 52, 56, 57, 59, 61, 65, 74], "systemat": 9, "hold": [9, 15, 23], "point": [9, 11, 20, 21, 23, 24, 25, 26, 27, 34, 39, 43, 54], "taller": 9, "won": 9, "increas": [9, 11, 38, 66, 75], "decreas": [9, 11, 27], "smaller": [9, 11, 16, 27, 33, 34, 38, 48, 49, 51, 55, 57, 65], "height1": 9, "height2": 9, "height3": 9, "45": [9, 65], "approach": [9, 15, 26, 28, 33, 34, 37, 39, 40, 41, 45, 49, 51, 56, 63], "like": [9, 11, 15, 26, 34, 35, 36, 38, 39, 41, 43, 45, 55, 56, 73], "whose": 9, "consumpt": 9, "As": [9, 24, 27, 37], "variant": [9, 35], "gap": 9, "ll": 9, "volum": 9, "uppercas": [10, 15, 16, 52], "non": [10, 27, 34, 36, 61, 69, 75], "alphanumer": 10, "read": [10, 72], "forward": [10, 74], "backward": 10, "printabl": 10, "ispalindrom": 10, "lower": [10, 13], "cleaned_": 10, "join": [10, 39, 61], "isalnum": 10, "clean": [10, 33], "don": [10, 21, 28, 39, 43], "insensit": 10, "digit": [10, 14], "punctuat": 10, "closer": [10, 36, 37], "decrement": [10, 11, 15, 16, 37, 57], "mismatch": [10, 40], "man": 10, "plan": [10, 63, 64], "canal": 10, "panama": 10, "output1": 10, "race": [10, 73], "output2": 10, "input3": 10, "output3": 10, "comprehens": 10, "half": [10, 20, 21, 24, 48], "still": [10, 15, 16, 20, 23, 31, 37, 41, 44, 49, 52], "primarili": [10, 15, 24, 40, 41, 44, 47, 64], "version": [10, 56, 72, 73], "larg": [10, 38, 40, 47, 49], "addition": [10, 14, 25, 33, 34, 40, 52, 56, 58, 61], "babad": 10, "bab": 10, "aba": 10, "limit": [10, 45, 65], "allowed_char": 10, "ignor": [10, 18], "triplet": 11, "j": [11, 28, 45, 52, 54, 56, 59, 61], "3000": [11, 33], "threesum": 11, "ascend": [11, 20, 21, 28, 37], "skip": [11, 25, 51, 63, 64], "elif": [11, 18, 21, 38, 44, 48, 64], "neg": [11, 34, 41, 51], "Then": [11, 13, 48, 59, 61], "larger": [11, 16, 38, 48, 52], "been": [11, 16, 18, 24, 31, 33, 45, 54, 55, 57, 58, 72, 76], "contribut": [11, 21, 24, 35, 47, 52, 55, 65, 73], "roughli": [11, 35], "mani": [11, 16, 44, 51, 56, 58, 61, 65], "criteria": 11, "rather": [11, 20, 54], "gener": [11, 16, 18, 24, 48, 51, 52, 65, 72, 74], "target": [11, 21, 34, 38, 51, 72], "satisfi": [11, 41, 55, 59, 61, 72], "themselv": [11, 24], "some": [11, 15, 18, 23, 38, 39], "125": [12, 72, 75], "15": [12, 20, 31, 32, 33, 34, 52, 72, 75], "3sum": [12, 72, 75], "11": [12, 20, 72, 75], "With": [12, 13, 72, 75], "water": [12, 56, 60, 72, 75], "solut": [12, 17, 19, 22, 23, 27, 28, 29, 36, 40, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 72, 74], "price": 13, "dai": [13, 76], "maxim": [13, 63], "profit": 13, "choos": [13, 15, 34, 47, 64], "futur": [13, 72], "transact": 13, "maxprofit": 13, "min_pric": 13, "max_profit": 13, "encount": [13, 14, 18, 34, 55, 56, 74], "made": [13, 27, 28, 33, 40, 43, 44, 48, 49, 51], "seen": [13, 14, 49], "far": [13, 14, 16, 37, 48, 49], "haven": [13, 37, 45], "lowest": [13, 42, 75], "sold": 13, "assum": [13, 33, 44, 54, 55, 56, 58, 61], "bought": 13, "subtract": [13, 51], "previous": [13, 43, 44], "prices1": 13, "prices2": 13, "examin": 13, "rel": [13, 28, 38, 59], "regardless": [13, 15, 23, 24, 26, 27, 38, 63, 64, 73], "memori": [13, 23, 26, 27, 28, 38, 39, 44, 52, 54, 56], "usag": [13, 23, 25, 33, 34, 37, 39, 41, 43, 44, 47, 48, 49, 52, 59, 63], "again": [13, 15, 21, 23, 43], "fee": 13, "introduc": [13, 74], "symbol": 14, "length_of_longest_substr": 14, "last": [14, 21, 23, 24, 26, 31, 43, 50, 63, 64, 72], "char_index": 14, "necessari": [14, 44, 48, 49, 52], "wa": [14, 16, 20, 26, 43, 61, 72, 73], "new": [14, 23, 24, 25, 26, 27, 28, 31, 33, 34, 35, 38, 39, 43, 44, 45, 47, 49, 54, 58, 61, 63, 72, 74], "fact": 14, "abcabcbb": 14, "bbbbb": 14, "pwwkew": 14, "lookup": 14, "arithmet": [14, 18], "abca": 14, "abcd": 14, "chang": [15, 24, 26, 45, 49, 56, 66, 72, 74, 75], "time": [15, 16, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 72, 73, 74, 75], "characterreplac": 15, "max_count": 15, "slide": [15, 16, 48, 72], "window": [15, 48, 72], "char_count": 15, "plu": [15, 34], "minu": [15, 52], "exceed": 15, "shrink": [15, 16], "side": [15, 36], "alwai": [15, 49, 54], "s1": 15, "abab": 15, "k1": [15, 37], "s2": 15, "aababba": 15, "k2": [15, 37], "space": [15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 73, 74], "complex": [15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 36, 40, 74], "sever": [15, 39, 74], "inform": [15, 26, 55, 61, 73, 75, 76], "variat": [15, 16, 20, 21, 47, 63, 64], "testcas": 16, "min_window_substr": 16, "t_dict": 16, "current_window_dict": 16, "popul": [16, 49, 57, 58], "char": [16, 18, 43, 44, 45, 61], "min_len": 16, "float": [16, 34, 41, 48], "inf": [16, 34, 41], "min_window": 16, "required_char": 16, "found_char": 16, "window_s": 16, "left_char": 16, "further": [16, 26, 56, 61, 74, 76], "adobecodebanc": 16, "abc": [16, 52], "banc": 16, "aa": 16, "smallest": [16, 20, 21, 42, 48, 49, 61, 75], "No": [16, 73], "121": [17, 72, 75], "best": [17, 32, 34, 37, 72, 73, 75], "bui": [17, 72, 75], "And": [17, 42, 46, 75], "sell": [17, 72, 75], "stock": [17, 72, 75], "424": [17, 72, 75], "76": [17, 72, 75], "bracket": 18, "close": [18, 37, 41, 55], "correct": [18, 34, 35, 47, 48, 52, 59, 61], "isvalid": 18, "map": [18, 54, 56], "bracket_map": 18, "push": [18, 37, 47, 74], "onto": [18, 37], "pop": [18, 31, 33, 35, 37], "dummi": [18, 23, 25, 27, 28], "top_el": 18, "unmatch": 18, "recent": [18, 72], "error": [18, 72], "properli": 18, "bottom": [18, 31, 34, 35, 45, 59], "demonstr": [18, 34, 39, 43, 47, 51, 55, 58, 59, 63, 64, 73], "mainli": [18, 44, 45], "express": [18, 51, 73], "combin": [18, 24, 27, 33, 35, 53, 65, 75], "20": [19, 31, 32, 33, 34, 72, 75], "parenthes": [19, 72, 75], "suppos": [20, 45, 47], "might": [20, 21, 33, 48], "becom": [20, 21, 25, 26, 27, 31, 37, 38, 51, 57], "5000": [20, 21, 26, 57], "findmin": 20, "mid": [20, 21], "rightmost": [20, 35], "break": [20, 24, 31, 33, 40, 61, 65, 66, 75], "converg": 20, "At": [20, 34, 39, 43, 44, 45, 47, 48, 49], "search": [20, 33, 37, 39, 40, 42, 43, 46, 49, 51, 53, 54, 55, 56, 58, 59, 72], "middl": [20, 21, 24, 48], "elimin": [20, 38, 51], "met": [20, 24, 38, 52, 55, 56], "impli": 20, "13": [20, 72], "17": [20, 72], "emploi": 20, "divid": [20, 21, 28, 33, 48, 59], "halv": [20, 24, 48], "logarithm": [20, 38, 48], "reduc": [20, 28, 43, 51, 56, 59], "henc": 20, "kth": [20, 42, 47, 48, 50, 75], "extens": [20, 34, 38, 48, 54, 72], "prior": 21, "pass": [21, 23, 25, 26, 34, 49, 52], "unknown": [21, 61], "pivot": 21, "runtim": 21, "li": 21, "reset": 21, "chosen": [21, 51], "target1": [21, 51], "target2": [21, 51], "target3": [21, 51], "veri": [21, 40, 49], "scale": [21, 35, 40, 64], "circularli": 21, "circular": [21, 57, 63, 64], "manner": [21, 27, 32, 37], "maintain": [21, 41, 43, 45, 47, 48, 49, 54, 59, 63], "153": [22, 72, 75], "rotat": [22, 26, 70, 72, 75], "33": [22, 72, 75], "head": [23, 24, 25, 26, 27], "reach": [23, 24, 25, 26, 32, 37, 38, 43, 44, 51, 55, 58, 59, 65], "intern": 23, "po": [23, 72], "denot": [23, 59], "tail": [23, 26, 28], "connect": [23, 25, 34, 39, 54, 55, 56, 59, 60, 63, 64, 75], "singli": [23, 24, 26, 27, 28], "listnod": [23, 24, 25, 26, 27, 28], "hascycl": 23, "slow": [23, 24], "fast": [23, 24, 49], "attribut": [23, 24, 25, 27, 32, 33, 34, 38, 39, 43, 44, 72], "eventu": [23, 38], "catch": 23, "helper": [23, 24, 25, 26, 27, 34, 40, 41, 44, 51, 52, 58, 64], "create_linked_list_with_cycl": 23, "cycle_nod": 23, "enumer": [23, 54], "purpos": [23, 24, 26, 27, 67, 68, 69, 70, 71, 75, 76], "simplifi": [23, 24, 25, 26, 27, 28, 58, 59], "creation": [23, 24, 47], "specifi": [23, 24, 44, 49, 52, 61, 73], "simul": [23, 37, 47], "easili": [23, 24, 27, 39], "particularli": [23, 43], "abil": [23, 43, 55], "reason": [23, 36, 38, 44, 56, 73], "speed": 23, "approxim": [23, 31, 36, 41, 47], "l_0": 24, "l_1": 24, "l_": 24, "l_n": 24, "l_2": 24, "1000": [24, 31, 34, 39, 40, 47, 64], "reorderlist": 24, "first_half": 24, "second_half": 24, "prev": [24, 26, 63, 64], "next_nod": [24, 26], "merg": [24, 29, 37, 69, 74, 75], "altern": [24, 35], "next_p1": 24, "next_p2": 24, "pattern": [24, 27, 31, 73], "describ": [24, 47, 54, 64, 76], "statement": [24, 43, 47, 51, 61, 64, 65], "detail": [24, 51, 58, 59, 61, 72, 74, 76], "direct": [24, 26, 52, 56, 57, 58, 61, 72], "now": [24, 25, 33, 43, 47, 72], "adjust": 24, "printlinkedlist": [24, 27], "debug": [24, 27], "displai": [24, 27, 72], "regular": [24, 27], "visual": [24, 27, 55], "head1": [24, 25, 26], "head2": [24, 25, 26], "compon": [24, 54, 59, 60, 75], "manipul": [24, 43, 47, 49], "segment": 24, "odd": [24, 31, 48], "come": [24, 39, 52, 61], "sz": 25, "removenthfromend": 25, "advanc": [25, 26, 73], "_": [25, 31, 58, 59], "simultan": [25, 63], "individu": [25, 40, 56, 67, 68, 69, 70, 71, 73, 75], "ahead": 25, "createlinkedlist": [25, 26], "converttolist": 25, "familiar": [25, 74], "n1": [25, 55, 58], "new_head1": 25, "n2": [25, 55, 58], "new_head2": 25, "head3": [25, 26], "n3": 25, "new_head3": 25, "certainli": [25, 64], "isol": [25, 54], "reverselistit": 26, "reverselistrecurs": 26, "new_head": 26, "cycl": [26, 29, 54, 55, 57, 61, 72, 75], "linkedlisttolist": 26, "newli": [26, 27], "reversed_head1": 26, "reversed_head2": 26, "reversed_head3": 26, "about": [26, 55, 56, 57, 73], "state": [26, 72], "list1": 27, "list2": 27, "splice": 27, "50": 27, "mergetwolist": 27, "serv": [27, 43, 54], "placehold": 27, "attach": 27, "essenti": [27, 36, 38, 57, 65], "merged_list": 27, "why": [27, 35, 49, 73], "temporari": [27, 63], "manag": [27, 72], "alloc": [27, 44], "zigzag": [27, 31, 35], "500": 28, "exce": [28, 49, 51], "mergeklist": 28, "mergedlist": 28, "l1": 28, "l2": 28, "mergelist": 28, "conquer": 28, "high": [28, 58], "level": [28, 32, 33, 35, 42, 44, 58, 59, 72, 73, 75], "overview": [28, 51], "strategi": [28, 63, 64], "lists1": 28, "lists2": 28, "lists3": 28, "fashion": 28, "across": [28, 39, 43], "low": [28, 49], "overhead": [28, 32, 44], "206": [29, 72, 75], "21": [29, 72, 75], "143": [29, 72, 75], "reorder": [29, 72, 75], "19": [29, 72, 75], "nth": [29, 75], "141": [29, 72, 75], "23": [29, 72, 75], "2000": [31, 35, 40, 43, 57], "levelord": 31, "bf": [31, 55, 56], "level_valu": 31, "level_s": [31, 35], "dequeu": [31, 33, 35, 57], "front": [31, 33, 57], "enqueu": [31, 33, 35], "children": [31, 33, 35, 37, 39, 43, 44, 45], "object": [31, 33, 36, 39, 43, 44, 48, 49, 56, 72], "breadth": [31, 54, 55, 56], "balanc": [31, 32, 34, 36, 37, 38, 41, 48], "wors": 31, "invert": [32, 42, 75], "path": [32, 42, 45, 51, 52, 55, 58, 67, 72, 75], "farthest": 32, "leaf": [32, 34, 37, 39], "maxdepth": 32, "left_depth": 32, "right_depth": 32, "understand": [32, 74, 76], "three": [32, 33, 38, 39, 51, 52, 64, 65], "well": [32, 38, 40, 44, 48, 56, 65, 73], "explor": [32, 34, 44, 45, 51, 52, 54, 55, 56, 58, 59], "skew": [32, 33, 36, 41], "deep": [32, 33, 54, 56, 59], "perfectli": [32, 37], "vari": [32, 37, 41], "shape": [32, 41], "buildtre": 33, "root_val": 33, "root_idx_inord": 33, "appropri": [33, 48, 73], "sublist": 33, "slice": 33, "subproblem": [33, 65], "treetolist": 33, "trail": 33, "b": [33, 35, 44, 45, 52, 58, 61, 74], "represent": [33, 39, 57, 61], "reflect": [33, 61], "highli": [33, 37], "postord": 33, "reconstruct": [33, 39], "adjac": [34, 45, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64], "edg": [34, 54, 55, 56, 57, 58, 59, 61], "choic": 34, "option": 34, "global": 34, "ultim": 34, "aim": [34, 47, 59, 64], "maxpathsum": 34, "max_path_sum_help": 34, "left_max": 34, "right_max": 34, "max_sum": 34, "infin": [34, 41], "importantli": 34, "root1": [34, 35, 36, 37, 41], "root2": [34, 35, 36, 37, 38, 41], "42": 34, "anywher": 34, "imagin": 35, "yourself": [35, 39], "stand": 35, "rightsideview": 35, "d": [35, 45, 52], "subsequ": [35, 66, 67, 75], "obtain": [35, 39, 45], "visibl": [35, 73], "auxiliari": [35, 36, 51, 54], "leftmost": [35, 37], "inverttre": 36, "swap": [36, 38], "noth": 36, "inverted_root1": 36, "__main__": 36, "0x7faa5c445ab0": 36, "inverted_root2": 36, "0x7faa5c444310": 36, "root3": 36, "inverted_root3": 36, "occur": [36, 43, 51, 56, 72], "full": [36, 72], "practic": [36, 37, 38, 40, 41, 43, 44, 45, 51, 55, 56, 57], "often": [36, 37, 41, 51, 56, 57], "mind": [36, 40, 56, 61], "task": [36, 39, 43, 45, 52, 55, 58, 59, 63], "mimic": 36, "tree": [37, 46, 60], "kthsmallest": [37, 49], "yet": [37, 58], "concis": [37, 76], "resembl": 37, "moder": [37, 40, 73], "usual": [37, 55], "bst": [38, 41, 42, 75], "lca": 38, "wikipedia": 38, "descend": [38, 40], "lowestcommonancestor": 38, "inclus": [38, 73], "simpl": [38, 39], "logic": [38, 43], "neither": 38, "advantag": [38, 76], "properti": [38, 41, 49, 55], "narrow": 38, "lead": [38, 43, 51, 73], "quick": [38, 48], "Its": 38, "suitabl": [38, 48], "file": [39, 72], "buffer": 39, "transmit": 39, "later": [39, 44], "environ": [39, 72, 73, 76], "restrict": [39, 64], "clarif": 39, "necessarili": 39, "creativ": 39, "tthe": 39, "byte": 39, "persist": 39, "context": [39, 51, 55], "recreat": 39, "flexibl": 39, "accur": [39, 54], "unambigu": 39, "goal": [39, 43, 45, 47, 51, 54, 56, 57, 58, 59, 61, 63, 64], "common": [39, 42, 43, 45, 67, 73, 75], "preorder": [39, 42, 75], "pars": [39, 72], "df": [39, 41, 45, 51, 52, 54, 55, 56, 58, 59], "int": [39, 48, 49, 54, 56, 57, 59, 63, 64, 65], "absenc": 39, "comma": 39, "custom": 39, "serialized_tre": 39, "new_root": 39, "convers": [39, 52], "major": 39, "unless": 39, "techniqu": [39, 56], "descript": [40, 67, 68, 69, 70, 71, 74, 75, 76], "subroot": 40, "issubtre": 40, "tree1": 40, "tree2": 40, "unnecessari": [40, 45, 51], "Is": 40, "earli": [40, 51], "whichev": 40, "degrad": 40, "31": [41, 72], "is_valid_bst": 41, "is_valid": 41, "min_val": 41, "max_val": 41, "wide": [41, 67, 68, 69, 70, 71, 75], "violat": [41, 73], "log2": 41, "quit": 41, "standard": 41, "226": [42, 75], "104": [42, 75], "572": [42, 75], "235": [42, 75], "ancestor": [42, 75], "102": [42, 75], "98": [42, 72, 75], "230": [42, 75], "inord": [42, 75], "124": [42, 75], "297": [42, 75], "serial": [42, 75], "deseri": [42, 75], "pronounc": 43, "dataset": 43, "variou": [43, 61], "applic": [43, 72], "autocomplet": 43, "spellcheck": 43, "void": [43, 44, 48], "startswith": 43, "hand": [43, 54, 58, 59, 61], "known": [43, 63, 67, 68, 69, 70, 71, 72, 75], "spell": [43, 45], "special": [43, 45], "flag": [43, 44, 45], "successfulli": [43, 52, 57], "expect": [43, 52, 56, 59, 74, 75, 76], "trienod": [43, 44, 45], "is_end_of_word": [43, 44, 45], "mark": [43, 44, 45, 52, 55, 56, 58, 59], "confirm": 43, "presenc": [43, 57], "appl": 43, "app": [43, 72], "share": 43, "relat": 43, "auto": [43, 44, 72], "suggest": [43, 44, 74], "featur": [43, 44, 74], "program": [43, 63, 64, 65, 68, 69, 70, 71], "support": [44, 48, 49], "worddictionari": 44, "addword": 44, "dot": 44, "25": [44, 72], "queri": [44, 58], "wildcard": 44, "partial": [44, 54], "fuzzi": 44, "bad": 44, "dad": 44, "mad": 44, "pad": 44, "exact": 44, "bed": 44, "bet": 44, "etc": [44, 45], "search_help": 44, "trie": [44, 45, 75], "public": [44, 54, 73], "l": [44, 45], "exponenti": [44, 51, 52], "system": [44, 63, 64], "deleteword": 44, "board": [45, 52], "cell": [45, 52, 56, 59, 72], "horizont": [45, 52, 56], "neighbor": [45, 52, 54, 55, 56, 57, 58, 59, 61, 64], "sure": 45, "backtrack": [45, 51, 52, 59], "bound": [45, 52], "prevent": [45, 52, 55, 57], "revisit": [45, 52, 55], "restor": [45, 52], "prune": [45, 52], "findword": 45, "curr_nod": 45, "stop": [45, 51, 63], "temp": [45, 63], "buildtri": 45, "dimens": [45, 52, 56, 59], "grid": [45, 52, 56, 59], "built": 45, "reus": 45, "board1": [45, 52], "r": [45, 59], "f": [45, 52, 65, 72], "v": [45, 54, 55, 57, 58, 61], "words1": [45, 61], "oath": 45, "pea": 45, "rain": [45, 59], "board2": 45, "words2": [45, 61], "abcb": [45, 52], "row": [45, 56, 59], "column": [45, 56, 59], "influenc": [45, 51], "basic": [45, 64], "out": [45, 52, 55, 65, 72], "2d": [45, 52, 56, 59], "208": [46, 75], "211": [46, 75], "212": [46, 75], "ii": [46, 66, 69, 75], "plai": 47, "game": [47, 68, 75], "On": 47, "turn": 47, "heaviest": 47, "smash": 47, "y": [47, 59], "destroi": 47, "appli": [47, 64, 73], "rule": [47, 59, 61], "select": [47, 51], "happen": [47, 76], "heapq": [47, 48, 49], "laststoneweight": 47, "negat": 47, "max_heap": 47, "heapifi": 47, "heappop": [47, 48, 49], "new_ston": 47, "heappush": [47, 48, 49], "librari": 47, "stones1": 47, "stones2": 47, "rest": [47, 65], "enough": 47, "linearithm": 47, "medianfind": 48, "addnum": 48, "findmedian": 48, "accept": [48, 73], "99": 48, "deal": 48, "ask": [48, 51, 56, 65, 67, 68, 69, 70, 71, 75], "precis": 48, "small_half": 48, "large_half": 48, "rebal": 48, "offer": 48, "access": [48, 72], "kthlargest": 49, "whenev": 49, "kept": 49, "discard": 49, "scalabl": 49, "modul": [49, 52, 72], "min_heap": 49, "1th": 49, "dynam": [49, 63, 64, 65], "update_k": 49, "lifetim": 49, "703": 50, "stream": [50, 75], "1046": 50, "stone": 50, "weight": 50, "295": [50, 75], "median": [50, 75], "candid": 51, "unlimit": 51, "150": [51, 72], "40": [51, 72], "combinationsum": 51, "invalid": [51, 61, 72], "dedupl": 51, "respons": [51, 74, 76], "anyth": 51, "candidates1": 51, "candidates2": 51, "candidates3": 51, "much": [51, 57, 59, 74], "faster": 52, "imposs": [52, 57], "mention": [52, 55, 61, 74], "temporarili": 52, "tmp": [52, 72], "four": [52, 56], "signatur": 52, "member": [52, 73], "marker": 52, "propag": 52, "word1": [52, 61], "word2": [52, 61], "word3": 52, "random": 52, "39": [53, 72, 75], "79": [53, 75], "undirect": [54, 55, 60, 75], "copi": [54, 74], "simplic": 54, "unord": 54, "finit": [54, 56], "relationship": [54, 57, 61], "aspect": 54, "entri": [54, 72], "separ": [54, 58], "compos": 54, "establish": 54, "cyclic": 54, "clonegraph": 54, "original_nod": 54, "copy_nod": 54, "look": [54, 59, 72, 74], "intact": 54, "get_adjacency_list": 54, "get_node_and_neighbor": 54, "adjlist1": 54, "adjlist": 54, "adj": 54, "cloned_node1": 54, "cloned_adjlist1": 54, "adjlist2": 54, "node1": 54, "cloned_adjlist2": 54, "storag": 54, "fall": 54, "infinit": 54, "subset": 54, "label": [55, 57], "thu": [55, 63], "circuit": 55, "piec": 55, "arrang": [55, 64], "seri": [55, 73], "validtre": 55, "adj_list": 55, "u": 55, "parent": 55, "reachabl": [55, 59], "accomplish": [55, 57], "edges1": [55, 58], "edges2": [55, 58], "span": 55, "mst": 55, "kruskal": 55, "prim": 55, "reinforc": 55, "concept": 55, "identifi": [55, 56, 57, 58, 59], "enhanc": [55, 74], "land": 56, "surround": [56, 59], "300": [56, 66, 75], "diagon": [56, 59], "wrap": [56, 72], "around": [56, 73], "clarifi": [56, 73], "graph": [56, 57, 59, 61], "extent": 56, "unvisit": [56, 58], "essenc": 56, "numisland": 56, "num_island": 56, "col": 56, "dr": 56, "dc": 56, "boundari": 56, "grid1": 56, "grid2": 56, "numcours": 57, "prerequisit": [57, 74], "ai": 57, "bi": 57, "finish": [57, 72], "taken": [57, 65], "dequ": [57, 61], "canfinish": 57, "in_degre": [57, 61], "degre": [57, 61], "topolog": [57, 61], "popleft": [57, 61], "were": [57, 63, 64, 73], "brief": 57, "those": [57, 65, 73], "numcourses1": 57, "prerequisites1": 57, "sol": [57, 63], "numcourses2": 57, "prerequisites2": 57, "outgo": 57, "durat": 57, "countconnectedcompon": 58, "counter": 58, "hasn": 58, "disconnect": 58, "rectangular": 59, "island": [59, 60, 75], "border": 59, "ocean": 59, "ocea": 59, "touch": 59, "partit": 59, "squar": 59, "matrix": [59, 70, 75], "sea": 59, "coordin": 59, "receiv": [59, 61], "lot": 59, "north": 59, "south": 59, "east": 59, "west": 59, "r_i": 59, "c_i": 59, "contact": [59, 63, 64], "rainwat": 59, "send": 59, "classic": [59, 63, 65], "pacificatlant": 59, "matric": 59, "pacific_reach": 59, "atlantic_reach": 59, "dx": 59, "dy": 59, "new_x": 59, "new_i": 59, "heights1": 59, "heights2": 59, "big": 59, "notat": 59, "133": [60, 75], "clone": [60, 67, 68, 69, 70, 71, 74, 75], "417": [60, 75], "pacif": [60, 75], "atlant": [60, 75], "flow": [60, 75], "207": [60, 75], "cours": [60, 75], "schedul": [60, 75], "323": [60, 75], "261": [60, 75], "languag": [61, 67, 68, 69, 70, 71, 73, 75], "latin": 61, "alphabet": 61, "lexicograph": 61, "deriv": 61, "normal": [61, 72], "rank": 61, "human": 61, "situat": 61, "inconsist": 61, "instruct": 61, "adher": [61, 63, 74, 75], "alienord": 61, "min_length": 61, "kahn": 61, "preced": 61, "success": 61, "wrt": 61, "wrf": 61, "er": 61, "ett": 61, "rftt": 61, "wertf": 61, "wrtef": 61, "zx": 61, "Be": [61, 74], "269": [62, 75], "alien": [62, 75], "profession": [63, 64, 73], "rob": [63, 64], "street": [63, 64], "monei": [63, 64], "stash": [63, 64], "secur": [63, 64, 73], "automat": [63, 64], "polic": [63, 64], "broken": [63, 64], "night": [63, 64], "tonight": [63, 64], "alert": [63, 64], "400": 63, "earn": 63, "trigger": [63, 64], "stolen": 63, "curr": [63, 64], "assign": [63, 65], "alarm": 63, "circl": 64, "That": 64, "meanwhil": 64, "twist": 64, "implic": 64, "vice": 64, "versa": 64, "illustr": 64, "simple_rob": 64, "robberi": 64, "case1": 64, "case2": 64, "steal": 64, "instanti": 64, "sacrif": 64, "accommod": 64, "staircas": 65, "shown": 65, "climbstair": 65, "dp": 65, "70": [66, 75], "climb": [66, 75], "stair": [66, 75], "198": [66, 75], "hous": [66, 75], "robber": [66, 75], "213": [66, 75], "647": [66, 75], "91": [66, 75], "322": [66, 75], "coin": [66, 75], "152": [66, 75], "subarrai": [66, 68, 75], "139": [66, 72, 75], "curat": [67, 68, 69, 70, 71, 75], "commonli": [67, 68, 69, 70, 71, 75], "cover": [67, 68, 69, 70, 71, 75], "technic": [67, 68, 69, 70, 71, 75], "interview": [67, 68, 69, 70, 71, 75], "strong": [67, 68, 69, 70, 71, 75], "foundat": [67, 68, 69, 70, 71, 75], "62": [67, 75], "1143": [67, 75], "download": [67, 68, 69, 70, 71, 75], "local": [67, 68, 69, 70, 71, 72, 74, 75], "machin": [67, 68, 69, 70, 71, 74, 75], "git": [67, 68, 69, 70, 71, 74, 75], "http": [67, 68, 69, 70, 71, 72, 73, 74, 75], "github": [67, 68, 69, 70, 71, 72, 74, 75, 76], "com": [67, 68, 69, 70, 71, 72, 74, 75, 76], "mohsentabibian": [67, 68, 69, 70, 71, 75, 76], "directori": [67, 68, 69, 70, 71, 75], "cd": [67, 68, 69, 70, 71, 72, 75], "templat": [67, 68, 69, 70, 71, 72, 75, 76], "prefer": [67, 68, 69, 70, 71, 75], "meant": [67, 68, 69, 70, 71, 75], "educ": [67, 68, 69, 70, 71, 73, 75], "prepar": [67, 68, 69, 70, 71, 75], "guidelin": [67, 68, 69, 70, 71, 75], "53": [68, 75], "55": [68, 75], "jump": [68, 75], "57": [69, 75], "56": [69, 75], "435": [69, 75], "overlap": [69, 75], "252": [69, 75], "room": [69, 75], "253": [69, 75], "48": [70, 75], "imag": [70, 75], "54": [70, 75], "spiral": [70, 75], "73": [70, 75], "191": [71, 75], "338": [71, 75], "190": [71, 75], "268": [71, 75], "miss": [71, 72, 75], "371": [71, 75], "pip": 72, "instal": 72, "upgrad": 72, "book": 72, "usr": 72, "lib": 72, "python3": 72, "site": 72, "packag": 72, "docutil": 72, "18": 72, "jinja2": 72, "home": 72, "codespac": 72, "jsonschema": 72, "linkifi": 72, "py": 72, "myst": 72, "nb": 72, "pyyaml": 72, "sphinx": 72, "comment": [72, 73, 74], "copybutton": 72, "extern": [72, 73], "toc": 72, "jupyterbook": 72, "latex": 72, "thebe": 72, "theme": 72, "sphinx_togglebutton": 72, "sphinxcontrib": 72, "bibtex": 72, "multitoc": 72, "attr": 72, "22": 72, "2023": 72, "03": 72, "referenc": 72, "28": 72, "rpd": 72, "uc": 72, "micro": 72, "importlib_metadata": 72, "ipython": 72, "16": 72, "cach": 72, "nbclient": 72, "parser": 72, "nbformat": 72, "ipykernel": 72, "applehelp": 72, "devhelp": 72, "jsmath": 72, "htmlhelp": 72, "serializinghtml": 72, "qthelp": 72, "pygment": 72, "snowballstemm": 72, "babel": 72, "alabast": 72, "images": 72, "markupsaf": 72, "pydata": 72, "14": 72, "pybtex": 72, "setuptool": 72, "68": 72, "wheel": 72, "41": 72, "sqlalchemi": 72, "tabul": 72, "markdown": 72, "mdit": 72, "plugin": 72, "client": 72, "core": 72, "traitlet": 72, "fastjsonschema": 72, "latexcodec": 72, "six": 72, "beautifulsoup4": 72, "charset": 72, "idna": 72, "urllib3": 72, "certifi": 72, "2017": 72, "zipp": 72, "comm": 72, "debugpi": 72, "matplotlib": 72, "inlin": 72, "asyncio": 72, "psutil": 72, "pyzmq": 72, "tornado": 72, "backcal": 72, "decor": 72, "jedi": 72, "pickleshar": 72, "prompt": 72, "toolkit": 72, "37": 72, "exceptiongroup": 72, "pexpect": 72, "parso": 72, "dateutil": 72, "platformdir": 72, "mdurl": 72, "ptyprocess": 72, "wcwidth": 72, "greenlet": 72, "soupsiev": 72, "execut": 72, "asttoken": 72, "pure": 72, "eval": 72, "restart": 72, "kernel": 72, "workspac": 72, "migrat": 72, "_toc": 72, "yml": 72, "traceback": 72, "bin": 72, "sy": 72, "1157": 72, "__call__": 72, "arg": 72, "kwarg": 72, "1078": 72, "rv": 72, "invok": 72, "ctx": 72, "1688": 72, "_process_result": 72, "sub_ctx": 72, "command": 72, "1434": 72, "callback": 72, "param": 72, "783": 72, "__callback": 72, "sphinx_external_toc": 72, "cli": 72, "migrate_toc": 72, "migrate_jupyter_book": 72, "toc_fil": 72, "tool": 72, "327": 72, "rais": 72, "malformederror": 72, "32m": 72, "1mrun": 72, "v0": 72, "0m": 72, "34m": 72, "1msourc": 72, "folder": 72, "1mconfig": 72, "_config": 72, "1moutput": 72, "_build": 72, "html": [72, 73], "01mrun": 72, "v5": 72, "00m": 72, "etoc": 72, "master_doc": 72, "readm": 72, "01mmyst": 72, "mdparserconfig": 72, "commonmark_onli": 72, "gfm_onli": 72, "enable_extens": 72, "colon_f": 72, "dollarmath": 72, "substitut": 72, "tasklist": 72, "disable_syntax": 72, "all_links_extern": 72, "url_schem": 72, "mailto": 72, "ref_domain": 72, "highlight_code_block": 72, "number_code_block": 72, "title_to_head": 72, "heading_anchor": 72, "heading_slug_func": 72, "footnote_transit": 72, "words_per_minut": 72, "sub_delimit": 72, "linkify_fuzzy_link": 72, "dmath_allow_label": 72, "dmath_allow_spac": 72, "dmath_allow_digit": 72, "dmath_double_inlin": 72, "update_mathjax": 72, "mathjax_class": 72, "tex2jax_process": 72, "mathjax_process": 72, "math": 72, "output_area": 72, "nbparserconfig": 72, "custom_format": 72, "metadata_kei": 72, "mystnb": 72, "cell_metadata_kei": 72, "kernel_rgx_alias": 72, "execution_mod": 72, "execution_cache_path": 72, "execution_excludepattern": 72, "execution_timeout": 72, "execution_in_temp": 72, "execution_allow_error": 72, "execution_raise_on_error": 72, "execution_show_tb": 72, "merge_stream": 72, "render_plugin": 72, "remove_code_sourc": 72, "remove_code_output": 72, "code_prompt_show": 72, "show": 72, "code_prompt_hid": 72, "hide": 72, "number_source_lin": 72, "output_stderr": 72, "render_text_lex": 72, "ansi": 72, "render_error_lex": 72, "ipythontb": 72, "render_image_opt": 72, "render_figure_opt": 72, "render_markdown_format": 72, "commonmark": 72, "output_fold": 72, "append_css": 72, "metadata_to_fm": 72, "jupyter_cach": 72, "01mbuild": 72, "mo": 72, "00mtarget": 72, "date": [72, 76], "77": 72, "sourc": 72, "01mupdat": 72, "config": 72, "01mread": 72, "35m01": 72, "hash": 72, "01": 72, "cwd": 72, "07": 72, "02": 72, "05": 72, "35m02": 72, "00": 72, "35m03": 72, "89": 72, "87": 72, "35m04": 72, "04": 72, "27": 72, "35m05": 72, "29": 72, "35m06": 72, "06": 72, "96": 72, "91mexcept": 72, "512": 72, "_async_cleanup_kernel": 72, "await": 72, "ensure_async": 72, "km": 72, "cleanup_resourc": 72, "attributeerror": 72, "nonetyp": 72, "91mthe": 72, "save": 72, "err": 72, "tl19fjln": 72, "report": [72, 73, 74, 75], "develop": 72, "user": 72, "messag": [72, 74], "bug": [72, 74], "tracker": 72, "doc": 72, "thank": [72, 74], "jupyter_cli": 72, "wrapper": 72, "_readi": 72, "set_result": 72, "invalidstateerror": 72, "505": 72, "shutdown_kernel": 72, "jupyter_cor": 72, "189": 72, "obj": 72, "92": 72, "set_except": 72, "jupyter_book": 72, "171": 72, "build_sphinx": 72, "force_al": 72, "filenam": 72, "329": 72, "builder": 72, "build_upd": 72, "288": 72, "to_build": 72, "302": 72, "updated_docnam": 72, "409": 72, "_read_seri": 72, "docnam": 72, "430": 72, "read_doc": 72, "483": 72, "publish": [72, 73], "document": [72, 74], "reader": 72, "io": 72, "103": 72, "78": 72, "myst_nb": 72, "sphinx_": 72, "create_cli": 72, "83": 72, "__enter__": 72, "start_client": 72, "single_nb_execut": 72, "executor": 72, "58": 72, "executenb": 72, "1305": 72, "notebookcli": 72, "resourc": [72, 74], "173": 72, "run_until_complet": 72, "base_ev": 72, "649": 72, "689": 72, "async_execut": 72, "async": 72, "async_setup_kernel": 72, "contextlib": 72, "__aexit__": 72, "anext": 72, "gen": 72, "656": 72, "caus": 72, "317": 72, "builder_specific_act": 72, "525": 72, "runtimeerror": 72, "_message_box": 72, "msg": 72, "color": 72, "red": 72, "doprint": 72, "91m": 72, "pdfhtml": 72, "href": 72, "_blank": 72, "view": 72, "mybook": 72, "92m": 72, "bewar": 72, "citat": 72, "releas": [72, 76], "sourceforg": 72, "net": 72, "patch": 72, "195": 72, "intro": 72, "bib": 72, "forc": 72, "35": 72, "09": 72, "97": 72, "88": 72, "35mintro": 72, "01mlook": 72, "outdat": 72, "00mnone": 72, "01mpickl": 72, "00mdone": 72, "01mcheck": 72, "md": 72, "warn": 72, "isn": 72, "toctre": 72, "01mprepar": 72, "01mwrite": 72, "32mintro": 72, "01mgener": 72, "00mgenindex": 72, "page": 72, "00msearch": 72, "01mcopi": 72, "static": 72, "01mdump": 72, "en": 72, "inventori": 72, "written": [72, 73], "redirect": 72, "succeed": 72, "browser": 72, "Or": 72, "past": 72, "bar": 72, "project": [72, 74, 75], "jb": 72, "leader": 73, "particip": [73, 74, 75], "commun": [73, 74, 76], "harass": 73, "experi": 73, "everyon": 73, "ag": 73, "bodi": 73, "invis": 73, "disabl": 73, "ethnic": 73, "sex": 73, "characterist": 73, "gender": 73, "socio": 73, "econom": 73, "statu": 73, "nation": 73, "person": 73, "religion": 73, "sexual": 73, "orient": 73, "interact": 73, "welcom": [73, 74], "divers": 73, "healthi": 73, "behavior": [73, 76], "empathi": 73, "kind": 73, "peopl": 73, "Being": 73, "opinion": 73, "viewpoint": 73, "give": [73, 76], "gracefulli": 73, "feedback": [73, 74], "apolog": 73, "mistak": 73, "learn": 73, "focus": 73, "unaccept": 73, "imageri": 73, "attent": 73, "troll": 73, "insult": 73, "derogatori": 73, "polit": 73, "attack": 73, "privat": [73, 76], "physic": 73, "email": 73, "address": [73, 76], "explicit": 73, "permiss": 73, "inappropri": 73, "fair": 73, "action": 73, "deem": 73, "threaten": 73, "offens": 73, "harm": 73, "edit": 73, "reject": 73, "commit": [73, 74, 76], "wiki": 73, "align": 73, "decis": 73, "mail": 73, "post": 73, "via": 73, "social": 73, "media": 73, "appoint": 73, "onlin": 73, "offlin": 73, "event": 73, "abus": 73, "complaint": 73, "review": [73, 74, 75], "investig": 73, "promptli": [73, 76], "fairli": 73, "oblig": 73, "privaci": 73, "incid": 73, "consequ": 73, "unprofession": 73, "unwelcom": 73, "clariti": 73, "natur": 73, "explan": [73, 74], "unsolicit": 73, "period": 73, "channel": 73, "seriou": 73, "sustain": 73, "aggress": 73, "disparag": 73, "avail": 73, "www": 73, "org": 73, "code_of_conduct": 73, "inspir": 73, "mozilla": 73, "ladder": 73, "question": [73, 76], "faq": 73, "translat": 73, "blind": [74, 76], "75": [74, 76], "valuabl": 74, "moment": 74, "below": 74, "submit": 74, "analysi": 74, "editor": 74, "id": 74, "fork": 74, "button": 74, "usernam": 74, "checkout": 74, "test": 74, "style": 74, "meaning": 74, "collabor": 74, "approv": 74, "contributor": [74, 75], "agre": [74, 75], "appreci": 74, "serious": [75, 76], "our": [75, 76], "vulner": 75, "believ": 76, "Not": 76, "disclos": 76, "publicli": 76, "team": 76, "titl": 76, "sampl": 76, "clear": 76, "reproduc": 76, "configur": 76, "screenshot": 76, "sensit": 76, "encrypt": 76, "pgp": 76, "acknowledg": 76, "busi": 76, "estim": 76, "timelin": 76, "resolut": 76, "disclosur": 76, "resolv": 76, "advisori": 76, "credit": 76, "encourag": 76, "exploit": 76, "malici": 76, "recommend": 76, "stai": 76, "latest": 76, "assist": 76, "regard": 76, "gmail": 76}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"100": [0, 30], "same": [0, 30], "tree": [0, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 55, 75], "test": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "case": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "time": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "space": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "complex": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "analysi": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "128": 1, "longest": [1, 14, 15], "consecut": 1, "sequenc": 1, "solut": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 75], "explan": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "challeng": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 26, 27, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "exercis": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 20, 21, 24, 26, 27, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "217": 2, "contain": [2, 9], "duplic": 2, "238": 3, "product": 3, "arrai": [3, 8, 20, 21, 75], "except": 3, "self": 3, "242": 4, "valid": [4, 10, 18, 41, 55], "anagram": [4, 6], "347": 5, "top": 5, "k": [5, 28], "frequent": 5, "element": [5, 37, 49], "49": 6, "group": 6, "659": 7, "encod": 7, "decod": 7, "string": 7, "hash": [8, 75], "blind": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "75": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "leetcod": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "problem": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "contribut": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 74, 75], "resourc": [8, 12, 17, 19, 22, 29, 42, 46, 50, 53, 60, 62, 66, 67, 68, 69, 70, 71, 75], "11": 9, "With": 9, "most": 9, "water": [9, 59], "125": 10, "palindrom": 10, "15": 11, "3sum": 11, "two": [12, 27, 75], "pointer": [12, 75], "121": 13, "best": 13, "bui": 13, "sell": 13, "stock": 13, "3": [14, 73], "substr": [14, 16], "without": 14, "repeat": [14, 15], "charact": [14, 15], "424": 15, "replac": 15, "76": 16, "minimum": [16, 20], "window": [16, 17, 75], "slide": [17, 75], "20": 18, "parenthes": 18, "stack": [19, 75], "153": 20, "find": [20, 48], "rotat": [20, 21], "sort": [20, 21, 27, 28], "33": 21, "search": [21, 22, 38, 41, 44, 45, 52, 75], "binari": [22, 31, 32, 33, 34, 35, 36, 38, 39, 41, 75], "141": 23, "link": [23, 26, 29, 75], "list": [23, 24, 25, 26, 27, 28, 29, 67, 68, 69, 70, 71, 75], "cycl": 23, "143": 24, "reorder": 24, "19": 25, "remov": 25, "nth": 25, "node": 25, "from": [25, 33, 48], "end": 25, "206": 26, "revers": 26, "21": 27, "merg": [27, 28], "23": 28, "In": 30, "summari": 30, "102": 31, "level": 31, "order": 31, "travers": [31, 33], "104": 32, "maximum": [32, 34], "depth": 32, "105": 33, "construct": 33, "preorder": 33, "inord": 33, "helper": 33, "function": 33, "124": 34, "path": 34, "sum": [34, 51], "probelm": [34, 39, 43, 44, 45, 47, 48, 49, 51, 52, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65], "199": 35, "right": 35, "side": 35, "view": 35, "226": 36, "invert": 36, "230": 37, "kth": [37, 49], "smallest": 37, "bst": 37, "235": 38, "lowest": 38, "common": 38, "ancestor": 38, "297": 39, "serial": 39, "deseri": 39, "572": 40, "subtre": 40, "anoth": 40, "here": 40, "s": 40, "detail": 40, "code": [40, 73, 74, 75], "98": 41, "208": 43, "implement": 43, "trie": [43, 46], "prefix": 43, "211": 44, "design": 44, "add": 44, "word": [44, 45, 52], "data": [44, 48], "structur": 44, "212": 45, "ii": [45, 64], "1046": 47, "last": 47, "stone": 47, "weight": 47, "295": 48, "median": 48, "stream": [48, 49], "703": 49, "largest": 49, "heap": [50, 75], "prioriti": [50, 75], "queue": [50, 75], "39": 51, "combin": 51, "79": 52, "backtrack": [53, 75], "133": 54, "clone": 54, "graph": [54, 55, 58, 60, 62, 75], "178": 55, "200": 56, "number": [56, 58], "island": 56, "207": 57, "cours": 57, "schedul": 57, "3651": 58, "connect": 58, "compon": 58, "an": 58, "undirect": 58, "417": 59, "pacif": 59, "atlant": 59, "flow": 59, "892": 61, "alien": 61, "dictionari": 61, "advanc": [62, 75], "hous": [63, 64], "robber": [63, 64], "70": 65, "climb": 65, "stair": 65, "1": [66, 73, 75], "d": [66, 67, 75], "dynam": [66, 67, 75], "program": [66, 67, 75], "2": [67, 73, 75], "how": [67, 68, 69, 70, 71, 75], "us": [67, 68, 69, 70, 71, 75], "disclaim": [67, 68, 69, 70, 71, 75], "greedi": [68, 75], "interv": [69, 75], "math": [70, 75], "geometri": [70, 75], "bit": [71, 75], "manupul": 71, "contributor": 73, "coven": 73, "conduct": [73, 74, 75], "our": 73, "pledg": 73, "standard": 73, "enforc": 73, "respons": 73, "scope": 73, "guidelin": [73, 74], "correct": 73, "warn": 73, "temporari": 73, "ban": 73, "4": 73, "perman": 73, "attribut": 73, "tabl": 74, "content": 74, "wai": 74, "get": 74, "start": 74, "process": 74, "tri": 75, "manipul": 75, "secur": [75, 76], "polici": [75, 76], "report": 76, "vulner": 76, "updat": 76, "contact": 76}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.intersphinx": 1, "sphinx": 56}})
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb
deleted file mode 100644
index 5d55ca7..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/1. Two Sum.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 100: Same Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-    "\n",
-    "---\n",
-    "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-    "\n",
-    "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-    "\n",
-    "**Constraints**\n",
-    "\n",
-    "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-    "2. $-10^4$ <= `Node.val` <= $10^4$"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def isSameTree(p, q):\n",
-    "    # Base case: If both p and q are None, the trees are the same.\n",
-    "    if not p and not q:\n",
-    "        return True\n",
-    "    \n",
-    "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-    "    if not p or not q:\n",
-    "        return False\n",
-    "    \n",
-    "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-    "    if p.val != q.val:\n",
-    "        return False\n",
-    "    \n",
-    "    # Recursively check the left and right subtrees of p and q.\n",
-    "    # If both subtrees are the same, the entire trees are the same.\n",
-    "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-    "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-    "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-    "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-    "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-    "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "\n",
-    "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-    "\n",
-    "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "print(isSameTree(p1, q1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "\n",
-    "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-    "\n",
-    "p2 = TreeNode(1, TreeNode(2), None)\n",
-    "q2 = TreeNode(1, None, TreeNode(2))\n",
-    "print(isSameTree(p2, q2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "\n",
-    "#Input: p = [1,2,1], q = [1,1,2]\n",
-    "\n",
-    "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-    "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-    "print(isSameTree(p3, q3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "**Time Complexity**\n",
-    "\n",
-    "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-    "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-    "\n",
-    "**Space Complexity**\n",
-    "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-    "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-    "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-    "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "+ Time Complexity: $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-    "+ Space Complexity: $O(n)$ due to the recursive call stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb
deleted file mode 100644
index 9256d0e..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/128. Longest Consecutive Sequence.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 128. Longest Consecutive Sequence\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Consecutive Sequence problem on LeetCode, click here!](https://leetcode.com/problems/longest-consecutive-sequence/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an unsorted array of integers `nums`, return *the length of the longest consecutive elements sequence.*\n",
-    "\n",
-    "You must write an algorithm that runs in `O(n)` time.\n",
-    "\n",
-    "*Constraints:**\n",
-    "- 0 <= `nums.length` <= $10^5$\n",
-    "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def longestConsecutive(nums):\n",
-    "    if not nums:\n",
-    "        return 0\n",
-    "\n",
-    "    num_set = set(nums)\n",
-    "    max_length = 0\n",
-    "\n",
-    "    for num in num_set:\n",
-    "        if num - 1 not in num_set:\n",
-    "            current_num = num\n",
-    "            current_length = 1\n",
-    "\n",
-    "            while current_num + 1 in num_set:\n",
-    "                current_num += 1\n",
-    "                current_length += 1\n",
-    "\n",
-    "            max_length = max(max_length, current_length)\n",
-    "\n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining the `longestConsecutive` function that takes the `nums` array as input.\n",
-    "\n",
-    "2. We check if the `nums` array is empty. If it's empty, there are no consecutive elements, so we return 0.\n",
-    "\n",
-    "3. We create a Python set called `num_set` and insert all elements from the `nums` array into it. Using a set allows us to efficiently check for the existence of elements in O(1) time.\n",
-    "\n",
-    "4. We initialize a variable `max_length` to 0. This variable will keep track of the maximum length of consecutive elements sequence found.\n",
-    "\n",
-    "5. We iterate through the elements of the `num_set`. For each element `num`, we check if `num - 1` exists in the `num_set`. If it doesn't exist, it means `num` is the starting element of a potential consecutive sequence.\n",
-    "\n",
-    "6. Inside the loop, we initialize two variables: `current_num` to the current element `num` and `current_length` to 1. We start with a length of 1 because `num` itself is part of the sequence.\n",
-    "\n",
-    "7. We then enter a while loop that continues as long as `current_num + 1` exists in the `num_set`. This means we are incrementing the consecutive sequence.\n",
-    "\n",
-    "8. Inside the while loop, we increment `current_num` by 1 and also increment `current_length` by 1 to account for the next consecutive element.\n",
-    "\n",
-    "9. We compare `current_length` with the `max_length` and update `max_length` if the current sequence is longer.\n",
-    "\n",
-    "10. After the while loop, we move to the next element in the outer loop and repeat the process.\n",
-    "\n",
-    "11. Finally, we return the `max_length` as the result, which represents the length of the longest consecutive elements sequence in the `nums` array.\n",
-    "\n",
-    "The key idea here is to use a set to efficiently check for the existence of elements and to iterate through the elements, considering each element as the potential start of a consecutive sequence. By doing this, we can find the longest consecutive sequence in O(n) time complexity, where n is the number of elements in the array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "nums1 = [100, 4, 200, 1, 3, 2]\n",
-    "print(longestConsecutive(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "9\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "nums2 = [0, 3, 7, 2, 5, 8, 4, 6, 0, 1]\n",
-    "print(longestConsecutive(nums2)) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The code is designed to run in O(n) time complexity, where n is the number of elements in the `nums` array. Here's the breakdown:\n",
-    "\n",
-    "1. Constructing the `num_set` by inserting all elements from `nums` into it takes O(n) time because we perform an insertion operation for each element in `nums`.\n",
-    "\n",
-    "2. The main loop iterates through the elements in `num_set`. In the worst case, each element is visited only once, so the loop itself takes O(n) time.\n",
-    "\n",
-    "3. Within the loop, we have a while loop that may also take O(n) time in the worst case. However, this while loop is nested inside the main loop, so its overall time complexity remains O(n).\n",
-    "\n",
-    "Therefore, the overall time complexity of the code is O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of the code is determined by the space used by the `num_set` and a few additional variables. Here's the breakdown:\n",
-    "\n",
-    "1. `num_set` is a set that stores the unique elements from `nums`. In the worst case, it can store all n elements from `nums`, so the space complexity is O(n).\n",
-    "\n",
-    "2. The additional variables used, such as `max_length`, `current_num`, and `current_length`, have constant space requirements and do not depend on the size of the input array.\n",
-    "\n",
-    "Therefore, the overall space complexity of the code is O(n) due to the space used by the `num_set`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. Write an algorithm that not only returns the length of the longest consecutive elements sequence but also returns the actual consecutive sequence itself.\n",
-    "\n",
-    "2. Extend the problem to allow elements to be considered consecutive if they are within a certain absolute difference (e.g., less than or equal to k) instead of exactly 1. Write an algorithm that finds the longest such sequence and runs in O(n) time."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb
deleted file mode 100644
index f7dbbe9..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/217. Contains Duplicate.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 217. Contains Duplicate\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Contains Duplicate problem on LeetCode, click here!](https://leetcode.com/problems/contains-duplicate/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `nums.length` <= $10^5$\n",
-    "- $-10^9$ <= `nums[i]` <= $10^9$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def containsDuplicate(nums):\n",
-    "    # Create an empty set to store unique elements\n",
-    "    unique_elements = set()\n",
-    "    \n",
-    "    # Iterate through the array\n",
-    "    for num in nums:\n",
-    "        # If the element is already in the set, return True\n",
-    "        if num in unique_elements:\n",
-    "            return True\n",
-    "        # Otherwise, add it to the set\n",
-    "        else:\n",
-    "            unique_elements.add(num)\n",
-    "    \n",
-    "    # If the loop completes without finding duplicates, return False\n",
-    "    return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `containsDuplicate` function takes a single argument, `nums`, which is the input integer array.\n",
-    "\n",
-    "2. Inside the function, an empty set called `unique_elements` is created. This set will be used to keep track of unique elements in the input array.\n",
-    "\n",
-    "3. The function then iterates through the input array `nums` using a `for` loop.\n",
-    "\n",
-    "4. For each element `num` in the array, it checks whether `num` is already in the `unique_elements` set using the `if num in unique_elements:` condition.\n",
-    "\n",
-    "5. If `num` is already in the set, it means there is a duplicate element in the array, and the function immediately returns `True`.\n",
-    "\n",
-    "6. If `num` is not in the set, it is added to the `unique_elements` set using `unique_elements.add(num)`.\n",
-    "\n",
-    "7. The loop continues to the next element, and the process repeats.\n",
-    "\n",
-    "8. If the loop completes without finding any duplicates, it means that all elements in the array are distinct, and the function returns `False`.\n",
-    "\n",
-    "The code efficiently utilizes a set data structure to keep track of unique elements while iterating through the array, allowing it to quickly detect duplicate elements. This code meets the problem's requirements and constraints, as explained earlier."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "nums1 = [1, 2, 3, 1]\n",
-    "print(containsDuplicate(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "nums2 = [1, 2, 3, 4]\n",
-    "print(containsDuplicate(nums2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "nums3 = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2]\n",
-    "print(containsDuplicate(nums3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for the \"Contains Duplicate\" problem:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The primary operation that affects the time complexity is the `for` loop that iterates through the input array `nums`. In the worst case, the loop will iterate through all `n` elements of the array, where `n` is the length of the input array.\n",
-    "\n",
-    "- Iterating through the array: O(n)\n",
-    "\n",
-    "Inside the loop, we perform two operations:\n",
-    "\n",
-    "1. Checking whether an element exists in the `unique_elements` set (`if num in unique_elements`). This operation has an average time complexity of O(1) for a set.\n",
-    "2. Adding an element to the `unique_elements` set (`unique_elements.add(num)`), which also has an average time complexity of O(1) for a set.\n",
-    "\n",
-    "Since these operations are performed for each element in the array, the overall time complexity remains O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity is determined by the additional data structures used in the code, which are the `unique_elements` set.\n",
-    "\n",
-    "- `unique_elements` set: This set stores unique elements from the input array. In the worst case, if all elements in the input array are distinct, the set will store all `n` elements.\n",
-    "\n",
-    "Therefore, the space complexity is O(n) because, in the worst case, the set's size will grow linearly with the input array's size.\n",
-    "\n",
-    "**In summary**, the time complexity of the code is O(n), where `n` is the length of the input array, and the space complexity is also O(n) in the worst case. This code is efficient and meets the constraints of the problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K Duplicates:** Modify the problem to return `true` if there are exactly K duplicate elements in the array. Write a function that takes an additional integer parameter K and returns `true` if there are exactly K duplicates.\n",
-    "2. **Frequency Count:** Write a function that returns a list of all the elements that appear more than once in the array, along with their frequencies."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb
deleted file mode 100644
index c5a69c0..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/238. Product of Array Except Self.ipynb	
+++ /dev/null
@@ -1,191 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 238. Product of Array Except Self\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Product of Array Except Self problem on LeetCode, click here!](https://leetcode.com/problems/product-of-array-except-self/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array `nums`, return *an array `answer` such that `answer[i]` is equal to the product of all the elements of `nums` except `nums[i]`.*\n",
-    "\n",
-    "The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-    "\n",
-    "You must write an algorithm that runs in O(n) time and without using the division operation.\n",
-    "\n",
-    "Constraints:\n",
-    "- 2 <= `nums.length` <= $10^5$\n",
-    "- `-30 <= nums[i] <= 30`\n",
-    "- The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.\n",
-    "\n",
-    "**Follow-up:** Can you solve the problem in O(1) extra space complexity? (The output array **does not** count as extra space for space complexity analysis.)\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def productExceptSelf(nums):\n",
-    "    n = len(nums)\n",
-    "    \n",
-    "    # Initialize two arrays to store products to the left and right of each element\n",
-    "    left_products = [1] * n\n",
-    "    right_products = [1] * n\n",
-    "    \n",
-    "    # Calculate products to the left of each element\n",
-    "    left_product = 1\n",
-    "    for i in range(n):\n",
-    "        left_products[i] = left_product\n",
-    "        left_product *= nums[i]\n",
-    "    \n",
-    "    # Calculate products to the right of each element\n",
-    "    right_product = 1\n",
-    "    for i in range(n - 1, -1, -1):\n",
-    "        right_products[i] = right_product\n",
-    "        right_product *= nums[i]\n",
-    "    \n",
-    "    # Calculate the final answer using left and right products\n",
-    "    answer = [left_products[i] * right_products[i] for i in range(n)]\n",
-    "    \n",
-    "    return answer"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `n` is initialized as the length of the `nums` array.\n",
-    "2. Two arrays, `left_products` and `right_products`, are created, each with a length of `n` and filled with ones initially.\n",
-    "3. `left_product` is initialized to 1.\n",
-    "4. A loop iterates through the `nums` array, from left to right. For each element at index `i`, it stores the product of all elements to its left (including itself) in the `left_products` array and updates `left_product` accordingly.\n",
-    "5. `right_product` is initialized to 1.\n",
-    "6. Another loop iterates through the `nums` array in reverse order, from right to left. For each element at index `i`, it stores the product of all elements to its right (including itself) in the `right_products` array and updates `right_product`.\n",
-    "7. The final `answer` list is constructed by multiplying corresponding elements from the `left_products` and `right_products` arrays for each index `i`.\n",
-    "8. The function returns the `answer` list, which contains the desired results.\n",
-    "\n",
-    "Overall, this algorithm efficiently computes the product of all elements except the current element, as required. It runs in O(n) time complexity and uses O(n) extra space, which is within the problem's constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[24, 12, 8, 6]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "nums = [1,2,3,4]\n",
-    "result1 = productExceptSelf(nums)\n",
-    "print(result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[0, 0, 9, 0, 0]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums = [-1,1,0,-3,3]\n",
-    "result2 = productExceptSelf(nums)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The first loop iterates through the `nums` array to calculate the products to the left of each element. This loop runs in O(n) time, where n is the length of the `nums` array.\n",
-    "2. The second loop also iterates through the `nums` array in reverse order to calculate the products to the right of each element. This loop also runs in O(n) time.\n",
-    "3. The final loop constructs the `answer` list by multiplying elements from the `left_products` and `right_products` arrays. This loop runs in O(n) time.\n",
-    "\n",
-    "Since all the loops are independent and sequential, the overall time complexity is O(n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. Two additional arrays, `left_products` and `right_products`, are created with a length of `n`, where `n` is the length of the `nums` array. Therefore, these arrays consume O(n) extra space.\n",
-    "2. The `left_product` and `right_product` variables are used to keep track of the product to the left and right of each element, respectively. These variables occupy O(1) extra space.\n",
-    "3. The `answer` list, which contains the final results, also consumes O(n) space, but it's not counted toward the extra space complexity analysis as per the problem's constraints.\n",
-    "\n",
-    "Overall, the space complexity is O(n) for this solution."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Handle Zeros in the Input**: Modify the solution to handle cases where the input array contains zeros. For example, if `nums = [0, 1, 2, 3, 0]`, the output should be `[0, 0, 0, 0, 0]` because any element multiplied by zero results in zero.\n",
-    "\n",
-    "2. **In-Place Modification**: Attempt to solve the problem with in-place modification of the `nums` array, where the output is stored directly in the input array without using any additional space."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb
deleted file mode 100644
index 5649123..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/242. Valid Anagram.ipynb	
+++ /dev/null
@@ -1,192 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 242. Valid Anagram\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Anagram problem on LeetCode, click here!](https://leetcode.com/problems/valid-anagram/)\n",
-    "\n",
-    "---\n",
-    "Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.\n",
-    "\n",
-    "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `s.length`, `t.length` <= $5 * 10^4$\n",
-    "- `s` and `t` consist of lowercase English letters.\n",
-    "\n",
-    "**Follow-up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isAnagram(s: str, t: str) -> bool:\n",
-    "    # Check if the lengths of s and t are not equal\n",
-    "    if len(s) != len(t):\n",
-    "        return False\n",
-    "\n",
-    "    # Create dictionaries to store character frequencies for s and t\n",
-    "    countS, countT = {}, {}\n",
-    "\n",
-    "    # Count character frequencies in s\n",
-    "    for i in range(len(s)):\n",
-    "        countS[s[i]] = 1 + countS.get(s[i], 0)\n",
-    "\n",
-    "    # Count character frequencies in t\n",
-    "    for i in range(len(t)):\n",
-    "        countT[t[i]] = 1 + countT.get(t[i], 0)\n",
-    "\n",
-    "    # Check if the character frequencies in s and t are the same\n",
-    "    return countS == countT"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The code defines a class called `Solution` with a method `isAnagram` that takes two input strings, `s` and `t`, and returns a boolean (`True` or `False`) based on whether `t` is an anagram of `s`.\n",
-    "\n",
-    "2. The first check performed in the method is whether the lengths of `s` and `t` are equal. If they are not equal, it immediately returns `False` because strings of different lengths cannot be anagrams of each other.\n",
-    "\n",
-    "3. Two dictionaries, `countS` and `countT`, are created to store the frequency of characters in `s` and `t`, respectively. These dictionaries will be used to count the occurrences of each character in the strings.\n",
-    "\n",
-    "4. The code then enters a loop to iterate through each character in string `s` using a `for` loop. Inside the loop, it updates the `countS` dictionary. The line `countS[s[i]] = 1 + countS.get(s[i], 0)` increments the count of character `s[i]` in `countS` by 1. If the character is not already in the dictionary, it initializes the count to 1.\n",
-    "\n",
-    "5. Similarly, the code iterates through each character in string `t` and updates the `countT` dictionary in the same way.\n",
-    "\n",
-    "6. After counting the character frequencies in both strings, the code compares the two dictionaries using `countS == countT`. If the dictionaries are equal, it means that both strings have the same character frequencies, and therefore, `t` is an anagram of `s`. In this case, the method returns `True`.\n",
-    "\n",
-    "7. If the dictionaries are not equal, the method returns `False`, indicating that `t` is not an anagram of `s`.\n",
-    "\n",
-    "In summary, this code efficiently determines whether two input strings are anagrams by counting the character frequencies in each string using dictionaries and then comparing these counts. If the character frequencies match, the strings are considered anagrams, and the method returns `True`; otherwise, it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "s = \"anagram\"\n",
-    "t = \"nagaram\"\n",
-    "print(isAnagram(s, t))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "s = \"rat\"\n",
-    "t = \"car\"\n",
-    "print(isAnagram(s, t))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. The code first checks whether the lengths of the input strings `s` and `t` are equal, which takes constant time. This check has a time complexity of O(1).\n",
-    "\n",
-    "2. The code then iterates through both strings, `s` and `t`, once to count the character frequencies. Since both strings have a maximum length of 5 * 10^4, the worst-case scenario is that the code iterates through 5 * 10^4 characters in each string. This results in a linear time complexity of O(n), where n is the length of the longer of the two input strings (`s` or `t`).\n",
-    "\n",
-    "3. Finally, the code compares the two dictionaries `countS` and `countT` to check if the character frequencies match. This comparison takes O(n) time in the worst case, where n is the length of the longer string.\n",
-    "\n",
-    "Overall, the time complexity of the code is O(n), where n is the length of the longer input string.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The code uses two dictionaries, `countS` and `countT`, to store the character frequencies of the input strings `s` and `t`. In the worst case, both dictionaries can contain all unique characters from the input strings. Since the input strings can have a maximum length of 5 * 10^4, the space complexity for these dictionaries is O(5 * 10^4) or simply O(n), where n is the length of the longer input string.\n",
-    "\n",
-    "2. The code uses a few additional variables for bookkeeping, but these variables have constant space requirements and do not depend on the input size. Therefore, they do not significantly impact the overall space complexity.\n",
-    "\n",
-    "**In summary**, the space complexity of the code is O(n), where n is the length of the longer input string."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Anagram Chains**: Given a list of words, find the longest chain of anagrams, where each word in the chain is an anagram of the previous word. For example, given [\"bat\", \"tab\", \"cat\", \"tac\", \"dog\"], the longest anagram chain is [\"bat\", \"tab\", \"cat\", \"tac\"].\n",
-    "\n",
-    "2. **Minimum Deletions to Make Anagrams**: Given two strings `s` and `t`, find the minimum number of character deletions required in both strings to make them anagrams of each other. For example, if `s = \"hello\"` and `t = \"billion\"`, you can remove the characters \"heo\" from `s` and \"billi\" from `t` to make them anagrams (\"lo\" and \"on\" are left in the two strings)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb
deleted file mode 100644
index 1b11faf..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/347. Top K Frequent Elements.ipynb	
+++ /dev/null
@@ -1,209 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 347. Top K Frequent Elements\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Top K Frequent Elements problem on LeetCode, click here!](https://leetcode.com/problems/top-k-frequent-elements/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.\n",
-    "\n",
-    "Constraints:\n",
-    "- 1 <= `nums.length` <= $10^5$\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- `k` is in the range `[1, the number of unique elements in the array]`.\n",
-    "- It is **guaranteed** that the answer is **unique**.\n",
-    "\n",
-    "**Follow-up:** Your algorithm's time complexity must be better than $O(n\\ log\\ n)$, where n is the array's size.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def topKFrequent(nums, k):\n",
-    "    # Create a dictionary to store the frequency of each element\n",
-    "    count = {}\n",
-    "    # Create a list of lists to store elements with the same frequency\n",
-    "    frequency = [[] for i in range(len(nums) + 1)]\n",
-    "\n",
-    "    # Count the frequency of each element in nums\n",
-    "    for n in nums:\n",
-    "        count[n] = 1 + count.get(n, 0)\n",
-    "\n",
-    "    # Place elements in the freq list according to their frequency\n",
-    "    for n, c in count.items():\n",
-    "        frequency[c].append(n)\n",
-    "\n",
-    "    res = []\n",
-    "    # Traverse freq list from the end (higher frequencies)\n",
-    "    for i in range(len(frequency) - 1, 0, -1):\n",
-    "        for n in frequency[i]:\n",
-    "            res.append(n)\n",
-    "            if len(res) == k:\n",
-    "                return res"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `def topKFrequent(nums, k):`: This is a function that takes two arguments: `nums`, which is the input array of integers, and `k`, which is the number of most frequent elements to return.\n",
-    "\n",
-    "2. `count = {}`: This dictionary `count` will be used to store the frequency of each unique element in the `nums` array. The keys are elements from the input array, and the values are their corresponding frequencies.\n",
-    "\n",
-    "3. `frequency = [[] for i in range(len(nums) + 1)]`: This creates a list of empty lists called `frequency`. It's used to store elements based on their frequencies, similar to the `freq` list in the previous code. The size of this list is set to be one greater than the length of the input `nums`.\n",
-    "\n",
-    "4. `for n in nums:`: This loop iterates through each element `n` in the input `nums` array.\n",
-    "\n",
-    "5. `count[n] = 1 + count.get(n, 0)`: This line counts the frequency of each element `n` in the `nums` array. It uses the `count.get(n, 0)` method to retrieve the current count of `n` from the `count` dictionary. If `n` is not in the dictionary, it defaults to 0. It then increments the count by 1.\n",
-    "\n",
-    "6. After the above loop, the `count` dictionary will contain counts of each unique element in the `nums` array.\n",
-    "\n",
-    "7. `for n, c in count.items():`: This loop iterates through the items (key-value pairs) of the `count` dictionary. `n` represents the element, and `c` represents its frequency.\n",
-    "\n",
-    "8. `frequency[c].append(n)`: This line places the element `n` into the bucket corresponding to its frequency `c`. Buckets are represented by the `frequency` list. For example, if an element `n` has a frequency of 3, it will be added to `frequency[3]`.\n",
-    "\n",
-    "9. After this loop, the `frequency` list will contain buckets of elements grouped by their frequencies.\n",
-    "\n",
-    "10. `res = []`: This list `res` will be used to store the k most frequent elements.\n",
-    "\n",
-    "11. `for i in range(len(freq) - 1, 0, -1):`: This loop iterates in reverse order through the `frequency` list, starting from the highest frequency and going down to 1. Note that there is a typo here; it should be `frequency` instead of `freq`.\n",
-    "\n",
-    "12. `for n in frequency[i]:`: For each element `n` in the current bucket (i.e., elements with frequency `i`), it appends `n` to the result list `res`.\n",
-    "\n",
-    "13. `if len(res) == k:`: Once `res` contains k elements, the code exits and returns the result.\n",
-    "\n",
-    "The code efficiently finds the k most frequent elements in the input array without using sorting, similar to the previous explanation, with the only difference being the variable names (e.g., `frequency` instead of `freq`)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 2]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "nums = [1,1,1,2,2,3]\n",
-    "k = 2\n",
-    "result1 = topKFrequent(nums, k)\n",
-    "print(result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums = [1]\n",
-    "k = 1\n",
-    "result2 = topKFrequent(nums, k)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The first loop that counts the frequency of elements by iterating through `nums` has a time complexity of O(n), where n is the number of elements in the input array `nums`.\n",
-    "\n",
-    "2. The second loop iterates through the keys in the `count` dictionary, which has at most `k` unique elements (as per the constraints). Therefore, the second loop also has a time complexity of O(k).\n",
-    "\n",
-    "3. The third loop iterates through the `frequency` list, which has a length equal to the maximum frequency of elements in `nums`. In the worst case, this loop can have a time complexity of O(n), where n is the number of elements in `nums`.\n",
-    "\n",
-    "Overall, the dominant factor in terms of time complexity is the loop that iterates through the `count` dictionary. So, the total time complexity of the code is O(n + k).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The `count` dictionary stores the frequency of each unique element in `nums`. In the worst case, it can have at most `k` unique elements, so the space complexity for `count` is O(k).\n",
-    "\n",
-    "2. The `frequency` list is used to store elements grouped by their frequencies. It has a length of `len(nums) + 1`, which can be at most 105 based on the constraints. Therefore, the space complexity for `frequency` is O(105).\n",
-    "\n",
-    "3. The `res` list stores the k most frequent elements, which can be at most `k` elements, so the space complexity for `res` is O(k).\n",
-    "\n",
-    "**In summary**, the space complexity is dominated by the `count` dictionary and the `frequency` list, both of which have a space complexity of O(k + 105)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimized k Most Frequent Elements:** Modify the code to find the k most frequent elements in an array while ensuring that the time complexity is O(n + klogk). You can use a priority queue (heap) to achieve this.\n",
-    "\n",
-    "2. **Handling Duplicate Frequencies:** Extend the code to handle cases where multiple elements have the same frequency and are among the k most frequent elements. Ensure that the output contains exactly k elements."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb
deleted file mode 100644
index 256e8f7..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/49. Group Anagrams.ipynb	
+++ /dev/null
@@ -1,221 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 49. Group Anagrams\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Group Anagrams problem on LeetCode, click here!](https://leetcode.com/problems/group-anagrams/)\n",
-    "\n",
-    "---\n",
-    "Given an array of strings `strs`, group **the anagrams** together. You can return the answer in **any order**.\n",
-    "\n",
-    "An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `strs.length <= $10^4$\n",
-    "- `0 <= strs[i].length <= 100`\n",
-    "- `strs[i]` consists of lowercase English letters.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict\n",
-    "\n",
-    "\n",
-    "def groupAnagrams(strs):\n",
-    "    ans = defaultdict(list)\n",
-    "\n",
-    "    # Iterate through the list of input strings\n",
-    "    for s in strs:\n",
-    "        # Initialize a list to represent character counts for each character (a-z)\n",
-    "        count = [0] * 26\n",
-    "\n",
-    "        # Count the occurrences of each character in the current word\n",
-    "        for c in s:\n",
-    "            count[ord(c) - ord(\"a\")] += 1\n",
-    "\n",
-    "        # Use a tuple of character counts as the key and append the word to the anagram group\n",
-    "        ans[tuple(count)].append(s)\n",
-    "\n",
-    "    # Convert the values (lists of anagrams) to a list of lists\n",
-    "    return list(ans.values())"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. Inside the method, a `defaultdict` called `ans` is created to store anagram groups. This dictionary will have a list as its default value, meaning that each key in the dictionary will be associated with an empty list by default.\n",
-    "\n",
-    "2. The code then iterates through the list of input strings, `strs`, using a `for` loop. For each word `s` in `strs`, it performs the following steps:\n",
-    "\n",
-    "   - It initializes a list `count` of length 26, where each element represents the count of a specific character (a-z) in the word `s`.\n",
-    "\n",
-    "   - The code then iterates through the characters of `s`. For each character `c`, it increments the corresponding count in the `count` list based on its ASCII value.\n",
-    "\n",
-    "   - After counting the characters in `s`, it converts the `count` list into a tuple `tuple(count)` to use as a key for the `ans` dictionary.\n",
-    "\n",
-    "   - It appends the word `s` to the list associated with the key (tuple) in the `ans` dictionary. This groups all anagrams of the same word together under the same key.\n",
-    "\n",
-    "3. After processing all words in `strs`, the code converts the values of the `ans` dictionary (which are lists of anagrams) to a list of lists using the `list()` constructor.\n",
-    "\n",
-    "4. Finally, the code returns the list of anagram groups, which is the result of grouping the anagrams in the input list.\n",
-    "\n",
-    "In summary, the code efficiently groups anagrams together by counting the characters in each word and using a dictionary to store them under the same key. The result is a list of lists, where each inner list represents a group of anagrams."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['eat', 'tea', 'ate'], ['tan', 'nat'], ['bat']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: Group anagrams from a list of words\n",
-    "strs1 = [\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]\n",
-    "result1 = groupAnagrams(strs1)\n",
-    "print(result1)\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: Group anagrams from a list with an empty string\n",
-    "strs2 = [\"\"]\n",
-    "result2 = groupAnagrams(strs2)\n",
-    "print(result2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "c8367e2a-e7d5-4e18-8235-2870e341a04b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[['a']]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3: Group anagrams from a list with a single word\n",
-    "strs3 = [\"a\"]\n",
-    "result3 = groupAnagrams(strs3)\n",
-    "print(result3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `groupAnagrams` method:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. First, we create an instance of the `Solution` class, which is an O(1) operation.\n",
-    "\n",
-    "2. Inside the `groupAnagrams` method, we iterate through the list of input strings `strs` once in a loop:\n",
-    "   - For each word in `strs`, we perform character counting, which is done in O(K) time, where K is the maximum length of a word in the list.\n",
-    "\n",
-    "3. The overall time complexity of the method is O(N * K), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. We use a `defaultdict` called `ans` to store the anagram groups. In the worst case, each word belongs to a distinct anagram group, so the space complexity for `ans` is O(N).\n",
-    "\n",
-    "2. Within the loop, we create a `count` list of length 26 to store character counts for each word. This is a fixed-size list and does not depend on the input size, so it has a constant space complexity of O(26), which is effectively O(1).\n",
-    "\n",
-    "3. The space used for other variables is also constant and does not depend on the input size.\n",
-    "\n",
-    "4. The final result, `result`, is a list of lists that contains the grouped anagrams. In the worst case, each word is a distinct anagram group, so the space complexity for `result` is O(N).\n",
-    "\n",
-    "5. The overall space complexity of the method is O(N) due to the space used by `ans` and `result`. The space used by the `count` list and other variables is constant and does not significantly affect the overall space complexity.\n",
-    "\n",
-    "**In summary,** the time complexity of the `groupAnagrams` method is O(N * K), and the space complexity is O(N), where N is the number of words in the input list `strs`, and K is the maximum length of a word in `strs`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Anagramic Palindromes**: Given a list of strings, find all the groups of anagrams where each group contains words that can be rearranged into a palindrome. For example, in the list [\"bat\", \"tab\", \"act\", \"tac\", \"dog\"], there are two groups: [\"bat\", \"tab\", \"act\", \"tac\"] and [\"dog\"].\n",
-    "\n",
-    "2. **Largest Anagram Group**: Given a list of strings, find the largest group of anagrams. Return the list of anagrams in that group. If there are multiple largest groups, return all of them."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb b/docs/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb
deleted file mode 100644
index 2fae2a5..0000000
--- a/docs/_build/jupyter_execute/01. Array Hashing/659. Encode and Decode Strings.ipynb	
+++ /dev/null
@@ -1,198 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 659· Encode and Decode Strings\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Encode and Decode Strings problem on LintCode, click here!](https://www.lintcode.com/problem/659/)\n",
-    "\n",
-    "---\n",
-    "Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.\n",
-    "\n",
-    "Please implement `encode` and `decode`.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class Codec:\n",
-    "\n",
-    "    def encode(self, strs):\n",
-    "        \"\"\"Encodes a list of strings to a single string.\n",
-    "        \n",
-    "        :type strs: List[str]\n",
-    "        :rtype: str\n",
-    "        \"\"\"\n",
-    "        encoded = \"\"\n",
-    "        for s in strs:\n",
-    "            encoded += s.replace(':', '::') + ':;'\n",
-    "        return encoded\n",
-    "\n",
-    "    def decode(self, s):\n",
-    "        \"\"\"Decodes a single string to a list of strings.\n",
-    "        \n",
-    "        :type s: str\n",
-    "        :rtype: List[str]\n",
-    "        \"\"\"\n",
-    "        decoded = []\n",
-    "        i = 0\n",
-    "        while i < len(s):\n",
-    "            end = s.find(':;', i)\n",
-    "            if end == -1:\n",
-    "                end = len(s)\n",
-    "            decoded.append(s[i:end].replace('::', ':'))\n",
-    "            i = end + 2\n",
-    "        return decoded"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a class called `Codec` to encapsulate the encoding and decoding operations for a list of strings.\n",
-    "\n",
-    "2. In the `encode` method, we take a list of strings (`strs`) as input and return a single encoded string. The encoding process involves concatenating the strings together with a delimiter `:;`. We iterate through each string in the input list, replace any occurrence of `:` with `::` (to avoid conflicts with the delimiter), and then append `:;` to indicate the end of that string.\n",
-    "\n",
-    "3. In the `decode` method, we take an encoded string (`s`) as input and return a list of strings. The decoding process involves splitting the encoded string using the `:;` delimiter. We start from the beginning of the encoded string (`i = 0`) and repeatedly find the next occurrence of `:;`. We extract the substring between the current position (`i`) and the next delimiter (`end`). Before adding it to the result list, we replace any `::` with `:` to revert the encoding. We then update the current position `i` to be after the delimiter, so we can find the next substring in the next iteration.\n",
-    "\n",
-    "4. Finally, we create an instance of the `Codec` class and test it with two examples:\n",
-    "\n",
-    "By using the `:;` delimiter and handling the `::` escaping, this code can encode and decode lists of strings, preserving the original content even if it contains colons or the delimiter itself."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['lint', 'code', 'love', 'you']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "codec = Codec()\n",
-    "\n",
-    "input1 = [\"lint\", \"code\", \"love\", \"you\"]\n",
-    "encoded1 = codec.encode(input1)\n",
-    "decoded1 = codec.decode(encoded1)\n",
-    "print(decoded1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['we', 'say', ':', 'yes']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "codec = Codec() \n",
-    "\n",
-    "input2 = [\"we\", \"say\", \":\", \"yes\"]\n",
-    "encoded2 = codec.encode(input2)\n",
-    "decoded2 = codec.decode(encoded2)\n",
-    "print(decoded2)  "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `encode` and `decode` methods in the provided code.\n",
-    "\n",
-    "**Encode Method (`encode`):**\n",
-    "\n",
-    "- Time Complexity: O(n * m)\n",
-    "  - Here, `n` is the number of strings in the input list `strs`, and `m` is the average length of these strings.\n",
-    "  - In the worst case, for each string in the list, we iterate over its characters once to replace any colons (`:`) with double colons (`::`) and then append `:;`. This is done for each string in the list.\n",
-    "\n",
-    "- Space Complexity: O(n * m)\n",
-    "  - The space complexity is also O(n * m) because we build the encoded string by concatenating the modified strings. In the worst case, the encoded string can be of the same length as the original strings.\n",
-    "\n",
-    "**Decode Method (`decode`):**\n",
-    "\n",
-    "- Time Complexity: O(n * m)\n",
-    "  - Similar to the encode method, we iterate through the encoded string in the decode method. In the worst case, we may have to scan each character in the encoded string to find the `:;` delimiter.\n",
-    "\n",
-    "- Space Complexity: O(n * m)\n",
-    "  - The space complexity of the decode method is also O(n * m) because we build the list of decoded strings, which can be of the same length as the encoded string.\n",
-    "\n",
-    "Overall, both the `encode` and `decode` methods have time and space complexities of O(n * m), where `n` is the number of strings in the input list, and `m` is the average length of these strings. The space complexity arises from storing the encoded or decoded strings, and the time complexity arises from iterating through the characters in these strings."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Delimiters**: Modify the code to allow for multiple delimiters, not just one. Each string could have its own delimiter, and the code should be able to handle this complexity.\n",
-    "\n",
-    "2. **Optimize Encoding**: Modify the `encode` method to achieve a more efficient encoding algorithm. Try to minimize the length of the encoded string while ensuring that it can be correctly decoded."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb b/docs/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb
deleted file mode 100644
index e330eb0..0000000
--- a/docs/_build/jupyter_execute/02. Two Pointers/11. Container With Most Water.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 11. Container With Most Water\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Container With Most Water problem on LeetCode, click here!](https://leetcode.com/problems/container-with-most-water/)\n",
-    "\n",
-    "---\n",
-    "You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the $i^{th}$ line are `(i, 0)` and `(i, height[i])`.\n",
-    "\n",
-    "Find two lines that together with the x-axis form a container, such that the container contains the most water.\n",
-    "\n",
-    "Return *the maximum amount of water a container can store.*\n",
-    "\n",
-    "**Notice** that you may not slant the container.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `n == height.length`\n",
-    "- 2 <= `n` <= $10^5$\n",
-    "- 0 <= `height[i]` <= $10^4$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def maxArea(height):\n",
-    "    # Initialize the maximum area to 0.\n",
-    "    max_area = 0\n",
-    "    # Initialize two pointers, one at the beginning (left) and one at the end (right) of the array.\n",
-    "    left = 0\n",
-    "    right = len(height) - 1\n",
-    "\n",
-    "    # Iterate until the left pointer is less than the right pointer.\n",
-    "    while left < right:\n",
-    "        # Calculate the height of the container, which is the minimum height of the two lines.\n",
-    "        h = min(height[left], height[right])\n",
-    "        # Calculate the width of the container, which is the distance between the two pointers.\n",
-    "        width = right - left\n",
-    "        # Calculate the area of the container using height and width and update max_area if it's greater.\n",
-    "        max_area = max(max_area, h * width)\n",
-    "\n",
-    "        # Move the pointer with the shorter line inward.\n",
-    "        if height[left] < height[right]:\n",
-    "            left += 1\n",
-    "        else:\n",
-    "            right -= 1\n",
-    "\n",
-    "    # Continue this process until left < right, and then return the maximum area.\n",
-    "    return max_area"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start with initializing `max_area` to 0, which will store the maximum area of water that can be contained by the lines.\n",
-    "\n",
-    "2. Two pointers, `left` and `right`, are initialized to the beginning and end of the input `height` array.\n",
-    "\n",
-    "3. The main loop runs while `left` is less than `right`. This ensures that we are checking all possible pairs of lines in a systematic way.\n",
-    "\n",
-    "4. Inside the loop:\n",
-    "   - We calculate the height of the container `h` as the minimum of the heights at the `left` and `right` pointers. This represents the height of the water the container can hold.\n",
-    "   - We calculate the width of the container as the difference between `right` and `left`. This represents the distance between the two lines.\n",
-    "   - We calculate the area of the container using `h * width` and update `max_area` if the calculated area is greater than the current `max_area`.\n",
-    "\n",
-    "5. After calculating the area and updating `max_area`, we move one of the pointers. We move the pointer pointing to the shorter line inward because moving the pointer pointing to the taller line won't increase the height and will only decrease the width, which will result in a smaller area.\n",
-    "\n",
-    "6. We continue this process until `left` is no longer less than `right`, indicating that we have checked all possible pairs of lines.\n",
-    "\n",
-    "7. Finally, we return the `max_area` which contains the maximum area of water that can be contained by two lines from the input array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 49\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "height1 = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n",
-    "result1 = maxArea(height1)\n",
-    "print(\"Output:\", result1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "height2 = [1, 1]\n",
-    "result2 = maxArea(height2)\n",
-    "print(\"Output:\", result2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Output: 45\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Additional Example\n",
-    "height3 = [3, 9, 3, 4, 7, 2, 12, 6]\n",
-    "result3 = maxArea(height3)\n",
-    "print(\"Output:\", result3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `maxArea` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The function uses a two-pointer approach to find the maximum area of water. In the worst case, both the left and right pointers traverse the entire input array once. Therefore, the time complexity is O(n), where n is the number of elements in the `height` array.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The function uses a constant amount of extra space for variables like `max_area`, `left`, `right`, `h`, and `width`. It does not use any data structures whose space consumption depends on the input size. As a result, the space complexity is O(1), which means it has constant space complexity.\n",
-    "\n",
-    "**In summary,** the `maxArea` function has a time complexity of O(n) and a space complexity of O(1), making it an efficient algorithm for finding the maximum area of water that can be contained by two lines in the input array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the maxArea function to not only return the maximum area but also the indices of the two lines that form the container with the maximum area.\n",
-    "2. **Variant Problem:** Instead of finding the maximum area of water, find the minimum amount of water required to fill all the gaps between the lines. You'll need to return the total water volume needed."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb b/docs/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb
deleted file mode 100644
index 12c7daa..0000000
--- a/docs/_build/jupyter_execute/02. Two Pointers/125. Valid Palindrome.ipynb	
+++ /dev/null
@@ -1,210 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 125. Valid Palindrome\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Palindrome problem on LeetCode, click here!](https://leetcode.com/problems/valid-palindrome/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "A phrase is a **palindrome** if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.\n",
-    "\n",
-    "Given a string `s`, *return `true` if it is a **palindrome**, or `false` otherwise.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $2*10^5$\n",
-    "- `s` consists only of printable ASCII characters.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isPalindrome(s):\n",
-    "    # Step 1: Convert the input string to lowercase\n",
-    "    s = s.lower()\n",
-    "    \n",
-    "    # Step 2: Remove all non-alphanumeric characters from the string\n",
-    "    cleaned_s = ''.join(c for c in s if c.isalnum())\n",
-    "    \n",
-    "    # Step 3: Initialize two pointers, one at the beginning and one at the end of the cleaned string\n",
-    "    left, right = 0, len(cleaned_s) - 1\n",
-    "    \n",
-    "    # Step 4: Compare characters using the two pointers while moving them towards each other\n",
-    "    while left < right:\n",
-    "        if cleaned_s[left] != cleaned_s[right]:\n",
-    "            return False  # If characters don't match, it's not a palindrome\n",
-    "        left += 1\n",
-    "        right -= 1\n",
-    "    \n",
-    "    # Step 5: If the loop completes without returning False, it's a palindrome\n",
-    "    return True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `isPalindrome` function takes an input string `s`.\n",
-    "\n",
-    "2. It starts by converting the input string to lowercase using `s.lower()`. This step ensures that the function is case-insensitive when checking for palindromes.\n",
-    "\n",
-    "3. Next, it removes all non-alphanumeric characters from the string and stores the result in the `cleaned_s` variable. It does this by iterating through each character in the input string and only keeping characters that are alphanumeric (letters and digits). This step removes spaces, punctuation, and other non-alphanumeric characters.\n",
-    "\n",
-    "4. The function then initializes two pointers, `left` and `right`, which will be used to compare characters from the beginning and end of the cleaned string.\n",
-    "\n",
-    "5. In a while loop, it compares characters using the two pointers while moving them towards each other. The loop continues until the `left` pointer is less than the `right` pointer. This is done to check all characters in the cleaned string.\n",
-    "\n",
-    "6. Inside the loop, it checks if the characters at the `left` and `right` pointers don't match. If they don't match, it means the input is not a palindrome, so the function returns `False`.\n",
-    "\n",
-    "7. If the characters at the `left` and `right` pointers match, the pointers are moved closer to each other by incrementing `left` and decrementing `right`.\n",
-    "\n",
-    "8. The loop continues to compare characters until it either finds a mismatch (returning `False`) or until the `left` pointer is greater than or equal to the `right` pointer. If the loop completes without finding a mismatch, it means the input is a palindrome, so the function returns `True`.\n",
-    "\n",
-    "In summary, the code converts the input string to lowercase, removes non-alphanumeric characters, and then uses two pointers to compare characters from the cleaned string's beginning and end. If all characters match during the comparison, the function returns `True`, indicating that the input is a palindrome. If any characters do not match, it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "input1 = \"A man, a plan, a canal: Panama\"\n",
-    "output1 = isPalindrome(input1)\n",
-    "print(output1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "input2 = \"race a car\"\n",
-    "output2 = isPalindrome(input2)\n",
-    "print(output2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "input3 = \"\"\n",
-    "output3 = isPalindrome(input3)\n",
-    "print(output3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `isPalindrome` function that uses two pointers:\n",
-    "\n",
-    "1. **Time Complexity:**\n",
-    "   - Converting the input string to lowercase using `s.lower()` takes O(n) time, where 'n' is the length of the input string.\n",
-    "   - Removing non-alphanumeric characters using the list comprehension `''.join(c for c in s if c.isalnum())` also takes O(n) time because it iterates through each character in the string once.\n",
-    "   - The comparison of characters using the two pointers (`left` and `right`) is done in a loop that runs until `left` is less than `right`. In the worst case, the loop iterates through half of the string, so it takes O(n/2) time, which is still considered O(n).\n",
-    "\n",
-    "   Therefore, the overall time complexity of the `isPalindrome` function is O(n), where 'n' is the length of the input string.\n",
-    "\n",
-    "2. **Space Complexity:**\n",
-    "   - The space complexity is primarily determined by the additional string `cleaned_s` created to store the cleaned version of the input string. In the worst case, if all characters in the input string are alphanumeric, this cleaned string can be as large as the original input string.\n",
-    "   - Additionally, the function uses two pointers, `left` and `right`, which consume constant space and do not depend on the size of the input.\n",
-    "\n",
-    "**In summary,** the overall space complexity of the `isPalindrome` function is O(n) in the worst case, where 'n' is the length of the input string. The space complexity is dominated by the space required for `cleaned_s`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Longest Palindromic Substring:** Given a string `s`, find and return the longest palindromic substring within `s`. For example, if `s = \"babad\"`, the function should return `\"bab\"` or `\"aba\"`.\n",
-    "2. **Palindrome with Limited Characters:** Given a string `s` and a list of characters `allowed_chars`, check if `s` is a palindrome considering only the characters from `allowed_chars`. Ignore all other characters. For example, if `s = \"A man, a plan, a canal: Panama\"` and `allowed_chars = ['a', 'm', 'n', 'p']`, the function should return `True`."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb b/docs/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb
deleted file mode 100644
index 15d189a..0000000
--- a/docs/_build/jupyter_execute/02. Two Pointers/15. 3Sum.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 15. 3Sum\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the 3Sum problem on LeetCode, click here!](https://leetcode.com/problems/3sum/)\n",
-    "\n",
-    "---\n",
-    "Given an integer array nums, *return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.*\n",
-    "\n",
-    "**Notice** that the solution set must not contain duplicate triplets.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `3 <= nums.length <= 3000`\n",
-    "- $-10^5$ <= `nums[i]` <= $10^5$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def threeSum(nums):\n",
-    "    # Sort the input array in ascending order\n",
-    "    nums.sort()\n",
-    "    triplets = []\n",
-    "    \n",
-    "    for i in range(len(nums) - 2):\n",
-    "        # Skip duplicates to avoid duplicate triplets\n",
-    "        if i > 0 and nums[i] == nums[i - 1]:\n",
-    "            continue\n",
-    "        \n",
-    "        left, right = i + 1, len(nums) - 1\n",
-    "        \n",
-    "        while left < right:\n",
-    "            # Calculate the total sum of the current triplet\n",
-    "            total = nums[i] + nums[left] + nums[right]\n",
-    "            \n",
-    "            if total == 0:\n",
-    "                # If the total is zero, we found a valid triplet\n",
-    "                triplets.append([nums[i], nums[left], nums[right]])\n",
-    "                \n",
-    "                # Skip duplicates of left and right pointers\n",
-    "                while left < right and nums[left] == nums[left + 1]:\n",
-    "                    left += 1\n",
-    "                while left < right and nums[right] == nums[right - 1]:\n",
-    "                    right -= 1\n",
-    "                \n",
-    "                # Move the pointers to the next unique elements\n",
-    "                left += 1\n",
-    "                right -= 1\n",
-    "            elif total < 0:\n",
-    "                # If the total is negative, we need to increase the sum by moving the left pointer to the right\n",
-    "                left += 1\n",
-    "            else:\n",
-    "                # If the total is positive, we need to decrease the sum by moving the right pointer to the left\n",
-    "                right -= 1\n",
-    "    \n",
-    "    return triplets"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. It starts by sorting the input array `nums` in ascending order. Sorting helps in efficiently finding triplets that sum up to zero.\n",
-    "\n",
-    "2. It initializes an empty list `triplets` to store the unique triplets that meet the given conditions.\n",
-    "\n",
-    "3. The code then iterates through the `nums` array using a loop with index `i`. This loop will consider each element of the array as a potential starting point for a triplet.\n",
-    "\n",
-    "4. Inside the loop, it checks for duplicates and skips them. This is done to ensure that the solution set does not contain duplicate triplets. If `nums[i]` is the same as the previous element `nums[i-1]`, it continues to the next iteration of the loop.\n",
-    "\n",
-    "5. Two pointers, `left` and `right`, are initialized. `left` starts just after the current element `nums[i]`, and `right` starts at the end of the array.\n",
-    "\n",
-    "6. The code enters another loop with `left` and `right` pointers, trying to find a triplet that sums up to zero.\n",
-    "\n",
-    "7. It calculates the `total` sum of the current triplet as `nums[i] + nums[left] + nums[right]`.\n",
-    "\n",
-    "8. If `total` is zero, it means a valid triplet is found, so it appends `[nums[i], nums[left], nums[right]]` to the `triplets` list. Then, it moves both the `left` and `right` pointers to their next unique elements while skipping duplicates.\n",
-    "\n",
-    "9. If `total` is less than zero, it means the sum is negative, so it increments the `left` pointer to move towards a larger sum.\n",
-    "\n",
-    "10. If `total` is greater than zero, it means the sum is positive, so it decrements the `right` pointer to move towards a smaller sum.\n",
-    "\n",
-    "11. This process continues until all possible triplets have been considered.\n",
-    "\n",
-    "12. Finally, the function returns the `triplets` list, which contains all the unique triplets that sum up to zero in the sorted `nums` array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[-1, -1, 2], [-1, 0, 1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "nums = [-1, 0, 1, 2, -1, -4]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "nums = [0, 1, 1]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e191cf7e-95f9-4e5c-a99b-146c2a779c0b",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 0, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "nums = [0, 0, 0]\n",
-    "result = threeSum(nums)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `threeSum` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. Sorting the input array `nums` takes O(n log n) time, where n is the length of the array.\n",
-    "\n",
-    "2. The outer loop runs for each element of the array, so it iterates O(n) times.\n",
-    "\n",
-    "3. Inside the outer loop, we have a while loop with two pointers (`left` and `right`). In the worst case, the while loop can iterate O(n) times (when all elements are unique).\n",
-    "\n",
-    "4. Inside the while loop, we have constant time operations (additions, comparisons, and list appends).\n",
-    "\n",
-    "Overall, the time complexity of the `threeSum` function is dominated by the sorting step, so it is O(n log n) due to the sorting. The other operations inside the loops contribute linearly but are dominated by the sorting step.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The space used by the `triplets` list to store the output triplets is O(k), where k is the number of unique triplets that sum up to zero. In the worst case, this can be O(n^2/3) because there can be roughly O(n^2) possible triplets, and many of them may sum up to zero.\n",
-    "\n",
-    "2. Other than the `triplets` list, the function uses only a constant amount of additional space for variables like `i`, `left`, `right`, and `total`.\n",
-    "\n",
-    "Overall, the space complexity of the `threeSum` function is O(k), where k is the number of unique triplets that meet the criteria. It's important to note that the space complexity does not depend on the size of the input array but rather on the number of valid triplets found.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: O(n log n) due to sorting (dominant factor) and O(n^2) in the worst case for the nested loops.\n",
-    "- Space Complexity: O(k) for storing the output triplets, where k is the number of unique triplets that meet the criteria."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K-Sum Problem:** Generalize the problem to the K-Sum problem, where instead of finding triplets that sum to zero, you need to find K elements that sum to a target value. Implement a function for this generalization.\n",
-    "2. **Count the Number of Unique Triplets:** Modify the algorithm to count the number of unique triplets that satisfy the conditions instead of returning the triplets themselves. This will require some modifications to handle duplicates efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb b/docs/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb
deleted file mode 100644
index 451a21d..0000000
--- a/docs/_build/jupyter_execute/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb	
+++ /dev/null
@@ -1,185 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 121. Best Time to Buy and Sell Stock\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Best Time to Buy and Sell Stock problem on LeetCode, click here!](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given an array `prices` where `prices[i]` is the price of a given stock on the $i^{th}$ day.\n",
-    "\n",
-    "You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.\n",
-    "\n",
-    "*Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return `0`.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `prices.length` <= $10^5$\n",
-    "- 0 <= `prices[i]` <= $10^4$\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def maxProfit(prices):\n",
-    "    if not prices:\n",
-    "        return 0\n",
-    "    \n",
-    "    min_price = prices[0]\n",
-    "    max_profit = 0\n",
-    "    \n",
-    "    for price in prices:\n",
-    "        # Update the minimum price if a lower price is encountered\n",
-    "        min_price = min(min_price, price)\n",
-    "        # Calculate the profit if selling at the current price\n",
-    "        max_profit = max(max_profit, price - min_price)\n",
-    "    \n",
-    "    return max_profit"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- The `maxProfit` function takes a single argument, `prices`, which is a list of stock prices.\n",
-    "- The first line of the function checks if the `prices` list is empty. If it's empty, there are no prices to analyze, so the function returns 0 (no profit can be made).\n",
-    "\n",
-    "- Then, we initialize two variables:\n",
-    "  - `min_price`: This variable will keep track of the minimum price seen so far. We initialize it with the price of the first day in the list (`prices[0]`).\n",
-    "  - `max_profit`: This variable will keep track of the maximum profit we can achieve. We initialize it to 0 because initially, we haven't made any profit.\n",
-    "\n",
-    "- We start iterating through the `prices` list, where `price` represents the stock price for the current day.\n",
-    "\n",
-    "- In each iteration, we check if the current `price` is lower than the `min_price` we've seen so far. If it is, we update `min_price` to the current `price`. This is because we want to buy the stock at the lowest possible price.\n",
-    "\n",
-    "- Next, we calculate the profit we would make if we sold the stock at the current `price` (assuming we bought it at `min_price`). We do this by subtracting `min_price` from the current `price`. This represents the profit for the current day.\n",
-    "\n",
-    "- We also use the `max` function to keep track of the maximum profit seen so far. If the profit calculated for the current day is greater than the `max_profit` we've seen previously, we update `max_profit` with this higher value.\n",
-    "\n",
-    "- Finally, after iterating through all the days in the `prices` list, we return `max_profit`, which represents the maximum profit that can be achieved by buying and selling a single stock."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "5\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "prices1 = [7, 1, 5, 3, 6, 4]\n",
-    "print(maxProfit(prices1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "0\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "prices2 = [7, 6, 4, 3, 1]\n",
-    "print(maxProfit(prices2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code iterates through the `prices` array once, examining each price exactly once.\n",
-    "- Within the loop, there are constant-time operations such as comparisons, additions, and subtractions.\n",
-    "- Therefore, the time complexity of this code is O(n), where n is the length of the `prices` array. It performs a linear number of operations relative to the size of the input.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the code is constant, O(1).\n",
-    "- Regardless of the size of the input `prices` array, the code only uses a fixed amount of additional memory to store two variables (`min_price` and `max_profit`) and a few loop variables.\n",
-    "- The memory usage does not depend on the size of the input, so it is considered constant space complexity.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: O(n) where n is the length of the `prices` array.\n",
-    "- Space Complexity: O(1) (constant space usage)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Transactions Allowed:** Modify the problem to allow multiple transactions (buy and sell multiple times), but you must sell before buying again. Find the maximum profit in this scenario.\n",
-    "2. **K Transactions Allowed:** Extend the problem to allow at most k transactions. Find the maximum profit considering this constraint.\n",
-    "3. **With Transaction Fee:** Introduce a transaction fee for each buy/sell operation. Modify the code to maximize profit while considering the transaction fee."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb b/docs/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb
deleted file mode 100644
index ded03f3..0000000
--- a/docs/_build/jupyter_execute/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb	
+++ /dev/null
@@ -1,206 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 3. Longest Substring Without Repeating Characters\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Substring Without Repeating Characters problem on LeetCode, click here!](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n",
-    "\n",
-    "---\n",
-    "Given a string `s`, find the length of the **longest substring** without repeating characters.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 0 <= `s.length` <= $5 * 10^4$\n",
-    "- `s` consists of English letters, digits, symbols and spaces.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def length_of_longest_substring(s):\n",
-    "    # Create a dictionary to store the index of each character's last occurrence.\n",
-    "    char_index = {}\n",
-    "    \n",
-    "    # Initialize variables to keep track of the start and end of the current substring.\n",
-    "    start = 0\n",
-    "    max_length = 0\n",
-    "    \n",
-    "    for end in range(len(s)):\n",
-    "        # If the character is in the dictionary and its last occurrence is after the start of the current substring,\n",
-    "        # update the start of the substring to the next character after its last occurrence.\n",
-    "        if s[end] in char_index and char_index[s[end]] >= start:\n",
-    "            start = char_index[s[end]] + 1\n",
-    "        \n",
-    "        # Update the last occurrence index of the current character.\n",
-    "        char_index[s[end]] = end\n",
-    "        \n",
-    "        # Calculate the length of the current substring and update the maximum length if necessary.\n",
-    "        current_length = end - start + 1\n",
-    "        max_length = max(max_length, current_length)\n",
-    "    \n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a function called `length_of_longest_substring` that takes a single argument `s`, which is the input string for which we want to find the length of the longest substring without repeating characters.\n",
-    "\n",
-    "2. We create a dictionary called `char_index` to store the index of the last occurrence of each character in the input string. This dictionary will help us keep track of where each character was last seen.\n",
-    "\n",
-    "3. We initialize two variables, `start` and `max_length`. \n",
-    "   - `start` represents the start index of the current substring without repeating characters. It starts at 0.\n",
-    "   - `max_length` is used to keep track of the maximum length found so far and is initially set to 0.\n",
-    "\n",
-    "4. We then iterate through the input string `s` using a for loop, where the loop variable `end` represents the current end index of the substring we are considering.\n",
-    "\n",
-    "5. Inside the loop:\n",
-    "   - We check if the character `s[end]` is already in the `char_index` dictionary and if its last occurrence is within or after the current substring. If so, it means that we've encountered a repeating character, and we need to update the `start` of the substring to the next character after the last occurrence of `s[end]`. This ensures that we have a new valid substring without repeating characters.\n",
-    "   - We then update the `char_index` dictionary by storing the current index `end` as the last occurrence index of the character `s[end]`.\n",
-    "\n",
-    "6. Next, we calculate the length of the current substring without repeating characters, which is `current_length = end - start + 1`. We add 1 to account for the fact that the indices are zero-based.\n",
-    "\n",
-    "7. We update the `max_length` with the maximum of its current value and the `current_length`. This step ensures that we keep track of the longest valid substring we have encountered so far.\n",
-    "\n",
-    "8. The loop continues to iterate through the input string, and at the end, we return the `max_length`, which represents the length of the longest substring without repeating characters."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(length_of_longest_substring(\"abcabcbb\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(length_of_longest_substring(\"bbbbb\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "cf04eba0-0ead-4e8b-ba33-4316ea64a9d3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(length_of_longest_substring(\"pwwkew\"))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "Let's analyze the time and space complexity of the `length_of_longest_substring` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The function iterates through the input string `s` using a single for loop. The loop runs from the beginning of the string to the end once.\n",
-    "- Inside the loop, we perform constant-time operations such as dictionary lookups and updates, comparisons, and arithmetic operations.\n",
-    "- Therefore, the time complexity of the function is O(n), where n is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The primary data structure that consumes space in this function is the `char_index` dictionary.\n",
-    "- In the worst case, if there are no repeating characters in the input string, the dictionary can store all unique characters in the string.\n",
-    "- Therefore, the space complexity is O(min(n, m)), where n is the length of the input string `s`, and m is the number of unique characters in the string. In the worst case, when all characters are unique, m is equal to n, so the space complexity is O(n).\n",
-    "- Additionally, there are a few integer variables used for indices and lengths, which consume constant space.\n",
-    "- Overall, the space complexity of the function is O(min(n, m)) or simply O(n) in the worst case.\n",
-    "\n",
-    "**In summary,** the time complexity of the `length_of_longest_substring` function is O(n), and the space complexity is O(n) in the worst case due to the `char_index` dictionary. This algorithm provides an efficient way to find the length of the longest substring without repeating characters in linear time."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Longest Substring with K Distinct Characters:** Modify the problem to find the length of the longest substring with exactly K distinct characters. For example, given the input string \"abcabcbb\" and K = 2, the answer would be 4 because the longest substring with two distinct characters is \"abca.\"\n",
-    "2. **Longest Substring with Unique Characters:** Write a function to find the length of the longest substring in a given string where all characters are unique. For example, given the input string \"abcabcbb,\" the answer would be 4 because \"abcd\" is the longest substring with unique characters."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb b/docs/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb
deleted file mode 100644
index df4b0d3..0000000
--- a/docs/_build/jupyter_execute/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb	
+++ /dev/null
@@ -1,189 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 424. Longest Repeating Character Replacement\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Longest Repeating Character Replacement problem on LeetCode, click here!](https://leetcode.com/problems/longest-repeating-character-replacement/)\n",
-    "\n",
-    "---\n",
-    "You are given a string `s` and an integer `k`. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most `k` times.\n",
-    "\n",
-    "*Return the length of the longest substring containing the same letter you can get after performing the above operations.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $10^5$\n",
-    "- `s` consists of only uppercase English letters.\n",
-    "- `0 <= k <= s.length`"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def characterReplacement(s, k):\n",
-    "    max_length = 0  # Initialize the maximum length\n",
-    "    max_count = 0   # Initialize the maximum count of repeating characters\n",
-    "    start = 0       # Initialize the start of the sliding window\n",
-    "    char_count = {} # Dictionary to store the count of each character\n",
-    "\n",
-    "    for end in range(len(s)):\n",
-    "        # Update the count of the current character in the dictionary\n",
-    "        char_count[s[end]] = char_count.get(s[end], 0) + 1\n",
-    "        \n",
-    "        # Update the maximum count of repeating characters\n",
-    "        max_count = max(max_count, char_count[s[end]])\n",
-    "        \n",
-    "        # Check if the current window size is greater than k\n",
-    "        if (end - start + 1) - max_count > k:\n",
-    "            # Move the start of the window to the right\n",
-    "            char_count[s[start]] -= 1\n",
-    "            start += 1\n",
-    "        \n",
-    "        # Update the maximum length\n",
-    "        max_length = max(max_length, end - start + 1)\n",
-    "\n",
-    "    return max_length"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We initialize some variables:\n",
-    "   - `max_length` to keep track of the maximum length of the substring containing the same letter.\n",
-    "   - `max_count` to keep track of the maximum count of repeating characters within the current window.\n",
-    "   - `start` to represent the start index of the sliding window.\n",
-    "   - `char_count` is a dictionary that will store the count of each character within the current window.\n",
-    "\n",
-    "2. We use a `for` loop to iterate through the characters of the string `s`.\n",
-    "\n",
-    "3. Inside the loop, we do the following for each character at position `end`:\n",
-    "   - Update the count of the current character in the `char_count` dictionary.\n",
-    "   - Update the `max_count` to be the maximum of the current `max_count` and the count of the current character. This keeps track of the maximum count of repeating characters within the current window.\n",
-    "\n",
-    "4. We check if the current window size (the difference between `end` and `start` plus one) minus the `max_count` is greater than `k`. This condition checks whether we have exceeded the allowed number of replacements (`k`) within the current window.\n",
-    "\n",
-    "   - If we have exceeded the allowed replacements, it means we need to shrink the window from the left side. We do this by moving the `start` of the window to the right and decrementing the count of the character at `s[start]` in the `char_count` dictionary. This effectively removes characters from the left side of the window until we have a valid window again.\n",
-    "\n",
-    "   - By doing this, we ensure that the difference between the current window size and the `max_count` is always less than or equal to `k`.\n",
-    "\n",
-    "5. After each character, we update the `max_length` to be the maximum of the current `max_length` and the size of the current window (`end - start + 1`).\n",
-    "\n",
-    "6. Finally, we return `max_length`, which holds the length of the longest substring containing the same letter with at most `k` replacements."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "s1 = \"ABAB\"\n",
-    "k1 = 2\n",
-    "print(characterReplacement(s1, k1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "s2 = \"AABABBA\"\n",
-    "k2 = 1\n",
-    "print(characterReplacement(s2, k2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code uses a single `for` loop to iterate through the characters of the input string `s`. The loop runs from the beginning to the end of the string.\n",
-    "- Inside the loop, we perform constant-time operations such as updating the `char_count` dictionary and updating variables like `max_count` and `max_length`.\n",
-    "- The code's time complexity is primarily determined by the loop, which iterates through each character in the string once. Therefore, the time complexity is O(n), where n is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The code uses several variables to store information, but the space they consume is constant and does not depend on the size of the input string. These variables include `max_length`, `max_count`, `start`, and `char_count`. Therefore, the space complexity is O(1) or constant space.\n",
-    "\n",
-    "**In summary**, the time complexity of the code is O(n), where n is the length of the input string, and the space complexity is O(1), as it uses a constant amount of additional space regardless of the input size. This algorithm efficiently solves the problem with a linear time complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the code to find the longest substring containing the same letter with at most k replacements in O(n) time complexity and O(1) space complexity. Hint: You may need to update the approach to achieve this.\n",
-    "2. **Variation with Lowercase Letters:** Extend the problem to include both uppercase and lowercase English letters in the input string s. Write a function that can handle this extended input and still find the longest substring with at most k replacements efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb b/docs/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb
deleted file mode 100644
index cf22c86..0000000
--- a/docs/_build/jupyter_execute/03. Sliding Window/76. Minimum Window Substring.ipynb	
+++ /dev/null
@@ -1,260 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 76. Minimum Window Substring\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Minimum Window Substring problem on LeetCode, click here!](https://leetcode.com/problems/minimum-window-substring/)\n",
-    "\n",
-    "---\n",
-    "Given two strings `s` and `t` of lengths `m` and `n` respectively, return *the **minimum window substring** of `s` such that every character in `t` (**including duplicates**) is included in the window. If there is no such substring, return the empty string `\"\"`.*\n",
-    "\n",
-    "The testcases will be generated such that the answer is **unique**.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `m == s.length`\n",
-    "- `n == t.length`\n",
-    "- 1 <= `m, n` <= $10^5$\n",
-    "- `s` and `t` consist of uppercase and lowercase English letters.\n",
-    "\n",
-    "**Follow up**: Could you find an algorithm that runs in $O(m + n)$ time?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def min_window_substring(s, t):\n",
-    "    if not s or not t:\n",
-    "        return \"\"\n",
-    "\n",
-    "    # Initialize dictionaries to keep track of character counts for t and the current window in s.\n",
-    "    t_dict = {}\n",
-    "    current_window_dict = {}\n",
-    "    \n",
-    "    # Populate t_dict with character counts for string t.\n",
-    "    for char in t:\n",
-    "        t_dict[char] = t_dict.get(char, 0) + 1\n",
-    "\n",
-    "    # Initialize pointers for the sliding window.\n",
-    "    left = 0\n",
-    "    min_len = float('inf')\n",
-    "    min_window = \"\"\n",
-    "    required_chars = len(t_dict)\n",
-    "\n",
-    "    # Initialize a variable to keep track of how many required characters have been found in the current window.\n",
-    "    found_chars = 0\n",
-    "\n",
-    "    # Iterate over the string s using the right pointer.\n",
-    "    for right in range(len(s)):\n",
-    "        char = s[right]\n",
-    "\n",
-    "        # Update the current_window_dict.\n",
-    "        current_window_dict[char] = current_window_dict.get(char, 0) + 1\n",
-    "\n",
-    "        # Check if the current character is a required character and if its count matches the required count.\n",
-    "        if char in t_dict and current_window_dict[char] == t_dict[char]:\n",
-    "            found_chars += 1\n",
-    "\n",
-    "        # Try to minimize the window by moving the left pointer.\n",
-    "        while left <= right and found_chars == required_chars:\n",
-    "            # Calculate the current window size.\n",
-    "            window_size = right - left + 1\n",
-    "\n",
-    "            # If the current window is smaller than the minimum found so far, update min_len and min_window.\n",
-    "            if window_size < min_len:\n",
-    "                min_len = window_size\n",
-    "                min_window = s[left:right+1]\n",
-    "\n",
-    "            # Move the left pointer to the right to shrink the window.\n",
-    "            left_char = s[left]\n",
-    "            current_window_dict[left_char] -= 1\n",
-    "\n",
-    "            # Check if the character removed from the window was a required character.\n",
-    "            if left_char in t_dict and current_window_dict[left_char] < t_dict[left_char]:\n",
-    "                found_chars -= 1\n",
-    "\n",
-    "            # Move the left pointer further to continue shrinking the window.\n",
-    "            left += 1\n",
-    "\n",
-    "    return min_window"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by checking if either of the input strings `s` or `t` is empty. If either of them is empty, we return an empty string since there can't be any valid substring in this case.\n",
-    "\n",
-    "2. We initialize two dictionaries: `t_dict` and `current_window_dict`. These dictionaries will be used to keep track of character counts in the string `t` and the current window in string `s`, respectively.\n",
-    "\n",
-    "3. We populate the `t_dict` dictionary by iterating through string `t`. For each character, we increment its count in the dictionary using `t_dict.get(char, 0) + 1`. This allows us to count the occurrences of each character in `t`.\n",
-    "\n",
-    "4. We initialize two pointers: `left` and `right`. The `left` pointer will represent the start of the current window, and the `right` pointer will represent the end of the current window. We also initialize `min_len` to store the length of the minimum window found so far, and `min_window` to store the actual minimum window substring.\n",
-    "\n",
-    "5. We determine the number of required characters in `t` (i.e., the number of distinct characters in `t`) and store it in the variable `required_chars`.\n",
-    "\n",
-    "6. We initialize a variable `found_chars` to keep track of how many required characters have been found in the current window. Initially, it is set to 0.\n",
-    "\n",
-    "7. We iterate over the string `s` using the `right` pointer. In each iteration, we do the following:\n",
-    "\n",
-    "   - Update the `current_window_dict` by incrementing the count of the current character.\n",
-    "   \n",
-    "   - Check if the current character is a required character (present in `t_dict`) and if its count in the `current_window_dict` matches the required count from `t_dict`. If so, we increment `found_chars`.\n",
-    "\n",
-    "8. After updating the window, we attempt to minimize the window size by moving the `left` pointer to the right. In this step, we:\n",
-    "\n",
-    "   - Calculate the size of the current window.\n",
-    "   \n",
-    "   - If the current window size is smaller than the minimum found so far (`min_len`), we update `min_len` and `min_window` to store the current window substring.\n",
-    "   \n",
-    "   - Move the `left` pointer to the right to shrink the window.\n",
-    "   \n",
-    "   - Check if the character being removed from the window was a required character. If it was, we decrement `found_chars`.\n",
-    "   \n",
-    "   - Continue moving the `left` pointer further to continue shrinking the window if the window still contains all required characters.\n",
-    "\n",
-    "9. Finally, we return `min_window`, which will contain the minimum window substring that contains all characters from `t`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "BANC\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(min_window_substring(\"ADOBECODEBANC\", \"ABC\"))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "a\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(min_window_substring(\"a\", \"a\")) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(min_window_substring(\"a\", \"aa\")) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `min_window_substring` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The main loop iterates through the string `s` from left to right using the `right` pointer. This loop runs in O(m) time, where 'm' is the length of string `s`.\n",
-    "\n",
-    "- Inside the loop, we have a while loop that moves the `left` pointer to the right to shrink the window as needed. In the worst case, this while loop can also run in O(m) time because in the worst case, we may have to move the `left` pointer all the way to the end of the string.\n",
-    "\n",
-    "- Within each iteration of the while loop, we perform constant time operations, such as updating dictionaries and comparing character counts.\n",
-    "\n",
-    "- The initialization of the `t_dict` dictionary takes O(n) time, where 'n' is the length of string `t`.\n",
-    "\n",
-    "Therefore, the overall time complexity of the function is O(m + n) because the dominant factor is the length of string `s`, and the length of string `t` has a smaller impact.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity is determined by the space used by the `t_dict` dictionary, the `current_window_dict` dictionary, and a few variables.\n",
-    "\n",
-    "- The `t_dict` dictionary stores character counts for string `t`. In the worst case, when all characters in `t` are distinct, this dictionary can have a maximum of 'n' key-value pairs. So, the space complexity for `t_dict` is O(n).\n",
-    "\n",
-    "- The `current_window_dict` dictionary stores character counts for the current window. In the worst case, it can have a maximum of 'm' key-value pairs. So, the space complexity for `current_window_dict` is also O(m).\n",
-    "\n",
-    "- Other variables used in the function, such as `left`, `right`, `min_len`, `min_window`, `required_chars`, and `found_chars`, are all of constant size and do not depend on the input sizes.\n",
-    "\n",
-    "**In summary**, the overall space complexity of the function is O(max(m, n)), which means it is determined by the larger of the two input strings' lengths. This is because the space used for `t_dict` and `current_window_dict` dominates the space complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Smallest Distinct Substring:** Instead of finding the minimum window substring containing all characters, find the smallest distinct (unique) substring of s that contains all characters from t. This variation adds complexity because you must find a substring with distinct characters.\n",
-    "2. **No Extra Space:** Solve the problem without using any extra space, such as dictionaries or arrays, other than a constant amount of space. This is a significant optimization challenge."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb b/docs/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb
deleted file mode 100644
index 04c0280..0000000
--- a/docs/_build/jupyter_execute/04. Stack/20. Valid Parentheses.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 20. Valid Parentheses\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Valid Parentheses problem on LeetCode, click here!](https://leetcode.com/problems/valid-parentheses/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given a string s containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.\n",
-    "\n",
-    "An input string is valid if:\n",
-    "\n",
-    "1. Open brackets must be closed by the same type of brackets.\n",
-    "2. Open brackets must be closed in the correct order.\n",
-    "3. Every close bracket has a corresponding open bracket of the same type.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `s.length` <= $10^4$\n",
-    "- `s` consists of parentheses only `'()[]{}'`."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def isValid(s):\n",
-    "    # Create an empty stack to store opening brackets\n",
-    "    stack = []\n",
-    "    \n",
-    "    # Define a mapping for matching brackets\n",
-    "    bracket_mapping = {')': '(', '}': '{', ']': '['}\n",
-    "    \n",
-    "    # Iterate through the characters in the input string\n",
-    "    for char in s:\n",
-    "        # If the character is an opening bracket, push it onto the stack\n",
-    "        if char in bracket_mapping.values():\n",
-    "            stack.append(char)\n",
-    "        # If the character is a closing bracket\n",
-    "        elif char in bracket_mapping.keys():\n",
-    "            # Pop the top element from the stack if it exists, or use a dummy value '#'\n",
-    "            top_element = stack.pop() if stack else '#'\n",
-    "            # If the popped element does not match the corresponding opening bracket, return False\n",
-    "            if bracket_mapping[char] != top_element:\n",
-    "                return False\n",
-    "        # If the character is not a bracket, ignore it\n",
-    "        \n",
-    "    # After processing the entire string, if there are any unmatched opening brackets left in the stack, return False\n",
-    "    return len(stack) == 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining the `isValid` function that takes a single argument `s`, which is the input string containing parentheses and brackets.\n",
-    "\n",
-    "2. Inside the function, we create an empty stack, which is a list in Python, to store opening brackets as we encounter them in the input string. The stack will help us keep track of the brackets and their order.\n",
-    "\n",
-    "3. We define a `bracket_mapping` dictionary that maps each closing bracket to its corresponding opening bracket. This mapping will be used to check if a closing bracket matches the most recent opening bracket in the stack.\n",
-    "\n",
-    "4. We iterate through each character `char` in the input string `s` using a `for` loop.\n",
-    "\n",
-    "5. If the character `char` is an opening bracket (i.e., it exists in the `values()` of `bracket_mapping`), we push it onto the stack using the `append()` method.\n",
-    "\n",
-    "6. If the character `char` is a closing bracket (i.e., it exists in the `keys()` of `bracket_mapping`), we need to check if it matches the corresponding opening bracket. To do this, we pop the top element from the stack (if it exists) and store it in `top_element`. We use a dummy value `'#'` if the stack is empty to avoid errors.\n",
-    "\n",
-    "7. We then compare `top_element` with the corresponding opening bracket using `bracket_mapping[char]`. If they do not match, it means the string is not valid, and we return `False`.\n",
-    "\n",
-    "8. If the character `char` is not a bracket, we simply ignore it and continue the loop.\n",
-    "\n",
-    "9. After processing the entire string, we check if there are any unmatched opening brackets left in the stack. If the stack is empty, it means all opening brackets have been properly matched and closed, and we return `True`. Otherwise, we return `False`.\n",
-    "\n",
-    "10. Finally, we provide some test cases at the bottom of the code to demonstrate how the function works for different input strings."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "print(isValid(\"()\"))    "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "print(isValid(\"()[]{}\")) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "print(isValid(\"(]\"))     "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `isValid` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The function iterates through each character in the input string `s` once, performing constant-time operations for each character.\n",
-    "- Pushing and popping elements from the stack (list) also takes constant time in most cases.\n",
-    "- Therefore, the overall time complexity of the function is $O(n)$, where $n$ is the length of the input string `s`.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the function is determined by the space used by the stack and the `bracket_mapping` dictionary.\n",
-    "- In the worst case, if the input string `s` consists entirely of opening brackets, the stack can potentially contain all of these opening brackets, resulting in a space complexity of $O(n)$ in terms of the stack.\n",
-    "- The `bracket_mapping` dictionary has a constant number of key-value pairs (3 pairs in this case).\n",
-    "- Therefore, the overall space complexity of the function is $O(n)$, where $n$ is the length of the input string `s`, mainly due to the stack space.\n",
-    "\n",
-    "**In summary:**\n",
-    "- The time complexity is $O(n)$ because we iterate through the string once.\n",
-    "- The space complexity is $O(n)$ due to the stack used to keep track of opening brackets."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Valid Expressions:** Modify the problem to validate not only brackets but also arithmetic expressions containing parentheses, such as \"$2 * (3 + 5) / (4 - 2)$\".\n",
-    "2. **Valid Parentheses Combinations:**\n",
-    "Write a function to generate all valid combinations of n pairs of parentheses, where $n$ is a positive integer. For example, for $n = 3$, the valid combinations are [\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\"]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb b/docs/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb
deleted file mode 100644
index eb4858b..0000000
--- a/docs/_build/jupyter_execute/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,220 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 153. Find Minimum in Rotated Sorted Array\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Find Minimum in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Suppose an array of length `n` sorted in ascending order is **rotated** between `1` and `n` times. For example, the array `nums = [0,1,2,4,5,6,7]` might become:\n",
-    "\n",
-    "- `[4,5,6,7,0,1,2]` if it was rotated `4` times.\n",
-    "- `[0,1,2,4,5,6,7]` if it was rotated `7` times.\n",
-    "\n",
-    "Notice that **rotating** an array `[a[0], a[1], a[2], ..., a[n-1]]` 1 time results in the array `[a[n-1], a[0], a[1], a[2], ..., a[n-2]]`.\n",
-    "\n",
-    "Given the sorted rotated array `nums` of **unique** elements, return *the minimum element of this array.*\n",
-    "\n",
-    "You must write an algorithm that runs in $O(log\\ n)$ time.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `n == nums.length`\n",
-    "- `1 <= n <= 5000`\n",
-    "- `-5000 <= nums[i] <= 5000`\n",
-    "- All the integers of `nums` are **unique**.\n",
-    "- `nums` is sorted and rotated between `1` and `n` times."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def findMin(nums):\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "    \n",
-    "    while left < right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "        \n",
-    "        # If the mid element is greater than the rightmost element,\n",
-    "        # it means the minimum element is in the right half.\n",
-    "        if nums[mid] > nums[right]:\n",
-    "            left = mid + 1\n",
-    "        # If the mid element is less than or equal to the rightmost element,\n",
-    "        # it means the minimum element is in the left half or at the mid itself.\n",
-    "        else:\n",
-    "            right = mid\n",
-    "    \n",
-    "    # The loop will break when left and right converge to the minimum element.\n",
-    "    # At this point, left (or right) will be pointing to the minimum element.\n",
-    "    return nums[left]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The function `findMin(nums)` takes an input list `nums`, which represents the rotated sorted array.\n",
-    "\n",
-    "2. Initialize two pointers `left` and `right` to track the current search range. Initially, `left` is set to 0 (the beginning of the array), and `right` is set to `len(nums) - 1` (the end of the array).\n",
-    "\n",
-    "3. Enter a `while` loop with the condition `left < right`. This loop continues until `left` and `right` converge to a single element, which will be the minimum element in the rotated array.\n",
-    "\n",
-    "4. Inside the loop, calculate the middle index `mid` using integer division. This helps in finding the middle element of the current search range.\n",
-    "\n",
-    "5. Check if the element at the middle index (`nums[mid]`) is greater than the element at the rightmost index (`nums[right]`). If this condition is true, it means that the minimum element must be in the right half of the current search range. So, update `left` to `mid + 1`, effectively eliminating the left half of the search range.\n",
-    "\n",
-    "6. If the condition from step 5 is not met, it implies that the minimum element can be in the left half of the current search range or could be the element at the `mid` index itself. In this case, update `right` to `mid`, effectively eliminating the right half of the search range.\n",
-    "\n",
-    "7. Repeat steps 4-6 until `left` and `right` converge to the minimum element.\n",
-    "\n",
-    "8. When the loop exits, it means that `left` (or `right`) points to the minimum element in the array.\n",
-    "\n",
-    "9. Return `nums[left]` (or `nums[right]`) as the result, which is the minimum element in the rotated sorted array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1:\n",
-    "nums1 = [3, 4, 5, 1, 2]\n",
-    "print(findMin(nums1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "0\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "print(findMin(nums2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "11\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "nums3 = [11, 13, 15, 17]\n",
-    "print(findMin(nums3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this code is $O(log\\ n)$, where '$n$' is the length of the input array `nums`. This is because the binary search algorithm is employed, which continually divides the search range in half with each iteration.\n",
-    "\n",
-    "In each iteration of the `while` loop, the search range is halved, and this process continues until the `left` and `right` pointers converge to the minimum element. In the worst case, it will take logarithmic time to reduce the search range to a single element.\n",
-    "\n",
-    "Therefore, the binary search used in this code runs in $O(log\\ n)$ time complexity.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of this code is $O(1)$, which means it uses a constant amount of additional space that does not depend on the size of the input array.\n",
-    "\n",
-    "The algorithm uses a fixed number of variables (`left`, `right`, `mid`) to keep track of the search range and indices, but the number of these variables does not grow with the size of the input array. Hence, the space complexity is constant.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: $O(log\\ n)$\n",
-    "- Space Complexity: $O(1)$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. Solve the problem with a variation where the input array may contain duplicates.\n",
-    "\n",
-    "2. Modify the problem to return the index of the minimum element in the rotated sorted array, rather than the element itself. The algorithm should still run in $O(log\\ n)$ time.\n",
-    "\n",
-    "3. Implement a function that finds the maximum element in a rotated sorted array. How would you adapt the binary search algorithm to solve this problem efficiently in $O(log\\ n)$ time?\n",
-    "\n",
-    "4. Implement a function that can find the kth smallest element in a rotated sorted array. This is an extension of the original problem, and the algorithm should still run in $O(log\\ n)$ time."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb b/docs/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb
deleted file mode 100644
index 7b3139d..0000000
--- a/docs/_build/jupyter_execute/05. Binary Search/33. Search in Rotated Sorted Array.ipynb	
+++ /dev/null
@@ -1,237 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 33. Search in Rotated Sorted Array\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Search in Rotated Sorted Array problem on LeetCode, click here!](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "There is an integer array `nums` sorted in ascending order (with **distinct** values).\n",
-    "\n",
-    "Prior to being passed to your function, `nums` is **possibly rotated** at an unknown pivot index `k (1 <= k < nums.length)` such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]` (**0-indexed**). For example, `[0,1,2,4,5,6,7]` might be rotated at pivot index 3 and become `[4,5,6,7,0,1,2]`.\n",
-    "\n",
-    "Given the array `nums` **after** the possible rotation and an integer `target`, return *the index of `target` if it is in `nums`, or `-1` if it is not in `nums`.*\n",
-    "\n",
-    "You must write an algorithm with $O(log\\ n)$ runtime complexity.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `1 <= nums.length <= 5000`\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- All values of `nums` are **unique**.\n",
-    "- `nums` is an ascending array that is possibly rotated.\n",
-    "- $-10^4$ <= `target` <= $10^4$"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def search(nums, target):\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "\n",
-    "    # Find the pivot index using binary search\n",
-    "    while left < right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "\n",
-    "        if nums[mid] > nums[right]:\n",
-    "            left = mid + 1\n",
-    "        else:\n",
-    "            right = mid\n",
-    "\n",
-    "    pivot = left\n",
-    "    left, right = 0, len(nums) - 1\n",
-    "\n",
-    "    # Determine which part of the array to search in\n",
-    "    if target >= nums[pivot] and target <= nums[right]:\n",
-    "        left = pivot\n",
-    "    else:\n",
-    "        right = pivot\n",
-    "\n",
-    "    # Perform binary search to find the target\n",
-    "    while left <= right:\n",
-    "        mid = left + (right - left) // 2\n",
-    "\n",
-    "        if nums[mid] == target:\n",
-    "            return mid\n",
-    "        elif nums[mid] < target:\n",
-    "            left = mid + 1\n",
-    "        else:\n",
-    "            right = mid - 1\n",
-    "\n",
-    "    return -1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The `search` function takes two arguments: `nums`, which is the rotated sorted array, and `target`, which is the value we want to find in the array.\n",
-    "\n",
-    "2. We initialize two pointers, `left` and `right`, which represent the range in which we are going to perform binary search. Initially, `left` is set to 0, and `right` is set to the index of the last element in the array (`len(nums) - 1`).\n",
-    "\n",
-    "3. We start by finding the pivot index using binary search. The pivot index is the index at which the array is rotated. We use a `while` loop to continue the search until `left` is less than `right`.\n",
-    "\n",
-    "4. Inside the loop, we calculate the middle index `mid` using integer division. We then compare the value at `mid` with the value at `right`. If `nums[mid]` is greater than `nums[right]`, it means the pivot point lies to the right of `mid`, so we update `left` to `mid + 1`. Otherwise, the pivot point lies to the left of `mid`, so we update `right` to `mid`. This process continues until we find the pivot index.\n",
-    "\n",
-    "5. After finding the pivot index, we have divided the array into two parts: one part is sorted in ascending order, and the other part is also sorted in ascending order but rotated. We need to determine which part of the array contains the target value.\n",
-    "\n",
-    "6. We reset `left` and `right` pointers. If the target value is within the range `[nums[pivot], nums[right]]`, we set `left` to `pivot` (the start of the rotated part), indicating that we should search in the rotated part. Otherwise, we set `right` to `pivot` (the end of the sorted part), indicating that we should search in the sorted part.\n",
-    "\n",
-    "7. We then perform binary search again within the chosen range (`left` to `right`) to find the target element. The binary search continues until `left` is less than or equal to `right`.\n",
-    "\n",
-    "8. Inside the binary search loop, we calculate the middle index `mid` and compare `nums[mid]` with the target value. If they are equal, we return `mid` as the index of the target element. If `nums[mid]` is less than the target, we update `left` to `mid + 1` to search in the right half. If `nums[mid]` is greater than the target, we update `right` to `mid - 1` to search in the left half.\n",
-    "\n",
-    "9. If we exit the binary search loop without finding the target, we return -1 to indicate that the target is not present in the array."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "nums1 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "target1 = 0\n",
-    "result1 = search(nums1, target1)\n",
-    "print(result1) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "-1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [4, 5, 6, 7, 0, 1, 2]\n",
-    "target2 = 3\n",
-    "result2 = search(nums2, target2)\n",
-    "print(result2) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "-1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "nums3 = [1]\n",
-    "target3 = 0\n",
-    "result3 = search(nums3, target3)\n",
-    "print(result3) "
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. Finding the pivot index using binary search takes $O(log\\ n)$ time, where '$n$' is the number of elements in the array.\n",
-    "2. After finding the pivot index, performing binary search to find the target element also takes $O(log\\ n)$ time in the worst case.\n",
-    "\n",
-    "The dominant factor in the time complexity is the binary search, and since we perform two binary searches sequentially, the overall time complexity of the code is $O(log\\ n)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is very minimal:\n",
-    "\n",
-    "1. We use a constant amount of additional space for variables such as `left`, `right`, `pivot`, and `mid`. These variables do not depend on the input size, so they contribute $O(1)$ space complexity.\n",
-    "2. The function does not use any additional data structures that scale with the input size.\n",
-    "\n",
-    "Therefore, the space complexity of the code is $O(1)$, which means it has a constant space complexity and does not depend on the size of the input array.\n",
-    "\n",
-    "**In summary:**\n",
-    "- Time Complexity: $O(log\\ n)$\n",
-    "- Space Complexity: $O(1)$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Find Minimum Element in Rotated Sorted Array**: Write an algorithm to find the minimum element in a rotated sorted array. This is a variation of the problem where you don't need to search for a target value but instead find the smallest element.\n",
-    "\n",
-    "2. **Search in a Circularly Sorted Array**: Consider an array that is sorted in a circular manner (e.g., [4, 5, 6, 7, 0, 1, 2, 3]). Adapt the search algorithm to work for circularly sorted arrays while maintaining $O(log\\ n)$ complexity."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb b/docs/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb
deleted file mode 100644
index c428c9f..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/141. Linked List Cycle.ipynb	
+++ /dev/null
@@ -1,261 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 141. Linked List Cycle\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Linked List Cycle problem on LeetCode, click here!](https://leetcode.com/problems/linked-list-cycle/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given `head`, the head of a linked list, determine if the linked list has a cycle in it.\n",
-    "\n",
-    "There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is connected to. **Note that `pos` is not passed as a parameter.**\n",
-    "\n",
-    "Return `true` if there is a cycle in the linked list. Otherwise, return `false`.\n",
-    "\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of the nodes in the list is in the range $[0, 10^4]$.\n",
-    "- $-10^5$ <= Node.val <= $10^5$\n",
-    "- `pos` is `-1` or a **valid index** in the linked-list.\n",
-    "\n",
-    "**Follow up:** Can you solve it using $O(1)$ (i.e. constant) memory?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "    def __init__(self, val=0):\n",
-    "        self.val = val\n",
-    "        self.next = None\n",
-    "\n",
-    "class Solution:\n",
-    "    def hasCycle(self, head: ListNode) -> bool:\n",
-    "        if not head:\n",
-    "            return False\n",
-    "        \n",
-    "        slow = head\n",
-    "        fast = head\n",
-    "        \n",
-    "        while fast and fast.next:\n",
-    "            slow = slow.next\n",
-    "            fast = fast.next.next\n",
-    "            \n",
-    "            if slow == fast:\n",
-    "                return True\n",
-    "        \n",
-    "        return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The given code defines a class `Solution` with a method `hasCycle` for determining if a linked list has a cycle.\n",
-    "\n",
-    "The `ListNode` class represents nodes in the linked list, where each node has a `val` (a value associated with the node) and a `next` attribute (a reference to the next node in the list).\n",
-    "\n",
-    "The `hasCycle` method takes the `head` of a linked list as input and returns `True` if there is a cycle in the linked list, and `False` otherwise. It uses two pointers, `slow` and `fast`, to traverse the linked list. If there is a cycle, the `fast` pointer will eventually catch up to the `slow` pointer.\n",
-    "\n",
-    "The algorithm works as follows:\n",
-    "1. It checks if the input `head` is `None` (an empty list). If it is, the method returns `False` because an empty list can't have a cycle.\n",
-    "2. Two pointers, `slow` and `fast`, initially point to the `head` of the list.\n",
-    "3. The code enters a `while` loop where `fast` moves two steps at a time, and `slow` moves one step at a time.\n",
-    "4. If there is a cycle, `fast` will eventually catch up to `slow`, and the method returns `True`.\n",
-    "5. If the loop completes without finding a cycle, the method returns `False`."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list with a cycle\n",
-    "def create_linked_list_with_cycle(values, pos):\n",
-    "    dummy = ListNode()\n",
-    "    current = dummy\n",
-    "    cycle_node = None\n",
-    "    \n",
-    "    for i, val in enumerate(values):\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "        \n",
-    "        if i == pos:\n",
-    "            cycle_node = current\n",
-    "    \n",
-    "    if cycle_node:\n",
-    "        current.next = cycle_node\n",
-    "    \n",
-    "    return dummy.next"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "This helper function is designed to create a linked list with a cycle for testing purposes. It takes two arguments:\n",
-    "\n",
-    "1. `values`: A list of values representing the nodes in the linked list.\n",
-    "2. `pos`: An integer representing the index of the node where the cycle begins.\n",
-    "\n",
-    "Here's how the function works:\n",
-    "\n",
-    "- It starts by creating an empty `ListNode` called `dummy`. This `dummy` node is used to simplify the creation of the linked list.\n",
-    "- It initializes a `current` pointer to the `dummy` node. This pointer will be used to traverse the linked list.\n",
-    "- It initializes a `cycle_node` variable to `None`. This variable will hold the reference to the node where the cycle begins, if any.\n",
-    "- It then iterates through the `values` list, creating a new `ListNode` for each value and appending it to the linked list.\n",
-    "- Inside the loop, it checks if the current index `i` is equal to the specified `pos`. If they match, it sets `cycle_node` to the current node. This simulates the creation of a cycle in the linked list.\n",
-    "- After the loop, if `cycle_node` is not `None` (indicating a cycle should be created), it connects the last node in the linked list to `cycle_node`, effectively creating a cycle.\n",
-    "- Finally, it returns the reference to the first node of the linked list (not the `dummy` node).\n",
-    "\n",
-    "This helper function allows you to easily create test cases where you can specify the values for the linked list and the position where the cycle starts. It's particularly useful for testing the code's ability to detect cycles in linked lists."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "head = [3,2,0,-4]\n",
-    "pos = 1\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "head = [1,2]\n",
-    "pos = 0\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "head = [1]\n",
-    "pos = -1\n",
-    "\n",
-    "head = create_linked_list_with_cycle(head, pos)\n",
-    "solution = Solution()\n",
-    "result = solution.hasCycle(head)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's discuss the time and space complexity of the code for detecting a cycle in a linked list:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this code is $O(n)$, where \"$n$\" is the number of nodes in the linked list.\n",
-    "\n",
-    "The reason for this is that both the `slow` and `fast` pointers traverse the linked list, and they move at different speeds. In the worst case, when there is no cycle, the `fast` pointer will reach the end of the list after going through approximately $n/2$ nodes. In the case of a cycle, it may take some extra iterations for the `fast` pointer to catch up to the `slow` pointer. However, the total number of iterations is still proportional to the number of nodes in the linked list, making it $O(n)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this code is $O(1)$, which means it uses constant space.\n",
-    "\n",
-    "The reason for this is that regardless of the size of the linked list, the code only uses two additional pointers (`slow` and `fast`) to traverse the list. These pointers do not depend on the size of the input linked list, so the space complexity remains constant.\n",
-    "\n",
-    "**In summary**, this code efficiently detects cycles in a linked list with a time complexity of $O(n)$ and a space complexity of $O(1)$. It is an example of an algorithm that solves a complex problem with minimal memory usage."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb b/docs/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb
deleted file mode 100644
index 4ec3f3b..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/143. Reorder List.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 143. Reorder List\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Reorder List problem on LeetCode, click here!](https://leetcode.com/problems/reorder-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given the head of a singly linked-list. The list can be represented as:\n",
-    "\n",
-    "$L_0 → L_1 → … → L_{n - 1} → L_n$\n",
-    "\n",
-    "Reorder the list to be on the following form:\n",
-    "\n",
-    "$L_0 → L_n → L_1 → L_{n - 1} → L_2 → L_{n - 2} → …$\n",
-    "\n",
-    "You may not modify the values in the list's nodes. Only nodes themselves may be changed.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is in the range $[1, 5 * 10^4]$.\n",
-    "- `1 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def reorderList(head):\n",
-    "    if not head or not head.next:\n",
-    "        return head\n",
-    "\n",
-    "    # Step 1: Find the middle of the linked list\n",
-    "    slow, fast = head, head\n",
-    "    while fast.next and fast.next.next:\n",
-    "        slow = slow.next\n",
-    "        fast = fast.next.next\n",
-    "\n",
-    "    # Split the list into two halves\n",
-    "    first_half = head\n",
-    "    second_half = slow.next\n",
-    "    slow.next = None\n",
-    "\n",
-    "    # Step 2: Reverse the second half of the linked list\n",
-    "    prev = None\n",
-    "    current = second_half\n",
-    "    while current:\n",
-    "        next_node = current.next\n",
-    "        current.next = prev\n",
-    "        prev = current\n",
-    "        current = next_node\n",
-    "    second_half = prev\n",
-    "\n",
-    "    # Step 3: Merge the first and reversed second halves alternately\n",
-    "    p1, p2 = first_half, second_half\n",
-    "    while p2:\n",
-    "        next_p1 = p1.next\n",
-    "        next_p2 = p2.next\n",
-    "        p1.next = p2\n",
-    "        p2.next = next_p1\n",
-    "        p1 = next_p1\n",
-    "        p2 = next_p2\n",
-    "\n",
-    "    return head"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `reorderList` function is designed to reorder a singly linked list following the specific pattern described in the problem statement. Here's a detailed explanation of how the function works:\n",
-    "\n",
-    "1. **Base Cases Handling**:\n",
-    "   - The function first checks if the input linked list is empty (`not head`) or contains only one element (`not head.next`). If either of these conditions is met, the list cannot be reordered, so the function returns the original list as-is.\n",
-    "\n",
-    "2. **Finding the Middle of the Linked List**:\n",
-    "   - To reorder the list, we first need to find the middle point so that we can split the list into two halves. This is done using two pointers, `slow` and `fast`, initialized to the head of the list.\n",
-    "   - `slow` moves one step at a time while `fast` moves two steps at a time. When `fast` reaches the end of the list or the second-to-last node, `slow` will be at the middle node.\n",
-    "\n",
-    "3. **Splitting the List**:\n",
-    "   - After finding the middle node, we split the list into two halves:\n",
-    "     - The first half, `first_half`, contains nodes from the beginning up to the middle.\n",
-    "     - The second half, `second_half`, contains nodes from the middle to the end.\n",
-    "   - To split the list, we set the `next` pointer of the node before the middle node to `None`.\n",
-    "\n",
-    "4. **Reversing the Second Half**:\n",
-    "   - We reverse the second half of the linked list using the `prev`, `current`, and `next_node` pointers.\n",
-    "   - `prev` is initially `None`, and we iterate through the second half. For each node, we:\n",
-    "     - Set the `next` of the current node to `prev`, effectively reversing the next pointer direction.\n",
-    "     - Update `prev` to the current node.\n",
-    "     - Move to the next node using the `next_node`.\n",
-    "\n",
-    "5. **Merging the Two Halves Alternately**:\n",
-    "   - We now have two linked lists: `first_half` and the reversed `second_half`.\n",
-    "   - We merge these two lists alternately by adjusting the `next` pointers of the nodes.\n",
-    "   - `p1` and `p2` are pointers to the current nodes in `first_half` and `second_half`, respectively.\n",
-    "   - We iterate through both lists while reordering nodes:\n",
-    "     - Set the `next` of `p1` to `p2` to link a node from the first half to a node from the reversed second half.\n",
-    "     - Update `p1` and `p2` to their respective next nodes.\n",
-    "     - Repeat this process until we have processed all nodes in both halves.\n",
-    "\n",
-    "6. **Returning the Reordered List**:\n",
-    "   - After the merging process is complete, the linked list is reordered as specified.\n",
-    "   - The function returns the `head` of the reordered list.\n",
-    "\n",
-    "The overall result is a singly linked list that has been reordered according to the given pattern. The time complexity of this algorithm is O(N), where N is the number of nodes in the linked list, as we traverse the list once to find the middle, once to reverse the second half, and once to merge the two halves."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to print the linked list\n",
-    "def printLinkedList(head):\n",
-    "    result = []\n",
-    "    while head:\n",
-    "        result.append(head.val)\n",
-    "        head = head.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the helper functions:\n",
-    "**printLinkedList Function**:\n",
-    "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-    "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-    "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-    "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-    "\n",
-    "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 4, 2, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "head1 = ListNode(1, ListNode(2, ListNode(3, ListNode(4))))\n",
-    "reorderList(head1)\n",
-    "print(printLinkedList(head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 5, 2, 4, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "head2 = ListNode(1, ListNode(2, ListNode(3, ListNode(4, ListNode(5)))))\n",
-    "reorderList(head2)\n",
-    "print(printLinkedList(head2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `reorderList` function:\n",
-    "\n",
-    "**Time Complexity**:\n",
-    "1. **Finding the Middle of the Linked List**: In this step, we use two pointers, one moving one step at a time (`slow`) and the other moving two steps at a time (`fast`). This process takes $O(N/2)$ time, where $N$ is the number of nodes in the linked list.\n",
-    "\n",
-    "2. **Splitting the List**: After finding the middle, we split the list into two halves by setting the `next` pointer of the node before the middle node to `None`. This step takes $O(1)$ time.\n",
-    "\n",
-    "3. **Reversing the Second Half**: We reverse the second half of the linked list using a while loop that iterates through the second half of the list once. Therefore, this step also takes $O(N/2)$ time.\n",
-    "\n",
-    "4. **Merging the Two Halves Alternately**: In this step, we merge the two halves alternately by adjusting the `next` pointers of the nodes. We iterate through both halves once, so this step takes $O(N/2)$ time.\n",
-    "\n",
-    "Overall, the time complexity of the `reorderList` function is dominated by the steps involving reversing and merging the two halves, both of which take $O(N/2)$ time. Therefore, the total time complexity is $O(N)$.\n",
-    "\n",
-    "**Space Complexity**:\n",
-    "The space complexity of the `reorderList` function is primarily determined by the variables and data structures used within the function. Let's break down the space complexity components:\n",
-    "\n",
-    "1. **Constant Space Variables**: The variables `slow`, `fast`, `prev`, `current`, `next_node`, `p1`, and `p2` are used to traverse and manipulate the linked list. These variables occupy constant space, regardless of the input size. Therefore, they contribute $O(1)$ to the space complexity.\n",
-    "\n",
-    "2. **Split Linked Lists**: In the splitting step, we create two new linked list segments (`first_half` and `second_half`) that store references to nodes from the original linked list. These segments occupy space proportional to half of the input list, $O(N/2)$. \n",
-    "\n",
-    "3. **Reversed Second Half**: During the reversal step, we reverse the second half of the linked list in-place without creating any additional data structures. Therefore, it doesn't contribute to additional space complexity.\n",
-    "\n",
-    "4. **Overall**: Combining the above components, the total space complexity is $O(N/2)$, which simplifies to $O(N)$ in terms of space complexity.\n",
-    "\n",
-    "**In summary**, the `reorderList` function has a time complexity of $O(N)$ and a space complexity of $O(N)$ due to the creation of two new linked list segments while splitting the list. The constant space variables used for traversal do not significantly impact the overall space complexity."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Reorder by K Elements:** Generalize the reorderList function to reorder the list in a different pattern, where you reorder the list by $K$ elements at a time. For example, for $K=3$, you would reorder it as ($L_0 → L_1 → L_2 → L_n → L_{n-1} → L_{n-2} → ...$).\n",
-    "You may need to handle cases where the number of nodes is not a multiple of $K$.\n",
-    "\n",
-    "2. **Reorder by Odd and Even Nodes:** Modify the reorderList function to reorder the list in a pattern where odd-indexed nodes (1-based index) come before even-indexed nodes. For example, ($L_0 → L_n → L_1 → L_{n-1} → L_2 → L_{n-2} → ...$)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb b/docs/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb
deleted file mode 100644
index 73dbf66..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/19. Remove Nth Node From End of List.ipynb	
+++ /dev/null
@@ -1,268 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 19. Remove Nth Node From End of List\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Remove Nth Node From End of List problem on LeetCode, click here!](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the head of a linked list, remove the $n^{th}$ node from the end of the list and return its head.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is `sz`.\n",
-    "- `1 <= sz <= 30`\n",
-    "- `0 <= Node.val <= 100`\n",
-    "- `1 <= n <= sz`\n",
-    "\n",
-    "**Follow up:** Could you do this in one pass?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def removeNthFromEnd(head, n):\n",
-    "    # Create a dummy node to handle the case of removing the head node.\n",
-    "    dummy = ListNode(0)\n",
-    "    dummy.next = head\n",
-    "    first = dummy\n",
-    "    second = dummy\n",
-    "    \n",
-    "    # Advance the first pointer by n+1 nodes.\n",
-    "    for _ in range(n + 1):\n",
-    "        first = first.next\n",
-    "    \n",
-    "    # Move both pointers simultaneously until first reaches the end.\n",
-    "    while first is not None:\n",
-    "        first = first.next\n",
-    "        second = second.next\n",
-    "    \n",
-    "    # Remove the nth node by updating the next pointer of the previous node.\n",
-    "    second.next = second.next.next\n",
-    "    \n",
-    "    return dummy.next  # Return the modified head of the linked list"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a `ListNode` class to represent individual nodes in a linked list. Each node has two attributes: `val` (the value of the node) and `next` (a reference to the next node in the list).\n",
-    "\n",
-    "2. The `removeNthFromEnd` function takes the head of a linked list (`head`) and the value `n`, which represents the position from the end of the list of the node to be removed. It returns the modified head of the linked list after the removal.\n",
-    "\n",
-    "3. We create a dummy node (`dummy`) at the beginning of the list. This dummy node simplifies the code by handling cases where the head of the list needs to be removed.\n",
-    "\n",
-    "4. We initialize two pointers, `first` and `second`, both initially pointing to the dummy node.\n",
-    "\n",
-    "5. To advance the `first` pointer by `n+1` nodes, we use a `for` loop. This positions the `first` pointer `n` nodes ahead of the `second` pointer.\n",
-    "\n",
-    "6. We then move both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This ensures that the `second` pointer ends up pointing to the node that needs to be removed.\n",
-    "\n",
-    "7. To remove the nth node from the end, we update the `next` pointer of the node pointed to by the `second` pointer to skip over the node to be removed.\n",
-    "\n",
-    "8. Finally, we return `dummy.next`, which is the modified head of the linked list without the removed node.\n",
-    "\n",
-    "9. Additionally, there are two helper functions:\n",
-    "   - `createLinkedList(values)` creates a linked list from a list of values.\n",
-    "   - `convertToList(head)` converts a linked list back into a list of values."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list from a list of values.\n",
-    "def createLinkedList(values):\n",
-    "    if not values:\n",
-    "        return None\n",
-    "    head = ListNode(values[0])\n",
-    "    current = head\n",
-    "    for val in values[1:]:\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "    return head\n",
-    "\n",
-    "# Helper function to convert a linked list to a list of values.\n",
-    "def convertToList(head):\n",
-    "    result = []\n",
-    "    current = head\n",
-    "    while current:\n",
-    "        result.append(current.val)\n",
-    "        current = current.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the two helper functions:\n",
-    "\n",
-    "1. `createLinkedList(values)`: This function creates a linked list from a list of values.\n",
-    "\n",
-    "   - Input: `values` is a list containing values that you want to insert into the linked list.\n",
-    "   - Output: The function returns the head of the created linked list.\n",
-    "\n",
-    "   Explanation:\n",
-    "   - The function starts by checking if the `values` list is empty. If it is, it returns `None` to indicate an empty linked list.\n",
-    "   - If the `values` list is not empty, it creates the first node of the linked list with the value from the first element of `values`.\n",
-    "   - It then iterates through the remaining elements of `values` and creates new nodes for each value, connecting them together using the `next` attribute to form a linked list.\n",
-    "   - Finally, it returns the head of the linked list, which is the first node created.\n",
-    "   \n",
-    "\n",
-    "2. `convertToList(head)`: This function converts a linked list into a list of values.\n",
-    "\n",
-    "   - Input: `head` is the head node of the linked list that you want to convert.\n",
-    "   - Output: The function returns a list containing the values of the nodes in the linked list in order.\n",
-    "\n",
-    "   Explanation:\n",
-    "   - The function starts by initializing an empty list, `result`, to store the values of the linked list nodes.\n",
-    "   - It then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - The iteration continues until it reaches the end of the linked list (i.e., the `next` attribute of the current node becomes `None`).\n",
-    "   - After the iteration is complete, the function returns the `result` list, which now contains the values of all the nodes in the linked list in the same order as they appear in the linked list.\n",
-    "\n",
-    "These helper functions are useful for creating linked lists from lists of values and converting linked lists back into lists of values, making it easier to work with linked list examples and test cases in a more familiar list format."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 2, 3, 5]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "head1 = createLinkedList([1, 2, 3, 4, 5])\n",
-    "n1 = 2\n",
-    "new_head1 = removeNthFromEnd(head1, n1)\n",
-    "print(convertToList(new_head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "head2 = createLinkedList([1])\n",
-    "n2 = 1\n",
-    "new_head2 = removeNthFromEnd(head2, n2)\n",
-    "print(convertToList(new_head2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "head3 = createLinkedList([1, 2])\n",
-    "n3 = 1\n",
-    "new_head3 = removeNthFromEnd(head3, n3)\n",
-    "print(convertToList(new_head3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Certainly! Let's analyze the time and space complexity of the `removeNthFromEnd` function in isolation:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The `removeNthFromEnd` function performs two passes through the linked list. In the worst case, it needs to traverse the entire linked list of length $N$.\n",
-    "- The first pass positions the `first` pointer $n$ nodes ahead of the `second` pointer. This pass takes $O(N)$ time because it involves iterating through all N nodes.\n",
-    "- The second pass moves both `first` and `second` pointers simultaneously until `first` reaches the end of the list. This also takes $O(N)$ time in the worst case.\n",
-    "- Therefore, the overall time complexity of the `removeNthFromEnd` function is $O(N)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The `removeNthFromEnd` function uses a constant amount of extra space for its variables (e.g., `first`, `second`, and `dummy`). This space usage does not depend on the size of the linked list.\n",
-    "- The space complexity is $O(1)$, indicating that the space used by the function is constant and independent of the size of the input linked list.\n",
-    "\n",
-    "**In summary**, the `removeNthFromEnd` function has a time complexity of $O(N)$ and a space complexity of $O(1)$. It efficiently removes the nth node from the end of the linked list with a single pass through the list and constant extra space usage."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb b/docs/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb
deleted file mode 100644
index 09de0a3..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/206. Reverse Linked List.ipynb	
+++ /dev/null
@@ -1,297 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 206. Reverse Linked List\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Reverse Linked List problem on LeetCode, click here!](https://leetcode.com/problems/reverse-linked-list/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the `head` of a singly linked list, reverse the list, and return the reversed list.\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the list is the range `[0, 5000]`.\n",
-    "- `-5000 <= Node.val <= 5000`\n",
-    "\n",
-    "**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both?"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "# Function to reverse a linked list iteratively\n",
-    "def reverseListIterative(head):\n",
-    "    prev = None\n",
-    "    current = head\n",
-    "    \n",
-    "    while current:\n",
-    "        next_node = current.next\n",
-    "        current.next = prev\n",
-    "        prev = current\n",
-    "        current = next_node\n",
-    "    \n",
-    "    return prev\n",
-    "\n",
-    "# Function to reverse a linked list recursively\n",
-    "def reverseListRecursive(head):\n",
-    "    if not head or not head.next:\n",
-    "        return head\n",
-    "\n",
-    "    new_head = reverseListRecursive(head.next)\n",
-    "    head.next.next = head\n",
-    "    head.next = None\n",
-    "\n",
-    "    return new_head"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `reverseListIterative(head)`: This function reverses a linked list iteratively using a loop. Here's a step-by-step explanation:\n",
-    "\n",
-    "   - It takes the `head` of the input linked list as a parameter.\n",
-    "   - It initializes two pointers, `prev` and `current`, initially set to `None` and the `head` of the list, respectively.\n",
-    "   - It enters a `while` loop that continues until `current` reaches the end of the list (i.e., becomes `None`).\n",
-    "   - Inside the loop:\n",
-    "     - It stores the `next_node` which is the next node after `current`.\n",
-    "     - It updates the `next` pointer of `current` to point to the `prev` node. This effectively reverses the link direction.\n",
-    "     - It moves `prev` to `current` and `current` to `next_node`, advancing the pointers one step further in the list.\n",
-    "   - Once the loop completes, `prev` will be pointing to the new head of the reversed list (which was the last node of the original list), so it returns `prev`.\n",
-    "\n",
-    "2. `reverseListRecursive(head)`: This function reverses a linked list recursively. Here's how it works:\n",
-    "\n",
-    "   - It takes the `head` of the input linked list as a parameter.\n",
-    "   - The base case is checked: if `head` is `None` or `head.next` is `None`, meaning the list is empty or has only one node, it returns `head` as there's no need to reverse a list with zero or one element.\n",
-    "   - In the recursive case:\n",
-    "     - It calls itself with `head.next`, effectively moving down the list until it reaches the end.\n",
-    "     - Once it reaches the end, it starts reversing the links:\n",
-    "       - `head.next.next` is set to `head`, reversing the link between `head` and the next node.\n",
-    "       - `head.next` is set to `None` to avoid cycles.\n",
-    "   - Finally, it returns the new head of the reversed list, which will be the last node of the original list.\n",
-    "\n",
-    "**In summary,** `reverseListIterative` reverses the linked list by iterating through it and changing the next pointers, while `reverseListRecursive` reverses the linked list by recursively reaching the end and then reversing the links on the way back up the recursion stack. Both functions achieve the same result: reversing the linked list."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to create a linked list from a list of values\n",
-    "def createLinkedList(values):\n",
-    "    if not values:\n",
-    "        return None\n",
-    "    head = ListNode(values[0])\n",
-    "    current = head\n",
-    "    for val in values[1:]:\n",
-    "        current.next = ListNode(val)\n",
-    "        current = current.next\n",
-    "    return head\n",
-    "\n",
-    "# Helper function to convert a linked list to a list for testing\n",
-    "def linkedListToList(head):\n",
-    "    result = []\n",
-    "    current = head\n",
-    "    while current:\n",
-    "        result.append(current.val)\n",
-    "        current = current.next\n",
-    "    return result\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the two helper functions used in the provided code:\n",
-    "\n",
-    "1. `createLinkedList(values)`:\n",
-    "\n",
-    "   - Purpose: This function is used to create a linked list from a list of values. It takes a list of values as input and returns the head of the linked list.\n",
-    "\n",
-    "   - How it works:\n",
-    "     - It first checks if the input list `values` is empty. If it's empty, it returns `None` to indicate an empty linked list.\n",
-    "     - If `values` is not empty, it initializes a `head` node with the value of the first element in `values`.\n",
-    "     - It then iterates through the remaining values in `values`, creating new nodes for each value and linking them together to form a linked list.\n",
-    "     - Finally, it returns the `head` node of the newly created linked list.\n",
-    "\n",
-    "2. `linkedListToList(head)`:\n",
-    "\n",
-    "   - Purpose: This function is used to convert a linked list back into a Python list for testing and output purposes.\n",
-    "\n",
-    "   - How it works:\n",
-    "     - It takes the `head` of the linked list as input.\n",
-    "     - It initializes an empty list called `result`.\n",
-    "     - It then iterates through the linked list, starting from `head`, and appends each node's `val` (value) to the `result` list.\n",
-    "     - This process continues until the end of the linked list is reached.\n",
-    "     - Finally, it returns the `result` list, which contains the values from the linked list in the same order.\n",
-    "\n",
-    "These helper functions are used to simplify the process of creating linked lists from lists of values and converting linked lists back into lists, making it easier to work with linked lists in the provided examples and test cases."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[5, 4, 3, 2, 1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: Iterative\n",
-    "head1 = [1,2,3,4,5]\n",
-    "head1 = createLinkedList(head1)\n",
-    "reversed_head1 = reverseListIterative(head1)\n",
-    "print(linkedListToList(reversed_head1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[2, 1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: Recursive\n",
-    "head2 = [1,2]\n",
-    "head2 = createLinkedList(head2)\n",
-    "reversed_head2 = reverseListRecursive(head2)\n",
-    "print(linkedListToList(reversed_head2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3: Empty list\n",
-    "head3 = []\n",
-    "head3 = createLinkedList(head3)\n",
-    "reversed_head3 = reverseListIterative(head3)\n",
-    "print(linkedListToList(reversed_head3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the two functions:\n",
-    "\n",
-    "1. `reverseListIterative(head)`:\n",
-    "\n",
-    "   - Time Complexity: $O(n)$\n",
-    "     - The iterative function visits each node in the linked list exactly once in a single pass, where \"$n$\" is the number of nodes in the list. Therefore, the time complexity is linear in the number of nodes.\n",
-    "\n",
-    "   - Space Complexity: $O(1)$\n",
-    "     - This function uses a constant amount of extra space for the `prev`, `current`, and `next_node` pointers. Regardless of the size of the input list, the amount of additional memory used remains the same, so the space complexity is constant.\n",
-    "\n",
-    "2. `reverseListRecursive(head)`:\n",
-    "\n",
-    "   - Time Complexity: $O(n)$\n",
-    "     - The recursive function also visits each node in the linked list exactly once. It recursively traverses the list from the head to the tail, reversing the links on the way back. Therefore, like the iterative approach, the time complexity is $O(n)$, where \"$n$\" is the number of nodes.\n",
-    "\n",
-    "   - Space Complexity: $O(n)$\n",
-    "     - The recursive function uses space on the call stack for each recursive call. In the worst case, when the list has \"$n$\" nodes, it will create \"$n$\" recursive function calls on the stack, resulting in a space complexity of $O(n)$. This is because each function call stores information about its state, including the `head` pointer, until it reaches the base case and starts returning.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "- The time complexity of both functions is $O(n)$ because they both visit each node once.\n",
-    "- The space complexity of `reverseListIterative` is $O(1)$ because it uses a constant amount of extra space.\n",
-    "- The space complexity of `reverseListRecursive` is $O(n)$ due to the recursive function calls and the associated call stack space.\n",
-    "\n",
-    "Both functions are efficient in terms of time complexity, but `reverseListIterative` is more memory-efficient because it uses a constant amount of additional space, while `reverseListRecursive` uses space on the call stack proportional to the number of nodes in the list."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **K-Group Reverse:** Modify the reverseListIterative function to reverse the linked list in groups of $K$ elements. For example, if the input linked list is [1, 2, 3, 4, 5, 6], and $K$ is 3, the output should be [3, 2, 1, 6, 5, 4].\n",
-    "\n",
-    "2. **Rotate Linked List:** Write a function to rotate a linked list to the right by $K$ places. For example, if the input is [1, 2, 3, 4, 5] and $K$ is 2, the output should be [4, 5, 1, 2, 3]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb b/docs/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb
deleted file mode 100644
index b433cf3..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/21. Merge Two Sorted Lists.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 21. Merge Two Sorted Lists\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Merge Two Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-two-sorted-lists/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given the heads of two sorted linked lists `list1` and `list2`.\n",
-    "\n",
-    "Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists.\n",
-    "\n",
-    "*Return the head of the merged linked list.*\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in both lists is in the range `[0, 50]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "- Both `list1` and `list2` are sorted in non-decreasing order."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class ListNode:\n",
-    "    def __init__(self, val=0, next=None):\n",
-    "        self.val = val\n",
-    "        self.next = next\n",
-    "\n",
-    "def mergeTwoLists(list1, list2):\n",
-    "    # Create a dummy node to simplify the code.\n",
-    "    dummy = ListNode()\n",
-    "    current = dummy\n",
-    "\n",
-    "    while list1 and list2:\n",
-    "        if list1.val < list2.val:\n",
-    "            current.next = list1\n",
-    "            list1 = list1.next\n",
-    "        else:\n",
-    "            current.next = list2\n",
-    "            list2 = list2.next\n",
-    "        current = current.next\n",
-    "\n",
-    "    # Append the remaining elements from either list.\n",
-    "    if list1:\n",
-    "        current.next = list1\n",
-    "    else:\n",
-    "        current.next = list2\n",
-    "\n",
-    "    return dummy.next"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a class `ListNode` to represent the nodes of a singly-linked list. Each node has a `val` attribute to store the value of the node and a `next` attribute to point to the next node in the list.\n",
-    "\n",
-    "2. We define the `mergeTwoLists` function that takes two linked list heads, `list1` and `list2`, as input.\n",
-    "\n",
-    "3. We create a `dummy` node at the beginning of the merged list. The `dummy` node simplifies the code by serving as a placeholder, and its `next` attribute will point to the actual merged list.\n",
-    "\n",
-    "4. We initialize a `current` pointer to point to the `dummy` node initially. This `current` pointer helps us traverse and build the merged list.\n",
-    "\n",
-    "5. We enter a `while` loop that continues until either `list1` or `list2` becomes empty. Inside the loop, we compare the values of the nodes at the current positions of `list1` and `list2`.\n",
-    "\n",
-    "6. If the `val` of the node in `list1` is smaller than the `val` of the node in `list2`, we attach the node from `list1` to the merged list by updating the `next` attribute of the `current` node to point to the node in `list1`. We then move the `list1` pointer to the next node.\n",
-    "\n",
-    "7. If the `val` of the node in `list2` is smaller than or equal to the `val` of the node in `list1`, we attach the node from `list2` to the merged list in a similar manner. We move the `list2` pointer to the next node.\n",
-    "\n",
-    "8. After attaching a node to the merged list, we move the `current` pointer to the newly added node. This step is essential for keeping track of the end of the merged list.\n",
-    "\n",
-    "9. The loop continues until either `list1` or `list2` becomes empty.\n",
-    "\n",
-    "10. Once the loop exits, we check if there are any remaining elements in `list1` or `list2`. If `list1` is not empty, we attach the remaining elements of `list1` to the merged list. If `list2` is not empty, we attach the remaining elements of `list2`.\n",
-    "\n",
-    "11. Finally, we return the `next` attribute of the `dummy` node as the head of the merged list, which represents the sorted merged list."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "01849ced-1bbf-4956-8e54-451b358cb4fe",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Helper function to print the linked list\n",
-    "def printLinkedList(head):\n",
-    "    result = []\n",
-    "    while head:\n",
-    "        result.append(head.val)\n",
-    "        head = head.next\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "f7490d01-d64e-4f20-b178-e14490d6dd6f",
-   "metadata": {},
-   "source": [
-    "Let's explain the helper functions:\n",
-    "**printLinkedList Function**:\n",
-    "   - The `printLinkedList` function takes the `head` of a linked list as input and returns a list of values representing the nodes in the linked list.\n",
-    "   - Inside the function, a `result` list is initialized to store the values of the linked list nodes.\n",
-    "   - The function then iterates through the linked list starting from the `head` node and appends the `val` attribute of each node to the `result` list.\n",
-    "   - As it iterates through the list, it moves to the next node using the `next` attribute of each node.\n",
-    "   - Finally, the function returns the `result` list containing the values of the linked list nodes in the order they appear in the linked list.\n",
-    "\n",
-    "   This function is useful for debugging and displaying the contents of a linked list. It allows you to easily convert a linked list into a regular Python list for visualization and testing purposes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[1, 1, 2, 3, 4, 4]"
-      ]
-     },
-     "execution_count": 3,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "# Input: list1 = [1,2,4], list2 = [1,3,4]\n",
-    "list1 = ListNode(1, ListNode(2, ListNode(4)))\n",
-    "list2 = ListNode(1, ListNode(3, ListNode(4)))\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[]"
-      ]
-     },
-     "execution_count": 4,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "# Input: list1 = [], list2 = []\n",
-    "list1 = None\n",
-    "list2 = None\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "id": "6c69a707-02af-4212-b2e7-1881d62a62d2",
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/plain": [
-       "[0]"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# list1 = [], list2 = [0]\n",
-    "list1 = None\n",
-    "list2 = ListNode(0)\n",
-    "merged_list = mergeTwoLists(list1, list2)\n",
-    "printLinkedList(merged_list)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the `mergeTwoLists` function.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this function is $O(N + M$), where $N$ and $M$ are the lengths of `list1` and `list2`, respectively. Here's why:\n",
-    "\n",
-    "1. In the worst case, we need to traverse both `list1` and `list2` completely. This involves iterating through all the nodes in both lists once.\n",
-    "\n",
-    "2. The while loop runs until either `list1` or `list2` becomes empty. The number of iterations depends on the total number of nodes in both lists, which is N + M in the worst case.\n",
-    "\n",
-    "3. Inside the loop, we perform constant-time operations for each iteration, such as comparisons and updating pointers.\n",
-    "\n",
-    "Therefore, the dominant factor in the time complexity is the combined length of both input lists, resulting in a linear time complexity of $O(N + M)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this function is $O(1)$, which means it uses a constant amount of extra space regardless of the input sizes. Here's why:\n",
-    "\n",
-    "1. We create a few extra pointers (`dummy`, `current`) and temporary variables (`val`) to manage the merging process. These consume a fixed amount of memory, regardless of the input sizes. The number of these extra variables is independent of the lengths of `list1` and `list2`.\n",
-    "\n",
-    "2. We do not create a new data structure or allocate memory for the merged list. Instead, we rearrange the existing nodes from `list1` and `list2` to form the merged list. This operation does not consume additional memory proportional to the input sizes.\n",
-    "\n",
-    "**In summary**, the `mergeTwoLists` function has a time complexity of $O(N + M)$ and a space complexity of $O(1)$, making it an efficient solution for merging two sorted linked lists."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Merge K Sorted Lists:** Extend the problem to merge $K$ sorted linked lists instead of just two. You need to efficiently merge $K$ lists into one sorted list.\n",
-    "\n",
-    "2. **Merge Lists in a Zigzag Pattern:** Merge two sorted lists in a zigzag pattern. For example, given [1, 2, 4] and [1, 3, 5], the merged list should be [1, 1, 2, 3, 4, 5]."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb b/docs/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb
deleted file mode 100644
index 0568867..0000000
--- a/docs/_build/jupyter_execute/06. Linked List/23. Merge k Sorted Lists.ipynb	
+++ /dev/null
@@ -1,277 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 23. Merge k Sorted Lists\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Merge k Sorted Lists problem on LeetCode, click here!](https://leetcode.com/problems/merge-k-sorted-lists/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "You are given an array of $k$ linked-lists lists, each linked-list is sorted in ascending order.\n",
-    "\n",
-    "Merge all the linked-lists into one sorted linked-list and return it.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- `k == lists.length`\n",
-    "- 0 <= k <= $10^4$\n",
-    "- `0 <= lists[i].length <= 500`\n",
-    "- $-10^4$ <= lists[i][j] <= $10^4$\n",
-    "- `lists[i]` is sorted in ascending order.\n",
-    "- The sum of `lists[i].length` will not exceed $10^4$.\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for singly-linked list.\n",
-    "class ListNode:\n",
-    "     def __init__(self, val=0, next=None):\n",
-    "         self.val = val\n",
-    "         self.next = next\n",
-    "\n",
-    "class Solution:\n",
-    "    def mergeKLists(self, lists: [[ListNode]]) -> ListNode:\n",
-    "        # Check if the input list of linked lists is empty\n",
-    "        if not lists or len(lists) == 0:\n",
-    "            return None\n",
-    "\n",
-    "        # Loop until there is only one merged list left\n",
-    "        while len(lists) > 1:\n",
-    "            mergedLists = []\n",
-    "\n",
-    "            # Merge pairs of lists\n",
-    "            for i in range(0, len(lists), 2):\n",
-    "                l1 = lists[i]\n",
-    "                l2 = lists[i + 1] if (i + 1) < len(lists) else None\n",
-    "                mergedLists.append(self.mergeList(l1, l2))\n",
-    "\n",
-    "            # Update the list of lists with merged results\n",
-    "            lists = mergedLists\n",
-    "        \n",
-    "        # Return the final merged list\n",
-    "        return lists[0]\n",
-    "\n",
-    "    def mergeList(self, l1, l2):\n",
-    "        # Create a dummy node to simplify merging\n",
-    "        dummy = ListNode()\n",
-    "        tail = dummy\n",
-    "\n",
-    "        # Merge the two sorted lists\n",
-    "        while l1 and l2:\n",
-    "            if l1.val < l2.val:\n",
-    "                tail.next = l1\n",
-    "                l1 = l1.next\n",
-    "            else:\n",
-    "                tail.next = l2\n",
-    "                l2 = l2.next\n",
-    "            tail = tail.next\n",
-    "\n",
-    "        # Append any remaining elements from l1 or l2 (if any)\n",
-    "        if l1:\n",
-    "            tail.next = l1\n",
-    "        if l2:\n",
-    "            tail.next = l2\n",
-    "\n",
-    "        # Return the merged result starting from the next of the dummy node\n",
-    "        return dummy.next\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a Python class `Solution` with two methods for merging k sorted linked lists:\n",
-    "\n",
-    "1. `mergeKLists(self, lists: List[ListNode]) -> ListNode`: This method takes a list of k sorted linked lists as input and returns a single merged sorted linked list. It uses a divide-and-conquer approach to repeatedly merge pairs of lists until only one merged list remains.\n",
-    "\n",
-    "2. `mergeList(self, l1, l2)`: This method takes two sorted linked lists, `l1` and `l2`, as input and merges them into a single sorted linked list. It uses a dummy node to simplify the merging process.\n",
-    "\n",
-    "Here's a high-level overview of how the code works:\n",
-    "\n",
-    "- The `mergeKLists` method checks if the input list of linked lists is empty or contains no lists. If there are no lists, it returns `None`.\n",
-    "\n",
-    "- Inside a `while` loop, the code repeatedly merges pairs of linked lists until only one merged list remains in the `lists` array. It does this by iterating through the input lists in pairs and calling the `mergeList` method to merge each pair.\n",
-    "\n",
-    "- The `mergeList` method takes two sorted linked lists, `l1` and `l2`, and merges them into a single sorted linked list. It uses a dummy node (`dummy`) and a `tail` pointer to keep track of the merged list while comparing and merging elements from `l1` and `l2`.\n",
-    "\n",
-    "- After merging all pairs of lists and updating the `lists` array with the merged results, the loop continues until only one merged list remains in the `lists` array.\n",
-    "\n",
-    "- Finally, the `mergeKLists` method returns the merged list.\n",
-    "\n",
-    "Overall, this code efficiently merges k sorted linked lists using a divide-and-conquer strategy, resulting in a single merged sorted linked list as the output."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1 -> 1 -> 2 -> 3 -> 4 -> 4 -> 5 -> 6 -> "
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: lists = [[1,4,5],[1,3,4],[2,6]]\n",
-    "\n",
-    "lists1 = [\n",
-    "    ListNode(1, ListNode(4, ListNode(5))),\n",
-    "    ListNode(1, ListNode(3, ListNode(4))),\n",
-    "    ListNode(2, ListNode(6))\n",
-    "]\n",
-    "solution = Solution()\n",
-    "result1 = solution.mergeKLists(lists1)\n",
-    "\n",
-    "# Print the result\n",
-    "if result1:\n",
-    "    current = result1\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: lists = []\n",
-    "\n",
-    "lists2 = []\n",
-    "solution = Solution()\n",
-    "result2 = solution.mergeKLists(lists2)\n",
-    "\n",
-    "# Print the result\n",
-    "if result2:\n",
-    "    current = result2\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e140b956-7b3d-40d5-b6b0-9615860af67e",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "# Input: lists = [[]]\n",
-    "\n",
-    "lists3 = [None]\n",
-    "solution = Solution()\n",
-    "result3 = solution.mergeKLists(lists3)\n",
-    "\n",
-    "# Print the result\n",
-    "if result3:\n",
-    "    current = result3\n",
-    "    while current:\n",
-    "        print(current.val, end=\" -> \")\n",
-    "        current = current.next\n",
-    "else:\n",
-    "    print(\"None\")  # Print \"None\" for input with a single None element"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. **Heap Initialization:** The code does not use a heap. Instead, it uses a divide-and-conquer approach. The initial check for empty input lists takes $O(1)$ time.\n",
-    "\n",
-    "2. **Merging:** The merging operation is performed in a divide-and-conquer fashion. In each iteration of the `while` loop, we merge pairs of linked lists, and the number of comparisons made is proportional to the total number of nodes across all the linked lists ($n$). In each merge step, we effectively process each node once. The number of iterations required to reduce k lists to 1 is $O(log\\ k)$.\n",
-    "\n",
-    "   Therefore, the overall time complexity of the code is $O(n * log\\ k)$, where n is the total number of nodes across all lists, and $k$ is the number of linked lists.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. **Heap Space:** The code doesn't use a heap data structure, so there's no additional space complexity due to a heap.\n",
-    "\n",
-    "2. **Merged Lists:** In the `mergeList` method, we create a new merged list. However, this list is not stored in memory for all lists; it's replaced with each merged pair. The space used for these merged lists is proportional to the size of the largest merged list, which is $O(n)$ in the worst case.\n",
-    "\n",
-    "3. **Additional Variables:** The code uses a few additional variables, such as `dummy` and `tail`, but these occupy a constant amount of space and don't depend on the input size.\n",
-    "\n",
-    "   Therefore, the overall space complexity of the code is $O(n)$, where n is the total number of nodes across all lists.\n",
-    "\n",
-    "In summary, the code's time complexity is $O(n * log(k))$, and its space complexity is $O(n)$. This code efficiently merges $k$ sorted linked lists using a divide-and-conquer approach with a relatively low space overhead."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb
deleted file mode 100644
index 2238b48..0000000
--- a/docs/_build/jupyter_execute/07. Trees/100. Same Tree.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 100: Same Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Same Tree problem on LeetCode, click here!](https://leetcode.com/problems/same-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.\n",
-    "\n",
-    "Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.\n",
-    "\n",
-    "**Constraints**\n",
-    "\n",
-    "1. The number of nodes in both trees is in the range `[0, 100]`.\n",
-    "2. $-10^4$ <= Node.val <= $10^4$\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        # Initialize a TreeNode with a value (val), left child, and right child.\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def isSameTree(p, q):\n",
-    "    # Base case: If both p and q are None, the trees are the same.\n",
-    "    if not p and not q:\n",
-    "        return True\n",
-    "    \n",
-    "    # Base case: If either p or q is None (but not both), the trees are different.\n",
-    "    if not p or not q:\n",
-    "        return False\n",
-    "    \n",
-    "    # Check if the values of the current nodes (p.val and q.val) are equal.\n",
-    "    if p.val != q.val:\n",
-    "        return False\n",
-    "    \n",
-    "    # Recursively check the left and right subtrees of p and q.\n",
-    "    # If both subtrees are the same, the entire trees are the same.\n",
-    "    return isSameTree(p.left, q.left) and isSameTree(p.right, q.right)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "In this code, we define a `TreeNode` class to represent binary tree nodes and a `isSameTree` function to check if two binary trees are the same. The function uses recursive traversal to compare the trees' structures and values.\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in a binary tree. Each node has a `val` (the node's value), a `left` child, and a right child. This class will help us create and work with binary trees.\n",
-    "2. Next, we define the `isSameTree` function, which checks if two binary trees (`p` and `q`) are the same.\n",
-    "      + The base case for the recursion is when both `p` and `q` are `None`. In this case, they are considered the same, so we return `True`.\n",
-    "      + If either `p` or `q` is `None` (but not both), they cannot be the same, so we return `False`.\n",
-    "      + If the values of the current nodes `p.val` and `q.val` are not equal, we return `False` because the trees cannot be the same.\n",
-    "      + Finally, we recursively check the left and right subtrees of `p` and `q` to see if they are the same."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "\n",
-    "#Input: `p = [1,2,3]`, `q = [1,2,3]`\n",
-    "\n",
-    "p1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "q1 = TreeNode(1, TreeNode(2), TreeNode(3))\n",
-    "print(isSameTree(p1, q1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "\n",
-    "#Input: `p = [1,2]`, `q = [1,null,2]`\n",
-    "\n",
-    "p2 = TreeNode(1, TreeNode(2), None)\n",
-    "q2 = TreeNode(1, None, TreeNode(2))\n",
-    "print(isSameTree(p2, q2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "\n",
-    "#Input: p = [1,2,1], q = [1,1,2]\n",
-    "\n",
-    "p3 = TreeNode(1, TreeNode(2), TreeNode(1))\n",
-    "q3 = TreeNode(1, TreeNode(1), TreeNode(2))\n",
-    "print(isSameTree(p3, q3))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time Complexity\n",
-    "\n",
-    "The time complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "In the worst case, the function needs to visit every node in both trees once to determine if they are the same.\n",
-    "Since each node is visited exactly once, the time complexity is $O(n)$, where $n$ is the total number of nodes in the input trees.\n",
-    "\n",
-    "## Space Complexity\n",
-    "The space complexity of the `isSameTree` function can be analyzed as follows:\n",
-    "\n",
-    "The space used by the function's call stack during recursion is proportional to the maximum depth of the binary trees.\n",
-    "In the worst case, when the trees are completely unbalanced (all nodes form a single branch), the maximum depth will be $n$, where $n$ is the total number of nodes in the input trees.\n",
-    "Therefore, the space complexity is $O(n)$ due to the recursive call stack.\n",
-    "In addition to the call stack, there is a small constant amount of space used for variables and comparisons within each recursive call, but this space is not significant in terms of the overall space complexity.\n",
-    "\n",
-    "## In summary:\n",
-    "\n",
-    "+ **Time Complexity:** $O(n)$ where $n$ is the total number of nodes in the input trees.\n",
-    "+ **Space Complexity:** $O(n)$ due to the recursive call stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb b/docs/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb
deleted file mode 100644
index 9d2cc7f..0000000
--- a/docs/_build/jupyter_execute/07. Trees/102. Binary Tree Level Order Traversal.ipynb	
+++ /dev/null
@@ -1,263 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 102. Binary Tree Level Order Traversal\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Level Order Traversal problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, return *the level order traversal of its nodes' values*. (i.e., from left to right, level by level).\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-    "- `-1000 <= Node.val <= 1000`\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def levelOrder(root):\n",
-    "    # Check if the tree is empty, if so, return an empty list.\n",
-    "    if not root:\n",
-    "        return []\n",
-    "\n",
-    "    # Initialize an empty list to store the result.\n",
-    "    result = []\n",
-    "    \n",
-    "    # Initialize a queue with the root node to perform BFS.\n",
-    "    queue = [root]\n",
-    "\n",
-    "    while queue:\n",
-    "        # Initialize an empty list to store the values of nodes at the current level.\n",
-    "        level_values = []\n",
-    "        \n",
-    "        # Get the number of nodes at the current level.\n",
-    "        level_size = len(queue)\n",
-    "\n",
-    "        # Iterate through the nodes at the current level.\n",
-    "        for _ in range(level_size):\n",
-    "            # Dequeue the front node from the queue.\n",
-    "            node = queue.pop(0)\n",
-    "            \n",
-    "            # Append the value of the current node to the level_values list.\n",
-    "            level_values.append(node.val)\n",
-    "\n",
-    "            # Enqueue the left and right children of the current node if they exist.\n",
-    "            if node.left:\n",
-    "                queue.append(node.left)\n",
-    "            if node.right:\n",
-    "                queue.append(node.right)\n",
-    "\n",
-    "        # Append the level_values list (values at the current level) to the result list.\n",
-    "        result.append(level_values)\n",
-    "\n",
-    "    # Return the final result, which is a list of lists representing level order traversal.\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We define a `TreeNode` class that represents a node in the binary tree. Each `TreeNode` object has a value (`val`) and two child nodes: `left` and `right`.\n",
-    "\n",
-    "2. The `levelOrder` function takes the root of the binary tree as its input and returns the level order traversal of the tree as a list of lists.\n",
-    "\n",
-    "3. We start by checking if the input `root` is `None`, which indicates an empty tree. If the tree is empty, we return an empty list because there are no nodes to traverse.\n",
-    "\n",
-    "4. We initialize an empty list called `result` to store the final result, which will be a list of lists containing node values at each level.\n",
-    "\n",
-    "5. We initialize a queue called `queue` with the root node. This queue will be used for breadth-first traversal of the tree.\n",
-    "\n",
-    "6. We enter a while loop that continues until the `queue` is empty. Inside the loop, we perform the following steps:\n",
-    "\n",
-    "   - We initialize an empty list called `level_values` to store the values of nodes at the current level.\n",
-    "\n",
-    "   - We determine the number of nodes at the current level by getting the length of the `queue`. This is done to process nodes level by level.\n",
-    "\n",
-    "   - We iterate through the nodes at the current level using a for loop. For each node in the current level:\n",
-    "\n",
-    "     - We dequeue (remove) the front node from the `queue`.\n",
-    "\n",
-    "     - We append the value of the dequeued node to the `level_values` list, effectively collecting the values of nodes at the current level.\n",
-    "\n",
-    "     - If the dequeued node has a left child, we enqueue the left child to the `queue`.\n",
-    "\n",
-    "     - If the dequeued node has a right child, we enqueue the right child to the `queue`.\n",
-    "\n",
-    "   - After processing all nodes at the current level, we append the `level_values` list to the `result` list. This represents the values at the current level.\n",
-    "\n",
-    "7. The loop continues until all levels have been traversed, and the `queue` becomes empty.\n",
-    "\n",
-    "8. Finally, we return the `result` list, which contains lists of node values at each level, representing the level order traversal of the binary tree.\n",
-    "\n",
-    "The code effectively performs a breadth-first traversal of the binary tree, processing nodes level by level, and constructs the result list that represents the level order traversal."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[3], [9, 20], [15, 7]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(9)\n",
-    "root.right = TreeNode(20)\n",
-    "root.right.left = TreeNode(15)\n",
-    "root.right.right = TreeNode(7)\n",
-    "\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Using the same tree as before\n",
-    "root = TreeNode(1)\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root = None\n",
-    "result = levelOrder(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `levelOrder` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this function is O(N), where N is the number of nodes in the binary tree. This is because we visit each node exactly once during the breadth-first traversal.\n",
-    "\n",
-    "In the worst case, we have to enqueue and dequeue all nodes in the binary tree, which is proportional to the number of nodes (N). In each level, we process all nodes in that level, and since there are a total of log(N) levels in a balanced binary tree, the time complexity can also be approximated as O(N) for unbalanced trees.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this function is O(N), where N is the number of nodes in the binary tree. Here's how the space complexity breaks down:\n",
-    "\n",
-    "1. The `result` list stores the level order traversal, and in the worst case, it contains N/2 levels (for a completely unbalanced binary tree). So, the space used by `result` is O(N).\n",
-    "\n",
-    "2. The `queue` data structure is used for BFS traversal. In the worst case, it can store all nodes at the last level of the tree. In a balanced binary tree, the maximum number of nodes at any level is 2^(log(N)), which is still O(N). In the case of an unbalanced tree, it can be even worse. So, the space used by `queue` is O(N).\n",
-    "\n",
-    "Overall, the dominant factor in terms of space complexity is the `queue`, and the space complexity is O(N).\n",
-    "\n",
-    "In summary, the function's time complexity is O(N), and its space complexity is also O(N). It is an efficient and optimal solution for performing a level order traversal of a binary tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Reverse Level Order Traversal:** Modify the `levelOrder` function to return the level order traversal in reverse order (from bottom to top). For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[15, 7], [9, 20], [3]]`.\n",
-    "\n",
-    "2. **Zigzag Level Order Traversal:** Write a function that performs a level order traversal of a binary tree in a zigzag pattern. In a zigzag traversal, the nodes at even levels are traversed from left to right, and nodes at odd levels are traversed from right to left. For example, if the input tree is `[3, 9, 20, null, null, 15, 7]`, the output should be `[[3], [20, 9], [15, 7]]`."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb
deleted file mode 100644
index 87c5eaa..0000000
--- a/docs/_build/jupyter_execute/07. Trees/104. Maximum Depth of Binary Tree.ipynb	
+++ /dev/null
@@ -1,203 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 104. Maximum Depth of Binary Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the `root` of a binary tree, return its maximum depth.\n",
-    "\n",
-    "A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def maxDepth(root):\n",
-    "    # Base case: If the root is None, the depth is 0.\n",
-    "    if root is None:\n",
-    "        return 0\n",
-    "    \n",
-    "    # Recursively calculate the maximum depth of the left and right subtrees.\n",
-    "    left_depth = maxDepth(root.left)\n",
-    "    right_depth = maxDepth(root.right)\n",
-    "    \n",
-    "    # Return the maximum depth of the tree by adding 1 to the maximum depth of the subtrees.\n",
-    "    return max(left_depth, right_depth) + 1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's go through the code step by step to understand how it works:\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class to represent the nodes of the binary tree. Each node has three attributes:\n",
-    "   - `val`: the value stored in the node.\n",
-    "   - `left`: a reference to the left child node.\n",
-    "   - `right`: a reference to the right child node.\n",
-    "\n",
-    "2. The `maxDepth` function is the main function that calculates the maximum depth of the binary tree. It takes a single argument, `root`, which is the root node of the binary tree.\n",
-    "\n",
-    "3. In the `maxDepth` function, we have a base case:\n",
-    "   - If the `root` is `None`, it means we have reached the end of a branch of the tree (a leaf node or an empty subtree). In this case, the depth is 0 because there are no nodes to count.\n",
-    "\n",
-    "4. If the `root` is not `None`, we recursively calculate the maximum depth of the left and right subtrees:\n",
-    "   - We call `maxDepth` on the `root.left` to calculate the maximum depth of the left subtree and store it in the variable `left_depth`.\n",
-    "   - We call `maxDepth` on the `root.right` to calculate the maximum depth of the right subtree and store it in the variable `right_depth`.\n",
-    "\n",
-    "5. Finally, we return the maximum depth of the tree by taking the maximum of `left_depth` and `right_depth` and adding 1 to it. This is because we are counting the current level as well."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: root = [3,9,20,null,null,15,7]\n",
-    "\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(9)\n",
-    "root.right = TreeNode(20)\n",
-    "root.right.left = TreeNode(15)\n",
-    "root.right.right = TreeNode(7)\n",
-    "\n",
-    "print(maxDepth(root))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a230be4f-1f47-4919-87e3-62fc3f072d97",
-   "metadata": {},
-   "source": [
-    "In this example, we create a binary tree based on the given input `[3,9,20,null,null,15,7]` and calculate its maximum depth, which is `3`. The tree structure is as follows:\n",
-    "   ```\n",
-    "       3\n",
-    "      / \\\n",
-    "     9  20\n",
-    "       /  \\\n",
-    "      15   7\n",
-    "   ```\n",
-    "\n",
-    "So, the maximum depth is the length of the longest path from the root to a leaf node, which is 3 in this case."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: root = [1,null,2]\n",
-    "\n",
-    "root = TreeNode(1)\n",
-    "root.right = TreeNode(2)\n",
-    "\n",
-    "# Calculate the maximum depth of the tree and print the result\n",
-    "print(maxDepth(root))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The time complexity of the `maxDepth` function is $O(N)$, where $N$ is the number of nodes in the binary tree.\n",
-    "- This is because in the worst case, the function visits every node exactly once in a depth-first manner.\n",
-    "- The recursion explores all nodes of the tree, so the time complexity is linear with respect to the number of nodes.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity of the `maxDepth` function is $O(H)$, where H is the height of the binary tree.\n",
-    "- In the worst case, if the binary tree is completely unbalanced (skewed), the recursion stack can go as deep as the height of the tree.\n",
-    "- In the best case, if the binary tree is perfectly balanced, the height is $O(log\\ N)$, where $N$ is the number of nodes.\n",
-    "- Therefore, the space complexity can vary from $O(log\\ N)$ to $O(N)$ depending on the shape of the tree.\n",
-    "- In addition to the recursion stack, there is a small constant amount of space used for variables and function call overhead.\n",
-    "\n",
-    "**In summary:**\n",
-    "- The time complexity of the code is $O(N)$ as it visits each node once.\n",
-    "- The space complexity is $O(H)$, where H is the height of the tree, which can vary from $O(log\\ N)$ to $O(N)$ depending on the tree's shape."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb b/docs/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb
deleted file mode 100644
index 0d5bbd6..0000000
--- a/docs/_build/jupyter_execute/07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb	
+++ /dev/null
@@ -1,305 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 105. Construct Binary Tree from Preorder and Inorder Traversal\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Construct Binary Tree from Preorder and Inorder Traversal problem on LeetCode, click here!](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n",
-    "\n",
-    "---\n",
-    "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return *the binary tree.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= preorder.length <= 3000`\n",
-    "- `inorder.length == preorder.length`\n",
-    "- `-3000 <= preorder[i], inorder[i] <= 3000`\n",
-    "- `preorder` and `inorder` consist of **unique** values.\n",
-    "- Each value of `inorder` also appears in `preorder`.\n",
-    "- `preorder` is **guaranteed** to be the preorder traversal of the tree.\n",
-    "- `inorder` is **guaranteed** to be the inorder traversal of the tree.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def buildTree(preorder, inorder):\n",
-    "    if not preorder:\n",
-    "        return None\n",
-    "\n",
-    "    # The first element in the preorder traversal is the root of the current subtree\n",
-    "    root_val = preorder[0]\n",
-    "    root = TreeNode(root_val)\n",
-    "\n",
-    "    # Find the index of the root value in the inorder traversal\n",
-    "    root_idx_inorder = inorder.index(root_val)\n",
-    "\n",
-    "    # Recursively build left and right subtrees\n",
-    "    root.left = buildTree(preorder[1:1 + root_idx_inorder], inorder[:root_idx_inorder])\n",
-    "    root.right = buildTree(preorder[1 + root_idx_inorder:], inorder[root_idx_inorder + 1:])\n",
-    "\n",
-    "    return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `class TreeNode:`: This is a class definition for a binary tree node. It has three attributes:\n",
-    "   - `val`: The value of the node.\n",
-    "   - `left`: A reference to the left child node.\n",
-    "   - `right`: A reference to the right child node.\n",
-    "\n",
-    "   This class is used to create instances of binary tree nodes, which will be used to build the binary tree.\n",
-    "\n",
-    "2. `def buildTree(preorder, inorder):`: This is the main function that constructs a binary tree from its preorder and inorder traversals.\n",
-    "\n",
-    "   - `preorder`: A list representing the preorder traversal of the binary tree.\n",
-    "   - `inorder`: A list representing the inorder traversal of the binary tree.\n",
-    "\n",
-    "3. `if not preorder: return None`: This line checks if the `preorder` list is empty. If it is, it means there are no nodes to construct, so the function returns `None`.\n",
-    "\n",
-    "4. `root_val = preorder[0]`: The value of the root node is extracted from the first element of the `preorder` list.\n",
-    "\n",
-    "5. `root = TreeNode(root_val)`: A new `TreeNode` object is created with the `root_val` as its value. This represents the root of the current subtree.\n",
-    "\n",
-    "6. `root_idx_inorder = inorder.index(root_val)`: The index of the `root_val` in the `inorder` list is found. This index indicates the position of the root node in the inorder traversal.\n",
-    "\n",
-    "7. `root.left`: The left subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The left subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists up to the `root_idx_inorder`.\n",
-    "\n",
-    "8. `root.right`: The right subtree is constructed recursively by calling the `buildTree` function with the appropriate sublists of `preorder` and `inorder`. The right subtree's preorder and inorder traversals are the slices of `preorder` and `inorder` lists starting from `root_idx_inorder + 1`.\n",
-    "\n",
-    "9. Finally, the function returns the `root` of the subtree it just constructed.\n",
-    "\n",
-    "The recursive approach used here divides the problem of constructing the entire binary tree into smaller subproblems, starting with the root node and then recursively building the left and right subtrees until the entire tree is constructed."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "2d82857b-4fbe-474f-bf33-17b55c20147b",
-   "metadata": {},
-   "source": [
-    "## Helper Function \n",
-    "\n",
-    "Here is a helper function to represent the binary tree elements."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "13e6f3e1-659d-479d-9521-75629b8c782f",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def treeToList(root):\n",
-    "    # Initialize an empty list to store the elements of the binary tree\n",
-    "    result = []\n",
-    "    \n",
-    "    # Initialize a queue for level-order traversal starting with the root\n",
-    "    queue = [root]\n",
-    "\n",
-    "    while queue:\n",
-    "        # Pop the front node from the queue\n",
-    "        node = queue.pop(0)\n",
-    "        \n",
-    "        # If the node is not None (i.e., a valid node), add its value to the result list\n",
-    "        if node:\n",
-    "            result.append(node.val)\n",
-    "            \n",
-    "            # Add the left and right children of the node to the queue\n",
-    "            queue.append(node.left)\n",
-    "            queue.append(node.right)\n",
-    "        else:\n",
-    "            # If the node is None, add None to the result to represent an empty node\n",
-    "            result.append(None)\n",
-    "\n",
-    "    # Remove any trailing None values from the result list\n",
-    "    while result and result[-1] is None:\n",
-    "        result.pop()\n",
-    "\n",
-    "    # Return the resulting list representing the binary tree elements\n",
-    "    return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "86cd4c9d-a120-4dd1-a1bd-530436012574",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's break down the `treeToList` helper function step by step:\n",
-    "\n",
-    "1. `def treeToList(root):`: This function takes the root of a binary tree as input and converts it into a list.\n",
-    "\n",
-    "2. `result = []`: Initialize an empty list called `result` to store the elements of the binary tree in list format.\n",
-    "\n",
-    "3. `queue = [root]`: Initialize a queue data structure for a level-order traversal, starting with the root node.\n",
-    "\n",
-    "4. `while queue:`: This starts a loop that continues until the queue is empty, indicating that all nodes have been processed.\n",
-    "\n",
-    "5. `node = queue.pop(0)`: Dequeue the first node from the queue, effectively processing it.\n",
-    "\n",
-    "6. `if node:`: Check if the `node` is not None, which means it's a valid node in the binary tree.\n",
-    "\n",
-    "    a. `result.append(node.val)`: If the node is valid, append its value (`node.val`) to the `result` list. This represents the value of the current node in the binary tree.\n",
-    "\n",
-    "    b. `queue.append(node.left)`: Enqueue the left child of the current node if it exists. This adds the left child to the queue for processing in the next iteration.\n",
-    "\n",
-    "    c. `queue.append(node.right)`: Enqueue the right child of the current node if it exists. This adds the right child to the queue for processing in the next iteration.\n",
-    "\n",
-    "7. `else:`: If the `node` is None, it represents an empty node in the binary tree.\n",
-    "\n",
-    "    a. `result.append(None)`: Append `None` to the `result` list to indicate an empty node.\n",
-    "\n",
-    "8. `while result and result[-1] is None:`: After the traversal is complete, there might be trailing `None` values in the `result` list. This loop removes any such trailing `None` values to ensure a clean representation of the tree's elements.\n",
-    "\n",
-    "9. `return result`: Return the `result` list, which now contains the elements of the binary tree in a format where `None` represents empty nodes and the order of elements reflects a level-order traversal of the tree.\n",
-    "\n",
-    "In summary, the `treeToList` function performs a level-order traversal of the binary tree using a queue, constructing a list where each element corresponds to a node's value or represents an empty node with `None`. This list represents the binary tree's elements in a structured format."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[3, 9, 20, None, None, 15, 7]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "preorder = [3, 9, 20, 15, 7]\n",
-    "inorder = [9, 3, 15, 20, 7]\n",
-    "result = buildTree(preorder, inorder)\n",
-    "\n",
-    "print(treeToList(result))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[-1]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "preorder = [-1]\n",
-    "inorder = [-1]\n",
-    "result = buildTree(preorder, inorder)\n",
-    "\n",
-    "print(treeToList(result))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `buildTree` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of the `buildTree` function can be analyzed in terms of the number of nodes in the binary tree. Let's assume there are `n` nodes in the binary tree.\n",
-    "\n",
-    "1. Finding the root value in the `preorder` traversal takes O(1) time as it's just extracting the first element from the list.\n",
-    "2. Finding the index of the root value in the `inorder` traversal using `inorder.index(root_val)` takes O(n) time in the worst case because in the worst case, it might have to search through all `n` elements in the `inorder` list to find the index.\n",
-    "3. The recursive calls to `buildTree` for the left and right subtrees are made once for each node in the tree. Therefore, the recursive calls have a combined time complexity of O(n) as they process each node once.\n",
-    "\n",
-    "The total time complexity of the `buildTree` function is O(n) due to the recursive calls and finding the root's index in the `inorder` list.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity is determined by the space used by the function's call stack during recursion and any additional data structures used. \n",
-    "\n",
-    "1. The space used by the function call stack during recursion depends on the height of the binary tree. In the worst case, where the tree is highly unbalanced (e.g., a skewed tree), the space complexity for the call stack is O(n) as it can go as deep as the number of nodes in the tree.\n",
-    "\n",
-    "2. Additionally, the function creates TreeNode objects for each node in the binary tree. Therefore, the space complexity for these objects is also O(n).\n",
-    "\n",
-    "Overall, the space complexity of the `buildTree` function is O(n) due to the space used by the call stack and the TreeNode objects.\n",
-    "\n",
-    "In summary, the time complexity of `buildTree` is O(n), and the space complexity is O(n), where 'n' is the number of nodes in the binary tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Construct Binary Tree from Postorder and Inorder Traversal:**\n",
-    "   Modify the problem to construct a binary tree from its postorder and inorder traversals. Implement a function similar to `buildTree` but for postorder and inorder traversals.\n",
-    "\n",
-    "2. **Reconstruct Binary Tree with Duplicate Values:**\n",
-    "   Extend the problem to handle binary trees with duplicate values. Ensure that your solution correctly handles scenarios where there are duplicate values in the preorder and inorder traversals."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb b/docs/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb
deleted file mode 100644
index b661fa1..0000000
--- a/docs/_build/jupyter_execute/07. Trees/124. Binary Tree Maximum Path Sum.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 124. Binary Tree Maximum Path Sum\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Maximum Path Sum problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n",
-    "\n",
-    "---\n",
-    "A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.\n",
-    "\n",
-    "The **path sum** of a path is the sum of the node's values in the path.\n",
-    "\n",
-    "Given the `root` of a binary tree, return *the maximum **path sum** of any **non-empty** path*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[1, 3*10^4]$.\n",
-    "- `-1000 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to find the maximum path sum in a binary tree. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. The path sum of a path is the sum of the node values in that path.\n",
-    "\n",
-    "In this problem, you are given the root of a binary tree, and you need to find the maximum path sum among all possible paths in the tree. Note that the path does not need to start at the root node or end at a leaf node; it can start and end at any nodes in the tree.\n",
-    "\n",
-    "To find the maximum path sum, you need to consider both left and right subtrees of each node while traversing the tree. At each node, you have two choices:\n",
-    "\n",
-    "1. Include the current node in the path: In this case, you add the value of the current node to the sum and continue exploring both the left and right subtrees for possible extensions of the path.\n",
-    "\n",
-    "2. Start a new path from the current node: In this case, you do not include the current node in the path sum, and you choose either the left subtree or the right subtree to start a new path.\n",
-    "\n",
-    "To solve this problem, you can use a recursive approach to traverse the binary tree. For each node, you calculate the maximum path sum that can pass through that node (option 1) and also return the maximum path sum that can be extended from that node (option 2). You keep track of the global maximum path sum encountered during the traversal.\n",
-    "\n",
-    "Ultimately, the maximum path sum among all paths in the tree will be the maximum of the global maximum path sum and the maximum path sum calculated for each node.\n",
-    "\n",
-    "The constraints for this problem include:\n",
-    "\n",
-    "- The number of nodes in the tree is in the range $[1, 3 * 10^4]$.\n",
-    "- Node values are in the range [-1000, 1000].\n",
-    "\n",
-    "By considering all possible paths through the tree, the algorithm aims to find the most significant sum of node values in any path in the binary tree.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "class Solution:\n",
-    "    def maxPathSum(self, root):\n",
-    "        def max_path_sum_helper(node):\n",
-    "            if not node:\n",
-    "                return 0\n",
-    "            \n",
-    "            # Recursively calculate the maximum path sum for left and right subtrees\n",
-    "            left_max = max(0, max_path_sum_helper(node.left))\n",
-    "            right_max = max(0, max_path_sum_helper(node.right))\n",
-    "            \n",
-    "            # Update the global maximum path sum\n",
-    "            self.max_sum = max(self.max_sum, left_max + right_max + node.val)\n",
-    "            \n",
-    "            # Return the maximum path sum starting from the current node\n",
-    "            return max(left_max, right_max) + node.val\n",
-    "        \n",
-    "        self.max_sum = float('-inf')  # Initialize the global maximum to negative infinity\n",
-    "        max_path_sum_helper(root)  # Start the recursive traversal from the root\n",
-    "        return self.max_sum"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. The code starts by defining a `TreeNode` class to represent nodes in the binary tree. Each `TreeNode` has a `val` attribute representing its value, a `left` attribute pointing to the left child, and a `right` attribute pointing to the right child.\n",
-    "\n",
-    "2. Next, a `Solution` class is defined to contain the `maxPathSum` method, which will be used to find the maximum path sum in the binary tree.\n",
-    "\n",
-    "3. Within the `maxPathSum` method, a helper function called `max_path_sum_helper` is defined. This recursive function takes a single argument, `node`, which is the current node being considered during traversal.\n",
-    "\n",
-    "4. Inside the `max_path_sum_helper` function:\n",
-    "   - If `node` is `None` (i.e., the current node is a null node), it returns 0. This is the base case of the recursion.\n",
-    "   - It calculates the maximum path sum starting from the left subtree (`left_max`) and the right subtree (`right_max`). Importantly, it uses `max(0, ...)` to ensure that negative values (which would make the path sum smaller) are not considered. If a subtree's path sum is negative, it's better to not include it in the path.\n",
-    "   - The code then updates the global maximum path sum (`self.max_sum`) by checking if the sum of `left_max`, `right_max`, and the current node's value is greater than the current maximum.\n",
-    "   - Finally, it returns the maximum path sum starting from the current node, which is the maximum of `left_max` and `right_max` plus the current node's value.\n",
-    "\n",
-    "5. Before calling the `max_path_sum_helper` function, the `max_sum` attribute of the `Solution` class is initialized to negative infinity (`float('-inf')`). This is done to ensure that any valid path sum encountered during traversal will be greater than the initial value of `max_sum`.\n",
-    "\n",
-    "6. The `max_path_sum_helper` function is called with the root of the binary tree, effectively starting the traversal from the root node.\n",
-    "\n",
-    "7. Once the traversal is complete, the method returns the value of `self.max_sum`, which contains the maximum path sum found in the binary tree.\n",
-    "\n",
-    "8. Example usage at the bottom of the code demonstrates how to create binary trees and use the `maxPathSum` method to find the maximum path sum for two different tree structures.\n",
-    "\n",
-    "In summary, the code uses a recursive approach to explore all possible paths in the binary tree, ensuring that negative path sums are not considered. It keeps track of the maximum path sum encountered and returns that maximum value as the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "6\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "root1 = TreeNode(1)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(3)\n",
-    "solution = Solution()\n",
-    "print(solution.maxPathSum(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "42\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "root2 = TreeNode(-10)\n",
-    "root2.left = TreeNode(9)\n",
-    "root2.right = TreeNode(20)\n",
-    "root2.right.left = TreeNode(15)\n",
-    "root2.right.right = TreeNode(7)\n",
-    "print(solution.maxPathSum(root2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "Time Complexity:\n",
-    "- The code uses a recursive depth-first traversal to explore each node in the binary tree exactly once.\n",
-    "- During the traversal, for each node, we perform constant time operations, such as updating the `max_sum` variable and calculating the maximum path sum starting from that node.\n",
-    "- Therefore, the time complexity of the code is O(N), where N is the number of nodes in the binary tree.\n",
-    "\n",
-    "Space Complexity:\n",
-    "- The space complexity of the code is determined by the space used in the call stack during the recursive traversal.\n",
-    "- In the worst case, the depth of the call stack can be equal to the height of the binary tree. In an unbalanced tree, this could be O(N), but in a balanced binary tree, the height is O(log N).\n",
-    "- Additionally, the code uses a constant amount of space for variables like `left_max`, `right_max`, and `max_sum`.\n",
-    "- Therefore, the overall space complexity is O(H), where H is the height of the binary tree. In the worst case, it's O(N), and in the best case (a balanced binary tree), it's O(log N).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(H), where H is the height of the binary tree, ranging from O(log N) to O(N) depending on the tree's balance."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Print the Maximum Path:**\n",
-    "   Modify the code to not only find the maximum path sum but also print the nodes involved in the maximum path. You can print the nodes in the correct order from the root to the leaf.\n",
-    "\n",
-    "2. **Path Sum Count:**\n",
-    "   Instead of finding the maximum path sum, find the count of unique paths that sum to a given target value. Each path can start and end anywhere in the tree."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb b/docs/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb
deleted file mode 100644
index 5bbdf42..0000000
--- a/docs/_build/jupyter_execute/07. Trees/199. Binary Tree Right Side View.ipynb	
+++ /dev/null
@@ -1,249 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 199. Binary Tree Right Side View\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Binary Tree Right Side View problem on LeetCode, click here!](https://leetcode.com/problems/binary-tree-right-side-view/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, imagine yourself standing on the **right side** of it, return *the values of the nodes you can see ordered from top to bottom*.\n",
-    "\n",
-    " \n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range `[0, 2000]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def rightSideView(root):\n",
-    "    if not root:\n",
-    "        return []  # If the tree is empty, return an empty list.\n",
-    "\n",
-    "    result = []  # Initialize a list to store the right side view values.\n",
-    "    queue = [root]  # Initialize a queue for level-order traversal with the root node.\n",
-    "\n",
-    "    while queue:\n",
-    "        # Get the number of nodes at the current level.\n",
-    "        level_size = len(queue)\n",
-    "\n",
-    "        # Traverse all nodes at the current level and add the rightmost node to the result.\n",
-    "        for i in range(level_size):\n",
-    "            node = queue.pop(0)  # Dequeue the first node from the queue.\n",
-    "\n",
-    "            # If it's the rightmost node at this level, add its value to the result.\n",
-    "            if i == level_size - 1:\n",
-    "                result.append(node.val)\n",
-    "\n",
-    "            # Add the children of the current node to the queue.\n",
-    "            if node.left:\n",
-    "                queue.append(node.left)\n",
-    "            if node.right:\n",
-    "                queue.append(node.right)\n",
-    "\n",
-    "    return result  # Return the list of right side view values.\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start with a binary tree represented using a TreeNode class. Each node has a value (`val`) and can have a left child (`left`) and a right child (`right`).\n",
-    "\n",
-    "2. The `rightSideView` function takes the root node of the binary tree as input and returns a list of values representing the nodes you can see when standing on the right side of the tree.\n",
-    "\n",
-    "3. We check if the `root` is `None`, which means the tree is empty. If it's empty, we return an empty list because there are no nodes to see.\n",
-    "\n",
-    "4. We initialize an empty list called `result` to store the right side view values.\n",
-    "\n",
-    "5. We initialize a queue called `queue` with the root node. This queue is used for a level-order traversal of the tree.\n",
-    "\n",
-    "6. We enter a while loop that continues until the `queue` is empty. Inside this loop, we perform the following steps for each level of the tree:\n",
-    "\n",
-    "   a. We determine the number of nodes at the current level by getting the length of the `queue`. This is important for processing nodes at the same level together.\n",
-    "\n",
-    "   b. We then iterate through the nodes at the current level using a for loop. For each node in the level, we dequeue it from the `queue` using `queue.pop(0)`.\n",
-    "\n",
-    "   c. If the node we dequeue is the rightmost node at the current level (determined by `i == level_size - 1`), we add its `val` to the `result` list. This is because, when standing on the right side of the tree, you can see the rightmost node at each level.\n",
-    "\n",
-    "   d. We enqueue the left and right children of the current node (if they exist) to the `queue`. This ensures that we process the next level in the subsequent iterations of the while loop.\n",
-    "\n",
-    "7. After processing all levels of the tree, the `result` list contains the values of the rightmost nodes in each level, ordered from top to bottom.\n",
-    "\n",
-    "8. Finally, we return the `result` list as the output of the function, which represents the right side view of the binary tree.\n",
-    "\n",
-    "The code effectively performs a level-order traversal of the binary tree while keeping track of the rightmost nodes at each level and adding them to the result list. This ensures that we obtain the correct order of nodes visible from the right side of the tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 3, 4]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root1 = TreeNode(1)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(3)\n",
-    "root1.left.right = TreeNode(5)\n",
-    "root1.right.right = TreeNode(4)\n",
-    "print(rightSideView(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[1, 3]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "root2 = TreeNode(1)\n",
-    "root2.right = TreeNode(3)\n",
-    "print(rightSideView(root2))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root = None\n",
-    "result = rightSideView(root)\n",
-    "print(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of the code is O(N), where N is the number of nodes in the binary tree. Here's why:\n",
-    "\n",
-    "1. We perform a level-order traversal of the tree using a queue. In the worst case, we visit all nodes once, which takes O(N) time since we visit each node exactly once.\n",
-    "\n",
-    "2. For each node, we perform constant-time operations like dequeuing it from the queue, checking if it's the rightmost node at the current level, and enqueuing its children (if they exist). These operations do not depend on the size of the tree, so they do not contribute to the overall time complexity.\n",
-    "\n",
-    "Therefore, the dominant factor in the time complexity is the level-order traversal, making it O(N).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is also O(N). Here's why:\n",
-    "\n",
-    "1. We use a queue to perform level-order traversal. In the worst case, the queue can contain all nodes at the maximum width of the tree, which can be up to N/2 nodes for a completely unbalanced tree. Therefore, the space required for the queue is O(N).\n",
-    "\n",
-    "2. The `result` list stores the values of the rightmost nodes. In the worst case, when the binary tree is a complete binary tree, it can have roughly N/2 rightmost nodes. Therefore, the space required for the `result` list is also O(N).\n",
-    "\n",
-    "3. Other auxiliary variables like `level_size`, `i`, and `node` require only constant space and do not depend on the size of the tree.\n",
-    "\n",
-    "Combining the space used by the queue and the `result` list, we get a space complexity of O(N).\n",
-    "\n",
-    "In summary, the code has a time complexity of O(N) and a space complexity of O(N), where N is the number of nodes in the binary tree. These complexities are efficient and scale linearly with the size of the input tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Variant with Left Side View**: Modify the code to find and return the values of nodes visible from the left side of the binary tree instead of the right side.\n",
-    "\n",
-    "2. **Zigzag Right Side View**: Extend the code to return the right side view values in a zigzag order. In a zigzag order, you alternate between starting from the rightmost node at level 0, then the leftmost at level 1, rightmost at level 2, and so on."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb
deleted file mode 100644
index 3e542c9..0000000
--- a/docs/_build/jupyter_execute/07. Trees/226. Invert Binary Tree.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 226: Invert Binary Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Invert Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/invert-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given the root of a binary tree, invert the tree, and return its root.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- The number of nodes in the tree is in the range `[0, 100]`.\n",
-    "- `-100 <= Node.val <= 100`\n",
-    "\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def invertTree(root):\n",
-    "    # Base case: If the root is None or the tree is empty, return None.\n",
-    "    if not root:\n",
-    "        return None\n",
-    "\n",
-    "    # Swap the left and right subtrees of the current node.\n",
-    "    root.left, root.right = root.right, root.left\n",
-    "\n",
-    "    # Recursively invert the left and right subtrees.\n",
-    "    invertTree(root.left)\n",
-    "    invertTree(root.right)\n",
-    "\n",
-    "    return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a TreeNode class, which represents a node in a binary tree. Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-    "\n",
-    "2. The `invertTree` function is defined to invert the binary tree. It takes the root node of the tree as an argument.\n",
-    "\n",
-    "3. In the `invertTree` function, we have a base case to handle the scenario when the root is `None` (empty tree). In such cases, we return `None` because there's nothing to invert.\n",
-    "\n",
-    "4. For non-empty trees, we swap the left and right subtrees of the current node. This effectively inverts the tree at the current node.\n",
-    "\n",
-    "5. We then recursively call `invertTree` on the left and right subtrees to invert them.\n",
-    "\n",
-    "6. Finally, we return the root of the inverted tree."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 1): <__main__.TreeNode object at 0x7faa5c445ab0>\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 1\n",
-    "# Input: root = [4,2,7,1,3,6,9]\n",
-    "\n",
-    "root1 = TreeNode(4)\n",
-    "root1.left = TreeNode(2)\n",
-    "root1.right = TreeNode(7)\n",
-    "root1.left.left = TreeNode(1)\n",
-    "root1.left.right = TreeNode(3)\n",
-    "root1.right.left = TreeNode(6)\n",
-    "root1.right.right = TreeNode(9)\n",
-    "\n",
-    "inverted_root1 = invertTree(root1)\n",
-    "print(\"Inverted Tree (Example 1):\", inverted_root1)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 2): <__main__.TreeNode object at 0x7faa5c444310>\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 2\n",
-    "# Input: root = [2,1,3]\n",
-    "\n",
-    "root2 = TreeNode(2)\n",
-    "root2.left = TreeNode(1)\n",
-    "root2.right = TreeNode(3)\n",
-    "\n",
-    "inverted_root2 = invertTree(root2)\n",
-    "print(\"Inverted Tree (Example 2):\", inverted_root2)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "5897c29d-26f8-486a-878c-43c09ff25ce4",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Inverted Tree (Example 3): None\n"
-     ]
-    }
-   ],
-   "source": [
-    "### Example 3\n",
-    "# Input: root = []\n",
-    "\n",
-    "root3 = None  # Empty tree\n",
-    "\n",
-    "inverted_root3 = invertTree(root3)\n",
-    "print(\"Inverted Tree (Example 3):\", inverted_root3)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "Let's discuss the time and space complexity of the provided Python code to invert a binary tree.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of the `invertTree` function is $O(n)$, where $n$ is the number of nodes in the binary tree. This is because we visit each node exactly once during the traversal of the tree. In the worst case, we have to visit all nodes in the tree.\n",
-    "\n",
-    "The reason for this time complexity is the depth-first traversal of the tree, where we recursively process the left and right subtrees of each node.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of the code is determined by the function call stack during the recursion. In the worst case, the space complexity is $O(h)$, where $h$ is the height of the binary tree. \n",
-    "\n",
-    "In a completely unbalanced binary tree (essentially a linked list), the height $h$ is equal to the number of nodes $n$, resulting in a space complexity of $O(n)$. This occurs when the tree is skewed to one side.\n",
-    "\n",
-    "In a balanced binary tree, such as a full binary tree, the height $h$ is $O(log\\ n)$, and the space complexity is $O(log\\ n)$.\n",
-    "\n",
-    "The space complexity depends on how balanced the tree is. In practical scenarios, binary trees are often approximately balanced, so the space complexity is typically closer to $O(log\\ n)$.\n",
-    "\n",
-    "**In summary:**\n",
-    "\n",
-    "- Time Complexity: $O(n)$ where $n$ is the number of nodes.\n",
-    "- Space Complexity: $O(h)$, where $h$ is the height of the binary tree. In the worst case, it can be $O(n)$, and in a balanced tree, it is $O(log\\ n)$.\n",
-    "\n",
-    "Keep in mind that these complexities are based on the recursive implementation provided. Iterative solutions can achieve the same task with $O(1)$ space complexity, using auxiliary data structures like stacks or queues to mimic the recursion stack."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb b/docs/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb
deleted file mode 100644
index fdad9ba..0000000
--- a/docs/_build/jupyter_execute/07. Trees/230. Kth Smallest Element in a BST.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 230. Kth Smallest Element in a BST\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Kth Smallest Element in a BST problem on LeetCode, click here!](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary search tree, and an integer `k`, return *the $k^{th}$ smallest value (**1-indexed**) of all the values of the nodes in the tree.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is `n`.\n",
-    "- 1 <= `k <= n` <= $10^4$\n",
-    "- 0 <= `Node.val` <= $10^4$\n",
-    "\n",
-    "**Follow up**: If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def kthSmallest(root, k):\n",
-    "    stack = []  # Initialize an empty stack to simulate the traversal\n",
-    "    while root or stack:\n",
-    "        while root:\n",
-    "            stack.append(root)  # Push the current node onto the stack\n",
-    "            root = root.left  # Move to the left child\n",
-    "        root = stack.pop()  # Pop a node from the stack\n",
-    "        k -= 1  # Decrement k since we've visited a node\n",
-    "        if k == 0:\n",
-    "            return root.val  # If k becomes 0, return the current node's value as the kth smallest\n",
-    "        root = root.right  # Move to the right child to continue the traversal"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. We start by defining a `TreeNode` class, which represents a node in the binary search tree (BST). Each node has a value (`val`), a left child (`left`), and a right child (`right`).\n",
-    "\n",
-    "2. The `kthSmallest` function takes two parameters: `root`, which is the root of the BST, and `k`, which represents the kth smallest element we want to find.\n",
-    "\n",
-    "3. We initialize an empty stack (`stack`) to simulate the traversal of the BST. The stack will be used to keep track of nodes as we traverse the tree in an iterative manner.\n",
-    "\n",
-    "4. We enter a while loop that continues until either `root` becomes `None` (indicating we have traversed the entire tree) or the `stack` is empty.\n",
-    "\n",
-    "5. Within the loop, we start another while loop to traverse as far left as possible in the BST. We repeatedly push nodes onto the `stack` and move to their left children until we reach the leftmost leaf node. This is the smallest node in the BST.\n",
-    "\n",
-    "6. Once we have reached the leftmost leaf node (the smallest node), we pop nodes from the `stack` one by one. As we pop each node, we decrement `k` by 1 to keep track of the number of nodes we have visited.\n",
-    "\n",
-    "7. If `k` becomes 0 after decrementing, it means we have found the kth smallest element. In this case, we return the `val` of the current node as the result.\n",
-    "\n",
-    "8. If `k` is still greater than 0, it means we haven't found the kth smallest element yet. In this case, we move to the right child of the current node to continue the traversal, as the kth smallest element, if it exists, will be in the right subtree of the current node.\n",
-    "\n",
-    "9. The process continues until we find the kth smallest element or traverse the entire tree.\n",
-    "\n",
-    "10. Finally, we return the kth smallest element found.\n",
-    "\n",
-    "The key idea in this code is to perform an in-order traversal of the BST while keeping track of the kth smallest element. By visiting nodes in ascending order, we can efficiently find the kth smallest element in O(h + k) time, where h is the height of the BST and k is the desired kth element. This approach is both concise and efficient for this problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Create the tree for the first example: root = [3,1,4,null,2], k = 1\n",
-    "root1 = TreeNode(3)\n",
-    "root1.left = TreeNode(1)\n",
-    "root1.right = TreeNode(4)\n",
-    "root1.left.right = TreeNode(2)\n",
-    "k1 = 1\n",
-    "print(kthSmallest(root1, k1)) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Create the tree for the second example: root = [5,3,6,2,4,null,null,1], k = 3\n",
-    "root2 = TreeNode(5)\n",
-    "root2.left = TreeNode(3)\n",
-    "root2.right = TreeNode(6)\n",
-    "root2.left.left = TreeNode(2)\n",
-    "root2.left.right = TreeNode(4)\n",
-    "root2.left.left.left = TreeNode(1)\n",
-    "k2 = 3\n",
-    "print(kthSmallest(root2, k2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the given code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The time complexity of this code is O(h + k), where:\n",
-    "- h is the height of the binary search tree (BST).\n",
-    "- k is the desired kth smallest element we want to find.\n",
-    "\n",
-    "1. In the worst case, where the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the time complexity is O(n + k).\n",
-    "\n",
-    "2. In the best case, where the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the time complexity is O(log(n) + k).\n",
-    "\n",
-    "So, the time complexity can vary from O(log(n) + k) in the best-case scenario to O(n + k) in the worst-case scenario. Typically, for balanced BSTs, the time complexity is closer to O(log(n) + k).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "The space complexity of this code is O(h) due to the stack used for the iterative in-order traversal, where h is the height of the BST.\n",
-    "\n",
-    "1. In the worst case, when the BST is highly unbalanced and resembles a linked list, the height (h) of the tree can be equal to the number of nodes (n) in the tree. In this case, the space complexity is O(n) because the stack can potentially store all n nodes.\n",
-    "\n",
-    "2. In the best case, when the BST is perfectly balanced, the height (h) is log(n), where n is the number of nodes in the tree. In this case, the space complexity is O(log(n)) because the stack will have at most log(n) nodes.\n",
-    "\n",
-    "So, the space complexity depends on the height of the BST and can vary from O(log(n)) in the best-case scenario to O(n) in the worst-case scenario.\n",
-    "\n",
-    "In practical terms, for balanced BSTs or moderately unbalanced BSTs, the space complexity is usually close to O(log(n)), and the code is efficient in terms of space usage."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Kth Largest Element**: Modify the code to find the kth largest element in the BST instead of the kth smallest element.\n",
-    "\n",
-    "2. **Kth Smallest Element in Two BSTs**: Given two BSTs, find the kth smallest element when considering both BSTs as a single sorted list. This involves merging the two BSTs while finding the kth element efficiently."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb
deleted file mode 100644
index 0179ca4..0000000
--- a/docs/_build/jupyter_execute/07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,237 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 235. Lowest Common Ancestor of a Binary Search Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Lowest Common Ancestor of a Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n",
-    "\n",
-    "---\n",
-    "Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.\n",
-    "\n",
-    "According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes `p` and `q` as the lowest node in `T` that has both `p` and `q` as descendants (where we allow **a node to be a descendant of itself**).”\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[2, 10^5]$.\n",
-    "- $-10^9$ <= `Node.val` <= $10^9$\n",
-    "- All `Node.val` are **unique**.\n",
-    "- `p != q`\n",
-    "- `p` and `q` will exist in the BST.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def lowestCommonAncestor(root, p, q):\n",
-    "    # Ensure p is less than q\n",
-    "    if p.val > q.val:\n",
-    "        p, q = q, p\n",
-    "\n",
-    "    while root:\n",
-    "        # If the current node value is greater than both p and q, move left\n",
-    "        if root.val > q.val:\n",
-    "            root = root.left\n",
-    "        # If the current node value is less than both p and q, move right\n",
-    "        elif root.val < p.val:\n",
-    "            root = root.right\n",
-    "        # If the current node value is between p and q (inclusive), or it matches either p or q, it's the LCA\n",
-    "        else:\n",
-    "            return root"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. `class TreeNode:` defines a simple class for representing nodes in a binary tree. Each `TreeNode` has three attributes:\n",
-    "   - `val`: The value of the node.\n",
-    "   - `left`: A reference to the left child node.\n",
-    "   - `right`: A reference to the right child node.\n",
-    "\n",
-    "2. `def lowestCommonAncestor(root, p, q):` is a function that takes three arguments:\n",
-    "   - `root`: The root node of the BST.\n",
-    "   - `p`: A TreeNode representing one of the nodes for which we want to find the LCA.\n",
-    "   - `q`: A TreeNode representing the other node for which we want to find the LCA.\n",
-    "\n",
-    "3. `if p.val > q.val:` checks if the value of `p` is greater than the value of `q`. In a BST, it's essential to ensure that `p` represents the smaller value, and `q` represents the larger value. If `p` is greater than `q`, the code swaps their values.\n",
-    "\n",
-    "4. The main logic is inside the `while` loop, which runs until `root` becomes `None`. It performs the following steps to find the LCA:\n",
-    "   - If the current `root` node's value is greater than the value of `q`, it means both `p` and `q` are on the left subtree of the current node. So, we move to the left child of the current node by setting `root = root.left`.\n",
-    "   - If the current `root` node's value is less than the value of `p`, it means both `p` and `q` are on the right subtree of the current node. So, we move to the right child of the current node by setting `root = root.right`.\n",
-    "   - If neither of the above conditions is met, it means the current `root` node's value is between `p` and `q`, or it matches either `p` or `q`. In this case, the current node is the lowest common ancestor (LCA), so we return `root`.\n",
-    "\n",
-    "The algorithm is efficient because it takes advantage of the properties of a BST. It eliminates subtrees that cannot contain the LCA by comparing the values of `p`, `q`, and the current `root` node. Eventually, it reaches the LCA node, and that node is returned as the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "6\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Construct the tree\n",
-    "root = TreeNode(6)\n",
-    "root.left = TreeNode(2)\n",
-    "root.right = TreeNode(8)\n",
-    "root.left.left = TreeNode(0)\n",
-    "root.left.right = TreeNode(4)\n",
-    "root.right.left = TreeNode(7)\n",
-    "root.right.right = TreeNode(9)\n",
-    "root.left.right.left = TreeNode(3)\n",
-    "root.left.right.right = TreeNode(5)\n",
-    "\n",
-    "p = root.left  # Node 2\n",
-    "q = root.right  # Node 8\n",
-    "\n",
-    "result = lowestCommonAncestor(root, p, q)\n",
-    "print(result.val)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Using the same tree as before\n",
-    "p = root.left  # Node 2\n",
-    "q = root.left.right  # Node 4\n",
-    "\n",
-    "result = lowestCommonAncestor(root, p, q)\n",
-    "print(result.val) "
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "7fc71180-e586-4c37-9fcf-2f574cb2b9d6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3:\n",
-    "# Creating a new tree for this example\n",
-    "root2 = TreeNode(2)\n",
-    "root2.left = TreeNode(1)\n",
-    "\n",
-    "p = root2  # Node 2\n",
-    "q = root2.left  # Node 1\n",
-    "\n",
-    "result = lowestCommonAncestor(root2, p, q)\n",
-    "print(result.val)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided algorithm for finding the lowest common ancestor (LCA) in a Binary Search Tree (BST).\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this algorithm is O(h), where \"h\" is the height of the BST. In the worst case, where the tree is completely unbalanced (essentially a linked list), the height of the tree is O(n), where \"n\" is the number of nodes in the tree. However, in a well-balanced BST, the height is logarithmic, which is O(log n).\n",
-    "\n",
-    "The reason for this time complexity is that the algorithm efficiently narrows down the search space by traversing either left or right subtrees based on the values of the target nodes `p` and `q`. It eliminates entire subtrees that cannot contain the LCA, leading to a relatively quick search.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity of the algorithm is O(1). This is because it uses a constant amount of extra space, regardless of the size of the input BST. The only variables used are `root`, `p`, and `q`, and there are no data structures like stacks or queues used for additional space. The algorithm performs a simple traversal without recursion, so it does not consume extra memory as the tree depth increases.\n",
-    "\n",
-    "**In summary**, the provided algorithm for finding the LCA in a BST is both time and space-efficient. Its time complexity is O(h), where \"h\" is the height of the tree, and its space complexity is O(1), making it suitable for practical use even in large BSTs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "### Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple LCAs:** Extend the algorithm to find all the lowest common ancestors of two given nodes `p` and `q` in a BST. In some cases, there can be multiple LCAs.\n",
-    "\n",
-    "2. **LCA with k Nodes:** Given a BST and k nodes, find the lowest common ancestor of these k nodes. This is an extension of the problem where you must find the LCA of more than two nodes."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb
deleted file mode 100644
index 78a78b5..0000000
--- a/docs/_build/jupyter_execute/07. Trees/297. Serialize and Deserialize Binary Tree.ipynb	
+++ /dev/null
@@ -1,291 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 297. Serialize and Deserialize Binary Tree\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Serialize and Deserialize Binary Tree problem on LeetCode, click here!](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n",
-    "\n",
-    "---\n",
-    "Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.\n",
-    "\n",
-    "Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.\n",
-    "\n",
-    "**Clarification:** The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[0, 10^4]$.\n",
-    "- `-1000 <= Node.val <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "TThe problem is to design an algorithm to serialize and deserialize a binary tree. Serialization is the process of converting a data structure or object into a sequence of characters or bytes so that it can be easily stored in a file, transmitted over a network, or otherwise persisted. Deserialization is the reverse process of converting the serialized data back into the original data structure.\n",
-    "\n",
-    "In the context of this problem:\n",
-    "\n",
-    "1. **Serialization**: You are given a binary tree, and your task is to convert it into a string representation such that you can later recreate the same binary tree from this string. The format of serialization is flexible, but it should allow you to reconstruct the original binary tree accurately.\n",
-    "\n",
-    "2. **Deserialization**: Given a serialized string, you need to reconstruct the binary tree it represents, ensuring that it is identical to the original tree.\n",
-    "\n",
-    "Here are some key points to consider in solving this problem:\n",
-    "\n",
-    "- The input can include any valid binary tree, including trees with nodes having integer values within the range [-1000, 1000].\n",
-    "- You don't necessarily need to follow a specific format for serialization, but it should be designed in a way that allows unambiguous deserialization.\n",
-    "- The goal is to serialize the tree structure and its values and then deserialize it back into the same structure and values.\n",
-    "\n",
-    "A common approach for serialization is to use a traversal method like preorder traversal, where you visit nodes in the order: root, left subtree, right subtree. This way, you can serialize the tree into a string, and during deserialization, you can reconstruct the tree by parsing the string in the same order.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode(object):\n",
-    "    def __init__(self, x):\n",
-    "        self.val = x\n",
-    "        self.left = None\n",
-    "        self.right = None\n",
-    "\n",
-    "class Codec:\n",
-    "    def serialize(self, root):\n",
-    "        serialized  = []\n",
-    "\n",
-    "        def dfs(node):\n",
-    "            if not node:\n",
-    "                # If the node is None, represent it as \"Null\" in the serialized string\n",
-    "                serialized .append(\"Null\")\n",
-    "                return\n",
-    "            # Convert the node's value to a string and add it to the serialized string\n",
-    "            serialized .append(str(node.val))\n",
-    "            dfs(node.left)\n",
-    "            dfs(node.right)\n",
-    "\n",
-    "        dfs(root)\n",
-    "        # Join the serialized values with \",\"\n",
-    "        return \",\".join(serialized )\n",
-    "\n",
-    "    def deserialize(self, data):\n",
-    "        vals = data.split(\",\")\n",
-    "        self.i = 0\n",
-    "\n",
-    "        def dfs():\n",
-    "            if vals[self.i] == \"Null\":\n",
-    "                self.i += 1\n",
-    "                return None\n",
-    "            # Convert the value to an integer to create a new node\n",
-    "            node = TreeNode(int(vals[self.i]))\n",
-    "            self.i += 1\n",
-    "            node.left = dfs()\n",
-    "            node.right = dfs()\n",
-    "            return node\n",
-    "\n",
-    "        return dfs()"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Here's a step-by-step explanation of the code:\n",
-    "\n",
-    "1. **Definition of TreeNode**:\n",
-    "   - The code defines a simple `TreeNode` class that represents a node in a binary tree. Each `TreeNode` has three attributes:\n",
-    "     - `val`: The integer value stored in the node.\n",
-    "     - `left`: A reference to the left child node (or None if there is no left child).\n",
-    "     - `right`: A reference to the right child node (or None if there is no right child).\n",
-    "   - This class allows you to create binary tree nodes with integer values and left and right child references.\n",
-    "\n",
-    "2. **Serialization (serialize method)**:\n",
-    "   - The `serialize` method takes a `root` node as input, which is the root of the binary tree that needs to be serialized.\n",
-    "   - It initializes an empty list `serialized` to store the serialized elements.\n",
-    "   - The `dfs` (depth-first search) function is defined within the `serialize` method to perform a preorder traversal of the binary tree.\n",
-    "   - In the `dfs` function:\n",
-    "     - If the current `node` is `None` (i.e., a leaf node or a child of a leaf node), it appends the string \"Null\" to the `serialized` list to represent the absence of a node.\n",
-    "     - If the current `node` is not `None`, it appends the string representation of the `node.val` to the `serialized` list and then recursively calls `dfs` on the left and right children.\n",
-    "   - After the `dfs` traversal, the `serialized` list contains the serialized binary tree elements.\n",
-    "   - The method returns a string obtained by joining the elements in the `serialized` list with commas.\n",
-    "\n",
-    "3. **Deserialization (deserialize method)**:\n",
-    "   - The `deserialize` method takes a serialized string `data` as input, which represents a binary tree in the custom format.\n",
-    "   - It splits the `data` string by commas to obtain a list of elements called `vals`.\n",
-    "   - The method initializes an index `self.i` to 0. This index keeps track of the current position in the `vals` list during deserialization.\n",
-    "   - The `dfs` function is defined within the `deserialize` method to perform the deserialization process using a recursive approach.\n",
-    "   - In the `dfs` function:\n",
-    "     - If the current element in `vals` is \"Null,\" it means there is no node at this position in the binary tree, so it returns `None`.\n",
-    "     - If the current element is not \"Null,\" it converts the element to an integer to create a new `TreeNode` with that value.\n",
-    "     - It then recursively calls `dfs` to set the left and right children of the current node.\n",
-    "   - The method returns the root node of the reconstructed binary tree.\n",
-    "\n",
-    "Overall, this code demonstrates a way to serialize a binary tree into a string format and then deserialize it back into the original tree structure, allowing for the representation of both the tree structure and the values stored in the nodes."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1,2,Null,Null,3,4,Null,Null,5,Null,Null\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Serialize a binary tree\n",
-    "root = TreeNode(1)\n",
-    "root.left = TreeNode(2)\n",
-    "root.right = TreeNode(3)\n",
-    "root.right.left = TreeNode(4)\n",
-    "root.right.right = TreeNode(5)\n",
-    "\n",
-    "codec = Codec()\n",
-    "serialized_tree = codec.serialize(root)\n",
-    "print(serialized_tree)\n",
-    "\n",
-    "# Deserialize the serialized tree\n",
-    "new_root = codec.deserialize(serialized_tree)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Null\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Example usage:\n",
-    "# Serialize a binary tree\n",
-    "root = None\n",
-    "\n",
-    "codec = Codec()\n",
-    "serialized_tree = codec.serialize(root)\n",
-    "print(serialized_tree)\n",
-    "\n",
-    "# Deserialize the serialized tree\n",
-    "new_root = codec.deserialize(serialized_tree)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for serializing and deserializing a binary tree:\n",
-    "\n",
-    "1. **Serialization (serialize method)**:\n",
-    "\n",
-    "   - Time Complexity:\n",
-    "     - The `serialize` method uses a depth-first traversal (preorder) of the binary tree.\n",
-    "     - It visits each node exactly once.\n",
-    "     - At each node, it performs constant-time operations (string conversion and list append).\n",
-    "     - Therefore, the time complexity for serialization is O(N), where N is the number of nodes in the binary tree.\n",
-    "\n",
-    "   - Space Complexity:\n",
-    "     - The space complexity for serialization includes the space used by the `serialized` list and the recursive call stack.\n",
-    "     - The `serialized` list stores the serialized elements, and its space is proportional to the number of nodes.\n",
-    "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-    "     - Therefore, the space complexity for serialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-    "\n",
-    "2. **Deserialization (deserialize method)**:\n",
-    "\n",
-    "   - Time Complexity:\n",
-    "     - The `deserialize` method splits the serialized string into a list of elements, which takes O(N) time.\n",
-    "     - The `dfs` function is a recursive function that visits each element in the list exactly once.\n",
-    "     - At each element, it performs constant-time operations (string comparison, integer conversion, and recursive function calls).\n",
-    "     - Therefore, the time complexity for deserialization is O(N).\n",
-    "\n",
-    "   - Space Complexity:\n",
-    "     - The space complexity for deserialization includes the space used by the `vals` list and the recursive call stack.\n",
-    "     - The `vals` list stores the elements from the serialized string, and its space is proportional to the number of nodes.\n",
-    "     - The recursive call stack depth is determined by the height of the binary tree, and in the worst case (completely unbalanced tree), it can be O(N).\n",
-    "     - Therefore, the space complexity for deserialization is O(N) due to the list and O(H) due to the recursive call stack, where H is the height of the tree. In most cases, the dominant factor is O(N).\n",
-    "\n",
-    "Overall, the provided code has a time complexity of O(N) for both serialization and deserialization and a space complexity of O(N) in the majority of cases (unless the tree is severely unbalanced, in which case the height H dominates the space complexity). It efficiently serializes and deserializes a binary tree while using a linear amount of memory."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Efficient Serialization**:\n",
-    "   Optimize the serialization process to minimize the length of the serialized string. Consider using techniques like binary encoding to represent node values more efficiently.\n",
-    "\n",
-    "2. **Custom Serialization Format**:\n",
-    "   Modify the serialization and deserialization methods to use a custom format different from the one provided. Ensure that the new format allows for accurate reconstruction of the original binary tree."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb
deleted file mode 100644
index 425f22d..0000000
--- a/docs/_build/jupyter_execute/07. Trees/572. Subtree of Another Tree.ipynb	
+++ /dev/null
@@ -1,259 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 572: Subtree of Another Tree\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Subtree of Another Tree problem on LeetCode, click here!](https://leetcode.com/problems/subtree-of-another-tree/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "**Problem Description:**\n",
-    "\n",
-    "Given the roots of two binary trees `root` and `subRoot`, return `True` if there is a subtree of `root` with the same structure and node values as `subRoot`, and `False` otherwise.\n",
-    "\n",
-    "A subtree of a binary tree `tree` is a tree that consists of a node in `tree` and all of this node's descendants. The tree `tree` could also be considered as a subtree of itself.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "1. The number of nodes in the `root` tree is in the range $[1, 2000]$.\n",
-    "2. The number of nodes in the `subRoot` tree is in the range $[1, 1000]$.\n",
-    "3. $-10^4$ <= root.val <= $10^4$\n",
-    "4. $-10^4$ <= subRoot.val <= $10^4$\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a binary tree node.\n",
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "class Solution:\n",
-    "    def isSubtree(self, root, subRoot):\n",
-    "        if not root:\n",
-    "            return False\n",
-    "        \n",
-    "        # Check if the current subtree is equal to the subRoot\n",
-    "        if self.isSameTree(root, subRoot):\n",
-    "            return True\n",
-    "        \n",
-    "        # Recursively check the left and right subtrees\n",
-    "        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)\n",
-    "    \n",
-    "    def isSameTree(self, tree1, tree2):\n",
-    "        if not tree1 and not tree2:\n",
-    "            return True\n",
-    "        if not tree1 or not tree2:\n",
-    "            return False\n",
-    "        \n",
-    "        return (\n",
-    "            tree1.val == tree2.val and\n",
-    "            self.isSameTree(tree1.left, tree2.left) and\n",
-    "            self.isSameTree(tree1.right, tree2.right)\n",
-    "        )"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "This code defines a TreeNode class for the binary tree nodes and a Solution class with two methods:\n",
-    "\n",
-    "1. `isSubtree`: This method checks if there is a subtree of the `root` tree with the same structure and node values as the `subRoot` tree. It uses a helper function `isSameTree` to compare two trees for equality.\n",
-    "\n",
-    "2. `isSameTree`: This helper method recursively compares two trees to check if they are the same in structure and node values.\n",
-    "\n",
-    "### Here's a detailed explanation of the code:\n",
-    "\n",
-    "1. **TreeNode Class:**\n",
-    "\n",
-    "The `TreeNode` class is defined to represent nodes in a binary tree. Each node has a `val` (the node's value) and may have a `left` and `right` child.\n",
-    "\n",
-    "2. **Solution Class:**\n",
-    "\n",
-    "    + The `Solution` class contains the solution for the problem and defines two important methods:\n",
-    "\n",
-    "    + `isSubtree(self, root, subRoot)`:\n",
-    "\n",
-    "        - This method checks whether `subRoot` is a subtree of `root`. It takes two tree nodes, `root` and `subRoot`, as input arguments.\n",
-    "        - If `root` is `None`, it returns `False` because there is no subtree to search.\n",
-    "        - It then checks if the current subtree with `root` as its root is equal to `subRoot` using the `isSameTree` method. If they are the same, it returns `True`.\n",
-    "        - If the current subtree is not the same as `subRoot`, it recursively checks the left and right subtrees of `root` to see if `subRoot` is a subtree of any of them.\n",
-    "        - It returns `True` if `subRoot` is found in either the left or right subtree; otherwise, it returns `False`.\n",
-    "\n",
-    "    + `isSameTree(self, tree1, tree2)`:\n",
-    "\n",
-    "        - This method checks whether two trees, `tree1` and `tree2`, are the same.\n",
-    "        - If both `tree1` and `tree2` are `None`, they are considered the same tree, so it returns `True`.\n",
-    "        - If only one of them is `None` (but not both), they are different trees, so it returns `False`.\n",
-    "        - If both `tree1` and `tree2` have values, it checks if their values are equal and recursively checks if their left and right subtrees are the same.\n",
-    "        - It returns `True` if the trees are the same; otherwise, it returns `False`.\n",
-    "\n",
-    "The code effectively uses recursion to traverse the binary trees and check for subtree equality. The `isSubtree` method starts the recursive search, and the `isSameTree` method is used to compare individual subtrees. The approach is efficient and avoids unnecessary checks when possible.\n",
-    "\n",
-    "This solution allows you to determine if there exists a subtree within the `root` tree that matches the structure and node values of `subRoot`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Is subRoot a subtree of root? True\n"
-     ]
-    }
-   ],
-   "source": [
-    "#root = [3,4,5,1,2]\n",
-    "#subRoot = [4,1,2]\n",
-    "\n",
-    "# Example input\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(4)\n",
-    "root.right = TreeNode(5)\n",
-    "root.left.left = TreeNode(1)\n",
-    "root.left.right = TreeNode(2)\n",
-    "\n",
-    "subRoot = TreeNode(4)\n",
-    "subRoot.left = TreeNode(1)\n",
-    "subRoot.right = TreeNode(2)\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test the isSubtree method\n",
-    "result = solution.isSubtree(root, subRoot)\n",
-    "print(\"Is subRoot a subtree of root?\", result)"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Is subRoot a subtree of root? False\n"
-     ]
-    }
-   ],
-   "source": [
-    "#root = [3,4,5,1,2,null,null,null,null,0] \n",
-    "#subRoot = [4,1,2]\n",
-    "\n",
-    "\n",
-    "# Example input\n",
-    "root = TreeNode(3)\n",
-    "root.left = TreeNode(4)\n",
-    "root.right = TreeNode(5)\n",
-    "root.left.left = TreeNode(1)\n",
-    "root.left.right = TreeNode(2)\n",
-    "root.left.right.left = TreeNode(0)\n",
-    "\n",
-    "subRoot = TreeNode(4)\n",
-    "subRoot.left = TreeNode(1)\n",
-    "subRoot.right = TreeNode(2)\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test the isSubtree method\n",
-    "result = solution.isSubtree(root, subRoot)\n",
-    "print(\"Is subRoot a subtree of root?\", result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "86a34f0d-0789-498c-818c-2d30f84754d0",
-   "metadata": {},
-   "source": [
-    "Let's analyze the time and space complexity of the provided code for the \"Subtree of Another Tree\" problem:\n",
-    "\n",
-    "**Time Complexity**\n",
-    "\n",
-    "The time complexity of the code primarily depends on the recursive traversal of the binary tree. In both the `isSubtree` and `isSameTree` functions, we visit each node in the binary trees once. Let's break down the time complexity:\n",
-    "\n",
-    "1. The `isSubtree` function:\n",
-    "   - In the worst case, we need to visit every node in the `root` tree.\n",
-    "   - For each node in the `root` tree, we call the `isSameTree` function, which has its own traversal.\n",
-    "   - So, the total time complexity is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree.\n",
-    "\n",
-    "2. The `isSameTree` function:\n",
-    "   - In the worst case, we visit every node in both `tree1` and `tree2`.\n",
-    "   - The number of recursive calls made is proportional to the number of nodes in the trees.\n",
-    "   - So, the time complexity of this function is $O(max(n, m))$, where $n$ and $m$ are the numbers of nodes in `tree1` and `tree2`, respectively.\n",
-    "\n",
-    "Overall, the time complexity of the entire code is $O(n * m)$, where $n$ is the number of nodes in the `root` tree, and $m$ is the number of nodes in the `subRoot` tree. In practice, it may be less than $O(n * m)$ if a subtree mismatch is detected early during the traversal.\n",
-    "\n",
-    "**Space Complexity**\n",
-    "\n",
-    "The space complexity of the code is determined by the function call stack during recursion and the space used by the recursive functions. Let's analyze the space complexity:\n",
-    "\n",
-    "1. The `isSubtree` function:\n",
-    "   - It uses the call stack for recursion.\n",
-    "   - The maximum depth of the recursion is equal to the height of the `root` tree, which can be $O(n)$ in the worst case (unbalanced tree).\n",
-    "   - Additionally, the function doesn't use any significant extra space other than the recursion stack.\n",
-    "\n",
-    "2. The `isSameTree` function:\n",
-    "   - It also uses the call stack for recursion.\n",
-    "   - The maximum depth of the recursion is equal to the height of the `tree1` or `tree2`, whichever is greater.\n",
-    "   - So, the maximum space used for the call stack is $O(max(n, m))$.\n",
-    "\n",
-    "In summary, the space complexity of the code is $O(max(n, m))$ due to the function call stack. It scales with the maximum height of the trees being compared.\n",
-    "\n",
-    "Overall, the code is efficient and works well for trees with moderate sizes. However, it's important to keep in mind that the worst-case time complexity is $O(n * m)$, so for very large trees, the performance may degrade."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb b/docs/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb
deleted file mode 100644
index 0cbe2fc..0000000
--- a/docs/_build/jupyter_execute/07. Trees/98. Validate Binary Search Tree.ipynb	
+++ /dev/null
@@ -1,215 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 98. Validate Binary Search Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Validate Binary Search Tree problem on LeetCode, click here!](https://leetcode.com/problems/validate-binary-search-tree/)\n",
-    "\n",
-    "---\n",
-    "Given the `root` of a binary tree, *determine if it is a valid binary search tree (BST)*.\n",
-    "\n",
-    "A **valid BST** is defined as follows:\n",
-    "\n",
-    "- The left subtree of a node contains only nodes with keys **less than** the node's key.\n",
-    "- The right subtree of a node contains only nodes with keys **greater than** the node's key.\n",
-    "- Both the left and right subtrees must also be binary search trees. \n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the tree is in the range $[1, 10^4]$.\n",
-    "- $-2^{31}$ <= `Node.val` <= $2^{31} - 1$\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to solve this problem:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TreeNode:\n",
-    "    def __init__(self, val=0, left=None, right=None):\n",
-    "        self.val = val\n",
-    "        self.left = left\n",
-    "        self.right = right\n",
-    "\n",
-    "def is_valid_BST(root):\n",
-    "    def is_valid(node, min_val, max_val):\n",
-    "        # Base case: If the node is None, it's a valid BST.\n",
-    "        if node is None:\n",
-    "            return True\n",
-    "        \n",
-    "        # Check if the current node's value is within the valid range.\n",
-    "        if not (min_val < node.val < max_val):\n",
-    "            return False\n",
-    "        \n",
-    "        # Recursively check the left and right subtrees with updated ranges.\n",
-    "        return (is_valid(node.left, min_val, node.val) and\n",
-    "                is_valid(node.right, node.val, max_val))\n",
-    "    \n",
-    "    # Call the helper function starting with a wide range for root node.\n",
-    "    return is_valid(root, float('-inf'), float('inf'))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- It defines a `TreeNode` class to represent nodes in the binary tree.\n",
-    "\n",
-    "- The `is_valid_BST` function takes the root node of the binary tree as input and returns `True` if the tree is a valid BST, and `False` otherwise.\n",
-    "\n",
-    "- Inside the `is_valid_BST` function, there is a helper function called `is_valid` that performs the actual validation using a recursive approach.\n",
-    "\n",
-    "- The `is_valid` function checks each node in the tree to ensure that it satisfies the properties of a BST:\n",
-    "  - The value of the current node must be within a valid range defined by `min_val` and `max_val`.\n",
-    "  - The left subtree of the current node should contain values less than the current node's value.\n",
-    "  - The right subtree of the current node should contain values greater than the current node's value.\n",
-    "\n",
-    "- If any of these conditions are violated, the function returns `False`, indicating that the tree is not a valid BST.\n",
-    "\n",
-    "- If all nodes satisfy these conditions, the function returns `True`, indicating that the tree is a valid BST.\n",
-    "\n",
-    "- The code calls the `is_valid` function with the root node and initial range values of negative infinity to positive infinity to start the validation.\n",
-    "\n",
-    "- The time complexity of the code is O(N), where N is the number of nodes in the tree, as it traverses each node once.\n",
-    "\n",
-    "- The space complexity depends on the height of the tree. In the average case for a balanced BST, the space complexity is O(log N), but in the worst case (skewed tree), it can be O(N) due to the recursive call stack.\n",
-    "\n",
-    "In summary, this code checks whether a given binary tree is a valid BST by recursively validating each node's value and its left and right subtrees while maintaining valid value ranges. If all nodes satisfy the BST properties, the tree is considered a valid BST."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "# Create the tree for the first example: [2, 1, 3]\n",
-    "root1 = TreeNode(2)\n",
-    "root1.left = TreeNode(1)\n",
-    "root1.right = TreeNode(3)\n",
-    "print(is_valid_BST(root1))"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "192912fb-9d12-4911-9a4f-bfd37043e11d",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "\n",
-    "# Create the tree for the second example: [5, 1, 4, None, None, 3, 6]\n",
-    "root2 = TreeNode(5)\n",
-    "root2.left = TreeNode(1)\n",
-    "root2.right = TreeNode(4)\n",
-    "root2.right.left = TreeNode(3)\n",
-    "root2.right.right = TreeNode(6)\n",
-    "print(is_valid_BST(root2))"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `is_valid_BST` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The time complexity of the function primarily depends on the number of nodes in the binary tree.\n",
-    "- In the worst case, we may have to visit every node in the tree once to validate whether it's part of a valid BST.\n",
-    "- Since we are performing a depth-first search (DFS) traversal of the tree, the time complexity is O(N), where N is the number of nodes in the tree.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The space complexity is determined by the space used by the recursive call stack during the DFS traversal.\n",
-    "- In the worst case, if the tree is completely unbalanced (a skewed tree), the maximum depth of the call stack would be equal to the height of the tree.\n",
-    "- In a balanced BST, the height is approximately log2(N), where N is the number of nodes.\n",
-    "- Therefore, the space complexity of the call stack is O(log N) for a balanced BST.\n",
-    "- In the worst case (skewed tree), the space complexity can be O(N) as the height of the tree can be equal to N.\n",
-    "\n",
-    "**Overall:**\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(log N) on average for a balanced BST, and O(N) in the worst case for a skewed tree.\n",
-    "\n",
-    "The space complexity is typically dominated by the recursive call stack, and it varies depending on the shape of the binary tree. In practice, for balanced binary trees, the space complexity is often close to O(log N), which is quite efficient."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Complex Constraints**: Modify the problem to have more complex constraints on the tree. For example, consider a binary tree with constraints like \"The left subtree of a node contains only nodes with keys less than or equal to the node's key,\" and \"The right subtree of a node contains only nodes with keys greater than or equal to the node's key.\" How would you adapt the code to handle these constraints?\n",
-    "\n",
-    "2. **Handling Duplicates**: Modify the code to handle binary search trees that allow duplicate values. In a standard BST, each value is unique, but in this case, multiple nodes can have the same value. The tree should still be considered valid if it follows the BST property."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb b/docs/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb
deleted file mode 100644
index 5c54c25..0000000
--- a/docs/_build/jupyter_execute/08. Tries/208. Implement Trie (Prefix Tree).ipynb	
+++ /dev/null
@@ -1,245 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 208. Implement Trie (Prefix Tree)\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Implement Trie problem on LeetCode, click here!](https://leetcode.com/problems/implement-trie-prefix-tree/)\n",
-    "\n",
-    "---\n",
-    "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.\n",
-    "\n",
-    "Implement the Trie class:\n",
-    "\n",
-    "- `Trie()` Initializes the trie object.\n",
-    "- `void insert(String word)` Inserts the string `word` into the trie.\n",
-    "- `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.\n",
-    "- `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= word.length, prefix.length <= 2000`\n",
-    "- `word` and `prefix` consist only of lowercase English letters.\n",
-    "- At most $3 * 10^4$ calls in total will be made to `insert`, `search`, and `startsWith`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to implement a data structure known as a Trie (pronounced \"try\") or Prefix Tree. A Trie is a tree-like data structure that is used to efficiently store and retrieve a set of strings or words. It's particularly useful for tasks involving string manipulation, such as autocomplete and spell-checking. The problem statement defines the following operations for implementing the Trie class:\n",
-    "\n",
-    "1. `Trie()`: This is the constructor that initializes the Trie object.\n",
-    "\n",
-    "2. `void insert(String word)`: This method inserts the given string `word` into the Trie. It effectively adds the characters of the word to the Trie's structure, creating nodes for each character if they don't already exist. At the end of the word, a special flag is set to indicate that this node represents the end of a valid word.\n",
-    "\n",
-    "3. `boolean search(String word)`: This method checks if the given string `word` is present in the Trie. It starts from the root of the Trie and traverses the Trie by following the characters in the word. If it successfully traverses the Trie and reaches the end of the word, it returns `true`, indicating that the word exists in the Trie; otherwise, it returns `false`.\n",
-    "\n",
-    "4. `boolean startsWith(String prefix)`: This method checks if there is any previously inserted word in the Trie that has the given `prefix`. It's similar to the `search` method but does not require that the prefix be a complete word. If there is any word in the Trie that starts with the given prefix, it returns `true`; otherwise, it returns `false`.\n",
-    "\n",
-    "The problem also provides an example scenario where these operations are called, demonstrating the expected output for each operation.\n",
-    "\n",
-    "In summary, the goal is to create a data structure (Trie) that efficiently stores a set of strings and provides methods to insert new strings, search for complete words, and check if a given prefix exists in the stored set of strings.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        self.children = {}           # A dictionary to store child nodes\n",
-    "        self.is_end_of_word = False  # Indicates if a word ends at this node\n",
-    "\n",
-    "class Trie:\n",
-    "    def __init__(self):\n",
-    "        self.root = TrieNode()       # Initialize the Trie with a root node\n",
-    "\n",
-    "    def insert(self, word):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                node.children[char] = TrieNode()  # Create a new node if the character is not present\n",
-    "            node = node.children[char]           # Move to the child node\n",
-    "        node.is_end_of_word = True                # Mark the end of the inserted word\n",
-    "\n",
-    "    def search(self, word):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                return False         # If the character is not found, the word is not in the Trie\n",
-    "            node = node.children[char]  # Move to the child node\n",
-    "        return node.is_end_of_word    # Check if the node represents the end of a valid word\n",
-    "\n",
-    "    def startsWith(self, prefix):\n",
-    "        node = self.root             # Start from the root\n",
-    "        for char in prefix:\n",
-    "            if char not in node.children:\n",
-    "                return False         # If the character is not found, no word starts with the prefix\n",
-    "            node = node.children[char]  # Move to the child node\n",
-    "        return True                  # Prefix found in the Trie"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "Let's explain how the code works step by step:\n",
-    "\n",
-    "1. `TrieNode` Class:\n",
-    "   - `TrieNode` is a class that represents nodes in the Trie. Each node has two attributes:\n",
-    "     - `children`: This is a dictionary that stores child nodes. Each key in the dictionary represents a character, and the corresponding value is the child node for that character.\n",
-    "     - `is_end_of_word`: This boolean flag indicates whether the node represents the end of a complete word. Initially, it's set to `False` for all nodes.\n",
-    "\n",
-    "2. `Trie` Class:\n",
-    "   - `Trie` is the main class that implements the Trie data structure. It has the following methods:\n",
-    "\n",
-    "   - `__init__(self)`: The constructor initializes the Trie object by creating a root node, which serves as the starting point for all Trie operations.\n",
-    "\n",
-    "   - `insert(self, word)`: This method inserts a string `word` into the Trie. It starts from the root node and iterates through each character in the word.\n",
-    "     - If a character is not present as a child node, it creates a new node for that character.\n",
-    "     - It then moves to the child node and continues the process until the entire word is inserted.\n",
-    "     - Finally, it sets the `is_end_of_word` flag to `True` for the last node to mark the end of the inserted word.\n",
-    "\n",
-    "   - `search(self, word)`: This method checks if a complete word (string) exists in the Trie. It starts from the root node and iterates through each character in the word.\n",
-    "     - If a character is not found as a child node, it immediately returns `False` because the word is not in the Trie.\n",
-    "     - It continues to move to the child node for each character.\n",
-    "     - After reaching the end of the word, it checks if the `is_end_of_word` flag is `True` for the last node to confirm the presence of the word.\n",
-    "\n",
-    "   - `startsWith(self, prefix)`: This method checks if there is any previously inserted word in the Trie that starts with a given `prefix`. It follows the same logic as the `search` method but does not require the entire word to be present.\n",
-    "     - If the prefix is found in the Trie, it returns `True`; otherwise, it returns `False`.\n",
-    "\n",
-    "3. Example Usage:\n",
-    "   - The code demonstrates how to create a Trie object, insert words (\"apple\" and \"app\"), and perform operations on the Trie:\n",
-    "     - It inserts the word \"apple\" into the Trie.\n",
-    "     - It checks if \"apple\" is in the Trie, which returns `True`.\n",
-    "     - It checks if \"app\" is in the Trie, which returns `False`.\n",
-    "     - It checks if there is any word in the Trie that starts with \"app,\" which returns `True`.\n",
-    "     - It inserts the word \"app\" into the Trie.\n",
-    "     - It checks if \"app\" is in the Trie again, which now returns `True`.\n",
-    "\n",
-    "In summary, the code efficiently implements a Trie data structure with the ability to insert words, search for complete words, and check for the existence of words with a given prefix. The Trie is organized as a tree of nodes, with each node representing a character in the words being stored."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n",
-      "False\n",
-      "True\n",
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "\n",
-    "trie = Trie()\n",
-    "trie.insert(\"apple\")\n",
-    "print(trie.search(\"apple\"))   # Output: True\n",
-    "print(trie.search(\"app\"))     # Output: False\n",
-    "print(trie.startsWith(\"app\")) # Output: True\n",
-    "trie.insert(\"app\")\n",
-    "print(trie.search(\"app\"))     # Output: True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the Trie implementation:\n",
-    "\n",
-    "1. Time Complexity:\n",
-    "   - Insertion (`insert` method): The time complexity of inserting a word into the Trie is O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to insert it into the Trie.\n",
-    "   - Search (`search` method): The time complexity of searching for a word in the Trie is also O(m), where m is the length of the word. In the worst case, you may need to traverse the entire word to determine if it exists in the Trie.\n",
-    "   - Starts with (`startsWith` method): The time complexity of checking if a prefix exists in the Trie is O(p), where p is the length of the prefix. In the worst case, you may need to traverse the entire prefix to determine its presence.\n",
-    "\n",
-    "   Therefore, for each operation (insertion, search, or starts with), the time complexity is O(m) or O(p), where m is the length of the word being operated on, and p is the length of the prefix.\n",
-    "\n",
-    "2. Space Complexity:\n",
-    "   - The space complexity of the Trie is determined by the number of nodes and characters stored in it. In the worst case, where none of the inserted words share common prefixes, the space complexity is O(N), where N is the total number of characters across all inserted words.\n",
-    "   - Each node in the Trie represents a character, and the number of nodes is directly related to the total number of characters.\n",
-    "\n",
-    "   In practice, the space complexity can be less than O(N) because common prefixes are shared among words in the Trie, leading to space optimization.\n",
-    "\n",
-    "In summary:\n",
-    "- Time complexity for each operation (insertion, search, starts with) is O(m) or O(p), where m is the length of the word and p is the length of the prefix.\n",
-    "- Space complexity is O(N) in the worst case, where N is the total number of characters across all inserted words. However, space optimization occurs due to common prefix sharing in practice, potentially reducing the actual space used."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Count Prefixes**:\n",
-    "   Implement a method to count the number of words in the Trie that have a specific prefix. This exercise requires you to maintain additional data in the Trie nodes to keep track of the count.\n",
-    "\n",
-    "2. **Auto-Complete Suggestions**:\n",
-    "   Implement an auto-complete feature using the Trie. Given a prefix, the program should return a list of suggested words based on the words previously inserted into the Trie."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb b/docs/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb
deleted file mode 100644
index bdd867c..0000000
--- a/docs/_build/jupyter_execute/08. Tries/211. Design Add and Search Words Data Structure.ipynb	
+++ /dev/null
@@ -1,271 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 211. Design Add and Search Words Data Structure\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Design Add and Search Words Data Structure problem on LeetCode, click here!](https://leetcode.com/problems/design-add-and-search-words-data-structure/)\n",
-    "\n",
-    "---\n",
-    "Design a data structure that supports adding new words and finding if a string matches any previously added string.\n",
-    "\n",
-    "Implement the `WordDictionary` class:\n",
-    "\n",
-    "- `WordDictionary()` Initializes the object.\n",
-    "- `void addWord(word)` Adds `word` to the data structure, it can be matched later.\n",
-    "- `bool search(word)` Returns `true` if there is any string in the data structure that matches `word` or `false` otherwise. `word` may contain dots `'.'` where dots can be matched with any letter.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= word.length <= 25`\n",
-    "- `word` in `addWord` consists of lowercase English letters.\n",
-    "- `word` in `search` consist of `'.'` or lowercase English letters.\n",
-    "- There will be at most `2` dots in `word` for `search` queries.\n",
-    "- At most $10^4$ calls will be made to `addWord` and `search`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to design a data structure called `WordDictionary` that allows you to add words and search for words efficiently. The key feature of this data structure is that it should support wildcard search, where a dot ('.') can match any letter.\n",
-    "\n",
-    "Here are the specific requirements and explanations for the problem:\n",
-    "\n",
-    "1. Initialize the `WordDictionary` object using the constructor `WordDictionary()`.\n",
-    "\n",
-    "2. The `addWord(word)` method allows you to add a word to the data structure. Once added, you should be able to search for this word later. The words consist of lowercase English letters, and each word has a length between 1 and 25 characters.\n",
-    "\n",
-    "3. The `search(word)` method allows you to search for a word in the data structure. This method returns `True` if there is any string in the data structure that matches the given word or `False` otherwise. The word you are searching for may contain dots ('.'), where each dot can match any letter.\n",
-    "\n",
-    "4. The wildcard character ('.') in the `search` method allows for partial or fuzzy searching. For example, if the word dictionary contains the words \"bad,\" \"dad,\" and \"mad,\" then:\n",
-    "   - Searching for \"pad\" should return `False` because there is no exact match.\n",
-    "   - Searching for \"bad\" should return `True` because \"bad\" is in the dictionary.\n",
-    "   - Searching for \".ad\" should return `True` because it can match \"bad,\" \"dad,\" or \"mad.\"\n",
-    "   - Searching for \"b..\" should return `True` because it can match \"bad,\" \"bed,\" \"bet,\" etc.\n",
-    "\n",
-    "5. The problem specifies that there will be at most two dots ('.') in search queries, and there will be at most 10^4 calls to both `addWord` and `search`.\n",
-    "\n",
-    "In summary, you need to implement the `WordDictionary` class that efficiently supports adding words and searching for words, where the search can include wildcard characters ('.') that match any letter.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        # Initialize a TrieNode with children and a flag to indicate the end of a word.\n",
-    "        self.children = {}\n",
-    "        self.is_end_of_word = False\n",
-    "\n",
-    "class WordDictionary:\n",
-    "\n",
-    "    def __init__(self):\n",
-    "        # Initialize the WordDictionary with a root node.\n",
-    "        self.root = TrieNode()\n",
-    "\n",
-    "    def addWord(self, word: str) -> None:\n",
-    "        node = self.root\n",
-    "        # Iterate through the characters in the word.\n",
-    "        for char in word:\n",
-    "            if char not in node.children:\n",
-    "                # Create a new node for the character if it doesn't exist.\n",
-    "                node.children[char] = TrieNode()\n",
-    "            # Move to the next node.\n",
-    "            node = node.children[char]\n",
-    "        # Mark the end of the word by setting the flag to True.\n",
-    "        node.is_end_of_word = True\n",
-    "\n",
-    "    def search_helper(self, node: TrieNode, word: str) -> bool:\n",
-    "        if not word:\n",
-    "            # If there are no characters left in the word, check if we reached the end of a word in the trie.\n",
-    "            return node.is_end_of_word\n",
-    "        \n",
-    "        char = word[0]\n",
-    "        if char == '.':\n",
-    "            # If the character is a dot, explore all possible child nodes.\n",
-    "            for child in node.children.values():\n",
-    "                if self.search_helper(child, word[1:]):\n",
-    "                    return True\n",
-    "        elif char in node.children:\n",
-    "            # If the character is in the children of the current node, move to the next node.\n",
-    "            return self.search_helper(node.children[char], word[1:])\n",
-    "        \n",
-    "        # If the character is not found and is not a dot, the word is not in the trie.\n",
-    "        return False\n",
-    "\n",
-    "    def search(self, word: str) -> bool:\n",
-    "        # Start the search from the root of the trie.\n",
-    "        return self.search_helper(self.root, word)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "This code defines a `WordDictionary` class that uses a Trie data structure to efficiently store and search for words. Here's a step-by-step explanation:\n",
-    "\n",
-    "1. `TrieNode` class: This class represents nodes in the Trie data structure. Each node has two attributes: `children` (a dictionary to store child nodes) and `is_end_of_word` (a flag to indicate whether the node marks the end of a word).\n",
-    "\n",
-    "2. `WordDictionary` class: This class initializes with an empty Trie by creating a root node.\n",
-    "\n",
-    "3. `addWord` method: This method adds a word to the Trie. It iterates through each character in the word and creates Trie nodes as necessary. It sets the `is_end_of_word` flag to `True` for the final character of the word to mark the end of the word.\n",
-    "\n",
-    "4. `search_helper` method: This is a recursive helper function for searching words in the Trie. It takes a Trie node (`node`) and a word to search (`word`) as input. If there are no characters left in the word (`not word`), it checks if the current node marks the end of a word. If it does, it returns `True`.\n",
-    "\n",
-    "5. If the first character of the word is a dot ('.'), the function explores all possible child nodes by iterating through `node.children.values()` and recursively calls `search_helper` for each child with the remaining part of the word (`word[1:]`).\n",
-    "\n",
-    "6. If the first character of the word is not a dot and is found in the children of the current node, the function recursively moves to the next node by calling `search_helper` on the child node and the remaining part of the word.\n",
-    "\n",
-    "7. If the character is not found in the children and is not a dot, the word is not in the Trie, so the function returns `False`.\n",
-    "\n",
-    "8. `search` method: This is the public method for searching words. It initiates the search process by calling `search_helper` starting from the root node of the Trie.\n",
-    "\n",
-    "Overall, this code efficiently implements a Trie-based data structure that allows adding and searching for words, including support for wildcard characters represented by dots ('.')."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n",
-      "True\n",
-      "True\n",
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "\n",
-    "wordDictionary = WordDictionary()\n",
-    "wordDictionary.addWord(\"bad\")\n",
-    "wordDictionary.addWord(\"dad\")\n",
-    "wordDictionary.addWord(\"mad\")\n",
-    "print(wordDictionary.search(\"pad\"))  # Output: False\n",
-    "print(wordDictionary.search(\"bad\"))  # Output: True\n",
-    "print(wordDictionary.search(\".ad\"))  # Output: True\n",
-    "print(wordDictionary.search(\"b..\"))  # Output: True"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `WordDictionary` class methods:\n",
-    "\n",
-    "1. `addWord` Method:\n",
-    "\n",
-    "   - Time Complexity: O(L)\n",
-    "     - L is the length of the word being added.\n",
-    "     - In the worst case, we need to iterate through each character in the word and create nodes in the Trie. This takes O(L) time.\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for storing the word in the Trie is also O(L) because we create nodes for each character in the word.\n",
-    "\n",
-    "2. `search_helper` Method (called by `search`):\n",
-    "\n",
-    "   - Time Complexity: O(2^M * L)\n",
-    "     - M is the maximum number of dots ('.') in the search word.\n",
-    "     - In the worst case, when there are M dots in the search word, we may explore all possible child nodes at each dot. This results in a branching factor of 26 (for lowercase letters) at each dot.\n",
-    "     - So, the time complexity is exponential in the number of dots and linear in the length of the word being searched (L).\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for the recursive call stack is O(L) in the worst case because we may have to recurse to a depth equal to the length of the search word.\n",
-    "\n",
-    "3. `search` Method:\n",
-    "\n",
-    "   - Time Complexity: O(2^M * L)\n",
-    "     - The `search` method calls the `search_helper` method, which has the same time complexity explained above.\n",
-    "\n",
-    "   - Space Complexity: O(L)\n",
-    "     - The space complexity for the recursive call stack is O(L) in the worst case, as explained earlier.\n",
-    "\n",
-    "Overall, the time complexity of the `search` method is mainly affected by the number of dots ('.') in the search word. In the worst case, when there are multiple dots and many possibilities to explore at each dot, the time complexity can be exponential. However, for most practical cases, it performs reasonably well.\n",
-    "\n",
-    "The space complexity primarily depends on the space required to store the words in the Trie. It is proportional to the total number of characters in all added words and is linear with respect to the length of the words added.\n",
-    "\n",
-    "In summary:\n",
-    "\n",
-    "- Time Complexity for `addWord`: O(L)\n",
-    "- Time Complexity for `search`: O(2^M * L)\n",
-    "- Space Complexity: O(L) for storing words in the Trie, O(L) for the recursive call stack during search.\n",
-    "\n",
-    "Note: The space complexity analysis assumes that the dictionary contains a reasonable number of words and does not account for the overhead of Python objects or system-level memory allocation."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Dictionary Auto-Completion**: Extend the `WordDictionary` class to provide auto-completion suggestions based on the prefix of a word. Implement a method that returns a list of words that match the given prefix.\n",
-    "\n",
-    "2. **Support Word Deletion**: Extend the `WordDictionary` class to support word deletion. Add a method `deleteWord(word)` that removes a word from the data structure. Ensure that the search operation still works correctly after deletion."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb b/docs/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb
deleted file mode 100644
index e582b9d..0000000
--- a/docs/_build/jupyter_execute/08. Tries/212. Word Search II.ipynb	
+++ /dev/null
@@ -1,310 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 212. Word Search II\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Word Search II problem on LeetCode, click here!](https://leetcode.com/problems/word-search-ii/)\n",
-    "\n",
-    "---\n",
-    "Given an `m x n` `board` of characters and a list of strings `words`, the task is to return *all words on the board*.\n",
-    "\n",
-    "Each word must be constructed from letters of sequentially **adjacent cells**, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == board.length`\n",
-    "- `n == board[i].length`\n",
-    "- `1 <= m, n <= 12`\n",
-    "- `board[i][j]` is a lowercase English letter.\n",
-    "- 1 <= `words.length` <= $3 * 10^4$\n",
-    "- `1 <= words[i].length <= 10`\n",
-    "- `words[i]` consists of lowercase English letters.\n",
-    "- All the strings of `words` are unique."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "To solve the \"Word Search II\" problem, you can use a Trie data structure and perform a depth-first search (DFS) on the board. Here's a step-by-step approach to solve the problem:\n",
-    "\n",
-    "1. Build a Trie from the given list of words:\n",
-    "   - Create a Trie data structure to store all the words from the input list.\n",
-    "   - For each word in the input list, insert it into the Trie, character by character. Make sure to mark the end of each word in the Trie.\n",
-    "\n",
-    "2. Perform DFS on the board:\n",
-    "   - Iterate through each cell (i, j) on the board.\n",
-    "   - For each cell, start a DFS traversal from that cell to search for words.\n",
-    "   - During the DFS traversal, maintain a current path string.\n",
-    "   - At each cell, check if the current path string, concatenated with the character in the cell, matches any word prefix in the Trie. If it does, continue the DFS.\n",
-    "   - If the current path string matches a word in the Trie, add it to the result.\n",
-    "\n",
-    "3. Implement DFS with backtracking:\n",
-    "   - During the DFS traversal, you will explore neighboring cells (horizontally and vertically) if they are within bounds and haven't been visited before.\n",
-    "   - To prevent revisiting the same cell within the same word, mark the cell as visited (e.g., change its character to a special character like '#') before exploring it and restore its original character after the DFS traversal.\n",
-    "\n",
-    "4. Return the result:\n",
-    "   - After completing the DFS traversal for all cells on the board, you will have collected all the valid words in the result set.\n",
-    "   - Convert the result set to a list and return it as the final output.\n",
-    "\n",
-    "This approach efficiently finds all words on the board by utilizing the Trie data structure to prune unnecessary DFS paths and avoiding duplicate visits to the same cell within the same word. It ensures that each word is constructed from letters of sequentially adjacent cells without using the same letter cell more than once in a word.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Define a TrieNode class to represent nodes in the Trie.\n",
-    "class TrieNode:\n",
-    "    def __init__(self):\n",
-    "        self.children = {}  # Dictionary to store child nodes.\n",
-    "        self.is_end_of_word = False  # Flag to mark the end of a word.\n",
-    "\n",
-    "# Main function to find words on the board.\n",
-    "def findWords(board, words):\n",
-    "    # DFS function to search for words starting from a given cell.\n",
-    "    def dfs(node, i, j, path):\n",
-    "        char = board[i][j]  # Get the character at the current cell.\n",
-    "        curr_node = node.children.get(char)  # Find the corresponding Trie node.\n",
-    "\n",
-    "        if not curr_node:\n",
-    "            return  # If no matching Trie node, stop the search.\n",
-    "\n",
-    "        path += char  # Add the character to the current path.\n",
-    "\n",
-    "        if curr_node.is_end_of_word:\n",
-    "            result.add(path)  # If the path matches a word, add it to the result.\n",
-    "\n",
-    "        temp, board[i][j] = board[i][j], \"#\"  # Mark the cell as visited.\n",
-    "\n",
-    "        # Explore neighboring cells (up, down, left, right).\n",
-    "        if i > 0:\n",
-    "            dfs(curr_node, i - 1, j, path)\n",
-    "        if i < m - 1:\n",
-    "            dfs(curr_node, i + 1, j, path)\n",
-    "        if j > 0:\n",
-    "            dfs(curr_node, i, j - 1, path)\n",
-    "        if j < n - 1:\n",
-    "            dfs(curr_node, i, j + 1, path)\n",
-    "\n",
-    "        board[i][j] = temp  # Restore the cell's original character.\n",
-    "\n",
-    "    # Function to build a Trie from the list of words.\n",
-    "    def buildTrie():\n",
-    "        root = TrieNode()  # Create a root node.\n",
-    "        for word in words:\n",
-    "            node = root\n",
-    "            for char in word:\n",
-    "                if char not in node.children:\n",
-    "                    node.children[char] = TrieNode()  # Create a new node if needed.\n",
-    "                node = node.children[char]\n",
-    "            node.is_end_of_word = True  # Mark the end of the word.\n",
-    "        return root\n",
-    "\n",
-    "    m, n = len(board), len(board[0])  # Get the dimensions of the board.\n",
-    "    root = buildTrie()  # Build the Trie from the list of words.\n",
-    "    result = set()  # Use a set to store unique words found on the board.\n",
-    "\n",
-    "    # Iterate through each cell on the board and start DFS from there.\n",
-    "    for i in range(m):\n",
-    "        for j in range(n):\n",
-    "            dfs(root, i, j, \"\")  # Start DFS from each cell on the board.\n",
-    "\n",
-    "    return list(result)  # Convert the set to a list and return the result."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code solves the \"Word Search II\" problem, where you have a grid of characters and a list of words. The goal is to find all words from the list that can be constructed by traversing adjacent cells (horizontally or vertically) in the grid, without using the same cell more than once for a single word.\n",
-    "\n",
-    "The code does the following:\n",
-    "\n",
-    "1. Defines a `TrieNode` class to represent nodes in a Trie data structure. Each node has children (other characters in the word) and a flag to mark the end of a word.\n",
-    "\n",
-    "2. Defines the `findWords` function, which takes the grid (`board`) and a list of words (`words`) as input.\n",
-    "\n",
-    "3. Inside the `findWords` function, there is a `dfs` (depth-first search) function. This function is used to explore the grid starting from a specific cell. It checks if the current path matches any word in the Trie and adds it to the result if found.\n",
-    "\n",
-    "4. The code also includes a `buildTrie` function that constructs a Trie data structure from the list of words. It iterates through each word, creating nodes for each character in the Trie and marking the end of words.\n",
-    "\n",
-    "5. The dimensions of the grid are obtained (m x n).\n",
-    "\n",
-    "6. A Trie is built using the `buildTrie` function.\n",
-    "\n",
-    "7. A set called `result` is used to store unique words found in the grid.\n",
-    "\n",
-    "8. The code iterates through each cell on the grid (using nested loops) and starts a DFS search from each cell.\n",
-    "\n",
-    "9. During the DFS, it explores neighboring cells (up, down, left, right) if they haven't been visited before and if the current path matches a prefix in the Trie.\n",
-    "\n",
-    "10. When a word is found during the DFS traversal, it is added to the `result` set.\n",
-    "\n",
-    "11. The grid cell is marked as visited during the DFS by changing its character to \"#\", and it is restored to its original character after the DFS traversal.\n",
-    "\n",
-    "12. Finally, the set of unique words found is converted to a list and returned as the output.\n",
-    "\n",
-    "The code effectively uses a Trie data structure to optimize the search and ensures that each word is constructed from adjacent cells without reusing the same cell for the same word."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "['eat', 'oath']\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "board1 = [[\"o\",\"a\",\"a\",\"n\"],[\"e\",\"t\",\"a\",\"e\"],[\"i\",\"h\",\"k\",\"r\"],[\"i\",\"f\",\"l\",\"v\"]]\n",
-    "words1 = [\"oath\",\"pea\",\"eat\",\"rain\"]\n",
-    "print(findWords(board1, words1))  # Output: [\"eat\", \"oath\"]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "c748b879-a2d8-4298-a42c-c7f61f9c7fc6",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "\n",
-    "board2 = [[\"a\",\"b\"],[\"c\",\"d\"]]\n",
-    "words2 = [\"abcb\"]\n",
-    "print(findWords(board2, words2))  # Output: []"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. **Building the Trie (`buildTrie` function):** \n",
-    "   - Suppose there are `N` words in the input list, and the average length of a word is `L`.\n",
-    "   - Building the Trie takes O(N * L) time, as we iterate through each word and insert each character into the Trie.\n",
-    "\n",
-    "2. **DFS Traversal (`dfs` function):** \n",
-    "   - In the worst case, the DFS function explores all possible paths in the grid.\n",
-    "   - The maximum number of recursive calls for each cell is 4 (up, down, left, right).\n",
-    "   - The maximum depth of the DFS is limited by the length of the longest word in the Trie, which is at most `L`.\n",
-    "   - Therefore, the DFS traversal for each cell takes $O(4^L)$ time.\n",
-    "\n",
-    "3. **Iterating Through the Grid (`findWords` function):**\n",
-    "   - In the worst case, we iterate through all `m` rows and `n` columns in the grid.\n",
-    "   - For each cell, we start a DFS traversal.\n",
-    "   - Therefore, iterating through the entire grid takes $O(m * n * 4^L)$ time.\n",
-    "\n",
-    "Overall, the time complexity of the code is $O(N * L + m * n * 4^L)$.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. **Trie Data Structure:**\n",
-    "   - The space required to store the Trie depends on the number of unique characters in all the words.\n",
-    "   - In the worst case, where all words are unique and have no common prefixes, the space complexity of the Trie is O(N * L).\n",
-    "   - In practice, it may be less if there are common prefixes among words.\n",
-    "\n",
-    "2. **DFS Stack (Recursive Calls):**\n",
-    "   - The depth of the recursive call stack during DFS is at most `L`, where `L` is the length of the longest word in the Trie.\n",
-    "   - Therefore, the space complexity for the recursive call stack is O(L).\n",
-    "\n",
-    "3. **Result Set (`result` set):**\n",
-    "   - The space used to store the result set depends on the number of valid words found in the grid.\n",
-    "   - In the worst case, when all words are found, the space complexity of the result set is O(N * L).\n",
-    "\n",
-    "Overall, the space complexity of the code is O(N * L) for the Trie and O(L) for the recursive call stack.\n",
-    "\n",
-    "In summary, the time complexity is dominated by the DFS traversal and is influenced by the number of words, their lengths, and the size of the grid. The space complexity is mainly determined by the Trie structure and the recursive call stack depth during DFS."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Word Search Paths:**\n",
-    "   Extend the basic word search exercise to find all possible paths (sequences of cells) that spell out a given word on the board. Return a list of paths if the word can be formed, otherwise an empty list.\n",
-    "\n",
-    "\n",
-    "2. **Reverse Word Search:**\n",
-    "   Modify the code to search for words in reverse order on the board. Given a 2D grid of characters and a list of words, find all words from the list that can be formed by traversing the board in reverse (right to left, bottom to top, etc.)."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb b/docs/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb
deleted file mode 100644
index f82ad98..0000000
--- a/docs/_build/jupyter_execute/09. Heap - Priority Queue/1046. Last Stone Weight.ipynb	
+++ /dev/null
@@ -1,248 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 1046. Last Stone Weight\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Last Stone Weight problem on LeetCode, click here!](https://leetcode.com/problems/last-stone-weight/)\n",
-    "\n",
-    "---\n",
-    "You are given an array of integers `stones` where `stones[i]` is the weight of the `i`th stone.\n",
-    "\n",
-    "We are playing a game with the stones. On each turn, you choose the **heaviest two stones** and smash them together. Suppose the heaviest two stones have weights `x` and `y` with `x <= y`. The result of this smash is:\n",
-    "\n",
-    "1. If `x == y`, both stones are destroyed.\n",
-    "2. If `x != y`, the stone of weight `x` is destroyed, and the stone of weight `y` has new weight `y - x`.\n",
-    "\n",
-    "At the end of the game, there is **at most one** stone left.\n",
-    "\n",
-    "Return *the weight of the last remaining stone*. If there are no stones left, return `0`.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= stones.length <= 30`\n",
-    "- `1 <= stones[i] <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The \"Last Stone Weight\" problem involves a game played with a collection of stones, each stone having a certain weight. The goal is to find the weight of the last remaining stone after applying a specific set of rules.\n",
-    "\n",
-    "Here's how the game works:\n",
-    "\n",
-    "1. You start with an array of stones, where each stone is represented by its weight. The weights of the stones are given in the input as an array.\n",
-    "\n",
-    "2. In each turn of the game, you select the two heaviest stones from the remaining stones. If there is only one stone left, you've found the answer.\n",
-    "\n",
-    "3. If there are two stones with weights `x` and `y`, where `x` is less than or equal to `y`, the following happens:\n",
-    "   - If `x` is equal to `y`, both stones are completely destroyed, and they are removed from the array of stones.\n",
-    "   - If `x` is not equal to `y`, the stone with weight `x` is destroyed, and the stone with weight `y` now has a new weight of `y - x`. The stone with weight `x` is removed from the array, and the modified stone with weight `y - x` remains in the array.\n",
-    "\n",
-    "4. The game continues with the modified array of stones until there is at most one stone left.\n",
-    "\n",
-    "5. The goal is to find the weight of the last remaining stone, or if there are no stones left, return `0`.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "\n",
-    "def lastStoneWeight(stones):\n",
-    "    # Convert the input list to a max heap (negate the values to simulate a max heap)\n",
-    "    max_heap = [-stone for stone in stones]\n",
-    "    heapq.heapify(max_heap)\n",
-    "\n",
-    "    # Continue as long as there are more than 1 stone in the heap\n",
-    "    while len(max_heap) > 1:\n",
-    "        # Get the two heaviest stones\n",
-    "        y = -heapq.heappop(max_heap)  # Get the heaviest stone and negate it back to positive\n",
-    "        x = -heapq.heappop(max_heap)  # Get the second heaviest stone and negate it back to positive\n",
-    "\n",
-    "        # Calculate the new stone's weight after smashing\n",
-    "        if x != y:\n",
-    "            new_stone = y - x\n",
-    "            heapq.heappush(max_heap, -new_stone)  # Negate the value and push it back to the heap\n",
-    "\n",
-    "    # If there is one stone left, return its weight (negate it back to positive)\n",
-    "    if max_heap:\n",
-    "        return -max_heap[0]\n",
-    "    else:\n",
-    "        return 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a Python function called `lastStoneWeight` that takes a list of stone weights as input. It aims to find the weight of the last remaining stone after playing the stone smashing game described in the problem statement.\n",
-    "\n",
-    "Here's a step-by-step explanation of the code:\n",
-    "\n",
-    "1. We import the `heapq` library, which allows us to create and manipulate a heap (priority queue).\n",
-    "\n",
-    "2. Inside the `lastStoneWeight` function:\n",
-    "   - We create a max heap (negating stone weights to simulate a max heap) using the `heapq.heapify` function. This heap will keep track of the heaviest stones.\n",
-    "   \n",
-    "   - We enter a loop that continues as long as there are more than 1 stone in the heap.\n",
-    "   \n",
-    "   - Inside the loop, we:\n",
-    "     - Retrieve and negate the heaviest stone (`y`) from the heap.\n",
-    "     - Retrieve and negate the second heaviest stone (`x`) from the heap.\n",
-    "   \n",
-    "     - Calculate the new stone's weight after smashing (`y - x`), and negate it back to simulate a max heap.\n",
-    "     - Add the new stone back to the heap using `heapq.heappush`.\n",
-    "   \n",
-    "3. After the loop, if there is one stone left in the heap, we retrieve and negate it to get its actual weight, and return it as the result.\n",
-    "   \n",
-    "4. If there are no stones left (the heap is empty), we return `0`, indicating that no stones remain.\n",
-    "\n",
-    "5. Finally, we provide two test cases to demonstrate the function's usage and correctness.\n",
-    "\n",
-    "In summary, the code efficiently implements the stone smashing game by maintaining a max heap, selecting the heaviest stones in each turn, smashing them, and updating the heap until there is at most one stone left. It then returns the weight of the last remaining stone or 0 if there are no stones left."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "stones1 = [2, 7, 4, 1, 8, 1]\n",
-    "print(lastStoneWeight(stones1))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "b7e79514-4821-48d0-bb9d-0f2de8150945",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2: \n",
-    "\n",
-    "stones2 = [1]\n",
-    "print(lastStoneWeight(stones2))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided Python code for the \"Last Stone Weight\" problem:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. The `heapq.heapify` operation to create the max heap from the input stone weights has a time complexity of O(n), where n is the number of stones.\n",
-    "\n",
-    "2. The loop that continues until there are more than 1 stone in the heap performs the following operations in each iteration:\n",
-    "   - Retrieving and negating the heaviest stone (`y`) from the heap, which takes O(log n) time.\n",
-    "   - Retrieving and negating the second heaviest stone (`x`) from the heap, also taking O(log n) time.\n",
-    "   - Calculating the new stone's weight and pushing it back into the heap using `heapq.heappush`, which takes O(log n) time.\n",
-    "\n",
-    "3. In the worst case, the loop runs until there is only one stone left, which requires approximately (n-1) iterations.\n",
-    "\n",
-    "Overall, the dominant time complexity is O(n) for the initial heap creation, and within the loop, each iteration takes O(log n) time. Therefore, the overall time complexity of the algorithm is O(n log n).\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The space complexity is primarily determined by the space required for the max heap. In the worst case, this heap can contain all the stones, so the space complexity for the heap is O(n).\n",
-    "\n",
-    "2. The rest of the variables used in the function (e.g., `x`, `y`, `new_stone`) require only constant space, so they do not significantly contribute to the space complexity.\n",
-    "\n",
-    "Therefore, the overall space complexity of the algorithm is O(n) due to the space used for the max heap.\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: $O(n\\ log\\ n)$\n",
-    "- Space Complexity: $O(n)$\n",
-    "\n",
-    "The algorithm is efficient enough to handle the problem's constraints, as the worst-case time and space complexities are both linearithmic in terms of the number of stones."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Kth Last Stone Weight**: Modify the problem to find the weight of the Kth last remaining stone, where K is an integer input. Your function should work efficiently for large values of K.\n",
-    "\n",
-    "\n",
-    "2. **Multiple Stones Smash**: Modify the problem so that instead of smashing two stones at a time, you can smash up to K stones at each turn, where K is an integer input. Determine the weight of the last remaining stone in this variation."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb b/docs/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb
deleted file mode 100644
index 6c43a8d..0000000
--- a/docs/_build/jupyter_execute/09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb	
+++ /dev/null
@@ -1,238 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 295. Find Median from Data Stream\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Find Median from Data Stream problem on LeetCode, click here!](https://leetcode.com/problems/find-median-from-data-stream/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "The **median** is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.\n",
-    "\n",
-    "Implement the MedianFinder class:\n",
-    "\n",
-    "- `MedianFinder()` initializes the `MedianFinder` object.\n",
-    "- `void addNum(int num)` adds the integer `num` from the data stream to the data structure.\n",
-    "- `double findMedian()` returns the median of all elements so far. Answers within $10^{-5}$ of the actual answer will be accepted.\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- $-10^{5}$ <= `num` <= $10^{5}$\n",
-    "- There will be at least one element in the data structure before calling `findMedian`.\n",
-    "- At most $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-    "\n",
-    "**Follow-up:**\n",
-    "\n",
-    "1. If all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?\n",
-    "2. If `99%` of all integer numbers from the stream are in the range `[0, 100]`, how would you optimize your solution?"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem, \"Find Median from Data Stream,\" deals with efficiently computing the median of a sequence of numbers as they are incrementally provided. The median is the middle value in an ordered list of numbers. When the list has an even number of elements, the median is the average of the two middle values.\n",
-    "\n",
-    "Here's a breakdown of the problem:\n",
-    "\n",
-    "1. **Initialization**: You are asked to implement a `MedianFinder` class that supports the following operations:\n",
-    "\n",
-    "    - `MedianFinder()`: Initializes the MedianFinder object.\n",
-    "    - `addNum(int num)`: Adds an integer `num` from the data stream to the data structure.\n",
-    "    - `findMedian()`: Returns the median of all elements added to the data structure.\n",
-    "\n",
-    "2. **Median Calculation**: The `findMedian` operation should efficiently compute the median, and the result should have a precision of at least $10^{-5}$ (i.e., answers within this range will be considered correct).\n",
-    "\n",
-    "3. **Examples**:\n",
-    "   \n",
-    "   - If you add numbers [1, 2], the median should be 1.5 because (1 + 2) / 2 = 1.5.\n",
-    "   - If you add numbers [1, 2, 3], the median should be 2 because it's the middle value.\n",
-    "   \n",
-    "4. **Constraints**:\n",
-    "\n",
-    "   - The integers provided in the data stream are in the range from $-10^5$ to $10^5$.\n",
-    "   - There will be at least one element in the data structure before calling `findMedian`.\n",
-    "   - At most, $5 * 10^4$ calls will be made to `addNum` and `findMedian`.\n",
-    "\n",
-    "The problem can be solved by using two priority queues (heaps): one max-heap to store the smaller half of the numbers and one min-heap to store the larger half of the numbers. The max-heap ensures that the largest number in the smaller half is at the top, and the min-heap ensures that the smallest number in the larger half is at the top. These heaps are balanced to efficiently find the median when requested.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "\n",
-    "class MedianFinder:\n",
-    "\n",
-    "    def __init__(self):\n",
-    "        # Initialize two heaps: a max-heap (small_half) for the smaller half of numbers,\n",
-    "        # and a min-heap (large_half) for the larger half of numbers.\n",
-    "        self.small_half = []  # Max-heap for the smaller half of the numbers\n",
-    "        self.large_half = []  # Min-heap for the larger half of the numbers\n",
-    "\n",
-    "    def addNum(self, num: int) -> None:\n",
-    "        # Add the number to the appropriate heap based on its value\n",
-    "        if not self.small_half or num <= -self.small_half[0]:\n",
-    "            # If the number is less than or equal to the current maximum in the smaller half,\n",
-    "            # add it to the smaller half (max-heap)\n",
-    "            heapq.heappush(self.small_half, -num)\n",
-    "        else:\n",
-    "            # Otherwise, add it to the larger half (min-heap)\n",
-    "            heapq.heappush(self.large_half, num)\n",
-    "\n",
-    "        # Balance the heaps if necessary to ensure the size difference is at most 1\n",
-    "        if len(self.small_half) > len(self.large_half) + 1:\n",
-    "            # If the size of the smaller half is more than one greater than the size of the larger half,\n",
-    "            # move the maximum from the smaller half to the larger half to balance them.\n",
-    "            heapq.heappush(self.large_half, -heapq.heappop(self.small_half))\n",
-    "        elif len(self.large_half) > len(self.small_half):\n",
-    "            # If the size of the larger half is greater than the size of the smaller half,\n",
-    "            # move the minimum from the larger half to the smaller half to balance them.\n",
-    "            heapq.heappush(self.small_half, -heapq.heappop(self.large_half))\n",
-    "\n",
-    "    def findMedian(self) -> float:\n",
-    "        if len(self.small_half) == len(self.large_half):\n",
-    "            # If both halves have the same size, there's an even number of elements,\n",
-    "            # so the median is the average of the top elements in both heaps.\n",
-    "            return (-self.small_half[0] + self.large_half[0]) / 2.0\n",
-    "        else:\n",
-    "            # If the smaller half has more elements, it contains the median (odd number of elements).\n",
-    "            return -self.small_half[0]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a `MedianFinder` class for efficiently finding the median of a stream of numbers. It uses two heaps: a max-heap (`small_half`) to store the smaller half of the numbers and a min-heap (`large_half`) to store the larger half. Here's how the code works:\n",
-    "\n",
-    "1. The `__init__` method initializes the two heaps.\n",
-    "\n",
-    "2. The `addNum` method adds a number to the appropriate heap, ensuring that the heaps remain balanced. It does this by comparing the number to the current maximum in the smaller half and adding it to the appropriate heap. Then, it checks the sizes of the two heaps and rebalances them if necessary.\n",
-    "\n",
-    "3. The `findMedian` method calculates and returns the median. If both halves have the same size (even number of elements), it computes the average of the tops of both heaps. If the smaller half has more elements (odd number of elements), it returns the top of the max-heap, which is the median.\n",
-    "\n",
-    "In summary, this code efficiently maintains two heaps to divide the elements into smaller and larger halves, allowing for quick median retrieval. It offers a time complexity of O(log N) for adding elements and O(1) for finding the median, where N is the total number of elements processed. The space complexity is O(1) as the space used by the two heaps is independent of the input size."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1.5\n",
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "medianFinder = MedianFinder()\n",
-    "medianFinder.addNum(1)\n",
-    "medianFinder.addNum(2)\n",
-    "print(medianFinder.findMedian())  # Output: 1.5\n",
-    "medianFinder.addNum(3)\n",
-    "print(medianFinder.findMedian())  # Output: 2.0\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `MedianFinder` class:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. `MedianFinder()` Initialization: This operation has a time complexity of O(1). It simply initializes the two heaps.\n",
-    "\n",
-    "2. `addNum(int num)`: The time complexity for adding a number is O(log N), where N is the total number of elements processed so far. This is because, in the worst case, you might need to perform logarithmic operations on the heaps to maintain their balance.\n",
-    "\n",
-    "3. `findMedian()`: Finding the median has a time complexity of O(1). It simply involves accessing the tops of the two heaps, which takes constant time.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. `MedianFinder()` Initialization: The space complexity for initialization is O(1). It involves creating two empty heaps, which do not depend on the size of the data stream.\n",
-    "\n",
-    "2. `addNum(int num)`: The space complexity for adding a number is also O(1). It involves adding the number to one of the two heaps, which do not significantly affect the overall space complexity.\n",
-    "\n",
-    "3. `findMedian()`: The space complexity for finding the median is O(1). It doesn't require any additional data structures that grow with the input size.\n",
-    "\n",
-    "In summary, the time complexity of the `addNum` operation is O(log N), and the time complexity of the `findMedian` operation is O(1). The space complexity is O(1) as well, as the space used by the two heaps is independent of the size of the data stream. This solution efficiently maintains and retrieves the median, making it suitable for the given problem constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Generalized kth Element**: Extend the `MedianFinder` class to support finding the kth element in the data stream efficiently. This means finding the kth smallest or kth largest element in the stream.\n",
-    "\n",
-    "2. **Sliding Window Median**: Given an array and a sliding window size, find the median within the window as it slides over the array. This is an extension of the problem to a moving window scenario."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb b/docs/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb
deleted file mode 100644
index e6ab9e3..0000000
--- a/docs/_build/jupyter_execute/09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb	
+++ /dev/null
@@ -1,235 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 703. Kth Largest Element in a Stream\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Kth Largest Element in a Stream problem on LeetCode, click here!](https://leetcode.com/problems/kth-largest-element-in-a-stream/)\n",
-    "\n",
-    "---\n",
-    "Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.\n",
-    "\n",
-    "Implement the `KthLargest` class with the following methods:\n",
-    "\n",
-    "- `KthLargest(int k, int[] nums)`: Initializes the object with the integer `k` and the stream of integers `nums`.\n",
-    "- `int add(int val)`: Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.\n",
-    "\n",
-    "\n",
-    "**Constraints:**\n",
-    "\n",
-    "- 1 <= `k` <= $10^4$\n",
-    "- 0 <= `nums.length` <= $10^4$\n",
-    "- $-10^4$ <= `nums[i]` <= $10^4$\n",
-    "- $-10^4$ <= `val` <= $10^4$\n",
-    "- At most $10^4$ calls will be made to `add`.\n",
-    "- It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem you're trying to solve is to design a class called `KthLargest` that can efficiently find the kth largest element in a stream of integers. You need to support two main operations:\n",
-    "\n",
-    "To solve this problem efficiently, you can use a min-heap data structure. Here's how the approach works:\n",
-    "\n",
-    "1. Initialize a min-heap to store the k largest elements. Initially, it's empty.\n",
-    "\n",
-    "2. In the `__init__` method, populate the min-heap with the first `k` elements from `nums`. This ensures that you have the k largest elements seen so far.\n",
-    "\n",
-    "3. Whenever you add a new element to the stream using the `add` method, follow these steps:\n",
-    "   - Add the new element to the min-heap.\n",
-    "   - If the size of the min-heap exceeds `k`, remove the smallest element from the min-heap. This ensures that you always have the k largest elements in the min-heap.\n",
-    "   - The smallest element in the min-heap (the root) will always represent the kth largest element in the stream.\n",
-    "\n",
-    "Here's why this approach works efficiently:\n",
-    "\n",
-    "- By using a min-heap, you can quickly maintain the k largest elements, and finding the smallest element in the heap (the root) takes constant time.\n",
-    "\n",
-    "- When you add a new element, the min-heap's size is kept at most `k`, which ensures that you only track the k largest elements and discard the smaller ones.\n",
-    "\n",
-    "- The time complexity for adding an element is O(log k), which is very efficient compared to sorting the entire stream, which would be O(n log n).\n",
-    "\n",
-    "- This approach meets the constraints of the problem, including handling large streams and having a low time complexity for both initialization and adding elements.\n",
-    "\n",
-    "In summary, the min-heap approach efficiently tracks the kth largest element in the stream by maintaining a heap of the k largest elements seen so far, updating it as new elements are added. This approach provides a fast and scalable solution to the problem.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "import heapq\n",
-    "from typing import List  # Import the List type from the typing module\n",
-    "\n",
-    "class KthLargest:\n",
-    "\n",
-    "    def __init__(self, k: int, nums: List[int]):\n",
-    "        # Initialize the KthLargest object with k and nums.\n",
-    "        self.k = k\n",
-    "        # Create a min-heap to store the k largest elements.\n",
-    "        self.min_heap = []\n",
-    "        # Populate the min-heap with the first k elements from nums.\n",
-    "        for num in nums:\n",
-    "            self.add(num)\n",
-    "\n",
-    "    def add(self, val: int) -> int:\n",
-    "        # Add val to the min-heap.\n",
-    "        heapq.heappush(self.min_heap, val)\n",
-    "        # If the size of the min-heap exceeds k, remove the smallest element.\n",
-    "        if len(self.min_heap) > self.k:\n",
-    "            heapq.heappop(self.min_heap)\n",
-    "        # The root of the min-heap is the kth largest element.\n",
-    "        return self.min_heap[0]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "- We start by importing the necessary modules:\n",
-    "  - `heapq`: This module provides functions to create and manipulate heaps.\n",
-    "  - `List` from the `typing` module: This is used to specify the type of the `nums` parameter.\n",
-    "\n",
-    "- We define the `KthLargest` class:\n",
-    "  - The `__init__` method initializes the object with the integer `k` and the list of integers `nums`.\n",
-    "  - It also creates an empty min-heap called `self.min_heap` to store the k largest elements.\n",
-    "  - It populates the min-heap with the first `k` elements from `nums` by calling the `add` method.\n",
-    "\n",
-    "- The `add` method:\n",
-    "  - Adds the new integer `val` to the min-heap using `heapq.heappush`. This maintains the min-heap property.\n",
-    "  - Checks if the size of the min-heap exceeds `k`. If it does, it removes the smallest element (the k+1th largest) using `heapq.heappop`.\n",
-    "  - Finally, it returns the smallest element in the min-heap, which is always the kth largest element.\n",
-    "\n",
-    "Overall, this code implements a class that efficiently finds the kth largest element in a stream of integers by maintaining a min-heap of the k largest elements seen so far.\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n",
-      "5\n",
-      "5\n",
-      "8\n",
-      "8\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example usage:\n",
-    "kthLargest = KthLargest(3, [4, 5, 8, 2])\n",
-    "print(kthLargest.add(3))  # Output: 4\n",
-    "print(kthLargest.add(5))  # Output: 5\n",
-    "print(kthLargest.add(10)) # Output: 5\n",
-    "print(kthLargest.add(9))  # Output: 8\n",
-    "print(kthLargest.add(4))  # Output: 8"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `KthLargest` class using the min-heap approach:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. `__init__` method:\n",
-    "   - In the `__init__` method, you iterate over the first `k` elements in `nums` and add them to the min-heap. Each `heapq.heappush` operation takes O(log k) time.\n",
-    "   - Therefore, the time complexity of the `__init__` method is O(k * log k).\n",
-    "\n",
-    "2. `add` method:\n",
-    "   - In the `add` method, you perform the following operations:\n",
-    "     - `heapq.heappush`: O(log k) to add the new element to the min-heap.\n",
-    "     - If the size of the min-heap exceeds `k`, you perform `heapq.heappop`, which is also O(log k).\n",
-    "     - Finally, you return the smallest element from the min-heap, which is O(1) because it's always the root.\n",
-    "   - Overall, the time complexity of the `add` method is O(log k).\n",
-    "\n",
-    "3. Overall, if you make `n` calls to the `add` method, the total time complexity is O(n * log k), where `n` is the total number of elements added to the stream.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The space complexity is determined by the space used to store the min-heap and the instance variables.\n",
-    "2. The min-heap stores at most `k` elements at any given time, so its space complexity is O(k).\n",
-    "3. The instance variables (such as `self.k` and `self.min_heap`) have constant space requirements.\n",
-    "4. Therefore, the overall space complexity of the `KthLargest` class is O(k).\n",
-    "\n",
-    "In summary, the time complexity of the `KthLargest` class is O(n * log k) for `n` add operations, and the space complexity is O(k), where `k` is the parameter passed during initialization. This implementation efficiently maintains the kth largest element in the stream while meeting the problem's constraints."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Dynamic k:** Modify the `KthLargest` class to support dynamic changes in the value of `k`. Implement a method `update_k` that allows changing the value of `k` during the lifetime of the object. Ensure that the object can still correctly find the kth largest element based on the updated value of `k`.\n",
-    "\n",
-    "\n",
-    "2. **Implement kth Smallest:** Create a new class called `KthSmallest` that finds the kth smallest element in a stream instead of the kth largest. You may need to modify the data structure used in the implementation."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb b/docs/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb
deleted file mode 100644
index 85d59ac..0000000
--- a/docs/_build/jupyter_execute/10. Backtracking/39. Combination Sum.ipynb	
+++ /dev/null
@@ -1,274 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 39. Combination Sum\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Combination Sum problem on LeetCode, click here!](https://leetcode.com/problems/combination-sum/)\n",
-    "\n",
-    "---\n",
-    "Given an array of **distinct** integers `candidates` and a target integer `target`, return *a list of all **unique combinations** of `candidates` where the chosen numbers sum to the `target`*. You may return the combinations in **any order**. \n",
-    "\n",
-    "The **same** number may be chosen from `candidates` an **unlimited number** of times. Two combinations are unique if the **frequency** of at least one of the chosen numbers is different.\n",
-    "\n",
-    "The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= candidates.length <= 30`\n",
-    "- `2 <= candidates[i] <= 40`\n",
-    "- All elements of `candidates` are **distinct**.\n",
-    "- `1 <= target <= 40`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to find all unique combinations of numbers from a given array (candidates) such that their sum equals a target number. Here are the details of the problem:\n",
-    "\n",
-    "- You are given an array of distinct integers called \"candidates.\"\n",
-    "- You are also given a target integer called \"target.\"\n",
-    "\n",
-    "The goal is to find all unique combinations of numbers from the candidates array where the sum of the selected numbers is equal to the target. You can use the same number from the candidates array an unlimited number of times. A combination is considered unique if it has a different frequency (i.e., a different number of occurrences) of at least one chosen number compared to other combinations.\n",
-    "\n",
-    "For example:\n",
-    "\n",
-    "**Example 1:**\n",
-    "```python\n",
-    "Input: candidates = [2, 3, 6, 7], target = 7\n",
-    "Output: [[2, 2, 3], [7]]\n",
-    "```\n",
-    "In this example, there are two unique combinations that sum up to the target:\n",
-    "- 2 + 2 + 3 = 7\n",
-    "- 7 = 7\n",
-    "\n",
-    "**Example 2:**\n",
-    "```python\n",
-    "Input: candidates = [2, 3, 5], target = 8\n",
-    "Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n",
-    "```\n",
-    "Here, there are three unique combinations that sum up to the target.\n",
-    "\n",
-    "**Example 3:**\n",
-    "```python\n",
-    "Input: candidates = [2], target = 1\n",
-    "Output: []\n",
-    "```\n",
-    "In this case, there are no combinations that can be formed from the candidates to reach the target of 1, so the output is an empty list.\n",
-    "\n",
-    "The problem asks you to find and return these combinations in any order.\n",
-    "\n",
-    "The constraints for this problem include the length of the candidates array, the values of candidates, and the target value.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def combinationSum(candidates, target):\n",
-    "    # Define a recursive DFS function to find combinations\n",
-    "    def dfs(remaining, start, path):\n",
-    "        # If the remaining target is 0, we found a valid combination\n",
-    "        if remaining == 0:\n",
-    "            result.append(path)\n",
-    "            return\n",
-    "        # If the remaining target is negative, this path is invalid\n",
-    "        if remaining < 0:\n",
-    "            return\n",
-    "        # Iterate through candidates starting from 'start' to avoid duplicates\n",
-    "        for i in range(start, len(candidates)):\n",
-    "            # Explore the current candidate by subtracting it from the remaining target\n",
-    "            # Add the current candidate to the path\n",
-    "            dfs(remaining - candidates[i], i, path + [candidates[i]])\n",
-    "\n",
-    "    result = []  # Initialize an empty list to store the result\n",
-    "    candidates.sort()  # Sort the candidates for deduplication and early stopping\n",
-    "    dfs(target, 0, [])  # Start the DFS from the target value with an empty path\n",
-    "    return result  # Return the list of unique combinations"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `combinationSum` function takes an array of distinct integers `candidates` and a target integer `target`. It returns a list of all unique combinations of `candidates` where the chosen numbers sum to the `target`. Each number in the `candidates` array can be used an unlimited number of times.\n",
-    "\n",
-    "Here's an overview of how the code works:\n",
-    "\n",
-    "1. The `combinationSum` function is defined, and it takes two arguments: `candidates` and `target`.\n",
-    "\n",
-    "2. Inside the function, there is a nested helper function called `backtrack`. This function is responsible for the actual combination generation using a recursive approach.\n",
-    "\n",
-    "3. The `backtrack` function is called with three arguments: `start`, `target`, and `path`. The `start` variable helps keep track of the current index in the `candidates` array, `target` keeps track of the remaining sum to be achieved, and `path` is a list that stores the current combination.\n",
-    "\n",
-    "4. Within the `backtrack` function, there are three main conditional statements:\n",
-    "   - If `target` becomes zero, it means we have found a combination that sums up to the target, so we add `path` to the `result` list.\n",
-    "   - If `target` becomes negative, it means the current combination doesn't work, so we return without doing anything.\n",
-    "   - Otherwise, we enter a loop that iterates over the `candidates` array, starting from the current index `start`.\n",
-    "\n",
-    "5. In the loop, the `backtrack` function is called recursively with the updated `target` and `path` after including the current candidate. This process explores different combinations by considering the current candidate or moving to the next candidate.\n",
-    "\n",
-    "6. After the loop completes, the `result` list contains all unique combinations that sum to the target.\n",
-    "\n",
-    "7. The `candidates` array is sorted to optimize the search. Sorting helps in avoiding unnecessary recursive branches and reduces the number of explored combinations.\n",
-    "\n",
-    "8. Finally, the `backtrack` function is initially called from the `combinationSum` function with `start` set to 0, `target` set to the original target value, and an empty `path`. The result is returned as a list of unique combinations.\n",
-    "\n",
-    "The code includes a few example cases to demonstrate how the function works with different inputs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[2, 2, 3], [7]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Example 1\n",
-    "candidates1 = [2, 3, 6, 7]\n",
-    "target1 = 7\n",
-    "print(combinationSum(candidates1, target1))  # Output: [[2, 2, 3], [7]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[2, 2, 2, 2], [2, 3, 3], [3, 5]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "candidates2 = [2, 3, 5]\n",
-    "target2 = 8\n",
-    "print(combinationSum(candidates2, target2))  # Output: [[2, 2, 2, 2], [2, 3, 3], [3, 5]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "candidates3 = [2]\n",
-    "target3 = 1\n",
-    "print(combinationSum(candidates3, target3))  # Output: []"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `combinationSum` function.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "The time complexity of this function is influenced by the number of recursive calls made by the `backtrack` function and the amount of work done within each call. In the worst case, the function will explore all possible combinations.\n",
-    "\n",
-    "The worst-case scenario occurs when we have many combinations to reach the target. The time complexity can be expressed as $O(2^n)$, where 'n' is the maximum number of recursive calls. In this context, 'n' corresponds to the number of elements in the `candidates` list, and it may be up to 30 (as per the constraints). However, the actual number of combinations explored is generally much smaller because we eliminate branches when the target becomes negative, and we skip over candidates that cannot lead to a solution. The sorting step also helps to optimize the search.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "The space complexity is determined by the auxiliary space used for storing the results and the stack space for the recursive calls.\n",
-    "\n",
-    "1. The space required for the `result` list can be up to $O(2^n)$ in the worst case because each combination is stored.\n",
-    "\n",
-    "2. The stack space for the recursive calls can also be up to O(n) in the worst case, where 'n' is the number of elements in the `candidates` list.\n",
-    "\n",
-    "Therefore, the overall space complexity of the function is $O(2^n + n)$. However, in practice, the space used for the results list is often the dominant factor, and the actual space used may be much smaller than 2^n because not all combinations are explored.\n",
-    "\n",
-    "In summary, the time complexity is exponential but typically smaller in practice due to optimization, and the space complexity is influenced by the number of results and the depth of the recursion."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Find the Number of Unique Combinations:** Instead of listing all unique combinations, modify the function to return the count of unique combinations that sum to the target.\n",
-    "\n",
-    "2. **Combinations with a Maximum Value:** Add a maximum value constraint for each combination, so they cannot exceed a certain value. Modify the code to find combinations respecting this constraint."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb b/docs/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb
deleted file mode 100644
index 8d97d20..0000000
--- a/docs/_build/jupyter_execute/10. Backtracking/79. Word Search.ipynb	
+++ /dev/null
@@ -1,290 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 79. Word Search\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Word Search problem on LeetCode, click here!](https://leetcode.com/problems/word-search/)\n",
-    "\n",
-    "---\n",
-    "Given an `m x n` grid of characters `board` and a string `word`, return *`true` if `word` exists in the grid.*\n",
-    "\n",
-    "The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == board.length`\n",
-    "- `n = board[i].length`\n",
-    "- `1 <= m, n <= 6`\n",
-    "- `1 <= word.length <= 15`\n",
-    "- `board` and `word` consists of only lowercase and uppercase English letters.\n",
-    "\n",
-    "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether a given word can be constructed from characters in an `m x n` grid of characters. The word can be formed by moving sequentially through horizontally or vertically neighboring cells in the grid, and you cannot use the same cell more than once.\n",
-    "\n",
-    "Here are the specifics of the problem:\n",
-    "\n",
-    "- You are given an `m x n` grid, which is a 2D board of characters.\n",
-    "- You are also given a string `word` consisting of lowercase and uppercase English letters.\n",
-    "- Your task is to determine if the word can be found in the grid by moving from one cell to an adjacent cell (horizontally or vertically) and collecting the characters sequentially to form the word.\n",
-    "- You can't use the same cell more than once when forming the word.\n",
-    "- If it's possible to form the word in the grid, return `True`; otherwise, return `False`.\n",
-    "\n",
-    "For example, consider the following grid and word:\n",
-    "\n",
-    "```python\n",
-    "board = [[\"A\", \"B\", \"C\", \"E\"],\n",
-    "         [\"S\", \"F\", \"C\", \"S\"],\n",
-    "         [\"A\", \"D\", \"E\", \"E\"]]         \n",
-    "word = \"ABCCED\"\n",
-    "```\n",
-    "\n",
-    "In this case, the word \"ABCCED\" can be formed by moving through the cells (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,3) in the grid. Therefore, the function should return `True`.\n",
-    "\n",
-    "Conversely, if the word is impossible to construct, such as in the case of the word \"ABCB\" for the same grid, where there's no valid path that forms the word, the function should return `False`.\n",
-    "\n",
-    "The problem involves searching for a path through the grid that matches the characters in the word while respecting the constraints mentioned. It can be solved using depth-first search (DFS) or backtracking.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def exist(self, board: List[List[str]], word: str) -> bool:\n",
-    "        def dfs(i, j, k):\n",
-    "            # Check if the current position is out of bounds or doesn't match the character in the word.\n",
-    "            if not (0 <= i < len(board)) or not (0 <= j < len(board[0])) or board[i][j] != word[k]:\n",
-    "                return False\n",
-    "            \n",
-    "            # If we have matched all characters in the word, return True.\n",
-    "            if k == len(word) - 1:\n",
-    "                return True\n",
-    "\n",
-    "            # Temporarily mark the current cell to prevent revisiting.\n",
-    "            tmp, board[i][j] = board[i][j], \"/\"\n",
-    "\n",
-    "            # Explore adjacent cells by making recursive calls in all four directions.\n",
-    "            found = dfs(i + 1, j, k + 1) or dfs(i - 1, j, k + 1) or dfs(i, j + 1, k + 1) or dfs(i, j - 1, k + 1)\n",
-    "\n",
-    "            # Restore the original character in the cell.\n",
-    "            board[i][j] = tmp\n",
-    "\n",
-    "            return found\n",
-    "\n",
-    "        # Iterate through all cells in the board.\n",
-    "        for i in range(len(board)):\n",
-    "            for j in range(len(board[0])):\n",
-    "                # Check if the 'dfs' function starting from this cell returns True.\n",
-    "                if dfs(i, j, 0):\n",
-    "                    return True\n",
-    "\n",
-    "        # If no match is found after exploring all cells, return False.\n",
-    "        return False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "1. Import the necessary module:\n",
-    "   - `from typing import List`: This line imports the `List` type from the `typing` module, which is used to specify the type of the `board` parameter in the method signature.\n",
-    "\n",
-    "2. Define the `Solution` class:\n",
-    "   - `class Solution:`: This line defines a class called `Solution` to encapsulate the solution for the word search problem.\n",
-    "\n",
-    "3. Define the `exist` method:\n",
-    "   - `def exist(self, board: List[List[str]], word: str) -> bool:`: This method is a member of the `Solution` class and takes two parameters: `board`, which is a 2D list of characters, and `word`, which is a string. It returns a boolean value, indicating whether the word exists in the board.\n",
-    "\n",
-    "4. Implement the inner `dfs` function:\n",
-    "   - `def dfs(i, j, k):`: This is a helper function used for depth-first search (DFS). It is called recursively to explore the board and search for the word. It takes three parameters: `i` and `j` representing the current position on the board, and `k` representing the current index in the `word` string.\n",
-    "\n",
-    "   - Inside `dfs`, it checks if the current position is out of bounds or if the character at the current position on the board does not match the character at the current index in the `word`. If either of these conditions is met, it returns `False`.\n",
-    "\n",
-    "   - If `k` is equal to the length of the `word` minus one, it means we have successfully matched all characters in the `word`, so it returns `True`.\n",
-    "\n",
-    "   - The function then temporarily replaces the character at the current position with a marker, \"/\", to prevent revisiting the same cell. It then explores adjacent cells by making recursive calls in all four directions: up, down, left, and right. If any of these recursive calls return `True`, it propagates the `True` result up the call stack. After the exploration is complete, it restores the original character in the cell.\n",
-    "\n",
-    "5. Iterate through the board:\n",
-    "   - The outer loop iterates through all cells in the `board` using two nested loops. For each cell, it checks if the `dfs` function starting from that cell (with `k` initially set to 0) returns `True`. If it does, it means the word exists, so the method returns `True`.\n",
-    "\n",
-    "6. Return `False`:\n",
-    "   - If the loop completes without finding the word in the board, the method returns `False`.\n",
-    "\n",
-    "To use this code, you can create an instance of the `Solution` class and call the `exist` method on that instance, passing the `board` and the `word` as arguments to check if the word exists in the board."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1: \n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Test case 1: Word \"ABCCED\" can be found in the grid\n",
-    "board1 = [[\"A\",\"B\",\"C\",\"E\"],\n",
-    "          [\"S\",\"F\",\"C\",\"S\"],\n",
-    "          [\"A\",\"D\",\"E\",\"E\"]]\n",
-    "word1 = \"ABCCED\"\n",
-    "print(solution.exist(board1, word1))  # Expected output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "\n",
-    "# Test case 2: Word \"SEE\" can be found in the grid\n",
-    "word2 = \"SEE\"\n",
-    "print(solution.exist(board1, word2))  # Expected output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "b5fca8ab-8c98-45b1-b44b-0503309121c9",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 3\n",
-    "\n",
-    "# Test case 3: Word \"ABCB\" cannot be found in the grid\n",
-    "word3 = \"ABCB\"\n",
-    "print(solution.exist(board1, word3))  # Expected output: False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `exist` method in the given code.\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "The primary work in this code is done by the `dfs` function, which performs a depth-first search through the grid. The time complexity of the `dfs` function is $O(4^(n))$, where \"n\" is the length of the `word`. This is because, in the worst case, the function explores all possible directions (up, down, left, right) for each character in the `word`.\n",
-    "\n",
-    "The outer loops iterate through all cells in the `board`, which has dimensions `m x n`. So, the total number of iterations of `dfs` is O(m * n). However, since the `dfs` function has a higher time complexity, the overall time complexity is still dominated by the `dfs` function.\n",
-    "\n",
-    "Therefore, the overall time complexity of the `exist` method is $O(m * n * 4^n)$, where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. The primary space usage comes from the recursive calls in the `dfs` function. The depth of the recursion can be at most equal to the length of the `word`, which is O(n).\n",
-    "\n",
-    "2. Additionally, the `tmp` variable and the recursive calls on the call stack consume a small amount of additional memory.\n",
-    "\n",
-    "3. The marking of visited cells with the \"/\" character temporarily modifies the `board` in-place but doesn't significantly contribute to the space complexity.\n",
-    "\n",
-    "Therefore, the overall space complexity is O(n) due to the recursive call stack.\n",
-    "\n",
-    "In summary, the time complexity is $O(m * n * 4^n)$, and the space complexity is O(n), where \"m\" and \"n\" are the dimensions of the board, and \"n\" is the length of the word. The time complexity is exponential in the worst case due to the depth-first search through all possible paths in the grid."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the code to find all unique words that can be constructed from the grid. Instead of returning `True` or `False`, return a list of words found. Ensure that the same cell is not used more than once in constructing each word.\n",
-    "\n",
-    "2. **Board Generation:** Create a function to generate random grids of characters and then use the `exist` method to solve them. Test the efficiency and correctness of your code by generating larger boards and words."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb b/docs/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb
deleted file mode 100644
index 56b7647..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/133. Clone Graph.ipynb	
+++ /dev/null
@@ -1,311 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 133. Clone Graph\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Clone Graph problem on LeetCode, click here!](https://leetcode.com/problems/clone-graph/)\n",
-    "\n",
-    "---\n",
-    "Given a reference of a node in a **connected** undirected graph.\n",
-    "\n",
-    "Return a **deep copy** (clone) of the graph.\n",
-    "\n",
-    "Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n",
-    "\n",
-    "```\n",
-    "class Node {\n",
-    "    public int val;\n",
-    "    public List<Node> neighbors;\n",
-    "}\n",
-    "```\n",
-    "\n",
-    "**Test case format:**\n",
-    "\n",
-    "For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n",
-    "\n",
-    "**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n",
-    "\n",
-    "The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- The number of nodes in the graph is in the range `[0, 100]`.\n",
-    "- `1 <= Node.val <= 100`\n",
-    "- `Node.val` is unique for each node.\n",
-    "- There are no repeated edges and no self-loops in the graph.\n",
-    "- The Graph is connected and all nodes can be visited starting from the given node."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to clone a connected undirected graph, which means we need to create a deep copy of the original graph while preserving its structure and relationships between nodes. The graph is represented using adjacency lists, where each node has a value (an integer) and a list of its neighbors.\n",
-    "\n",
-    "Here are the key aspects of the problem:\n",
-    "\n",
-    "1. **Input**: You are given a reference to one of the nodes in the original graph. This reference node serves as the entry point to the graph. The entire graph can be explored starting from this node.\n",
-    "\n",
-    "2. **Output**: The goal is to create a deep copy of the graph and return a reference to the cloned graph. The cloned graph should have the same structure and relationships as the original one but should be a separate instance in memory.\n",
-    "\n",
-    "3. **Graph Structure**: The graph is composed of nodes (vertices) and edges. Nodes have values (integers) and are connected to other nodes through edges (undirected connections). Each node has a list of neighbors, which are other nodes it is connected to.\n",
-    "\n",
-    "4. **Connected Graph**: The problem assumes that the graph is connected, meaning that you can start from the reference node provided and traverse the entire graph by following the edges. This ensures that there are no isolated components in the graph.\n",
-    "\n",
-    "To solve this problem, you typically need to perform a graph traversal (e.g., depth-first search or breadth-first search) to visit all the nodes in the original graph, create corresponding nodes in the clone, and establish the same connections between nodes in the cloned graph as in the original one. To avoid duplication of nodes, you also need to keep track of visited nodes to ensure that the cloning process is efficient and that nodes are not duplicated in the clone.\n",
-    "\n",
-    "The problem can be challenging because you need to create a deep copy of the graph while handling cyclic dependencies between nodes and ensuring that the structure and relationships of the original graph are preserved in the clone. The solution requires recursion or a data structure to maintain the mapping between original nodes and their clones to achieve an efficient and accurate cloning process.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "# Definition for a Node.\n",
-    "class Node:\n",
-    "    def __init__(self, val=0, neighbors=None):\n",
-    "        self.val = val\n",
-    "        self.neighbors = neighbors if neighbors is not None else []\n",
-    "\n",
-    "class Solution:\n",
-    "    def cloneGraph(self, node: 'Node') -> 'Node':\n",
-    "        if not node:\n",
-    "            return None\n",
-    "\n",
-    "        visited = {}  # Dictionary to keep track of visited nodes\n",
-    "\n",
-    "        def dfs(original_node):\n",
-    "            if original_node in visited:\n",
-    "                return visited[original_node]\n",
-    "\n",
-    "            # Create a copy of the original node\n",
-    "            copy_node = Node(original_node.val)\n",
-    "            visited[original_node] = copy_node\n",
-    "\n",
-    "            # Recursively clone the neighbors of the original node\n",
-    "            for neighbor in original_node.neighbors:\n",
-    "                copy_node.neighbors.append(dfs(neighbor))\n",
-    "\n",
-    "            return copy_node\n",
-    "\n",
-    "        return dfs(node)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The given code defines a Python class, `Node`, and a solution class, `Solution`, to clone a connected undirected graph represented by nodes and their neighbors. Here's an explanation of the code:\n",
-    "\n",
-    "1. The `Node` class defines a node in the graph. Each node has a value (`val`) which is an integer and a list of neighbors (`neighbors`) that are other nodes in the graph.\n",
-    "\n",
-    "2. The `Solution` class contains the method `cloneGraph`, which takes a reference to the first node of the graph (`node`) as input and returns a deep copy of the entire graph, preserving the structure and relationships between nodes.\n",
-    "\n",
-    "3. Inside the `cloneGraph` method:\n",
-    "   - It first checks if the input `node` is `None`. If it's `None`, it means there is no graph to clone, and the method returns `None`.\n",
-    "\n",
-    "   - It initializes a `visited` dictionary to keep track of visited nodes. This dictionary is used to ensure that each node is cloned only once to avoid duplication.\n",
-    "\n",
-    "   - The `dfs` (depth-first search) function is defined within the `cloneGraph` method. It takes an original node as input and returns its corresponding clone. This function performs the actual cloning of the graph.\n",
-    "\n",
-    "   - Inside the `dfs` function:\n",
-    "     - It checks if the original node has been visited before by looking it up in the `visited` dictionary. If it has been visited, it returns the corresponding clone from the `visited` dictionary.\n",
-    "\n",
-    "     - If the original node is not visited, it creates a new node, `copy_node`, with the same value as the original node. This is the first step in creating the clone of the original node.\n",
-    "\n",
-    "     - It then recursively clones the neighbors of the original node by iterating through the `neighbors` list of the original node and appending the corresponding cloned neighbors to the `neighbors` list of the `copy_node`. This step ensures that the relationships between nodes are preserved in the clone.\n",
-    "\n",
-    "     - The `copy_node` is added to the `visited` dictionary with the original node as the key and the clone as the value.\n",
-    "\n",
-    "     - Finally, the `copy_node` is returned as the result of the DFS for the original node.\n",
-    "\n",
-    "4. The `cloneGraph` method returns the result of the DFS on the input `node`, which is the clone of the entire graph with its structure and relationships intact.\n",
-    "\n",
-    "In summary, the code uses depth-first search (DFS) to traverse the original graph, creating a clone for each node and its neighbors. It ensures that each node is cloned only once to avoid duplication and returns a reference to the cloned graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1, 2, 4]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "def get_adjacency_list(node):\n",
-    "    visited = {}  # Dictionary to keep track of visited nodes\n",
-    "\n",
-    "    def dfs(node):\n",
-    "        if not node:\n",
-    "            return []\n",
-    "\n",
-    "        if node in visited:\n",
-    "            return visited[node]\n",
-    "\n",
-    "        neighbors = [n.val for n in node.neighbors]\n",
-    "        visited[node] = neighbors\n",
-    "\n",
-    "        for neighbor in node.neighbors:\n",
-    "            dfs(neighbor)\n",
-    "\n",
-    "    dfs(node)\n",
-    "    result = []\n",
-    "\n",
-    "    def get_node_and_neighbors(node):\n",
-    "        result.append([node.val] + visited[node])\n",
-    "\n",
-    "    get_node_and_neighbors(node)\n",
-    "    return result\n",
-    "\n",
-    "\n",
-    "# Testing the code with the provided examples\n",
-    "adjList1 = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Create the graph from adjList\n",
-    "nodes = [Node(i) for i in range(1, len(adjList1) + 1)]\n",
-    "for i, adj in enumerate(adjList1):\n",
-    "    nodes[i].neighbors = [nodes[j - 1] for j in adj]\n",
-    "\n",
-    "# Clone the graph and get its adjacency list\n",
-    "cloned_node1 = solution.cloneGraph(nodes[0])\n",
-    "cloned_adjList1 = get_adjacency_list(cloned_node1)\n",
-    "\n",
-    "# Print the cloned graph as an adjacency list\n",
-    "print(cloned_adjList1)\n",
-    "\n",
-    "# Output should match adjList1\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[1]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "# Input: adjList = [[]]\n",
-    "\n",
-    "adjList2 = [[]]\n",
-    "solution = Solution()\n",
-    "\n",
-    "# Create the graph from adjList\n",
-    "node1 = Node(1)\n",
-    "\n",
-    "# Clone the graph and get its adjacency list\n",
-    "cloned_node1 = solution.cloneGraph(node1)\n",
-    "cloned_adjList2 = get_adjacency_list(cloned_node1)\n",
-    "\n",
-    "# Print the cloned graph as an adjacency list\n",
-    "print(cloned_adjList2)\n",
-    "\n",
-    "# Output should be [[]], which represents an empty graph"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for cloning a graph using depth-first search (DFS).\n",
-    "\n",
-    "Time Complexity:\n",
-    "1. Creating the graph: The time complexity to create the original graph from `adjList` is O(V + E), where V is the number of vertices (nodes) and E is the number of edges. We iterate through each node and its neighbors in `adjList`.\n",
-    "\n",
-    "2. Cloning the graph (DFS): The depth-first search (DFS) is used to traverse the original graph and create a clone. The time complexity of DFS is O(V + E), as we visit each node and each edge once.\n",
-    "\n",
-    "Overall, the time complexity is O(V + E) for both creating the original graph and cloning it.\n",
-    "\n",
-    "Space Complexity:\n",
-    "1. Storage for the original graph: We need to store the original graph, which includes all nodes and their adjacency lists. In the worst case, this requires O(V + E) space, where V is the number of nodes, and E is the number of edges.\n",
-    "\n",
-    "2. Storage for the visited dictionary: The `visited` dictionary stores mappings from original nodes to their corresponding clones. In the worst case, this requires O(V) space because each node is visited once.\n",
-    "\n",
-    "3. Recursive stack for DFS: The space used for the recursive call stack during DFS can be up to O(V) in the worst case, where V is the number of nodes.\n",
-    "\n",
-    "Overall, the space complexity is O(V + E) for storing the original graph, and O(V) for auxiliary data structures, including the `visited` dictionary and the DFS call stack. Therefore, the overall space complexity is O(V + E).\n",
-    "\n",
-    "In summary, the time and space complexities of the provided code for cloning a graph are both O(V + E), where V is the number of nodes, and E is the number of edges in the graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Cyclic Graph**: Design a graph with cycles (nodes connected in a cycle). Test if the code can correctly clone graphs with cycles and doesn't fall into an infinite loop during traversal.\n",
-    "\n",
-    "\n",
-    "2. **Partial Graph Cloning**: Modify the code to clone only a subset of the graph starting from a given reference node, rather than the entire graph. Implement this as an extension to the problem."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb b/docs/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb
deleted file mode 100644
index 0dd53e9..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/178. Graph Valid Tree.ipynb	
+++ /dev/null
@@ -1,242 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 178. Graph Valid Tree\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Graph Valid Tree problem on LintCode, click here!](https://www.lintcode.com/problem/178/)\n",
-    "\n",
-    "---\n",
-    "Given `n` nodes labeled from `0` to `n - 1` and a list of `undirected` edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- You can assume that no duplicate edges will appear in edges. Since all edges are `undirected`, `[0, 1]` is the same as `[1, 0]` and thus will not appear together in edges."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether a given set of undirected edges can form a valid tree. In this context, a \"tree\" is a specific type of graph with the following properties:\n",
-    "\n",
-    "1. It is a connected graph, meaning there is a path between any pair of nodes in the graph.\n",
-    "2. It has no cycles, which means there are no closed loops or circuits in the graph.\n",
-    "3. It has exactly `n - 1` edges, where `n` is the number of nodes in the tree.\n",
-    "\n",
-    "The problem is typically given with two pieces of information:\n",
-    "\n",
-    "1. The number of nodes (`n`), which are usually labeled from 0 to `n-1`.\n",
-    "2. A list of undirected edges, where each edge is represented as a pair of nodes.\n",
-    "\n",
-    "The task is to write a function or algorithm to determine whether the provided set of edges can be arranged to form a valid tree based on the properties mentioned above.\n",
-    "\n",
-    "To solve this problem, you need to check the following conditions:\n",
-    "\n",
-    "1. There should be exactly `n - 1` edges to ensure that the graph is connected and tree-like.\n",
-    "2. There should be no cycles in the graph. If there are any cycles, the set of edges cannot form a tree.\n",
-    "3. The graph should be connected, which means you can reach any node from any other node through a series of edges.\n",
-    "\n",
-    "The solution typically involves using graph traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS) to explore the graph and check these conditions. If all conditions are met, the given edges form a valid tree; otherwise, they do not.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def validTree(n, edges):\n",
-    "    if len(edges) != n - 1:\n",
-    "        return False  # A tree with n nodes must have n-1 edges.\n",
-    "\n",
-    "    # Create an adjacency list to represent the graph.\n",
-    "    adj_list = {i: [] for i in range(n)}\n",
-    "    for u, v in edges:\n",
-    "        adj_list[u].append(v)\n",
-    "        adj_list[v].append(u)\n",
-    "\n",
-    "    visited = set()\n",
-    "\n",
-    "    # Define a recursive DFS function.\n",
-    "    def dfs(node, parent):\n",
-    "        if node in visited:\n",
-    "            return False  # If we encounter a visited node, there's a cycle.\n",
-    "        visited.add(node)\n",
-    "\n",
-    "        for neighbor in adj_list[node]:\n",
-    "            if neighbor != parent:\n",
-    "                if not dfs(neighbor, node):\n",
-    "                    return False\n",
-    "\n",
-    "        return True\n",
-    "\n",
-    "    # Start DFS from any node (e.g., node 0).\n",
-    "    if not dfs(0, -1):\n",
-    "        return False  # If there's a cycle, it's not a valid tree.\n",
-    "\n",
-    "    return len(visited) == n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The `validTree` function checks if a given set of undirected edges forms a valid tree. A valid tree must satisfy these conditions:\n",
-    "\n",
-    "1. It has exactly `n - 1` edges, where `n` is the number of nodes.\n",
-    "2. There are no cycles in the graph.\n",
-    "3. The graph is connected, meaning all nodes are reachable from any starting node.\n",
-    "\n",
-    "The code accomplishes this as follows:\n",
-    "\n",
-    "- It first checks if the number of edges is equal to `n - 1`. If not, it immediately returns `False` since a tree with `n` nodes must have `n - 1` edges to be connected.\n",
-    "\n",
-    "- It then constructs an adjacency list (`adj_list`) to represent the graph efficiently. This data structure stores the neighbors of each node.\n",
-    "\n",
-    "- The code uses a `visited` set to keep track of nodes visited during depth-first search (DFS).\n",
-    "\n",
-    "- The `dfs` function is a recursive function that checks for cycles in the graph. It does this by visiting nodes and marking them as visited. If it encounters a node that has already been visited (indicating a cycle), it returns `False`.\n",
-    "\n",
-    "- The DFS function explores the neighbors of each node, avoiding revisiting the parent node to prevent cycles.\n",
-    "\n",
-    "- After the DFS is complete, the code checks if the number of visited nodes is equal to `n`, ensuring the graph is connected.\n",
-    "\n",
-    "- Finally, if all conditions are met, the code returns `True`, indicating that the given edges form a valid tree. Otherwise, it returns `False`.\n",
-    "\n",
-    "The code provides examples to demonstrate how to use the `validTree` function to check whether a set of edges forms a valid tree or not."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "n1 = 5\n",
-    "edges1 = [[0, 1], [0, 2], [0, 3], [1, 4]]\n",
-    "print(validTree(n1, edges1))  # Output: true"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "n2 = 5\n",
-    "edges2 = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]\n",
-    "print(validTree(n2, edges2))  # Output: false"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexities of the `validTree` function:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "1. Constructing the adjacency list (`adj_list`) takes O(E) time, where E is the number of edges in the input graph (|edges|).\n",
-    "\n",
-    "2. The DFS function, when considering all nodes, has a time complexity of O(V + E), where V is the number of nodes in the graph. This is because, in the worst case, the DFS function visits each node and each edge once.\n",
-    "\n",
-    "3. Checking if the number of visited nodes is equal to `n` takes O(1) time.\n",
-    "\n",
-    "Overall, the time complexity of the `validTree` function is O(E + V) in the worst case.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "1. The adjacency list (`adj_list`) consumes additional space to store the graph structure, taking O(V + E) space. This is because it stores information about each node and its adjacent nodes.\n",
-    "\n",
-    "2. The `visited` set keeps track of visited nodes, and its space complexity is O(V) in the worst case, as there can be at most V unique nodes in the set.\n",
-    "\n",
-    "3. The depth of the function call stack during DFS can be at most V, which contributes O(V) space to the space complexity.\n",
-    "\n",
-    "Overall, the space complexity of the `validTree` function is O(V + E) due to the adjacency list and O(V) due to the `visited` set and DFS call stack.\n",
-    "\n",
-    "In summary, the time complexity is O(E + V), and the space complexity is O(V + E). These complexities are based on the worst-case scenario, where all nodes and edges are considered. In practical cases, the actual complexities may be smaller, depending on the specific structure of the graph."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Minimum Spanning Tree (MST)**: Implement an algorithm to find the minimum spanning tree of a connected graph using either Kruskal's or Prim's algorithm. Compare the MST to the original graph to determine if the original graph is a tree. This exercise reinforces the concept of tree properties.\n",
-    "\n",
-    "2. **Detecting Cycles**: Modify the code to not only check if the input forms a tree but also to identify and print out any cycles present in the graph if it's not a tree. This exercise enhances your ability to detect and visualize cycles in a graph."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb b/docs/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb
deleted file mode 100644
index 5a878a4..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/200. Number of Islands.ipynb	
+++ /dev/null
@@ -1,236 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 200. Number of Islands\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Number of Islands problem on LeetCode, click here!](https://leetcode.com/problems/number-of-islands/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "Given an `m x n` 2D binary grid `grid` which represents a map of `'1'`s (land) and `'0'`s (water), return *the number of islands*. \n",
-    "\n",
-    "An **island** is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == grid.length`\n",
-    "- `n == grid[i].length`\n",
-    "- `1 <= m, n <= 300`\n",
-    "- `grid[i][j]` is `'0'` or `'1'`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is about counting the number of islands in a 2D binary grid. In this grid, '1' represents land, and '0' represents water. An island is defined as a group of '1' cells that are adjacent to each other either horizontally or vertically. It's important to note that diagonal connections do not count. Additionally, it's assumed that all four edges of the grid are surrounded by water, meaning the grid is finite and doesn't \"wrap around.\"\n",
-    "\n",
-    "The objective is to determine how many distinct islands exist in the grid. To clarify, an island consists of connected '1' cells, and these connections can only occur horizontally or vertically. If there are no '1' cells in the grid, the number of islands would be zero.\n",
-    "\n",
-    "The problem often involves using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS) to identify and count these islands. You start at one '1' cell and explore its adjacent cells to determine the extent of the island. Once you've visited all the '1' cells in an island, you move on to the next unvisited '1' cell and repeat the process until you've counted all the islands in the grid.\n",
-    "\n",
-    "In essence, the problem asks you to analyze the grid to find groups of connected '1' cells and count them as individual islands. The goal is to return the total count of islands in the given grid.\n",
-    "\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def numIslands(self, grid: List[List[str]]) -> int:\n",
-    "        if not grid:\n",
-    "            return 0\n",
-    "\n",
-    "        m, n = len(grid), len(grid[0])  # Get the dimensions of the grid\n",
-    "        num_islands = 0  # Initialize the count of islands\n",
-    "\n",
-    "        def dfs(row, col):\n",
-    "            if row < 0 or row >= m or col < 0 or col >= n or grid[row][col] == '0':\n",
-    "                return\n",
-    "\n",
-    "            grid[row][col] = '0'  # Mark the current cell as visited by changing it to '0'\n",
-    "            directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]  # Define four possible directions to move\n",
-    "\n",
-    "            for dr, dc in directions:\n",
-    "                # Explore adjacent cells\n",
-    "                dfs(row + dr, col + dc)\n",
-    "\n",
-    "        for i in range(m):\n",
-    "            for j in range(n):\n",
-    "                if grid[i][j] == '1':\n",
-    "                    num_islands += 1  # Increment the island count\n",
-    "                    dfs(i, j)  # Start a DFS from the current '1' cell to explore the entire island\n",
-    "\n",
-    "        return num_islands\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a Python class called `Solution` with a method called `numIslands`. This class is designed to count the number of islands in a 2D binary grid.\n",
-    "\n",
-    "The `numIslands` method takes a 2D grid as input, where '1' represents land, and '0' represents water. It uses a depth-first search (DFS) approach to identify and count islands. The key steps in the code include:\n",
-    "\n",
-    "1. Checking if the input grid is empty, and if so, returning 0 (indicating there are no islands).\n",
-    "\n",
-    "2. Determining the dimensions of the grid (number of rows and columns).\n",
-    "\n",
-    "3. Initializing a variable `num_islands` to keep track of the count of islands.\n",
-    "\n",
-    "4. Defining a nested function `dfs` to perform depth-first search. This function recursively explores adjacent land cells connected to the current cell and marks them as visited by changing '1' to '0'.\n",
-    "\n",
-    "5. In the `dfs` function, it checks for boundary conditions and whether the current cell is '0'. If these conditions are met, it returns without further exploration.\n",
-    "\n",
-    "6. The `dfs` function explores neighboring cells in all four directions (up, down, left, right) using a loop.\n",
-    "\n",
-    "7. The main loop iterates through each cell of the grid. When a '1' cell is encountered, it increments the `num_islands` count and starts a DFS from that cell to explore the entire island.\n",
-    "\n",
-    "8. Finally, the method returns the total count of islands found in the grid.\n",
-    "\n",
-    "This code encapsulates the solution in a class, allowing you to create an instance of the `Solution` class and call the `numIslands` method on it to count the number of islands in a given grid."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 1 Output: 1\n"
-     ]
-    }
-   ],
-   "source": [
-    "grid1 = [\n",
-    "  [\"1\", \"1\", \"1\", \"1\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"1\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"0\", \"0\", \"0\"]\n",
-    "]\n",
-    "\n",
-    "solution = Solution()\n",
-    "result1 = solution.numIslands(grid1)\n",
-    "print(\"Example 1 Output:\", result1)  # Expected output: 1\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 2 Output: 3\n"
-     ]
-    }
-   ],
-   "source": [
-    "grid2 = [\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"1\", \"1\", \"0\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"1\", \"0\", \"0\"],\n",
-    "  [\"0\", \"0\", \"0\", \"1\", \"1\"]\n",
-    "]\n",
-    "\n",
-    "result2 = solution.numIslands(grid2)\n",
-    "print(\"Example 2 Output:\", result2)  # Expected output: 3\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "Time Complexity:\n",
-    "- The code uses a depth-first search (DFS) to explore the grid and count the number of islands.\n",
-    "- In the worst case, it visits every cell in the grid exactly once.\n",
-    "- The DFS function explores neighboring cells in four directions (up, down, left, right), so it has a time complexity of $O(4^{max(m, n)})$, where m is the number of rows and n is the number of columns.\n",
-    "- Therefore, the overall time complexity of the code is O(m * n), where m is the number of rows, and n is the number of columns.\n",
-    "\n",
-    "Space Complexity:\n",
-    "- The space complexity is determined by the recursive calls and the depth of the DFS stack.\n",
-    "- In the worst case, when the entire grid consists of '1's, the depth of the DFS recursion can be as deep as max(m, n).\n",
-    "- Therefore, the space complexity of the code is O(max(m, n)), representing the maximum depth of the DFS stack.\n",
-    "\n",
-    "In practical terms, for reasonably sized grids, the time and space complexity is linear, and the code should perform well. However, it's important to keep in mind that the worst-case time complexity is O(m * n), and the space complexity can be O(max(m, n))."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Identify Largest Island:** In addition to counting the number of islands, modify the code to identify the largest island in the grid and return its size.\n",
-    "\n",
-    "2. **Optimize for Space:** Modify the solution to reduce its space complexity to O(1) without modifying the input grid. This is a more memory-efficient version of the problem."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb b/docs/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb
deleted file mode 100644
index 4176cab..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/207. Course Schedule.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 207. Course Schedule\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Course Schedule problem on LeetCode, click here!](https://leetcode.com/problems/course-schedule/)\n",
-    "\n",
-    "---\n",
-    "There are a total of `numCourses` courses to take, labeled from 0 to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`. \n",
-    "\n",
-    "- For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.\n",
-    "\n",
-    "Return `true` if you can finish all courses. Otherwise, return `false`.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- 1 <= `numCourses` <= 2000\n",
-    "- 0 <= `prerequisites.length` <= 5000\n",
-    "- `prerequisites[i].length` == 2\n",
-    "- 0 <= `ai`, `bi` < `numCourses`\n",
-    "- All the pairs `prerequisites[i]` are **unique**."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is to determine whether it's possible to complete a set of courses given a list of prerequisites. You are given the following:\n",
-    "\n",
-    "- `numCourses`: The total number of courses to be taken, labeled from 0 to `numCourses - 1`.\n",
-    "- `prerequisites`: A list of prerequisite courses, where each element `prerequisites[i]` is a pair `[ai, bi]`, indicating that you must take course `bi` before you can take course `ai`.\n",
-    "\n",
-    "The goal is to check whether it's possible to complete all the courses while respecting the prerequisite requirements. In other words, you need to determine if there are any circular dependencies in the course prerequisites that would prevent you from taking all the courses.\n",
-    "\n",
-    "For example:\n",
-    "\n",
-    "- If `numCourses` is 2, and `prerequisites` is `[[1, 0]]`, it means you have two courses, and you must finish course 0 before you can take course 1. In this case, it's possible to complete all courses, so the function should return `True`.\n",
-    "\n",
-    "- If `numCourses` is 2, and `prerequisites` is `[[1, 0], [0, 1]]`, it means you have two courses, but there's a circular dependency where course 1 requires course 0 and course 0 requires course 1. In this case, it's impossible to complete all courses, so the function should return `False`.\n",
-    "\n",
-    "The problem is essentially about checking for the presence of cycles in a directed graph, where the courses are nodes, and the prerequisites represent directed edges between them. If there are no cycles, it's possible to complete all courses; otherwise, it's not possible.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict, deque\n",
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\n",
-    "        # Create a graph using an adjacency list to represent the courses and their prerequisites.\n",
-    "        graph = defaultdict(list)  # Initialize an empty adjacency list.\n",
-    "        in_degree = [0] * numCourses  # Initialize an array to store in-degrees of courses.\n",
-    "\n",
-    "        # Populate the graph and calculate in-degrees.\n",
-    "        for course, prerequisite in prerequisites:\n",
-    "            graph[prerequisite].append(course)  # Add the course as a neighbor to its prerequisite.\n",
-    "            in_degree[course] += 1  # Increment the in-degree of the course.\n",
-    "\n",
-    "        # Initialize a queue with courses that have no prerequisites.\n",
-    "        queue = deque()\n",
-    "        for course in range(numCourses):\n",
-    "            if in_degree[course] == 0:\n",
-    "                queue.append(course)\n",
-    "\n",
-    "        # Perform topological sorting.\n",
-    "        while queue:\n",
-    "            course = queue.popleft()  # Take a course with no prerequisites.\n",
-    "            numCourses -= 1  # Decrement the count of remaining courses.\n",
-    "\n",
-    "            for neighbor in graph[course]:\n",
-    "                in_degree[neighbor] -= 1  # Remove the prerequisite relationship.\n",
-    "                if in_degree[neighbor] == 0:\n",
-    "                    queue.append(neighbor)  # If no more prerequisites, add to the queue.\n",
-    "\n",
-    "        # If all courses were successfully taken (numCourses becomes 0), return True.\n",
-    "        return numCourses == 0"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "This Python code is designed to determine whether it is possible to complete all the required courses given a set of prerequisites. It uses a topological sorting algorithm to accomplish this. Here's a brief explanation of the code:\n",
-    "\n",
-    "1. The code defines a `Solution` class with a `canFinish` method that takes two parameters: `numCourses` (the total number of courses) and `prerequisites` (a list of pairs indicating which course must be taken before another).\n",
-    "\n",
-    "2. It initializes an empty graph as an adjacency list using a `defaultdict` to represent the courses and their prerequisites. It also initializes a list called `in_degree` to keep track of the in-degrees of courses, which is used in the topological sorting process.\n",
-    "\n",
-    "3. The code then populates the graph by iterating through the `prerequisites` list. For each pair `(ai, bi)`, it adds course `ai` as a neighbor to its prerequisite course `bi` in the graph and increments the in-degree of course `ai`.\n",
-    "\n",
-    "4. Next, it initializes a queue with courses that have no prerequisites. It does this by iterating through all the courses and adding those with an in-degree of 0 to the queue.\n",
-    "\n",
-    "5. The code performs a topological sorting of the courses using a while loop. In each iteration of the loop, it dequeues a course from the front of the queue (a course with no prerequisites).\n",
-    "\n",
-    "6. For each neighbor (course that depends on the dequeued course), it decrements the in-degree of the neighbor. If the neighbor's in-degree becomes 0, it means all of its prerequisites have been taken, so the neighbor is added to the queue.\n",
-    "\n",
-    "7. The loop continues until there are no more courses with no prerequisites to dequeue, and the in-degrees are updated accordingly.\n",
-    "\n",
-    "8. After the loop, if all courses were successfully taken (i.e., `numCourses` becomes 0), it means that there were no circular dependencies, and it's possible to finish all courses. In this case, the method returns `True`. Otherwise, if there are remaining courses (indicating a circular dependency), it returns `False`."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "True\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "numCourses1 = 2\n",
-    "prerequisites1 = [[1, 0]]\n",
-    "sol = Solution()\n",
-    "print(sol.canFinish(numCourses1, prerequisites1))  # Output: True"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "False\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "numCourses2 = 2\n",
-    "prerequisites2 = [[1, 0], [0, 1]]\n",
-    "print(sol.canFinish(numCourses2, prerequisites2))  # Output: False"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the `canFinish` method:\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "\n",
-    "1. Constructing the graph: In the first loop where we iterate through the `prerequisites` list, we populate the graph with prerequisites. This loop has a time complexity of O(E), where E is the number of prerequisites (edges).\n",
-    "\n",
-    "2. Initializing in-degrees and finding courses with no prerequisites: In the worst case, we iterate through all `numCourses` courses to initialize in-degrees and find the courses with no prerequisites. This has a time complexity of O(V), where V is the number of courses (vertices).\n",
-    "\n",
-    "3. Topological Sorting: In the while loop, we perform topological sorting, processing each course once and its outgoing edges. In the worst case, each course is processed once. This has a time complexity of O(V + E).\n",
-    "\n",
-    "The overall time complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "\n",
-    "1. Graph Representation: The space complexity for storing the graph as an adjacency list is O(E), where E is the number of prerequisites.\n",
-    "\n",
-    "2. In-Degree Array: The space complexity for storing the in-degrees of courses is O(V), where V is the number of courses.\n",
-    "\n",
-    "3. Queue: The space complexity for the queue is O(V), as it may contain all the courses.\n",
-    "\n",
-    "The overall space complexity is O(V + E), where V is the number of courses, and E is the number of prerequisites.\n",
-    "\n",
-    "In most practical cases, the number of prerequisites (E) is much smaller than the number of courses (V), so the time and space complexity can often be considered as O(V)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimizing Course Scheduling**: Given a list of courses with their durations and prerequisites, find the most efficient way to schedule these courses to minimize the time it takes to complete all of them.\n",
-    "\n",
-    "2. **Detecting Cycles in Course Dependencies**: Modify the original problem to not just determine if you can finish all courses but also to identify the specific courses that form a cycle in the prerequisite dependencies."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb b/docs/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb
deleted file mode 100644
index a2789c4..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb	
+++ /dev/null
@@ -1,230 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 3651. Number of Connected Components in an Undirected Graph\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Number of Connected Components in an Undirected Graph problem on LintCode, click here!](https://www.lintcode.com/problem/3651/)\n",
-    "\n",
-    "---\n",
-    "In this problem, there is an undirected graph with `n` nodes. There is also an `edges` array. Where `edges[i] = [a, b]` means that there is an edge between *node a* and *node b* in the graph.\n",
-    "\n",
-    "You need to return *the number of connected components in that graph*."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand is to determine the number of connected components in an undirected graph. Here's a more detailed explanation of the problem:\n",
-    "\n",
-    "- You are given an undirected graph, which consists of nodes and edges. The graph may have multiple distinct connected components.\n",
-    "\n",
-    "- A connected component is a group of nodes within the graph where each node can be reached from every other node in the same component. In other words, there is a path between any two nodes in the same connected component, but there are no paths connecting nodes from different components.\n",
-    "\n",
-    "- Your task is to write a function that takes as input the number of nodes `n` and a list of edges `edges`, where each edge is represented as a pair of nodes `[a, b]` indicating an edge between node `a` and node `b`.\n",
-    "\n",
-    "- The goal is to determine the number of distinct connected components in the graph.\n",
-    "\n",
-    "- You need to implement an algorithm that can identify these connected components and count how many there are in the given graph.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "def countConnectedComponents(n, edges):\n",
-    "    # Define a helper function for depth-first search (DFS).\n",
-    "    def dfs(node):\n",
-    "        if not visited[node]:  # If the node has not been visited yet:\n",
-    "            visited[node] = True  # Mark it as visited.\n",
-    "            for neighbor in graph[node]:  # Explore all neighbors of the current node.\n",
-    "                dfs(neighbor)  # Recursively call DFS on the neighbor.\n",
-    "\n",
-    "    # Create an empty adjacency list to represent the graph.\n",
-    "    graph = [[] for _ in range(n)]\n",
-    "\n",
-    "    # Initialize a boolean list to keep track of visited nodes.\n",
-    "    visited = [False] * n\n",
-    "\n",
-    "    # Populate the adjacency list with edges from the input.\n",
-    "    for a, b in edges:\n",
-    "        graph[a].append(b)\n",
-    "        graph[b].append(a)  # Since the graph is undirected, we add edges in both directions.\n",
-    "\n",
-    "    # Initialize a counter to keep track of the number of connected components.\n",
-    "    count = 0\n",
-    "\n",
-    "    # Iterate through all nodes in the graph.\n",
-    "    for i in range(n):\n",
-    "        if not visited[i]:  # If the node has not been visited:\n",
-    "            count += 1  # Increment the count since we've found a new connected component.\n",
-    "            dfs(i)  # Start a depth-first search from the unvisited node to explore the component.\n",
-    "\n",
-    "    return count"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided Python code calculates the number of connected components in an undirected graph. Here's a high-level explanation of how the code works:\n",
-    "\n",
-    "1. The `countConnectedComponents` function takes two arguments: `n` (the number of nodes in the graph) and `edges` (a list of edge pairs representing connections between nodes).\n",
-    "\n",
-    "2. Inside the function, there is a helper function called `dfs` (depth-first search), which is used to explore and mark nodes as visited.\n",
-    "\n",
-    "3. An empty adjacency list called `graph` is created to represent the graph. The `graph` is a list of lists where each element represents a node, and the list associated with each node contains its neighboring nodes.\n",
-    "\n",
-    "4. Another list called `visited` is created to keep track of visited nodes. Initially, all nodes are marked as not visited (`False`).\n",
-    "\n",
-    "5. The code populates the `graph` by iterating through the `edges` list and adding each edge to the adjacency list. Since the graph is undirected, both directions of each edge are added.\n",
-    "\n",
-    "6. A counter variable called `count` is initialized to keep track of the number of connected components.\n",
-    "\n",
-    "7. The code iterates through all nodes from `0` to `n-1`. For each node, it checks whether it has been visited yet. If it hasn't been visited, it means a new connected component is found. The counter `count` is incremented, and a depth-first search (DFS) is initiated from this unvisited node to explore the connected component.\n",
-    "\n",
-    "8. The `dfs` function recursively visits all nodes in the connected component, marking them as visited. It does this by checking each neighbor of the current node and recursively calling `dfs` on unvisited neighbors.\n",
-    "\n",
-    "9. After the loop through all nodes, the `count` variable contains the total number of connected components in the graph.\n",
-    "\n",
-    "10. The function returns the value of `count`, which represents the number of connected components.\n",
-    "\n",
-    "11. Two examples are provided at the end to demonstrate how to use the function with different inputs."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "1\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "n1 = 3\n",
-    "edges1 = [[0, 1], [0, 2]]\n",
-    "print(countConnectedComponents(n1, edges1))  # Output: 1"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "n2 = 6\n",
-    "edges2 = [[0, 1], [1, 2], [2, 3], [4, 5]]\n",
-    "print(countConnectedComponents(n2, edges2))  # Output: 2"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the code for counting the number of connected components in an undirected graph using depth-first search (DFS).\n",
-    "\n",
-    "**Time Complexity:**\n",
-    "- The code iterates through all nodes in the graph (from 0 to `n-1`).\n",
-    "- For each unvisited node, it initiates a depth-first search (DFS) from that node to explore the connected component.\n",
-    "- In the worst case, every node may belong to a separate connected component, and you perform a DFS for each node.\n",
-    "- The time complexity of the DFS for a single connected component is O(V + E), where V is the number of nodes in the component, and E is the number of edges.\n",
-    "- In the worst case, you perform O(n) DFS calls, each with its own O(V + E) complexity.\n",
-    "\n",
-    "So, the overall time complexity of the code is O(n * (V + E)). In the worst case, if the graph is connected (a single connected component), this simplifies to O(n * (n + m)), where m is the number of edges.\n",
-    "\n",
-    "**Space Complexity:**\n",
-    "- The main data structures used are the `graph` (adjacency list), `visited` (boolean array), and the recursive call stack for DFS.\n",
-    "- The `graph` has a space complexity of O(n + m), where n is the number of nodes, and m is the number of edges.\n",
-    "- The `visited` boolean array also has a space complexity of O(n) to keep track of whether nodes have been visited.\n",
-    "- The depth of the recursive call stack for DFS can go up to O(n) in the worst case, when all nodes are part of a single connected component.\n",
-    "\n",
-    "So, the overall space complexity of the code is O(n + m) for data structures and O(n) for the call stack. In the worst case, this simplifies to O(n + m).\n",
-    "\n",
-    "In summary, the time complexity is O(n * (V + E)), and the space complexity is O(n + m)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Disconnected Components with Multiple Queries:** You are given an undirected graph with `n` nodes and `m` edges. Initially, the graph is disconnected, and you need to process `q` queries. Each query consists of adding an edge to connect two nodes. After each query, you need to output the number of connected components in the updated graph.\n",
-    "\n",
-    "2. **Maximum Size of Connected Components:** Given an undirected graph with `n` nodes and `m` edges, find the size of the largest connected component in the graph. Additionally, identify the nodes that belong to this largest component. You can assume there is at least one connected component in the graph.\n"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb b/docs/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb
deleted file mode 100644
index c685b23..0000000
--- a/docs/_build/jupyter_execute/11. Graphs/417. Pacific Atlantic Water Flow.ipynb	
+++ /dev/null
@@ -1,255 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 417. Pacific Atlantic Water Flow\n",
-    "\n",
-    "\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "**Link to Problem:** [To see the Pacific Atlantic Water Flow problem on LeetCode, click here!](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n",
-    "\n",
-    "---\n",
-    "There is an `m x n` rectangular island that borders both the **Pacific Ocean** and **Atlantic Ocean**. The **Pacific Ocea**n touches the island's left and top edges, and the **Atlantic Ocean** touches the island's right and bottom edges.\n",
-    "\n",
-    "The island is partitioned into a grid of square cells. You are given an `m x n` integer matrix `heights` where `heights[r][c]` represents the **height above sea level** of the cell at coordinate `(r, c)`.\n",
-    "\n",
-    "The island receives a lot of rain, and the rain water can flow to neighboring cells directly north, south, east, and west if the neighboring cell's height is **less than or equal to** the current cell's height. Water can flow from any cell adjacent to an ocean into the ocean.\n",
-    "\n",
-    "Return *a **2D list** of grid coordinates `result` where $result[i] = [r_i, c_i]$ denotes that rain water can flow from cell $(r_i, c_i)$ to **both** the Pacific and Atlantic oceans*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `m == heights.length`\n",
-    "- `n == heights[r].length`\n",
-    "- `1 <= m, n <= 200`\n",
-    "- 0 <= `heights[r][c]` <= $10^5$"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand involves a scenario with a rectangular island surrounded by both the Pacific Ocean and the Atlantic Ocean. The Pacific Ocean is in contact with the island's left and top edges, while the Atlantic Ocean is in contact with the island's right and bottom edges. The goal is to determine which cells on the island can allow rainwater to flow to both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "Here are the key details and constraints of the problem:\n",
-    "\n",
-    "1. The island is divided into a grid of square cells.\n",
-    "\n",
-    "2. Each cell is represented by an integer value in a matrix `heights`. The value at `heights[r][c]` represents the height above sea level of the cell at coordinates `(r, c)` on the island.\n",
-    "\n",
-    "3. Rainwater can flow from a cell to neighboring cells directly north, south, east, or west only if the neighboring cell's height is less than or equal to the current cell's height.\n",
-    "\n",
-    "4. Water can flow from any cell adjacent to the ocean into the ocean. This means water can flow from cells on the edge of the island to the Pacific Ocean and the Atlantic Ocean.\n",
-    "\n",
-    "The task is to find and return a 2D list of grid coordinates where rainwater can flow from a cell to both the Pacific and Atlantic Oceans. In other words, you need to identify the cells that can send water to both the left and top edges (Pacific) and the right and bottom edges (Atlantic) of the island.\n",
-    "\n",
-    "The problem is solved by performing a depth-first search (DFS) starting from the ocean edges and marking the cells that can flow to each ocean. Then, the algorithm identifies cells that are reachable from both oceans and returns their coordinates as the result.\n",
-    "\n",
-    "The problem involves both traversal of the island and backtracking to find the solution, which makes it a classic graph traversal problem.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]:\n",
-    "        # Check if the input matrix is empty\n",
-    "        if not heights:\n",
-    "            return []\n",
-    "        \n",
-    "        m, n = len(heights), len(heights[0])\n",
-    "        \n",
-    "        # Initialize boolean matrices to keep track of cells reachable from each ocean\n",
-    "        pacific_reachable = [[False] * n for _ in range(m)]\n",
-    "        atlantic_reachable = [[False] * n for _ in range(m)]\n",
-    "        \n",
-    "        # Depth-First Search (DFS) function to mark cells that can be reached from an ocean\n",
-    "        def dfs(x, y, reachable):\n",
-    "            if reachable[x][y]:\n",
-    "                return\n",
-    "            reachable[x][y] = True\n",
-    "            for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n",
-    "                new_x, new_y = x + dx, y + dy\n",
-    "                if 0 <= new_x < m and 0 <= new_y < n and heights[new_x][new_y] >= heights[x][y]:\n",
-    "                    dfs(new_x, new_y, reachable)\n",
-    "        \n",
-    "        # Start DFS from the Pacific Ocean (left and top edges)\n",
-    "        for i in range(m):\n",
-    "            dfs(i, 0, pacific_reachable)\n",
-    "            dfs(i, n - 1, atlantic_reachable)\n",
-    "        \n",
-    "        for j in range(n):\n",
-    "            dfs(0, j, pacific_reachable)\n",
-    "            dfs(m - 1, j, atlantic_reachable)\n",
-    "        \n",
-    "        result = []\n",
-    "        \n",
-    "        # Find cells that can flow to both the Pacific and Atlantic oceans\n",
-    "        for i in range(m):\n",
-    "            for j in range(n):\n",
-    "                if pacific_reachable[i][j] and atlantic_reachable[i][j]:\n",
-    "                    result.append([i, j])\n",
-    "        \n",
-    "        return result"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a class called `Solution` with a method named `pacificAtlantic`. This method takes a 2D matrix `heights`, where each element represents the height above sea level of a cell on a rectangular island. The goal of the method is to find and return a list of grid coordinates (cells) from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "The code uses a Depth-First Search (DFS) algorithm to traverse the island, starting from the ocean edges, and marks cells that are reachable from either the Pacific or Atlantic Ocean. It does this by creating two boolean matrices, `pacific_reachable` and `atlantic_reachable`, to keep track of cells that can be reached from each ocean.\n",
-    "\n",
-    "The code iterates through the entire island, initiating DFS searches from the edges of the island. If a cell is reachable from an ocean (either Pacific or Atlantic), it is marked as reachable in the corresponding boolean matrix. The DFS function ensures that the traversal follows the rule that water can flow to a neighboring cell if the neighboring cell's height is less than or equal to the current cell's height.\n",
-    "\n",
-    "After marking all reachable cells from both oceans, the code then looks for cells that are reachable from both the Pacific and Atlantic Oceans. If a cell satisfies this condition, it is added to the `result` list.\n",
-    "\n",
-    "Finally, the code returns the `result` list, which contains the grid coordinates of cells from which rainwater can flow into both the Pacific and Atlantic Oceans.\n",
-    "\n",
-    "The code provides a solution to the problem of finding cells on the island where water can reach both oceans, demonstrating a traversal algorithm that explores the connectivity of cells on the island."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "heights1 = [\n",
-    "    [1,2,2,3,5],\n",
-    "    [3,2,3,4,4],\n",
-    "    [2,4,5,3,1],\n",
-    "    [6,7,1,4,5],\n",
-    "    [5,1,1,2,4]\n",
-    "]\n",
-    "\n",
-    "solution = Solution()\n",
-    "print(solution.pacificAtlantic(heights1)) # Expected Output: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]]"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[[0, 0]]\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "heights2 = [[1]]\n",
-    "print(solution.pacificAtlantic(heights2)) # Expected Output: [[0, 0]]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Time Complexity:\n",
-    "The time complexity of this solution is O(m * n), where 'm' is the number of rows in the input matrix and 'n' is the number of columns. Here's a breakdown of the time complexity:\n",
-    "\n",
-    "1. Creating the `pacific_reachable` and `atlantic_reachable` matrices with dimensions m x n takes O(m * n) time.\n",
-    "\n",
-    "2. Initiating Depth-First Search (DFS) from the edges of the island takes O(m * n) time because it processes each cell once.\n",
-    "\n",
-    "3. The DFS function visits each cell at most once, and its time complexity is O(1) for each cell. The number of cells visited by the DFS in the worst case is m * n.\n",
-    "\n",
-    "4. The final step of identifying and appending cells to the result list takes O(m * n) time in the worst case.\n",
-    "\n",
-    "Overall, the time complexity is dominated by the DFS and is O(m * n).\n",
-    "\n",
-    "Space Complexity:\n",
-    "The space complexity of this solution is also O(m * n). Here's how the space is used:\n",
-    "\n",
-    "1. Two boolean matrices, `pacific_reachable` and `atlantic_reachable`, are created with dimensions m x n. Each matrix takes O(m * n) space, resulting in O(2 * m * n) space usage.\n",
-    "\n",
-    "2. The depth-first search (DFS) stack space during the recursive calls can go as deep as the diagonal of the grid, which is at most min(m, n). This additional space for the call stack is relatively small compared to the boolean matrices and can be considered O(min(m, n)).\n",
-    "\n",
-    "3. The `result` list stores the grid coordinates, and its size is determined by the number of cells that can flow to both oceans. In the worst case, this list can contain all m * n cells, so it takes O(m * n) space.\n",
-    "\n",
-    "The overall space complexity is the sum of these components, which is O(m * n) + O(min(m, n)) + O(m * n). In big O notation, we can simplify this to O(m * n)."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Modify the algorithm to find the maximum flow of water from any cell to both the Pacific and Atlantic Oceans. In other words, find the cell(s) that can send the most water to both oceans.\n",
-    "\n",
-    "2. **Efficiency Challenge:** Optimize the time and space complexity of the algorithm while maintaining correctness. Aim to reduce both time and space complexity as much as possible."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb b/docs/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb
deleted file mode 100644
index 19db846..0000000
--- a/docs/_build/jupyter_execute/12. Advanced Graphs/892. Alien Dictionary.ipynb	
+++ /dev/null
@@ -1,250 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {
-    "jp-MarkdownHeadingCollapsed": true
-   },
-   "source": [
-    "# 892. Alien Dictionary\n",
-    "\n",
-    "**Difficulty:** Hard\n",
-    "\n",
-    "**Link to Problem:** [To see the Alien Dictionary problem on LintCode, click here!](https://www.lintcode.com/problem/892/)\n",
-    "\n",
-    "---\n",
-    "\n",
-    "There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of **non-empty** words from the dictionary, where words are **sorted lexicographically by the rules of this new language**. Derive the order of letters in this language.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- You may assume all letters are in lowercase.\n",
-    "- The dictionary is invalid, if string a is prefix of string b and b is appear before a.\n",
-    "- If the order is invalid, return an empty string.\n",
-    "- There may be multiple valid order of letters, return the smallest in normal lexicographical order.\n",
-    "- The letters in **one** string are of the same rank by default and are sorted in Human dictionary order."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem at hand involves determining the order of letters in a new alien language that uses the Latin alphabet. However, the order of letters in this alien language is unknown. To solve this problem, we are given a list of non-empty words from the dictionary, where the words are sorted lexicographically based on the rules of the alien language. The goal is to derive the correct order of letters in this new language.\n",
-    "\n",
-    "Here's a more detailed explanation of the problem:\n",
-    "\n",
-    "1. The alphabet: The new alien language uses the Latin alphabet, which consists of lowercase letters.\n",
-    "\n",
-    "2. Dictionary: We are provided with a list of non-empty words. These words are sorted in lexicographical order based on the rules of the alien language. The order of letters in the words reflects the correct order in the new language.\n",
-    "\n",
-    "3. Invalid order: The problem specifies that the dictionary is considered invalid if there exists a situation where one string 'a' is a prefix of another string 'b,' and 'b' appears before 'a' in the dictionary. This condition ensures that there are no inconsistencies in the order of letters.\n",
-    "\n",
-    "4. Multiple valid orders: It's possible that there are multiple valid orders of letters that satisfy the provided dictionary. However, we are instructed to return the smallest valid order in normal lexicographical order.\n",
-    "\n",
-    "To solve this problem, you need to analyze the given list of words and determine the correct order of letters in the alien language while adhering to the specified constraints. You should return the order as a string in lexicographical order if it's valid, and an empty string if the order is invalid.\n",
-    "\n",
-    "The key to solving this problem is to construct a directed graph of letter relationships based on the order information provided by the words in the dictionary. Then, perform a topological sort on this graph to derive the order of letters, ensuring that the order is consistent and valid according to the given constraints.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from collections import defaultdict, deque\n",
-    "\n",
-    "def alienOrder(words):\n",
-    "    # Create an adjacency list to represent the graph\n",
-    "    graph = defaultdict(list)\n",
-    "    \n",
-    "    # Create a dictionary to store the in-degrees of each letter\n",
-    "    in_degree = {}\n",
-    "    \n",
-    "    # Initialize in-degrees to 0 for all letters\n",
-    "    for word in words:\n",
-    "        for char in word:\n",
-    "            if char not in in_degree:\n",
-    "                in_degree[char] = 0\n",
-    "    \n",
-    "    # Build the graph and update in-degrees\n",
-    "    for i in range(1, len(words)):\n",
-    "        word1, word2 = words[i-1], words[i]\n",
-    "        min_length = min(len(word1), len(word2))\n",
-    "        \n",
-    "        # Compare characters in the two words\n",
-    "        j = 0\n",
-    "        while j < min_length and word1[j] == word2[j]:\n",
-    "            j += 1\n",
-    "        \n",
-    "        if j < min_length:\n",
-    "            # If word1[j] is lexicographically before word2[j], add an edge\n",
-    "            graph[word1[j]].append(word2[j])\n",
-    "            in_degree[word2[j]] += 1\n",
-    "            \n",
-    "            # Break the loop to avoid further comparisons\n",
-    "            break\n",
-    "    \n",
-    "    # Perform topological sorting using Kahn's algorithm\n",
-    "    result = []\n",
-    "    queue = deque([char for char in in_degree if in_degree[char] == 0])\n",
-    "    \n",
-    "    while queue:\n",
-    "        char = queue.popleft()\n",
-    "        result.append(char)\n",
-    "        \n",
-    "        for neighbor in graph[char]:\n",
-    "            in_degree[neighbor] -= 1\n",
-    "            if in_degree[neighbor] == 0:\n",
-    "                queue.append(neighbor)\n",
-    "    \n",
-    "    # Check if there is a valid order\n",
-    "    if len(result) < len(in_degree):\n",
-    "        return \"\"\n",
-    "    \n",
-    "    return \"\".join(result)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code is designed to determine the order of letters in an unknown alien language that uses the Latin alphabet. It takes a list of non-empty words from a dictionary as input, where the words are sorted lexicographically based on the rules of this alien language.\n",
-    "\n",
-    "The code follows these main steps:\n",
-    "\n",
-    "1. Create a data structure to represent the graph of letters and their relationships in the alien language. It uses a defaultdict to store a list of letters that come after each letter. Additionally, it uses a dictionary called `in_degree` to keep track of the in-degrees (the number of letters that precede a letter) for each letter.\n",
-    "\n",
-    "2. Initialize the in-degrees of all letters to 0. This is done by iterating through all the words and characters in the words, adding each character to the `in_degree` dictionary with an initial in-degree of 0.\n",
-    "\n",
-    "3. Build the graph by comparing adjacent words in the dictionary. For each pair of adjacent words, the code finds the first differing character between the two words. If such a character exists, it means there's an order relationship between the letters represented by these characters. The code updates the graph and in-degrees accordingly.\n",
-    "\n",
-    "4. After constructing the graph, the code performs a topological sorting of the letters using Kahn's algorithm. It starts by initializing an empty result list and a queue containing letters with in-degrees of 0. The algorithm repeatedly removes a letter with an in-degree of 0 from the queue, adds it to the result list, and updates the in-degrees of its neighbors. This process continues until the queue is empty.\n",
-    "\n",
-    "5. Finally, the code checks if the topological sorting was successful by comparing the length of the result list with the number of unique letters in the input. If the lengths differ, it means there's a cycle in the graph, and the order is invalid. In such a case, an empty string is returned. Otherwise, the result list is joined together to form the smallest order of letters in normal lexicographical order, and it is returned as the output.\n",
-    "\n",
-    "The code provides a way to determine the order of letters in the alien language while handling various edge cases, including checking for invalid order conditions."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "355f5bfd-94e1-4c5b-9914-cc20775f4160",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "wrtef\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1\n",
-    "words1 = [\"wrt\", \"wrf\", \"er\", \"ett\", \"rftt\"]\n",
-    "print(alienOrder(words1))  # Output: \"wertf\""
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "zx\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2\n",
-    "words2 = [\"z\", \"x\"]\n",
-    "print(alienOrder(words2))  # Output: \"zx\""
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code for determining the order of letters in an alien language.\n",
-    "\n",
-    "Time Complexity:\n",
-    "1. Building the graph: The code iterates through the list of words and compares adjacent words. In the worst case, where all words have the same prefix, it takes O(N) time to build the graph, where N is the total number of characters in all the words.\n",
-    "2. Topological sorting: Performing a topological sort on the graph takes O(V + E) time, where V is the number of unique letters (vertices) and E is the number of relationships between letters (edges) in the graph.\n",
-    "\n",
-    "Overall, the time complexity is O(N + V + E), where N is the total number of characters in the words, V is the number of unique letters, and E is the number of order relationships between letters.\n",
-    "\n",
-    "Space Complexity:\n",
-    "1. Graph and In-degrees: The code uses data structures to represent the graph and in-degrees. The space complexity for these data structures is O(V + E), where V is the number of unique letters, and E is the number of order relationships between letters in the words.\n",
-    "2. Result List: The result list stores the order of letters, which can have a maximum size of V, where V is the number of unique letters.\n",
-    "3. Queue: The space used by the queue during topological sorting is also O(V).\n",
-    "\n",
-    "Overall, the space complexity is O(V + E) due to the data structures used for graph representation and the space needed for storing the result and the queue.\n",
-    "\n",
-    "In the worst case, where there are many unique letters and many order relationships, the space complexity is dominated by the number of unique letters and their relationships.\n",
-    "\n",
-    "In summary, the time complexity of the code is O(N + V + E), and the space complexity is O(V + E). The actual performance will depend on the specific input data, such as the number of unique letters and the relationships between them in the alien language."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Multiple Valid Orders**: Extend the problem to handle cases where there are multiple valid orders of letters in the alien language. Modify the code to return all valid orders instead of just one. Be mindful of performance.\n",
-    "\n",
-    "2. **Detect Invalid Dictionary**: Given a dictionary of words, write a function to detect whether the dictionary is valid or not based on the constraints mentioned in the problem statement."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb b/docs/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb
deleted file mode 100644
index 9539363..0000000
--- a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/198. House Robber.ipynb	
+++ /dev/null
@@ -1,212 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# House Robber\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "---\n",
-    "You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and **it will automatically contact the police if two adjacent houses were broken into on the same night.**\n",
-    "\n",
-    "Given an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight **without alerting the police**.*\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= nums.length <= 100`\n",
-    "- `0 <= nums[i] <= 400`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The problem is a classic dynamic programming challenge known as the \"House Robber\" problem. The scenario is that you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, but the constraint is that adjacent houses have security systems connected. If two adjacent houses are broken into on the same night, the security systems will automatically contact the police.\n",
-    "\n",
-    "The goal is to determine the maximum amount of money you can rob tonight without alerting the police. You need to find a strategy to maximize your earnings while avoiding robbing two adjacent houses.\n",
-    "\n",
-    "The input to the problem is an array `nums`, where `nums[i]` represents the amount of money in the `i`-th house. The task is to return the maximum amount of money that can be robbed without triggering the security system.\n",
-    "\n",
-    "For example:\n",
-    "```\n",
-    "Input: nums = [1,2,3,1]\n",
-    "Output: 4\n",
-    "Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).\n",
-    "Total amount you can rob = 1 + 3 = 4.\n",
-    "\n",
-    "Input: nums = [2,7,9,3,1]\n",
-    "Output: 12\n",
-    "Explanation: Rob house 1 (money = 2), rob house 3 (money = 9), and rob house 5 (money = 1).\n",
-    "Total amount you can rob = 2 + 9 + 1 = 12.\n",
-    "```\n",
-    "\n",
-    "The challenge involves designing an algorithm to efficiently solve this problem and find the optimal strategy for robbing houses to maximize the stolen money while adhering to the constraint of not robbing adjacent houses. The provided solution utilizes dynamic programming to achieve this.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def rob(self, nums: List[int]) -> int:\n",
-    "        # Initialize variables to keep track of the maximum amount of money robbed at the previous and current houses\n",
-    "        prev, curr = 0, 0\n",
-    "\n",
-    "        # Iterate through the houses\n",
-    "        for n in nums:\n",
-    "            # Calculate the maximum amount of money that can be robbed at the current house\n",
-    "            # It is the maximum of either robbing the current house and the money robbed at the house before the previous one (prev),\n",
-    "            # or skipping the current house and taking the maximum amount from the previous house (curr)\n",
-    "            temp = max(n + prev, curr)\n",
-    "\n",
-    "            # Update the variables for the next iteration\n",
-    "            prev, curr = curr, temp\n",
-    "\n",
-    "        # The final result is the maximum amount of money that can be robbed at the last house\n",
-    "        return curr"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code is a Python implementation of the \"House Robber\" problem using a dynamic programming approach. It's part of a class `Solution` and includes a method `rob` that takes a list of integers `nums` as input and returns the maximum amount of money that can be robbed without alerting the police.\n",
-    "\n",
-    "The key idea of the algorithm is to maintain two variables, `prev` and `curr`, which represent the maximum amount of money that can be robbed up to the previous house and the current house, respectively. The algorithm iterates through the houses, updating these variables based on the maximum amount that can be robbed at the current house, considering the constraint of not robbing adjacent houses.\n",
-    "\n",
-    "The loop calculates a temporary variable `temp` that represents the maximum amount of money that can be robbed at the current house. It considers two scenarios: either robbing the current house and adding the money robbed at the house before the previous one (`n + prev`), or skipping the current house and taking the maximum amount from the previous house (`curr`). The maximum of these two scenarios is assigned to `temp`.\n",
-    "\n",
-    "The `prev` and `curr` variables are then updated for the next iteration. `prev` is set to the previous value of `curr`, and `curr` is set to the calculated `temp`.\n",
-    "\n",
-    "The final result is the value stored in the `curr` variable, representing the maximum amount of money that can be robbed at the last house. This value is returned as the result of the `rob` method.\n",
-    "\n",
-    "The provided test cases at the end demonstrate the usage of the `rob` method with different input arrays."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "sol = Solution()\n",
-    "\n",
-    "nums1 = [1, 2, 3, 1]\n",
-    "print(sol.rob(nums1))  # Output: 4"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "12\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [2, 7, 9, 3, 1]\n",
-    "print(sol.rob(nums2))  # Output: 12"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code.\n",
-    "\n",
-    "### Time Complexity:\n",
-    "\n",
-    "The time complexity of the code is O(n), where n is the number of houses. The algorithm iterates through the array once, and in each iteration, it performs constant time operations. The loop runs for each house, and the number of operations inside the loop is independent of the input size. Therefore, the overall time complexity is linear, O(n).\n",
-    "\n",
-    "### Space Complexity:\n",
-    "\n",
-    "The space complexity is O(1), constant space. The algorithm uses only a constant amount of extra space regardless of the input size. The variables `prev`, `curr`, and `temp` are the only additional variables used, and they do not depend on the size of the input array. Thus, the space complexity is constant, O(1).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(n)\n",
-    "- Space Complexity: O(1)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Variation with Maximum Number of Houses to Rob:** Modify the problem to include an additional constraint: you are allowed to rob at most 'k' houses without triggering the alarm. Find the maximum amount you can rob under this new constraint.\n",
-    "\n",
-    "2. **Robbing in a Circular Street:** Extend the problem to a circular street where the first and last houses are adjacent. You cannot rob both the first and last houses simultaneously. Find the maximum amount you can rob in this circular setting.\n",
-    "\n",
-    "\n",
-    "**Link to Problem:** [To see the House Robber problem on LeetCode, click here!](https://leetcode.com/problems/house-robber/description/)\n"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb b/docs/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb
deleted file mode 100644
index d210017..0000000
--- a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/213. House Robber II.ipynb	
+++ /dev/null
@@ -1,243 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# House Robber II\n",
-    "**Difficulty:** Medium\n",
-    "\n",
-    "---\n",
-    "You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle**. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatically contact the police if two adjacent houses were broken into on the same night**.\n",
-    "\n",
-    "Given an integer array `nums` representing the amount of money of each house, return *the maximum amount of money you can rob tonight without alerting the police*.\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= nums.length <= 100`\n",
-    "- `0 <= nums[i] <= 1000`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "Certainly! The problem statement describes a scenario where you are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. However, there is a security system in place: adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.\n",
-    "\n",
-    "The twist in this problem is that the houses are arranged in a circle. That means the first house is the neighbor of the last one. So, robbing the first house has implications for the last house, and vice versa.\n",
-    "\n",
-    "The goal is to find the maximum amount of money you can rob tonight without alerting the police. You need to implement a function that takes an integer array `nums` representing the amount of money in each house and returns the maximum amount of money that can be robbed without triggering the security system.\n",
-    "\n",
-    "Here are a few examples to illustrate the problem:\n",
-    "\n",
-    "1. **Example 1:**\n",
-    "   ```python\n",
-    "   Input: nums = [2, 3, 2]\n",
-    "   Output: 3\n",
-    "   Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2) because they are adjacent houses. The optimal strategy is to rob house 2 (money = 3).\n",
-    "   ```\n",
-    "\n",
-    "2. **Example 2:**\n",
-    "   ```python\n",
-    "   Input: nums = [1, 2, 3, 1]\n",
-    "   Output: 4\n",
-    "   Explanation: Robbing house 1 (money = 1) and then robbing house 3 (money = 3) results in a total amount of 4. Robbing house 2 is skipped to avoid alerting the police.\n",
-    "   ```\n",
-    "\n",
-    "3. **Example 3:**\n",
-    "   ```python\n",
-    "   Input: nums = [1, 2, 3]\n",
-    "   Output: 3\n",
-    "   Explanation: Since the houses are in a circle, you can choose either house 1, 2, or 3. The optimal strategy is to rob house 3 for a total amount of 3.\n",
-    "   ```\n",
-    "\n",
-    "The constraints for the problem are that the length of the `nums` array is between 1 and 100, and the amount of money in each house (`nums[i]`) is between 0 and 1000.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "from typing import List\n",
-    "\n",
-    "class Solution:\n",
-    "    def rob(self, nums: List[int]) -> int:\n",
-    "        def simple_rob(nums):\n",
-    "            # Helper function for basic house robbery problem\n",
-    "            prev, curr = 0, 0\n",
-    "            for num in nums:\n",
-    "                # Calculate the maximum amount of money that can be robbed\n",
-    "                # without alerting the police for each house\n",
-    "                prev, curr = curr, max(prev + num, curr)\n",
-    "            return curr\n",
-    "\n",
-    "        # Check the base cases where the length of nums is 1 or 2\n",
-    "        if len(nums) == 1:\n",
-    "            return nums[0]\n",
-    "        elif len(nums) == 2:\n",
-    "            return max(nums[0], nums[1])\n",
-    "\n",
-    "        # Case 1: First house is robbed, last house is not\n",
-    "        case1 = simple_rob(nums[:-1])\n",
-    "\n",
-    "        # Case 2: First house is not robbed, last house is\n",
-    "        case2 = simple_rob(nums[1:])\n",
-    "\n",
-    "        # Maximum of the two cases\n",
-    "        return max(case1, case2)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The provided code defines a class `Solution` with a method `rob`, which aims to determine the maximum amount of money a professional robber can steal from houses arranged in a circle without alerting the police. Each house contains a certain amount of money, and adjacent houses have a security system that triggers if both are robbed on the same night.\n",
-    "\n",
-    "The code uses dynamic programming to solve the problem efficiently. It contains a helper function `simple_rob` that computes the maximum amount of money that can be robbed from a linear arrangement of houses. The main method `rob` handles the circular arrangement by considering two cases: robbing the first house and not robbing the last, and not robbing the first house and robbing the last. The result is the maximum of these two cases.\n",
-    "\n",
-    "The class is instantiated as `solution`, and the `rob` method is applied to three different scenarios (test cases) to demonstrate its functionality. The final output represents the maximum amount of money the robber can steal without triggering the security system."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "\n",
-    "# Create an instance of the Solution class\n",
-    "solution = Solution()\n",
-    "\n",
-    "nums1 = [2, 3, 2]\n",
-    "print(solution.rob(nums1))  # Output: 3"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "4\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums2 = [1, 2, 3, 1]\n",
-    "print(solution.rob(nums2))  # Output: 4"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "id": "e6e1554f-ae77-410c-8af2-e59e5428166c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "nums3 = [1, 2, 3]\n",
-    "print(solution.rob(nums3))  # Output: 3"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Let's analyze the time and space complexity of the provided code:\n",
-    "\n",
-    "### Time Complexity:\n",
-    "The time complexity is primarily determined by the `simple_rob` helper function, which has a time complexity of O(N), where N is the number of houses in the input array. The main `rob` function calls `simple_rob` twice, once for the case of robbing the first house and not robbing the last, and once for the case of not robbing the first house and robbing the last. Therefore, the overall time complexity is O(N).\n",
-    "\n",
-    "### Space Complexity:\n",
-    "The space complexity is O(1) because the space used by the algorithm is constant, regardless of the size of the input array. The only variables used are `prev` and `curr` in the `simple_rob` function, which represent the previous and current maximum amounts of money that can be robbed without alerting the police. These variables are updated iteratively, and no additional data structures are used that scale with the input size. Therefore, the space complexity is constant, or O(1).\n",
-    "\n",
-    "In summary:\n",
-    "- Time Complexity: O(N)\n",
-    "- Space Complexity: O(1)"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Optimization Challenge:** Optimize the space complexity of the solution. Can you solve the problem with O(1) space complexity without sacrificing the time complexity?\n",
-    "\n",
-    "2. **Circular Robbery Variations:** Consider variations of the circular house robbery problem, such as allowing the robber to skip a certain number of houses or restricting the number of consecutive houses that can be robbed. Modify the solution to accommodate these variations.\n",
-    "\n",
-    "**Link to Problem:** [To see the House Robber II problem on LeetCode, click here!](https://leetcode.com/problems/house-robber-ii/)"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb b/docs/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb
deleted file mode 100644
index 32c5da3..0000000
--- a/docs/_build/jupyter_execute/13. One-D Dynamic Programming/70. Climbing Stairs.ipynb	
+++ /dev/null
@@ -1,204 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "markdown",
-   "id": "d6161252-e815-48d5-a2a3-5444c12e3b49",
-   "metadata": {},
-   "source": [
-    "# 70. Climbing Stairs\n",
-    "\n",
-    "**Difficulty:** Easy\n",
-    "\n",
-    "**Link to Problem:** [To see the Climbing Stairs problem on LeetCode, click here!](https://leetcode.com/problems/climbing-stairs/)\n",
-    "\n",
-    "---\n",
-    "You are climbing a staircase. It takes `n` steps to reach the top.\n",
-    "\n",
-    "Each time you can either climb `1` or `2` steps. In how many distinct ways can you climb to the top?\n",
-    "\n",
-    "**Constraints:**\n",
-    "- `1 <= n <= 45`"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "fe9e71ae-2099-4eb9-b7a1-ec795ce92c76",
-   "metadata": {},
-   "source": [
-    "## Probelm Explanation:\n",
-    "\n",
-    "The \"Climbing Stairs\" problem is a classic algorithmic problem that asks you to find the number of distinct ways to climb a staircase with a given number of steps. Here's the problem statement:\n",
-    "\n",
-    "You are given a staircase with 'n' steps. Each time you can either climb 1 step or 2 steps. You need to find out how many distinct ways there are to reach the top of the staircase.\n",
-    "\n",
-    "For example, if 'n' is 2, there are two ways to climb to the top:\n",
-    "\n",
-    "1. Climbing two steps at once.\n",
-    "2. Climbing one step, and then another step.\n",
-    "\n",
-    "If 'n' is 3, there are three ways:\n",
-    "\n",
-    "1. Climbing one step, then one step, and finally one step.\n",
-    "2. Climbing one step, then two steps.\n",
-    "3. Climbing two steps, then one step.\n",
-    "\n",
-    "The problem essentially asks you to find a solution that counts the possible combinations of 1-step and 2-step climbs that can be taken to reach the top of the staircase. It's a classic example of a dynamic programming problem where you can break it down into smaller subproblems and build a solution incrementally, as shown in the code I provided earlier.\n",
-    "\n",
-    "## Solution:\n",
-    "Here's a Python function to implement this algorithm:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "id": "aabf7095-07dc-4ab7-876c-ec7213ed0de5",
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "class Solution:\n",
-    "    def climbStairs(self, n: int) -> int:\n",
-    "        # If there are 1 or 2 steps, there are exactly n ways to reach the top.\n",
-    "        if n <= 2:\n",
-    "            return n\n",
-    "\n",
-    "        # Create an array to store the number of ways to reach each step.\n",
-    "        dp = [0] * (n + 1)\n",
-    "\n",
-    "        # There is one way to reach the first step (base case).\n",
-    "        dp[1] = 1\n",
-    "\n",
-    "        # There are two ways to reach the second step (base case).\n",
-    "        dp[2] = 2\n",
-    "\n",
-    "        # Calculate the number of ways to reach each step from the previous steps.\n",
-    "        for i in range(3, n + 1):\n",
-    "            # The number of ways to reach step 'i' is the sum of the ways to reach\n",
-    "            # the previous two steps, as you can take 1 or 2 steps at a time.\n",
-    "            dp[i] = dp[i - 1] + dp[i - 2]\n",
-    "\n",
-    "        # The result is the number of ways to reach the top, which is stored in dp[n].\n",
-    "        return dp[n]"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "ece39324-cd9e-47d7-8677-a001878494d9",
-   "metadata": {},
-   "source": [
-    "## Explanation:\n",
-    "\n",
-    "The code defines a class `Solution` with a method `climbStairs` that takes an integer `n` as input and returns the number of distinct ways to climb a staircase with `n` steps.\n",
-    "\n",
-    "1. If `n` is 1 or 2, the function returns `n` directly because there are only 1 or 2 distinct ways to reach the top in those cases.\n",
-    "\n",
-    "2. For `n` greater than 2, the code uses dynamic programming to calculate the number of ways to reach each step. It creates an array `dp` of length `n + 1` to store these values.\n",
-    "\n",
-    "3. The `dp[1]` and `dp[2]` are initialized to 1 and 2, respectively. This is because there is only one way to reach the first step (by taking 1 step), and there are two ways to reach the second step (by taking 2 steps or two 1-step climbs).\n",
-    "\n",
-    "4. The code then uses a loop to fill in the `dp` array for steps 3 and above. For each step `i` from 3 to `n`, it calculates the number of ways to reach that step by adding the number of ways to reach the previous two steps, as you can either take 1 step or 2 steps at a time.\n",
-    "\n",
-    "5. Finally, the function returns the value stored in `dp[n]`, which represents the total number of distinct ways to climb the staircase with `n` steps."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "a54ea5b7-c53f-46c0-a44f-ef769ac68244",
-   "metadata": {},
-   "source": [
-    "## Test cases:\n",
-    "\n",
-    "Here's how you can use this solution:"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "id": "f12c5a63-b811-4be7-83c2-34ee396b546c",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 1 - Input: n = 2, Output: 2\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 1:\n",
-    "n = 2\n",
-    "solution = Solution()\n",
-    "print(f\"Example 1 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 2"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "id": "364aa061-a452-45eb-96db-36f7dbdbdcb3",
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Example 2 - Input: n = 3, Output: 3\n"
-     ]
-    }
-   ],
-   "source": [
-    "# Example 2:\n",
-    "n = 3\n",
-    "print(f\"Example 2 - Input: n = {n}, Output: {solution.climbStairs(n)}\")  # Output should be 3\n"
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "7d9dd448-c5f5-4192-8aa5-7c70ec7f42e2",
-   "metadata": {},
-   "source": [
-    "## Time and Space Complexity Analysis\n",
-    "\n",
-    "Time Complexity:\n",
-    "The time complexity of the solution is O(n) because we use a single for loop that iterates from 3 to n to fill the `dp` array. In each iteration, we perform constant time operations (addition and assignment). Therefore, the time complexity is linear with respect to the input value `n`.\n",
-    "\n",
-    "Space Complexity:\n",
-    "The space complexity of the solution is O(n) as well. We use an array `dp` of length `n + 1` to store the number of ways to reach each step. The size of this array is directly proportional to the input value `n`, which makes the space complexity linear in terms of `n`. The rest of the variables used in the function (e.g., `i`) occupy constant space and do not contribute significantly to the overall space complexity.\n",
-    "\n",
-    "In summary, the time complexity is O(n), and the space complexity is O(n) for this dynamic programming solution to the \"Climbing Stairs\" problem."
-   ]
-  },
-  {
-   "cell_type": "markdown",
-   "id": "037b210a-555b-4da3-8130-b74d1e4f33f6",
-   "metadata": {},
-   "source": [
-    "## Challenging Exercises:\n",
-    "\n",
-    "1. **Generalized Step Sizes**: Instead of being limited to 1 step or 2 steps, consider a scenario where you can take steps of sizes `[1, 2, 3]`. Implement a function that calculates the number of ways to climb the staircase with these different step sizes.\n",
-    "\n",
-    "2. **Minimize Steps**: Given an integer `n`, find the minimum number of steps required to reach the top of the staircase. Return both the minimum number of steps and the specific sequence of steps taken."
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python (Pyodide)",
-   "language": "python",
-   "name": "python"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 5
-}
\ No newline at end of file
diff --git a/docs/_build/jupyter_execute/Book.ipynb b/docs/_build/jupyter_execute/Book.ipynb
deleted file mode 100644
index 6c891d7..0000000
--- a/docs/_build/jupyter_execute/Book.ipynb
+++ /dev/null
@@ -1,914 +0,0 @@
-{
- "cells": [
-  {
-   "cell_type": "code",
-   "execution_count": 1,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pip in /usr/local/python/3.10.8/lib/python3.10/site-packages (23.3.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: jupyter-book in /usr/local/python/3.10.8/lib/python3.10/site-packages (0.15.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: click<9,>=7.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (8.1.7)\r\n",
-      "Requirement already satisfied: docutils<0.19,>=0.15 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.18.1)\r\n",
-      "Requirement already satisfied: Jinja2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (3.1.2)\r\n",
-      "Requirement already satisfied: jsonschema<5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (4.19.1)\r\n",
-      "Requirement already satisfied: linkify-it-py~=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.0.2)\r\n",
-      "Requirement already satisfied: myst-nb~=0.17.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.17.2)\r\n",
-      "Requirement already satisfied: pyyaml in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-book) (6.0.1)\r\n",
-      "Requirement already satisfied: sphinx<6,>=4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (5.0.2)\r\n",
-      "Requirement already satisfied: sphinx-comments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.0.3)\r\n",
-      "Requirement already satisfied: sphinx-copybutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\r\n",
-      "Requirement already satisfied: sphinx-external-toc~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.1)\r\n",
-      "Requirement already satisfied: sphinx-jupyterbook-latex~=0.5.2 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.5.2)\r\n",
-      "Requirement already satisfied: sphinx-design~=0.3.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.0)\r\n",
-      "Requirement already satisfied: sphinx-thebe~=0.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.2.1)\r\n",
-      "Requirement already satisfied: sphinx-book-theme~=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (1.0.1)\r\n",
-      "Requirement already satisfied: sphinx_togglebutton in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.3.2)\r\n",
-      "Requirement already satisfied: sphinxcontrib-bibtex<=2.5.0,>=2.2.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (2.5.0)\r\n",
-      "Requirement already satisfied: sphinx-multitoc-numbering~=0.1.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-book) (0.1.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: attrs>=22.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (23.1.0)\r\n",
-      "Requirement already satisfied: jsonschema-specifications>=2023.03.6 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (2023.7.1)\r\n",
-      "Requirement already satisfied: referencing>=0.28.4 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.30.2)\r\n",
-      "Requirement already satisfied: rpds-py>=0.7.1 in /home/codespace/.local/lib/python3.10/site-packages (from jsonschema<5->jupyter-book) (0.10.6)\r\n",
-      "Requirement already satisfied: uc-micro-py in /usr/local/python/3.10.8/lib/python3.10/site-packages (from linkify-it-py~=2.0.0->jupyter-book) (1.0.2)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: importlib_metadata in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.8.0)\r\n",
-      "Requirement already satisfied: ipython in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (8.16.1)\r\n",
-      "Requirement already satisfied: jupyter-cache<0.7,>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.6.1)\r\n",
-      "Requirement already satisfied: nbclient in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.7.4)\r\n",
-      "Requirement already satisfied: myst-parser~=0.18.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (0.18.1)\r\n",
-      "Requirement already satisfied: nbformat~=5.0 in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (5.9.2)\r\n",
-      "Requirement already satisfied: typing-extensions in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (4.8.0)\r\n",
-      "Requirement already satisfied: ipykernel in /home/codespace/.local/lib/python3.10/site-packages (from myst-nb~=0.17.1->jupyter-book) (6.25.2)\r\n",
-      "Requirement already satisfied: sphinxcontrib-applehelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.7)\r\n",
-      "Requirement already satisfied: sphinxcontrib-devhelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.5)\r\n",
-      "Requirement already satisfied: sphinxcontrib-jsmath in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.1)\r\n",
-      "Requirement already satisfied: sphinxcontrib-htmlhelp>=2.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.0.4)\r\n",
-      "Requirement already satisfied: sphinxcontrib-serializinghtml>=1.1.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.1.9)\r\n",
-      "Requirement already satisfied: sphinxcontrib-qthelp in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.0.6)\r\n",
-      "Requirement already satisfied: Pygments>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.16.1)\r\n",
-      "Requirement already satisfied: snowballstemmer>=1.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.2.0)\r\n",
-      "Requirement already satisfied: babel>=1.3 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.13.0)\r\n",
-      "Requirement already satisfied: alabaster<0.8,>=0.7 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (0.7.13)\r\n",
-      "Requirement already satisfied: imagesize in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (1.4.1)\r\n",
-      "Requirement already satisfied: requests>=2.5.0 in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (2.31.0)\r\n",
-      "Requirement already satisfied: packaging in /home/codespace/.local/lib/python3.10/site-packages (from sphinx<6,>=4->jupyter-book) (23.2)\r\n",
-      "Requirement already satisfied: MarkupSafe>=2.0 in /home/codespace/.local/lib/python3.10/site-packages (from Jinja2->jupyter-book) (2.1.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pydata-sphinx-theme>=0.13.3 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx-book-theme~=1.0.0->jupyter-book) (0.14.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: pybtex>=0.24 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (0.24.0)\r\n",
-      "Requirement already satisfied: pybtex-docutils>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.0.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: setuptools in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (68.0.0)\r\n",
-      "Requirement already satisfied: wheel in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sphinx_togglebutton->jupyter-book) (0.41.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: sqlalchemy<3,>=1.3.12 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (2.0.23)\r\n",
-      "Requirement already satisfied: tabulate in /usr/local/python/3.10.8/lib/python3.10/site-packages (from jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (0.9.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: markdown-it-py<3.0.0,>=1.0.0 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (2.2.0)\r\n",
-      "Requirement already satisfied: mdit-py-plugins~=0.3.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.3.5)\r\n",
-      "Requirement already satisfied: jupyter-client>=6.1.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (8.4.0)\r\n",
-      "Requirement already satisfied: jupyter-core!=5.0.*,>=4.12 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.4.0)\r\n",
-      "Requirement already satisfied: traitlets>=5.3 in /home/codespace/.local/lib/python3.10/site-packages (from nbclient->myst-nb~=0.17.1->jupyter-book) (5.11.2)\r\n",
-      "Requirement already satisfied: fastjsonschema in /home/codespace/.local/lib/python3.10/site-packages (from nbformat~=5.0->myst-nb~=0.17.1->jupyter-book) (2.18.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: latexcodec>=1.0.4 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (2.0.1)\r\n",
-      "Requirement already satisfied: six in /home/codespace/.local/lib/python3.10/site-packages (from pybtex>=0.24->sphinxcontrib-bibtex<=2.5.0,>=2.2.0->jupyter-book) (1.16.0)\r\n",
-      "Requirement already satisfied: beautifulsoup4 in /home/codespace/.local/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (4.12.2)\r\n",
-      "Requirement already satisfied: accessible-pygments in /usr/local/python/3.10.8/lib/python3.10/site-packages (from pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (0.0.4)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: charset-normalizer<4,>=2 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.3.0)\r\n",
-      "Requirement already satisfied: idna<4,>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (3.4)\r\n",
-      "Requirement already satisfied: urllib3<3,>=1.21.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (1.26.18)\r\n",
-      "Requirement already satisfied: certifi>=2017.4.17 in /home/codespace/.local/lib/python3.10/site-packages (from requests>=2.5.0->sphinx<6,>=4->jupyter-book) (2023.7.22)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: zipp>=0.5 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from importlib_metadata->myst-nb~=0.17.1->jupyter-book) (3.17.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: comm>=0.1.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.4)\r\n",
-      "Requirement already satisfied: debugpy>=1.6.5 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.8.0)\r\n",
-      "Requirement already satisfied: matplotlib-inline>=0.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (0.1.6)\r\n",
-      "Requirement already satisfied: nest-asyncio in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (1.5.8)\r\n",
-      "Requirement already satisfied: psutil in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (5.9.6)\r\n",
-      "Requirement already satisfied: pyzmq>=20 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (25.1.1)\r\n",
-      "Requirement already satisfied: tornado>=6.1 in /home/codespace/.local/lib/python3.10/site-packages (from ipykernel->myst-nb~=0.17.1->jupyter-book) (6.3.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: backcall in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.2.0)\r\n",
-      "Requirement already satisfied: decorator in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (5.1.1)\r\n",
-      "Requirement already satisfied: jedi>=0.16 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.19.1)\r\n",
-      "Requirement already satisfied: pickleshare in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.7.5)\r\n",
-      "Requirement already satisfied: prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (3.0.39)\r\n",
-      "Requirement already satisfied: stack-data in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (0.6.3)\r\n",
-      "Requirement already satisfied: exceptiongroup in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (1.1.3)\r\n",
-      "Requirement already satisfied: pexpect>4.3 in /home/codespace/.local/lib/python3.10/site-packages (from ipython->myst-nb~=0.17.1->jupyter-book) (4.8.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: parso<0.9.0,>=0.8.3 in /home/codespace/.local/lib/python3.10/site-packages (from jedi>=0.16->ipython->myst-nb~=0.17.1->jupyter-book) (0.8.3)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: python-dateutil>=2.8.2 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-client>=6.1.12->nbclient->myst-nb~=0.17.1->jupyter-book) (2.8.2)\r\n",
-      "Requirement already satisfied: platformdirs>=2.5 in /home/codespace/.local/lib/python3.10/site-packages (from jupyter-core!=5.0.*,>=4.12->nbclient->myst-nb~=0.17.1->jupyter-book) (3.11.0)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: mdurl~=0.1 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from markdown-it-py<3.0.0,>=1.0.0->myst-parser~=0.18.0->myst-nb~=0.17.1->jupyter-book) (0.1.2)\r\n",
-      "Requirement already satisfied: ptyprocess>=0.5 in /home/codespace/.local/lib/python3.10/site-packages (from pexpect>4.3->ipython->myst-nb~=0.17.1->jupyter-book) (0.7.0)\r\n",
-      "Requirement already satisfied: wcwidth in /home/codespace/.local/lib/python3.10/site-packages (from prompt-toolkit!=3.0.37,<3.1.0,>=3.0.30->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.8)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: greenlet!=0.4.17 in /usr/local/python/3.10.8/lib/python3.10/site-packages (from sqlalchemy<3,>=1.3.12->jupyter-cache<0.7,>=0.5->myst-nb~=0.17.1->jupyter-book) (3.0.1)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: soupsieve>1.2 in /home/codespace/.local/lib/python3.10/site-packages (from beautifulsoup4->pydata-sphinx-theme>=0.13.3->sphinx-book-theme~=1.0.0->jupyter-book) (2.5)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Requirement already satisfied: executing>=1.2.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.0.0)\r\n",
-      "Requirement already satisfied: asttokens>=2.1.0 in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (2.4.0)\r\n",
-      "Requirement already satisfied: pure-eval in /home/codespace/.local/lib/python3.10/site-packages (from stack-data->ipython->myst-nb~=0.17.1->jupyter-book) (0.2.2)\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Note: you may need to restart the kernel to use updated packages.\n"
-     ]
-    }
-   ],
-   "source": [
-    "!python -m pip install --upgrade pip\n",
-    "%pip install jupyter-book"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 2,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions\n"
-     ]
-    }
-   ],
-   "source": [
-    "%cd /workspaces/LeetCode-Solutions"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 3,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.python/current/bin/jupyter-book\", line 8, in <module>\r\n",
-      "    sys.exit(main())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1157, in __call__\r\n",
-      "    return self.main(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1078, in main\r\n",
-      "    rv = self.invoke(ctx)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1434, in invoke\r\n",
-      "    return ctx.invoke(self.callback, **ctx.params)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 783, in invoke\r\n",
-      "    return __callback(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/cli.py\", line 139, in migrate_toc\r\n",
-      "    toc = migrate_jupyter_book(Path(toc_file))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx_external_toc/tools.py\", line 327, in migrate_jupyter_book\r\n",
-      "    raise MalformedError(\"no top-level 'file' key found\")\r\n",
-      "sphinx_external_toc.parsing.MalformedError: no top-level 'file' key found\r\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc migrate /workspaces/LeetCode-Solutions/_toc.yml -o /workspaces/LeetCode-Solutions/_toc.yml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 4,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions\r\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/_config.yml\r\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/_build/html\r\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "[etoc] Changing master_doc to 'README'\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\r\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='auto', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\r\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/_build/.jupyter_cache\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\r\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 77 source files that are out of date\r\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 77 added, 0 changed, 0 removed\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  1%] \u001b[35m01. Array Hashing/1. Two Sum\u001b[39;49;00m                          \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.07 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  2%] \u001b[35m01. Array Hashing/128. Longest Consecutive Sequence\u001b[39;49;00m   \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.17 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  3%] \u001b[35m01. Array Hashing/217. Contains Duplicate\u001b[39;49;00m             \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.19 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[  5%] \u001b[35m01. Array Hashing/238. Product of Array Except Self\u001b[39;49;00m   \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 1.26 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  6%] \u001b[35m01. Array Hashing/242. Valid Anagram\u001b[39;49;00m                  \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 1.18 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  7%] \u001b[35m01. Array Hashing/347. Top K Frequent Elements\u001b[39;49;00m        \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.13 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[  9%] \u001b[35m01. Array Hashing/49. Group Anagrams\u001b[39;49;00m                  \r",
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 4.02 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 10%] \u001b[35m01. Array Hashing/659. Encode and Decode Strings\u001b[39;49;00m      \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 11%] \u001b[35m01. Array Hashing/README\u001b[39;49;00m                              \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 12%] \u001b[35m02. Two Pointers/11. Container With Most Water\u001b[39;49;00m        \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.26 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 14%] \u001b[35m02. Two Pointers/125. Valid Palindrome\u001b[39;49;00m                \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 1.07 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 15%] \u001b[35m02. Two Pointers/15. 3Sum\u001b[39;49;00m                             \r",
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 1.00 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 16%] \u001b[35m02. Two Pointers/README\u001b[39;49;00m                               \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 18%] \u001b[35m03. Sliding Window/121. Best Time to Buy and Sell Stock\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb: Executed notebook in 0.89 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 19%] \u001b[35m03. Sliding Window/3. Longest Substring Without Repeating Characters\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb: Executed notebook in 1.16 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 20%] \u001b[35m03. Sliding Window/424. Longest Repeating Character Replacement\u001b[39;49;00m\r",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/424. Longest Repeating Character Replacement.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 22%] \u001b[35m03. Sliding Window/76. Minimum Window Substring\u001b[39;49;00m       \r",
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/03. Sliding Window/76. Minimum Window Substring.ipynb: Executed notebook in 0.87 seconds [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 23%] \u001b[35m03. Sliding Window/README\u001b[39;49;00m                             \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 24%] \u001b[35m04. Stack/20. Valid Parentheses\u001b[39;49;00m                       \r",
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/04. Stack/20. Valid Parentheses.ipynb: Executed notebook in 4.02 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 25%] \u001b[35m04. Stack/README\u001b[39;49;00m                                      \r",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 27%] \u001b[35m05. Binary Search/153. Find Minimum in Rotated Sorted Array\u001b[39;49;00m\r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb: Executed notebook in 0.98 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 28%] \u001b[35m05. Binary Search/33. Search in Rotated Sorted Array\u001b[39;49;00m  \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/05. Binary Search/33. Search in Rotated Sorted Array.ipynb: Executed notebook in 1.05 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 29%] \u001b[35m05. Binary Search/README\u001b[39;49;00m                              \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 31%] \u001b[35m06. Linked List/141. Linked List Cycle\u001b[39;49;00m                \r",
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/06. Linked List/141. Linked List Cycle.ipynb: Executed notebook in 0.96 seconds [mystnb]\r\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[ 32%] \u001b[35m06. Linked List/143. Reorder List\u001b[39;49;00m                     \r"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "/workspaces/LeetCode-Solutions/06. Linked List/143. Reorder List.ipynb: Executing notebook using local CWD [mystnb]\r\n"
-     ]
-    },
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "^C\r\n",
-      "\r\n",
-      "\u001b[91mException occurred:\u001b[39;49;00m\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 512, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.cleanup_resources())\r\n",
-      "AttributeError: 'NoneType' object has no attribute 'cleanup_resources'\r\n",
-      "\u001b[91mThe full traceback has been saved in /tmp/sphinx-err-tl19fjln.log, if you want to report the issue to the developers.\u001b[39;49;00m\r\n",
-      "Please also report this if it was a user error, so that a better error message can be provided next time.\r\n",
-      "A bug report can be filed in the tracker at <https://github.com/sphinx-doc/sphinx/issues>. Thanks!\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py\", line 89, in wrapper\r\n",
-      "    self._ready.set_result(None)\r\n",
-      "asyncio.exceptions.InvalidStateError: invalid state\r\n",
-      "\r\n",
-      "During handling of the above exception, another exception occurred:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 505, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.shutdown_kernel(now=now))\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py\", line 189, in ensure_async\r\n",
-      "    result = await obj\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_client/manager.py\", line 92, in wrapper\r\n",
-      "    self._ready.set_exception(e)\r\n",
-      "asyncio.exceptions.InvalidStateError: invalid state\r\n",
-      "\r\n",
-      "During handling of the above exception, another exception occurred:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/sphinx.py\", line 171, in build_sphinx\r\n",
-      "    app.build(force_all, filenames)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/application.py\", line 329, in build\r\n",
-      "    self.builder.build_update()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 288, in build_update\r\n",
-      "    self.build(to_build,\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 302, in build\r\n",
-      "    updated_docnames = set(self.read())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 409, in read\r\n",
-      "    self._read_serial(docnames)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 430, in _read_serial\r\n",
-      "    self.read_doc(docname)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/builders/__init__.py\", line 483, in read_doc\r\n",
-      "    publisher.publish()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/core.py\", line 217, in publish\r\n",
-      "    self.document = self.reader.read(self.source, self.parser,\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/sphinx/io.py\", line 103, in read\r\n",
-      "    self.parse()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/docutils/readers/__init__.py\", line 78, in parse\r\n",
-      "    self.parser.parse(self.input, document)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/sphinx_.py\", line 150, in parse\r\n",
-      "    with create_client(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/base.py\", line 83, in __enter__\r\n",
-      "    self.start_client()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/myst_nb/core/execute/direct.py\", line 40, in start_client\r\n",
-      "    result = single_nb_execution(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_cache/executors/utils.py\", line 58, in single_nb_execution\r\n",
-      "    executenb(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 1305, in execute\r\n",
-      "    return NotebookClient(nb=nb, resources=resources, km=km, **kwargs).execute()\r\n",
-      "  File \"/home/codespace/.local/lib/python3.10/site-packages/jupyter_core/utils/__init__.py\", line 173, in wrapped\r\n",
-      "    return loop.run_until_complete(inner)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/asyncio/base_events.py\", line 649, in run_until_complete\r\n",
-      "    return future.result()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 689, in async_execute\r\n",
-      "    async with self.async_setup_kernel(**kwargs):\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/contextlib.py\", line 206, in __aexit__\r\n",
-      "    await anext(self.gen)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 656, in async_setup_kernel\r\n",
-      "    await self._async_cleanup_kernel()\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/nbclient/client.py\", line 512, in _async_cleanup_kernel\r\n",
-      "    await ensure_async(self.km.cleanup_resources())\r\n",
-      "AttributeError: 'NoneType' object has no attribute 'cleanup_resources'\r\n",
-      "\r\n",
-      "The above exception was the direct cause of the following exception:\r\n",
-      "\r\n",
-      "Traceback (most recent call last):\r\n",
-      "  File \"/home/codespace/.python/current/bin/jupyter-book\", line 8, in <module>\r\n",
-      "    sys.exit(main())\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1157, in __call__\r\n",
-      "    return self.main(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1078, in main\r\n",
-      "    rv = self.invoke(ctx)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1688, in invoke\r\n",
-      "    return _process_result(sub_ctx.command.invoke(sub_ctx))\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 1434, in invoke\r\n",
-      "    return ctx.invoke(self.callback, **ctx.params)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/click/core.py\", line 783, in invoke\r\n",
-      "    return __callback(*args, **kwargs)\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py\", line 317, in build\r\n",
-      "    builder_specific_actions(\r\n",
-      "  File \"/usr/local/python/3.10.8/lib/python3.10/site-packages/jupyter_book/cli/main.py\", line 525, in builder_specific_actions\r\n",
-      "    raise RuntimeError(_message_box(msg, color=\"red\", doprint=False)) from result\r\n",
-      "RuntimeError: \r\n",
-      "\u001b[91m===============================================================================\u001b[0m\r\n",
-      "\r\n",
-      "There was an error in building your book. Look above for the cause.\r\n",
-      "\r\n",
-      "\u001b[91m===============================================================================\u001b[0m\r\n",
-      "\r\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build ."
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": null,
-   "metadata": {},
-   "outputs": [],
-   "source": [
-    "!jupyter-book build /workspaces/LeetCode-Solutions/ --builder pdfhtml"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 5,
-   "metadata": {},
-   "outputs": [
-    {
-     "data": {
-      "text/html": [
-       "<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>"
-      ],
-      "text/plain": [
-       "<IPython.core.display.HTML object>"
-      ]
-     },
-     "execution_count": 5,
-     "metadata": {},
-     "output_type": "execute_result"
-    }
-   ],
-   "source": [
-    "from IPython.display import HTML\n",
-    "HTML('<a href=\"_build/html/index.html\" target=\"_blank\">Click here to view your Jupyter Book</a>')\n"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 40,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Your book template can be found at\n",
-      "\n",
-      "    mybook/\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book create mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 45,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "\u001b[32m\u001b[1mRunning Jupyter-Book v0.15.1\u001b[0m\n",
-      "\u001b[34m\u001b[1mSource Folder: \u001b[0m/workspaces/LeetCode-Solutions/mybook\n",
-      "\u001b[34m\u001b[1mConfig Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_config.yml\n",
-      "\u001b[34m\u001b[1mOutput Path: \u001b[0m/workspaces/LeetCode-Solutions/mybook/_build/html\n",
-      "[sphinxcontrib-bibtex] Beware that docutils versions 0.18 and 0.19 (you are running 0.18.1) are known to generate invalid html for citations. If this issue affects you, please use docutils<0.18 (or >=0.20 once released) instead. For more details, see https://sourceforge.net/p/docutils/patches/195/\n",
-      "\u001b[01mRunning Sphinx v5.0.2\u001b[39;49;00m\n",
-      "[etoc] Changing master_doc to 'intro'\n",
-      "checking bibtex cache... out of date\n",
-      "parsing bibtex file /workspaces/LeetCode-Solutions/mybook/references.bib... parsed 5 entries\n",
-      "\u001b[01mmyst v0.18.1:\u001b[39;49;00m MdParserConfig(commonmark_only=False, gfm_only=False, enable_extensions=['colon_fence', 'dollarmath', 'linkify', 'substitution', 'tasklist'], disable_syntax=[], all_links_external=False, url_schemes=['mailto', 'http', 'https'], ref_domains=None, highlight_code_blocks=True, number_code_blocks=[], title_to_header=False, heading_anchors=None, heading_slug_func=None, footnote_transition=True, words_per_minute=200, sub_delimiters=('{', '}'), linkify_fuzzy_links=True, dmath_allow_labels=True, dmath_allow_space=True, dmath_allow_digits=True, dmath_double_inline=False, update_mathjax=True, mathjax_classes='tex2jax_process|mathjax_process|math|output_area')\n",
-      "\u001b[01mmyst-nb v0.17.2:\u001b[39;49;00m NbParserConfig(custom_formats={}, metadata_key='mystnb', cell_metadata_key='mystnb', kernel_rgx_aliases={}, execution_mode='force', execution_cache_path='', execution_excludepatterns=[], execution_timeout=30, execution_in_temp=False, execution_allow_errors=False, execution_raise_on_error=False, execution_show_tb=False, merge_streams=False, render_plugin='default', remove_code_source=False, remove_code_outputs=False, code_prompt_show='Show code cell {type}', code_prompt_hide='Hide code cell {type}', number_source_lines=False, output_stderr='show', render_text_lexer='myst-ansi', render_error_lexer='ipythontb', render_image_options={}, render_figure_options={}, render_markdown_format='commonmark', output_folder='build', append_css=True, metadata_to_fm=False)\n",
-      "Using jupyter-cache at: /workspaces/LeetCode-Solutions/mybook/_build/.jupyter_cache\n",
-      "\u001b[01mbuilding [mo]: \u001b[39;49;00mtargets for 0 po files that are out of date\n",
-      "\u001b[01mbuilding [html]: \u001b[39;49;00mtargets for 14 source files that are out of date\n",
-      "\u001b[01mupdating environment: \u001b[39;49;00m[new config] 14 added, 0 changed, 0 removed\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/1. Two Sum.ipynb: Executed notebook in 1.35 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/128. Longest Consecutive Sequence.ipynb: Executed notebook in 1.09 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/217. Contains Duplicate.ipynb: Executed notebook in 1.04 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/238. Product of Array Except Self.ipynb: Executed notebook in 4.02 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/242. Valid Anagram.ipynb: Executed notebook in 0.97 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/347. Top K Frequent Elements.ipynb: Executed notebook in 1.14 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/49. Group Anagrams.ipynb: Executed notebook in 0.88 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/659. Encode and Decode Strings.ipynb: Executed notebook in 1.10 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/11. Container With Most Water.ipynb: Executed notebook in 1.12 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/125. Valid Palindrome.ipynb: Executed notebook in 0.98 seconds [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executing notebook using local CWD [mystnb]\n",
-      "/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/15. 3Sum.ipynb: Executed notebook in 0.83 seconds [mystnb]\n",
-      "\u001b[01mreading sources... \u001b[39;49;00m[100%] \u001b[35mintro\u001b[39;49;00m                                                 \n",
-      "\u001b[01mlooking for now-outdated files... \u001b[39;49;00mnone found\n",
-      "\u001b[01mpickling environment... \u001b[39;49;00mdone\n",
-      "\u001b[01mchecking consistency... \u001b[39;49;00m\u001b[91m/workspaces/LeetCode-Solutions/mybook/01. Array Hashing/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "\u001b[91m/workspaces/LeetCode-Solutions/mybook/02. Two Pointers/README.md: WARNING: document isn't included in any toctree\u001b[39;49;00m\n",
-      "done\n",
-      "\u001b[01mpreparing documents... \u001b[39;49;00mdone\n",
-      "\u001b[01mwriting output... \u001b[39;49;00m[100%] \u001b[32mintro\u001b[39;49;00m                                                  \n",
-      "\u001b[01mgenerating indices... \u001b[39;49;00mgenindex done\n",
-      "\u001b[01mwriting additional pages... \u001b[39;49;00msearch done\n",
-      "\u001b[01mcopying static files... \u001b[39;49;00mdone\n",
-      "\u001b[01mcopying extra files... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping search index in English (code: en)... \u001b[39;49;00mdone\n",
-      "\u001b[01mdumping object inventory... \u001b[39;49;00mdone\n",
-      "[etoc] missing index.html written as redirect to 'intro.html'\n",
-      "\u001b[01mbuild succeeded, 2 warnings.\u001b[39;49;00m\n",
-      "\n",
-      "The HTML pages are in mybook/_build/html.\n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n",
-      "Finished generating HTML for book.\n",
-      "Your book's HTML pages are here:\n",
-      "    mybook/_build/html/\n",
-      "You can look at your book by opening this file in a browser:\n",
-      "    mybook/_build/html/index.html\n",
-      "Or paste this line directly into your browser bar:\n",
-      "    file:///workspaces/LeetCode-Solutions/mybook/_build/html/index.html            \n",
-      "\n",
-      "\u001b[92m===============================================================================\u001b[0m\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book build mybook"
-   ]
-  },
-  {
-   "cell_type": "code",
-   "execution_count": 31,
-   "metadata": {},
-   "outputs": [
-    {
-     "name": "stdout",
-     "output_type": "stream",
-     "text": [
-      "format: jb-book\n",
-      "root: intro\n",
-      "\n"
-     ]
-    }
-   ],
-   "source": [
-    "!jupyter-book toc from-project /workspaces/LeetCode-Solutions/mybook/ -f jb-book"
-   ]
-  }
- ],
- "metadata": {
-  "kernelspec": {
-   "display_name": "Python 3",
-   "language": "python",
-   "name": "python3"
-  },
-  "language_info": {
-   "codemirror_mode": {
-    "name": "ipython",
-    "version": 3
-   },
-   "file_extension": ".py",
-   "mimetype": "text/x-python",
-   "name": "python",
-   "nbconvert_exporter": "python",
-   "pygments_lexer": "ipython3",
-   "version": "3.10.8"
-  }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
\ No newline at end of file
diff --git a/docs/_config.yml b/docs/_config.yml
deleted file mode 100644
index 3def3c7..0000000
--- a/docs/_config.yml
+++ /dev/null
@@ -1,31 +0,0 @@
-# Jupyter Book configuration
-
-# Project information
-title: "Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges" # Python Problem-Solving Pro: Conquering the Blind 75 LeetCode Challenges
-author: Mohsen Tabibian and Saeed Samadidana
-email: mohsentabibian@gmail.com
-description: Explore 75 essential problems frequently asked in tech interviews. Each solution includes detailed explanations and time/space complexity analysis. Boost your coding skills and interview preparedness!
-
-repository: 
-   url: https://github.com/mohsentabibian/LeetCode-Solutions
-   path: docs #LeetCode-Solutions/
-   branch: main
-
-# Execute notebooks when building (set to false if you don't want to run the code)
-execute:
-  execute_notebooks: auto
-
-# HTML settings
-html:
-  theme: jekyll-theme-Architect #jupyter
-  logo: logo.png
-  toc:
-    display: true
-  use_issues_button: true
-  use_repository_button: true
-
-#Build settings
-#repository_url: https://github.com/mohsentabibian/LeetCode-Solutions  # URL to the GitHub repository
-
-# Add GitHub buttons to the book
-# See https://jupyterbook.org/customize/config.html #add-a-link-to-your-repository
\ No newline at end of file
diff --git a/docs/_toc.yml b/docs/_toc.yml
deleted file mode 100644
index 0e4e1db..0000000
--- a/docs/_toc.yml
+++ /dev/null
@@ -1,88 +0,0 @@
-format: jb-book
-root: README
-chapters:
-  - file: 01. Array Hashing/README
-    sections:
-      - file: 01. Array Hashing/1. Two Sum
-      - file: 01. Array Hashing/128. Longest Consecutive Sequence
-      - file: 01. Array Hashing/217. Contains Duplicate
-      - file: 01. Array Hashing/238. Product of Array Except Self
-      - file: 01. Array Hashing/242. Valid Anagram
-      - file: 01. Array Hashing/347. Top K Frequent Elements
-      - file: 01. Array Hashing/49. Group Anagrams
-      - file: 01. Array Hashing/659. Encode and Decode Strings
-  - file: 02. Two Pointers/README
-    sections:
-      - file: 02. Two Pointers/11. Container With Most Water
-      - file: 02. Two Pointers/125. Valid Palindrome
-      - file: 02. Two Pointers/15. 3Sum
-  - file: 03. Sliding Window/README
-    sections:
-      - file: 03. Sliding Window/121. Best Time to Buy and Sell Stock
-      - file: 03. Sliding Window/3. Longest Substring Without Repeating Characters
-      - file: 03. Sliding Window/424. Longest Repeating Character Replacement
-      - file: 03. Sliding Window/76. Minimum Window Substring
-  - file: 04. Stack/README
-    sections:
-      - file: 04. Stack/20. Valid Parentheses
-  - file: 05. Binary Search/README
-    sections:
-      - file: 05. Binary Search/153. Find Minimum in Rotated Sorted Array
-      - file: 05. Binary Search/33. Search in Rotated Sorted Array
-  - file: 06. Linked List/README
-    sections:
-      - file: 06. Linked List/141. Linked List Cycle
-      - file: 06. Linked List/143. Reorder List
-      - file: 06. Linked List/19. Remove Nth Node From End of List
-      - file: 06. Linked List/206. Reverse Linked List
-      - file: 06. Linked List/21. Merge Two Sorted Lists
-      - file: 06. Linked List/23. Merge k Sorted Lists
-  - file: 07. Trees/README
-    sections:
-      - file: 07. Trees/100. Same Tree
-      - file: 07. Trees/102. Binary Tree Level Order Traversal
-      - file: 07. Trees/104. Maximum Depth of Binary Tree
-      - file: 07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal
-      - file: 07. Trees/124. Binary Tree Maximum Path Sum
-      - file: 07. Trees/199. Binary Tree Right Side View
-      - file: 07. Trees/226. Invert Binary Tree
-      - file: 07. Trees/230. Kth Smallest Element in a BST
-      - file: 07. Trees/235. Lowest Common Ancestor of a Binary Search Tree
-      - file: 07. Trees/297. Serialize and Deserialize Binary Tree
-      - file: 07. Trees/572. Subtree of Another Tree
-      - file: 07. Trees/98. Validate Binary Search Tree
-  - file: 08. Tries/README
-    sections:
-      - file: 08. Tries/208. Implement Trie (Prefix Tree)
-      - file: 08. Tries/211. Design Add and Search Words Data Structure
-      - file: 08. Tries/212. Word Search II
-  - file: 09. Heap - Priority Queue/README
-    sections:
-      - file: 09. Heap - Priority Queue/1046. Last Stone Weight
-      - file: 09. Heap - Priority Queue/295. Find Median from Data Stream
-      - file: 09. Heap - Priority Queue/703. Kth Largest Element in a Stream
-  - file: 10. Backtracking/README
-    sections:
-      - file: 10. Backtracking/39. Combination Sum
-      - file: 10. Backtracking/79. Word Search
-  - file: 11. Graphs/README
-    sections:
-      - file: 11. Graphs/133. Clone Graph
-      - file: 11. Graphs/178. Graph Valid Tree
-      - file: 11. Graphs/200. Number of Islands
-      - file: 11. Graphs/207. Course Schedule
-      - file: 11. Graphs/3651. Number of Connected Components in an Undirected Graph
-      - file: 11. Graphs/417. Pacific Atlantic Water Flow
-  - file: 12. Advanced Graphs/README
-    sections:
-      - file: 12. Advanced Graphs/892. Alien Dictionary
-  - file: 13. One-D Dynamic Programming/README
-    sections:
-      - file: 13. One-D Dynamic Programming/70. Climbing Stairs
-      - file: 13. One-D Dynamic Programming/198. House Robber
-      - file: 13. One-D Dynamic Programming/213. House Robber II
-  - file: 14. Two-D Dynamic Programming/README
-  - file: 15. Greedy/README
-  - file: 16. Intervals/README
-  - file: 17. Math Geometry/README
-  - file: 18. Bit Manipulation/README
\ No newline at end of file
diff --git a/docs/logo.png b/docs/logo.png
deleted file mode 100644
index d5786e4..0000000
Binary files a/docs/logo.png and /dev/null differ
diff --git a/docs/_build/html/genindex.html b/genindex.html
similarity index 86%
rename from docs/_build/html/genindex.html
rename to genindex.html
index 13d2f0f..dfc4276 100644
--- a/docs/_build/html/genindex.html
+++ b/genindex.html
@@ -138,7 +138,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -153,13 +153,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -170,29 +170,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -201,7 +201,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -216,24 +216,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -242,7 +242,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/index.html b/index.html
new file mode 100644
index 0000000..3157386
--- /dev/null
+++ b/index.html
@@ -0,0 +1 @@
+<meta http-equiv="Refresh" content="0; url=intro.html" />
diff --git a/docs/_build/html/CODE_OF_CONDUCT.html b/intro.html
similarity index 62%
rename from docs/_build/html/CODE_OF_CONDUCT.html
rename to intro.html
index e1f3fd1..34763ab 100644
--- a/docs/_build/html/CODE_OF_CONDUCT.html
+++ b/intro.html
@@ -9,7 +9,7 @@
     <meta charset="utf-8" />
     <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="generator" content="Docutils 0.18.1: http://docutils.sourceforge.net/" />
 
-    <title>Contributor Covenant Code of Conduct &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
+    <title>Introduction: Navigating the Coding Cosmos &#8212; Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges</title>
   
   
   
@@ -62,9 +62,10 @@
 const thebe_selector_output = ".output, .cell_output"
 </script>
     <script async="async" src="_static/sphinx-thebe.js"></script>
-    <script>DOCUMENTATION_OPTIONS.pagename = 'CODE_OF_CONDUCT';</script>
+    <script>DOCUMENTATION_OPTIONS.pagename = 'intro';</script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
+    <link rel="next" title="Chapter 1: Array Hashing" href="01.%20Array%20Hashing/intro.html" />
   <meta name="viewport" content="width=device-width, initial-scale=1"/>
   <meta name="docsearch:language" content="en"/>
   </head>
@@ -139,7 +140,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="#">
   
   
   
@@ -153,14 +154,14 @@
     <div class="bd-toc-item navbar-nav active">
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
-            <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+            <li class="toctree-l1 current active">
+                <a class="reference internal" href="#">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -171,29 +172,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -202,7 +203,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -217,24 +218,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -243,7 +244,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
@@ -329,7 +330,7 @@
       
       
       
-      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2FCODE_OF_CONDUCT.html&body=Your%20issue%20content%20here." target="_blank"
+      <li><a href="https://github.com/mohsentabibian/LeetCode-Solutions/issues/new?title=Issue%20on%20page%20%2Fintro.html&body=Your%20issue%20content%20here." target="_blank"
    class="btn btn-sm btn-source-issues-button dropdown-item"
    title="Open an issue"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -359,7 +360,7 @@
       
       
       
-      <li><a href="_sources/CODE_OF_CONDUCT.md" target="_blank"
+      <li><a href="_sources/intro.md" target="_blank"
    class="btn btn-sm btn-download-source-button dropdown-item"
    title="Download source file"
    data-bs-placement="left" data-bs-toggle="tooltip"
@@ -441,7 +442,7 @@
               
 
 <div id="jb-print-docs-body" class="onlyprint">
-    <h1>Contributor Covenant Code of Conduct</h1>
+    <h1>Introduction: Navigating the Coding Cosmos</h1>
     <!-- Table of contents -->
     <div id="print-main-content">
         <div id="jb-print-toc">
@@ -451,19 +452,13 @@ <h2> Contents </h2>
             </div>
             <nav aria-label="Page">
                 <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#our-pledge">Our Pledge</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#our-standards">Our Standards</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement-responsibilities">Enforcement Responsibilities</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#scope">Scope</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement">Enforcement</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement-guidelines">Enforcement Guidelines</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#correction">1. Correction</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#warning">2. Warning</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#temporary-ban">3. Temporary Ban</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#permanent-ban">4. Permanent Ban</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#attribution">Attribution</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-coding-cosmos-foundations-of-array-mastery">Unveiling the Coding Cosmos: Foundations of Array Mastery</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-graphical-constellations-advanced-graph-theory">Navigating Graphical Constellations: Advanced Graph Theory</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#the-apex-mastering-the-blind-75-challenges">The Apex: Mastering the Blind 75 Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-symphony-art-and-language-unite">Pythonic Symphony: Art and Language Unite</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#bridging-theory-to-real-world-challenges">Bridging Theory to Real-World Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#a-holistic-coding-odyssey-beyond-the-challenges">A Holistic Coding Odyssey: Beyond the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#beyond-the-pages-a-cosmic-coding-adventure">Beyond the Pages: A Cosmic Coding Adventure</a></li>
 </ul>
             </nav>
         </div>
@@ -475,125 +470,47 @@ <h2> Contents </h2>
 <div id="searchbox"></div>
                 <article class="bd-article" role="main">
                   
-  <section class="tex2jax_ignore mathjax_ignore" id="contributor-covenant-code-of-conduct">
-<h1>Contributor Covenant Code of Conduct<a class="headerlink" href="#contributor-covenant-code-of-conduct" title="Permalink to this heading">#</a></h1>
-<section id="our-pledge">
-<h2>Our Pledge<a class="headerlink" href="#our-pledge" title="Permalink to this heading">#</a></h2>
-<p>We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, religion, or sexual identity
-and orientation.</p>
-<p>We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.</p>
-</section>
-<section id="our-standards">
-<h2>Our Standards<a class="headerlink" href="#our-standards" title="Permalink to this heading">#</a></h2>
-<p>Examples of behavior that contributes to a positive environment for our
-community include:</p>
-<ul class="simple">
-<li><p>Demonstrating empathy and kindness toward other people</p></li>
-<li><p>Being respectful of differing opinions, viewpoints, and experiences</p></li>
-<li><p>Giving and gracefully accepting constructive feedback</p></li>
-<li><p>Accepting responsibility and apologizing to those affected by our mistakes,
-and learning from the experience</p></li>
-<li><p>Focusing on what is best not just for us as individuals, but for the
-overall community</p></li>
-</ul>
-<p>Examples of unacceptable behavior include:</p>
-<ul class="simple">
-<li><p>The use of sexualized language or imagery, and sexual attention or
-advances of any kind</p></li>
-<li><p>Trolling, insulting or derogatory comments, and personal or political attacks</p></li>
-<li><p>Public or private harassment</p></li>
-<li><p>Publishing others’ private information, such as a physical or email
-address, without their explicit permission</p></li>
-<li><p>Other conduct which could reasonably be considered inappropriate in a
-professional setting</p></li>
-</ul>
-</section>
-<section id="enforcement-responsibilities">
-<h2>Enforcement Responsibilities<a class="headerlink" href="#enforcement-responsibilities" title="Permalink to this heading">#</a></h2>
-<p>Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.</p>
-<p>Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.</p>
+  <section class="tex2jax_ignore mathjax_ignore" id="introduction-navigating-the-coding-cosmos">
+<h1>Introduction: Navigating the Coding Cosmos<a class="headerlink" href="#introduction-navigating-the-coding-cosmos" title="Permalink to this heading">#</a></h1>
+<p>Greetings, coding adventurer! Welcome to the expansive odyssey that is “Hands-On Problem-Solving in Python: Mastering the Blind 75 LeetCode Challenges.” In this vast tome, we embark on a transformative journey that transcends traditional problem-solving, delving into the intricate dance of algorithms, the elegance of Pythonic solutions, and the practical application of coding wisdom.</p>
+<section id="unveiling-the-coding-cosmos-foundations-of-array-mastery">
+<h2>Unveiling the Coding Cosmos: Foundations of Array Mastery<a class="headerlink" href="#unveiling-the-coding-cosmos-foundations-of-array-mastery" title="Permalink to this heading">#</a></h2>
+<p>Our cosmic journey commences with the fundamental realm of “Array Manipulation.” In this foundational section, we delve into the very essence of arrays—the building blocks of many algorithms. Understanding arrays isn’t merely about memorizing syntax; it’s about cultivating an intuition for array manipulation that transcends specific challenges. We explore not only the “how” but the “why” behind array manipulation, unraveling the logic that makes Pythonic solutions both powerful and elegant. Each problem is a microcosm, illustrating the nuanced strategies required for efficient array traversal, manipulation, and transformation.</p>
+<p>As we navigate through the cosmos of arrays, it’s essential to recognize that arrays are not static entities; they are dynamic landscapes that, when navigated skillfully, reveal hidden patterns and efficient solutions. Consider the “Product of Array Except Self” challenge as an example—beyond providing an answer, we explore the underlying mathematical principles, unlocking a broader understanding of the problem’s intricacies.</p>
 </section>
-<section id="scope">
-<h2>Scope<a class="headerlink" href="#scope" title="Permalink to this heading">#</a></h2>
-<p>This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official e-mail address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.</p>
+<section id="navigating-graphical-constellations-advanced-graph-theory">
+<h2>Navigating Graphical Constellations: Advanced Graph Theory<a class="headerlink" href="#navigating-graphical-constellations-advanced-graph-theory" title="Permalink to this heading">#</a></h2>
+<p>Journeying deeper into the coding cosmos, we set our sights on the celestial realm of “Advanced Graphs.” In this section, the challenges are like constellations, forming intricate patterns that guide us through the complexities of graph theory. The “Alien Dictionary” challenge, for instance, isn’t just a problem to be solved; it’s a portal to understanding the topological order, a gateway to deciphering language hierarchies in the cosmic lexicon.</p>
+<p>Graphs, like constellations in the night sky, may seem daunting at first, but as we explore their interconnected nodes and edges, we begin to discern the hidden order. We discuss not only the algorithmic solutions to graph challenges but also the real-world applications of graph theory. Understanding how to represent and manipulate relationships between entities is a skill that extends beyond coding interviews, proving invaluable in scenarios ranging from social network analysis to optimizing network infrastructures.</p>
 </section>
-<section id="enforcement">
-<h2>Enforcement<a class="headerlink" href="#enforcement" title="Permalink to this heading">#</a></h2>
-<p>Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-Email.
-All complaints will be reviewed and investigated promptly and fairly.</p>
-<p>All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.</p>
+<section id="the-apex-mastering-the-blind-75-challenges">
+<h2>The Apex: Mastering the Blind 75 Challenges<a class="headerlink" href="#the-apex-mastering-the-blind-75-challenges" title="Permalink to this heading">#</a></h2>
+<p>Our cosmic vessel propels us to the highest peaks of algorithmic prowess—the summit known as the Blind 75. Curated to mirror the challenges encountered in the revered halls of technical interviews, these problems serve as beacons illuminating the path to coding excellence. This section isn’t merely a collection of challenges; it’s a training ground for honing problem-solving skills to a razor-sharp edge.</p>
+<p>As we ascend, each challenge becomes a chapter in a narrative of skill development. Take “Longest Consecutive Sequence,” for instance; it isn’t just about finding the longest sequence but understanding how to traverse and manipulate sequences efficiently. Likewise, “Encode and Decode Strings” is more than encoding and decoding; it’s an exploration of efficient data representation and transmission—a skill crucial in real-world scenarios, from data compression to network communication.</p>
 </section>
-<section id="enforcement-guidelines">
-<h2>Enforcement Guidelines<a class="headerlink" href="#enforcement-guidelines" title="Permalink to this heading">#</a></h2>
-<p>Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:</p>
-<section id="correction">
-<h3>1. Correction<a class="headerlink" href="#correction" title="Permalink to this heading">#</a></h3>
-<p><strong>Community Impact</strong>: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.</p>
-<p><strong>Consequence</strong>: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.</p>
+<section id="pythonic-symphony-art-and-language-unite">
+<h2>Pythonic Symphony: Art and Language Unite<a class="headerlink" href="#pythonic-symphony-art-and-language-unite" title="Permalink to this heading">#</a></h2>
+<p>In the vast coding cosmos, Python is not just a language; it’s a symphony. Our solutions aren’t mere code; they are compositions that resonate with the clarity and elegance that Python provides. As we traverse the cosmic landscape, we explore the nuances of Pythonic coding—leveraging list comprehensions, exploiting the power of generators, and embracing the dynamic nature of the language.</p>
+<p>Pythonic solutions are not a luxury but a necessity. The art of crafting Pythonic code is about more than adhering to a set of conventions; it’s about understanding the language’s philosophy and utilizing its features to create code that is not only functional but a joy to read. A well-crafted Pythonic solution is a testament to the coder’s understanding of the language’s idioms and the ability to leverage them to their advantage.</p>
 </section>
-<section id="warning">
-<h3>2. Warning<a class="headerlink" href="#warning" title="Permalink to this heading">#</a></h3>
-<p><strong>Community Impact</strong>: A violation through a single incident or series
-of actions.</p>
-<p><strong>Consequence</strong>: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or
-permanent ban.</p>
+<section id="bridging-theory-to-real-world-challenges">
+<h2>Bridging Theory to Real-World Challenges<a class="headerlink" href="#bridging-theory-to-real-world-challenges" title="Permalink to this heading">#</a></h2>
+<p>This guide isn’t a mere compendium of challenges; it’s a bridge connecting theoretical knowledge to real-world challenges. Each chapter prepares you not only for the academic rigors of coding interviews but also for the dynamic challenges you’ll encounter in the field. The Blind 75, in particular, serves as a beacon, illuminating the path to coding excellence. We delve into not just how to solve a problem but why a specific approach is chosen—bridging the gap between theoretical understanding and practical application.</p>
+<p>In the real-world coding cosmos, challenges are not neatly packaged LeetCode problems; they are dynamic, evolving scenarios that require adaptability and a deep understanding of underlying principles. The Blind 75 serves as a microcosm, preparing you for the unpredictability and complexity of real-world coding challenges.</p>
 </section>
-<section id="temporary-ban">
-<h3>3. Temporary Ban<a class="headerlink" href="#temporary-ban" title="Permalink to this heading">#</a></h3>
-<p><strong>Community Impact</strong>: A serious violation of community standards, including
-sustained inappropriate behavior.</p>
-<p><strong>Consequence</strong>: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.</p>
+<section id="a-holistic-coding-odyssey-beyond-the-challenges">
+<h2>A Holistic Coding Odyssey: Beyond the Challenges<a class="headerlink" href="#a-holistic-coding-odyssey-beyond-the-challenges" title="Permalink to this heading">#</a></h2>
+<p>As we progress through the cosmic expanse of this book, it’s crucial to recognize that the journey extends beyond the challenges laid before you. It’s a holistic odyssey—an exploration of languages, algorithms, and the art of problem-solving. Each challenge is not just a problem to be solved; it’s an opportunity to develop a mindset—a mindset of a skilled problem-solver ready to tackle any coding puzzle that comes your way.</p>
+<p>In each chapter, we provide insights into the broader context of the challenges, discussing their relevance in real-world scenarios and how the skills you acquire are transferable to a variety of coding endeavors. We emphasize not just the technical aspects of coding but the problem-solving mindset—a mindset that transcends specific challenges and prepares you for the unpredictable nature of the coding cosmos.</p>
+<p>As you immerse yourself in the challenges, you’re not just learning to solve problems; you’re honing the mindset of a skilled problem-solver, ready to tackle any coding puzzle that comes your way. This holistic approach ensures that you’re not just a proficient coder but a versatile problem-solver—a coder equipped to navigate the dynamic and ever-evolving landscape of the coding cosmos.</p>
 </section>
-<section id="permanent-ban">
-<h3>4. Permanent Ban<a class="headerlink" href="#permanent-ban" title="Permalink to this heading">#</a></h3>
-<p><strong>Community Impact</strong>: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior,  harassment of an
-individual, or aggression toward or disparagement of classes of individuals.</p>
-<p><strong>Consequence</strong>: A permanent ban from any sort of public interaction within
-the community.</p>
-</section>
-</section>
-<section id="attribution">
-<h2>Attribution<a class="headerlink" href="#attribution" title="Permalink to this heading">#</a></h2>
-<p>This Code of Conduct is adapted from the <a class="reference external" href="https://www.contributor-covenant.org">Contributor Covenant</a>,
-version 2.0, available at
-<a class="reference external" href="https://www.contributor-covenant.org/version/2/0/code_of_conduct.html">https://www.contributor-covenant.org/version/2/0/code_of_conduct.html</a>.</p>
-<p>Community Impact Guidelines were inspired by <a class="reference external" href="https://github.com/mozilla/diversity">Mozilla’s code of conduct
-enforcement ladder</a>.</p>
-<p>For answers to common questions about this code of conduct, see the FAQ at
-<a class="reference external" href="https://www.contributor-covenant.org/faq">https://www.contributor-covenant.org/faq</a>. Translations are available at
-<a class="reference external" href="https://www.contributor-covenant.org/translations">https://www.contributor-covenant.org/translations</a>.</p>
+<section id="beyond-the-pages-a-cosmic-coding-adventure">
+<h2>Beyond the Pages: A Cosmic Coding Adventure<a class="headerlink" href="#beyond-the-pages-a-cosmic-coding-adventure" title="Permalink to this heading">#</a></h2>
+<p>So, fellow coder, embark on this cosmic journey with pen, paper, and Python at your side. Let the coding cosmos be your guide, and may your endeavors be met with the joy of discovery. Beyond the pages of this book, a cosmic coding adventure awaits—one that extends into the realms of real-world challenges, continuous learning, and the ever-expanding frontiers of coding excellence.</p>
+<p>Happy coding!</p>
 </section>
+<div class="toctree-wrapper compound">
+</div>
 </section>
 
     <script type="text/x-thebe-config">
@@ -626,6 +543,15 @@ <h2>Attribution<a class="headerlink" href="#attribution" title="Permalink to thi
                 <footer class="prev-next-footer">
                   <!-- Previous / next buttons -->
 <div class="prev-next-area">
+    <a class="right-next"
+       href="01.%20Array%20Hashing/intro.html"
+       title="next page">
+      <div class="prev-next-info">
+        <p class="prev-next-subtitle">next</p>
+        <p class="prev-next-title">Chapter 1: Array Hashing</p>
+      </div>
+      <i class="fa-solid fa-angle-right"></i>
+    </a>
 </div>
                 </footer>
               
@@ -641,19 +567,13 @@ <h2>Attribution<a class="headerlink" href="#attribution" title="Permalink to thi
   </div>
   <nav class="bd-toc-nav page-toc">
     <ul class="visible nav section-nav flex-column">
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#our-pledge">Our Pledge</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#our-standards">Our Standards</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement-responsibilities">Enforcement Responsibilities</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#scope">Scope</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement">Enforcement</a></li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#enforcement-guidelines">Enforcement Guidelines</a><ul class="nav section-nav flex-column">
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#correction">1. Correction</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#warning">2. Warning</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#temporary-ban">3. Temporary Ban</a></li>
-<li class="toc-h3 nav-item toc-entry"><a class="reference internal nav-link" href="#permanent-ban">4. Permanent Ban</a></li>
-</ul>
-</li>
-<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#attribution">Attribution</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#unveiling-the-coding-cosmos-foundations-of-array-mastery">Unveiling the Coding Cosmos: Foundations of Array Mastery</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#navigating-graphical-constellations-advanced-graph-theory">Navigating Graphical Constellations: Advanced Graph Theory</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#the-apex-mastering-the-blind-75-challenges">The Apex: Mastering the Blind 75 Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#pythonic-symphony-art-and-language-unite">Pythonic Symphony: Art and Language Unite</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#bridging-theory-to-real-world-challenges">Bridging Theory to Real-World Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#a-holistic-coding-odyssey-beyond-the-challenges">A Holistic Coding Odyssey: Beyond the Challenges</a></li>
+<li class="toc-h2 nav-item toc-entry"><a class="reference internal nav-link" href="#beyond-the-pages-a-cosmic-coding-adventure">Beyond the Pages: A Cosmic Coding Adventure</a></li>
 </ul>
   </nav></div>
 
diff --git a/logo.png b/logo.png
deleted file mode 100644
index d5786e4..0000000
Binary files a/logo.png and /dev/null differ
diff --git a/objects.inv b/objects.inv
new file mode 100644
index 0000000..9347a96
Binary files /dev/null and b/objects.inv differ
diff --git a/_build/html/reports/Book.err.log b/reports/Book.err.log
similarity index 100%
rename from _build/html/reports/Book.err.log
rename to reports/Book.err.log
diff --git a/_build/html/search.html b/search.html
similarity index 86%
rename from _build/html/search.html
rename to search.html
index a7412a1..e34d8a3 100644
--- a/_build/html/search.html
+++ b/search.html
@@ -140,7 +140,7 @@
         <div class="sidebar-primary-item">
   
 
-<a class="navbar-brand logo" href="README.html">
+<a class="navbar-brand logo" href="intro.html">
   
   
   
@@ -155,13 +155,13 @@
         
         <ul class="nav bd-sidenav bd-sidenav__home-link">
             <li class="toctree-l1">
-                <a class="reference internal" href="README.html">
-                    Blind 75 LeetCode Solutions
+                <a class="reference internal" href="intro.html">
+                    Introduction: Navigating the Coding Cosmos
                 </a>
             </li>
         </ul>
         <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/README.html">Array &amp; Hashing Solutions - Blind 75 LeetCode Problems</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="01.%20Array%20Hashing/intro.html">Chapter 1: Array Hashing</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/1.%20Two%20Sum.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/128.%20Longest%20Consecutive%20Sequence.html">128. Longest Consecutive Sequence</a></li>
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/217.%20Contains%20Duplicate.html">217. Contains Duplicate</a></li>
@@ -172,29 +172,29 @@
 <li class="toctree-l2"><a class="reference internal" href="01.%20Array%20Hashing/659.%20Encode%20and%20Decode%20Strings.html">659· Encode and Decode Strings</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/README.html">Two Pointers Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="02.%20Two%20Pointers/intro.html">Introduction to Two Pointers Technique Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/11.%20Container%20With%20Most%20Water.html">11. Container With Most Water</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/125.%20Valid%20Palindrome.html">125. Valid Palindrome</a></li>
 <li class="toctree-l2"><a class="reference internal" href="02.%20Two%20Pointers/15.%203Sum.html">15. 3Sum</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/README.html">Sliding Window Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="03.%20Sliding%20Window/intro.html">Introduction to Sliding Window Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.html">121. Best Time to Buy and Sell Stock</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.html">3. Longest Substring Without Repeating Characters</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.html">424. Longest Repeating Character Replacement</a></li>
 <li class="toctree-l2"><a class="reference internal" href="03.%20Sliding%20Window/76.%20Minimum%20Window%20Substring.html">76. Minimum Window Substring</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/README.html">Stack Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="04.%20Stack/intro.html">Introduction to Stack Challenges: Unveiling Valid Parentheses</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="04.%20Stack/20.%20Valid%20Parentheses.html">20. Valid Parentheses</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/README.html">Binary search Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="05.%20Binary%20Search/intro.html">Introduction to Binary Search Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.html">153. Find Minimum in Rotated Sorted Array</a></li>
 <li class="toctree-l2"><a class="reference internal" href="05.%20Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.html">33. Search in Rotated Sorted Array</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/README.html">Linked List Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="06.%20Linked%20List/intro.html">Introduction to Linked List Mastery</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/141.%20Linked%20List%20Cycle.html">141. Linked List Cycle</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/143.%20Reorder%20List.html">143. Reorder List</a></li>
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.html">19. Remove Nth Node From End of List</a></li>
@@ -203,7 +203,7 @@
 <li class="toctree-l2"><a class="reference internal" href="06.%20Linked%20List/23.%20Merge%20k%20Sorted%20Lists.html">23. Merge k Sorted Lists</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/README.html">Trees Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="07.%20Trees/intro.html">Introduction to Tree Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/100.%20Same%20Tree.html">100: Same Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.html">102. Binary Tree Level Order Traversal</a></li>
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.html">104. Maximum Depth of Binary Tree</a></li>
@@ -218,24 +218,24 @@
 <li class="toctree-l2"><a class="reference internal" href="07.%20Trees/98.%20Validate%20Binary%20Search%20Tree.html">98. Validate Binary Search Tree</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/README.html">Trie Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="08.%20Tries/intro.html">Unveiling the Power of Tries: A Journey in Prefix Trees</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/208.%20Implement%20Trie%20%28Prefix%20Tree%29.html">208. Implement Trie (Prefix Tree)</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.html">211. Design Add and Search Words Data Structure</a></li>
 <li class="toctree-l2"><a class="reference internal" href="08.%20Tries/212.%20Word%20Search%20II.html">212. Word Search II</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/README.html">Heap / Priority Queue Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/intro.html">Unveiling the Power of Heaps and Priority Queues</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/1046.%20Last%20Stone%20Weight.html">1046. Last Stone Weight</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.html">295. Find Median from Data Stream</a></li>
 <li class="toctree-l2"><a class="reference internal" href="09.%20Heap%20-%20Priority%20Queue/703.%20Kth%20Largest%20Element%20in%20a%20Stream.html">703. Kth Largest Element in a Stream</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/README.html">Backtracking Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="10.%20Backtracking/intro.html">Introduction to Backtracking Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/39.%20Combination%20Sum.html">39. Combination Sum</a></li>
 <li class="toctree-l2"><a class="reference internal" href="10.%20Backtracking/79.%20Word%20Search.html">79. Word Search</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/README.html">Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="11.%20Graphs/intro.html">Introduction to Graph Challenges</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/133.%20Clone%20Graph.html">133. Clone Graph</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/178.%20Graph%20Valid%20Tree.html">178. Graph Valid Tree</a></li>
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/200.%20Number%20of%20Islands.html">200. Number of Islands</a></li>
@@ -244,7 +244,7 @@
 <li class="toctree-l2"><a class="reference internal" href="11.%20Graphs/417.%20Pacific%20Atlantic%20Water%20Flow.html">417. Pacific Atlantic Water Flow</a></li>
 </ul>
 </li>
-<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/README.html">Advanced Graphs Problems - Blind 75 LeetCode</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
+<li class="toctree-l1 has-children"><a class="reference internal" href="12.%20Advanced%20Graphs/intro.html">Introduction to Advanced Graphs: Navigating the Alien Dictionary</a><input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
 <li class="toctree-l2"><a class="reference internal" href="12.%20Advanced%20Graphs/892.%20Alien%20Dictionary.html">892. Alien Dictionary</a></li>
 </ul>
 </li>
diff --git a/searchindex.js b/searchindex.js
new file mode 100644
index 0000000..daf2ed4
--- /dev/null
+++ b/searchindex.js
@@ -0,0 +1 @@
+Search.setIndex({"docnames": ["01. Array Hashing/1. Two Sum", "01. Array Hashing/128. Longest Consecutive Sequence", "01. Array Hashing/217. Contains Duplicate", "01. Array Hashing/238. Product of Array Except Self", "01. Array Hashing/242. Valid Anagram", "01. Array Hashing/347. Top K Frequent Elements", "01. Array Hashing/49. Group Anagrams", "01. Array Hashing/659. Encode and Decode Strings", "01. Array Hashing/README", "01. Array Hashing/intro", "02. Two Pointers/11. Container With Most Water", "02. Two Pointers/125. Valid Palindrome", "02. Two Pointers/15. 3Sum", "02. Two Pointers/README", "02. Two Pointers/intro", "03. Sliding Window/121. Best Time to Buy and Sell Stock", "03. Sliding Window/3. Longest Substring Without Repeating Characters", "03. Sliding Window/424. Longest Repeating Character Replacement", "03. Sliding Window/76. Minimum Window Substring", "03. Sliding Window/README", "03. Sliding Window/intro", "04. Stack/20. Valid Parentheses", "04. Stack/README", "04. Stack/intro", "05. Binary Search/153. Find Minimum in Rotated Sorted Array", "05. Binary Search/33. Search in Rotated Sorted Array", "05. Binary Search/README", "05. Binary Search/intro", "06. Linked List/141. Linked List Cycle", "06. Linked List/143. Reorder List", "06. Linked List/19. Remove Nth Node From End of List", "06. Linked List/206. Reverse Linked List", "06. Linked List/21. Merge Two Sorted Lists", "06. Linked List/23. Merge k Sorted Lists", "06. Linked List/README", "06. Linked List/intro", "07. Trees/100. Same Tree", "07. Trees/102. Binary Tree Level Order Traversal", "07. Trees/104. Maximum Depth of Binary Tree", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal", "07. Trees/124. Binary Tree Maximum Path Sum", "07. Trees/199. Binary Tree Right Side View", "07. Trees/226. Invert Binary Tree", "07. Trees/230. Kth Smallest Element in a BST", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree", "07. Trees/297. Serialize and Deserialize Binary Tree", "07. Trees/572. Subtree of Another Tree", "07. Trees/98. Validate Binary Search Tree", "07. Trees/README", "07. Trees/intro", "08. Tries/208. Implement Trie (Prefix Tree)", "08. Tries/211. Design Add and Search Words Data Structure", "08. Tries/212. Word Search II", "08. Tries/README", "08. Tries/intro", "09. Heap - Priority Queue/1046. Last Stone Weight", "09. Heap - Priority Queue/295. Find Median from Data Stream", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream", "09. Heap - Priority Queue/README", "09. Heap - Priority Queue/intro", "10. Backtracking/39. Combination Sum", "10. Backtracking/79. Word Search", "10. Backtracking/README", "10. Backtracking/intro", "11. Graphs/133. Clone Graph", "11. Graphs/178. Graph Valid Tree", "11. Graphs/200. Number of Islands", "11. Graphs/207. Course Schedule", "11. Graphs/3651. Number of Connected Components in an Undirected Graph", "11. Graphs/417. Pacific Atlantic Water Flow", "11. Graphs/README", "11. Graphs/intro", "12. Advanced Graphs/892. Alien Dictionary", "12. Advanced Graphs/README", "12. Advanced Graphs/intro", "13. One-D Dynamic Programming/198. House Robber", "13. One-D Dynamic Programming/213. House Robber II", "13. One-D Dynamic Programming/70. Climbing Stairs", "13. One-D Dynamic Programming/README", "14. Two-D Dynamic Programming/README", "15. Greedy/README", "16. Intervals/README", "17. Math Geometry/README", "18. Bit Manipulation/README", "Book", "CODE_OF_CONDUCT", "CONTRIBUTING", "README", "SECURITY", "intro"], "filenames": ["01. Array Hashing/1. Two Sum.ipynb", "01. Array Hashing/128. Longest Consecutive Sequence.ipynb", "01. Array Hashing/217. Contains Duplicate.ipynb", "01. Array Hashing/238. Product of Array Except Self.ipynb", "01. Array Hashing/242. Valid Anagram.ipynb", "01. Array Hashing/347. Top K Frequent Elements.ipynb", "01. Array Hashing/49. Group Anagrams.ipynb", "01. Array Hashing/659. Encode and Decode Strings.ipynb", "01. Array Hashing/README.md", "01. Array Hashing/intro.md", "02. Two Pointers/11. Container With Most Water.ipynb", "02. Two Pointers/125. Valid Palindrome.ipynb", "02. Two Pointers/15. 3Sum.ipynb", "02. Two Pointers/README.md", "02. Two Pointers/intro.md", "03. Sliding Window/121. Best Time to Buy and Sell Stock.ipynb", "03. Sliding Window/3. Longest Substring Without Repeating Characters.ipynb", "03. Sliding Window/424. Longest Repeating Character Replacement.ipynb", "03. Sliding Window/76. Minimum Window Substring.ipynb", "03. Sliding Window/README.md", "03. Sliding Window/intro.md", "04. Stack/20. Valid Parentheses.ipynb", "04. Stack/README.md", "04. Stack/intro.md", "05. Binary Search/153. Find Minimum in Rotated Sorted Array.ipynb", "05. Binary Search/33. Search in Rotated Sorted Array.ipynb", "05. Binary Search/README.md", "05. Binary Search/intro.md", "06. Linked List/141. Linked List Cycle.ipynb", "06. Linked List/143. Reorder List.ipynb", "06. Linked List/19. Remove Nth Node From End of List.ipynb", "06. Linked List/206. Reverse Linked List.ipynb", "06. Linked List/21. Merge Two Sorted Lists.ipynb", "06. Linked List/23. Merge k Sorted Lists.ipynb", "06. Linked List/README.md", "06. Linked List/intro.md", "07. Trees/100. Same Tree.ipynb", "07. Trees/102. Binary Tree Level Order Traversal.ipynb", "07. Trees/104. Maximum Depth of Binary Tree.ipynb", "07. Trees/105. Construct Binary Tree from Preorder and Inorder Traversal.ipynb", "07. Trees/124. Binary Tree Maximum Path Sum.ipynb", "07. Trees/199. Binary Tree Right Side View.ipynb", "07. Trees/226. Invert Binary Tree.ipynb", "07. Trees/230. Kth Smallest Element in a BST.ipynb", "07. Trees/235. Lowest Common Ancestor of a Binary Search Tree.ipynb", "07. Trees/297. Serialize and Deserialize Binary Tree.ipynb", "07. Trees/572. Subtree of Another Tree.ipynb", "07. Trees/98. Validate Binary Search Tree.ipynb", "07. Trees/README.md", "07. Trees/intro.md", "08. Tries/208. Implement Trie (Prefix Tree).ipynb", "08. Tries/211. Design Add and Search Words Data Structure.ipynb", "08. Tries/212. Word Search II.ipynb", "08. Tries/README.md", "08. Tries/intro.md", "09. Heap - Priority Queue/1046. Last Stone Weight.ipynb", "09. Heap - Priority Queue/295. Find Median from Data Stream.ipynb", "09. Heap - Priority Queue/703. Kth Largest Element in a Stream.ipynb", "09. Heap - Priority Queue/README.md", "09. Heap - Priority Queue/intro.md", "10. Backtracking/39. Combination Sum.ipynb", "10. Backtracking/79. Word Search.ipynb", "10. Backtracking/README.md", "10. Backtracking/intro.md", "11. Graphs/133. Clone Graph.ipynb", "11. Graphs/178. Graph Valid Tree.ipynb", "11. Graphs/200. Number of Islands.ipynb", "11. Graphs/207. Course Schedule.ipynb", "11. Graphs/3651. Number of Connected Components in an Undirected Graph.ipynb", "11. Graphs/417. Pacific Atlantic Water Flow.ipynb", "11. Graphs/README.md", "11. Graphs/intro.md", "12. Advanced Graphs/892. Alien Dictionary.ipynb", "12. Advanced Graphs/README.md", "12. Advanced Graphs/intro.md", "13. One-D Dynamic Programming/198. House Robber.ipynb", "13. One-D Dynamic Programming/213. House Robber II.ipynb", "13. One-D Dynamic Programming/70. Climbing Stairs.ipynb", "13. One-D Dynamic Programming/README.md", "14. Two-D Dynamic Programming/README.md", "15. Greedy/README.md", "16. Intervals/README.md", "17. Math Geometry/README.md", "18. Bit Manipulation/README.md", "Book.ipynb", "CODE_OF_CONDUCT.md", "CONTRIBUTING.md", "README.md", "SECURITY.md", "intro.md"], "titles": ["100: Same Tree", "128. Longest Consecutive Sequence", "217. Contains Duplicate", "238. Product of Array Except Self", "242. Valid Anagram", "347. Top K Frequent Elements", "49. Group Anagrams", "659\u00b7 Encode and Decode Strings", "Array &amp; Hashing Solutions - Blind 75 LeetCode Problems", "Chapter 1: Array Hashing", "11. Container With Most Water", "125. Valid Palindrome", "15. 3Sum", "Two Pointers Problems - Blind 75 LeetCode", "Introduction to Two Pointers Technique Challenges", "121. Best Time to Buy and Sell Stock", "3. Longest Substring Without Repeating Characters", "424. Longest Repeating Character Replacement", "76. Minimum Window Substring", "Sliding Window Problems - Blind 75 LeetCode", "Introduction to Sliding Window Challenges", "20. Valid Parentheses", "Stack Problems - Blind 75 LeetCode", "Introduction to Stack Challenges: Unveiling Valid Parentheses", "153. Find Minimum in Rotated Sorted Array", "33. Search in Rotated Sorted Array", "Binary search Problems - Blind 75 LeetCode", "Introduction to Binary Search Challenges", "141. Linked List Cycle", "143. Reorder List", "19. Remove Nth Node From End of List", "206. Reverse Linked List", "21. Merge Two Sorted Lists", "23. Merge k Sorted Lists", "Linked List Problems - Blind 75 LeetCode", "Introduction to Linked List Mastery", "100: Same Tree", "102. Binary Tree Level Order Traversal", "104. Maximum Depth of Binary Tree", "105. Construct Binary Tree from Preorder and Inorder Traversal", "124. Binary Tree Maximum Path Sum", "199. Binary Tree Right Side View", "226: Invert Binary Tree", "230. Kth Smallest Element in a BST", "235. Lowest Common Ancestor of a Binary Search Tree", "297. Serialize and Deserialize Binary Tree", "572: Subtree of Another Tree", "98. Validate Binary Search Tree", "Trees Problems - Blind 75 LeetCode", "Introduction to Tree Challenges", "208. Implement Trie (Prefix Tree)", "211. Design Add and Search Words Data Structure", "212. Word Search II", "Trie Problems - Blind 75 LeetCode", "Unveiling the Power of Tries: A Journey in Prefix Trees", "1046. Last Stone Weight", "295. Find Median from Data Stream", "703. Kth Largest Element in a Stream", "Heap / Priority Queue Problems - Blind 75 LeetCode", "Unveiling the Power of Heaps and Priority Queues", "39. Combination Sum", "79. Word Search", "Backtracking Problems - Blind 75 LeetCode", "Introduction to Backtracking Challenges", "133. Clone Graph", "178. Graph Valid Tree", "200. Number of Islands", "207. Course Schedule", "3651. Number of Connected Components in an Undirected Graph", "417. Pacific Atlantic Water Flow", "Graphs Problems - Blind 75 LeetCode", "Introduction to Graph Challenges", "892. Alien Dictionary", "Advanced Graphs Problems - Blind 75 LeetCode", "Introduction to Advanced Graphs: Navigating the Alien Dictionary", "House Robber", "House Robber II", "70. Climbing Stairs", "1-D Dynamic Programming Problems - Blind 75 LeetCode", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "Blind 75 LeetCode Problems", "&lt;no title&gt;", "Contributor Covenant Code of Conduct", "Contributing Guidelines", "Blind 75 LeetCode Solutions", "Security Policy", "Introduction: Navigating the Coding Cosmos"], "terms": {"difficulti": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19, 21, 22, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 87], "easi": [0, 2, 4, 8, 11, 13, 15, 19, 21, 22, 28, 31, 32, 34, 36, 38, 42, 46, 48, 55, 57, 58, 77, 78, 80, 81, 83, 87], "link": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 21, 24, 25, 29, 30, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "problem": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 64, 65, 66, 67, 68, 69, 71, 72, 74, 75, 76, 77, 86, 89], "To": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "see": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 85], "leetcod": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 63, 64, 66, 67, 69, 71, 74, 75, 76, 77, 84, 86, 88, 89], "click": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84, 86], "here": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 86, 87], "given": [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "root": [0, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 57], "two": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16, 18, 24, 25, 28, 29, 30, 31, 33, 34, 35, 36, 37, 39, 40, 43, 44, 46, 49, 50, 51, 55, 56, 57, 60, 61, 63, 65, 67, 68, 69, 72, 75, 76, 77, 83, 84], "binari": [0, 24, 25, 36, 43, 46, 48, 49, 66, 84], "p": [0, 11, 36, 44, 50, 84], "q": [0, 36, 44, 68], "write": [0, 1, 2, 3, 16, 17, 21, 24, 25, 27, 31, 36, 37, 65, 68, 72, 84], "function": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 59, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 89], "check": [0, 1, 2, 4, 10, 11, 12, 15, 16, 17, 18, 21, 24, 28, 29, 30, 31, 32, 33, 36, 37, 39, 40, 41, 44, 46, 47, 50, 51, 52, 56, 57, 61, 64, 65, 66, 67, 68, 69, 72, 76, 79, 80, 81, 82, 83, 87], "thei": [0, 1, 4, 11, 17, 21, 25, 28, 29, 30, 31, 32, 36, 37, 39, 41, 46, 49, 50, 52, 55, 56, 60, 65, 75, 76, 85, 88, 89], "ar": [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 71, 72, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89], "consid": [0, 1, 4, 11, 12, 15, 16, 25, 36, 40, 43, 45, 46, 47, 56, 60, 61, 65, 67, 69, 72, 75, 76, 77, 85, 86, 89], "structur": [0, 2, 10, 14, 16, 23, 25, 27, 29, 32, 33, 35, 36, 37, 38, 39, 40, 42, 44, 45, 46, 49, 50, 52, 53, 54, 56, 57, 64, 65, 68, 71, 72, 76, 79, 80, 81, 82, 83, 86, 87], "ident": [0, 36, 45, 49, 71, 85], "node": [0, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 54, 64, 65, 67, 68, 74, 84, 87, 89], "have": [0, 1, 4, 5, 6, 7, 8, 10, 12, 13, 16, 17, 18, 19, 21, 22, 25, 26, 28, 29, 34, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 67, 68, 70, 72, 73, 75, 76, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88], "valu": [0, 2, 5, 6, 9, 12, 14, 15, 16, 18, 21, 25, 28, 29, 30, 31, 32, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 55, 56, 57, 60, 61, 63, 64, 68, 69, 75, 77], "constraint": [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 63, 64, 65, 66, 67, 69, 72, 75, 76, 77], "The": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 85, 87], "number": [0, 1, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 67, 69, 70, 71, 72, 75, 76, 77, 83, 84, 87], "both": [0, 4, 5, 7, 10, 12, 17, 20, 27, 28, 29, 30, 31, 32, 36, 40, 43, 44, 45, 46, 47, 51, 55, 56, 57, 59, 64, 68, 69, 75, 76, 77, 89], "rang": [0, 3, 4, 5, 12, 16, 17, 18, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 40, 41, 42, 44, 45, 46, 47, 52, 54, 56, 60, 61, 64, 65, 66, 67, 68, 69, 71, 72, 77, 79, 80, 81, 82, 83, 87, 89], "0": [0, 1, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84, 85], "10": [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 16, 17, 18, 21, 25, 28, 29, 33, 36, 38, 40, 43, 44, 45, 46, 47, 50, 51, 52, 56, 57, 69, 84], "4": [0, 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 16, 17, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 38, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 61, 64, 65, 66, 68, 69, 75, 76, 84], "val": [0, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 57, 64], "definit": [0, 28, 31, 33, 36, 38, 39, 42, 44, 45, 46, 64], "class": [0, 4, 6, 7, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 56, 57, 61, 64, 66, 67, 69, 75, 76, 77, 85], "treenod": [0, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47], "def": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "__init__": [0, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 56, 57, 64, 84], "self": [0, 7, 8, 9, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 56, 57, 61, 64, 66, 67, 69, 75, 76, 77, 84, 87, 89], "left": [0, 3, 4, 10, 11, 12, 17, 18, 21, 24, 25, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 55, 61, 66, 69], "none": [0, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 56, 64, 84], "right": [0, 3, 10, 11, 12, 17, 18, 24, 25, 31, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 49, 52, 61, 66, 69, 85], "initi": [0, 1, 3, 4, 6, 10, 11, 12, 15, 16, 17, 18, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 39, 40, 41, 43, 45, 47, 50, 51, 55, 56, 57, 60, 61, 64, 66, 67, 68, 69, 72, 75, 77], "child": [0, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 50, 51, 52], "issametre": [0, 36, 46], "base": [0, 4, 5, 6, 16, 23, 29, 31, 36, 38, 40, 42, 44, 47, 50, 51, 56, 57, 65, 71, 72, 75, 76, 77, 84], "If": [0, 1, 2, 4, 5, 6, 8, 11, 12, 13, 15, 16, 17, 18, 19, 21, 22, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 77, 78, 79, 80, 81, 82, 83, 86, 87, 88], "return": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "true": [0, 2, 4, 11, 21, 24, 28, 36, 46, 47, 50, 51, 52, 61, 65, 67, 68, 69, 84], "either": [0, 11, 18, 29, 31, 32, 36, 40, 43, 44, 46, 61, 65, 66, 69, 75, 76, 77], "differ": [0, 1, 4, 5, 6, 10, 15, 17, 21, 28, 29, 36, 40, 45, 46, 56, 60, 68, 72, 75, 76, 77, 85], "fals": [0, 2, 4, 11, 21, 28, 36, 46, 47, 50, 51, 52, 61, 65, 67, 68, 69, 84], "current": [0, 1, 3, 5, 6, 7, 10, 12, 15, 16, 17, 18, 24, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 56, 60, 61, 66, 68, 69, 75, 76, 84], "equal": [0, 1, 3, 4, 5, 11, 16, 17, 24, 25, 28, 32, 36, 40, 42, 43, 46, 47, 51, 55, 56, 60, 61, 65, 69], "recurs": [0, 31, 36, 38, 39, 40, 42, 44, 45, 46, 47, 51, 52, 60, 61, 64, 65, 66, 68, 69], "subtre": [0, 36, 38, 39, 40, 42, 43, 44, 45, 47, 48, 49, 87], "entir": [0, 10, 21, 30, 36, 39, 43, 44, 46, 50, 52, 57, 64, 66, 69], "In": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 15, 16, 17, 18, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 87, 89], "thi": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 71, 72, 74, 75, 76, 77, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89], "code": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84], "we": [0, 1, 2, 6, 7, 9, 10, 12, 14, 15, 16, 17, 18, 20, 21, 23, 25, 27, 29, 30, 32, 33, 35, 36, 37, 38, 40, 41, 42, 43, 44, 46, 47, 49, 51, 52, 54, 55, 57, 59, 60, 61, 63, 64, 65, 67, 68, 69, 71, 72, 74, 77, 85, 86, 87, 88, 89], "defin": [0, 1, 4, 7, 16, 21, 28, 30, 32, 33, 36, 37, 38, 40, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 71, 76, 77], "repres": [0, 1, 5, 6, 10, 15, 16, 17, 18, 24, 25, 28, 29, 30, 32, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 57, 61, 64, 65, 66, 67, 68, 69, 71, 72, 75, 76, 77, 85, 89], "us": [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 74, 75, 76, 77, 84, 85, 88, 89], "travers": [0, 5, 10, 14, 28, 29, 30, 31, 32, 35, 36, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 54, 64, 65, 66, 69, 74, 87, 89], "compar": [0, 1, 4, 11, 18, 21, 25, 32, 33, 36, 44, 46, 49, 56, 57, 60, 65, 69, 72, 79, 80, 81, 82, 83, 87], "start": [0, 1, 5, 7, 10, 11, 12, 15, 16, 17, 18, 21, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 46, 47, 50, 51, 52, 55, 57, 60, 61, 64, 65, 66, 68, 69, 72], "which": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 59, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 85], "each": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 87, 89], "ha": [0, 2, 4, 5, 6, 10, 18, 21, 25, 28, 29, 30, 31, 32, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 50, 51, 52, 55, 56, 60, 61, 64, 65, 66, 67, 68, 75, 76, 88], "s": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89], "help": [0, 8, 12, 13, 16, 19, 21, 22, 24, 26, 32, 34, 36, 48, 53, 58, 60, 62, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87, 88], "creat": [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 16, 19, 20, 21, 22, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 76, 77, 78, 79, 80, 81, 82, 83, 86, 87, 88, 89], "work": [0, 21, 25, 28, 29, 30, 31, 33, 36, 38, 45, 46, 50, 51, 55, 56, 57, 60, 61, 68, 86, 88], "next": [0, 1, 2, 7, 11, 12, 15, 16, 28, 29, 30, 31, 32, 33, 36, 39, 40, 41, 51, 60, 66, 67, 75], "when": [0, 11, 12, 16, 18, 24, 28, 29, 31, 36, 41, 42, 43, 46, 51, 52, 54, 56, 57, 60, 61, 65, 66, 68, 79, 80, 81, 82, 83, 85, 86, 87, 89], "so": [0, 1, 5, 6, 7, 11, 12, 15, 16, 18, 24, 25, 28, 29, 31, 33, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 51, 55, 56, 57, 60, 61, 64, 66, 67, 68, 69, 76, 89], "cannot": [0, 4, 15, 29, 36, 44, 60, 61, 65, 75, 76], "becaus": [0, 1, 2, 3, 4, 7, 10, 11, 12, 15, 16, 18, 21, 24, 28, 30, 31, 36, 37, 38, 39, 41, 42, 43, 44, 46, 50, 51, 56, 57, 60, 61, 64, 65, 69, 76, 77], "final": [0, 1, 3, 4, 6, 7, 10, 12, 15, 17, 18, 21, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 50, 51, 52, 55, 57, 60, 64, 65, 66, 69, 72, 75, 76, 77], "exampl": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 14, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 85, 89], "1": [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 83, 84], "input": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 27, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 41, 42, 44, 45, 46, 47, 51, 52, 55, 56, 60, 64, 65, 66, 68, 69, 72, 75, 76, 77, 84], "2": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "3": [0, 1, 2, 3, 5, 6, 10, 11, 12, 15, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 52, 56, 57, 60, 61, 64, 65, 66, 68, 69, 75, 76, 77, 84, 87], "p1": [0, 29, 36], "q1": [0, 36], "print": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "null": [0, 36, 37, 38, 40, 43, 45, 46], "p2": [0, 29, 36], "q2": [0, 36], "p3": [0, 36], "q3": [0, 36], "can": [0, 1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 31, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 86, 87, 88], "analyz": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 72, 75, 76], "follow": [0, 3, 4, 5, 6, 17, 18, 23, 28, 29, 30, 31, 36, 37, 38, 41, 43, 44, 45, 47, 50, 52, 55, 56, 57, 61, 64, 65, 67, 69, 72, 85, 86, 87, 88], "worst": [0, 1, 2, 4, 5, 6, 7, 10, 11, 12, 16, 18, 21, 24, 25, 28, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 60, 61, 64, 65, 66, 67, 68, 69, 72], "need": [0, 10, 12, 16, 17, 18, 21, 25, 29, 30, 31, 32, 36, 40, 43, 45, 46, 50, 51, 52, 56, 57, 64, 65, 67, 68, 69, 71, 72, 75, 76, 77, 84, 86, 88], "visit": [0, 1, 31, 36, 37, 38, 41, 42, 43, 45, 46, 47, 52, 61, 64, 65, 66, 68, 69], "everi": [0, 2, 9, 18, 21, 23, 36, 38, 46, 47, 66, 68], "onc": [0, 1, 2, 4, 5, 6, 7, 10, 11, 15, 16, 17, 21, 29, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 51, 52, 61, 64, 65, 66, 67, 69, 75, 76, 77, 86, 88], "determin": [0, 1, 2, 4, 9, 11, 14, 17, 18, 21, 23, 25, 28, 29, 36, 37, 39, 40, 41, 42, 45, 46, 47, 49, 50, 52, 55, 57, 59, 60, 61, 65, 66, 67, 68, 69, 72, 75, 76, 85], "sinc": [0, 2, 3, 4, 18, 25, 36, 37, 41, 43, 47, 61, 65, 68, 76], "exactli": [0, 1, 2, 4, 5, 6, 15, 16, 31, 36, 37, 38, 40, 41, 42, 45, 65, 66, 77], "o": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "n": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 52, 55, 56, 57, 60, 61, 64, 65, 66, 68, 69, 72, 75, 76, 77, 84], "where": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 20, 21, 24, 25, 27, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 64, 65, 66, 67, 68, 69, 72, 74, 75, 76, 77], "total": [0, 5, 10, 12, 28, 29, 32, 33, 36, 37, 39, 46, 50, 51, 56, 57, 61, 66, 67, 68, 72, 75, 76, 77, 84], "call": [0, 1, 2, 4, 5, 6, 7, 16, 28, 31, 33, 36, 37, 38, 39, 40, 41, 42, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 76, 84], "stack": [0, 21, 31, 36, 38, 39, 40, 42, 43, 44, 45, 46, 47, 51, 52, 60, 61, 64, 65, 66, 68, 69, 84], "dure": [0, 11, 29, 36, 37, 39, 40, 42, 45, 46, 47, 51, 52, 57, 64, 65, 69, 72, 84, 85], "proport": [0, 28, 29, 31, 32, 33, 36, 37, 45, 46, 51, 77], "maximum": [0, 1, 4, 5, 6, 10, 15, 16, 17, 18, 24, 36, 37, 41, 46, 47, 48, 49, 51, 52, 56, 60, 66, 68, 69, 72, 75, 76, 78, 80, 87], "depth": [0, 36, 40, 42, 44, 45, 46, 47, 48, 49, 51, 52, 60, 61, 64, 65, 66, 68, 69, 87], "complet": [0, 2, 11, 28, 29, 30, 31, 32, 36, 37, 38, 39, 40, 41, 42, 44, 45, 47, 50, 51, 52, 55, 60, 61, 65, 67, 84], "unbalanc": [0, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47], "all": [0, 1, 2, 3, 4, 6, 10, 11, 12, 14, 15, 16, 18, 20, 21, 24, 25, 29, 30, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 50, 51, 52, 55, 56, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 76, 85, 86, 87], "form": [0, 4, 6, 10, 29, 30, 31, 32, 36, 52, 60, 61, 65, 66, 67, 72, 74, 89], "singl": [0, 2, 6, 7, 15, 16, 17, 21, 24, 30, 31, 33, 35, 36, 38, 40, 43, 52, 68, 77, 85], "branch": [0, 36, 38, 51, 60, 86], "therefor": [0, 1, 2, 3, 4, 5, 10, 11, 15, 16, 17, 18, 21, 24, 25, 29, 30, 31, 32, 33, 36, 38, 39, 40, 41, 45, 47, 50, 52, 55, 57, 60, 61, 64, 66, 75, 76, 77], "due": [0, 1, 6, 12, 16, 21, 29, 31, 33, 36, 39, 43, 45, 46, 47, 50, 55, 60, 61, 65, 72], "addit": [0, 1, 2, 3, 4, 8, 10, 11, 12, 13, 15, 17, 19, 22, 24, 25, 26, 28, 29, 31, 32, 33, 34, 36, 38, 39, 44, 48, 50, 53, 54, 56, 58, 61, 62, 65, 66, 69, 70, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 87, 88], "small": [0, 36, 38, 61, 69], "constant": [0, 1, 4, 6, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 38, 40, 41, 44, 45, 55, 56, 57, 75, 76, 77], "amount": [0, 10, 12, 15, 17, 18, 24, 25, 30, 31, 32, 33, 36, 38, 40, 44, 45, 60, 61, 75, 76], "variabl": [0, 1, 3, 4, 5, 6, 10, 11, 12, 15, 16, 17, 18, 24, 25, 28, 29, 30, 32, 33, 36, 38, 40, 41, 44, 55, 57, 60, 61, 66, 68, 75, 76, 77], "comparison": [0, 4, 11, 12, 15, 16, 32, 33, 36, 45, 49, 72], "within": [0, 1, 3, 6, 11, 15, 16, 17, 18, 25, 29, 35, 36, 40, 43, 45, 46, 47, 52, 55, 56, 60, 63, 64, 68, 71, 85, 88], "signific": [0, 18, 36, 40, 46], "term": [0, 5, 21, 29, 31, 36, 37, 39, 43, 55, 66, 77, 79, 80, 81, 82, 83, 85, 87], "overal": [0, 1, 2, 3, 4, 5, 6, 7, 11, 12, 16, 18, 21, 25, 29, 30, 33, 36, 37, 39, 40, 41, 45, 46, 47, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 85], "summari": [0, 2, 4, 5, 6, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 44, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 68, 72, 75, 76, 77], "medium": [1, 3, 5, 6, 7, 8, 10, 12, 13, 16, 17, 19, 24, 25, 26, 29, 30, 34, 37, 39, 41, 43, 44, 47, 48, 50, 51, 53, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 75, 76, 78, 79, 80, 81, 82, 83, 87], "an": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89], "unsort": 1, "arrai": [1, 2, 5, 6, 10, 12, 14, 15, 18, 20, 26, 27, 33, 39, 55, 56, 57, 60, 67, 68, 75, 76, 77, 84], "integ": [1, 2, 3, 5, 10, 12, 16, 17, 21, 24, 25, 28, 39, 43, 45, 55, 56, 57, 60, 64, 69, 75, 76, 77, 83, 87], "num": [1, 2, 3, 5, 12, 24, 25, 56, 57, 75, 76], "length": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 30, 32, 33, 37, 38, 39, 41, 45, 50, 51, 52, 55, 57, 60, 61, 66, 67, 69, 72, 75, 76, 77], "element": [1, 2, 3, 6, 8, 9, 10, 12, 21, 24, 25, 27, 29, 30, 31, 32, 33, 35, 39, 45, 48, 49, 56, 58, 59, 60, 67, 68, 69, 71, 84, 87], "you": [1, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 86, 87, 88, 89], "must": [1, 3, 5, 12, 15, 18, 21, 24, 25, 44, 47, 52, 64, 65, 67], "algorithm": [1, 3, 5, 7, 9, 10, 12, 14, 16, 17, 18, 24, 25, 27, 28, 29, 35, 40, 44, 45, 49, 50, 51, 52, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 71, 72, 74, 75, 76, 77, 79, 80, 81, 82, 83, 87, 89], "run": [1, 3, 10, 11, 12, 16, 17, 18, 24, 32, 44, 55, 75], "5": [1, 2, 3, 4, 5, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 41, 43, 44, 45, 46, 47, 56, 57, 60, 65, 68, 69, 75, 78, 84, 87, 88], "9": [1, 2, 3, 10, 37, 38, 39, 40, 42, 44, 57, 75, 84], "i": [1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 15, 18, 21, 24, 25, 28, 30, 31, 33, 37, 39, 40, 41, 43, 45, 50, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "python": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 21, 23, 29, 31, 32, 33, 37, 39, 40, 41, 42, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 84], "solv": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 23, 24, 27, 28, 35, 37, 39, 40, 41, 43, 44, 45, 47, 49, 52, 54, 56, 57, 59, 61, 64, 65, 69, 71, 72, 74, 75, 76, 79, 80, 81, 82, 83, 87, 89], "longestconsecut": 1, "num_set": 1, "set": [1, 2, 5, 12, 16, 18, 24, 25, 28, 29, 31, 44, 45, 49, 50, 51, 52, 54, 55, 59, 60, 61, 64, 65, 67, 75, 82, 84, 85, 87, 89], "max_length": [1, 16, 17], "current_num": 1, "current_length": [1, 16], "while": [1, 2, 5, 7, 10, 11, 12, 15, 18, 24, 25, 28, 29, 30, 31, 32, 33, 37, 39, 40, 41, 43, 44, 45, 47, 55, 57, 61, 64, 67, 69, 71, 72, 75], "max": [1, 10, 15, 16, 17, 18, 38, 40, 46, 55, 56, 66, 75, 76], "take": [1, 2, 4, 5, 7, 11, 12, 15, 16, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 51, 52, 55, 56, 57, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 85, 86, 87, 88, 89], "empti": [1, 2, 5, 6, 12, 15, 18, 21, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 43, 45, 51, 52, 55, 56, 57, 60, 64, 66, 67, 68, 69, 72], "insert": [1, 30, 43, 50, 52, 81, 87], "from": [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 15, 16, 17, 18, 21, 24, 29, 31, 32, 33, 34, 35, 37, 38, 40, 41, 43, 45, 48, 49, 50, 51, 52, 55, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 69, 71, 72, 74, 75, 76, 77, 84, 85, 86, 87, 89], "allow": [1, 2, 7, 15, 17, 18, 28, 29, 32, 44, 45, 46, 47, 51, 55, 56, 57, 66, 69, 75, 76, 85], "effici": [1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 16, 17, 23, 24, 27, 28, 30, 31, 32, 33, 35, 37, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 61, 63, 64, 65, 66, 67, 69, 71, 74, 75, 76, 89], "exist": [1, 2, 21, 32, 37, 39, 41, 43, 44, 46, 50, 51, 61, 66, 72, 86], "keep": [1, 2, 3, 11, 15, 16, 17, 18, 21, 24, 32, 33, 40, 41, 42, 43, 45, 46, 50, 55, 60, 64, 65, 66, 67, 68, 69, 72, 75], "track": [1, 2, 3, 15, 16, 17, 18, 21, 24, 32, 33, 40, 41, 43, 45, 50, 55, 57, 60, 64, 65, 66, 67, 68, 69, 72, 75], "found": [1, 12, 16, 18, 39, 40, 43, 46, 50, 51, 52, 55, 60, 61, 66, 68, 84, 88], "iter": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 28, 29, 30, 31, 32, 33, 37, 39, 41, 42, 43, 50, 51, 52, 55, 57, 60, 61, 64, 66, 67, 68, 69, 72, 75, 76, 77], "through": [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 17, 18, 20, 21, 27, 28, 29, 30, 31, 32, 33, 35, 37, 38, 39, 40, 41, 49, 50, 51, 52, 54, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 71, 72, 75, 85, 89], "For": [1, 2, 3, 4, 5, 6, 11, 16, 18, 21, 24, 25, 29, 31, 32, 37, 40, 41, 42, 46, 47, 51, 52, 60, 61, 64, 67, 68, 72, 75, 77, 85], "doesn": [1, 29, 33, 46, 51, 56, 60, 61, 64, 66], "t": [1, 4, 10, 11, 15, 18, 25, 28, 29, 33, 43, 44, 45, 46, 50, 51, 52, 56, 60, 61, 64, 66, 68, 89], "mean": [1, 2, 4, 6, 10, 11, 12, 16, 17, 18, 21, 24, 25, 28, 31, 32, 38, 39, 41, 43, 44, 45, 56, 60, 61, 64, 65, 66, 67, 68, 69, 72, 76], "potenti": [1, 12, 21, 43, 50, 54], "insid": [1, 2, 4, 6, 10, 11, 12, 16, 17, 18, 21, 24, 25, 28, 29, 31, 32, 33, 37, 40, 41, 44, 47, 52, 55, 60, 61, 64, 68, 75], "loop": [1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 35, 37, 39, 41, 43, 44, 52, 55, 60, 61, 64, 65, 66, 67, 68, 72, 75, 77, 84], "itself": [1, 3, 7, 9, 24, 31, 44, 46], "part": [1, 25, 47, 51, 68, 75], "enter": [1, 4, 12, 24, 28, 31, 32, 37, 41, 43, 55, 60], "continu": [1, 2, 10, 11, 12, 16, 18, 20, 21, 24, 25, 28, 30, 31, 32, 33, 37, 39, 40, 41, 43, 50, 52, 55, 67, 72, 85, 89], "long": [1, 55], "increment": [1, 4, 5, 6, 11, 12, 18, 56, 66, 67, 68, 77], "also": [1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 20, 21, 23, 25, 29, 30, 31, 35, 37, 39, 40, 41, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 59, 60, 61, 63, 64, 65, 67, 68, 69, 71, 72, 74, 85, 89], "account": [1, 16, 51, 85, 86], "updat": [1, 3, 4, 7, 10, 15, 16, 17, 18, 24, 25, 29, 30, 31, 32, 33, 40, 47, 55, 57, 59, 60, 67, 68, 72, 75, 76, 84], "longer": [1, 4, 10], "after": [1, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 25, 28, 29, 30, 31, 32, 33, 37, 39, 41, 43, 45, 50, 51, 52, 55, 60, 61, 65, 67, 68, 69, 72], "move": [1, 10, 11, 12, 17, 18, 28, 29, 30, 31, 32, 43, 44, 50, 51, 56, 60, 61, 66], "outer": [1, 12, 61], "repeat": [1, 2, 19, 20, 24, 29, 64, 66, 84, 87], "process": [1, 2, 6, 7, 10, 12, 20, 21, 24, 25, 29, 31, 32, 33, 37, 39, 41, 42, 43, 45, 50, 51, 56, 60, 64, 66, 67, 68, 69, 72], "result": [1, 3, 4, 5, 6, 7, 10, 11, 12, 21, 24, 25, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 43, 44, 46, 51, 52, 55, 56, 60, 61, 64, 69, 72, 75, 76, 77, 84], "kei": [1, 5, 6, 18, 21, 43, 45, 47, 50, 51, 59, 64, 66, 69, 72, 75, 84, 88], "idea": [1, 43, 75, 86], "By": [1, 7, 17, 40, 43, 57, 86, 87], "do": [1, 4, 11, 15, 17, 18, 21, 25, 28, 29, 30, 32, 40, 41, 43, 45, 55, 56, 60, 63, 65, 66, 75, 77, 86, 88], "find": [1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 25, 26, 27, 28, 29, 34, 35, 39, 40, 41, 43, 44, 48, 49, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 86, 87, 89], "nums1": [1, 2, 24, 25, 75, 76], "100": [1, 6, 30, 32, 38, 41, 42, 48, 49, 56, 64, 75, 76, 84, 87], "200": [1, 69, 70, 71, 84, 87], "nums2": [1, 2, 24, 25, 75, 76], "7": [1, 10, 15, 24, 25, 37, 38, 39, 40, 42, 44, 55, 60, 69, 75, 84], "8": [1, 3, 10, 44, 55, 57, 60, 84], "6": [1, 3, 10, 15, 24, 25, 31, 33, 40, 42, 43, 44, 47, 60, 61, 68, 69, 84], "let": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 54, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 71, 72, 74, 75, 76, 89], "provid": [1, 2, 3, 4, 5, 7, 9, 15, 16, 17, 21, 23, 24, 25, 27, 31, 33, 38, 42, 44, 45, 46, 50, 51, 52, 54, 55, 56, 57, 59, 64, 65, 66, 68, 69, 71, 72, 74, 75, 76, 77, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89], "design": [1, 7, 20, 28, 29, 35, 45, 49, 53, 54, 57, 59, 64, 66, 67, 71, 72, 74, 75, 84, 87], "breakdown": [1, 56, 69], "construct": [1, 3, 37, 41, 44, 48, 49, 52, 61, 65, 67, 72, 74, 85, 87], "perform": [1, 2, 4, 6, 15, 16, 17, 18, 21, 25, 30, 32, 33, 37, 39, 40, 41, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 61, 64, 66, 67, 68, 69, 72, 75, 77], "oper": [1, 2, 3, 6, 7, 9, 12, 15, 16, 17, 18, 21, 23, 32, 33, 35, 40, 41, 43, 45, 49, 50, 51, 55, 56, 57, 59, 75, 77], "main": [1, 10, 18, 38, 39, 44, 50, 52, 57, 60, 66, 68, 72, 76, 84, 86], "onli": [1, 5, 9, 10, 11, 12, 14, 15, 17, 20, 21, 23, 28, 29, 31, 33, 35, 40, 41, 44, 46, 47, 49, 50, 54, 55, 57, 59, 61, 63, 64, 65, 66, 69, 71, 74, 75, 76, 77, 89], "mai": [1, 5, 7, 10, 12, 17, 18, 24, 28, 29, 46, 47, 50, 51, 52, 57, 60, 61, 65, 66, 67, 68, 72, 84, 85, 86, 88, 89], "howev": [1, 28, 33, 44, 46, 50, 51, 60, 61, 66, 72, 76], "nest": [1, 12, 23, 52, 60, 61, 66, 84], "its": [1, 3, 5, 6, 7, 14, 16, 18, 21, 27, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 49, 50, 52, 55, 56, 57, 64, 65, 66, 67, 68, 69, 71, 72, 76, 79, 80, 81, 82, 83, 87, 89], "remain": [1, 2, 28, 30, 31, 32, 33, 51, 55, 56, 59, 60, 67], "few": [1, 4, 15, 16, 18, 32, 33, 60, 76], "store": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 29, 30, 31, 32, 33, 37, 38, 39, 41, 43, 45, 50, 51, 52, 54, 56, 57, 60, 64, 65, 67, 69, 72, 75, 77], "uniqu": [1, 2, 4, 5, 12, 14, 16, 18, 24, 25, 27, 39, 40, 44, 47, 49, 52, 60, 61, 64, 65, 67, 72, 74, 79, 87], "requir": [1, 2, 3, 4, 10, 11, 12, 18, 33, 41, 50, 51, 52, 55, 56, 57, 59, 60, 64, 67, 74, 77, 84, 89], "depend": [1, 4, 6, 10, 11, 12, 15, 17, 18, 24, 25, 28, 30, 32, 33, 38, 39, 40, 41, 42, 43, 46, 47, 51, 52, 56, 64, 65, 67, 71, 72, 75], "size": [1, 2, 4, 5, 6, 10, 11, 12, 15, 17, 18, 24, 25, 28, 29, 30, 31, 32, 33, 41, 44, 46, 52, 56, 57, 66, 68, 69, 72, 75, 76, 77, 85], "actual": [1, 18, 32, 47, 50, 55, 56, 60, 64, 65, 72, 88], "extend": [1, 5, 15, 17, 32, 39, 40, 41, 44, 49, 51, 52, 56, 72, 75, 89], "certain": [1, 55, 60, 75, 76], "absolut": 1, "e": [1, 5, 18, 21, 25, 28, 30, 31, 37, 39, 40, 43, 45, 50, 52, 55, 56, 60, 61, 64, 65, 67, 68, 72, 77, 85], "g": [1, 5, 25, 30, 39, 52, 55, 64, 65, 77], "less": [1, 10, 11, 12, 17, 24, 25, 44, 46, 47, 50, 52, 55, 56, 60, 69], "than": [1, 2, 5, 10, 11, 12, 15, 17, 18, 24, 25, 32, 40, 43, 44, 46, 47, 50, 52, 55, 56, 60, 61, 64, 67, 69, 77, 89], "k": [1, 2, 6, 8, 9, 12, 15, 16, 17, 25, 29, 31, 32, 34, 35, 43, 44, 52, 55, 57, 61, 75, 84, 87], "instead": [1, 5, 10, 12, 18, 25, 32, 33, 40, 41, 43, 55, 57, 60, 61, 72, 77], "ani": [2, 3, 5, 6, 7, 10, 11, 15, 17, 18, 20, 21, 25, 28, 29, 32, 33, 37, 39, 40, 45, 46, 47, 50, 51, 52, 56, 57, 60, 61, 65, 67, 68, 69, 85, 86, 88, 89], "appear": [2, 29, 30, 32, 39, 40, 65, 72, 85], "least": [2, 56, 57, 60, 68], "twice": [2, 76], "distinct": [2, 6, 16, 18, 25, 57, 60, 66, 68, 77], "containsdupl": 2, "unique_el": 2, "alreadi": [2, 4, 16, 50, 65, 84], "otherwis": [2, 4, 11, 21, 25, 28, 45, 46, 47, 50, 51, 52, 56, 60, 61, 65, 67, 72, 85], "add": [2, 8, 13, 16, 18, 19, 22, 26, 34, 39, 40, 41, 45, 48, 50, 52, 53, 54, 55, 56, 57, 58, 60, 62, 65, 67, 68, 70, 72, 73, 78, 79, 80, 81, 82, 83, 86, 87], "els": [2, 10, 12, 21, 24, 25, 32, 33, 39, 44, 55, 56, 64], "without": [2, 3, 5, 11, 18, 19, 20, 25, 28, 29, 30, 44, 52, 60, 61, 66, 75, 76, 84, 85, 87], "argument": [2, 5, 15, 16, 21, 25, 28, 38, 40, 42, 44, 46, 60, 61, 68], "whether": [2, 4, 14, 17, 27, 35, 46, 47, 49, 50, 51, 54, 61, 65, 66, 67, 68, 71, 72], "condit": [2, 12, 17, 24, 29, 44, 47, 60, 61, 65, 66, 69, 71, 72], "immedi": [2, 4, 50, 65], "ad": [2, 5, 7, 32, 38, 41, 51, 52, 56, 57, 64, 67, 68, 69, 72, 75, 77, 84], "util": [2, 52, 75, 84, 89], "data": [2, 10, 14, 16, 23, 25, 27, 29, 32, 33, 35, 37, 39, 42, 44, 45, 49, 50, 52, 53, 54, 57, 58, 59, 64, 65, 68, 71, 72, 76, 79, 80, 81, 82, 83, 84, 87, 88, 89], "quickli": [2, 57], "detect": [2, 28, 35, 46, 65, 67, 72], "meet": [2, 12, 20, 57, 59, 81, 87], "explain": [2, 29, 30, 31, 32, 50, 51], "earlier": [2, 51, 77], "nums3": [2, 24, 25, 76], "primari": [2, 16, 61], "affect": [2, 6, 51, 56, 85], "averag": [2, 7, 47, 52, 56], "grow": [2, 24, 56], "linearli": [2, 12, 41], "modifi": [2, 3, 5, 7, 10, 12, 15, 16, 17, 21, 24, 29, 30, 31, 37, 39, 40, 41, 43, 45, 47, 52, 55, 57, 60, 61, 64, 65, 66, 67, 69, 72, 75, 76], "paramet": [2, 28, 31, 43, 57, 61, 67], "frequenc": [2, 4, 5, 60], "count": [2, 3, 4, 5, 6, 12, 17, 18, 38, 40, 50, 60, 66, 67, 68, 71, 77, 83, 84, 87], "list": [2, 3, 4, 5, 6, 7, 11, 12, 14, 15, 21, 24, 37, 39, 41, 42, 43, 44, 45, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 84, 86, 89], "more": [2, 7, 8, 13, 19, 22, 26, 30, 31, 34, 44, 45, 47, 48, 52, 53, 54, 55, 56, 58, 61, 62, 66, 67, 68, 70, 72, 73, 78, 79, 80, 81, 82, 83, 86, 87, 89], "along": [2, 38, 75, 76], "answer": [3, 5, 6, 16, 18, 55, 56, 85, 89], "prefix": [3, 51, 52, 53, 72, 87], "suffix": 3, "guarante": [3, 5, 39, 57], "fit": 3, "32": [3, 84], "bit": [3, 45], "divis": [3, 24, 25], "30": [3, 30, 55, 60, 84], "up": [3, 4, 5, 9, 12, 14, 18, 28, 29, 30, 31, 39, 41, 43, 45, 52, 55, 56, 60, 61, 63, 64, 65, 66, 68, 75, 84, 88], "extra": [3, 10, 18, 28, 30, 31, 32, 44, 46, 75], "output": [3, 5, 10, 12, 30, 31, 33, 37, 41, 45, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "doe": [3, 6, 10, 11, 12, 15, 17, 21, 24, 25, 30, 32, 33, 40, 44, 50, 51, 52, 56, 57, 61, 65, 67, 68, 69], "productexceptself": 3, "len": [3, 4, 5, 7, 10, 11, 12, 16, 17, 18, 21, 24, 25, 33, 37, 41, 52, 55, 56, 57, 60, 61, 64, 65, 66, 69, 72, 76], "left_product": 3, "right_product": 3, "calcul": [3, 10, 12, 15, 16, 18, 24, 25, 38, 40, 55, 56, 59, 67, 68, 75, 76, 77], "fill": [3, 10, 77], "ones": [3, 9, 57, 63], "A": [3, 11, 28, 31, 38, 39, 40, 44, 45, 46, 47, 50, 52, 60, 61, 65, 67, 68, 85, 86, 88], "index": [3, 12, 16, 17, 24, 25, 28, 29, 39, 43, 45, 60, 61, 64], "includ": [3, 11, 17, 18, 31, 40, 45, 51, 52, 57, 60, 64, 66, 72, 75, 85, 86, 88], "accordingli": [3, 67, 72], "anoth": [3, 12, 20, 43, 45, 48, 49, 67, 68, 72, 77, 84, 87], "revers": [3, 5, 29, 34, 35, 37, 45, 52, 83, 84, 87], "order": [3, 5, 6, 12, 21, 23, 24, 25, 29, 30, 31, 32, 33, 35, 39, 40, 41, 43, 45, 48, 49, 52, 56, 57, 60, 72, 74, 87, 89], "multipli": 3, "correspond": [3, 5, 6, 21, 39, 50, 52, 60, 64, 69], "contain": [3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 17, 18, 20, 21, 23, 24, 25, 29, 30, 31, 32, 33, 37, 39, 40, 41, 44, 45, 46, 47, 51, 55, 56, 60, 64, 67, 68, 69, 72, 76, 79, 80, 81, 82, 83, 84, 87], "desir": [3, 43, 88], "comput": [3, 9, 35, 45, 49, 56, 76], "It": [3, 5, 6, 10, 11, 12, 15, 16, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 42, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 89], "result1": [3, 5, 6, 10, 25, 33, 66], "24": [3, 84], "12": [3, 10, 52, 75, 84], "result2": [3, 5, 6, 10, 25, 33, 66], "first": [3, 4, 5, 6, 15, 23, 28, 29, 30, 31, 32, 37, 38, 39, 40, 41, 42, 43, 45, 47, 51, 52, 57, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 89], "second": [3, 5, 29, 30, 43, 47, 55, 64, 77, 84], "independ": [3, 30, 32, 56, 75], "sequenti": [3, 25, 52, 61], "consum": [3, 11, 16, 17, 32, 44, 61, 65], "respect": [3, 4, 18, 29, 31, 32, 38, 46, 51, 60, 61, 67, 75, 77, 79, 80, 81, 82, 83, 85, 87], "These": [3, 4, 17, 18, 25, 28, 29, 30, 31, 32, 41, 56, 65, 72, 76, 79, 80, 81, 82, 83, 87], "occupi": [3, 29, 33, 77], "toward": [3, 11, 12, 85], "per": [3, 5, 60], "handl": [3, 5, 7, 12, 17, 29, 30, 35, 39, 42, 47, 54, 55, 57, 64, 72, 76, 84], "zero": [3, 12, 16, 31, 60, 66, 82, 87], "should": [3, 5, 7, 11, 24, 25, 28, 31, 32, 37, 45, 47, 50, 51, 55, 56, 61, 64, 65, 66, 67, 72, 77], "place": [3, 5, 29, 31, 61, 76], "modif": [3, 12], "attempt": [3, 18, 88], "directli": [3, 50, 69, 77], "string": [4, 6, 8, 9, 11, 14, 16, 17, 18, 20, 21, 23, 45, 50, 51, 52, 54, 61, 72, 84, 87, 89], "word": [4, 6, 50, 53, 54, 62, 63, 67, 68, 69, 72, 78, 87], "phrase": [4, 6, 11], "rearrang": [4, 6, 32], "letter": [4, 6, 11, 16, 17, 18, 50, 51, 52, 61, 63, 72], "typic": [4, 6, 42, 43, 47, 60, 64, 65], "origin": [4, 6, 7, 11, 24, 29, 31, 45, 52, 60, 61, 64, 65, 67, 86], "consist": [4, 6, 11, 16, 17, 18, 21, 39, 46, 50, 51, 52, 61, 66, 68, 72, 86], "lowercas": [4, 6, 11, 17, 18, 50, 51, 52, 61, 72], "english": [4, 6, 16, 17, 18, 50, 51, 52, 61], "what": [4, 85, 88], "unicod": 4, "charact": [4, 6, 7, 11, 18, 19, 20, 21, 45, 50, 51, 52, 54, 61, 72, 84, 87], "how": [4, 14, 18, 20, 21, 23, 24, 27, 28, 29, 31, 33, 37, 38, 40, 42, 43, 45, 47, 50, 51, 52, 55, 56, 57, 59, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 86, 88, 89], "would": [4, 15, 16, 24, 29, 40, 43, 47, 56, 57, 66, 67], "adapt": [4, 20, 24, 25, 27, 47, 85, 89], "your": [4, 5, 9, 14, 15, 20, 23, 25, 27, 35, 39, 45, 49, 55, 56, 59, 61, 63, 65, 68, 71, 74, 75, 79, 80, 81, 82, 83, 86, 87, 88, 89], "isanagram": 4, "str": [4, 6, 7, 45, 51, 61, 66], "bool": [4, 28, 51, 61, 67], "dictionari": [4, 5, 6, 16, 17, 18, 21, 50, 51, 52, 64, 73, 87, 89], "countt": 4, "get": [4, 5, 9, 17, 18, 20, 37, 41, 49, 52, 54, 55, 63, 64, 66, 71], "same": [4, 5, 6, 7, 11, 12, 17, 20, 21, 30, 31, 37, 39, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 56, 60, 61, 64, 65, 68, 72, 75, 76, 87], "method": [4, 5, 6, 7, 9, 21, 28, 33, 40, 45, 46, 50, 51, 56, 57, 61, 64, 66, 67, 69, 75, 76, 77], "boolean": [4, 50, 61, 68, 69], "other": [4, 6, 11, 12, 17, 18, 25, 29, 41, 44, 46, 52, 60, 64, 65, 66, 67, 68, 69, 85], "occurr": [4, 6, 7, 16, 18, 60], "line": [4, 5, 10, 14, 15, 39, 61, 84], "similarli": 4, "wai": [4, 10, 16, 18, 31, 35, 45, 49, 63, 67, 72, 77, 78, 85, 87, 89], "indic": [4, 7, 10, 11, 16, 24, 25, 28, 30, 31, 37, 39, 43, 47, 50, 51, 55, 61, 65, 66, 67, 68], "match": [4, 11, 18, 21, 28, 44, 46, 51, 52, 61, 64], "nagaram": 4, "rat": 4, "car": [4, 11], "scenario": [4, 9, 14, 15, 23, 27, 35, 39, 42, 43, 50, 54, 56, 59, 60, 65, 69, 74, 75, 76, 77, 89], "linear": [4, 15, 16, 17, 31, 32, 38, 45, 51, 66, 75, 76, 77], "simpli": [4, 16, 21, 56], "bookkeep": 4, "significantli": [4, 6, 29, 55, 56, 61, 77], "impact": [4, 18, 29, 85], "chain": 4, "longest": [4, 8, 9, 11, 19, 20, 38, 52, 78, 79, 84, 87, 89], "previou": [4, 5, 12, 30, 75, 76, 77], "bat": [4, 6], "tab": [4, 6], "cat": 4, "tac": [4, 6], "dog": [4, 6], "minimum": [4, 10, 15, 19, 20, 25, 26, 27, 56, 65, 77, 84, 87], "delet": [4, 43, 51], "make": [4, 10, 15, 20, 28, 30, 31, 32, 35, 40, 41, 44, 52, 54, 56, 57, 59, 61, 65, 69, 77, 85, 86, 89], "them": [4, 6, 11, 12, 18, 21, 30, 31, 33, 35, 40, 41, 42, 46, 49, 55, 56, 57, 61, 65, 66, 67, 68, 71, 72, 75, 89], "hello": 4, "billion": 4, "remov": [4, 11, 17, 18, 34, 35, 37, 39, 51, 55, 57, 67, 72, 84, 85, 87], "heo": 4, "billi": 4, "lo": 4, "most": [5, 13, 14, 15, 17, 21, 40, 43, 45, 50, 51, 52, 55, 56, 57, 61, 65, 67, 69, 75, 84, 87], "better": [5, 8, 13, 19, 22, 26, 34, 40, 48, 53, 58, 62, 63, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87], "log": [5, 12, 24, 25, 33, 37, 38, 40, 42, 43, 44, 47, 55, 56, 57], "topkfrequ": 5, "freq": 5, "accord": [5, 29, 44, 72], "c": [5, 6, 11, 39, 41, 52, 61, 69, 84], "item": 5, "append": [5, 6, 7, 12, 21, 28, 29, 30, 31, 32, 33, 37, 39, 41, 43, 45, 57, 60, 64, 65, 67, 68, 69, 72], "re": [5, 27, 57, 89], "end": [5, 7, 10, 11, 12, 16, 17, 18, 24, 25, 28, 29, 31, 32, 33, 34, 35, 38, 40, 50, 51, 52, 55, 68, 75, 84, 87], "higher": [5, 15, 61], "similar": [5, 7, 32, 39, 50], "one": [5, 7, 10, 11, 15, 17, 25, 28, 29, 30, 31, 32, 33, 42, 43, 44, 45, 46, 49, 55, 56, 60, 61, 64, 66, 68, 72, 75, 76, 77, 89], "greater": [5, 10, 11, 12, 15, 17, 24, 25, 40, 43, 44, 46, 47, 56, 77], "retriev": [5, 49, 50, 54, 55, 56, 59], "default": [5, 6, 72, 84], "abov": [5, 17, 29, 44, 51, 65, 69, 77, 84], "pair": [5, 9, 10, 18, 21, 33, 40, 65, 67, 68, 72], "bucket": 5, "group": [5, 8, 9, 31, 66, 68, 84, 87], "highest": [5, 89], "go": [5, 25, 28, 38, 39, 68, 69, 86], "down": [5, 29, 31, 37, 38, 39, 44, 46, 52, 61, 66, 77], "note": [5, 12, 28, 40, 51, 57, 66, 84, 86], "typo": 5, "exit": [5, 24, 25, 32, 84], "sort": [5, 12, 26, 27, 34, 35, 43, 57, 60, 67, 72, 84, 85, 87], "being": [5, 18, 25, 40, 46, 50, 51, 77], "name": [5, 8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 69, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87], "third": 5, "domin": [5, 11, 12, 18, 25, 29, 32, 37, 41, 45, 47, 52, 55, 60, 61, 69, 72], "factor": [5, 12, 18, 25, 32, 37, 41, 45, 51, 60], "105": [5, 48, 49, 87], "optim": [5, 7, 9, 10, 14, 17, 18, 20, 27, 35, 37, 43, 45, 50, 52, 56, 60, 61, 66, 67, 69, 75, 76, 89], "ensur": [5, 7, 10, 11, 12, 16, 17, 23, 30, 39, 40, 41, 44, 45, 47, 51, 52, 56, 57, 61, 64, 65, 69, 71, 72, 86, 89], "klogk": 5, "prioriti": [5, 9, 55, 56], "queue": [5, 9, 37, 39, 41, 42, 44, 55, 56, 67, 72], "heap": [5, 33, 55, 56, 57], "achiev": [5, 7, 15, 17, 31, 42, 49, 60, 64, 75], "duplic": [5, 8, 9, 12, 18, 24, 39, 47, 52, 60, 64, 65, 84, 87], "multipl": [5, 6, 7, 15, 29, 44, 47, 51, 55, 68, 72], "among": [5, 40, 50, 52, 72, 74], "togeth": [6, 7, 10, 23, 30, 31, 32, 41, 55, 65, 72, 86], "collect": [6, 8, 13, 19, 22, 26, 34, 37, 48, 52, 53, 55, 58, 61, 62, 64, 67, 70, 72, 73, 78, 79, 80, 81, 82, 83, 87, 89], "import": [6, 12, 41, 46, 55, 56, 57, 61, 66, 67, 69, 72, 75, 76, 84], "defaultdict": [6, 67, 72], "groupanagram": 6, "z": [6, 72], "26": [6, 51, 84], "ord": 6, "tupl": 6, "convert": [6, 11, 29, 30, 31, 32, 39, 45, 52, 55], "associ": [6, 28, 31, 59, 68], "step": [6, 11, 12, 16, 18, 24, 28, 29, 31, 32, 33, 37, 38, 39, 41, 44, 45, 50, 51, 52, 55, 57, 60, 64, 66, 69, 72, 74, 77, 88], "specif": [6, 29, 45, 50, 51, 52, 55, 61, 65, 67, 72, 77, 79, 80, 81, 82, 83, 84, 87, 89], "ascii": [6, 11], "under": [6, 75], "constructor": [6, 50, 51], "inner": [6, 61, 84], "strs1": 6, "eat": [6, 52], "tea": 6, "tan": 6, "ate": 6, "nat": 6, "strs2": 6, "strs3": 6, "result3": [6, 10, 25, 33], "instanc": [6, 7, 39, 46, 57, 61, 64, 66, 76, 85, 89], "done": [6, 7, 11, 12, 29, 37, 40, 60, 61, 72, 84], "belong": [6, 68], "fix": [6, 15, 24, 32, 86, 88], "effect": [6, 14, 17, 20, 24, 27, 28, 29, 31, 33, 37, 39, 40, 41, 42, 46, 50, 52], "palindrom": [6, 13, 14, 78, 84, 87], "act": [6, 23, 85], "largest": [6, 33, 43, 56, 58, 59, 66, 68], "lintcod": [7, 65, 68, 72], "sent": 7, "over": [7, 18, 20, 30, 45, 56, 57, 60], "network": [7, 45, 71, 89], "back": [7, 30, 31, 45, 55], "pleas": [7, 45, 79, 80, 81, 82, 83, 86, 87, 88], "implement": [7, 12, 20, 23, 24, 31, 39, 40, 42, 45, 51, 52, 53, 54, 55, 56, 57, 59, 60, 61, 64, 65, 66, 67, 68, 69, 71, 72, 75, 76, 77, 86, 87], "codec": [7, 45], "type": [7, 21, 23, 57, 61, 65, 66, 67, 69, 75, 76, 84], "rtype": 7, "replac": [7, 19, 20, 33, 61, 84, 87], "encapsul": [7, 61, 66], "involv": [7, 20, 23, 29, 30, 32, 40, 43, 50, 54, 55, 56, 59, 61, 65, 66, 69, 71, 72, 75, 85, 88], "concaten": [7, 52], "delimit": 7, "avoid": [7, 12, 21, 31, 46, 52, 60, 64, 65, 72, 75, 76, 85], "conflict": 7, "split": [7, 29, 45], "begin": [7, 9, 10, 11, 16, 17, 24, 27, 28, 29, 30, 32, 49, 71, 89], "repeatedli": [7, 33, 43, 72], "extract": [7, 39], "substr": [7, 11, 17, 19, 20, 78, 84, 87], "between": [7, 10, 14, 17, 24, 31, 41, 44, 51, 64, 65, 67, 68, 71, 72, 76, 89], "posit": [7, 12, 17, 21, 28, 30, 32, 39, 45, 47, 55, 61, 85], "befor": [7, 15, 29, 37, 40, 44, 50, 52, 56, 63, 64, 67, 72, 75, 86, 89], "revert": 7, "escap": 7, "preserv": [7, 64, 71], "content": [7, 29, 32], "even": [7, 29, 37, 44, 56, 86], "colon": 7, "input1": [7, 11], "lint": 7, "love": 7, "encoded1": 7, "decoded1": 7, "input2": [7, 11], "sai": 7, "ye": 7, "encoded2": 7, "decoded2": 7, "m": [7, 11, 16, 18, 32, 46, 50, 51, 52, 61, 66, 68, 69, 84, 86], "doubl": [7, 56], "build": [7, 32, 39, 52, 72, 77, 79, 80, 81, 82, 83, 84, 87, 89], "scan": 7, "aris": 7, "just": [7, 12, 21, 27, 32, 39, 45, 67, 72, 74, 85, 89], "could": [7, 18, 24, 30, 31, 40, 46, 61, 85], "own": [7, 46, 68], "abl": [7, 51], "try": [7, 12, 18, 50, 57], "minim": [7, 18, 25, 28, 45, 67, 77], "correctli": [7, 39, 51, 57, 64], "repositori": [8, 79, 80, 81, 82, 83, 86, 87, 88], "my": 8, "ve": [8, 15, 16, 43, 55, 66, 68], "organ": [8, 35, 50], "categori": 8, "easier": [8, 30, 31], "navig": [8, 14, 79, 80, 81, 82, 83, 87], "refer": [8, 28, 29, 30, 38, 39, 44, 45, 64, 79, 80, 81, 82, 83, 87], "present": [8, 9, 18, 23, 25, 27, 35, 50, 65, 71], "jupyt": [8, 84], "notebook": [8, 84], "format": [8, 30, 39, 45, 64], "ipynb": [8, 84], "217": [8, 9, 84, 87], "242": [8, 9, 84, 87], "valid": [8, 9, 12, 13, 14, 16, 17, 18, 22, 28, 39, 40, 45, 48, 49, 50, 52, 60, 61, 63, 70, 71, 72, 84, 87], "anagram": [8, 9, 84, 87], "sum": [8, 9, 12, 14, 33, 48, 49, 62, 63, 69, 77, 83, 84, 87], "49": [8, 9, 10, 84, 87], "347": [8, 9, 84, 87], "top": [8, 9, 21, 37, 41, 52, 56, 69, 77, 84, 86, 87], "frequent": [8, 9, 43, 79, 80, 81, 82, 83, 84, 87], "238": [8, 9, 84, 87], "product": [8, 9, 78, 84, 87, 89], "except": [8, 9, 84, 87, 89], "659": [8, 9, 84, 87], "encod": [8, 9, 45, 49, 84, 87, 89], "decod": [8, 9, 49, 78, 84, 87, 89], "128": [8, 9, 84, 87], "consecut": [8, 9, 76, 84, 87, 89], "sequenc": [8, 9, 20, 40, 45, 52, 56, 77, 84, 87, 89], "hard": [8, 18, 19, 33, 34, 40, 45, 48, 52, 53, 56, 58, 72, 73, 81, 87], "want": [8, 13, 15, 16, 19, 22, 25, 26, 30, 34, 43, 44, 48, 53, 58, 62, 67, 70, 73, 78, 79, 80, 81, 82, 83, 87], "feel": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "free": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 85, 87], "pull": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87], "request": [8, 13, 19, 22, 26, 34, 48, 53, 56, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87], "open": [8, 13, 19, 21, 22, 23, 26, 34, 48, 53, 58, 62, 63, 70, 73, 78, 79, 80, 81, 82, 83, 85, 86, 87], "issu": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88], "discuss": [8, 13, 19, 22, 26, 28, 34, 42, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87, 89], "improv": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87], "offici": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 85, 87], "websit": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "forum": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "hint": [8, 13, 17, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "happi": [8, 9, 13, 14, 19, 20, 22, 23, 26, 27, 34, 35, 48, 49, 53, 54, 58, 59, 62, 63, 70, 71, 73, 74, 78, 79, 80, 81, 82, 83, 87, 89], "welcom": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 85, 86, 89], "section": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 89], "hand": [9, 14, 20, 23, 27, 35, 49, 50, 54, 59, 63, 64, 68, 69, 71, 72, 74, 89], "On": [9, 14, 20, 23, 27, 35, 49, 54, 55, 59, 63, 71, 74, 89], "master": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74], "blind": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 86, 88], "75": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 84, 86, 88], "segment": [9, 23, 27, 29, 35, 49, 54, 71, 74], "explor": [9, 20, 23, 27, 35, 38, 40, 51, 52, 54, 59, 60, 61, 63, 64, 65, 66, 68, 69, 89], "curat": [9, 79, 80, 81, 82, 83, 87, 89], "select": [9, 55, 60], "focus": [9, 85], "power": [9, 14, 20, 23, 27, 35, 49, 63, 71, 74, 89], "techniqu": [9, 20, 27, 45, 49, 63, 66], "approach": [9, 10, 14, 17, 31, 33, 39, 40, 43, 45, 46, 47, 52, 57, 60, 63, 66, 75, 89], "varieti": [9, 14, 23, 89], "transform": [9, 20, 49, 89], "complex": [9, 14, 17, 18, 20, 21, 23, 24, 25, 28, 29, 30, 31, 32, 33, 35, 38, 42, 46, 49, 59, 71, 86, 89], "simpler": 9, "sharpen": [9, 14, 27, 35, 49, 59, 63], "skill": [9, 14, 27, 35, 49, 54, 59, 63, 71, 89], "manipul": [9, 14, 20, 27, 29, 35, 49, 50, 55, 57, 59, 74, 89], "introduc": [9, 15, 59, 63, 86], "art": [9, 14, 20, 27, 35, 49], "dive": [9, 20, 23, 35, 59, 63, 71], "fundament": [9, 23, 27, 35, 49, 54, 59, 71, 89], "identifi": [9, 59, 65, 66, 67, 68, 69], "target": [9, 12, 14, 25, 27, 40, 44, 60, 63], "concept": [9, 14, 23, 59, 63, 65, 71], "devis": 9, "investig": [9, 20, 49, 85], "presenc": [9, 50, 67], "common": [9, 35, 45, 48, 49, 50, 52, 79, 85, 87], "interview": [9, 23, 35, 74, 79, 80, 81, 82, 83, 87, 89], "real": [9, 14, 23, 35, 59, 71, 74], "world": [9, 14, 20, 23, 35, 59, 63, 71, 74], "applic": [9, 23, 27, 35, 49, 50, 54, 59, 71, 74, 84, 89], "delv": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 89], "map": [9, 21, 64, 66], "appli": [9, 14, 27, 55, 63, 71, 76, 85], "categor": 9, "demonstr": [9, 21, 40, 45, 50, 54, 55, 60, 65, 68, 69, 71, 75, 76, 85], "versatil": [9, 14, 20, 23, 27, 54, 63, 89], "uncov": [9, 35, 49, 59, 63, 71], "intricaci": [9, 14, 20, 27, 35, 49, 54, 59, 63, 74, 89], "draw": 9, "As": [9, 10, 14, 20, 23, 27, 29, 32, 35, 43, 49, 54, 59, 63, 71, 74, 89], "tackl": [9, 14, 20, 35, 54, 71, 74, 89], "unravel": [9, 14, 20, 23, 27, 35, 49, 54, 59, 71, 74, 89], "ll": [9, 10, 14, 20, 23, 27, 49, 54, 63, 71, 74, 89], "har": [9, 27, 35, 71, 74], "craft": [9, 27, 35, 49, 54, 59, 74, 89], "eleg": [9, 14, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 89], "readi": [9, 20, 49, 54, 63, 71, 84, 89], "embark": [9, 14, 20, 23, 27, 35, 49, 54, 63, 71, 89], "journei": [9, 14, 23, 27, 35, 49, 59, 71, 74, 89], "deepen": [9, 35, 49, 54, 63, 71], "understand": [9, 14, 23, 27, 35, 38, 49, 59, 63, 71, 74, 86, 88, 89], "enhanc": [9, 14, 23, 54, 63, 65, 71, 86], "height": [10, 35, 38, 39, 40, 42, 43, 44, 45, 46, 47, 69], "There": [10, 25, 28, 45, 50, 51, 56, 64, 65, 67, 68, 69, 72, 77, 86], "vertic": [10, 14, 52, 61, 64, 66, 67, 72], "drawn": 10, "endpoint": 10, "th": [10, 15, 30, 43, 55, 75], "x": [10, 45, 52, 55, 61, 66, 69, 72, 86], "axi": 10, "notic": [10, 12, 24], "slant": 10, "maxarea": 10, "area": [10, 14], "max_area": 10, "pointer": [10, 11, 12, 18, 24, 25, 28, 29, 30, 31, 32, 33, 35, 84], "until": [10, 11, 12, 17, 24, 25, 29, 30, 31, 32, 33, 37, 39, 41, 43, 44, 50, 55, 66, 67, 72, 88], "h": [10, 38, 40, 42, 43, 44, 45, 52], "min": [10, 15, 16, 56, 57, 69, 72], "width": [10, 41], "distanc": 10, "shorter": 10, "inward": 10, "possibl": [10, 12, 15, 25, 40, 43, 46, 51, 52, 60, 61, 63, 66, 67, 69, 72, 77, 86], "systemat": [10, 63], "hold": [10, 17, 28], "point": [10, 12, 24, 25, 28, 29, 30, 31, 32, 40, 45, 50, 64], "taller": 10, "won": 10, "increas": [10, 12, 44, 78, 84, 87], "decreas": [10, 12, 32], "smaller": [10, 12, 18, 32, 39, 40, 44, 56, 57, 60, 65, 67, 77], "height1": 10, "height2": 10, "height3": 10, "45": [10, 77], "like": [10, 12, 17, 31, 40, 41, 42, 44, 45, 47, 50, 52, 65, 66, 85, 89], "whose": 10, "consumpt": 10, "variant": [10, 41], "gap": [10, 89], "volum": 10, "uppercas": [11, 17, 18, 61], "non": [11, 32, 40, 42, 72, 81, 84, 87], "alphanumer": 11, "read": [11, 59, 84, 89], "forward": [11, 86], "backward": 11, "printabl": 11, "ispalindrom": 11, "lower": [11, 15], "cleaned_": 11, "join": [11, 45, 59, 72], "isalnum": 11, "clean": [11, 23, 27, 39], "don": [11, 25, 33, 45, 50], "insensit": 11, "digit": [11, 16], "punctuat": 11, "closer": [11, 42, 43], "decrement": [11, 12, 17, 18, 43, 67], "mismatch": [11, 46], "man": 11, "plan": [11, 75, 76], "canal": 11, "panama": 11, "output1": 11, "race": [11, 85], "output2": 11, "input3": 11, "output3": 11, "comprehens": [11, 54, 89], "half": [11, 24, 25, 29, 56], "still": [11, 17, 18, 24, 28, 37, 43, 47, 51, 57, 61], "primarili": [11, 17, 29, 46, 47, 51, 55, 76], "version": [11, 66, 85], "larg": [11, 44, 46, 55, 57], "addition": [11, 16, 30, 39, 40, 46, 61, 66, 68, 72], "babad": 11, "bab": 11, "aba": 11, "limit": [11, 52, 77], "allowed_char": 11, "ignor": [11, 21], "triplet": [12, 14], "j": [12, 33, 52, 61, 64, 66, 69, 72], "3000": [12, 39], "threesum": 12, "ascend": [12, 24, 25, 33, 43, 89], "skip": [12, 30, 60, 75, 76], "elif": [12, 21, 25, 44, 51, 56, 76], "neg": [12, 40, 47, 60], "Then": [12, 15, 56, 69, 72], "larger": [12, 18, 44, 56, 61], "been": [12, 18, 21, 29, 37, 39, 52, 64, 65, 67, 68, 88], "contribut": [12, 25, 29, 41, 55, 61, 65, 77, 85], "roughli": [12, 41], "mani": [12, 18, 51, 60, 66, 68, 72, 77, 89], "criteria": 12, "rather": [12, 24, 64], "gener": [12, 18, 21, 29, 56, 60, 61, 63, 77, 86, 89], "satisfi": [12, 47, 63, 65, 69, 72, 84], "themselv": [12, 29], "some": [12, 17, 21, 28, 44, 45], "125": [13, 14, 84, 87], "15": [13, 14, 24, 37, 38, 39, 40, 61, 84, 87], "3sum": [13, 14, 84, 87], "11": [13, 14, 24, 84, 87], "With": [13, 14, 15, 84, 87], "water": [13, 14, 66, 70, 71, 84, 87], "solut": [13, 14, 19, 20, 22, 23, 26, 28, 32, 33, 34, 42, 46, 48, 49, 53, 54, 58, 59, 62, 63, 70, 71, 73, 74, 78, 79, 80, 81, 82, 83, 84, 86, 89], "strategi": [14, 20, 33, 74, 75, 76, 89], "abil": [14, 27, 28, 35, 50, 63, 65, 89], "maintain": [14, 20, 25, 47, 50, 52, 55, 56, 57, 59, 64, 69, 75], "often": [14, 42, 43, 47, 60, 66, 67], "known": [14, 50, 54, 75, 79, 80, 81, 82, 83, 87, 89], "time": [14, 17, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 32, 33, 38, 42, 46, 59, 84, 85, 86, 87], "space": [14, 17, 18, 20, 21, 24, 25, 28, 29, 30, 31, 32, 33, 38, 42, 46, 85, 86], "discov": [14, 20, 23, 49, 59], "leverag": [14, 23, 27, 49, 54, 59, 63, 74, 89], "address": [14, 71, 85, 88], "immers": [14, 27, 89], "yourself": [14, 27, 41, 45, 89], "maxim": [14, 15, 20, 75], "histogram": 14, "showcas": [14, 20, 23, 27, 35, 74], "realm": [14, 49, 59, 63, 74, 89], "learn": [14, 27, 59, 85, 89], "emploi": [14, 24, 63], "three": [14, 38, 39, 44, 45, 60, 61, 76, 77], "embrac": [14, 74, 89], "readabl": [14, 27, 59, 74], "practic": [14, 27, 42, 43, 44, 46, 47, 50, 51, 52, 60, 65, 66, 67, 71, 89], "detail": [14, 29, 60, 68, 69, 72, 86, 88], "explan": [14, 85, 86], "gain": [14, 23, 27, 49, 54], "deep": [14, 27, 38, 39, 64, 66, 69, 74, 89], "prepar": [14, 23, 35, 74, 79, 80, 81, 82, 83, 87, 89], "think": [14, 35], "divers": [14, 27, 49, 54, 85], "commenc": [14, 27, 54, 89], "price": [15, 20], "dai": [15, 88], "profit": [15, 20], "choos": [15, 17, 40, 55, 76], "futur": [15, 84], "transact": 15, "maxprofit": 15, "min_pric": 15, "max_profit": 15, "encount": [15, 16, 21, 23, 27, 40, 65, 66, 74, 86, 89], "made": [15, 32, 33, 39, 46, 50, 51, 56, 57, 60], "seen": [15, 16, 57], "far": [15, 16, 18, 43, 49, 56, 57], "haven": [15, 43, 52], "lowest": [15, 48, 49, 87], "sold": 15, "assum": [15, 39, 51, 64, 65, 66, 68, 72], "bought": 15, "subtract": [15, 60], "previous": [15, 50, 51], "prices1": 15, "prices2": 15, "examin": [15, 49], "rel": [15, 33, 44, 69], "regardless": [15, 17, 28, 29, 31, 32, 44, 75, 76, 85], "memori": [15, 28, 31, 32, 33, 44, 45, 51, 61, 64, 66], "usag": [15, 28, 30, 39, 40, 43, 45, 47, 50, 51, 55, 56, 57, 61, 69, 75], "again": [15, 17, 25, 28, 50], "fee": 15, "symbol": 16, "length_of_longest_substr": 16, "last": [16, 23, 25, 28, 29, 31, 37, 50, 58, 59, 75, 76, 84], "char_index": 16, "necessari": [16, 51, 56, 57, 61], "wa": [16, 18, 24, 31, 50, 72, 85], "new": [16, 28, 29, 30, 31, 32, 33, 35, 37, 39, 40, 41, 44, 45, 50, 51, 52, 54, 55, 57, 64, 68, 72, 75, 84, 86], "fact": 16, "abcabcbb": 16, "bbbbb": 16, "pwwkew": 16, "lookup": 16, "arithmet": [16, 21], "abca": 16, "abcd": 16, "chang": [17, 29, 31, 49, 52, 57, 66, 78, 84, 86, 87], "characterreplac": 17, "max_count": 17, "slide": [17, 18, 56, 84], "window": [17, 56, 84], "char_count": 17, "plu": [17, 40], "minu": [17, 61], "exceed": 17, "shrink": [17, 18], "side": [17, 42, 49, 89], "alwai": [17, 57, 64], "s1": 17, "abab": 17, "k1": [17, 43], "s2": 17, "aababba": 17, "k2": [17, 43], "sever": [17, 45, 86], "inform": [17, 31, 65, 72, 85, 87, 88], "variat": [17, 18, 24, 25, 55, 75, 76], "testcas": 18, "min_window_substr": 18, "t_dict": 18, "current_window_dict": 18, "popul": [18, 57, 67, 68], "char": [18, 21, 50, 51, 52, 72], "min_len": 18, "float": [18, 40, 47, 56], "inf": [18, 40, 47], "min_window": 18, "required_char": 18, "found_char": 18, "window_s": 18, "left_char": 18, "further": [18, 31, 66, 72, 86, 88], "adobecodebanc": 18, "abc": [18, 61], "banc": 18, "aa": 18, "smallest": [18, 24, 25, 48, 49, 56, 57, 72, 87], "No": [18, 85], "121": [19, 20, 84, 87], "best": [19, 20, 38, 40, 43, 84, 85, 87], "bui": [19, 20, 84, 87], "And": [19, 48, 53, 87], "sell": [19, 20, 84, 87], "stock": [19, 20, 84, 87], "424": [19, 20, 84, 87], "76": [19, 20, 84, 87], "chapter": [20, 59, 89], "dynam": [20, 35, 54, 57, 59, 71, 75, 76, 77, 89], "particularli": [20, 28, 50, 54], "subarrai": [20, 78, 80, 87], "wit": [20, 23, 35], "invalu": [20, 54, 89], "tool": [20, 23, 54, 59, 84], "arsen": [20, 23, 54], "relat": [20, 50, 63, 71], "grasp": [20, 59], "manag": [20, 32], "bracket": [21, 23], "close": [21, 23, 43, 47, 65], "correct": [21, 23, 40, 41, 55, 56, 61, 69, 72], "isvalid": 21, "bracket_map": 21, "push": [21, 23, 43, 55, 74, 86], "onto": [21, 43], "pop": [21, 23, 37, 39, 41, 43], "dummi": [21, 28, 30, 32, 33], "top_el": 21, "unmatch": 21, "recent": [21, 84], "error": 21, "properli": 21, "bottom": [21, 37, 40, 41, 52, 69], "mainli": [21, 51, 52], "express": [21, 35, 54, 60, 85], "combin": [21, 29, 32, 35, 39, 41, 62, 63, 77, 87], "20": [22, 37, 38, 39, 40, 84, 87], "parenthes": [22, 84, 87], "dedic": 23, "profici": [23, 89], "coder": [23, 27, 54, 89], "out": [23, 52, 61, 63, 65, 77, 84], "lifo": 23, "principl": [23, 59, 74, 89], "our": [23, 54, 74, 87, 88, 89], "focu": [23, 27, 74], "commonli": [23, 79, 80, 81, 82, 83, 87], "face": 23, "variou": [23, 35, 49, 50, 54, 72], "curli": 23, "brace": 23, "squar": [23, 69], "core": [23, 59, 63, 84], "balanc": [23, 37, 38, 40, 42, 43, 44, 47, 56], "strength": [23, 59], "concis": [23, 43, 63, 88], "simplic": [23, 64], "deeper": [23, 54, 89], "seemingli": 23, "simpl": [23, 44, 45], "robust": 23, "strengthen": 23, "foundat": [23, 27, 54, 59, 71, 79, 80, 81, 82, 83, 87], "mysteri": [23, 63, 74], "suppos": [24, 52, 55], "might": [24, 25, 39, 56], "becom": [24, 25, 30, 31, 32, 37, 43, 44, 59, 60, 67, 74, 89], "5000": [24, 25, 31, 67], "findmin": 24, "mid": [24, 25], "rightmost": [24, 41], "break": [24, 29, 37, 39, 46, 72, 77, 78, 87], "converg": 24, "At": [24, 40, 45, 50, 51, 52, 55, 56, 57], "search": [24, 39, 43, 45, 46, 48, 49, 50, 53, 54, 57, 60, 62, 63, 64, 65, 66, 68, 69, 84], "middl": [24, 25, 29, 56], "elimin": [24, 44, 60], "met": [24, 29, 44, 61, 65, 66, 89], "impli": 24, "13": [24, 84], "17": [24, 84], "divid": [24, 25, 27, 33, 39, 56, 69], "halv": [24, 29, 56], "logarithm": [24, 44, 56], "reduc": [24, 33, 50, 60, 66, 69], "henc": 24, "kth": [24, 48, 49, 55, 56, 58, 59, 87], "extens": [24, 40, 44, 56, 64, 84], "prior": 25, "pass": [25, 28, 30, 31, 40, 57, 61], "unknown": [25, 72], "pivot": [25, 59], "runtim": 25, "li": 25, "reset": 25, "chosen": [25, 60, 89], "target1": [25, 60], "target2": [25, 60], "target3": [25, 60], "veri": [25, 46, 57, 89], "scale": [25, 41, 46, 76], "circularli": 25, "circular": [25, 67, 75, 76], "manner": [25, 32, 38, 43], "153": [26, 27, 84, 87], "rotat": [26, 27, 31, 82, 84, 87], "33": [26, 27, 84, 87], "conquer": [27, 33, 59], "plai": [27, 55, 59], "crucial": [27, 71, 89], "role": [27, 59], "especi": 27, "exhibit": 27, "nuanc": [27, 59, 74, 89], "test": [27, 63, 71, 86], "unconvent": 27, "locat": 27, "beyond": [27, 49, 74], "tradit": [27, 89], "ourselv": 27, "goe": [27, 74], "mere": [27, 89], "program": [27, 50, 75, 76, 77, 80, 81, 82, 83], "languag": [27, 54, 72, 74, 79, 80, 81, 82, 83, 85, 87], "serv": [27, 32, 50, 63, 64, 71, 89], "canva": 27, "featur": [27, 50, 51, 86, 89], "masteri": 27, "develop": [27, 89], "broaden": 27, "toolkit": [27, 35, 63, 84], "insight": [27, 63, 89], "season": [27, 35], "solid": [27, 71], "head": [28, 29, 30, 31, 32], "reach": [28, 29, 30, 31, 38, 43, 44, 50, 51, 60, 65, 68, 69, 77], "intern": 28, "po": [28, 84], "denot": [28, 69], "tail": [28, 31, 33], "connect": [28, 30, 40, 45, 64, 65, 66, 69, 70, 71, 75, 76, 87, 89], "singli": [28, 29, 31, 32, 33], "listnod": [28, 29, 30, 31, 32, 33], "hascycl": 28, "slow": [28, 29], "fast": [28, 29, 57], "attribut": [28, 29, 30, 32, 38, 39, 40, 44, 45, 50, 51], "eventu": [28, 44], "catch": 28, "helper": [28, 29, 30, 31, 32, 40, 46, 47, 51, 60, 61, 68, 76], "create_linked_list_with_cycl": 28, "cycle_nod": 28, "enumer": [28, 64, 84], "purpos": [28, 29, 31, 32, 79, 80, 81, 82, 83, 87, 88], "simplifi": [28, 29, 30, 31, 32, 33, 68, 69], "creation": [28, 29, 55], "specifi": [28, 29, 51, 57, 61, 72, 85], "simul": [28, 43, 55], "easili": [28, 29, 32, 45], "reason": [28, 42, 44, 51, 66, 85], "speed": 28, "approxim": [28, 37, 42, 47, 55], "l_0": 29, "l_1": 29, "l_": 29, "l_n": 29, "l_2": 29, "1000": [29, 37, 40, 45, 46, 55, 76], "reorderlist": 29, "first_half": 29, "second_half": 29, "prev": [29, 31, 75, 76], "next_nod": [29, 31], "merg": [29, 34, 35, 43, 81, 84, 86, 87], "altern": [29, 41], "next_p1": 29, "next_p2": 29, "pattern": [29, 32, 37, 74, 85, 89], "describ": [29, 55, 64, 76, 88], "statement": [29, 50, 55, 60, 72, 76, 77], "direct": [29, 31, 61, 66, 67, 68, 72, 84], "now": [29, 30, 39, 50, 55], "adjust": 29, "printlinkedlist": [29, 32], "debug": [29, 32], "displai": [29, 32], "regular": [29, 32], "visual": [29, 32, 65], "head1": [29, 30, 31], "head2": [29, 30, 31], "compon": [29, 64, 69, 70, 71, 87], "odd": [29, 37, 56], "come": [29, 45, 54, 61, 72, 89], "sz": 30, "removenthfromend": 30, "advanc": [30, 31, 49, 54, 85], "_": [30, 37, 68, 69], "simultan": [30, 75], "individu": [30, 46, 66, 79, 80, 81, 82, 83, 85, 87], "ahead": 30, "createlinkedlist": [30, 31], "converttolist": 30, "familiar": [30, 86], "n1": [30, 65, 68], "new_head1": 30, "n2": [30, 65, 68], "new_head2": 30, "head3": [30, 31], "n3": 30, "new_head3": 30, "certainli": [30, 76], "isol": [30, 64], "reverselistit": 31, "reverselistrecurs": 31, "new_head": 31, "cycl": [31, 34, 35, 64, 65, 67, 72, 84, 87], "linkedlisttolist": 31, "newli": [31, 32], "reversed_head1": 31, "reversed_head2": 31, "reversed_head3": 31, "about": [31, 65, 66, 67, 74, 85, 89], "state": 31, "list1": 32, "list2": 32, "splice": 32, "50": 32, "mergetwolist": 32, "placehold": 32, "attach": 32, "essenti": [32, 35, 42, 44, 67, 77, 89], "merged_list": 32, "why": [32, 41, 57, 85, 89], "temporari": [32, 75], "alloc": [32, 51], "zigzag": [32, 37, 41], "500": 33, "exce": [33, 57, 60], "mergeklist": 33, "mergedlist": 33, "l1": 33, "l2": 33, "mergelist": 33, "high": [33, 68], "level": [33, 38, 39, 41, 48, 49, 51, 68, 69, 84, 85, 87], "overview": [33, 60], "lists1": 33, "lists2": 33, "lists3": 33, "fashion": 33, "across": [33, 45, 50], "low": [33, 57], "overhead": [33, 38, 51], "206": [34, 35, 84, 87], "21": [34, 35, 84, 87], "143": [34, 35, 84, 87], "reorder": [34, 35, 84, 87], "19": [34, 35, 84, 87], "nth": [34, 35, 84, 87], "141": [34, 35, 84, 87], "23": [34, 35, 84, 87], "scienc": [35, 49], "cornerston": 35, "offer": [35, 56, 63], "flexibl": [35, 45, 54], "critic": 35, "asset": 35, "programm": 35, "empow": 35, "numer": 35, "rise": 35, "marriag": 35, "seamless": 35, "blend": 35, "enthusiast": [35, 71], "job": 35, "seeker": 35, "technic": [35, 79, 80, 81, 82, 83, 87, 89], "seek": [35, 54], "elev": [35, 49, 54], "2000": [37, 41, 46, 50, 67], "levelord": 37, "bf": [37, 65, 66], "level_valu": 37, "level_s": [37, 41], "dequeu": [37, 39, 41, 67], "front": [37, 39, 67], "enqueu": [37, 39, 41], "children": [37, 39, 41, 43, 45, 50, 51, 52], "object": [37, 39, 42, 45, 50, 51, 56, 57, 66, 84], "breadth": [37, 64, 65, 66], "wors": 37, "invert": [38, 48, 49, 87], "path": [38, 48, 49, 52, 60, 61, 65, 68, 79, 84, 87, 89], "farthest": 38, "leaf": [38, 40, 43, 45], "maxdepth": 38, "left_depth": 38, "right_depth": 38, "well": [38, 44, 46, 51, 56, 66, 77, 85, 89], "skew": [38, 39, 42, 47], "perfectli": [38, 43], "vari": [38, 43, 47, 59], "shape": [38, 47], "buildtre": 39, "root_val": 39, "root_idx_inord": 39, "appropri": [39, 56, 85], "sublist": 39, "slice": 39, "subproblem": [39, 77], "treetolist": 39, "trail": 39, "b": [39, 41, 51, 52, 61, 68, 72, 86], "represent": [39, 45, 67, 72, 89], "reflect": [39, 72], "highli": [39, 43], "postord": 39, "reconstruct": [39, 45, 49], "adjac": [40, 52, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76], "edg": [40, 54, 64, 65, 66, 67, 68, 69, 72, 74, 89], "choic": [40, 59], "option": 40, "global": 40, "ultim": 40, "aim": [40, 55, 69, 76], "maxpathsum": 40, "max_path_sum_help": 40, "left_max": 40, "right_max": 40, "max_sum": 40, "infin": [40, 47], "importantli": 40, "root1": [40, 41, 42, 43, 47], "root2": [40, 41, 42, 43, 44, 47], "42": 40, "anywher": 40, "imagin": 41, "stand": [41, 54], "rightsideview": 41, "d": [41, 52, 61], "subsequ": [41, 78, 79, 87], "obtain": [41, 45, 52], "visibl": [41, 85], "auxiliari": [41, 42, 60, 64], "leftmost": [41, 43], "inverttre": 42, "swap": [42, 44], "noth": 42, "inverted_root1": 42, "__main__": 42, "0x7f30502756c0": 42, "inverted_root2": 42, "0x7f30502751b0": 42, "root3": 42, "inverted_root3": 42, "occur": [42, 50, 60, 66, 84], "full": 42, "mind": [42, 46, 66, 72], "task": [42, 45, 50, 52, 61, 65, 68, 69, 71, 75], "mimic": 42, "tree": [43, 53, 70, 71], "kthsmallest": [43, 57], "yet": [43, 68], "resembl": 43, "moder": [43, 46, 85], "usual": [43, 65], "bst": [44, 47, 48, 49, 87], "lca": 44, "wikipedia": 44, "descend": [44, 46], "lowestcommonancestor": 44, "inclus": [44, 85], "logic": [44, 50, 89], "neither": 44, "advantag": [44, 88, 89], "properti": [44, 47, 49, 57, 65], "narrow": 44, "lead": [44, 50, 60, 85], "quick": [44, 56], "Its": 44, "suitabl": [44, 56], "file": [45, 63, 84], "buffer": 45, "transmit": 45, "later": [45, 51], "environ": [45, 84, 85, 88], "restrict": [45, 76], "clarif": 45, "necessarili": 45, "creativ": 45, "tthe": 45, "byte": 45, "persist": 45, "context": [45, 60, 65, 89], "recreat": 45, "accur": [45, 64], "unambigu": 45, "goal": [45, 50, 52, 55, 60, 64, 66, 67, 68, 69, 72, 75, 76], "preorder": [45, 48, 49, 87], "pars": [45, 84], "df": [45, 47, 52, 60, 61, 64, 65, 66, 68, 69], "int": [45, 56, 57, 64, 66, 67, 69, 75, 76, 77], "absenc": 45, "comma": 45, "custom": 45, "serialized_tre": 45, "new_root": 45, "convers": [45, 61], "major": 45, "unless": 45, "descript": [46, 79, 80, 81, 82, 83, 86, 87, 88], "subroot": 46, "issubtre": 46, "tree1": 46, "tree2": 46, "unnecessari": [46, 52, 60], "Is": 46, "earli": [46, 60], "whichev": 46, "degrad": 46, "31": [47, 84], "is_valid_bst": 47, "is_valid": 47, "min_val": 47, "max_val": 47, "wide": [47, 49, 79, 80, 81, 82, 83, 87], "violat": [47, 85], "log2": 47, "quit": 47, "standard": 47, "226": [48, 49, 87], "104": [48, 49, 87], "572": [48, 49, 87], "235": [48, 49, 87], "ancestor": [48, 49, 87], "102": [48, 49, 84, 87], "98": [48, 49, 87], "230": [48, 49, 87], "inord": [48, 49, 87], "124": [48, 49, 87], "297": [48, 49, 87], "serial": [48, 49, 87], "deseri": [48, 49, 87], "fascin": [49, 54, 63, 71, 74], "guid": [49, 54, 59, 63, 74, 89], "aspect": [49, 64, 89], "basic": [49, 52, 74, 76], "secret": 49, "measur": 49, "metric": 49, "puzzl": [49, 89], "web": 49, "view": 49, "199": [49, 84], "perspect": 49, "captur": 49, "profound": 49, "ground": [49, 89], "intric": [49, 74, 89], "storag": [49, 64], "subtleti": 49, "pronounc": 50, "dataset": 50, "autocomplet": 50, "spellcheck": 50, "void": [50, 51, 56], "startswith": 50, "spell": [50, 52], "special": [50, 52], "flag": [50, 51, 52], "successfulli": [50, 61, 67], "expect": [50, 61, 66, 69, 86, 87, 88], "trienod": [50, 51, 52], "is_end_of_word": [50, 51, 52], "mark": [50, 51, 52, 61, 65, 66, 68, 69], "confirm": 50, "appl": 50, "app": [50, 84], "share": 50, "auto": [50, 51, 84], "suggest": [50, 51, 86], "support": [51, 54, 56, 57], "worddictionari": 51, "addword": 51, "dot": 51, "25": [51, 84], "queri": [51, 68], "wildcard": [51, 54], "partial": [51, 64], "fuzzi": 51, "bad": 51, "dad": 51, "mad": 51, "pad": 51, "exact": 51, "bed": 51, "bet": 51, "etc": [51, 52], "search_help": 51, "trie": [51, 52, 54, 87], "public": [51, 64, 85], "l": [51, 52], "exponenti": [51, 60, 61], "system": [51, 75, 76], "deleteword": 51, "board": [52, 54, 61], "cell": [52, 61, 66, 69, 84], "horizont": [52, 61, 66], "neighbor": [52, 61, 64, 65, 66, 67, 68, 69, 72, 76], "sure": 52, "backtrack": [52, 60, 61, 69], "bound": [52, 61], "prevent": [52, 61, 65, 67], "revisit": [52, 61, 65], "restor": [52, 61], "prune": [52, 61], "findword": 52, "curr_nod": 52, "stop": [52, 60, 75], "temp": [52, 75], "buildtri": 52, "dimens": [52, 61, 66, 69], "grid": [52, 61, 63, 66, 69], "built": 52, "reus": [52, 84], "board1": [52, 61], "r": [52, 69], "f": [52, 61, 77, 84], "v": [52, 64, 65, 67, 68, 72], "words1": [52, 72], "oath": 52, "pea": 52, "rain": [52, 69], "board2": 52, "words2": [52, 72], "abcb": [52, 61], "row": [52, 66, 69], "column": [52, 66, 69], "influenc": [52, 60], "2d": [52, 54, 61, 66, 69], "208": [53, 54, 87], "211": [53, 54, 87], "212": [53, 54, 84, 87], "ii": [53, 54, 78, 81, 87], "challeng": [54, 74], "excel": [54, 59, 89], "testament": [54, 89], "lai": [54, 59], "adventur": [54, 74], "throughout": [54, 74], "trusti": 54, "companion": 54, "natur": [54, 85, 89], "pose": 54, "prowess": [54, 89], "appreci": [54, 63, 86], "beauti": [54, 74], "game": [55, 80, 87], "turn": 55, "heaviest": 55, "smash": [55, 59], "y": [55, 69], "destroi": 55, "rule": [55, 69, 72, 74], "happen": [55, 88], "heapq": [55, 56, 57], "laststoneweight": 55, "negat": 55, "max_heap": 55, "heapifi": 55, "heappop": [55, 56, 57], "new_ston": 55, "heappush": [55, 56, 57], "librari": 55, "stones1": 55, "stones2": 55, "rest": [55, 77], "enough": 55, "linearithm": 55, "medianfind": 56, "addnum": 56, "findmedian": 56, "accept": [56, 85], "99": [56, 84], "deal": 56, "ask": [56, 60, 66, 77, 79, 80, 81, 82, 83, 87], "precis": 56, "small_half": 56, "large_half": 56, "rebal": 56, "access": [56, 84], "kthlargest": 57, "whenev": 57, "kept": 57, "discard": [57, 63], "scalabl": 57, "modul": [57, 61, 84], "min_heap": 57, "1th": 57, "update_k": 57, "lifetim": 57, "703": [58, 59], "stream": [58, 59, 87], "1046": [58, 59], "stone": [58, 59, 74], "weight": [58, 59], "295": [58, 59, 87], "median": [58, 59, 87], "swift": 59, "facilit": 59, "wield": 59, "groundwork": 59, "mirror": [59, 89], "domain": 59, "priorit": 59, "pleasur": 59, "alli": 59, "candid": 60, "unlimit": 60, "150": [60, 84], "40": [60, 84], "combinationsum": 60, "invalid": [60, 72], "dedupl": 60, "respons": [60, 86, 88], "anyth": 60, "candidates1": 60, "candidates2": 60, "candidates3": 60, "much": [60, 67, 69, 86], "faster": 61, "imposs": [61, 67], "mention": [61, 65, 72, 86], "temporarili": 61, "tmp": 61, "four": [61, 66], "signatur": 61, "member": [61, 85], "marker": 61, "propag": 61, "word1": [61, 72], "word2": [61, 72], "word3": 61, "random": 61, "39": [62, 63, 84, 87], "79": [62, 63, 87], "enabl": 63, "combinatori": 63, "those": [63, 67, 77, 85], "filter": 63, "hidden": [63, 89], "moment": [63, 86], "tip": 63, "ventur": [63, 74], "capabl": 63, "unlock": [63, 89], "grab": 63, "interpret": 63, "editor": [63, 86], "undirect": [64, 65, 70, 71, 87], "copi": [64, 71, 86], "unord": 64, "finit": [64, 66], "relationship": [64, 67, 71, 72, 89], "entri": 64, "separ": [64, 68], "compos": 64, "establish": 64, "cyclic": 64, "clonegraph": 64, "original_nod": 64, "copy_nod": 64, "look": [64, 69, 86], "intact": 64, "get_adjacency_list": 64, "get_node_and_neighbor": 64, "adjlist1": 64, "adjlist": 64, "adj": 64, "cloned_node1": 64, "cloned_adjlist1": 64, "adjlist2": 64, "node1": 64, "cloned_adjlist2": 64, "fall": 64, "infinit": 64, "subset": 64, "label": [65, 67], "thu": [65, 75], "circuit": 65, "piec": 65, "arrang": [65, 76], "seri": [65, 85], "validtre": 65, "adj_list": 65, "u": 65, "parent": 65, "reachabl": [65, 69], "accomplish": [65, 67], "edges1": [65, 68], "edges2": [65, 68], "span": 65, "mst": 65, "kruskal": 65, "prim": 65, "reinforc": 65, "land": 66, "surround": [66, 69], "300": [66, 78, 87], "diagon": [66, 69], "wrap": [66, 84], "around": [66, 85], "clarifi": [66, 85], "graph": [66, 67, 69, 72], "extent": 66, "unvisit": [66, 68], "essenc": [66, 89], "numisland": 66, "num_island": 66, "col": 66, "dr": 66, "dc": 66, "boundari": [66, 74], "grid1": 66, "grid2": 66, "numcours": 67, "prerequisit": [67, 86], "ai": 67, "bi": 67, "finish": 67, "taken": [67, 77], "dequ": [67, 72], "canfinish": 67, "in_degre": [67, 72], "degre": [67, 72], "topolog": [67, 72, 89], "popleft": [67, 72], "were": [67, 75, 76, 85], "brief": 67, "numcourses1": 67, "prerequisites1": 67, "sol": [67, 75], "numcourses2": 67, "prerequisites2": 67, "outgo": 67, "durat": 67, "countconnectedcompon": 68, "counter": 68, "hasn": 68, "disconnect": 68, "rectangular": 69, "island": [69, 70, 71, 87], "border": 69, "ocean": [69, 71], "ocea": 69, "touch": 69, "partit": 69, "matrix": [69, 71, 82, 87], "sea": [69, 71], "coordin": 69, "receiv": [69, 72], "lot": 69, "north": 69, "south": 69, "east": 69, "west": 69, "r_i": 69, "c_i": 69, "contact": [69, 75, 76], "rainwat": 69, "send": 69, "classic": [69, 75, 77], "pacificatlant": 69, "matric": 69, "pacific_reach": 69, "atlantic_reach": 69, "dx": 69, "dy": 69, "new_x": 69, "new_i": 69, "heights1": 69, "heights2": 69, "big": 69, "notat": 69, "133": [70, 71, 87], "clone": [70, 71, 79, 80, 81, 82, 83, 86, 87], "417": [70, 71, 87], "pacif": [70, 71, 87], "atlant": [70, 71, 87], "flow": [70, 71, 87], "207": [70, 71, 87], "cours": [70, 71, 87], "schedul": [70, 71, 87], "323": [70, 87], "261": [70, 87], "social": [71, 85, 89], "rout": 71, "model": 71, "entiti": [71, 89], "theori": [71, 74], "equip": [71, 89], "interconnect": [71, 74, 89], "178": 71, "grappl": 71, "region": 71, "academ": [71, 89], "curriculum": 71, "3651": 71, "analysi": [71, 86, 89], "geograph": 71, "student": 71, "profession": [71, 75, 76, 85], "hone": [71, 89], "latin": 72, "alphabet": [72, 74], "lexicograph": [72, 74], "deriv": 72, "normal": [72, 84], "rank": 72, "human": 72, "situat": 72, "inconsist": 72, "instruct": 72, "adher": [72, 75, 86, 87, 89], "alienord": 72, "min_length": 72, "kahn": 72, "preced": 72, "success": 72, "wrt": 72, "wrf": 72, "er": 72, "ett": 72, "rftt": 72, "wertf": 72, "wrtef": 72, "zx": 72, "Be": [72, 86], "269": [73, 87], "alien": [73, 87, 89], "demand": 74, "rich": 74, "landscap": [74, 89], "confront": 74, "convent": [74, 89], "892": 74, "celesti": [74, 89], "enigmat": 74, "propel": [74, 89], "extraterrestri": 74, "deciph": [74, 89], "govern": 74, "script": 74, "cosmic": 74, "underli": [74, 89], "progress": [74, 89], "constel": 74, "night": [74, 75, 76, 89], "sky": [74, 89], "emerg": 74, "stretch": 74, "muscl": 74, "unchart": 74, "territori": 74, "rob": [75, 76], "street": [75, 76], "monei": [75, 76], "stash": [75, 76], "secur": [75, 76, 85], "automat": [75, 76], "polic": [75, 76], "broken": [75, 76], "tonight": [75, 76], "alert": [75, 76], "400": 75, "earn": 75, "trigger": [75, 76], "stolen": 75, "curr": [75, 76], "assign": [75, 77], "alarm": 75, "circl": 76, "That": 76, "meanwhil": 76, "twist": 76, "implic": 76, "vice": 76, "versa": 76, "illustr": [76, 89], "simple_rob": 76, "robberi": 76, "case1": 76, "case2": 76, "steal": 76, "instanti": 76, "sacrif": 76, "accommod": 76, "staircas": 77, "shown": 77, "climbstair": 77, "dp": 77, "70": [78, 87], "climb": [78, 87], "stair": [78, 87], "198": [78, 87], "hous": [78, 87], "robber": [78, 87], "213": [78, 87], "647": [78, 84, 87], "91": [78, 87], "322": [78, 87], "coin": [78, 87], "152": [78, 87], "139": [78, 84, 87], "cover": [79, 80, 81, 82, 83, 87], "strong": [79, 80, 81, 82, 83, 87], "62": [79, 87], "1143": [79, 87], "download": [79, 80, 81, 82, 83, 87], "local": [79, 80, 81, 82, 83, 84, 86, 87], "machin": [79, 80, 81, 82, 83, 86, 87], "git": [79, 80, 81, 82, 83, 86, 87], "http": [79, 80, 81, 82, 83, 84, 85, 86, 87], "github": [79, 80, 81, 82, 83, 84, 86, 87, 88], "com": [79, 80, 81, 82, 83, 84, 86, 87, 88], "mohsentabibian": [79, 80, 81, 82, 83, 84, 87, 88], "directori": [79, 80, 81, 82, 83, 87], "cd": [79, 80, 81, 82, 83, 84, 87], "templat": [79, 80, 81, 82, 83, 87, 88], "prefer": [79, 80, 81, 82, 83, 87], "meant": [79, 80, 81, 82, 83, 87], "educ": [79, 80, 81, 82, 83, 85, 87], "guidelin": [79, 80, 81, 82, 83, 87], "53": [80, 87], "55": [80, 87], "jump": [80, 87], "57": [81, 87], "56": [81, 87], "435": [81, 87], "overlap": [81, 87], "252": [81, 87], "room": [81, 87], "253": [81, 87], "48": [82, 87], "imag": [82, 87], "54": [82, 87], "spiral": [82, 87], "73": [82, 87], "191": [83, 87], "338": [83, 87], "190": [83, 87], "268": [83, 87], "miss": [83, 87], "371": [83, 87], "pip": 84, "instal": 84, "upgrad": 84, "book": [84, 89], "ghp": 84, "usr": 84, "lib": 84, "python3": 84, "site": 84, "packag": [84, 89], "docutil": 84, "18": 84, "jinja2": 84, "home": 84, "codespac": 84, "jsonschema": 84, "linkifi": 84, "py": 84, "myst": 84, "nb": 84, "pyyaml": 84, "sphinx": 84, "comment": [84, 85, 86], "copybutton": 84, "extern": [84, 85], "toc": 84, "jupyterbook": 84, "latex": 84, "thebe": 84, "theme": 84, "sphinx_togglebutton": 84, "sphinxcontrib": 84, "bibtex": 84, "multitoc": 84, "attr": 84, "22": 84, "2023": 84, "03": 84, "referenc": 84, "28": 84, "rpd": 84, "uc": 84, "micro": 84, "importlib_metadata": 84, "ipython": 84, "16": 84, "cach": 84, "nbclient": 84, "parser": 84, "nbformat": 84, "ipykernel": 84, "applehelp": 84, "devhelp": 84, "jsmath": 84, "htmlhelp": 84, "serializinghtml": 84, "qthelp": 84, "pygment": 84, "snowballstemm": 84, "babel": 84, "alabast": 84, "images": 84, "markupsaf": 84, "pydata": 84, "14": 84, "pybtex": 84, "setuptool": 84, "68": 84, "wheel": 84, "41": 84, "sqlalchemi": 84, "tabul": 84, "markdown": 84, "mdit": 84, "plugin": 84, "client": 84, "traitlet": 84, "fastjsonschema": 84, "latexcodec": 84, "six": 84, "beautifulsoup4": 84, "charset": 84, "idna": 84, "urllib3": 84, "certifi": 84, "2017": 84, "zipp": 84, "comm": 84, "debugpi": 84, "matplotlib": 84, "inlin": 84, "asyncio": 84, "psutil": 84, "pyzmq": 84, "tornado": 84, "backcal": 84, "decor": 84, "jedi": 84, "pickleshar": 84, "prompt": 84, "37": 84, "exceptiongroup": 84, "pexpect": 84, "parso": 84, "dateutil": 84, "platformdir": 84, "mdurl": 84, "ptyprocess": 84, "wcwidth": 84, "greenlet": 84, "soupsiev": 84, "execut": 84, "asttoken": 84, "pure": 84, "eval": 84, "restart": 84, "kernel": 84, "workspac": 84, "migrat": 84, "_toc": 84, "yml": 84, "traceback": 84, "bin": 84, "sy": 84, "1157": 84, "__call__": 84, "arg": 84, "kwarg": 84, "1078": 84, "rv": 84, "invok": 84, "ctx": 84, "1688": 84, "_process_result": 84, "sub_ctx": 84, "command": 84, "1434": 84, "callback": 84, "param": 84, "783": 84, "__callback": 84, "sphinx_external_toc": 84, "cli": 84, "migrate_toc": 84, "migrate_jupyter_book": 84, "toc_fil": 84, "327": 84, "rais": 84, "malformederror": 84, "32m": 84, "1mrun": 84, "v0": 84, "0m": 84, "34m": 84, "1msourc": 84, "folder": 84, "1mconfig": 84, "_config": 84, "1moutput": 84, "_build": 84, "html": [84, 85], "01mrun": 84, "v5": 84, "00m": 84, "etoc": 84, "master_doc": 84, "intro": 84, "01mmyst": 84, "mdparserconfig": 84, "commonmark_onli": 84, "gfm_onli": 84, "enable_extens": 84, "colon_f": 84, "dollarmath": 84, "substitut": 84, "tasklist": 84, "disable_syntax": 84, "all_links_extern": 84, "url_schem": 84, "mailto": 84, "ref_domain": 84, "highlight_code_block": 84, "number_code_block": 84, "title_to_head": 84, "heading_anchor": 84, "heading_slug_func": 84, "footnote_transit": 84, "words_per_minut": 84, "sub_delimit": 84, "linkify_fuzzy_link": 84, "dmath_allow_label": 84, "dmath_allow_spac": 84, "dmath_allow_digit": 84, "dmath_double_inlin": 84, "update_mathjax": 84, "mathjax_class": 84, "tex2jax_process": 84, "mathjax_process": 84, "math": 84, "output_area": 84, "nbparserconfig": 84, "custom_format": 84, "metadata_kei": 84, "mystnb": 84, "cell_metadata_kei": 84, "kernel_rgx_alias": 84, "execution_mod": 84, "execution_cache_path": 84, "execution_excludepattern": 84, "execution_timeout": 84, "execution_in_temp": 84, "execution_allow_error": 84, "execution_raise_on_error": 84, "execution_show_tb": 84, "merge_stream": 84, "render_plugin": 84, "remove_code_sourc": 84, "remove_code_output": 84, "code_prompt_show": 84, "show": 84, "code_prompt_hid": 84, "hide": 84, "number_source_lin": 84, "output_stderr": 84, "render_text_lex": 84, "ansi": 84, "render_error_lex": 84, "ipythontb": 84, "render_image_opt": 84, "render_figure_opt": 84, "render_markdown_format": 84, "commonmark": 84, "output_fold": 84, "append_css": 84, "metadata_to_fm": 84, "jupyter_cach": 84, "01mbuild": 84, "mo": 84, "00mtarget": 84, "date": [84, 88], "90": 84, "sourc": 84, "01mupdat": 84, "config": 84, "01mread": 84, "35m01": 84, "hash": 84, "01": 84, "cwd": 84, "96": 84, "94": 84, "87": 84, "86": 84, "92": 84, "readm": 84, "35m02": 84, "02": 84, "35m03": 84, "07": 84, "97": 84, "95": 84, "06": 84, "35m04": 84, "04": 84, "27": 84, "35m05": 84, "05": 84, "35m06": 84, "34": 84, "35": 84, "88": 84, "36": 84, "91m": 84, "md": 84, "warn": 84, "header": 84, "h1": 84, "h3": 84, "689": 84, "async_execut": 84, "async": 84, "async_setup_kernel": 84, "contextlib": 84, "__aenter__": 84, "await": [84, 89], "anext": 84, "gen": 84, "async_start_new_kernel_cli": 84, "562": 84, "ensure_async": 84, "kc": 84, "wait_for_readi": 84, "timeout": 84, "startup_timeout": 84, "jupyter_cor": 84, "189": 84, "obj": 84, "jupyter_cli": 84, "_async_wait_for_readi": 84, "msg": 84, "iopub_channel": 84, "get_msg": 84, "channel": [84, 85], "310": 84, "socket": 84, "poll": 84, "cancellederror": 84, "jupyter_book": 84, "301": 84, "build_sphinx": 84, "171": 84, "force_al": 84, "filenam": 84, "329": 84, "builder": 84, "build_upd": 84, "288": 84, "to_build": 84, "302": 84, "updated_docnam": 84, "409": 84, "_read_seri": 84, "docnam": 84, "430": 84, "read_doc": 84, "483": 84, "publish": [84, 85], "document": [84, 86], "reader": 84, "io": 84, "103": 84, "78": 84, "myst_nb": 84, "sphinx_": 84, "create_cli": 84, "83": 84, "__enter__": 84, "start_client": 84, "single_nb_execut": 84, "executor": 84, "58": 84, "executenb": 84, "1305": 84, "notebookcli": 84, "resourc": [84, 86], "km": 84, "173": 84, "run_until_complet": 84, "base_ev": 84, "649": 84, "241": 84, "delta": 84, "compress": [84, 89], "thread": 84, "kib": 84, "mib": 84, "117": 84, "126": 84, "pack": 84, "remot": 84, "resolv": [84, 88], "f40f6c9": 84, "bcf1c22": 84, "gh": 84, "page": 84, "leader": 85, "particip": [85, 86, 87], "commun": [85, 86, 88, 89], "harass": 85, "experi": 85, "everyon": 85, "ag": 85, "bodi": 85, "invis": 85, "disabl": 85, "ethnic": 85, "sex": 85, "characterist": 85, "gender": 85, "socio": 85, "econom": 85, "statu": 85, "nation": 85, "person": 85, "religion": 85, "sexual": 85, "orient": 85, "interact": 85, "healthi": 85, "behavior": [85, 88], "empathi": 85, "kind": 85, "peopl": 85, "Being": 85, "opinion": 85, "viewpoint": 85, "give": [85, 88], "gracefulli": 85, "feedback": [85, 86], "apolog": 85, "mistak": 85, "unaccept": 85, "imageri": 85, "attent": 85, "troll": 85, "insult": 85, "derogatori": 85, "polit": 85, "attack": 85, "privat": [85, 88], "physic": 85, "email": 85, "explicit": 85, "permiss": 85, "inappropri": 85, "fair": 85, "action": 85, "deem": 85, "threaten": 85, "offens": 85, "harm": 85, "edit": 85, "reject": 85, "commit": [85, 86, 88], "wiki": 85, "align": 85, "decis": 85, "mail": 85, "post": 85, "via": 85, "media": 85, "appoint": 85, "onlin": 85, "offlin": 85, "event": 85, "abus": 85, "report": [85, 86, 87], "complaint": 85, "review": [85, 86, 87], "promptli": [85, 88], "fairli": 85, "oblig": 85, "privaci": 85, "incid": 85, "consequ": 85, "unprofession": 85, "unwelcom": 85, "written": 85, "clariti": [85, 89], "unsolicit": 85, "period": 85, "seriou": 85, "sustain": 85, "aggress": 85, "disparag": 85, "avail": 85, "www": 85, "org": 85, "code_of_conduct": 85, "inspir": 85, "mozilla": 85, "ladder": 85, "question": [85, 88], "faq": 85, "translat": 85, "thank": 86, "valuabl": 86, "below": 86, "submit": 86, "bug": 86, "id": 86, "fork": 86, "button": 86, "usernam": 86, "checkout": 86, "style": 86, "meaning": 86, "messag": 86, "collabor": 86, "approv": 86, "contributor": [86, 87], "project": [86, 87], "agre": [86, 87], "serious": [87, 88], "vulner": 87, "believ": 88, "Not": 88, "disclos": 88, "publicli": 88, "team": 88, "titl": 88, "sampl": 88, "clear": 88, "reproduc": 88, "configur": 88, "screenshot": 88, "sensit": 88, "encrypt": 88, "pgp": 88, "acknowledg": 88, "busi": 88, "estim": 88, "timelin": 88, "resolut": 88, "disclosur": 88, "advisori": 88, "credit": 88, "encourag": 88, "exploit": [88, 89], "malici": 88, "recommend": 88, "stai": 88, "latest": 88, "releas": 88, "assist": 88, "regard": 88, "gmail": 88, "greet": 89, "expans": 89, "vast": 89, "tome": 89, "transcend": 89, "danc": 89, "wisdom": 89, "block": 89, "isn": 89, "memor": 89, "syntax": 89, "cultiv": 89, "intuit": 89, "behind": 89, "microcosm": 89, "recogn": 89, "static": 89, "skillfulli": 89, "reveal": 89, "mathemat": 89, "broader": 89, "sight": 89, "portal": 89, "gatewai": 89, "hierarchi": 89, "lexicon": 89, "seem": 89, "daunt": 89, "discern": 89, "prove": 89, "infrastructur": 89, "vessel": 89, "peak": 89, "summit": 89, "rever": 89, "hall": 89, "beacon": 89, "illumin": 89, "train": 89, "razor": 89, "sharp": 89, "narr": 89, "likewis": 89, "transmiss": 89, "aren": 89, "composit": 89, "reson": 89, "luxuri": 89, "necess": 89, "philosophi": 89, "joi": 89, "idiom": 89, "compendium": 89, "theoret": 89, "knowledg": 89, "rigor": 89, "field": 89, "particular": 89, "neatli": 89, "evolv": 89, "unpredict": 89, "laid": 89, "opportun": 89, "mindset": 89, "solver": 89, "relev": 89, "acquir": 89, "transfer": 89, "endeavor": 89, "emphas": 89, "ever": 89, "fellow": 89, "pen": 89, "paper": 89, "discoveri": 89, "expand": 89, "frontier": 89}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"100": [0, 36], "same": [0, 36], "tree": [0, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 54, 65, 87], "test": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "case": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "time": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 36, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "space": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 36, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "complex": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 36, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 74, 75, 76, 77], "analysi": [0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "128": 1, "longest": [1, 16, 17], "consecut": 1, "sequenc": 1, "solut": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 15, 16, 27, 35, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77, 87], "explan": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 28, 29, 30, 31, 32, 33, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "challeng": [1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 23, 24, 25, 27, 29, 31, 32, 35, 37, 39, 40, 41, 43, 44, 45, 47, 49, 50, 51, 52, 55, 56, 57, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 71, 72, 75, 76, 77, 89], "exercis": [1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 15, 16, 17, 18, 21, 24, 25, 29, 31, 32, 37, 39, 40, 41, 43, 44, 45, 47, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "217": 2, "contain": [2, 10], "duplic": 2, "238": 3, "product": 3, "arrai": [3, 8, 9, 24, 25, 87, 89], "except": 3, "self": 3, "242": 4, "valid": [4, 11, 21, 23, 47, 65], "anagram": [4, 6], "347": 5, "top": 5, "k": [5, 33], "frequent": 5, "element": [5, 43, 57], "49": 6, "group": 6, "659": 7, "encod": 7, "decod": 7, "string": 7, "hash": [8, 9, 87], "blind": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87, 89], "75": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87, 89], "leetcod": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "problem": [8, 13, 19, 22, 23, 26, 34, 48, 53, 58, 62, 63, 70, 73, 78, 79, 80, 81, 82, 83, 87], "contribut": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 86, 87], "resourc": [8, 13, 19, 22, 26, 34, 48, 53, 58, 62, 70, 73, 78, 79, 80, 81, 82, 83, 87], "chapter": [9, 54], "1": [9, 78, 85, 87], "introduct": [9, 14, 20, 23, 27, 35, 49, 63, 71, 74, 89], "navig": [9, 20, 23, 27, 35, 49, 54, 59, 63, 71, 74, 89], "terrain": 9, "unveil": [9, 20, 23, 27, 35, 49, 54, 59, 71, 74, 89], "unlock": [9, 23], "python": [9, 14, 20, 27, 35, 49, 54, 59, 63, 71, 74, 89], "11": 10, "With": 10, "most": 10, "water": [10, 69], "125": 11, "palindrom": 11, "15": 12, "3sum": 12, "two": [13, 14, 32, 87], "pointer": [13, 14, 87], "techniqu": 14, "unleash": [14, 20, 35, 54], "effici": [14, 20], "explor": [14, 49, 71, 74], "guid": 14, "principl": 14, "wisdom": [14, 54], "121": 15, "best": 15, "bui": 15, "sell": 15, "stock": 15, "3": [16, 85], "substr": [16, 18], "without": 16, "repeat": [16, 17], "charact": [16, 17], "424": 17, "replac": 17, "76": 18, "minimum": [18, 24], "window": [18, 19, 20, 87], "slide": [19, 20, 87], "approach": 20, "20": [21, 23], "parenthes": [21, 23], "stack": [22, 23, 87], "landscap": [23, 27, 35, 59, 71], "what": [23, 27, 59, 74], "expect": [23, 27, 59], "153": 24, "find": [24, 56], "rotat": [24, 25], "sort": [24, 25, 32, 33], "33": 25, "search": [25, 26, 27, 44, 47, 51, 52, 61, 87], "binari": [26, 27, 37, 38, 39, 40, 41, 42, 44, 45, 47, 87], "await": 27, "141": 28, "link": [28, 31, 34, 35, 87], "list": [28, 29, 30, 31, 32, 33, 34, 35, 79, 80, 81, 82, 83, 87], "cycl": 28, "143": 29, "reorder": 29, "19": 30, "remov": 30, "nth": 30, "node": 30, "from": [30, 39, 56], "end": 30, "206": 31, "revers": 31, "21": 32, "merg": [32, 33], "23": 33, "masteri": [35, 59, 89], "In": 36, "summari": 36, "102": 37, "level": 37, "order": 37, "travers": [37, 39], "104": 38, "maximum": [38, 40], "depth": 38, "105": 39, "construct": 39, "preorder": 39, "inord": 39, "helper": 39, "function": 39, "124": 40, "path": 40, "sum": [40, 60], "probelm": [40, 45, 50, 51, 52, 55, 56, 57, 60, 61, 64, 65, 66, 67, 68, 69, 72, 75, 76, 77], "199": 41, "right": 41, "side": 41, "view": 41, "226": 42, "invert": 42, "230": 43, "kth": [43, 57], "smallest": 43, "bst": 43, "235": 44, "lowest": 44, "common": 44, "ancestor": 44, "297": 45, "serial": 45, "deseri": 45, "572": 46, "subtre": 46, "anoth": 46, "here": 46, "s": 46, "detail": 46, "code": [46, 85, 86, 87, 89], "98": 47, "lush": 49, "canopi": 49, "arbor": 49, "adventur": [49, 89], "208": 50, "implement": 50, "trie": [50, 53], "prefix": [50, 54], "211": 51, "design": 51, "add": 51, "word": [51, 52, 61], "data": [51, 56], "structur": 51, "212": 52, "ii": [52, 76], "power": [54, 59], "tri": [54, 87], "A": [54, 89], "journei": [54, 63], "understand": 54, "essenc": 54, "your": 54, "begin": [54, 63], "1046": 55, "last": 55, "stone": 55, "weight": 55, "295": 56, "median": 56, "stream": [56, 57], "703": 57, "largest": 57, "heap": [58, 59, 87], "prioriti": [58, 59, 87], "queue": [58, 59, 87], "39": 60, "combin": 60, "79": 61, "backtrack": [62, 63, 87], "unravel": 63, "paradigm": 63, "discov": 63, "readm": 63, "solv": 63, "let": 63, "133": 64, "clone": 64, "graph": [64, 65, 68, 70, 71, 73, 74, 87, 89], "178": 65, "200": 66, "number": [66, 68], "island": 66, "207": 67, "cours": 67, "schedul": 67, "3651": 68, "connect": 68, "compon": 68, "an": 68, "undirect": 68, "417": 69, "pacif": 69, "atlant": 69, "flow": 69, "892": 72, "alien": [72, 74], "dictionari": [72, 74], "advanc": [73, 74, 87, 89], "section": 74, "li": 74, "ahead": 74, "hous": [75, 76], "robber": [75, 76], "70": 77, "climb": 77, "stair": 77, "d": [78, 79, 87], "dynam": [78, 79, 87], "program": [78, 79, 87], "2": [79, 85, 87], "how": [79, 80, 81, 82, 83, 87], "us": [79, 80, 81, 82, 83, 87], "disclaim": [79, 80, 81, 82, 83, 87], "greedi": [80, 87], "interv": [81, 87], "math": [82, 87], "geometri": [82, 87], "bit": [83, 87], "manupul": 83, "contributor": 85, "coven": 85, "conduct": [85, 86, 87], "our": 85, "pledg": 85, "standard": 85, "enforc": 85, "respons": 85, "scope": 85, "guidelin": [85, 86], "correct": 85, "warn": 85, "temporari": 85, "ban": 85, "4": 85, "perman": 85, "attribut": 85, "tabl": 86, "content": 86, "wai": 86, "get": 86, "start": 86, "process": 86, "manipul": 87, "secur": [87, 88], "polici": [87, 88], "report": 88, "vulner": 88, "updat": 88, "contact": 88, "cosmo": 89, "foundat": 89, "graphic": 89, "constel": 89, "theori": 89, "The": 89, "apex": 89, "master": 89, "symphoni": 89, "art": 89, "languag": 89, "unit": 89, "bridg": 89, "real": 89, "world": 89, "holist": 89, "odyssei": 89, "beyond": 89, "page": 89, "cosmic": 89}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.intersphinx": 1, "sphinx": 56}})
\ No newline at end of file